From the Wikipedia article on :     Relationship with the Ramones      Linda originally dated Joey Ramone but later dated and married Johnny Ramone. Stories conflict whether Joey and Linda had broken up prior to Linda dating Johnny or if Linda left Joey for Johnny.    Why had broken up should be "whether  Linda and Joey broke up before she dated with Johnny"? In this sentence what comes first the dating then the breaking up that is the problem, I think! I have found the answer to my question: past perfect is used as something that had not arrived yet but was going to happen.

I have never had this problem before. But after seeing some questions posted on ELU, I started to doubt. I have been through links1, pages of grammar books2, a lot of questions3 posted here and ELU. I now still can't seem to understand how the past perfect is exactly used. The references sometimes even contradict each other.  What I had understood so far was      The past perfect is not necessary if we are not 'going back' to the earlier past, and simply moving from one event to another.   but I then saw a lot of other 'rules' including      If the sequence is clear, the past perfect is not needed.   which is slightly different, less 'narrow' and can be applied in more situations than the first ruleA, and      The past perfect is optional only when talking about an action at a specific time.   This is confusing. Can anyone here clarify things out please?    A For example, for  Doing the survey [completed] -> Showing the result      We showed the result of the survey we did.      If the second rule is applied, the sentence above is fine (the sequence is clear), but not if the first rule since we are not moving from any event to the next and possibly even going back.    1  and   2 Practical English Usage (2005) by Michael Swan, Collins Cobuild Student's Grammar (1991). Upper-Intermediate Cutting Edge.  3 including , , ,  etc.


Wikipedia  that the half-life of Uranium-$235$ is $7.038 \times 10^8$ ($\text{703 800 000}$) years. This is very long. Therefore, on a human time scale, the decay is very small, posing difficulty for determining the half-life. So Who and how was the half-life calculated?

If a radioactive material takes a very long time to decay, how is its half life measured or calculated? Do we have to actually observe the radioactive material for a very long time to extrapolate its half life?


i tried to install mysql with this command   sudo apt-get install mysql-server   but it dosen't work   sudo apt-get install mysql-server-5.5 Lecture des listes de paquets... Fait Construction de l'arbre des dépendances        Lecture des informations d'état... Fait Aucune version du paquet mysql-server-5.5 n'est disponible, mais il existe dans la base de données. Cela signifie en général que le paquet est manquant, qu'il est devenu obsolète ou qu'il n'est disponible que sur une autre source Cependant les paquets suivants le remplacent :   mysql-common:i386 mysql-server-5.7:i386 mysql-server-5.7 mysql-common   mysql-testsuite-5.7:i386 mariadb-server-10.1:i386 mysql-testsuite-5.7   mariadb-server-10.1 mysql-server-core-5.7:i386 mysql-server-core-5.7   percona-xtradb-cluster-server-5.7:i386 percona-xtradb-cluster-server-5.7  E: Le paquet « mysql-server-5.5 » n'a pas de version susceptible d'être installée   is-there a solution ?

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


I am new at html coding. I have been needing help with making a div in the middle of another div. Can anyone help me please.

         Get Coupons!

   I want promo to be in the middle of wrapper. How do I tell code to make it center. I have tried class = "center" but it doesn't work. I have tried style="center" but it doesn't work.  Please. thanks

How can I horizontally center a
 within another
 using CSS?

Foo foo


Can you target an illusion from Major Image with Magic Missile? The spell  has been used to create the illusion of a creature.  A character does not know it is an image and attempts to cast  at it. What happens when the character attempts to cast magic missile targeting the illusion?

says:     You create three glowing darts of magical force. Each dart hits a creature of your choice that you can see within range.    says:     You create the image of an object, a creature, or some other visible phenomenon....   If one caster creates an illusory creature with silent image what happens when another caster targets that illusory creature with magic missile?  Assuming of course that the mm caster is shooting first and asking questions later, ie, rather than using his or her action to investigate the illusion is simply choosing to attack it.  Or I suppose the magic missile caster might have failed the investigation check.  Either way, the magic missile caster believes the illusion to be real.  My own inclination would be to rule that magic missile would in fact appear to hit the illusory creature, but I can't find much to either support that conclusion, or to support another.


When I try to use a while loop it won't follow the conditions I set in the while. Like if I put while s1 != "n") it will continue even if s1 = n. It does the opposite when I try to use while s1 == "y") and it very irritating. I'm trying to make a factorial calculator that prompts the user if they would like to keep going or stop.  Here's the full code:  package factorial;  import java.util.Scanner;  public class Factorial {      public static void main(String[] args) {     int factorial = 1;     int number = 6;     int i = 1;     String s1 = "y";      Scanner keyboard = new Scanner(System.in);  while(s1 != "n") {     System.out.println("Enter an N:");     number = keyboard.nextInt();     while(i <= number) {         factorial *= i;         i++;     }     System.out.println("Factorial = "+factorial);     System.out.println("Would you like to continue? (y/n)");     s1 = keyboard.next(); } keyboard.close(); System.out.println("Have a nice day!"); } }

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 going to frame this question in terms of a pdf and quantile functions for the size distribution of income, because that is where I have currently encountered it, but similar questions in quite different contexts have puzzled me on several occasions in the past.  Suppose I have a pdf f(x) or a CDF F(x) that represents the size distribution of income. Income is a flow of money (dollars or some unit of currency), per some unit of time, to particular individuals. I therefor think the proper unit of measurement is dollars per person-year.   In order for the probability to come out in dimensionless units, f(x) must be measured in person-years per dollar. Integrating this over x also yields a dimensionless share for the CDF because the units of an integral are the product of the units of the integrand f(x), here measured in person-years/dollar, and of the differential dx, here measured in dollars/person-year.  Integrating xf(x) therefore puts the units on the mean income in $/person-year; this seems reasonable.  From this I have drawn conclusions on the units and interpretation of the quantile density function q(y), quantile function Q(y), and the integral of yq(y)dy (i.e. the the inverse function analoge of the partial moment function of order 1) which if correct would be very helpful to me, but in which I have limited confidence. I’d be grateful if someone could confirm or deny these conclusions, perhaps in the context of some discussion/explanation of interpretation of dimensional analysis in the the context of distribution functions.  I believe the units of the y axis and of q(y) are necessarily the same as those in the previous analysis, i.e. the y values are still measured in person-years per dollar and x = q(y) is still measured in $/person-year. This implies that integrals of q(y) over some interval in general, and Q(y) (which is equal to the integral of q(y) from 0 to y) in particular, are both measured in unitless shares. I am somewhat dubious of this and my earlier conclusion, however, because I believe that F(x) is in unitless shares of total income, while Q(y) is in unitless shares of the population for a year. This seems odd to me, however, as I wonder if the fact that these two shares are shares of different things should not be reflected in the units.  Finally, this would have the integral of yq(y)dy in units of person-years per dollar. But I am having trouble interpreting this. The corresponding x quantity is the mean (or for a bounded x, the partial mean) of income per person-year. So this would be the mean number of person-years--for what? for a single dollar? for the mean income?   Consider the truncated version of this function, where the integral of yq(y)dyfrom zero to q* is divided by F(q*). The corresponding truncated function of x yields the mean for those with incomes of x* or less, and $/person-year seems like reasonable units for a mean income. But I want the the y version to come out in number of people, or number of person-years, corresponding to the share of person-years over the same interval, and the "per dollar" in the denominator does not have an interpretation which is obvious to me.

On the , there is this line:      $p(\mathrm{height}|\mathrm{male}) = 1.5789$ (A probability distribution over 1 is OK. It is the area under the bell curve that is equal to 1.)    How can a value $>1$ be OK? I thought all probability values were expressed in the range $0 \leq p \leq 1$. Furthermore, given that it is possible to have such a value, how is that value obtained in the example shown on the page?


I realize this gets reported a fair amount but I've searched as much as I can and nothing appears to be helping. After doing an update last night, I logged in today and cannot see the launcher or menu bar. When I open a terminal window, the title bar at the top is cut off, so I suspect that there might be something scaling-related. It could be:   that the launcher and menu bar are no longer there    the launcher and menu bar are there, but beyond the borders of the laptop screen.   When I get to the login screen, I can see the menu bar with the time, battery display, wifi, etc.  When I log in to a guest account, the launcher and menu bar appear.  Here are the things that I've tried so far:   sudo apt-get update sudo apt-get install --reinstall ubuntu-desktop sudo apt-get install unity sudo shutdown -r now  sudo apt-get install dconf-tools dconf reset -f /org/compiz/ setsid unity   (when I run these steps, I get a brief resize of the desktop, then it seems stuck on "unity7 start/running, process 8299") mv ~/.config ~/.config_backup  rm -rf .compiz-1  sudo apt-get install dconf-tools dconf reset -f /org/compiz/ setsid unity  dconf reset /com/ubuntu/user-interface/scale-factor  sudo apt-get install dconf-editor dconf-editor   open path com -> ubuntu -> user-interface cannot change the scale factor, it doesn't allow me to enter a numeric value unity --reset (screen briefly resizes, then goes back to "normal")  initctl restart unity-panel-service  The steps given here:  although I don't get the dialog boxes about "resolving conflicts"   Everything has been followed with a reboot.

When I login, nothing happens.   I am presented with my desktop wallpaper.    No Dash, no Launcher, nothing.


I have a problem using dynamic types to instantiate a custom class. Example, I have the following class:  public class myClass<T> {     public myClass(String header); }   If I use the following code, everything works fine:  var myInstance = new myClass<int>("myHeader");   However, I am in a position I don't have the int type defined, so I need to dynamically cast it from a generic type parameter. What I tried so far:  1.      Type myType = typeof(int);     var myInstance = new myClass<myType>("myHeader");   2.      int myInt = 0;     Type myType = myInt.GetType();     var myInstance = new myClass<myType>("myHeader");   In all examples I get the following error:     The type or namespace name 'myType' could not be found (are you missing a using directive or an assembly reference?)   The reasons I cannot use int directly is because I am loading the types from specific assemblies at runtime, so they will not be "int" at all times.

