I've been trying for hours on end for the last 2 days, I have an asus G20AJ but I upgraded it with a 500gb Samsung ssd and a GTX 1060, I can't install Ubuntu!   I have my USB and everything, disabled fast boot on Windows and bios and disabled secure boot. All I want is Linux dual booted with Windows. I have tried Ubuntu 16.04.5m 17.04, Linux Mint 18 Sarah, GameDrift Linux, Linux Mint 18.1, Elementary OS. Attempted each one at least 4 times. All were installed using my 64GB USB, I made partitions etc... did everything FAT32 using Rufus, followed YT tutorials, I even did the hold shift while pressing restart and boot from USB, still no luck.   I have 2 monitors, one is plugged into integrated graphics and one is a DVI-D to plug in my gtx 1060. Either I get a freeze, a crash or for Linux mint 18 it asked me for a password or something which I couldn't get. Ubuntu ALWAYS just gives me a black screen once I press Ubuntu, I can't do nomodeset it's just a grub menu which is all black. With Elementary and Linux mint 18.1 it just freezes on the logo at a random time.   I did all I could with the settings, if someone could help it would mean so much. So basically with everything but Ubuntu, I have the same menu every time. I always have two options for USB disks and always do both, but either way I have the menu. I press install, (I have tried try OS as well) and then it switches monitor and starts installing which I Getty. The main graphics card (NVIDIA) isn't installed yet so it switches to the monitor with integrated motherboard graphics.   I have UEFI on my PC settings etc... I am starting to think it's because my USB although 64GB can only handle 64 kilobytes 'Cluster Size' and by default which I usually leave it as it's 32, does that matter? Once again my PC is an ASUS G20AJ.   I have tried so many things, what is the issue? I have waited ages and ages, there must be a way to fix this. Currently running Windows 10 no problem, playing games etc... anyone ever had this error? Is there a way to fix it?


I have a very simple nginx-setup with two location-blocks  server {          listen 80 default_server;             server_name localhost;            location / {                   root /usr/share/nginx/html;                   index index.html index.htm;                   try_files $uri $uri/ =404;           }            location /more {                   root /usr/share/nginx/more;                   index index.html index.htm;                   try_files $uri $uri/ =404;           } }   The only thing it should do is to serve files from /usr/share/nginx/html for the first location, and files from /usr/share/nginx/more for the second location.  The first location works as expected, but the second one keeps returning 404.  This problem is soo simple that it doesn't turn up in the documentation, or in other questions. What should I check first?  For the record: /usr/share/nginx/more exists and contains just one file, namely index.html  The only "difference" I find between the more and the html folder in /usr/share/nginx are the permissions:  drwxr-xr-x 11 root root 4096 May 25 00:01 html drwxr-xr-x 2 root root 4096 May 25 07:41 more   I'm aware that my setup repeats unnecessary lines, but I guess that's not the issue now.


Getting Java Null Pointer Exception while adding a view to a relativelayout

I just want to accomplish this:  TextView    TextView    TextView    TextView    EditText    EditText TextView    EditText    EditText TextView    EditText    EditText ..and so on  This has to be done dynamically.  I've implemented a test code in this way but i get error of java null pointer exception for addview(). This is my XML file:  <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android" android:layout_width="fill_parent" android:layout_height="fill_parent" android:id="@+id/sem_scores" >  <TextView     android:id="@+id/tvSemester"     android:layout_width="wrap_content"     android:layout_height="wrap_content"     android:layout_alignParentLeft="true"     android:layout_alignParentTop="true"     android:layout_marginLeft="21dp"     android:layout_marginTop="17dp"     android:text="Semester"     android:textAppearance="?android:attr/textAppearanceMedium" />  <TextView     android:id="@+id/tvCgpa"     android:layout_width="wrap_content"     android:layout_height="wrap_content"     android:layout_alignBaseline="@+id/tvSemester"     android:layout_alignBottom="@+id/tvSemester"     android:layout_marginRight="34dp"     android:layout_toLeftOf="@+id/tvCredits"     android:text="CGPA"     android:textAppearance="?android:attr/textAppearanceMedium" />  <TextView     android:id="@+id/tvCredits"     android:layout_width="wrap_content"     android:layout_height="wrap_content"     android:layout_alignBaseline="@+id/tvCgpa"     android:layout_alignBottom="@+id/tvCgpa"     android:layout_alignParentRight="true"     android:layout_marginRight="17dp"     android:text="Total credits"     android:textAppearance="?android:attr/textAppearanceMedium" />  <Button     android:id="@+id/button1"     android:layout_width="wrap_content"     android:layout_height="wrap_content"     android:layout_alignParentBottom="true"     android:layout_alignParentLeft="true"     android:layout_alignParentRight="true"     android:text="@string/next" />     And this is my class file:  public class SemScores extends Activity {  // public DataBaseHelper dbHelper=new DataBaseHelper(this); static int cur_sem; public RelativeLayout rl; @Override protected void onCreate(Bundle savedInstanceState) {     // TODO Auto-generated method stub     super.onCreate(savedInstanceState);     rl=(RelativeLayout)findViewById(R.id.sem_scores);     initialize();     setContentView(R.layout.sem_scores); }  void initialize() {     TextView[] tvArray=new TextView[8];     RelativeLayout.LayoutParams params=new RelativeLayout.LayoutParams(ViewGroup.LayoutParams.WRAP_CONTENT,ViewGroup.LayoutParams.WRAP_CONTENT);      cur_sem=DataBaseHelper.convertsem(MainActivity.cur_sem);     for(int i=0;i<cur_sem;i++)     {         tvArray[i]=new TextView(this);         tvArray[i].setId(i);         tvArray[i].setText("heloooo");          params.addRule(RelativeLayout.ALIGN_LEFT,R.id.tvSemester);          //I'll add other rules later this is just a test code         //params[i].addRule(RelativeLayout.BELOW);         rl.addView(tvArray[i],params);     } }   }  LogCat:  03-08 19:32:56.041: E/AndroidRuntime(30898): java.lang.RuntimeException: Unable to start activity ComponentInfo{com.testlab.testing/com.testlab.testing.SemScores}: java.lang.NullPointerException     I'm getting a feeling like there's a simple error somewhere, just help me out. Thanks.  Update: Oh man, I feel pretty stupid now :D


Java Method.invoke throws NullPointerException

I am working on a development where I should invoke my testcases through the Method Reflect API. Currently, I am able to invoke the method and I am also able to get the output after invoking a specific method. But after the method invocation, the invoke method is throwing NullPointerException. I have tried to add a try and catch so that, I can know exactly which part of my code is throwing the NullException. Based on my observation this code is the culprit here. passed = (boolean) payload.invoke(testcase);  Here's my code surrounded with try and catch: public void execute() {     try {         Matcher m = Pattern.compile("([^()]*)[(]([^()]*)[)]").matcher(getPayloadString());         m.find();         boolean passed;                 if (m.group(2).isEmpty()) {             System.out.println("m.group(2) is empty!!!!\n"); //This line of code is being executed. Because my argument is empty.             passed = (boolean) payload.invoke(testcase);             System.out.println("Boolean is: " + passed + "\n");          }else {             System.out.println("Inside else!!!\n");             passed = (boolean) payload.invoke(testcase, ObjectCreator.convertParameters(m.group(2)));             System.out.println("Boolean2 is: " + passed + "\n");          }         //If already invoked the method, this line should be executed. But now it didnt print out this debug message below.         System.out.println("Already exited the convertParameters()\n");         String output = passed ? "PASS" : "FAIL";         TestCase.printResult(testcase.getClass().getName(), output, "", "", "");     } catch (Exception ex) {         System.out.println("Exception in execute is : " + ex.toString() + "\n");     } }  I am not really sure why is it throwing NULLPointerException.


checkbox work as radio button in lwc datatable?

I have created a data table with Multiple table by iterating it. I have to select only one row per data table using checkbox by checking one the other one automatically remove just like radio button. Please help me <template for:each={oppList} for:item="table">
          <lightning-card key={table.category} icon-name="custom:custom11">
{table.category}
         </lightning-card>     <lightning-datatable       data-id={table.category}       key-field="Id"       selected-rows={preSelectedRows}       onsave={handleSave}       onrowselection={handleRowSelection}       suppress-bottom-bar="true"       draft-values={draftValues}       data={table.data}       columns={column}            >     </lightning-datatable>
     </template>  JS code: handleRowSelection = event => {         var selectedRows=event.detail.selectedRows;         if(selectedRows.length>1)         {             var el = this.template.querySelector('lightning-datatable');             selectedRows=el.selectedRows=el.selectedRows.slice(1);             event.preventDefault();             return;         } }  How to achieve this ? [![enter image description here][1]][1]


If the events $A$ and $B$ are independent and the events $B$ and $C$ are independent, does this necessarily mean events $A$ and $C$ are independent?  I used coin tosses to try to model this with $A = H$, $B = T$, and $C = H$ in separate fair tosses.  I get that they are independent, but am not sure if I am correct.  I also have problems determining if $B$ is independent to $A\cap C$ and also $A \cup C$.


How do I get my area51.stackexchange.com profile deleted?

There is no obviously apparent way to request that sites profile to be removed like on all the other sites.  How do I get that profile removed?


today is their birthday or today is your birthday?

On twitter appears “today is their birthday” at the profile of the person who is getting old in the day. Why “their”? Doesn’t their means about they? Why not your? Or its birthday?


Observe the site icon from the sidebar:        ...but if you thought that was an old icon, wait until you see it in the app feed!


When I melt 16 oz of chocolate I add 4 oz of oil how long can I keep this and how should it be stored. Someone said something about botulism ??


What does "$\mathbb{F^n}$ is a vector space over $\mathbb{F}$" mean?

I am self learning Linear Algebra using "Linear Algebra Done Right" a book by Sheldon Axler. And for me its important to understand the smallest thing mentioned in  the book. Can someone explain to me what the author means by OVER R/C?  And there should be a reason he mentioned this (an importance), can someone explain me that? This is what the  book says :  $\mathbb{R^n}$ is a vector space over $\mathbb{R}$,  and $\mathbb{C^n}$ is a vector space over $\mathbb{C}$


Can someone explain why the following code   for i in {1..5};do echo "hello" done   prints  hello hello hello hello hello   but the following   num=5  for i in {1..$num};do echo "hello" done   prints  hello


Chrome S3 Cloudfront: No 'Access-Control-Allow-Origin' header on initial XHR request

