This is probably late 1990s early 2000s by Walter Jon Williams.  Short story, easy to remember, aside from me not knowing the title.  AIs, along with the top 2% of smartest people, basically run everything and provide for everything.  People aren't really in need or oppressed, but they don't have much to do.  This isn't gone into in any detail, it's quite a short story.  The protagonist, a near genius, and his anarchist friends have found, IIRC, some kind of enzyme or viral computer code that is going to "knock out the AIs".  They launch their revolution and... nothing much happens.  The AIs immediately counteract it and the big attack is shut down within 5 minutes or so.  Nothing really happens, no police comes a-knockin', they're ignored.  It concludes with the protagonist recognizing that they never had a chance to start with and are insignificant.   I looked at Walter Jon Williams' page on  and , searched for his short stories, "AI 2% dinosaurs".  None struck me as a match.  "Dinosaurs" looked like it might be, but it's unrelated. It's also funny in that it was specifically 2% and predated the entry into the vernacular about the top 1% that we are now familiar with.

The story was set in a mid-future Earth (at least 20 years from now, but probably less than 100) with AI and nanotechnology.  The most striking element (and the one I thought I could find with Google search) is a massive black octahedral building that houses a major AI.  I believe it is described as standing "arrogantly" on one vertex.  (It is not held up by antigravity or any advanced technology; the AI is powerful enough, and fast enough, to simply maintain its balance despite winds, etc.)  The narrator of the story has a friend who is obsessively tuning the programming of a suite of nanobots, effectively a nanovirus, that he manages to get injected into one of the feed-lines of the aforementioned AI.  There is a brief data-blip, and narrator relates that this is the first time in a long time that anyone has managed to cause even the most minor of observable effects on the AI.  He may even have seen the octahedron rock ever so slightly (he's not sure).  The narrator is initially fearful for his friend, but comes to the realization that the AI (collectively; this one and others like it) permit, and may even subtly encourage, such people as a way of constantly testing and improving their defences.  I likely read this between 1995 and 2005.  It feels like something by Greg Bear, but I couldn't come up with a match.


I'm a software engineer, have a passion for philosophy. But I have no background in human science, but I guess I'm good at logic. Can you provide a profound study path to philosophy? What are the best authentic, accurate and comprehensive resources?  I need resources that are written in a not convoluted but interesting style to keep me moving.

I've been searching the questions posed here, and don't seem to find one that gives the answers I am looking for. I've proposed to start a  on meta but no one proposed anything, so I feel I must ask this question: What are some books generally regarded as good for a general introduction on philosophy? By this I mean good books that can introduce you to philosophy in general and throughout the times, not to some philosophy or period in particular.   almost answers mine, except for the fact that most things proposed there are not books, thus not giving me much options to weigh upon.  regards contemporary philosophy in particular. And  has the same problem as the first one, plus the fact that it asks for layman's terms, which is not what I am looking for.  I've been tempted to buy Will Durant's , but am not sure if it is the best book to get started on philosophy (plus, the book has some mixed reviews). I also checked , which seems to be unanimously good, but has the format of dictionary/encyclopaedia, which is not exactly what I am looking for (at least as a main source).  also seems to be a good introduction regarding how to do philosophy, rather than to its history and ideals (this also interests me, but I'd rather learn about the philosophers and their theories first).   It is also important to point out that I have little notions (or none at all) on philosophy. I would like to read something that covers from classical to contemporary philosophy generally (although I do not know if there is such a book), so that from there I could pick some author, period or branch of philosophy in particular to read further on. So, to sum up, I would like to 'hear' your opinions on what are some books generally regarded as good for a general introduction on philosophy.


I tried to run :   import numpy as np from dipy.reconst.multi_voxel import multi_voxel_fit from dipy.reconst.base import ReconstModel, ReconstFit from scipy.special import hermite, gamma from scipy.misc import factorial, factorial2 import dipy.reconst.dti as dti from warnings import warn from dipy.core.gradients import gradient_table from ..utils.optpkg import optional_package  cvxopt, have_cvxopt, _ = optional_package("cvxopt")   But it gives ValueERROR:ValueError: Attempted relative import in non-package Thank You !

Imagine this directory structure:  app/    __init__.py    sub1/       __init__.py       mod1.py    sub2/       __init__.py       mod2.py   I'm coding mod1, and I need to import something from mod2. How should I do it?    I tried from ..sub2 import mod2 but I'm getting an "Attempted relative import in non-package".  I googled around but found only "sys.path manipulation" hacks. Isn't there a clean way?      Edit: all my __init__.py's are currently empty    Edit2: I'm trying to do this because sub2 contains classes that are shared across sub packages (sub1, subX, etc.).  Edit3: The behaviour I'm looking for is the same as described in  (thanks John B)


Even if every possible attempt to avoid stuff that can be avoided (like it will topple, the connectors will break, it won't overcome the rolling resistance, etc, etc) is made What if one of the magnet was replaced by iron or something?

See image:    If I'm not totally dumb the car would move when the right magnet would not be attached to the car, at same distance of the booth magnets.  So why would it not move?


Let $V$ denote the vector space of polynomials in one variable with coefficients in $\mathbb{R}$, and let $T(f(x))=x(f(x))$.     Prove that if $W\subset V$ is a subspace $\neq 0$ such that $T(W)\subset W$, then $V/W$ is finite dimensional.   My attempt: We know that $\forall p\in W$, $xp\in W$ because $T(W)\subset W$, so given that $1$ is in our subspace $W$, so must $x$ be, and hence every linear combination of $x$ and coefficients in $\mathbb{R}$. Thus, $V/W$ is simply the constant functions (is this true?)  It this is the case, how do I show the constant functions are finite dimensional?  I understand this may have been solved before, but I would like insight on whether my line of reasoning works.  Any help appreciated!

Let $V$ denote the vector space of polynomials in one variable with coefficients in $\mathbb{R}$, and let $$T(f(x)) = xf(x).$$ Prove that if $W \subset V$ is a subspace such that $T(W)\subset W$, then $V/W$ is finite-dimensional.  First I let $f(x) \in W,$ such that $a_0+a_1x+a_2x^2+...+a_nx^n$, and $T(f(x)) = a_0x+a_1x^2+a_2x^3+...+a_nx^{n+1} \in W$. So I think $W$ is the set contains polynomials such that $a+ax+ax^2+ ... +ax^n +...ax^\infty$. But I am not sure about it, and how it is related to finite-dimension.   Please help me to solve this problem, thank you!!


I can show that there exists an irational number $x$ such that $x^x$ is rational. But I have no example. Can you give a pricise example of such number $x$?

It can be proved that there are two irrational numbers $a$ and $b$ such that $a^b$ is rational (see ) and that for each irrational number $c$ there exists another irrational number $d$ such that $c^d$ is rational (see ).  My question is: Is there an irrational number $a$ such that $a^a$ is rational (and how could you prove that)?


So this is my current code: <!DOCTYPE html>               <title>StoryReader</title>         <link rel="stylesheet" type="text/css" href="indexStyle.css">

Welcome to StoryReader.
         <button onclick="ReturnToHomepage()" style="background-color: chartreuse; border-radius: 5px; font: message-box;">Return to the homepage.</button>

Lion, Witch and the Wardrobe.

Description:

When the Pevensie children - Peter, Susan, Edmund and Lucy - step through a wardrobe door in the strange country house where they are staying, they find themselves in the land of Narnia. Frozen in eternal winter, Narnia is a land of snow and pine forests, and its creatures are enslaved by the terrible White Witch.
                 <input type="button" value="Open" onclick="OnClickLion()">

Unknown...

Description:

Coming soon!

             and I want to make it so Readers2 is next to Readers1 so on the left would be Readers one and right next to it to the right would be Readers2. I also want a gap between each div. Is this possible?

I want to put two <div>s next to each other. The right <div> is about 200px; and the left <div> must fill up the rest of the screen width? How can I do this?


I don't know what 'Count : Count' does in my code. Below is the function that this is used in on line 4  I tried printing it but it gave me an error. CommandList is a string variable as well as Command.  def GetPositionOfCommand(CommandList, Command):     Position = Count = 0     while Count <= len(CommandList) - len(Command):         if CommandList[Count:Count + len(Command)] == Command:             return Position         elif CommandList[Count] == ",":             Position += 1         Count += 1     return Position  Position = GetPositionOfCommand(Items[IndexOfItem].Commands, "get")

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


I researched on possible antivirus for Ubuntu.  But I have not found any antivirus for my distro Ubuntu 12.04 LTS 32 - bit .  Really necessary ?  Try installing ClamAV , but always crashes  Any recommendation?

I thought that there was no need to scan for viruses either in Ubuntu or any Linux distros until I found virus scanner packages clamtk and klamav in Ubuntu software center yesterday.  This leads to the following questions:   How do viruses differ between Linux and Windows? How do the strategies for protection differ between Linux and Windows? Should a virus scanner package be installed on my system? If so, which would be a better option?


I'm trying to write a simple program to calculate the number of common factors for two numbers.I am stuck with segmentation fault(core dumped) occurring while scanning the second number.I don't understand where is the fault?  #include <stdio.h> #include <stdlib.h>  int main() { long long int first,second,t,k; long long int i,count=0; scanf("%lld",&first); scanf("%lld",&second); //storing the lowest of two numbers in t   if(first<second){     t=first; } else{     t=second; } //initialising an array to be used as flags int com[t]; for(i=0;i<t;i=i+1){     com[i]=1; } for(i=0;i<t;i=i+1){     if(com[i]==1){         if(first%(i+1)==0&&second%(i+1)==0){             count=count+1;         }         else{             for(k=2;k*(i+1)-1<t;k=k+1){                 com[k*(i+1)-1]=0;             }         }     } } printf("%lld\n",count);  return 0; }

The following code is generating a stack overflow error for me  int main(int argc, char* argv[]) {     int sieve[2000000];     return 0; }   How do I get around this? I am using Turbo C++ but would like to keep my code in C  EDIT:  Thanks for the advice.  The code above was only for example, I actually declare the array in a function and not in sub main.  Also, I needed the array to be initialized to zeros, so when I googled malloc, I discovered that calloc was perfect for my purposes.  Malloc/calloc also has the advantage over allocating on the stack of allowing me to declare the size using a variable.


Currently when I want to filter a list I use to iterate over its elements and copy the elements that match my requirements to a new list but in this way I'm using O(2N) of spatial complexity. Is there a more efficient way to do it?

I want to filter a java.util.Collection based on a predicate.


If I play  or , THEN play a creature after the prior spell resolves, is that creature affected? I assume so, but is this ever not true?

My opponent casts , which resolves, then he attacks with his creatures.  In my hand, I have a creature card with Flash. If I summon this creature before the declare blockers step, will it be affected by Predatory Rampage's blocking requirement?


I need a very simple random number generator function that takes a input parameter as a range something like:  int randomNumberGenerater(int range) {     return (int) (Math.random() * range); }   The trouble is when the range is equal to 1, it will always output 1 instead of alternating between 0 and 1. How can I fix that with a generic solution that works with any range if possible.

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


I want to install a new Android version in my Ubislate 7C+ EDGE Tablet. It has wi-fi, 3G Network support, 10 point touch screen, inbuilt SIM card slot, 4Gb internal memory and 512Mb of RAM, and a 7in screen with 800x600 resolution support.  I don't have even the basic idea of how to start (I'm a novice), so please  start from the start. Please explain complete process step-by-step, and don't skip even the tiniest of details (connections, OS details, architecture, etc.), keywords, etc...  I am also unable to find any proper link to download android 4.2 for tablets, please refer sites or links.

This Community Wiki question is designed to be the "canonical question" for questions asking how to upgrade one's device to a new Android version.   I want to get a newer version of the OS for my Android device. How can I do that?  See also:


I don't want to run a big if, else, else, else type statement. I'm basically looking for an excel INDIRECT() equivalent, where I get the string of the id, and call that string as a function, based on which id I'm iterating over.  I have inputs with classes that jQuery makes spinners based off of.   $(document).ready(function(){     var primary = $(".spinnerPrimary");     var secondary = $(".spinnerSecondary");     primary.spinner({         min: 7,         max: 20,     });     primary.spinner("value", 10);     secondary.spinner({         min: -4,         max: 4     });     secondary.spinner("value", 0);   When doing max, min, etc.  I want to do a spin event that calls a function to update various span containers. I could run one function that just updates every span, or run a big if/else/else case-type statement, so I do have options. What I really want is to pull the id with a this.attr("id"), so that each spinner has a spin set to it based off of the id of that input spinner, that is the same string that corresponds to the name of a defined function.   $(document).ready(function(){     var primary = $(".spinnerPrimary");     var secondary = $(".spinnerSecondary");     primary.spinner({         min: 7,         max: 20,         spin: //fancy code     });     primary.spinner("value", 10);     secondary.spinner({         min: -4,         max: 4,         spin: //same fancy code     });     secondary.spinner("value", 0);      function x() {         //fancy equation code     };      function y() {         //fancy equation code     };   In the above example, if the id is "x", then I want it to call function x(), id="y" calls y(), etc. I'm looking for how to do this specific scenario, not how to do it another way (running if/else based on known id's and corresponding function, for example). If the two alternatives I mentioned are the only way to do it, then so be it.   Duplicate of another question: very similar, but also needed help with mapping functions and applying them to spinner. Still new to jQuery, so was a multifaceted(?) question.

I have the name of a function in JavaScript as a string. How do I convert that into a function pointer so I can call it later?  Depending on the circumstances, I may need to pass various arguments into the method too.  Some of the functions may take the form of namespace.namespace.function(args[...]).


How would I go about proving this statement: $\mathbb{P}\left(A_{1} \cup A_{2} \cup A_{3}\right)=\left(\sum_{i=1}^{3} \mathbb{P}\left(A_{i}\right)\right)-\mathbb{P}\left(A_{1} \cap A_{2}\right)-\mathbb{P}\left(A_{1} \cap A_{3}\right)-\mathbb{P}\left(A_{2} \cap A_{3}\right)+\mathbb{P}\left(A_{1} \cap A_{2} \cap A_{3}\right)$   The probability space is $(\Omega,\mathbb{P})$ and for the upper equation applies $A_{i} \subseteq \Omega, i=1,2,3$  My idea is to reshape the LHS:  So we have  (i) $\left(\sum_{i=1}^{3} \mathbb{P}\left(A_{i}\right)\right)-\mathbb{P}\left(A_{1} \cap A_{2}\right)-\mathbb{P}\left(A_{1} \cap A_{3}\right)-\mathbb{P}\left(A_{2} \cap A_{3}\right)+\mathbb{P}\left(A_{1} \cap A_{2} \cap A_{3}\right)$   with   (ii) $\left(\sum_{i=1}^{3} \mathbb{P}\left(A_{i}\right)\right) = \mathbb{P}(A_{1}) \cup \mathbb{P}(A_{2}) \cup \mathbb{P}(A_{3}) $  (iii) $ \mathbb{P}(A_{1}) = \mathbb{P}\left(A_{1} \setminus A_{2}\right)  + \mathbb{P}\left(A_{1} \cap A_{2}\right)   <=>  -\mathbb{P}\left(A_{1} \cap A_{2}\right) = \mathbb{P}\left(A_{1} \setminus A_{2}\right) - \mathbb{P}(A_{1})$  same for $\mathbb{P}(A_{2})$ and  $\mathbb{P}(A_{3})$  Now we combine (i), (ii) and we get:  (iV) $\mathbb{P}(A_{1}) \cup \mathbb{P}(A_{2}) \cup \mathbb{P}(A_{3})-\mathbb{P}\left(A_{1} \cap A_{2}\right)-\mathbb{P}\left(A_{1} \cap A_{3}\right)-\mathbb{P}\left(A_{2} \cap A_{3}\right)+\mathbb{P}\left(A_{1} \cap A_{2} \cap A_{3}\right)$   Now we combine (iV), (iii) and we get:  (V) $\mathbb{P}(A_{1}) \cup \mathbb{P}(A_{2}) \cup \mathbb{P}(A_{3})+ \mathbb{P}\left(A_{1} \setminus A_{2}\right) - \mathbb{P}(A_{1})+ \mathbb{P}\left(A_{3} \setminus A_{1}\right) - \mathbb{P}(A_{3})+ \mathbb{P}\left(A_{2} \setminus A_{3}\right) - \mathbb{P}(A_{2})+\mathbb{P}\left(A_{1} \cap A_{2} \cap A_{3}\right) =  \mathbb{P}\left(A_{1} \setminus A_{2}\right) + \mathbb{P}\left(A_{3} \setminus A_{1}\right) + \mathbb{P}\left(A_{2} \setminus A_{3}\right) +\mathbb{P}\left(A_{1} \cap A_{2} \cap A_{3}\right)$  Now we use this equation:  (Vi) $\mathbb{P}(A \cap B)=\mathbb{P}(A \backslash B)+\mathbb{P}(B \backslash A)+\mathbb{P}(A \cap B)$  And finally we use (VI) on (V)  $\mathbb{P}\left(A_{1} \setminus A_{2}\right) + \mathbb{P}\left(A_{3} \setminus A_{1}\right) + \mathbb{P}\left(A_{2} \setminus A_{3}\right) +\mathbb{P}\left(A_{1} \cap A_{2} \cap A_{3}\right) = \mathbb{P}\left(A_{1} \cup A_{2} \cup A_{3}\right)$  Could this work? If yes i will get drunk today :)

I know that $$P\left(\bigcup_{i=1}^{n} A_i \right)$$   is the sum of of the probabilities of all the sample points that are contained in at least one of the $A_{i}$'s. This is the probability of sample points belonging to exactly 1 event, exactly 2 events, ...,exactly $n$ events. WLOG this can be written as $$P\left(\bigcup_{i=1}^{n} A_i \right) = P(A_1) + P(A_1 \cap A_2) + \cdots + P(A_1 \cap A_2 \cap \cdots \cap A_n)$$   But the $A_i$'s are arbitrary and we have to account for that. So there are $n$ possibilities for the first probability, $\binom{n}{2}$ possibilities for the second probability, ..., and $1$ possibility for the final probability. So we add and subtract these to prevent overcounting?


In my notification bar at the top of the page, there's a pretty rude comment about my question, but when I try to look at it, it's already been deleted. I'd really like to be able to respond to that comment (in a polite, professional manner, of course.) Is there any way I can see comments that have been deleted?

If moderators can view , can we see comments we've deleted? We can see our deleted answers, but why not our deleted comments?


I am having trouble with this question that appeared in my textbook. My first instinct is to try to use the theorem that states: if A, B are countable then A union B is countable.    The proof would then depend on showing that A is countable.  I want to construct a bijection from the Natural numbers to A but am not sure how. Are my thoughts so far correct? Thanks!

Ok, here is the problem statement:     Prove that if $S$ is any finite set of real numbers, then the union of $S$ and the integers is countably infinite.   This seems pretty obvious to me, knowing that 2 countable sets are countable.  But is there some step by step way to prove this?  Like do I need to prove bijectivity or something?  Thanks!


I do not have much experience in Python.  All I want to do is to insert elements in nested lists.I have two lists which seems to be similar but their behaviour is completely different.  list1 = [['a','b']] * 3 list2 = [['a','b'],['a','b'],['a','b']]   When I output print these two lists both give same output:  [['a', 'b'], ['a', 'b'], ['a', 'b']]  But when I try to insert elements in nested lists both do that in a different way. Below is the code for inserting elements in nested list.  list1 = [['a','b']] * 3 for item in list1:   item.append("Hello") print (list1)   This outputs  [['a', 'b', 'Hello', 'Hello', 'Hello'], ['a', 'b', 'Hello', 'Hello', 'Hello'], ['a', 'b', 'Hello', 'Hello', 'Hello']]  While when I define list in the following way it does exactly what I want.  list2 = [['a','b'],['a','b'],['a','b']] for item in list2:   item.append("Hello") print (list2)   This gives following output: [['a', 'b', 'Hello'], ['a', 'b', 'Hello'], ['a', 'b', 'Hello']].  Why are these two behaving differently?     list1 = [['a','b']] * 3     list2 = [['a','b'],['a','b'],['a','b']]

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


Check if the sequence $$\frac{1}{n}+\frac{1}{n+1}+...+\frac{1}{2n}$$ is convergent. I really don't know how to start.

What is the sum of the 'second half' of the harmonic series?  $$\lim_{k\to\infty}\sum\limits_{n=k+1}^{2k}{\frac{1}{n}} =~ ?$$  More precisely, what is the limit of the above sequence of partial sums?


I just want to know why the compiler allow to continue the program normally in the first condition:  public void ButtonOnClickDirectoryList(View v){     try {         if (!spnOptionSelectedDepartment.equals(null) && !spnOptionSelectedCities.equals(null)) {             if (!spnOptionSelectedTypes.equals(null)) { //code....}   the spnOptionSelectedDepartment and spnOptionSelectedTypes are Strings and are defined at the begining of the class like this:  private String spnOptionSelectedDepartment = null; private String spnOptionSelectedCities = null; private String spnOptionSelectedTypes = null;   so when I press the button, it call this method and this are the values that I have in the moment:  spnOptionSelectedDepartment = "9999" spnOptionSelectedCities = null spnOptionSelectedTypes = null   so when I put a break point on this condition it just continue validating the rest of the code inside that if... Could anybody explain me why this behavior?  Let me edit the question, Yes it throws nullpointer exception on the second if...  if (!spnOptionSelectedTypes.equals(null)) {   but why it allows the first IF when spnOptionSelectedCities = null...?

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


I am surprised that I wasn't able to find this question asked before, but I could see it used as quite an epic showing:  The old lady brings your group over to the mountain base filled with sharp cliffs, jagged rocks, and a path no wider than your foot. The roaring waterfall makes the air crisp, clean, and humid as she stops by a sign adorned with a bell and a rope, looping all the way up the mountain. Turning to your group with a kind smile, the guide pulls the rope and stands in wait. "Well, aren't you going to take us to him?" one of the players exclaim, annoyed at this old hag's smugness. Just as soon as the words escaped their mouth the bell rings, causing the granny's wrinkled face to beam with a smile.* "Oh, he's on his way sonny," She says pointing her knotted cane towards the top of the waterfall. As your party looks, there is a man falling what must be 1000 ft straight into the mouth of the waterfall, finally getting swallowed by the mist below. A second later, the man you have been searching for, the man who jumped down the waterfall, emerges from behind the waterfall, dry and unscathed.  Now though this seems quite epic, the way that the guy defied death was by using a teleporting spell when he was covered in the mist to reappear on the rock behind the waterfall. From what I understand , teleportation spells do not conserve momentum, so his falling speed would go from 20d6 damage to 1ft no damage. Is this truly how powerful teleportation spells can be?

If I fall off a cliff - say, 1000 feet - can I wait (readied action?) until I am near enough to the ground (my understanding is you fall 500 ft/round) then  safely to the ground? Or, does the momentum from the fall carry over through the teleport and I still splatter across the rocks?


I find as I play the game that time passes too quickly early on. I did some research and haven't found anyway to modify this. Can it be done?

Whenever I play Civ 5 I notice that it is fun in the beginning (expanding/building) and in the midgame (fighting) but then follows a very long boring endgame.  Unfortunately Civ 5 is by default configured such that the beginning (bronze age, early iron age) is over very quickly (apparently soldiers in the bronze age arrived at the gates of the enemy town centuries after the war began), the midgame is over still to quickly and the endgame (after 1500) takes forever. This is very annoying.  What will I have to change to fix this?


New Java learner here, working on Codecademy practices. I want to remove "ant" from an ArrayList, but my code doesn't remove it.     for(int i=0;i<lunchBox.size();i++){      if(lunchBox.get(i)=="ant"){        lunchBox.remove(i);  I looked at the solution and it shows     if (lunchBox.get(i) == "ant"){ lunchBox.remove(lunchBox.get(i)); i--;   I've read a little on the .remove() method but I can't seem to understand why my code won't remove that element. Thanks!


Okay, so I have a text box in my program where a user can enter a value, however I am wanting to call this value in another class.       public static void Main()     {          string sourceDirectory = @"F:\RootFolder\testingfolder\Test";         string targetDirectory = @"c:\targetDirectory"; //this is where the value would site           Copy(sourceDirectory, targetDirectory);     }   Not 100% sure on how to call this.  Edit After some much needed research I have found the below to work for me;      private void CopyInstallFiles(object sender, EventArgs e)     {         string sourceDirectory = @"F:somepath";         string targetDirectory = directoryImput.Text;        //Copy all the files & Replaces any files with the same name         foreach (string newPath in System.IO.Directory.GetFiles(sourceDirectory, "*.*",             SearchOption.AllDirectories))             File.Copy(newPath, newPath.Replace(sourceDirectory, targetDirectory), true);

I want to copy the entire contents of a directory from one location to another in C#.  There doesn't appear to be a way to do this using System.IO classes without lots of recursion.  There is a method in VB that we can use if we add a reference to Microsoft.VisualBasic:  new Microsoft.VisualBasic.Devices.Computer().     FileSystem.CopyDirectory( sourceFolder, outputFolder );   This seems like a rather ugly hack. Is there a better way?


I'm interested to know the processes involved in designing for large scale output i.e. billboards/ banners.   What Illustrator/ Photoshop document size should I work with. Do I work in a scaled size of the final output version? What resolution do I use? If I'm to use photographed images, what resolution should they be?  Would appreciate all the help I can get on this.   Thanks in advance. :)

(This question is meant to be a resource to direct others to given that this is a common question.)  Given the task of creating an image that will be printed at a certain size, what pixel dimensions and resolution should I be setting my file at?


I am updating UBUNTU 14.04 then machine is restart then after currect username and password not login successfully.What can I do???

I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution?


I run this command "sudo chmod -R 777 /" by mistake. After restart, the OS became very wired, no internet access, many things doesn't work, can't open any software...  is there any possible way to reset that! or undo this command?!

I accidently ran  sudo chmod 755 -R /   instead of  sudo chmod 755 -R ./   I stopped it after few seconds, but now there is some problems such as  sudo: must be setuid root   How can I revert permissions back?


How do I create DEM for contours after converting MapInfo tab files to ArcGIS and how do I convert toposheet tab file to ArcGIS?

How do I convert MapInfo TAB and/or MIF files to SHP using only free tools or ArcGIS itself?   I've not had much luck trying to do this in the past and I don't want to have to shell out for the ArcGIS Data Interoperability extension which seems to be the 'official' way to go about this.


I am trying to prove the inequality 3*(a^3+b^3+c^3) > (a+b+c)*(a^2+b^2+c^2)  where a,b,c are positive and unequal.  RHS = a^3+b^3+c^3+ab*(a+b)+bc*(b+c)+ac*(a+c)  so the inequality reduces to proving  2*( a^3+b^3+c^3) > ab*(a+b)+bc*(b+c)+ac*(a+c)  This is where I got stuck , how to prove this ? , please help.

Let $a,b,c$ be positive, not equal. Prove that $3(a^3+b^3+c^3) > (a+b+c)(a^2+b^2+c^2)$.  I know the proof by subtracting LHS by RHS and then doing some arrangement.  But isn't there any inequality which can be used in $(1+1+1)(a^3+b^3+c^3) >(a+b+c)(a^2+b^2+c^2)$, or an easy proof?


Why there is the requirement for derivatives no higher than second order in free quantum fields equations?   We can get the equations for the free fields of an arbitrary spin by using the requirements of linearity of the equations, derivatives no higher than second order. But why there is the second requirement? Is it connect with initial conditions $A_{\mu}(0), \partial^{\mu}A_{\nu}(0)$ for the field? For example, Schrodinger equation is first-order time-derivative equation, because we have the postulate that if we know the $\psi (\mathbf r , t)$ in the present, we know it in the future.

What is the reason for the observation that across the board fields in physics are generally governed by second order (partial) differential equations?    If someone on the street would flat out ask me that question, then I'd probably mumble something about physicists wanting to be able to use the Lagrangian approach. And to allow a positive rotation and translation invariant energy term, which allows for local propagation, you need something like $-\phi\Delta\phi$.  I assume the answer goes in this direction, but I can't really justify why more complex terms in the Lagrangian are not allowed or why higher orders are a physical problem. Even if these require more initial data, I don't see the a priori problem.  Furthermore you could come up with quantities in the spirit of $F\wedge F$ and $F \wedge *F$ and okay yes... maybe any made up scalar just doesn't describe physics or misses valuable symmetries. On there other hand in the whole renormalization business, they seem to be allowed to use lots and lots of terms in their Lagrangians. And if I understand correctly, supersymmetry theory is basically a method of introducing new Lagrangian densities too.   Do we know the limit for making up these objects? What is the fundamental justification for order two?


I'm trying to copy a table of data from a website into Google Sheets. The table includes a column whose numbers are preceded by +/-, e.g., +/- 33. Excel works just fine, allowing me to paste in the table, and it correctly interprets the column as text.  However when I paste into Google Sheets, it interprets this as a broken formula, showing #ERROR for each column, and issuing a Formula parse error. Is there any way I can paste a table and prevent sheets from converting the text to formulas?   Sample source data to copy and paste to duplicate the problem:  +/- 1 +/- 456

I'm having a bit of a struggle. I'm creating a spreadsheet which uses plus signs (+) regularly. I want a semi-permanent fix for +'s turning into addition formulae.


For a few days now I have been trying to install Ubuntu (also tried Fedora, BackTrack, and Kali) onto an 8GB usb drive. The install always seems to go off without a hitch. Ive used unetbootin, univeral usb installer, lili, and live usb creator. The installs come out without any errors and instructs me to restart and select boot from usb.  That never worked so the next step i took was to reinstall (several times) and tried altering my BIOS setting to rearrange my boot order, disable secure boot, and change to CSM boot mode. I even tried turning off usb 3.0 to see if that could be a compatibility issue.  If anyone has any insight into this issue I would be more than willing to offer all needed information.  My laptop: Toshiba Satellite P55-A running windows 8.1 on 64 bit

I tried to use the usb-creator.exe from Ubuntu 10.10 desktop i386 ISO image and it does create an USB stick that doesn't boot. When I try to boot from it I get:     Operating System not found.   I try to do this from Windows 7 x64. I'm not looking to create a live Ubuntu media, only an installation USB disk.  I repeated the process several times and I even tried to reformat the USB drive (FAT32), no success yet.  The USB stick is a 8GB one.


Using ghci 8.6.5  I want to calculate the square root of an Integer input, then round it to the bottom and return an Integer.  square :: Integer -> Integer square m = floor $ sqrt $ fromInteger m   It works.  The problem is, for this specific big number as input:   4141414141414141*4141414141414141  I get a wrong result.  Putting my function aside, I test the case in ghci:  > sqrt $ fromInteger $ 4141414141414141*4141414141414141 4.1414141414141405e15   wrong... right?  BUT SIMPLY  > sqrt $ 4141414141414141*4141414141414141 4.141414141414141e15   which is more like what I expect from the calculation...  In my function I have to make some type conversion, and I reckon fromIntegral is the way to go. So, using that, my function gives a wrong result for the 4141...41 input.   I can't figure out what ghci does implicitly in terms of type conversion, right before running sqrt. Because ghci's conversion allows for a correct calculation.   Why I say this is an anomaly: the problem does not occur with other numbers like 5151515151515151 or 3131313131313131 or 4242424242424242 ...  Is this a Haskell bug?

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


I tried google and searching this site, didn't get very good answers.  I'm running 14.04.1 LTS. I have multiple 3.5" internal drives in my system with very important data on them. I'm only using one of them for ubuntu. I installed ubuntu hoping I could use it to play and mess around, without worrying about hurting the rest of my system.   In windows you can go to device manager, right click an internal drive, and click disable. Is there an equivalent in Ubuntu? I want it so that nothing can access the drives in any way until I manually re-enable them.  Thanks!

I have dual OS (Windows 8 and Ubuntu), when I using Ubuntu, Windows partition Disks are automatically mounted in Explorer. I need to unmount permanently on every boot or permanently. I tried this in Gparted but when reboot it again mounted. Kindly Share your views.


I used to think it was only a British idiom.  But I read an article in the New York Times stressing how important tea was to the British army in Iraq. Apparently there is even a special attachment on a Challenger Tank for making a decent cup of tea. But the article was headed, punningly:  THE BRITISH TO A T.   Sometimes people will say of a child 'He is his father to a t'. Why a 't'?

The above phrase is something I've known for as long as I can remember, though I don't know from where. What is its origin and usage? Example: "While Android products aren't quite what I need, iOS devices fit my needs to a T."


In Harry Potter and the Philosopher's Stone, when Malfoy, Crabe and Goyle are going to fight Harry and Ron, why does Scabbers protect them? After it is later shown in Harry Potter and the Prisoner of Azkaban that Scabbers is in fact Peter Pettigrew who betrayed Potter's parents, why did he protect Ron and Harry?

When Malfoy, Crabbe and Goyle come into Harry and Ron's compartment, and Goyle tries to take a chocolate frog, Scabbers bites him:     Goyle reached toward the Chocolate Frogs next to Ron — Ron leapt forward, but before he’d so much as touched Goyle, Goyle let out a horrible yell.   Scabbers the rat was hanging off his finger, sharp little teeth sunk deep into Goyle’s knuckle — Crabbe and Malfoy backed away as Goyle swung Scabbers round and round, howling, and when Scabbers finally flew off and hit the window, all three of them disappeared at once.   -- Harry Potter and the Philosopher's Stone, Chapter 6   It is revealed in later books that     Scabbers is in fact Peter Pettigrew in his Animagus form.   Considering this, why would Scabbers bother going to the trouble of biting Goyle? Did years of being with the Weasleys make him somewhat loyal to them?


I'm witnessing a a directory which has for group owner "1002" ... However I do not have any group with such ID (verified with getent group | grep 1002 ).  Even history | grep groupadd gave nothing.  Where could that be coming from. Any '100x' group ID is a user ID if I'm right no ?

A file in a directory has a Group ID "501" After checking /etc/group, Group ID "501" was not found how is that possible ?


Let $M$ be a manifold with a $C^k$ atlas, $k\geq 1$. I was asked to show that the dimension $\dim M$ is well-defined on each connected component of $M$. I'm not sure if I misunderstood the meaning of being well-defined in question. To my knowledge, what I need to do is to prove any two coordinate domains must be homeomorphic to opens set in the same Euclidean space. And for connected components, it occurs to me that each point of $M$ belongs to a uniquely determined connected component of $M$, that is, $M$ is a disjoint union of connected components. Now I'm in trouble associating connectedness with homeomorphisms. Is there any useful topological property that I haven't considered, please? Thank you.

Currently, I am studying smooth manifolds and I want to solve some exercises. There is a question that says:  Show that the dimension of a connected topological manifold is defined without ambiguity! Meaning that if $\dim M=n$, with the change of charts, the dimension still is $n$. Then show that this is true for a $C^r$ connected manifold using Inverse Function Theorem.   To prove the first part, let $(U,\varphi)$ and $(V,\psi)$ be two charts with $\varphi(U) \subseteq \mathbb{R}^m$ and $\psi(V) \subseteq \mathbb{R}^n$ and suppose that $U \cap V \neq \emptyset$. Then, since $\psi \circ \varphi : \varphi (U \cap V) \rightarrow \psi (U \cap V) $ is a homeomorphism, $m=n$. Now, using this, if $M$ is a connected topological manifold with atlas $\mathcal{A}$, for all charts $(U_{\alpha}, \varphi_{\alpha})\in \mathcal{A}$, $\varphi_{\alpha}(U_{\alpha}) \subseteq \mathbb{R}^n$ and $n$ is constant for all the charts. Am I right?  But I have a problem showing the second part! I think that since every $C^r$ manifold is also a topological manifold, the answer to this question would be trivial! Why do we need "Inverse Function theorem" to answer it??  Any help is appreciated.


I have the following array  myArray = ["zell", "allen", 34, 223344, age , "Stree 45"]   i need to delete every position which be length less than 4  in this case the position 2 and 4  I wrote      for(var i=0; i<myArray.length; i++){         if(myArray[i].trim().length<3){         myArray.splice(i,1);          }     }   but works only with the first one, I need with every one  thanks

What is the difference between using  on the array element as opposed to using ?   For example:  myArray = ['a', 'b', 'c', 'd'];  delete myArray[1]; //  or myArray.splice (1, 1);   Why even have the splice method if I can delete array elements like I can with objects?


I have this in my command history:   280  ls -l | egrep -v '^d'   348  ls -l | egrep '^d'   375  git help ls-tree   376  git ls-tree   377  git ls-tree HEAD   378  git ls-tree HEAD^   379  git ls-tree HEAD system   380  git ls-tree HEAD system/   381  git ls-tree HEAD^ system/   460  ls   463  ls   464  ls /*   465  ls */   466  ls -d */   468  ls -d */   469  ls -d *  I can list all commands that end with / like this: history | egrep "/$"  But if I want to list all commands that start with ls, and I type this: history | egrep "^\s*\d*\s*ls"  It returns nothing. However, if I the output the text to a file and copy the output to regex101.com, then this regex correctly finds all commands that start with ls. Is there some other variable I need to use other than \s to identify whitespace in the output with egrep?

I wrote a regular expression which works well in a certain program (grep, sed, awk, perl, python, ruby, ksh, bash, zsh, find, emacs, vi, vim, gedit, …). But when I use it in a different program (or on a different unix variant), it stops matching. Why?


$\frac{-y}{x^2+y^2}dx+\frac{x}{x^2+y^2}dy$ is non exact differential equation.    Here above equation satisfies $\partial M/\partial y=\partial N/\partial x$.  I know that above equation doesnot exist for $(0,0)$ but. How to prove that above given is not exact?  I don't know to how to show above?  Any Help will be appreciated.

Please can someone verify my proof that $$\psi = {x dy - y d x\over x^2 + y^2}$$ is not exact? Here is my work: If $\psi$ was exact there would exist $f:\mathbb R^2 \setminus \{0\} \to \mathbb R$ such that $df = f_x dx + f_y dy = \psi$. Here $f_x = {-y \over x^2 + y^2}$ and $f_y = {x \over x^2 + y^2}$. It would hold true that $$\int f_x dx = \int f_y dy = f.$$ So I calculate these integrals: $$ \int f_x dx = -{1\over 2}\log(x^2 + y^2)$$ and $$ \int f_y dy = {1\over 2}\log(x^2 + y^2)$$ It is clear that these cannot be equal therefore $\psi$ is not exact. Edit The first thing I had tried (it did not work) was to calculate the integral along a closed curve: $$ \int_{S^1}\psi = \int_{S^1} {x \over x^2 + y^2} dy - \int_{S^1} {y \over x^2 + y^2} dx = \int_{S^1} x dy - \int_{S^1} y dx= x \int_{S^1}  dy - y \int_{S^1}  dx = 0$$ since $\int_{S^1}dx = 0$.


I am looking for an idiomatic word to describe what a deadbeat does of refusing repaying. In my country, this behavior is described as 'laizhang', literally means a person refusing to repay the money he owes intentionally. an example of it would be:     That deadbeat, he borrowed $1000 from someone last year and promised to repay it this year, but now he___, denying the loan he owes and trying to get away with it.    Is there a general word to say it in English? What do you call this behavior in daily life conversation? thanks.  edit: @1006a  I am looking for a word to specifically describe someone who can pay but won't in spoken English, I think that's a different request, thanks.

ie. Knowing that they have an unpaid debt, yet doesn't care.  I suppose "he is renouncing his debt" would be fine, but it doesn't seem to flow well.  "he is abandoning his debt" doesn't sound too good either, so are there any better alternatives?


I have a dictionary contains keys and values:  dic1 = {'first': 13, 'second': 7, 'third': 5}   I want to compare the values and select key with the largest number: The output should be:        'first'   here is my code:  import operator dic1 = {'first': 13, 'second': 7, 'third': 5} total = [k:max(dic1.values()) for k,v in dic1.items()]   but I got SyntaxError.. any help?

I have a dictionary: keys are strings, values are integers.  Example:   stats = {'a':1000, 'b':3000, 'c': 100}   I'd like to get 'b' as an answer, since it's the key with a higher value.  I did the following, using an intermediate list with reversed key-value tuples:  inverse = [(value, key) for key, value in stats.items()] print max(inverse)[1]   Is that one the better (or even more elegant) approach?


How can I edit the Hostname of my MacBook Pro via the CLI? Currently running Mac OS X Yosemite (Version 10.10.5).

I've got a handleful of macs (all with unique names) and on occasion it prompt a notice about saying another computer on the network as this name and adds a (2) or (3) to my mac.    How can I set the host name from the command line?


I am making a circuit using a 4 pin hall sensor with arduino. It turns out that the hall sensor outputs a negative voltage as output, which arduino cannot read, so I will need a PNP transistor, I don't have one but I have a bunch of NPN (BC547) laying around. Is there any way I can make a PNP transistor or add circuitry to make the NPN into PNP? Thanks in advance. For more info about the hall sensor, the first pin is +ve second is Normally open third is Normally closed and fourth is -ve   Turns out that I have a pnp transistor with my Snap Circuits kit. I cracked it open, soldered some wires and now, it looks like this  Take a look at my Schematic above and tell if I need another resistor or somethin

I have a circuit which requires a PNP transistor.  I only have an NPN transistor.  Is there a way to convert one to the other given that they have the same characteristics (apart from the npn/pnp part?)  And for others after me... can the reverse also be done? e.g. how does one convert a PNP transistor to its NPN equivalent?


I have the following problem. I am using the report document class to write my master's thesis. My table of content naturally extends to more than more line, and I have page numbers in the top right corner, except for the first page of each section.  The first page of the table of content does not have a page number (this is correct). The second page and on do have the correct page numbers, except that: on the second page, the page number overlaps on the top entry of the table of content. For example, the first entry in the table of content is:  2.6.4 This is the first line on this page........... 29   and the page number (iv) appears directly on top of the 29. How can I prevent this from happening? This doesn't happen on the next page, i.e. the v appears above the top entry and the same is true for page vi.  Here's the relevant part of my preamble:  \usepackage{fancyhdr} \pagestyle{fancy} \fancyhf{} \renewcommand{\headrulewidth}{0pt} \rhead{\thepage}  ...  \begin{document}  ...  \tableofcontents  ...  \end{document}

I am having trouble typesetting multi-line headers using fancyhdr The header on the first page behaves differently than the header on subsequent pages. The first page header has no depth, but produces a greater vertical displacement on subsequent pages.  Here is a sample tex file to illustrate the difficulty  \documentclass{article}  \usepackage{fancyhdr}  \chead{line 1\\line 2\\line 3\\line 4\\line 5\\line 6\\line 7\\line 8}  \cfoot{footer}  \fancypagestyle{plain}{}  \pagestyle{fancy}  \begin{document} \thispagestyle{fancy} page 1 \newpage page 2 \newpage page 3    \end{document}


I would like to bring this formula in the form Re(D) + jIm(D):    This is my current progress:    My question is:  How can I get rid of the imaginary part jωC2*R?  When the denominator is completely real I can just split up the formula and have an imaginary and a real part.

I have a mathematical problem with the following formula. The goal is to transform this equation to have a seperated real and imaginary part. I have already done this with several other equasions, but for this particualar one I don't know where to start.  I dont expect you to do the complete work of transforming for me, it would already be very nice if you could give me a hind on how you would start.  Thank you in advance!  C||RLC      This is my current progress:    My question is:  How can I get rid of the imaginary part jωC2*R?  When the denominator is completely real I can just split up the formula and have an imaginary and a real part.


for (Iterator<Integer> iter = clients.keySet().iterator(); iter.hasNext(); ) {     int key = iter.next();     String addresses="ZeeshanNisar";      java.net.Socket client = clients.get(key);     System.out.print("ok3");     InetAddress zee = client.getInetAddress();     String s = zee.getHostName();    // String s=client.getInetAddress().toString();     System.out.print(s);     if (zee.getHostName()=="ZeeshanNisar")     {         System.out.print("ok4");         dos =new DataOutputStream(client.getOutputStream());         dos.writeUTF("Some message");      }   This piece of code is to send the message for a specific client connected to the Server let suppose the client name is zeeshannisar  but in this my code isn't go to the if statement as there is no mistake as far as i think kindly help me.Sorry for my bad English.

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


I have sony-vaio E-series model SVE14A15FAP. it was windows7 pre installed but I upgraded to windows10. used for some time and I want to use it alongside ubuntu 15.04, but after a successful installation of Ubuntu 15.04, the boot option is not showing up.it boot straight to windows giving me no option.  Please help me

I have an Ubuntu 12.04 / Windows 7 dual boot. After installing Ubuntu my computer reboots straight to Windows. There is no option to boot Ubuntu.  Specs:   OS: Windows 7 Home Premium     CPU: Intel i5 2500k     mobo: ASUS P8Z68-V Pro     GPU: GeForce GTX 570      SSD: Corsair 120GB (Windows 7)     HDD: WD 1TB      I select the USB drive in the BIOS and boot to it and choose install. I select to manually configure partitions, partition the 200 GB of unallocated space on my 1 TB HDD into 16 GB swap file, 30 GB / ext4, and 154 GB /home ext4.   I made sure that the bootloader is installed on the Corsair 120GB SSD (where the Windows boot is) and the installation goes smoothly.  When I reboot after the install it runs through the BIOS straight into Windows. I have tried upwards of a dozen times and I have also tried with Linux Mint. I have also redownloaded the ISO and used two different programs to create the live USB.   The installation seems to have gone well, as after the installation I can see the partitions I have created in Windows Device Manager.       I currently run Lubuntu on my laptop, but it is not a dual boot. I'm assuming this is a bootloader issue and I am assuming that inside those partitioned files in my screenshot there is a working Ubuntu 12.04. I just have no way of getting to it.    Update: (copied from comment)  I booted using my Ubuntu live USB and used the Boot-Repair tool suggested in .   Upon opening the tool I saw that it was recognizing my SSD as a removable drive and defaulting to install on the HDD. Once I realized that I was able to force install onto the SSD. My computer can now boot Ubuntu.


I'm using QGIS to render some air quality modelling results.  I'm having issues with the OpenLayers Plugin whenever I have another vector layer active.  The plugin works if it's the only layer in the project, but displays the following error whenever I add another layer.  Has anyone else experienced this or know what to do?  An error has occured while executing Python code: Traceback (most recent call last):   File "C:/Users//.qgis//python/plugins\openlayers_plugin\openlayers_ovwidget.py", line 250, in __signal_webViewMap_loadFinished     self.__refreshMapOL()   File "C:/Users//.qgis//python/plugins\openlayers_plugin\openlayers_ovwidget.py", line 265, in __refreshMapOL     action = "map.setCenter(new OpenLayers.LonLat(%f, %f));" % self.__getCenterLongLat2OL()   File "C:/Users//.qgis//python/plugins\openlayers_plugin\openlayers_ovwidget.py", line 275, in __getCenterLongLat2OL     pntCenter = coodTrans.transform(pntCenter, core.QgsCoordinateTransform.ForwardTransform) QgsCsException: forward transform of (11049.424326, 84358.680211) PROJ.4: +proj=longlat +datum=WGS84 +no_defs +to +proj=merc +a=6378137 +b=6378137 +lat_ts=0.0 +lon_0=0.0 +x_0=0.0 +y_0=0 +k=1.0 +units=m +nadgrids=@null +wktext  +no_defs Error: latitude or longitude exceeded limits  Python version: 2.7.2 (default, Jun 12 2011, 15:08:59) [MSC v.1500 32 bit (Intel)]   QGIS version: 1.8.0-Lisboa Lisboa, 6416f38  Python path: ['C:/PROGRA~2/Quantum GIS Lisboa/apps/qgis/./python', 'C:/Users//.qgis//python', 'C:/Users/hamishh/.qgis//python/plugins', 'C:/PROGRA~2/Quantum GIS Lisboa/apps/qgis/./python/plugins', 'C:\\Windows\\system32\\python27.zip', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\DLLs', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\plat-win', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\lib-tk', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\qgis\\bin', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\site-packages', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\site-packages\\PIL', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\site-packages\\win32', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\site-packages\\win32\\lib', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\site-packages\\Pythonwin', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\Python27\\lib\\site-packages\\wx-2.8-msw-unicode', 'C:\\Users\\\\.qgis\\python\\plugins\\QuickMultiAttributeEdit/forms', '~/.qgis/python', '.', 'C:\\PROGRA~2\\Quantum GIS Lisboa\\apps\\qgis\\python\\plugins\\fTools\\tools']   Sorry for the long snippet, thanks for your help.

I'm aware the 'traceback' OpenLayers plugin error has been dealt with before, so apologies for raising the issue once again. Unfortunately for me, the solutions posted were way over my head, e.g. using workarounds and code posted on github, etc. I find it all mind-boggling.  If anyone could post a step by step answer for an absolute beginner like me I would be eternally grateful! Thank you. I hope that one day I can contribute something.  The error message reads:   An error has occured while executing Python code:  Traceback (most recent call last):   File "C:/Users/MCMA1580/.qgis//python/plugins\openlayers_plugin\openlayers_plugin.py", line 48, in addLayer     self.__plugin.addLayer(self)   File "C:/Users/MCMA1580/.qgis//python/plugins\openlayers_plugin\openlayers_plugin.py", line 190, in addLayer     self.__setMapSrsGoogle()   File "C:/Users/MCMA1580/.qgis//python/plugins\openlayers_plugin\openlayers_plugin.py", line 249, in __setMapSrsGoogle     extMap = coodTrans.transform(extMap, QgsCoordinateTransform.ForwardTransform) QgsCsException: forward transform of (0.884883, 2.549197) PROJ.4: +proj=longlat +datum=WGS84 +no_defs +to +proj=merc +a=6378137 +b=6378137 +lat_ts=0.0 +lon_0=0.0 +x_0=0.0 +y_0=0 +k=1.0 +units=m +nadgrids=@null +wktext  +no_defs Error: latitude or longitude exceeded limits


The way to calculate the first digits of $a^b$ is to compute the $log_{10} a$ and multiply by $b$, and find the fractional part. But if there are too many digits in the integer part of the result, then the digits after the point are inaccessible. By too many digits I mean enough digits to overflow a computer's memory. So this question boils down to, how many digits can be represented in a computer's memory?  The largest number I have ever computed the first digits of is $2^{2^{2^{32}}}$ which begins with 315921269337233843004... and has more than $9.34*10^{1292913985}$ digits. It took literally almost all my computer's RAM and 30 hours of my time to calculate.  Is there any hope of eventually finding the first digits of, say, $3^{3^{3^{3^3}}}$ at some point?

Which is the largest power of natural number that can be evaluated by computers? For example if we take a very large power of 7: $7^{120000000000}$. Can a computer calculate this number?


From what I have read, I know that the register keyword is almost always optimised by the modern compilers. Some sources claim that it shouldn't be used anymore, as the compiler will optimise the code better than the programmer in most cases.  Therefore I have these three questions:   Is tat keyword still being used in some applications?  How does GCC handle register keyword? If it has effect on the performance of my code, how can I investigate the use of register? (Can I see where it the register variable stored? Can I force the compiler the interpret the keyword the way I want declared the variable, without any optimisations?)

What does the register keyword do in C language?  I have read that it is used for optimizing but is not clearly defined in any standard.  Is it still relevant and if so, when would you use it?


What is the benefit of using HMAC over hash with key suffix? I realize that using key prefix is a bad idea because it allows message extension attacks. When adding key as a suffix such attack possibility is eliminated.  MAC = h(k||x) // key prefixing, bad idea MAC = h(x||k) // key suffixing, much better idea   HMAC uses double hashing presumably to prevent extension attacks. Why is it better than just simple key suffixing?  HMAC scheme:

If $H(m)$ is a secure hash function, can't we implement a MAC using $H(k\mathbin\Vert m)$?  However, it seems the more widely used MACs, such as NMAC and  (both originally defined in ) use a much more complicated scheme. Why is this concatenation scheme insecure?


I have a CSV file in the following format:  name, lat, lon, alt, time id1, 40.436047, -74.814883, 33000, 2016-01-21T08:08:00Z   I am trying to use Python to split the time into new columns so it looks like this:  name, lat, lon, alt, year, month, day, hour, min, sec id1, 40.436047, -74.814883, 33000, 2016,-01,-21, 08, 08, 00   I also want to set the amount of places in the float columns to always be set to 5 decimal places.  This is the script I have so far:  import numpy as np  name,lat,lon,alt,time = np.loadtxt(     'test_track.csv',     delimiter=',',     dtype='str',     skiprows=1,     unpack = True     )   year = time[0:3] print year   Unfortunately, instead of parsing the time into year, it prints out the first full times instead of just the year.

I've got a huge list of date-times like this as strings:  Jun 1 2005  1:33PM Aug 28 1999 12:00AM   I'm going to be shoving these back into proper datetime fields in a database so I need to magic them into real datetime objects.   This is going through Django's ORM so I can't use SQL to do the conversion on insert.


Hi I'm trying to sell a financed car. I have around 5k left to pay through Wells Fargo and and I'm selling the car for 10k. A few questions:  Q1: Do I still have to fill out a Bill of Sale and a Release of Liability of I'm financing the vehicle?  Q2: Are there any other paperworks I or the buyer need to fill out?  Q3: Also another question: Is this a safe and appropriate way to sell my car?   Receive the money from buyer into my bank account via wire transfer Make sure money is confirmed in my account and then release the car to buyer Pay off car to Wells Fargo (my financing company) After Wells Fargo receives my payment, I will have Wells Fargo send the lien and title to the buyer directly Seller and buyer handles everything with DMV   Thanks for all the help

I own a car personally, but it is mortgaged to a bank. I want to sell it to an individual. I haven't the funds to repay the loan until I'm paid for the car. The buyer doesn't want to pay me without a lien release (or guarantee that one is coming). The bank won't release the lien until it gets the funds. What do people do in a case like this? It must be a common case. What should I do?


When working with chocolate you often melt it down and let it harden in a new shape or on top of or around another ingredient.  What does it mean to "temper" chocolate

What is the purpose of tempering chocolate?  If I'm dipping something in chocolate, can I get by with just melting the chocolate?


Because he has reached a certain age, the boy learns what his job will be and he is sent to an old man who teaches him to feel emotions like happiness and also things like pain. Meanwhile his family, who, like the rest of the town, don't feel any emotions, have temporarily adopted a baby called Gabriel. At the end of the book he runs away with Gabriel to save Gabriel's life.

Things I remember about this book:   Every child was selected for a certain job/career; If twins were born, one was always killed; Seeing colors for the first time (describing the color of an apple); Seeing war and death and poverty.   Does anyone have any idea what this book might be?


I was going to ask , but I came to the conclusion that I'm not going to do it (asking and building).  Now my question is: why is it (usually, if we leave the silly high-end prices alone) more expensive to build a bike from scratch?


I have recently come across a statement in my book that,  "when a test charge is released at a point in an electrostatic field, the direction of traversal of the test charge will not be along the field line passing through the point at which the test charge is released." Why is this so?  Wouldn't the charge travel along the electric field line passing through the point?? Could someone explain my why the above mentioned statement is true ?

As we know that if we put any free test charge in an electric field which is moving horizontally then it will experience an repulsive force and move in that direction so by that we can say that for Straight lines the above statement is true that path followed by a free test charge in electric field represent the electric lines of forces which will be straight line. So we can say that it is TRUE.  But after that I read one exception case which states that the above statement is not true for Curved path.   Why is that so ? Means why it is for curved path and what is the exception ?Why it is not true?


I've seen some science\history documentary in which they made a replica of Galileo's inclined plane experiment.  They rolled a ball down the plane; and it's progressed in length units each unit of time was - 1, 4, 9, 16 etc. I realized it was squares of natural numbers; but I didn't really understand why this happens. I expected it to be exponential; as in - 1, 2, 4, 8, 16 etc.  I've checked a few more videos since; and now I understand that this progression is "time squared". That makes sense; but I still don't exactly understand why it works this way.  Also in some other video, which is a segment from some science show, they said the ball suppose to roll - 1, 3, 5, 7 etc. Did they just got it wrong?  So why does it work this way - time squared; and what other basic things in physics progress this way; can you give some examples? What about energy needed to accelerate mass?

Galileo discovered that the distance fallen is proportional to the square of the time it has been falling.Why is it proportional to the square of the time and not just time? i.e $d \propto t^2$ why not just $d \propto t$  I know this question involves some common sense which i'am not able to use for some reason!


I downloaded  Java 8 from oracle.com, and  I installed it. Nothing unusual. But when I type java I get: No Java runtime present, requesting install. And if I go to settings the java icon is there!

Even though JRE 8 is installed on my MAC OS Yosemite 10.10.3,while running the Android present in tools in sdk - the error - " No Java Runtime present,requesting to install " gets displayed in terminal- how do i solve this issue?  I wanted to install Xamarin test recorder - after installing they asked me to install Android sdk SDK is downloaded in Library/Developer/Xamarin/android-sdk Now when I run Android present in tools folder - I get the error - No Java run time I've installed JRE 8 with get the verified java version from their site Can someone please help!!


I am looking to apply a tile image to various walls in a room.   I have the following result where the tiles seem to be distorted based on the object dimensions, so that (for example) six inch tiles do not appear as such on all surfaces. Can I not reuse the same Material slot on all objects? (note that while the captured image shows the planes to be contiguous, there are not contiguous -- the tile should always start at says the lower left corner)

I have 3 separate planes that are contiguous and have a common material.  I have applied a noise texture which I later want to use for displacement.  However, the noise texture shows up on the seams, it has clearly been stamped on each of the objects from the same origin point, as can be seen in the first image.    Is it possible to make this seamless?  For example, if I do the same thing with the wave texture, it goes across the objects seamlessly, as below.    Thanks


\documentclass[10pt]{article} \begin{document} Hello World! \end{document} i have just started to learn LaTeX in ubuntu by TeXmaker.. I was going through a beginners tutorial and I tried following...  I am very new to this .can someone tell me about a good reference to  learn latex.

At the moment I'm having a problem when trying to view my LaTeX file as a PDF. Whether I do it internal or external I both the error "File not found.".  I have no idea what file it means. I've read somewhere it has to with my Acrobat Reader, but I still can't get it fixed. And I think it's worth mentioning that I work on Windows 7, as I've also read that Texmaker on Windows has some bugs.  Any help will be appreciated!


I am new to QGIS (ESRI shop at work). I am attemping to concatenate fields in the label expression  field1 = number field2 = number   label expression I tired but fails  str(field1) + " - " + str(field2)   it says its not valid. This would work in ArcMap... how is it different?

Is there a way to concatenate fields in field calculator of QGIS? (e.g. hectares + ' ha')


In the Unearthed Arcana "Feats for Races", the Dragonborn feat "Dragon Fear" states (emphasis mine):     Instead of exhaling destructive energy, you can roar and expend a use of your breath weapon to force each creature of your choice within 30 feet of you to make a Wisdom saving throw...   Now, I know this is only Unearthed Arcana and not "official rules", but the wording of this, to me, implies that it's possible for Dragonborn to have multiple uses of their Breath Weapon. However, reading the PHB about Dragonborn, they can only use it once per rest (I can't remember if it's short or long rest, I don't have the PHB in front of me, but it's irrelevant to my question).  So, according to either official rules or other Unearthed Arcana articles, is there a way for Dragonborn to be able to use their Breath Weapon more than once per rest?

Even though the Player's Handbook says a dragonborn only gets one breath weapon per short rest, is there any way outside of rule 0 for a dragonborn to gain multiple uses per short rest, like by using a spell or magic item?


I need a rechargeable battery pack for my project, I need to know what is the minimum charging current for NCR18650 li-ion battery?  In the datasheet, it says max charge current is 2A. what is the minimum charge current?  I use tp4056 module for charging, I can change the charging current   is 300mA to 600mA ok for charge current? will it damage the battery or affect badly for a battery lifetime?  Delaying in charging time is not a problem for my application .

I am using NCR18650 batteries with the tp4056 charging module.  When I connect the charger at 2.8 V (fully discharged), the tp4056 IC is getting hot at a 1 A charge current. Is it OK to reduce this charge current by changing the charge current selecting resistor? So the tp4056 IC heat would be reduced, wouldn't it?  For my application I don't need a quick charge. With a low current, charging time will be increased, but it does not matter for my application.  Will reducing the charge current affect the battery's lifetime? Or will it damage the battery?  I am trying to reduce the heat of the tp4056 IC by reducing the charging current, maybe from 1 A to 500 mA or less. The 18650 battery never heats for a 1 A charge current.


The sentence is this:  “two of the people I met were a sweet couple who wanted to move to the countryside.”  I have two questions.   Do I match “were/was” to “two of the people I met” or to “a sweet couple”?  If I need to match to “a sweet couple” do I take the couple as a single entity and use the singular case or do I need to consider the couple as more than one and use the plural case?

I have recently read both:  couple is getting married couple are getting married  So which is actual usage?


I usually think that . But when I read the book  recently, there is a section says that postincrement is prefered than preincrement in for loop. Because, as I quote, "preincrement introduces a data dependency into your code -- the CPU must wait for the increment operation to be completed before its value can be used in the expression." Is this true? (It is really subverted my idea about this problem.)  Here is the quote from the section in case you are interested:     5.3.2.1 Preincrement versus Postincrement      Notice in the above example that we are using C++’s postincrement operator,   p++, rather than the preincrement operator, ++p. This is a subtle but sometimes important optimization. The preincrement operator increments the contents of the variable before its (now modified) value is used in the expression. The postincrement operator increments the contents of the variable after it has been used. This means that writing ++p introduces a data dependency into your code -- the CPU must wait for the increment operation to be completed before its value can be used in the expression. On a deeply pipelined CPU, this introduces a stall. On the other hand, with p++ there is no data dependency. The value of the variable can be used immediately, and the increment operation can happen later or in parallel with its use. Either way, no stall is introduced into the pipeline.      Of course, within the “update” expression of a for loop (for(init_expr;   test_expr; update_expr) { ... }), there should be no difference between   pre- and postincrement. This is because any good compiler will recognize that   the value of the variable isn’t used in update_expr. But in cases where the   value is used, postincrement is superior because it doesn’t introduce a stall   in the CPU’s pipeline. Therefore, it’s good to get in the habit of always using   postincrement, unless you absolutely need the semantics of preincrement.   Edit: Add "the above example".  void processArray(int container[], int numElements) {     int* pBegin = &container[0];     int* pEnd = &container[numElements];     for (int* p = pBegin; p != pEnd; p++)     {         int element = *p;         // process element...     } }  void processList(std::list<int>& container) {     std::list<int>::iterator pBegin = container.begin();     std::list<int>::iterator pEnd = container.end();     std::list<inf>::iterator p;     for (p = pBegin; p != pEnd; p++)     {         int element = *p;         // process element...     } }

We have the question   What's the answer for C++?


How to use getters and setters? Semi question: How to create structure to easily retrieve data?  After setting the data in setter I can't retrieve it from the getter.  The structure is as follows:   Interaction - parent class with getters and setters                                              Dictionary, CategoryInteraction, WordsInteraction - subclasses    Here is my code:  public class Dictionary extends Interaction {      private String resource = "/home/kjlk/IdeaProjects/Jdf/src/fdf/res";     private File resourceFile = new File(resource);     private Scanner scanner;     private LinkedHashMap<Integer, String> categories;      public void getCategoriesFromDictionary() {         Interaction interaction = new Interaction();         try {             scanner = new Scanner(resourceFile);         } catch (FileNotFoundException e) {             e.printStackTrace();         }         categories = new LinkedHashMap<>();         int categoriesCount = 1;         while (scanner.hasNextLine()) {             String line = scanner.nextLine();             if (line.startsWith("_")) {                 categories.put(categoriesCount, line);                 categoriesCount++;             }         }         scanner.close();         setCategories(categories);     } }  public class Interaction {      private LinkedHashMap<Integer, String> categories;       public LinkedHashMap<Integer, String> getCategories() {         return categories;     }      public void setCategories(LinkedHashMap<Integer, String> categories) {         this.categories = categories;     } }  public class CategoryInteraction extends Interaction {      public void printCategories() {         LinkedHashMap<Integer, String> categories = getCategories();         for (Integer key : categories.keySet()) {             System.out.println(key + ": " + categories.get(key));         }         System.out.println();     } }   I'm getting NullPointerException for:  LinkedHashMap<Integer, String> categories = getCategories();   Thank you in advance! Please do not refer me to answers for NPE! The idea points to the working structure.

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


So I googled it and I just don't understand the last part. The question problem is as it follows. what is the result if the cron is as follows:  0  2   12   *   0,6    /usr/bin/test   Am I confused at the last 0,6 part since that's supposed to be the year?

I want to schedule a task to run on a regular basis and have heard that Cron is the way to do this.  How do I add Cron jobs in Ubuntu?


I use this command everytime I login because the screen is just too bright.    xrandr --output HDMI-A-0 --brightness 0.90   How can I make this command run on startup? I use Kubuntu 19.10.  Thanks.

How can I run the following xrandrcommand on startup?  xrandr   cvt 1368 768  xrandr --newmode "1368x768_60.00"   85.25  1368 1440 1576 1784  768 771 781 798 -hsync +vsync xrandr --addmode VGA1 1368x768_60.00 xrandr --output VGA1 --mode 1368x768_60.00


Prove that if $d$ divides $n$, then $2^d  -1$ divides $2^n  -1$.  Use the identity $x^k  -1 = (x-1)*(x^{k-1}  +  x^{k-2}    + \cdots + x +1)$


I am using Ubuntu 12.04 LTS. I was trying to install Windows8 but at the partition selection I get this error "  We couldn't create a new partition or locate an existing partition   But I had installed windows several times from this media before and it worked fine. I think I am getting this error because I have Ubuntu 12.04 already. I want to dual boot with windows 8. How can I achieve that?

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


So every here and there, a webpage with the url "" will open on my computer.  This happens maybe once a day (I haven't really been recording it, but that's my estimate).  (I recently reinstalled Windows, and it's been there since the beginning)  So I'm trying to figure out the cause.  Things I've considerred:   Of course, I've gone through all autoruns.exe entries and couldn't find anything suspicious. I'm familiar with all processes, services, tasks, etc. I'm using Google Chrome as my default browser. Since Chrome manages it's own processes for each new tab, I can't get any meaningful information from the tab process parent PID.  (I think this is what most or all modern browsers do) Using procexp.exe, I've searched for parts of the URL in the memory strings of anything that might have something to do with it, but to no avail. I have found some similar questions online, but nothing that has gotten me closer.   The only thing I can think of is, that it might have something to do with KMSpico, which I have installed.  Although, I've has this installed before and currently have it on other computers, but  never came across this issue.  Any other ideas?

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


I'm confused about the resistance of superconductors. It is known that the resistance at the the critical temperature goes exactly to zero (the resistance is not very small, its really zero, right?). But in a superconducting state, not all electrons form Cooper pairs right? so why then is the resistance exactly equal to zero? Greetings

It is known that a superconductor is a material with electrical resistance zero. My question is, it is exactly zero, a theoretical zero, or for practical realistic reasons it is effectively zero?


Find the limits (without Stirling's approximation ) : $$\lim_{n}( \frac{1\cdot3\cdot5\cdot \cdot \cdot(2n-1)}{2\cdot4\cdot6 \cdot \cdot \cdot (2n)} ) =?$$   My Try : $$\frac{1\times 3\times 5\cdots \times(2n-1)}{2\times 4\times 6\cdots \times(2n)}=\frac{(2n)!}{4^n(n!)^2}$$ now what ?

How can I show   $\lim_{n \to \infty} a_n = 0$  $a_n = {1.3.5 ... (2n-1)\over 2.4.6...(2n)}$  I have shown that $a_n$ is monotonically decreasing. I thought to shown sequence is bounded from below then it automatically would converge and hence my question will be solve. But I'm unable to show its boundedness... Or there maybe another method to prove this. Thanks


I found a Christmas Village building that has a motor rated at 12V AC 1.5-2W. What power-supply/adapter do I need to power this motor? It seems I can find many 12V adapters, but all would over power the 1.5-2W motor. Am I thinking about this wrong? Would a 12V AC 500ma power-supply at 6W be too much for the motor? Thanks.

Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.


How to move a text more to the left in a frame in beamer? because It seems that when compiling the text make a space to the right by default and I have tried the \hspace but didn't work (it only worked to move the text to the right but not to the left). I have written                                \begin{frame}                               \begin{itemize}                               \item 1                               \item 2                               \end{itemize}                               \end{frame}

I need help for modifying the margins for only one slide in the beamer class   In other words, I need a local version of   \setbeamersize{text margin left=<size>,text margin right=<size>}    in here  \documentclass{beamer} \usetheme{Rochester} \usepackage{lipsum}  \setbeamersize{text margin left=5pt,text margin right=5pt}  \begin{document}  \begin{frame} \lipsum[2] \end{frame}  \end{document}


I had a plan to visit Italy on a company trip. Got the visa from the Italian embassy but unfortunately, the company has now changed plans to visit the Netherlands. The company says I can travel to the Netherlands with this visa but won't be visiting Italy at all. But my visa also mentions that I need to report back to the embassy after travel. I am confused as in what to do as I don't have time to apply for the Netherlands visa also. Will this have any issue for my next visas?

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


which is the best way to set already defined int to null?  private int xy(){     int x = 5;     x = null; //-this is ERROR     return x; }   so i choose this  private int xy(){     Integer x = 5;     x = null; //-this is OK     return (int)x; }   Then i need something like :  if(xy() == null){     // do something }   And my second question can i safely cast Integer to int?  Thanks for any response.

I was reading  when I came across  saying something about a particular type of programmer knowing the difference between an int and an Integer in Java/C# (Object-Oriented Programming Languages).  So, what is the difference?


I am new to Linux and am not a supergeek.  You cannot drag things on to the desktop with Ubuntu 16.04.1 like you can in Windows 7.  I would like to create a shortcut to .  How can I do that?

How can I create a shortcut for URL in my desktop? I want to use them in Firefox or Chrome.   If a copy and paste didn't work.   What script I have to use?


How to check whether an image is packed or not in python? for i in bpy.data.images:     if i.is_packed() :  ????         do something  In  , pack() and unpack() is an action on image. packed_files looks promising, but it lacks examples.

I'm trying to know if a blend file contains images and if it contains to unpack the images out to the directory. So just before I'm running this line: bpy.ops.file.unpack_all(method='USE_ORIGINAL')  to ask if this blend file is with packed images.


The domain of a function $f$ is the set of natural numbers. The function is defined as follows: $$f(n)=n+\left\lfloor\sqrt{n}\right\rfloor$$ where $\lfloor k\rfloor$ denotes the nearest integer smaller than or equal to $k$ Prove that for every natural number $m$ the following sequence contains at least one perfect square $m, f(m), f^2(m),f^3(m),\ldots$. The notation $f^k$ denotes the function obtained by composing $f$ with itself $k$ times e.g $f^2 = f\circ f.$  I tried this out using induction but I got stuck and couldn't make it. Please help me with this problem.

There's a problem statement:     For each $m \in \mathbb{N}$, we construct a sequence $m_0$, $m_1$, $m_2,\dots$ denoted $S_m$, recursively via $m_0=m$ and      $$m_{i+1} = m_i + \left\lfloor \sqrt{m_i} \right\rfloor$$      for all $i \ge 0$.   Here, $\lfloor x \rfloor$ is the floor of $x$, the greatest integer less than or equal to $x$.   Hence, we have $\left\lfloor \sqrt{10} \right\rfloor=3$ and $\left\lfloor \sqrt{29} \right\rfloor=5$.      Show that for each positive integer $m$, the sequence $S_m$ contains the square of some integer.   I'm pretty certain that this can be proved with induction. I am just not quite sure what to induct on. Examining examples shows that $S_m$ always results in a perfect square eventually, though I'm not sure how to prove it.


So I was faced by this problem: If $p,q \in K[x]$, with $q = q_{0}^{\alpha_{0}} \dots  q_{m}^{\alpha_{m}}$, all of $q_{i}$ irreducible and $\alpha_{i}$ natural numbers. So, there is some $p_{0} \dots p_{m} \in K[x]$ where $$ \frac{p}{q}=\sum_{j = 0}^{m}\frac{p_{j}}{q_{j}^{\alpha_{j}}}. $$  So, at first sight, it looks a lot like the partial fractions decomposition, which we use a lot in Calculus, but I can't prove this. Any help, I will be appreciated. Thanks in advance!

I am looking for a general rule to be able to decompose into partial fractions all expressions of the form:  $\frac{P(x)}{Q(x)}$  where $P(x)$ is a polynomial of degree $p$, and $Q(x)$ is a polynomial of degree $q$, such that $p<q$ $\forall$ $\{p, q\} \subset \mathbb{N}$  An attempt at doing this is already  but it is not a general rule, more a collection of cases.


I have several static IP Addresses in Google Cloud Platform in the zone europe-west3. However, I just noticed that they all are traced back to California, US, which totally defeats the purpose. They should resolve to Frankfurt!  It is not the same with south-eastasia static IP which correctly resolve in Singapore.   Why is it different with the europe ones? I have privacy complaints for customers now. Google support seems to be rather unavailable.

I am new to both Google Cloud Platform and K8s. I have launched Kubernetes cluster in GCP and chosen europe-north1 as the region (europe-north1-a as the zone).   When I try to run my application on this cluster it fails because it expects the application to run in EU region. I added IP and Geo check (using GeoLite database () and AWS IP check tool ()) into my application and they tell me that the host is located in US.  Have I perhaps missed some GCP/K8s configuration option or is this because the europe-north1 region is still quite new and the IP addresses do not correctly show that they are located in EU? In which case I should direct this question to Google?


my Biber don't creates the bbl file anymore. One week before everything worked just fine. I tried to install a fresh TeXLive (2020) distro on my laptop, but it doesn't work either. With TeXLive 2019 (which was installed on my laptop) it doesn't work either (error: ifluatex.sty not found). If I put the file manually in the folder the output is the same as with TeXLive 2020. I've already reviewed this posts and tried the solutions (spoiler: they're not working):          My System:  Windows 10x64 2004 19041.388 pdfTeX 3.14159265-2.6-1.40.21 (TeX Live 2020/W32TeX) biber version: 2.16 BibTeX 0.99d (TeX Live 2020/W32TeX) biblatex 2020/12/31 v3.16 Sublime Text 3.2.2 3211 LaTeXTools st3-4.0.0-alpha.9  MWE: \listfiles \documentclass{article}  \usepackage{biblatex} \addbibresource{ref.bib} \begin{filecontents}{ref.bib}     @Article{Foo,       author = {Guy, Some},       title  = {Some Title},       year   = {2021}     } \end{filecontents}  \begin{document}     This is a test.\cite{Foo}     \printbibliography \end{document}  I run pdflatex bib.tex biber --debug bib pdflatex bib.tex pdflatex bib.tex    Summary: biber --cache don't do the trick Changing the TEMP/TMP user-environment variables don't do the trick either. Tex-file is located in a non-special-character folder. With second machine it's not working either. Removing and (re)installing the biber package doesn't did the trick. Updated the whole TeXLive installation with tlmgr update --self --all --reinstall-forcibly-removed C:\Temp\mwe>kpsewhich biblatex.sty c:/texlive/2020/texmf-dist/tex/latex/biblatex/biblatex.sty

I am on a Mac with MacTex 2020 and ran into a strange problem with Biber. Working on a document all was fine, I did not change the bibliography (says my git) and only fixing typos (not even adding cites) and suddenly latexmk stopped working after a Biber run, while that looked like  INFO - This is Biber 2.14 INFO - Logfile is 'doc.blg' INFO - Reading 'doc.bcf' INFO - Found 31 citekeys in bib section 0 INFO - Processing section 0 INFO - Globbing data source 'literature.bib' INFO - Globbed data source 'literature.bib' to literature.bib INFO - Looking for bibtex format file 'literature.bib' for section 0 INFO - LaTeX decoding ... INFO - Found BibTeX data source 'literature.bib'   so harmless in my view. Then with --debug I additionally get in the end.  INFO - LaTeX decoding ... warning: overriding existing definition of macro "jun" warning: overriding existing definition of macro "jul" warning: overriding existing definition of macro "sep" warning: overriding existing definition of macro "jan" [...] warning: overriding existing definition of macro "nov" INFO - Found BibTeX data source 'literature.bib' Unicode::UCD: failed to find unicore/version in /var/folders/hm/gt63cn0j2r7bwbzw7c1hww1r0000gn/T/par-626572676d616e6e/cache-2f8a664c3c933a44d096bcc8d018a5e92bced897/inc/lib /var/folders/hm/gt63cn0j2r7bwbzw7c1hww1r0000gn/T/par-626572676d616e6e/cache-2f8a664c3c933a44d096bcc8d018a5e92bced897/inc CODE(0x7fd026aeb5a8) CODE(0x7fd026aebb90) at /var/folders/hm/gt63cn0j2r7bwbzw7c1hww1r0000gn/T/par-626572676d616e6e/cache-2f8a664c3c933a44d096bcc8d018a5e92bced897/inc/lib/Biber/Input/file/bibtex.pm line 1011.   It seems unrelated to the library itself since deleting a few entries (going through deleting one half, then the other), the problem persists. It does not happen for an empty literature, but as soon as a first entry is added (just author/journal/title/year/volume/pages - no utf8-only chars) this error message appears.  what does this last error message mean?  How can I solve this?


I publish .  It was signed with a 4096-bit GPG key, and has been merrily in use from Debian 7 and Debian 8 systems for some time.  Recently, one of my users reported that Debian 9 was having problems with it.  Specifically, apt-get update was yielding: Reading package lists... Done    W: GPG error: . stable InRelease: The following signatures were invalid: A71733F3CEBD655CB25A0DDCE1E3A497555CE68F    W: The repository '. stable InRelease' is not signed.  Note that unlike the people at "" and "" I am not using aptly.  So clearly I am not suffering from an aptly bug of any kind.  (-:  So what is the problem?

Attempting to upgrade testing/stretch Debian Linux:  $ sudo apt update  Ign:1 http://dl.google.com/linux/talkplugin/deb stable InRelease Hit:2 http://dl.google.com/linux/talkplugin/deb stable Release                                                                    ... Get:25 http://mirror.vorboss.net/debian unstable/main i386 Packages 2016-03-25-1456.28.pdiff [15.0 kB]              Fetched 686 kB in 7s (89.5 kB/s)                                                                                Reading package lists... Done W: gpgv:/var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release.gpg: The repository is insufficiently signed by key 4CCA1EAF950CEE4AB83976DCA040830F7FAC5991 (weak digest) W: gpgv:/var/lib/apt/lists/deb.opera.com_opera_dists_stable_InRelease: The repository is insufficiently signed by key 419D0ACF314E8E993F7F92E563F7D4AFF6D61D45 (weak digest) W: Failed to fetch http://dl.google.com/linux/talkplugin/deb/dists/stable/Release  No Hash entry in Release file /var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release, which is considered strong enough for security purposes E: Some index files failed to download. They have been ignored, or old ones used instead.  What's wrong? How to fix it?


I use Ubuntu 18.04 in VMWare station pro 14, but the Settings don't seem to work properly.   I cannot add a network proxy I cannot turn off screen lock (the button cannot turn off) I cannot change the background pic or lock the screen pic from the settings.   What's the problem and how can I fix it?

I am new to Linux with Ubuntu 18.04 LTS as of this morning.  Anyone else experienced the inability to change privacy settings upon installation? I.e. I can tap the toggle switch to the "off" position for "automatically empty trash" but the toggle immediately bounces back to the "on" position. This is the same for all other privacy settings. I have Gnome Shell 3.28.2


I have Dell Laptop that is 15 5567 7th Generation. So it was maybe pre-installed as Dell says and I can see in the product information that this laptop is Ubuntu built in and based not Windows.  So I want to get my Ubuntu OS again. How can I do that?

I would like to see a full how-to guide on how to install Ubuntu.


What is the advantage and use of measuring an angle is radian(s) compared to degree(s)? My book suddenly switched to radian(s) for measuring an angle in this grade and I do not know why.

I have learned about the correspondence of radians and degrees so 360° degrees equals $2\pi$ radians. Now we mostly use radians (integrals and so on)  My question: Is it just mathematical convention that radians are much more used in higher maths than degrees or do radians have some intrinsic advantage over degrees?  For me personally it doesn't matter if I write $\cos(360°)$ or $\cos(2\pi)$. Both equals 1, so why bother with two conventions?


Now Ubuntu 14.04 is released and I upgraded my system a few days ago. One major change was the introduction of a new version of apt. Fortunately, it is possible to do the most common task by just writing apt and the necessary command e.g. install.  Unfortunately, there is still one feature missing from the older apt-get: Auto-Complete. When I type sudo apt and press Tab it suggestes all files in my current directory. Also, if I type sudo apt install dcon and press Tab, nothing happens. Doing the same with sudo apt-get install dcon will invoke the suggestions to install different packages beginning with dconf.  Is there a possibility to enable the auto-complete in apt?

The new  command, present in Ubuntu since 14.04, seems to be a really useful intersection of functionality between apt-get and apt-cache but the current version of bash-completion doesn't know about it... Which makes it a lot harder to use.  Is there a quick way to add this functionality to Bash to make the apt command easy to use?


Something that has never happened to me.  Brewed early Sunday and hit 80+% efficiency.  I used Wyeast London Ale that was fully bloated when pitched.  Over 36 hours later zero activity.  No krausen, No air lock movement...nada.    It is a heavier beer (1.080) and I did not have time for a starter so it is possible that the yeast is working but not enough to show anything visable.  I am going to check the gravity when I get home, but in case nothing changed what is the best course of action?  Should I buy another Wyeast pack?  Dry yeast?  etc?

Made a kit on Saturday, 1/2 lb. Caramel 80 specialty grain, 9.15 lbs rye extract. Kit came with the Wyeast American Ale smack pack. When I got the yeast pack out of the fridge, the pack was already smacked, so to speak. The inner sugar pod had already been breached at some indeterminate time, and so the yeast had eaten and gassed, etc. Since I had no idea when this had happened, I figured I was better off using some of the dry yeast I had on hand. So, I pitched 1 packet of Safale-05 Saturday around 5PM.   Sunday went by, blowoff tube was quiet, and I started thinking one packet wasn't going to be able to deal with 1.075 SG. Sunday night I went to my fridge full of jars, pulled out the jar of S-05 culture, made 2 pints of starter with a half cup of dextrose and poured that in Monday morning. Before opening the bucket lid to add the starter Monday morning, the blowoff tube was burping a little bit, so I figured the extra yeast would make sure everything got going great. Since then, silence. No activity as far as I can tell. It's pretty cool where the bucket is, air temp around 64, and the bucket was sitting on the tile/concrete floor. So I put it in a tub this morning and filled it up with 65 degree water. Did I pitch 32 oz. of infection/disaster into a fermentation that was doing ok? Or is the cool temp keeping things from getting going?


This is part of a small project we're doing and I get stuck in this part when executing the original program. Changing the values to be integers seems to solve it but I need them as rational numbers. I really don't understand what I'm doing wrong.    void main() {         float potencia;         printf("\nInsira a potencia contratada (em kVA):");         scanf_s("%f", &(potencia));         while (potencia != 3.45 || potencia != 4.6 || potencia != 5.75 || potencia != 6.9 || potencia != 10.35 || potencia != 13.8 || potencia != 17.25 || potencia != 20.7);         {         printf("\nPotencia inserida nao disponivel, insira uma das seguintes: 3.45, 4.6, 5.75, 10.35, 13.8, 17.25, 20.7 ");         scanf_s("%f", &(potencia));         }  }

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


I need to analyse questionnaire survey data with mixed data types (nominal, ordinal, continuous). I want to cluster the variables. So far I only have dead ends.    I know I can use daisy in the cluster package to cluster the cases, but I want to cluster the variables.  lots of cluster procedures like ICLUST can cluster variables but they don't allow nominal data types.   The only thing I can think of is to split up the categorial variables into binary dummy variables, standardise everything, and then apply ICLUST.

I need to use binary variables (values 0 & 1) in k-means. But k-means only works with continuous variables. I know some people still use these binary variables in k-means ignoring the fact that k-means is only designed for continuous variables. This is unacceptable to me.  Questions:     So what is the statistically / mathematically correct way of using binary variables in k-means / hierarchical clustering? How to implement the solution in SAS / R?