The title is kind of obscure. What I want to know is if this is possible:  string typeName = <read type name from somwhere>; Type myType = Type.GetType(typeName);  MyGenericClass<myType> myGenericClass = new MyGenericClass<myType>();   Obviously, MyGenericClass is described as:  public class MyGenericClass<T>   Right now, the compiler complains that 'The type or namespace 'myType' could not be found." There has got to be a way to do this.


In MySQL I have create db with name "test" and one table with name "table". Table have one column name: "A" and set as datatype INT(1).  In Python I have this code:  import MySQLdb db = MySQLdb.connect(host="localhost",                  user="root",                  db="test")  cur = db.cursor()  myList = [1,2,3,4] for row in myList:    print row    cur.execute("INSERT INTO table (a) VALUES (%s)" % row)   Goal from code above is after loop is finish my table "table" shoud have data like this:  |A| |1| |2| |3| |4|   But my table is empty after refresing. So my question is how to insert into table from loop in Python  Tnx

I'm having some trouble updating a row in a MySQL database. Here is the code I'm trying to run:  import MySQLdb  conn=MySQLdb.connect(host="localhost", user="root", passwd="pass", db="dbname") cursor=conn.cursor()  cursor.execute("UPDATE compinfo SET Co_num=4 WHERE ID=100") cursor.execute("SELECT Co_num FROM compinfo WHERE ID=100") results = cursor.fetchall()  for row in results:     print row[0]  print "Number of rows updated: %d" % cursor.rowcount  cursor.close() conn.close()   The output I get when I run this program is:     4Number of rows updated: 1   It seems like it's working but if I query the database from the MySQL command line interface (CLI) I find that it was not updated at all. However, if from the CLI I enter UPDATE compinfo SET Co_num=4 WHERE ID=100; the database is updated as expected.  What is my problem? I'm running Python 2.5.2 with MySQL 5.1.30 on a Windows box.


How can I download folders from ~/Library/Mobile Documents/ ?  I see that I have 10 gigabyte of files saved in the cloud as WhatsApp backup. I want to download that to my desktop. I know it is located in e.g. /Library/Mobile Documents/42T9237FN3~net~whatsapp~WhatsApp/Accounts/<98798799897>/backup  But I can only see meta files of type .icloud there on desktop. I need to fetch the whole folder and all backup files to my desktop for further investigation. Any idea?

I have WhatsApp set up on my iPhone with iCloud backup. I don't want my WhatsApp media polluting my Photos stream, so I've disabled "Save to camera roll", as I didn't see a way to keep WhatsApp images/video separate to my own photos.    How can I access this backup and see the contents? I don't want to restore to a new phone, I want to actually view the content (specifically I want to import the videos and images into Lightroom).    I've tried searching Google but there are so many spam articles from people offering dodgy apps I don't see any data on my Macbook in iCloud Drive I do see the WhatsApp data in my Macbook iCloud settings pane when I click "Manage" in the bottom right corner. This storage screen shows 1.3Gb of WhatsApp data but only lets me delete the data, not access it.     How can I get access to my data?


Say we have a dictionary that contains a list of words:  temp = {"1": "hello", "2": "goodbye", "3": "hello", "4": "goodbye", "5": "hi"}   I need help figuring out how to compare the values of each key. I understand I need to iterate through each but I can't figure out how to compare values of "1" to "2", and so on.  Output should be:  "1" == "3" "2" == "4" "5" ==  Thanks in advance.

I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe?


There is a game that I really like to play when I was young. But there are some features that are not implemented that would be cool.  How can I find copyright database from games editor ?

Most games build on other games' successes and many are downright clones. Where is the limit of imitation before legal issues come into play? Is it down to literary or graphic work like characters and storyline that cause legal problems, or can someone actually claim to own gameplay mechanics?  There are so many similar clone games out there that the rules are probably very slack or nonexistent, but I'd like to hear the views of more experienced developers / designers.


I have read that it is possible to determine the value of a single digit, say the 874th of $\pi$. I know that it is a trascentental number, how is that possible?  How many ways are there to determine the value of $\pi$? What is the simplest?

Since Pi or $\pi$ is an irrational number, its digits do not repeat. And there is no way to actually find out the digits of $\pi$ ($\frac{22}{7}$ is just a rough estimate but it's not accurate). I am talking about accurate digits by either multiplication or division or any other operation on numbers.  Then how are the first digits of $\pi$ found -     3.1415926535897932384626433832795028841971693993...   In fact, more than 100,000 digits of $\pi$ are found (sources - )  How is that possible? If these digits of $\pi$ are found, then it must be possible to compute $\pi$ with some operations. (I am aware of breaking of circle into infinite pieces method but that doesn't give accurate results.)  How are these digits of $\pi$ found accurately? Can it be possible for a square root of some number to be equal to $\pi$?


This is Chapter 3, Exercise 2 of Rudin's Principles.  Calculate $\lim\limits_{n \to \infty} \sqrt{n^2+n} -n$.  Hints will be appreciated.

Possible Duplicate:          Could someone help me through this problem?  Calculate $\displaystyle\lim_{n \to{+}\infty}{(\sqrt{n^{2}+n}-n)}$


I started learning Blender the other week and was following a tutorial to learn the basics of it. When I opened Blender back up, every object I bring in is invisible in object mode, and the material preview mode is completely broken. Edit mode works just fine. I have no clue what's happening, any help would be appreciated.  Selected in object mode.  Deselected in object mode.  Selected in edit mode.  What happens when I move around my camera in material preview mode.

I don't know why but now, when i go in material preview or rendered (in solid mode it works fine), my object is entirely gray, or invisible idk, because it has the same color of the background. I've been working for days on this project without having this issue, it suddenly showed up. I tried opening other old projects and suddenly they all do the same so i guess it is some blender program setting that applies for all the projects, but idk how it happened cuz i didn't change anything :/, anyone got any tips?


I am looking for a broader, fatter Computer Modern and I already found out that the only way to do this correctly is to use MetaFont to create a different version of Computer Modern.   The idea is now to find a good and matching MetaFont File for my purposes and to generate a TrueType Font from it to be able to use this font via LuaLaTeX. I am working on OS X so there is no way to automatically let FontForge correct the font output by mf2pt1 and I have no knowledge whatsoever on MetaFont, typography and so and so forth, apart from that I don't have the time to fiddle with the files just by trial and error, there are just too many parameters that concern the font weight for this.   My question: Has anyone here ever dealt with this problem and maybe already came up with a solution in the form of a working MetaFont File? The results I get are very shitty to be honest, often I have big artifacts because of strange intersections and new nodes.  What the result should optimally look like is something like this:    Please don't care too much for the language being german, it's just a document I tried it on.  Any help would be highly appreciated.

I'm trying to find a good way to have the LaTex default font "Computer Modern" (CM) a bit thicker (also called "blacker"). I really like this font, especially when it comes to math mode, so answers like "Change the font." don't qualify, sorry. :) The only problem is that CM has very thin lines, so the font looks very light. There are several methods to make CM "thicker" (I'm not talking about the bold series of the font! This one looks different and is not what I am looking for.) which can be found elsewhere on tex.stackexchange:  1) Use FakeBold in XeLaTex:   2) Use pdfliteral as suggested here:   3) Use pdfrender as suggested here:   However, the answers given there don't suit here: 1) Needs XeLaTex (I only have PDFLaTex and I cannot install additional software, as I'm not a system administrator.) Results produced with 2) + 3) look very good. Actually it looks exactly like I intend it to be. However, it only looks good with certain Reader software (Evince and certail versions of Okular). With other Reader software (like other versions of Okular or even the Adobe Reader) the base line of characters is not quite the same or there are white artefacts inside the letters.  I think, the only option to resolve the problems is to create a proper font. (The solutions in 2) and 3) don't create a new font, they are hacks that manipulate the way the original CM font is displayed.) And here is my question: How do I create a "vectorbased" (not pixelbased) proper font from Computer Modern which has the same "thickness" attributes like the results obtained with pdfrender/pdfliteral in 2) and 3) ? I don't really know anything about fonts. The basic idea should be to take the original CM font and to do some adjustments to its geometry. There is a German post:    There they talk about a "blacker" parameter in a "metafont source file" of CM. However they produce a pixel-based font and I'm not exactly sure what they are actually doing there.  Upshot: I'd like to have a thick (not bold) CM-like font which looks good with any reader software and it should be usable with PDFLaTex. Thanks for your help.    To give you an impression what I have in mind: Here's a (famous) article whose "oldschool" look I try to resemble with a modified CM font:    I've magnified it and compared it with my own "pdfliteral" results and my conclusion is that it is indeed a thicker CM (probably due to the fact that it was printed and scanned afterwards as is indicated by the not quite horizontal text lines on some pages).  I now get an idea of how to clearify my question: Using METAFONT, how do I create a new font from the original CM metafont source files () but with a higher blackness parameter?


I'm connecting a router to my laptop in Ubuntu 12.04, and for some reasons it shows it as eth3. My program is hardcoded asa eth1. I was wondering how I can change it to eth1.

As my built-in NIC was not supported by Ubuntu out-of-the-box I was forced to use a USB NIC for temporary installation-time Internet connection.  And the USB NIC has taken the eth0 name making the built-in NIC to become eth1.  Sure, this doesn't really matter but just for the system "prettiness" I would like eth1 to become eth0 letting any newly attached NIC to become eth1.  Is this possible?


My employer is planning a transition to Lightning Experience in the coming months, so I have been learning to develop LWCs and practicing with real projects. I am wondering if it is possible to add those components I have developed to a Visualforce page for use in our org before we roll out Lightning to our users. If so, what is best practice?

