MacBook Pro Retina late-2013 WiFi BC4360 - "FOUND UNSUPPORTED PHY"

I've just booted Ubuntu 15.10 from USB dongle on my MacBook Pro Retina late-2013 and WiFi networking doesn't work. I can see the following output in DMESG and LSPCI  [   19.556114] cfg80211: World regulatory domain updated: [   19.556117] cfg80211:  DFS Master region: unset [   19.556117] cfg80211:   (start_freq - end_freq @ bandwidth), (max_antenna_gain, max_eirp), (dfs_cac_time) [   19.556119] cfg80211:   (2402000 KHz - 2472000 KHz @ 40000 KHz), (N/A, 2000 mBm), (N/A) [   19.556120] cfg80211:   (2457000 KHz - 2482000 KHz @ 40000 KHz), (N/A, 2000 mBm), (N/A) [   19.556121] cfg80211:   (2474000 KHz - 2494000 KHz @ 20000 KHz), (N/A, 2000 mBm), (N/A) [   19.556122] cfg80211:   (5170000 KHz - 5250000 KHz @ 80000 KHz, 160000 KHz AUTO), (N/A, 2000 mBm), (N/A) [   19.556123] cfg80211:   (5250000 KHz - 5330000 KHz @ 80000 KHz, 160000 KHz AUTO), (N/A, 2000 mBm), (0 s) [   19.556124] cfg80211:   (5490000 KHz - 5730000 KHz @ 160000 KHz), (N/A, 2000 mBm), (0 s) [   19.556125] cfg80211:   (5735000 KHz - 5835000 KHz @ 80000 KHz), (N/A, 2000 mBm), (N/A) [   19.556125] cfg80211:   (57240000 KHz - 63720000 KHz @ 2160000 KHz), (N/A, 0 mBm), (N/A) [   19.594061] b43-phy0: Broadcom 4360 WLAN found (core revision 42) [   19.594524] b43-phy0 ERROR: FOUND UNSUPPORTED PHY (Analog 12, Type 11 (AC), Revision 1)  $ sudo lshw -class network   *-network                   description: Network controller    product: BCM4360 802.11ac Wireless Network Adapter    vendor: Broadcom Corporation    physical id: 0    bus info: pci@0000:03:00.0    version: 03    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress bus_master cap_list    configuration: driver=bcma-pci-bridge latency=0    resources: irq:18 memory:c1a00000-c1a07fff memory:c1800000-c19fffff  LSPCI output: 03:00.0 Network controller [0280]: Broadcom Corporation BCM4360 802.11ac Wireless Network Adapter [14e4:43a0] (rev 03)   Furthermore, my mac freezed up after very few time, after opening the top left menu with apps, maybe something related to graphics because previously it got frozen also after trying to change resolution.


Partition of a rectangle into squares problem

recently I encountered this problem: "Show that a rectangle can be partitioned into finitely many squares if and only if the ratio of its sides is rational."  I have found the a solution which I need help to understand:     Clearly, every rectangle with rational ratio of sides can be partitioned into finitely many equal squares. Thus, the interesting part of the problem is the "only if" one.   Proof via Dirichlet's simultaneous rational approximation theorem   Without loss of generality, we may assume that both sides of our   rectange are greater than $1$. We can choose a positive integer $q$   such that the product of every coordinate of every vertex of every   square in our partition becomes almost an integer after multiplication   by $q$. So, we may assume that all these coordinates differ from   integers by, at most, $\frac 15$. Now let $a$ and $b$ be the   horizontal and the vertical side of our rectangle, respectively, and   let $s_i$ be the sides of the squares in the partition. Denote by   $\tilde x$ the nearest integer to $x$. Now, draw the horizontal lines   at all half-integer heights (i.e., the heights $\pm\frac 1 2,\pm\frac  3 2,\dots$) and look at the total length $L$ of these lines within our   rectangle. On one hand, we have $L=a\tilde b$. (There are $\tilde b$   lines intersecting our rectangle and each of them intersects it by an   interval of length $a$.) On the other hand, looking at what happens in   each square, we get $L=\sum_i s_i\tilde s_i$. Thus $a\tilde b=\sum_is_i\tilde s_i$. Similarly, drawing the vertical lines through   half-integer points, we arrive at the identity  $b\tilde a =\sum_i  s_i\tilde s_i$. Thus $a\tilde b=b\tilde a$, i.e., $\frac a b=\frac  {\tilde a}{\tilde b}\in\mathbb Q$.   I didn't understood why did he had to use Dirichlet  theorem in order to draw line on each side, particulary I didnt understood why did he had to do this and how everything in this part connected:     Without loss of generality, we may assume that both sides of our   rectange are greater than $1$. We can choose a positive integer $q$   such that the product of every coordinate of every vertex of every   square in our partition becomes almost an integer after multiplication   by $q$. So, we may assume that all these coordinates differ from   integers by, at most, $\frac 15$.   If anyone can please explain it, it would be great, thanks  reference for the problem and solution:   I’m asking about the answer he gave, not about any other solution...


I am invested in IVV and was surprised today when I saw the S&P500 and VOO shoot up 0.7% in the morning, while my IVV shares only went up ~0.02%.  The day ended with the S&P 500 up 0.71% and VOO up 0.71%, but IVV it seems to depend who you ask.  On my profile with Schwab, it says I went up 0.08% ($0.24/share). If I look up the close friday it says it closed at 319.08. Since it closed at 319.32 today, the 0.08% makes sense.  If I look up the symbol in Schwab, it says it went up 0.58% ($1.84/share) If I look up the previous close here, without looking up a specific date, it says the previous close was 317.4778, which would make sense for the 0.58%.  And then Yahoo reports other numbers entirely. Previous close 315.00, open 319.00, todays close 319.32, and reports 4.32 up (1.37%)  I didn't do any buying or selling any time recently.  Why did I get 0.08% instead of 0.58%? Why do there seem to be different closing prices for Friday based on who you ask? Why did IVV, which is supposed to mirror the S&P pretty closely deviate so much from it?


Installing Ubuntu on a laptop with FreeDOS

I have no programming knowledge whatsoever. I accidentally bought a laptop that only has FreeDOS on it. I have decided to have a go at installing Ubuntu on this.   I have looked at video and written tutorials, but it seems that I am missing something. On a different computer, I downloaded Ubuntu ISO file (as a FAT32) on to the desktop, then transferred it  along with the file folder across to the pen drive along with the universal file installer 1.9.8.0.  Next I turned on my HP laptop, pressing Esc repeatedly during boot. This now gave me the option of booting the computer from the pen drive, but this is where it goes wrong. Unlike the videos and blogs, Ubuntu does not show up, it reverts back to dos.  Anyone help a novice please?


Capitalization of biological abbreviations at the beginning of a sentence

In the beginning of a sentence, should I capitalize abbreviations such as the following:   hPSC (human pluripotent stem cell) mESC (mouse embryonic stem cell) rDNA (recombinant deoxyribonucleic acid)   I have seen both lower and upper case for the two first, while rDNA always seems to be in lower case. I'm curious which is the linguistically correct form.


Objects in front and back view look reversed?

Am reposting this because I wasn't clear in my previous post.  Check the image to understand my headache.


Is it possible to show our custom message in QGIS Status bar using python?

Is there any way to show our custom message in Qgis Status bar using python? Just like in arcgis IApplication.statusbar.message(0) = "Please wait..."  like that is there any option to show progressbar in Qgis like IApplication.progressbar.show()


find words with all vowels in order from a file

I have a large dictionary file with 300,000+ words in it and I'm trying to find all words with the vowels aeiou in that order and have only exactly 5 vowels. My current attempt does not seem to be working and for the life of me I don't understand why.  less mywords | grep -iE [^aeiou]*a[^aeiou]*e[^aeiou]*i[^aeiou]*o[^aeiou]*u[^aeiou]*   I think it get's all the words I'm looking for but there are a few words that pop up which I can not get rid of.  abstemiousnesses ultraserious   There are a few other but they are in the same vein. Curiously, even if I add something like [^u]* to the front ultraserious keeping popping back up! Any solution would be fine however I would like it restricted to grep as we've been told it can be done using only grep.


White cloud around fighter jet at Supersonic speed

When a fighter jet flies with Supersonic speed then some type of white cloud form  around the fighter jet for short period of time.what is the reason behind this phenomena?


Make an HTTP POST request to a WFS service?

So I'm new to GIS and I'm missing some of the basic concepts in this field, what I need to do is to write a POST method to add or delete or update some map services I'm working on an ArcGIS server, I can modify the URL to use a GET method, put I have no idea how and where to write a POST method to modify the services.  The URL I keep on modifying is something like this:  https://someserver.domain.com/webserver/services/FAT_Testing/demokmz03/MapServer/WFSServer?SERVICE=WFS&VERSION=1.1.0&REQUEST=GetFeature&typeName=Buildings&BBOX=0,0,100,100&   This works just fine, I also learned all these things from this site:


C# Why do class fields of struct types take up more space than the size of the struct?

With a struct that only contains a single byte field, I expected that struct to consume 1 byte in memory. If I create an array of that struct type, that turns out to be an accurate expectation. I had the same expectation when using that struct as a field in a class, however, to my surprise, each field consumes the size of an IntPtr! I thought that would only happen due to padding the class to the next word size, but it seems to be the case no matter what. Why is this? [Edit] Updated measurements     Method Mean Error StdDev Gen 0 Gen 1 Gen 2 Allocated     AllocOneByte 7.453 ns 0.0885 ns 0.0827 ns 0.0076 - - 24 B   AllocTwoBytes 8.394 ns 0.0873 ns 0.0816 ns 0.0076 - - 24 B   AllocThreeBytes 8.398 ns 0.0559 ns 0.0523 ns 0.0076 - - 24 B   AllocOneByteWrapper 8.373 ns 0.0934 ns 0.0873 ns 0.0076 - - 24 B   AllocTwoByteWrappers 9.815 ns 0.1256 ns 0.1175 ns 0.0102 - - 32 B   AllocThreeByteWrappers 11.274 ns 0.1527 ns 0.1429 ns 0.0127 - - 40 B   AllocOneByteArray 9.286 ns 0.1609 ns 0.1505 ns 0.0102 - - 32 B   AllocTwoBytesArray 9.396 ns 0.1038 ns 0.0920 ns 0.0102 - - 32 B   AllocThreeBytesArray 8.904 ns 0.1183 ns 0.1107 ns 0.0102 - - 32 B     public class Benchmark {     public class OneByte     {         public byte num;     }      public class TwoBytes     {         public byte num;         public byte num2;     }      public class ThreeBytes     {         public byte num;         public byte num2;         public byte num3;     }       public struct ByteWrapper     {         public byte num;     }      public class OneByteWrapper     {         public ByteWrapper num;     }      public class TwoByteWrappers     {         public ByteWrapper num;         public ByteWrapper num2;     }      public class ThreeByteWrappers     {         public ByteWrapper num;         public ByteWrapper num2;         public ByteWrapper num3;     }       [Benchmark]     public OneByte AllocOneByte()     {         return new OneByte();     }      [Benchmark]     public TwoBytes AllocTwoBytes()     {         return new TwoBytes();     }      [Benchmark]     public ThreeBytes AllocThreeBytes()     {         return new ThreeBytes();     }      [Benchmark]     public OneByteWrapper AllocOneByteWrapper()     {         return new OneByteWrapper();     }      [Benchmark]     public TwoByteWrappers AllocTwoByteWrappers()     {         return new TwoByteWrappers();     }      [Benchmark]     public ThreeByteWrappers AllocThreeByteWrappers()     {         return new ThreeByteWrappers();     }      [Benchmark]     public ByteWrapper[] AllocOneByteArray()     {         return new ByteWrapper[1];     }      [Benchmark]     public ByteWrapper[] AllocTwoBytesArray()     {         return new ByteWrapper[2];     }      [Benchmark]     public ByteWrapper[] AllocThreeBytesArray()     {         return new ByteWrapper[3];     } }  [Edit2] This is not the same as . This is about using small structs as fields in a class.


