Stuck at "Updating Blizzard Update Agent" when installing World of Warcraft

I've tried searching through most of the other posts on here about getting WoW to work, but most people say they can execute the .exe and have no problems loading the launcher. I also tried looking for the game in the Play on Linux database but it doesn't appear to exist anymore. I tried using a playonlinux script but that failed after selecting the .exe. How can I get WoW to run? It always gets stuck at the same spot 1/3 of the way finished with Updating Blizzard Update Agent" screen. I'm using Ubuntu 12.10.


In Notepad++ i'm familiar with opening files into new views (Move to Other View). This opens a second window which files can open in. Is there a way to open a 3rd view?


\section using characters instead of numbers?

The \section{something} enumerates from 1 to N-1. I was wondering if instead the \section{something} could print letters like   A. Section B. Section ...etc.


Stuck on GNOME; Can't change desktop environment

I recently installed the GNOME desktop environment. I ran it and it worked well until I tried to change it back to the default Ubuntu one. I see the GNOME logo in the upper right hand corner, but it doesn't work. Does anyone have any idea on what could be causing this and how to fix it?  It is on the top right-hand corner of the log-in screen and only on the admin account. Other accounts are good.


How do I back up AWS S3 and EBS to a non-Amazon provider?

We've centered most of our operations on AWS, and love the ease of use there. However, every once in a while, the paranoid side of my brain wonders ?  Within the Amazon ecosystem, we have a pretty good backup plan: We keep most static data in S3. EBS volumes are snapshotted nightly. However, true paranoia would mean backing up to a provider outside the Amazon ecosystem. How do you handle doing this? I'm especially interested in backing up EBS snapshots and S3 contents. Bonus points for backing up RDS.


Why do I need to leave the country before I can open my tax free consumables?

I'm looking into tax free shopping in Japan and I noticed that if I decide to buy consumables tax free then I cannot eat them on the spot. From my understanding, if I buy consumable products at these stores they will give me a sealed bag with my consumables which I have to wait until I leave the country to open it. Why can't I just open up the bag when I leave the store? What is the reason to have that tax free rule implemented?  Edit: I explained the situation more in detail to differentiate between buying from a duty free spot in the airport than tax free shops. If they work the same way let me know.


To enroll in to a PhD Program at the age of 65

As a retired school teacher, and to become a professor at a university. Is it okay to get into a PhD program at the age of 65 and complete it to become a professor? Or is it too late and I can’t get employed at a university?


That moment when you think about a smarter reply that you could've given?

I remember reading this word or expression in a book that describes the feeling you have when you think about a reply that you could've given to someone, but you do it too late.


Can't type anything in to to reset admin password

When I go to reset my password in root mode and type  passwd lunar  It won't let me type to change my password so I need help here the laptop I'm using is a Lenovo G580 (windows on it got corrupted so I installed Ubuntu Linux on it)


How to pass different objects to one class in Intent?

I have one activity for movie details, I want to open this from two different places and I have two different classes to pass. I try something like this but its not working, there is no error but nothing is happening. This is one place where I am starting new activity, movieDb2 is an object of class for Movie from TMDb API. Intent intent = new Intent(getActivity(), MovieDetails.class);                 intent.putExtra("class", "movieDB");                 intent.putExtra("object", movieDb2);                 startActivity(intent);  And here is other place where I am starting this activity, watchlist is a class of entity from my database. Intent intent = new Intent(getActivity(), MovieDetails.class);             intent.putExtra("class", "watchlist");             intent.putExtra("object", movie);             startActivity(intent);  And here is my activity when I am receiving this objects: public class MovieDetails extends AppCompatActivity {      TextView textView;      @Override     protected void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.movie_details);         textView = findViewById(R.id.t1);          Bundle bundle = getIntent().getExtras();         if(bundle.getString("class") == "movieDB"){             MovieDb movieDb = (MovieDb) bundle.getSerializable("object");             textView.setText(movieDb.getOriginalTitle());         }         else if(bundle.getString("class") == "watchlist"){             Watchlist watchlist = (Watchlist) bundle.getSerializable("object");             textView.setText(watchlist.getMovieTitle());         }     } }  What I am doing wrong?


Show that exists a not decreasing function that $f:(a,b)\rightarrow \mathbb{R}$ that is continuous only in $(a,b)\setminus D$.

Show that there exists a not decreasing function $f:(a,b)\rightarrow\mathbb{R}$ continuous on $(a,b)\setminus D$ and discontinuous on $D$ where $D$ is a countably infinite subset of $(a,b)$.  This is an exercise that I tried very last semester but my weak point is to get examples of functions. Can anyone help me with this?  *Moreover, one could indicate something for me to improve my skill with examples?


what is deferent between create and update

org.hibernate.dialect.MySQLDialect                 true                 create                 jdbc:mysql://localhost:3306/redberry                 com.mysql.jdbc.Driver                            and                                                            org.hibernate.dialect.MySQLDialect                 true                 update                 jdbc:mysql://localhost:3306/redberry                 com.mysql.jdbc.Driver


Invertible matrices with integer entries has to be permutation matrices

Let $A$ and $B$ be $n\times n$ matrices with integer entries. Show that if $B=A^{-1}$ then $A$ and $B$ are permutation matrices (matrix obtained by permuting rows of the identity matrix).  If the entries are non negative integers then it is quite easy to show, but if the entries also involve negative integers then I couldn't show it.


Altering order of attributes in table using ArcPy

I have gone through a sequence of table joins. The resultant table should be with the attributes rearranged in more logical order. I cannot find this functionality within ArcGIS or any mention of it in Python  For example, say a TableResultingFromJoins has the following attributes:  v1,v2,v3,w1,x1  ... and I want it like this:  v1,w1,x1,v2,v3  What do I do?


problem mounting second harddrive with ubuntu 14.04

I just installed ubuntu and im completly new with ubuntu.   I am trying to get my second harddrive to work but it won't. I've used some guides like  But still no success.   The problem is that it doesn't see my ntfs as a valid one. I don't really understand what this means. this is the message the terminal gives me when trying to mount the hard drive:  robert@Robert-Linux:~$ sudo mount -a   NTFS signature is missing.   Failed to mount '/dev/sdb1': Invalid argument    The device '/dev/sdb1' doesn't seem to have a valid NTFS.   Maybe the wrong device is used? Or the whole disk instead of a partition (e.g. /dev/sda, not /dev/sda1)? Or the other way around?   robert@Robert-Linux:~$     Hopefully someone can help me out.  Greetings Robert  EDIT   /etc/fstab file content:  # /etc/fstab: static file system information. # # Use 'blkid' to print the universally unique identifier for a # device; this may be used with UUID= as a more robust way to name devices # that works even if disks are added and removed. See fstab(5). # # <file system> <mount point>   <type>  <options>       <dump>  <pass> # / was on /dev/sda1 during installation UUID=d91f5c8b-30d0-4bc7-85cb-e3b26d2e9c1d /               ext4    errors=remount-ro 0       1 # swap was on /dev/sda5 during installation UUID=81cc1c05-8435-4d18-8af5-049d092294cb none            swap    sw              0       0 /dev/fd0        /media/floppy0  auto    rw,user,noauto,exec,utf8 0       0  /dev/sdb1 /media/disk2   ntfs   defaults        0    0


C# Parallel.Invoke: When are delegates actually created?

I'm new to the Parallel class in .NET. I have this basic code:          List<Action> actions = new List<Action>();          for (int iter = 1; iter <= 5; iter++)         {             actions.Add(() =>             {                 // create a local copy of iter, and an action to write it to the console                 int theProblem = iter;                 Console.WriteLine(theProblem);             });         }          Parallel.Invoke(actions.ToArray());          /*         Output:         6         6         6         6         6         */   I would expect this to print 1..5 in some random order, but instead it prints out the value of iter after the loop ends.  Why is this? At what point are the actions actually created, and the line int theProblem = iter; executed?  I found a TON of information online about Parallel.For and Parallel.ForEach (not so much for Parallel.Invoke), but nothing explaining specifically what goes on in a very basic case like this one.  What modifications do I need to make to have the code above print 1..5 (in some random order)?  Thanks a lot!  EDIT:  This question has been marked as a duplicate, but I don't think it is:   All except one of the responses in the other question refer to sigle-threaded code, this is multi-threaded. None of the responses refers to Parallel.Invoke (or to any other method in the Parallel class for that matter). My code sample already implements the solutions proposed in the other question (create a copy of the variable inside the loop), and yet it's not working.   So, clearly not a dupe.  EDIT 2:  Turns out that this is actually a dupe under the hood. The gist of it is to create the local copy of the variable inside the loop but outside the lambda (duh!) and then everything works just as expected.  Thanks everyone!


Why does an aeroplane appear to be moving slowly?

Why does it seem that an aeroplane, even while travelling at 500 kmph at a height of $1.5\text{ km}$ (above sea level), is moving slowly?


Show that $E(Y^p)=\int_{0}^{\infty}px^{p-1}P(Y\geq x)dx$

Studying some probability theory and I came across this question. Show that if $Y$ is a non-negative random variable, and $p>0$, $$E(Y^p)=\int_{0}^{\infty}px^{p-1}P(Y\geq x)dx$$ I'm a bit stuck on this question: I know that by Markov's inequality, $\frac{E(Y^p)}{y^p}\geq P(Y>y)$ since $Y=\lvert Y\rvert$ here. Also, $y^p=\int_{0}^y px^{p-1}dx$ and I believe these two facts can be used to solve the problem, but I'm not sure how exactly.  Could anyone give me some help, point me in the right direction?


Evaluate the general infinite square root

$$x = \sqrt{n\sqrt{n\sqrt{n}} \cdots}$$  I see that:  $$x = \sqrt{nx}$$  $$x^2 -nx = 0$$  Them:  $$x(x - n) = 0 \implies x \in \{0, n\}$$  How should I reject the $x = 0$ solution?  (any level proof is fine, analysis, calculus etc...)


Why does the Android OS use so much battery power?

Most of the time, I have enough power for my Samsung Galaxy SIII to operate for the whole day; at the end of the day my battery charge is about 35%. However, today, the battery died prematurely. I noticed the battery usage screen, and it says that 28% of the battery is used by the Android OS. How could this have happened?  EDIT: My question has been marked as a duplicate, but the target does not have any solution, so those answers do not fully address my question. Though I agree in the fact that this question is the same as the target.


Prove the following statement: if $ab$ is odd, then $a^2 + b^2$ is even

I am having a hard time with this one although it looks easy. Prove the following statement: Suppose a,b are integers. If $ab$ is odd, then $a^2 + b^2$ is even.   I know I might need to use the fact that $a^2 + b^2 = (a+b)^2 - 2ab$. Can someone please tell me where to start?


Is there a way to automatically get an e-mail notification about answers on all of my questions?

I love this site and the community, and I would like to be informed immediately when I receive new answers to my questions.  It would be preferable to have an automatic way to enable e-mail notifications on all of my questions, but I would be ok with enabling it manually on new questions. I just can't find that feature on the site.  Where can I enable this feature?