I am writing a lightning web component that is going to be used in Salesforce Classic, Lightning Experience and an Employee Community. It does not HAVE to be a lightning web component - I could use a traditional Aura Lightning Component if I must.   However, what I am finding is that the visualforce page does not work, even when the lwc component is embedded in a aura component that is then used with Lightning Components for Visualforce. I can see from the documentation  that using a lwc directly from within visualforce is not supported, but I was under the impression that it may work if wrapped in an aura component.   My question then is this:  Has anyone had success having a lwc wrapped in an aura component display successfully within Visualforce? Or is this completely unsupported behaviour?


I'm making a program that takes in an input of lets say: 3H 4C 8S 2D 4H a poker hand with a three of hearts, four of clubs etc.   I have a card class and each card has a rank and suit which are both defined as enums. These are the methods I use in the Card class:      // METHOD TO GET CARDS IN RANK ORDER     public static Card[] getHand(String[] args){         Card[] hand = new Card[5];         for (Rank r : Rank.values()) {             int j=0;             for (int i = 0 ; i < args.length ; i++) {                     if(r.rankNum().equals(args[i].substring(0,1))){                             hand[j] = new Card(r, Card.getSuit(args, i));                             j++;                     }              }         } return hand;     }      // METHOD TO GET SUIT     public  static Suit getSuit(String[] args, int i) {             for (Suit s : Suit.values()) {                     if (s.suitCode().equals(args[i].substring(1,2))) {                             return s;                     }             } return null;     }   In the main I do the following:  // TEST CARD ARRAY AND CARD PRINT Card[] handTest = new Card[5]; handTest[0] = new Card(Rank.TWO, Suit.CLUBS); handTest[1] = new Card(Rank.TWO, Suit.CLUBS); handTest[2] = new Card(Rank.TWO, Suit.CLUBS); handTest[3] = new Card(Rank.TWO, Suit.CLUBS); handTest[4] = new Card(Rank.TWO, Suit.CLUBS); for (int i = 0 ; i < 5 ; i++){     handTest[i].printCard(); }  // TRY WITH ACTUAL ARGUMENT INPUT (3H 4D 7C 2D 8S) Card[] hand = new Card[5]; hand = Card.getHand(args); for (int i = 0 ; i < 5 ; i++){     hand[i].printCard(); }   I get the following output   Suit: CLUBS   Rank: TWO Suit: CLUBS   Rank: TWO Suit: CLUBS   Rank: TWO Suit: CLUBS   Rank: TWO Suit: CLUBS   Rank: TWO Suit: SPADES   Rank: EIGHT Exception in thread "main" java.lang.NullPointerException at Poker.main(Poker.java:20)   If I have the printCard method within the innermost loop of getHand, I don't get errors but its after the getHand method has run that I get the null pointer exception.  I have now read some posts explaining null pointer exceptions but I cannot seem to fix this. Line 20 refers to hand[i].printCard();

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?


In Blade Runner, Gaff is a rather dark, mysterious figure, who throughout the film, lays down 3 pieces origami - a paper chicken, a matchstick man, and a unicorn made of gum-wrappers. The unicorn is a subtle hint at Deckard being a replicant all along, but what did the other two represent?  Now, just to recap, Gaff puts down the chicken in the scene where Deckard refuses to help Bryant with the case. This makes partial sense to me, as Gaff was trying to imply Deckard was chickening out, although this seems very implausible. He puts down the matchstick man after Deckard investigates Leon's house. Deckard seems to gaze at it in confusion, or maybe even recognizance like he did with the unicorn.  I'm gonna make the bold claim that people are so invested into the unicorn that they easily ignore the two predecessors. What do these two creations in particular represent?  [FACT: Neither of these two origami was in the original script by Fancher and Peoples.]

Throughout Blade Runner we see Gaff (Edward James Olmos) making origami figures at various points in the movie. He makes a chicken, matchstick men and at the end of the film there is a unicorn waiting outside Deckard's apartment.    There is a   of  out there regarding the unicorn in particular, and how it indicates that Deckard is a replicant. I think an answer regarding the use of origami in general will be interesting new ground to cover.  Why origami? What does the origami represent in Blade Runner?


I wish to set a custom color for the hostname portion of my command line prompt (in bash).  In my .bashrc file, the default command line prompt is:  PS1='[\u@\h \W]\$ '   To colorize the hostname only, I came up with this prompt:  PS1='[\u@\e[40;36m\h\e[0m \W]\$ '   I used different colors for each host I work on. The colorizing part seems to be working as expected. However, with the prompt above, navigation on the command line becomes dysfunctional. For example, at times I cannot move the cursor to the beginning or end of the line. If I switch back to the default prompt, everything works correctly again.  What's wrong with my colorized prompt? How can I properly specify a color for the hostname only?  It should not matter for this question, but I'm running Arch Linux KDE and I work in Konsole.

I have an issue where if I type in very long commands in bash the terminal will not render what I'm typing correctly. I'd expect that if I had a command like the following:  username@someserver ~/somepath $ ssh -i /path/to/private/key myusername@something.someserver.com  The command should render on two lines. Instead it will often wrap around and start writing over the top of my prompt, somewhat like this:  myreallylongusername@something.somelongserver.comh -i /path/to/private/key  If I decide to go back and change some argument there's no telling where the cursor will show up, sometimes in the middle of the prompt, but usually on the line above where I'm typing.   Additional fun happens when when I Up to a previous command. I've tried this in both gnome-terminal and terminator and on i3 and Cinnamon. Someone suggested it was my prompt, so here that is:  \[\033[01;32m\]\u:\[\033[01;34m\] \W\033[01;34m \$\[\033[00m\]  Ctrll, reset, and clear all do what they say, but when I type the command back in or Up the same things happens.  I checked and checkwinsize is enabled in bash. This happens on 80x24 and other window sizes.  Is this just something I learn to live with? Is there some piece of magic which I should know? I've settled for just using a really short prompt, but that doesn't fix the issue.


This is a tv-series made in the 70's in West Germany.  The plot is a man that senses that everything is not as it seems, he feels like everything is a computer simulation. There are people after him trying to prevent him from discovering the truth. A woman is helping him.  Spoiler tags might not be needed but the ending is:      It turns out he is right. His mind has been projected into a simulation while  he is beeing cured of a disease. They try to prevent him of discovering the  truth to prevent his mind from harming itself.

In this movie there are scientists who (spoilers ahead)       ...are creating a simulation. One scientist starts seeing odd looking characters but no one else sees them. He asks around and more and more characters are missing or don't know about the characters in the story he knows about.  He finds out that he is part of a simulation. He finds out that the characters only he remembers have been deleted. He also finds out that there are characters from his own simulation that have broken free of his simulation and are in his world.    Hints: I remember this being an older film (70's?); it might have been foreign film possibly with subtitles (not Hollywood); it might have been part of the Criterion collection; I'm pretty sure I streamed it from Hulu. Sorry, I can't remember more details.


If we have the set A with $\#A=5$, how much graphs can be made over   A?   The solution says $2^{5^2}$, that is exactly the same number of binary relations on A. I initially thought that the solution would be: $2^\binom 52$, but i was worng.   Any tip about counting graphs would be appreciated.

In the following the graphs are assumed to be undirected and simple.  1.Enumerate the number of non-isomorphic graphs on $n$ vetrices where $n$ is fixed.  Here are some ideas I had:  The number of labeled graphs is $ 2^{\frac{n(n-1)}{2}} $.  So it is enough to find the number unlabeled graphs on $n$ vertices.I have no idea for this.  2.Enumerate the number of non-isomorphic graphs on $n$ vertices and $m$ edges where $n,m$ are fixed.   Can we find a closed formula for each of this?  Any help?   Thank you!


On the website I often click on a tag in a question to read up on more questions about that tag and sometimes the tag wiki.  Currently, clicking a tag in the Android app searches for that tag, but does not provide access to the wiki.  Please provide somewhere to access the wiki summary / more info (full wiki) via the app.

Another part of my daily  on SE sites.  When viewing a question and it's time to move on, I'll often simply click one of the tags in the question to bring me back to a list of questions with that tag.  This doesn't work in the Android app.  Obligitory screenshot.  I tried to draw a finger that looked like it was tapping a tag, but it ended up looking like, well...  something else, let's say.


I alternatively live in two different places, a few month in Europe and then a few months in Asia. In both places I have an iMac with OSX version 10.8.5  I started by copying the complete content of one of the iMacs to the other one; so at that moment they were identical. Now I will be in Europe for some time and work on my machine there.   Once I move back to Asia, what can I do to make my iMac there identical to the one I just left in Europe and vice-versa ?

I have a Macbook and an iMac, generally I work on my Macbook, but sometimes I need that information on my iMac. My OS is Mac OSX Snow Leopard.


Old story involving a man who acquires an anti-hallucigen and peels one drug-induced illusion after another from his world:   New cars become old cars, then clunkers, and finally people pretending to drive cars while running down the street Fancy restaurants become dirty dives before dissolving into places where food is dispensed through feeding tubes.   I think it may be by P.K. Dick—it reminds me of his short story .

I am looking for a story about the future of mankind, in which most people have been enslaved in a virtual reality. It ends with the revelation that the people are just lying there imagining their lives with their heads in a trough of feed.  It explains that chemists began to create compounds that could be released into the air to manipulate citizens - causing them to live, shop, think as desired by whoever was in charge. Eventually these tools got subtle enough that they could simulate reality using just these airborne compounds.  This was clearly a prescient view of what later became computer-based virtual reality fiction.


I believe GROUP BY in SQL would make DISTINCT unnecessary because if you group by a column then there will only be one of each value in the result, but I want to make sure I am understanding the keywords correctly. Is it the case that you would not need to do this:  SELECT DISTINCT a_uuid FROM table GROUP BY a_uuid HAVING NOT bool_or(type = 'Purchase')   because you could just drop the DISTINCT completely?