I have a webpage () that uses jQuery to load some SVG files from S3 through the CloudFront CDN.  In Chrome I will open an Incognito window as well as the console. Then I will load the page. As the page loads, I will typically get 6 to 8 messages in the console that look similar to this:  XMLHttpRequest cannot load  https://d79i1fxsrar4t.cloudfront.net/assets/img/feature-icons/documentation.08e71af6.svg. No 'Access-Control-Allow-Origin' header is present on the requested resource. Origin 'https://smartystreets.com' is therefore not allowed access.   If I do a standard reload of the page, even multiple time, I continue to get the same errors. If I do Command+Shift+R then most, and sometimes all, of the images will load without the XMLHttpRequest error.  Sometimes even after the images have loaded, I will refresh and one or more of the images will not load and return that XMLHttpRequest error again.  I have checked, changed, and re-checked the settings on S3 and Cloudfront. In S3 my CORS configuration looks like this:  <?xml version="1.0" encoding="UTF-8"?> <CORSConfiguration xmlns="http://s3.amazonaws.com/doc/2006-03-01/"> <CORSRule>     <AllowedOrigin>*</AllowedOrigin>     <AllowedOrigin>http://*</AllowedOrigin>     <AllowedOrigin>https://*</AllowedOrigin>     <AllowedMethod>GET</AllowedMethod>     <MaxAgeSeconds>3000</MaxAgeSeconds>     <AllowedHeader>Authorization</AllowedHeader> </CORSRule> </CORSConfiguration>   (Note: initially had only <AllowedOrigin>*</AllowedOrigin>, same problem.)  In CloudFront the distribution behavior is set to allow the HTTP Methods: GET, HEAD, OPTIONS. Cached methods are the same. Forward Headers is set to "Whitelist" and that whitelist includes, "Access-Control-Request-Headers, Access-Control-Request-Method, Origin".  The fact that it works after a cache-less browser reload seems to indicate that all is well on the S3/CloudFront side, else why would the content be delivered. But then why would the content not be delivered on the initial page-view?  I am working in Google Chrome on macOS. Firefox has no problem getting the files every time. Opera NEVER gets the files. Safari will pick up the images after several refreshes.  Using curl I do not get any problems:  curl -I -H 'Origin: smartystreets.com' https://d79i1fxsrar4t.cloudfront.net/assets/img/phone-icon-outline.dc7e4079.svg  HTTP/1.1 200 OK Content-Type: image/svg+xml Content-Length: 508 Connection: keep-alive Date: Tue, 20 Jun 2017 17:35:57 GMT Access-Control-Allow-Origin: * Access-Control-Allow-Methods: GET Access-Control-Max-Age: 3000 Last-Modified: Thu, 15 Jun 2017 16:02:19 GMT ETag: "dc7e4079f937e83291f2174853adb564" Cache-Control: max-age=31536000 Expires: Wed, 01 Jan 2020 23:59:59 GMT Accept-Ranges: bytes Server: AmazonS3 Vary: Origin,Access-Control-Request-Headers,Access-Control-Request-Method Age: 4373 X-Cache: Hit from cloudfront Via: 1.1 09fc52f58485a5da8e63d1ea27596895.cloudfront.net (CloudFront) X-Amz-Cf-Id: wxn_m9meR6yPoyyvj1R7x83pBDPJy1nT7kdMv1aMwXVtHCunT9OC9g==   Some have suggested that I delete the CloudFront distribution and recreate it. Seems like a rather harsh and inconvenient fix.  What is causing this problem?  Update:  Adding response headers from an image that failed to load.  age:1709 cache-control:max-age=31536000 content-encoding:gzip content-type:image/svg+xml date:Tue, 20 Jun 2017 17:27:17 GMT expires:2020-01-01T23:59:59.999Z last-modified:Tue, 11 Apr 2017 18:17:41 GMT server:AmazonS3 status:200 vary:Accept-Encoding via:1.1 022c901b294fedd7074704d46fce9819.cloudfront.net (CloudFront) x-amz-cf-id:i0PfeopzJdwhPAKoHpbCTUj1JOMXv4TaBgo7wrQ3TW9Kq_4Bx0k_pQ== x-cache:Hit from cloudfront


I am quite confused with the usage of I and me, Can anybody tell me what should be used in the following sentence: Your husband doesn't believe that You're older than (I / Me).


How to link processing power of old computers together?

I'm sitting on 8 old computers of varied sorts that are more or less useless at this point for any other purpose really. Is there a way I could link their hardware or processing power or whatever together over wifi and use one as like a central computer? Like it would be cool to distribute the processing of some video game or encryption generating program over the collective computers. Any way to do all this?


In Guardians of the Galaxy, why does Groot only say the phrase "I am Groot"?

In the Marvel Comics series "Annihilation: Conquest - Starlord," Groot is introduced and speaks normally. However, in "Annihilation: Conquest," which is the mini-series immediately following "Starlord," he only says the phrase "I am Groot" repeatedly. This continues through to "Guardians of the Galaxy."  The "Starlord" mini-series was written by Keith Giffen, whereas "Annihilation: Conquest" and "Guardians of the Galaxy" were written by Dan Abnett and Andy Lanning. Was this simply something that was changed between writers? Is it ever explained why Groot went from speaking normally to only saying "I am Groot"?


Is it possible to mark a PPA as "do not upgrade"?

I needed a feature in the latest version of a program (kicad) so I added the "live" PPA and successfully downloaded & upgraded. But I don't need the very latest all the time, and the upgrades are frequent and huge and take a long time to download on my rural broadband. Hence my question - I would like to keep the program and maybe upgrade occasionally, but not every time, I'm happy with what I've got for the time being.


HTML files don't refresh unless they are accessed

I have a setup in which I make AJAX calls to load the html files containing to be displayed data. Let's say the main page is index.html and I have two other pages: pages/1.html and pages/2.html. In index.html either 1 or 2 is set as content. My browser however caches both 1 and 2 and when I change either of them and reload the page it won't display the changes I've made because I didn't actually refresh 1.html or 2.html. How can I make it so that this is not an issue?


How can Product2.StockKeepingUnit already exist in a test?

I'm trying to create some Apex tests. Of course I am NOT using SeeAllData=true. When I try to insert some instances of Product2, even though I've inserted none before, I get:  System.DmlException: Insert failed. First exception on row 0; first error: DUPLICATE_VALUE, A Product with this SKU already exists.: [StockKeepingUnit] Class.ProductBundleControllerIntTest: line 48, column 1  If I try the following just before the attempted insert:         System.debug('######### EXISTING PRODUCT: ' + [           SELECT Id, StockKeepingUnit            FROM Product2            WHERE StockKeepingUnit != NULL ]);   I get:  17:58:23.557 (3561926690)|USER_DEBUG|[47]|DEBUG|######### EXISTING PRODUCT: ()  Even if I do the following to absolutely guarantee that no previous records could possibly exist and that I am inserting no duplicates, I get the same error:         delete [                 SELECT Id, StockKeepingUnit                 FROM Product2         ];         Map<String, Product2> product2BySkuMap = new Map<String, Product2>();         for (Product2 product2 : TEST_PRODUCT_LIST) {             product2BySkuMap.put(product2.StockKeepingUnit, product2);         }         insert product2BySkuMap.values();   System.DmlException: Insert failed. First exception on row 0; first error: DUPLICATE_VALUE, A Product with this SKU already exists.: [StockKeepingUnit]  Further Notes:  This is an absolutely fresh sandbox, so there really is no data for it to match or to avoid matching.  Also at play within the functionality being tested are Custom Metadata which also needs to have values matching these SKU values.  So even if we could change the SKU for the test, we can't (and shouldn't) change it for the Custom Metadata.   What could I be missing? How can I fix this?


How do I handle the encounter difficulty for a three-sided battle?

I'm running my first real campaign. The idea I have for the first dungeon involves the PCs coming upon two sides already engaged in combat. One side is losing and weaker than the other, though not in an altogether different CR range, but both are enemies of the PCs. How do I calculate the encounter difficulty?


Excel 2007 transpose/combine multiple rows into one

I have data like so:  1001NCCN    3618127 1001NCCN    208478 1001NCCN    207316 1001TEMN    409889 1001TEMN    801651 1001TEMN    273134 1001TEMN    208478 1001TEMN    207316   I need to transpose/combine the rows that have matching values in the first column with a final result like so:   1001NCCN    3618127 208478  207316       1001TEMN    409889  801651  273134  208478  207316   I looked at Pivot Tables, and filtering but neither seemed like they can give me what I need.  Is there a way to do this within Excel?


Is it possible to construct a quasi-vectorial space without an identity element?

I mean if there is any construction that satisfies all the conditions for an vectorial space except it lacks an identity element? This questions was posed to me by a classmate last semester and I have been puzzling over it since then.


Launch IntelliJ without terminal command everytime

I have installed the latest version of IntelliJ 2019.3 community edition on my laptop which is running Ubuntu V19.04. Recently IntelliJ developed a problem where a normal way to start it was not working at all, so i am launching it by going into its /bin folder and write ./idea/sh to start the application.  My question here is how can I make IntelliJ start without going to its directory and type a command to run it everytime?


In most programming languages, integer and real (or float, rational, whatever) types are usually disjoint; 2 is not the same as 2.0 (although most languages do an automatic conversion when necessary). In addition to technical reasons, this separation makes sense -- you use them for quite different purposes.  Why did they choose to say $\mathbb{Z} \subset \mathbb{R}$ in math? In other words, why are 2 and 2.0 considered the same?  When you are working in $\mathbb{R}$, does it make any difference whether some elements, eg. 2.0, also belong to $\mathbb{Z}$ or not?


I searched everywhere and while there are guides none say what to do if a step wont work, so this isn't a duplicate as far as I know. If it is I'll take this down but PLEASE read the full question first.  I used .  So I do sudo pm-hibernate and then my screen goes to the hibernate screen say:     snap-shoting   snapshot done   writing(or something like that)____0%   and then hangs there forever. My swap is seen and is 9GB, I have 6GB RAM. It is a dual boot with Windows 7.


How do I fix the Denoiser's cloudy render glitch?

I have another problem. I've been trying to create a render of my IES light with the Denoiser,but when I do,a weird cloud/noise effect appears in the render. Could someone please help me?


I have a class question where I must prove $A^2 = 0$ given $A^5 = 0$ with A being a 2x2 matrix.   I though that I could simply say that as $A^5 = 0$ then $A^2 \cdot A^3 = 0 \implies A^2 = 0$ as $A^2 = A\cdot A$ and $A^3 = A\cdot A\cdot A$ $\implies A = 0 \implies A^2 = 0$.  Could someone verify that my proof is valid and not just a circular argument (which I feel it may be)  Thanks


