can someone help me to exclude below the error.  Thanks in advance  Can't locate XML/Writer.pm in @INC (@INC contains: /home/svceln/usr/lib/perl5/site_perl/5.16.2/x86_64-linux /home/svceln/usr/lib/perl5/site_perl/5.16.2 /home/svceln/usr/lib/perl5/5.16.2/x86_64-linux /home/svceln/usr/lib/perl5/5.16.2 .) at /opt/apps/tomcat_scripts/allocate_ports.pl line 7. BEGIN failed--compilation aborted at /opt/apps/tomcat_scripts/allocate_ports.pl line 7. Error in allocating ports, server.xml cannot run`  The script i am using  #!/home/svceln/usr/bin/perl -w # allocate_ports.pl  # allocate ports, create port_config.xml and write to stdout  use strict; use XML::Writer; use IO::File;enter code here use File::Basename;  my ($increment) = 0; my ($execDir) = dirname($0);  $#ARGV eq 0 or die "Usage: allocate_ports.pl server_name\n";  my ($port_read) = new IO::File ("$execDir/port_increment.txt"); if (defined $port_read) {   while (<$port_read>) {     chomp;     $increment = $_;   }   $port_read->close() or die "Can't close port_increment.txt: $!"; } else {   $increment = 0; }

I get this error:  Can't locate Foo.pm in @INC  Is there an easier way to install it than downloading, untarring, making, etc?


You receive your Hogwarts letter when you're eleven but in the Muggle world, you have to start attending school when you're six or seven. Unlike children from wizarding families, Muggleborns don't know they're wizards or witches, so supposedly they don't sit at home until they're eleven.  So do Muggleborns start studying in a Muggle school and then quit it when they receive their Hogwarts letter?

Most of the wand-carriers that come from a non-Muggle family seem fairly uneducated when it comes to interacting with Muggles.  This implies that they don't go to any type of Muggle school before entering into their education at Hogwarts (or whichever Wizarding school they go to), or else they would at least understand some Muggle culture.  What do children from magical families do before going to Hogwarts if they don't go to a traditional school?  Is there any evidence that they're homeschooled?


If X is a Geometric random variable with parameter p, what value of $$k \in \{1,2,...\}$$ ends up maximizing $$P (X = k) = (1 − p)^{k−1}p$$  I understand this is known as the mode of the distribution, however, when I try graphing this on WolfRamAlpha, I'm still unsure of how to systematically approach this problem.  To try and come out with a solution, I originally tried to take a ratio between $P(X = k + 1)$ & $P(X = k)$ but I am still unsure of what to make of what I got out of it. I just end up getting a ratio such as:  $$\frac{(1-p)^{k}p}{(1-p)^{k-1}p}$$  From here, I am unsure of where to go with my work. I'm also unsure why taking a ratio here would exactly mean anything.

The full question is,     If X is a Geometric random variable with parameter p, what value of k ∈ {1, 2, . . .}   maximizes P(X = k) = (1 − p)^(k-1) * p? This is referred to as the mode of the distribution.   Through trial and error (plugging in random values), I found that p = 1/2 yields the highest value of P(X=k).  Is there a way to figure this out without trial and error?


My table is:     id home datetime player resource     1 10 04/03/2009 john 399   2 11 04/03/2009 juliet 244   5 12 04/03/2009 borat 555   3 10 03/03/2009 john 300   4 11 03/03/2009 juliet 200   6 12 03/03/2009 borat 500   7 13 24/12/2008 borat 600   8 13 01/01/2009 borat 700     I need to select each distinct home holding the maximum value of datetime. Result would be:     id home datetime player resource     1 10 04/03/2009 john 399   2 11 04/03/2009 juliet 244   5 12 04/03/2009 borat 555   8 13 01/01/2009 borat 700     I have tried: -- 1 ..by the MySQL manual:   SELECT DISTINCT   home,   id,   datetime AS dt,   player,   resource FROM topten t1 WHERE datetime = (SELECT   MAX(t2.datetime) FROM topten t2 GROUP BY home) GROUP BY datetime ORDER BY datetime DESC  Doesn't work. Result-set has 130 rows although database holds 187. Result includes some duplicates of home. -- 2 ..join  SELECT   s1.id,   s1.home,   s1.datetime,   s1.player,   s1.resource FROM topten s1 JOIN (SELECT   id,   MAX(datetime) AS dt FROM topten GROUP BY id) AS s2   ON s1.id = s2.id ORDER BY datetime   Nope. Gives all the records. -- 3 ..something exotic:   With various results.


Specs: • CPU: Intel Core Duo T2130 1.86GHz • RAM: 896MB • HDD: 100GB • Graphics hardware: ATI Radeon Xpress 200M    I am new to Ubuntu. Do I need to take care of drivers?