I learned something simple about SQL the other day:  SELECT c FROM myTbl GROUP BY C   Has the same result as:  SELECT DISTINCT C FROM myTbl   What I am curious of, is there anything different in the way an SQL engine processes the command, or are they truly the same thing?    I personally prefer the distinct syntax, but I am sure it's more out of habit than anything else.  EDIT: This is not a question about aggregates. The use of GROUP BY with aggregate functions is understood.


On many stackexchange sites I haven't enough reputation to cast an up-vote. Always I get the message "Thanks for the feedback! Votes cast by those with less than 15 reputation are recorded, but do not change the publicly displayed post score".  What does recorded mean exactly?    Can the owner of the up-voted question/answer see in any kind, that he/she got my up-vote? Does he/she get rep for this? What happens with these votes, if I reach the 15 rep? Will they take effect subsequently? Or are they just recorded for my "vote-history"?

Users below 15 reputation can't effectively vote. It says:     Votes cast by those with less than 15 reputation are recorded, but do not change the publicly displayed post score   Does it mean that they will take effect after I reach 15 reputation or because they were cast before, they're recorded but ignored?


Is there any simple way to multiply alphanumeric string in jQuery / JS?  e.g  var str = "ABC"; console.log( str * 5 ); // this will nerutn `Nan` // where what i want is `ABCABCABCABCABC`   Any suggestion much appreciated.

What is the best or most concise method for returning a string repeated an arbitrary amount of times?  The following is my best shot so far:  function repeat(s, n){     var a = [];     while(a.length < n){         a.push(s);     }     return a.join(''); }


The Problem  Prove that for any integer $a, a^{15}-a^3$ is divisible by $455$.  Hint:  $455=5*7*13$. We proved that if $n$ is divisible by $x$, and $n$ is divisible by $y$, and $\gcd(x,y) = 1$, then $n$ is divisible by $x*y$. The upshot of this is that if $a^{15}-a^3$ is divisible by $5$, and by $7$, then it is divisible by $5*7=35$. And if $a^{15}-a^3$ is divisible by $5$, $7$, and $13$, then it is divisible by $5*7*13$. So you need to prove that $a^{15}-a^3$ is divisible by $5$, by $7$, and by $13$.    Confusion  My first guess was to try induction, although I wasn't sure if induction can even be used here since we are dealing with integers instead of natural numbers, so perhaps that is my first issue.  Even if this were a statement about natural numbers, I was still unable to figure out how induction could work here.  Secondly, the hint my instructor provided for this problem makes sense to me, but I haven't the slightest clue as to how to prove what's being asked.  For instance, how do we prove that $5|a^{15}-a^3$?  Induction seems to get us nowhere because you end up with $(k+1)^{15}-(k+1)^3$, and that seems like an insane amount of algebra.  There has to be something I'm missing here.    Any thoughts?

I showed that $a^{15}-a^3=(a^5-a)$ so by Fermat's, $5|a^5-a$ so $5|a^{15}-a^3$. I also showed that $a^{15}-a^3=a^3(a^{12}-1)$ so by Euler, $a^{12}-1 \equiv 0$ mod 13.   I am having a hard time showing that 7 divides $a^{15}-a^3=(a^5-a)$. They talk about it some in this  but I am still not seeing it.  Thank you.


I remember seeing something a long time ago about the inability to define a set of all functions from $\mathbb{R}$ to $\mathbb{R}$. However, I haven't seen a page about there being no restrictions on $f$. I see that the cardinality of the set of all CONTINUOUS functions is $\mid \mathbb{R} \mid$, but what is the paradox I'm thinking about as far as sets of functions goes? Does this problem perhaps arise when we consider the set of all functions from ALL sets $A$ to ALL sets $B$? Can someone give some context on all of these, and what I may be thinking of? It's been quite a while since I've studied this.

As the question states, we are to show that $C = \{ f : f \text{ is a function} \}$ is a proper class.  Assume for the sake of contradiction that $C$ is a set. Then consider the class function $\Phi$ which takes as input a function $f$ and spits out the set of inputs to $f$. So if $f : A \to B$ then $\Phi(f) = A$. By replacement schema, $\Phi[C]$ is a set. However, since $\{ S : S \text { is a set} \}$ is not a set, we have a contradiction.  Does this proof make sense?


I'm looking for equivalent of .NET Linq IEnumerable.Single(predicate) function in Python.    It is supposed to return exactly one element from enumerable/iterable that satisfy a condition and throw exception if there isn't exactly one element like that.  I know it can be easily coded by hand but I'm looking for something built-in.

I created a utility function to return the expected single item from an generator expression  print one(name for name in ('bob','fred') if name=='bob')   Is this a good way to go about it?  def one(g):     try:         val = g.next()         try:             g.next()         except StopIteration:             return val         else:             raise Exception('Too many values')     except StopIteration:         raise Exception('No values')


I am using jupyter notebook and qiskit. I have a simple quantum circuit and I want to know how to get the unitary matrix of the circuit without using 'get_unitary' from the Aer unitary_simulator. i.e.: By just using matrix manipulation, how do I get the unitary matrix of the circuit below by just using numpy and normal matrix properties?  I have figured out how to get the unitary matrix of the circuit below:  By using this code: import numpy as np  swapcnot = np.array([[1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0], [0, 1, 0, 0]]) cnot = np.array([[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]])  layer1 = np.kron(np.eye(2),swapcnot)  layer2 = np.kron(swapcnot, np.eye(2))  print(layer2@layer1)  However when I try to add another qubit and another cnot gate, I do not get the correct result The result I should be getting:


Consider:  D:\Program Files\FileZilla FTP Client\filezilla.exe -c 0/GG/DG/ -a "K:\YY\XXXXX\AAAA\BB\idS.txt"   This code doesn't work as it says:     "PATH NOT FOUND" K:\YY\XXXXX\AAAA\BB\idS.txt   However  D:\Program Files\FileZilla FTP Client\filezilla.exe -c 0/GG/DG/ -a "K:\YY\XXXXX\AAAA\BB"   just connects to the FTP site I wished without any file being transferred.  Why is it not working?

I have a batch file that builds an application, and then I want to upload it to an FTP server from the command line.   Considering I do the upload manually with , is there a command line for it to upload files?  I am limited to Windows.


Suppose I have a class with an annotation, e.g.:  @MyConfig class MyConfiguration {      @MyParameter     String parameter; }   If I know an instance of this class exists (for instance, one was constructed in another thread) how can I get a reference to the instance elsewhere.  I'm trying to find the instance by its @Annotation.

What is the best way of searching the whole classpath for an annotated class?  I'm doing a library and I want to allow the users to annotate their classes, so when the Web application starts I need to scan the whole classpath for certain annotation.  Do you know a library or a Java facility to do this?  Edit: I'm thinking about something like the new functionality for Java EE 5 Web Services or EJB's. You annotate your class with @WebService or @EJB and the system finds these classes while loading so they are accessible remotely.


