I've gone through the duplicates here and I cannot find how to fix this problem; basically none of the core repositories update, but third-party ones do, on the whole.  For instance, I want to install the , so I can see the line in sudo apt-get update:  Get:23 http://ftp.jaist.ac.jp/pub/Linux/ubuntu xenial/universe amd64 Packages [7,532 kB]   I presume this is OK, even though at the end I get:  E: Failed to fetch http://ftp.jaist.ac.jp/pub/Linux/ubuntu/dists/xenial/main/binary-arm64/Packages     404 Not Found   And also for xenial-updates and xenial-security, but the text says "They have been ignored, or old ones used instead." Note that the main site and random mirrors all fail.  Now, apt list *bats* reports merely libatspi2.0-0.  Third-party repositories (Opera and ROS, for instance) work fine, but what could be causing my problem with the official repositories? I'm also not getting any updates from there.  Note that when I work with Docker, Dockerfile RUN apt-get works as expected, so it's probably not some network or quota issue.

W: Invalid 'Date' entry in Release file /var/lib/apt/lists/_var_cuda-repo-8-0-local_Release N: Skipping acquire of configured file 'non-free/binary-arm64/Packages' as repository 'http://repository.spotify.com stable InRelease' doesn't support architecture 'arm64' E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/xenial/main/binary-arm64/Packages  404  Not Found [IP: 91.189.88.161 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/xenial-updates/main/binary-arm64/Packages  404  Not Found [IP: 91.189.88.161 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/xenial-backports/main/binary-arm64/Packages  404  Not Found [IP: 91.189.88.161 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/xenial-security/main/binary-arm64/Packages  404  Not Found [IP: 91.189.88.161 80] E: Some index files failed to download. They have been ignored, or old ones used instead.   After I installed Jetpack for Jetson tx1, my ubuntu constantly tries to fetch arm updates. Is there a way to disable this?  EDIT:   $dpkg --print-architecture amd64  $dpkg --print-foreign-architectures i386 arm64   I see that arm64 is included in foreign architectures. How do I remove it?


I can start withdrawing from my 401(k) in 30 years. I'm currently in one of the the highest federal tax brackets and will likely be in the lowest tax brackets when I start withdrawing. That alone might indicate that I should avoid taxes now (to the extend that the contributions allow me to) and pay them in retirement (i.e., choose pre-tax 401(k)). However, Roth 401(k) also renders earnings tax-free. Assuming I contribute $10,000 today, I expect to have on the order of ~$10,000 * 1.1^30 ~= $170,000 in 30 years (assuming 100% equity and past returns). If I choose Roth 401(k) instead of pre-tax 401(k), suppose my taxes increase around 10% on my contributions/basis because I earn less in retirement compared to now. I lose 0.1*$10,000 = $1,000 from this. However, I don't pay any taxes on earnings ~$170,000-$10,000 = $160,000, which clearly dominates the ending 401(k) balance and any reasonable tax rate on earnings should favor Roth 401(k). Am I misinterpreting what constitutes "earnings" or is this a no-brainer? (I'm assuming that tax rates remain roughly unchanged for 30 years, but even if they increase, it should favor Roth 401(k) even further.) EDIT: Some people suggested some other threads that are interesting, but not narrow enough for my particular (previous) confusion. In particular, I was specifically concerned about untaxed gains. The top answer clarifies this specific uncertainty.

I just graduated, and I'm starting a new job soon. My employer has pretty good policy for matching 401(k) contributions, so I want to invest as much as possible, especially during this first year.  My question is: should I invest in a traditional 401(k), a Roth 401(k), or some combination of the two? On the one hand, tax rates may be much higher when I retire, and I might be in a higher tax bracket, so a Roth 401(k) would be good. On the other hand, I might be in a lower tax bracket when I retire, so a traditional 401(k) might be better. It's hard to know where I will stand in 30 years.  Is this the same trade-off as with a traditional / Roth IRA, or is there any other tax difference I should know about?


If a creature has two instances of Haste cast on it, and the first one ends, does the character suffer of lethargy? Relevant rules I can find: “Combining Magical Effects” (PHB 205).  The effects of different spells add together while the durations of those spells overlap. The effects of the same spell cast multiple times don't combine, however. Instead, the most potent effect—such as the highest bonus—from those castings applies while their durations overlap. For example, if two clerics cast bless on the same target, that character gains the spell’s benefit only once; he or she doesn’t get to roll two bonus dice.  "Haste" (PHB 250).  When the spell ends, the target can't move or take actions until after its next turn, as a wave of lethargy sweeps over it.  So since the durations overlap and the most potent effect applies, would this mean that the newer Haste would supercede the older one thus negating the Lethargy when the first one ends or would the Hasted fellow still have a turn off?

Haste states     When the spell ends, the target can't move or take actions until after its next turn, as a wave of lethargy sweeps over it.   However, let's say Character A cast Haste on Character B. In the 10th round (final round of haste if concentration not broken), Character B casts Haste on himself.  What happens during the next round?    Do they lose a round of the "new" haste while they are lethargic and lose movement and actions? Does the new haste override the lethargy until it ends? Is it some combination? Retain AC/Dex modifications but lose actions/movement? None of the above?


hey there i want to resize image after retriving from database here is my code          try{         String sql ="SELECT Image from piece where Code_Piece =          "+jTextField1.getText()+"";         stmt=maconnexion.Obtenirconnexion().createStatement();         ResultSet Rs=stmt.executeQuery(sql);          if(Rs.next()){             byte[]imagedata= Rs.getBytes("Image");             format = new ImageIcon(imagedata);              lbl_image.setIcon(ResizeImage(format, null));         }          }catch(Exception e) {         System.out.println("No Fille");        }   i got this error "java.lang.NullPointerException" and i use this method to resize my image          String imgPath = null;            public ImageIcon ResizeImage(String imagePath, byte[] pic){         ImageIcon myImage = null;        if(imagePath != null){        myImage = new ImageIcon(imagePath);       }else{       myImage = new ImageIcon(pic);       }        Image img = myImage.getImage();         Image img2 = img.getScaledInstance(lbl_image.getWidth(),       lbl_image.getHeight(), Image.SCALE_SMOOTH);        ImageIcon image = new ImageIcon(img2);          return image;           }

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?


When dual wielding, can the character move in between the attack with the main hand and the off hand attack?

When you get the Extra Attack action, you can break up your movement and attack different targets at varying distances from your starting point.   Does the same apply with TWF? As in, can I approach my first target, use my attack action, then move, and use my bonus action to attack a different target?  From PHB 195:     "When you take the Attack action and attack with a light   melee weapon that you're holding in one hand, you can   use a bonus action to attack with a different light melee   weapon that you're holding in the other hand."   The key seems to be how to interpret "when:" either "immediately after" or "whenever (during your turn)."


Currently I am trying to create a database design that is long lasting. But I hit a point where I not know how to continue.  I have a object table in my database. That tables stores one unique object (With a incremental ID). However for the application I am creating attributes about that object are required (extra information so a sort of metadata for that object).  These are now five different attributes per object. But I already know in the upcoming future they want more attributes added to a object so they can get more information about it.  If it would have stayed with those five attributes a would create extra columns in the object table.  But now I am thinking to create seperate attributes table where I store that data. And I was thinking in the sorts of:  Table: attributes  Columns: object_id, object_type, object_data. Is this the best practice or what are your thoughts on the matter?

What would be the optimum design/structure for product data database, where each product have many variations and many attributes? Attribute sets vary between products, and some attributes have values common for all variations of a given product. A typical example of product variations & attributes table is in the image below:    (The 'ATTRIBUTE X' is here to give you and idea of a different attribute type than for 'Product 1').   Would it be practical to try to 'group' some of the attributes (to save time and minimise errors when creating new product entries)? If so, how complicated would it need to be?  If it's relevant - I'm thinking of using mySQL engine, but I'd be happy to see any applicable example from other engines.  EDIT : More information: at the moment we have over 400 variations in a spreadsheet, each one about 15-20 attributes, so that would give about 6000-8000 'data points'. It would be great to be able to list all possible values for a given attribute (to create a dropdown menu when adding new entries), and also to have a choice of possible attributes for a given product. It would be great to be able to specify which attributes are applicable for product variations of each product.


I'm not sure what I'm doing wrong here. I'm trying to create a basic command line using JFrame, which in future I want to create a bunch of functions that will be done based on the user's input, however, when I try to compare the ActionCommand to a string or variable, it doesn't seem to work:  `      import javax.swing.*;     import javax.swing.JFrame;     import java.awt.*;     import java.awt.event.*;     import java.io.*;       public class GUI extends JFrame{  private JTextField cmd;   public GUI(){     super("Command Line V2");       //Window title     setLayout(new FlowLayout());            //Set layout      cmd = new JTextField("Enter Command");  //Make cmd a JTextField     add(cmd);                               //Add cmd to the screen      //Adding action listeners     cmdHandler handler = new cmdHandler();     cmd.addActionListener(handler);   }  private class cmdHandler implements ActionListener{     public void actionPerformed(ActionEvent event){           String butt = "Whut";          if(event.getSource()==cmd){             if(event.getActionCommand()==butt){                  System.out.println("Yay");             }else{                 System.out.println("uh dear");                 System.out.println(event.getActionCommand());             }           }         } }`   This is the GUI.java page, but just incase it's needed, here's the main.java page:          import javax.swing.*;     import java.awt.*;     import java.awt.event.*;     import java.awt.FlowLayout;      public class Main {  public static void main(String args[]){      GUI g = new GUI();     g.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);     g.setSize(275,180);     g.setVisible(true);     g.setResizable(false); }      }   When opened, a window opens and a JTextBox appears: "Enter Command" once I write in the command line EXACTLY what the if statement is trying to compare the "event.getActionCommand()" to, it still outputs "uh dear" (Which is what it does if it doesn't compare it to anything)  How am I supposed to fix this? Thank you.

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


I have directory on my server that stores user profile images. They're being saved in UserImages directory.  On SQL Server, User's profile image is being saved like this:  C:\\inetpub\\wwwroot\\Project\\Project\\UserImages\\userimage.jpg   I have a GET ActionResult method that uses ET to get user data and returns it to View. The problem however is, I'm lost as to how I can pass a usable relative Path from full path as given above.  How can I make relative path from absolute path on hard drive so it can be used as src for a HTML image?  Edit: Razor won't work, since image can be updated using AJAX - when it is, I receive some JSON from server with new data.