I am writing several chemical formulas and reactions and I want to write over a reversible reaction the reaction constants for the Forwards and reverse reaction.  So far I have the following:    But  I would like to have this:    Thanks in advance.  My MWE is:  \immediate\write18{makeindex \jobname.nlo -s nomencl.ist -o \jobname.nls} \documentclass[a4paper,11pt,oneside]{book} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{mathpazo} \usepackage{geometry} \usepackage[colorinlistoftodos]{todonotes} \usepackage{tablefootnote} \usepackage{graphicx} \usepackage{adjustbox} \usepackage{array} \usepackage{mathtools} \usepackage{float} \usepackage{subfig} %, nccmath} \usepackage{siunitx}  \usepackage{mhchem} \usepackage{chemfig}     \usepackage[colorinlistoftodos]{todonotes} \usepackage[autostyle]{csquotes} \usepackage{multirow} \usepackage{xcolor} \usepackage{booktabs} \usepackage{soul} \usepackage{acro} \usepackage{pgfplots} \usepackage{enumitem} \usepackage{lscape} \usepackage{tabularx} \usepackage{nomencl} \makenomenclature \usepackage{amsmath} \usepackage{lipsum} %\usepackage[toc,page]{appendix} %\usepackage{tikz} \usetikzlibrary{intersections, calc} \pgfplotsset{compat=1.14} \usepackage{filecontents} \acsetup{first-style=short} \DeclareAcronym{PFD}{ short = PFD , long = Process Flow Diagram ,  class = abbrev } \DeclareAcronym{PIB}{ short = PIB, long = Polyisobutene (OPPANOL\textsuperscript{\textregistered}), class = abbrev }  \DeclareAcronym{BDIS}{ short = BDIS, long = Process Information Management System, class = abbrev }  \DeclareAcronym{BD}{ short = BD, long = 1-3 Butadiene, class = abbrev }  \DeclareAcronym{IOC}{ short = IOC, long = Octenes isomers, class = abbrev }  \DeclareAcronym{Raf}{ short = Raf, long = Raffinate, class= abbrev }  \DeclareAcronym{VLE}{ short = VLE, long = Vapor-liquid equilibrium, class= abbrev }    \DeclareAcronym{CSTR}{ short = CSTR, long = Continuous Stirred Tank Reactor, class = abbrev }  \DeclareAcronym{wrt}{ short = wrt,     long = with respect to, class = abbrev }  \DeclareAcronym{SQP}{ short = SQP,     long = Sequential quadratic programming, class = abbrev }  \DeclareAcronym{PFR}{ short = PFR,     long = Plug flow reactor, class = abbrev }  \usepackage[backend=bibtex,style=authoryear,natbib=true]{biblatex}   \addbibresource{example.bib}  \begin{document} \frontmatter \tableofcontents \listoffigures \listoftables    \mainmatter  \begin{center} \ce{B <=>[k1] A <=>[k2] C} \end{center}  \end{document}


How to calculate X days ago in javascript

In my application I am accessing a remote URL and getting a JSON response like below. The JSON response has a property called created_at.   In JavaScript I need to get the current date minus(-) the created_at date and calculate how many days ago the comment was created.  How can I do that?  {      "id":12578834,    "title":"Joint R&D Has Its Ups and Downs",    "url":"http://semiengineering.com/joint-rd-has-its-ups-and-downs/",    "num_points":1,    "num_comments":0,    "author":"Lind5",    "created_at":"9/26/2016 2:28" }


Term to describe fragility in negotiations

I'm looking for a word or a phrase to describe a particular aspect of negotiations. This concept is not unique to negotiations, but negotiations seem to provide the clearest example. The concept is this: The more you ask for, the less likely you are to succeed. There is an inverse relationship between the probability of you getting a good outcome, and how high you set your definition of "good outcome."  If we imagine a simple scenario in which an employee and a boss are negotiating a salary between 0 and 10, if the employee asks for 9 she immediately loses goodwill, as well as loses the respect of the boss. It is very unlikely that she will receive 9. But if the employee asks for 6 (a more 'reasonable' number) her chance of receiving 6 is much higher.


I'm currently working on a visual project in C++ / OpenGL which projects 3D fractals and render them depending on a simple fourier transform I do on a .wav audio file i put as input of the program to get the frequencies and change the fractal according to them while playing it. This allows for example the shape to "bounce" to the beat of the song or change the illumination according to the pitch of the voice. Here's an example of what I've done yet :  The thing is for know you have to download a music and put it as input of the program if you want the shape to evolve along the music. What I want to do actually is for a user to open this app in background and play a music on youtube or spotify, while my program get the audio output of the computer to insert it in my program in order for the fractal to do real time modifications according to the audio output. Do you have any clues or ideas on how to redirect the audio output of a system (i'm on win10) and inject it in a buffer variable in C++ ? I did a little bit of research but I did not find anything that could help me. Thanks in advance for your answers, and hope you're all doing great :) Cheers, Nathan


If I control  and I activate his second ability and target  is the token copy a 4/4 or is it still equal to the number of cards in my opponents' graveyard?


What does {:,} in this code mean when is comes to string-formatting?

I know how a basic string-format works, but I can't figure out what lies behind the part, {:,}. It is supposed to print a number like 1000000 thus 1,000,000. How does it do it. I don't understand what the column nor comma means.  number = 250000 rounded_score = round(number, -1) score_str = "{:,}".format(rounded_score)


Bluetooth sometimes works, sometimes doesn't work, per each Ubuntu system boot

After I installed Ubuntu 18.04 bluetooth worked and I could pair my bluetooth peripherals and they worked. I booted into Ubuntu again and the bluetooth icon in the launcher starts flickering and my devices stopped working. I rebooted Ubuntu and bluetooth was working again. Next time I rebooted it stopped working. This problem happens repeatedly everytime I boot Ubuntu, sometimes bluetooth works, sometimes it stops. I tried to use the drivers from Additional Drivers but the problem persists. I did some research and tried these commands, but I don't know what to do now.  lshw -class network description: Wireless interface        product: BCM4352 802.11ac Wireless Network Adapter        vendor: Broadcom Limited        physical id: 0        bus info: pci@0000:03:00.0        logical name: wlp3s0        version: 03        serial: 24:0a:64:49:78:65        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless        configuration: broadcast=yes driver=wl0 driverversion=6.30.223.271 (r587334) latency=0 multicast=yes wireless=IEEE 802.11        resources: irq:17 memory:df400000-df407fff memory:df200000-df3fffff   and  lsusb; dmesg | egrep -i 'blue|firm' Bus 002 Device 002: ID 8087:8000 Intel Corp. Bus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 001 Device 002: ID 8087:8008 Intel Corp.  Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 004 Device 003: ID 0480:0110 Toshiba America Inc  Bus 004 Device 002: ID 174c:3074 ASMedia Technology Inc. ASM1074 SuperSpeed hub Bus 004 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 003 Device 005: ID 1b1c:0c04 Corsair  Bus 003 Device 003: ID 0b05:17cf ASUSTek Computer, Inc.  Bus 003 Device 006: ID 04b4:0101 Cypress Semiconductor Corp. Keyboard/Hub Bus 003 Device 004: ID 0738:1705 Mad Catz, Inc.  Bus 003 Device 002: ID 174c:2074 ASMedia Technology Inc. ASM1074 High-Speed hub Bus 003 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub [    0.032076] Spectre V2 : Enabling Restricted Speculation for firmware calls [    0.057619] ACPI: [Firmware Bug]: BIOS _OSI(Linux) query ignored [    3.349413] Bluetooth: Core ver 2.22 [    3.349441] Bluetooth: HCI device and connection manager initialized [    3.349445] Bluetooth: HCI socket layer initialized [    3.349448] Bluetooth: L2CAP socket layer initialized [    3.349453] Bluetooth: SCO socket layer initialized [    3.469459] Bluetooth: hci0: BCM: chip id 63 [    3.470452] Bluetooth: hci0: BCM: features 0x07 [    3.486477] Bluetooth: hci0: NUNO [    3.487455] Bluetooth: hci0: BCM20702A1 (001.002.014) build 1469 [    3.487864] bluetooth hci0: Direct firmware load for brcm/BCM20702A1-0b05-17cf.hcd failed with error -2 [    3.487865] Bluetooth: hci0: BCM: Patch brcm/BCM20702A1-0b05-17cf.hcd not found [    4.569598] Bluetooth: BNEP (Ethernet Emulation) ver 1.3 [    4.569599] Bluetooth: BNEP filters: protocol multicast [    4.569602] Bluetooth: BNEP socket layer initialized [   34.098347] hid-generic 0005:046D:B01A.0005: input,hidraw4: BLUETOOTH HID v0.03 Keyboard [MX Anywhere 2S] on 24:0A:64:39:1A:79 [   50.855727] Bluetooth: RFCOMM TTY layer initialized [   50.855731] Bluetooth: RFCOMM socket layer initialized [   50.855734] Bluetooth: RFCOMM ver 1.11 [  498.150022] Bluetooth: hci0: last event is not cmd complete (0x0f) [  514.274031] Bluetooth: hci0: last event is not cmd complete (0x0f) [  530.146048] Bluetooth: hci0: last event is not cmd complete (0x0f)   etc. it goes on like that.


Helpful flag count and flagging history shows wrong details

Today I saw a terrible thing in my profile     I'm a Deputy badge holder but my profile is only showing 10 helpful flags.  What is happened to my flags?  The flagging history also looks so confusing, missing many flags.


"Let A = $\begin{bmatrix}1 & 1 & 4\\0 & 3 & -4\\0&0&-1\end{bmatrix}$. Is the matrix A diagonalizable?  If so find a matrix P that diagonalizes A. Can you write A as a linear combination of rank 1 matrices formed from its eigenvectors? Determine the eigendecomposition $A = PΛP^{-1}$."  My solution attempt:  det(λI - A) = $\begin{vmatrix}λ - 1 & -1 & -4\\0 & λ - 3 &4\\0&0&λ + 1\end{vmatrix}$ = (λ -1) (λ -3) (λ + 1) = 0  $λ_{1}$ = 1, $λ_{2}$ = 3, $λ_{3}$ = -1  ($λ_{1}I - A)x_{1}$ = 0  $\begin{bmatrix}0 & -1 & -4\\0 & -2 &4\\0&0&2\end{bmatrix}$ $\begin{bmatrix}x_{11}\\x_{12}\\x_{13}\end{bmatrix}$ = $\begin{bmatrix}0\\0 \\0\end{bmatrix}$   $\begin{bmatrix}x_{11}\\x_{12}\\x_{13}\end{bmatrix}$ = $x_{11} \begin{bmatrix}1\\0 \\0\end{bmatrix}$  It follows that $\begin{bmatrix}1\\0 \\0\end{bmatrix}$ is a basis for the eigenspace of A corresponding to $λ_{1}$ = 1.  In a similar way, I found other two basis vectors as $\begin{bmatrix}1/2\\1 \\0\end{bmatrix}$ and $\begin{bmatrix}-2/5\\1 \\1\end{bmatrix}$, and I got $P = \begin{bmatrix}1 & 1/2 & -2/5\\0 & 1 & 1\\0&0&1\end{bmatrix}$. Then my $P^{-1} = \begin{bmatrix}1 & -1/2 & 9/10\\0 & 1 & -1\\0&0&1\end{bmatrix}$. And I said A's left-multiplication by $P^{-1}$ and right-multiplication by $P$ $(P^{-1}AP)$ gives the diagonal matrix Λ that is similar to A. I found Λ as $\begin{bmatrix}1 & 0 & 0\\0 & 3 & 0\\0&0&21/5\end{bmatrix}$. Then I said that if we multiply both sides of the equation $P^{-1}AP = Λ$ by $P$ from the left and by $P^{-1}$ from the right we get $PP^{-1}APP^{-1} = PΛP^{-1} = A$ and that this is the eigendecomposition of A. Here are my questions:   Do you think I understood and did correctly what the asker wanted me to do by saying "Determine the eigendecomposition $A = PΛP^{-1}$."? What the hell does the sentence "Can you write A as a linear combination of rank 1 matrices formed from its eigenvectors?" mean?


Probability that a number has $m$ indistinct factors

