What does Relevance mean exactly as a sort option for a search? What's the criteria behind it? It's an obscure unclear word. I did a search in the help center for it and got zero results back! Is it the number of times my keywords exist in the question? Across the answers as well? ...what?

I couldn't find much on the new Lucene-based search, and don't know much about the engine in general, so I'm asking this question.  Does anybody have a description of how search results are ranked?  Does the rank calculation include:   rep of post's author? views? unique referers? PageRank of referers? rank of questions that link to the post? whether a question is closed? vote count? answer count?


I've read that there is a difference between the date that a higher degree committee approves a student for graduation and the actual date of graduation. The first being the date that a student becomes a graduand and the second being the date that a student becomes a graduate. These two dates could be far apart. My question is which of these two dates should be shown next to a degree on a CV or resume? Obviously I would like it to be the first, but that would lead to a discrepancy between the date on the resume and the date on the certificate. Someone suggested I could show both the completion and graduation date on my CV.

Two friends successfully defended their dissertations yesterday, and many people have congratulated them, calling them Doctor so-and-so. I explained to my wife that they actually don't have that title until the graduation ceremony, that it's similar to a President-elect, who isn't called the President until they are sworn in. So, what title does a doctoral candidate take after they've defended but before they graduate?


I have a submersible pump for which I'm trying to determine the variability in flow rate, to high precision. Since this is just an impeller driven by an AC motor, what is the % error in frequency of a US wall outlet? Is there a commonly accepted 'ballpark' value, such as 60 hz +/-0.5 hz?   My suspicion is that for most electrical grids, this largely depends on the citywide usage throughout the day.   I apologize because I have an inkling that my question is poorly presented -- that being said, if anyone knows of where I can find real-time data regarding the West Los Angeles electrical grid, I'm all ears. Thanks!

If I make a digital clock which first detects the AC frequency roughly (whether it is 50, 60, 100Hz, etc), then uses it as its clock pulse source, how precise would it be? Would it work world wide precisely?  For instance, in USA, what is the mean and standard deviation of the 60Hz AC frequency?


I want to verify a value in my azure logic app which follows a pattern which can be identified by Regular Expressions.  My Value is KUL-M-X-Y, here KUL is fixed value but value of M can be "KG", "TON" etc., also Value of X and Y can be numeric.  I searched for RegEx related expression in Logic apps but didn't find any.  Can any one suggest possible way to work with this?

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


Is there a geometrical interpretation for $tan(x) > x$ when $x \in (0, \frac{\pi}{2})$ in the unit circle? I can't picture it since $x$ is the angle (although it makes sense when you graph the two functions).

In proof of $\displaystyle\lim_{x\rightarrow0}\frac{\sin{x}}{x}=1$ is assumed that $\sin{x}\leq{x}\leq\tan{x}$ while $0<x<\frac{\pi}{2}$. First comparison is clear, arc length must be greater than sine value, but how about $x\leq\tan{x}$, why tangent is longer than arc?


SystemError: E:Encountered a section with no Package: header,   E:Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_trusty_main_i18n_Translation-en%5fIN E:The package lists or status file could not be parsed or opened.   This is the problem I encounter when I try to open ubuntu software center please help me out to fix it and make software center work as normal

The computer gave me this output in a window:  E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_natty_main_binary-i386_Packages E: The package lists or status file could not be parsed or opened.   How can I fix this?


I am trying to run sudo apt dist-upgrade and I am am getting an connection error. It is trying to update the package fwupdate.  Is this because the server is just down, or is there another problem with my system that could be causing this?  Err:1 ftp://ftp.cs.mun.ca/pub/mirror/ubuntu xenial-updates/main amd64 fwupdate amd64 0.5-2ubuntu7   Could not connect to ftp.cs.mun.ca:21 (134.153.48.2), connection timed out Err:2 ftp://ftp.cs.mun.ca/pub/mirror/ubuntu xenial-updates/main amd64 libfwup0 amd64 0.5-2ubuntu7   Unable to connect to ftp.cs.mun.ca:ftp: E: Failed to fetch ftp://ftp.cs.mun.ca/pub/mirror/ubuntu/pool/main/f/fwupdate/fwupdate_0.5-2ubuntu7_amd64.deb Could not connect to ftp.cs.mun.ca:21 (134.153.48.2), connection timed out  E: Failed to fetch ftp://ftp.cs.mun.ca/pub/mirror/ubuntu/pool/main/f/fwupdate/libfwup0_0.5-2ubuntu7_amd64.deb Unable to connect to ftp.cs.mun.ca:ftp:  E: Unable to fetch some archives, try running apt-get update or apt-get --fix-missing   .

I have a Lucid Server (10.04) set up and I would like to change the mirror from US (or any other country) to the Main Ubuntu Mirror.  For example my two first entries in sources.list are:  deb http://us.archive.ubuntu.com/ubuntu/ lucid main restricted deb-src http://us.archive.ubuntu.com/ubuntu/ lucid main restricted   In a Desktop environment I would select the main mirror like this:    But how do I do that from the terminal as I don't have a graphical environment installed!


My question is what and how the boundary of the universe should be like. I mean what if someone tried to pass through it. Since the universe is not expanding at the speed of light therefore we can surely catch it. What if you try to push through it. What will happen after all if someone reaches the edge of the Universe. Clearly there must be matter near it what if they move towards the boundary. And above all will laws of physics will be same there?

What is the exact shape of the universe? I know of the balloon analogy, and the bread with raisins in it. These clarify some points, like how the universe can have no centre, and how it can expand equally everywhere in all directions. But they also raise some questions, like if you are on the surface of a balloon and travel in 1 direction, you will eventually return to your starting point, is it possible our universe have this feature?  If it has, or had, would this be a symmetry of sorts ($\psi(x)=\psi(x+R)$), and as such have a conserved quantity associated with it (by Noether)? Assuming "small curled up dimensions" wouldn't these dimensions have this type of symmetry, what are the associated conserved quantities? Is it known exactly what the geometrical shape of the universe is? (on a large scale) (I am not talking about only the observable universe). How does one define the "size" of a dimension, is this scale only applicable to curled up ones? Is it possible to describe to a layman the shape of the universe without resorting to inept analogies?


I have a whitespace that's taking up about half a page between an image and my text in one of my columns of a two-column paper. It looks like this (contents blurred). How do I get rid of this space? Thanks!

I have a problem. I have several large equations within the text. And when LaTeX does not manage to put the equation on the same page and moves it to the next one, he spreads the paragraphs of the text in the first page. How could I prevent this? I know about \pagebreak and \newpage, but I do not want to force the \newpage, as the text may move (if I add something later or so on) and the pagebreaks may not be valid. I would like to make LaTeX not to spread the paragraphs over a page automatically. Is it possible?  I tried to make an example:  \documentclass[a4paper,12pt,twoside]{book} \usepackage{amsmath} \begin{document}  LaLaLa\\\  LaLaLa\\\  LaLaLa\\\  LaLaLa\\\  \begin{eqnarray} 123&+&123 \\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ \end{eqnarray}  LaLaLa\\\  LaLaLa\\\  \begin{eqnarray} 123&+&123 \\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ 123&+&123 \nonumber\\\ \end{eqnarray}  \end{document}


I downloaded this model as an .obj and it came with this alternate color for some of the faces. What is it and how can I remove it. Thank you.

While rendering a mesh with smooth shading on, I get a dark region/shadow on certain faces. The effect is more evident when smooth shading is applied to a mesh containing ngons, with the ngons turning black when rendered.   The blackening effect is visible in the viewport too.  How can I solve this problem?


Im trying to parse strings of coordinates using System.Single.Parse, but when the numbers are too low odd thing occur. Example:  System.Single.Parse " 0.0001";;   val it : float32 = 9.99999975e-05f

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


Let $G$ be a group, $H$ be a subgroup of $G$ and $h$ be a fixed element of $G$. Show that the subset $gHg^{-1}=\{ghg^{-1}:h\in H\} $ is a subgroup of $G$.  I know of the one and two-step tests for subgroups but I'm at a loss on how to implement either of them as I'm not sure what the inverse is.

Let $G$ be a group and $H$ a subgroup of $G$. For $x \in G$, prove $x^{-1}Hx$ is a subgroup of $G$.


I'm new to java programming. I would like to round up a price to the nearest 2 decimal places with a multiple of 5.  Eg.   38.80 stays the same. 38.81 to 38.80. 38.82 to 38.80. 38.83 to 38.85. 38.84 to 38.85. 38.85 stays the same. 38.86 to 38.85. 38.87 to 38.85. 38.88 to 38.90. 38.89 to 38.90. 38.90 stays the same.   I tried the provided duplicates but they come out only to 1 decimal place. Eg. 38.82 to 38.8.  This is my code:  import java.text.DecimalFormat;  public class RoundUp {      public static void main(String[] args){         DecimalFormat df = new DecimalFormat("#.##");         double num = 38.84;         System.out.println(df.format(Math.round(num*10.00)/10.00));     } }   I have looked into other model answers by experts in this web but none of them really answer my question. Setting into 2 decimal places, I'm using DemicalFormat. That I know, but rounding the number, let's say 38.83 to 38.85 and 38.87 to 38.90 is what I really want.  It is a rounding system that my country is using. Can check it out .  **     This question has been answer by @Mureinik  double rounded =   Math.round(num * 100.0 / 5.0) * 5.0 / 100.0;   **

What I would like is a method to convert a double to a string which rounds using the half-up method - i.e. if the decimal to be rounded is 5, it always rounds up to the next number. This is the standard method of rounding most people expect in most situations.  I also would like only significant digits to be displayed - i.e. there should not be any trailing zeroes.  I know one method of doing this is to use the String.format method:  String.format("%.5g%n", 0.912385);   returns:  0.91239   which is great, however it always displays numbers with 5 decimal places even if they are not significant:   String.format("%.5g%n", 0.912300);   returns:  0.91230   Another method is to use the DecimalFormatter:  DecimalFormat df = new DecimalFormat("#.#####"); df.format(0.912385);   returns:  0.91238   However as you can see this uses half-even rounding. That is it will round down if the previous digit is even. What I'd like is this:  0.912385 -> 0.91239 0.912300 -> 0.9123   What is the best way to achieve this in Java?


Check The Terminal Window - 'Minimize, Maximize, Close' buttons are covered by the icon:

A while ago I upgraded from Ubuntu 17.04 to Ubuntu 17.10 and everything is working fine except for the fact that the icon in the window title bar of my Terminal seems to be stretched out to some ridiculous size.    This only seems to happen in the Terminal window. The Nautilus icon is completely fine.    The problem seems to go away if I login into an Xorg session instead of a Wayland one. I've looked around and didn't find any immediate solution to this. Any help would be greatly appreciated.


I've an application which runs on linux where I need to gather the performance statistics (CPU usage, Memory usage, Disk usage etc) from inside the application itself.  As I observed there are two methods to achieve this.  First one is to execute a tool like pidstat or sar from the c++ code and process the result and gather information and save them in a database Second method is to follow the method mentioned in below ticket.    I need to know the recommended way of doing this. I might need to gather around 10 performance statistics fields (like CPU Usage, Memory Usage, Disk Usage etc).