There's a part in my apps that displays the file path loaded by the user through OpenFileDialog. It's taking up too much space to display the whole path, but I don't want to display only the filename as it might be ambiguous. So I would prefer to show the file path relative to the assembly/exe directory.  For example, the assembly resides at C:\Program Files\Dummy Folder\MyProgram and the file at C:\Program Files\Dummy Folder\MyProgram\Data\datafile1.dat then I would like it to show .\Data\datafile1.dat. If the file is in C:\Program Files\Dummy Folder\datafile1.dat, then I would want ..\datafile1.dat. But if the file is at the root directory or 1 directory below root, then display the full path.   What solution would you recommend? Regex?  Basically I want to display useful file path info without taking too much screen space.  EDIT: Just to clarify a little bit more. The purpose of this solution is to help user or myself knowing which file did I loaded last and roughly from which directory was it from. I'm using a readonly textbox to display the path. Most of the time, the file path is much longer than the display space of the textbox. The path is supposed to be informative but not important enough as to take up more screen space.  Alex Brault comment was good, so is Jonathan Leffler. The Win32 function provided by DavidK only help with part of the problem, not the whole of it, but thanks anyway. As for James Newton-King solution, I'll give it a try later when I'm free.


I'm trying to get to grips with JavaScript for more than just simple JQuery DOM manipulation and something is confusing me.  I've been looking through sample code and seen the following two patterns in the same sample which seem to both be equivalent...  var Car = function(){} var c = new Car();   and  function Van(){}   var v = new Van();   Is there any difference between them? Why would you use one over the other?

I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent.  The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not.  The two ways are:  var functionOne = function() {     // Some code };     function functionTwo() {     // Some code }   What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?


I had an idea of creating a pseudo-random binary sequence with that code:    import random as rd p=[] k=10**6 for i in range(k):   p.append(rd.getrandbits(1))  s='' for i in p:   s+=str(i) a=p.count(0) b=p.count(1) f = open('s.txt', 'w') f.write(s) f.close()   And on the stage of testing it with NIST tests there came a question of choosing right parameters for launching them. If I set the length of the sequence for this file for 100000 and number of bitstreams for 1, will it mean that from this file i will have only first 100000 bits tested as one sequence? Should the data in file be separated in some way?   I have also checked , but to be honest it didn't help me. Reading the official docs for NIST package didn't bring no understanding of bitstreams parameter too.  I will be very grateful if you explain me, how to set number of bitstreams parameter correctly and explain the meaning of it in this situation and the way the input data should be given to the tests.

I have a binary sequence of length $2^{20}$. I am using the NIST statistical test, assess.   What should be taken for ./assess and  How many bitstreams? in this test? In the final Analysis report, what p-values should be there to pass this test?


I am trying to add a simple console as a panel, but I don't get it working (have a look at the end of the code):  super.setSize(600,4*46);     super.setDefaultCloseOperation(JFrame.DISPOSE_ON_CLOSE); pane = super.getContentPane(); GridLayout flo = new GridLayout(4,1,20,2); pane.setLayout(flo); pane.setBackground(grey);  // 1: STOP button JPanel row_cmd = new JPanel(); FlowLayout flo_row_cmd =  new FlowLayout(FlowLayout.CENTER,10,1); row_cmd.setLayout(flo_row_cmd); row_cmd.setBackground(grey_pale); STOP.addActionListener(this); STOP.setBackground(red); STOP.setForeground(yellow); STOP.setFocusable(false); ft= STOP.getFont(); ft=new Font(ft.getFontName(),Font.BOLD,14);  STOP.setFont(ft); row_cmd.add(STOP); pane.add(row_cmd);  // 2: communication  // 3: progression  // 4: console Console console = System.console(); //FlowLayout flo_row_con =  new FlowLayout(FlowLayout.LEFT,10,10); //row_con.setLayout(flo_row_con); //row_con.setBackground(grey_pale);  frame.getContentPane().add(console); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);  //pane.add(row_con); //pane.validate(); setVisible(true); ???   How could I do? I don't have much experience with GUI components. Thank you.

How can I create an instance of the Java console inside of a GUI panel?


Can anyone provide a step-by-step guide to have Webex working on Ubuntu 18.04? I would like to participate in Webex meetings and share my screen.

There is no one guide that I have tried that results in a fully working WebEx on Linux. Typically audio is the feature hardest to get working. How do I get WebEx working with audio on Ubuntu?


I understand that ${{n \choose 2} \choose 2}$ is counting the number of unordered pairs of unordered pairs of $n$ elements. But I just can't seem to wrap my head around the LHS. of the identity from a counting point of view. Is there a way to simplify that side to make it have more intuitive sense?

Prove the following identity combinatorially  $$\left(\begin{array}{c} \left(\begin{array}{c} n \\ 2 \end{array}\right)  \\ 2 \end{array}\right) = 3 \left(\begin{array}{c} n \\ 4 \end{array}\right) + 3 \left(\begin{array}{c} n \\ 3 \end{array}\right) $$


I've noticed that when standardizing or centering the regressor(s), the p value for the intercept becomes smaller. Does this always happen? If so, why? I know that $$ var(\hat{\beta}) = \sigma^2(X^TX)^{-1}  $$ and that the t-stat is $$ t_i = \frac{\hat{\beta}_i}{SE(\hat{\beta}_i)} $$ I can't tell from this general equation, nor the ones for simple linear regression found in  why the $t_i$ will increase and thus result in a reduction in the p-value.

How do you show that the point of averages (x,y) lies on the estimated regression line?


[Noob Alert] I am new to texstudio, having shifted from texshop due to lack of tabs and code folding.  I need to compile two (or more) documents side by side with the tabs. I am unable to view (go to pdf) for one of them if the pdf of the other is active. Using internal pdf viewer.  The solution to this question preseneted in the link below did not work for me

I am editing two different TeX files simultaneously, the manuscript and the response for the referees, and generating pdf files through pdfLaTeX. How can I go from one pdf to another in the internal PDF viewer without recompiling the other file?


I have two tables, Table_A (DB1) and Table_A (DB2) in different databases (DB1 and DB2 respectively). In these two tables, price and quantity may differ (or may be the same) even if the item_id and store is the same.                   **Table_A (DB1)**     **item_id**  **store**   **price**   **quantity**       1           A            1           1      2           B            2           4      1           C            1           1      3           A            1           1      3           C            2           1      2           A            2           3      3           B            2           2                     **Table_A (DB2)**    **item_id**  **store**   **price**   **quantity**                  1           B            1           2      2           A            2           3   Now I want to delete all such records from Table_A (DB1) for which the item_id is not present in Table_A (DB2) (remember, these tables may have different price and quantity for a given combination of item_id and store). The table I intend to get is as shown below (Table_A (DB1)-updated):                  **Table_A (DB1)-updated**     **item_id**  **store**   **price**   **quantity**       3           A            1           1      3           C            2           1      3           B            2           2   To select such item_ids from Table_A (DB1)  for which the item_id is absent in Table_A (DB2), I am using the following query:   SELECT DISTINCT item_id FROM DB1.Table_A WHERE item_id NOT IN (SELECT DISTINCT item_id FROM DB2.Table_A);    The above query gives me list of item_id absent in Table_A (DB2) (but present in Table_A (DB1)).  Now I wish to delete all the records from Table_A (DB1) with item_ids that we obtained in above step. I also want to do the same in just one go. I am trying to run the following query but it returns an error.   DELETE FROM DB1.Table_A WHERE item_id IN  (SELECT DISTINCT item_id FROM DB1.Table_A WHERE item_id NOT IN (SELECT DISTINCT item_id FROM DB2.Table_A));   The error I get is:  Error Code: 1093. You can't specify target table 'Table_A' for update in FROM clause  Please help. Thank you.

I have a table story_category in my database with corrupt entries. The next query returns the corrupt entries:  SELECT *  FROM  story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category INNER JOIN         story_category ON category_id=category.id);   I tried to delete them executing:  DELETE FROM story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category        INNER JOIN story_category ON category_id=category.id);   But I get the next error:      #1093 - You can't specify target table 'story_category' for update in FROM clause    How can I overcome this?