Add FILTER CRITERIA in Views Programmatically

I want to add/modify a filter criteria programmatically.   For example, for a view, I added an "Email Address" filter whose value is needed to change dynamically, it is needed to set to the current logged in user's email id.   How to achieve that? Please see attached image for more details. Please help.


Display the number of pending review tasks created in the past 24 hours for the Stack Overflow close review queue

This is just depressing:    And I don't mean it's depressing that there are that many questions that might need to be closed. There are nearly 6 million open questions on Stack Overflow - if under 2% of those are crap, we're doing great. Realistically, that number is probably going to get a lot bigger before we're done... But I'm working on another post about that, so enough said for now.  No, that number is depressing because I can't do anything about it. Ok, realistically I could - since I'm immune to the normal voting limits, if I spent the rest of my evening reviewing stuff I might be able to bring it down by... .1 or .2K. That's assuming my wife doesn't kill me first. But for most other folks reviewing stuff, there's literally nothing they can do that will affect that number. They can burn through their entire review limit, and it'll still be exactly the same.   That's depressing. And it's a lie. Those folks are helping, they are accomplishing something useful... The system just doesn't tell them this. And that's wrong.   So here's what I'm proposing: every time the background task that populates the queue adds another bunch of items to it, figure up how many pending review tasks are in there from the past 24 hours... And display that number. Yeah, it'll still be a pretty big number - but now we're talking 2-3 digits at worst rather than a progress-hiding abbreviation. And more importantly, with sufficient effort it'll be possible to watch it go down.   For informational purposes, I would keep the full backlog displayed on .  This might eventually be useful for other queues (broken links...) but for now it's only really needed for close and only on Stack Overflow.


How to properly say that a given day/date does not exist?

I wanted to use this, but I don't know if it's actually valid in English:     The specified date is invalid.It points to a non-existing day.   I'm not a native speaker, and I just want to say that the input points to a date that does not exist, like 30th February.


I use Gimp to edit photos and then I convert the image to Jpeg but it saves as PNG. How do I convert that to Jpeg?


Python: Print key and values in sorted order of values

I am learning python coding and wanted to get some help with sorting dictionary. Based on information available on the internet, I was able to figure out how to sort a dictionary by keys and by values. However, I am having trouble trying to find a way to sort and print the key, value pair if i sort by values. Here's my code: fish = {'Chicago':300, 'San Francisco':200, 'Dallas':450, 'Seattle': 325, 'New York City': 800, 'Los Angeles':700, 'San Diego':650} for i in sorted(fish): print (i, fish[i])  #The above loop will print the items from the dictionary in sorted order of keys.  for i in sorted(fish.items()): print (i) #The above loop will print the items in sorted order of keys. It will print as a tuple.  for i in sorted(fish.values()): print (i) #The above loop will print the items in sorted order by values.  #end of code  Is there a way to print the list of key value pairs from a dictionary in sorted order of values. My result should be  San Francisco 200 Chicago 300 Seattle 325 Dallas 450 San Diego 650 Los Angeles 700 New York City 800  One of the way to do this is: def by_value(item): return item[1] for k, v in sorted(fish.items(), key=by_value): print (k,v)  I don't want to define a function. I want a for loop with sorted command. Is there any? I am not sure if a lambda function will do this. I haven't tried it. That's my next step. stackoverflow provided me a response. Looks like this was asked and answered. So cool.


Is it true that $\sum_{k=0}^{n}k\cdot \left(\begin{array}{l}{n}\\{k}\end{array}\right)=O\left(2 ^ {n\log _{3}n}\right)?$

Problem: Is it true that $\sum_{k=0}^{n}k\cdot \left(\begin{array}{l}{n}\\{k}\end{array}\right)=O\left( 2 ^ {n\log _{3}n}\right)?$  My start of solution: $$\sum_{k=0}^{n}k\cdot \left(\begin{array}{l}{n}\\{k}\end{array}\right)\leq \sum_{k=0}^{n}k\cdot \left(\begin{array}{l}{n}\\{\lfloor \frac{n}{2}\rfloor}\end{array}\right)\leq \frac{n\cdot(n+1)}{2}\cdot \left(\begin{array}{l}{n}\\{\lfloor \frac{n}{2}\rfloor}\end{array}\right)\leq n(n+1)! \leq nn^n \leq n^{n+1}$$  I think this upper bound is way too large and I can't seem to find a solution.


What are the consequences if wizards can cast unprepared spells from their spellbooks?

It's a staple of the fantasy genre: faced with an obstacle the barbarian can't punch his way through, the wizard flips through his spellbook until he finds the perfect spell. He reaches into his component pouch, withdrawing—somehow—exactly what he needs, then casts a powerful spell, surprising the heroes and allowing them to continue on. Wizards don't get to do that in 5e. They prepare so many spells per day out of their spellbook, and unless the other spells within are tagged ritual, they don't get to see use until after the next long rest. I want to house-rule that a wizard can cast unprepared spells from their book in the absence of exigent conditions. If I have time and space to crack out my spellbook, being disallowed from mage armor, disguise self, or jump without [8 minus sleep] hours of study feels arbitrary. What about the game changes, especially balance-wise, if wizards are allowed to cast unprepared spells from their spellbooks? Note: this would be different from [ritual] spell casting from the spell book.  In this proposed scheme, casting an unprepared spell would still require slots.


Format a number with optional decimal places in Excel

I have numbers in cells in Excel. I want the numbers formatted so that if they have decimal places they show to a maximum of two, and if they have no decimal places it doesn't show any.  For example.    15 should be formatted as 15, NOT 15.00 14.3453453 should be formatted as 14.35 12.1 should be formatted as 12.1  0 should be formatted as 0   The closest custom format code I've come up with is 0.##. Unfortunately this formats 15.00 as 15. (note the extra decimal point).  To further complicate the issue, the spreadsheet is a result of an export from SQL Server Reporting Services. So no macros are possible. Oh well, it looks like 0.## is my best bet, and they can just live with the extra period.


I believe this line   if test "$suman_inspect" -eq "yes"; then   is causing this error (verbatim):  bash: test: no: integer expression expected   I formulated the above test expression because I saw this example online:   if test "$#" -eq "0"; then   where this test checks to see if the length of the arguments array is 0.  So is there something wrong with both these checks? I am not sure I understand how the first could be valid but the second one invalid.


I'm trying to learn how to use templated classes. I've created a simple templated class numbers that holds 2 numbers that can be any data type. Then I made a method that returns the bigger number of the two in the object. For some reason I keep getting linker errors though... Here's the errors and code. Not sure what's wrong, Visual Studio didn't underline anything in my code.    They say "unresolved external symbol" if it's too small to read.  templated.h  template <class T> class numbers { public:   numbers(T x, T y);   T bigger(); private:   T a, b; };   templated.cpp  #include "templated.h" #include <iostream> using namespace std;  template <class T> numbers<T>::numbers(T x, T y) {     a = x;     b = y; }  template <class T> T numbers<T>::bigger() {     return a > b ? a : b; }   main.cpp  #include <iostream> #include "templated.h" using namespace std;  int main() {      numbers <int>pair(1, 2);     cout << pair.bigger() << endl;      return 0; }   Thanks for reading!


Passing a pointer to a function - Why can't I print the address?

I don't understand why I can't print the address of the pointer. I know it's pretty fundamental to understand pointers, so any help is appreciated.  void printp(int& test) {         cout << test << endl; }  int main() {         int *p = new int;         *p = 1;         int np = 0;  //      printp(p);  // why doesn't this print the address of p? //      printp(&p); // why doesn't this print the address of p?         printp(*p); // prints 1         printp(np); // prints 0  return 0; }   I get the below error when I try using 'printp(p)'.  test.cpp: In function ‘int main()’: test.cpp:17:10: error: invalid conversion from ‘int*’ to ‘int’ [-fpermissive]   printp(p);  // why doesn't this print the address of p?           ^ test.cpp:5:6: note:   initializing argument 1 of ‘void printp(int&)’  void printp(int& test)       ^~~~~~ test.cpp:17:10: error: cannot bind rvalue ‘(int)p’ to ‘int&’   printp(p);  // why doesn't this print the address of p?


completeness in banach-steinhauss theorem

I would like to see an example (with some explanation) which shows that in Banach-Steinhaus theorem space $X$ must be really a complete space.


What is the best way to indicate a web page element has right click functionality?

Normally on the web, a right mouse click makes a browser menu appear. I am building a rich web application and most UI elements will have context menus with applicable actions on right click.  What would be the best way to let the user know that special functionality is available via a right click:   for a particular UI element (a panel or a button for example)   for most of the elements on the page?


Our vendor application database is very TempDB intensive.    The server is virtual (VMWare) with 40 cores and 768GB RAM, running SQL 2012 Enterprise SP3.   All databases including TempDB are on Tier 1 SSD in SAN.  We have 10 tempdb data files, each pre-grown to 1GB and they never auto-grow. Same with 70GB log file. Trace Flags 1117 & 1118 are already set.  sys.dm_io_virtual_file_stats shows over 50 Terabytes read/written on tempdb data & log files in past month, with cumulative io_stall of 250 hours or 10 days.    We have already tuned the vendor's code and SPs over past 2 years.  Now, we're thinking of placing tempdb files on RAM Drive since we have a ton of memory. Since tempdb gets destroyed/recreated when server is rebooted, it is an ideal candidate to place on volatile memory which also gets flushed out when server is rebooted.  I've tested this on a lower environment and it has resulted in faster query times but increased CPU usage, because the CPU is doing more work instead of waiting on slow tempdb drive.  Has anyone else put their tempdb on RAM in high oltp production systems? Is there any major disadvantage? Are there any vendors to specifically choose or avoid?


Underworld Connections: Tapping the Land for mana and ability?

Let's say i enchant a land with . Would i be able to tap said land for mana, and use the ability of Underworld Connections concurrently?


Best way find $\lim_{x\to 0}( \frac {\sin x}{x})^{\frac 1x}$

$\lim_{x\to 0}( \frac {\sin(x)}{x})^{\frac 1x}$ $$$$  I can use Tailor to get to $\lim_{x\to 0}(1+\epsilon(x))^\frac 1x$ $$$$  $(\epsilon(x)\underset{x\to\infty}\to 0)   $ $$$$ but does that mean that the limit equals 1?


Text Widget in Footer for just 1 page template

I am building a wordpress website and I want to show a text widget in the footer just for one page template. That widget shouldnot be seen for other pages. Is there any possible way for that?


Showing that every positive integer can be represented in this form

How can we prove that for every pair $N \in \mathbb{N}$, and natural number $\beta\in [2, \infty)$ there exists a unique set of integers $x_i \in [0, \beta -1]$, $k\in [0,\infty)$ such that:  $$N = \sum_{i=0}^{k}\beta^ix_{i}, \quad $$  It's a question if every positive integer has its unique representation in every base $\beta$. Is the validity of above statement somehow related to Horner's rule?


Can there be a continuous non-constant function with only rational values defined on an interval in R?           Or is the whole property meaningless?