How to find element g order q, given 2 large primes p and q where q|p-1


Transform multiple objects with (large) geographic coordinates to fit together

I have a few objects with geographic coordinates (for instance, X can be 1 300 000), so they are far from the centre of the canvas.  I want to get them to the centre together, and also that they are within the bounds of the plane (the one that is there by default, sorry I don't know the name).  However, when I use the command Shift + Control + Option + C - Geometry to Origin, each is transformed separately and they don't fit anymore together (two objects that were touching each other are now displaced).  Furthermore, because of the size of the objects I need to scale them (0.01 of the original size suffices), but things get further degraded here.  How can I translate and scale the coordinates of all objects to local coordinates in such a way that the objects retain their relations?  Edit: example  The two objects in Meshlab with the original coordinates (the example before the transformation is in Meshlab because it conveniently adjusts the view to the extent of the objects):    After importing them to Blender and performing the command Shift + Control + Option + C - Geometry to Origin for both objects selected together, I get both in the centre overlapping with each other (I made separate screenshots with toggled visibility because one is over the other):


I want to change my IP so that if anyone tries to track my location they can't find me. Is there a way to do this?  I know it is possible by changing IP address, but I don't have any idea how to do this. I am trying to download some torrents which are not available in my country.


How can I download multiple photos from Google drive without clicking on each individual photo?

I have over two thousand photos on my Google drive. I would like to download them so I can print them. How can I do this quickly without clicking on each individual photo?


The L805CV voltage regulator is capable of producing a consistent 5v 1.5A draw. I am creating a small raspberry pi case and have a 12v 3a power supply to accomplish the project. I am powering a 12v fan and a few other peripherals at 5v including the pi. I have 10uF capacitors for both inputs and outputs, however I ran into a problem fairly quickly. I researched very thoroughly that nearly any heat sink I looked at would overheat the device. Being in Texas you can assume a maximum ambient temperature of around 40*c. the heatsinks have a dissipation rate of 23*c/w and here's the datasheet for the regulator: .  Now that you have the information let me ask my question. I'm attempting to run the 12v supply into the 5v regulator at 1A. however this very quickly overshoots the allowed temperatures as this is 7 watts to dissipate. Would it be easier to get a 9v supply and just adjust the voltage upwards for the 12v fan or is there a way in order that 12v 1A can be pushed through this without overheating?   If I did choose to go with 9v what circuit would you recommend in order to bump up the voltage 3v for the fan? The fan is an Antec TriCool 120mm LED fan with a maximum current draw of 300mA at 12v. Thank you for your time.  This is not a repeat subject as I am doing low voltage conversions at a maximum of 7w whereas the other topic addresses 24v 2A down to 5v .1A. not only does this not address the fact that he is using a pathetic amount of current but it's obvious why it was overheating. this is asking for a solution it's not asking why it's happening. I'm simply asking how to fix it


hide results that echo in if conditional

I have the next script:  host=$1 port=23 user= <user> pass="<pass>" cmd1='show int descrip | i TRUNK|BBONE' #cmd2=exit  ( echo open ${host} sleep 1 echo ${user} sleep 1 echo ${pass} sleep 1 echo "terminal length 0" sleep 1  echo  ${cmd1}  sleep 1 #echo ${cmd2} #sleep 1 echo "terminal length 24"    sleep 1 echo "          " ) | telnet   This works, but I don't want that in the console appear all the comands and results, only execute.


Gauge invariance and the degrees of freedom

I am currently starting to learn some QFT. And I am very confused by the fact that the freedom to choose a gauge for a theory controls the physical degrees of freedom.  Please correct me if i am wrong with the following because i think i might have internalized by myself undetected misconceptions.  The free electro-magnetic field for example has only two physical degrees of freedom, since electromagnetic waves are exclusively transversal waves so there are no longitudinal degrees of freedom.  The four-potential $A^\mu$ has four entries so with no further information $4$ degrees of freedom, so we need to relate the entries of $A^\mu$.  I do know and understand that the fields described by $F^{\mu\nu}$ are invariant under a transformation $G$ with $$ G:\quad A^\mu \longrightarrow A^{\mu} + \partial^\mu \phi $$ where $\phi$ is some arbitrary scalar field, which can be easily shown by explicitly writing out the field tensor.  Question: Why does the freedom to choose such a gauge cancel out 2 degrees of freedom ?


Which of the following rings are fields ?      $\mathbb{Z}_{2}$, $\mathbb{Z}_{3}$, $\mathbb{Z}_{4}$, $\mathbb{Z}_{5}$, $\mathbb{Z}_{6}$, $\mathbb{Z}_{7}$, $\mathbb{Z}_{8}$   And can you give a brief reason why?  Thanks


What is acceptable form sentence in the spoken English?      1) I will see you in another time   or     2) I will see you at another time


I have a problem with this exercise:       How many sequences of rational numbers converging to 1 are there?   I know that the number of all sequences of rational numbers is $\mathfrak{c}$. But here we count sequences converging to 1 only, so the total number is going to be less. But is it going to be $\mathfrak{c}$ still or maybe $\aleph _0$?


Find Factors of a Number and Save to an Array in Java

I am writing a program to find perfect numbers. The first step in doing this is to find all of the factors of a number. I need some code to find the factor of a number and save the factors to an array (NOT print the numbers). This is what I have so far, but it returns a NullPointerException:  public static int[] getFactors(int number) {     int factorNumber = 1;     int varArrayStoreID = 0;     int[] factors = null;      while(factorNumber <= number){         if(number % factorNumber == 0){             varArrayStoreID = varArrayStoreID + 1;             factors[varArrayStoreID] = factorNumber;         }         factorNumber++;     }      return factors; }   Thanks.


Javascript. How to stop setInterval timer? Uncaught ReferenceError: var is not defined

I've got issue with stopping setInterval timer. I know It should stop after using claeerInterval, but in my case something wrong.  This is part of code what I have:      function startTimer(duration, display) {         var timer = duration, minutes, seconds;         var tmr = setInterval(function () {             minutes = parseInt(timer / 60, 10)             seconds = parseInt(timer % 60, 10);              minutes = minutes < 10 ? "0" + minutes : minutes;             seconds = seconds < 10 ? "0" + seconds : seconds;              display.textContent = minutes + ":" + seconds;              if (--timer < 0) {                 timer = duration;             }         }, 1000);     }      function beginTimer() {         var fiveMinutes = 60 * 5,         display = document.querySelector('#time');         startTimer(fiveMinutes, display);     }      function gameOver() {         // some more code         clearInterval(tmr); // there throws an error     }   And after It I got an error:     Uncaught ReferenceError: tmr is not defined   Have you ideas what's wrong with It? should I make It public or something else?


Why am I getting an actionPerformed() error: unknown source?

I am learning Java from HeadFirst Java. When I run the app, it shows the circle first. But when I click the Button, it fires the below error. Below is the code and error:  import java.awt.*; import java.awt.event.*; import javax.swing.*; public class GUI implements ActionListener { JFrame frame;  public static void main(String[] args) {     GUI g = new GUI();     g.go(); }  private void go() {     JFrame frame = new JFrame("Title");     frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);     JButton button = new JButton("Change Color");     button.addActionListener(this);      MyWidget my = new MyWidget();      frame.getContentPane().add(BorderLayout.SOUTH, button);     frame.getContentPane().add(BorderLayout.CENTER, my);     frame.setSize(300, 300);     frame.setVisible(true);  }  @Override public void actionPerformed(ActionEvent e) {     frame.repaint(); } } class MyWidget extends JPanel { @Override public void paintComponent(Graphics g) {     Graphics2D g2 = (Graphics2D) g;     int red = (int) (Math.random() * 255);     int green = (int) (Math.random() * 255);     int blue = (int) (Math.random() * 255);     Color startColor = new Color(red, green, blue);     red = (int) (Math.random() * 255);     green = (int) (Math.random() * 255);     blue = (int) (Math.random() * 255);     Color endColor = new Color(red, green, blue);     GradientPaint gradient = new GradientPaint(70, 70, startColor, 150, 150, endColor);     g2.setPaint(gradient);       g2.fillOval(70, 70, 100, 100); }   }   Here is what I getting on console:  Exception in thread "AWT-EventQueue-0" java.lang.NullPointerException at HeadFirstJava.GUI.actionPerformed(GUI.java:32) at javax.swing.AbstractButton.fireActionPerformed(Unknown Source) at javax.swing.AbstractButton$Handler.actionPerformed(Unknown Source) at javax.swing.DefaultButtonModel.fireActionPerformed(Unknown Source) at javax.swing.DefaultButtonModel.setPressed(Unknown Source) at javax.swing.plaf.basic.BasicButtonListener.mouseReleased(Unknown Source) at java.awt.Component.processMouseEvent(Unknown Source) at javax.swing.JComponent.processMouseEvent(Unknown Source)


In longitudional clock, for the return half tick why is the time in stationary frame less than the time in moving frame?

I've just started special relativity and my textbook says $\Delta t_{stationary} \gt \Delta t_{moving}$. It proves this with mirrors placed perpendicular to the motion as shown:     In the above figure, two mirrors $A, B$ are inside a bus moving with velocity $v$ relative to the stationary frame. In the moving frame(inside bus), $\Delta x = 2L$. In the stationary frame, $\Delta x = 2D$. Clearly the light travels more distance in the stationary frame and thus takes more time.  Good so far.   Now, what happens if I put the mirror horizontally and shoot a light ray from the right side mirror as shown:    Clearly the light travels less distance in the stationary frame and thus takes less time. This means $\Delta t_{stationary} \lt \Delta t_{moving}$. Contradiction. What am I missing?


How many attacks does a bare-fisted level 1 monk make?

If a monk chooses at level 1 to use his fists does he get to make 3 attacks, assuming he uses his bonus action?   Right Fist: 1d4 (unarmed strike) + dex Left Fist: 1d4 + no mod for second weapon Bonus Attack Unarmed Strike: 1d4 + Dex


Notify-osd notifications appear unthemed in top-left corner

Problem  I recently upgraded from 13.04 to 13.10, and suddenly notification bubbles don't appear themed as usual in the upper right corner, but they appear as white text on blue background in the upper-left corner. It looks like this:     Unsuccesful attempts to fix it   I tried reinstalling unity, notify-osd, ubuntu-desktop removed notification-daemon which was installed, none of that fixes it. In fact running ps aux | grep notify-osd shows that notify-osd isn't even running. But when I try to start it manually by running /usr/lib/x86_64-linux-gnu/notify-osd I get:  ** (notify-osd:4618): WARNING **: Another instance has already registered org.freedesktop.Notifications  ** (notify-osd:4618): WARNING **: Could not register instance  If I understand well, the instance is registered by the /usr/share/dbus-1/services/org.freedesktop.Notifications.service file, which right now contains:  [D-BUS Service] Name=org.freedesktop.Notifications Exec=/usr/lib/x86_64-linux-gnu/notify-osd   Renaming or deleting that file (and rebooting) has no effect whatsoever (and it is not recreated automatically). This is not a duplicate of  (and by the way I purged gnome-flashback-session along with notification-daemon)   Question(s)  How can I debug this? How can I get notifications to come back to normal?  If additional debug information is needed, I'll be happy to add it (just that I can't find any more).


The facts of travelling at the speed of light