I'm trying to learn and build my first program.  It is a program to work out a cars mpg.  I've created a variable that sets itself to the users iso3 code so when the program is used in different country, I can use it to change other variables in the code - ie. a gallon in the USA and the UK are slightly different so set the correct gallon value for what ever country the program is being used in.  The problem I've got is creating an if statement to get it to work.   Locale defaultLocale = Locale.getDefault(); String usercountry = (defaultLocale.getISO3Country());   I've tried this:  if (usercountry == USA{     mpg = mpg*0.83; }   And this:  if (usercountry.equals(USA)){     mpg = mpg*0.83; }   But both come back saying USA cannot be resolved to a variable. Am I missing something small or am I going about it the wrong way? Thanks in advance.

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?


My centos 5.7 is running Magento.  4GB RAM and 4 Cores. Nginx + spwan-fcgi + memcached (Best performance if you ask me).  Now i'm a little bit concerned about the Memory usage.  [root@adikastyle shipment]# free -m              total       used       free     shared    buffers     cached Mem:          3948       3712        236          0        224       **2377** -/+ buffers/cache:       1109       2839 Swap:        10975          0      10975   I've seen in few forum's this command:  # sync; echo 3 > /proc/sys/vm/drop_caches   the website is fast and handle many cur-connections.   but the cache is really strange..   Is this command is safe for production? Does the 2377MB of cache is good ? Do i have to change something?   Thanks.

In our servers we have a habit of dropping caches at midnight.   sync; echo 3 > /proc/sys/vm/drop_caches   When I run the code it seems to free up lots of RAM, but do I really need to do that. Isn't free RAM a waste?


Hello everyone, I have a serious issue, i can't compile any c program, i get the following error : /usr/bin/ld: 1: Syntax error: newline unexpected collect2: ld returned 2 exit status  I have found on the net this solution but it doesn't work for me : sudo apt-get autoremove binutils     sudo apt-get install binutils  Any tips for this please ? I was doing some FairThreads in C, so i got to use the lib -lfthread. And i used a make file which has his LIB_DIR at usr/bin/ld I runned a make command and that was probably what caused all this... This is what the make file contains : INCL_DIR    = ../include LIB_DIR     = usr/bin/ld  ############################################################## MAKE        = make CC      = gcc AR      = ar RANLIB      = ranlib  ############################################################## LIBS        = -lfthread -lpthread #LIBS       = -lposix4 -lfthread -lpthread # for solaris  ############################################################## ############################################################## CFLAGS      = -Wall -O3 -D_REENTRANT  ############ Basic libraries ################################# LIB_NAME    = fthread LIBFT           = lib$(LIB_NAME).a  ############ C code to executable code ######################## .c.o :     $(CC) $(CFLAGS) -c $<  ############ The h files ###################################### HFILES        = fthread.h fthread_internal.h \                 event.h thread.h scheduler.h \                 broadcastlist.h locklist.h threadlist.h \                 environment.h trace.h verify.h  ############ The C files ###################################### CFILES        = event.c thread.c scheduler.c \                 broadcastlist.c locklist.c threadlist.c \                 environment.c automaton.c instruction.c  ############ The object files ################################## OBJS          = event.o thread.o scheduler.o \                 broadcastlist.o locklist.o threadlist.o \                 environment.o automaton.o instruction.o  ############ Make entries ###################################### all: lib  lib: $(HFILE) $(OBJS)     $(AR) r $(LIBFT) $(OBJS)     - $(RANLIB) $(LIBFT)  install: lib     cp $(LIBFT) $(LIB_DIR)     cp fthread.h $(INCL_DIR)  clean:     - rm -rf *.o *~ $(LIBFT) a.out  ############ Auxiliary ######################################## TEST        = test.c  lines:     wc -l $(CFILES) $(HFILES)  test:all     $(CC) $(CFLAGS) -I. -L. $(TEST) $(LIBS)     a.out  ############ Dependencies ######################################## $(OBJS): $(HFILE)  ############ end of makefile #####################################  I can normally execute files which are already compiled, but i can't compile anything. eg : #include <stdio.h> int main(void) {printf("Hello world");  return 0;}  when i compile this program by the command : gcc -o hello hello.c   I get the same error : /usr/bin/ld: 2: /usr/bin/ld: Syntax error: newline unexpected collect2: error: ld returned 2 exit status

It's my second post here, i have a huge problem which prevents me to study so i have to fix it as soon as it's possible ! My gcc was working fine and i had to work on FairThreads (in C). I downloaded the following archive :  As you can see, in /src there's a makeFile, i replaced the second line which was : LIB_DIR     = ../lib  by LIB_DIR     =  /usr/bin/ld and i compiled the makeFile by the command "make" And now, i cannot compile any c/c++ program anymore. Even a hello world program. I got the following error message on the terminal for every compiling attempt : /usr/bin/ld: 2: /usr/bin/ld: Syntax error: newline unexpected collect2: error: ld returned 2 exit status  I have found on the net this solution but it doesn't work for me : sudo apt-get autoremove binutils     sudo apt-get install binutils  I also tried to reinstall gcc, when executing : sudo apt-get purge gcc   i got : Des erreurs ont été rencontrées pendant l'exécution :   linux-firmware   linux-image-generic-hwe-18.04   linux-generic-hwe-18.04 E: Sub-process /usr/bin/dpkg returned an error code (1)  but when i trie a gcc --version it tells me that it is not found. So when i execute the command to reintall it : sudo apt-get install gcc   i also get : Des erreurs ont été rencontrées pendant l'exécution :  linux-firmware  linux-image-generic-hwe-18.04  linux-generic-hwe-18.04  linux-image-5.4.0-72-generic  initramfs-tools E: Sub-process /usr/bin/dpkg returned an error code (1)  but gcc --version tellls that it's installed. Finally, when i trie to compile a program, i got : /usr/bin/ld: 2: /usr/bin/ld: Syntax error: newline unexpected collect2: error: ld returned 2 exit status  I hope that i explained well, and i'll get a solution for this :/, as a computer science student, i can't do anything without gcc :( EDIT 1 : When i try to remove bin/ld by executing : sudo rm -fr /usr/bin/ld;sudo apt-get install --reinstall binutils  i got : Des erreurs ont été rencontrées pendant l'exécution :  linux-firmware  linux-image-generic-hwe-18.04  linux-generic-hwe-18.04  linux-image-5.4.0-72-generic  initramfs-tools E: Sub-process /usr/bin/dpkg returned an error code (1)  and this particular error message : WARNING: no ldd around - install libc-bin  EDIT : I have installed ldd by the command : sudo apt-get install libc-bin  still no changes...


The google definition of this word states that it is a noun however in its own example of usage it is used as an adjective: "a frail, milquetoast character". I haven't found any reliable sources to say that it can be used as an adjective so I'm wondering if it would actually be correct to use this word as an adjective.

I read this recently in :     At the end of the summit, the French and European officials had   claimed a points victory over the Germans by getting them to agree   more firmly to a target date of January 1st next year to entrust the   European Central Bank (ECB) with the ultimate authority to supervise   the euro zone’s 6,000-odd banks.   "Points" is a plural, and I suppose it doesn't function as a noun in this sentence since it's following the article "a", so is it an adjective adorning "victory"?


There are many questions/answers on Stack Exchange and elsewhere regarding underlining text in latex. After reading (a selection of) these, I tend to use \underline{...}. I have one (fairly major) complaint.  The vertical spacing changes dependent on .... Eg, \underline{words} looks fine, while \underline{writings} looks (in my opinion) awful because the line is placed so far below the text, so as to be sufficiently below the g.  With a g, due to the fact that the bit below the line is the full width of the letter, one can get around this with \underline{writin}g\underline{s} (most unsatisfactory). However, something like that doesn't work for p or q.  How can I force the underline to be placed at the natural height below the word (such as in the case \underline{text} for all words? (The line would then pass through parts of a g, p or q.)

I'm very well aware that it is considered best practice not to use underlining other than on typewriters and in handwriting. But sometimes it is needed nonetheless.  In my opinion the typographically least offending way to underline in print is to leave out the descenders. This is also how I learned to do it in handwriting. Very few fonts offer a pre-made underlined variant, but some text-processors (e.g. OS X text-engine) do -- depending on the font used -- an acceptable job at emulating this effect:    How would I tweak any of the existing ways/packages for underlining to do the same?  As a bonus, I'd like to be able to tweak the behaviour (extent of the omitted part, apply to which letters) per font and text style, preferably working with XeLaTeX.


After upgrading to 13.10 I'm unable to use Dash. Nothing appears when I type something, I don't see any icons or shortcuts.   Resetting unity does not help, the command is unavailable.  What should I do?

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


I am new to coding (and this site) and want to know if it would be appropriate to post asking for help refactoring.  I do not know how to simplify or refactor anonymous inner classes.  I guess I could place the whole thing in its own method but I'm wondering if there are other solutions.  I am using action listener to add elements to a table and it is working as intended.  The issue I am having is that my anonymous inner class is rather huge and I don't really know how to refactor those.  What solution is generally used when anonymous inner classes get too big?  Can it be simplified with lambda expressions (I know I would need to post the code for this to be answered/answerable)?  These questions seem like they might be too vague to be acceptable on this website so I wanted to know if it was appropriate to ask for help with this here.  If not here, does anybody have any suggestions for other websites or more education on the topic?

There seems to be more than a few computer science/programming Stack Exchange networks (is that the correct term?). Stack Overflow, being the first, has by far the most users, questions, and answers.  What is the reasoning for creating the others, and are there clear guidelines for which kinds of questions should be posted? I can see a large amount of potential overflow, many cases of people not getting a good answer to their question, because the person who has the answer isn't browsing that particular network at the moment.  I understand that they were probably created for organizational purposes, but wouldn't it almost make more sense to just have them as categories under Stack Overflow, keep them separated but still connected, instead of making people have to create multiple 'account's, one for each network?  I am sure there was a very good reason to break them up, but as someone that is new to SE, it can be somewhat intimidating to decide which one to post in to ensure you get a good answer. For example, if I am a computer science student, my first instinct might to be to post in the computer science network, until I see that it literally has 1% of the users as the Stack Overflow network, which still seems to be for programming/computer science related questions.  So my second instinct would then to be to post it into the Stack Overflow site on the basis that I have a significantly higher chance of my question being seen and getting a good answer. Then I notice that there is also a 'programmers' network, and I don't even begin to know where that fits in. I, and I am assuming most people, will probably just post on Stack Overflow to be safe.  My question is, other than the short little description blurb of each one, is there a clear cut set of guidelines which what each network is intended for, what kinds of questions should go to each one, and is anything being done to encourage people to post in these newer, smaller (more specialized?) networks as opposed to just posting in big daddy Stack Overflow?  Now again, this is for computer science/programming/"why isn't this code doing what I want?" related questions, I am not saying that if I had a question about Linux or WordPress or something I would have the same confusion.


We can often see in online group conversations messages composed of random letters like "fjqofudnelfi" as a response to something surprising or unexpected.  Is there a name for this kind of "behaviour" ?  More precisely: is there a name for the action of furiously typing a random string on the keyboard?  Thank you  P.S. I couldn't find anything online as I didn't know how to concisely describe it.

Or, in other words, is     asdf;ksa;llfsdfsadfasdk;lfjasjfdk;lasfjldfjsafjdsl;fjajfdlksaj   called something?  Does this specific phenomenon have a name?  Could you refer to it generically, as in, "The screen was filled with [the term]"  You get it by "mashing your keyboard" and I once saw keyboard mash associated with it, but I'm not sure if it was just describing the action or naming the product.  Likely if you referred to it by producing it in brief, i.e., "asdfasdf", people would know what you're talking about—but I started wondering about a general term after noting that my own version of this, tumbling out of a Dvorak layout, looks different:     asaoteosantehustnaoheusnaohsuetnaotnhuehsaoeutnsoa   It seems there might be a space for a generic descriptor, given QWERTZ or AZERTY-specific variations, or possible equivalents on more esoteric devices (like stenotypes).


Let $f \colon \mathbb R \rightarrow \mathbb R$ be Lebesgue measurable. Show that there exist Borel measurable functions $g, h \colon \mathbb R \rightarrow \mathbb R$ such that  $g(x) \leq f(x) \leq h(x) \ \  \forall x\in \mathbb R$ and $m(\{ x: g(x) \neq h(x) \}) = 0$  I try by using simple approximation lemma that tells me i can find simple functions $\varphi$ and $\psi$ such that $\varphi \leq f \leq \psi$ and $0 \leq \psi - \varphi < \epsilon $ on $E$  On the other hand, since $E$ has finite measure, there exist an $F_{\sigma}$ set $F$ and $G_{\delta}$ set $G$ , both Borel sets, such that $F \subset E \subset G$ and $m^*(F) = m^*(E) = m^*(G)$  Now i can define $g$ and $h$ using characteristic functions on $F$ and $G$ but i am not sure if i am right or how to write the functions?  Any help, Thanks.

Let $f$ be a real-valued Lebesgue measurable function on $\mathbb{R}$. Prove that there exist Borel measurable functions $g$ and $h$ such that $g(x)=h(x)$ almost everywhere and $g(x)\le f(x) \le h(x)$ for every $x \in \mathbb R$. I know that $f$ is measurable since there exists a sequence of simple function that converges to $f$. I have no further idea how to tackle this problem.


I was reviewing a post in the First Posts Queue when I came across a question I wanted to answer, for reference the question I am talking about is linked this one:    I noticed some easy edits that would make it look nice however when I clicked the edit button nothing happened (as if the edit link was dead).  I opened the question in a normal link and the warning regarding an edit is curently waiting popped up:    I would imagine that in the a review queue if someone tries to edit a question (as they would in a normal question) this warning should also pop up but it did not for me.  Is this a bug?

While reviewing First Posts on Super User, I noticed that I couldn't edit this question (see below). Clicking the "edit" link simply does nothing. Editing is not possible for me right now because I have already five suggested edits pending. It used to be the case that the link would've been grayed out (and the reason shown as a popover). , and while I'm not sure it's an improvement, the current implementation needs some fixing at least.  This bug appears regardless of the actual reason that the edit isn't possible; for instance,  is another user experiencing the same bug who couldn't suggest an edit because of an already pending one. Apparently, I'm far from the only one who experiences this issue. As of last Sunday morning,  have been posted networkwide (and are still alive) and  is #16.


I just deployed a Ruby on Rails one click app to an Ubuntu server. I was curious where I go in to edit the home page of the app. The domain is "gitship.com". When I look throughout the server, I can't find the index.html or something like this to edit the home page and background image from the "Yay you're on rails" screen with the earth background.

My homepage (or welcome page) will consist of data from two models (lets call them authors and posts). I am new to rails and not sure what is the best way to accomplish this.  Should I create a new controller called welcome which gathers data from the authors and posts and then display them in the welcome index view? Or should I have a welcome view under the post model which also gets data from authors? Or any other way to accomplish this?  I understand how to do all this technically but just unsure what is the best practice method using the rails framework.


I have a requirement that uses filters based on closedDate for cases.  When unit testing this logic I will need to create cases with a closeDate in the past but since it is not a writeable field I haven't got very far. I have some options like creating a custom date field to capture the closeddate and use this in the unit tests or using test.loaddata which lets you write on audit fields(I haven't tried it with ClosedDate yet). Has anyone come up with an efficient way of doing this? maybe looking at something like the test.setCreatedDate function but can't find anything similar for closeddate  Thanks!