I'm thinking about installing Ubuntu Desktop, but I don't know what flavor is the best for my system. What are the minimum and recommended hardware requirements? What kind of CPU? How much memory? Should I have Hardware Acceleration? What flavor should I use?  This is an attempt of a canonical answer. My answers have the "official  requirements", the recommended are a mix of official sources and opinion based (along with the answer it's told the source). You can comment or edit if you feel that the information is obsolete or incomplete. It is a good rule of thumb that any system capable of running Windows Vista, 7, 8, x86 (Intel) OS X will almost always be a lot faster with any Ubuntu flavor even if they are lower-spec than described below.


I want to restrict a textbox to accept numbers from 1 to 4 and contain dot (.) also in C#. How do I do that?

I have a windows forms app with a textbox control that I want to only accept integer values. In the past I've done this kind of validation by overloading the KeyPress event and just removing characters which didn't fit the specification. I've looked at the MaskedTextBox control but I'd like a more general solution that could work with perhaps a regular expression, or depend on the values of other controls.  Ideally this would behave such that pressing a non numeric character would either produce no result or immediately provide the user with feedback about the invalid character.


When I use a browser, I can "browse in private" if I don't want my browser history recorded on the local machine.  But what if I'm typing commands in the bash shell and maybe passwords, and I don't want that stored in my command history, but at the same time I don't want to wipe out my command history?  Is there a way to do that?

Is there a way to temporarily suspend history tracking in bash, so as to enter a sort of "incognito" mode? I'm entering stuff into my terminal that I don't want recorded, sensitive financial info.


Here is what I get The following packages have unmet dependencies. chrome-remote-desktop : Depends: xvfb but it is not installed Depends: python3-psutil but it is not installed E: Unmet dependencies. Try 'apt --fix-broken install' with no packages (or specify a solution)

I am currently using Ubuntu 10.04. I know there is a 10.10 release, but can I upgrade directly to 11.04? Could you walk me through the steps please?


My laptop has a slightly obscure wifi card and I can't install a driver from the driver management or the USB, and I don't have ethernet. Instead, I found a driver online and it worked on a Live USB because I could install gcc from the USB. However, when I actually installed the OS, I could not start the driver or install gcc!  So, how do I install gcc from a USB or ISO in Kubuntu 15.10.  EDIT:  Another solution I'm open to is to download the packages outside of Kubuntu and then use dpkg -i to install them. In that case I would need someone to list the needed packages and where to download them.

I have a friend who has got a computer that is not connected to the Internet. Is there any way to install software offline easily?


I was studying the formal construction of numbers from $\mathrm{ZF}$, assuming the elements of the naturals being $\{\}, \{\{\}\}$, etc. Given the naturals, its ring properties and arithmetic, we can define the integers being a set of equivalence classes on $\Bbb N^2$. This logic is used from the integers to the complex numbers, so the tear always have sets of equivalence classes. My doubt is: since, for example, $\bigcup \Bbb Z = \Bbb N^2$, isn’t it wrong to formally say that $1_{\Bbb N} = 1_{\Bbb Z}$, that is, $1 \in \Bbb Z$? Since that the only thing we can assume is that there is a bijective map $\Bbb N \mapsto \Bbb Z$ (in fact, they’re both countable).

In most programming languages, integer and real (or float, rational, whatever) types are usually disjoint; 2 is not the same as 2.0 (although most languages do an automatic conversion when necessary). In addition to technical reasons, this separation makes sense -- you use them for quite different purposes.  Why did they choose to say $\mathbb{Z} \subset \mathbb{R}$ in math? In other words, why are 2 and 2.0 considered the same?  When you are working in $\mathbb{R}$, does it make any difference whether some elements, eg. 2.0, also belong to $\mathbb{Z}$ or not?


I have a set of points and a set of lines. I'd like to know distances of the points from the closest line... answering the question "how many points are within 500m to 1000m of one of the lines, how many between 1000m to 2000m, etc."   Distances can be approximate if necessary (i.e. between 500m and 1km as a category) but if it's possible to do something more refined that would be great.  Data is currently in Mapinfo TAB files.   I seek a Mapinfo solution, if possible.  I have a working but very inefficient system just now which looks like this ...  buffer the lines information, creating several files/tables, one for a buffer 500m from line (call this "buffer500m"), one for 1km (buffer1000m), one for 2km etc, then do simple repeated MapInfo SQL queries. With these I select all points within the wider buffer, save this (call this "pointswithin1000m" etc), then from these results again using an SQL select query select those in the narrower buffer and delete these... the result being a file/table with only those points in the wider buffer but not in the narrower one. This has to be repeated for each distance (i.e. once for 500m to 1km, once for 1km to 2km, and so on.   I tried a more sophisticated SQL select to give me those points within the wider buffer but not within the narrower buffer but either this wasn't possible or I didn't get the syntax right.

What is the best method to calculate the distance from the nearest road for a series of address points in QGIS, having a very big dataset? (QGIS 2.0.1, Win XP)  I read the answers to previous similar questions:           Nevertheless:   MMQGIS plugin find the disance to the nearest node of a line network, not the shortest (perpendicular) distance to a line. R and Python proposed scripts correctly works for small datasets and can be implemented in the modeler, however for my job I have 530 points and a regional street layer with about 135'000 features, and cycling through all the features then taking the shortest distance for all points will take an enormous amount of time I have problems in making GRASS work in QGIS 2.0.1 ().


I don't need windows any more, I have 1TB of hard disk and 6gb ram.Please help me out I'm a beginner!

I'd like to see the full How-To on how to use manual partitioning during Ubuntu installation. The existing guides (at least those I found here) cover only automatic part and leave untouched the manual part (or extremely short and contain no pictures).  I'd like to cover such situations:     If your disk contains other systems:


I am using HP 15ab522tx ,after installing Ubuntu 16.04 ,I am not able to fix WIFI issue.Also I tried various answers to this problem.But nothing seem to work for me.Installing BROADCOM driver did not work for me..Please help.  lspci -knn | grep Net -A3; rfkill list   gives:  03:00.0 Network controller [0280]: Broadcom Corporation BCM43142 802.11b/g/n [14e4:4365] (rev 01)     DeviceName: Broadcom BCM43142 802.11 b/g/n 1x1Wi-Fi + BT4.0 M.2 Combo Adapter     Subsystem: Hewlett-Packard Company BCM43142 802.11b/g/n [103c:804a]     Kernel modules: wl 0: hci0: Bluetooth     Soft blocked: yes     Hard blocked: no   List of Wireless Drivers in windows 10 version:   Broadcom Wireless LAN Driver Intel Wireless LAN Drivers Realtek RTL8723BE/RTL8188EE 802.11b/g/n Wireless LAN Drivers

This issue happens only on UEFI systems with enabled Secure Boot.  When I try to install DKMS modules like VirtualBox, Nvidia, or Broadcom drivers, they do not install and I get Required key not available when I try to modprobe them.  VirtualBox complains that vboxdrv is not loaded.  Broadcom wl driver is shown in lspci -k as a kernel module but is not in use. sudo modprobe wl throws Required key not available.  Also this issue may happen when I install some kernel modules from git sources.  This issue may appear after a kernel update as disabled wireless adapter, black screen after a reboot, etc.   How can I fix it?


Let's say  this code is executed after press the submit button in a form with purposes of sanitization:   <?php $yourname = check_input(filter_input(INPUT_POST, 'yourname', FILTER_SANITIZE_STRING)); $email = check_input(filter_input(INPUT_POST, 'email', FILTER_SANITIZE_EMAIL)); $likeit = check_input(filter_input(INPUT_POST, 'likeit', FILTER_SANITIZE_STRING)); $comments = check_input(filter_input(INPUT_POST, 'comments', FILTER_SANITIZE_STRING));  function check_input($data) {     $data = trim($data) . stripslashes($data) . htmlspecialchars($data);     return $data; } ?>   Taking in account that the filter_input function is being applied, is the check_input($data) function redundant in this case?

Is there a catchall function somewhere that works well for sanitizing user input for SQL injection and XSS attacks, while still allowing certain types of HTML tags?


I have a HP Elite book 840G3 laptop with Windows installed in the primary drive and Ubuntu installed in the second drive. What is to be done to get to pick the operating system option on starting up.   Right now I press Esc on startup and pick the needed drive from the BIOS Boot Menu screen.

I have installed Ubuntu 15.10 alongside Windows 10 with UEFI. To install Ubuntu, I chose the option install alongside Windows 10 or something similar to this. Then I created a new partition for Ubuntu and installed it. After installation, the boot menu did not show up. Initially I thought Ubuntu has not been installed, but when I plugged in the USB drive and wanted to install Ubuntu I saw an option of reinstalling Ubuntu on my machine. So, I found out that Ubuntu is installed. Pressing F8 and F12 also does not help. Can anyone help me bring up the GRUB boot menu? In Windows, I also entered the command bcdedit /set {bootmgr} path \EFI\ubuntu\grubx64.efi in cmd, but still the boot menu does not show up.  Reply (Himanshu) : Just boot in bios and, if you can, add boot option with name say ubuntu and path EFI/ubuntu/shimx64.efi. No need for live PCB or anything. Move the boot option to top. This is for dell GUI bios but I assume it works for all. Or you may want to see  or , where you can enable Windows Boot Loader for one boot or forever as you wish, and boot Ubuntu from it. If you want now, you can use the installed Ubuntu terminal to use the commands update-grub to use GRUB instead. (Not enough reputation to answer properly btw.)


I have a snippet of code (below) that when run, will (ideally) fill an app array to look something like this:  Header 1:  App 1  App 2  Header 2:  App 3  App 4  etc.  However, when I run it in my emulator, it produces this:  Header 1:  App 1  App 2  App 3  App 4  ...  Header 2:  App 1  ...  I'm not sure why this happens, as I have looked up the defaults and everywhere I look, people say that Java defaults to passing by value, not by reference. If this is true, how come it adds every app to every category?  Preconditions:  Store is defined as a list of class "App", each element containing a header and title, among other things.  ListDataChild is an empty hashmap, with types > to be filled by the loop and then outputted via an expandable list view. I would post the code for the view, but it is very bulky and long so I'll just add a simple testing algorithm at the end.  EmptyList is just that, a list of type  that has nothing inside (at least to begin with? Could it be changing?)  Code:      listDataChild = new HashMap<String, List<App>>();      List<App> emptylist = new ArrayList<>();     List<App> Store = synced.getAppStore();      Boolean juststarted = true;      for (App el : Store)     {         if (juststarted)         {             juststarted = false;             listDataChild.put(el.getHeader(), emptylist);             listDataChild.get(el.getHeader()).add(el);         } else {             if (listDataChild.containsKey(el.getHeader())) {                 listDataChild.get(el.getHeader()).add(el);             } else {                 listDataChild.put(el.getHeader(), emptylist);                 listDataChild.get(el.getHeader()).add(el);             }         }     }     //TESTING     for (String header : listDataChild.keySet())     {         for (int j = 0; j < listDataChild.get(header).size(); j++)         {             System.out.println("HashMap at " + header + ", " + j + ": " + listDataChild.get(header).get(j).getTitle());         }     }   App.Java:  public class App {     public String header,title,link,url,redirect,icon;     public Double order;     public Boolean selected;      public App() {         header = "";         title = "";         link = "";         url = "";         redirect = "";         icon = "";         order = 0.0;         selected = false;     }      public int compareTo(App another) {         if (this.getOrder()<another.getOrder()){             return -1;         }else{             return 1;         }     }      public void setHeader(String h) {         header = h;         return;     }      public void setTitle(String t) {         title = t;         return;     }      public void setLink(String l) {         link = l;         return;     }      public void setUrl(String u) {         url = u;         return;     }      public void setRedirect(String r) {         redirect = r;         return;     }      public void setIcon(String i) {         icon = i;         return;     }      public void setOrder(Double o) {         order = o;         return;     }      public void setSelected(Boolean s) {         selected = s;         return;     }             public String getTitle()     {         return title;     }      public String getHeader()     {         return header;     }      public Double getOrder()     {         return order;     }   }   Thanks in advance!

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


I have downloaded multiple files that have 500GB in total but my 1 TB hard drive is already full. What is happening?

How can I visualize which folders and files are taking up all of the space on my hard drive?  I'm getting some conflicting reports on the size of hard drive contents. Namely what is and isn't there and what folders are actually using the space.   I need to know which of the files or folders the culprits behind all this hidden bloat. Also there should be a print option to get it on paper.


For some reason I am unable to use  on Stack Overflow. Does anyone know why this happens, and how to fix/get round it? Is it a website error?  To clarify, it allows me to type it in on the tags, but as soon as I save edits or post the question the tag disappears?

What are tag synonyms? How can tag synonyms be distinguished from "real" tags? How are new tag synonyms created? Who can create tag synonyms? How can I delete/reverse/undo bad tag synonyms? What are merged tags?


I couldn't gush over him enough    I can't gush over him enough        Which one is correct and why?

When should I use can? When should I use could? What is right under what context?


I tried solving by using $\log$ and got $\log(a)/n = \log (1)$ which after applying limit (of $n \to \infty$) gives $0= \log(1)$. Is this right?

Prove that $\lim_{n \to \infty} \sqrt[n]a = 1$ using only the basic properties of sequences  I don't have an idea on how to tackle this problem - I thought about the Squeeze Theorem but I can't think of a sequence of n which approaches 1.  Could you give me some hints on how to solve this? If it is possible, please, choose the least sophisticated method to solve this as I am entirely new to Calculus.


Could not find this item. This is no longer located in C:\Users\(censored)\Desktop. Verify the item's location and try again.  I have tried different solutions from people who have also had the same issue, but none of them have worked. Something to note: the folder has a space at the end.

I'm trying to delete a folder in Windows 7 and get a perplexing error message: "Could not find this item:  This is no longer located in G:\Graphics.  Verify the item's location and try again.  I can see the folder -- I can find it.  I just can't delete it.    I also get a second error message (sometimes) when I click on the folder: G:\Graphics 2009-11-17 refers to a location that is unavailable...this information might have been moved to a different location.    I'm using Windows 7; this folder is on an external hard drive.  I've emptied the folder (there were items in it); I've scanned that external hard drive for errors.  Trying to rename the folder yields the same enigmatic error message.    Is there a way to delete this folder?


Because wireless audio through Bluetooth is usually slightly delayed, so when a Bluetooth earphone is used, is the audio and video slightly out of sync for:   YouTube videos Videos in general, such as Facebook videos, and movies on iTunes What if Apple's own Airpods is used, is it optimized for (1) and (2) above?

If it is a song, and it is delayed for 0.5 or 1 second, it really does not matter.  What I am trying to find out is for games and videos. If there is a 0.5 second audio delay, for videos (movies or youtube if video/audio is unsync’ed) or for games, then it could be a bigger problem.


The federal government limits how much I can put into a 401(k) per year.  For 2017, I think it's $18,000.  Is this just my contributions, or does it count employer matching?

I am 29 years old and have a 401(k) already with my company. I just started contributing 10% to my 401(k), up from my 8%. My company does not match but they do put 10% of my salary into my 401(k) as their contribution every February, once per year. I make between 95k and 110k a year and as stated started to put 10% of my pay into my 401(k). My current 401(k) balance is at $53k-ish.  My question is: When do I max out in the year 2012? I read at $17,000, but does that cover only my contributions, or both mine and my employer's? If I do max out with mine and my employer's, how do I know that, and how will I be notified? If I do max out, what do I do with the extra funds beyond the max? Should I put that into a Roth IRA? I am concerned as I get paid more year after year when I will be maxed out. What penalties or options do I have?  Thanks in advanced for the information and I look forward to reading more on this forum!


I need to prove that $(\mathbb{Z}_2,+)\times (\mathbb{Z}_2,+)$ is a group. Now, I am familiar with the conditions of being a group, but still, I can't see how can I show that she has a natural number, the existence of opposite numbers, etc... My idea by intuition was to show that  $(\mathbb{Z}_2,+)$ is a group, and therefore his cartesian product by itself is a group, but I don't know of such theorem. Thanks!

I am trying to prove the following and am looking toward the math.stackexchange community to comment on whether I am on the right track or not. Thank you in advance.    Let $n \geq 1$ be an integer. Suppose $\{G_1,...,G_n\}$ is a finite set of groups. Define the set $G = G_1 \times G_2 \times ... \times G_n$ of ordered n-tuples $(g_1,g_2,...,g_n)$ where $g_i \in G_i$. Show that the operation $\bullet$: $G \times G \rightarrow G$ given by $(g_1,g_2,...,g_n) \bullet (g'_1,g'_2,...,g'_n) = (g_1g'_1,g_2g'_2,...,g_ng'_n)$ makes $G$ into a group.    Proof of associativity: $((g_1,g_2,...,g_n) \bullet (g'_1,g'_2,...g'_n)) \bullet (g''_1,g''_2,...,g''_n)$ = $(g_1g'_1,g_2g'_2,...,g_ng'_n) \bullet (g''_1,g''_2,...,g''_n) $ = $(g_1g'_1g''_1,g_2g'_2g''_2,...,g_ng'_ng''_n)$ = $(g_1,g_2,...,g_n) \bullet (g'_1g''_1,g'_2g''_2,...,g'_ng''_n) = (g_1,g_2,...,g_n) \bullet ((g'_1,g'_2,...,g'_n) \bullet (g''_1,g''_2,...,g''_n))$  \  Proof of the existence of an identity For each $G_i \in G$, take its identity element $e_i$ and multiply it as follows: $(g_1,g_2,...,g_n) \bullet (e_1,e_2,...,e_3)$ = $(g_1,g_2,...,g_n)$.  \  Proof of the existence of an inverse: Since each $G_i \in G$ is a group, simply takes its multiplicative inverse $g_i^{-1}$ and multiply it: $(g_1,g_2,...,g_n) \bullet (g_1^{-1},g_2^{-1},...,g_n^{-1}) = (e_1,e_2,...,e_n)$.


First of all, thx for this site. It's great for me. I read it everyday, because I want to grow up my english skills. I'm from Poland btw. :)  My question is this:  What does it mean 'ain't'? I don't understand this language-tool. Could U explain it to me? I will be very greatfull! :)

What does the contraction ain't mean? Is it appropriate to use it in formal settings?


As seen in the picture the milestone looks smashed up and strange, how can I fix this while still having the dates. I want to also have the dates there, as the regular one with all the dates takes to much room. I am open for other similar solutions for the chart.  \noindent\resizebox{\textwidth}{!}{ \ganttset{calendar week text= \small {\startday}} \begin{ganttchart}[ hgrid,x unit=1.5mm, hgrid style/.style={draw=black!5, line width=.75pt}, vgrid={*{6}{draw=none},dotted}, time slot format=little-endian, ]{01.03.18}{20.06.18} \gantttitlecalendar{ month=shortname,week=4} \\ \ganttmilestone{Forprosjekt}{03.03.18}\\ \ganttbar{Task A}{03.03.18}{03.05.18}\\ \ganttbar{Task A}{03.03.18}{03.05.18} \end{ganttchart} }

So: I have a Gantt chart created with pgfgantt where in order to fit my pages I have included  x unit=1.4cm,y unit chart=6mm   in its preamble.  This means that milestone shapes are spread out horizontally.  How can I change the vertical and horizontal units of a Gantt chart in a way which doesn't affect the aspect ratios of elements like milestones?


When I render there seems to be no lighting in the scene.  Here's a link to download the files

So I am working on something based on a tutorial . I am trying to finish my project and render it, but it only renders the main object (image 2), which is the lightsaber. It wont render the laser or the ground. Although I can see this in the render preview (image 1) What can/do I have to do to change this?  image 1 (render preview)   image 2 (complete render)


I need some help, in my database I have a relation many to many, so I created an aux table to make 1 to many relationship, the tables are the next.  offices           request        request_x_offices -------          ---------       ------------------  id               id              id_request office_name      name            id_office   So when i do a query to request_x_offices i get some like the next  request_x_offices ----------------- id_request| id_office ----------------- 1   1 1   2 1   3 1   4 1   5  2   1 2   2  2   3    etc...   after I do a JOIN to replace the offices_id by the name of the office and I get the next  id_request|office_name ----------------- 1 | office_name1 1 | office_name2 1 | office_name3 2 | office_name1 2 | office_name3 2 | office_name5   But I want to get something like the next.  ------ id_request|office_name 1 |office_name1, office_name2, office_name3 2 |office_name1, office_name3, office_name5   I tried do a coalesce but I only get a single row with all the office_name of all the id's :(  Any help will be appreciated, thanks for you time guys.

Consider a database table holding names, with three rows:  Peter Paul Mary   Is there an easy way to turn this into a single string of Peter, Paul, Mary?


I have two variables $a and $b, I want to check if either of the two variables is an associative array and iterate through the one that is associative array. Have tried to do something like this : $a = "string"; $b = array('the key' => 'the value');  $array = (is_assoc($a xor $b)) ? true : false; if($array) {     foreach($array as $key => $value) { echo $key . ":" . $value; } }  But am getting error that is_assoc is an undefined function and also in my foreach loop error says expect iterable but found bool. So basically what i want to do :  Check if either of the variable is an associative array Return which one is associative array iterate through the result from 2  Php

PHP treats all arrays as associative, so there aren't any built in functions. Can anyone recommend a fairly efficient way to check if an array contains only numeric keys? Basically, I want to be able to differentiate between this: $sequentialArray = [     'apple', 'orange', 'tomato', 'carrot' ];  and this: $assocArray = [     'fruit1' => 'apple',     'fruit2' => 'orange',     'veg1' => 'tomato',     'veg2' => 'carrot' ];


I've tried to run in the command line the following command:  sudo apt-get upgrade , but I get this message:  The following packages have unmet dependencies:  idle : Depends: idle-python3.6 but it is not installed  What should I do????

I have a problem with python3.6 idle. I think I installed some package in the past and since then I have a problem installing other problems because whatever I try to install it shows me the same error, even if I try to unistall python it shows me this:  idle : Depends: idle-python3.6 but it is not going to be installed   I've tried to unistall python but I got this error. What should I do???


From what I understood, cardinal numbers are defined as:  $\aleph_0$ = the cardinality of $\mathbb{N}$ $\aleph_{n+1}$ = is the least cardinal number greater than $\aleph_n$  The continuum hypothesis states that the cardinality of $\mathbb{R}$ is  $\aleph_1$. I more or less understand this cannot be proven (does not follow from ZFC).  However, can it be proven dat there in fact is a 'least cardinal number' greater than $\aleph_0$?  Is it possible that there are sets with cardinality $\aleph_{1/2}$, $\aleph_{1/3}$, et cetera, so to speak?  Or expressed differently: is it possible that for every set A with cardinality CA > $\aleph_0$, there exists another set B with cardinality CB where CA > CB > $\aleph_0$?

Is there any meaningful definition to afford for $\aleph_r$ (as in cardinality) where $r\in\mathbb{R}^+$? $r\in\mathbb{C}$? What about $\aleph_{\aleph_0}$? Can we iterate this? $\aleph_{\aleph_{\aleph_{\cdots}}}$  I may be throwing in bunch of rather naive/basic questions, for I haven't learnt much about infinite cardinalities. If I am referring to bunch of stuff abundantly dealt in established areas, please kindly point out.


Do we have a way to permanently delete posts? My mobile browser accidentally submitted a half-answer on  question, and in a fit of idiocy I wrote another answer from scratch and 'deleted' the old one. I'd love it if the answer were actually deleted, as it contains basically no value, rather than hidden. Is this a thing we do, or should do? Will the garbage collector come and delete it on its own?

What circumstances can cause a question or answer to be deleted, and what does that actually mean?    How can a post be deleted? When can't I delete my own post? Can I still see my post even after it's deleted? Can I see a list of my deleted posts? How can I undelete one of my posts? What does deletion mean for a post? How do votes to delete work? What are the criteria for deletion? What else should I know about deleted posts? If I flag my question with a request to delete it, what will happen?       For more information, see the articles about  and  in the .


I am trying to test for a clown fish in a players hand, and because they don't have their own ID I have to get into data values with /testfor. Here is the command I have, how do I fix it?  /scoreboard players set mookooy dadfish 1 {Inventory:[{id:"minecraft:fish"},{damage:2c}]}

Let's say I want to track a group of players to see which one of them (if any) have a specific block type in their inventory that's of a specific datavalue; for instance Red Wool (minecraft:wool with a data value of 14).  I already know how to detect if a player has any wool in their inventory: /testfor @a {Inventory:[{id:"minecraft:wool"}]}. However, this doesn't discriminate between the various colours.  It'll find anyone with any colour wool, whereas I want to find only players with red wool.  I've tried modifying the data tag to also include a data value, such as /testfor @a {Inventory:[{id:"minecraft:wool",data:14}]} but this results in unmatched NBT tags and the  error message <Player> did not match the required data structure.  Obviously it's because data (or Data, damage, dataID, etc.) isn't the name of the NBT tag, or that the structure is wrong.  I realize I can accomplish this using the /clear command, but that's a bit clunky when running on a 20Hz /fill clock.  How can I filter out specific data values when using the /testfor or /scoreboard players commands?


from functools import reduce     for j in gpw_ticker:     try:         zadl = pd.read_csv(r'C:\Users\AdamPer\Desktop\Python\Valueinvesting\zadluzenie\zadluzenie_{}.csv'.format(j))         war_ryn = pd.read_csv(r'C:\Users\AdamPer\Desktop\Python\Valueinvesting\wart_rynkowa\wart_rynkowa_{}.csv'.format(j))         rento = pd.read_csv(r'C:\Users\AdamPer\Desktop\Python\Valueinvesting\rentownosc\rentownosc_{}.csv'.format(j))         plynn = pd.read_csv(r'C:\Users\AdamPer\Desktop\Python\Valueinvesting\plynnosc\plynnosc_{}.csv'.format(j))         dfs = [zadl, war_ryn, rento, plynn]         df = reduce(lambda left, right: pd.merge(left, right, on = 'rows', how = 'outer'), dfs)         df.to_csv(r'C:\Users\AdamPer\Desktop\Python\Valueinvesting\baza\{}.csv'.format(j), index = False)     except Exception as e:         print(j, str(e))   It works quite well but the problem occurs when file does not exist:    I want to skip non-existing files and merge the other. So for ALR I want to merge zadl, war_ryn and rento and skip plynn because it doesn't exist.  Should I first check if each file exists and then merge?

How do I check whether a file exists or not, without using the  statement?


Gallian 12.8: Show that a ring is commutative if $ab=ca \implies b=c$ when $a\neq 0$.   It's an odd statement. I tried to approach the problem by proving it directly or by contradiction, but I honestly got nowhere. Looking forward to some hint.

Show that a ring is commutative if it has the property that ab = ca implies b = c when $a\neq 0$.   This is my proof to show that a ring is commutative if it has the property that ab = ca implies b = c.  We need to show that if x, y ∈ R then xy = yx. Let a = x, b = yx and c = xy. Then ab = x(yx) = (xy)x = ca. Thus, by the hypothesis, b = c, or xy = yx. Thus, for x, y ∈ R we have xy = yx.   How would I show when $a\neq 0$?


I have installed ubuntu13.10. My sound card is not having any problem as start up sound was very clear. Bt when I played songs and movies an error occurred giving that mp3 decoder is not present. So which type of driver or software do I need install now.

I would like to install the restricted extras package, which I didn't select during the install. How can I do that?        is a meta-package that installs:         Support for MP3 and unencrypted DVD playback   Microsoft TrueType core fonts   Flash plugin   codecs for common audio and video files


I'm trying to make file input using html and ajax. My idea is to get the file from the file input and pass this file to another page by ajax. function buscar_foto(input) {         if (input.files && input.files[0]) {             var reader = new FileReader();              reader.onload = function(e) {                 $('#id_image_cracha').attr('src', e.target.result);             }              reader.readAsDataURL(input.files[0]);         }          $.ajax({             type: "POST",             dataType: 'json',             url: "/cracha/aplicar_foto_busca/",             data: {                 'csrfmiddlewaretoken': '{{ csrf_token }}',                 'cracha_id': $("#id_cod").val(),                 'file_image': reader,             },             //success: function(response) {                 //window.location.reload();             //}         });     }  This is the code, at the part where I wrote e.target.result, the browser is returning me this error:  Uncaught TypeError: Cannot read property 'target' of undefined at reader.onload ((index):1930) at e (jquery-2.1.4.min.js:4) at Ab (jquery-2.1.4.min.js:4) at Ab (jquery-2.1.4.min.js:4) at Function.n.param (jquery-2.1.4.min.js:4) at Function.ajax (jquery-2.1.4.min.js:4) at buscar_foto ((index):1936) at HTMLInputElement.onchange ((index):379)  Does anyone know how can i solve it?

I would like to upload a file asynchronously with jQuery.     $(document).ready(function () {     $("#uploadbutton").click(function () {         var filename = $("#file").val();          $.ajax({             type: "POST",             url: "addFile.do",             enctype: 'multipart/form-data',             data: {                 file: filename             },             success: function () {                 alert("Data Uploaded: ");             }         });     }); });  File <input type="file" id="file" name="file" size="10"/> <input id="uploadbutton" type="button" value="Upload"/>     Instead of the file being uploaded, I am only getting the filename. What can I do to fix this problem?


A spaceship went awry and traveled to the far future. The few people aboard find themselves looking at a gray, steamy Earth. A landing party explores a relatively cool region (Alaska?) and finds it covered with a silicon- and metal-based ecology with plant and animal equivalents. The POV shifts back and forth between the landing party and an intelligent humanoid machine living with his wife in a cave. She spends most of her time in the cave building their child from parts that he forages from the mechanical forest, though some parts they have to make/grow(?) themselves. The landing party encounters them, at first it's rough and the mechanical man defends his wife, and then they come to some sort of understanding and the landing party leaves. The humans speculate that after a nuclear war, autonomous, self-reproducing mining machines may have mutated. One of the humans says of the Earth, "It isn't ours anymore," as they leave for another stellar system in the repaired spaceship.   This is an English-language short story in an anthology, read probably in the 1960s or 70s, or 80s at the latest.

Read a story once about earth being abandoned for long periods of time. Upon the return of man to earth all life forms, flora and fauna, have evolved into intricate electronic forms of themselves.   Would like to find that story and it's name.


If f(z) and f(z) whole bar are both analytic on a domain D, then what can you say about the function f(z)?

is it true if $f,\overline f$ are both analytic in a domain $\Omega$ then $f$ is constant? I am not able to  find out what property of holomorphic map I need to apply. please help.Thank you.  $f(z)=u(x,y)+iv(x,y)$, $\bar{f}(z)=u(x,y)-iv(x,y)$


Five closing requests are placed on my question about Eclipse passing variable to external tool (), because obviously they cannot understand it.  I got so upset that I examined answer history of every these five users, except one user, other of them had never answered one single Eclipse question. So that I believe it is a case of abusing. It hurts my feeling about the quality of this community.   I'm not asking why it is on-hold or how to re-open it!

As a newcomer to StackOverflow, I recently asked my first . I wanted to start with a fairly safe general question, to get the feel for how the site worked. My question was intended to be programming-related, but my original wording was not clear enough, so another user decided to close it.  I've re-phrased my question, and had received one useful answer before the question was closed, but I'm not sure what the procedure is after your question is closed to allow people to post answers again...  I've checked the FAQ and About pages, searched the SO questions, but have had no luck. Could someone point me in the right direction as to how I get my question re-opened, or if it is possible to do at all?


The following two queries return different values for index size.  SELECT OBJECT_NAME(i.OBJECT_ID) AS TableName, i.name AS IndexName, i.index_id AS IndexID, 8 * SUM(a.used_pages) AS 'Indexsize(KB)' FROM sys.indexes AS i JOIN sys.partitions AS p ON p.OBJECT_ID = i.OBJECT_ID AND p.index_id = i.index_id JOIN sys.allocation_units AS a ON a.container_id = p.partition_id GROUP BY i.OBJECT_ID,i.index_id,i.name ORDER BY OBJECT_NAME(i.OBJECT_ID),i.index_id   And  sp_msforeachtable 'sp_spaceused ''?''''   Can anyone suggest exact query to find Index size for each tables from system views in sql server?

It is a known fact that the DMVs dont hold accurate information regarding number of pages and count of rows. However, when you have the stats updated, I can't see why they wouldn't.  I am working on a monitoring tool, want to know disk size of each index and data, etc. Eventually I would like to find the right fill factor, and other things etc.  The space used by my function and the old sp_spaceused differs a little bit on the space usage, but not on record count.  Can you see if there is anything missing in my select?  this is the sp_spaceused (then I convert the numbers in MB):  sp_spaceused 'tblBOrderRelationship' go  select 318008/1024.00 AS reserved, 140208/1024.00  AS data, 177048/1024.00 AS index_size, 752/1024.00    AS unused     But when I run my select, code below\picture below, I get slightly different figures.  SET TRANSACTION ISOLATION LEVEL READ UNCOMMITTED  SELECT      schema_name(t.schema_id) as SchemaName,     t.NAME AS TableName,     t.type_desc,     t.is_ms_shipped,     t.is_published,     t.lob_data_space_id,     t.filestream_data_space_id,     t.is_replicated,     t.has_replication_filter,     t.is_merge_published,     t.is_sync_tran_subscribed,     --t.is_filetable,     i.name as indexName,     i.type_desc,     i.is_unique,     i.is_primary_key,     i.is_unique_constraint,     i.fill_factor,     i.is_padded,       sum(p.rows)               OVER (PARTITION BY t.OBJECT_ID,i.index_id)  as RowCounts,     sum(a.total_pages)        OVER (PARTITION BY t.OBJECT_ID,i.index_id)  as TotalPages,      sum(a.used_pages)         OVER (PARTITION BY t.OBJECT_ID,i.index_id)  as UsedPages,      sum(a.data_pages)         OVER (PARTITION BY t.OBJECT_ID,i.index_id)  as DataPages,      (sum(a.total_pages)       OVER (PARTITION BY t.OBJECT_ID,i.index_id)  * 8) / 1024 as TotalSpaceMB,      (sum(a.used_pages)        OVER (PARTITION BY t.OBJECT_ID,i.index_id)  * 8) / 1024 as UsedSpaceMB,      (sum(a.data_pages)        OVER (PARTITION BY t.OBJECT_ID,i.index_id)  * 8) / 1024 as DataSpaceMB FROM      sys.tables t INNER JOIN           sys.indexes i ON t.OBJECT_ID = i.object_id INNER JOIN      sys.partitions p ON i.object_id = p.OBJECT_ID AND i.index_id = p.index_id INNER JOIN      sys.allocation_units a ON p.partition_id = a.container_id WHERE      t.NAME NOT LIKE 'dt%' AND     i.OBJECT_ID > 255  AND T.NAME = 'tblBOrderRelationship'   the figures    the bigger picture, including the index names   Now doing some calculations to check the results:  --================================== -- the figures from sp_spaceused --================================== select 318008/1024.00 AS reserved, 140208/1024.00  AS data, 177048/1024.00 AS index_size, 752/1024.00    AS unused  --================================== -- the figures from my select --================================== select 137+61+56+54 AS reserved,        137 AS data,        61+56+54 AS index_size     It is not so far off, really, apart the fact I did not calculate the unused space!  What can I do to make this accurate?  AFTER CHANGES:  After I replaced 1024 by 1024.00 the results are much more accurate.  I noticed records have been inserted into the table in question, and obviously the stats are not so up to date, but still the results match (under 1 MB difference - which is all right for me)  The new result sets are:  --================================== -- the figures from sp_spaceused --================================== select 318072 /1024.00 AS reserved, 140208 /1024.00 AS data, 177096 /1024.00 AS index_size, 768 /1024.00 AS unused go  --================================== -- the figures from my select --================================== select 137.7578125+61.7968750+56.4218750+54.6406250 as reserved,        137.7578125 as data,        61.7968750+56.4218750+54.6406250 as index_size


I have a samsung 850 evo 120GB ssd. I have installed ubuntu on it , with a 119GB / and 1 GiB Swap(on the ssd) . Is the swap a good idea? Should I remove the swap ? Problem is , I have only 1 GB ram.   EDIT - My question is not about where to put the swap , it's about how putting swap on the ssd affects its lifespan significantly.

I often read that one should not place swap partitions on a SSD drive, as this may harm the device. Is this true? Can you please explain the reason to me?  Because I otherwise would have thought that placing swap on an SSD is the best choice, as it's much faster than HDDs and therefore swapping RAM contents to the SSD is not as slow as it would be with the HDD...


Looking to execute a script on the first Monday of the month, then a different script on the first Wednesday of the month.  The issue is that if a new month starts on a Tuesday, for example, then the "first Wednesday of the month" action will hit first.  I'd like to have this configured so that the "first Wednesday of the month" action only occurs if it follows a Monday within that month.  Logic can be used to figure this out from a scripting perspective, but the problem is that I need this in a cron expression since that is the only way I can schedule this in the system I am using (it requires a cron expression for advanced scheduling, and details of this system is not relevant to this question).  Edit: There is no dependency or relationship between the aforementioned scripts being executed by cron.  For the sake of simplicity for the question, they would simply be two separate cronjobs in the same crontab.

This is a  about using cron & crontab.   You have been directed here because the community is fairly sure that the answer to your question can be found below. If your question is not answered below then the answers will help you gather information that will help the community help you. This information should be edited into your original question.  The answer for 'Why is my crontab not working, and how can I troubleshoot it?' can be seen below.  This addresses the cron system with the crontab highlighted.


Recently (the last three day) my late 2013 iMac has been suffering from kernel panics. After reboot, console shows a 'Previous shutdown cause: -62'. Can someone please tell me what this means. The only thing I have changed is I added a new backup drive (2TB external). It seem to only happen after about ½ hour after wake (from sleep). It only does it when doing multiple processes, like running photoshop, iTunes open in background, youtube vids playing etc. So, any ideas. Any help would be appreciated, Thanks, BR

I have a late 2013 27" iMac running  Yosemite, and it randomly shuts off every now and then. I tried everything Reset SMC. Diagnostics, reformat Macintosh HD but still occurs and running out of options.


From this array, i want to select only flipkart and create a new array which contains only flipkart. json = [   {     "amazon": []   },   {     "flipkart": {       "product_store": "Flipkart",       "product_store_logo": "https://images-api.datayuge.in/image/ZmxpcGthcnRfc3RvcmUucG5n.png",       "product_store_url": "https://price-api.datayuge.com/redirect?id=aHR0cHM6Ly9kbC5mbGlwa2FydC5jb20vZGwvcmVhbG1lLTItZGlhbW9uZC1ibGFjay02NC1nYi9wL2l0bWY4NXNjeHlnaHh3Y2g_cGlkPU1PQkY4NVVZQ0RERlZFRE0mYWZmaWQ9YXJ1bmJhYnVs",       "product_price": "10990",       "product_mrp": "0",       "product_offer": "",       "product_color": "black",       "product_delivery": "3-4",       "product_delivery_cost": "0",       "is_emi": "1",       "is_cod": "1",       "return_time": "10 Days"     }   },   { "snapdeal": [] },   { "ebay": [] },   { "paytm": [] },   { "croma": [] },   { "yebhi": [] },   { "indiatimes": [] },   { "homeshop18": [] },   { "naaptol": [] },   { "infibeam": [] },   { "tatacliq": [] },   { "shopclues": [] },   { "paytmmall": [] },   { "gadgets360": [] },   { "mi": [] },   { "2gud": [] } ];  edit: above problem is solved, the solution was, this.store_array.filter(el => {             if(Array.isArray(el[Object.keys(el)[0]])){                 return el[Object.keys(el)[0]].length;             }             else if(typeof el[Object.keys(el)[0]]==="object"){                 this.brands.push(el[Object.keys(el)[0]])                 return el[Object.keys(el)[0]]             }         });  and   was the one who answered it first but i can't find his answer, since i am new to stackoverflow, all credits goes to user. thank you very much.

How do I remove empty elements from an array in JavaScript?   Is there a straightforward way, or do I need to loop through it and remove them manually?


I am using debian (unstable). My system was partitioning with 9 GiB for /. This is not enough for me and I use already 7,5 GiB.  I don't want (for now) to use gparted in order to repartitioning (it takes a while and could be dangerous).  Therefore, I am looking a way to see how much space softwares takes. I guess LaTeX takes a lot of space but, perhaps, I have (big) softwares installed which I don't need. I would like a list by size and I don't how to have this information.

Disk space on my root partition is running low, so I want to delete some applications from the system. How can I see which software packages use the most disk space? Is it possible to view that from aptitude?  I know about generic disk space analyzers like df or baobab, but I need solutions for installed applications.


After watching many m43 camera reviews,almost every reviewer say's that how there are "huge amounts of noise" at higher iso's, So I am curious, what is "noise" why does it increase as iso levels increase, and why it is not that much of a problem with larger sensors???

I'm trying to see how  correlates with practice. That answer basically says I need to let enough light into the camera and then use the highest ISO value and I'll get the lowest noise then.  So I make two shots with the same camera. Camera has aperture set to a specific value, fully manual mode, camera is on a tripod and focused onto a specific faraway object. Shooting is done around midnight, so it's rather dark. The scene is a large industrial building standing faraway across a field from the camera. The field has no light sources, all lights are on the industrial building.  I dunno if it's important but images are written as JPEG inside camera - no shooting to raw and external post-processing. Maybe that's why I see my unexpected result.  Camera highest ISO value is 3200 (not using extended ISO values).  So I first shoot with ISO 1600 and shutter speed set to 1/125 second and then I shoot with ISO 3200 and shutter speed set to 1/250 second. The amount of light should be identical and indeed both shots look properly exposed and exposed the same way.  When I open the pictures in an image viewer and zoom in to one hundred percent  I see that ISO 1600 shot is much cleaner than one with ISO 3200. I checked that several times and I'm sure - it's not the other way around.  Why is this? Is this because of post-processing difference?


For the 18V +/- NIMH battery pack (2 x 9V packs in series @ 200mAh) that I use to run my phono preamp, I need a simple trickle charge circuit. The LM317 IC seems to be the one that is used a lot.  Does any one have a proven circuit that would work with a very low charging current of say around 20-30 mA?  Thanks

I am trying to design a circuit and was wondering how to design it that the 12V 800mAH NimH battery I am using will not overcharge. I have researched trickle charging and as far as I understand, a zener diode that regulates the voltage down to about 13.3-13.7V should do. I chose a 14V Zener, taking into account the .6-.7V drop.   I have heard that trickle charging is not the best for the battery, but am not sure how much more work designing a smart charger would take.  I was also thinking of using another diode to prevent flow back to the panels from the battery.         – Schematic created using  The three voltage sources on the left represent the solar cells, with the NiMH battery on the right.  I was wondering if I needed any additional components if I were to use three 5.5V solar cells in parallel outputting 40mA (16.5V total at 40mA, regulated to 13.3V by the zener) in order to prevent overcharging.  A similar question to mine was asked at  However, this dealt more with a larger lead-acid battery and used a voltage regulator with a schottky diode.   This link discusses almost my exact same question, but I was confused to the answer given which said that up to 1.45V per cell could be charged, taking my max charge voltage up to 14.5V.   Considering I am only outputting 40mA to an  800mAH battery, it seems that I may not need any more battery protection, but would love any input.


is full of supposed "secrets" that most everyone knows about flying.  But one thing it mentions is:  14. Tipping could go a long way. My girlfriend is a flight attendant. NO ONE tips flight attendants. If you give your FA a fiver with your first drink you’ll probably drink for free the rest of the flight.  Is tipping a flight attendant acceptable? Is it even permitted? (I know many businesses won't accept tips in the US, for instance, to avoid the legal obligation to report tip income to the IRS.)

Those of us who fly a lot will know that there is a bit of a variety in cabin crew. Some (sadly more common on certain airlines) do the very bare minimum to ensure a safe flight, but nothing more. Many (especially on airlines noted for good customer service) provide a good service.  Every so often though, you come across a flight crew who go the extra mile. These are the ones always friendly, always helpful, always thinking ahead and solving the problem before it has happened. One moment they're serving you your drink, the next reassuring a little old lady about the flight, the next magicing a colouring book to turn an impending toddler crisis into a happy small child, then answering queries on arrivals and immigration for a first time travaller, then back to offer you a top up of what you're drinking (which they've remembered exactly). Not very often found, but very much appreciated when you happen across them on your travels!  In the case when you do luck out and find yourself on a flight with a great cabin crew (who go well beyond what you normally experience as "good" on that airline/kind of airline), is there a standard/common way to recognise them at the end of the flight? Not just to thank them then and there, but also to let the airline know that this person/group are what the rest of their staff should be aspiring to. Is there any standard way, or does it vary entirely by carrier?


What’s the difference between the present progressive tense are buying and the simple future tense will buy as used here?   Next week we are buying a new car. Next week we will buy a new car.

How to say that you have plans to go to the movies tonight (but you are not sure yet, maybe you will have a pizza)? I mean there are options:     I am going to the cinema tonight.   Way too much certainty in this. For me it means that you have already bought tickets, the least.     I am going to go to the cinema tonight.   Sounds a bit awkward.     I will go to the cinema tonight.   Sounds too formal to me.


I think therefore i am is often accepted as true.But how do we know that the fact we are doubting something makes us real?we can be a stimulation or be dreaming.Why is the act of thinking given so much importance when it actually does not tell us any reality?

I've heard it postulated by some people that "we can't truly know anything".  While that does seem to apply to the vast majority of things, I can't see how 'cogito ergo sum' can possibly be false.   No matter what I am, no matter in what way I'm being tricked, no matter how I may be deluded, I must exist in order to - in some way - be considering this right now (or be being tricked right now).  Is 'cogito ergo sum' necessarily correct, or have I missed something?


Does there exist a general algebraic formula for evaluating the $k^{th}$ consecutive prime number (in terms of $k$) when the set of prime numbers is arranged in an ascending order? Does there exist a general algebraic formula (in terms of $n$) for evaluating the largest prime number $p$ less than or equal to any given natural number, $n$?

I've solved for it making a computer program, but was wondering there was a mathematical equation that you could use to solve for the nth prime?


I am trying to set the ENV variable just for the scope of this command  ENV=dev echo terraform plan -state=$ENV.tfstate -var-file=$ENV.tfvars -out=$ENV.plan   the output is for some reason:   terraform plan -state=.tfstate -var-file=.tfvars -out=.plan   Why is it?   I am using bash in osx mojave

If I run this bash command and prefix the statement, so that the variable fruit should exist, but only for the duration of this command:  $ fruit=apple echo $fruit  $   The result is an empty line. why?  To quote a comment from wildcard on :     parameter expansion is done by the shell, and the "fruit" variable is   not a shell variable; it's only an environment variable within the   environment of the "echo" command   An environment variable is still a variable, so surely this should still be available to the echo command?


I still struggle with elementary knowledge about quotient rings.  For example, why can I just write down the second following isomorphism:  $$\frac{\mathbb{C}[x, y, z]}{(x^2 + y^2 - 1, y \pm iz)} \simeq \frac{\frac{\mathbb{C}[x, y, z]}{(y \pm iz)}}{\frac{(x^2 + y^2 - 1,y \pm iz)}{(y \pm iz)}} \simeq \frac{\mathbb{C}[x, y]}{(x^2 + y^2 - 1)} $$  I know the first isomorphism is right by the third isomorphism theorem. But why can I write down the second one?

Let $\phi: R \to S$ be a surjective homomorphism. Prove that $\frac{R/ \ker \phi}{(\ker \phi + J)/ \ker \phi} \cong \frac{S}{\phi(J)}$ for an ideal $J$ of $R.$  Obviously, $S \cong R/ \ker \phi$(first isomorphism theorem) and $\phi(J)$ is an ideal of $S$, since $\phi$ is surjective( $\forall s \in \phi(J), s = \phi(j)$ for some $j \in J, \forall s' \in S, s' = \phi(r)$ for some $r \in R$, so $ss' = \phi(j)\phi(r) = \phi(jr) \in \phi(J)$, and $ss' = \phi(r)\phi(j) = \phi(rj) \in \phi(J)$ ).  However, I'm having trouble with going on. If it's important, I mean a unitary ring by a ring.


global class converterSchedule implements Schedulable {     global void execute(SchedulableContext ctx) {         List<Exchange_rate__c> exchange = [SELECT Date__c, GBP__c, USD__c, EUR__c, CAD__c                                             FROM Exchange_rate__c];          converterWidgetController.requestAndResponseCurrency();     }  }

This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, including more unit test resources, navigate to the  tag.  This canonical question is intended to address several classes of common questions by providing a quick summary and links to comprehensive resources:   How do I start writing my first unit test?  How do I unit test this code?  I need help writing this unit test.   Salesforce Stack Exchange looks for detailed, specific questions that the community can help you with, and can't write tests on your behalf. We feel that working with the resources below can help you get started, and we encourage you to make an attempt to write your test and return to SFSE with your specific questions when you encounter challenges you can't resolve.


I cant seem to Cut a hole in Any objects with the Difference operation while using the Boolean Modifier, All it does make Objects Disappear or Instead give me an Error(Unable to perform Boolean Operation)

I want to use the top half of the circle to make a cut but whenever I apply the boolean modifier, the circle just stays there and becomes attached to my other object.  I've managed to make the cut in a standard cube but not sure why it's not working for this...?


I keep deleting the search engine on Firefox, yet every time I restart Firefox it shows up again.  I am setting Google as default.  How can I remove "mystartsearch"?  This is not something similar with removing virus. This is removing annoying setting that don't get off the easy way. And I already know the answer.

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


Let $f(z)=\sum\limits_{n=0}^{\infty}{a_nz^n}$ is an univalent analytic function on the open disk $\Delta(0,1)=\{z:|z|<1\}$, such that $G= f(\Delta(0,1))$. If $A$ is the area of the region $G$, prove that:  $$A=\pi\sum\limits_{n=0}^{\infty}{n|a_n|^2}$$  I found this question from the book "Fundamentals of Complex Analysis", written by Liao Liangwen. I have no idea about this. So I want to get some help.  Thanks.

I have the following problem.      Let $f:D\to \mathbb C$ be a holomorphic function, where $D=\{z:|z|\leq 1\}.$ Let $$f(z)=\sum_{n=0}^\infty c_nz^n.$$ Let $l_2(A)$ denote the Lebesgue measure of a set $A\subseteq \mathbb C$ and $G=f(D).$ Prove that $$l_2(G)=\pi\sum_{n=1}^\infty n|c_n|^2.$$   After a long struggle I managed to come up with the following formula $$l_2(G)=\iint_D |f\,'(z)|^2dxdy.$$ It looks like the right thing to use because $$f\,'(z)=\sum_{n=1}^\infty nc_nz^{n-1},$$ which is similar to what I have to prove. I understand that the $\pi$ will appear when I integrate something over the angle $\phi$ in polar coordinates. But I don't know how to find the square of the absolute value of the right-hand side to even start integrating...  EDIT: The function is supposed to be  (one-to-one). (I'm not perfectly sure I'm translating the term correctly. The (Polish) word in the statement of the problem was "jednolistna". I have not met it before.)


I'd like to add a class to one of my divs with a dynamic value generated in ts.  Say I have the following code to add a class:  let item = document.querySelector('.my-div'); item.classList.add('max-width');  let myMaxWidthValue = '200'; // this value is going to be generated by some fn    Now I would like to somehow make the class look like this in the css:  .max-width .innerItems {   max-width: myMaxWidthValue }   Is this possible? It would be way more efficient for me to do it this way.   As you can tell by my CSS I want to set the class to the parent that contains many children elements.   I could do getElementsByClassName and loop through each one with element[0].style.maxWidth = myMaxWidthValue but there could be a TON of these children elements and it does not seem right to do it this way.

It's easy to set inline CSS values with javascript. If I want to change the width and I have html like this:

   All I need to do is:  document.getElementById('id').style.width = value;   It will change the inline stylesheet values. Normally this isn't a problem, because the inline style overrides the stylesheet. Example:

   Using this Javascript:  document.getElementById('tId').style.width = "30%";   I get the following:

   This is a problem, because not only do I not want to change inline values, If I look for the width before I set it, when I have:

   The value returned is Null, so if I have Javascript that needs to know the width of something to do some logic (I increase the width by 1%, not to a specific value), getting back Null when I expect the string "50%" doesn't really work.  So my question: I have values in a CSS style that are not located inline, how can I get these values? How can I modify the style instead of the inline values, given an id?


I was asked to evaluate the following expression:  $\lim_{n \to \infty} \left({\frac{(n+1)(n+2)(n+3)...(3n)}{n{^{2n}}}}\right)^{1/n}$  My first step was to assume that the limit existed, and set that value to $y$.   $ y = \lim_{n \to \infty} \left({\frac{(n+1)(n+2)(n+3)...(3n)}{n{^{2n}}}}\right)^{1/n}$  And then, I took the natural logarithm of both sides of the equation. I obtained the expression:  $ \ln y = \lim_{n \to \infty} \frac{1}{n} \cdot \left(\ln(1+\frac{1}{n}) + \ln(1+\frac{2}{n}) + ... + \ln(1+\frac{2n}{n})\right) $  This simplified to:   $ \ln y = \lim_{n \to \infty} \frac{1}{n} \cdot \sum_{k = 1}^{\color{Red}{2n}} \ln(1+\frac{k}{n}) $  I realize that this is similar to the form of a Riemann sum, which can then be manipulated to give the expression in the form of a definite integral. However, the part bolded in red, which is $ 2n$, throws me off. I have only seen Riemann sums be evaluated when the upper limit is $ n - k $, where $k$ is a constant.  Therefore, how would I go about evaluating this expression?  Thank you for all help in advance.


Hey guys I'm trying to get back into java. Took a class in high school a couple years ago. Right now I'm working on a small project where I want to use an array of objects but I'm having a problem with initializing the objects. Here's kinda what I have right now.  import java.util.Scanner; public class Test{   public static void main(String args[]){     Scanner s=new Scanner(System.in);     System.out.println("Welcome to Test. What is your name");     String ans=s.nextLine();     User[] people=new User[10];     people[1].initializeUser(ans);     people[1].printName();   } }   I'm having a run time error where I try to initializeUser. "Exception in thread "main" java.lang.NullPointerException" Here's the code for class User if it's helpful.  public class User{    public String name;    public User(String x){       name=x;    }    public User intitializeUser(String x){       User y=new User(x);       return y;    } }   and just a quick question relating to classes.. When should I use private instead of public? Also when am I supposed to use static for methods and variables? Thanks, guys

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?


This question is about assigning the entire contents of one variable to another variable.  Variable is not being used (sent to echo, etc.)  No  is being done during the assignment.  My question also pertains only to POSIX shell (no arrays being used here).  error="You have an error in your input"  newVar="$error" # vs. newVar=$error #         ↑ #         └─This assignment is the question. It doesn't seem that quotes are #           needed here in order to assign the entire contents of $error to #           a new variable.  #                 ┌─(But quotes are required when they're used.) #                 ↓ printf "%s\n" "$error" # => You have an error in your input printf "%s\n" "$newVar" # => You have an error in your input   Are there any gotchas I'm missing in just writing newVar=$error?  Update:  Regardless of what's in $error, I want to know will that same data carry over into $newVar without throwing any errors or mangling the data.  $ error="Test * ${1} \n [!a] [[:punct:]] ./test \t \n \\" $ newVar=$error #       ↑ #       └─Does this step ever fail or cause the two variables to differ? $ echo "$error" Test *  \n [!a] [[:punct:]] ./test \t \n \ $ echo "$newVar" Test *  \n [!a] [[:punct:]] ./test \t \n \

I can write  VAR=$VAR1 VAR=${VAR1} VAR="$VAR1" VAR="${VAR1}"   the end result to me all seems about the same. Why should I write one or the other? are any of these not portable/POSIX?


I've got a USB drive here, that somebody asked to try and fix. When inserting it, it shows up in explorer, but when I double click it I get a message saying "Please insert a disk into drive H:". So I went to disk management, to see if it was correctly formatted. It doesn't show up in the upper pane, and in the lower pane it tells me there is no medium in H:.  After this I used chkdsk: the path is invalid. Then I tried TestDisk, which is supposed to look at raw data, and this can't even find the disk.  So I'm assuming the drive is dead, even though its LED is burning. But I was wondering if there might be something else I could try?  This system is Windows 7 Ultimate 64bit by the way.  (I'm translating things from a Dutch install, so some names might be wrong)

I have a USB flash drive which is no longer recognized by my computer. Windows Disk Management and DiskPart report No Media with no storage space (0 bytes) on the drive and I cannot partition or format the drive:     If the drive appears in Windows Explorer, trying to access it returns an error message indicating that there is no disk inserted, such as the following:     Please insert a disk into drive X:.   Various disk partitioning and data recovery utilities don't recognize the drive or only give a generic name for the drive and cannot access the contents of the drive.  What can I do? How do I recover data from the drive?     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.


I have a string like this  String myString = "I love [stackoverflow]";   What I want to do is to replace the character "[" to  and the character "]" to  to change the color of the word stackoverflow to red.  So the expected string result is "I love stackoverflow"  I am new in regex so I tried like this  String myString = "I love [Stackoverflow]";  myString.replaceAll("[",).replaceAll("]","");   but seems not the correct way because the android studio says      unclosed character class   What is the correct regex of that single character?

I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps.  It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps?


I've looked around for resolutions however, could not find any.  Indeed the one response that is pointed out, I already tried.  I did the following  sudo gedit .emacs   and embedded the code provided by  into that file.  Am I supposed to run another command after I include that into the .emacs file ?  So that emacs knows that it has been upgraded ?  I then also took other posts into consideration, such as , but it did not help me.  Am I supposed to simply download the files into the auctex/ folder ? and/or the preview sub-folder ?   The minimum working example that does not preview is   \documentclass{article} \usepackage{tikz} \begin{document} \section{test} \begin{tikzpicture}   \draw [fill=orange] (1,1) rectangle (2,2); \end{tikzpicture} \end{document}   I then try to preview it using the C-c C-p C-s command but the TikZ picture doesn't show.   I am a newbie by the way. Any advice is appreciated.  UPDATE: I now realized that I can click on the icon that appears before \begin{tikzpicture} to view the error which I hereby append.  gs -dOutputFile\=\(_region_.prv/tmp5466eRu/pr1-1.png\) -q -dDELAYSAFER  -dNOPAUSE -DNOPLATFONTS -dPrinted -dTextAlphaBits\=4 -dGraphicsAlphaBits\=4  -sDEVICE\=png16m -r127.763x127.523 GS>{<</PermitFileReading[(_region_.prv/tmp5466eRu/preview.ps)]>> setuserparams  .locksafe} stopped pop {DELAYSAFER{.setsafe}if}stopped pop/.preview-BP  currentpagedevice/BeginPage get dup null eq{pop{pop}bind}if  def<</BeginPage{currentpagedevice/PageSize get dup 0 get 1 ne exch 1 get 1 ne  or{.preview-BP }{pop}ifelse}bind/PageSize[1  1]>>setpagedevice/preview->do{[count 3 roll save]3 1 roll dup length 0 eq{pop}> {setpagedevice}{ifelse .runandhide}stopped{handleerror quit}if aload pop  restore}bind def [(_region_.prv/tmp5466eRu/preview.ps)(r)file]aload exch dup 0  setfileposition 25159()/SubFileDecode filter cvx .runandhide aload pop dup dup  25270 setfileposition 497()/SubFileDecode filter cvx<<>>preview-do Error: /undefined in pgfo Operand stack: Execution stack:    %interp_exit   .runexec2   --nostringval--   --nostringval--    --nostringval--   2   %stopped_push   --nostringval--   --nostringval--    %loop_continue   --nostringval--   --nostringval--   false   1    %stopped_push   .runexec2   --nostringval--   --nostringval--    --nostringval--   2   %stopped_push   --nostringval--   --nostringval--    false   1   %stopped_push   1148   --nostringval--   %end_runandhide    --nostringval-- Dictionary stack:    --dict:1169/1684(ro)(G)--   --dict:0/20(G)--   --dict:83/200(L)--    --dict:106/300(L)-- Current allocation mode is local Last OS error: 2 Preview-Ghostscript finished   UPDATE UPDATE: I also edited the .emacs file without the sudo command. I also included the following packages but it still does not work  \usepackage[active,float]{preview}  \PreviewEnvironment{tikzpicture}

I am using AUCTeX on Emacs. When invoking preview.el with e.g. C-c C-p C-p I obtain previews of external figures (figure environment with .ps files), but not of TikZ pictures.  Is it possible to obtain previews of figures drawn with TikZ?


I was wondering what's the best way to go about this. I don't have it available in Kdenlive or GIMP so I don't think it's installed.   The ttf-mscorefonts-installer package doesn't work for me, it constantly shows an error of . There's probably a different way to install this one font...

I have been receiving notifications about "failure to download extra data files" from update notifier. It asked me to download fonts in request from the ttf-mscorefonts-installer package. However, whenever I click on the "run this action now", a window pop up (see figure below) and it never got downloaded.     It keeps "waiting for headers" until timeout. Same thing will happen if I use the wget in terminal to download the package:  wget downloads.sourceforge.net/corefonts/andale32.exe --2016-05-02 11:57:32--  http://downloads.sourceforge.net/corefonts/andale32.exe Resolving downloads.sourceforge.net (downloads.sourceforge.net)... 216.34.181.59 Connecting to downloads.sourceforge.net (downloads.sourceforge.net)|216.34.181.59|:80... connected. HTTP request sent, awaiting response...    It will fail again.   I have noticed similar issues like , but the known solutions never worked on me. The wired thing is that I can download the font package from a browser like Chrome, and run the following command to fix the font problem:  sudo dpkg-reconfigure ttf-mscorefonts-installer   with the fonts folder directed. But my question is do I have any problem with my package-data-downloader and terminal configuration? The sudo apt-get update command can run with a few errors and warning showing that but generally it can download data from internet. It only fails when the terminal connect to sourceforge or maybe similar websites.   Hopefully you have some idea on how to make the download from terminal work for all cases. Let me know what else information I can provide. Thanks!


I'm very new to the research domain and I'm extremely confused, let me explain further. For the literature review I've done assume that I have 1 topic, that comprises of three research papers say A,B,C. Now I put these papers in chronological order, I then take paper A and summarize it. What I mean here is that I discuss what the papers purpose was, how the authors met the papers purpose and mention the results. After this I then explain what is learned from each paper and what I can take forward in the proposed research and Introduce the next paper, in this case paper B. I do the same process for paper B etc. My question is that I've been told that this approach is wrong and that a literature review is like "telling a story" but frankly I can't see where I'm going wrong?? Can someone please help explain where exactly I am going wrong?

I am in the early stages of my PhD and I am trying to put together a literature review of my topic. My intention is that this review will eventually be included in my thesis, something like "the chapter that describes the state of the art in the domain."  My subject is soft matter physics and a large number of theses have already been written this topic. When looking at the literature reviews included in these other works I've noticed that:    The sequence of ideas is often the same (this makes sense, so why not?) Cited papers are always the same, even though 20 years elapsed between the first and last thesis. Moreover, papers from the 30's are cited but no one in my lab seems to have a copy available?    My hypothesis is that these theses are derived from some sort of a Mother of All Thesis, and that paraphrasing the work of the previous student is OK.   So, what makes a good literature review?  How do you notice that a literature review is sloppy?   PS: I posted this question because I assume many of you have experience with this process either in your own PhD work, or as a supervisor where you have had to deal with paraphrasing of your students.   PS2: I am not asking about making proper citations, LaTeX+BibTeX handles that like a charm.


I am looking for the best calculus book to use it to teach myself calculus. I have already had a bit of a search and these are what I have come up so far, But I have no idea which one is truly the best bet here and of more value in terms of being good at a self-study manner with lots of explanations and charts for every concepts and chapters. Here is the list i have so far:     James stewart calculus 7e Calculus -Richard A. Silverman The Calculus 7: Louis Leithold   Update: I am a Computer Science student and i need it for my courses and carrier, so please consider this in your answers. If there is any better book please mention it since i have no idea on these books. Thanks in advance

Well I have not started calculus yet but I am really keen to. I would love if you suggest some books.  Points to be noted:   I really don't like the way textbooks are written so please no "textbooks"  I am COMPLETELY beginner in calculus. I know a little bit of trigonometry and what functions are but not really in depth.The book should start from the base, I mean really from the base. I may require a precalculus book too if the books don't cover that. I would really love if the book shows how calculus was developed, why it was developed and things like that.   Well,thanks in advance!


So here is a picture:    Here i have 3 verts. I want to align them in diagonal, centering on middle vertex.  There is a solution tho - creating an edge and setting it as a custom transform orientation, but it seems to be overcomplicated. What if i need to do this on multiple vertex groups?  May be there is another way to straighten verts in a line, that is not aligned with axes?  UPD: actually above situation can be solved by scaling along normal Z axis.  But what if i have this:    Here i want verts to be aligned in a line between first and last verts. But transforming by normal orientation does not help here.  UPD: tried making an edge between these two verts, but its orientation appeared unsuitable for scaling (like on image).  UPD: used lower face as transform orientation, but result was not as expected. And what if i have no suitable faces, oriented appropriately?    Please advice, what am i doing wrong here?

I have some edges that are not on the x, y or z axis. What is a simple way to straighten them? For example, I can scale and then use Shift+Z to straighten on the x and y axis.  Any shortcuts other than temporarily rotating the entire object to put the edges on an axis?


I need to free up some space in the /boot partition.  Looking in another [thread][1] I found I should use sudo dpkg --list 'linux-image*' to locate and sudo apt-get remove linux-image-VERSION to remove unused Kernel Images however no matter which one I choose they all say the last one 51 depends on it; it gives the option to force it but I am not 100 % sure about that the right way to go.  $ uname -r 3.13.0-49-generic  $ sudo dpkg --list 'linux-image*' Desired=Unknown/Install/Remove/Purge/Hold | Status=Not/Inst/Conf-files/Unpacked/halF-conf/Half-inst/trig-aWait/Trig-pend |/ Err?=(none)/Reinst-required (Status,Err: uppercase=bad) ||/ Name                     Version           Architecture      Description +++-========================-=================-=================-=====================================================  un  linux-image              <none>            <none>            (no description available) un  linux-image-3.0          <none>            <none>            (no description available)     ii  linux-image-3.13.0-32-ge 3.13.0-32.57      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S     ii  linux-image-3.13.0-40-ge 3.13.0-40.69      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S     ii  linux-image-3.13.0-43-ge 3.13.0-43.72      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S     ii  linux-image-3.13.0-44-ge 3.13.0-44.73      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S     ii  linux-image-3.13.0-45-ge 3.13.0-45.74      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S     ii  linux-image-3.13.0-46-ge 3.13.0-46.79      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S     ii  linux-image-3.13.0-48-ge 3.13.0-48.80      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S     ii  linux-image-3.13.0-49-ge 3.13.0-49.81      i386              Linux kernel image for version 3.13.0 on 32 bit x86 S in  linux-image-3.13.0-51-ge <none>            i386              (no description available)     ii  linux-image-extra-3.13.0 3.13.0-32.57      i386              Linux kernel extra modules for version 3.13.0 on 32 b     ii  linux-image-extra-3.13.0 3.13.0-40.69      i386              Linux kernel extra modules for version 3.13.0 on 32 b ii  linux-image-extra-3.13.0 3.13.0-43.72      i386              Linux kernel extra modules for version 3.13.0 on 32 b ii  linux-image-extra-3.13.0 3.13.0-44.73      i386              Linux kernel extra modules for version 3.13.0 on 32 b ii  linux-image-extra-3.13.0 3.13.0-45.74      i386              Linux kernel extra modules for version 3.13.0 on 32 b     ii  linux-image-extra-3.13.0 3.13.0-46.79      i386              Linux kernel extra modules for version 3.13.0 on 32 b     ii  linux-image-extra-3.13.0 3.13.0-48.80      i386              Linux kernel extra modules for version 3.13.0 on 32 b     iF  linux-image-extra-3.13.0 3.13.0-49.83      i386              Linux kernel extra modules for version 3.13.0 on 32 b     iU  linux-image-extra-3.13.0 3.13.0-51.84      i386              Linux kernel extra modules for version 3.13.0 on 32 b     iU  linux-image-generic      3.13.0.51.58      i386              Generic Linux kernel image

Every time I install a new Linux kernel, it gets left in the grub_config, making the boot menu longer each time.    I know I can manually search through the installed packages and remove them.  Does Ubuntu provide any easier way to clean them up or keep them from showing in the boot list?


Recently I posted already two related bug reports about Transifex issues:       Now I noticed that some strings that are still used on localized sites in correct translated forms have completely disappeared from Transifex. I.e. I can't find the source string by translation text or even by original (English) text.  This issue is different from the above two, but I think the root of issue is the same.  Many of last  reports are about translation problems that happened recently. Before the current issue we could fix them locally (by editing translations in Transifex). However this is not productive because we did the same work (restore the lost translations) many times. Now we can't fix it, because the original strings are gone from Transifex.

Recently I noticed that some strings in Transifex have lost their translations. E.g. :   You've earned the "$badgeName$" badge ($badgeDescription$) for "$postTitle$".    I know that same string was already translated and used on ruSO for the long time. Now translation is lost, but even Transifex says that there is 100% match string in suggestions (acquired from the translation history). This means that new string is the same as the old one and should not be reset as happens if original string is slightly modified (even with one symbol).        Why did this happen? Did you change the string's key generation (hash) function? Could this be prevented in the future updates to minimize losing of translations?


I am trying to insert a tag like "image id=1" inside a xml feed, and with ids from 1 to 10, but I get wrong XML format error using following code, someone can tell me why?   $line .='<images>' . $crlf;  $i=0; foreach($images as $img)      if ($i < 10)      {         $i +=1;         $line .='   <image id=<![CDATA['.$i.']]>>' . $crlf;           $line .='   <image><![CDATA['.$imageUrl.$img->name.']]></image>' . $crlf;        }    $line .='   </images>   ' . $crlf;         I also tried using   $line .='   <image id='.$i.'>' . $crlf;   and I get xml error......  This is how the feed should look like:  <images>     <image id="1">         <url>http://www.mywebsite/image?id=1&.jpg</url>         <title>             <en>FOTO 01</en>         </title>     </image>     <image id="2">         <url>http://www.mywebsite/image?id=2&.jpg</url>         <title>             <en>FOTO 02</en>         </title>     </image>

I have to generate a xml file dynamically at runtime. Please help me in generating the below XML file dynamically using PHP.  <?xml version="1.0" encoding="UTF-8"?> <xml>  <track>      <path>song1.mp3</path>      <title>Track 1 - Track Title</title>  </track>  <track>      <path>song2.mp3</path>      <title>Track 2 - Track Title</title>  </track>  <track>      <path>song3.mp3</path>      <title>Track 3 - Track Title</title>  </track>  <track>      <path>song4.mp3</path>      <title>Track 4 - Track Title</title>  </track>  <track>      <path>song5.mp3</path>      <title>Track 5 - Track Title</title>  </track>  <track>      <path>song6.mp3</path>      <title>Track 6 - Track Title</title>  </track>  <track>      <path>song7.mp3</path>      <title>Track 7 - Track Title</title>  </track>  <track>      <path>song8.mp3</path>      <title>Track 8 - Track Title</title>  </track>


Let $T$ be a finite tree with $V(T)$ vertices and $E(T)$ edges. Then $V(T)-E(T)=1$.  I am really confused with this. I am not sure how to go about proving it. I can (and should?) use Euler's theorem that states that $V(T)-E(T)+F(T)=2$. Would appreciate some help on this one.

How many edges does an undirected tree with $n$ nodes have?


Using technology to steal signs is banned in baseball. Teams consider this type of sign stealing a way of gaining an unfair advantage (Joe Maddon  to using ). As far as I can tell, though, the reason stealing signs provides an unfair advantage is because they are banned and therefore most teams don't do it.  This case seems very different from PEDs, which have reason to be banned besides the competitive advantage gained. The significant negative health effects from using them are good reason to ban them to prevent them from becoming necessary to perform competitively. On the other hand, nobody is hurt from sign-stealing.  So if the MLB has a sign-stealing problem, why doesn't it just allow it entirely. That takes away the unfair competitive edge from stealing signs.

Edit: I originally asked this question in 2016. This was before the scandals of the Astros and Red Sox came to light, where the teams allegedly used devices such as cameras, smartwatches, and trash can lids. As well as coordinating efforts with non-players. My question never pertained to such methods of sign-stealing, as I believe it should be obvious why this is wrong.      The question was more about what made it unethical for a player to attempt to manually analyze and decipher an opposing team's signs, using nothing more than his IQ of the game, skill, and experience.   My question pertains mostly to baseball, but I imagine it is just as relevant in other sports as well. Every so often I hear about a disgruntled team, accusing the other team of stealing signs. I don't get it. What actually makes it wrong?  This just seems like any other aspect of the competition that is fair game. For example, if a pitcher inadvertently "tips" his pitches, and the other team is smart enough to pick up on it and use that knowledge to their advantage, then it is generally considered a flaw of the pitcher. It is now his responsibility to correct the problem, and improve his skills by becoming more deceptive and unpredictable. I wouldn't blame the opposing team for cheating; I would say they played smart baseball. I'm having a hard time understanding how "decrypting" signals is any different?  Additionally, the coach who creates the signals does so with the intention to obfuscate them as much as possible. Obviously this is to maximize competitive advantage. So does that not imply competition even within this narrow aspect of the game?  Someone help me out please. What makes stealing signs wrong that teams rightfully take exception and feel cheated?


What is $\log(1)$ to the base of $1$? My teacher says it is $1$. I beg to differ, I think it can be all real numbers! i.e., $1^x = 1$, where $x\in \mathbb{R}$.  So I was wondering where I have gone wrong.


$$A_n = (-1)^n \left(\frac{\sqrt 2 \;n}{n+1}\right),\;\; n = 1, 2, 3, \ldots$$   My question is to find the limit point of this equation   I'm still not very good concepted with limited point.   This equation is alternating -1 and 1 and converge to $\sqrt 2$.   So can you say $\sqrt 2$ is the limited point?   If it is not what is the difference between limited point and limit?  How to find limit points of $A_n$ ?

$$\text{Let }\;\;A_1 = (-\infty, 3]\cap (0, 1)^c \cap [-1, \infty), \quad A_2 = \left\{(-1)^n \frac {\sqrt 2\,n}{n+1}: n = 1, 2, \ldots\right\}$$      Is $A_1$ open? Is $A_1$ closed? Find interior points of $A_1$. Find limit points of $A_2$.   1) I think first answer is not opened and closed, and I'm not sure how to find interior points.  2) $A_2$ converges to $\sqrt2$, so can you say $\sqrt2$ is the limit point of $A_2$? What is the difference between "limit point" and "limit"? And how to find limit points of $A_2$?


My tab key has never worked and I want to switch it's function with the caps lock key since I never use caps lock anyways. I'm using OSX and they only way I've seen to change the function of the keys has been through Preferences -> Keyboard -> Modifier Keys. But there's no tab option. Can anyone help me? I also tried using KeyRemap but it didn't work. Thanks for the help.

I used to use  to remap Right Alt to Right Control (as an Emacs user I use Control MUCH more that Alt) but updating to Sierra broke this.  Downgrading is not an option.  How do I manually remap keys in Sierra?  I specifically would like to remap Right Alt to Right Control.


I've started getting back to java and I have a general question about defining a constructor for an object: I'm following a tutorial where he defines a HashSet object by the following statement:  Set<String> set = new HashSet<String>(list);   (list is a List object)  And I was wondering what's the difference if I use this statement:  HashSet<String> set = new HashSet<String>(list);   thanks!

I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this?   I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly.   Is it just so if you were to do:  IInterface classRef = new ObjectWhatever()   You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that.   Also, how could you write a method that takes in an object that implements an interface? Is that possible?


I am creating a profile, and want to add a gif over the html link image and place it where i want. When i do it just goes on top of the image?      <img src=";><

I want to overlay one image with another using CSS. An example of this is the first image (the background if you like) will be a thumbnail link of a product, with the link opening a lightbox / popup showing a larger version of the image.   On top of this linked image I would like an image of a magnifying glass, to show people that the image can be clicked to enlarge it (apparently this isn't obvious without the magnifying glass).


I can't seem to find my locked ee.SE question anywhere on the Questions list on EE.se, despite it showing up on the Hot Questions list on SE and the active list on All Questions.  Is this just a bug or something?

Historical locks are sometimes applied to questions.   What is a historical lock? What is the purpose of a historical lock? How are questions affected by historical locking? When is it appropriate to lock a question for historical reasons?  When is it not appropriate? How do I request a historical lock for a question? What should I do if I notice a serious problem with a historically-locked question or one of its answers?


I need your help in order to clarify a doubt...I have two samples:  sample $A$ with mean $\mu_A$ and standard deviation $\sigma_A$   sample $B$ with mean $\mu_B$ and standard deviation $\sigma_B$   I know the observed values from the sample $B$ but I don't know anything on sample $A$, is there a way to find mean and standard deviation of the combined sample $A \cup B$ ?  We can assume that the two samples are i.i.d within and between them, so I think I can compute:  $\mu_{A \cup B}$ = $\mu_A + \mu_B$  $\sigma_{A \cup B} = \sqrt{\sigma_A + \sigma_B}$  am I right? Thank you!!!

I'm calculating the covariance of a distribution in parallel and I need to combine the distributed results into on singular Gaussian. How do I combine the two?  Linearly interpolating between the two almost works, if they are similarly distributed and sized.   provides a forumla at the bottom for combination but it doesn't seem right; two identically distributed distributions should have the same covariance, but the formula at the bottom of the page doubles the covariance.  Is there a way to combine two matrices?


Looking at the formula for binomial co-effient,  $$ \binom{n}{r}= \frac {n(n-1)...(n-r+1)}{ 1(2)(3)...(r)} $$  I am wondering why $ n(n-1)...(n-r+1) $ is a multiple of $  1(2)(3)...(r) $ .  I understand from the applications of this formula that only integer values makes sense as in $ n C r $. But, why are these two products be related in such a way, purely thinking of them as product of numbers and from algebra, how can we prove that they will always be related that way.

From its definition a combination $\binom{n}{k}$, is the number of distinct subsets of size $k$ from a set of $n$ elements.  This is clearly an integer, however I was curious as to why the expression  $$\frac{n!}{k!(n-k)!}$$ always evaluates to an integer.  So far I figured:  $n!$, is clearly divisible by $k!$, and $(n-k)!$, individually, but I could not seem to make the jump to proof that that $n!$ is divisible by their product.


I am a part of a mailing Group called "ITSupport".  If I set an out of office reply, it replies to all mails, including those addressed to the group.  How do I stop this?  I am using Outlook 2007.

When I am out of the office, if I turn Out-of-Office on, it auto-replies to the automated emails I get from our Bug Tracking system, which leads to our Bug Tracking system getting full of message about my holiday.  With Outlook Out-of-Office, how do I set it to not respond to certain 'From' addresses? I see its something to do with the optional Rules in the O-o-O dialog, but its not that clear how to stop it from replying using the rules.  I'm on Outlook 2003 and Exchange 2003 but advice for any version will probably be useful to people.


I read this in an anthology approx 1990 - but the stories seemed older, maybe from the 1960's. This man is relaxing in his house while his pre-school daughter is playing with crayons and paper. He notices she's put a half twist in a narrow strip of paper and taped the ends together. As he watches she follows the loop around with her finger, then she uses a pencil to draw a line along the middle until it meets itself. "That's called a Mobius strip" he tells her. She replies "Oh, so somebody else has already thought of it" At that point he realises she's like supersmart. She doesn't want to be tested and probed or treated as unusual so they decide she should play the role of an average achiever. She returns from her first day at school and tells how the teacher showed her how to use scissors and another kid helped her fasten her coat. He tells her not to overplay it and not to go too far with appearing a little slow. Soon she settles in but after a day at school she does her real studies of like really advanced physics and science etc. She gets a friend (a boy I think, maybe) and they hang out doing super clever stuff. One day Dad notices she's disappeared but then returns and he learns she's been teleporting to another plane of existence, along with her friend - I think, but I'm not certain, that the pair eventually leave altogether, the reasons why they leave I can't remember

I am looking for the name of an older sci-fi short story (read about 40 years ago) about genius kids who disappear (possibly into another dimension) and their father feels they ran into trouble there and is worried when they don't return. The story ends with him preparing to attempt follow them and rescue them wherever they might have gone. I read this as part of a Sci-Fi short story collection/anthology in the late 1960's but can't seem to find this story now.