I just discovered Matlab's factor()-function, and I randomly typed in 20081294819, and to my surprise it only had two factors (5099 and 3938281)! I had expected many more factors for such a big number and wondered how normal this was. The following is what I've done in my investigation so far.  In the first figure below, I have plotted the probability that some number below $10^k$ has $m$ indistinct prime factors.  The second figure shows the evolution of the probability of finding a number with $m$ indistinct prime factors as the numbers one is looking at grows, i.e. it is just another way to visualize the same data. I have left out all points of zero probability.  If one looks at the first part of the figure, it seems that the peak of the curve for some $k$ shifts toward higher $m$ as $k$ grows.   My first question is this: Does this behavior (i.e. the peak shifting toward higher $m$ as $k$ grows) continue indefinitely, or will the peak stabilize at some point? The latter seems unlikely but I can't be sure.  My second question is this: Approximately how fast does the peak-value $m_{peak}$ move as $k$ grows?  I briefly looked at the , but this involves distinct primes and I don't really know much number theory, so any help would be greatly appreciated!


Prove that $\sqrt{2\sqrt{3\sqrt{...\sqrt{(n - 1)\sqrt{n}}}}} < 3$.  I have tried induction on $n$, but with no effect.


I have at my disposal Modus Ponens (MP) and the three axioms:   A1: $(\alpha\to(\beta\to\alpha))$, A2: $((\alpha\to(\beta \to\gamma))\to ((\alpha\to\beta)\to(\alpha\to\gamma)))$, A3: $(((\lnot\beta)\to(\lnot\alpha))\to(((\lnot\beta)\to\alpha)\to\beta))$.   I'm trying to prove the Disjunction elimination: $$ \{\alpha\lor\beta,\alpha\to \gamma,\beta\to \gamma\}\vdash \gamma. $$  $\lor$ is not part of the alphabet I use, the deduction actually is: $$ \{((\neg\alpha)\to\beta),\alpha\to \gamma,\beta\to \gamma\}\vdash \gamma. $$  The deduction should be something like  \begin{array}{rl|l} \hline 1:&((\neg\alpha)\to\beta)  & Premiss\\  2:&\beta\to \gamma&Premiss\\ 3:&((\neg\alpha)\to\gamma)&1,2\ H.S.\\ 4:&(\alpha \to \gamma)&Premiss\\ 5:&\gamma& 3,4 [?]\\ \hline \end{array}  Where H.S. is Hypothetical Syllogism, a deduction that I have already proven.     The rule $[?]$, that I have to prove, correspond to    $$ \{\alpha\to\beta,(\neg\alpha)\to\beta\}\vdash \beta.\tag{*} $$   (*) looks quite simple, but after hours no way to get it.  For information I have, if needed, proven other results, that I could reuse:   $\vdash\alpha\to\alpha$, Hypothetical Syllogism: $\{\alpha\to\beta,\beta\to\gamma\}\vdash\alpha\to\gamma$, $\vdash(\lnot\alpha\to\alpha)\to\alpha$, $\vdash\alpha\lor\lnot\alpha$, $\{\alpha\to(\beta\to\gamma),\beta\}\vdash\alpha\to\gamma$, $\vdash(\neg\neg\alpha)\to\alpha$. Negation introduction: $\{(\alpha\to\beta),(\alpha\to \neg\beta)\}\vdash \neg \alpha$. Negation elimination: $\{\neg \alpha\}\vdash (\alpha\to \beta)$. Double negative elimination: $\neg \neg \alpha\vdash \alpha$. Conjunction introduction: $\{\alpha,\beta\}\vdash (\alpha\land \beta)$.   EDIT Additional known results:   $\neg\neg\alpha\vdash\alpha$ $\{\alpha,\neg\alpha\}\vdash\neg\beta$ $\{\alpha,\neg\alpha\}\vdash\beta$ Conjunction elimination, only $\alpha\land\beta\vdash\beta$ Disjunction introduction, only $\beta\vdash\alpha\lor\beta$


Tangent lines to the graph of $f(x)=3x(5x^2+1)$ that are parallel to the line $y=8x+9$

Determine the equations of the tangent lines to the graph of $f(x)=3x(5x^2+1)$ that are parallel to the line $y=8x+9.$  I really don't know how to do this question; please help me out.


Is it appropriate and grammatically good to write 'It all began with one troubling news"?

I am struggling, for some reason, something tells me this sentence doesn't sound that natural? Is there a better way to say the same or is this sentence of mine is fine?


$col = "*";$tablename = "test_data";$opt = "1"; $stmt = $conn->prepare("SELECT :col FROM `:tbl` WHERE :opt"); $stmt->bindValue(':col',$col, PDO::PARAM_STR); $stmt->bindValue(":tbl",$tablename, PDO::PARAM_STR); $stmt->bindValue(':opt',$opt, PDO::PARAM_STR);   it got error when i do $stmt->execute(); The error is about the sql error. Fatal error: Uncaught exception 'PDOException' with message 'SQLSTATE[42S02] This got no error if I din't bind the :tbl. Means that i can run this if I write it as below  $col = "*";$opt = "1"; $stmt = $conn->prepare("SELECT :col FROM `test_data` WHERE :opt"); $stmt->bindValue(':col',$col, PDO::PARAM_STR); $stmt->bindValue(':opt',$opt, PDO::PARAM_STR);


How to tell cron to find paths to tools?

Is there a way to indicate to  how/where to find (paths to)  tools such as python, nmap, php and so on?  I ask this because when I schedule a job using crontab -e, I always need to specify the full path of python, nmap and whatever other tool I want to use.


How to load up CSS files using Javascript?

Is it possible to import css stylesheets into a html page using Javascript? If so, how can it be done?  P.S the javascript will be hosted on my site, but I want users to be able to put in the <head> tag of their website, and it should be able to import a css file hosted on my server into the current web page. (both the css file and the javascript file will be hosted on my server).


Let $A^A$ be the set of all functions from $A$ to $A$. Prove $\mathcal{P}(A)$ and $A^A$ have the same cardinality for infinite sets $A$. ($\mathcal{P}(A)$ is the power set of $A$.)  Is it possible to show this without invoking axiom of choice? It can be proven with $A \times A \sim A$ for infinite sets $A$ but that is equivalent to the axiom of choice.


Want to remove Windows 7 and retain Ubuntu istallation

I installed Ubuntu and currently my laptop is dual boot(win7/Ubuntu). But now I want to remove Win7 retaining my Ubuntu Installations(software) I don't want to install Ubuntu with live CD. Please suggest some other method if you know one.  Update based on OP's Comments  sudo cat /etc/fstab  # /etc/fstab: static file system information.  #  # Use 'blkid' to print the universally unique identifier for a # device ; this may be used with UUID= as a more robust way to name devices  # that works even if disks are added and removed. See fstab(5).  #  # <file system> <mount point> <type> <options> <dump> <pass>  # / was on /dev/sda5 during installation  UUID=384594f2-ff10-499a-9ae6-2f85f6feeeaa / ext4 errors=remount-ro 0 1  # swap was on /dev/sda6 during installation  UUID=89a95801-318a-4d25-a0d9-76aceb07508b none swap sw 0 0      Output of mount  shubh10@shubh10-Aspire-5349:~$ mount  /dev/sda5 on / type ext4 (rw,errors=remount-ro)  proc on /proc type proc (rw,noexec,nosuid,nodev)  sysfs on /sys type sysfs (rw,noexec,nosuid,nodev)  none on /sys/fs/cgroup type tmpfs (rw)  none on /sys/fs/fuse/connections type fusectl (rw)  none on /sys/kernel/debug type debugfs (rw)  none on /sys/kernel/security type securityfs (rw)  udev on /dev type devtmpfs (rw,mode=0755)  devpts on /dev/pts type devpts (rw,noexec,nosuid,gid=5,mode=0620)  tmpfs on /run type tmpfs (rw,noexec,nosuid,size=10%,mode=0755)  none on /run/lock type tmpfs (rw,noexec,nosuid,nodev,size=5242880)  none on /run/shm type tmpfs (rw,nosuid,nodev)  none on /run/user type tmpfs (rw,noexec,nosuid,nodev,size=104857600,mode=0755)  binfmt_misc on /proc/sys/fs/binfmt_misc type binfmt_misc (rw,noexec,nosuid,nodev)  gvfsd-fuse on /run/user/shubh10/gvfs type fuse.gvfsd-fuse (rw,nosuid,nodev,user=shubh10)


I got quite some trouble trying to prove this.  $$\sum_{k=m}^{n}(-1)^k\binom{n}{k}\binom{k}{m}=0, n>m\geq 0$$  I tried using $$\binom{n}{m}\binom{m}{k}=\binom{n}{k}\binom{n-k}{m-k}$$ and then changing the summation boundaries as $k=0, n=n-m$, but that took me nowhere... I would really appreciate help. Thank you.


How do I get different colors for math and for text?

I want to include something in my LaTeX article that will make all mathematical formulae appear in black, while all text (including everything inside \text{}s in the middle of mathematical formulae) appear in red.  Ideally I would like this to be something I could include in the preamble or in a .cls file or something like that.  What would be the quickest way to do that?


I'm unclear about the true meaning in the definitions for IMMUTABLE, VOLATILE and STABLE functions.  I read the documentation, specifically the definitions of each.       IMMUTABLE indicates that the function cannot modify the database and   always returns the same result when given the same argument values; that is, it does not do database lookups or otherwise use   information not directly present in its argument list. If this option   is given, any call of the function with all-constant arguments can be   immediately replaced with the function value.      STABLE indicates that the function cannot modify the database, and   that within a single table scan it will consistently return the same   result for the same argument values, but that its result could change   across SQL statements. This is the appropriate selection for functions   whose results depend on database lookups, parameter variables (such as   the current time zone), etc. (It is inappropriate for AFTER triggers   that wish to query rows modified by the current command.) Also note   that the current_timestamp family of functions qualify as stable,   since their values do not change within a transaction.      VOLATILE indicates that the function value can change even within a   single table scan, so no optimizations can be made. Relatively few   database functions are volatile in this sense; some examples are   random(), currval(), timeofday(). But note that any function that has   side-effects must be classified volatile, even if its result is quite   predictable, to prevent calls from being optimized away; an example is   setval().   My confusion comes in with the condition for IMMUTABLE and STABLE that the function ALWAYS or CONSISTENTLY returns the same result given the same arguments.    The IMMUTABLE definition states that the function does not database lookups or otherwise use information not directly present in its argument list.  So, to me, that means such functions are used to manipulate data provided by the client, and should not have SELECT statements...although that just sounds a bit odd to me.  With STABLE, the definition is similar in that it says it should consistently return the same result.  So, to me, that means that everytime the function is called with the same arguments, it should return the same results (same exact rows, every single time).  So, to me...that means that any function that performs a SELECT on a table or tables that can be updated, should only be volatile.  But, again...that doesn't sound right to me.  Bringing this back to my use-case, I am writing functions that perform SELECT statements with multiple JOIN's on tables that are constantly being added to, so the function calls would be expected to return different results each time it's called, even with the same arguments.  So, does that mean that my functions should be VOLATILE?  Even though the documentation indicates relatively few database functions are volatile in this sense?  Thank you!


Traditional search-as-you-type on newer Nautilus versions

Until now I was using a "traditional" version of Nautilus: that that comes with Ubuntu 10.10. Now I'm using 3.6.3, included with Ubuntu 13.04 (most likely any recent version is equivalent for the scope of my question, anyway).  One major difference between the two is the search-as-you-type behavior: in classic versions of Nautilus, when you typed an input, the file with the closest alphabetical match would become the selected one, the eligible files/folders being restricted to the current directory.  The new behavior is to perform an optionally-global search instead.  Can one configure Nautilus to provide the previous functionality ?