I am writting a test method, where I have to set closedate of a case record to an old date.  I know, i can make Status to "closed", but it will give you close date as Today.  Is there any other way, where I can set the close date to an old date?


I need to create a kid night light with lot of star shape hole, but I don't understand how can I get the stars to get the same angle that the sphere.  I played with simple deformation modifier but don't seems to manage it How can I do that properly ? also as I need probably 20 stars around, will I need to do manually or can I do all in one?

I want to replicate this mesh -    I think the best way is using a particle system of cubes. So I need to create a sphere of simple circles. It is necessary that in each circle the vertices are at equal distance from each other. But I don't know how to create those circles.


I have a user like this:  uid=501(ironsand) gid=500(foo) groups=500(foo),10(wheel),497(git),501(ironsand)   And to change primary group to ironsand like gid=501(ironsand), I typed this command:  sudo usermod -g ironsand ironsand   It changed groups order but didn't change main group like:  uid=501(ironsand) gid=500(foo) groups=501(ironsand),10(wheel),497(git),500(foo)   I thought someone already asked a question like this, but I couldn't find one.  How can I change primary group?

Being new to Linux administration, I'm a little confused about the following commands:  useradd usermod groupadd groupmod   I've just finished reading the user administration book in the Linux/Unix Administrator's handbook, but some things are still a little hazy.  Basically useradd seems straight forward enough:  useradd -c "David Hilbert" -d /home/math/hilbert -g faculty -G famous -m -s /bin/sh hilbert   I can add "David Hilbert" with username hilbert , setting his default directory, shell, and groups. And I think that -g is his primary/default group and -G are his other groups.  So these are my next questions:   Would this command still work if the groups faculty and famous did not exist? Would it just create them? If not, what command do I use to create new groups? If I remove the user hilbert and there are no other users in those groups, will they still exist? Should I remove them? After I run the useradd command above, how do I remove David from the famous group, and reassign his primary group to hilbert which does not yet exist?


As of Ubuntu 18.04 running lsblk shows 16 snap loops (2-3 times for each snap). The question is, why are they being listed as results for lsblk, fdisf-l, and blkid?    It creates a lot of clutter from the actual disks drive partitions I need to see, namely /dev/ partitions. I know a purported duplicate of this question exists, but it only asks why three loops are being listed per snap. I want to know why these snaps are being listed in the first place, and the purported duplicate does not answer this (perhaps those marking this as duplicate could help me by explaining why it is a duplicate). Technically, they qualify as file systems (which I neither created nor asked for), but they are getting in the way of the information output for the /dev/ partitions I am interested in. This becomes a problem when fdisk -l outputs a three page+ list filled mainly with snaps.  The output of a recent (1 week old) Ubuntu install and I have not installed any snaps:    $ lsblk   NAME   MAJ:MIN RM   SIZE RO TYPE MOUNTPOINT   loop0    7:0    0  14.5M  1 loop /snap/gnome-logs/37   loop1    7:1    0   2.3M  1 loop /snap/gnome-calculator/170   loop2    7:2    0  86.6M  1 loop /snap/core/4486   loop3    7:3    0  86.6M  1 loop /snap/core/4650   loop4    7:4    0   1.6M  1 loop /snap/gnome-calculator/154   loop5    7:5    0  14.5M  1 loop /snap/gnome-logs/34   loop6    7:6    0   3.3M  1 loop /snap/gnome-system-monitor/36   loop7    7:7    0   2.3M  1 loop /snap/gnome-calculator/178   loop8    7:8    0    13M  1 loop /snap/gnome-characters/101   loop9    7:9    0   3.7M  1 loop /snap/gnome-system-monitor/45   loop10   7:10   0 139.5M  1 loop /snap/gnome-3-26-1604/64   loop11   7:11   0   140M  1 loop /snap/gnome-3-26-1604/59    loop12   7:12   0   3.7M  1 loop /snap/gnome-system-monitor/41   loop13   7:13   0    21M  1 loop /snap/gnome-logs/25   loop14   7:14   0  12.2M  1 loop /snap/gnome-characters/69   loop15   7:15   0    13M  1 loop /snap/gnome-characters/96   sda      8:0    0 298.1G  0 disk   ├─sda1   8:1    0   512M  0 part /boot/efi   └─sda2   8:2    0 297.6G  0 part /   sr0     11:0    1  1024M  0 rom     (supplemental screen capture of above text):     My snap list shows 6 results:       core   gnome-3-26-1604   gnome-calculator   gnome-characters   gnome-logs   gnome-system-monitor     Meanwhile, gnome-disk-utility shows nothing at all for snaps, only showing my HDD and optical drive.    It won't be very efficient if every installed snap gets listed as a block device (2-3 times each to add). Should I expect future updates to deal with this?  Edit: fdisk-l also dumps out a very long list with 16 instances of these "disk loops" (Disk /dev/loop0, Disk /dev/loop1, etc., each with details which I won't show here because it's too long). This can't be intended behaviour, can it? blkid also lists 16 loops, as TYPE="squashfs". At least parted -l works as expected, only outing my actual disk partitions.    I just tested this, and installing more snaps does add more to the lsblk output. Therefore, fdisk, lsblk, blkid could have potentially huge output lists, according to the number of snaps available, and installed.


I have two functions in a code, one using map() and the other, filter() const eip = [...new Map(elasticIps.map(e  => [e.publicIp, e])).values()];  const eip = elasticIps.filter((v,i,a)=>a.findIndex(t=>(t.publicIp === v.publicIp))===i)  They both do exactly the same thing for me, but I don't know the best way to find out which is faster

CPU Cycles, Memory Usage, Execution Time, etc.?  Added: Is there a quantitative way of testing performance in JavaScript besides just perception of how fast the code runs?


I'm trying to draw several rectangles next to each other, and the last rectangle on the queue without the right border.  \documentclass{article} \usepackage{tikz} \usetikzlibrary{arrows,shapes,positioning} \begin{document} \begin{tikzpicture}     \tikzstyle{t1} = [rectangle, fill=white, draw=black, minimum width=0.7cm, minimum height=0.9cm, inner sep=2pt]   \tikzstyle{t2} = [rectangle, fill=white, draw=black, minimum width=1.4cm, minimum height=0.9cm, inner sep=2pt]   \tikzstyle{arrow} = [->, >=stealth', auto, thick, draw=black]   \node[t1] (q1ax) {AX};   \node[t2] (q1bx) [right=-0.1mm of q1ax] {BX};   \node[t1] (q1cx) [right=-0.1mm of q1bx] {CX};   \node[t1] (q1dx) [right=-0.1mm of q1cx] {DX};   \node[t2] (q1ex) [right=-0.1mm of q1dx] {EX};   \node[t1] (q1dots) [right=-0.1mm of q1ex] {...};   \node[t1] (q2ax) [below right=2cm and 1cm of q1bx] {AX};   \node[t2] (q2bx) [right=-0.1mm of q2ax] {BX};   \node[t1] (q2cx) [right=-0.1mm of q2bx] {CX};   \node[t1] (q2dx) [right=-0.1mm of q2cx] {DX};   \node[t2] (q2ex) [right=-0.1mm of q2dx] {EX};   \node[t1] (q2dots) [right=-0.1mm of q2ex] {..};     \draw[arrow] (q1bx.south) -- (q2cx.north);   \draw[arrow] (q1dx.south) -- (q2ax.north); \end{tikzpicture} \end{document}     Please, how can I hide the border to get this result?

I would like to draw two consecutive rectangle nodes (one is next to the other with an intersected edge). How to cut one side of a rectangle node in TikZ so that the intersected side looks like others?   Consider the example below, I don't want the "duplicated" edge between node 1 and 2.   \begin{tikzpicture}    \node [style={draw, inner sep=0pt, minimum size=0.5cm}]           (1) at (0, 0)  { $1$ };   \node [style={draw, inner sep=0pt, minimum size=0.5cm}]           (2) at (0.5, 0)  { $2$ };  \end{tikzpicture}


I have created a polygon in QGIS (in this case it describes a country's maritime baseline).  I need to create a second polygon whose boundary is a fixed distance from the original polygon. (in this case I need to create the territorial sea boundary, which lies 12 nautical miles outside the baseline).  I think geoprocessing tools>buffer is correct tool for this job? But I can't figure out what units QGIS uses for the buffer distance.  What should I enter in buffer distance to generate a 12nm buffer?

I'm very new to the GIS world, so my problem could be very stupid, but I'm going to try anyway.  Objective  Given a list of coordinates in longitude/latitude, stored as a .csv file, I want to create a buffer with distance of x km around those coordinates. (In case this is relevant, these coordinates are locations of the societies in the . These societies scatter all around the world.)  Problem  I'm only able to create buffers with distance in radial degrees, but I want to do them in (kilo)meters. I'm aware of the following Q&A's, but following what's suggested therein doesn't seem to solve my problem:          What I have tried...   I start QGIS (v2.4), and Add delimited text layer  choose my .csv file and the x/y fields, click OK select WGS 84 as my CRS (also tried NAD83 but didn't make a difference), click OK right-click on layer and select Save As..., in the dialog box, choose the following and click OK:  add sccs_meter.shp as layer to the current project Select Vector > Geoprocessing Tools > Buffers > set buffer distance as 10   The result is a buffer with radius of approximately 1068km, which suggests that buffer distance is 10 degrees rather than 10 meters.  What did I do wrong here?