How to find out if variable item contains specific words in Python?

I have created the following variable, which captures the function from a Point object I created:  j = i.getfunction() print(j)   The print(j) outputs something like this whenever it's called:  <function draw_H at 0x1057ce268>   What I want to do is find out if the item attached to the variable contains certain words. For instance, using the print(j) output above, I want to find out if j contains draw_H, like so:  if j contains draw_H:     # Run this code   How would I do this? Specifically, how would I find out if an item attached to a variable contains a certain word? Any help is greatly appreciated!


How to test @future methods with setup objects and avoid MIXED_DML_OPERATION

I’m in a situation where I have to use a future method to avoid  MIXED_DML_OPERATION error. I have a trigger that runs after INSERT on USER and creates  a custom object X. They are in 1:1 relation. User is an owner of X and sharing model is private.  I’m not sure what is the best approach to write tests for this scenario.  I want to keep my data isolated so in tests I need to create a User and X he owns. I can think of 2 scenarios:  1)  Create a mock user and let the trigger create X for the test  Because in test context @future methods are executed  when the Test.stopTest() is called I would have to enclose my set up section in Test.start/stopTest(). This means I can’t use these two later in the method where I want to  test a particular logic on X.   2)  Create a mock user, don't wait for future method and create X manually in mock section  I can write a single test  for creation of X in the trigger. In all other  tests checking  the business logic  on X I create a user, manually create X setting the user as the owner. The problem is that now if later in the method I call Test.start/stopTest() and do a select from X where ownerId = user.id I will get two X records.  To my surprise I discovered that I’m able to insert X objects from the trigger while running a test. I didn't use the @future method and I got no MIXED_DML_OPERATION error ( - a bug?).  for(User aUser: newUsers){       newXtoInsertFromFuture.put(aUser.ID, aUser.lastName )       objectX.add(new X(ownerID=aUser.id, property=aUser.lastName));  } if(Test.isRunningTest()){         insert objectX; }else{         matchUsersWithX(newXtoInsertFromFuture); }  With this code in trigger I can create a user in a test set up section and the corresponding X is created synchronously. I’m not sure why things work this way.  Anyway this looks like a dirty hack that yields the same problems as 2) if I ever call Test.start/stopTest() in the test.  Could any of you good people out there tell me what is the correct way to write tests in my case? thanks in advance.


If photons mediate EM force? How can they tell to be attracting?

Like a photon is neutral, when a proton say feels a push from another proton, how does the proton know it was a proton pushing it and not an electron pulling it?  Im not asking how the details work of the force, just how the maths explains the different "type" of photons needed for attraction/repulsion


I would like to setup an auto-responder in Gmail that includes an attachment. I can setup the auto-responder without issue but how do I add an attachment to an auto-responder in Gmail?


Selecting polygons within another polygons

I have the same city map (BH city) for two different shapefiles with different locations. The first one is the "shared management", this one have bigger polygons, as we can see  shared_management <- read_sf(dsn = 'TGC_POP_DENGUE_00_11_12_TAXA.shp') plot(st_geometry(shared_management))     And I have the smallers ones ("sectors")  sectors <- read_sf(dsn = 'SETOR_CENSITARIO_2010.shp') plot(st_geometry(sectors))     Then I need a list of polygons of "sectors" which is inside of each polygon of "shared_management".  I know the number of polygons of "sectors" inside of which polygon of "shared_management". This number is given by  geo.int <- st_intersection(sector, shared_management) geo.agg <- aggregate( ID_CS_2010~ID_TGC, data = geo.int, FUN = length) geo.agg1 <- aggregate( ID_CS_2010~IDENT_TERR, data = geo.int, FUN = length) head(geo.agg1) IDENT_TERR ID_CS_2010 1          B1        112 2          B2         98 3          B3         85 4          B4        123 5          B5        127   Any idea of how can I obtain which polygons of "sectors" are inside of each polygon of "shared_management"?


What is the first reference to an internet of computers in science fiction?