Is there a way to get a notification that a thread no longer runs (has returned) in your application? I know this is possible in kernel mode (using PsSetCreateThreadNotifyRoutine), but is there a way to know this from user mode, using only Win32 API ?     The problem is that I can't control the code in the thread, because my module is part of a library. Making a driver to monitor the system would not be too hard, but it's annoying for the users to install a driver even for a basic application that uses my library.    My code uses TLS storage, and under Linux/Unix pthread_key_create can take a pointer to a function that is called when the thread is destroyed. But TlsAlloc (Windows) has nothing like this...  Thanks in advance!


I have a doubt on taking pad dimensions in this below picture what is the pad width and height.any body kindly clear my doubt

See this picture and kindly clear my doubt thanks for your help


Remove protocol information from URL in biblatex

I want to streamline my bibliography by removing the protocol information (http:// and https://) from the printed version of the URL without breaking the hyperrefs. My solution at the moment looks like this  \documentclass{article}  \begin{filecontents}{bibliography.bib} @misc{key1, author="Google", title="Google", url="https://google.com", } @misc{key2, author="Microsoft", title="Bing", url="http://bing.com", } @misc{key3, author="DuckDuckGo", title="DuckDuckGo", url="https://duckduckgo.com", } \end{filecontents}  \usepackage{hyperref} \usepackage{biblatex}  \DeclareSourcemap{%   \maps[datatype=bibtex,overwrite=true]{%     \map{       \step[fieldsource=url, final=true]       \step[fieldset=userd, origfieldval,final=true]       \step[fieldsource=userd, match=\regexp{\A(ht|f)tp(s)?:\/\/([^/]+)},replace=\regexp{$3}]     }   }% }  \DeclareFieldFormat{url}{\mkbibacro{URL}\addcolon\space\href{#1}{\url{\thefield{userd}}}}  \bibliography{bibliography} \nocite{*}  \begin{document} \printbibliography \end{document}   But I am sure that there must be a simpler solution, especially the Sourcemap seems to me like overkill considering this problem. At the very least I have not come up with the simplest regular expression.


I want to sort this array on basis of 'eta'.Lowest eta must come to first.  My array is :       Array (     [0] => Array         (             [company] => Uber             [type] => Saloon             [eta] => 8             [destination_required] => N             [reject_booking_request] => N         )      [1] => Array         (             [company] => greentomato             [type] => Saloon             [company_rating] => 80%             [eta] => 10             [destination_required] => N             [reject_booking_request] => N         )      [2] => Array         (             [company] => CATALINA             [type] => Exec             [eta] => 12             [destination_required] => Y             [reject_booking_request] => N         )      [3] => Array         (             [company] => Uber             [type] => Exec             [eta] => 15             [destination_required] => N             [reject_booking_request] => N         )      [4] => Array         (             [company] => Hailo             [type] => Taxi             [eta] => 1             [destination_required] => Y             [reject_booking_request] => Y         )  )   I want to sort this array on basis of 'eta'.Lowest eta must come to first.  I tried to use this :   $result = Set::sort($array, '{n}', 'asc');   But it gives some error.


Fantasy book, YA, Girl with magical powers & tattoos

I read this book series in middle school. I believe that it would be classified as young adult fiction/fantasy. A girl has magical powers, and with her growing powers comes runes/tattoos in her arms. This is shown on every book cover. I know that one cover is blue. This one shows the girl in a black tank top and black pants. One is a yellow cover, with her in a dress (I think).  The girl has a friend/mentor, who she develops feelings for. The girl is the key to stopping a war between multiple factions/people. Each side is trying to use her to their advantage. I think the series was written in the early 2000s.


Prove that quotient of a PID  by a prime ideal is PID.


Proper order of variables in unbalanced ANOVA

If you have unequal sample sizes in cells, then the order in which you enter model terms  changes your results for sequential or Type I SS. The first variable to enter the model is allocated its unique variance plus the variance shared by the second variable, then the second variable gets only its unique variance.  If you have two predictor variables, say whether you get a drug or placebo and whether you think you get a drug or placebo, and you want to look at their relationship to some symptom, and you want to ignore the effect of knowing whether you got the drug, because all you are really interested in is the relationship between getting the drug and the symptom, then which predictor variable would enter into the model first?  I have been reading answers to questions on this site, and sometimes people are told to enter what is thought to be the most important variable first, but then in ANCOVA situations they are told to enter the covariate first. Is this contradictory advice, or is the covariate really the most important variable?  Additionally, would an ANCOVA always use Type I SS?  Thanks for your help.


Hoping it's a stupid and basic question, but can't find the answer in Google, nor in search here.   Website setup:      Then introduced SSL, so now it's:       Have shared hosting with a cPanel (if it's relevant info) and using Cloudflare free package.  1) How can I make users typing:  example.com, and www.example.com be directly redirected (without several redirects) to   2) Can I also make the following, for users typing:  sub.example.com as well as www.sub.example.com  to be redirected to:   I have made it to work, but it took using two pagerules in CloudFlare. Is there a more clever and better solution?  What I've done so far:  DNS:  A mydomain.com points to hostIP  A sub points to hostIP  CNAME www alias of mydomain  CNAME www.sub alias of sub.mydomain.com  This alone didn't help, so I had to make two page rules in CloudFlare, in order:  www.sub.example.com/*  - forwarding url 301 to $1  example.com/*  - forwarding url 301 to $1  I also set "Always use HTTPS" in CloudFlare Crypto settings.  Only total of 3 page rules with CloudFlare, one used to not cache admin when logged in. So a total of 2 to left to work with. Although I guess there is a better way to do it, is there?  From what I gather, setting it up in .htaccess is no longer considered a good policy, is it?  Thanks in advance for any help.


Where's the exe that handles the Bluetooth tray icon?

Where could I find the exe/process/dll that handles this pesky . I am very customized person, so I want to customize it, break it open and replace those resources with my redesigned ones to make that Bluetooth icon in line with that other Windows 10 tray icons Tell me where I could find it? Thanks


The Difference Between voltage and current

I know that this question has been asked many times before, and I have read over several of the threads asking this question, but they do not include the gripe I have with my problem of understanding the difference.  As I understand it, voltage, V, (also called electromotive force, EMF) is essentially the "wanting" of electrons to push away from the negative terminal and to want to go to the positive terminal to eventually balance out the charges and create a net neutral charge. This is done through a conductor, like a wire, between the two terminals. The movement of electrons caused by the attraction of the charge from the negative terminal to positive is the current, I.  Now, as my textbook defines it, voltage is the amount of energy, E, per unit charge, Q. Current is defined as the amount of charge, Q, passing through a point in the circuit in a unit time, t. Current is determined by voltage, as is also stated in Ohm's Law (i.e. if voltage rises/falls, current rises/falls, if resistance remains constant). So then, if energy is lost in a resistor, why does current through the resistor not change? Shouldn't the current go down if energy is lost? Or is it that energy is determined by something within the voltage source (e.g. battery) that is not related to charge?


How to reinstall Ubuntu in dual boot with Windows 10?

I have Ubuntu 15.10 and Windows 10 dual-booted, but I want to reinstall Ubuntu in the same partition without making any changes or causing problems in the dual boot option and without removing Windows.  Is it possible? Any guide on how to do it?


Positive semidefinite cone is generated by all rank-$1$ matrices.

The positive semidefinite cone is generated by all rank-$1$ matrices $xx^T$, which form the extreme rays of the cone. Positive definite matrices lie in the interior of the cone. Positive semidefinite matrices with at least one zero eigenvalue are on the boundary.  I am unable to justify why the statements above are true. Please give some hints.


Does one need to clear immigration when crossing only international waters and returning to the same country?

More specifically, should I clear immigration when sailing from California to Hawaii?


Intuition behind the use of the Principle of Stationary Action in Classical Field Theory

Whilst studying Field Theory and after checking numerous sources it appears that people always just state the action without providing some sort of motivation/intuition as to why we should/can use the Lagrangian formalism in field theory. I understand the motivation for it in classical mechanics and I do see the analogy between the classic Lagrangian and the Lagrangian density by taking the limit where you want to see the dynamics of an infinite number of particles (ie. each one being a point of a field) however I still can't realize the full picture as to why the Principle of Stationary Action should be valid for a field. Is the Lagrangian formalism used simply because the equations were already known and people just constructed a Lagrangian that worked and provided the already known equations? Or was it built from the ground up already assuming the Principle of Stationary Action is valid ? If so why? Note: I known a very similar question was already asked before  however I felt that the question was not answered fully. EDIT: As I said I known that the question has been asked before however in the links provided and the links therein (which I had read prior to asking this question) an explicit answer to this is not provided.


Pulley system: how can tensions be equal throughout a entire rope if the weights on opposite ends are different?

More weight means more pulling force, and thus more tension force.   Like this , however much force you pulling with is equal in magnitude to the tension force.  If that is case, how then can tensions forces in this photo be equal if their sources are of different weight:


Why wp_register_style() is important while I'm using a complete wp_enqueue_style()?

Currently I'm working on a theme, and did some styles and scripts enqueue. When enqueued the scripts, I used wp_register_script() first, and then enqueued with wp_enqueue_script() - because I got that's the proper way of enqueuing the scripts. But in enqueuing the styles, I used only the wp_enqueue_style() with all its parameters. But just now I got  from s_ha_dum saying that using the wp_register_style() would make theme child theme-friendly - I wonder, without the wp_register_style() I's using only the wp_enqueue_style() and my theme's working fine with the enqueued styles. I enqueued them like:  add_action( 'wp_enqueue_scripts', 'wpse20131025_styles' );  function wpse20131025_styles(){      wp_enqueue_style( 'site-styles', get_template_directory_uri() . '/style.css', '', '', 'screen' );     wp_enqueue_style( 'menu-styles', get_template_directory_uri() . '/css/menu.css', '', '', 'screen and (min-device-width: 800px)' );     wp_enqueue_style( 'mobile-menu-styles', get_template_directory_uri() . '/css/mobile-menu.css', '', '', 'screen and (max-device-width: 799px)' );  }   While the wp_enqueue_style() has all the parameters that present in wp_register_style() ($handle, $src, $deps, $ver, $media) then why should I repeat them? Or, what exactly the purpose of wp_register_style() other than wp_enqueue_style()?


Can black holes grow via accretion of dark matter particles?

I'm assuming that the answer to the question in the title is a resounding yes. Since Baryonic matter and dark matter interact via gravitational forces.  If this is the case how is information not lost if, as is presumed, dark matter does not interact via the electromagnetic force?


\documentclass[a4paper,12pt]{article} \usepackage{amsmath,amssymb} \usepackage[hang,perpage,symbol*]{footmisc} \usepackage{array} \usepackage{enumitem} \usepackage{scrextend} \usepackage{url} \title{} \author{} \date{} \begin{document} \maketitle \begin{tabular}{>{\hskip -40pt$}c<{$\hskip -10pt}@{\ --\ \hskip 15pt }l} test & test \\[10pt] f(x) = O(g(x)) & $|f(x)| \leq A|g(x)|$ for some constant $A$, and all values $x>x_0$ for some $x_0$. \\[10pt] \end{tabular} \end{document}   I want the f(x)... to have tiny font size but \tiny does not work


I recently accidentally discovered that command is a command, however typing --help or -h after it only seems to yield results similar to this:  bash: command: --: invalid option command: usage: command [-pVv] command [arg ...]   It has no manpage, it is not a separate package in itself, and I can't figure out which package it is in nor what it does... I am running Ubuntu GNOME 15.10 with GNOME 3.18. So, what does the command command do? And how does one use it?


What defines the maximum size for a command single argument?

I was under the impression that the maximum length of a single argument was not the problem here so much as the total size of the overall argument array plus the size of the environment, which is limited to ARG_MAX. Thus I thought that something like the following would succeed:  env_size=$(cat /proc/$$/environ | wc -c) (( arg_size = $(getconf ARG_MAX) - $env_size - 100 )) /bin/echo $(tr -dc [:alnum:] </dev/urandom | head -c $arg_size) >/dev/null   With the - 100 being more than enough to account for the difference between the size of the environment in the shell and the echo process. Instead I got the error:  bash: /bin/echo: Argument list too long   After playing around for a while, I found that the maximum  was a full hex order of magnitude smaller:  /bin/echo \   $(tr -dc [:alnum:] </dev/urandom | head -c $(($(getconf ARG_MAX)/16-1))) \   >/dev/null   When the minus one is removed, the error returns. Seemingly the maximum for a single argument is actually ARG_MAX/16 and the -1 accounts for the null byte placed at the end of the string in the argument array.  Another issue is that when the argument is repeated, the total size of the argument array can be closer to ARG_MAX, but still not quite there:  args=( $(tr -dc [:alnum:] </dev/urandom | head -c $(($(getconf ARG_MAX)/16-1))) ) for x in {1..14}; do   args+=( ${args[0]} ) done  /bin/echo "${args[@]}" "${args[0]:6534}" >/dev/null   Using "${args[0]:6533}" here makes the last argument 1 byte longer and gives the Argument list too long error. This difference is unlikely to be accounted for by the size of the environment given:  $ cat /proc/$$/environ | wc -c 1045   Questions:   Is this correct behaviour, or is there a bug somewhere? If not, is this behaviour documented anywhere? Is there another parameter which defines the maximum for a single argument? Is this behaviour limited to Linux (or even particular versions of such)? What accounts for the additional ~5KB discrepancy between the actual maximum size of the argument array plus the approximate size of the environment and ARG_MAX?   Additional info:  uname -a Linux graeme-rock 3.13-1-amd64 #1 SMP Debian 3.13.5-1 (2014-03-04) x86_64 GNU/Linux


How to check whether my OS is 64-bit or 32-bit?

What is the best way to determine whether my OS is 64-bit or 32-bit ?  Assume that, I directly on some os & I am going to install a software on it. But how to determine, whether OS is 32-bit or 64-bit,  OS may be anything, like   windows xp vista windows 7 os x leopard os x snow leopard Red hat linux   What I mean is - what is the best & common way to determine whether os is 64-bit or 32-bit? I mean, I am talking in general. I haven't installed os on someone's machine & if I tell you to determine its OS base - 64 or 32 ? then what would you do ?  Thanks in advance for sharing your knowledge. Sugar.


Each $2\times 5$ rectangle contains $1\times 3$ rectangle

A $60\times 60$ board is partitioned into rectangles of size $2\times 5$ (or $5\times 2$). Is it true that there always exist another partition into rectangles of size $1\times 3$ (or $3\times 1$) such that any $2\times 5$ (or $5\times 2$) rectangle contains a $1\times 3$ (or $3\times 1)$ rectangle?  For the "simple" partition into $2\times 5$ rectangles, this is certainly true: use the simple partition into $1\times 3$ rectangle.  Another way to partition is to first partition the $60\times 60$ board into $12\times 10$ boards, and then for each such board, put two $2\times 5$ at the top and ten $5\times 2$ below. It is not hard to tile each such $12\times 10$ board with $1\times 3$ (or $3\times 1)$ rectangles so that each $2\times 5$ (or $5\times 2$) contains a $1\times 3$ (or $3\times 1)$ rectangle.  (I'm assuming that an $m\times n$ rectangle has $m$ rows and $n$ columns.)


So i have this application in which I am storing Sockets in an ArrayList on the Server side. When the client closes its application the socket must close as well but It doesnt reflect the changes in the ArrayList in the server.  class arrays {     public static ArrayList<Socket> online_buyer=new ArrayList<Socket>();      public static ArrayList<Socket> online_seller=new ArrayList<Socket>();          public static ArrayList<String> buyer_prod=new ArrayList<String>();  }      public void seller_display()     {         while(true)         {                  if(flag==1)             {                  synchronized(sock)                 {                 for(int i=0;i<arrays.online_buyer.size();i++)                 {                 System.out.println(arrays.buyer_prod.get(i));                 }                 flag=0;                 }             }               check2();          }      }       public void check2()     {         for(int i=0;i<arrays.online_buyer.size();i++)         {             try              {             Thread.sleep(1000);             }              catch (InterruptedException e)              {             e.printStackTrace();             }             **while(!arrays.online_buyer.get(i).isConnected())**              {                 arrays.online_buyer.remove(i);                 arrays.buyer_user.remove(i);                 arrays.buyer_add.remove(i);                 arrays.buyer_prod.remove(i);                 arrays.time.remove(i);                 arrays.buyer_no.remove(i);                 flag=1;                 System.out.println("RECORD DELETED");             }           }      }   public void run()     {     get_details();      } }   Now the statement while(!arrays.online_buyer.get(i).isConnected())  must be while(!false)=true. When i close the socket from the client side as isconnected()method must return false. But this statement never runs to be false even if i close the socket from client.


How do I downgrade Minecraft to play on a server running an older version?


How to add a delay for button.click Javascript call

I have the following script that I run on Console mode in Chrome to automatically click on some buttons on the webpage. But I want to add a delay after each click so that it won't click all buttons at once. Please let me know how to proceed.     [].slice.call(document.querySelectorAll('.button')).forEach(function(button) {button.click();});


Is there a way to force Google Photos to recognize new faces?

I have "Face grouping" enabled in my Google account and I can see around 10 faces successfully tagged when I go to my Albums. However, there's a lot of other people who are not tagged, as well as some unrecognized photos of people who are already tagged.   Is there a way to force Google Photos to run the facial recognition algorithm on a given photo, so that it adds new faces or maps a new photo to an existing face?


If neutrinos are disfavoured as DM candidates why aren't axions?

Numerical simulations of observed large-scale structure formation work best with Cold Dark Matter (CDM; see the answer ). Neutrinos are candidates for Hot Dark Matter (HDM), and hence they cannot account for the total dark matter abundance of the Universe. By the same token, axions are also relativistic because they have very tiny masses. Aren't they also candidates of HDM like neutrinos? Shouldn't they also be disfavoured for the same reason?


Java debug mode: how to get return value of function call

The variable view of the Eclipse Java Debug mode allows to inspect the values of variables.  What I'm frequently missing is to inspect the return value of methods: if such a return value is not stored into a variable but immediately used to call one of its methods, it is not visible in the debugger.  For example, consider foo.getBar().equals("xxx"); where getBar() yields a String.  If the source of foo is unavailable, how can the result of getBar() be inspected before the call to .equals()?  Of course, one can change the code by introducing a local variable that holds the result. But that is too unpractical in general.  Eclipse Standard/SDK  Version: Luna Service Release 1 (4.4.1) Build id: 20140925-1800


How to get Bohr model from Schroedinger equation?

New theories must in some approximation must reduce to older approximately correct theories. In what approximation exactly does the angular momentum quantization condition from Schroedinger's equation reduce to that of Bohr? According to wave mechanics, $$L=\sqrt{\langle\hat{L}^2\rangle}=\sqrt{\ell(\ell+1)}\hbar$$ According to Bohr model,$$L=n\hbar.$$ I tried equating the two and expected that Bohr model will give one of the subshells, but got impossible relations between $n$ and $\ell$. In what mathematical approximation will the two $L$s coincide?


Live Ubuntu USB with persistent storage Using mkusb

After considerable review of the options, I tried and failed to create a usable live Ubuntu USB with persistent storage using what seemed like "best practice" instructions at  I suspect I'm one step away from a full solution, but I need help.  I reviewed answers on AskUbuntu and other places before starting, including many responses by @C.S.Cameron and @sudodus. Answers for OS versions earlier than 18.04 are now of uncertain value for running 18.04 or later due to various issues. Hence I opted to follow the comprehensive and recent instructions at the URL above.   After following the instructions, I seem to have a USB drive formatted by mkusb as predicted. When I attempt to boot, the BIOS/UEFI process identifies the USB stick as a possible boot location, but when I select it for booting and proceed, I am returned to the same screen for choosing a boot location. For some reason, the USB stick is rejected as a viable boot option. I have tried the process 3-4 times using 2 iso images (18.04LTS and 19.10) and 2 USB sticks (Sandisk Extreme 64GB and Sandisk Cruzer Facet 16GB). Below are links to two screenshots of GParted analysis of the resulting USB sticks.


Google maps distance based on the zoom level

I have used google maps for displaying some locations using markers, based on the user's current location. User's current location is the center point of the map. The default zoom level is 12. In default, I displayed markers within 300 miles(In my case) distance only.  In that how can I do the following,   1) If decrease the zoom level, I need to increase the distance that should display markers within the increased distance also. how much distance should I increase in miles (For e.g. Zoom level is 11) ?   2) If increase the zoom level, I need to  decrease the distance that should display markers without the increased distance. how much distance should I decrease in miles (For e.g. Zoom level is 13) ?   Please suggest me there is any built-in option to do that ...


How to estimate the total number of raffle tickets sold based on the serial of the ones that were drawn?

Assume I'm playing in a raffle. The tickets are numbered uniquely and in sequence. So the first ticket has the serial number 1, the second has the serial number 2 and so on. At the end of the day someone draws 10 winning raffle tickets randomly. The winning serial numbers are public for everyone. For example: 321,432,501,623,657,702,754,971,1101,1295 Based on this information is there a way to estimate the total number of raffle tickets sold? Of course in this example we know that they sold at least 1295 ticket. But is there a method to find a probable estimate for the upper limit?


Help Center subheader pushing first h2 of content-page down

In the help center when I was just reading up on bounties I noticed this:      As you can see the top subheader appears to be going under the line and the title is pushed to the right.  I went to check another page suspecting that the cause was because of the longer subheader.    Looking at the developer tools in Chrome the subheader <div> goes across fine, but the child <h1> and/or <a> appear to extend bellow the <div>      It is probably nothing major, but I would think there are some certain people who are pulling their hair out about now because I've brought it up and doesn't look right (OCD sufferer? I can't remember the name of the disorder).


Convergence of the sequence $x_n = \sqrt{x_{n-1}x_{n-2}}$ for all $n\geq3$

Let $\left\{x_n\right\}$ be a sequence of positive real numbers such that $x_n = \sqrt{x_{n-1}x_{n-2}}$ for all $n\geq3$. Then show that the sequence converges to $(x_1x_2^2)^{1/3}$.   How can I do the sum? I have learnt Squeeze theorem, ratio test and root test for convergence of sequence, but I am not sure whether those theorems will help in solving this sum. Please give some hint to approach it.  Please anyone help me solve it. Thanks in advance.


Pythagorean triples $(a,b,c)$ and divisibility of $a$ or $b$ by $3$.

Call a triple of integers $(a, b, c)$ a Pythagorean triple if $a^2 + b^2 = c^2$ , i.e., if $a, b, c \in \mathbb{N^*}$ are the (measures of) sides of a right triangle. Examples of Pythagorean triples are  (3, 4, 5), (5, 12, 13), (8, 15, 17) and (3312, 16766, 17090).  Show that if $(a, b, c)$ is a Pythagorean triple  if at least one of a and b is divisible by 3.  I think to begin with $a^2 + b^2 = c^2 \rightarrow a^2 - c^2 = b^2$ to show this. Then I get stuck to prove this?


mathop shifts the baseline, DeclareMathOperator doesn't

Here is a little example that illustrates this strange behaviour:  \documentclass{article} \usepackage{amsmath} \DeclareMathOperator\foo{\mathbf{l}} \begin{document} baseline$\mathbf{l}$baseline$\mathop{\mathbf{l}}$baseline$\mathop{l}$baseline$\foo$baseline \end{document}     Note that the explict call to \mathop shifts the baseline of the l. But if you use \DeclareMathOperator this doesn't happen. Is this a bug or a feature?  I personally think that the shifted baseline looks really weird if you're discussing an operator in text, so I'd like to shift it up again. Do I have an alternative to endless use of \DeclareMathOperator?


Example of closed and bounded in $\mathbb Q$ set that is not compact

Consider the metric space $Q$ of rational numbers with the Euclidean metric of $R$. Let $S$ consist of all rational numbers in the open interval ($a, b$), where $a$ and $b$ are irrational. Then $S$ is a closed and bounded subset of $Q$ which is not compact.  I am trying to prove this statement. It's easy to show that $S$ is closed and bounded but I'm having trouble showing that it is not compact. I think I need to find an example of an open covering of $S$ which doesn't have any finite subcover, but I can't think of such an example. Any help? Thanks.


Text in Ubuntu Software Center is unreadable

When I do a search in the software center this is what the results look like.    I can only see the text if I select one of them.  I tried changing themes but that didn't fix it.


Ubuntu 18.04 theme: how can I change the default color?

I installed Ubuntu 18.04 and changed my GTK theme to Adwaita Dark. But how to change the GNOME theme? Because it is still the same, with this orange color and a different gray.  I explored CompizConfig and Dconfig without success. I want to change manually the status bar color and the accent color. How?  A screenshot of my desktop with the two themes... not good.


Is there any particular criterion that makes a CPU be called "16 bits" CPU for example

What makes a CPU be called for example: "this CPU is n bits"?


In what cases, if any, is there a difference in performance between prefix and postfix increment/decrement operators in C?

I understand that this issue in C++ can be a matter of . I also understand that optimization comes into play and can make this a non issue in most, if not all cases. My question is whether or not current compilers make this a complete non-issue or there are still some occasions to consider a difference.


NullPointerException raised onJoin in Bukkit

I am attempting to program an onJoin() event so any user who connects gets their gamemode set to the server default. However, whenever a player joins, it raises a NullPointerException.  public class ListenerPlayerLogin implements Listener {     @EventHandler(priority = EventPriority.HIGH) // This needs to run correctly.     public void onLogin(PlayerLoginEvent event) {         Logger console = Bukkit.getLogger();         console.info("onLogin called.");         Server server = Bukkit.getServer();         GameMode defaultGamemode = server.getDefaultGameMode();         console.info("Default Gamemode: " + defaultGamemode.toString());         HumanEntity player = event.getPlayer();         console.info("Target: " + player.getName());         player.setGameMode(defaultGamemode);         String playGM = player.getGameMode().toString();         console.info("Player Gamemode: " + playGM);         player.sendMessage("§eRandomos framework loaded.");     } }   The error I'm getting is:  org.bukkit.event.EventException: null         at org.bukkit.plugin.java.JavaPluginLoader$1.execute(JavaPluginLoader.java:320) ~[spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at org.bukkit.plugin.RegisteredListener.callEvent(RegisteredListener.java:70) ~[spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at org.bukkit.plugin.SimplePluginManager.fireEvent(SimplePluginManager.java:529) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at org.bukkit.plugin.SimplePluginManager.callEvent(SimplePluginManager.java:514) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.PlayerList.attemptLogin(PlayerList.java:513) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.LoginListener.c(LoginListener.java:134) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.LoginListener.tick(LoginListener.java:53) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.NetworkManager.a(NetworkManager.java:220) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.ServerConnection.c(ServerConnection.java:129) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.MinecraftServer.b(MinecraftServer.java:1105) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.DedicatedServer.b(DedicatedServer.java:399) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.MinecraftServer.a(MinecraftServer.java:984) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at net.minecraft.server.v1_15_R1.MinecraftServer.run(MinecraftServer.java:824) [spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         at java.lang.Thread.run(Unknown Source) [?:1.8.0_251] Caused by: java.lang.NullPointerException         at uk.kaidev.randomos.ListenerPlayerLogin.onLogin(ListenerPlayerLogin.java:25) ~[?:?]         at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) ~[?:1.8.0_251]         at sun.reflect.NativeMethodAccessorImpl.invoke(Unknown Source) ~[?:1.8.0_251]         at sun.reflect.DelegatingMethodAccessorImpl.invoke(Unknown Source) ~[?:1.8.0_251]         at java.lang.reflect.Method.invoke(Unknown Source) ~[?:1.8.0_251]         at org.bukkit.plugin.java.JavaPluginLoader$1.execute(JavaPluginLoader.java:316) ~[spigot-1.15.2.jar:git-Spigot-800b93f-8160e29]         ... 13 more```


Is it true that: $a+bi$ is prime in $\mathbb{Z}[i]$ if and only if $a^2+b^2$ is prime in $\mathbb{Z}$

Is it true that $a+bi$ is prime in $\mathbb{Z}[i]$ if and only if $a^2+b^2$ is prime in $\mathbb{Z}$?    How can I prove this? Can anybody help me please?


Single word for old and many-times-seen content

Using old as a starting word, Urban Dictionary suggested:   Obsolete Outdated Archaic Ancient Retro Passe     And I have to say that none of them really fit. The first two can describe software, but you don't update your old memes, they just get old and you rarely re-see them in a fit of nostalgia, deep inside your archives. #3 and #4 can be used in phrase describing how old is this post (e.g. ancient as mammoth's $#!@). But hey, that's a phrase, not a single word! #5 is about the style, not the freshness. #6 is completely about fashion (e.g. MySpace is so passe). A friend of mine suggested retoast, but I'm unsure because I haven't really seen the usage. Your suggestions?  Update: Very sorry to break the rules, adding an example usage now.     Oh no, grandpa saw a pack of my business cards, and added me to his hilarious e-mailing list, consisting of ????? from 2007.   Also, if any of you guys surf russian internets, you may be familiar with баян. I need precisely that translated. It is a common (first) comment to many posts in social networks, as re-posting happens quite often  Update 2: The small thing that I forgot to mention is that it's a noun in russian, I will sure accept the fact that there are no such, but it would be much more familiar to talk of information units, calling them ????? than saying that they are bromidic, for example. I find bromidic kinda 30% suitable, but I guess I can't derive a bromid noun? So the speech contruction becomes longer, which is undesirable


Relationship between the side lengths of a tetrahedron and an inscribed tetrahedron with vertices at the centroids

Suppose that $OABC$ is a regular tetrahedron with sides having centroids $\lbrace E,F,G,H\rbrace$ also forming a regular tetrahedron. What is the relationship between the side lengths of $OABC$ and $EFGH$?    I suspect that tetrahedron $EFGH$ has side lengths $1/3$ of that of $OABC$ but I'm unsure as to how to prove it.


Horizontal lines in nested tabular environment

I currently have this table:  \begin{table} \centering \begin{tabular}{ |c|c| } \hline no test & no test \\ \hline no test & \begin{tabular}{c|c} D1 & 1.23 \\ \hline D2 & 1.23 \\ \end{tabular} \\ \hline \end{tabular} \end{table}    Giving:    hline in the nested tabular does not span the entire cell width.  Of course multirow/multicolumn would be a choice. However, this is a "mutable" table, to which I will need to add "sub-rows" each time new data arrives, but I do not know in advance where. So, it could become something like:    For such purpose, multirow/multicolumn seems that would require constantly changing their row/column numbers.  How can this be solved in such a way that minimizes the work each time a new "sub-row" is added?  Thanks.


Does gravity get stronger with compression of matter?

I am wondering if gravity gets or would get stronger with ultra-compression (relativistic level) of matter? This may sound stupid but this is how my thought process went.  Let us assume we have an object at position $x$ and now let us assume we want to pin-point the exact position of the object therefore we start compressing the object to get exact position therefore our $\Delta x$ will get closer and closer to $x$ however if you think about it in quantum sense you will discover that the Heisenberg uncertainty will start to act, so we can say the $\Delta \vec p$ will increase in other words the velocity will increase because of the inequality:  $$\Delta x \Delta \vec p \geq \frac{\hbar}{2}$$   Now since using the Special relativity transformations we can say as a velocity of an object is increased the mass must also increase by:  $$m' = \frac{m} {\sqrt{1 - \frac{v^2}{c^2}}}$$  I can therefore say since the mass increase while compressing due to the uncertainty in momentum.  As a result of this we can say that the overall-mass will increase $m'$ due to compression and now if we were to substitute these into the Newtonian Gravity equations we will get more gravitational force than expected after compression:  $$F' = \frac{Gm'}{r^2} $$   Which is definitely bigger than if the object was not compressed, to express this we can mathematically make this into a inequality:  $$\frac{Gm'}{r^2} > \frac{Gm}{r^2}$$  As a result I could back-up my theory, but using this can we say that the gravity near neutron-stars or black-holes is slightly stronger than expected by the gravitational equation. Is there any proof of this happening or if not what is wrong with my ideology and could someone correct it for me?


find area of the region $x=a\cos^3\theta$ $y=a\sin^3\theta$

Find the area of the region enclosed by $x=a\cos^3\theta$ and $y=a\sin^3\theta$  What steps should I take in order to find the area?


Visual 2015 C++ compiler: Call of static member with object does not lead to compiler error

I noticed that I do not get a compiler error for the following code. Instead the program hangs. Why is that so?  class GLvector { public:   static GLvector CrossProduct(const GLvector &V1, const GLvector &V2);  // ..  GLvector v; v.CrossProduct(foo, bar);


I am currently running 16.04 version of Ubuntu bash on Windows 10 Pro (v1803) using WSL. But, I couldn't install the newly released 18.04 Ubuntu on my machine from the windows store. Need some help.   I tried to install the 18.04 version from Windows Store. The store app just refreshes. Nothing else happen.  Tried removing v16, turned off WSL feature and started all over again. Still the same.   Tried the method from this link from . It installed only 16.04 version. Not the latest 18.04.   Resetting windows store didn't work too.


I am running out of inodes. Only 11% available:  the-foo:~ # df -i  Filesystem               Inodes   IUsed   IFree IUse% Mounted on /dev/mapper/system-home 9830400 8702297 1128103   89% /home   Is there a way to solve this without creating and copying to a new partition?  Details:  the-foo:~ # tune2fs -l /dev/mapper/system-home tune2fs 1.42.6 (21-Sep-2012) Filesystem volume name:   <none> Last mounted on:          /home Filesystem UUID:          55899b65-15af-437d-ac56-d323c702f305 Filesystem magic number:  0xEF53 Filesystem revision #:    1 (dynamic) Filesystem features:      has_journal ext_attr resize_inode dir_index filetype needs_recovery extent flex_bg sparse_super large_file huge_file uninit_bg dir_nlink extra_isize Filesystem flags:         signed_directory_hash  Default mount options:    user_xattr acl Filesystem state:         clean Errors behavior:          Continue Filesystem OS type:       Linux Inode count:              9830400 Block count:              39321600 Reserved block count:     1966080 Free blocks:              22958937 Free inodes:              2706313 First block:              0 Block size:               4096 Fragment size:            4096 Reserved GDT blocks:      1014 Blocks per group:         32768 Fragments per group:      32768 Inodes per group:         8192 Inode blocks per group:   512 Flex block group size:    16 Filesystem created:       Tue Jul  8 08:02:22 2014 Last mount time:          Sun Apr 24 22:33:00 2016 Last write time:          Thu Sep  8 09:18:01 2016 Mount count:              11 Maximum mount count:      10 Last checked:             Tue Jul  8 08:02:22 2014 Check interval:           0 (<none>) Lifetime writes:          349 GB Reserved blocks uid:      0 (user root) Reserved blocks gid:      0 (group root) First inode:              11 Inode size:           256 Required extra isize:     28 Desired extra isize:      28 Journal inode:            8 First orphan inode:       2759586 Default directory hash:   half_md4 Directory Hash Seed:      e4402d28-9b15-46e2-9521-f0e25dfb58d0 Journal backup:           inode blocks   Please let me know if more details are needed.


Execute second command only if first expression has value

I have global variable $MY_VAR. How can I execute second command only if the variable has value: echo $MY_VAR && echo "Show me only if variable $MY_VAR has value"


Is there ever a right time to not use Bessel's Correction?

I can not find a clear explanation for when NOT to use Bessel's correction and use N instead of N-1.  As I understand it, Bessel's correction would apply to things such as clinical trials, sampling from a production line, voter polling, etc.  I am performing an experiment analyzing mass flow rate into 3 entry points.  I want to analyze the deviation of the distribution into those 3 entry points and compare it to an ideal perfectly even distribution of a (relatively) known mass.  I believe I know the "true population mean" in this circumstance - its an even distribution so if I reduce everything to percentages, it would be X = 1/3 = 0.333.  I believe I need to use N instead of N-1.  The complicating factors are that while I think I know the starting mass for the experiment, my scale has an instrument error associated with it.   Also my measurement of mass flow rate versus time has multiple measurement instruments associated with it as well!  I guess if I boil down the question.... I need to figure out if I need to use N or N-1 for standard deviation.  Does the error inherent to the measurements necessitate N-1 or does knowing my "ideal distribution" allow me to use N?


What happens when you assign a (float x1, float x2) to a float r in C?

I am reading the book Numerical Recipes in C in the chapter about the bisection algorithm for root finding but in the code I'm confounded by the following line of code:  rtb = f < 0.0 ? (dx=x2-x1,x1) : (dx=x1-x2,x2);   I know that the operator ( code1 ) ? ( code2 ) : ( code3 )   is like a if( code1 ) ( code2 ) else ( code3 )  but what i don't understand is that rtb that is a float is receiving either (dx=x2-x1,x1)   or (dx=x1-x2,x2), being x1 and x2 floats would't this be assigning some type of ordered pair of floats to a single float ?


! LaTeX Error: File `beamerbasemodes.sty' not found. I have this error in latex. How can I risolve it?


How to give permissions to www-data to log in with ssh?

I have an Ubuntu 14.04 server, where Apache runs as user www-data. I would like to be able to log into the server via ssh as www-data.  How can I define a password for www-data without breaking the Apache service?   How to add www-data to the list of allowed ssh users?   Edit  I understand from the question that was marked as duplicate, that it is not the most secure solution to give www-data access via ssh, but I need to do it for a different reason at least temporarily.  Here is the reason why I need to log into the server as www-data : I want my webserver to ssh into a remote host without providing a password. In order to be able to set this up, I need to log in as www-data, generate a ssh key and send it to that remote host.


I have two Facebook accounts and would like to delete one of them

I noticed I have two Facebook account but I would like to know how to delete one of them.


How does QGIS Zonal Statistics handle partially overlapping pixels?

There are a couple Stackexchange posts asking this question, but neither of them were sufficiently answered:       I am writing Python scripts that perform essentially the same operations as Zonal Stats, and I have been using Zonal Stats to check my scripts' outputs.   I have noticed that when there are many cells in the polygon being queried, my results match perfectly, but there are discrepancies when there are only a few raster cells in the polygon. The following is an example of this. I am computing "count" for each polygon.  Exhibit 1:   The returned count is 0.45, which looks roughly correct if pixels can be treated fractionally rather than simply in/out.  Exhibit 2:   Similar result; count is 0.39.  Exhibit 3:    With a larger poylgon, now we see the count is exactly 2. Note that there are exactly 2 pixel centers contained in the polygon.  Exhibit 4:    Here, only one pixel center is within the polygon. The count is 1.008, though. If you exclude the polygon area from the pixel whose center is in the polygon, the remaining area is obviously greater than 0.008 of a pixel.   From these exhibits, it seems that Zonal Statistics treats these cases specially. It looks like to me that if there are less than 2 pixel centers within the polygon, it performs some kind of averaging such as polygon_area/raster_cell_area to return the count. I should note that I have 48 of these polygons, and all returned counts greater than or equal to 2 are integers; fractional counts are only returned for <2.  How are these fractional-pixel counts incorporated into the other statistics output by Zonal Stats?    indicates strange behavior with max/min when using large raster cells, and my own testing returns mean values not congruous with simple "pixel center in/out of the polygon." To reiterate, I get exact agreement when the underlying raster contains many pixels within the polygon. I couldn't find any documentation about this, and it may be important when people have never had problems with Zonal Stats but use a coarse raster and remain unaware that there is a different behavior when there are only a few pixels within the polygon.


Why are steps out of order when running model in Batch?

I have an issue using an ArcMap model in batch mode. The purpose of my model is to obtain the result of an OD cost matrix from a selected network and a set of origins and destinations. My goal is to be able to get these results without having to add the data to the display in ArcMap (time and resource consuming), but most of all, I want to be able to automatically process several OD cost matrix one after another. For these reasons, I rebuilt the OD cost matrix routine using ArcMap's Model Builder.      If I test the model on only only network, it works great. However, when I try to batch the process where each time I have a different network with different locations, I have a problem since ArcCatalog seems to mix the different steps. For example, if I batch with only two different networks...    Instead of having:  1. Create OD cost layer (1) 2. Load Origins 1 in network 1 3. Load Destinations 1 in network 1 4. Solve OD cost matrix (1) 5. Create OD cost layer (2) 6. Load Origins 2 in network 2 7. Load Destinations 2 in network 2 8. Solve OD cost matrix (2)   ArcCatalog does this:  1. Create OD cost layer (1) 2. Create OD cost layer (2) 3. Load origins 1 in network 2 4. Load origins 2 in network 2 5. Load destinations 1 in network 2 6. Load destinations 2 in network 2 7. Solve OD cost matrix (1) 8. Solve OD cost matrix (2)   I thought that when batching a model ArcCatalog would do the first task completely before even looking at the second. Why are the steps of my model mixed up?  Thanks for your help!


How can you set up certificates for clients to use in to log into a webpage in comparison to a username and password?

I've relatively new here and in the website world. I recently saw that some webpages (eg. some banks) use certificates for logging in. An example of what I'm looking for is here -  - this is a bank's webmail page where staff (from what I can see) use certificates to log in. This would eliminate clients from having to log in with a username and password. Any chance anyone would be able to explain to me what this is and how to do this (in simple/newbie terms) please? Your help would be much appreciated. Thank you :)


Is there an open source GIS to view and edit CityGML models?

I'm looking for an open source GIS that supports viewing and editing of  models.   So far, I've found a list of open source applications that support CityGML, but they all seem to be stand-alone applications, that don't integrate with common GIS systems: .  I would also be interested in your experience with CityGML in a GIS (also commercial) context.


I have created a short command block stack, one block teleports the player and the other plays block.piston.extend. My problem is that it teleports the player before the player can hear the sound. I would like to know if there is a way to delay the command from inside that command block. I have looked at other solutions but they all involve some complex scoreboard timer thing. If you could give me a solution that doesn't use that system or maybe you could explain it better.  This is the command I need to delay:  /tp @p -586.634 64 -430.697   If anyone could help I would really appreciate it, so thanks in advance!


Can moderators see a version history of comments?

I think it is well known that only moderators can see  comments.   But what I am wondering (mainly out of pure curiosity): can moderators also see the "edit history" of comments?


How to use the child functions when setting the base class equal to the child class?

#include <iostream> #include <string>  using namespace std;  class Base {   protected:      string name;    public:      Base(string name)       : name(name) {    }      void show() {        cout << name << endl;     } };  class Derive : public Base {  public:     Derive(string name)         : Base(name) {    }       void print_name() {         cout << name << endl;      }  };  int main() {    Base b("Alex");    Derive d("Matt");     b = d;    b.print_name();    return 0; }  Why am not able to call the function that is inside the Derived class when I set b equal to d? Am i supposed to make a copy assignment operator or something? Thanks.


$k$-fold cross-validation on a logistic regression: So which is the fitted model?

I am planning to use a $10$-fold strategy in order to validate the results of a logistic regression analysis.  I am a bit confused about the procedure I must follow.  More precisely: Let us suppose that my cross-validation returns acceptable values (for the average AUC, average misclassification rates, etc.) and reveals that everything is OK. Which is the predictive model or formula I should return in such a case?  First of all, I have already read (here, for instance: ) and understood that a $k$-fold cross-validation procedure aims at assessing the performance of a predictive analysis on a given data set (in terms of its ability to accurately predict on new data). I mean, it is not a technique for building predictive models, but a way to measure whether a given fitted model can be overfitting or not (roughly speaking).  OK, so, as far as I understand, I must do this:   Randomly divide the sample into $k$ equally sized subsamples (using stratification if necessary). For $i=1$ to $k$:   Perform a logistic regression analysis using all the cases not in subsample $i$ as the training set. Use subsample $i$ as the validation set. Calculate performance parameters.  Calculate average performance parameters.   Let us imagine that step 3 allows us to conclude that logistic regression performs well on our data.  Now, I have obtained $k$ predictive models. Is this right?  So, which one of them is the final model I should use? Or, should I build (and return to the final user) a definitive logistic regression predictive model using all cases in the sample?  Sorry if this is too simple or too wrong. I would really appreciate if you can answer my questions.  EDIT:  Actually, my question is about cross-validation, but I wanted to specify that I am dealing with logistic regression, just in case it helps.


Prove that $D_4$ cannot be expressed as the internal direct product of two proper subgroups.  I know that it can't be an internal direct product of two rotational subgroups because no rotation combination gives a reflection, but for the other cases I can't seem to make any progress.


There are a lot of books dealing with Feynman path integrals. Are there any online courses introducing Feynman path integrals and their applications?