It's really confusing to choose the correct tense between simple past and present perfect.  Let's assume one situation:  Every student has to bring his/her own name tag to the class, but today I forgot to bring it. If a professor notices that I'm not with the name tag now, she would ask me:   'Don't you have your name tag?'   Then I would say:   'Yes. I have the name tag but I forgot to bring it', right?   But is it okay for me to say:   'Yes. I have the name tag but I didn't bring it', or 'Yes. I have the name tag but I haven't brought it.'   Which one is correct between 'I didn't bring it' and 'I haven't brought it'? (So confusing to pick up the right tense.)

I didn't grow out of it.   or      I haven't grown out of it.    Which sentence is grammatically more correct? I'd rather say the second, but  I saw in the text the first one.


There are many new words being added to the dictionary at all times. These include "twerking" or "Google" but who decides if it should be in the dictionary and be an English word?  Here is my theory. One super big company like Oxford, decides that this particular word should be added. Then many other companies just copy them like sheep?  Show what really makes an English word an English word?

is a typical example for , though it is said that long time no see has been accepted by the mainstream English speakers.  Recently, there is a  movement in the , and a few new Chinglish words have been invented to demonstrate the characteristics of the Mainland.  The most outstanding examples (in my opinion) are:   shitizen - a citizen without citizen rights freedamn - the freedom for shitizens (no freedom) democrazy - the democracy for shitizens (no democracy) smilence - the speeches under the freedamn of speech () z-turn - to make effort in vain ( (Pinyin))   Here are my questions. Has there ever been any neologism movement in the history of English? What are the criteria to adopt new words into English?


Let $G$ be a group of order $p^kq$ with $p$ and $q$ distinct primes and $k \geqslant 1$. I have to prove that $G$ has a subgroup of order $p^k$ using the third isomorphism theorem and induction on $k$. I have tried to play around a bit with definitions and theorems but I can't seem to figure it out. I found some help on other posts but none use the third isomorphism theorem. Thanks in advance!

I'm trying to figure out this problem:  Problem: Let $G$ be a group of order $p^k q$ with $p$ and $q$ distinct primes and $k \in \mathbb{N} \setminus \left\{0\right\}$.   a) Prove: $G$ has a subgroup of order $p^k$, or $p$ divides $|Z(G)|$. (Here $Z(G)$ means the center of $G$).   b) Prove: if $p$ divides $| Z(G)|$, there there exists an $x \in Z(G)$ of order $p$.   Attempt: For a) I tried proceeding by induction.  Base step: Assume $k=1$. Then $|G| = pq$ with $p \neq q$. Case 1: if $G$ is commutative, then $Z(G) = G$ and then $p$ divides $|Z(G)|$.   Case 2: Assume $G$ is not commutative. Then the center of $G$ is trivial, i.e. $Z(G) = \left\{e_G\right\}$ (this is a theorem of group theory). So $p$ does not divide $|Z(G)|$. Then we must show that $G$ has a subgroup of order $p$. Let $H$ be a non-trivial subgroup of $G$, that is $H \neq G$ and $H \neq \left\{e\right\}$. Then by Lagrange, $|H|$ divides $pq$. So we must have either that $|H| = p$ or $|H| = q$ (is this correct? Since $H$ is non-trivial). If $|H| = p$ then we are done. If $| H | = q$, then $|G / H| = p$ and so $G/H$ is cyclic. I want to derive a contradiction from this, and so show that $H$ cannot have order $q$, but I don't know how.  Induction step: Assume the claim holds for $|G| = p^{k-1} q$. We must then show that it also holds for $|G| = p^k q$.  I want to use the class equation. We have that $$ p^k q = |Z(G)| + \sum_{i=m+1}^n |Cl(a_i)| $$ where $|Cl(a_1)| = \ldots = |Cl(a_m)| = 1$ and $|Cl(a_i)| > 1$ for $i > m $. Since $p$ is a divisor of the LHS, it must also divide the linear combination. But how can I conclude from this that $p$ divides $| Z(G)|$ ? I don't know how to use the induction hypothesis.   b) Assume $p$ divides $|Z(G)|$. I first assume that $G$ is abelian. Then by structure theorem for finite abelian groups, we know that $$ G \cong \mathbb{Z}_{p_1^{k_1}} \oplus \ldots \oplus \mathbb{Z}_{p_r^{k_r}}. $$ This means that $$ p^k q = p_1^{k_1} \ldots p_r^{k_r}. $$ So $p | (p_1^{k_1} \ldots p_r^{k_r})$ and so since $p$ is prime, $p$ must divide at least one factor. Assume that $p$ divides $p_i^{k_i}$. Since $p_i^{k_i} = p_i \ldots p_i$ with $k_i$-amount of factors, we must again have that $p$ divides $p_i$. So $p = p_i$.   Now, since every $\mathbb{Z}_{p_i^{k_i}} = \mathbb{Z}_p^{k_i}$ is abelian, we have that the center equals the whole group. Let $x_i$ be an element in this center. Then $order(x_i) | p^{k_i}$ and so $order(x_i) | p$. Hence the order of $x_i$ equals $p$ in $\mathbb{Z}_p^{k_i}$. Since $x_i$ is also in $Z(G)$, this concludes the proof?   And what about the case that $G$ is not abelian?  Help with this problem is appreciated!


I'm currently on ubuntu 12.04 and since this is an older version of ubuntu i have git 1.7.9.5 installed and i'm not sure how i can upgrade this to git 2.x.   what do i type to install git 2.x (sudo apt-get install git)? when installing git 2.x, does it overwrite git 1.7? if not how do you choose which one to use? how do i find out where git 1.7 is installed on my system?

I read about a security flaw in Git, which was fixed in version 2.2.1. I currently have Git 2.1.0 on my system (Ubuntu 14.10), and tried to reinstall it with apt. However, apt told me that I currently have the latest version.  The Git website does not have prebuilt versions for Linux. They say that you can install it with package managers. Without building from source, how would I install the latest version of Git?


I have a multi-monitor setup which looks like this:    The resolutions are correct (all are 1080p), but the sizes are incorrect and I can't seem to find where to change the size (so the cursor will jump to the correct position). In reality the size difference between monitor 1 and 2 are this:    This is bad because the mouse pointer then jumps, example: if you move from left edge of screen one(1) to screen two(2) (vertically up), the cursor jumps 15 cm to the left, this is unwanted behaviour.   How can I change the screen size in Windows to reflect the real size of my screens (NOT THE SCREEN RESOLUTION!) ?  I'm using Windows 10 but would need to know this for Windows 7 too if possible.

I have a 3 display windows 8 system.  Two are 24" monitors and one is a 27" monitor.  The 27" monitor is in the middle and one of the 24" monitors is flipped portrait on the right.  When I go to the screen resolution dialog box in Windows the 24" monitor and the 27" monitor appear to be the same size.  This means that the edges of the window don't line up.  Similarly the 27" monitor and the portrait monitor don't line up in the sense that when the mouse goes from the top of the 27" monitor to the portrait monitor, the pointer jumps downward.  However if I go from the bottom of the 27" monitor to the portrait monitor the pointer lines up correctly and transitions smoothly.      The screen Resolution window correctly identifies my 27" monitor as a Dell S2740L and the driver is up to date.  Also if it is relevant, the 27" monitor is hooked up using HDMI, the left monitor is hooked up using DVI and the portrait monitor is hooked up with HDMI -> DisplayPort with an Active HDMI to DisplayPort adapter.