Considering the internet has substantially revolutionized our way of life (you're using it right now in fact) I was wondering whether it was ever envisaged in science fiction.  I'm therefore inquiring as to what the first reference in a science fiction story is where there are computers of some description (not necessarily digital, but devices which serve the same functions as computers do for us today) connected with access to the data on each device or to a central server and can communicate via this over long (even global/planet-to-planet) distances.  Basically, what is the first reference in sci-fi to a system like today's internet?


broadcom BCM4311 wirless problems with Ubuntu 12.04 LTS

I recently installed Ubuntu 12.04 LTS on my Dell D430 to replace an old version of Ubuntu. Now the wireless is not working. I have looked at a lot of the posts on the web and tried the suggestions to no avail. Can anyone give me a start? I tried using Synaptic and by using the help on the following links    and also looking at the blacklist.   Any help would be appreciated!


Best way to remove file extension from a string?

So, I'm using a script I've made to convert videos to the webm format. A certain program calls the script, sending %f which is the full, absolute file name of the video, like this:  converter.sh %f   where %f has two possible extensions, .avi or .mpg.  # /bin/bash ffmpeg -i $1 `dirname $1``basename $1 avi`webm && rm $1   It currently works perfectly when $1 contains a .avi file, because basename removes the .avi extension. When $1 ends with .mpg instead, the result is .mpgwebm.  How can I modify that script to be able to receive those two possible different formats?    Resuming: If $1 is /somedir/video.avi, the script should do:  ffmpeg -i /somedir/video.avi /somedir/video.webm   And if $1 is /somedir/video.mpg, the script should do:  ffmpeg -i /somedir/video.mpg /somedir/video.webm   I know this might be fool for some people, but I'm kind of new with the bash.


Breaking single polygon into multiple polygons?

I created voronoi polygons after which I dissolved them on the basis of one attribute. Now there are cases where in for one single attribute "abc" I have3 polygons at different places with same object id. I would like to break these into 3 polygons as they are at different locations.  Is there any tool in ArcGIS Desktop or QGIS which can help me in doing that?


What is this kind of spelling mistake called?

Consider the following sentence from  (a review of an episode from the TV show "How I Met Your Mother").  "The focus on Robin really aloud her character to get the kind of attention she has been missing for many a season."  Clearly, "aloud" should be "allowed". So, the writer has substituted one word with another that sounds the same when spoken, but is spelled differently and has a different meaning. What kind of spelling mistake do this call this in English?


Proof by induction that $1 + 2 + 3 + \cdots + n = \frac{n(n+1)}{2}$

I am trying to understand how to do proof by induction for inequalities. The step that I don't fully understand is making an assumption that n=k+1. For equations it is simple. For example:     Prove that 1+2+3+...+n = $ \frac {n(n+1)}{2} $ is valid for $ i \ge 1 $     1) Base case for n=1. (...)  2) Assume that equation is true for n=k. (...)  3) Proof for n=k+1. 1+2+3+...+k+(k+1) = $ \frac {(k+1)[(k+1)+1]}{2} $  So we add +1 to k on both sides.  For inequalities: Prove that $ 4n \lt 2^n $ is valid for $ n \ge 5 $  1) Base case. (...)  2) n=k assumption. (...)  3) n=k+1 proof.    How I would do this(add 1 to k on both sides): $ 4(k+1) < 2^{k+1} $  How it's done in tutorials: $ 4(k+1) < 2^k + 4 $ $ 4k+4 < 2^k + 4 $  Why they add extra 4 to RHS instead of increasing k by 1?


PLEASE READ THE QUESTION, DO NOT MARK AS DUPLICATE  I have looked at this   and this:   But I cannot find what is wrong  The textures show up in texture view just fine:  But not in render view:  It's just black  I've followed tutorials, created a material and then a texture, assigned an image and set coordinates to UV, selected map. Still not working.  Here is the blend:


How can I use a script to export a model as a Wavefront file(.obj)?

I am interested in exporting finger model with texture as Wavefront file (.obj) using a script. Many scripts were available online but they provide only vertices or faces. It would be of great help if anyone could provide me a script to save the all the information on that model. The model is shown below:


Which balancing issues, if any, would arise from allowing PCs to spend actions on bonus action features?

I understand that RAW, features/spells/etc. that require a bonus action (e.g. Bardic Inspiration or Healing Word) cannot be used with a regular action instead (see ).  However, what would be the long-term ramifications and effects on game balance if I were to instead allow PCs to use a regular action for bonus-action features/spells/etc.?  For the sake of narrowing this down a bit; I'm only asking about ramifications when allowing player characters to do this, no need to take NPCs or Monsters into account. I don't use the variant rule of feats either, so no need to consider those as well.


If $(a_n)$ is a decreasing sequence of strictly positive numbers and if $\sum{a_n}$ is convergent, show that $\lim{na_n}=0$  Since $(a_n)$ is decreasing and bounded below, by Monotonic Convergence Theorem, $(a_n)$ converges. So, there exists $N$ such that $|a_n-L|< \epsilon$   Since $\sum{a_n}$ is convergent, by the Divergence test, we have $\lim_n{a_n}=0$, which means there exists $N$ such that $|a_n-0|< \epsilon$  Then I get stuck at here.  I try to figure out the statement's meaning by inserting some examples, like $a_n=\dfrac{1}{n^2}$  Can anyone guide me on this question?


Will any of the Doctors remember what happened in "The Day of the Doctor"?

Spoiler alert.  In "The Day of The Doctor", the Doctors agree that they won't remember trying to save Gallifrey, but other information around this site has made me think otherwise. Will any of the Doctors remember attempting to save Gallifrey rather than burn it?     WARRIOR: I won't remember this, will I?       DOCTOR: The time streams are out of sync. You can't retain it, no.       WARRIOR: So I won't remember that I tried to save Gallifrey rather   than burn it. I'll have to live with that. But for now, for this   moment, I am the Doctor again. Thank you. Which one is mine? Ha!   So, will he eventually remember?  Oh, and before anyone answers this: I know, "timey wimey."


Laptop keyboard randomly not registering

So one day I opened my MacBook Pro, only to find that none of the keys were registering. A few seconds later, it gave me a popup that there was no bluetooth keyboard detected. My trackpad was also not registering. The only button that seemed to be working was the power button. When I pressed the power button, it brought up the usual popup dialog about whether I wanted to sleep, restart, or shut down. I had no way to click on any of the options, so I just held down the power button to force shut down. (Opening and closing the laptop didn't do anything).  When the computer booted back up, everything was working fine. I used my computer like normal, until a few days later, it happened again. o I did the same thing. This was maybe 5 days ago. And today, it happened again.  So it's not happening every time I use my computer, not even close, but it's still annoying, and I'd rather it didn't happen.  I didn't do anything to my keyboard before this happened, so I have no idea what could be causing it.  Anyone have any ideas?  EDIT: This question is not a duplicate of the linked question because in that question, the asker is having issues with specific buttons being stuck down. This seems like a physical issue with the hardware. In my issue, my computer is not registering my keyboard, and it telling me there is no keyboard attached. I haven't spilled anything on my keyboard or done anything else to it, so it seems like a software issue. I would share screenshots, but when this happens, I have no way to take screenshots.


After updates in 14.04 boots to black screen

I'm using Ubuntu 14.04 on a VirtualBox and I've done updates to the Ubuntu install today. After a reboot I get a black screen after login. I have another VBox of 14.04 without any updates and it works fine. I'm assuming the updates have caused the issue.   I've done some of the attempts at fixing with GRUB remove splash quiet, remove .Xauthority, use boot-repair (I get Gtk-warning cannot open display).   I can't create a new install because I'll lose all of my data and programs.   Help!


Question says modified when no modification was done?

This  on increased frequency of urination in biology displays in the biology main page as shown below.    As clearly seen, the post says modified by Good Gravy. However on opening the post, I could find no modification by Good Gravy. The revision history of the question shows nothing.   What was modified? How was it done? Is that a bug?


Every time I compile my document and produce a PDF, it does not print my citations or references section. The preamble is copied below. I have a .bib file and all of the packages installed, the .bib file is in the same folder as the manuscript .tex file. All the required packages are installed, and I have tried to fix this any number of ways, but with no luck. Does anyone have a suggestion? Note that I have tried to post a minimal working example in the code block. I am trying to get this to work on my own computer with the bibliography file I created from Zotero, rather than creating a new file contents on LaTeX, unless that is what you are supposed to do... I read the entire manual for biblatex but it does not explain clearly. \documentclass[man]{apa7}    \usepackage[english]{babel}    \usepackage{kvoptions}    \usepackage{url}    \usepackage{csquotes}    \usepackage{setspace}    \usepackage{textcomp}    \usepackage{amsmath}    \usepackage{amssymb}    \usepackage{amsthm}    \usepackage{etoolbox}    \usepackage{logreq}    \usepackage[sortcites=true,sorting=nyt,backend=biber]{biblatex}    \DeclareLanguageMapping{american}{american-apa}  %%\addbibresource{C:/Users/meese/Box/Research/SeekingButDefensive/NewSelfZoo/NewSelfZooBibliography.bib}     \begin{filecontents}{bibliography.bib}  @article{karlsson_ostrich_2009,     title = {The ostrich effect: Selective attention to information},     volume = {38},     doi = {https://doi.org/10.1007/s11166-009-9060-6},     pages = {95--115},     number = {2},     journaltitle = {Journal of Risk and uncertainty},     author = {Karlsson, Niklas and Loewenstein, George and Seppi, Duane},     date = {2009},     note = {Publisher: Springer}, }    \end{filecontents}    \addbibresource{bibliography.bib}     \begin{document}     cite{karlsson_ostrich_2009}     \printbibliography     \end{document}


Why is my data still being added to the list?

Hi I'm using a GUI and adding the users input into a list from a textfield when they press a button however when the textbox is empty, im still having an empty value being added despite my if statement to try and prevent that. I have tried to use null as the condition also which does not work either. Thanks.      String data = addField.getText();      if(data!=""){ // need to figure out why its adding blanks still        myList.add(data);        addField.setText("");        System.out.println(data + " was added to the list");     }


Is it possible to create files directly in Folders?

I have just bought a MacBook and recently switched from Windows OS. Let's take the example of Microsoft Word documents. In Windows OS, I have a habit of making my MS Word files in the destination directory itself, so all I have to do is save my work later.   However with my limited knowledge of MacOS, I realise there seems to be no way to achieve this, I always make a new MS Word file and only at the saving stage then I require to go through the whole motion of entering my nested folders. If I have to work on multiple files that would be stored in the same destination folder, this process will become quite irritating if the destination is quite deep into other folders.   Is there a way to overcome this dilemma in MacOS in general for any application?


Whenever i try to render the results it just shows this  does anyone know how to fix?


Wi-Fi network is not showing in Wi-Fi networklistk

I have laptop (HP Notebook - 15-ac132ne),I have a problem that if I move the laptop from a Wi-Fi device more than a meter, it don't connect to the Wi-Fi network , and if I move  the laptop from a Wi-Fi device more than two meters, the Wi-Fi network disappear and This problem didn't encounter me when I was using Windows  mohamed@mohamed-HP-Notebook:~$ lspci -knn | grep Net -A3; rfkill list 0d:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCI e Wireless Network Adapter [10ec:b723]     Subsystem: Hewlett-Packard Company Device [103c:804c]     Kernel driver in use: rtl8723be 1: phy0: Wireless LAN     Soft blocked: yes     Hard blocked: no 3: hci0: Bluetooth     Soft blocked: no     Hard blocked: no mohamed@mohamed-HP-Notebook:~$


Can matter actually go "inside" a black hole?

Pardon my question but I am no astro-physicist.  If a black hole is a singularity, A.K.A. a single point in space-time which is infinitely small and which has an infinitely high density, can matter actually go "inside" a black hole?   My question is not if we can cross/go past the Event Horizon area, but rather what happens to the matter that crosses it?  Does the immense time dilation make it so that any matter that crosses the horizon actually freezes in space-time before even "touching" the singularity? (But that would only be for an external observer if I'm right?) Or is matter simply "crushed" into particles and molecules from the sheer strength of gravity?  I know I've asked like 3 questions in one, but if I had to pick the main question it would be this :   Can matter go inside a singularity?


Can somebody say where I should put the adverb in this phrase:                                "I’m going to thoroughly teach you a lesson." or "I’m going to teach you a lesson thoroughly." And which adverb is better: "thoroughly" or "properly"?


Ubuntu 17.04: how to rename a USB network interface based on Path? (NOT based on MAC)

No, this ain't a duplicate of , as this explains how to restore eth0 naming, but not how to individually name a specific interface.  I don't want to assign based on MAC match. All I need is to assign name based on the USB path.  When I plug in an USB network adapter, on Ubuntu 17.04 it gets assigned a network interface name based on its MAC, such as encx000000000000. Now I would like to rename it to something more telling, based on its ID_PATH=pci-000:02:03.0-usb-0:1:1.0. In particular, I don't want to match based on MAC address. The rationale is that after interface replacement all would break down, but if someone simply replaces network interface hardware so that the new hardware is in the same place as the old one, the system will tuck on without needing IT and reconfiguration support.  So I created a file /etc/systemd/network/50-my-island.link:  [Match] Path=pci-000:02:03.0-usb-0:1:1.0 [Link] Name=island0   Unfortunately, the name is never assigned. Using udevadm info I can see that there is ID_NET_NAME=island0 set, but it does not apply. Trying NamePolicy= or NamePolicy=name under the [Link] section doesn't help either.  I'm lost! How can I assign my name in the .link file to my USB network adapter? Is this possible at all without resorting to some udev rule? Why then having .link files at all when they don't seem to work in my case? Where did I make an error?


I am trying to install Ubuntu One but here showing an error message.   I've no idea what does it mean and how to handle it.  Anybody please help me.


Purple lights has the highest frequency among all visible lights, while the red lights is the least frequent one. However, purple seems to be a mix of red and blue to human eyes, why?


"contribute to investigating" or "contribute to investigate"

I'm trying to find, which of the following sentences is correct?  A) We try to highlight how they contribute to investigate their importance. B) We try to highlight how they contribute to investigating their importance.  I found that both cases were used frequently in formal writing. Edited: Sources for each case: For A: "Their multifaceted nature means that there are very many routes to investigating their importance for understanding social change" in "A lineage for contemporary inter-city studies" book. B: "More factors are analysed to investigate their importance in scoring from shots and shot probabilities" in "Applications of logistic regression to shots at goal at association football" book.


I'm basically trying to install a package that requires snappy compiled in c for speed. I have already downloaded and installed the required compiler from here .  This  is the error I'm getting.  I can't figure out why it's not able to get stdint.h. It should come with the compiler right?   Any tips would be appreciated.


Solve the recurrence relation  $$f(n) = 2f(n - 1) + f(n - 2)$$ with initial conditions $f(0) = a, f(1) = b$. (here a and b are fixed, arbitrary integers).  I'm confused on how to approach this,  a and b are fixed, arbitrary integers.


Proof that every number has at least one prime factor

Prove that for $ n \geq 2$, n has at least one prime factor.  I'm trying to use induction. For n = 2, 2 = 1 x 2. For n > 2, n = n x 1, where 1 is a prime factor. Is this sufficient to prove the result? I feel like I may be mistaken here.


this question is not new. But I'm not able to understand what people have suggested. can someone take the patience of explaining it in simple words to solve it. Pls.


How is it perceived to withdraw an application to graduate school?

I applied to a program that I had been striving for in my undergrad, at a top school, but I've since felt overwhelmed with the thought of going this year. I think I should have waited until I was absolutely sure I could handle grad school emotionally and financially. I am so anxious now, thinking I've ruined my opportunity with this school if I don't go.   I am seriously considering withdrawing my application, but I'm very worried about how it might hurt me in the future when I reapply.  Otherwise I may have to decline if I am accepted and reapply.


Tools to help reverse engineer binary file formats

What tools are available to aid in decoding unknown binary data formats?  I know Hex Workshop and 010 Editor both support structures. These are okay to a limited extent for a known fixed format but get difficult to use with anything more complicated, especially for unknown formats. I guess I'm looking at a module for a scripting language or a scriptable GUI tool.  For example, I'd like to be able to find a structure within a block of data from limited known information, perhaps a magic number. Once I've found a structure, then follow known length and offset words to find other structures. Then repeat this recursively and iteratively where it makes sense.  In my dreams, perhaps even automatically identify possible offsets and lengths based on what I've already told the system!


What is the pointer-to-pointer technique for the simpler traversal of linked lists?

Ten years ago, I was shown a technique for traversing a linked list:  instead of using a single pointer, you used a double pointer (pointer-to-pointer).  The technique yielded smaller, more elegant code by eliminating the need to check for certain boundary/edge cases.  Does anyone know what this technique actually is?


A word for a big, difficult, weird question

Is there a word that describes an important question that is difficult to answer? I'm attempting to get permission for something big.


Any way to change a character to an image?

Sometimes, it is needed to change a character to an image: for example, change @ in an email address to an image. Is there any way to do that?


How to calculate the calorie content of cooked food?

I like to cook from scratch, and I'm currently trying to loose a few pounds. I know that cooked food is generally more calorific than raw food, so if I add up the calories of the ingredients I know it won't give an accurate result.  So my questions are two-fold:  How much difference is there between a raw food item and a cooked food item?  Is there a method to deduce the calorie content of cooked food (given the know values of its raw form) ?


Why in an inconsistent axiom system every statement is true? (For Dummies)

I would like to know if someone can explain in a somehow down to earth (almost logic free) way why is it true that in an axiom system where there is some statement $P$ such that $P$ and its negation $\lnot P$ are true, then every statement in the system is true?  I'm not sure if this can be done, but basically since I don't know any formal logic at all, I'm interested in seeing if at least the argument can be conveyed in an intuitive way, or if the idea can be explained without talking about first or second order logic and using symbols like $\top$, $\bot$, and $\vdash$.  This  is like the formal version (which I don't understand) so maybe my question can be thought of as a version for dummies of that question.   Thanks a lot in advance.


Certain step in proof that sequence converging to $e$ monotonically increases.

I just can't get my head wrapped around a certain step in a proof that the sequence that approaches $e$ is monotonically increasing. The proof starts as follows:  We want to show that: $x_{n+1} \geq x_n \iff \\ \big(1 + \frac{1}{n+1}\big)^{n+1} > \big(1 + \frac{1}{n}\big)^{n} \iff  \\ \big(\frac{(n+2)n}{(n+1)^2}\big)^n > \frac{n+1}{n+2} \iff ... \\ $  Now I have trouble understanding how we get from line 2 to line 3, anyone have a simple hint that can help me?  This question is not a duplicate because it asks for one certain step in an approach that is not covered in the linked question.


Can progress data for feature requests be made publicly available to the community?

I understand that requesting features towards Stack Exchange Inc. works like this:   you write a question-request here on MSE the community votes, and adds more thoughts, concerns, enhancements, ... someone, somewhen makes a decision. When the decision is "no, won't happen", then the story ends there. If not ... there is no clear feedback when/how that request will be picked up. Maybe someday, the new feature is just there, or it gets announced as experiment. But the user making the suggestion, and the community statement "we like this" ... has no idea when that is, and how many other features have a higher priority at any point.   The voting mechanism makes sense, to get an understanding of the priorities that the community sees.   But these days, when you do agile software development (and SE Inc. wants to be agile, see  for example), shouldn't there be some backlog kind infrastructure, too?   In other words: in 2019, there are tools like Trello, Jira Agile, Jira Portfolio, or Pivotal Tracker, and many others. I assume that SE Inc. is using such a tool to plan its activities.   Wouldn't it be great if the community related parts of their planning data would be publicly available to us?  According to SE Inc., they intend to listen to us. Being able to see how feature requests progress on their development planning would be a really great way to give the community feedback about ongoing work/activities.   Edit: I do not consider  to be duplicate that matches the intent of my question: defect trackers focus on low level information, such as "who touches module X at which point in time". I can understand that a company isn't eager about disclosing such internals. I don't want a level of detail that enables posts like "Look, SE Inc. engineer X takes double the time compared to Y, when they on community requested feature, why is that?"  What I ask for is to create transparency on the project planning side of things. Including "effort estimates", and appropriate information about "capacity" on the other hand, and the ability to quickly answer questions such as:   What is worked on right now? When should that thing be completed, according to the plan? ...


Select statement to call stored procedure generating error

I want to call the stored procedure in select statement of SQL server. When I call the stored procedure it is generating error.  What can be wrong in the below select statement??  Select i.item as col1, exec StoreProc_name(i.item) as col2 from tbl_item as i where i.item>100   This is not working. What is the right way to call stored procedure in   SQL server.


Evaluating $\lim_{n \to \infty} (1 + 1/n)^{n}$

I was recently thinking about how I could evaluate the famous limit of 'e' as I haven't ever seen a proof. I can't really find anything online so I've tried to evaluate the limit myself. And I was also thinking it would be nonsensical to use L'Hopital's rule, am I right?  So I did the following:  $$\lim_{n \to \infty} \left(1 + \frac{1}{n} \right)^{n} = \exp \left(\lim_{n \to \infty} n \cdot \ln \left(1 + \frac{1}{n} \right) \right)$$  $$=\lim_{n \to \infty} \exp \left( n \cdot \left( \frac{1}{n} - \frac{(1/n)^{2}}{2} + \cdots \right) \right)$$  $$= \lim_{n \to \infty} \exp \left( 1 - \frac{(1/n)}{2} + \cdots \right)$$  $$= e$$  I am not sure, is my logic correct or does it create circularity by taking logarithms and assuming $$f(x) = \exp \left( \ln f(x) \right)$$ ?


operator[] on basic types with pointer argument

What happening in following code?  int main() {     int i = 37;     int* pi = &i;     i[pi];  //works     i[0];   //error C2109: subscript requires array or pointer type }   Why is allowed to indexing int with pointer argument and what does it do?


Are runtime bounds in P decidable? (answer: no)

The question asked is whether the following question is decidable:     Problem  Given an integer $k$ and Turing machine $M$ promised to be in P, is the runtime of $M$ ${O}(n^k)$ with respect to input length $n$ ?    A narrow answer of "yes", "no", or "open" is acceptable (with references, proof sketch, or a review of present knowledge), but broader answers too are very welcome.  Answer  Emanuele Viola has   that the question is undecidable (see below).  Background  For me, this question arose naturally in parsing Luca Tevisan's answer to the question     The question relates also to a MathOverflow question: , in a variation in which the word "mathematics" is changed to "engineering," in recognition that runtime estimation is an ubiquitous engineering problem associated to (for example) control theory and circuit design.  Thus, the broad objective in asking this question is to gain a better appreciation/intuition regarding which practical aspects of runtime estimation in the complexity class P are feasible (that is, require computational resources in P to estimate), versus infeasible (that is, require computational resources in EXP to estimate), versus formally undecidable.  --- edit (post-answer) ---  I have added  to MathOverflow's  community wiki "Attractive Turing-undecidable problems".  It is that wiki's first contribution associated to the complexity class P; this attests to the novelty, naturality, and broad scope of Viola's theorem (and IMHO its beauty too).  --- edit (post-answer) ---  Juris Hartmanis' monograph Feasible computations and provable complexity properties (1978) covers much of the same material as Emanuele Viola's proof.


I can't review posts anymore—was the minimum reputation changed?

Is it just for me, or has the privilege to review new posts and late answers changed for everyone?  I recently started being more active in reviewing, but the rep requirement just shot up and I can not review anymore? The rep requirement has shot up to 500. Is this just for me, as a 'process", or has it been changed site wide?


I am looking for a reference on mathematically strict definition of class. For example, how do you construct the class of all ZFC-sets?


$\lim_{n\to\infty}a_nb_n=? $ given that $\lim_{n\to\infty}a_n=0$ and $\lim_{n\to\infty}b_n=\infty$

A. $\lim_{n\to\infty}a_nb_n=?$ given that $\lim_{n\to\infty}a_n=0$ and $ \lim_{n\to\infty}b_n=\infty$  B. $\lim_{n\to\infty}{a_n \over b_n}=?$ given that $\lim_{n\to\infty}a_n=0$ and $\lim_{n\to\infty}b_n=0$  C. $\lim_{n\to\infty}{a_n \over b_n}=?$ given that $\lim_{n\to\infty}a_n=\infty$ and $\lim_{n\to\infty}b_n= \infty$    These seem to be difficult situations I come across when I have to evaluate limits.   Some examples,    $\lim_{n\to\infty}n^a\sin(1/n^b)$ with $a,b>1$   $\lim_{n\to\infty}{n^a\over \sin(1/n^b)}$ with $a,b>1$   $\lim_{n\to\infty}{1/n^a\over \sin(1/n^b)}$ with $a,b>1$   $\lim_{n\to\infty} nf(x_n)$ [where we only know that $\lim \ f(x_n) = 0]$    My first question is : Are the two situations  A and B  equivalent ? I feel that they are equivalent as $\lim_{n\to\infty}b_n=\infty \iff \lim_{n\to\infty}{1\over b_n}=0$, The problem is that I'm not sure if we can apply the product rule for limits to take the limit inside.  My second question is : What are some ways to solve such problems ? I only know that we can apply stolz- cesaro in some cases.


What causes the glitch when passing loop counter to Task-based method below?

static Task<int> GetPrimeCountAsync(int start, int stop) is for counting the number of primes in a closed interval [start,stop] where 2 < start <= stop. static void WrapperAsync() is for printing a list of 10 executions of GetPrimeCountAsync, each with a closed interval spanning from i == 0 ? 3 : 1000_000 * i to 1000_000 * (i + 1) - 1, where i spinning from 0 to 9. Inside this method, there are 3 cases, only one is activated.   when case 1 is activated, the result is as follows:   when case 2 is activated, the result is as follows:   when case 3 is activated, the result is as follows:      Questions  If we compare case 1, 2 and 3, there are the same glitches in case 1 and 2 but not in case 3. The case 3 is the wanted result.  Actually the glitches can be removed by buffering the loop counter with local variables as follows:  int start = i == 0 ? 3 : 1000_000 * i; int stop = 1000_000 * (i + 1) - 1;   And then just pass start and stop to GetPrimeCountAsync and WriteLine.  The question is: What causes these 2 glitches in case 1 and 2?  Complete Code  using System; using System.Linq; using System.Threading.Tasks; using static System.Console;   class Program {     static void Main()     {         WrapperAsync();         WriteLine("Ended...");     }       static void WrapperAsync()     {         for (int i = 0; i < 10; i++)         {             //int start = i == 0 ? 3 : 1000_000 * i;             //int stop = 1000_000 * (i + 1) - 1;              // case 1: OnCompleted             var awaiter = GetPrimeCountAsync(i == 0 ? 3 : 1000_000 * i, 1000_000 * (i + 1) - 1).GetAwaiter();             awaiter.OnCompleted(() => WriteLine($"The number of primes between {(i == 0 ? 3 : 1000_000 * i)} and {1000_000 * (i + 1) - 1} is {awaiter.GetResult()}"));              // case 2: ContinueWith             //var task = GetPrimeCountAsync(i == 0 ? 3 : 1000_000 * i, (i + 1) * 1000_000 - 1);             //task.ContinueWith(t => WriteLine($"The number of primes between {(i == 0 ? 3 : 1000_000 * i)} and {(i + 1) * 1000_000 - 1} is {t.GetAwaiter().GetResult()}"));              // case 3: without OnCompleted and without ContinueWith             //var task = GetPrimeCountAsync(i == 0 ? 3 : 1000_000 * i, (i + 1) * 1000_000 - 1);             //WriteLine($"The number of primes between {(i == 0 ? 3 : 1000_000 * i)} and {(i + 1) * 1000_000 - 1} is {task.GetAwaiter().GetResult()}");         }     }      //  Note that 2 < start <= stop      static Task<int> GetPrimeCountAsync(int start, int stop)     {         var count = ParallelEnumerable.Range(start, stop - start + 1)                     .Where(i => i % 2 > 0)                     .Count(j => Enumerable.Range(3, (int)Math.Sqrt(j) - 1).Where(k => k % 2 > 0).All(l => j % l > 0));          return Task.Run(() => count);     } }


How do I use Messages with Google Hangouts on MacOS Mojave?

After upgrading to MacOS Mojave, Messages no longer allows me to sign in to Jabber / Google Talk.  Previously, if the Jabber account was offline, it offered a dropdown to sign back in.  Now, that dropdown appears to be gone.


Can you create images like this:    when you have something like  0 = green (#54ff00) 1 = white (#ffffff) 2 = red   (#ff0000) 3 = blue  (#0048ff)  Image (Python list of integers defined above): [[2,0,0,0,0,0,0],  [0,3,0,0,0,0,0],  [0,3,2,1,1,0,0],  [0,3,2,2,2,1,1],  [0,3,2,0,0,1,0],  [0,0,0,0,0,1,0],  [0,0,0,0,0,1,0]]   with TikZ?  How far I got  The following MWE defines all colors, produces a grid of the correct size (though the size is determined by hand):  \documentclass[varwidth=true, border=2pt]{standalone} \usepackage{tikz} \usepackage{xcolor}  \begin{document}     \newcommand\n{7}     \definecolor{green}{HTML}{54FF00}     \definecolor{wite}{HTML}{FFFFFF}     \definecolor{red}{HTML}{FF0000}     \definecolor{blue}{HTML}{0048FF}     \begin{tikzpicture}         \foreach \x in {1,...,\n}{             \foreach \y in {1,...,\n}{                 \begin{scope}[shift={(\x,\y)}]                   \draw [fill=green] (0,0) rectangle (1,1);                 \end{scope}             }         }     \end{tikzpicture} \end{document}   Of course, I could simpy make a lot of adjusted                   \begin{scope}[shift={(\x,\y)}]                   \draw [fill=green] (0,0) rectangle (1,1);                 \end{scope}   but I've wondered if this can (with reasonable effort) be done in TikZ / LaTeX.  My problem is giving TikZ the color array. I don't have any idea how to do this. I only know two types of looks in TikZ:  \foreach \x in {0,1,2,3,4,5}{...} \foreach \number in {1,...,\n}{...}   I have never seen a nested over a 2D-array. All I have seen so far were 1D-Arrays of tuples (with fixed tuple size).


How long does it take for a black hole to form for an external observer?

The well-known fable of an astronaut sending signals out to an external observer while falling toward an event horizon states that the time lapse between such signals becomes greater even if in the astronaut sends them out periodically (as judged in his inertial frame). When viewed from earth and weighing time-dilation due to the gravitational field of the collapsing star, how is it possible that a black hole can form in finite time (for any external observer) if it takes an infinite amount of time to "see" events occurring at the event horizon?


Are free electrons in a metal really free

Is it an accurate statement to say that free electrons in a metal experience NO restoring force when they interact with electromagnetic waves? I understand that the electrons exist in a space filled with ions, and doesn't the cumulative potential that is present due to the presence of the ions exert an electric field on the electrons. Even in the case of simple metals, where you can say that the nucleus is shielded by the valence electrons, so called Coulomb shielding, how significant is the shielding. Naively, it seems to me that because the charge in the nucleus is not balanced by the charge in the bound electrons, there should be some net potential that the free electron sees.


Troubles installing Cisco Packet Tracer 7.1 on Ubuntu 17.10

During installation of Packet Tracer 7.1, I've encountered no problems. When trying to run  ~$ packettracer   nothing happened, no welcome screen or anything. I then typed  ~$ cd /opt/pt/bin ~$ ./PacketTracer7   which returned the following message:  ./PacketTracer7: error while loading shared libraries: libQt5WebKitWidgets.so.5: cannot open shared object file: No such file or directory   To determine which libraries were missing, I issued the following command:  ~$ ldd PacketTracer7   to get the list of missing libraries. The following turned out being missing:   libQt5WebKitWidgets.so.5 libQt5WebKit.so.5 libQt5Multimedia.so.5 libQt5PrintSupport.so.5   My question is: how do I install those packages, because running the following command did not work:  ~$ sudo apt-get install libQt5WebKitWidgets*   The error message was:  E: Unable to locate package libQt5WebKitWidgets* E: Couldn't find any package by glob 'libQt5WebKitWidgets*' E: Couldn't find any package by regex 'libQt5WebKitWidgets*'   Can somebody please help me?


Prove that $a^ab^bc^c\ge (abc)^{(a+b+c)/{3}}$

Prove that $$a^ab^bc^c\ge (abc)^{(a+b+c)/3}$$  My attempt: $$a^ab^bc^c\ge (abc)^{(a+b+c)/{3}}\implies \bigg(\dfrac{a}{b}\bigg)^{(a-b)/{3}}\bigg(\dfrac{b}{c}\bigg)^{(b-c)/{3}}\bigg(\dfrac{c}{a}\bigg)^{(c-a)/{3}}\ge 1$$    I have a slightest hint that symmetry might be helpful here, but wondering how. Please help.  I know that this question has been asked before, but I could not see any soltuion having my approach, so I am wondering if any solution is possible using my approach or it is a dead end.


Where do files for the programs from the software center get saved?

So im looking for the README file for DOSBOX, but have no idea where it is.  feedback for Ubuntu makers: it would be great if there was a "Programs" file like in Windows.  Thanks


How can I easily add code under the  tag without using hooks?

I need to trying to get the Facebook SDK for JavaScript code inserted just after the  tag.  What's the easiest way to do this?


Is it possible to use hundreds of Android devices with the same google account?

We have developed a App that uses GCM push, that seems that needs Google Play Services (Google account).  Customer has 100-200 devices, it it possible to use the same google account in all devices? Gmail will be inactivated, and buy apps to Market will be disallowed.  Aditional info: We have proposed Google for Work, but Customer is not interested at this moment


I haven't been able to find an understandable explanation of how to actually use Python's itertools.groupby() function.  What I'm trying to do is this:  Take a list - in this case, the children of an objectified lxml element Divide it into groups based on some criteria Then later iterate over each of these groups separately.  I've reviewed , but I've had trouble trying to apply them beyond a simple list of numbers. So, how do I use of itertools.groupby()?  Is there another technique I should be using?  Pointers to good "prerequisite" reading would also be appreciated.


I have a small home network that just got larger (new roommate, my existing roommate got a laptop (on top of her computer), my friends coming over with laptops, etc.).    I'd like to run a local DNS server for lookups of my local network stuff (fileserver.local, windowsTV.local, machineA.local, machineB.local, appletv.local).   I used to have a business line with a static IP, and run bind/named internally.   However, now I have a normal account.  My ISP's DNS servers are constantly changing (for whatever reasons my ISP doesn't like to keep the same IP range for long).  I need my local DNS to be automatically updated to use my ISP's DNS for external traffic, but be able to maintain an internal DNS server (getting to update the hosts file is being a hassle with every new machine on top of rebuilding existing machines with win7 or Ubuntu 9.04).  Additionally, My ISP's DNS servers often crash or become unresponsive.  Are there any open DNS servers that are reliable (I don't want to reconfig every day) that I could use as my primary, then if those fail, then use my ISP's?  UPDATE:  Also looking for each workstation to be able to use dhcp to connect, but instead of getting ISP DNS servers, getting my internal one....


Generally we use "hads* with he , she , and it.   So which one is correct to say ?  Does this phone has / have xyz function ?   Does his father has / have a car ?


Why does ebonite rod gets negatively charged when rubbed with fur

What I think is :  The protons are present at the centre of the atom with rotating electrons around it so when it is rubbed by fur the electrons get passed from the ebonite rod to the fur leaving the rod negatively charged. But in reality the rod is negatively charged Why ?


How much money do you need to have on hand when entering USA?

My friend, a Chilean citizen, is entering the US via waiver program to spend 3 weeks in USA in a couple of weeks. She already got her ESTA approval, the plane ticket, all hotels are already booked (but paid by me, not her).  How much money would she need to bring with her when entering US? Do they still check this? She would of course have credit cards with her.


Why am I getting nullpointerexception in this code?

enter code here import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*;  public class Solution  {     static boolean visited[];     static int vertices;     static boolean tree[][];      public static void main(String[] args)      {         /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */         Scanner sc=new Scanner(System.in);          vertices=sc.nextInt();         int edges=sc.nextInt();          visited=new boolean[vertices+1];           boolean tree[][]=new boolean[vertices+1][vertices+1];         for (int k=0;k<vertices+1 ;k++ )          {             for (int j=0;j<vertices+1 ;j++ )             {                 tree[k][j]=false;             }           }          int count[]=new int[vertices+1];         //Arrays.fill(count,1);          for(int i=0;i<edges;i++)             {             int u=sc.nextInt();             int v=sc.nextInt();              tree[v][u]=true;            }          for (int i=0;i<vertices+1 ;i++ )          {             count[i]=bfs(i) + 1;             //getting error at this line          }         int finalcount=0;         for (int i=0;i<vertices+1 ;i++ )          {             if (count[i]%2==0)              {                 finalcount++;              }          }          System.out.println(finalcount);       }    public static int bfs(int node)       {       Queue<Integer> q=new LinkedList<Integer>();       for(int i=0;i<vertices+1;i++)           {           visited[i]=false;       }       visited[0]=true;       int counter=0;       q.add(node);       while( !q.isEmpty() )       {          int nextNode;                // Next node to visit          int i;           nextNode = Integer.valueOf(q.remove());           if ( ! visited[nextNode] )          {             visited[nextNode] = true;    //mark visited               for ( i = 0; i < vertices+1; i++ )              {                   if ( tree[nextNode][i] && ! visited[i] ) //getting error at this line too                 {                       q.add(i);                     counter++;                 }              }          }       }        return counter;   } }      /*  10 9 2 1 3 1 4 3 5 2 6 1 7 2 8 6 9 8 10 8 ans:2   20 19 2 1 3 1 4 3 5 2 6 5 7 1 8 1 9 2 10 7 11 10 12 3 13 7 14 8 15 12 16 6 17 6 18 10 19 1 20 8 ans:4    */   I am getting nullpointerexception. I have commented the line where the error is occurring. Please Help!    This is the solution for even tree problem on hackerrrank... I know the logic but getting this error.


How can I encourage Stack Overflow to rein in the 'subjective' vigilantes?

I'm on SO pretty much every day researching something to do with programming, and over the last month or two, I find I'm growing frustrated and a little disgusted at how many interesting questions have been closed as "not a good fit" or "too subjective".  I think there is a confusion between "subjective" and "calls for judgement". To me one of the most valuable things about SO is the tremendous breadth and depth of experience of the members, and experience translates into smart decisions and advice, and that advice cannot always be asked for, or expressed in terms of, bald facts and data.  It's going to be 'subjective'.  I don't think SO should be Wikipedia. I think that if I could ask a question to a group of skilled programmers sitting around a table at lunch, and get interesting, valuable answers, then I don't care whether the question or the answers are 'subjective', I think that question should equally well be fair game for Stack Overflow.  I would like to see a mechanism whereby people who vote to close a question lose reputation when somebody expresses interest in that question or its responses.  How can I, or can I, influence this aspect of SO?


How do I use GROUP BY to display the result by group (email)? this is my file .php  <?php /**  * Created by PhpStorm.  */ namespace Drupal\gestion_contact\Controller; use Drupal\Core\Controller\ControllerBase; class GestionContactController extends ControllerBase {     public function admin() {           $result = db_query("SELECT * FROM {contact}");              $node = $result->fetchAll();          return array(             '#theme' => 'gestion_contact',             '#nodes'=> $node,          );     }     public function delete($id)     {          db_delete('contact')             ->condition('id_contact', $id)             ->execute();         drupal_set_message(t('Your form has been deleted'));          $result = db_query("SELECT * FROM {contact}");          $node = $result->fetchAll();         return array(             '#theme' => 'gestion_contact',             '#nodes' => $node,          );     }     public function afficher()     {          $result = db_query("SELECT * FROM {contact} WHERE vu = :vu",             array(':vu' => 'false'));         $node = $result->fetchAll();         return array(             '#theme' => 'nouveaux_contact',             '#nodes' => $node,         );     } }


If $a_n$ is the $n$th term of the Fibonacci sequence, then prove that $a_{n+1}^2 - a_n a_{n+2} = (-1)^n$.

This, I think uses induction. I simplified the equation to get $a_{n+2}.a_{n-1} - a_n(a_n + 1) = -1^n$ This might not be simplifying it at all. Also, I noticed that at $n+1$, R.H.S. becomes$-1^{n+1}= -1\times$ previous L.H.S.


I had a dataset that consists of 20000 chess matches. In this dataset, there are columns and variables- such as the players' ratings- that might have an impact on binary data, a white player is more likely to win. To test this hypothesis, my lecturer told me to perform a nested regression model where I could see the effect of each of these variables. Since it's binary data, I thought about making a nested logistic regression model. However, I don't know how to do that and how to do that in python. Can someone please help?


E: Problem executing scripts APT::Update::Post-Invoke-Success :(

I am getting the following error when I run sudo apt update:  E: Problem executing scripts APT::Update::Post-Invoke-Success 'if /usr/bin/test -w /var/lib/command-not-found/ -a -e /usr/lib/cnf-update-db; then /usr/lib/cnf-update-db > /dev/null; fi' E: Sub-process returned an error code


I'm trying to establish why a process keeps unexpectedly stopping, and one possibility is that the server is running out of memory, but I'm not sure I understand memory and Linux properly.  Take the following output from the free command (taken from the same machine with the issue I'm trying to fix):               total       used       free     shared    buffers     cached Mem:           991        827        163          0        107        361 -/+ buffers/cache:        358        633 Swap:            0          0          0   The top line suggests that this machine is indeed using a lot of memory (only 163 Mb free) and so if a few more processes fire up (which they do) then we could have an out of memory situation with various processes being killed.  However, I've always been led to believe that as Linux makes great use of buffers and caches in memory which can be used if needed, that the figure I should be paying more attention to is the second line which suggests that ~633 Mb is free, in which case I think it's unlikely that this machine is running out of memory.  So can you clarify my understand of Linux and memory, and help me understand when Linux actually runs out of memory?  PS - this machine is a single purpose machine - it runs the background process for a large web application, that's all it does. No web server, no database, just one huge Ruby on Rails app running as a background process. Occasional cron jobs fire up for specific application tasks which would temporarily create another instance of the rails app in memory.


So effectively, I am working on creating my very own TTRPG rulebook based on my own setting and universe. The only question I got is how much of mechanics am I allowed to be inspired by?  Effectively, Warhammer 2E was a HUGE inspiration for this. I loved the percentiles, the combat mechanics, how your character begins as a no one and climbs up to being a hero. Or easily dies. I loved how the skills worked and everything.  I ask as I would really enjoy using the percentiles and combat. Not necessarily the same skills, (Read/Write is an example of one I wont be using) and more flavored to my own setting, with new skills coming in and old skills going away. I would also be changing how advance skills work entirely as well. Magic System would also be entirely changed from it, so mainly I am asking if it would be legal to use the main attribute system, secondary attribute system, and the combat system and, if so, to what degree.


What happened to Gandalf after his battle with the Balrog?

After Gandalf fights the Balrog in The Lord of the Rings, he is carried off by an eagle. There is a scene where he is lying down in a white room and only his head and shoulders are visible.  The next time he is seen is in Fangorn forest. He is now recognized as "Gandalf the White". When Aragorn addresses him as Gandalf, he responds with, "Gandalf ... yes, that's what they used to call me. Gandalf the Grey."  He also explains that he was sent back. But who sent him back? Did he die? Where did the eagle carry him?


Rudin in Real and Complex Analysis uses this in a proof near the beginning of chapter 9:     $\displaystyle \left \vert{ \frac {e^{-ixu}-1}{u}}\right\vert \le \vert x \vert$ for all real $u \ne 0$   Why is this true?  Edit: I believe $x$ is real


I searched many websites to know what exactly lift will do? The results that I found all were about using it in applications not itself.  I know about the support and confidence function. From Wikipedia, in data mining, lift is a measure of the performance of a model at predicting or classifying cases, measuring against a random choice model. But how? Confidence*support is the value of lift I searched another formulas too but I can't understand why the lift charts are important in accuracy of predicted values I mean I want to know what policy and reason is behind lift?


Regarding difference in dimensions of a physical quantity in different unit systems

So, Coulomb's Law states that $F_e = k\dfrac{q_1q_2}{R^2}$, where $F_e$ is the force of attraction between two charged particles of magnitude $q_1$ and $q_2$, where the distance between them is $R$. $k$ is Coulomb's constant here. In SI units, $k$ has some dimensions whereas in CGS/Gaussian units, it doesn't. This would imply that the dimensions of charge in both of these unit systems is different, right? But, shouldn't a certain physical quantity have the same dimensions in every single unit system? Please clarify this.


Please add an option for searching a question in all categories. So, that we don't have to bound with a topic like if I am searching a mathematics-related question then it should be searched in whole topic, including physics also, matching keywords.


How do I get an engagement ring past security/customs in an airport without alerting my significant other?

A related , made me wonder how you can hide a ring from a "special one" traveling with you to a place where you will propose and yet get it legally through security or customs? You don't want the surprise to be killed by a bureaucrat.


Too much space between full paragraph and subequations env

I have a document using subequations and the parskip package. If the paragraph before a subequations environment is completely filled up to the last line, then additional vertical whitespace is introduced between this paragraph and the following subequations. I guess this is a bug, but I'm not sure, nor do I have enough TeX knowledge to try and fix it. How can I fix this whitespace issue?  Below is a MWE which shows the behaviour, at least on LaTeX2e <2003/12/01> with pdfeTeX 3.141592-1.21a-2.2 (unfortunately on this machine only an old tetex distribution is installed).  \documentclass[a4paper,11pt]{article}  \usepackage{parskip} \usepackage{amsmath}  \begin{document}  The subequations environment provides a convenient way to number a foos \begin{subequations}\label{foo}   \begin{align}     x^2 + y^2 &= z^2\\     a &= b + c   \end{align} \end{subequations}  \end{document}


Positive integers $n$ that cannot be written as a sum of $r$ consecutive positive integers, with $r > 1$, are of the form n = $2^l$ for some $l ≥ 0$.

Prove that the positive integers $n$ that cannot be written as a sum of $r$ consecutive positive integers, with $r > 1$, are of the form n = $2^l$ for some $l ≥ 0$. I wrote just  k+(k+1)+.....(k+r-1) as $2^l$ and then by applying AP formula, it gets me to something like $r/2 ( 2k + (r-1))$ = $2^l$ which leads to nowhere.. .I did to get a contradiction. I have shown my approach and this is not a homework problem.I need some help to move from here or a new way to solve  the problem in a less cumbersome manner. Thank you.


Variable scope witihin requirejs modules

I am new to requirejs and don't understand variable scope.   So previously, for example, I had:  var Foo = "some value";  function firstFunction () {      //do something with Foo here     console.log(Foo);       }    function secondFunction () {      //do something else with Foo here     console.log(Foo);       }   But within a module  define(function() {     return {        //how do I declare Foo within the module so it is available to firstFunction and secondFunction?        firstFunction: function() {           //do something with Foo here           console.log(Foo);           },        secondFunction: secondFunction () {          //do something else with Foo here          console.log(Foo);          }      }      });   Is there a way of declaring the variable Foo within the module and to make it available to  firstFunction() and secondFunction()?


Prime numbers using generators in Python?

I wrote this simple python function to calc:  def isPrime(number):     if number == 2:         return True      elif number > 1 and number % 2 != 0:         for current in range(3, number):             if number % current == 0:                 return False          return True   And I'm calling it to print out the sum of all prime numbers from 1 to 2 million, as in project   However it's terribly slow, and I was wondering if I could tackle the same problem using generators? But I don't really understand generators in python completely..  Any help on how to solve this problem more efficiently would be appreciated! Thanks :)


I have a dataset of 25 instances these instances are divided into 2 classes Green Circles and Blue Squares  data distributed as this graph    I want to predict X's class based on "Likelihood Weighted KNN with k =3"  In normal KNN this is easy  the nearest 3 points are 2 Blue Squares and 1 Green Circle  which means X will be Blue Square   there are more Blue Squares neighbours than Green Circles (2 vs 1)   But What is needed is to find the Likelihood Weighted KNN with k =3  This is my try  In this case we have to calculate the weight (Likelihood) for each instance  Each Green Circle likelihood is $\frac{1}{5} $ , we have 5 Green Circles  While for Blue Squares it is  $\frac{1}{20} $ , we have 20 Blue Squares  Therefore the weights around X will be $\frac{1}{5} $  Green Circle, and $\frac{2}{20} $ Blue Squares.  which means $\frac{1}{5} > \frac{2}{20} $  Then X is Green Circle  Well, this is wrong :(  Can someone help me find the


This is a question about JavaScript Prototype Chaining.  I've read some documentation about this, and the syntax doesn't really make much sense to me.    The way I've understood JavaScript Prototypes is essentially some syntactic candy that wraps around a function call which just adds properties to a new object named this.  Basically, turning what you might do in JavaScript without prototypes from this:  function PsuedoClass(arg0, arg1){     var this = {};      this.arg0 = arg0;     this.arg1 = arg1;      return this; }  var obj = PsuedoClass(0, 1);   into what we all know and love:  function PsuedoClass(arg0, arg1){     this.arg0 = arg0;     this.arg1 = arg1; }  var obj = new PsuedoClass(0, 1);   So naturally, the way one might expect to do inheritance in JavaScript would essentially to be call the constructor functions in a chain. It only makes sense, Apply all the properties from both PsuedoClasses into one object.  The whole obj.prototype thing just seems out of the blue to me. It seems to destroy the natural flow that JavaScript seems to lead you on. It would be much more intuitive if just using PsuedoClass.call(this, arg0, arg1); would be enough.  And it almost does, except then javascript's instanceof operator fails.  And there's more arguments than just increased readability that JavaScript's obj.prototype should be removed.  It simplifies the JavaScript Inheritance, reducing things from 2 lines to 1.  If they'd make PsuedoClass.call(this, arg0, arg1) cause this to be an instanceof PsuedoClass, it'd make it possible to do things like this:  function CustomRowClass(){     this.someCustomMethod = function(){} }  var tableRow = document.getElementById('myRow'); CustomRowClass.call(tableRow);  console.log(tableRow instanceof CustomRowClass); //returning true tableRow.someCustomMethod();   I'm really not trying to bash JavaScript as a whole here, I think the language does make a lot of sense in many ways, its just this Prototype chaining is not what I expected it to be, and it doesn't really make intuitive sense.   Am I missing something here, is there a way to understand this obj.prototype in an intuitive way? Everything about it just throws things off for me.  Or is there a simple way to use PsuedoClass.call(this, arg0, arg1); and get the desired instanceof behavior?


My Desktop PC:   Asus P5KC Intel Q6600 2.4GHz 4Gb RAM DDR3 Geforce GT1030 Lubuntu 64bit Geforce GT1030 driver version:- 390.12   I am using the right drivers from Lubuntu but my CPU is at 80% to 100% on YT 4K video  On YouTube playing on 4K @60fps I get very high CPU load. I've tried h264ify but it's still lagging with very high CPU load. I tried different Internet browsers including Chrome, Firefox, Opera, and a patched version of Chromium, but the result is the same.  I don't have this problem with Windows 10 (64-bit). There CPU usage is 10% or 20% to 30% on YouTube 4K video and all web browsers work excellently, the only problem is memory (RAM).  So that's why I tried Lubuntu.  Any solution?


Hi I am a bit of a science noob but anyway I'm writing a little Sci-fi story and I just want to know if there is a substantial difference in perceived time passed at point A and point B if Point A is on the tip of our galaxies outer edge and point B is say two thirds of the radius in (from the outer edge of the galaxy)?  Just because I was going to have two alien factions fighting over outer territories for research purposes (There home worlds are closer to the center of the galaxy so if they conduct research out there on weapons and stuff they can get a leg up on the competition because they have more time to do research, IDK if I'm explaining it well but I think you'll get what I'm Saying).


Ball motion with air resistance coupled differential equation for fourth-order Runge-Kutta

I've created a MATLAB function for solving coupled differential equation with the fourth-order Runge-Kutta method based on what is provided  (Simultaneous Equations of First Order). Here the function:  function [y] = rk4_c(f, g, h, x, y, z, n) % Runge-Kutta % Implementation of the fourth-order method for coupled equations % h = dt % x is the time here  for ii=1:(n-1)     k1 = h * f(x(ii), y(ii), z(ii));     l1 = h * g(x(ii), y(ii), z(ii));     k2 = h * f(x(ii) + 0.5*h, y(ii) + 0.5*k1, z(ii) + 0.5*l1);     l2 = h * g(x(ii) + 0.5*h, y(ii) + 0.5*k1, z(ii) + 0.5*l1);     k3 = h * f(x(ii) + 0.5*h, y(ii) + 0.5*k2, z(ii) + 0.5*l2);     l3 = h * g(x(ii) + 0.5*h, y(ii) + 0.5*k2, z(ii) + 0.5*l2);     k4 = h * f(x(ii) + h, y(ii) + k3, z(ii) + l3);     l4 = h * g(x(ii) + h, y(ii) + k3, z(ii) + l3);     y(ii+1) = y(ii) + (1/6)*(k1 + 2*k2 + 2*k3 + k4);     z(ii+1) = z(ii) + (1/6)*(l1 + 2*l2 + 2*l3 + l4); end   I would like to use this function for solving motion equations for a ball with air resistance. So starting with the basic equations (I hope they are correct): $$md^2x/dt^2 = F_{D_x}$$ and $$md^2y/dt^2 = F_{D_y}-mg$$ with $$F_{D_x} = -Dvvcos(\theta)$$ and $$F_{D_y} = -Dvvsin(\theta)$$ where $D$ is a drag coefficient. From my understanding, and from what I read, both second-order equation can be converted to two coupled equations that could be used with my coupled Runge-Kutta method function. Can someone help me understand how to convert my equation to a set of coupled equations that could be used with my MATLAB function?  EDIT  I was able to use my rk4_c function, however it only works for solving the velocities. I'm now trying to see how I could solve for the positions x and y. I'm kind of learning about Runge-Kutta methods at the same time, so sorry for the questions that may sound trivials.  % Runge Kutta code to solve projectile motion with quadratic drag % dVx/dt = -(D/m)*vx*sqrt(vx^2+vy^2) % dVy/dt = -(D/m)*vy*sqrt(vx^2+vy^2) - g  clc clear all  % Constant D = 0.24; % m = 2; % kg g = 9.80665; % m/s^2  % Define function handles fVx = @(t,vx,vy) -(D/m)*vx*sqrt(vx^2+vy^2); fVy = @(t,vx,vy) -(D/m)*vy*sqrt(vx^2+vy^2) - g;  % Initial conditions v0 = 200; % m/s theta = 30*pi/180; % rad t(1) = 0; vx(1) = v0*cos(theta); vy(1) = v0*sin(theta);  % Step size h = 0.01; % s tFinal = 2; N = ceil(tFinal/h);  % RK4 simultaneous coupled loop for ii = 1:N     % Update time     t(ii+1) = t(ii) + h;      % Update vx and vy     k1 = h * fVx(t(ii), vx(ii), vy(ii));     l1 = h * fVy(t(ii), vx(ii), vy(ii));     k2 = h * fVx(t(ii) + 0.5*h, vx(ii) + 0.5*k1, vy(ii) + 0.5*l1);     l2 = h * fVy(t(ii) + 0.5*h, vx(ii) + 0.5*k1, vy(ii) + 0.5*l1);     k3 = h * fVx(t(ii) + 0.5*h, vx(ii) + 0.5*k2, vy(ii) + 0.5*l2);     l3 = h * fVy(t(ii) + 0.5*h, vx(ii) + 0.5*k2, vy(ii) + 0.5*l2);     k4 = h * fVx(t(ii) + h, vx(ii) + k3, vy(ii) + l3);     l4 = h * fVy(t(ii) + h, vx(ii) + k3, vy(ii) + l3);     vx(ii+1) = vx(ii) + (1/6)*(k1 + 2*k2 + 2*k3 + k4);     vy(ii+1) = vy(ii) + (1/6)*(l1 + 2*l2 + 2*l3 + l4); end  % Plot the solution figure(1) plot(t, vx, t,vy) xlabel('Time (s)') ylabel('Velocities (m/s)') legend('Vx', 'Vy')


I generated a dot file using Python.   Each time the file is generated, I need to run a script in the Terminal to convert it to a pdf file or an image.  This is the script:  dot -Tpdf somefile.dot -o somefile.pdf   I was wondering if it is possible to execute this script in the current folder, from within my Python code.


Is there a list of required attributes for Single Sign On. I have a client who is utilizing Shibboleth as the IDP and needs a specific list of attributes expected by Marketing Cloud. I haven't found it documented online.


I am failing to understand following problem with my bibliography....citation in text works fine, citations in bibiography work fine too, except one problem: I want it like "Planen und Problemlösen: Überlegungen zur ...." but it results in "Planen und Problemlösen: überlegungen zur ....". I have no idea how to force LaTeX giving me a big Ü instead of a tiny ü.  MWE:  \documentclass[12pt,ngerman]{article} \usepackage[utf8]{inputenc} \usepackage[ngerman]{babel} \usepackage[backend=biber,style=apa]{biblatex} \usepackage[german=quotes]{csquotes}%mod. \usepackage[locale=US]{siunitx} \DeclareLanguageMapping{ngerman}{ngerman-apa} \addbibresource{Literatur.bib}  \begin{document} Hello, this is my cite: \cite{Funke.1990} \printbibliography \end{document}   In my Literatur.bib:  @Article{Funke.1990, Title  = {{P}lanen und {P}robleml{\"o}sen: {\"{U}}berlegungen zur  neuropsychologischen {D}iagnostik von {B}asiskompetenzen beim {P}lanen}, Author = {Funke, Joachim and Glodowski, Anne-Simone}, Journal= {Zeitschrift f{\"u}r Neuropsychologie}, Year  = {1990}, Pages = {139--148}, Volume = {2} }


I am working on a simple bash script that configures new servers how I want them. It's nothing special but it will hopefully save me quite a lot of time in the future.  How do I prevent prompts like this:    You are about to add the following PPA to your system:     Stable version of nginx.     More info: https://launchpad.net/~nginx/+archive/stable   Press [ENTER] to continue or ctrl-c to cancel adding it   When running commands like this from a script:    sudo add-apt-repository ppa:nginx/stable    sudo apt-get update   sudo apt-get -y install nginx   Is there an auto accept flag that I can set or something like that?


Even if you don't talk to Hestu near Kakariko or the Stable afterwards, when you go to the lost woods will he be there? Or do you have to talk to him at both places before he shows up in the lost woods?


Evaluating $\int_0^\infty \frac{\log (1+x)}{1+x^2}dx$

Can this integral be solved with contour integral or by some application of residue theorem? $$\int_0^\infty \frac{\log (1+x)}{1+x^2}dx = \frac{\pi}{4}\log 2 + \text{Catalan constant}$$  It has two poles at $\pm i$ and  branch point of $-1$ while the integral is to be evaluated from $0\to \infty$. How to get $\text{Catalan Constant}$? Please give some hints.


I need to find the sum of all the prime numbers under 2,000,000. This code takes way too long

##Problem 10 primes=[] sumofprimes=0 for number in range(1,2000000): ##This goes through all the potential primes.     p=0     for tester in range(2,number):         if ((number%tester)==0):             break         else: ##every time the number is not divisible by something it adds 1 to p and when everything up to the number is not divisible by anything then it is a prime.             p=p+1         if(p==(number-2)):   the "number minus 2" is because lets say you have the prime "3" it will only test "2" so p will equal 1 or (3-2).              sumofprimes=sumofprimes+number print(sumofprimes)


I'm trying to write some provisioning shell scripts for Vagrant dev environment. I'm used to start bash scripts as follows   #! /bin/bash   But after surfing through some git repos I found out that in most cases guys use   #! /usr/bin/env bash    So the question is: what the difference and what is the most decent way to start a bash script? (any alternatives are also appreciated)


I got a small issue with line wrapping on a custom linux and I'm not sure where this is set.  When on serial console or using SSH login i get the following:  Cursor at start of line  [user@myhost ~]$ dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd>   Cursor at end of line  <ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd   So instead of breaking into multiple lines it continues into described by the angle brackets.  Can anybody point me into the direction where I can change this behaviour? Tried messing with inputrc for readline and something like "set horizontal-scroll-mode" but I'm not sure that this is the right place


Let $E=F[\alpha]$, $\alpha$ is algebraic over $F$ and $[E:F]$ is odd. Prove that $E=F[\alpha^2]$. Now clearly $[F[\alpha^2]:F]|[E:F]$ so $[F[\alpha^2]:F]$ is also odd. But how can we show that $E=F[\alpha^2]$?


How can embed separable Banach to Cb(X)(family of all bounded continuous functions on topological space X) with non metrizable X ? If X is locally compact or Tychonof  is very well.  note : We know that there exists an isometrically isomorphic between any Banach H and H^ (H^ is second dual of H or H^=H**) and know by Kuratofski theorem we can make an isometrically isomorphic between H and Cb(H).  But we want a topological space X that is not metrizable because i want Cech-stone extension an Cech-stone compactification is not metrizable in general?