I once had the task of determining the following performance parameters from inside a running application:   Total virtual memory available Virtual memory currently used Virtual memory currently used by my process Total RAM available RAM currently used RAM currently used by my process % CPU currently used % CPU currently used by my process   The code had to run on Windows and Linux. Even though this seems to be a standard task, finding the necessary information in the manuals (WIN32 API, GNU docs) as well as on the Internet took me several days, because there's so much incomplete/incorrect/outdated information on this topic to be found out there.  In order to save others from going through the same trouble, I thought it would be a good idea to collect all the scattered information plus what I found by trial and error here in one place.


Working with .war files. The files were associated with the Archive Manager. However, I installed a tool called Astah professional. Now .war files are associated with Astah. How can I change this behavior?

gedit is set by default to open about any source file. I've gone through the file properties and changed default application to VIM for C and C++ files.  I'd need to do this for any source file I open now, for python files, for text files, for ruby, any, since gedit is set to open all of them.  How can I change this to open with VIM without going the hassle of setting "open with" one by one?


So I'm a scrub at java, just started learning the language at a university course.  While trying to compare values of variables linked to objects to inserted values to make sure that there are no duplicates, I ran into an issue. It appears as if the objects are "lagging behind" in the lack of a better expression. See the commenting of the code for a better explanation.  The problem only appears if you add like 2 or more separate weapons and then try to re-add a weapon with the same name, it allows you to do so. If you add just one one weapon and then try to re-add it it says nope and the code works as intended.  So yeah, when I call the method printHeroInfo I still see that I can end up with several weapons with the same name. There is also another class called superWeapon, and if you think the code in there is relevant to this issue then let me know and I'll post that in a commment or something.  Thanks in advance for helping me with the head scratching.  import java.util.ArrayList; public class superHero{ private ArrayList<superWeapon> superWeaponList; private String superHeroName; private String superHeroInfo;  public superHero(String superHeroName, String superHeroInfo){     this.superHeroName=superHeroName;     this.superHeroInfo=superHeroInfo;     superWeaponList=new ArrayList<superWeapon>(); } public void addSuperWeapon(String superWeaponName, int superWeaponCharges){     superWeapon Obj = new superWeapon(superWeaponName, superWeaponCharges); // Making an object of the superWeapon class.     int size=superWeaponList.size(); // Gets the size of the array superWeaponList.     if(size==0){ /* If the size of the arary is zero, that means there are no weapons in it currently.         For that reason we don't need the for-loop we otherwise would need to compare the name of the weapon         we are trying to add against the pre-existing names of weapons in the array. */         superWeaponList.add(Obj);         System.out.println("The Superweapon"+superWeaponName+" has been added for the superhero "+superHeroName+".");         System.out.println(superWeaponName+" has "+superWeaponCharges+" charges.");     }     else{ /* If the size of the array is NOT zero, we need to compare the name of the weapon we are trying to add         against the weapons already existing in the array. This we do with the following for loop. */         for(int i=0;i<size;i++){             superWeapon temp_obj=superWeaponList.get(i);             String temp_name = temp_obj.getName();             System.out.println(temp_name); /* Why does the name lag behind one entry? On the second entry it also shows the first entry. On the third entry it shows the second entry and so on... The first place in an arraylist should be index=0, so the for-loop starting at 0 should also be correct, right? I just added this print to see what the current value for getName() would end up returning. This is how I found the bug/error. */             if(temp_name!=superWeaponName){ // If the name doens't match then we add a new superweapon.                 superWeaponList.add(Obj);                 System.out.println("The superweapon "+superWeaponName+" has been added for the superhero "+superHeroName+".");                 System.out.println(superWeaponName+" has "+superWeaponCharges+" charges.");             }else{ // If the names match however, we don't add the new weapon we were trying to add.                 System.out.println("There already is a superweapon with the name "+superWeaponName+                 " registered for the superhero "+superHeroName);             }          }     } } public void printHeroInfo(){     System.out.println(superHeroName);     System.out.println(superHeroInfo);     int size=superWeaponList.size();     for(int i=0;i<size;i++){         superWeapon temp_obj=superWeaponList.get(i);         System.out.println(superHeroName+" has the superweapon "+temp_obj.getName()+" with "+temp_obj.getCharges()+" charges.");     } }   }

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


The Dwarf Rings are being mentioned at the start of LOTR but no mention is made of them elsewhere despite the nine and three gathering heaps of attention.  While the dwarfs of ME are renowned for sticking to their mining and delving and smithing, only rarely coming out for light and (let's face it) the Elves aren't exactly the friendliest bunch, surely some news of the Dwarf Rings would have come to the attention of the Free peoples?  So what happened to the seven

In the Lord of the Rings it is said     "In Eregion long ago many Elven-rings were made, magic rings as you   call them, and they were, course, of various kinds: some more potent   and some less. The lesser rings were only essays in the craft before   it was full-grown, and to the Elven-smiths they were but trifles — yet   still to my mind dangerous for mortals. But the Great Rings, the Rings   of Power, they were perilous.”   [LotR I 2 (60)]   There is a clear distinction here between the 20 Rings of Power in the Ring Rhyme (the 7,9,3,and 1) and these other rings. What happened to the "lesser rings"?


I have read about new way to call ancestor's constructor via super(..).__init__() and wanted to use it. I have a directory dataset with three files: __init__.py  from .Dataset import Dataset from .CSVDataset import CSVDataset   CSVDataset.py  import csv import numpy as np from dataset import Dataset   class CSVDataset(Dataset):     """     reads dataset from csv file     """     def __init__(self, file):         Dataset.__init__(self)         #super(CSVDataset, self).__init__()         reader = csv.reader(open(file, 'r'), delimiter=',')         x = list(reader)         self.container = np.array(x).astype('double')   and Dataset.py. When I use it from ../dataset like this  from dataset import CSVDataset data = CSVDataset('test/data1')   it works only with Dataset.__init__(self). It should work with super(CSVDataset, self).__init__() but it does not. Why is that?  update: I get error  >>> data = CSVDataset('test/data1') Traceback (most recent call last):   File "<stdin>", line 1, in <module>   File "dataset/CSVDataset.py", line 13, in __init__     super(CSVDataset, self).__init__() TypeError: must be type, not classobj   Dataset draft:  class Dataset(Iterable):     """     base class representing dataset API.     Remember, dataset is used for learning.     """     def __init__(self):         self.container = None         self.counter = None     ....  class Iterable:     def __iter__(self):         self.counter = 0         return self      def __next__(self):         try:             label = self[self.counter]             self.counter += 1             return label         except:             raise StopIteration

In Python 2.5, the following code raises a TypeError:  >>> class X:       def a(self):         print "a"  >>> class Y(X):       def a(self):         super(Y,self).a()         print "b"  >>> c = Y() >>> c.a() Traceback (most recent call last):   File "<stdin>", line 1, in <module>   File "<stdin>", line 3, in a TypeError: super() argument 1 must be type, not classobj   If I replace the class X with class X(object), it will work. What's the explanation for this?


First i will like to say that, i have looked into other post but failed trying to accomplish my needs. I have used array_unique($array) but the duplicates don't get discarded. This is a view of my array using var_dump:  {   [0]=>   string(12) "44.94.192.40" } array(1) {   [0]=>   string(12) "44.94.192.41" } array(1) {   [0]=>   string(9) "44.94.1.1" } array(1) {   [0]=>   string(9) "44.94.1.1" } array(1) {   [0]=>   string(13) "44.96.253.100" }   "44.94.1.1" is a duplicate which i hope to remove but i can't. Does this have to do with my array structure ?

How can I remove duplicate values from a multi-dimensional array in PHP?  Example array:  Array (     [0] => Array     (         [0] => abc         [1] => def     )      [1] => Array     (         [0] => ghi         [1] => jkl     )      [2] => Array     (         [0] => mno         [1] => pql     )      [3] => Array     (         [0] => abc         [1] => def     )      [4] => Array     (         [0] => ghi         [1] => jkl     )      [5] => Array     (         [0] => mno         [1] => pql     )  )


There are plenty of questions out there asking what complex numbers mean and I never seem to get any of them.   I have a few specific questions i want to ask about complex numbers.  1) what is the difference between $ (x,y) \in R^{2}$ and $(x,y) \in C$?  2) would something like $\hat{x} + \hat{y} + i$, where $\hat{x}$ and $\hat{y}$ are unit vectors and i is $\sqrt{-1}$, make sense ?

What are the basic differences between $\mathbb C$ and $\mathbb R^2$?  The points in these two sets are written as ordered pairs, I mean the structure looks similar to me. So what is the reason to denote these two sets differently?


I am not sure whether I have used Present Perfect correctly in the following sentence:  "Influenced by my academic background and experience, my research interests are diverse and interdisciplinary. They have been shaped by the academic programs that I have completed, which provided me with good foundations to explore different topics in the field of English Linguistics, Literature and Culture.  Can you help me out?

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


I am trying to gain a better understanding as to how SQL Server caches query plans.  For the following table(Populated with the values 1-500,000):  CREATE TABLE [dbo].[Test] ([ID] INT PRIMARY KEY);   And the following stored procedure:  CREATE PROCEDURE [dbo].[TestGet]     @ID INT AS BEGIN;     IF(@ID IS NOT NULL) BEGIN;         SELECT [ID]         FROM [dbo].[Test]         WHERE [ID] = @ID;     END;     ELSE BEGIN;         SELECT [ID]         FROM [dbo].[Test];     END; END;   Making the following two calls:  EXEC [dbo].[TestGet] @ID = 1000; EXEC [dbo].[TestGet] @ID = NULL;   Results in two different plans in the query plan cache:    If the stored procedure were re-written as:  CREATE PROCEDURE [dbo].[TestGet]     @ID INT AS BEGIN;     SELECT [ID]     FROM [dbo].[Test]     WHERE [ID] = @ID OR @ID IS NULL; END;   And the same two calls were made:  EXEC [dbo].[TestGet] @ID = 1000; EXEC [dbo].[TestGet] @ID = NULL;   Only a single query_hash, and query_plan_hash are cached:    The calls to the stored procedure have the same shape in both cases.  Why does one the first stored procedure and call generate two cached plans, with a different query_hash, and a different query_plan_hash?  What criteria is SQL Server using to generate these hashes?

SQL Server 2012 and 2016 Standard:  If I put if-else logic in a stored procedure to execute one of two branches of code, depending on the value of a parameter, does the engine cache the latest version?  And if on the following execution, the value of the parameter changes, will it re-compile and re-cache the stored procedure, since a different branch of the code must be executed? (This query is quite expensive to compile.)


My situation: I got a Win10 system with ONE physical (afaik) HDD of one terabyte. I want to dual boot with Win8. I tried to do it, but it gave me an error that said the HDD was GPT and that I needed an NTFS partition if I wanted to install Win8. And that it couldn't install Win8 on a GPT disk, only on a NTFS disk. I used Windows own application DSKMGMT.MSC to make 40 GB NTFS partitions to install Win8 and/or Ubuntu and/or Win7 on. Apparently these aren't the right type of NTFS partitions. They are GPT-NTFS, not MBR-NTFS, which is apparently what Win8 needs(?)  Now, I've seen info that if you format a partition, it will in fact format the WHOLE physical HDD, not just the partition. (I am not used to that, I was used to the situation that one can format different partitions in different ways.)  My questions are;   Is that true? Because that would mean that dual booting is impossible between Win10 and Win8, which seems highly unlikely. If it IS possible to reformat the HDD from a GPT partition to a NTFS partitions for Windows 8 install/dualboot on a Windows 10 system, then HOW? And yes yes, I do get that GPT is a partitioning table and NTFS is a file system, but this is the confusing error message that Win10 gives   I got a Lenovo g50-80L000H2US laptop.

I have an Acer Aspire E15 laptop, of my friend, in which I have been trying to install Windows 8 but I am unable to do so. It has 4 partitions:  Partition 1: total: 900MB - free: 900MB - type: Primary Partition 2:  total: 128MB - free: 128MB - type: MSR Partition 3:  total: 447.9GB - free: 447.9GMB - type: Primary Partition 4:  total: 16GB - free: 16GMB - type: Recovery   When I select partition 3 to install OS it says "windows cant be installed because it is GPT type" or something similar. How do I install in this partition?  Additional info: -without installation disc it shows "no bootable device- insert boot disc and press any key" so cant restore or repair. BIOS: -boot mode selected : Legacy (when switched to UEFI it says "no installation disc is inserted) -HDD name and serial numbers are visible in BIOS.  How do I fix this issue? Do I need other installation media? or do I have any problem with my HDD?


I am getting  time data '2015-02-10T13:00:00Z' does not match format '%Y-%m-%d %H:%M:%S'   I tried:   import datetime datetime.datetime.strptime('2015-02-10T13:00:00Z', '%Y-%m-%d %H:%M:%S')   and   import time time.strptime('2015-02-10T13:00:00Z', '%Y-%m-%d %H:%M:%S')   what am I doing wrong?

I need to parse  strings like "2008-09-03T20:56:35.450686Z" into Python's datetime type.  I have found  in the Python standard library, but it is not very convenient.  What is the best way to do this?


To calculate $\lim_{x\rightarrow +\infty}\cos(\sqrt{x+1})-\cos(\sqrt{x})$ can I use prostaferesis formula?

Evaluate $$\lim_{x\to \infty} \cos (\sqrt {x+1})-\cos (\sqrt x)$$   For this question I have tried using the squeeze theorem and some trigonometric manipulations such as using $$2\sin A\sin B=\cos (A-B) -\cos (A+B)$$.  But they were of no use. I also tried using the substitutions like $$x=1/y$$ Hence as $x\to \infty$ , $y\to 0$ but still no success.  I could've also tried using L'Hospital rule but I am not able to convert the function in appropriate indeterminate form. Any help would be greatly appreciated


How can I type to "All chat" in Heroes of the Storm?  And if you can't, are there ways to say GG/WP? I noticed someone on the enemy team did this the other day, but I don't know how.

Is it possible to write to the common chat during Heroes of the storm game?  'Enter' gives me allies chat only, 'Cmd+Enter', 'Alt+Enter' (on Mac) don't help either.


I am currently learning Set Theory from Paul Halmos' Naive Set Theory. In the section about the axiom of specification, while dealing with Russell's Paradox, the author defined the set $B$ as:  $B=\{x  \epsilon  A: S (x)\}$  with $S(x)$ as  not$(x\epsilon x)$  How is $\epsilon$ used here? If it symbolises the relation 'belongs to' then how can an element belong to itself? It also proceeds, in the proof, to use such statements as:  ...if $B \epsilon A$, then either $B \epsilon B$ also or else $B \epsilon' B$...  How can this set $B$ 'belong' to $A?$ $B$ can be is a subset of $A$, and it had been previously made clear that '$\epsilon$' and '$\subset$' are very different relations between elements and sets, or along sets. Any help is appreciated. Thank You!

In Russell's famous paradox ("Does the set of all sets which do not contain themselves contain itself?") he obviously makes the assumption that a set can contain itself. I do not understand how this should be possible and therefore my answer to Russell's question would simply be "No, because a set cannot contain itself in the first place."  How can a set be exactly the same set as the one that contains it? To me it seems unavoidable that the containing set will always have one more additional level of depth compared to all the sets which it contains, just like those russian matryoshka-dolls where every doll contains at least one more doll than all the dolls inside it.  Of course one can define something like "the set of all sets with at least one element" which of course would include a lot of sets and therefore by definition should also include itself, but does it necessarily need to include itself just because its definition demands so? To me this only seems to prove that it's possible to define something that cannot exist beyond its pure definition.


I'm currently reviewing ideals and I'm struggling specifically on how to express ideals of matrix rings. For instance, what would be the ideals of $M_2(\mathbb{Z}_6)$? I know that the ideals of $\mathbb{Z}_6$ are $(0),(1) = (5),(2) = (4)$, and $(3)$ and in general, if $I$ is an ideal of $R$ then $M_n(I)$ is an ideal of $M_n(R)$. Would it be valid to express the ideals of $M_2(\mathbb{Z}_6)$ as $M_2((0))$, $M_2((1))$, and so on?

What are the left and right ideals of matrix ring? How about the two sided ideals?


Let K ⊂ L be an extension. Let α ∈ L algebraic over K. Show that α^2 is algebraic over K, and that if [K(α):K] is odd, then K(α^2) = K(α). is α^2 algebraic over K, because α is algebraic over K? How can i show this?

Let $E$ be an extension field of $F$. If $a \in E$ has a minimal polynomial of odd degree over $F$, show that $F(a)=F(a^2)$.  let $n$ be the degree of the minimal polynomial $p(x)$ of $a$ over $F$ and $k$ be the degree of the minimal polynomial $q(x)$ of $a^2$ over $F$.   Since $a^2 \in F(a)$, We have $F(a^2) \subset F(a)$, then $k\le n$  In order to prove the converse:  $q(a^2)=b_0+b_1a^2+b_2(a^2)^2\ldots+b_k(a^2)^k=0$   implies   $q(a)=b_0+b_1a^2+b_2a^4\ldots+b_ka^{2k}=0$ Then   $p(x)|q(x)$, because $p(x)$ is the minimal polynomial of $a$ over $F$.  If I prove that $n|2k$ we done, since $k$ is odd, we have $n|k$ and $n\le k$ and finally $n=k$.  So I almost finished the question I only need to know how to prove that $n|2k$ It should be only a detail, but I can't see, someone can help me please?  Thanks


I am trying to combine two presentations into one tex file. After the title of the second one, I still get the sidebar components of the first presentation. Do you know any way to 'restart' the sidebar to reflect only the second table of contents?

I have too many sections in my presentation such that the left-hand-side navigation bar is full and only shows the first sections in Fig. 2, initial situation in Fig. 1.  Pseudocode    clean the left-hand-hand side navigation bar when exceed the threshold and start a new one there when on sufficient page  this feature occurs with Beamer Berkeley appendix so it is possible also with the main document   Code which problem shown in Fig. 2   \documentclass{beamer} \usetheme{Berkeley}  \logo{\includegraphics{logo.png}} \usepackage{hyperref} % https://tex.stackexchange.com/a/346486/13173 \newenvironment{slide}[1] {\begin{frame}[environment=slide,allowframebreaks] \frametitle{\insertsection-#1} } {\end{frame}} % fragile only if code % allowframebreaks not by default   \begin{document}  \title{Sensory system. Primary sensory modalities. Cortical modalities. Kinds of sensory disturbances. Spinal cord disorders. Spinal cord transverse and partial lesion. Cauda equina damage.} \author{Leo}  \section{Cortical modalities} \begin{slide}{basics}      More refined aspects of sensation ... \end{slide}  \section{Cortical modalities} \begin{slide}{basics}      More refined aspects of sensation ... \end{slide}  \section{Cortical modalities 2} \begin{slide}{basics}      More refined aspects of sensation ... \end{slide}  \section{Cortical modalities 3} \begin{slide}{basics}      More refined aspects of sensation ... \end{slide}  \section{Cortical modalities 4} \begin{slide}{basics}      More refined aspects of sensation ... \end{slide}  \end{document}   Fig. 1 Situation at the first page,  Fig. 2 Situation at Section 6 wheere the navbar has not changed,  Fig. 3 Samcarter's answer output + one slide addition but without \part{} - fails on sufficient page count       Output: the left-hand-side navigation bar is not refreshed when the amount of sections exceed its capacity on suffcient enough page     Testing Samcarter's proposal  I include one slide before Samcarter's body so I get the wrong output in Fig. 3.  Solution: Eventually correct output by just adding \part{} in the place where the new navbar is wanted.   TeXLive: 2016 OS: Debian 8.7


I've searched the Internet for quite a long time, but I can't find a combobox that fits my needs. Can anyone help me? Thanks in advance!  What I need is a dropdownlist that has an editable box, which acts exactly as the combobox in a Windows desktop application. I have a list of values for the user, but I also want them to be able to type in a value if the list doesn't contain the value they need. I'm using ASP.NET MVC, so I want to make sure the control can be bound by the default model binder. Thanks!  Best regards

Are there any professional Combobox controls (dropdown list with autosuggestion) based on the jQuery library?  It should be able to handle large datasets and have some skinning options. A multi-column result list would be great too. I'm working with ASP.NET, but it's a not a problem if I had to write a wrapper for it.    I'm already using a third-party control, but I ran into some compatibilty issues between two vendor's controls. Well, I want to get rid of this kind of dependencies.


Why does philosophy.stackexchange suddenly label me as a new contributor when in fact I have already posted many questions in the last 2 years? It this related to deleting cookies from my pc?

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


I can't understand how to prove that $ \sum\nolimits_{n=1}^{ \infty } u_n(x)$ converges uniformly at $[0,1]$, when $u_n(x) = (-1)^n*(1-x)*x^n$. I tried using Weierstrass M-test - bounding those functions with a converging series $ \sum M_n$, which will result in $ |u_n(x)| \leq \sum M_n$. But after 1 and 1/2 hours I couldn't find the right usage here. I'm aware of the other question linked to that, but it doesn't answer exactly the same thing. Would much appreciate help. Thank you!

Let $f_n(x) = x^n(1-x)$ and $\sum (-1)^nf_n(x)$.  I showed that this series point wise.  Case1) $x=1$ $$ f_n(1)=0 \, , \sum{(-1)^nf_n(1)} = 0 $$ Case2) $x\neq 1$ $$|f_n(x)| \leq |x|^n$$ since $$\sum |x|^n$$ converges, By abosultely convergese test $\sum (-1)f_n(x)$ converges.  I want to show that this series uniformly converges on $[0,1]$.