I’m travelling at the speed of light. If I hold a mirror in front of me could I see my face?


Java FilterInputStream problem with reading bytes

I'm working on simple encrypt/decrypt machine in Java with decorators(FilterOutputStream and FilterInputStream). I have done CipherOutputStream which works fine, encrypt message and then write it into file. But when I want to read bytes to decrypt them and save something strange happens. While reading first package from buffor (buffor is set to send me 32 bytes) it always return "[B@b59d31", and when I read next packages its still the same.(https://imgur.com/a/BaAjqVA) Someone can explain me what can be wrong? Here's my CipherOutputStream: package gof.decorator;  import java.io.*;  public class CipherInputStream extends FilterInputStream {           public CipherInputStream(InputStream inputStream) {         super(inputStream);     }          public byte[] decrypt(byte[] b) { //here is my decrypt code, it doesnt matter         return b;     }          @Override     public int read() throws IOException {         try {             int val = super.read();             if (val == -1)                 close();             return val;         } catch(IOException e) {             close();             throw e;         }     }     @Override     public int read(byte[] b,int off, int len) throws IOException {         try {             System.out.println(b.toString());             int val = super.read(decrypt(b),off,len);             if (val == -1)                 close();             return val;         } catch(IOException e) {             close();             throw e;         }     }     @Override     public int read(byte[] b) throws IOException {         return read(b,0,b.length);     }  }   And here is how I'm copying my encrypted file to newFile: private void copyAndClose(InputStream in, OutputStream out, int buffor) throws IOException {         byte[] array = new byte[buffor];         int count;         while ( (count=in.read(array)) != -1) {                 out.write(array,0,count);         }         in.close();         out.close();     }


How to find fastest mirror from given list?

I know that  exists, but it deals only with mirrors for ubuntu sources.  I want a application/script/command which would find the best mirror/server from a given list, which may or may not be related to Ubuntu.  For example  gives a list of Arch Linux mirrors. Similarly many softwares have multiple mirrors. I want to find the best mirror from the given list. I am ready to add the mirrors one by one into some script/app/command.  If possible, the script/app/command should find the mirror which gives highest speed, rather than one that is closest.


Unix zip command is updating existing archive instead of creating a new one

$(which zip) -r ../data.zip .   The contents of the folders are changing dynamically overtime, I tested it first with including huge.pdf file and later deleted it, but still data.zip stays the same size. On unzipping I could see the huge.pdf file there.  I wish that zip command overrides the existing archive completely.   and I'm executing this shell command in an application (nodejs)  Edit: I don't think so the linked question is duplicate.


Problems when installing Macaulay2 in Ubuntu 18.04

I want to install Macaulay2 on Ubuntu 18.04. I followed the instructions  and for some reason its not working. Could anybody help me figure this out? So this is what I have:  Input    sudo apt-get install libblas3 libgfortran4 liblapack3 libquadmath0   Output:   Reading package lists... Done  Building dependency tree  Reading state information... Done  libblas3 is already the newest version (3.7.1-4ubuntu1).  liblapack3 is already the newest version (3.7.1-4ubuntu1).  libgfortran4 is already the newest version (7.4.0-1ubuntu1~18.04.1).  libquadmath0 is already the newest version (8.3.0-6ubuntu1~18.04.1).  0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   Input   wget https://faculty.math.illinois.edu/Macaulay2/Repositories/Ubuntu/dists/bionic/main/binary-amd64/Macaulay2-1.14-amd64-Linux-Ubuntu-18.04.deb   Output   Will not apply HSTS. The HSTS database must be a regular and non-world-writable file.  ERROR: could not open HSTS store at '/home/artus/.wget-hsts'. HSTS will be disabled.  --2019-10-30 13:51:17--  https://faculty.math.illinois.edu/Macaulay2/Repositories/Ubuntu/dists/bionic/main/binary-amd64/Macaulay2-1.14-amd64-Linux-Ubuntu-18.04.deb  Resolving faculty.math.illinois.edu      (faculty.math.illinois.edu)... 128.174.199.46  Connecting to faculty.math.illinois.edu   (faculty.math.illinois.edu)|128.174.199.46|:443... connected.  HTTP request sent, awaiting response... 200 OK  Length: 23695100 (23M) [application/octet-stream]  Saving to: ‘Macaulay2-1.14-amd64-Linux-Ubuntu-18.04.deb.7’   Macaulay2-1.14-amd64-Lin 100%[===============================>]  22.60M   425KB/s    in 59s   2019-10-30 13:52:25 (395 KB/s) - ‘Macaulay2-1.14-amd64-Linux-Ubuntu-18.04.deb.7’ saved [23695100/23695100]   Input   wget https://faculty.math.illinois.edu/Macaulay2/Repositories/Ubuntu/dists/bionic/main/binary-amd64/Macaulay2-1.14-common.deb   Output   Will not apply HSTS. The HSTS database must be a regular and non-world-writable file.  ERROR: could not open HSTS store at '/home/artus/.wget-hsts'. HSTS will be disabled.  --2019-10-30 13:53:27--  https://faculty.math.illinois.edu/Macaulay2/Repositories/Ubuntu/dists/bionic/main/binary-amd64/Macaulay2-1.14-common.deb  Resolving faculty.math.illinois.edu (faculty.math.illinois.edu)... 128.174.199.46  Connecting to faculty.math.illinois.edu (faculty.math.illinois.edu)|128.174.199.46|:443... connected.  HTTP request sent, awaiting response... 200 OK  Length: 21834554 (21M) [application/octet-stream]  Saving to: ‘Macaulay2-1.14-common.deb.7’   Macaulay2-1.14-common.de 100%[===============================>]  20.82M   946KB/s    in 43s   2019-10-30 13:54:19 (499 KB/s) - ‘Macaulay2-1.14-common.deb.7’ saved [21834554/21834554]   Input   M2   Output   M2: command not found   Note: I am using the linux subsystem in windows 10 (not sure if that makes any difference). I would really appreciate any help since I've been trying to install this for over a week and it doesn't seem to work for some reason.


Laws of Atomic Theory - how is this possible?

Not sure if this is the right place to post, but how is it possible to have laws of a theory?  A theory is not able to be a law, since it's just an explanation that can always be disproven. So how is there a law of a theory?


Write the prime $2017$ as the sum of two squares  $2017$ can be written as the sum of two squares because it is a prime of the form $p\equiv 1\ ($mod $4)$  Using an appropriate algorithm find the two numbers that, when squared, add to the total of $2017$


Java.lang.NullPointerException error in Java program

Keep getting this error, sorry I am a beginner in Java.     Exception in thread "main": java.lang.NullPointerException   at assignment01.Student.addGrade(Student.java:28)   at assignment01.GpaTest.main(GpaTest.java:11)   package assignment01;      public class Grades      {         private double qualPts;         private int numCred;          public double getGPA()         {             if(numCred!=0)             {                 return(qualPts/numCred);             }             return numCred;           }          public void addGrade(int creds, double grade)         {             grade+=creds+numCred;             qualPts+=creds*grade;         }          public int getNumCred()         {             return numCred;         }     }   .  package assignment01;  public class Student  {     private String name;     private String bNumber;     private Grades grades;       public Student(String name, String bNumber)     {         this.name=name;         this.bNumber=bNumber;     }      public void addGrade(int creds, double grade)     {            grades.addGrade(creds, grade);      }   .  package assignment01;  public class GpaTest {      public static void main(String[] args)     {         Student theStudent= new Student("Ethan","00000000");         int CREDITS_ENROLLED1=4;         double GRADE1=90;         theStudent.addGrade(1, 100);         theStudent.addGrade(CREDITS_ENROLLED1,GRADE1);         System.out.println("Determining the grades of student named Ethan.");            System.out.println("Ethan has a grade of 90.");     } }


Extra spacing before an equation when line nearly breaks

I am having difficulty with producing an MWE, but let me describe the issue. I have a large document with tons of equations and run into issues with spacing. Most of the time it is fine, everything looks good; however, precisely when the line immediately prior to the equation is about to break (i.e., the text fills the entire line), the equation is preceded with additional vertical spacing, as seen on the image below.    Equation (5.15) shows this issue, however (5.16) does not. Since the line before (5.15) is about to break, is there a chance that the extra space is due to an empty line being inserted?  I tried reproducing this exact situation to produce an MWE, but XeLaTeX makes different line-breaking decisions. As a result I cannot reproduce this precise error. Any clues about the causes of this behavior or ways to avoid it?  This is the offending fragment:  particles separately, effectively using $M = 1$, but consider executing the sampling algorithm in an unchanged form, but simultaneously for $M \geq 1$ at a time. At the coarsest level we generate $M$ samples \begin{equation}  \vec x_{V_m}^j \sim \hat{P}(\vec x_{V_m}^j) \end{equation} and perform the conditional


One more question on the usage of "forget"

I've recently seen questions about the usage of "forget something somewhere".  The answer, as suggested in  is that the construction is commonly used and acceptable.   Actually reliable resources such as the  and the , for instance, clearly state that in the above mentioned construction the verb "leave" should be used instead of  "forget".   I am aware that the construction with forget is common and  that it is grammatically correct, but I don't understand why dictionaries and grammars warn against this usage.   Why is the construction " forget something somewhere"  considered "incorrect"?   EDIT: I don't think that this question is a duplicate as Mr. Hot Licks suggests. There is not the answer I am looking for in the other question.


Can't define variables after any operation?

My C language teacher claims that all variables must be defined before any operation. I can somehow recall it's a very old feature of C (no later than 1990) but I can't reproduce it with GCC 7.2.0.  My teacher claims this:  int main(){     int a; /* Valid */     a = 1; /* An operation */     int b; /* Invalid because an operation has already occurred */     return 0; }   I tried compiling with  gcc test.c -std=c89 -Wall -Wextra -pedantic   but it gives no error, not even a warning.  How can I verify (or prove wrong) that statement?


Why does turning off Auto Smooth removes blotches?

Often with imported OBJ meshes I noticed that some seemingly random vertices are surrounded in dark blotches and sometimes adjacent ones are pale. Yet all the readable characteristics are identical to a normal vert angle stats. So why when I was messing around I unchecked Auto Smooth did theses anomalies go away?


I've tried many times and completed the companion quest and mara quest and got the amulet of mara and still can't marry Aela or anyone else. I'm a Dragonborn in the game.


While adding a polygon feature in QGIS 2.2.0-Valmiera, the representation symbology of that particular feature(which is in-progress) appears to be "filled" until the completion(rightclick)  of digitization, eventhough that layer symbology is given as 'Outline: Simple line' as shown in attached screenshot. How to fix this?


How can I apply Multiline label option in the label property?  Name field contains a lengthy name. I want to wrap it.   My QGIS version is 1.8.


i've tried to search but didnt find something to help me with my problem.... (i'm sure it's here but i didnt find it...) i have database with table called "name" and type is "varchar" the Collation is "utf8mb4_unicode_ci" at my header.php i've added utf-8 encoding header('Content-Type: text/html; charset=utf-8');  but the problem is when i add values to the table it's show "×‘×“×™×§×”" and not in hebrew.... but when i show it on the site it's show fine in hebrew... the only problem is when i'm watching the databse it self... because i want to order things by ABC...         $query = mysqli_query($con,"SELECT * FROM `products` WHERE supplier = $supid ORDER by name ASC");


Does domain get SEO value from the content placed on subdomain? For example, blog.company.com to company.com.


Logistic regression is giving better results compared to SVM. How to explain this?

We are trying to come up with a prediction model for one our products in our team. We did some feature engineering to extract relevant features.  Now we are trying to see which ML methodology would give us the best result. We started with Logistic Regression and SVM. We expected SVM to perform better than Logistic Regression.  I am new to ML concepts. So need some help from expert forum.  Firstly, is it always true that SVM would perform better than Logistic Regression? If not, can someone please help me understand this mathematically? i.e, How do I debug why SVM is under performing compared to logistic regression?  Also is "Binomial Logistic Regression" different from "Linear Logistic Regression"?


After update, get "error: file not found." followed by "grub rescue> _"

I just installed quite a lot of 12.10 updates, was prompted to reboot, and then found that I couldn't boot.


zsh with vi-mode: How to keep a command line for future use without executing

It happens quite often to me, that while entering a complex command I realize that I need to enter some other commands first.  Being a vi user, I'd love to 0 D, enter a different command and later paste the deleted command line. Unfortunally, nobody (including myself) bothered to implement c&p-Registers in the vi mode of zsh.  So right now I Insert some x at the beginning of the command to make it fail, do my other stuff, fecth the old command from the history and remove the x. And each time I ask myself: Is there some easier way to do the same thing?  Not a duplicate! Please note that I mentioned I‘m using vi mode. None of the answers of the other question works for vi mode. They are only for emacs mode, even if they don‘t mention, so they are misleading. Please reopen so people can find the correct answer.


When is $\binom{n}{k}$ divisible by $n$?

Is there any way of determining if $\binom{n}{k} \equiv 0\pmod{n}$.  Note that I am aware of the case when $n =p$ a prime.  Other than that there does not seem to be any sort of pattern (I checked up to $n=50$).  Are there any known special cases where the problem becomes easier?  As a place to start I was thinking of using $e_p(n!)$ defined as:  $$e_p(n!) = \sum_{k=1}^{\infty}\left \lfloor\frac{n}{p^k}\right \rfloor$$  Which counts the exponent of $p$ in $n!$ (Legendre's theorem I believe?)  Then knowing the prime factorization of $n$ perhaps we can determine if these primes appear more times in the numerator of $\binom{n}{k}$ than the denominator.  Essentially I am looking to see if this method has any traction to it and what other types of research have been done on this problem (along with any proofs of results) before.  Thanks!


why do chaperones bring protein into mitochondria? why would mitochondria need protein?

Sounds trivial? Please help to sort out. I saw this picture while looking at dehydration reactions and cell revision.     And proceeded to the       Protein Folding and Processing in the ER: Various changes occur to proteins in the ER.   Chaperones and Folding: Polypeptides must assume the correct folding pattern in order to function properly. The correct folding of a protein is mediated by chaperones (they also are proteins--chaperones are abundant in the ER lumen). A completed polypeptide will assume the correct folding pattern spontaneously, however before translation is complete, it could assume an incorrect formation or it could aggregate with other partially made polypeptides. To prevent this, chaperones in the ER (and cytosol) bind to the nascent polypeptide and keep it from interacting with anything until the polypeptide is completely synthesized. (Chaperones bind to polypeptides destined for mitochondria then release them as they pass through the mitochondrial membranes. Chaperones on the inside of mitochondria bind until these polypeptides have completely entered.)   With regards to protein synthesis and folding, this kind of info is not in my textbook. Not in couple of the online open textbooks either. I even search for where do protein fold? to find out if there was a relationship. It doesn't say protein fold in mitochondria and turns out it's a question most scientist are looking for answers.  For whatever protein synthesis I have learnt so far, there was no mentioning of protein strands going into mitochondria but mitochondria as a power houses. What's going on here?   Why would a protein go into a mitochondria? How does it exit and where to?


What is the correct usage of who/whom after the first person pronoun "I"?     I ___ am most concerned, was not consulted.   I think it should be who, but I am not sure.


Why are surnames often misspellings of English words?

Why do English surnames so often seem to be derived from slight misspellings of common English words?   Weekes Thorne Browne Lilley Keene Paige Lowe Hooke Hawthorne Sargent Whyte Chappell Horne   ad infinitum...


Search Q&A is much less efficient than the engine behind the search while you type a question

I noticed that the search engine that brings up possible duplicate questions while you're typing a question works great.  Is there a way to use the same search engine in the 'Search Q&A' search box?


Versioned pages: making sure Google points to the current

The open-source Sinon project  that are versioned per-release. That means that , you might end up at a doc for version 2.4.1, instead of the latest version (whatever that might be).  What would be a good strategy for ensuring that the highest ranked results in Google would always be the current version?  I was thinking of creating a "version" called current (meaning a path for docs starting with /releases/current/) that would either redirect to the latest version, say /releases/v3.0.1/my-sub-doc.html, or be a copy of the latest docs. I would guess doing a HTTP 302 redirect to a new resource every x weeks might hurt SEO, so maybe the last approach would be the better of the two?


I want to verify the proof of this result:  Lemma: Let $g$ be a real analytic function. Then we have ((1) and (2)) is equivalent to (3), where: (1) $g$ has infinitely many real zeros.  (2) $g$ assumes arbitrarily large and arbitrarily small values, i.e., for all $K>0$, there are $s₁,s₂$ with $g(s₁)<-K$ and $g(s₂)>K$.  (3) The fiber $g⁻¹(w)$ is infinite for all $w∈ℝ$.  Proof: Firstely, assume by contraduction that the equation $g(s)=w$ has only finitely many solutions. That means there are $z₁<z₂$ such that $g(s)≠w$ for $w<z₁$ or $w>z₂$. Let $z₃$ be the largest zero of $g$ smaller than $z₁$, and $z₄$ the smallest zero larger than $z₂$. Let $K=max{|g(s)|:z₃≤s≤z₄}+|w|$. By assumption, there are $s₁,s₂$ with $g(s₁)<-K$ and $g(s₂)>K$. By the intermediate value theorem, there is an $s_{w}$ between $z₃$ or $z₄$ and $s₁$ or $s₂$ with $g(s_{w})=w$. Contradiction.  Secondly, $g$ has infinitely many zeros because the fiber $g⁻¹(0)$ is infinite. Let $K>0$ and $w=K+ε,ε>0$. The fiber $g⁻¹(K+ε)$ is nonempty because it is infinite, hence there is $s₂$ such that $g(s₂)=w=K+ε>K$. By the same method, $g⁻¹(-K-ε)$ is nonempty, so there is $s₁$ such that $g(s₁)=-K-ε<-K$.  Also, I want some start ideas to overcome the different steps of this proof.


Stock markets and dividends: When exactly does one need to own shares to be entitled to the dividend?

I have a more or less formal question regarding dividends.   If a company pays an (annual) dividend of - say - 5%, this is voted for/against on the annual general meeting. Now, the dividend is paid out to all shareholders that own stock. The day after the annual general meeting, the shares of that company are traded "ex-dividend", meaning the assumed 5% lower. This all is clear to me and logical.  What I am uncertain about is when EXACTLY one has to own shares in order to be paid the dividend.  In other words: what happens if I buy - or sell - shares on the day of the annual general meeting?  Let's pick an example: SAP (Germany) have their annual general meeting today (15. May). Assume I own 1 share (approx 112€ right now). They'll pay a dividend of 1,50€ per share. So ex-dividend, the price per share will drop to 110,50€ (ignoring all other market factors).  Now, SAP's website states that "dividends are remitted without delay after the resolution on the appropriation of retained earnings, usually on the third business day after the Annual General Meeting. All shareholders possessing SAP certificates at the time of the resolution on the appropriation of retained earnings are entitled to receive payment of the dividend."   The German original of this section reads "Dividendenberechtigt sind alle Aktionäre, die bei Beschlussfassung der Hauptversammlung über die Gewinnverwendung SAP-Aktien besitzen.":  Explicitly, if you own shares at the time the decision is made to pay a dividend, you are entitled to it. End of story.  So, to summarize:   Date of resolution = annual general meeting = 15. May Date shares are traded ex dividend = 16. May Remission of dividends (payout day) = 15. May + approx. 3 days = 18. May   Does this technically mean you could buy SAP shares on May 15th, sell them in the evening the same day, hence are entitled to the dividend since you owned the shares "at the time of resolution of the appropriation", yet not suffer the ex dividend share prices.  Can't be, right?  So hence my question: How does this work - EXACTLY?


How do I delete Fedora 15 from Ubuntu 12? Fedora was installed first

I installed Fedora 15 on my laptop and deleted XP (at least I think XP is deleted).  Then I installed Ubuntu as dual boot with Fedora 15.  Now I want to remove Fedora 15 and leave only Ubuntu (and XP if it is still available).  Can anyone help with the steps to uninstall Fedora?  Please give me simple steps to follow, I'm a nooby.  Thanks!


I am new to sqli ,just started learning oops . I have this code in my db.php  $db = new mysqli('localhost', 'root', '', 'mydb');  if($db->connect_errno > 0){     die('Unable to connect to database [' . $db->connect_error . ']'); }   Another file func.php  <?php include_once 'db.php'; function get_users()    {               $sql="SELECT * from users";          $result=$db->query($sql);           while($row = $result->fetch_assoc())             {                 $data[]=$row;             }       return $data; }   var_dump(get_users());  Error : Undefined variable: db  and when i use  global $db; inside function  Error : Call to a member function query() on a non-object in  What is the problem here and how can i correct it ?


Uhlmann's Theorem: proof of $\text{tr}(A^{\dagger} B) = \langle m | A \otimes B |m\rangle $

In p228, Chapter 9 of Mark Wilde's text , in the course of proving Uhlmann's theorem for quantum fidelity, it claims $$\sum_{i,j} \langle i|^R \langle i|^A (U^R \otimes (\sqrt{\rho}\sqrt{\sigma})^A) |j\rangle^R |j\rangle^A  $$ $$=\sum_{i,j} \langle i|^R \langle i|^A (I^R \otimes (\sqrt{\rho}\sqrt{\sigma}U^T)^A) |j\rangle^R |j\rangle^A $$ which are equations (9.97) and (9.98) in the aforementioned text.  Meanwhile, in Nielsen & Chuang's text, exercise 9.16 requires to prove that $$\text{tr}(A^{\dagger} B) = \langle m | A \otimes B |m\rangle $$ for $|m\rangle = \sum_{i} |i\rangle|i\rangle $ where $\{ |i\rangle \}$ is an orthonormal basis on some Hilbert space and A and B are operators on that space.   Each thing above is crucial in proof of Uhlmann theorem in respective textbook but I have no idea why they hold. $\text{tr}(A^{\dagger} B) = \sum_{i,j} {a_{ij}}^{*}b_{ij}$ whereas   $ \langle m | A \otimes B |m\rangle = \sum_{i,j} {a_{ij}} b_{ij } $ so why they equal? Could anybody give me any hint?


Can a human eat grass and digest it? Could it be possible to use it as food just like other plants such as wheat or beans?


Why does baobab estimate my usage as less than half compared to du or pan_quota?

On a panfs filesystem:   pan_quota says I'm using 8.67 GB. du -hcsx says I'm using 8.1 GB. baobab says I'm using 3.3 GB.   This is for my home directory, with a 8 GB soft and 10 GB hard quota.  What might cause the modest discrepancy between duand pan_quota?  And what may cause the huge discrepancy between baobab and either du or pan_quota?  The difference is not due to one or two specific files, but propagates down and is present for smaller and larger directories alike.


System.out.print("Hi " + name + ", which do you choose? (O)dds or (E)vens? ");          String userChoice = null;          while ((!userChoice.equals("O")) || (!userChoice.equals("E"))) {              userChoice = input.nextLine();         }          if ( userChoice.equals("O") ) {             System.out.println(name + " has picked odds! The computer will be evens.");         } else {             System.out.println(name + " has picked evens! The computer will be odds.");         }  Cheers guys, I am new to Java and I have no clue why this is not working. I want to ask the user for his choice until he chooses "O" or "E". Otherwise re-ask the user for his input. Therefore my idea was to check if userChoice does not equal "O" or "E" > ask again. Thank you in advance for your help! I get this error when running the code:  Let´s play a game called "Odds and Evens" What is your name? Ron Hi Ron, which do you choose? (O)dds or (E)vens? Exception in thread "main" > java.lang.NullPointerException at com.ronwalter.Main.main(Main.java:18) Process finished with exit code 1


My hair is short so I'm growing them for my wedding  Is it grammatically correct to use "them" with hair?


How do I meter for long exposures (10+ minutes)?

One of my longstanding interests is long exposure night photography.  However, many of the situations where I am shooting require exposure lengths on the order of 10 minutes, which is far beyond what the internal meter in my camera (5DII) can handle.  Right now, I take a test exposure, extrapolate from that to guess my exposure time, try again, etc...  This works, but since the test exposure alone can be 10 minutes, and it generally takes me a few shots to get the exposure right, it can take 30 minutes to an hour just to figure out exactly how long I need to expose for.  Obviously, this is really inconvenient (fortunately, long exposure subjects don't move much, most of the time).   For instance, recently I did a series of 13 minute exposures at f4, ISO125. It came out really well, but I would up spending 2 hours to get one shot.  Anyways, is there an easier way to determine how long an exposure has to be, preferably that doesn't take multiple test exposures? I've looked at light meters, but none of them make explicit statements about how low a level of light they can handle.


Encrypt home directory / LVM encryption - Ubuntu Server 14.04 setup

There seems to be two different steps in the Ubuntu Server 14.04 installation that involve encryption. The first asks if I want to encrypt my home directory:     The second has an option for encrypted LVM:     Are these two different encryption procedures? If I do both is my drive doubly encrypted? Why would I do one and not the other?  I don't think this is a duplicate of  because that solution does not explain why there are seemingly two encryption steps being offered.


**vishwa@vishwa-HP-Notebook:~$ dmesg** [  474.601906] IPv6: ADDRCONF(NETDEV_UP): wlp19s0: link is not ready [  483.258050] wlp19s0: authenticate with ec:22:80:86:88:58 [  483.281336] wlp19s0: send auth to ec:22:80:86:88:58 (try 1/3) [  483.384450] wlp19s0: send auth to ec:22:80:86:88:58 (try 2/3) [  483.488419] wlp19s0: send auth to ec:22:80:86:88:58 (try 3/3) [  483.592520] wlp19s0: authentication with ec:22:80:86:88:58 timed out    **rfkill list**  0: hci0: Bluetooth     Soft blocked: yes     Hard blocked: no 1: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no  **iwlist wlp19s0 scan** wlp19s0   Scan completed :           Cell 01 - Address: EC:22:80:86:88:58                     Channel:1                     Frequency:2.412 GHz (Channel 1)                     Quality=38/70  Signal level=-72 dBm                       Encryption key:on                     ESSID:"NAMENAME"                     Bit Rates:1 Mb/s; 2 Mb/s; 5.5 Mb/s; 11 Mb/s; 6 Mb/s                               9 Mb/s; 12 Mb/s; 18 Mb/s                     Bit Rates:24 Mb/s; 36 Mb/s; 48 Mb/s; 54 Mb/s                     Mode:Master                     Extra:tsf=00000002ef4cd173                     Extra: Last beacon: 29096ms ago                     IE: Unknown: 000F4F6D4E616D6F56656E6B6174657368                     IE: Unknown: 010882848B960C121824                     IE: Unknown: 030101                     IE: Unknown: 050400010000                     IE: Unknown: 2A0104                     IE: Unknown: 32043048606C                     IE: Unknown: 2D1A6E181EFF00000000000000000000000000000000000000000000                     IE: Unknown: 3D1601050000000000000000000000000000000000000000                     IE: Unknown: 4A0E14000A00B400C800140005001900                     IE: Unknown: 7F0101                     IE: WPA Version 1                         Group Cipher : TKIP                         Pairwise Ciphers (1) : CCMP                         Authentication Suites (1) : PSK                     IE: IEEE 802.11i/WPA2 Version 1                         Group Cipher : TKIP                         Pairwise Ciphers (1) : CCMP                         Authentication Suites (1) : PSK                     IE: Unknown: DD180050F2020101000003A4000027A4000042435E0062322F00                     IE: Unknown: DD1E00904C336E181EFF00000000000000000000000000000000000000000000                     IE: Unknown: DD1A00904C3401050000000000000000000000000000000000000000                     IE: Unknown: DD0600E04C020160                     IE: Unknown: DD180050F204104A00011010440001021049000600372A000120   **lspci -v**  13:00.0 Network controller: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter     Subsystem: Hewlett-Packard Company RTL8723BE PCIe Wireless Network Adapter     Flags: bus master, fast devsel, latency 0, IRQ 16     I/O ports at 3000 [size=256]     Memory at d3000000 (64-bit, non-prefetchable) [size=16K]     Capabilities: <access denied>     Kernel driver in use: rtl8723be     Kernel modules: rtl8723be


On my win10 system I've noticed that there is one huge file on my HD - SRUDB.dat.  Can anybody explain what is this file? Googling, it seems that I can't delete it just like that. How to decrease its size?  Regards


What is causing my java.lang.NullPointerException error when I try to run this program?

My code is this:   public class Main{      public static void main(String[] args){         WordGroup wordgroupOne= new WordGroup ("You can discover more about a person in an hour of play than in a year of conversation");         WordGroup wordgroupTwo= new WordGroup ( "When you play play hard when you work dont play at all");          String[] quoteOne = wordgroupOne.getWordArray();            String[] quoteTwo = wordgroupTwo.getWordArray();          for (String word : quoteOne){             System.out.println(word);         }          for (String word : quoteTwo){                                    System.out.println(word);         }     } }   Wordgroup class:   public class WordGroup {     public String words;      public WordGroup (String getWords){         words = words.toLowerCase();     }      public String[] getWordArray(){         return words.split(" ");        } }   It compiles fine but when I try to run it I get the error java.lang.NullPointerException and it highlights "words = words.toLowerCase();" (I'm using blueJ) what is causing this?  When researching it says that this error is when you try to operate on a null set but the WordGroup is not null as it has a string defined in Main.


Have a bunch of urls separated by space in a string:  String urls =  "https://i.ytimg.com/vi/8xjfdGErgUc/maxresdefault.jpg https://i.ytimg.com/vi/9xber0p1bTw/maxresdefault.jpg https://yt3.ggpht.com/-fG6iPki4sFY/AAAAAAAAAAI/AAAAAAAAAAA/2Sbu6OjrBik/s900-c-k-no-rj-c0xffffff/photo.jpg https://yt3.ggpht.com/-YZyzwE3a30c/AAAAAAAAAAI/AAAAAAAAAAA/16qPbHiYJmc/s900-c-k-no-rj-c0xffffff/photo.jpg https://yt3.ggpht.com/-EYlRar9RsEY/AAAAAAAAAAI/AAAAAAAAAAA/JPQTc68e_x4/s900-c-k-no-rj-c0xffffff/photo.jpg https://i.ytimg.com/vi/VttZwjV38H0/maxresdefault.jpg https://yt3.ggpht.com/-7qUTA41fVxA/AAAAAAAAAAI/AAAAAAAAAAA/ZtK1pGLa4vw/s900-c-k-no-rj-c0xffffff/photo.jpg https://i.ytimg.com/vi/KfQBdRcgizc/maxresdefault.jpg https://yt3.ggpht.com/-VGI9T-Sm5xg/AAAAAAAAAAI/AAAAAAAAAAA/AtC93A0H3AQ/s900-c-k-no-rj-c0xffffff/photo.jpg https://i.ytimg.com/vi/aRkceYdlkTo/maxresdefault.jpg"    Attempt at converting to String array produces unexpected output?   String[] urlAry = urls.split(" ");   output  [Ljava.lang.String;@1e5746c0


Difference between Minolta MC and MD mounts and can they be used on AF camera?

I am looking at some older lenses for sale.  There are a lot of Minolta MC and MD mount lenses out there.  Can they be used on an AF mount body at all (as a fully manual lens)?  Will either of the MC or MD lenses have any automatic features (aperture, focus, etc)?  I am looking to update a 1990's era Minolta film camera, so it is not clear whether these older lenses will work or not.  I see from this question, , that it appears that older lenses do not work with the AF mounts?  Will they not fit at all?


best and reasonably priced means of transportation to get to IAD from Lanham or New Carrollton  on Sunday Morning.  No luggage.


Adobe Illustrator - prevent U or curly shape strokes filling some space

I am new in adobe illustrator and basically i'm learning from anything i can find on the internet.   The issue i am having is when I use calligraphic brush with width set to pressure.  It annoys me a lot when I try to draw a stroke where it curls up and two lines come too close to each other, some space between the lines is getting filled. How can i stop this?  I tried to turn the brush smoothness to as accurate as it goes but nothing changes.. I'm sorry if this is a noob questions, but any ideas?  I tried to draw an example in paint below, to be able to describe my issue. Any suggestion would be appreciated.  Thanks


Problem with authors names in the references

I'm having a problem in the references. When I have multiple names, I wrote all the names before compiling the file but that it selects randomly a few authors names by writing just the first letter of (first name and last name) as you can see below. I need help to show all the names completely.  The bibliography section in the main file:  \newpage \bibliographystyle{IEEEtran} \bibliographystyle{unsrtnat} \bibliography{./references} \addcontentsline{toc}{section}{References}    The reference input:  @TechReport{Evaluation, author = {Aline Vieira de Mello, Luciano Copello Ost, Fernando Gehm Moraes, Ney Laert Vilar Calazans}, title = {Evaluation of Routing Algorithms on Mesh Based NoCs}, institution = {FACULDADE DE INFORMÁTICA}, year = {2004}, OPTkey = {•}, OPTtype = {•}, number = {40}, OPTaddress = {•}, month = {May}, OPTnote = {•}, OPTannote = {•} }   The Output:     [1] F. G. M. N. L. V. C. Aline Vieira de Mello, Luciano Copello Ost,   \Evaluation of                routing algorithms on mesh based nocs,"   FACULDADE DE INFORMTICA, Tech. Rep. 40, May 2004.   Thanks in advance, Reagards.


What does "Restricted" (aka. "Do not") system icon on Lollipop mean?

I'm using Nexus tablet on stock Lollipop. For the life of me, I can't find what the "restricted" sign in the top right corner means. I've checked the user manual as well but still not worked out what it means.  What is the meaning of that icon?


Why can't a group member create a file in a directory with 760 permissions?

I have an account with secondary group membership in a group that owns a directory.  The directory is chmod 760, which should allow writing to the directory, but not listing it.  However, this is not allowed.  Can somebody explain why?  Rationale: mostly academic; trying to understand permissions in detail.  I recognize that I could make the permissions 770 and allow this; I'm not an idiot (at least I don't think so).  I just want to understand what write permissions actually mean for a directory, if not file creation.  Code example:  powerdave@dhirsch-centos:/tmp >groups powerdave wheel share powerdave@dhirsch-centos:/tmp >ls -alh total 124K drwxrwxrwt.  5 root      root      4.0K Feb 23 15:08 ./ dr-xr-xr-x. 23 root      root      4.0K Feb 23 14:57 ../ drwxrw----.  2 guest     share     4.0K Feb 23 14:52 test/ powerdave@dhirsch-centos:/tmp >touch test/file touch: cannot touch `test/file': Permission denied


What is the practical interest of superdense coding?

When you enter the field of quantum communications, you run at some point into the concept of superdense coding.  Basically it is a way to encode classical bits on the qubits of a quantum channel, which sounds interesting in the first place to increase classical throughput by benefitting of the exponential growth of the Hilbert space with multiple qubits.  Yet when you look at the protocol in more detail, you understand that even though it seems that you have encoded 2 classical bits in 1 qubit, you actually need a second, entangled, qubit to retrieve the information from the 1st qubit.  So there is no real benefit - if you need to send two photons, you can encode two bits classically.  So apart from a textbook example, where is the practical interest? Are there more subtle points I am missing? Are there more intricatre protocols to avoid that?


Convert a line drawing from raster to vector

I have a raster image, basically a scanned drawing of the outlines (and some detail) of various objects, and I wish to convert these lines to vectors, using either Illustrator or Inkscape.  My present solution is to have the raster image as a background layer, and in a new layer above it I use the pen to follow the lines as close as possible.  Later I tweak these lines to fit the raster image better. That has worked fine for simple drawings. However for some of my extremely complex drawings, this is very tedious to do.  Is there any tool or filter of some sort that is capable of recognizing the lines in line drawings and creating vector paths from them?


I have a table that has about 200K rows of data. Overall it works great. I have two different pages where users can submit data to be inserted into this table. Both work fine, except when it comes to languages like Arabic. One continues to work fine however the other one inserts total gibberish. The PHP code in both cases is almost identical.  The page that woks fine submits data to a PHP script via form POST. When I check for the encoding type of the data it shows as ASCII.  The page that is acting up uses JS to submit data via ajax to another PHP script. When I check for data encoding on that page it shows as UTF-8.  Here's my table's info:  CREATE TABLE `uiCardCategories` (     `id` INT(10) UNSIGNED NOT NULL AUTO_INCREMENT,     `project_id` INT(10) UNSIGNED NOT NULL,     `catCreator_id` INT(11) NULL DEFAULT NULL COMMENT 'id of the user who created this stack',     `catCreator_participantID` INT(11) NULL DEFAULT NULL COMMENT 'id of the participant who created this stack',     `label` VARCHAR(400) NOT NULL,     PRIMARY KEY (`id`, `project_id`),     INDEX `ix_uiCardCategories_project_creator_id` (`project_id`) ) COLLATE='utf8_general_ci' ENGINE=MyISAM AUTO_INCREMENT=160880 ;   I tested with the phrase "this is a test, in Arabic "هذا اختبار". Data in the table is:      Ù‡Ø°Ø§ Ø§Ø®ØªØ¨Ø§Ø±   What am I missing?


As a new Ubuntu user, I have installed a few apps through the Terminal.  I have tried to follow several, albeit outdated, threads that explain how to install OpenOffice, but I cannot get it to work. It would be really helpful if someone would provide me with the necessary commands for it to work.


I've been googling for this for hours, actually more than that i always come to look for an answer after few weeks but I always give up. Why not try to ask i guess.   All i'm looking for is effect like that    I've seen only people talk about it or having questions about it but no answers. Only one answer i found was "there's plenty ways to do it" but not exactly how to.  I couldn't figure out how to do it on my own. I know game engines have quiet easy way to do this in particle system but i'd like to know how to do that in Blender. Not just one slash trail after hit but continuous.


I am trying to set left margin in my document but I am unable to do it

I am using:  \oddsidemargin -.1in \evensidemargin 1in  oddsidemargin is able to control right-hand side margin while for evensidemargin there is no effect. Is there anything else I should do?


Find the values of $p$ for which the series is convergent.

$$\sum_{n=3}^{\infty}\frac{1}{n\ln(n)\left(\ln(\ln(n))\right)^p}$$ I have to find the values of $p$ to make this series convergent. How would I do this?  I tried doing the integral test and ended up with  $$\frac{(\ln(\ln(x)))^{-p+1}}{-p+1}$$  Where do I go from here? Basically ln(inf) will always be inf so like the only way to make it convergent is if p=1 but then that makes the bottom undefined so like I am super confused.  Wait could it be p>1? cuz then it puts the infinity on the bottom and makes it 0.


LaTex Image Problems (Align and position)

I've a problem with image import in LaTex. I want to set all images centered, i tried a lot of commands found around here but nothing seems works. Now I have encountered another problem, because images aren't positioned in the right part of the document @_@ I'm new with LaTex, so probably is a noob's mistake.  Here is the code:  \section{Cliente}  \begin{figure}[ht!]     \includegraphics[page=1,width=1.5\textwidth,center]{./Query-OrderByRandOttimizzata.png} \end{figure}  \section{Contratto}  \begin{figure}[ht!]     \includegraphics[page=1,width=1.5\textwidth,center]{./10Contratti.png} \end{figure}  \section{Societ\`a}  \begin{figure}[ht!]     \includegraphics[page=1,width=1\textwidth,center]{./10Societa.png} \end{figure}  \section{Impianti}  \begin{figure}[ht!]     \includegraphics[page=1,width=1\textwidth,center]{./10Impianti.png}     \caption{Nota: in questo caso si \`e costretti a utilizzare la query con ORDER BY per via della condizione sull' ID non rispettata.} \end{figure}   I can't post the image for results, but it's like this:  8.1 Cliente Image. -> Not centered.  8.2 Contratto Image. -> Not centered.  8.3 Società NO IMAGE -> It is in the next page.  8.4 Impianti NO IMAGE -> It is in the next page.   Another question: How can I insert the result of a query SQL in LaTex without use a screenshot? With "result of a query" I mean:  +----------+----------+ | Col1     | Col2     | +----------+----------+ | Val1     | Val2     | +----------+----------+   Hope that someone can help me, Thanks :)  P.s. Sorry for my bad English.


Why isn't my program interpreting the user's input correctly?

My code:      reask = input('So do you want me to solve a quadratic equation? Last chance or I will close and you have to start me again! Make sure you type \'yes\' or \'no\': ') reask = reask.lower if reask == 'yes':     print ('Great!') else:     print ('See ya!')     raise SystemExit   When the user inputs 'yes', the program interprets it as something else and ends up printing out 'See ya!' then closing the program. It's supposed to print 'Great!'. What's the issue?


How to make a villager move out in Animal Crossing New Leaf?

I've got a villager that I don't like and I want him to move out. How do I do that?


How to watch videos in Amazon Prime Instant Video?

Today I upgraded from Ubuntu 12.04 to Ubuntu 13.10. I am not able to watch any videos in Amazon Prime Instant Video. I am getting this message:   An error occurred and your player could not be updated.   This is likely because your Flash Player or Browser needs to be updated. This update is required to play back this video.


iMac running High Sierra is very slow — photoanalysisd can't be killed?

My iMac running High Sierra has become painfully slow. I suspect photoanalysisd, as it's using a lot of CPU time, but I can't figure out how to get rid of it. There's at least one other question () here about photoanalysisd, but my scenario is different and none of the suggestions in the other thread were helpful to me. Looking in the Console log, I see odd errors for photoanalysisd, e.g.: "seekAndRead -- Input/output error" "error: (266) I/O error for database -- CLSBusinessCategoryCache.sqlite.  SQLite error code:266, 'not an error' errno:5" "error: -executeRequest: encountered exception = I/O error for database at ... CLSBusinessCategoryCache.sqlite.  SQLite error code:266, 'not an error' errno:5"  Error code "not an error" -- huh? Using the Terminal, I've tried all of the following: sudo launchctl remove com.apple.photoanalysisd sudo launchctl kill -TERM gui/$UID/com.apple.photoanalysisd launchctl disable gui/$UID/com.apple.photoanalysisd launchctl kill -STOP gui/$UID/com.apple.photoanalysisd launchctl kill -TERM gui/$UID/com.apple.photoanalysisd  BUT photoanalysisd is still running, according to the Activity Monitor. Even after I issue commands to kill the process(!?), it's still there. Of course it also comes back when I restart, and slows the machine horribly again. First question, then: why don't these commands get rid of photoanalysisd? Next, I have tried starting in safe mode, but it makes no difference: the iMac is still unusable, until I issue commands to kill photoanalysisd. Also, the screen updates are incredibly slow in safe mode. The desktop appears very slowly and is painted in bands like venetian blinds opening up from the bottom. Never seen this before. Again, there is nothing in the Activity Monitor that is obviously eating up CPU or memory. Activity Monitor consistently reports over 90% idle, though the system is beachballing constantly. Finally, I have already re-installed High Sierra once, but it made no difference. I really don't care if the Photos app does the person recognition thing or not. I just want my Mac to be useable again. Any suggestions? EDIT: 25 days later, I still have no solution to this. My basic question about photoanalysisd (above) remains unanswered.


I have a issue since I'm not familiar with awk. I have csv file generated from sar -d output converted to csv style:  12:33:41        unix,restarts 12:35:00,lofi4096,0,0.0,0,0,0.0,0.0 ,iscsi0,0,0.0,0,0,0.0,0.0 ,scsi_vhc,0,0.0,0,0,0.0,0.0 ,nfs1,0,0.0,0,0,0.0,0.0  12:45:00,lofi4096,0,0.0,0,0,0.0,0.0 ,iscsi0,0,0.0,0,0,0.0,0.0 ,scsi_vhc,0,0.0,0,0,0.0,0.0 ,nfs1,0,0.0,0,0,0.0,0.0   and I want to convert to this  12:33:41        unix,restarts 12:35:00,lofi4096,0,0.0,0,0,0.0,0.0 12:35:00,iscsi0,0,0.0,0,0,0.0,0.0 12:35:00,scsi_vhc,0,0.0,0,0,0.0,0.0 12:35:00,nfs1,0,0.0,0,0,0.0,0.0  12:45:00,lofi4096,0,0.0,0,0,0.0,0.0 12:45:00,iscsi0,0,0.0,0,0,0.0,0.0 12:45:00,scsi_vhc,0,0.0,0,0,0.0,0.0 12:45:00,nfs1,0,0.0,0,0,0.0,0.0   My attempt but since awk reads line by line I don't know out to keep the previous line value. I would expect that what I have should work. Any idea how I can obtain my desired result. I tried with awk, but I guess this should be possible with sed or the hard way with a custom shell script ( I'm trying to avoid doing this part ).  #!/usr/bin/awk -f BEGIN {         FS=","; } {         print $1         if ($1 != "") {                 mydate=$1;                 print $0;         }         else {                 print $mydate","$0;         } }   Running the system with Solaris 11.1.


Overlapping text in Database Schema SEDE

Over at , there is overlapping text in the Database Schema under Close-As-Off-Topic-Reason-Types:  that makes it really hard to read.  This is also happening underneath "Pending Flags", and seemingly with every long line in the schema.  This would be fine if you could increase the width of the list as you can with the height, which would in theory separate the lines, but you can't.  Can we fix this, please?  UPDATE: I have found that  post is almost exactly the same as mine, but steady on with duplicate votes.   comment says that it will be fixed, but that question was asked more than five years ago, and in that time the problem has not been resolved.  UPDATE 2: It seems that  would help.  I changed a little CSS/HTML, and came up with this:  Although mine is a little cruder than it could be.  This is just an example.


If two limits don't exist, are we sure the limit of sum doesn't exist?

This is a true/false question.     If the limits $$\lim_ {x\to a}\ f(x)\quad \text{ and }\quad  \lim_ {x\to a}\ g(x)$$ don't exist, limits $$\lim_ {x\to a}\ (f(x)+g(x))\quad \text{ and }\quad \lim_ {x\to a}\ (f(x)g(x))$$ don't exist also.   My idea is, that, because $$\lim_ {x\to a}\ (f(x)+g(x))=\lim_ {x\to a}\ f(x)+\lim_ {x\to a} g(x)$$ then the limits doesn't exist, correct?


How to permanently get rid of the underline of hyperlinks in Microsoft word?

I modified the style, but when I click on the hyperlink it again gets underlined.  What should I do to permanently get rid of the underline in hyperlinks in a MS Word document?


I have a question concerned about the terminology private and public key within Public-key cryptography. I remeber back in university time learning in computer science, by taking the RSA algorithm as an example, the following definition: RSA Terminology:  Public Key: This defines the key to encrypt the message Private Key: This defines the key to decrypt the message  So in an end to end encrypted message system via RSA, the receiver shares the public key, that gives the sender the chance to encrypt the message. Further, the receiver takes his private key to decrypt the message. Correct me if I am wrong and mixing the terminologies, but Blockchain technology like Etherum Protocol actually switches the terminology around: Blockchain Terminology:  Public Key: This defines the key to decrypt the signed transaction for verification of the owner Private Key: This defines the key to encrypt the transaction and make the signature.  Maybe one with more experience in the field can tell me why the terminology is opposite here? (In ETH protocol I then share the actual private key and keep the public key to myself)


I built a wood house that I'm rather proud of. I've built a fireplace that seem safe, but I don't want to risk burning my house down. I've seen plenty of tutorials online for making safe fireplaces, but most of them are more than 1 year old, and possibly obsolete. I tried reading the Minecraft Wiki article on fire, but it gets pretty wordy and difficult to understand. Is the fireplace pictured below safe?  View from inside. (The wood planks in the fireplace will be the fuel, and eventually replaced with netherrack):   Up close view. (Fuel has been removed):   Outside view. (4 dirt blocks have been removed to show base of chimney):


Why use $(r,s)$ instead of $(r,s^{-1})$ as DSA signature?

A DSA signature consists of two scalars $(r,s)$.  When signing $s$ is generated as:   $s=k^{-1}(H(m)+xr) \mod q$ The signature is $(r,s)$   When verifying $s$ is only used to compute $w = s^{-1}$. So why does DSA store $s$ in the signature instead of $w$?  Using $w$ has no performance effect on signing since computing either $s$ or $w$ requires one modular inversion. $w = s^{-1} \mod q = k (H(m)+xr)^{-1} \mod q$. It would speed up verification since the modular inversion to compute $w$ isn't necessary anymore.  The only advantage of $s$ I see is that the modular inversion can be computed before the hash is known. Did the DSA designers consider that pre-computation more important than the verification slowdown, or is there some other advantage of using $s$ that I don't see?


Prove that $6$ divides $a+b+c$ if and only if $6$ divides $a^{3}+b^{3}+c^{3}$   Here's my attempt:  As $6$ divides $a+b+c$ , $a+b+c$ must be even. This implies,  $a^{3}+b^{3}+c^{3}$ is also even. Also, By Fermat's theorem $$a^3 \equiv a\pmod 3$$ Similarly $$b^3 \equiv b\pmod 3$$ and $$c^3 \equiv c\pmod 3$$. Therefore, $$a^{3}+b^{3}+c^{3} \equiv {a+b+c} \pmod 3$$ This implies that, $3$ divides $a^{3}+b^{3}+c^{3}$  and $a^{3}+b^{3}+c^{3}$  is even. Therefore , $6$ divides $a^{3}+b^{3}+c^{3}$. Does this look correct?  Also, Could you please help me write the proof for converse part. Thank you.


Correct usage of the word "my" in this sentence?

My writing was flowing and this is something that I wrote:     I pull into my parking spot, which is empty despite my having never reserved it, and get out.   I was curious as to whether this usage of the word my is grammatically correct, or whether the sentence would make sense without it?   Is me acceptable too? It doesn't seem right to me:     I pull into my parking spot, which is empty despite me having never reserved it, and get out.   I'm assuming that this is correct:     I pull into my parking spot, which is empty despite having never reserved it, and get out.   Or:     I pull into my parking spot, which is empty despite the fact that I've never reserved it, and get out.


Capturing console output from a .NET application (C#)

How do I invoke a console application from my .NET application and capture all the output generated in the console?   (Remember, I don't want to save the information first in a file and then relist as I would love to receive it as live.)


Missing "Vol." and "No." in biblatex/biber

I'd like to cite an article with biblatex, but I'm failing to add "Vol." and "No." in front of the corresponding number.  Here is the entry, of type @article, in the .bib file:  @article{kakimoto_monitoring_2006,     title = {Monitoring of Interarea Oscillation Mode by Synchronized Phasor Mesurement},     volume = {21},     issn = {0885-8950},     doi = {10.1109/TPWRS.2005.861960},     number = {1},     journal = {{IEEE} Transactions on Power Systems},     author = {Kakimoto, Naoto and Sugumi, Masahiro and Makino, Tohru and Tomiyama, Katsuyuki},     month = feb,     year = {2006},     pages = {260 -- 268} }   I cite it in this minimal example:  \documentclass{scrartcl}  \usepackage[T1]{fontenc} \usepackage{selinput} \SelectInputMappings{     adieresis={ä},     germandbls={ß},     Euro={€}, }  \usepackage[ngerman]{babel} % erweiterete Literaturverwaltung \usepackage[  backend = biber   % (bibtex, biber)         , bibwarn = true    % Warnung bei fehlerhafter bib-Datei         , style = authoryear         , natbib = true           ]{biblatex} % Einstellung der Anführungszeichen bei Zitaten („x“, »x«, “x”) \usepackage[autostyle = true]{csquotes}  % Lokalisierung für biber ergänzen % wirkt nicht \DefineBibliographyStrings{ngerman}{%       jourvol = {V1ol. }     , volume = {VolB. }     , volumes = {VolBs. }     , edition = {No. }     %, andothers = {and others} } % Trenner zwischen den Namen ein Semikolon \renewcommand*{\multinamedelim}{\addsemicolon\space}  % Literaturliste laden \addbibresource{L:/Uni/Literatur.bib}   \begin{document}  \cite{kakimoto_monitoring_2006}  \printbibliography  \end{document}   But I get in my bibliography this entry:  Kakimoto, Naoto u.a. (Feb. 2006). „Monitoring of Interarea Oscillation Mode by Syn- chronized Phasor Mesurement“. In: IEEE Transactions on Power Systems 21.1, S. 260– 268. issn: 0885-8950. doi: 10.1109/TPWRS.2005.861960.   As you can see, instead of "Vol. 21, No. 1" I get "21.1".  In my code I tried to change this behaviour with the \DefineBibliographyStrings macro, but without success. It is interesting, that the commented andother localisation string works, the others don't.


Do GTA 5 saves back-up to a cloud service?

For GTA 5 (on PC), if I have a save file, will it automatically back-up to either the Steam or Rockstar cloud, or do I have to save it manually? If it have to save it manually, will you please provide the default directory for saves?


How to install latex in Ubuntu 14.04 LTS?

Please help me install latex (texstudio or texlive or any other package) in my laptop. I am using Ubuntu 14.04 LTS.


i would like to know if there is the possibility of install ubuntu in my laptop asus x550c. How should i proceed to install all the drivers correctly?  Thanks!


Calculating ratio of sample data used for model fitting/training and validation

Provided a sample size "N" that I plan on using to forecast data. What are some of the ways to subdivide the data so that I use some of it to establish a model, and the remainder data to validate the model?  I know there is no black and white answer to this, but it would be interesting to know  some "rules of thumb" or usually used ratios. I know back at university, one of our professors used to say model on 60% and validate on 40%.


I have a folder containing JPG images and need to re-size them to a different pixel width and height and save them to a different folder with the same file name as original     ffmpeg -i Original.JPG -vf scale=1200:900 output.JPG   this is the command i used to re-size a single image.But I need to do it for the bulk.  Any Help ?


Let $S$ be any infinite set. Is it true that $S \times \mathbb{Z}$ has the same cardinality as $S$?

Consider any set $S$ which is not finite. Is it true that $S \times \mathbb{Z}$ has the same cardinality as $S$?  I thought the answer is "yes" and I thought it would be a trivial problem. But as I think about it, I have a nagging feeling it requires something like the Axiom of Choice and now, I'm not even sure the answer is "yes."  One cursory idea I had was to consider an injection of $\{s\} \times \mathbb{Z} \to S$ for each fixed $s \in S$. Somehow, if we can patch these together to form another injection $S \times \mathbb{Z}$, we would be done.


I'm using  semiverbatim with tikz in beamer. My following MWE throws error:     ! Package tikz Error: Sorry, some package has redefined the meaning of   the math-mode dollar sign. This is incompatible with tikz and its calc   library and might cause unrecoverable errors.   Any idea to resolve this issue. Thanks in advance.  \documentclass{beamer}  \usepackage{csed}  \usepackage{tikz} \usetikzlibrary{shapes}  \newif\ifshowanimation % The slides with animations take a long time to process. % They are omitted in handout mode. \showanimationfalse  \newenvironment<>{exercise}{\begin{block}#1{Exercise}}{\end{block}}  \newenvironment<>{notes}{\begin{alertblock}#1{Notes}}{\end{alertblock}}  \newcommand*{\menu}[1]{\textbf{#1}} \newcommand*{\menuitem}[1]{\,$\to$\,\textbf{#1}}  \definecolor{highlight1}{named}{yellow} \definecolor{highlight2}{named}{pink} \definecolor{highlight3}{named}{green} \definecolor{highlight4}{named}{orange} \definecolor{Red}{named}{red} \definecolor{Blue}{named}{blue}  \pgfdeclareimage[width=0.95\textwidth]{backdrop}{images/background.jpg} \pgfdeclareimage[width=1mm]{pointer}{images/pointer.png} \pgfdeclareimage[width=0.18\textwidth]{startmenu}{images/startMenu.jpg} \pgfdeclareimage[width=0.34\textwidth]{programsmenu}{images/programsMenu.jpg} \pgfdeclareimage[width=0.495\textwidth]{submenu}{images/subMenu.jpg} \pgfdeclareimage[width=0.608\textwidth]{latexmenu}{images/latexMenu.jpg} \pgfdeclareimage[width=0.591\textwidth]{latexmenu2}{images/latexMenu2.png} \pgfdeclareimage[width=0.591\textwidth]{cmd1}{images/cmd1.jpg} \pgfdeclareimage[width=0.591\textwidth]{cmd2}{images/cmd2.jpg} \foreach \x in {1,...,46} {   \pgfdeclareimage[width=0.84\textwidth]{tmkwin\x}{images/tmkwin-\x.jpg} } \pgfdeclareimage[width=0.75\textwidth]{saveAs1}{images/tex-28.jpg} \pgfdeclareimage[width=0.75\textwidth]{saveAs2}{images/tex-30.jpg} \pgfdeclareimage[width=0.75\textwidth]{saveAs3}{images/tex-32.jpg} \pgfdeclareimage[width=0.75\textwidth]{saveAs4}{images/tex-35.jpg} \pgfdeclareimage[width=0.75\textwidth]{saveAs5}{images/tex-36.jpg} \pgfdeclareimage[width=0.75\textwidth]{saveAs6}{images/tex-37.jpg}   \begin{document}  \begin{frame}[fragile]   \frametitle{A Simple Document}  \begin{example}     \begin{semiverbatim}         \textcolor<2>{Red}{\cs{documentclass}\annote<5-7>[offset=0.5in,voffset=1cm,pos=br,bg=highlight2]{[a4paper,12pt]}{Class options}\annote<4-7>[pos=br,bg=highlight1]{\marg{article}}{The class name.}}         \vspace{-2\baselineskip}\alt<7>{\colorbox{highlight4}{\rmfamily Preamble}}{\strut}         \textcolor<2>{Red}{\cs{begin}\marg{document}}         \textcolor<3>{Blue}{\% This is a comment}         \annote<6-7>[pos=cr,bg=highlight3,offset=0.4in]{\begin{tabular}{@{}l}         This is   a simple\\         document\cs{footnote}\marg{with a footnote}.\\         \\         This is a new paragraph.         \end{tabular}}{The document.}         \textcolor<2>{Red}{\cs{end}\marg{document}}     \end{semiverbatim} \end{example}  \end{frame}   \end{document}     Edited    csed can be obtained from .


Prefix or adjective meaning "one and a half"

Is there a prefix or adjective that means "one and a half", as "tri-" or "triple" is for "three"?  The exact usage I have is to describe "18" in terms of a dozen. Where I live they've started making 18-egg cartons, and the local grocer was wondering what name to give them in his computerised cash register, hoping for a single word.  Even slang, informal or invented term would do if there isn't such a term already.


Y or Delta connections advantages / disadvantages

I have been studying three-phase systems for the whole course of a subject (on the first year of the university degree). I have finished now, and I know both "Y" (star) or "Delta" (triangle) connections. I have made a lot of computations with them, however I don't know the different applications they have and I would like to know the following in order to increase my knowledge.  I would like to know which one is better (Y or Delta) for different purposes, they must have its advantages and disadvantages, but I have never been told which ones are them. I have tried to do some research on the Internet, but I haven't found in particular a good answer. I have only seen the advantages and disadvantages of Y and Delta motor startup, but I'm thinking more of the "circuit" point of view.  I'm really interested on the subject, but I just seen it from the computational point of view. I would appreciate if someone could explain me a little bit some of the main advantages and disadvantages of using both connections. Thank you.


Angle notation for complex numbers in polar form

I am looking for suggestions on how to typeset complex numbers in the modulo-argument form, sometimes called phasor notation. Have already checked  but nobody mentions this in particular. I am explicitly excluding exponential and sine-cosine notations. My MWE is as follows  \documentclass{article} \begin{document}     $z = r \angle \phi$ \end{document}   I think it looks ugly, specially if the angle has many digits, ie  $z = 1.19 \angle -78.2039^{\circ}$   I was thinking of an \angle replacement which maybe would extend the lower segment up to the last digit. What do you think?  EDIT: It looks like the steinmetz package doesn't do a good job with the vertical space if the \phasor{} argument has a \fraction{}{} with parenthesis, see:  \documentclass{article} \usepackage{steinmetz}  \begin{document}     Something.     \[I = I \phase{\left(\frac{A_0}{B_0}\right)}\]     This line is too close to the upper equation, don't you think?      \[I = I \phase{\left(\frac{A_0}{B_0}\right)}\]     Whereas this line is NOT so close to the upper equation. \end{document}   Strangely, commenting the first line (% Something.) fixes the problem. Is there any way to fix this?


Monitoring CPU, Mem, disk, on a single server

I've been looking for a simple starter solution for monitoring my [currently] single server hosted solution. Other than Nagios and similar, are there other good (simple) solutions people are using?


When would you use a WeakHashMap or a WeakReference?

The use of weak references is something that I've never seen an implementation of so I'm trying to figure out what the use case for them is and how the implementation would work. When have you needed to use a WeakHashMap or WeakReference and how was it used?


Binary Tree Group Project. Why is my root Still null? [not a duplicate]

public void addNodes(int[] keys){         //TODO             add(keys, root);     }      private void add(int[] keys, Node auxRoot){         if(auxRoot == null){             System.out.println("Root " + keys[0]);             auxRoot = new Node(keys[0]);             int[] newKeys = new int[keys.length-1];             for(int i =  0; i < keys.length-1; i++){                 newKeys[i] = keys[i+1];             }             add(newKeys, auxRoot);         } else if(auxRoot != null && keys[0] < auxRoot.key){             System.out.println("Left " + keys[0]);             if(auxRoot.left == null){                 auxRoot.left = new Node(keys[0]);                 if (keys.length > 1) {                     int[] newKeys = new int[keys.length - 1];                     for (int i = 0; i < keys.length - 1; i++) {                         newKeys[i] = keys[i + 1];                     }                     add(newKeys, auxRoot);                 }             } else if(auxRoot.left != null){                 add(keys, auxRoot.left);             }          } else if(auxRoot != null && keys[0] > auxRoot.key){             System.out.println("Right " + keys[0]);             if(auxRoot.right == null){                 auxRoot.right = new Node(keys[0]);                 if (keys.length > 1) {                     int[] newKeys = new int[keys.length - 1];                     for (int i = 0; i < keys.length - 1; i++) {                         newKeys[i] = keys[i + 1];                     }                     add(newKeys, auxRoot);                 }             } else if(auxRoot.right != null){                 System.out.println("keep going");                 add(keys, auxRoot.right);             }         }     }   I made this add auxiliary method for the addNode, for some reason, when I print out the key of the root it still null. Why is this the case? I am passing the root to the add auxiliary method. I understand is pass-by-value. How do I change this method to make root have a value.


Where can I ask for academic advisement specific to my situation (low gpa, grad school, etc)?

I'd pay for personal, not snarky, but honest feedback. I don't really want to post all the specifics online- I would like to keep it confidential.   Is there a place online that you could recommend where I can keep this info private? Or a person, who I can pay for advice like this? I know others have asked abot low gpa + grad-school, however one story does not fit all. I am asking for a person to talk to about my situation and is knowledgeable of the graduate admissions process.


ls SCVMM 2008 R2 supported on Server 2012?

We currently have SCVMM 2008 R2 on a Server 2008 R2 PC.   We are looking to upgrade the server to Server 2012 (possibly R2). Is Server 2012/Server 2012 R2 a supported or compatible operating system to run SCVMM 2008 R2 on?  Basically, I need to find out whether or not can we install our existing licensed SCVMM 2008 R2 onto this server if we upgrade it, or if we would need to get a copy of SCVMM 2012/2012 R2?


No gdm.css in Ubuntu 20.04, how to change login screen background then?

Before ubuntu 20.04 (at least in 18.04 I am sure) you could change the background for login screen, by editing /etc/alternatives/gdm.css, and changing the url of background image to my favourite file. but there is no such file in 20.04 How could I do this in 20.04?


Why is the cutoff for AUC (area under ROC curve) to be considered an acceptable classfier at .7 and what is it acceptable for?

From reading about interpreting the area under a ROC curve, it seems the general consensus is that anything from .7 - .8 is considered an acceptable classifier. What is it considered "acceptable" for? It seems like a quite vague interpretation. I was also wondering why anything above .7 is considered good. For example, some classifiers need high accuracy to be used (like using face recognition as a password on phones) while others don't need nearly that high of accuracy.


UNABLE_TO_LOCK_ROW Error with Test Class

When running all test classes from the Setup menu in a Sandbox org at the same time, I am receiving the error "System.DmlException: Insert failed. First exception on row 0; first error: UNABLE_TO_LOCK_ROW, unable to obtain exclusive access to this record:" on occasion which causes the test class to fail.   If I rerun one of these failed tests by itself, the error does not occur. However, I am concerned with what will happen when I go to move these tests to the Production org. Will this locking issue be an issue there as well? Or should I be making a code update to prevent this from happening?


So there's addition, multiplication, exponentiation and tetration, but is there a level before addition?

I've tried to do this with a sheet of paper since I knew about this:  $$x+x = 2x$$ $$x\cdot x = x^2$$ $$x^x = {^{2}x} $$  So based on logic, I assume that:  $$x.x=x+2$$  The dot in between the two xs is just an arbitrary symbol that I'm using. Please don't mind it. It was recently editted to be a multiplication dot, but I want it to be a period so that it's not confused.  So what is this "operation" if it exists? What it is called?


The king wanted him killed VS The king wanted him to be killed

Do the following sentences mean the same thing or are they different?        The king wanted him killed.    The king wanted him to be killed.       Please use examples to explain the differentiations.


.change() jquery event not working on dynamically created input elements

I am having a input of type = " file " on my page. Also I have a button "Add Inputs" on the page which adds a new file input element on page and I want to run a function when user changes the value of any of those inputs by selecting a new file. Here is my code. HTML

         <input type="file" name="fname">

     <button onclick="addInp()">Add Inputs</button>
  JS // Function that is going to run after change in file input.      $(document).ready(function(){         $("input[name='fname']").each(function(){             $(this).change(function(){                 alert('hello');                                  // Do some work here.              });         });     });   // Function that adds new file inputs.      function addInp()     {         $('#InpDiv').clone().appendTo(".main");     }  Now the problem is .change() method works fine for those inputs which were present already on page but not works (won't prompt "hello" message here) on change of values in those newly created inputs. I made more than one file inputs already present on page and .change() worked for all of them but it didn't worked for any of the newly created inputs. Is it so that events won't work with dynamically added elements on page ? And if so then how am I going to get this work done?


Can I offer a bounty for another user's question?

I wanted to ask a question, but another user had already asked the same 3 hours before. Now he doesn't get any answer, so I would like to offer a bounty, but I can't ask a duplicate question. Is there a way to offer a bounty ?


Why is Brad Pitt nominated to academy award as a supporting actor?

I've watched "Once upon a time in Hollywood" and it seems to me that Cliff Booth here is one of two main characters. Why is Brad Pitt nominated as a supporting actor?


My Markov-Chain Graph is not shown in the right place

This is my Graph:  \begin{figure}[htb]     \centering     \tikzsetnextfilename{kalman}     \begin{tikzpicture}[->,>=stealth',shorten >=1pt,auto,node distance=3.5cm,thick,Zustand/.style={circle,fill=blue!10,draw,font=\Large},Beobachtung/.style={circle,fill=red!10,draw,font=\Large}]         \node[Zustand] (1) {1};         \node[Zustand] (2) [right of=1] {2};         \node[Zustand] (3) [right of=2] {3};         \node[Zustand] (4) [right of=3] {4};      \draw[->](2) to[out=170,in=10] node [midway, above] {0.5} (1);     \draw[->](1) to[out=350,in=190] node [midway, below] {0.3} (2);      \draw[->](1) to[loop left] node [midway, left] {0.5} (1);     \draw[->](2) to[loop right] node [midway, right] {0.7} (2);      \draw[->](4) to[out=170,in=10] node [midway, above] {0.8} (3);     \draw[->](3) to[out=350,in=190] node [midway, below] {0.8} (4);      \draw[->](3) to[loop left] node [midway, left] {0.2} (3);     \draw[->](4) to[loop right] node [midway, right] {0.2} (4);  \end{tikzpicture} \caption[Kalman]{Übergangsgraph der Markov-Kette} \label{fig:kalman} \end{figure}   and i have the problem that it is not shown in the right place in my document. It is placed after the definition which follows in the code, weird somehow and i can't figure out why...


This my main function:    void main(int argc, char **argv) {     if (argc >= 4)     {         ProcessScheduler *processScheduler;         std::cout <<             "Running algorithm: " << argv[2] <<             "\nWith a CSP of: " << argv[3] <<             "\nFilename: " << argv[1] <<             std::endl << std::endl;          if (argc == 4)         {             processScheduler = new ProcessScheduler(                 argv[2],                 atoi(argv[3])             );         }         else         {             processScheduler = new ProcessScheduler(                 argv[2],                 atoi(argv[3]),                 atoi(argv[4]),                 atoi(argv[5])             );         }         processScheduler -> LoadFile(argv[1]);         processScheduler -> RunProcesses();          GanntChart ganntChart(*processScheduler);         ganntChart.DisplayChart();         ganntChart.DisplayTable();         ganntChart.DisplaySummary();          system("pause");          delete processScheduler;     }     else     {         PrintUsage();     } }   The error I get when I compile is this:     Application.cpp:41:32: error: '::main' must return 'int'   It's a void function how can I return int and how do I fix it?