(This question is not a duplicate of   I am asking specifically about when PID-4 is locking it (besides the fact that i'm saying without using guesswork. And that question doesn't even mention PID-4))  When System PID 4 is locking a file or folder, How can I determine what program/process/service is locking it without guesswork?  For example , see this result from process explorer showing a file that may be locked.    Now, without any guesswork, how can I determine what is locking it? (When the only info I see from process explorer is that it's SYSTEM/PID-4)  Added  Somebody asked if it is a duplicate of   The questoin is similar.. but there's no answer there that answered my case.. Also, the question there iis very simplistic and says "How could I find out which application "System, PID: 4" really is?"    I know that PID 4 isn't an application. It is something system related.. and may be a service.  So my question is not the same as that one.  That one has misunderstandings about what PID 4 is and somebody could partly answer that question by just saying what it is and is not.

How can I find out which process is locking a file or folder in Windows?  For instance, when trying to delete a folder, Windows reports this:     The action can't be completed because the folder is open in another program   Happens the same with a file, but how do I find out what program or application is currently using it and preventing me from deleting the file or folder?


I have connected my DB with eclipse and i want to give the administrator the permission to delete a member putting the members id from Scanner from a table that I have created public void processDelete() {           try {                 String url = "jdbc:mysql://localhost:3306/labdb";                 String user = "****";                 String password = "***";                                  Connection myConn = null;                 myStmt = null;                 ResultSet myRs = null;                 Scanner keyboard=new Scanner(System.in);                                  System.out.println("Enter the id you want to delete");                 int id=keyboard.nextInt();                                   int rowsAffect=myStmt.executeUpdate(                             "delete from members " +                             "where member_id='"+id+"' ");             } catch (Exception exc) {                 exc.printStackTrace();             }  and i get this error java.lang.NullPointerException     at DeleteMembers.processDelete(DeleteMembers.java:24)     at main.main(main.java:67)

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?


Let $X=\{a,b,c,d\}$ and $T=\{\emptyset, X, \{a\},\{b\},\{a,b\},\{a,b,c\},\{a,b,d\}\}$. I have already shown that $X$ is path-connected. I now need to show that $X$ is not simply connected.  My attempt: I know that if $X$ is path-connected then $X$ is simply connected iff the fundamental group is trivial. So if I prove that the fundamental group is not trivial, then Im done. But how do I do so?

Let $S$ be de pseudo circle (see for instance ).  How can I compute its higher homotopy groups?  The question came up while trying construct a weak homotopy equivalence $X\to Y$ that does not admit an inverse. Taking $X=S^1$, $Y=S$ and $f$ as in the wikipedia page should work, but I was not able to work out a "simple" way of calculating $\pi_n(S)$ for $n>1$. By "simple" I mean that it should not invoke a generalization of that I am trying to prove.


I am playing a level 6 Barbarian (I have 2 attacks). I picked up a person as one attack and walked him over to a well, and with my second attack I want to drop him.  Can I do that all in one turn?   To clarify: my PC is a Loxodon with 50 feet of movement.  I "grappled" my opponent with my trunk.  I was right in front of him, took him, and went to the well 20 feet away.

The situation is like this. PCs having a fight on a battlefield with several very deep chasms. One of the PCs attempt to grapple an enemy, then moves with him into one of the chasms (bringing himself and his target down and potentially very much dead). Looking through the rules, I have found only the following info about grapple and movement:     When you move, you   can drag or carry the grappled creature with you, but   your speed is halved, unless the creature is two or more   sizes smaller than you.   No other rules are preventing the PC from just moving into the chasm and dropping his enemy in it. Or at least I have found none. If I remember correctly, in previous editions there were some rules pointing out, that the victim in this situation is subject to some save or an ability check. That was my ruling during the game.  My question then is basically this:  Is there any rules about what options the grappled creature has in case the enemy tries to push it into dangerous terrain, such as a long fall from a high height?  I am looking for RAW answers, because I want to balance my judgments on at least some rule base (or certainty that there is none). My players are OK with my rulings, but I feel uncomfortable nerfing their strategies just because I feel it is wrong.


Prove that $$a^n - b^n \text{ does not divide } a^n + b^n \text { and } a,b,n \in \mathbb{Z}^+. n > 1$$   I have tried to prove this but have had no success. My efforts till now were concerned with showing that $a-b \mid a^n-b^n$ while it does not divide $a^n+b^n$.  I would prefer a number theoretic answer. Thanks.  Source: Introduction to Theory of Numbers

I'm working through the problems in Niven's number theory book, and problem 46 in section 1.2 (page 19) has me stumped.     Prove that there are no positive integers $a, b, n > 1$ such that $(a^n - b^n) | (a^n + b^n)$.   I've tried playing around a bit (e.g. noticing that $a^n - b^n$ must divide $2a^n$ and $2b^n$), but in general I've just been going around in circles.  Can anyone please provide a (small) hint in the right direction?


I use a view to surface every column in a wide, denormalized table for reporting users.  The reason I use a view instead of the table directly is that the view has logic to control access by user.  Every time I add a column to the wide, denormalized table I want it to automatically show up in the view.  Many here on Stack Overflow say SELECT * is never okay.  In this case is it okay or should I just take the hit of updating the view every time I add a column to the table?

Why is using '*' to build a view bad ?  Suppose that you have a complex join and all fields may be used somewhere.  Then you just have to chose fields needed.  SELECT field1, field2 FROM aview WHERE ...   The view "aview" could be SELECT table1.*, table2.* ... FROM table1 INNER JOIN table2 ...  We have a problem if 2 fields have the same name in table1 and table2.  Is this only the reason why using '*' in a view is bad?  With '*', you may use the view in a different context because the information is there.  What am I missing ?  Regards


The code below works fine, but I would like to Supplement it by checking for a plus sign at the beginning of the line. That is, if the user adds «+», then the number becomes «+9 (999) 999-99-99», if he does not add a plus and just enters numbers, then «9 (999) 999-99-99». That is, the digits must be 11 in any case, and the «+» sign is possible only at the beginning of the line.     var phoneInput = document.querySelector(".i_phone"); phoneInput.addEventListener("keydown", function(e) {   "ArrowLeft" != e.key && "ArrowRight" != e.key && "Backspace" != e.key && "Delete" != e.key && "Tab" != e.key && e.preventDefault();   var t = "1 (111) 111-11-11";   if (/[0-9\+\ \-\(\)]/.test(e.key)) {     var a = this.value,       n = a.length;     if (/[0-9]/.test(e.key))       if ("1" == t[n]) this.value = a + e.key;       else         for (var r = n; r < t.length; r++) {           if ("1" == t[r]) {             this.value = a + e.key;             break           }           a += t[r]         }   } }); <input type="tel" name="phone" placeholder="Your Phone" class="i_phone" required="">

I'm trying to put together a comprehensive regex to validate phone numbers. Ideally it would handle international formats, but it must handle US formats, including the following:   1-234-567-8901 1-234-567-8901 x1234 1-234-567-8901 ext1234 1 (234) 567-8901 1.234.567.8901 1/234/567/8901 12345678901   I'll answer with my current attempt, but I'm hoping somebody has something better and/or more elegant.


I need an algorithm that can generate mazes with these requirements:  Allows for random structures to be made (Ex: a center spawn area, objective points and 'Caverns (corridors with 2 or more entrances and a width > 1)' )  Generates paths from structures to required connections  Can be implemented in Python with relatively little difficulty  No extra modules (unless supports Python 3.5.5)   As an example, the objectives would look like this in game (I use integers to store the walls in the ray caster):   2 2 2 2 2 0 0 2 2 0 0 2 2 2 2 2   I also tried looking on  and I found this semi-helpful  but none have helped me achieve this so far.

Problem to solve: Generate a random 2D dungeon map for a tile-based game where all rooms are connected.  I am looking for better solutions than what I currently have.  My current solution is that I run two algorithms. The first generates the dungeon with its rooms. The second make sure that all rooms are connected. I am curious what other soltions may exist. Faster and / or easier etc. Speed is not really a concern, but if speed can be gained at no real cost, well, that is a good thing. More important is that I, and others that read, may learn different ways to approach and solve the problem.  Below are my current implementation. Rooms currently have no exits or exits in any 2, 3 or 4 directions.  Generating the dungeon rooms  Setup: Set the current room to the top left room.   Get a valid room type for the room (where valid room type is a type with no exits out of the dungeon and that have exits that matches the exits of the room above and the room to the left. Only need to check above and to the left due to step 2 below). Put down the room and advance the x-coordinate one step. If the x-coordinate exceeds the dungeon width, set the x-coordinate to 0 and advance the y-coordinate one step. If the y-coordinate exceeds the dungeon height, we are done. Repeat from #1.   I then check to see if all rooms are connected If they are not all connected I run a second algorithm that, in a non-sexy but definately good enough way in terms of dungeon layout, goes through the rooms and change them so that all end up being connected.  Checking to see if all rooms are connected  Setup: Create a 2D map of integers representing paths and initialize the entries to a "unprocessed" (not yet traversed) value, -1. Set a start path index integer that keeps track of the current path to 1. Set the current room to the top left room by adding it to a stack of rooms to check.    If the stack contains rooms to check, pop it set the path index of the room to the current path index. If the stack does not contain any rooms, increase the path index and try to get a room by advancing column by column, row by row, until we get a room that has not been processed yet. If no room can be found, we are done. Check to see if the room has an exit to the left. If it has add the left room to the stack if it is not already on there. Repeat step 2 for down, right and top directions (since we are using a stack that means the rooms are traversed in clockwise order, starting with the top direction). Repeat from step 1. If the path indices count is greater than one, there are disconnected rooms.   If there are disconnected rooms I then group the rooms by their path index, get the index of the biggest path and connect all other rooms to those rooms. This is a work in progress, but my (current, "brutish") plan is to go through each room in a room group (except the first) check to see if there is a horizontal or vertical path to the biggeset room group, and if so, create a horizontal / vertical path there by injecting / updating the rooms inbetween. Rinse and repeat. Ugly, yes, but it is something that will not be noticable in terms of visual pattern so it works in that sense.


My use case is to obtain the material coefficients for simple material classes (metals, plastics, wood, fabric, glass etc). As an example, I have created a simple metal gold in Blender 2.79 using the following steps:   Choose the cycles renderer Add Monkey mesh  Material -> Glossy BSDF Pick color of gold (#FFD700) Render (Shift + Z)   Now, I want to see what the .MTL coefficients of this material are. To that end, I exported the .OBJ file (which generated its associated .MTL file). But the values in my .MTL file are default values. Moreover, when I re-import the .OBJ into blender, it doesnt show my metal.   My question is: Is there any way I can view the .MTL coefficients of this simple material?   What has been tried: There is one answer , but I was not able to "pack" anything. In fact I do not know how to pack material properties.

I used node textures in a mesh I exported to .FBX.  I then imported it into Unreal Engine 4 and it didn't import any textures; I clicked the Upload Textures option in Unreal Engine.  Is there something I'm doing wrong or is it Blender?


This is my first install of Ubuntu and I can't seem to get Ubuntu to recognize my Wifi card.  I have already gone through a few posts on Ask Ubuntu and google but none of those solutions worked:        I followed both link's instructions without error.  lshw -C network returns      WARNING: you should run this program as super-user.   *-network UNCLAIMED               description: Network controller        product: RTL8821CE 802.11ac PCIe Wireless Network Adapter        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:01:00.0        version: 00        width: 64 bits        clock: 33MHz        capabilities: bus_master cap_list        configuration: latency=0        resources: ioport:e000(size=256) memory:fea00000-fea0ffff   *-network        description: Ethernet interface        product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:02:00.0        logical name: enp2s0        version: 15        serial: c4:65:16:1e:89:e4        size: 1Gbit/s        capacity: 1Gbit/s        width: 64 bits        clock: 33MHz        capabilities: bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=r8169 duplex=full firmware=rtl8168h-2_0.0.2 02/26/15 ip=192.168.0.27 latency=0 link=yes multicast=yes port=MII speed=1Gbit/s        resources: irq:31 ioport:d000(size=256) memory:fe904000-fe904fff memory:fe900000-fe903fff WARNING: output may be incomplete or inaccurate, you should run this program as super-user.   The output for the RTL8821CE driver is:  01:00.0 Network controller: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter     Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter     Control: I/O+ Mem+ BusMaster+ SpecCycle- MemWINV- VGASnoop- ParErr- Stepping- SERR+ FastB2B- DisINTx-     Status: Cap+ 66MHz- UDF- FastB2B- ParErr- DEVSEL=fast >TAbort- <TAbort- <MAbort- >SERR- <PERR- INTx-     Latency: 0, Cache Line Size: 64 bytes     Interrupt: pin A routed to IRQ 5     Region 0: I/O ports at e000 [size=256]     Region 2: Memory at fea00000 (64-bit, non-prefetchable) [size=64K]   Let me know if there's anything else I forgot to post.  Thanks!

I'm trying to install drivers for my Wifi on my HP All-in-one desktop. I've been told to show the output of the command "sudo lshw -C network" so here it is:  *-network description: Ethernet interface product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller vendor: Realtek Semiconductor Co., Ltd physical id: 0 bus info: pci@0000:01:00.0 logical name: enp1s0 version: 15 serial: 48:ba:4e:5c:06:5f size: 100Mbit/s capacity: 1Gbit/s width: 64 bits clock: 33MHz capabilities: pm msi pciexpress msix bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=full firmware=rtl8168h-2_0.0.2 02/26/15 ip=192.168.1.21 latency=0 link=yes multicast=yes port=MII speed=100Mbit/s resources: ire:31 import:e000(size=256) memory: fea04000-fea04fff memory:fea00000-fea03fff  *-network UNCLAIMED description: Network controller product: Realtek Semiconductor Co., Ltd. vendor: Realtek Semiconductor Co., Ltd. physical id: 0 bus info: pci@0000:02:00.0 version: 00 width: 64 bits clock: 33MHz capabilities: pm msi pciexpress cap_list configuration: latency=0 resources: import:d000(size=256) memory:fe900000-fe90ffff   Output from "lspci -nnk | grep -A2 0280":  02:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821] Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter [103c:831a] 03:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. RTS5229 PCI Express Card Reader [10ec:5229] (rev 01)


Can I do this with pre-installed back-up application in Ubuntu?

This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here.  While you are encouraged to help maintain its answers, please understand that "big list" questions are not generally allowed on Ask Ubuntu and will be closed per the .   Backup is incredibly important. Obviously there's no best backup tool, but a comparison of the options would be very interesting.   Graphical Interface? Command line? Incremental backups? Automatic backups? Install method: In standard repositories? PPA?


$$\sum _{n=0}^{\infty }\left(\frac{n+1}{2^n}\right)$$  I know that I can separate it into: $\sum _{n=0}^{\infty }\left(\frac{n}{2^n}+\frac{1}{2^n}\right)$  And I am able to prove that the second part gives the sum 2, but the first one is a bit problematic, any tips?

How can I evaluate $$\sum_{n=1}^\infty\frac{2n}{3^{n+1}}$$? I know the answer thanks to , but I'm more concerned with how I can derive that answer. It cites tests to prove that it is convergent, but my class has never learned these before. So I feel that there must be a simpler method.  In general, how can I evaluate $$\sum_{n=0}^\infty (n+1)x^n?$$


I have  a question  about $F$- algebras, please help me:     If $A$ is  a nonzero finite dimensional unital algebra over a field   $F$ with $char(F) = 0$, and let $\varphi$  be an automorphism of $A$,   how can we prove that $\varphi(a)  \neq a +1$  for every $a \in A$?

Let $A$ be a nonzero finite dimensional unital algebra over a field $F$ with $char(F) = 0$, and let $\varphi$  be an automorphism of $A$.      How can we show  that $\varphi(a)  \neq a +1$  for   every $a \in A$?   How can we prove by $L_{\varphi (a)}$ through $\varphi$,$\varphi^{-1}$, and $L_{a}$?  ( $L_{a}$  is  left multiplication map $x \mapsto ax$) .


I am totally new in MacOS environment and I can't get my terminal completions to work case insensitive. I've tried almost all google search results for this question, like editing ~/.zshrc, /etc/inputrc, and many other solutions... I am trying to achieve this for more than 5 days now, so I really appreciate if someone could help!!

I switched to zsh completely on a previous arch install and I LOVED it mainly because arch is one of the distros that capitalizes your Documents, Downloads, Music and such directories in your ~ directory. Since I wasn't used to that and I use tab completion for almost everything in the terminal zsh was like heaven for me compared to bash.... I swear this feature used to be active automatically because I don't remember having to tweak anything to make it work that way. I probably figured it out on accident. xD But I would greatly like to have this feature restored on my new pc using zsh as my main shell, and if anyone knows how to do this I would really appreciate a reply. I tried activating every option in the completion configuration and that didn't seem to do the trick... so that brought me here. PS: I used to be a lot more up to date with my Linux know-how, and my knowledge has grown stale... I'm trying to remedy that... (without the use of the shift key, as much as possible... haha)


I am using 15.10, and out of blue i started getting a whitish border around my window (all the windows i open). I have nVidia graphics card with a updated driver. Everything was fine, no changes were made to any X11 or any system file. Rebooted the machine too. any help ?

Recently, I have noticed that on most applications I have on Ubuntu 16.04, when I load the application, the window is displayed with a strange multi-coloured border (see the images below). If I maximise the window though, the border disappears and the window is displayed as expected.  This started happening for no apparent reason. If I reboot my machine, things return to normal at first, but after a while the problem comes back.  The issue occurs on most applications, including Nautilus, Software Centre, Terminal, System Settings, etc... I also get the same border appearing when I right click on the desktop, with the border surrounding the pop-up menu.  However, I have noticed that it does not happen on Chrome, but it does happen on other applications which did not come with Ubuntu by default.  Any ideas on what is causing the problem? Thanks!


When an object falls inside the event horizon with already huge terminal velocity directed towards the black hole, the gravity must accelerate to near light speeds which should  almost increase its relativistic mass to infinity, according to einsteins eqn So does it mean that every object that falls into a black hole becomes a black hole itself?

I'm a big fan of the podcast Astronomy Cast and a while back I was listening to a Q&A episode they did. A listener sent in a question that I found fascinating and have been wondering about ever since.   From the show :      Arunus Gidgowdusk from Lithuania asks: "If you took a one kilogram mass and accelerated it close to the speed of light would it form into a black hole? Would it stay a black hole if you then decreased the speed?"   Dr. Gay, an astrophysicist and one of the hosts, explained that she'd asked a number of her colleagues and that none of them could provide a satisfactory answer. I asked her more recently on Facebook if anyone had come forward with one and she said they had not.  So I thought maybe this would be a good place to ask.


My thesis supervisor requires me to include all my MATLAB code in the PDF. My code is scattered in a dozen .m files, all in the same folder. I know I can include code, using the matlab-prettifier package, and I do so as follows: \lstinputlisting[style=Matlab-editor]{codice/ICCplot.m}  In essence, I want to do the following: for \filename in codice/*.m     \section{\filename}     \lstinputlisting[style=Matlab-editor]{codice/\filename.m} end for

Assume I have many TeX files. For the sake of simplicity, also asssume they are in a single folder or directory.  I want to input all files from within my main LaTeX document. Actually I can create a list of those files using C# in advance.  To enrich my view about LaTeX or TeX, could you tell me whether or not this job can be done only by using pure TeX or LaTeX?


When I take pictures of a screen at school or at my house, they turn out really weirdly. When blown up to 100%, they look fine, but when they get sized down, they look really weird, here is a screenshot of my phone to show what I mean

What is the image defect called "moiré"? What causes it, and how can we avoid or reduce it? Is it related to "false color"?


I have an arrayList of objects public ArrayList<Brick> bricks; defined later in the constructor bricks = new ArrayList<Brick>(); . And then used in paintComponent method:  public void paintComponent(Graphics g) {     Graphics2D g2d = (Graphics2D) g;     super.paintComponent(g);      for(Brick b: bricks){         b.draw(g2d, b.type);      }      Toolkit.getDefaultToolkit().sync(); }   After adding bunch of objects I'm using serialize method :      public void serialize(ArrayList<Brick> al){         try{             FileOutputStream fos= new FileOutputStream("levels/level1");             ObjectOutputStream oos= new ObjectOutputStream(fos);             oos.writeObject(al);             oos.close();             fos.close();           }catch(IOException ioe){                ioe.printStackTrace();           }     }   to save it to file (Although Eclipse throws some warnings the file is being created). However I'm having problem deserializing it (list is not being loaded):  public void deserialize(){     try     {         FileInputStream fis = new FileInputStream("levels/level1");         ObjectInputStream ois = new ObjectInputStream(fis);         ArrayList<Brick> readObject = (ArrayList<Brick>) ois.readObject();         bricks = readObject;         ois.close();         fis.close();      }catch(IOException ioe){          ioe.printStackTrace();          return;       }catch(ClassNotFoundException c){          System.out.println("Class not found");          c.printStackTrace();          return;       } }   Am I doing something wrong ?

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


I'm currently re-watching the series (never read the books). Whenever there's a scene with Tyrion I always find myself impressed by the writing/his witty comebacks. Are these all the work of George, or did the show writers help out.

Since Season 3, we have been observing that the show was taking a different direction than the books. Many important characters never made it into the show, others who are still alive were killed off.   As we know the show is supposed to be based on the books, not to be direct adaption of the books from print to television media, there's bound to be a certain degree of creative independence accorded to them by the author of the series, George R.R. Martin.   The question is, how much independence do they have? Do they still have to take GRRM on board with whatever changes they might intend to make? By "they" I mean D&D and the whole writers crew for the show. Given the number of significant changes they have made, I reckon the answer would be a lot. Has GRRM or HBO ever commented on that?


Please pay attention, I am interested in Bernoulli samples, and hope to find criteria specific to Bernoulli distribution,  not using s Student's t-statistics or Mann-Whitney or etc., since their use  relies on asymptotic assumptions, which I would prefer to get rid off. (Because for large sample sizes it is Okay to use asymptotic normality, but not for small samples sizes, which might occur in my situation).   Question: Consider three Bernoulli samples (0,1,..1), (1,1,..0), (0,0..,1).  of possibly different length.  I want to understand are some of them from the same distribution or non of them ?  I would expect some kind of  "p-value" calculation as an answer to the question. My problem is that I do not see how to get it for Bernoulli distibution without relying on some asymptotic normality.   Motivation The question is typical for machine learning binary classification tasks, at the stage of feature preprocessing, where one the ways to preprocess categorical features --  is to merge groups with small number of observations to larger groups, thus getting more stable estimators.   PS  Differnce with the already asked question:  There is nice discussion on related question:   However the difference is that I am interested at a specific situation of the Bernoulli sample (or in machine learning language binary classification problem), while the later question/answers deal with the general situation of generic/unknown distribution of target variable. Why cannot hope in general to have some analytical answer, while for specific case of Bernoulli disribution it sounds like a classical question which, most probably, have been addressed in literature.

What techniques are available for collapsing (or pooling) many categories to a few, for the purpose of using them as an input (predictor) in a statistical model?    Consider a variable like  (discipline chosen by an undergraduate student). It is unordered and categorical, but it can potentially have dozens of distinct levels. Let's say I want to use major as a predictor in a regression model.  Using these levels as-is for modeling leads to all sorts of issues because there are just so many. A lot of statistical precision would be thrown away to use them, and the results are hard to interpret. We're rarely interested in specific majors -- we're much more likely to be interested in broad categories (subgroups) of majors. But it isn't always clear how to divide up the levels into such higher-level categories, or even how many higher-level categories to use.  For typical data I would be happy to use factor analysis, matrix factorization, or a discrete latent modeling technique. But majors are mutually exclusive categories, so I'm hesitant to exploit their covariance for anything.  Furthermore I don't care about the major categories on their own. I care about producing higher-level categories that are coherent with respect to my regression outcome. In the binary outcome case, that suggests to me something like linear discriminant analysis (LDA) to generate higher-level categories that maximize discriminative performance. But LDA is a limited technique and that feels like dirty data dredging to me. Moreover any continuous solution will be hard to interpret.  Meanwhile something based on covariances, like multiple correspondence analysis (MCA), seems suspect to me in this case because of the inherent dependence among mutually exclusive dummy variables -- they're better suited for studying multiple categorical variables, rather than multiple categories of the same variable.  edit: to be clear, this is about collapsing categories (not selecting them), and the categories are predictors or independent variables. In hindsight, this problem seems like an appropriate time to "regularize 'em all and let God sort 'em out". Glad to see this question is interesting to so many people!


I'm trying to solve a project euler 25 problem in java and since I need something to store numbers with 10000 digits, I'm using BigInteger classes.  So I'm working in some recursive fibonacci sequence using BigIntegers and I'm trying to convert this code:   public int fibonacci(int n)  {     if (n == 0)         return 0;     else if (n == 1)         return 1;     else         return fibonacci(n - 1) + fibonacci(n - 2); }   from this link:   to the same code, but using BigIntegers.  So, this is what I have so far:  public static BigInteger fibonacci(BigInteger index) {     if (index.compareTo(BigInteger.ZERO) == 0)         return BigInteger.ZERO;     else if (index.compareTo(BigInteger.valueOf(1)) == 1)         return BigInteger.ONE;     else         return fibonacci(index.subtract(BigInteger.ONE)).add(fibonacci(index.subtract(BigInteger.valueOf(2)))); }  public static int numberOfDigits(BigInteger fibonacci) {     return Integer.valueOf(fibonacci.toString().length()); }  public static void main(String[] args) {     long startTime = System.nanoTime();     for (BigInteger i = new BigInteger("1"); numberOfDigits(fibonacci(i)) <= 1000; i = i.add(BigInteger.ONE))         System.out.println(" " + i + "  -  " + fibonacci(i) + "  -  " + numberOfDigits(fibonacci(i)));     long endTime = System.nanoTime();     long duration = (endTime - startTime);     System.out.println("Duration: " + duration/1000000 + " ms"); }   When I run it, I get a StackOverFlowError, like this:  Exception in thread "main" java.lang.StackOverflowError     at java.math.BigInteger.subtract(BigInteger.java:1423)     at Problem25Part2.fibonacci(Problem25Part2.java:19)     at Problem25Part2.fibonacci(Problem25Part2.java:19)     at Problem25Part2.fibonacci(Problem25Part2.java:19)     at Problem25Part2.fibonacci(Problem25Part2.java:19)   And it repeats I think 1000 times. Well, I have no idea what is wrong, so please can you guys help me? Thank you!

What is a StackOverflowError, what causes it, and how should I deal with them?


Will Ubuntu 14.04 will work if desktop is already fitted with LAN card?

How can I find out if Ubuntu supports a particular hardware component, that is, if it works in Ubuntu?  I am going to put together a computer and I am choosing components.   How do I know if Ubuntu supports this or that motherboard, or this or that sound card, or this or that graphics card, etc? How do I know that there is no conflict in Ubuntu between this and that hardware component?   What resources are there to help with such situations?  I know that there are computers with Ubuntu pre-installed and that there are  for whole computers but this is not what I'm looking for. I'm looking for resources to find out support for particular hardware components and conflicts among particular hardware components.


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

This other  seems mildly related, but not really.  Where can the [M]?S[UOF] community see whether features we've requested or bugs we've reported are being actively tracked and/or are in process?  Can we even see those? If not, I'm requesting to be able to :)


In QGis 2.18 is there a way to link (like join) a table with multiple value for each ID CODE with a Point shapefile with only 1 point for each ID CODE?? (picture in annex)  It would be fine also a temporary link in my machine memory to keep light the shapefile!

I'm trying to create a join/relate in QGIS where I have a shapefile of buildings and to that I would like to join a non-spatial table (.csv-file) containing people who work in each building. So I have multiple records in my table that I would like to be able to join to my single features in my shapefile. I can only run a join in QGIS where the first record is joined to the shapefile feature (ie building) but subsequent records get removed. Could someone let me know how to complete this join/relate in QGIS?


Let $G$ be a group. Define a relation $\sim$ on $G$ by $a\sim b$ if there exists $g\in G$ such that $a=gbg^{-1}$. Prove that all elements of order $15$ in $S_8$ are related by $\sim$.   I noticed that in order to have order 15 in S8, we need to have a product of 3 cycle and 5 cycle. Then, I am stuck... What should I do?  Thank you in advance.

Let $G$ be a group.  Define a relation $\sim$ on $G$ by $a \sim b$ if there exists $g \in G$ such that $a = gbg^{-1}$.  Prove that all elements of order 15 in $S_8$ are related by $\sim$.  I noticed that in order to have order $15$ in $S_8$. We need a $5$ cycle and a $3$ cycle. Then, I am stuck. Can anyone give me some ideas about what to do? Thank you in advance.


Starcraft 2 is taking up so much space in my drive. I was wondering if there are some files which can be safely deleted?

Is it possible to minimize disk space usage?    I only want to play multiplayer anyway and the biggest chunk of the download is the campaign.  Since the multiplayer game is playable after only 10% of the whole download, I am wandering if one could simply stop it there somehow?  Update: It seems you can delete some folders and save lots of GB:   I tried this, but the folders I deleted are immediately re-downloaded at the next start via Battlenet. Maybe you have to start it differently?  Can you create a batch script that does the job?  What about updates? Is this even possible without repairing those missing folders?


When I click open, I get to I wanted to open, but I lose everything else. How can I open two files into one?

I have created several designs for a particular project and they are related, but I don't want to have to keep recreating any similar elements, such as shared materials or textures.  How can I use the existing data in a new Blender file?


For he through Sin's long labyrinth had run, Nor made atonement when he did amiss...  Does these sentences mean that he did not run from commiting sins nor  made atonement when he did amiss or Does it means that he did run from commiting sins but did not made atonement when he did amiss? Thank you.

And I saw Tityos, son of glorious Gaea, lying on the ground. Over nine roods he stretched, and two vultures sat, one on either side, and tore his liver, plunging their beaks into his bowels, nor could he beat them off with his hands.      — The Odyssey   This nor is not like not . . . either.  This nor is similar to never could he beat them off. . . .  Is this correct? Is this an archaic use?


I'm studying for an exam in Classical Mechanics, and I was curious to know when it is more appropriate to use Lagrangian vs Newtonian Formalism. I know that Lagrangian Formalism much more efficient, however in another physics class I was in, we hardly used Lagrangian formalism at all, and primarily used newtonian.

What is Lagrangian mechanics, and what's the difference compared to Newtonian mechanics? I'm a mathematician/computer scientist, not a physicist, so I'm kind of looking for something like the explanation of the Lagrangian formulation of mechanics you'd give to someone who just finished a semester of college physics.  Things I'm hoping to have explained to me:   What's the overall difference in layman's terms? From what I've read so far, it sounds like Newtonian mechanics takes a more local "cause-and-effect"/"apply a force, get a reaction" view, while Lagrangian mechanics takes a more global "minimize this quantity" view. Or, to put it more axiomatically, Newtonian mechanics starts with Newton's three laws of motion, while Lagrangian mechanics starts with the Principle of Least Action. How do the approaches differ mathematically/when you're trying to solve a problem? Kind of similar to above, I'm guessing that Newtonian solutions start with drawing a bunch of force vectors, while Lagrangian solutions start with defining some function (calculating the Lagrangian...?) you want to minimize, but I really have no idea. What are the pros/cons of each approach? What questions are more naturally solved in each? For example, I believe Fermat's Principle of Least Time is something that's very naturally explained in Lagrangian mechanics ("minimize the time it takes to get between these two points"), but more difficult to explain in Newtonian mechanics since it requires knowing your endpoint.


So, I'm trying to POST using jQuery Ajax.   It's work fine if i don't use files upload.  How i get the multiple data uploaded and send it to server ?  Is it possible to do this..?  Thank in ADvance.  HTML :  <form id="uploadimage" method="POST" enctype="multipart/form-data" action="">   <input type="text" name="rsdtIncdSourceID"  id="rsdtIncdSourceID" >   <input type="text" name="rsdtTrnsId"  id="rsdtTrnsId" >    <input name="rsdtDescription" id="rsdtDescription" >   <select name="rsdtMsrsId" id="rsdtMsrsId">     <option></option>   </select>   <input type="file" id="input-file" required multiple> </form> <button class="btn btn-xl  wow fadeInUp" id="btnPost">Process</button>   JS :   $(function(){    var $rsdtIncdSourceID   = $('#rsdtIncdSourceID'); var $rsdtTrnsId         = $('#rsdtTrnsId'); var $rsdtMsrsId         = $('#rsdtMsrsId'); var $rsdtDescription    = $('#rsdtDescription'); var $rsdtFiles          = $('#input-file'); **// HOW TO GET THIS VALUE ?**   $('#btnPost').on('click', function(){      var match = {         rsdtIncdSourceID: $rsdtIncdSourceID.val(),         rsdtTrnsId: $rsdtTrnsId.val(),         rsdtMsrsId: $rsdtMsrsId.val(),         rsdtDescription: $rsdtDescription.val(),         rsdtFiles: $rsdtFiles.files[0],  **// HOW TO add THIS VALUE ?**     };      $.ajax({                 type:'POST',                  url:'http://xxxx:802/api/v1/transaction/matching/confirm',                 data: match,                 success: function(data, textStatus, jqXHR) {                     var userObj = JSON.parse(jqXHR.responseText);                     alert($rsdtDescription.val());                   },                 error: function(jqXHR, textStatus, errorThrown) {                     alert(textStatus);                   }      });  });    });

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


I have post mount TRP Spyre calipers, how can I upgrade to flat mount Ultegra calipers? are there adapters available? I've only seen adapters for flat to post.

I have a CAAD12 disc which I'd like to fit SRAM Force 22 hydraulic to. I've been a bit enthusiastic buying things without really researching all the pitfalls of the different bits and bobs that go into disc brakes and compatibility thereof.  So, it turns out that the CAAD12 fork is post mount, but my calipers are flat mount. Is there an adapter to fit a flat mount caliper to a post mount fork?


This was a story, perhaps a novella,  1960s era, that began by explaining "leaping"--the ability to transfer from place to place, but without any external device. The origin story was that a scientist accidentally created some explosive force and leaped to safety before he was in danger.  The story continued to explain all sorts of advances and the institutionalization of "leaping" (leaping stations, etc.)

There's a story my grandpa use to tell me when I was younger, about the sole survivor of of an attack on a mining vessel in space. The man lives in space for months/years, ignored by the company he worked for and never rescued. Then when he thinks he is being rescued, it's actually another set of raiders who attack him and kidnap him.  He then wakes up in captivity in some sort of prison inside of an asteroid, and has a word tattooed on his forehead. My grandpa called him Ronin (that's what the tattoo on his forehead said) but I don't know what the character's real name is. Anyways, he learns that he has the ability to teleport after having a brush with death and decides to make his way back to Earth so that he can exact revenge on the mining company who abandoned him and left him floating to die.  Does anyone know what this story or book may be? My grandpa told it to me when I was little, he said that he got it from a book he use to love reading when he was younger. I'm assuming the book is very old (possibly pre 1940's as he was born in the 20s). I can't ask him as he is no longer alive. I'm also unsure as to whether or not all the details in the story he told me, are the same as in the original.


Using SQL Server, how do I split a string so I can access item x?  Take a string "Hello John Smith". How can I split the string by space and access the item at index 1 which should return "John"?


As in title.  The  is sometimes offered as a fundamental axiom in the ZFC framework (), but sometimes it is not (). Would you consider it a tenth canonical ZFC axiom? Am I misunderstanding things?  In case the question is more nebulous at very advanced levels of mathematics: I am asking in the context of an introductory course on axiomatic set theory.  Thank you for your time!

I found in the Wolfram MathWorld page of the  that this is one of the Zermelo-Fraenkel Axioms, however on the page about these  I read that it is an axiom that can be deduced from the Axiom of Subsets and the Axiom of Foundation (or Axiom of Regularity), so, the existence of the Empty Set is an axiom of ZFC or not?


I would like to know a solution or workaround to avoid having the stroke appear disconnected after applying a brushstroke. Please see before and after applying a brush to stroke. I have already tried the alt/option method of connecting the path as well as "join" to make the connection; however, when applying the brushstroke, there is still a "pinch" along the path. Is the tapered brush stroke part of the problem? Or is there a better way to achieve a more seamless result when using an art brush? Thank you!

Can some one tell me how to use Brushes in Illustrator so that when I draw complete paths such as Rectangles and Circles the stroke doesn't taper off like it does here:


If yes, how is it possible since a closed circuit with no resistance means 0 voltage, how does the electrons flow initially if there's no potential difference? Any simple explanation or analogy would be very helpful.

I know that you can use induction to create a current in a superconducting loop, but this only works as long as the coil that induces the field has a current flowing through it. And obviously, this cannot work for the really big magnets that are used in MRI scanners or NMR machines.  How does it work?


I'm trying to change Unity Launcher icons on a remote computer with command:  gsettings set com.canonical.Unity.Launcher favorites ...   and it works perfectly  But when I do  ssh 127.0.0.1 gsettings set com.canonical.Unity.Launcher favorites ...   I get this:      (process:9616): dconf-WARNING **: failed to commit changes to dconf: Error spawning  command line `dbus-launch --autolaunch=aaa5bb6eaa7cd50f2af1f10000000004 --binary-syntax  --close-stderr': Child process exited with code 1   And that is for any gsettings calls from ssh. Where is the problem?

I am trying to change some gconf settings in Ubuntu 12.10. I would like to change the lightdm greeter background.  I have discovered that while logged in to unity as a user while running X server, I am able to do this with:  sudo xhost +SI:localuser:lightdm gsettings set com.canonical.unity-greeter background "'/usr/share/backgrounds/micros-background.png'"   The problem is that this requires me to login as a user under X. So that entire window manager needs to be running. But I want to use chroot to change these settings without any X server running. I just want to mount the partitions and change gsettings without having the full window manager running.  Is there a way to directly change gsettings without being logged into X and Unity?  Or alternatively... is there a way to bring up the X server and Unity in the background so that I can make the changes without having a full windowed display come up on my monitor?


I want to store animations (just the animation data itself) so they can be recalled and reused in other projects.  How do I create such a library of purely animation data?  (For instance if I have some text animations that I like the feel of and wish to reuse)  I can see why you might flag this as possibly answered the question though the suggestions are not quite what I meant, I want a library that is visible to all projects without 'linking' akin to Photoshops presets.  In fact I wish this was the case with all data objects, materials textures etc.  EDIT Please see the edit. I wasn't asking about linking files, but about libraries, so that animations appear as presets - this should not have been marked as duplicate especially in the light of this.

I have created several designs for a particular project and they are related, but I don't want to have to keep recreating any similar elements, such as shared materials or textures.  How can I use the existing data in a new Blender file?


The  is great, but  the fact that each change shows up makes the rep display a bit confusing and rather "noisy."  Apparently, users constantly accept, then unaccept, then accept answers — usually doing all three within seconds of each other. Similarly people upvote, then un-upvote, then re-upvote again, within seconds. See the image below.  As engineers, we know that the usual response to this kind of noise is to throw a bit of  into the system, as when debouncing the input from a keystroke or mouse click.  I suggest that events on the same object (question or answer) within, say, a minute of each other that cancel each other out should be filtered out of the display. So referring to the image below, rather than  +30 41 mins ago  accept    Select all input tag in without certain attribute in Jquery -15 41 mins ago  unaccept  Select all input tag in without certain attribute in Jquery  ...we'd just see  +15 41 mins ago  accept    Select all input tag in without certain attribute in Jquery  ...as we used to.

With the new reputation system I get a lot of useless reputation up and down information in my history. This happens when a user upvote, unupvote and then upvote again in a small time window.  upvote/unupvote example:    accept/unaccept example:    This is very annoying and doesn't reflect anymore my common-sense-inspired reputation history.  Could something be done to fix this behavior?    For example show it only if the answer has been edited in between the upvote-unupvote?    Should it also be disabled for the first 5 minutes (like the edit notification)? (I don't know if this 5 minutes limbo is already in place or not)  Note: I believe that such users are in good faith and/or just newbies, but this seems to me like a highway for trolling:


So, imagine you are hit by a monster and dropped down to 0 hp. But then the same attack also requires you to make a Constitution save or take extra damage. Is this attack treated as a single damage and you stay at 0 hp, or what I think, you are dropped to 0 hp from the normal attack, then you make a Con save and if you fail it, you take the extra damage causing the character to receive a failed death save? Edit: As my question was deleted because there is a similar one, but there is no answer to this exact circumstance. Here we have one attack that requires an attack roll for the 1st portion of damage and then a save for the additional damage. I cannot find an answer that explains this situation!

Scenario 1: A grimlock hits Alice with a Spiked Bone Club, dealing 5 bludgeoning damage, plus 2 piercing damage. Alice's HP was 12.   Using the optional Massive Damage rules on page 273 of the DMG, does this count as more than half the HP from a single source, or less than half, but twice?  Scenario 2: Assume the same grimlock hits Bob with the same attack, this time rolling 6 bludgeoning damage, plus 3 piercing damage. Bob's Max HP is 8, and he had 1 HP remaining before he was hit.  Using the Instant Death rules on page 197 of the PHB, does the character die, or are the two damage types tracked separately? Does the character have to make a death saving throw for the second part of the damage?


We know to get determinant in a matrix we use sarrus, laplace, x methods and so on But question : WHAT is it, according to some pages is about permutations the products of element of the matrix , but WHAT IS IT ?

In my linear algebra class, we just talked about determinants. So far I’ve been understanding the material okay, but now I’m very confused. I get that when the determinant is zero, the matrix doesn’t have an inverse. I can find the determinant of a $2\times 2$ matrix by the formula. Our teacher showed us how to compute the determinant of an $n \times n$ matrix by breaking it up into the determinants of smaller matrices. Apparently there is a way by summing over a bunch of permutations. But the notation is really hard for me and I don’t really know what’s going on with them anymore. Can someone help me figure out what a determinant is, intuitively, and how all those definitions of it are related?