So I was attempting to help someone over at CodeReview, and my suggested code didn't compile! Oh no!  Now, this code is substantially different from their original code, so I feel no qualms posting my botched answer with you guys.  The compiler (STS) is complaining about line 14 in my code students[i] = new Student();.  Here's my error:  Exception in thread "main" java.lang.Error: Unresolved compilation problem:      No enclosing instance of type studentexams is accessible.  Must qualify the allocation with an enclosing instance of type studentexams (e.g. x.new A() where x is an instance of studentexams).      at cr_studentscoreaverager.studentexams.main(studentexams.java:16)  I am not asking for a critique of the code or style, just my implementation of the Student class resulting in my compile error.  Here is my code in its entirety.  import java.util.Scanner;  public class studentexams {      public static void main(String[] args)      {         Scanner input = new Scanner(System.in);          Student[] students = new Student[20];          for (int i = 0; i < 20; i++)         {             students[i] = new Student();             students[i].setStudentName("Student " + (i+1));             System.out.print("Enter the first score: ");             students[i].setScores(0,  input.nextInt());             System.out.print("Enter the Second Score: ");             students[i].setScores(1,  input.nextInt());             System.out.print("Enter the third Score: ");             students[i].setScores(2,  input.nextInt());             System.out.println("The Average Score is " + students[i].getAverage());         }          System.out.println("Student" + "\t" + "Average");          for(int i = 0; i < 20; i++)         {             System.out.println(students[i].toString());         }      }      public class Student     {         private String studentName;         private int[] scores = new int[3];         private double average;          public Student()         {         }          private String getStudentName()         {             return this.studentName;         }          public void setStudentName(String studName)         {             this.studentName = studName;         }          public void setScores(int index, int score)         {             this.scores[index]=score;         }          public double getAverage()         {             average = (double) (scores[0]+scores[1]+scores[2])/3;             return average;         }          public String toString()         {             return this.getStudentName() + "\t\t" + this.getAverage();         }     } }

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?


