Elementary proof for $\sqrt[3]{xyz} \leq \dfrac{x+y+z}{3}$

I am searching for an elementary proof of the AM-GM inequality in three variables:  $\sqrt[3]{xyz} \leq \dfrac{x+y+z}{3}$  The inequality of the geometric mean vs the arithmetic mean of two variables can be proven elementarily via   $x - 2 \sqrt{xy} + y \geq 0$  whenever $x,y > 0$. I am searching for a proof that uses a similar technique based on elementary arithmetic.


What did Dumbledore do with his old wand?

In the biography of Dumbledore (by Rita Skeeter) it is said that Dumbledore finally decided to confront his one time friend Gellert Grindelwald, who at the time was powerful and was in possession of the Elder Wand.   After Dumbledore defeated him in their famous duel, Dumbledore claimed his wand, the mythical Elder Wand and stopped using his old wand.  So what did he do with his old wand?


How to set a website as Wallpaper in Gnome

I've been searching for about an hour right now. I can't seem to figure a way to set a website as the desktop background.  Any ideas?


Is it the same standardized coefficients and semi-partial coefficients?

My question is very simple, What the different between the standardized coefficients (this coefficient has been obtain in multiple regression, and take a scale (-1,1). And the semi PARTIAL coefficient could be obtain in the model regression,but with this number you can take a variable contribution in percent (%). But in both cases this coefficients explain the variable's contribution. Both also control for the effect of one or more another variables. Thus, you could compare model results.


How to fix the association bonus so it's easier to reach for people who use many SE sites?

This is my account earlier today:    I was getting extremely sick of getting "You cannot comment because you haven't earned 50 rep" messages which I saw many many times before getting the association bonus, and would generally cause me to close the SE site I was on immediately.  The association bonus feels like it kicked in way too late for me. As you can see I had at least 600 rep across sites, but none over 200. It was a fairly awful user experience, especially not having "Comment Everywhere" everywhere.  I waited until I actually got it before commenting here so I wouldn't be dismissed as trying to be bend the rules or whatever.  Perhaps the bonus could be given in two stages. Or it could weight rep from all the sites you're associated with. Other suggestions?


How do I prove that 1010101...0101 is not a prime number?

I want to know how I can prove that a number with 4033 digits (10101....0101 with 2016 zeros) is not prime.  Greetings Tom


Best package for developing a List of Abbreviations

I'm in the process of writing a long document and need a List of abbreviations. I've been reading the LaTeX wiki book about this and have had a play with the packages  and . What package is the most straight forward for developing a List of abbreviations? Is there a package I've missed?


Exploding multipart features in qgis using python

I want to explode a multipart layer to singlepart in python. I see through the qgis gui there is a way to do it under vector--geometry--tools--Multipart to Singleparts.. which does what I need, I just need the python code for this. I'm new to qgis.


If f be a bijective continuous function on any interval of real numbers, then is f always homeomorphism? I am asking here for any interval of reals.


Display content from a specific category

I'm trying to get my news page to display content from one category only (number 3) but I cant seem to get it to work. Instead of just displaying posts from category 3 it displays posts from all category's.  Here is my code:  <?php get_header(); ?>

Latest News
                              <?php $args = array(                             'post_type' => 'post' ,                             'orderby' => 'date' ,                             'order' => 'DESC' ,                             'posts_per_page' => 6,                             'category'         => '3',                             'paged' => get_query_var('paged'),                             'post_parent' => $parent                        ); ?>                        <?php query_posts($args); ?>                            <?php if ( have_posts() ) : ?>                             <?php while ( have_posts() ) : the_post(); ?>

                                     <a href="<?php the_permalink() ?>"><?php the_post_thumbnail(); ?>                                      <a href="<?php the_permalink() ?>">
<?php the_title(); ?>
                                     <?php the_excerpt(); ?>
<a href="<?php the_permalink() ?>" class="readmore_news">Read more

                              <?php endwhile; ?>                         <?php endif; ?>

  <?php get_footer(); ?>


How to import OBJ files into Blender with script?

I'm working up to building a small script which will allow me to import and render 2D views of several OBJ models, but I'm struggling at the moment with the very basic first step, which is importing a model from a folder on my computer. I attempted to follow the code in the script in , but even if I directly copy-paste the code and just change the directory path to where my model is located, when I press Run Script, nothing happens. I don't see any errors, I don't see anything happen, just nothing. I'm fairly new to both Blender and Blender scripting, so I'm not very sure what's going on and any help would be appreciated! This is my code at the moment (copied and pasted from the link above, but modified to have a Linux file path): import bpy import os import glob  # Model directory model_dir = '/home/yuerno/Downloads/test'  # Specify OBJ files model_files = glob.glob(model_dir + "*.obj")  for f in model_files:     head, tail = os.path.split(f)     collection_name = tail.replace('.obj', '')     bpy.ops.import_scene.obj(filepath=f)     myCol = bpy.data.collections.new(collection_name)     bpy.context.scene.collection.children.link(myCol)     for ob in bpy.context.selected_objects:         myCol.objects.link(ob)


$M^{2\times 2}(\mathbb{Z})$ has identity $e_1$, but a certain subring $R$ has another identity $e_2$ and $e_1 \notin R$.

I'm a bit confused. Consider the following situation:  We know $M^{2\times 2}(\mathbb{Z})$ has an identity for $\cdot$ which is $$e_1 =\begin{pmatrix}  1 & 0 \\ 0 & 1 \\ \end{pmatrix}.$$ Now consider the subring $$A = \left\{\begin{pmatrix}  x & 0 \\ 0 & 0 \\ \end{pmatrix}\mid x \in \mathbb{Z}\right\},$$ which has identity element:$$e_2 =\begin{pmatrix}  1 & 0 \\ 0 & 0 \\ \end{pmatrix}.$$  In my book on algebra, it says that if $1\in R$ and $S\subset R$ is a subring of $R$, then $1\in S$ needs to be met. But in this example, this is not the case. Can someone help with my confusion?


S is a finite set show that $|P(S)|$ is $2^{|S|}$.

If $S$ is a finite set, show that $|P(S)| = 2^{|S|}$.  So I know that $|P(S)|$ means the number of elements in the power set of $S$, but I don't understand the relation between the power set and $2^{|S|}$.  I tried doing:  Suppose $|S|=n$, then $|P(S)|$ = the union of each subset of $S$. Then $|P(S)|$ is the set $\{x_1, x_2, x_3, .... x_n\}$. But I'm not even sure if I'm thinking about this right.  Any help would be awesome!


How could very few people know the actual identity of Voldemort as Tom Riddle?

Dumbledore says:     Very few people know that Lord Voldemort was once called Tom Riddle.   I taught him myself, fifty years ago, at Hogwarts. He disappeared   after leaving the school … travelled far and wide … sank so deeply   into the Dark Arts, consorted with the very worst of our kind,   underwent so many dangerous, magical transformations, that when he   resurfaced as Lord Voldemort, he was barely recognisable. Hardly   anyone connected Lord Voldemort with the clever, handsome boy who was   once Head Boy here.   Also we know that everyone knows that Voldemort was in Slytherin. At least when Ron mentions this      “Gryffindor,” said Ron. Gloom seemed to be settling on him again. “Mum   and Dad were in it, too. I don’t know what they’ll say if I’m not. I   don’t suppose Ravenclaw would be too bad, but imagine if they put me   in Slytherin.”      “That’s the House Vol-, I mean, You-Know-Who was in?”      “Yeah,” said Ron. He flopped back into his seat, looking depressed.   Then how do very few people know the real identity of the Voldemort as Tom Riddle, surely people would have searched and found out this once he disappeared. Actually everyone should know this considering Voldemort is really famous among wizards.


python how come function sees external variables?

def test1():    print(x)  def test2(x):    print(x)  x=1 test1() test2(x)  When I run this python code, I get:  1 1  How can function test1 know about x, without passing it as an argument?


$\mathbb{R}^n\setminus\{x_1,\dots,x_k\} \simeq \bigvee_{j=1}^k S^{n-1}$?

Is it true that by removing $k$ points from a Euclidean space $\mathbb{R}^n$, we get a space homotopy equivalent to the wedge of $k$ $(n-1)$-spheres? More explicitly, $$\mathbb{R}^n\setminus\{x_1,\dots,x_k\} \simeq \bigvee_{j=1}^k S^{n-1}.$$ I know that the case $k=1$ is true, and its fairly simple to prove by showing that $\mathbb{R}^n\setminus \{0\}$ deformation retracts to $S^{n-1}$ via the homotopy $F\colon\mathbb R^n\setminus \{0\}\times I \rightarrow\mathbb R^n\setminus \{0\}$, given by $$F(x,t) = \frac{x}{1+t(\|x\|-1)},$$ thus showing that $$\mathbb{R}^n\setminus\{x_1\}\simeq S^{n-1}.$$ My question is whether there is a nice proof for the general case. I thought of using induction, but was unsuccessful, any ideas? Edit: Another idea I had, I don't know if it is really useful or not, is that we could show that $\mathbb{R}^n\setminus \{0\}\vee \mathbb{R}^n\setminus \{0\} \simeq \mathbb{R}^n\setminus \{x_1,x_2\} $, and this would obviously generalize to $k=3,4,\dots$


i have a problem to figure out, how to toggle buttons in aura/lightning component. I have two buttons with functions showMore and showLess.  The thing is, i want to only see button show more, and when i click on it, i want to show more button disappear and show less appear. And same with when i click on show less, switch show more on and less off              <lightning:buttonIcon iconName="utility:macros"  alternativeText="Show more columns" onclick="{!c.showMore}" aura:id="show_more"/>                   <lightning:buttonIcon iconName="utility:macros"  alternativeText="Show less columns" onclick="{!c.showLess}" aura:id="show_less"/>


I have a 6-layer board where the internal 4 planes are +15,GND,VCC,-15.  I was wondering if there was any advantage to doing a copper pour on the top and bottom layers?  I would probably leave them floating as I don't want to use micro-vias to say tie it to GND?    Is this actually a bad idea?  I.e. floating copper=antenna.  Would it be just as acceptable to have 4 layer board with the top layer having copper pour to VCC and the bottom having a pour to GND and keep the two internals as +-15?  Note that this is for a fairly low speed circuit which has some analog and digital parts.


Call of member function of objects in arrays

Given the following classes:  class animal { public:     virtual void noise() { }; };  class cat: public animal{ public:     void noise() {         cout << "mew" << endl;     } };   Why does this work (prints the correct noise):  animal *animals[2]; animals[0] = new dog; animals[0]->noise();   But this doesn't:  animal animals[2]; dog dog1; animals[0] = dog1; animals[0].noise();   Is there a way to make it work without using pointers?  The software wants me to add more text but I think I have already made my question very clear so this is just random text...


I'm trying to model a skirt like , so I have a Bezier Circle to describe the curve of the waist, an a mesh for each pleat. As you can see , it looks fine, except the mesh is not being replicated around the curve completely. If I change the Constant Offset, I can only make the gap so small before one of the meshes disappears.  Is there a way I can fill that hole in the skirt by making the mesh go all the way around?


If I charge my mobile from different charger what happens?

My charger is lost so I am using a charger with an output of 5.5v and 0.6A. My real charger  gives an output of 5V and 0.7A. Will the other charger damage my phone?


I have seen these on my floor several times now that spring has arrived and temps have started to go up. It is silvery in color, appears to have a hard and segmented shell, it kind of reminds me of a lobster. They are very small, the dark line in the picture is the grout between two tiles on my floor for scale. I am guessing it is about three quarters of a centimeter in length. I am in Utah.


Bash script: array elements containing space character

I'm getting started with bash scripting. I'm working with array elements that contain space characters. In the code below, the third array element is "Accessory Engine". I tried to set the space character using the \ symbol, but this doesn't help.  In the larger routine (not included here), I use the array elements to automatize some stuff with command line tools. Those command line tools would accept "Accessory Engine" as an input.  #!/bin/bash components="Persistence Instrument Accessory\Engine" for i in $components; do   echo ${i} done   Now the output from this code is:    Persistence   Instrument   Accessory\Engine   But I want it to be:    Persistence   Instrument   Accessory Engine   How can I achieve that?


Let $A:=\{(0,y):y\in[-1,1]\}$ and $B:=\{(x, sin({1\over x}):x \in (0,1]\}$, finally, let $C:=A\cup B$   Show C is a connected space Show C is not path-connected   1 has me stumped,  I have only ever proven that a space is not connected.   2 Is duplicate, look here [


How many exception related to pronunciation of 'g'?

The main rule is saying that words with digraphs 'gy' 'gi' 'ge' should be pronounced as soft 'g', but there are a few exceptions I've met:  linger, get, begin, bigger, longer, dagger, gear, unplugged


Mathematical formula for switching the key for OTP?

Instead of generating the random key for the one time pad cipher over and over again, is there a mathematical formula that allows you to switch the key to a new key? The new key must be as random and secure as the original key.


I am confused.  Some sources say it is possible at least theoretically (  ) and some say it is not true (  )  Is it necessary or not that there exists an amount of water around the ship that weights at least the same as the weight of the ship?


Evidence for quantum gravity from gravitational waves

The rumor spreads that .  I am far from being an experimentalist, but I want to know if there is any chance that the mentioned observations will reveal any experimental evidence for quantum gravity.  Personally, I feel like this is merely impossible as gravitational waves should propagate in agreement with classical General Relativity. But I might very well not see pitfalls if there are any.  UPDATE: by "evidence for quantum gravity" I mean experimental results which don't agree with predictions of General Relativity or its classical generalizations. They might be coming from string theory or loop gravity or from a completely different approach which we haven't discovered yet. I want to understand what are the chances that new physics will show up during the upcoming  gravitational wave observations.  Also, I expect gravitational waves to be in a highly coherent state, thus making the individual gravitons unobservable. Is this true?


Let a, b, d be non-zero integers. If d|a and d|b, prove d|gcd(a,b)

So I think I have a solution to this problem but I'm not certain if it works or not.     Problem Statement:    Let a, b, d be non-zero integers. If d|a and d|b, show that d|gcd(a,b).     Attempted Proof   Let $\gcd(a,b) = k$ for some $k$ in integers.  By Bezout's Identity, we can write this as $ax + by = k$ for some $x, y$ in integers.  We know $d|a$ and $d|b$; this implies that $d|ax$ and $d|by$  Since this means d divides all terms on the left side, it divides the entire left side:$ d|ax + by$  This implies $d|k$ which implies $d|\gcd(a,b)$.  Could someone please verify if my solution is valid or not?


Nonpiecewise Function Defined at a Point but Not Continuous There

I make a big fuss that my calculus students provide a "continuity argument" to evaluate limits such as $\lim_{x \rightarrow 0} 2x + 1$, by which I mean they should tell me that $2x+1$ is a polynomial, polynomials are continuous on $(-\infty, \infty)$, and therefore $\lim_{x \rightarrow 0} 2x + 1 = 2 \cdot 0 + 1 = 1$.  All the examples they encounter where it is not correct to simply evaluate at $a$ when $x \rightarrow a$ fall into one of two categories:   The function is not defined at $a$. The function is piecewise and expressly constructed to have a discontinuity at $a$.      I'd like to find a function $f$ with the following properties:         $f(a)$ exists   $f(a)$ is not (obviously) piecewise defined   $f(x)$ is not continuous at $a$   $f$ is reasonably familiar to a Calculus I student - trigonometry would be admissible, but power series would not (though they might   still make for interesting reading)


Who has been dead (and gotten better) the longest?

In super hero comics it's not unknown for a someone to die, then a few issues later get better.   But who holds the record for being dead for the longest time (real world time) and coming back?


Is it safe to assume that python module is calculated once? If module A contains CONST_A = json.load(...) and is imported multiple times in different files of the same program and different threads, will it be calculated/executed just once? If not, when the CONST_A be recalculated? And would the next structure fix it?  module CALCULATE_CONST_A     import json     CONST_A = json.load(open(...))  module A     from CALCULATE_CONST_A import CONST_A  further imports of A...    Final question: What are the best practices for creating precalculated constants?


I have a project with a structure as follows.  . ├ main.cpp ├── include │   └── stack.h └── src     └── stack.cpp   Main.cpp:  #include <iostream> #include "include/stack.h"  using namespace std; int main() {      Stack<int> intStack = Stack<int>();  // stack of ints     Stack<string> stringStack = Stack<string>();    // stack of strings      ... }   stack.h  #include ...  template <class T> class Stack { ... };    stack.cpp  #include "../include/stack.h"  template <class T> void Stack<T>::push (T const& elem) { ... }   My cmake file is as follows  cmake_minimum_required(VERSION 2.8.4) project(libbunch)  include_directories(${CMAKE_CURRENT_SOURCE_DIR}) include_directories(${CMAKE_CURRENT_SOURCE_DIR}/include)  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11") set(LIBRARY_NAME bunch)  file(     GLOB_RECURSE     SRC_FILES     src/* )  add_library(     ${LIBRARY_NAME}     SHARED     ${SRC_FILES})  set(SOURCE_FILES main.cpp) set(EXECUTABLE_NAME libbunch) add_executable(${EXECUTABLE_NAME} ${SOURCE_FILES})  target_link_libraries (     ${EXECUTABLE_NAME}     ${LIBRARY_NAME} )   It is more of a generic cmake rather than using the names exactly. The problem with this cmake file is that when i run it,  the following error occurs.  [ 50%] Built target bunch Linking CXX executable libbunch CMakeFiles/libbunch.dir/main.cpp.o: In function `main': main.cpp:13: undefined reference to `Stack<int>::push(int const&)' main.cpp:14: undefined reference to `Stack<int>::top() const' main.cpp:17: undefined reference to `Stack<std::string>::push(std::string const&)' main.cpp:18: undefined reference to `Stack<std::string>::top() const' main.cpp:19: undefined reference to `Stack<std::string>::pop()' main.cpp:20: undefined reference to `Stack<std::string>::pop()' collect2: error: ld returned 1 exit status make[3]: *** [libbunch] Error 1 make[2]: *** [CMakeFiles/libbunch.dir/all] Error 2 make[1]: *** [CMakeFiles/libbunch.dir/rule] Error 2 make: *** [libbunch] Error 2   This clearly means that there is an error in linking but I am actually linking the file in cmakeLists file using target_link_libraries.  Update  Trying to follow this , I modified the files by adding #include "../src/stack.cpp"in the end of .h file and then removed the #include in the src file. This resulted in more errors namely   stack.cpp:2:11: error: expected initializer before ‘<’ token  void Stack<T>::push (T const& elem)            ^ ....


Generate exponential random values in a given range

Need to generate random values that follow an exponential distribution on an interval [a, b]. I tried using explained here , but did not succeed


Yuri hates Kanata for some reason because she calls him a traitor in the first episode.  Why is that and why does she hate him so much?


Can an Indian passport holder travel to Mexico as a tourist for 8 days on a valid US (C1D) visa?

I hold an Indian passport, I am a seaman working for a passenger cruise line.  I am planning to visit Mexico as a tourist on a valid US (C-1/D) visa For 8 days. I have return tickets confirmed, travel insurance, bank statement, salary slip and hotel booking.  Can I travel visa free to Mexico?


Reflecting points on a square to make it larger

You are given four points (on a Euclidian plane) that make up the corners of a square. You may change the positions of the points by a sequence of moves. Each move changes the position of one point, say p, to a new location, say p', by "skipping over" one of the other 3 points. More precisely, p skips over a point q if it is moved to the diametrically opposed side of q. In other words, a move from p to p' is allowed if there exists a point q such that $q = (p + p') / 2$.  Find a sequence of moves that results in a larger square. Or, if no such sequence is possible, give a proof of why it isn't possible. (The new square need not be oriented the same way as the original square. For example, the larger square may be turned 45 degrees from the original, and the larger square may have the points in a different order from in the original square.)  I've tried many different combinations and still haven't gotten anything more than 3 points in the right position and one point completely off. Is this possible?


Why does upsert cause a DUPLICATE_VALUE error?

I have a custom object, with a Text Name (ID) field. When I upsert two records with identical Name/ID, but otherwise different values, in two separate upsert statement, one record results, as expected.  When I create a list, add these records to the list, and then upsert the list, I get a DUPLICATE_VALUE error. What gives? By definition, upsert should not do this, should it? Even worse: it doesn't matter whether a record with the identical Name already exists or not, the upsert will fail in both scenarios.  By the way: by default upsert a does not use the Name/ID field as identifying/unique field, as you might expect. You need to do upsert a Name  Complete code:  List<Flight__c> flights = new List<Flight__c>(); Flight__c f1 = new Flight__c(); f1.Name = 'ABC123'; f1.Flight_Number__c = 'ABC'; flights.add(f1);  Flight__c f2 = new Flight__c(); f2.Name = 'ABC123'; f2.Flight_Number__c = '123'; flights.add(f2);  upsert flights Name;      Error message: Line: 12, Column: 1 System.DmlException: Upsert failed.   First exception on row 0; first error: DUPLICATE_VALUE, Duplicate   external id specified: ABC123: [Name]   Name being the standard identifying field of a custom object. You cannot edit the properties of this field, e.g. making it unique or not unique.


How to find all files created in directory after a particular file was created?

I have a file ANIL.sh created years back. I want to find files created after ANIL.sh.  I know how to find particular file using the find command. But I am not sure how to get files created after ANIL.sh.  Any suggestions?


How do I replace (NOT dual-boot) Windows XP with Lubuntu?

I'm not a technie; I don't know anything about coding. I'm a somewhat basic computer user. However, now that Microsoft has phased out support for Windows XP, I HAVE to change OSs. However, I don't have the money for buying a new computer, so I read some articles, and I learned about Lubuntu: a supposedly lightweight XP-esque OS.  But here's the thing: I don't know how to install Lubuntu. I also don't want to dual-boot, so I have to replace XP with the new OS. And although I have a 4 GiB flashdrive, I don't have a burnable or writable CD.   So, how do I do this...? I'm not experienced in this field... I wish there was an installer wizard or whatever that could do all that for me: eliminate XP from my computer, then install Lubuntu onto it.  Please help me? Any help at ALL would be GREATLY appreciated...  Thank you.  Computer Specs: Microsoft Windows XP Professional Ver. 2002, SP3 (32-bit)  Btw, I checked my Hard Drive space and RAM space: I do have the min. requirements covered.


Do verb tenses have to remain absolutely consistent through a piece of writing?

Generally, I've been told that I should maintain consistency of tenses in my writing. That is, if I begin a piece of writing in the past tense, I should ensure that all verbs agree with that through the document. But as I read more articles, books, and other such things, I get confused by the verb tenses used by these other authors.  For example, I copied a portion of an article below. I believe it started in the past tense, yet the second paragraph switched to the present tense (it sounds like the...) In the third paragraph, the past and present usage is mixed (the word gave is in past tense, yet remain is in the present tense). I understand that the writing in the article is most likely correct. But why can it switch verb tenses and be ok while I was told in school by my professor to keep my essays in a single tense? Is there a guideline I can adhere to?      REPRESSED for decades, the anger burst like a summer storm. Rioting   youths flooded city streets. The shaken regime granted hasty   concessions: freer speech; an end to one-party rule; real elections.   But when Islamists surged towards victory in the first free elections   the army stepped in, provoking a bloody struggle that lasted until the   people, exhausted, acquiesced to a government similar in outlook,   repression and even personnel to that which they had revolted against   in the first place.      It sounds like the recent history of several Arab countries: Bahrain,   Egypt, Libya, Syria, Tunisia and Yemen, the states of the 2011 Arab   spring, have seen some or all of the story unfold. But this is also,   and originally, Algeria, a quarter of a century earlier—the first   major political crisis in the age of modern Islamism.      A flurry of freedom in the late 1980s gave way to a vicious civil war   in the 1990s that left as many as 200,000 dead and Algeria’s Islamists   more or less defeated, but not eradicated. Today the country’s   citizens remain powerless spectators to a continued stand-off between   what they call le pouvoir—the entrenched oligarchy that controls the   state, the oil money and the army—and the now-marginalised Islamist   radicals, who serve more as a justification for ongoing repression   than as any sort of inspiration to ordinary people.


Not able to call "loadmoredata" function when scrolled to the bottom in data table lwc salesforce

I have created a lightning web component in which i am using lightning data table. Now, i am try to implement infinite lazy loading but unable to call my loadmoredata function. here is my code component code:  <lightning-datatable     key-field="Id"     data={searchData}     show-row-number-column     onrowaction={handleRowAction}     onsave ={handleSave}     draft-values={draftValues}     columns={columns}     sorted-by={sortBy}     sorted-direction={sortDirection}     onsort={handleSortdata}     enable-infinite-loading     is-loading={isLoading}     onloadmore={loadMoreData}>  </lightning-datatable>   Here is my js controller code:  loadMoreData(event) {     //Display a spinner to signal that data is being loaded     //this.isLoading = true;     //Display "Loading" when more data is being loaded       this.loadMoreStatus = 'Loading';       const currentRecord = this.searchData       const lastRecId = currentRecord[currentRecord.length - 1].Id;       Console.log('jdfnddk'+this.loadMoreStatus);         workItemList()         .then(result  => {             const currentData = result.sobList;             //Appends new data to the end of the table             const newData = currentRecord.concat(currentData);             this.data = newData;              if (this.data.length >= this.totalNumberOfRows) {                 this.loadMoreStatus = 'No more data to load';             } else {                 this.loadMoreStatus = '';             }         })         .catch(error => {             console.log('-------error-------------'+error);             console.log(error);         }); }


Formula for calculating rectangle vertices

I have a programming problem and I've forgotten some of my math rectangle formulas. I have to make a program that creates a rectangle that isn't parallel to the X and Y axis, I assume this means a diagonal rectangle in the first quadrant of a Cartesian graph.  My inputs are the following:    coordinates of the vertex closest to the X axis and the origin angle the long side makes with relation to the X axis. area of the rectangle length of the long side   The outputs expected are the following:   length of the short side,  coordinates of all the rest of the rectangle's vertices.   Given these input how do I calculate the output mentioned?


l format my Huawei G700-T00 and now l cannot install it again

Please how can l reinstall google playstore on my Huawei G700-T00. i have tried to install it three time


Is it possible to cast shadows from a sillouethe made by alpha texture?

It is possible to get/cast a shadow from the image on the 3D plane with alpha?


How can I construct such a Borel subset?

This is a problem from the book "Real analysis for graduate students" : Let $m$ be a Lebesgue measure. Construct a Borel subset $A$ of $\mathbb{R}$ such that $0<m(A\cap I)<m(I)$ for every open interval $I$.  I looked up Folland's book for this problem, and there is a very similar question that ask for not whole $\mathbb{R}$, but $[0,1]$. There is a hint given there and it says like any sub-interval of $[0,1]$ contains a cantor-type set of positive measure. Yes, I understood the idea of constructing a generalized cantor set of positive measure, but I still couldn't see why it works even in $[0,1]$ case. If it works, then I guess I can construct same set for all intervals $[n,n+1]$, and then taking their union, it'll be also Lebesgue measurable and will satisfy the conditions. I'll greatly appreciate any help. Thanks!


public enum CardinalDirection {     NORTH (90),     EAST (0),     SOUTH (270),     WEST (180);      private float angle;      CardinalDirection(float angle) {         this.angle = angle;     }      public float angle() {         return angle;     }      public CardinalDirection opposite() {         switch (this) {         case EAST: return WEST;         case NORTH: return SOUTH;         case SOUTH: return NORTH;         case WEST: return EAST;         default: return null;         }     } }   Hello, I've created this enum quite a while ago. The enum is being used within forked code, meaning, another project has this exact code in it every time when exported.  However recently, after exporting the entire project, the method "angle()" is throwing a NoSuchMethodError: ...angle()F  First of all, what does the F at the end of the method mean? Second of all, how is it possible that code which is 100% up to date with certainty throws this error?  Caused by: java.lang.NoSuchMethodError: org.thearaxgroup.surf.enums.CardinalDirection.angle()F         at org.thearaxgroup.act.object.ActionBoxDisplayManager.newArmorStand(ActionBoxDisplayManager.java:65) ~[?:?]         at org.thearaxgroup.act.object.ActionBoxDisplayManager.getArmorStand(ActionBoxDisplayManager.java:80) ~[?:?]         at org.thearaxgroup.act.object.ActionBoxDisplayManager.reloadArmorStand(ActionBoxDisplayManager.java:30) ~[?:?]         at org.thearaxgroup.act.command.CommandActBox.onCommand(CommandActBox.java:171) ~[?:?]         at org.bukkit.command.PluginCommand.execute(PluginCommand.java:44) ~[spigot-1.9.jar:git-Spigot-bc01c3a-55b0def]         ... 15 more   EDIT: I did find out what caused the issue ... more or less. Another .jar (plugin) also uses the code in the affected project. However, it only depends on it, it doesn't redefine it in any way. I checked for a lot of possible causes and I can't find any reason.  It seems like the jar's sole existence is causing the error.


How can I loop an ocean animation with the ocean modifier? I really need this for a game. I want to do this so I have nice looking water!


bash.bashrc damaged..ubuntu log in loop and no interactive programs working from terminal

I have accidentally deleted the content of /etc/bash.bashrc and now I cannot log in as it gives me a loop and I cannot run any interactive programs from the terminal. When I try, I get this error:  XDG_RUNTIME_DIR not set in the environment when trying to run gedit GTK: cannot open display when trying to run google chrome cannot connect to X server when trying to run rstudio   However, I can run non interactive programs (e.g R and python) from the terminal.  What do I need to add in bash.bashrc to get to see X11 or programs that use DISPLAY?


I Can't understand which is the problem of my code trying to click on a list-group-item of my list-group. I want to catch the click and nothing's happening.  $("#inserisci_cerca").keyup(function() {          var text = $("#inserisci_cerca").val();          $.ajax({url:"https://ewserver.di.unimi.it/mobicomp/geopost/users?session_id="+sessionStorage.getItem("session_id")+"&usernamestart="+testo+"&limit=10",                 type: "GET",                 dataType: "json",                 success: function(result) {                       $("#div1").html("");                     $("#div1").append("
");                     result.usernames.forEach(function(item,index) {                         $("#div1").append("<button type='button' class='list-group-item list-group-item-action' id='okok'>" + item + "</button>");                     })                     $("#div1").append("
");                 }         });     });  $("#okok").click(function() {  console.log("Hello"); })   What am i doing wrong?


How to build a phylogenetic tree without an outgroup?

I have whole genome aligned sequences of four beetle populations of same species. I wish to construct a phylogenetic tree with the four. However, I am unable to find a suitable outgroup of the species, so I cannot use an outgroup to root the tree. Is there a particular method that one can use to construct a tree without an outgroup? I found that the MEGA software does this well. What is the theory and understanding of constructing a tree without an outgroup? what are the implications of constructing a tree without an outgroup? Ar the distances between trees measured relative to one another?


If $f \colon [a,b] \rightarrow \mathbb{R}$, then show that there exists $c \in [a,b]$ such that $\int_a^c f = \int_c^b f$

If $f \colon [a,b]\rightarrow \mathbb{R}$, then show that there exists $c \in [a,b]$ such that $c \in [a,b]$ such that $\int_a^c f = \int_c^b f$.  I think that I have to proceed with the Mean Value Theorem of Integrals...


Is all the software from ubuntu software center working on ubuntu 14.04 64bit?

I want to install the 64bit version of ubuntu 14.04 on my new laptop which you can find  if you want to check its stats.  My question is:  Are there programs in software center which do not work on the 64bit version?  (I know this question is a duplicate but the similar questions I found are about 2 or 3 years old)


I work on a HP laptop plugged in most of the time, and after a few months the battery went off-duty.  Of course, I could remove the battery each time the laptop is plugged and replace it each time I must move to where no sockets are around. But I think that:   It would be really BORING! The computer would not avail itself of the useful backup power supply a battery can provide in case of black out.   It should simply switch off the battery charging when a safe power level is reached (i.e. 95%) and start recharging it, not every five minutes, but only under a certain safe threshold (i.e. 40% - 50%).  In its energy-saving profiles, Windows 7 only allows for setting up screen brightness, screen fadeout, screen deactivation and the suspension, not managing any charging issue.  Is there a way to accomplish this?


"Doubt and hopelessness fills my heart" or "fill my heart"

Which is grammatically correct? "Doubt and hopelessness fills my heart" Or "doubt and hopelessness fill my heart"?


Is connection pool shared across application

In ADO.net application we have a website and windows service which are hitting same database. Since the connection string is common between them so are they sharing same connection pool.


Calculate discount price dynamically using jquery

I am having a form which can calculate the discounted price of what we addded in MRP input field. The number of rows can be increased by pressing a button.  Where the button appends the following code in the table  $("#add-book").click(function(){     $(".books").append('
<select name="subject"><option disabled="" selected="">Subject</option><option>Microprocessors Microcontrollers</option><option>Compiler Design</option><option>Operating Systems</option><option>Artificail Intelligence</option><option>Web Engineering</option></select>	<input name="title" type="text" placeholder="Title of book..." maxlength="64"></input>	<input name="author" type="text" placeholder="Author..." maxlength="64"></input>	<input name="mrp" type="number" placeholder="MRP" maxlength="4"></input>	<input name="individual-noteshub-value" type="text" disabled=""  value="0"></input>
'); }   It gives the result for the first row but upon adding rows, It can not calculate the discounted price for proceeding rows.  The Js code for calculating, i am using is :  $(function(){ $('input[name="mrp"]').closest('td').find('input[name="mrp"]').on('input',function(){             $(this).closest('td').next().find('input[name="individual-noteshub-value"]').val($(this).val()/2); });  $('input[name="pages"]').on('input',function(){          $(this).closest('td').next().find('input[name="individual-noteshub-value"]').val($(this).val()/4); });   });


How to hide redundant top bars in Ubuntu 17.10

Unity was excellent at managing vertical space on the screen by rolling the top bars (the app title bar, its menu bar, and the system's status bar) into one, especially when the application's window was maximised. Gnome 3, at least by default as shipped with Ubuntu 17.10, doesn't quite measure up.   In some instances, like with gnome-terminal, there are three bars, two of which are completely unnecessary and feature the same information over and over. I marked redundant user@host with red boxes.    How can I recreate the space frugality Unity would display here?


Does getPicklistValues() always return PicklistEntry records in proper order?

If I run , e.g., Contact.Salutation.getDescribe().getPicklistValues(), it usually returns the PicklistEntry records for Salutation in the order that I have established in the metadata.  The order is undocumented.  Is this reliable?


The objective function of interest is: $$ \phi = \text{log}|PWP^T| + \text{tr}((PWP^T)^{-1}PVP^T) $$ where $P = J + XU^T$ and $V$, $J$ and $U^T$ are known matrices. I assume that the $V$ and $W$ are positive definite.  The first partial derivative of $\phi$ with respect to $X$ is \begin{align*} Y^{-1}(JWU + JVU) + Y^{-1}X(U^TWU + U^TVU) - Y^{-1}ZY^{-1}(JWU + XU^TWU)  \end{align*}  where $Y = PWP^{T}$ and $Z = PVP^T$.  The first partial derivative with respect to $W$ gives $$ PWP^T = PVP^T. $$  Hence combining the solutions of partial derivatives $X = -JVU(U^TVU)^{-1}$.  If I compute $\nabla_{xx}\phi$ and evaluate at the solution what I would get is $$ [(U^TWUX^T + U^TWJ^T)Y^{-1} \otimes Y^{-1}](I + K)[(U^TWUX^T + U^TWJ^T)^T \otimes I] + (U^TVU \otimes Y^{-1}) $$  where $K$ is the commutation matrix. However, I can't see that it is symmetric. If this is not symmetric, Hessian would not be symmetric. Is it always the case that the Hessian needs to be symmetric?


I just set up my server today with one of my new static IP addresses to act as a mail and web server. The web server is working fine, and the mail server is working fine to receive mail, but I am unable to send any mail except to my own domain. I've looked in the SMTP log and it is filled with entries like this:  Oct  3 21:36:02 osxserver postfix/smtp[17767]: connect to mx3.hotmail.com[65.55.92.136]: Operation timed out (port 25) Oct  3 21:36:13 osxserver postfix/smtp[17965]: connect to mx1.icloud.com.akadns.net[17.172.34.10]: Operation timed out (port 25) Oct  3 21:36:32 osxserver postfix/smtp[17767]: connect to mx1.hotmail.com[65.55.37.72]: Operation timed out (port 25) Oct  3 21:36:43 osxserver postfix/smtp[17965]: connect to mx3.icloud.com.akadns.net[17.172.34.64]: Operation timed out (port 25) Oct  3 21:37:02 osxserver postfix/smtp[17767]: connect to mx3.hotmail.com[65.55.92.168]: Operation timed out (port 25) Oct  3 21:37:13 osxserver postfix/smtp[17965]: connect to mx3.icloud.com.akadns.net[17.172.34.65]: Operation timed out (port 25) Oct  3 21:37:32 osxserver postfix/smtp[17767]: connect to mx1.hotmail.com[65.54.188.72]: Operation timed out (port 25) Oct  3 21:37:43 osxserver postfix/smtp[17965]: connect to mx4.icloud.com.akadns.net[17.172.34.66]: Operation timed out (port 25) Oct  3 21:38:02 osxserver postfix/smtp[17767]: connect to mx3.hotmail.com[65.55.92.184]: Operation timed out (port 25) Oct  3 21:38:13 osxserver postfix/smtp[17965]: connect to mx6.icloud.com.akadns.net[17.172.34.70]: Operation timed out (port 25) Oct  3 21:38:32 osxserver postfix/smtp[17767]: connect to mx4.hotmail.com[65.55.92.184]: Operation timed out (port 25) Oct  3 21:38:43 osxserver postfix/smtp[17965]: connect to mx2.icloud.com.akadns.net[17.172.34.12]: Operation timed out (port 25) Oct  3 21:39:02 osxserver postfix/smtp[17767]: connect to mx2.hotmail.com[65.54.188.126]: Operation timed out (port 25) Oct  3 21:39:13 osxserver postfix/smtp[17965]: connect to mx2.icloud.com.akadns.net[17.172.34.11]: Operation timed out (port 25) Oct  3 21:39:32 osxserver postfix/smtp[17767]: connect to mx4.hotmail.com[65.54.188.126]: Operation timed out (port 25) Oct  3 21:39:43 osxserver postfix/smtp[17965]: connect to mx1.icloud.com.akadns.net[17.172.34.9]: Operation timed out (port 25) Oct  3 21:40:02 osxserver postfix/smtp[17767]: connect to mx4.hotmail.com[65.55.92.168]: Operation timed out (port 25) Oct  3 21:40:13 osxserver postfix/smtp[17965]: connect to mx5.icloud.com.akadns.net[17.172.34.68]: Operation timed out (port 25) Oct  3 21:40:13 osxserver postfix/smtp[17965]: 449966C1EC: to=<jehamlett@icloud.com>, relay=none, delay=39809, status=deferred (connect to mx5.icloud.com.akadns.net[17.172.34.68]: Operation timed out)   Any recommendations on how I can fix this so that I can send mail? My server is running OS X Server 10.4.11 and my ISP is AT&T u-verse business class.


Difference between "try to do" and "try and do"

What is the difference between try to do and try and do?  To me (non-native speaker), asking someone try and do this seems a bit rude. It's like saying you can try all you want but this must be done: try and fail is not an option. However, asking someone try to do this means I am asking you to try: success is bonus, failure is OK.


How to prove $f(z) = \sum_{n=-\infty}^{\infty}e^{2\pi inz}e^{-\pi n^2}$ has a unique zero inside a unit square in the 1st quadrant.

There are three parts of the question, the first two which I proved.   $a.$ Proving $f(z)$ is entire analytic.  $b.$ $f(z+1) = f(z)$ and $f(z+i) = e^{\pi}e^{-2\pi iz}f(z)$  $c.$ Inside the unit square in the 1st quadrant, prove that $f(z)$ has a unique $z_0$ such that $f(z_0)=0$  I need some help regarding the $c.$ part of the question. I don't understand how to apply the argument principle here (which is a hint). It is also given that $f(z)$ does not vanish on the boundary of the square.  What I could do:  $$f(0) = f(1) = 1+2\sum_{n=1}^{\infty}e^{-\pi n^2}$$  and   $$f(i) = f(1+i) = e^{\pi}\big(1+2\sum_{n=1}^{\infty}e^{-\pi n^2}\big)$$  Using the hint given below by a user: I end up with $$\dfrac{1}{2\pi i}log f(z)$$ and the integral evaluates to -1/2 and 1/2 on the two vertical sides and 0 on the horizontal lines. Resulting in the closed integral to 0. Any ideas where I might be going wrong?  Any idea how to proceed?


What are the consequences of using a low-wattage USB-C power supply with a MacBook Pro?

This question pertains to USB-C not MagSafe. MagSafe negotiates available power with the . USB Power Delivery (PD) is an unrelated protocol. Answers based on experience with MagSafe are unlikely to be relevant.  I'm considering buying a 2016 MacBook Pro Retina about which :     the Griffin product was only powerful enough to offer 60W of power, not quite enough for the 87W needed to power the larger Pro models at fully   I'm also considering buying a  which it advertised as providing:     Mobile / Laptop Charging Up to 60W   What are the consequences of using a 60W supply instead of an 87W one?  Does it just mean it will take longer to charge the laptop?  Could it have side effects such as putting parts of the system into a slower, low-energy mode?   covers MagSafe power supplies but Charles Duffy's comment suggests that the rules for USB-C may be different.


Number of strings of length n consisted of 0,1, 2 such that no two 0s OR 1s are consecutive

I dont know how to deal with this problem as I was used to work with 0 and 1! I get stuck at the beginning. Thanks for ur help in adbance.


I'm going through the problems on projecteuler.net to learn how to program in Erlang, and I am having the hardest time creating a prime generator that can create all of the primes below 2 million, in less than a minute. Using the sequential style, I have already written three types of generators, including the Sieve of Eratosthenes, and none of them perform well enough.  I figured a concurrent Sieve would work great, but I'm getting bad_arity messages, and I'm not sure why. Any suggestions on why I have the problem, or how to code it properly?   Here's my code, the commented out sections are where I tried to make things concurrent:   -module(primeserver). -compile(export_all).  start() ->     register(primes, spawn(fun() -> loop() end)).  is_prime(N) -> rpc({is_prime,N}).  rpc(Request) ->     primes ! {self(), Request},     receive         {primes, Response} ->             Response     end.  loop() ->     receive         {From, {is_prime, N}} ->             if                 N  From ! {primes, false};                 N =:= 2 -> From ! {primes, true};                 N rem 2 =:= 0 -> From ! {primes, false};                 true ->                     Values = is_not_prime(N),                     Val = not(lists:member(true, Values)),                     From ! {primes, Val}             end,             loop()     end.  for(N,N,_,F) -> [F(N)]; for(I,N,S,F) when I + S  [F(I)|for(I+S, N, S, F)]; for(I,N,S,F) when I + S =:= N -> [F(I)|for(I+S, N, S, F)]; for(I,N,S,F) when I + S > N -> [F(I)].  get_list(I, Limit) ->     if         I              [I*A || A              []     end.  is_not_prime(N) ->     for(3, N, 2,          fun(I) ->              List = get_list(I,trunc(N/I)),             lists:member(N,lists:flatten(List))         end         ).      %%L = for(1,N, fun() -> spawn(fun(I) -> wait(I,N) end) end),     %%SeedList = [A || A       %%      lists:foreach(fun(X) ->     %%              Pid ! {in_list, X}      %%                end, SeedList)     %%        end, L).  %%wait(I,N) -> %%  List = [I*A || A  lists:member(X,List) %%  end.


for someone just starting with the goal of doing family photos, weddingd, etc.which would be a better starter Nikon d3000 or Sony a350


Can we access class properties dynamically with Object class?

Is it possible to access Apex class properties dynamically? While we can create Object's, and assign any other class to an Object, I'm not sure how I can access the properties of these Object's. Can anyone provide some documentation or references to code which would allow me to do this?   Example:  public class XYZ {    public string s1 { get; set; }    public string s2 { get; set; } }  XYZ testXyzObj = new XYZ(); Object obj = testXyzObj;  // Method does not exist or incorrect signature: [Object].get(String) String s1 = obj.get('s1');


While writing a rhetorical question I ran into a case where it seemed natural to start a sentence with "I.e":     How do we handle the case when the list is empty? I.e., if the filter matched no entries?   Is that OK in this case?  In any case?  Edit: Thanks, everyone. It seems the consensus is that it's legal but not attractive. I like the alternatives presented in the accepted answer and comments. For my part, I will probably be avoiding the construct in the future.


If $a_1, a_2, ..., a_n$ is a reduced residue system $\mod p$ and $a_1', a_2', ..., a_n'$ is another reduced residue system $\mod p$ then $a_1 a_1', a_2 a_2', ..., a_n a_n'$  is not a reduced modulo system $\mod p$.  Not able to show a counter to it. Help Needed.


Legend symbol colors display incorrectly using data-defined override for colors with categorized style

I am able to style the colors of a geology polygon shapefile according to the Red, Green and Blue fields of the attribute table using data defined override with the expression: "color_rgb("RED" , "GREEN" , "BLUE")", which works great and the colors on the map canvas render properly. However the colors in the legend symbols are totally random and don't correspond to the colors on the map. I see a similar issue used to arise where the legend symbols were all black in older versions of QGIS...


Dual booting issues, windows 8, 12.10, eufi

I just purchased a Windows 8 desktop and set about installing ubuntu.  The installer couldn't read the hdd, so I installed ubuntu to a separate drive.  Now I can't boot into windows, says grub can't find the path, and the only way to boot into ubuntu is to keep the usb stick in, I assume the EFI partition is on the stick, but I've tried installing it to the drive and haven't found any success.  I ran boot repair, says all is good, but the problem persists.  I've tried googling for a similar problem and have come up empty handed.  Any suggestions?  edit: boot repair got ubuntu to boot with the usb stick, however windows 8 still won't load.  Says it can't find the drive or the efi file.  Is grub not mounting the disk windows is installed on?


$F$ be a field of non-zero prime characteristic $p$ , is it true that there is only one group homomorphism $f:(F,+) \to (F$ \ $\{0\},.)$?

Suppose $F$ be a field of non-zero characteristic $p$ , is it true that there is only one group homomorphism $f:(F,+) \to (F$ \ $\{0\},.)$ ? I have tried taking $x \in F$ , then $px=0$ , so   $(f(x))^p=f(px)=f(0)=1$ , so $f(x)$ has finite order for every $x \in F$ ,   $f(x) \in (F$ \ $\{0\},.)$ , and   $o(f(x))|p$ . But then I am stuck . Please help


Want to know more about managua vip service

How can I contact the managua airport vip service?


Does $m^*(E)=m(E\cap A)+m^*(E\cap A^c)$ always true?

Caratheodory says that $E\subset \mathbb R^d$ is measurable if $$m^*(A)=m^*(E\cap A)+m^*(E^c\cap A)$$ for all $A\subset \mathbb R^d$. To me a more natural way would have been to define it as : $E$ is measurable if $$m^*(E)=m^*(E\cap A)+m^*(E\cap A^c)$$ for all $A\subset \mathbb R^d$. But, maybe the equality hold for all $A\subset \mathbb R^d$, even if $E$ is not measurable, that's why it wouldn't be a good definition. What do you think ?


Where can I get the dataset of duplicates questions in Stack Overflow or StackEXchange? Maybe somewhere in:


I have a database with millions of phone numbers with free-for-all formatting. Ie, the UI does not enforce any constraints and the users are typing in whatever they want.  What I'm looking for is a Java API that can make a best-effort to convert these into a consistent format. Ideally, the API would take the free text value and a country code and produce a valid international phone number or throw an exception.  For example, a phone number in the system might look like any of the following:  (555) 478-1123 555-478-1123     555.478.1123 5554781123   Given the country of US, the API would produce the value "+1 (555) 478-1123" for all these. The exact format does not matter, as long as it's consistent.  There are also numbers in the system without area codes, such as "478-1123". In that case, I would expect a NoAreaCodeException, or something similar.  There could also be data such as "abc", which should also throw exceptions.  Of course, there are countless variations of the examples I have posted, as well as the enormous complication of international phone numbers, which have quite complicated validation rules. This is why I would not consider rolling my own.  Has anyone seen such an API?


Regular Expressions: How to check if a text contains at least all the letters in a character set?

I have a string (essentially an abbreviation - e.g. USA, with all letters in capitals) and a list of texts. I want to select those texts containing all the letters in the string (case-sensitive match). For example,  string = "USA"  texts = ["United States of America", "United States", "United States of America and Iraq"]  #Result shoud be:  results = ["United States of America", "United States of America and Iraq"]   I have tried with (?=U)(?=S)(?=A) (which is what the answers to the duplicate question suggests) but this doesn't seem to work as the regex expects the letters to be occurring in exact sequence. Also, I do not want to check small letters and spaces following each of the Capitals i.e., [?=U]([a-zA-Z]*[\s]+)*[?=S]([a-zA-Z]*[\s]+)*[?=A][a-zA-Z]* as these would be simply redundant (while not working perfectly).  What I am looking is to try with an expression equivalent to [USA] - which instead performs an OR operation to select texts containing at least one letter of the string. Is there any expression as elegant to carry out an 'AND' operation in regex?


Using Phantom 3 Pro to capture aerial imagery for small site plans and derive DEM?

I am curious if this consumer UAV can be used to capture imagery for further processing to stitch seamless imagery and to use as input into stereo/photogrametry software to create reasonably accurate 3D point clouds in order to create surface models.   I have no experience with flying these crafts but am interested in obtaining one to add some extra perspective to my .  At the same time I would like to be able to try capturing aerial imagery and extrapolating DEM for small 3D models and site plans if possible.   Can anyone share their experiences with this or the previous models using the default camera?


If you back up your transaction log every hour through a maintenance plan, why does your log file continue to grow? I would think the system would delete or shrink the log after the backup. Is this something I want to do?


This may be a trivial question but not for non-native. It is a bit confusing whether I should use the before internet or not.     heavy reliance on internet services in people's daily life   OR     heavy reliance on the internet services in people's daily life


made me wonder about Sauron's true appearance. According to the answers there, the big red eye on top of the tower is partly metaphorical but also a physical thing that exists because of Sauron's evil soul.  There he took up again his great Ring in Barad-dûr, and dwelt there, dark and silent, until he wrought himself a new guise, an image of malice and hatred made visible; and the Eye of Sauron the Terrible few could endure.  The Silmarillion, Akallabeth  During the movies, we never see his true self before he was killed by Isildur. He always has his armor on in the movies. I am not sure if that was because the movie crew were unsure of his true appearance, didn't want to show it, or something else.  Sauron had an attractive physical appearance and offered to help the elves make Rings of Power during the Second Age. Does he have a true form in the Second Age? Or did he have the ability to change his appearance at will? Which means he might not have one specific form. I am looking for answers from the books or descriptions by Tolkien.


When I try to download some software from Ubuntu center or from Synaptic, I get package operation failed...    How to fix this?  edit:  I tried to install this game:    This is the details from the installation:  installArchives() failed: Selecting previously deselected package libbulletml0d2. (Reading database ... 100% (Reading database ... 239257 files and directories currently installed.) Unpacking libbulletml0d2 (from .../libbulletml0d2_0.0.6-4_i386.deb) ... Selecting previously deselected package tumiki-fighters-data. Unpacking tumiki-fighters-data (from .../tumiki-fighters-data_0.2.dfsg1-4_all.deb) ... Selecting previously deselected package tumiki-fighters. Unpacking tumiki-fighters (from .../tumiki-fighters_0.2.dfsg1-4_i386.deb) ... Processing triggers for bamfdaemon ... Rebuilding /usr/share/applications/bamf.index... Processing triggers for desktop-file-utils ... Processing triggers for python-gmenu ... Rebuilding /usr/share/applications/desktop.en_US.UTF8.cache... Processing triggers for menu ... Processing triggers for man-db ... Processing triggers for python-support ... Setting up plymouth-theme-mib-ubuntu (0.5.0-2) ... update-alternatives: error: alternative path /lib/plymouth/themes/MIB-Ubuntu/MIB-Ubuntu.plymouth doesn't exist. dpkg: error processing plymouth-theme-mib-ubuntu (--configure):  subprocess installed post-installation script returned error exit status 2 Setting up libbulletml0d2 (0.0.6-4) ... Setting up tumiki-fighters-data (0.2.dfsg1-4) ... Setting up tumiki-fighters (0.2.dfsg1-4) ... Processing triggers for libc-bin ... ldconfig deferred processing now taking place Processing triggers for menu ... Errors were encountered while processing:  plymouth-theme-mib-ubuntu Setting up plymouth-theme-mib-ubuntu (0.5.0-2) ... update-alternatives: error: alternative path /lib/plymouth/themes/MIB-Ubuntu/MIB-Ubuntu.plymouth doesn't exist. dpkg: error processing plymouth-theme-mib-ubuntu (--configure):  subprocess installed post-installation script returned error exit status 2


If $P \in M_7(\mathbb{R})$ has rank 4, rank of $P + aa^T$, where $a$ is a column vector?

Let $P$ be a $7 \times 7$ matrix of rank $4$ with real entries and let $a \in \mathbb{R}^7$ be a column vector. Then the rank of $P + aa^T$ is at least ______.  This question was in the 2017 IIT JAM paper. Any ideas?


This is more of a conceptual doubt. I am learning to use vectors in C++.  While iterating through a vector, I could do it in two ways:  vector<int> temp; for (int j = 0; j < 10; j++){          temp.push_back(j); }  int sum1 = 0; int sum2 = 0;  //Method 1: almost treating it like an array for (int i = 0; i < temp.size(); i++){     sum1 = sum1 + temp[i]; }  //Method 2: using an iterator vector<int>::iterator it; for(it = temp.begin(); it < temp.end(); it++) {          sum2 = sum2 + *it; }   Both methods worked fine and yielded expected results. However, I have noticed that most of the suggested codes (on stackexchange, etc) use  iterators. Is there any specific reason for that or is it just out of convenience?


Getting a lot of different BSODs after starting windows

From yesterday while playing a game I suddenly got a BSOD saying kernal security check failed. The system restarted and after few minutes I got another BSOD but this time the screen was all full of random lines that I couldn't read the error message.  I reinstalled windows but again after few minutes of Windows started, while I was trying to install different apps again another BSOD. And now every time I start windows it hits a BSOD after some minutes.  I ran the checks on hard drive but they passed all of the tests.  I tried to run Windows memory test but it didn't show any error messages but simply said "Hardware problems detected"  So not sure what is the problem as I have lot of work to do so I need a quick solution.


How do make a redstone signal select a random set of command blocks

I want to make a minigame world where you press a button and it has 3 command blocks behind it that teleport you to different areas. But I don't know how to make it select one random command block


CallableStatement setInt named parameter exception

I am trying to call a stored procedure by parameter name:  int processId = 1; CallableStatement stmt = conn.prepareCall("{call get_process_log_latest(?)}"); stmt.setInt("process_id", processId);   But setInt() throws a NullPointerException:    However, stmt is not null; the exception is thrown from within setInt() on line 2065 from the method getNamedParamIndex() at line 1381.  The stored procedure:  DELIMITER $$ CREATE PROCEDURE `get_process_log_latest`(     IN process_id INT ) BEGIN     SELECT         id,         start_time,         end_time     FROM process_logs pl     WHERE pl.process_id = process_id     ORDER BY id DESC     LIMIT 1; END$$ DELIMITER ;   I am using JDK 8, mysql-connector-java-5.1.38, and MySQL 5.7.12.  Do you know what I may be doing wrong?  UPDATE  Authenticated into MySQL with account used by Java and used  SELECT * FROM information_schema.parameters    WHERE parameter_name = 'process_id';   to confirm the parameter name of the stored procedure and that the account has metadata privileges.


Why markdown **bold** rendered as italic on parts of words?

When I try to **bo**ld part of the word it turns out weird.  It's rendered as:   bold as you can see the BO is italic.  I rarely use it but lets say I want to emphasis _un_downvote what should I do?  You can see it should work here  the word xml  xml nib


I'm using a Form to show notifications (it appears at the bottom right of the screen), but when I show this form it steals the focus from the main Form. Is there a way to show this "notification" form without stealing focus?


How is a lens distortion model performed?

So, as the title suggests, how is a lens distortion model (e.g. Brown-Conrady or pinhole camera model) applied on an image? I know it uses some calibration parameters (principal point's coords,focal length, tangential and radial distortion parameters), but how are they really used when a distortion removal algorithm is applied?


I don't get the motivation for calculating Grobner bases. What's good by computing a Grobner basis for an ideal of $k[X_1,...,X_n]$? Moreover, is there any theorem whose proof relies on the use of Grobner basis?   I found "monomial ordering" quite useful while proving the fundamental theorem for symmetric polynomials, but I have not seen yet when Grobner basis plays an important role.


Clan I play two separate clash of clans bases on my ipad?

I have clash of clans on my android phone and would like to also play it (same base) on my ipad. Except I already have clash of clans on my ipad with game center account and would also like to keep and play that different base. Is there a way I can play both on my ipad?


When I was in elementary school, I remember borrowing a science fiction short story collection from the library. It had a number of great stories in it, but I've never been able to find it as an adult.   This was in the early nineties but I think the book was published in the early eighties. I remember the name "Ben Bova" on the cover, so I assume he wrote one or more of the stories. I also remember one of the tales was about a boy who bought a make-your-own-star kit, which allowed people to construct a miniature star in a glass jar. He did as instructed at first, but eventually got bored and started feeding bricks and things into it. Catastrophe ensued.  Anyone know the name of the story, the author, or the collection?


Does using size() function of string inside a recursive function results in large delay/complexity?

I was implementing different versions of a recursive function that checks whether a string is a palindrome and calculating complexities for them, but was confused about passing the string size as a parameter or calculating it using size() function and store it in a variable created inside the function, which would be more efficient?  Here's an Example of the 2 versions of the function:  bool isPalindrome1 (string s) {     int sz = s.size();            // size calculated and stored     if (sz < 2) return true;     return ((s[0] == s[sz-1]) && isPalindrome1(s.substr(1, sz-2))); }   and,  bool isPalindrome2 (string s, int sz) {    //size passed as parameter     if (sz < 2) return true;     return ((s[0] == s[sz-1]) && isPalindrome2(s.substr(1, sz-2), sz-2)); }   The first function would obviously take more time "time needed for size() function to return the size" but would this be of a significant delay if the original string size was kinda large? how's the complexity here calculated?  Note: I know this isn't the most efficient way to check recursively if a string is a palindrome, I'm just trying to better understand complexity and recursion.


Hot network questions causes inconsistent voting

On Security Stack Exchange, voting is heavily influenced by hot network questions. As a recent example, one of  which I consider to be mediocre at best is currently on +82. Contrast this to another user's  which is much better, but currently on +3. I expect this applies to other sites, although I don't have personal experience.  I can see why this happens - hot network questions are viewed largely by people who are not specialists in security, so simple answers are well received. I think hot network questions are a good thing - I've enjoyed dipping into unfamiliar groups like Aviation and Physics.   However, I think these voting patterns create undesirable incentives. There is no reputation incentive to write detailed technical answer - they don't get attention. Instead this encourages "rep whoring" - writing simple answers that appeal to people outside the speciality.  I've thought about this a bit and I'd like to suggest a solution: Once a question or answer goes above +10, if there are further votes from people outside the community, those votes only provide +1 reputation. By "outside the community" I mean people who would not be able to answer a protected question.  I realise this is quite a major change to how voting works, but I think the community should seriously consider it. The rep cap provides a similar effect, but I think it works better on Stack Overflow. The effect is slightly different for non-SO sites, and I think distinguishing between community members and non-members will work better.    Alternative solution from Rathony: make the association bonus not count towards the upvoting privilege.


How functions create new functions in Javascript?

In the Eloquent Javascript book I came across this code. I understood how this works and the passing of arguments but what I am unable to understand is author's statement regarding this code that it's a function which can create another function!   My question is: How is it creating a new function? What is happening which the author is calling creation of a new function? I mean sure we are creating a function called greaterThan and it has another function in it but I can't see how greaterThan is creating another function!  I assure you I have read many similar Qs before asking but couldn't find the answer I am looking for. Thank you for your time & help.  function greaterThan(n) {   return function(m) {     return m > n;   }; } var greaterThan10 = greaterThan(10); console.log(greaterThan10(11)); // → true


WiFi not working Kubuntu 20.04 - Intel 8265 Network Interface

I have a problem with my WiFi card on Kubuntu. Sometimes the system doesn't recognise it, but what is strange is that it doesn't happen everytime, but just about one boot on four, and I can't understand why. If I run lshw -C network I get: *-network UNCLAIMED               description: Network controller        product: Wireless 8265 / 8275        vendor: Intel Corporation        physical id: 0        bus info: pci@0000:03:00.0        version: 78        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress cap_list        configuration: latency=0        resources: memory:ef200000-ef201fff   *-network        description: Ethernet interface        product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:04:00.0        logical name: enp4s0        version: 15        serial: 4c:ed:fb:07:64:b1        size: 100Mbit/s        capacity: 1Gbit/s        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress msix bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=r8169 duplex=full firmware=rtl8168h-2_0.0.2 02/26/15 ip=192.168.2.131 latency=0 link=yes multicast=yes port=MII speed=100Mbit/s        resources: irq:19 ioport:d000(size=256) memory:ef104000-ef104fff memory:ef100000-ef103fff  Do anyone know how to make it work steadly?


I've tried to get 2^64 in Google Console.  I got this below:     Math.pow(2,64) = 18446744073709552000 (18,446,744,073,709,552,000)   And I tried another way:    var x = 1; for(var i=1;i<=64;i++){x*=2} console.log(x);     Both two returned the same result.  I felt it's strange that it ends with zero, so I calculated by Windows calculator and then I got the result below:     (((((2^2)^2)^2)^2)^2)^2 = 2^64 = 18,446,744,073,709,551,616.   Why the two results have such error?  I've tried to Google but I have no idea what keywords should I use.  Anything is appreciated and if this is duplicate please tell me.  Thanks.


Bitlocker doesnt allow to key in password

I have my portable drive encrypted with Bitlocker.  However, every time I connect with computer it doesn't appear a window to type in password to unlock rather than a recovery key. Unfortunately, I lost my recovery key so I can not solve this problem


Do MacBooks support NVMe SSD drives via the use of a Sintech adapter?

My question:   Can anyone confirm or disprove the support of NVMe drives (like the Samsung 960) by the Sintech M.2 PCIe SSD MacBook adapters for macOS Sierra and High Sierra, or would you have any information that could help me confirm or disprove this support?  Below are the results of my research so far.    SSDs comparison  "Official" MacBook SSDs  Officially supported MacBook SSDs are really expensive. For example, with the Macbook Air/Pro 2013, 2014 and 2015 models:   : $299 for , $399 for , $649 for  : $524 for 256GB, $649 for 512GB, $949 for 1TB.   Equivalent PC SSDs  Globally, an officially supported MacBook SSD (PCIe M.2 AHCI with a proprietary 12+16pin connector) cost from about $1 to $2 per GB, while equivalent PC SSD (PCIe M.2 AHCI and NVMe with a key M connector) cost from about $0.4 to $1 per GB.  NVMe:   : $196 for 512GB (low quality) : $219 for 500GB : $316 for 480GB   AHCI:   : $300 for 480GB : $450 for 512GB   So standard PCIe M.2 devices seems to be up to 3x cheaper than the MacBook PCIe M.2 SSD. Plus, NVMe SSD are globally way faster.    NVMe SSD compatibility?  Connector adapter  At first for the connector, I often seen the   recommended to use the AHCI SSD above in a MacBook Air/Pro. The product page clearly stipules only compatible with a limited set of AHCI SSDs, but I do not see any reason for these "incompatibilities", as there is no other software/hardware standards for the PCIe M.2 AHCI models. It seems they simply give as compatible the list of the AHCI SSDs they've tested, and as incompatible the most known NVMe SSD models.  Interface compatibility  Then for the interface, what I understand from AHCI/NVMe is that it is only a controller interface, depending on the system drivers on the MacBook and not on the hardware itself.  Which seems to be consistant with:     I emailed the store which sell that adapter and problem is that macOS doesn't support 3rd party NVMe SSDs, but Windows 10 and Linux do.      -- From a  on a upgrade video with a AHCI SSD and the Sintech adapter.   So Sintech may have given these NVMe SSD as incompatible not because of the adapter incompatibility, but because of the destination OS incompatibility.  System support  Finally for the system, macOS now support NVMe SSDs, from unofficially OSX El Capitan (with a  to boot) and natively macOS High Sierra (even as boot, see an article about the  and a confirmation from the ).  I sent an email to Sintech to get more informations on their adapter. I got a reply with some references (added to this post), but no answer since.  Edit (23/06):     Unfortunately, we are busy in other projects, and still can't get new system to test it.     Similar researches  After I created this post, I seen there is some people with the same question in other communities, waiting at the same step. I share the links there in case of some of them got a return from a test with the Sintech adapter or an other one.  On    Por Chumjan (02/27/2016):     I think about to upgrade. Samsung 950 pro is interesting. But i'm not sure it can use for this model.  trumanhw (12/21/2016):     You can buy an adapter from M.2 to MBPr or Air for about $20... (...) The REAL question is if the NVMe protocol will be a hiccup (as in, I don't personally know that answer) ... and if it'll get the full speed of the 950. In principle, I don't see why it wouldn't. And I WILL be testing this out.  Fabio (06/10/2017):     [ About the patch ]. It is meant to be used on hackintosh but I think it might work on a macbook pro from 2015 with the adapter and a nvme ssd like the samsung 960/950 evo/pro. If someone tries or has tried it please let me know.


Travelling to the US as a speaker in a conference

I have been trying to find an answer to this and I receive conflicting information. I am travelling to the US for a conference and also tourism. The conference in covering part of my flight cost in cash, accommodation only for the days of the conference (3 days - I will stay 10 extra for tourism) plus $500 speaker fee.   I applied and received my ESTA but I am not sure if I need to apply for a B-1 as well or any other visa. I called the embassy but they don't provide information on this.   B-1 is not the appropriate visa either for speakers.


I'm trying to configure MySQL 5.1 on CentOS 6.6 in such a way that users will not be able to see databases to which they do not have any privileges. If they execute the command [SHOW DATABASES] it should only return a list of databases to which they have access privileges (as per the [db] table in the [mysql] privileges database). Any other database should not appear in the list.  I have tried the grant/revoke privileges commands in MySQL, but with no luck. I also tried using [skip-show-database] in my.cnf, but it causes an error (no list at all is displayed) unless [Show_db_priv] is enabled for the user.


The answers to  explain that ice is less dense than water because it has a "crystal structure", but they dont explain what exactly that is and why this happens, also I saw  from another site stating that not all ice is less dense than water.  What is the "crystal structure" that ice has? Why is ice structured that way? Can ice be more dense than water, and if yes, how and when?


Let $R$ be a finite group which has even number of elements. Prove that at for least two elements $r\in R$ the following equation is valid: $r^{2}=1$. Note: $1$ is the element of unity in $R$ So I have been sitting with that problem for some hours now and do not know how to approach the problem. Studying Algebra as an extra curriculum activity, so any help that takes me back on the right track is greatly appreciated.


Username alignment issue in the Stack Apps site

There is an alignment issue with the displaying of usernames in the Stack Apps site's  and  tabs. The last characters of the usernames are not being displayed correctly.  Screenshot for reference:     After inspecting the element, the alignment issue appears to be at the in-line styling margin-right : 5px;. If margin-right : 5px; is changed to margin-right : 8px; the issue will be solved.  The issue is occurring in Chrome and IE 11 and the same fix solves the problem in both browsers.  Screenshot for reference:    Chrome Version 47.0.2526.106 dev-m IE Version 11.20.10586.0


If the domain is a compact set, pointwise equicontinuity implies uniform equicontinuity.

Conversely, is it true that if every sequence of pointwise equicontinuous functions from $M$ to $\mathbb{R}$ is uniformly equicontinuous, them $M$ is compact?


is it possible to obtain recursion value at runtime?

I have a Fibonacci recursion function:  int efib (int num) {          if (num == 0){             return 0;     }else if (num == 1){          return 1;     }else if (num == -1){          return -1;     }else if (num > 0){           return efib(num - 1) +  efib (num - 2);     }else{             return efib (num + 1) + efib(num + 2);     } }   I'm trying to find the exact element num where the int value overflows, is it possible to obtain the current recursion value to compare it to the maximum value an int data type can hold?  I know that the max value an int can hold that is included in the Fibonacci sequence is 1836311903.


no device drivers were found error when installing win7

I'm trying to install win 7 on dell xps laptop. I burned the win7 on my 16 gb flash with no issues. When installing windows ,"no device drivers were found" error appears. I installed the drivers, and copied to usb, but it is not appearing in "Browse" OPTION, it shows only :   c: RECOVERY D: LOCAK DISK E: CD DRIVE X: BOOT   So my Question is : Why usbs are not appearing so I can select the drivers to be downloaded?


How to check string in current URL with javascript?

My Url looks like:  http://mywebsite/series/2545-abc   But I don't know how to check URL with regex. So, How to check url current windows with above URL?   I mean:  If Url = http://mywebsite/series/2545-abc   do something


How do I display a property in the viewport without using a modal operator?

I want to display a property in the viewport without using a modal operator. is it possible? I found , but I did not understand how I can use (I started with python).


Taylor Series of $f(x) = \sqrt{x}$ about $c = 1$  I've tried doing this problem but stuck at finding a pattern..  Work:  $$T_n = \sum^\infty_{n=0}\frac{f^n(c)}{n!}(x-c)^n = f(a) + \frac{f'(c)}{1!}(x-a)^1 + \frac{f''(c)}{2!}(x-a)^2+... $$  So $f(x) = \sqrt{x}$  $$ f'(x)=\frac12x^{-\frac12}$$ $$ f''(x)=\frac{-1}4x^{-\frac{3}2}$$ $$ f'''(x)=\frac{3}8x^{-\frac{5}2}$$ and  $$f(1) = 1$$ $$f'(1) = \frac12$$ $$f''(1) = -\frac14$$ $$f'''(1) = \frac38$$  So far I know that its alternating so $(-1)^n$  But I'm having trouble with the fractions since I thought it would have been $\left(\frac12\right)^n$ but the $\frac38$ wont work with that. Have I done something wrong so far or am I just not thinking of this the right way?  So I've noticed that starting from the $n=3$ the numerator is $3$ then $3*5$ then $3*5*7$ and so on... but how do I account for the first 3 terms? (n = 0, 1, 2)  I learned that I can exclude it by simply taking it out and adding it from where the pattern starts to work so...  $$1+\frac{x-1}{2}-\frac{(x-2)^2}{8} + \sum^\infty_{n=3}something$$


Conditional formatting of an entire row based on multiple cells

I'm trying to make a conditional formatting rule in Google Spreadsheet that would highlight a row green based on text in multiple cells.   If cells L2, M2, and N2 = APPROVED; and cell O2 = X; then row 2 = highlighted green.


Alt+Shift layout switching problem in 13.10

I tried to set Alt+Shift as the keys to switching a keyboard layout in my Ubuntu 13.10.  The only problem is every time I type Alt+Shift when I set the keys, it is also writing "Next Group".  When I try to switch layouts, it doesn't work. What is this "Next Group" key and what I did wrong?    I also tried:  setxkbmap -option grp:alt_shift_toggle en,he   but I got this error:  Error loading new keyboard description   My question is what is this "Next Group" key and why is it showing when I don't press any other key, and not how to use shift_alt to change keyboard layout.


Is it possible to disable a specific key in OSX?

It appears my left shift key is permanently down on my MBP. All keys trigger capital letters, and numbers print out the symbols, I have to hold down esc when booting to prevent it from booting into safe mode...  I have taken the key off and cleaned underneath but that hasn't helped matters. If I open the visual keyboard I can see that the right shift responds to my presses but the left one does not, which leads me to think it is the one that is bust.  Is there any way for me to disable this key? I can make do with just using the right hand shift, obviously the laptop is practically un-usable with shift always being on...


I was trying to prove the identity:  $$\int_{0}^{\pi} {xf(\sin(x))} dx =  \frac{\pi}{2} \int_{0}^{\pi} {f(\sin(x))}$$ Firstly, I substitute $x=\pi - t$. Then: $dx=-dt$ and substitute that into the integral, I get: $$I=-\int_{\pi}^{0} \pi f(\sin(\pi - t)) - tf(\sin(\pi-t))dt.$$  After that I get: $$I +\int_{0}^{\pi} tf(\sin(t)) dt=\int_{0}^{\pi} \pi f(\sin(t)) dt $$ So, can I factorize the LHS of the equation to let it become 2I, and I can prove the expression, if it can be factorized, why? The variables are different.   Thank you very much for your reply


Can I use Backup/Restore to clone a database? Running out of ideas

I need to clone a database in a single instance of SQL Server 2012.  I have tried the Copy Database tool in SSMS, but it fails with file access error of which I've spent all day reading around to no avail.  I'm running out of time, and I need to get this database cloned, ensuring that the clone is entirely independent of the original.  The source database, DB1 needs to retain much of its data, so Generate Scripts is also no good.  Also my version of SQL does not have the Schema Compare tool.  Can I do a full backup, but then restore to a different database name?  I tried it on a dev machine, but some aspect such as it retaining the original logical name concern me (I might not need to be concerned - please advise!).  Or are there any other ways to do this?


I am trying to pass an int array to the next activity using Intent. Here is the code. to send  Intent mIntent=new Intent(getApplicationContext(),activityvogel.class); mIntent.putExtra("stock",stock); startActivity(mIntent);}   to get  Bundle extras = getIntent().getExtras();         int stock [] = extras.getIntArray("stock");   but i always get numberformatexception here is my logcat     15015-15015/com.example.pantelis.ptyxiakh E/AndroidRuntime﹕ FATAL   EXCEPTION: main       Process: com.example.pantelis.ptyxiakh, PID: 15015       java.lang.RuntimeException: Unable to start activity ComponentInfo{com.example.pantelis.ptyxiakh/com.example.pantelis.ptyxiakh.activityvogel}:   java.lang.NumberFormatException: Invalid int: "null"               at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2379)               at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2442)               at android.app.ActivityThread.access$800(ActivityThread.java:156)               at android.app.ActivityThread$H.handleMessage(ActivityThread.java:1351)               at android.os.Handler.dispatchMessage(Handler.java:102)               at android.os.Looper.loop(Looper.java:211)               at android.app.ActivityThread.main(ActivityThread.java:5389)               at java.lang.reflect.Method.invoke(Native Method)               at java.lang.reflect.Method.invoke(Method.java:372)               at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:1020)               at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:815)        Caused by: java.lang.NumberFormatException: Invalid int: "null"               at java.lang.Integer.invalidInt(Integer.java:138)               at java.lang.Integer.parseInt(Integer.java:358)               at java.lang.Integer.parseInt(Integer.java:334)               at com.example.pantelis.ptyxiakh.NextActivity.onCreate(NextActivity.java:41)               at com.example.pantelis.ptyxiakh.activityvogel.onCreate(activityvogel.java:19)               at android.app.Activity.performCreate(Activity.java:5990)               at android.app.Instrumentation.callActivityOnCreate(Instrumentation.java:1106)               at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2332)               at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2442)               at android.app.ActivityThread.access$800(ActivityThread.java:156)               at android.app.ActivityThread$H.handleMessage(ActivityThread.java:1351)               at android.os.Handler.dispatchMessage(Handler.java:102)               at android.os.Looper.loop(Looper.java:211)               at android.app.ActivityThread.main(ActivityThread.java:5389)               at java.lang.reflect.Method.invoke(Native Method)               at java.lang.reflect.Method.invoke(Method.java:372)               at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:1020)               at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:815)   i would be grateful if anyone could help


Let $\beta= \{ (2,1),(3,1) \} $ be an ordered basis for $\Bbb R^2$. Suppose that the dual basis of $\beta$ is given by $\beta^*= \{f_1,f_2 \} $ To explicitly determine a formula for $f_1$ we need to consider the equations $$1=f_1(2,1)=f_1(2e_1+e_2)=2f_1(e_1)+f_1(e_2)$$ $$0=f_1(3,1)=f_1(3e_1+e_2)=3f_1(e_1)+f_1(e_2)$$ Solving this equations, we obtain $f_1(e_1)=-1$ and $f_1(e_2)=3$, that is $f_1(x,y)=-x+3y$.   My question is why do we need to solve the above equations for 1 and 0 respectively?


How can I calculate the age of a person in year, month, days?

I want to calculate the age of a person given the date of birth and the current date in years, months and days relative to the current date.  For example:  >>> calculate_age(2008, 01, 01) 1 years, 0 months, 16 days   Any pointer to an algorithm that does that will be appreciated.


I would like to teach myself measure theory and I am looking for a good introductory textbook at the advanced undergraduate or early graduate level. A reader-friendly text with plenty of examples would be ideal.


For any prime number $p$ and natural number $i < p$, prove that $p$ divides ${p \choose i}$.  Also, what happens when $p$ is not a prime. Is this still true?  I tried writing out the formula for combination but couldn't get further.


Movie where a man was put into a computer before death, wife doesn't trust him anymore

I saw a movie a few years back, I don't remember what it was called, about a man who was put into a computer (I think because of some disease or something) before he died. He was the first person ever to have this happen.  After becoming a computer he became super smart (or maybe he already was?) and invented a bunch of awesome stuff (I remember an old guy getting a needle stuck into his eye to cure his blindness, the computer-man invented it). However, when he reveals to his (still fully human) wife that he had been using his systems to monitor her hormones so he can tell what mood she's in she finds it rather upsetting and begins to feel that this isn't actually her husband, just a computer that talks like him.  At one point in the film, someone asks him how they can be sure he is truly conscious, and his answer is the same question right back at him, "How can I be sure you're truly conscious?"  (I think someone else in the movie said the same thing earlier.)  I think a major theme of the film was that no one knew whether or not he was truly conscious. I'm guessing it was made no sooner than 2000 and no later than 2014.


Error messages don't take logout into account

I used to open many interesting questions from Stack Overflow (10..80 tabs) in my browser and then read them slowly over weeks. My browser (Opera) knows to reopen the last tabs but I'm afraid it has an aggressive caching mechanism.  By that I mean it shows me I'm still logged in but when I try to post a response or a comment I'm given a strange error message (for example: Cannot add comment because the answer has been locked or deleted) when all that is wrong is that I'm no longer logged in.   Refreshing the page prior to posting (along with re-logging in) solves the problem.  My issue is: shouldn't the error message state something along the lines: "you're not logged in suckaa..."?


"core - The core runtime enviornment for snapd." What is it and how did it get on my computer?

Just installed Ubuntu on a new laptop I bought (came with Win 10).  Three days later, in my installed programs in the Ubuntu Software, I see:  core - The core runtime enviornment for snapd  I didn't install this (that I can remember).  What is it? What does it do? Do I need it?


Prove that $a^{n+m}=a^{n}a^m$, for real numbers

How does one prove that $$ a^{n+m} = a^{n}  a^{m} $$ for $a,n,m \in \mathbb R$.  I can prove this for integers but how can one prove this for real numbers?


Excuse my knowledge because I am still learning to code on my own and not an expert.   I use crypt with blown fish $2a$10$, My secured password will show this for instance, $2a$10$137276602359697140be5eISqj55.fGmbUo4PEZoLRpWmxspLiWJK  As it starts with $2a$10 they will know the way I used, will it affect me? Can they->hackers even do anything with my secured password as I use random salt/key hashed and encrypted? (Rainbow tables).  Because I got scared after I saw this   Finally, last question. Heard that loops make it longer/slower to get password results during an attack but, what does it do to $hash? Maximum loop limit ? Does it have any side-affects?  for($i = 0; $i < 100000; $i++) { $hash = crypt('sha512', $hash);   }  Thanks for reading, every answer will be much appreciated. Best regards, Mr Pro Pop!


There is this one thing called hero forge, and it looks really cool,  but... it really expencive for what im looking for, I also tryed Warhammer but that was expencive and the minis where not what I was looking for, I also tryed just the plane D&D characters they where cheap but not what i was looking for, so I was wondering if anyone new a good cheap place I can find my minis... (I am suplying for mor ethen myself) (about 5 people)


Using Beaglebone.  Need to run dd to backup an image and then restore it.   dd bs=64K if=/dev/sdX of=/dev/mmcblk1/myImage.img   But I don't see any sdX, where X is a number.  So, what should be the input file path for a full backup?


I would like to get all the instances of an object of a certain class.  For example:  class Foo { }  $a = new Foo(); $b = new Foo();  $instances = get_instances_of_class('Foo');   $instances should be either array($a, $b) or array($b, $a) (order does not matter).  A plus is if the function would return instances which have a superclass of the requested class, though this isn't necessary.  One method I can think of is using a static class member variable which holds an array of instances.  In the class's constructor and destructor, I would add or remove $this from the array.  This is rather troublesome and error-prone if I have to do it on many classes.


How to establish and prove causality between two variables?

I want to establish causality between two variables/attributes of some time series data.   Is there any method to prove and establish the causality mathematically?


How I can prove that if there were $x$ and $y$ are algebraic numbers then $x+y$ and $x \cdot y$ are also algebraic numbers given that $x,y \in \mathbb R$?


Find an integer having the remainders $2,3,4,5$ when divided by $3,4,5,6$, respectively.   My work:  We consider the congruences $x \equiv 2 \pmod 3$, $x \equiv 3 \pmod 4$, $x \equiv 4 \pmod 5$, $x \equiv 5 \pmod 6$. We can reduce this further to $x \equiv 2 \pmod 3$, $x \equiv 3 \pmod 4$, $x \equiv 4 \pmod 5$. We have  $N_1 = 4 \cdot 5 = 20 \implies 20 x_1 \equiv 1 \pmod{3} \implies 2x_1 \equiv 1 \pmod{3} \implies x_1 \equiv 2 \pmod {3}$  $N_2 = 3 \cdot 5 = 15 \implies 15x_2 \equiv 1 \pmod{4} \implies -x_2 \equiv 1 \pmod{4} \implies x_2 \equiv 3 \pmod {4}$   $N_3 = 3 \cdot 4 = 12 \implies 12 x_3 \equiv 1 \pmod{5} \implies 2x_3 \equiv 1 \pmod{5} \implies x_3 \equiv 3 \pmod {5}$  Now,  \begin{align*} \bar x &= a_1 N_1 x_1 + a_2 N_2 x_2 + a_3 N_3 x_3 \\ &= 3 \cdot 20 \cdot 2 + 4 \cdot 15 \cdot 3 + 5 \cdot 12 \cdot 3 \\ &= 480 \equiv 0 \pmod {3 \cdot 4 \cdot 5} \end{align*}  Is this correct, or is something wrong in my work? I don't like how I have $0$ remainder.


I'm trying to find the width of the terminal window using python (3.8.2), so that I can store it in a variable. By doing this, I can centre text I display in the terminal, no matter the width of it. As a heads up, I'm using an online IDE called 'repl.it'. Is there a way to find the width of the terminal, or even another way to centre text in the terminal without need for finding its width?


Show that $z^n + \frac{1}{z^n} ∈ \mathbb{Q}$, when $z + \frac{1}{z} = 3$


how is this possible? I know there is some trick, should someone please explain?!


I'm using biblatex with biber backend and verbose-icomp preset. When citing in the text, I need the ibid-features, but mustn't use the compact features in the bibliography at the end.   Can I somehow remove this and let biblatex simply repeat itself for more books with the same author? This is especially a problem with internet sources, where no author is given. I have to use "k.A.", which is german short-form for "no author".  Here's what I've got:  \documentclass[a4paper,12pt]{scrreprt}  \usepackage[utf8]{inputenc} \usepackage[ngerman]{babel} \usepackage[T1]{fontenc} \usepackage[includefoot, footskip=6mm]{geometry} \usepackage[style=verbose-ibid,backend=biber]{biblatex} \usepackage{hyperref} \usepackage[autostyle=true,german=quotes]{csquotes} \usepackage{xpatch} \usepackage[onehalfspacing]{setspace} \usepackage{scrpage2} \usepackage{sectsty} \usepackage{titlesec}  \bibliography{literature} \begin{document}  Text-Sample1.\autocite{History:PGW} Text-Sample2.\autocite{AF:PGW} Text-Sample3.\autocite{Balt:Refugees}  \printbibliography  \end{document}   (I included all packages, because maybe something else is causing it and I'm just stupid and didn't noticed)  And the .bib-file:  @MISC{AF:PGW,   AUTHOR       = {{k.A.}},   TITLE        = "Activity 18. The Incubator Baby Incident. Reading18H-J",   NOTE         = "<\url{http://www.globaled.org/curriculum/cm18h.html}> (abgerufen 29.10.2014)" }  @MISC{MedienGleichschritt,   AUTHOR       = {{k.A.}},   TITLE        = "Der Zweite Golfkrieg. Medien im Gleichschritt",   NOTE         = "<\url{http://medien04.uni-trier.de/buwiki/index.php/Der_Zweite_Golfkrieg:_Medien_im_Gleichschritt}> (abgerufen 31.10.2014)" }  @MISC{Generation:ShieldStorm,   AUTHOR       = {{k.A.}},   TITLE        = "Desert Shield und Desert Storm",   NOTE         = "<\url{http://www.generationenprojekt.de/1991/Golfkrieg.html}> (abgerufen 30.10.2014)" }  @MISC{FAZ:HintergrundFlug,   AUTHOR       = {{k.A.}},   TITLE        = "Hintergrund. Flugverbotszonen",   NOTE         = "<\url{http://www.faz.net/aktuell/politik/irak-hintergrund-flugverbotszonen-114559.html}> (abgerufen 30.10.2014)" }  @MISC{Balt:Refugees,   AUTHOR       = {{k.A.}},   TITLE        = "Straggling refugees report electricity, water virtually gone in Iraq, Kuwait",   NOTE         = "<\url{http://articles.baltimoresun.com/1991-02-18/news/1991049028_1_kuwait-baghdad-refugees}> (abgerufen 29.10.2014)" }   So, with my code, it looks like this:    What I need is that it's not summed up, so "k.A." isn't written out one time, and the rest is ordered with these bulletpoints.  So that it looks like this:  k.A.: Activity 18. The Incubator Baby Incident. Reading18H-J. <http://www.globaled.org/curriculum/cm18h.html> (abgerufen 29.10.2014).  k.A.: Der Zweite Golfkrieg. Medien im Gleichschritt. <http://medien04.uni-trier.de/buwiki/index.php/Der_Zweite_Golfkrieg:_Medien_im_Gleichschritt (abgerufen 31.10.2014).  k.A.: Desert Shield und Desert Storm. <http://www.generationenprojekt.de/1991/Golfkrieg.html> (abgerufen 30.10.2014).  k.A.: Hintergrund. Flugverbotszonen. <http://www.faz.net/aktuell/politik/irak-hintergrund-flugverbotszonen-114559.html> (abgerufen 30.10.2014).  k.A.: Straggling refugees report electricity, water virtually gone in Iraq, Kuwait. <http://articles.baltimoresun.com/1991-02-18/news/1991049028_1_kuwait-baghdad-refugees> (abgerufen 29.10.2014).