I'm trying to run htop on Ubuntu 16.04.1 LTS. Until the end of last week the command was working fine, and I haven't made any major changes to the system since then. Now, when I attempt to run htop, the screen goes black and I'm unable to exit using Ctrl-C, Ctrl-Z, q, or any of the standard escape characters. I'm forced to restart the terminal.  top still works just fine.  EDIT2: I ran  strace -o strace.log -f xterm -e htop   Examination of the output reveals that the htop reads all the existing processes until it gets to the last one, where it does      41049 read(5, "72165 (python) D 1 72113 72069 0"..., 2048) = 190     41049 read(5, "", 1858)                 = 0     41049 close(5)                          = 0     41049 stat("/proc/72113/task/72165", {st_mode=S_IFDIR|0555, st_size=0, ...}) = 0     41049 open("/proc/72113/task/72165/cmdline", O_RDONLY) = 5     41049 read(5,  <unfinished ...>   and then it never finishes reading the file.  Running ps -ef also causes the terminal to hang. It prints the names of all the processes before 72113, and then it freezes at 72113 and can't be escaped without closing the terminal.  If I type      sudo less /proc/72113/task/72165/cmdline   the terminal hangs. I have also tried       sudo kill -9 72113   which runs but does nothing; htop and ps -ef still freeze when run.  I'm puzzled about what's going on here.

There are 5 processes which can't be killed by kill -9 $PID and executing cat /proc/$PID/cmdline will hang the current session. Maybe they're zombie processes.  Executing ps -ef or htop will also hang the current session. But top and ps -e are working fine.  So it seems that there are two problems the filesystem not responding.  This is a production machine running virtual machines, so rebooting isn't an option.  The following processes ids aren't working: 16181 16765 5985 7427 7547  The parent of these processes is init          ├─collectd(16765)─┬─{collectd}(16776)         │                 ├─{collectd}(16777)         │                 ├─{collectd}(16778)         │                 ├─{collectd}(16779)         │                 ├─{collectd}(16780)         │                 └─{collectd}(16781)         ├─collectd(28642)───{collectd}(28650)         ├─collectd(29868)─┬─{collectd}(29873)         │                 ├─{collectd}(29874)         │                 ├─{collectd}(29875)         │                 └─{collectd}(29876)   And one of the qemu processes not working  |-qemu-system-x86(16181)-+-{qemu-system-x86}(16232) |                        |-{qemu-system-x86}(16238) |                        |-{qemu-system-x86}(16803) |                        |-{qemu-system-x86}(17990) |                        |-{qemu-system-x86}(17991) |                        |-{qemu-system-x86}(17992) |                        |-{qemu-system-x86}(18062) |                        |-{qemu-system-x86}(18066) |                        |-{qemu-system-x86}(18072) |                        |-{qemu-system-x86}(18073) |                        |-{qemu-system-x86}(18074) |                        |-{qemu-system-x86}(18078) |                        |-{qemu-system-x86}(18079) |                        |-{qemu-system-x86}(18086) |                        |-{qemu-system-x86}(18088) |                        |-{qemu-system-x86}(18092) |                        |-{qemu-system-x86}(18107) |                        |-{qemu-system-x86}(18108) |                        |-{qemu-system-x86}(18111) |                        |-{qemu-system-x86}(18113) |                        |-{qemu-system-x86}(18114) |                        |-{qemu-system-x86}(18119) |                        |-{qemu-system-x86}(23147) |                        `-{qemu-system-x86}(27051)


How can you unlock Cyrus in Animal Crossing New Leaf? I don't know how to unlock Cyrus.

Reese's boyfriend seems to constantly be asleep. When I try and talk to him, she warns me that he's been hard at work all night, but I can't actually enter the shop at night.   Is there any way to talk to him or any benefit for doing so? I've tried to talk to him daily for a week (thinking it was something akin to talking to Sable) but I've had no luck. Trying to come in after-hours doesn't work.


Links to tags are not hidden by spoilers:      are issues in spoilers   For a start why? I don't see what purpose being able to see the outline of a tag (it is more visible on other sites) when all other pieces of text are hidden.  It has proved problematic in several cases, especially on Puzzling, where hidden answers are imperative 90% of the time.   Also can this be changed? I don't want to cause a massive fuss, so if this is too big to sort out, then don't worry about it.

Tags in spoilers are always visible, even if you don't put your mouse on the spoiler (on  for example). See the screenshot:      Looks a bit strange on this site too:        that needs !


I had thought that the current trend towards 'one colour photos' was being called 'monochrome' but can't seem to find any examples.   The attached picture illustrates what I am referring to. The photo has been darkened and edited to match the colour palette of the website.    The technique is referred to in

I would like to use the overlay effect used on the screenshot(s) below.    I've tried experimenting with several Blending modes but keep missing the mark. I'm sure this has a very easy answer but I'm having trouble recreating the effect on my own.  Here are a few more images for further context:        Thanks in advance for your help.


Is it simply a matter of preference or is there any good reason to use one over the other.. performance wise?? :  string x = (serialNbr != "")?serialNbr:String.Empty;   vs.  string x; if(serialNbr == "") {     x = String.Empty; } else {     x = serialNbr; }

I've been trying to optimize my code to make it a little more concise and readable and was hoping I wasn't causing poorer performance from doing it.  I think my changes might have slowed down my application, but it might just be in my head.  Is there any performance difference between:  Command.Parameters["@EMAIL"].Value = email ?? String.Empty;   and  Command.Parameters["@EMAIL"].Value = (email == null) ? String.Empty: email;   and  if (email == null) {     Command.Parameters["@EMAIL"].Value = String.Empty } else {     Command.Parameters["@EMAIL"].Value = email }   My preference for readability would be the null coalescing operator, I just didn't want it to affect performance.


When I search in Finder there are no results.    There are no results as I am typing, nor after pressing return.  There is no loading spinner which usually appears at the bottom of the window.  The loading cursor will sometimes appear, while hovering over the Finder window, after attempting a search. Spotlight searches work with no problems. On another account, both Finder searches and Spotlight searches work fine.   My troubleshooting:   I rebuilt Spotlight's index for the entire Mac, relaunched Finder, restarted, but there was no change. I trashed Finder's plist (com.apple.finder.plist) and relauched Finder to no effect. I reset Spotlight with the "sudo" method in Terminal , relaunched Finder but it didn't have any effect.     Specs:  iMac, 2009 Processor: 2.8 GHz Intel Core i7 Memory: 8GB Storage: 1TB SATA Disk OS X Yosemite 10.10.3 Finder Version 10.10.4

Ever since I upgraded to Yosemite, search no longer works properly in Finder. Spotlight works fine but Finder search just gives me a blank window with a spinning ball.  I've tried reindexing and I've also tried deleting Spotlight's .plist file. I restart my MacBook Pro after doing either. Finder search will work for one or two queries and stop again. I don't know what else I can do.


Ubuntu 18.04, Gnome. I'd like to hide my drive that's dedicated to windows, in my Nautilus file explorer, under other locations.   I already used "disks" app to edit mount options of that disk and unchecked "show in user interface" and "mount at system startup". Rebooted. Same issue.

I have a luks setup with encrypted partition. And I don't want everyone on my computer to see that I have such partition. Unfortunately it shows up in the nautilus "devices" panel as "Encrypted partition".  Is there a way to prevent it from showing there? I managed to setup authentication with usb key and I don't want the encrypted partition show in the panel.


I am training a CNN model. In the first one I got a training accuracy of 87%(0.29 loss) and validation accuracy of 87%(0.30 loss) at 5th epoch, I kept training it for total of 15 epochs and as expected it started overfitting with training accuracy increasing to 97%(0.01 loss) and validation remaining at 87%(0.35 loss). In the second model, I used Data Augmentation and Dropout layer to deal with overfitting (trained for total 10 epochs). These are the results : 5th Epoch : Train Accuracy 77% (0.45 loss) and Validation accuracy 77% (0.41 loss). 10th Epoch : Train Accuracy 82% (0.38 loss) and Validation accuracy 82% (0.35 loss) From the loss and accuracy graph which you can see below, it's clear that Model is overfitting in first scenario, but in second it's not overfitting. Scenario One  Scenario Two  My question is, which model is better in real world based on accuracy ? Model one stopped at epoch 5 with 87% accuracy or model 2 which has not overfit with 82% accuracy (validation)? I understand just based on accuracy model 1 sounds better but it's ultimately overfitting, but if I stop the training using early stopping or something similar, will this be a better model than my second one ?

Let's say we have two models trained. And let's say we are looking for good accuracy.  The first has an accuracy of 100% on training set and 84% on test set. Clearly over-fitted. The second has an accuracy of 83% on training set and 83% on test set.   On the one hand, model #1 is over-fitted but on the other hand it still yields better performance on an unseen test set than the good general model in #2.   Which model would you choose to use in production? The First or the Second and why?


I would like to know what the latex command for the leftward facing implication symbol (an arrow with two bars) is. I'm trying to separate the 'if and only if' symbol to prove both implications, but I only know the command :  $\implies$   for the rightward implication.  Thanks!

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I have trouble making this program because I don't know how to make it so the program will ignore capitalization. I used .lower but I think I'm inserting it wrong. word=input("Give me a word to detect if it is a palindrome") word=str(word)  if word.lower[::-1]=word :     print("That's a palindrome") else:     print("Sorry this isn't a palindrome")

How can I do case insensitive string comparison in Python?  I would like to encapsulate comparison of a regular strings to a repository string using in a very simple and Pythonic way. I also would like to have ability to look up values in a dict hashed by strings using regular python strings.


I recently was under interview conditions (white boarding) and was asked to detail a task that still has me thinking about it now.  The premise was simple - and no doubt hardly novel.     //main    for (int i = 1; i < 6; i++)    {         Thread t = new Thread(() => ThreadWork.MemberMethod(i));         t.Start();                 }     static class ThreadWork    {         public static void MemberMethod(int i)         {             Console.WriteLine(i);         }    }   A pretty standard question about thread synchronicity - why is the output variable and not 1-2-3-4-5 every time? I gave a rough answer about creating a callback structure using delegates so that each previous threads execution had concluded before firing the next. Truth be told, I didn't field the question too well.  My answer was somewhat along these lines -  delegate void Del(int i);  //main Del handler = ThreadWork1.MemberMethod; for (int i = 1; i < 6; i++) {        Thread t = new Thread(() => handler(i));        t.Start(); }  static class ThreadWork1 {     public static void MemberMethod(int i)     {         Console.WriteLine(i);     } }   Running it now, I can see that this method does not work, at least in its current iteration.  I found an example from a blog that suggested using locks, a quick modification later and I had this:  //main ThreadWork2 threadwork = new ThreadWork2(); for (int i = 1; i < 6; i++) {     Thread t = new Thread(() => threadwork.MemberMethod(i));     t.Start(); }  class ThreadWork2 {     public void MemberMethod(int i)     {         lock (this)         {             Console.WriteLine(i);         }     } }   Yielded similar result - variance in output.  Am I close with any of these attempts? Or should I consider an entirely different approach.

I met an interesting issue about C#. I have code like below.  List<Func<int>> actions = new List<Func<int>>();  int variable = 0; while (variable < 5) {     actions.Add(() => variable * 2);     ++ variable; }  foreach (var act in actions) {     Console.WriteLine(act.Invoke()); }   I expect it to output 0, 2, 4, 6, 8. However, it actually outputs five 10s.  It seems that it is due to all actions referring to one captured variable. As a result, when they get invoked, they all have same output.  Is there a way to work round this limit to have each action instance have its own captured variable?


how do i fix this so the pear objects are actually on the plane instead of inside

I made a hair particle system and set the Dupli Group to a group of 3 objects. Each of the 3 objects has:   it's origin set to be touching the XY plane (on layer 2) it's Scale applied to 1 and it's Rotation applied to 0     I am trying to get each of the objects to sit directly on top of the ground, but instead, they are centered in the plane, half above the plane and half below the plane:      What am I doing wrong? Here is .


I am looking for some JavaScript simple samples to compute elapsed time. My scenario is, for a specific point of execution in JavaScript code, I want to record a start time. And at another specific point of execution in JavaScript code, I want to record an end time.  Then, I want to calculate the elapsed time in the form of: how many Days, Hours, Minutes and Seconds are elapsed between end time and start time, for example: 0 Days, 2 Hours, 3 Minutes and 10 Seconds are elapsed.  Any reference simple samples? :-)  Thanks in advance,  George

I need to get execution time in milliseconds.  I originally asked this question back in 2008. The accepted answer then was to use  However, we can all agree now  that using the standard  API is more appropriate. I am therefore changing the accepted answer to this one.


So, with the following code  \documentclass[12pt, russian]{article}  \usepackage{fontspec} \defaultfontfeatures{Ligatures={TeX},Renderer=Basic} \setmainfont[Ligatures={TeX,Historical}]{Linux Libertine O} \setsansfont{Linux Biolinum O} \setmonofont{Inconsolata} \usepackage{babel} \usepackage{cleveref}    % \tracingall   % \tracingassigns=5   % \tracingmacros=2   % \tracingcommands=2   % \tracingrestores=1   % \tracingstats=0   % \tracingoutput=10   % \tracinggroups=10   % \tracingonline0  \begin{document} 123 \end{document}   %%% Local Variables:  %%% mode: latex %%% TeX-master: t %%% End:    I have the following error  ! Undefined control sequence. \@tempa ^^@-\CYRR \cyri \cyrs                              \cyru \cyrn \cyro \cyrk  l.3 \select@language{russian}  ? X   The word 'Risunok' stands for 'Picture' in Russian. (That's the word you get by stripping "\cir"s from what is in the error message.)  Is it a bug? Any help or suggestions?  (As you can conclude by playing with the code it's because of the exact combination in the title of the question - well, it is like so on my machine with fully updated TeX Live 2014).

I have discovered that fontspec with russian babel settings doesn't work with datetime package. I tried to compile such code:  \documentclass[a4paper,11pt]{article} \usepackage[T2A]{fontenc} \usepackage[utf8]{inputenc} \usepackage[main=russian,english]{babel} \usepackage{datetime} \usepackage[cm-default]{fontspec}  \begin{document} \today \end{document}   with a xelatex and got an error: Command \cyri unavailable in encoding EU1.  Is there any way to handle it?  UPDATE: I really bungle with charset in XeLateX. Thanks to egreg. I have removed fontenc and inputenc and used some cyrillic font, so my MWE now looks this way:  \documentclass[a4paper,11pt]{article} \usepackage[main=russian,english]{babel} \usepackage{fontspec} \setromanfont{PT Sans} \usepackage{datetime}  \begin{document} \today \end{document}   and I've got another error, if I used russian as a main language in babel: Undefined control sequence. \\monthnamerussian ...cyrm \cyra \cyrya \or \cyri  \cyryu \cyrn \cyrya \or \c...  Is it still because of XeLaTeX?


I would like to learn this type of fonts in latex. I have tried all the math fonts but it does not seem to be ana appropriate one. So my question is:what  the name of this font in latex?   Answer of Heiko Oberdiek  The question is already closed, thus I have to use the question for the answer; images cannot be put in comments.  Comparison of the image in the question        and the typewriter font of Computer Modern (or EC or Latin Modern):  \documentclass{article} \begin{document} \texttt{age=25 AND name=`Bob'.} \end{document}         Together with the original in black and the \texttt variant in red:  \documentclass{article} \usepackage{graphicx} \usepackage{color}  \begin{document}  \leavevmode \raise.8pt\rlap{\includegraphics[width=50mm,trim=0 0 -.7pt 0]{age25.png}}% \textcolor{red}{\includegraphics[width=50mm]{age25-cm.pdf}}%  \end{document}         The thickness is quite correct.  However the space between the ' and . is smaller. Next idea: the . is not set in a fixed-width font:  \documentclass{article} \begin{document} \texttt{age=25 AND name=`Bob'}. \end{document}         Comparison with this variant yields:  \documentclass{article} \usepackage{graphicx} \usepackage{color}  \begin{document}   \leavevmode   \raise1pt\rlap{\includegraphics[width=50mm,trim=-.25pt 0 -1.25pt 0]{age25.png}}%   \textcolor{red}{\includegraphics[width=50mm]{t-crop.pdf}}% \end{document}         Result: \texttt{age=25 AND name=`Bob'}. (cmtt or lmtt)

Is it possible to identify the font used in a specific document/picture?  Answers to this question should identify:   Possible methods to do this (perhaps one answer per method) and adequately describe how to use it (as opposed to merely stating it); Ways of finding the identified fonts, if possible (free or not); and Any prerequisites associated with the method used, if required (for example, "In order to use method X, your document has to be in format Y").   This question is meant as an FAQ, based on an . Its aim is to facilitate the community with the general procedures involved in font identification. Similar cases are solved on a per-usage basis on 's  tag.


I am trying to set a background image in Blender 2.8 Beta.   The image is what I have right now for nodes. I set it to world node and it has a background when I render it but it is all mixed up.Do you know what I am doing wrong? (I am a beginner with Blender).   Thanks for your help.

First time I've used cycles rendering engine.  I'm using a movie clip as the background in short animation. Selected RBGA under Property Tab, and Transparent under Film Tab.  It looks good and individual frames in OpenGL active viewport render, and looks fine.  When I try to get it to spit out PNG files of the finished animation the objects render out fine, except no movie clip background as Blender Render engine did when using Paper Sky setting.  Operator error, or am I trying to do something Cycles won't do?  Haven't found an answer in my searches so far.  Can anyone point me in the right direction please.   Addition:  I think I found my problem after a couple more hours of research.  Post should read "operator ignorance" instead of operator error.  Too tired to try the solution tonight, everything looks better in the morning. Thanks anyway.  Sorry, I just saw your posts.  Really tired.  Much appreciation.


As I am working in NetBeans all components have been auto generated and initialised. the JButton array has been declared as JButton [][] btnArr in the class;    private void createButtons() {     btnArr = new JButton[10][10];      for (int i = 0; i < 10; i++)         for (int j = 0; j < 10; j++)         {             btnArr[i][j] = new JButton();             pnlButtons.add(btnArr[i][j]); //Error on this line             btnArr[i][j].setVisible(true);             btnArr[i][j].setBounds(i * 30, j * 30, 30, 30);             btnArr[i][j].setActionCommand("" + i + j);         } }

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?


Best way of converting date like "December 6, 2011" to pattern like "yyyy-MM-dd" ?

I need to be able to compare some month names I have in an array.  It would be nice if there were some direct way like:  Month.toInt("January") > Month.toInt("May")   My Google searching seems to suggest the only way is to write your own method, but this seems like a common enough problem that I would think it would have been already implemented in .Net, anyone done this before?


Is there a way, using C#, to determine if a port is available?  I'd like to check before I start up a WCF ServiceHost instance using a port that's already used :-)

In C# to use a TcpClient or generally to connect to a socket how can I first check if a certain port is free on my machine?  more info: This is the code I use:  TcpClient c; //I want to check here if port is free. c = new TcpClient(ip, port);


MapInfo has a function that takes a table, and creates a new table populated combines them by a specified value.  So, combining on the name field, and specifying that the Area field should be summed...  Name                  Area Ben's Field           100 Ben's Field           50 Tom's Field           25   Becomes  Name                  Area Ben's Field           150 Tom's Field           25   How can one achieve this in QGIS?

I am currently self teaching myself on qgis whilst volenteering on a project on a river catchment and your help is hugely appreciated!  I need to be able to work out the percentage of land cover or sqft/m coverage. I have all the land uses on as a vector layer over my river catchment.   Many thanks and let me know what other info i need to give as a newbie!


I need to embed unix commands in python script and need a piece of code to perform the below:    echo $i |awk -F ' ' '{print $9' '$6' '$7' '$8}'

How can I call an external program with a python script and retrieve the output and return code?


I ran this app on my phone just fine and then, after changing nothing, I changed out to install on my nexus 7. Now I am receiving this error.  Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'void android.widget.Button.setOnClickListener(android.view.View$OnClickListener)' on a null object reference         at com.th3ramr0d.tc3studyguide.MainActivity.onCreate(MainActivity.java:37)   This is the code at line 37.  rateMe.setOnClickListener(new View.OnClickListener() {   This is the entire block of code for the setOnClickListener  Button rateMe = (Button)findViewById(R.id.rateMe); rateMe.setOnClickListener(new View.OnClickListener() {         public void onClick(View v) {             Intent intent = new Intent(Intent.ACTION_VIEW);             intent.setData(Uri.parse("market://details?id=com.th3ramr0d.app"));             startActivity(intent);         }     });   XML File  <Button         android:id="@+id/rateMe"         android:text="Rate Me"         android:layout_width="match_parent"         android:layout_height="wrap_content"         />   This worked just fine on my phone. I then tried to install it on my phone and it gives me the exact same error now. I have tried:  Gradle Sync  Rebuild app  Clean app  Uninstalled app on phone and tablet  Restarted both devices  Restarted Android Studio  Restarted computer  OnCreate Method  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     getSupportActionBar().hide();       boolean firstTimeRun = getFirstTimeRun();      if (firstTimeRun == true) {         firstTimeRun();     } else {         run();     }       Button rateMe = (Button)findViewById(R.id.rateMe);     ImageView prt = (ImageView)findViewById(R.id.prt);     ImageView pfp = (ImageView)findViewById(R.id.pfp);      rateMe.setOnClickListener(new View.OnClickListener() {         public void onClick(View v) {             Intent intent = new Intent(Intent.ACTION_VIEW);             intent.setData(Uri.parse("market://details?id=com.th3ramr0d.tc3studyguide"));             startActivity(intent);         }     });      prt.setOnClickListener(new View.OnClickListener() {         public void onClick(View v) {             Intent intent = new Intent(Intent.ACTION_VIEW);             intent.setData(Uri.parse("market://details?id=com.th3ramr0d.prtmanagerfree"));             startActivity(intent);         }     });      pfp.setOnClickListener(new View.OnClickListener() {         public void onClick(View v) {             Intent intent = new Intent(Intent.ACTION_VIEW);             intent.setData(Uri.parse("market://details?id=com.th3ramr0d.poundforpoundfree"));             startActivity(intent);         }     });  }


If $G$ is a connected Lie group, and $\mathfrak g$ is its Lie algebra, then $G$ is commutative iff $\mathfrak g$ is commutative. But when we remove the "connected" condition, could you provide a counterexample? Further, without the "connected" condition, is one direction always right?  Thank you!

I've been trying to find an example of a non abelian, non connected Lie group such that its Lie algebra is abelian but I can't find one, so can somenone please help me.


I want to move all the files, but not the folders, inside a folder to another directory.  I have been using this command:  find . -maxdepth 1 -type f -exec mv {} destination_folder \;  But now I want to move all the files except the ones that start with "exe_", so I tried:  find . -maxdepth 1 -type f -exec mv !(exe_*) part1a_si_atom-exp001 \;  But now it also moves directories. What can I do?

I have a directory that I am trying to clean out that contains both files and subdirectories.  What I am trying to do is simple: move all the files into another directory, but leave all the sub-directories as they are.  I am thinking something like:  mv [*_but_no_dirs] ./other_directory   It seems like there should be a simple way to do this with wildcards * and regex...  Anyone have ideas?


I installed Ubuntu 16.04, and after that I installed Window. After installing Windows, I cannot boot into Ubuntu. Both were installed into one hard drive, on two separate partitions. I did not format the partition I installed Windows. How can I boot Ubuntu?

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


I need to split a manuscript into main text and online supplement, as required for publication on a journal. The problem is that in the online supplement, I refer to many equations and theorems in the main text. I don't want to manually change all the references to numbers (e.g. from \ref{eq:1} to (1)). There are too many of them. Is there a good way to do this?  If the journal only requires the pdf files, then I can certainly split the output pdf file. However, the journal asks for both pdf and tex files.

I want to cross-reference between different .tex files, just because I want to put every chapters separately.  Let's say in file chapterI.tex I have \label{a} and I want to access this in file chapterII.tex using something like \ref{a}. How to do this exactly in LaTeX, moreover if LEd have an easy feature to cover this, it will be better (I have put those both files in the same project).  I found another question with similar title, but I just didn't really understand. It's here: .


so I got similar results from a t-test output for my p-value 2.50e, but am not sure if it's correct or how to interpret.                11043     3203          Mean         11333.75   3187.833333          Variance    264633.0652 203.1014493          Observations    24       24          Hypothesized Mean Difference    0                df  23               t Stat  77.54556011              P(T<=t) one-tail    1.2505E-29               t Critical one-tail 1.713871528              P(T<=t) two-tail    2.50E-29                 t Critical two-tail 2.06865761

After taking a statistics course and then trying to help fellow students, I noticed one subject that inspires much head-desk banging is interpreting the results of statistical hypothesis tests.  It seems that students easily learn how to perform the calculations required by a given test but get hung up on interpreting the results.  Many computerized tools report test results in terms of "p values" or "t values".  How would you explain the following points to college students taking their first course in statistics:   What does a "p-value" mean in relation to the hypothesis being tested?  Are there cases when one should be looking for a high p-value or a low p-value? What is the relationship between a p-value and a t-value?


I have a question about removing windows. I installed Ubuntu from the windows desktop because the live cd did not work. How can I delete Windows without removing Ubuntu?

I have installed Ubuntu on my D: partition using Wubi. Is there any way in which I can remove my Windows from C: drive and move my existing Ubuntu installation to C: drive and make it a regular install.


Does a large thick wire that has over 1000 amperes of current flowing  through it generate powerful magnetic fields?   What formula is best here to predict $B$?

What is the direction is the magnetic force vectors pointing from a coil of wire that has current running through it?    The above link is a picture of a wire with current running through it. I see the blue arrows indicating the magnetic field lines, but I am having trouble visualizing the magnetic force lines. Where are they pointing? Please help.


I'm using Blender 2.70. How do I apply the same modifier to multiple objects? None of the answers I searched for work, listed below:   Apply modifier to one object, then select all, make applied object active, ctrl+c -> modifiers. The only choice I get from ctrl+c is "copy selection to buffer" Same as above, except alt+c -> mesh from curves/meta/surface/text. Nothing happens   Also, is there a better way to reduce polygon count on simple objects (rings, cylinders, etc) than decimate? That's what I'm using right now, but can't figure out how to apply it to all the objects in the scene.

You can copy modifiers from one object to other objects with CtrlL> Make links > Modifiers, or the Copy attributes addon.  However, is it possible to apply modifiers to many objects at once?


Differently from $e^x = ex$ or $e^x = x^2$, which can be easily solvable with the Lambert W function, I can't see how to approach $e^x = x^2 + 2$. Thanks.

In   the equation $x^2-1=2^x$ is considered, this is a generalization:  Let $P_n(x)$ a polynomial of degree $n > 0$. It is well know that the equation $P_n(x)=0\;$ has at most $n$ real solutions. But consider the inhomogeneous equations $P_n(x)=2^x$ or even $$P_n(x)=e^{ax},\quad a\ne 0$$  Is it correct to say that the number of solutions is $\le n+1?$   Proof could be via induction on $n$ with $P_{n+1}'(x)/a=e^{ax},\;$ but at the moment I see no obvious way to get back to $P_{n+1}(x)=e^{ax}.$


I could prove that this is statement is true if $m=1$ or if $m$ is prime.  However, I couldn't prove that the statement doesn't hold if $m>1$ is not prime.  Any hints?

I'm looking for a set of conditions and maybe a proof of said conditions for the thought proposed in the title. It seems to me that what was stated in the title always is true when N is not a perfect square and N < m, but I can find instances that work for perfect squares N, e.g. m = 12, N = 4.  If it's not clear what I'm asking, I'm looking for a general case of what's asked in   Any help is appreciated! Thanks.  Edit: m and N are positive integers.


Most of time when I use Firefox my system freezes and needs to be restarted. Sometimes I use other apps and need to restart the system after the system. The system is updated. Firefox usually freezes when I'm on YouTube.  How can fix this?  My Ubuntu version is 18. It happen in this new version. Before the update it was good.

I have recently installed Ubuntu 14.04 LTS on my laptop Sony Vaio VPCEA16FG. I have been getting system freezes (everything including display, mouse, keyboard stops working and I have to do a restart with the power switch) and there are random popups of "System program problem Detected"  On startup my screen is all splashed with black and white pixels and a System program problem detected message.  My video card info:    01:00.0 VGA compatible controller: Advanced Micro Devices, Inc. [AMD/ATI] Madison [Mobility Radeon HD 5650/5750 / 6530M/6550M


In a previous question about the English of the KJV a  was helpfully supplied and I read the following      The vocative case is used when directly addressing a person with a noun identifying the person instead of with the second person pronoun “you.”  An example is in Matthew 6:9 which says, “Our Father, which art in heaven.”  Today we are less inclined to say “Our Father, who ARE in heaven.”  It seems more natural to say “Our Father, who IS in heaven.”  The peculiarity of the KJV is based on the faithful translation of the vocative case.  This is not an archaism but a faithful translation of the Greek which has the vocative case.   Like many things, I learned the words as a child and have accepted them all my life without intelligently understanding them.  I am still struggling to understand why the verb is plural and where 'art' comes from.

What happened to the art in "Our Father who art in Heaven"?  And why is it art, and not is?


It should be very basic, but I'm struggling to understand the solution. I'm trying to prove that to group $\mathbb{Z}_{n}$ is cyclic. Everywhere I tried to find a solution I came across of the saying      $\mathbb{Z}_{n}$ is cyclic because it has a generator $1$ (meaning $\mathbb{Z}_{n} = \langle 1 \rangle$).   I understand the meaning of generator, but I don't understand why the generator is $1$. Probably I'll feel stupid when I'll finally understand. Why $\mathbb{Z}_{n} = \langle 1 \rangle$ when $\mathbb{Z}_{n}$ is the Sum group of integers modulo $n$.

1) Is $\mathbb{Z}/\langle n\rangle$ cyclic and of order $n$? Why or why not? ($\mathbb{Z}/\langle n\rangle$ is defined to be the factor group of $\mathbb{Z}$ determined by $\langle n\rangle$.)  I guess I'm having trouble understanding factor groups (quotient groups make much more sense) and cyclic groups. My textbook isn't the best at explaining what's going on. I just chose some past homework problems that looked related to my problems.  This is my first abstract algebra course and I'm floundering a lot.


I am trying to connect to Salesforce (SF) with wsdl to pull data.  I can't use SF suite module or Salesforce rest client service.  In the D7 file, I have:  require_once ('soapclient/SforceEnterpriseClient.php'); require_once('soapclient/SforceHeaderOptions.php'); ini_set("soap.wsdl_cache_enabled", "0");  $sfdc = new SforceEnterpriseClient(); $SoapClient = $sfdc->createConnection($curPath.'/enterprise.wsdl');   It create the connections without any problems.  D7 References from here:  and learned to how to use it from here:   In the D8, I am trying to figure out how to connect to SF in the same way:  namespace Drupal\mymodule\Controller\Soapclient; $sfdc = Soapclient::SforceEnterpriseClient(); $SoapClient = $sfdc->createConnection('../../includes/soapclient/enterprise.wsdl');   But got the SforceEnterpriseClient class not found error.  Stuck on it for a while, any help will be so much appreciated. Anybody knows how to connect to SF in the same way like this:

I’ve read a lot of topic on this but i can’t figure why it is not working for me.  I’ve built a custom module. It is working fine since return $output; in my controller class is working : I can see in front-end a page with my custom html.  I’ve written a script outside Drupal in order to test. Basically, i connect to a webervice and retrieve all the datas. It’s working fine.  Now, i want to execute that script inside the controller class.  I need to load an external php library to instantiate an object.  In my test php file (outside Drupal) a simple require_once is working.  require_once('nusoap.php');   But it is not working in my controller class.  So, i’ve activated the library module and do :  $path = libraries_get_path('nusoap') . DRUPAL_ROOT . '/modules/contrib/webservices_tr/webservices_dc/src/Controller/nusoap.php';  require($path);   It’s still not working.   Error message indiquactes :     Error: Class 'Drupal\webservices_dc\nusoap_client' not found   I’m sur the file path is correct because if i do this, i can see the content of the file.  echo file_get_contents(DRUPAL_ROOT . '/modules/contrib/webservices_tr/webservices_dc/src/Controller/nusoap.php'); die();   I’ve also tried this :  in nusoap.php (where there is the class i need to include),    namespace Drupal\webservices_dc;   and in module controller class :  use Drupal\webservices_dc\nusoap_client;   But it is still not working.  Finally, i’ve copied the content of the external php library inside the module controller and it is working.  So i’m nearly sure the issue is related to the loading of that external library.  What is the correct way to load external php library (and wait it is fully loaded) in order to use it in a custom module ?


I'm working on a proof of AM-GM inequality, but for now I would like to prove more basic propositions.      Prove that the arithmetic-geometric mean inequality holds for lists of   numbers of length $2$. In other words, prove that for all positive   real numbers $a$ and $b$   $$\frac{a+b}{2}≥\sqrt{ab}$$   My attempt:  We know that $(a-b)^2 ≥ 0 $  Expanding  $$a^2 - 2ab + b^2 ≥ 0$$  Adding $4ab$ to both sides  $$a^2 + 2ab + b^2 ≥ 4ab \implies $$ $$(a+b)^2 ≥ 4ab \implies $$ $$a+b ≥ 2\sqrt{ab} \implies $$ $$\frac{a+b}{2} ≥ \sqrt{ab}$$  $\Box$  Is it correct?

I am having trouble with this problem from my latest homework.  Prove the arithmetic-geometric mean inequality. That is, for two positive real numbers $x,y$, we have $$ \sqrt{xy}≤ \frac{x+y}{2} .$$ Furthermore, equality occurs if and only if $x = y$.  Any and all help would be appreciated.


I have used GPG for some time and know a little about the inner workings. For example I know how to encrypt a file with your public key so only you can open it with your private key, neat.   But actually what happens is (to my understanding):    A random passphrase is generated. File is encrypted with this passphrase symmetrically. The passphrase is encrypted asymmetrically with the public key of the receiver and stored in the file. Receiver decrypts passphrase using private key. Receiver decrypts file using passphrase.   AFAIK this is done to increase speed drastically, plus have a new secret every time makes it harder to guess the password, in theory.  So my actual question is, is it possible to have multiple recipients?  For example.. I have a 10GB file, want to share it with 5 friend or colleagues, do I really need to re-encrypt it 5 times, storing 50GB OR is it possible to encrypt the randomly chosen passphrase (for symmetric encryption) 5 times using 5 public keys and put those in the file header?  Or did I just share an idea to the world that I should have patented? =)

Is it possible to encrypt a message using PGP so that multiple recipients (each with their own public private keypair) can decrypt it? I'd like to email one message which can be decrypted by each person with their own keys.