I want to know how to make a program that you can edit and run. The problem is I don't know what the file extension is, like how you can make a text document on windows and save as filename.bat.

In Windows I can write a file containing commands for cmd (usually .cmd or .bat files).  When I click on those files it will open cmd.exe and run them commands the file contains.  How would I do this in Ubuntu?         I'm sure this is a duplicate, but I can't find my answer. Its similar to these questions, but they don't answer the question:


I have a class that places a text into an arrayList. Then it makes all the variables into CharSequences, when I try to compare the variables to a String such as == "test"; it doesn't work here is my code that I use to get the variables  class Item {             String descs;              public Item (String descs){                   this.descs = descs;                   }               public CharSequence getDescs() {                 return descs;             }         }   This is the code that compares it to the String   if(p.getDescs().toString() == "trash"){            descsView.setVisibility(View.GONE);                              }            else{               descsView.setText(p.getDescs());                              }   I know for a fact that p.getDescs() is equal to trash because when it sets the text for descsView it is set to trash. SO why doesn't the first if statement work?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


private void addButtonPressed() {     String newbarcode = barcodeTF.getText();     String newitemName = itemNameTF.getText();     String newprice = priceTF.getText();      if (newbarcode.equals("") || newitemName.equals("") || newprice.equals("")) {         JOptionPane.showMessageDialog(this, "Please Enter Full Details");     } else {         stock.addCheckoutItem(newbarcode, newitemName, newprice);         CheckoutItem newBasket = stock.findItemByName(newbarcode);         stockList.setSelectedValue(newBasket, true);         clearAllTextFields();     } }   It is called through an actionlistener on one of the buttons within my program however keeps throwing out exception errors when running.. Any help is appreciated. Thank you.  Edit : Exception details added below.  Exception in thread "AWT-EventQueue-0" java.lang.NullPointerException     at EditStockGUI.addButtonPressed(EditStockGUI.java:447)     at EditStockGUI.access$4(EditStockGUI.java:446)     at EditStockGUI$10.actionPerformed(EditStockGUI.java:352)     at javax.swing.AbstractButton.fireActionPerformed(Unknown Source)     at javax.swing.AbstractButton$Handler.actionPerformed(Unknown Source)     at javax.swing.DefaultButtonModel.fireActionPerformed(Unknown Source)     at javax.swing.DefaultButtonModel.setPressed(Unknown Source)     at javax.swing.plaf.basic.BasicButtonListener.mouseReleased(Unknown Source)     at java.awt.Component.processMouseEvent(Unknown Source)     at javax.swing.JComponent.processMouseEvent(Unknown Source)     at java.awt.Component.processEvent(Unknown Source)     at java.awt.Container.processEvent(Unknown Source)     at java.awt.Component.dispatchEventImpl(Unknown Source)     at java.awt.Container.dispatchEventImpl(Unknown Source)     at java.awt.Component.dispatchEvent(Unknown Source)     at java.awt.LightweightDispatcher.retargetMouseEvent(Unknown Source)     at java.awt.LightweightDispatcher.processMouseEvent(Unknown Source)     at java.awt.LightweightDispatcher.dispatchEvent(Unknown Source)     at java.awt.Container.dispatchEventImpl(Unknown Source)     at java.awt.Window.dispatchEventImpl(Unknown Source)     at java.awt.Component.dispatchEvent(Unknown Source)     at java.awt.EventQueue.dispatchEventImpl(Unknown Source)     at java.awt.EventQueue.access$200(Unknown Source)     at java.awt.EventQueue$3.run(Unknown Source)     at java.awt.EventQueue$3.run(Unknown Source)     at java.security.AccessController.doPrivileged(Native Method)     at java.security.ProtectionDomain$1.doIntersectionPrivilege(Unknown Source)     at java.security.ProtectionDomain$1.doIntersectionPrivilege(Unknown Source)     at java.awt.EventQueue$4.run(Unknown Source)     at java.awt.EventQueue$4.run(Unknown Source)     at java.security.AccessController.doPrivileged(Native Method)     at java.security.ProtectionDomain$1.doIntersectionPrivilege(Unknown Source)     at java.awt.EventQueue.dispatchEvent(Unknown Source)     at java.awt.EventDispatchThread.pumpOneEventForFilters(Unknown Source)     at java.awt.EventDispatchThread.pumpEventsForFilter(Unknown Source)     at java.awt.EventDispatchThread.pumpEventsForHierarchy(Unknown Source)     at java.awt.EventDispatchThread.pumpEvents(Unknown Source)     at java.awt.EventDispatchThread.pumpEvents(Unknown Source)     at java.awt.EventDispatchThread.run(Unknown Source)


Did the younger Nebula shoot and kill the older in Avengers: Endgame or was it the other way around?  and Was the shot fatal?

In Avengers: Endgame,      Present-Nebula kills Past-Nebula.   I'm confused. Wouldn't it cause a grandfather paradox?  Then how did she survive?


Background  I am DMing for a group of brand new players who come into D&D without really much of any role-playing experience, even as far as video games. The group is small with 3 players; A Forest Circle Druid, a Beastmaster Ranger who likes to get into melee, and a War Domain Cleric.  We are running through the "Lost Mines of Phandelver" campaign to start with. I am new at DMing myself. We play without maps or tokens, mostly because I work 55 hour weeks and don't have a lot of time to make maps. The party is currently level 2 and so far I haven't been making any changes to the combat encounters.  The Issue  Some encounters are starting to follow a pattern where the enemies come at the players, who are basically standing side-by-side. The number of enemies tends to be about four, and so on their turn they move into attack range in (almost) a 1-on-1 face-off with one player character facing two enemies. Then there is a boring brawling match where each player or the enemies roll to hit, roll damage, and repeat. The player who beats their enemy first moves on to help a teammate, until they win the battle.  The players do use spells at the start of the battle to quickly take out one or two enemies before the bash-match, but don't want to use too many resources too quickly (a concern that is well-founded)  This happened once before, and I wrote it off as something that will get better, but on our last session it happened again and I was suddenly very aware that the players were bored as the combat dragged on while everybody was getting poor attack rolls. I tried to make the enemies change tactics, by grappling and shoving, which slightly mitigated the effect but was too little and too late to turn the overall battle into a good experience.  Question  While at least roughly following the starter campaign encounter concepts, how can I keep combat from becoming a boring brawling match for this party?

How can I help combat be more diverse? I'm a player, but I'm open to suggesting things to my DM.  We are a party of 5th-level PCs. What we run into is the classic tactical situation every time: the barbarian and cleric tank, and the ranger (me) and wizard sit back and plink away or get in melee and are, well, making death saves. Another thing that happens is the wizard spell-shaping and just fireballing everything, unless he's in melee combat and trying to just kite and run.  Do I just try and get the DM to throw in more opposing mages and such? I wanna use my ranger kit but still have threats/challenges.  Another way to phrase my problem would be: how to engage more classes in combat?


The full question is to solve $f(x)f(2x^2) = f(2x^3+x)$, prove there are at most one solution per degree of $f(x)$ and then find all the solutions. (Here $f(x)$ is assumed to be polynomial.)  So far I have proven that $(x^2+1)^n$ works for even degree polynomials, and I'm pretty near certain there are no odd solutions.  Is the following a valid argument for there only being at most 1 solution per degree? Let $K$ be the degree of $f(x)$ then $f(x)f(2x^2) = f(2x^3+x)$ produces $3k+1$ linearly independent equations with only $k+1$ independent variables. Therefore for any degree $K$ polynomial there can be at most 1 solution.  Finally, is there any elegant way to prove that no odd solutions exist?

Find all polynomials $f(x)$, for which $f(x)f(2x^2)=f(2x^3+x)$.   I have no idea how to do it.


Firstly, I seemed to have messed something up in the About This Mac storage tab as I can't see the remaining storage.as seen in this picture.  And while I'm at it, what is the best way to free up storage?

Every few days I get notices on my MacBook that it's running or run out of hard drive space. Curiously, restarting the computer will enable me to recover gigabytes of space (this past time, it was able to recover about 2.2GB). However, I can't identify anything in my personal activity that consumed that space.  It's possible that it's a rogue iTunes podcast or a huge software update that my Mac is automatically downloading - would either of these reclaim the space upon a restart?  One possibility that I can think of is that FileVault has some sort of disk leak, allocating but not freeing files. Does this make sense? Is there a tool that I can run to determine where this space is going? Assuming it is FileVault, should I try to disable it? What's the best way to turn of FileVault on a nearly full computer?


I'm a newbie on everything that surrounds astrophotography. I've been reading about the 500 rule and how to avoid star trails. My question is why you divide by the focal length? I mean how the focal length affects the light coming into the sensor and thus having star trails. I know its not an accurate science but I'm just curious.  Thank you :)

mentions the "Rule of 600" for avoiding star-trails in astrophotography.   What is this rule? How was it derived? How should it be applied?


It is said that when requesting a short stay Schengen visa you must follow this rule:     You must apply for a visa in the representation of the Schengen   country in which lies the main reason/purpose of your trip or the   representation of the Schengen country where you will remain longer.   If the length of stay is the same for many countries, you need to   apply in the representation of the Schengen country where you will   arrive first.   However, if my country starts to take part of the visa waiver program, do I need to follow the same rule from above and even if a visa is not needed anymore?   It seems that embassies are very picky with this (at least with visa applicants) but I wonder what to expect when no visa is needed you arrive in one of these Schengen countries.

In case, if I get a multiple-entry Schengen visa in one of the embassies in Ukraine, Kyiv - should my first trip be to the country which issued the visa?  Any there any requirements of this sort? Does this condition vary depending on embassy which issued the visa?  What are the possible consequences on not visiting that country first? Does it somehow depend on country where the embassy is (i.e. non-Schengen and not EU members)?


I have recently started using generic methods in my projects. I am working on a chess project where every piece class extends to Pieces.java.    And in the Player.java, I have added this code:  public class Player {     Pieces[] pieces = new Pieces[16];     Player() {         …         init();     }     private void init() {         //initialize pieces array with all pieces.         pieces[0] = new Pawn(new Point(6, 0), this);         pieces[1] = new Pawn(new Point(6, 1), this);         pieces[2] = new Pawn(new Point(6, 2), this);         pieces[3] = new Pawn(new Point(6, 3), this);         pieces[4] = new Pawn(new Point(6, 4), this);         pieces[5] = new Pawn(new Point(6, 5), this);         pieces[6] = new Pawn(new Point(6, 6), this);         pieces[7] = new Pawn(new Point(6, 7), this);         pieces[8] = new Rook(new Point(7, 0), this);         pieces[9] = new Knight(new Point(7, 1), this);         pieces[10] = new Bishop(new Point(7, 2), this);         pieces[11] = new Queen(new Point(7, 3), this);         pieces[12] = new King(new Point(7, 4), this);         pieces[13] = new Bishop(new Point(7, 5), this);         pieces[14] = new Knight(new Point(7, 6), this);         pieces[15] = new Rook(new Point(7, 7), this);     }     public <T extends Pieces> T getPiece(Point point) {         for(Pieces piece: pieces) {             if(piece.isAlive() && piece.getCurrentPoint().equals(point))                 return (T)piece;         }         return null;    } }   But now, IntelliJ gives me a warning, "Unchecked cast from "Pieces" to T. Even when I mentioned that  and all the elements of pieces array is a subclass of Pieces, even then IntelliJ gives me a warning: "Unchecked cast from Pieces to T". How am I supposed to fix this.  Please do not mark this as duplicate because the answer of other questions have not helped me.

Eclipse is giving me a warning of the following form:     Type safety: Unchecked cast from Object to HashMap   This is from a call to an API that I have no control over which returns Object:  HashMap<String, String> getItems(javax.servlet.http.HttpSession session) {   HashMap<String, String> theHash = (HashMap<String, String>)session.getAttribute("attributeKey");   return theHash; }   I'd like to avoid Eclipse warnings, if possible, since theoretically they indicate at least a potential code problem.  I haven't found a good way to eliminate this one yet, though.  I can extract the single line involved out to a method by itself and add @SuppressWarnings("unchecked") to that method, thus limiting the impact of having a block of code where I ignore warnings.  Any better options?  I don't want to turn these warnings off in Eclipse.  Before I came to the code, it was simpler, but still provoked warnings:  HashMap getItems(javax.servlet.http.HttpSession session) {   HashMap theHash = (HashMap)session.getAttribute("attributeKey");   return theHash; }   Problem was elsewhere when you tried to use the hash you'd get warnings:  HashMap items = getItems(session); items.put("this", "that");  Type safety: The method put(Object, Object) belongs to the raw type HashMap.  References to generic type HashMap<K,V> should be parameterized.


These are the monthly plot produced by eviews. Why is the discrepancy happened? Also the X-12 says identifiable seasonality is not present using F test for seasonality.  Can I say that the seasonality does not exist in the data? What is the oscillation pattern at the seasonal decomposition?

I'm completely new to forecasting so please correct me if I'm wrong.  I'm trying to forecast sales data using R. My main concern is that when I decompose the data using stl() from stats package, it shows a seasonal component whereas when I use ets() or auto.arima() commands, they do not take a seasonal component into account. Can anyone please suggest to me where I am going wrong? Which method should I prefer?  I would like to do forecast for Aug15-Dec15.  My data are as follows:  Month      Year Amount January    2010 7632 February   2010 6686 March      2010 3442 April      2010 4556 May        2010 7796 June       2010 1534 July       2010 1466 August     2010 3535 September  2010 2503 October    2010 7534 November   2010 1197 December   2010 5861 January    2011 8846 February   2011 7219 March      2011 5066 April      2011 13177 May        2011 7833 June       2011 5585 July       2011 6392 August     2011 5787 September  2011 13488 October    2011 9413 November   2011 7610 December   2011 11301 January    2012 14912 February   2012 13578 March      2012 12091 April      2012 14628 May        2012 10703 June       2012 7373 July       2012 13638 August     2012 10794 September  2012 12186 October    2012 8137 November   2012 7874 December   2012 7707 January    2013 11569 February   2013 13446 March      2013 10339 April      2013 19086 May        2013 15201 June       2013 11741 July       2013 19368 August     2013 15755 September  2013 12214 October    2013 13859 November   2013 13096 December   2013 14548 January    2014 16191.1 February   2014 23122.3 March      2014 21421.6 April      2014 20904.5 May        2014 19711.5 June       2014 9481.9 July       2014 18699 August     2014 21271.9 September  2014 19515.5 October    2014 19890.6 November   2014 16789 December   2014 31409.3 January    2015 21917.2 February   2015 24911.4 March      2015 26072.4 April      2015 23919.3 May        2015 26980.8 June       2015 41661.2 July       2015 27065.4 August     2015  September  2015  October    2015  November   2015  December   2015    My R code:  x.ts <- structure(c(7632, 6686, 3442, 4556, 7796, 1534, 1466, 3535,     2503, 7534, 1197, 5861, 8846, 7219, 5066, 13177, 7833, 5585, 6392,      5787, 13488, 9413, 7610, 11301, 14912, 13578, 12091, 14628, 10703,      7373, 13638, 10794, 12186, 8137, 7874, 7707, 11569, 13446, 10339,      19086, 15201, 11741, 19368, 15755, 12214, 13859, 13096, 14548,      16191.1, 23122.3, 21421.6, 20904.5, 19711.5, 9481.9, 18699, 21271.9,      19515.5, 19890.6, 16789, 31409.3, 21917.2, 24911.4, 26072.4,      23919.3, 26980.8, 41661.2, 27065.4, NA, NA, NA, NA, NA),   .Tsp = c(2010, 2015.91666666667, 12), class = "ts")  fit <- stl(x.ts,na.action = na.omit,s.window = "periodic",robust = T) plot(fit) summary(ets(x.ts))  fit2 <- auto.arima(x = x.ts, stepwise = F, approximation = F) summary(fit2)     EDIT:  ets(x.ts)$aicc [1] 1404.23     ETS       AICc      AAN    1404.26631    ANN    1404.23046    MNN    1411.95791    MAN    1404.40096    MMN    1400.49486


We do citations when we refer to someone else’s papers but what about lecture notes? If I come across someone’s lecture notes which has a different way of presentation of a theorem or some problem and I wish to expose my students to it, how do I make use of it? Can I use the other person’s diagrams or solutions and give them the credit?

When learning a new subject, I would frequently use lecture notes found somewhere in the Internet. When writing a paper (or a master thesis, as in my case, but the rules should be similar, I believe) one should give some reference for used results which are not common knowledge, if I understand correctly. This make me wonder: what do I do if I want to reference a result I found in some notes?  The natural thing to do would be to just add these notes to bibliography. What format would be preferable for this? Note that there will generally not be much publishing information, perhaps not even a definite year and place. (A BibTeX template would be .)  Secondly, is it OK to cite such materials as a reference?


was asked by Henk Straten on 5 July 2017 and answered by Zach Saucier:  I have a Google Drive folder that I want to share with 2 more people. However I would like to restrict one the folders. So let's say we have John and Josh, how can I can I share the whole google drive folder with John and Josh and only a sub-folder within the drive with Josh?  My follow up question is: Can any Manager make these changes? I can add and remove members in the parent directory but the "Share" option is grayed out in the sub-directory.

I just signed up for Google G Suite and created a company shared folder as instructed . However for some reason I cannot share the folders with anyone as shown here:    I'm 100% sure I got full share and access rights (after all I created those folders). Any ideas?


when i type make   make[1]: Entering directory '/home/m7moudl3i/aircrack-ng-1.2-rc2/src' gcc -g -W -Wall -O3 -D_FILE_OFFSET_BITS=64 -D_REVISION=0  -DCONFIG_LIBNL30 -DCONFIG_LIBNL -I/usr/include/libnl3  -fstack-protector-strong -Wno-unused-but-set-variable -Wno-array-bounds -Iinclude   -c -o aircrack-ng.o aircrack-ng.c In file included from aircrack-ng.c:65:0: crypto.h:42:26: fatal error: openssl/hmac.h: No such file or directory  #include <openssl/hmac.h>                           ^ compilation terminated. <builtin>: recipe for target 'aircrack-ng.o' failed make[1]: *** [aircrack-ng.o] Error 1 make[1]: Leaving directory '/home/m7moudl3i/aircrack-ng-1.2-rc2/src' Makefile:25: recipe for target 'all' failed make: *** [all] Error 2

When compiling a source package, I got an error from make that looked like:  In file included from foo.c:28:0: bar.h:23:18: fatal error: bar.h: No such file or directory  #include <bar.h>                    ^ compilation terminated. make[x]: *** [baz] Error 1 make[x]: Leaving directory    How do I handle this?


So, i made a temple and wanted to render it. I changed the default settings of the aspect ratio ( after looking up how to do that). Everything seemed fine, but when i finally render it, the image is squashed. What did I do wrong? this is how it should look...    and this is the squashed looking render.

Why would there be a difference in aspect ratio between a rendered image, and the camera perspective in the viewport? My render is getting squashed to fit a different aspect ratio.  Here is a scene with a circle and emission shader.  Camera perspective in the viewport:   Render:


In System Preferences > Trackpad > Scroll & Zoom, there is a checkbox called Scroll Direction: Normal, which allows us to change the scrolling direction of the trackpad, but it also changes the scrolling direction of the mouse. Is there a way of changing the scrolling direction of the mouse, without changing the scrolling direction of the trackpad?  I have a  mouse, but I would like the solution to work for different and less sophisticated mouses.

In System Preferences > Mouse there's a setting "Scroll direction: natural", which I don't like, so I unset.  The problem is that this also unsets the setting for Trackpad, which I do like.    How can you have different settings for mouse and trackpad?  (In case you can't understand the rationale for wanting them different, and think this is a ridiculous question, here is the reasoning.  Mice have had scroll wheels for decades, and the direction of the wheel turning has always been in sync with the motion of the scrollbar.  This is, in my opinion, the most natural way to do things, even though it is the opposite of what Apple calls "natural".  On the other hand, I'm perfectly willing to use Apple's "natural" scrolling for trackpads, because the metaphor here is that you're moving your fingers across a page, just as if you were using an iOS device's touchscreen.  The idea that Apple treats these as the same thing, when they are conceptually completely different is very odd to me.  I don't want to change a decades-old habit with the mouse, just because Apple changed their idea of how a trackpad should work.  I embrace the trackpad change because it makes sense to anyone who uses an iPhone or iPad (and I use both) but I'm not willing to rewire my brain's way of using the mouse.)


System: Linux Mint 19.  Situation: I do not understand the following.  How can I be able to mv a directory owned by root?  Some information, that might be useful:  Actual working directory:  $ pwd  /home/vlastimil/mail   The directory I claim I am able to rename without using sudo is:  drwxr-xr-x 2 root root 4,0K Oct 24 14:34 test1/   The command I accidentally run without sudo:  $ mv test test1   And voila, I stand surprised by the fact it went ok. Why is that?  And it is reproducible. I can do e.g.:  $ mv test1 test2   Just to make it crystal clear, I run that as a normal user:  $ id -un  vlastimil   I do not suppose it would be a bug. Instead, it has probably something to do with the fact, that the directory is placed within my $HOME, am I on the right track?

I put a 64-bit ELF file in my unprivileged user's home directory. I wonder which permissions do I need to have only possiblity to rename this file being logged in as unprivileged user. From what I understand I only need execute permission for user to whom file belongs to, set for parent's directory. Is that right?  So if path to my file is /home/Simon_dir/zip and I wrote chmod 0100 /home/Simon_dir and file permissions are set to 0000, should I have rights to rename the zip file being logged in as unprivileged user?


Given two matrices $A,B$ and a base $\{v_i\}$, I want to show that $A=B$. Is it sufficient to show $Av_i=Bv_i$ for all $i$?

If $A$ and $B$ are two $4\times3$ matrices such that $A\mathbb{v}=B\mathbb{v}$ for all $\mathbb{v}\in\mathbb{R}^3$, then $A=B$?  If it's not true, can you give me an example of it?  Thank you.


$$\int_{0}^{1} \frac{\log{(1+x)}}{x^{2}+1} \ dx $$  I tried substituting x with 1/t but couldn't find the answer. Can someone provide any hint?  As many suggested I substituted x with tan t but again I got stuck at  $$\int_{0}^{\frac{π}{4}} \log{(1+tant)} \ dt $$  I finally solved it and got the correct answer.


I've been playing around with some binomial coefficients and their divisibility, and I stumbled upon a relation that seems to hold, at least for $0 < k < n < 200$ (checked with Python): $$ (k + 1) \mid \binom{n}{k}\binom{n+1}{k}. $$ I initially thought that the following reasoning would work. Since $\binom{n}{k}$ has $k$ terms in the numerator, the only way that there is no multiple of $(k+1)$ in the numerator of $\binom{n}{k}$ is when $n \equiv -1 \pmod{k+1}$. But then $(k+1)\mid(n+1)$, so there is a multiple of $(k+1)$ in the numerator of $\binom{n+1}{k}$. Unfortunately, I'm not sure if showing that there is a multiple of $(k+1)$ in the numerator of the expression is sufficient for all values of $k$. It definitely works when $(k+1)$ is prime, but if not, there is the possibility that the designated multiple of $(k+1)$ is canceled out by other terms in the denominator. So: is there a way to patch up this argument, or could this statement be proven by entirely different means? (Bonus brownie points if there's a combinatorial argument.) Thanks!

Prove that $$\frac{(n+1)(n)^2(n-1)^2...(n-k+2)^2(n-k+1)}{(k+1)(k)^2(k-1)^2...(2)^2(1)}$$ is or is not an integer for $0\leq k \leq n$, where $k$ and $n$ are integer values. This looks like $\frac{(n+1)!(n)!}{(n-k+1)(n-k)(k+1)!(k)!}$. The above statement is true for k=1 and k=2 as seen by observing modular residues. Not sure how to proceed.


I have a file with multiple information in different columns to the same ID  first | x | y | z second | x | y third | x   I want something like this:   first | x first | y first | z second | x second | y third | x

I want to know if there is an easy way to split a line in a file into multiple lines, such as this:  I have  A B C 1 2 3 4   And I want to get something like this, based on the first string of the line:  A B A C 1 2 1 3 1 4   Basically based on the first string in the line create multiple lines with the second and third and fourth string and so on.


I have a question regarding the random $k$ number of ECDSA encryption. As far as I know, it is possible to retrieve $k$ (and thus the private key) from two signed messages if both used the same $k$. This was done for the PlayStation 3 hack. I'm now trying to reproduce it in Python, using this library:   My problem is that the hack only works in some cases (at least I think so). I've not been able to reproduce it, so I hoped you could help me.  Initially we have two equations:  $s1 = k^-1 * (z1 + y) \space\%\space n$  $s2 = k^-1 * (z2 + y) \space\%\space n$  (where $y = r*privkey$)  We want to get rid of $y$ and figure out $k$. In all explanations I've seen so far, they'll do something like this:  $s1 - s2 = k^{-1} * (z1 + y) - k^{-1} * (z2 + y)$  $s1 - s2 = k^{-1} * (z1 - z2)$  $(s1 - s2) / (z1 - z2) = k^{-1}$  $k = (z1 - z2) / (s1 - s2)$  This doesn't work in my code, because the modulo operation here is just ignored. It actually should look something like this:  $i*n + s1 = k^{-1} * (z1 + y)$  $j*n + s2 = k^{-1} * (z2 + y)$  I got rid of the modulo by adding $x*$n to the left side, where $x$ is unknown. Now I'll just do the same thing as above but keep the $+ x*n$:  $i*n + s1 - j*n - s2 = k^{-1} * (z1 - z2)$  $(s1 - s2) + n*(i-j) / (z1 - z2) = k^{-1}$  $k = (z1 - z2) / ((s1 - s2) + n*(i-j))$  Obviously we do not know $i$ and $j$. We can ignore them if $i == j$ (as we did in the first calculation), which is only the case when $z1$ and $z2$ are close together or $k^{-1}$ is very small (so that it pulls the result down and therefore prevents $z1-2$ from making too much difference).  In theory $k^{-1}$ is pretty small and therfore the exploit works. But in practice I've seen that $k^{-1}$ is not used, but instead the smallest inverse modulo of k%n that is a whole number is used. This number can be really huge, which actually amplifies the difference between $z1$ and $z2$, making $i-j$ pretty large. With this implementation, I can't use the exploit as explained in theory.  My questions are:   Why is it that many implementations use the inverse modulo instead of $1/k$? (I've seen it in two so far) Wy doesn't it work when I change the implementation to use $1/k$? Is there another way to retrieve $k$, even if the $k^{-1}$ part is really large?    Since this is part of an assignment for Uni, it has to work somehow. But I already spent too much time on it without any results. Any gurus out there that can help me? :)  best regards

I have a question regarding the random $k$ number of ECDSA encryption. As far as I know, it is possible to retrieve $k$ (and thus the private key) from two signed messages if both used the same $k$. This was done for the PlayStation 3 hack. I'm now trying to reproduce it in Python, using .  My problem is that the hack only works in some cases (at least I think so). I've not been able to reproduce it, so I hoped you could help me.  Initially we have two equations: $$ s_1 = k^{-1} * (z_1 + y) \mod n \\ s_2 = k^{-1} * (z_2 + y) \mod n \\ $$ (where $y = r*\mathrm{privatekey}$)  We want to get rid of y and figure out k. In all explanations I've seen so far, they'll do something like this: $$ \begin{align} s_1 - s_2 &= k^{-1} * (z_1 + y) - k^{-1} * (z_2 + y) \\ s_1 - s_2 &= k^{-1} * (z_1 - z_2) \\ \frac{s_1 - s_2}{z_1 - z_2} &= k^{-1} \\ k &= \frac{z_1 - z_2}{s_1 - s_2} \\ \end{align} $$  This doesn't work in my code, because in this hack, the modulo operation at the beginning is just ignored. If I we don't ignore it, the equation should look like this: $$ i*n + s_1 = k^{-1} * (z_1 + y) \\ j*n + s_2 = k^{-1} * (z_2 + y) \\ $$  I got rid of the modulo by adding $x*n$ to the left side, where x (i or j) is unknown. With this equation I'll just do the same thing as above but keep the $+ x*n$: $$ \begin{align} i*n + s_1 - j*n - s_2 &= k^{-1} * (z_1 - z_2) \\ \frac{s_1 - s_2 + n*(i-j)}{z_1 - z_2} &= k^{-1} \\ k &= \frac{z_1 - z_2}{s_1 - s_2 + n*(i-j)} \\ \end{align} $$  Obviously we do not know $i$ and $j$. We can ignore them if $i = j$ (as we did in the first calculation), which is only the case when $z_1$ and $z_2$ are close together or $k^{-1}$ is very small (so that it pulls the result down and therefore prevents $z_1$ or $z_2$ from making too much difference).  In theory $k^{-1}$ is pretty small (since it's $\frac{1}{k}$) and therfore the exploit works. But in practice I've seen that $k^{-1}$ is not used, but instead the smallest inverse modulo of $k \mod n$ that is a whole number is used. This number can be really large, which actually amplifies the difference between $z_1$ and $z_2$, making $i-j$ pretty large. With this implementation, I can't use the exploit as explained in theory, because I never get my exact $k$.  My questions are:   Mathematically, is there another way to retrieve $k$, even if the $k^{-1}$ part is really large? Maybe using some inverse modulo? Why is it that many implementations use the inverse modulo instead of $k^{-1}$? (I've seen it in two libraries so far) Why doesn't it work when I change the implementation to use $k^{-1}$?   Since this is part of an assignment for Uni, retrieving $k$ still has to work somehow. But I already spent too much time on it without any results. Any gurus out there that can help me? :)


Why constructor/destructor function is not called while using malloc and free in c++ instead when we use new and delete , the constructor/destructor is called? why is it so?

What is the difference between new/delete and malloc/free?  Related (duplicate?):


Find the solutions of the congruence using Chinese Remainder Theorem: $2x^2 - 3x -2 \equiv 0\mod21$  By now I've done this: $$ \left\{  \begin{array}{c} 2x^2-3x-2\equiv 0\mod 7\\2x^2-3x-2\equiv 0\mod3 \end{array} \right. $$  $$ 2x^2-3x-2\equiv 0\mod 7 \\ \Delta = 25 = 5^2 \\x_1,x_2 = (2a)^{-1}*(-b \pm \sqrt\Delta) \\ x_1=4^{-1}*2 = 2*2 = 4 \mod 7 \\ x_2 = 4^{-1}*(-8)= 6*2 = 5 \mod 7 $$ Then I made $\Delta$ for the (mod 3) equation and got $x_3=1 \mod 3, x_4=2 \mod 3$ So I got: $$ x \equiv 1 \mod 3 \\ x \equiv 2 \mod 3 \\ x \equiv 4 \mod 7 \\ x \equiv 5 \mod 7 \\  $$ And I don't know what to do further. I should apply Chinese Remainder Theorem on it or it would be wrong?  Edit: Thanks for the help! The correct form was: $$ x \equiv 1 \mod 3 \\ x \equiv 2 \mod 3 \\ x \equiv 2 \mod 7 \\ x \equiv 3 \mod 7  $$ And I understand how to solve it.

Solve $x^2+5x+6 \equiv 187 \mod 187$ Solution $$x^2+5x+6 \equiv 187 \mod 187$$ $$ (x+\frac{5}{2})^2 \equiv \frac{1}{4}$$ $$ 4(x+\frac{5}{2})^2 \equiv 1$$ $$ y:= x+\frac{5}{2} $$ $$ 4y^2 \equiv 1 \mod 11 \wedge 4y^2 \equiv 1 \mod 17  $$ $$ ( 2y \equiv 1 \mod 11 \vee 2y \equiv 10 \mod 11 ) \wedge ( 2y \equiv 1 \mod 17  \vee 2y \equiv 13 \mod 17)  $$ $$ ( y \equiv 6 \mod 11 \vee y \equiv 5 \mod 11 ) \wedge ( y \equiv 9 \mod 17  \vee y \equiv 15 \mod 17)  $$ Combining that from CRT I got: $$ y \in \left\{49, 60,83,94 \right\} $$ and for example: $$ x+\frac{5}{2}  \equiv 94 \mod 187$$ $$ 2x  \equiv 183 \mod 187$$ some calculus and get... $$x \equiv 185 $$ And the same thing for each other case. Question Is there any faster (or smarter) way to solve equations like that?


I am reading a book and the author threw the  question of the title for us to reflect. After he gave us some example to state that if the velocity of an object is zero it doesn't mean that the accelarion is zero. "For example, when you put your foot on the gas pedal of your car which is at rest, the velocity starts from zero but the acceleration is not zero since the velocity of the car changes. (How else could your car start forward if its velocity weren’t changing—that is, accelerating?)" But for me it doesn't make sense. Of course I believe he is right, I just cannot understand it. I will tell how I see this situation. If the person pressed the gas pedal it will have accelarion and the car will move. In my head there's no "delay". I "delay" would happen if the car skidded. Could you explain how the author sees it?

I'm studying for my upcoming physics course and ran across this concept - I'd love an explanation.


There is a hint for this ex.: using symmetry. I would appreciate another hint to take advantage of.  My approach so far:  Induction step:     $\sum_{k=0}^{n+1} \binom{n+1}{k}^2$   $= 1 + \sum_{k=1}^{n+1} \binom{n+1}{k}^2$   $= 1 + \sum_{k=0}^{n} \binom{n+1}{k+1}^2$   $= 1 + \sum_{k=0}^{n} (\binom{n}{k}+\binom{n}{k+1})^2$   $= 1 + 2\cdot\sum_{k=0}^{n} (\binom{n}{k}\binom{n}{k+1}) + \sum_{k=0}^{n} \binom{n}{k}^2 + \sum_{k=0}^{n} \binom{n}{k+1}^2 $    Now, I should simplify $2\sum_{k=0}^{n} (\binom{n}{k}\binom{n}{k+1})$ but I don't know how to proceed.

I was hoping to find a more "mathematical" proof, instead of proving logically $\displaystyle \sum_{k = 0}^n {n \choose k}^2= {2n \choose n}$.  I already know the logical Proof:  $${n \choose k}^2 = {n \choose k}{ n \choose n-k}$$  Hence summation can be expressed as:  $$\binom{n}{0}\binom{n}{n} + \binom{n}{1}\binom{n}{n-1} + \cdots + \binom{n}{n}\binom{n}{0}$$  One can think of it as choosing $n$ people from a group of $2n$  (imagine dividing a group of $2n$ into $2$ groups of $n$ people each. I can get $k$ people from group $1$ and another $n-k$ people from group $2$. We do this from $k = 0$ to $n$.


I'd like to rename the "Acronyms" section produced by the glossaries package because not all the terms I have included in it are actually acronyms but rather abbreviations.   The only way to change the name I have found so far is using babel to translate the name to another language. Is there a way to simply redefine the name and keep my document language?

I'd like to modify the names used to typeset some of my document elements. For example, the caption of figure floats should change from "Figure" to "Fig.", and my \tableofcontents sectioning heading shouldn't read "Contents", but "Table of Contents". How can I do that?  \documentclass{article} % \usepackage[english]{babel} \begin{document} \tableofcontents \section{foo} \begin{figure}[h] \centering \rule{1cm}{1cm}% placeholder for graphic \caption{A figure} \end{figure} \end{document}


I am giving this for intersection of a polyline using Leaflet draw plugin with polygons feature class. Here is my code function intersectPolyByPolyFC(poly,fcPoly){         var fgp=[];//variable for feature group         var bbPoly=turf.bboxPolygon(turf.bbox(poly));//polygon representation of the bounding box of a reference polygon         for(var i=0;i<fcPoly.features.length;i++){//loop through the feature collection of polygons             var bb=turf.bboxPolygon(turf.bbox(fcPoly.features[i]));//variable bb represents each polygon for feature collection             if(turf.intersect(bbPoly,bb)){//condition to check if the two bounding boxes intersect                 var int= turf.intersect(poly,fcPoly.features[i]);                 if(int){                     int.properties=fcPoly.features[i].properties;                     fgp.push(int);                 }             }         }         return turf.featureCollection(fgp);     }   **Function Definition** var bufLine= turf.buffer(line,5,{units:"kilometers"});                         var intBUOWL = intersectPolyByPolyFC(bufLine,                         lyrBUOWL.toGeoJSON());                         L.geoJSON(intBUOWL,{style:{color:'black', width:5}}).addTo(mymap);  I am not getting any error on console and moreover my intersection is not performed on the map. What is could the problem be with my code?

I have given this code for intersection: function intersectPolyByPolyFC(poly,fcPoly){         var fgp=[];//variable for feature group         var bbPoly=turf.bboxPolygon(turf.bbox(poly));//polygon representation of the bounding box of a reference polygon         for(var i=0;i<fcPoly.features.length;i++){//loop through the feature collection of polygons             var bb=turf.bboxPolygon(turf.bbox(fcPoly.features[i]));//variable bb represents each polygon for feature collection             if(turf.intersect(bbPoly,bb)){//condition to check if the two bounding boxes intersect                 var int= turf.intersect(poly,fcPoly.features[i]);                 if(int){                     int.properties=fcPoly.features[i].properties;                     fgp.push(int);                 }             }         }         return turf.featureCollection(fgp);     }  and the function definition I have given as var bufline=turf.buffer(line,0.05,{units:"kilometers"}); var intBUOWL= intersectPolyByPolyFC(bufline, lyrBUOWL.toGeoJSON()); L.geoJSON(intBUOWL,{style:{color:'red',weight:5}}).addTo(mymap);  When I am drawing a line over a polygon for intersection I am getting this error Uncaught TypeError: Cannot read property 'map' of undefined     at Object.t.collect (turf.min.js:1)     at summarizePointsByLine (buffer.html:440)     at NewClass.<anonymous> (buffer.html:155)     at NewClass.fire (Events.js:190)     at NewClass._fireCreatedEvent (leaflet.draw.js:8)     at NewClass._fireCreatedEvent (leaflet.draw.js:8)     at NewClass.completeShape (leaflet.draw.js:8)     at HTMLAnchorElement.handler (DomEvent.js:92)  How can I resolve this error?


Example 1: I will bring a pen, eraser, or pencil.   Example 2: I will bring a pen, an eraser, or a pencil.  Are the above two examples both correct grammatically? If so, which is better to use in academic/professional/technical writing? Does Example 2 seem redundant? How about in the following cases?  Example 3: I will select a black, yellow, or red shirt.   Example 4: I will select a black, a yellow, or a red shirt.

According to one article reference book, it says we can omit articles (a, an, the) in front of the second, third,… nouns. Is it really acceptable from native English speakers' point of view? Is it really grammatically correct and allowed in writing? The book says it is so clear that each item (noun) is a different item, so we do not need to repeat the article.  Example 1:     I bought a lemon, melon, and pineapple.   Example 2:     I asked her to pass me the pen, eraser, and pencil sharpener.   I understand we can definitely place "a" in front of each noun, but could placing the articles (a, the) be redundant?


\documentclass{amsart}   \begin{document} $\chi_{A}$  $\chi_{S_{i}}$  \end{document}   I found that the $A$ in $\chi_{A}$ does not look like a subscript; it seems too large. This problem becomes more obvious in the second example, $\chi_{S_{i}}$, which looks like $\chi S_{i}$. How do I fix this?

I am unsatisfied with the way subscript is rendered for the Greek letter \chi. This particular letter is rendered with a small downward offset. I occasionally have to prefix the subscript with \sciptscriptstyle such that, in effect, an expression may look like   \sup{\chi_{\scriptscriptstyle A_n}(x)}[n]   where   \RenewDocumentCommand{\sup}{m O{}}{     \operatorname{sup}\ifstrempty{#2}{}{\limits_{\mathclap{\substack{\expandafter{\scriptscriptstyle{#2}}}}}}         \expandafter{#1}  }   (I admit this snippet is a little messy, especially due to the uncanonical declaration of the optional argument as O{} and testing via \ifstrempty instead of o for the argument type and IfNoValueTF--using the  package. I am not entirely clear yet about what syntax is more straightforward.)  Is there a way to redefine \chi keeping the syntax in line with all semantically equivalent concepts, i.e., letters, but having only \chi's subscript expressions smaller or slightly lower? To clarify, I am thinking of redefining the subscript operator _ for \chi only. But I naively suppose TeX' grammar would not let me do that.  An evident work-around would involve defining a new macro using a different syntax like  \newcommand{\Chi}[1]{\chi_{\scriptscriptstyle{#1}}}   So effectively, what I want is just   \chi_{expr}   where expr is rendered smaller or offset lower than default.


I have a string:  line = "https://dbwebb.se/kunskap/uml#sequence, ftp://bth.com:32/files/im.jpeg, file://localhost:8585/zipit, http://v2-dbwebb.se/do%hack"   I want to get a result like this :   [('https', 'dbwebb.se', ''), ('ftp', 'bth.com', '32'), ('file', 'localhost', '8585'), ('http', 'v2-dbwebb.se', '')]   I tried like :  match = re.findall("([fh]t*ps?|file):[\\/]*(.*?)(:\d+|(?=[\\\/]))", line)   And than i got :  [["https", "dbwebb.se", ""], ["ftp", "bth.com", ":32"], ["file", "localhost", ":8585"], ["http", "v2-dbwebb.se", ""]]   There is one diffrence, you can se ":32" and ":8585". How can i do to get just "32" and "8585" and not the stupid ":"  Thanx!

I am new to Python and it seems to have a lot of nice functions that I don't know about. What function can I use to get the root site name? For example, how would I get faqs.org if I gave the function the URL ""?


i tried to compile sample hello_world.c program in x86-64 machine, but i expect to execute hello_world binary into i686 machine. can somebody correct me if i was wrong, what are the subjective limitations to execute x86-64 binary into i686 Machine. from my understanding x86-64 binary will execute in 32-bit machine aswell. prashad@ubuntu:~$ uname -a Linux ubuntu 5.3.0-62-generic #56~18.04.1-Ubuntu SMP Wed Jun 24 16:17:03 UTC 2020 x86_64 x86_64 x86_64 GNU/Linux prashad@ubuntu:~$    root@Docsis-Gateway:/tmp# uname -a Linux Docsis-Gateway 4.9.199-yocto-standard #1 SMP PREEMPT Thu Aug 6 22:38:09 UTC 2020 i686 GNU/Linux

What are the differences between 32-bit and 64-bit systems?  If you have used both of them, what kind of sharp differences have you experienced?   Would it be a problem to use 32-bit programs on 64-bit systems in some cases?


Firstly some information about my computer. I just have a C: drive and a D: drive. My C: drive just has a bunch of programs and my D: drive has all my work.  I am running windows 7 and I'm trying to also have Ubuntu on my desktop too.   I burned a ubuntu14.04.1.iso file onto a DVD. Then I rebooted my desktop and changed my boot options to boot from the DVD. It loaded ubuntu and asked me to pick my language etc etc but then these dialogs came up and I didn't know what to choose...     I didn't want to pick the first option because I was scared it might delete my windows or something so I clicked on Something else and got this window.    Now from this window I had no idea what was going on so I just quit the installation, took the DVD out and went back to windows. How am I supposed to proceed?  I remember seeing a post that said I should get an option like this, which allows me to install ubuntu with windows 7 but I never got it.    Any help is appreciated.

I have Windows 7, and I'm trying to dual boot Windows 7 and Ubuntu. However, when I try to install Ubuntu with a USB, it doesn't give me the option to dual boot. I can only "Replace Windows 7 with Ubuntu", or "Something Else".  I've installed Ubuntu on this computer before, and this option was present. What I'm asking for is a way to get that option, or how to use the "Something else" option.


When I'm looking at my inbox in Outlook 2013, there are two convenient buttons called "All" and "Unread". When I press "Unread", it shows just the unread items, and I can toggle back to "All" to see all my messages.  My question: Is there a hotkey for pressing these buttons? I prefer to avoid using the mouse wherever possible.

I would like to switch between seeing All and just Unread emails in my Outlook 2013 inbox using just the keyboard and a single key combo, for instance Ctrl+Shift+A and Ctrl+Shift+U (just an example).  Is there such a shortcut, or is it possible to create one?  The closest I have gotten is Ctrl+E to go to the search box, then Shift+Tab to jump to Unread and Shift-Tab again to get to All, then Space to select. Cumbersome!


I'm doing a script to auto-install some stuff including a nginx web server. I'm creating the nginx conf file like this : cat >/etc/nginx/sites-available/bookstack.conf <<EOL server {   listen 443 ssl;   listen [::]:443 ssl;   ssl_certificate /etc/nginx/certificats/domain.tld.crt;   ssl_certificate_key /etc/nginx/certificats/domain.tld.key;   ssl_protocols TLSv1.2 TLSv1.1 TLSv1;    server_name domain.tld;    root /path/to/bookstack/public;    index index.php index.html;    location / {     try_files $uri $uri/ /index.php?$query_string;   }    location ~ \.php$ {     fastcgi_index index.php;     try_files $uri =404;     include fastcgi_params;     fastcgi_param SCRIPT_FILENAME $document_root$fastcgi_script_name;     fastcgi_pass unix:/var/run/php/php7.3-fpm.sock;   } }  server {     listen 80;     listen [::]:80;      server_name domain.tld;      return 302 https://$server_name$request_uri; }  EOL  My problem is that cat takes the $ characters as variable names (which normally makes sense) and doesn't put what I want in my .conf file. This is a sample of my .conf file after the script has done his work : location / {     try_files  / /index.php?;   }  location ~ \.php$ {     fastcgi_index index.php;     try_files $uri =404;     include fastcgi_params;     fastcgi_param SCRIPT_FILENAME ;     fastcgi_pass unix:/var/run/php/php7.3-fpm.sock;  How to prevent this behaviour please ? I tried using quotes but it didn't work. Thanks :)

How can I echo "$" in a here-doc in bash?  For example, I want to have a file with the content on remote server like $ABC=home_dir.  $ ssh hostname sudo -s <<EOF echo "$ABC=home_dir" > file EOF   But it would be treated as a variable. How can I print a literal $?


I had these partitions on an external hard drive:  /dev/disk2 (external, physical):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *2.0 TB     disk2    1:                        EFI EFI                     209.7 MB   disk2s1    2:                  Apple_HFS Android                 63.9 GB    disk2s2    3:                  Apple_HFS RiptideHUP              968.0 GB   disk2s3    4:       Microsoft Basic Data RiptideF                967.8 GB   disk2s4   My aim was to delete disk2s2 and then resize disk2s3 to occupy the leftover space by deleting disk2s2.  I deleted disk2s2 using this command:  diskutil  erasevolume  "Free Space"  ""  /dev/disk2s2   Now, to resize the volume, I used:  diskutil  resizevolume  /dev/disk2s3  R   However, I got this error:  Started partitioning on disk2s3 RiptideHUP Error: -69743: The new size must be different than the existing size   Can someone help me and tell me where I went wrong?  NOTE: Using diskutil list now shows:  /dev/disk2 (external, physical):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *2.0 TB     disk2    1:                        EFI EFI                     209.7 MB   disk2s1    2:                  Apple_HFS RiptideHUP              968.0 GB   disk2s3    3:       Microsoft Basic Data RiptideF                967.8 GB   disk2s4

I had these partitions on an external hard drive:  /dev/disk2 (external, physical):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *2.0 TB     disk2    1:                        EFI EFI                     209.7 MB   disk2s1    2:                  Apple_HFS Android                 63.9 GB    disk2s2    3:                  Apple_HFS RiptideHUP              968.0 GB   disk2s3    4:       Microsoft Basic Data RiptideF                967.8 GB   disk2s4   My aim was to delete disk2s2 and then resize disk2s3 to occupy the leftover space by deleting disk2s2.  I deleted disk2s2 using this command:  diskutil  erasevolume  "Free Space"  ""  /dev/disk2s2   Now, to resize the volume, I used:  diskutil  resizevolume  /dev/disk2s3  R   However, I got this error:  Started partitioning on disk2s3 RiptideHUP Error: -69743: The new size must be different than the existing size   I did a bit of research and realised the free space was created before disk2s3 RiptideHUP so it cannot resize itself. Is there still a way I can reclaim the Free Space?  NOTE: Using diskutil list now shows:  /dev/disk2 (external, physical):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *2.0 TB     disk2    1:                        EFI EFI                     209.7 MB   disk2s1    2:                  Apple_HFS RiptideHUP              968.0 GB   disk2s3    3:       Microsoft Basic Data RiptideF                967.8 GB   disk2s4


I need to convert this string to DateTime: "10/1/19 4:19:38 AM UTC"  I have tried the below and get various errors.   CultureInfo provider = CultureInfo.InvariantCulture; DateTime.ParseExact(value.ToString(), "MM/dd/yy hh:mm:ss tt KKK", provider); DateTime.ParseExact(value.ToString(), "MM/dd/yy hh:mm:ss t K", provider)   this is different from  as it is parsing an alpha month name

I'm trying to parse an international datetime string similar to:  24-okt-08 21:09:06 CEST   So far I've got something like:  CultureInfo culture = CultureInfo.CreateSpecificCulture("nl-BE"); DateTime dt = DateTime.ParseExact("24-okt-08 21:09:06 CEST",     "dd-MMM-yy HH:mm:ss ...", culture);   The problem is what should I use for the '...' in the format string? Looking at the  MSDN page doesn't seem to list a format string for parsing timezones in PST/CEST/GMT/UTC form.


My problem is to find the sum of the series $$ S = 1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{6}+\frac{1}{8}+\frac{1}{9}+\frac{1}{12}+\cdots $$ where the terms are the reciprocals of the positive integers whose only prime factors are $2$s and $3$s.   I can see that every term in $S$ is of the form $\dfrac{1}{2^m3^n}$ where $m,n\geq 0$. I can also see that each term only occurs once, but I'm not really sure how to use this information effectively. Any ideas (apparently geometric series was a hint)?

I'm in trouble with this homework.  Find the sum of the series $ 1 + \frac12 + \frac13 + \frac14 + \frac16 + \frac18 + \frac19 + \frac1{12} +\cdots$, where the terms are the inverse of the positive integers whose only prime factors are 2 and 3.  Hint: write the series as a product of two geometric series.  Ok, I found some patterns in these numbers, but I can't find the two series.


We have following server details and we need to upgrade apache 2.4.6 to apache 2.4.12  OS: CentOS 6 Apache : 2.4.6 PHP : 5.5   I know how to install 2.4.12 from scratch but i just want to upgrade current apache to 2.4.12 because i don't want to loss php settings and other settings of current apache.

We run Ubuntu Lucid 10.0.4 as the foundation of our LAMP environment. We are trying to become PCI compliant so that we can pass CC info through our server. We have run some third-party scans on our servers to begin the certification process and have run into errors regarding PHP 5 versions and Apache versions. The latest PHP version hosted in our official lucid repository is about 10 versions lower than what PCI compliance requires.   How do we upgrade to stay current with PCI compliance requirements?   We need to get from php 5.3.2 to php 5.3.15  As well as up to apache 2.2.23  I've searched far and wide for an answer and haven't come up with a realistic answer. Some recommend compiling manually - which sounds like a nightmare, and others recommend a PPA - which sounds insecure. What should we do?


I am trying to use something similar to   /^(.*?)\.txt/   But instead of using .txt I want to replace it with a variable

I would like to create a String.replaceAll() method in JavaScript and I'm thinking that using a regex would be most terse way to do it.  However, I can't figure out how to pass a variable in to a regex.  I can do this already which will replace all the instances of "B" with "A".  "ABABAB".replace(/B/g, "A");   But I want to do something like this:  String.prototype.replaceAll = function(replaceThis, withThis) {     this.replace(/replaceThis/g, withThis); };   But obviously this will only replace the text "replaceThis"...so how do I pass this variable in to my regex string?


I am actually trying to find if a given host is a physical server or a virtual machine. I searched on Google but couldn't find any commands or tools. Can anyone here let me know is there is any utility which can tell me if its a physical server or a virtual server.

An interesting question.  I have logged into a Linux (most likely SuSE) host.  Is there some way that I can tell programmatically that I am a VM host or not?    Also assume that the vmtools are not installed.


If $p$ is prime and $a$ is a positive integer where $p\nmid a$, then prove $a^{(p-1)!}\equiv1 \pmod p$.   I know that Fermat's Little Theorem guarantees that $a^{p-1} \equiv 1 \pmod p$.  I also know that $(p-1)! = (p-1)(p-2)(p-3)\ldots(2)(1).  $

I've read about Fermat's little theorem and generally how congruence works. But I can't figure out how to work out these two:   $13^{100} \bmod 7$ $7^{100} \bmod 13$   I've also heard of this formula:  $$a \equiv b\pmod n \Rightarrow a^k \equiv b^k \pmod n $$  But I don't see how exactly to use that here, because from $13^1 \bmod 7$ I get 6, and $13^2 \bmod 7$ is 1. I'm unclear as to which one to raise to the kth power here (I'm assuming k = 100?)  Any hints or pointers in the right direction would be great.