Is eating a meal with 2000 Calories at once any different from eating 4 times at 500 Calories?

I wonder if there any difference in how many times I eat per day?  Let's say I eat one big meal in the morning at 2000 kcal (at 9am). Is that any different than having 4 meals at 500 kcal throughout the day (at 9am, 1pm, 5pm, 9pm)?  I think I will be hungry by the end of the day if I eat just once in the morning. But I won't be hungry if I eat 4 times a day at smaller portions? How is that possible?  Which way is it better to eat? Maybe twice a day at 1000 kcal? (9am and like 4pm?)


Is there a difference between "write" and "write down"?

Is there a difference between "write" and "write down" or it's just a matter of fashion / style?  At the university I see that some of the teachers say "write down" and some of them say "write" without "down"- both are in the same context in the classes (to write notes). Is one of them better or more correct or it's just a matter of style?


Is it unethical to hire a paper writer AFTER the assignment is done?

This is an intriguing scenario that came to my mind. I have not done this and am not planning on doing it, but I am curious about it. Of course, it’s well known that if you hire a paper writer to write your assignment for you, that’s cheating. But what about this situation?:  You have a difficult writing assignment. You follow all the rules, do it yourself, turn it in, and then you get your grade, and it’s a poor grade. But you want to learn what a really good paper for that assignment would look like, for the purposes of gaining knowledge, not grades. So you hire one of those paper writers people usually use to cheat, who is known for getting (dishonest, of course) As on all the papers they write, to nix it for you, so you’ll have an example of what an excellent paper would look like for your study pleasure.  So my question is: is this unethical, and if so, why, and what might be the consequences were it found out? The reason it seems interesting is because it’s being done after the assignment is turned in, so you’re not doing anything to deceive/defraud the teacher or get grades you did not merit – all transactions with the teacher were done by the book. But on the other hand you are going through the motions you’d go through to cheat, not to mention paying money to someone people pay to cheat. So where does this situation stand, ethically, and why?


can i change my battery with other mAh batteries

My phone is ikon 787.its battery was recently damaged so i decided to change its battery. The original battery is 2600 mAh . I likes to change it with a 4100 mAh battery.Is it have any demerits. Do it have any problem on changing the battery with other specs.


What is the command for a complete update in terminal for Kubuntu?

I am running Kubuntu on an old Acer Aspire ONE and any time i try to use the Update manager (Apper) it errors out. I have been using   sudo apt-get update   but i am not sure if it is updating everything, as the system notification message always seems to have 70+ apps that need updating.


Somehow I have managed to make it so that my model is not lit anymore. I have attached a screenshot. Can somebody tell me how to make it well-lit again? Thank you.   When I press Z two times, the view is changed, but it is still not correct, I think:


Where to ask this question about a feature on a web-based application?

I am not sure where to ask the question below. So I post it here for directions.     We are working on a feature on our web application to allow visitors to filter people (human service providers) by age and gender. The question is - would that introduce negative impact of age or gender discrimination? Would that be a concern at all?


Where should I put the ( .sty) files to make packages work?

I'm using miktex and there are few packages that I don't have on my pc so I downloaded them , where should I put them to make them functional ( the folder name).


I have been looking to book a bundle (hotel and flight) with Expedia to Puerto Vallarta MX. When I get to the booking section it does not ask for my passport number. Do they ask for my passport after I book? Or later when the date gets near? My passport is currently being renewed and I want to book my hotel and flight before they sell out but I am afraid it'll ask me for my passport number. Can anyone inform me about this situation?


Retrieve files deleted by command rm in terminal

Here's a summary: I was programming using java and accidentally, instead of using the rm *.class command in the command-line, I used rm *.java. It took me a lot of time to finish that code. I hope someone knows a way to retrieve those files. Please help me.


Prove that $n<2^n$ for any natural number $n$.

How do I prove that $n<2^n$ for any natural number $n$, assuming basic facts about the algebra of exponents?


How is gold (the element) gold (the color)?

This question is related to the inquiry here:    and here:   In general, assume you are given an input wavelength(s) of electromagnetic radiation, and a set of neutrons, protons, and electrons in a certain state (likely an atom). Is there a function that will map these values to the wavelength(s) of electromagnetic radiation after it has become incident with the set of neutrons, protons, and electrons?


Graph Theory: Simple Planar graph problem.

The complement of $G$ is the graph with the same vertices as $G$, but whose edges are precisely the non-edges of $G$. (That is, $u$ is adjacent to $v$ in the complement of $G$ if and only $u$ is not adjacent to $v$ in $G$.) Therefore, if $G^c$ is the complement of $G$, then $E(K_{|V (G)|} )$ is the disjoint union of $E(G)$ and $E(G^c )$. Show that if $G$ is a simple planar graph with at least eleven vertices, then the complement of $G$ is not planar.


Its pretty uncomfortable to use Ctrl+TAB to switch between vertex/edge/face selections in edit mode. Is there a way to make custom shortcuts for each of them?  Allso Is there shortcut for sculpt mode? And if not can I create one and how.  Thanks!


Were there any changes on how top 10/20/30% on careers are calculated?

I found this question:   It says:   take all the candidates in our system (which only includes people who have at least a total score of 5 in that tag.) sort by their total score in the tag figure out where you fall   I am looking at  where I active answered. Based on Top Answerers, there are at least 20 people with score 7+. So, it should show something like top 20% for me. However, it doesn't.  Am I missing something?


What is the standard approach for escaping harmful characters / sanitizing user's input with JS?

After reading tons of articles and StackOverflow responses I still don't get what is the industry standard approach for dealing with user's inputs (textarea and input type="text"). What and how should I escape chars? What and how should be stripped / replaced so JSON will not break, especially when the user can copy-paste some of the weirdest characters ever?  The doubtful solution that I have put in place a long time ago was:  String.prototype.escapeChars = function () {  return this.replace(/\&/g, '&#x26;') .replace(/\n\r?/g, '&#13;') .replace(/\n/g, '&#13;') .replace(/\r/g, '&#13;') .replace(/\s/g, '&#32;') .replace(/\</g, '&#x3c;') .replace(/\"/g, '&#34;') .replace(/\'/g, '&#39;') .replace(/\>/g, '&#x3e;') .replace(/\\/g, '&#x27;') .replace(/[^\x00-\x7F]/g, ''); };   I would tremendously appreciate if someone will explain in detail or point to a good tutorial on how it should be done PROPERLY with vanilla js.


Zermelo-Fraenkel set theory and Hilbert's axioms for geometry

The Zermelo-Fraenkel axioms with the axiom of choice (ZFC) are nowadays by many considered as the foundation for contemporary mathematics, and according to several mathematicians all mathematics is a logical consequence of this type of set theory.  For example, the Peano axioms for the natural numbers can be constructed from Zermelo-Fraenkel set theory and deriving classical subjects in mathematics from Peano's axioms is well-known.  I was wondering whether Euclidean geometry can also be constructed from Zermelo-Fraenkel set theory. To be more precise: can Hilbert's axioms for geometry be derived from Zermelo-Fraenkel set theory in a similar fashion as Peano's axioms? I would think this is possible since Zermelo-Fraenkel set theory is, as already mentioned above, considered as the basis of all extant mathematics, but I never came across such a derivation.  Any comment is appreciated.


Why is the tangent not really horizontal?       \documentclass{article}      \usepackage{tikz}      \usepackage{circuitikz}      \usepackage{pst-solides3d}      \usetikzlibrary{shapes,decorations}      \usetikzlibrary{positioning,arrows}      \tikzset{      state/.style={circle,draw,minimum size=6ex},      arrow/.style={-latex, shorten >=1ex, shorten <=1ex}}      \begin{document}      \begin{tikzpicture}        \node[name=D,draw,circle,inner sep=3pt,fill=gray!50] at (17,.5) {};      %d      \draw      (D.north) to (16.65,.65)      (D.south) to (16.65,.35)      ;      \draw[latex-]      (16.75,.65) to (16.75,1);      \draw[latex-]      (16.75,.35) to (16.75,0);      \node at (16.45,.5) {$d$};      \end{tikzpicture}      \end{document}


I usually add bibliography to my tex files by adding the lines:  \bibliographystyle{ChemEurJ} \bibliography{filename}   where 'ChemEurJ' is the style I usually use for the appearance of my bibliography and 'filename' is the .bib file in which I have all the articles, etc. that I want to cite.  Coming to the problem, does anybody know if there exists a bibliography style that would give the following as result?     L. Elisa, F. Baldini, A. Giannetti, C. Trono and T. Carofiglio, Solid-supported   Zn(II) porphyrin tweezers as optical sensors for diamines, Chem. Comm. 2010,   46, 3678   I looked for it for a while and I couldn't find it. On the other hand there are so many bibliography styles that I could have missed it.  Thanks for the help


Find the limit $\lim_{n\to \infty} \sqrt[3]{n^3+n^2}-\sqrt[3]{n^3+1}$

I have tried simplifying in every way I can think of, but I just can't seem to figure this out. I am asked to find the following limit: $$\lim_{n\to \infty} \sqrt[3]{n^3+n^2}-\sqrt[3]{n^3+1}$$


is it possible to download creator update version 1703  iso file and install it without windows update assistant app? if that so what steps should i follow after downloaded the iso file?  I do not need to know where to download iso file, i just need know how to proceed the installation process after download it.


Language Hotkeys removed by itself in Windows 10

I have four keyboards and I have defined Ctrl+1, Ctrl+2 and Ctrl+3 ... hot-keys for them. The problem is that either all of the hot-keys or the first one is removed regularly. For example every time the computer goes to sleep (or even locked) all of them are removed.  I even tried other hot-keys (Ctrl+Shift+1, ... Ctrl+Shift+4) or (Alt+Shift+1, ... Alt+Shift+4) and the problem still exist.  If I assign a transition key (Left Shift+Alt) it will work but that's not that useful when you have more than 2 keyboards and you want to regularly change the keyboard.  It appears that the problem has existed in Windows 8 too (and has something to do with welcome screen) but the solution I found does not work on Windows 10 ().  Has anyone been able to solve this problem?


How can Finder empty Trash more quickly than "rm -rf /Volumes/Foo/.Trashes/501/*"?

The "Trash" of a 16-GB usb2 flash drive had 3.4-GB of data. I emptied it as such:     $ cd /Volumes/FooDrive/.Trashes/501   $ rm -rf *   This took over 5-seconds. That seemed pretty long. So, as a test I just decided to empty the Trash of all of my drives via Finder. Other drives: 2-TB usb3 500-GB usb2 16-GB usb2 250-GB ssd  I measured the size of the Trash as such:       $ du -ch /Volumes/WhateverDrive/.Trashes   There was 15-GB in the Trash of the 500-GB drive, and 5-GB in the Trash of my other 16-GB flash drive. I didn't measure the other drives.  Finder appeared to take much less than 5-seconds to empty the Trash for all those drives.   Does Finder really empty the Trash so much more quickly than /bin/rm? How?   Does Finder just make the "clicking sound" (signaling the trash is empty) before the Trash on all the drives is really empty?


"Did you watch this movie?" or "Have you watched this movie?"

What is the difference between     Did you watch this movie?    and     Have you watched this movie?


Including +/- signs to battery in Circuitikz

I'm attempting to draw a battery (using the battery1 component) that includes positive and negative signs at the appropriate ends. A  that was answered here (using version 2.4) shows exactly what I mean:    Only, of course, I want to be using a battery1 symbol instead. So, I have my code as follows:  \usepackage[americanvoltages,fulldiodes,siunitx]{circuitikz} \begin{document} \begin{circuitikz}     \draw (0,0) to [battery1=\SI{9}{V}] (3,0)                 to [pC,v=$v_C$] (6,0); \end{circuitikz} \end{document}   And I end up with this:    Notice the lack of +/- signs (I know how circuits work so I don't need to be actually shown these signs, but for the sake of copying my class notes diagrams I want these signs to be included in my latex diagram).  In either case, I think it may have something to do with the version of Circuitikz I'm using because I'm using the latest version (I believe, 0.3.0) but in the previous question linked above, they were using 2.4 and it worked out for them.  I would really like to find a way to add +/- without having to manually add it with Tikz or something, i.e. just have it naturally part of the component without having to add nodes or extra Tikz code etc. If that's not possible, then I'll have to settle for that as a last result.   Thank you for your help!  EDIT: I should also mention that I've tried using battery1, v=$9V$ instead of battery1=\SI{9}{V} and to no avail (the +/- signs still don't show up).


I have a custom Lookup component that will within another LWC. I need to retrieve the filter information for any lookups that has an active filter. I was able to retrieve data using getFilteredLookupInfo() and filteredlookupinfo. If the new custom lookup component results is based off a value that is selected on the original LWC. What information do I need from the filter to populate the new lookup component? For example the field metadata is this:  <filterItems>         <field>$Source.Account__c</field>         <operation>equals</operation>         <valueField>BrokerAccount__c.Account__c</valueField>     </filterItems>  Do I need to be able to get the valueField? Thanks, P


How many distinct lines are there for a rectangular grid of $m \times n$ dots?

Given points $(x,y)$ on a domain of $0\le x < m$ and  $0\le y < n$ where all are integer. How many distinct lines (passing through at least two points on the given dots) are  there? Counting with program must be possible and not difficult enough, but how to do this by hand? Could you give me a hint?


How to point NGINX to internal npm app with port

I try to put up the Uppy Standalone Companion on a Scaleway instance. I managed to install Uppy and mananged to install Nginx with SSL but now I want the (sub)domain to load the Uppy Companion instead of the standard Nginx homepage.   I tried  location / {     proxy_pass http://127.0.0.1:3020; }   When I start companion it shows its running on 0.0.0.0:3020 so I also tried   location / {     proxy_pass http://0.0.0.0:3020; }   However, I won't get it to work. Below I've added my Nginx configuration file  # For more information on configuration, see: #   * Official English Documentation: http://nginx.org/en/docs/ #   * Official Russian Documentation: http://nginx.org/ru/docs/  user nginx; worker_processes auto; error_log /var/log/nginx/error.log; pid /run/nginx.pid;  # Load dynamic modules. See /usr/share/nginx/README.dynamic. include /usr/share/nginx/modules/*.conf;  events {     worker_connections 1024; }  http {     log_format  main  '$remote_addr - $remote_user [$time_local] "$request" '                       '$status $body_bytes_sent "$http_referer" '                       '"$http_user_agent" "$http_x_forwarded_for"';      access_log  /var/log/nginx/access.log  main;      sendfile            on;     tcp_nopush          on;     tcp_nodelay         on;     keepalive_timeout   65;     types_hash_max_size 2048;      include             /etc/nginx/mime.types;     default_type        application/octet-stream;      # Load modular configuration files from the /etc/nginx/conf.d directory.     # See http://nginx.org/en/docs/ngx_core_module.html#include     # for more information.     include /etc/nginx/conf.d/*.conf;      server {         server_name  companion.mywebsite.com;         root         /usr/share/nginx/html;          # Load configuration files for the default server block.         include /etc/nginx/default.d/*.conf;          location / {                 proxy_pass http://0.0.0.0:3020;         }          error_page 404 /404.html;             location = /40x.html {         }          error_page 500 502 503 504 /50x.html;             location = /50x.html {         }      listen [::]:443 ssl ipv6only=on; # managed by Certbot     listen 443 ssl; # managed by Certbot     ssl_certificate /etc/letsencrypt/live/companion.mywebsite.com/fullchain.pem; # managed by Certbot     ssl_certificate_key /etc/letsencrypt/live/companion.mywebsite.com/privkey.pem; # managed by Certbot     include /etc/letsencrypt/options-ssl-nginx.conf; # managed by Certbot     ssl_dhparam /etc/letsencrypt/ssl-dhparams.pem; # managed by Certbot  }   # Settings for a TLS enabled server. # #    server { #        listen       443 ssl http2 default_server; #        listen       [::]:443 ssl http2 default_server; #        server_name  _; #        root         /usr/share/nginx/html; # #        ssl_certificate "/etc/pki/nginx/server.crt"; #        ssl_certificate_key "/etc/pki/nginx/private/server.key"; #        ssl_session_cache shared:SSL:1m; #        ssl_session_timeout  10m; #        ssl_ciphers HIGH:!aNULL:!MD5; #        ssl_prefer_server_ciphers on; # #        # Load configuration files for the default server block. #        include /etc/nginx/default.d/*.conf; # #        location / { #        } # #        error_page 404 /404.html; #            location = /40x.html { #        } # #        error_page 500 502 503 504 /50x.html; #            location = /50x.html { #        } #    }        server {     if ($host = companion.mywebsite.com) {         return 301 https://$host$request_uri;     } # managed by Certbot           listen       80 default_server;         listen       [::]:80 default_server;         server_name  companion.mywebsite.com;     return 404; # managed by Certbot   }}


How to keep website's footer at the bottom

I'm making a website and after it's main content I want to have a nice footer at the bottom. My problem is, that due to dynamically loaded content, I can not predict how long it will be. So If I just put a div with my footer at the end of a body it could get awkwardly in the middle of page if the content is short. On the other hand I've tried using bootstrap's .fixed-bottom but it overlaps my content if it is long. I would not like having some script that checks how long my page is and dynamically alternating the position of my footer. Is there a nice simple solution to my problem? Preferably using bootstrap or simple custom css.


Could we have the ability to flag a question as "answers are out of date"?

I've often come across very popular questions (usually on Stack Overflow) whose answers date back as far as 2008, even though the question is still relevant today as 2019 approaches.  It has often frustrated me that there isn't a way to re-open a question for updated answers short of placing a bounty on it, which I feel isn't really the right user action for the situation in question.  I don't think users should have to use up their own reputation just to keep site content updated and relevant. On some level that effectively disincentives people from improving site quality. It also means users without a lot of reputation points can't do it.  Similarly, "flagging" the question doesn't really fit either, at least with the current flagging options: it's not a problem question (neither spam nor abuse) and it doesn't need moderator intervention.  It would be nice to be able to nominate a question for updated answers. I think all users should be able to do this, although of course there would need to be some sort of constraint so that every person stopping by doesn't demand an update to a 6-month old question just because they aren't happy with current answers.  I would personally suggest the following properties and constraints as a starting point:   only possible on questions that are more than two years old. Ideally this value would vary depending on the age of the subject matter in question, but that's probably not realistic to do on a tag-by-tag basis. any user could nominate the question for updating, and it would be placed into the Review Queue for other users to verify before approving. users with sufficient number of reputation points should be able to by-pass the review queue for this. once approved, the question should be essentially re-opened and appear in the question queue as normal. the authors of previous answers to the question perhaps should receive a notification informing them of the event and inviting them to update their answers. the author of the question should be invited to select a new answer after a suitable period of time has passed. existing answers should be initially marked with a banner noting that they may be out-of-date, to draw users' attention to the fact that the number of upvotes may no longer accurately imply quality or relevance. This would go away if the answer were edited, although on some level I have to question the idea of an answer keeping its upvotes when its content has changed.  But that's how the site has always worked, so perhaps there could be some sort of versioning system for answers, some way of indicating that X% of an answer's upvotes preceded its major content update.


Let $f$ be holomorphic on $\overline{N(0,1)}$. Suppose $|f(z)| \leq 1$ for every $|z| = 1$. Without using fixed point theorem, show that there exists $z \in \overline{N(0,1)}$ such that $f(z) = z$.  My attempt:  Using Rouché's Theorem, I managed to show that if $|f(z)| < 1$ for every $|z| = 1$, then there is a unique $z$ such that $f(z) = z$.  However, I am not sure how I should proceed if $|f(z)| = 1$ for some $|z| = 1$.


Product of compact and closed in topological group is closed

This could be classified as "homework", but I tried to solve this, made research online, and still failed, so I'll be glad to get some hints.  Let $G$ be a topological group, let $A$ be a compact subset of $G$, and let $B$ be a closed subset of $G$. Prove that $AB$ is closed.  If both $A$ and $B$ are not compact, but closed, this can fail, for example, if we let $A$ be the set of integers and $B$ the set of integer multiples of $\pi$, then both are closed, but $A+B$ is a proper dense subset of $\mathbb R$, so can't be closed. Also if $A$ is compact but $B$ is not closed, this easily fails.  Thanks


proof $a$ ,$b$ and $c$ can be sides of a triangle

$a$,$b$ and $c$ are three number such that:  $(a^2+b^2+c^2)^2>2(a^4+b^4+c^4)$  proof that $a$,$b$ and $c$ can be sides of a triangle.  My Attempt: I have tried to make this unequal simpler but nothing happened maybe we don't have to make it simpler.I don't know but should we prove the triangle sides unequal for all of them?finally I can't know what should I do with this unequal.


I am a physics enthusiast and came upon an article regarding time crystals and didn't understand many things.  What exactly are ? and what sets them apart from Normal crystals?


I have some issues with the bibliography, it was working on my document, until one day it disappeared actually I had a problem with the numbering the mentionning was not in the right order, I wanted to fix this and I end up with nothing xD. So this is how I do I begin with these lines \usepackage[backend=biber,maxnames=12,style=numeric,sorting=ydnt,defernumbers=true]{biblatex} \addbibresource{lib.bib}  of course lib.bib is in the same folder and to print the bib I simply use \printbibliography.


Why does StringBuilder access appear to be synchronized?

I wanted to know the difference between StringBuilder & StringBuffer classes and thier practical use. So,I wrote 2 code snippets in which I spawn 3 threads simultaneously which make use of StringBuilder & StringBuffer objects.  When I run the code, i expect all the 3 threads to run simultaneously in case of StringBuilder & in synchronized manner in case of StringBuffer. But in BOTH the cases, they run in synchronized manner.  then what is the use of StringBuffer class?:confused:   (In case of String objects, all the 3 threads run simultaneeously). I will share the code snippets for your reference. Please also correct me if I'm wrong in understanding the concept of multi-threading itself. And please, also correct the code.  // StringBuilder...  public class MultiTread implements Runnable{ private StringBuilder name; public MultiTread(StringBuilder string){ name=string; }  public void run(){ for(int i=0; i<=10; i++){ System.out.println(name.append(i)); } } public static void main(String[] args){ Thread th = new Thread(new MultiTread(new StringBuilder("thread1:"))); Thread th1 = new Thread(new MultiTread(new StringBuilder("thread2:"))); Thread th2 = new Thread(new MultiTread(new StringBuilder("thread3:")));  th.start(); th1.start(); th2.start(); } }  ..................  //StringBuffer...  public class MultiTreadBuf implements Runnable{ private StringBuffer name; public MultiTreadBuf(StringBuffer string){ name=string; }  public void run(){ for(int i=0; i<=10; i++){ System.out.println(name.append(i)); } } public static void main(String[] args){ Thread th = new Thread(new MultiTreadBuf(new StringBuffer("thread1:"))); Thread th1 = new Thread(new MultiTreadBuf(new StringBuffer("thread2:"))); Thread th2 = new Thread(new MultiTreadBuf(new StringBuffer("thread3:")));  th.start(); th1.start(); th2.start(); } }  ........  //String....  public class MuiltiTreadStr implements Runnable{ private String name; public MuiltiTreadStr(String string){ name=string; }  public void run(){ for(int i=0; i<=10; i++){ System.out.println(name+i); } } public static void main(String[] args){ System.out.println("main begins..."); Thread th = new Thread(new MuiltiTreadStr("thread1:")); Thread th1 = new Thread(new MuiltiTreadStr("thread2:")); Thread th2 = new Thread(new MuiltiTreadStr("thread3:")); System.out.println("spawning 3 threads..."); th.start(); th1.start(); th2.start(); System.out.println("main ends..."); } }


How do i install dual boot on Computer from USB stick?

as the question says...  My disc drive is broken and wont open at all so i want install/dual boot Windows8 and Ubuntu 14.04 from USB stick , how do i acomplish this?


Could a feature be considered for the iOS app where you can set one of your "sites" as the home/landing page of the app when the application initially loads?   For example, I'd love to default mine to the Japanese Usage site, and only pull up the Feeds page or other sites when necessary.


Well, I know that this is noetherian but I don't really understand how I can get a chain of prime ideals here to find the Krull dimension and assure that it is the supremum.


How do I insert 800000 records into an MS Access table?

I need to insert 800000 records into an MS Access table. I am using Delphi 2007 and the TAdoXxxx components. The table contains some integer fields, one float field and one text field with only one character. There is a primary key on one of the integer fields (which is not autoinc) and two indexes on another integer and the float field.  Inserting the data using AdoTable.AppendRecord(...) takes > 10 Minutes which is not acceptable since this is done every time the user starts using a new database with the program. I cannot prefill the table because the data comes from another database (which is not accessible through ADO).  I managed to get down to around 1 minute by writing the records to a tab separated text file and using a tAdoCommand object to execute  insert into table (...) select * from [filename.txt] in "c:\somedir" "Text;HDR=Yes"   But I don't like the overhead of this.  There must be a better way, I think.  EDIT:  Some additional information:   MS Access was chosen because it does not need any additional installation on the target machine(s) and the whole database is contained in one file which can be easily copied. This is a single user application. The data will be inserted only once and will not change for the lifetime of the database. Though, the table contains one additional field that is used as a flag to indicate that the corresponding record in another database has been processed by the user. One minute is acceptable (up to 3 minutes would be too) and my solution works, but it seems too complicated to me, so I thought there should be an easier way to do this. Once the data has been inserted, the performance of the table is quite good. When I started planning/implementing the feature of the program working with the Access database the table was not required. It only became necessary later on, when another feature was requested by the customer. (Isn't that always the case?)   EDIT:  From all the answers I got so far, it seems that I already got the fastest method for inserting that much data into an Access table. Thanks to everybody, I appreciate your help.


What's the difference between OS version reported by uname vs. /etc/debian_version

What's the difference between the Debian versions reported by uname vs what's in the file /etc/debian_version? E.g.: user@bldsvr:~$ uname -a Linux sv-debbld-22 4.9.0-8-amd64 #1 SMP Debian 4.9.144-3.1 (2019-02-19) x86_64 GNU/Linux user@bldsvr:~$ cat /etc/debian_version 9.9


For any $a\in S_\Omega$, either it has an immediate predecessor or there is an increasing sequence in $S_\Omega$ whose l.u.b. is $a$.

Specifically I would like to show:  Let $S_\Omega$ be the minimal uncountable well-ordered set. For any $a\in S_\Omega$, either $a$ has an immediate predecessor in $S_\Omega$, or there exists an increasing sequence $a_i$ in $S_\Omega$ with $a=\sup\{a_i\}$.  The part that I don't understand is how to find such a sequence $\{a_i\}$. I understand that if $a$ does not have an immediate predecessor, then for any $x\in S_\Omega$ and $x<a$, there exists $y\in S_\Omega$ s.t. $x<y<a$. By this one can inductively find a sequence $\{a_i\}$ s.t. $a_0<a_1<\cdots$ and $a_i<a$ for all $i$. But how can one guarantee that $\sup\{a_i\}=a$ in this case?  I encountered this question while proving something else (Munkres Topology, 2/e p.159 12(c)).


I'm building an outdoor bbq and have a 20A circuit with 2 runs - 1 for outlets and 1 for lights. The outlets are done with 20A receptacles and 12 ga wire inside 1/2" emc.  The lights will be hanging pull lights (16 ga wire in the cord) and because it's a little cheaper and easier, I wanted to get power to the fixtures by 14 ga wire, also in 1/2" emc.  Is this a no-no? The only thing on this run would be 5 lights, so very low load.


Because I am using Google Forms to collect data the source of data is not what I want so I need to create a tab and transform the data.  Here is an example of the Google Sheets (Exported from Google Forms):  Group Leader    Groupmate  Gender  Groupmate  Gender  Groupmate  Gender Leader 1        John       M       Mary       F       Linda      F Leader 2        KK         F       Johanna    F Leader 3        Rick       M   As you can see each row has a different number of Groupmates. I would like to transform the table into:  Group Leader    Groupmate  Gender Leader 1        John       M      Leader 1        Mary       F Leader 1        Linda      F Leader 2        KK         F Leader 2        Johanna    F Leader 3        Rick       M   I believe Groupmate name is sort of unique so I think it is possible to merge several columns and then lookup the leader name by index-match.


Real-life examples of common distributions

I am a grad student developing an interest for statistics. I like the material over-all, but I sometimes have a hard time thinking about applications to real life. Specifically, my question is about commonly used statistical distributions (normal - beta- gamma etc.). I guess for some cases I get the particular properties that make the distribution quite nice - memoryless property of exponential for example. But for many other cases, I don't have an intuition about both the importance and application areas of the common distributions that we see in textbooks.   There are probably a lot of good sources addressing my concerns, I would be glad if you could share those. I would be a lot more motivated into the material if I could associate it with real-life examples.


Error: command \DH unavailable in encoding T5. \end{frame}

When I compile my beamer it says that I have some problem with \end{frame} (like the photo I up here) but I don't know why. I still compile my beamer well last hour, but now I can't compile it anymore. Please help me. Thank you.


Theorem. Let $f\colon I \to J$, where $I$ is an interval and $J$ is the image $f(I)$, be a function such that:   $f$ is strictly increasing on $I$. $f$ is continuous on $I$.   Then $J$ is an interval, and $f$ has an inverse function $f^{-1}\colon J\to I$ such that:   $f^{-1}$ is strictly increasing on $J$. $f^{-1}$ is continuous on $J$.   I need to prove only that $f^{-1}$ is continuous on $J$.  Proof. Let $y\in J$, and (for simplicity) assume that $y$ is not an end-point of $J$. Then $y=f(x)$, for some $x\in I$, and we want to prove that $$y_n\to y\implies f^{-1}(y_n)\to f^{-1}(y)=x.$$ Thus we want to deduce that for each $\varepsilon>0$, there is some number $X$ such that $$x-\varepsilon<f^{-1}(y_n)<x+\varepsilon\qquad \forall n>X\qquad(1).$$ Since $f$ is strictly increasing, we know that $$f(x-\varepsilon)<f(x)<f(x+\varepsilon).$$ also, since $y_n\to y=f(x)$, there is some number $X$ such that $$f(x-\varepsilon)<y_n<f(x+\varepsilon), \qquad\forall n>X.$$ Then, applying the strictly increasing function $f^{-1}$ to these inequalities, we obtain (1).  Edit  I don't understand why, since $y_n\to y=f(x)$, there is some number $X$ such that  $$f(x-\varepsilon)<y_n<f(x+\varepsilon), \qquad\forall n>X.$$ I would have written the last line as follows: $$f(x)-\varepsilon<y_n<f(x)+\varepsilon, \qquad\forall n>X.$$ Applying the $f^{-1}$ to my last line, which I think it's correct, I obtain $$f^{-1}[f(x)-\varepsilon]<f^{-1}[y_n]<f^{-1}[f(x)+\varepsilon], \qquad\forall n>X.$$ which is not (1).  What am I misunderstanding? Why the author of this proof wrote that last line and not my version?  Thank you.


Lie algebra of a semi-direct product of Lie groups

Let $G$ and $H$ be Lie groups with Lie algebras $\mathfrak{g}$ and $\mathfrak{h}$ and suppose $G$ acts on $H$ by automorphisms, i.e. there exists a Lie group homomorphism $\phi:G\to Aut(H)$. Consider the semidirect product $G\ltimes H$, which is again a Lie Group. Is its Lie algebra the semidirect product Lie algebra of $\mathfrak{g}$ and $\mathfrak{h}$?


question about the proof about the square root of natural numbers

Could someone please help me to prove that for $t \in \mathbb{N}$ , $\sqrt{t} \in \mathbb{Q} $ if only if  $\sqrt{t} \in \mathbb{N}$


$\gcd\left(\binom{n}{k},n\right)>1$ for nontrivial values?

Is the following conjecture true?     Given an $n>1$ and a $k$ such that $0<k<n$ then $\gcd\left(\binom{n}{k}, n\right)>1$   This was a question asked in my old Number Theory course that I recently remembered. It was posed after we learned that $p\mid\binom{p}{k}$ for $0<k<p$. We never resolved it either way. I expect it to be true and have an elegant answer, but I haven't been able to prove it.


Extending my travel to the USA under VWP

I am an Australian citizen currently staying with friends in America on the VWP and I would like to stay a little longer. This will take me over the 90 days allowed and I'm wondering if I leave the country and go to Canada/cross a border, come back and stay with them for another 5-6 weeks.


Change permission for home directory on debian

My Debian machine is running DirectAdmin and we have build our own CMS. By now, when we create a new website a new folder and user will created down the /home/ directory.  As an developer to setup templates for each customer we need to be in the user directory. For now It's way to complicated cause for each customer you need to take that ftp account. Way to complicated if there are more than 100 customers.  To make things easier, I've created one ftp account 'developer' this account should be able to access /home/ directory. For Now I have a permission denied to access the directory maps. Of course, the /home/ directory is owned by 'root'  My question is, what is the best way to make a permission / group change for the directory /home/ so the ftp account 'developer' has access to all the websites in this directory.  Thanks Nick


Do i need to thaw meat before cooking in pressure cooker

Do I have to have meat thawed before putting it in my pressure cooker.


How to best configure PHP to handle a UTF-8 website

What extensions would you recommend and how should php be best configured to create a website that uses utf-8 encoding for everything. eg...   Page output is utf-8 forms submit data encoded in utf-8 internal processing of string data (eg when talking to a database) are all in utf-8 as well.   It seems that php does not really cope well with multibyte character sets at the moment. So far I have worked out that  looks like an important extension.  Is it worth the hassle..?


Why do we use F for failing on an otherwise arbitrary alphabetic grading scale? Isn't E just as meaningful for failing as A is for excellent?  I'm more interested in a response on the history of how the current scale came to be.  (Edit: prompted from the comments below, I am asking about this situation within the context of the American grading system.)


Skipping acquire of configured file 'main/binary-i386/Packages' as repository 'xxx' doesn't support architecture 'i386'

Getting below error message while issuing :  sudo apt-get update  Get:1 http://us.archive.ubuntu.com/ubuntu xenial InRelease [95.8 kB] Ign:2 http://repo.mongodb.org/apt/debian wheezy/mongodb-org/3.2 InRelease                                                                                Ign:3 http://dl.google.com/linux/chrome/deb stable InRelease                                                                                Hit:4 http://ppa.launchpad.net/canonical-x/vulkan/ubuntu xenial InRelease                                                                                Hit:5 http://repo.mongodb.org/apt/debian wheezy/mongodb-org/3.2 Release                                                                             Hit:6 http://us.archive.ubuntu.com/ubuntu xenial-security InRelease                                                   Ign:7 http://dl.google.com/linux/talkplugin/deb stable InRelease                                                      Hit:8 http://us.archive.ubuntu.com/ubuntu xenial-updates InRelease                                                    Ign:9 http://linux.dropbox.com/ubuntu wily InRelease                                            Hit:10 http://ppa.launchpad.net/numix/ppa/ubuntu xenial InRelease                               Get:12 http://dl.google.com/linux/chrome/deb stable Release [782 B]       Hit:13 http://dl.google.com/linux/talkplugin/deb stable Release                   Ign:14 https://apt.dockerproject.org/repo ubuntu-wily InRelease           Hit:15 https://apt.dockerproject.org/repo ubuntu-wily Release             Get:16 http://dl.google.com/linux/chrome/deb stable Release.gpg [181 B]   Hit:17 http://linux.dropbox.com/ubuntu wily Release                                   Get:20 http://dl.google.com/linux/chrome/deb stable/main amd64 Packages [1,191 B] Fetched 98.0 kB in 0s (118 kB/s)                                  Reading package lists... Done N: Skipping acquire of configured file 'main/binary-i386/Packages' as repository 'http://dl.google.com/linux/chrome/deb stable InRelease' doesn't support architecture 'i386'   This cuts across various releases of ubuntu


Why i am getting null pointer exception for inserting at the end of node?

I am solving linked list question on geeksforgeeks platform and i was given a question, i will mention the link to check it. I am getting nullpointer expection for this. link:-  Code:-  Node insertAtBeginning(Node head, int x) {     // code here     Node inserting = new Node(x);     inserting.next = head;     return inserting; }  // Should insert a node at the end Node insertAtEnd(Node head, int x) {     // code here     Node first = head;     while(head.next != null){         head = head.next;     }     Node inserting = new Node(x);     head.next = inserting;     return first;      }


If A is closed in B, and B closed in C, what happens with A in C?

If A is a closed subset of B, and B is a closed subset of C, does this imply that A is closed in C?


Machine Learning: Missing Data in Dataset and Imputer

I am a newbie in ML, and I am learning how to fill missing data in a dataset using Imputer. These are the few lines of code that I came across  from sklearn.preprocessing import Imputer imputer = Imputer(missing_values = 'NaN', strategy = 'mean', axis = 0) imputer = imputer.fit(X[:, 1:3]) X[:, 1:3] = imputer.transform(X[:, 1:3])   Now I am not able to understand what is the role of the fit and the transform function. It will be great if someone can help. Thank you.


I'm looking for a command that starts verbose terminal version of what can I see after clicking Upgrade in update manager:    What command(s) can do that?


Let $1,2,3,4,5,6,7,8,9,11,12,\cdots$ be the sequence of all the positive integers which do not contain the digit zero. Write $\{a_n\}$ for this sequence. By comparing with a geometric series, show that  $$\sum_n \frac{1}{a_n}\lt90$$  I would try to start this but summing the geometric series is trivial, so the point lies in finding such a series(or a set of series)  This looks really amazing to me since this is just the harmonic series, with (apparently) a small fraction of the terms removed, and yet it converges.


I have a PC Dual Core with 4 GB ram. Which version can i install? It must be near the latest and support Windows XP. Please have a link to download. I tried with the lower version 2.75 & 2.76. I have installed with giving error and when i want to uninstall its giving error   The installer has encountered an unexpected error installing this package. this may indicate a problem with the package. The error code is 2753.  How can i proceed. Im stuck in the way.


Word or phrase for a situation when your intention is to save something but end up in loss

I don't know what this situation is called when we end up in loss but intention was to save/protect. Example:  I am trying to improve something but made it worse I am trying to fix a thing and broken other


I am having an issue with EXR file export that I did not encounter in previous versions of Blender. I used to be able to render a render layer with all its passes and get all the passes included with the render layer with the EXR export; the problem I am finding now is that I am not able to "pack" the passes with the EXR file (see graphic below). I am working with "standard" EXR, as I understand that the EXR multilayer is for multiple file handling (packing all the image files into a single container), but I may be wrong.    In the screenshot, the graphic is an EXR saved from the rendered layer; you can see in the screenshot how the "extra" passes from the render layer has been ignored by the graphic and only shows the standard image, z and alpha passes. I found this issue for the first time with Blender 2.71; and maybe with Cycles; in the past I have never had an issue with EXR export.  Am I missing something? I hope EXRs still work with Blender, I wouldn't know how to composite without such invaluable aid. Sorry if this question has already been answered somewhere; I have really searched the site for information on EXR but I could not find an answer to my issue.


I am using ubuntu 12.10 and today after i updated my software, when the computer restarted, the icons and menu bars on the desktop did not show. The a icons on the desktop itself still showed but nothing else (no launcer buttons, no time, nothing).  Im not sure exactly what caused this. I could not find anything anywhere else. I tried the compiz ccsm unity thing but to no avail. It tells me that unity is running. I tried to unity --reset but I just get told that it is deprecated. Im not sure what to do.


How can I remove a suggestion from the Chrome address bar?

I've got a couple of URL autocomplete suggestions where Chrome suggests the wrong URL consistently.   How can I delete the incorrect entry from the address bar's suggestion list? The page I want shows up too but it's never the first result.


Expected value of a Poisson variable conditioned on sum

Setting  $$X_1 \overset{d}{\sim} \operatorname{Poisson}(\alpha_1)$$ $$X_2 \overset{d}{\sim} \operatorname{Poisson}(\alpha_2)$$ $$S = X_1 + X_2$$  Find $E[X_1 | S =n]$  My argument is that since $X_1 + X_2 = n$, $X_1$ range from $0$ to $n$ only, thus the expected value is   $$E[X_1 | S= n] = \sum_{k=1}^n k \Pr\{X_1 =k | S = n\}$$  where   $$\Pr\{X_1=k | S = n\} = \sum_{k=0}^{n} \frac{e^{-\alpha_1} \alpha_1^k}{k!}$$  Please argue for or against it?  Additionally, how would you evaluate such a series on the condition that it's correct?


Where can I find legendary crafting materials?

My boulder barbarian would love some Reaper's Wraps but they require . I've found various other crafting plans that require legendary materials.  Where can I find Reaper's Fear and other legendary crafting materials? Are there places to farm these materials or is it all luck of the draw?


I've recently upgraded to a 64-bit machine (Kubuntu 12.04.02 AMD64) and in trying to assemble the list of things to compile some things I get conflicts. In trying to install lib64readline6 or lib64readline6-dev I get:  The following packages have unmet dependencies:  lib64readline6:i386 : Depends: lib64tinfo5:i386 but it is not going to be installed                        Depends: libc6-amd64:i386 (>= 2.11) but it is not going to be installed   I variously also try to include libc6-i386 (32 bit library for AMD64) as well as other combinations of things but I still get the conflicts.


Differences between mobile and console versions of Terraria?

i know a lot of differences between pc and console version but i dont know any difference between mobile and xbox360/ps3. is there any difference?


Where I can learn Science as a whole? From nothing to relativity, thermodynamics, to quantum

I'm a Computer Science Engineer, and I live in India. I'm taking interests in Physics and Science, and I am much more curious about it. But I don't know where to start and where to finish (although I know Science can never be learned as whole).   I am gonna learn Science either way, if I get the resources at one place and organised as step by step it would save some time for me but if not I will only take more time but I will learn.  So, If any one's know where I can find such resources please answer.


I'm looking for a short story about a couple of aliens soldiers/guards watching an empty spot in space.  Early human space explorers come across them at their remote outpost.  The humans are told that in this empty spot was a civilization that was so war like and destructive that the other aliens agreed to supernova their star to kill them all and to kill every last one that escaped and turned up elsewhere in space.  ... and they look just like these human explorers that dropped in.


Does significance in correlations matter when I have data for the population?

I am investigating factors that influence how certain areas have intensified over time in a city. There are twenty five areas which represent all of these types of area in the city.  I am using Spearman correlations to determine if there is a relationship between scores for their degree of intensification between two date ranges, and a range of possible explanatory variables.  Do statistical significance levels (p-values) have any meaning in this instance? As my "sample" is actually the population, wouldn't the observed sample correlations equal the actual relationship?  I am hoping to use the strength of the relationships to determine which factors are the most important.


What is the name of the following symbol and how to type it in LATEX?  Thanks!


Flag dialogue loading animation appears on each click

When clicking on flag multiple times, it shows a new animation for each time we clicked on the flagging link.   This mostly happens with a slow internet connection when we click multiple time to open it when it was already loading.  Know it wasn't a big issue and don't know whether it was reported earlier, but I can't find it on my search. So just reporting it.


Why my 2 computers cannot ping one another?:

I have 2 computers connected to the same router. Ip config of one says    Connection-specific DNS Suffix  . : www.tendawifi.com    Link-local IPv6 Address . . . . . : fe80::3804:2d04:a591:7142%6    IPv4 Address. . . . . . . . . . . : 192.168.0.108    Subnet Mask . . . . . . . . . . . : 255.255.255.0    Default Gateway . . . . . . . . . : 192.168.0.1   Ipconfig of another is similar except that it's 192.168.0.106  C:\Users\vbcbu>ping 192.168.0.106  Pinging 192.168.0.106 with 32 bytes of data: Request timed out. Request timed out. Request timed out. Request timed out.  Ping statistics for 192.168.0.106:     Packets: Sent = 4, Received = 0, Lost = 4 (100% loss),  C:\Users\vbcbu>  They're connected to the same router.   Why can't they ping each other? I can however, ping my android phone C:\Users\vbcbu>ping 192.168.0.103  Pinging 192.168.0.103 with 32 bytes of data: Reply from 192.168.0.103: bytes=32 time=212ms TTL=64 Reply from 192.168.0.103: bytes=32 time=100ms TTL=64 Reply from 192.168.0.103: bytes=32 time=61ms TTL=64 Reply from 192.168.0.103: bytes=32 time=134ms TTL=64  Ping statistics for 192.168.0.103:     Packets: Sent = 4, Received = 4, Lost = 0 (0% loss), Approximate round trip times in milli-seconds:     Minimum = 61ms, Maximum = 212ms, Average = 126ms  This is tracert result Tracing route to DESKTOP-MNQO6R4 [192.168.0.106] over a maximum of 30 hops:    1     *        *        *     Request timed out.   2     *        *        *     Request timed out.   3     *        *        *     Request timed out.   4     *        *        *     Request timed out.   5     *        *        *     Request timed out.   6     *        *        *     Request timed out.   7     *        *        *     Request timed out.   8     *        *        *     Request timed out.   9     *        *        *     Request timed out.  10     *        *        *     Request timed out.  I can ping gateway C:\Users\vbcbu>ping 192.168.0.1  Pinging 192.168.0.1 with 32 bytes of data: Reply from 192.168.0.1: bytes=32 time=5ms TTL=64 Reply from 192.168.0.1: bytes=32 time=6ms TTL=64 Reply from 192.168.0.1: bytes=32 time=12ms TTL=64 Reply from 192.168.0.1: bytes=32 time=4ms TTL=64  Ping statistics for 192.168.0.1:     Packets: Sent = 4, Received = 4, Lost = 0 (0% loss), Approximate round trip times in milli-seconds:     Minimum = 4ms, Maximum = 12ms, Average = 6ms  C:\Users\vbcbu>  I can do this from both computers


Increase ext4 partition size by decreasing Swap memory size in linux

I was a newbie while installing linux mint 17.2 in my laptop. So I allocated more than 20GB for my swap memory and 30Gb for ext4 partition. Now only I realized that swap memory is using instead of RAM while running memory overwhelming applications.I have 4GB of DDR3 RAM so no need of this much of swap memory.So I want to add some memory space from swap to Ext4. Is there any idea for deleting or decreasing the swap memory and add that memory to EXT4 partition? The details of my hard disk given bellow .I'm using Linux mint 17.2 64 bit and windows 8 pro with media center 64 bit in dual boot.   $parted GNU Parted 2.3 Using /dev/sda Welcome to GNU Parted! Type 'help' to view a list of commands. (parted) print                                                             Model: ATA Hitachi HTS54757 (scsi) Disk /dev/sda: 750GB Sector size (logical/physical): 512B/4096B Partition Table: msdos  Number  Start   End    Size    Type      File system     Flags 1      1049kB  106MB  105MB   primary   ntfs            boot 2      106MB   210GB  210GB   primary   ntfs 3      210GB   421GB  211GB   primary   ntfs 4      421GB   750GB  329GB   extended                  lba 7      421GB   451GB  30.0GB  logical   ext4 8      451GB   473GB  22.4GB  logical   linux-swap(v1) 5      473GB   579GB  106GB   logical   ntfs 6      579GB   750GB  171GB   logical   ntfs  (parted)     If the solution will not effect my windows files then let me know the solution. Actually I found some solutions but most of them are suggesting 'GParted ISO '.


I am wondering how I would set up parental controls on my personal computer. This should allow blocking of all adult websites and should enforce safe search. I am aware DansGuardian and Squid but will they work on a personal laptop, without using a service such as pfsense?


caption and longtable forcing text out of margin

Consider this example \documentclass{report} \usepackage{graphicx} \usepackage{caption} \usepackage{longtable} \usepackage{lipsum}  \begin{document}  \begin{figure}[htbp]   \centering   \includegraphics[width=0.6\textwidth]{example-image-a}   \caption{Caption.} \end{figure}  \lipsum[1]   \begin{figure}[htbp]   \centering   \includegraphics[width=0.8\textwidth]{example-image-b}   \caption{Another caption.} \end{figure}  \lipsum[1-3]  \begin{longtable}{rrc}         A & B & C\\         A & B & C\\         A & B & C\\         A & B & C\\         A & B & C\\         A & B & C\\         A & B & C\\ \end{longtable} %% \begin{table}                                                                                %% \begin{tabular}{rrc}                                                                                %%         A & B & C\\                                                                                %%         A & B & C\\                                                                                %%         A & B & C\\                                                                                %%         A & B & C\\                                                                                %%         A & B & C\\                                                                                %%         A & B & C\\                                                                                %%         A & B & C\\                                                                                %% \end{tabular}                                                                                %% \end{table}                                                                                \lipsum[1] \end{document}  In the output at the end of document text is forced out of margin, as seen by the text being forced onto the page number:  Curiously, the problem disappears if a tabular is used in place of longtable or if I comment out the captions of the figures. What is wrong?


Is there any limit for asking questions?

I have a problem on asking a Question   Oops! Your question couldn't be submitted because:     * Sorry, we are no longer accepting questions from this account.  I have asked 11 questions till now in StackOverflow...


Inside TestNG test method, I am using this.getClass().getEnclosingMethod().getName() to get the current method name but it gives failure exception as  java.lang.NullPointerException  I am unsure, what would be the problem?  Assert.assertEquals(this.getClass().getEnclosingMethod().getName(), testcaseName);


Overloading operator== With a Free Function That Takes Templated Iterators

So I am trying to create a function that compares two iterators, but I am unsure how to appropriately use the templates. The class  template<typename Key_T, typename Mapped_T> class Map{...}   The free function  bool operator==(const Map::Iterator &iter1, const Map::Iterator &iter2) { return (*(iter1.ref->key) == *(iter2.ref->key)) ? true : false; }   I get this error  error: invalid use of template-name ‘cs540::Map’ without an argument list   Then I tried this   template<typename Key_T, typename Mapped_T> bool operator==(const Map<Key_T,Mapped_T>::Iterator &iter1, const Map<Key_T,Mapped_T>::Iterator &iter2) {...}   and I get this error  error: need ‘typename’ before ‘cs540::Map<Key_T,  Mapped_T>::Iterator’ because ‘cs540::Map<Key_T, Mapped_T>’ is a dependent scope


How do I prevent workspace switching with multiple windows in gnome 3?

For example, I have windows of my browser open, I want one to be open in one workspace and one in another. In the dock it shows multiple windows open, and when I click it it switches me to the other workspace where the other window is. Is there any way I can prevent it switching workspaces like this, and just show the windows open in my current workspace?


Consistent difference between network profile reputation and reputation in the site header

My  shows this: . The header of the Movies and TV site shows this:  This difference has persisted for well over 6 months. I reported it back in August 2012 (where the numbers were 833 and 941, respectively. Consensus at that time was that it was a caching issue. I think the duration of the difference shows that there really is a mismatch somewhere. For me the rep (either way) is not an important issue, but if this reveals a bug somewhere it's at least good to know it exists, I guess. Edit Two day after rep recalculation as suggested by JoachimSauer below: no difference (other sites' statistics are updated).


I opened my onion rack lately to find onions that had sprouted several-inch-long green roots... It made me extremely queasy and I threw them out. But I was wondering - would it be safe to eat them / cook with them?


When a particle keeps "accelerating" near the speed of light, is the energy gained expressed in linearly gained impulse, or relativistic mass?


Prove that $\mathbb{Z}[i]/\langle 1+i \rangle \cong \mathbb{Z}/2\mathbb{Z}$

Prove that: $\mathbb{Z}[i]/\langle 1+i \rangle \cong \mathbb{Z}/2\mathbb{Z}$.   This is my first time using the First Isomorphism Theorem for Rings and I am looking for feedback for whether some steps in this proof could have been done better. From my understanding, I need to:   Define a surjective homomorphism $\phi$ between $\mathbb{Z}[i]$ and $\mathbb{Z}/2\mathbb{Z}$. Show that $\ker(\phi) = \langle 1+i \rangle$.     Define $\phi: \mathbb{Z}[i] \to \mathbb{Z}/2\mathbb{Z}$ by $\phi(a+bi)=[a+b]_2$.   $\boldsymbol {\phi}  \textbf{ is surjective:}$  Given $a+bi$, we have $a,b \in \mathbb{Z}$. So take $b$ to be $0$, then we have $\phi (a+0i)=[a]_2$, and clearly we can get $0$ and $1$.  $\boldsymbol{\phi} \textbf{ is a homomorphism:} $  $$\begin{align} \phi((a+bi)+(c+di)) &=\phi((a+c)+(b+d)i) \\ &=[(a+c)+(b+d)]_2+[c+d]_2 \\ &=[(a+b)+(c+d)]_2 \\ & =[a+b]_2+[c+d]_2 \\ &= \phi(a+bi)+\phi(c+di).\end{align}$$  $$\begin{align} \phi((a+bi)(c+di)) &= \phi((ac-bd)+(ad+bc)i) \\ &=[(ac-bd)+(ad+bc)]_2 \\ &=[(ac+bd)+(ad+bc)]_2 \\ &=[(a+b)(c+d)]_2 \\ &=[a+b]_2[c+d]_2 \\ &=\phi(a+bi)\phi(c+di). \end{align}$$  $\boldsymbol{\ker(\phi)=\langle 1+i \rangle}$:  We have that $\ker(\phi) = \{ (a+bi) \in \mathbb{Z}[i]: \phi(a+bi) =[a+b]_2 =[0]_2\}$.  From my understanding, elements in $\langle 1+i \rangle$ are just of the type $(1+i)(c+di)$ where $c,d \in \mathbb{Z}$.   I've tried to show that one is a subset of the other. Another idea I have is in noting that $[a+b]_2=[0]_2 \iff 2|(a+b)-0$ and somehow link it to showing that these are the same elements in $\langle 1+i \rangle$, but I could not do it. I have not managed to come up with a reasonable proof in any of these approaches. How does one actually show this?


Distributive law of greatest common divisors.

I have seen someone use a distributive law of gcds but I was wondering if anybody could prove that as I am having a little trouble going about this.


Do not show the score for users during primaries

I believe that showing the post score for nomination posts during primaries is a bad idea.  When I loaded the primaries page during the election, the first thing I saw was a post voted -1. This immediately colored my impression of the post. Reading his post didn't indeed make me wish he was a moderator, but at the same point I couldn't bring myself to click on the down arrow. He wasn't an awesome candidate, but he wasn't a -2 score candidate either. Actually, I kinda wanted to sympathy upvote instead.  I want to judge by myself whether a candidate is worth or not my +1. For some of those people I don't have an opinion already, and I want to form one on my own. I don't want game theory to kick in, I don't want to be tricked into sympathy upvotes.  Having those numbers in large print as the first thing I see about them honestly prevents me from doing so. I'd rather have their avatar there.     Some people on chat do not agree with me;  I imagine they'll post explaining why I want to be aware of their opinion while forming my own.      Regardless of the discussion here, if you do prefer to hide the scores as you vote, here's the jQuery oneliner that does just that:  $(".vote-count-post").hide()


How to check if a specific index of an array contain a value java

say I had an array (Hello,1,2,HI,1,2)  How would I check if index 1 was = to 'Hello' is a very simple question, but cannot find an answer.  This is what I have tried,it is inside a for loop, my array is of type string:    if(array[i] == "Hello" ){   // do something    }


Standard green glass reflection and absorption rates by wavelength

Is there any exact data on reflection and absorption rates based on wavelength for the common green glass materials ?  I know the rate itself is dependent of the angle, the exact composition of the glass, and for the green glass averages at about 8%, but that is for the full spectrum of light.   I am interested in specific rates at different wavelengths: IR, Red, Yellow, Green, Cyan, Blue, Purple, and the UVs. As example, let's assume the standard green glass would reflect 15% green and 3% of blue light -- those are the things of interest.  I cannot currently test this for myself. Is there any research data on this ?


Are stationary states always real functions?

I've noticed that for many quantum potentials, (the harmonic oscillator, the infinite square well, and the delta potential) the wavefunctions $\psi_n$ of stationary states are always real valued functions.    I couldn't explain this with observable-based arguments since only the probability distribution $\psi_n \psi_n^*$ is observable, which leaves open the possibility of complex wave-functions which nevertheless have real probability distributions.  So, is it a general principle that the wavefunctions associated with stationary states are real-valued? If so, why?  If not, are there any simple examples of potentials where this does not hold?


How do I store two numbers inside another number

Let the Given Number be 'K'. I need to store a,b numbers inside K. After some modification I need to get both numbers.


Attempt to Upgrade is failing due to unstable mfc6490cwlpr:i386

I am attempting to upgrade to the most recent Ubuntu OS but i am being stopped with warning that mfc6490cwlpr:i386 is in a very bad inconsistent state. the warning suggests that I should reinstall before I remove this pkg.  The following is my attempt to do so.  dpkg: warning: overriding problem because --force enabled:  Package is in a very bad inconsistent state - you should  reinstall it before attempting a removal. (Reading database ... 284218 files and directories currently installed.) Removing mfc6490cwlpr:i386 ... start: Unknown job: lpd dpkg: error processing mfc6490cwlpr:i386 (--remove):  subprocess installed post-removal script returned error exit status 1 Errors were encountered while processing:  mfc6490cwlpr:i386 me@mycomp-Studio-1737:~$ ^C kingston@kingston-Studio-1737:~$ sudo dpkg --configure -a [sudo] password for ME:  dpkg: dependency problems prevent configuration of mfc6490cwcupswrapper:i386:  mfc6490cwcupswrapper:i386 depends on mfc6490cwlpr; however:   Package mfc6490cwlpr:i386 is not installed. dpkg: error processing mfc6490cwcupswrapper:i386 (--configure):  dependency problems - leaving unconfigured Errors were encountered while processing:  mfc6490cwcupswrapper:i386 me@mycomp-Studio-1737:~$ sudo apt-get install mfc6490cwcupswrapper:i386 Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package mfc6490cwcupswrapper:i386   Needless to say... I have had no luck.  Can anyone guide me through this?


Why would Sauron want the one ring back? (Canon reference?)

So, question should say everything, but I'll detail what answer I'm looking for. Including the "Rings of Power" that were forged by the elves under Sauron's guidance:   3 Rings for the Elves 7 Rings for the Dwarves 9 Rings for the humans      "Three Rings for the Elven-kings under the sky,   Seven for the Dwarf-lords in their halls of stone,   Nine for Mortal Men doomed to die..."   Sauron secretly forged the One Ring for himself to control the other rings, making their total number 20, 19 of which were linked to the one ring which could control the other rings and manipulate their bearers according to the will of Sauron if used:      "...One Ring to rule them all, One Ring to find them,   One Ring to bring them all and in the darkness bind them   In the Land of Mordor where the Shadows lie."    There were other "Less Rings Of Power" made as practice by the forgers for said Rings Of Power, however, they don't play into my question.  The plan was to distribute the rings as described above and afterwards use the One Ring to gain complete control of middle earth without having to fight any of the nations because their leaders would have been under direct control of Sauron.  Apparently, not everything went as intended as:   The Elves noticed the betrayal the "Lord Of Gifts" was planning on and put the rings off their fingers and hid them in secrecy, making the race of the elves invulnerable for the original plan. Also, I've been reading that the elven rings were never touched by Sauron so I'd wonder if he really could have any influence on the elven Rings Of Power? The Dwarves, due to a) their natural hardness and b) due to the fact that from the hard dwarves, only the Lords (The hardest of the hard, so to say.) got to wear the dwarven Rings Of Power. However, Sauron noticed, that the rings wouldn't take as much effect on the dwarves as they should as they didn't even turn them invisible. Later on, a few of them were destroyed by dragons and Sauron took the remaining few back. The Humans, whilst obviously successful in transforming them into evil creatures of immense power, were no kings anymore, meaning he couldn't actually use them to rule over the humans and keep the population thinking their rightful kings were doing all these things.   This brings me to the following conclusion: All those rings we're lost the one, or taken out of effect the other way around. That's why my question is:  WHY would Sauron want the One Ring back if everything he could do with it was controlling the other Rings Of Power whilst all of those rings were lost / destroyed / hidden by their original bearers? I assume that the current Kings / Throne-keepers of the humans would not have been stupid enough to accept a fresh wave of Rings Of Power linked to the One Ring.  The only reason I could think of now was to rebuild a body which, could have taken him another years and thinking about it, I see no other reason for it, as apparently he could perfectly be everywhere and control most creatures in middle earth just with the power of his ghost. But this is not a discussion board.   I'm looking for a canon reference what exactly would have happened if he got the One Ring back.


Let's say that I have two arrays (in Java),  int[] numbers; and int[] colors;  Each ith element of numbers corresponds to its ith element in colors. Ex, numbers = {4,2,1}      colors = {0x11, 0x24, 0x01}; Means that number 4 is color 0x11, number 2 is 0x24, etc.  I want to sort the numbers array, but then still have it so each element matches up with its pair in colors.  Ex. numbers = {1,2,4};     colors = {0x01,0x24,0x11};  What's the cleanest, simplest way to do this? The arrays have a few thousand items, so being in place would be best, but not required. Would it make sense to do an Arrays.sort() and a custom comparator? Using library functions as much as possible is preferable.  Note: I know the "best" solution is to make a class for the two elements and use a custom comparator. This question is meant to ask people for the quickest way to code this. Imagine being at a programming competition, you wouldn't want to be making all these extra classes, anonymous classes for the comparator, etc. Better yet, forget Java; how would you code it in C?


How does upsampling rare events affect the interpretation of logistic regression?

The answer to this question can be found here   I have a dataset of 50k positives and nearly 1M negatives.  Instead of taking a random sample to build a logistic regression I take all 50k positives and randomly sample 50k negatives.  How should I interpret the logistic regression coefficients of the upsampled version since that sample is not actually representative of my original population?  Here is a toy example where the sampling will generate two different regression coefficients  beta = rnorm(5) X = matrix(rnorm(10000*5), nrow = 10000) y = X%*%beta + rnorm(10000) label = ifelse(y > 3, 1, 0)  X.pos = X[label == 1,] X.neg = X[label == 0,][1:sum(label),]  summary(glm(c(label[label == 1], label[label == 0][1:sum(label)]) ~ .,             data = as.data.frame(rbind(X.pos, X.neg)),             family = binomial()))  Call: glm(formula = c(label[label == 1], label[label == 0][1:sum(label)]) ~      ., family = binomial(), data = as.data.frame(rbind(X.pos,      X.neg)))  Deviance Residuals:       Min        1Q    Median        3Q       Max   -3.10121  -0.22644   0.00143   0.33291   3.01340    Coefficients:             Estimate Std. Error z value Pr(>|z|)     (Intercept)  -3.4787     0.2639 -13.184  < 2e-16 *** V1            0.8904     0.1163   7.657 1.91e-14 *** V2           -0.2319     0.1105  -2.100   0.0357 *   V3           -2.9831     0.2064 -14.456  < 2e-16 *** V4            1.3729     0.1333  10.299  < 2e-16 *** V5           -1.6344     0.1435 -11.387  < 2e-16 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  (Dispersion parameter for binomial family taken to be 1)      Null deviance: 1522.15  on 1097  degrees of freedom Residual deviance:  544.67  on 1092  degrees of freedom AIC: 556.67  Number of Fisher Scoring iterations: 7  summary(glm(label ~ .,             data = as.data.frame(X),             family = binomial()))  Call: glm(formula = label ~ ., family = binomial(), data = as.data.frame(X))  Deviance Residuals:      Min       1Q   Median       3Q      Max   -2.5939  -0.1856  -0.0701  -0.0229   3.6145    Coefficients:             Estimate Std. Error z value Pr(>|z|)     (Intercept) -5.60342    0.15260 -36.720  < 2e-16 *** V1           0.67740    0.06001  11.287  < 2e-16 *** V2          -0.27957    0.05780  -4.837 1.32e-06 *** V3          -2.32995    0.08786 -26.520  < 2e-16 *** V4           1.17757    0.06548  17.985  < 2e-16 *** V5          -1.27162    0.06675 -19.052  < 2e-16 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  (Dispersion parameter for binomial family taken to be 1)      Null deviance: 4254.0  on 9999  degrees of freedom Residual deviance: 2187.1  on 9994  degrees of freedom AIC: 2199.1  Number of Fisher Scoring iterations: 8


Buying a new bike for under $1500 - best option for hard terrain on a budget

I am upgrading my bike which is exciting but I can't spend too much. Do I sacrifice carbon for aluminum if that gives me the option to go full suspension. Do I go for a solid carbon hardtail that may sacrifice some of the trail comfort for the durability. How much of an advantage is the full suspension over hardtail if you can only buy one for $1500?


Mark an answer for a question from a deleted account

I was recently browsing through my answers and found  question where the author indicated they were able to solve their issue with a solution similar to answer I provided.  Problem is that the original author account has been deleted and they can not mark my answer as the accepted answer.  How do you handle marking the answers for questions where the original author SO account has been deleted?


How can I write explanations below tables?

I have two tables and these tables are in one page. I wrote explanations about these. Although there a lot of space, explanations cannot be located below the tables. How can I fix these problems?  \begin{table} [!htp]  \caption{Enerji Eş Değerlikleri} \label{tab:endeg} \begin{center}     \begin{tabular}{lrr}         Tür & Jul & BTU\\         \hline\hline         1 BTU &  $1054 $ J & -\\         1 kWh & $3,6x10^6 $J & $3.412$ BTU\\         1 kalori &  $4,184 $ J & $3,968x10^{-3}$ BTU \\         1 eV & $1,602x10^{-19}$ J & $1,52x10^{-22}$ BTU\\         \hline\         \textbf{Kaynak:} (Crawley, 2013)             \end{tabular} \end{center}


I have a workbook with 2 sheets: spg and data  From the data sheet I wish to do a vlookup in the spg sheet, based on the value of multiple columns in spg.  I can do a =VLOOKUP(H5,spg!$D:$I,6,0) but this will filter where D is equal to H5. I need to add an additional filter so that it selects the value where D is equal to H5 AND C is equal to G5  (C = G5 AND D = H5)  But apparently I can not search with multiple criteria in VLOOKUP, so how do I do it?


Why was Sauron afraid of anyone finding the ring?

Since the ring was only able to be controlled by Sauron, why would he be afraid of someone else wielding it? Everyone, even the most powerful beings, admitted they couldn't use it. Yes, this question is more about Sauron's reaction. Another question said that Sauron was terribly afraid and I just didn't get the feeling that he was. But if he was why was he?


Typeset a path with Windows environment variables in a footnote

I try to display a path including an evironment with: \documentclass{scrreprt} \usepackage{hyperref} \begin{document} Lorem \path{C:\%HOMEPATH%\Documents\} ipsum\footnote{\path{{C:\%HOMEPATH%\Documents\}}. \end{document}   However during compilation I get the following error message: Runaway argument? { \path {C:\%HOMEPATH ! File ended while scanning use of \@footnotetext. <inserted text>                 \par  Any Idea on how to display a path with environments in a footnote?


SQL Server Instance How to recover memory used

I know that may be this question has been answered a lot of times, but I need a better way to solve it or to demonstrate to my boss that this is a normal behaviour or there is something that I'm overlooking. I'm not a DBA, I'm a developer, and like my previous job, I've to take the DBA Mantle because we don't have a formal DBA on site or no one want's to take this thing seriously. I have three instances of SQL Server, one with SQL 2008 R2 and two with SQL 2016. All are from production environment. The SQL 2008 R2 is from our main System, it is hosted in a Virtual Server in Hyper-V and is a Dedicated Database Server. No other apps are allocated on that server, it is a pure database server. The issue is that the server is configured with 30 GB of RAM, and SQL Server is configured to use from 4 GB minimum to 22 GB maximum.  If I do a restart, obviously the server memory usage goes to a flat line at server performance manager, releasing memory from memory used to the minimum configured.  I need help understanding this situation, since all documentation point to an irrefutable fact that this is normal in SQL Server, that I've already documented myself about it, but my boss and colleagues state that this is not normal behaviour for the database. If I do numbers I think the server is requesting more memory. They say this is not a normal behaviour of SQL Server and that there is something we are overlooking (Jobs, and other stuff). To monitor or try to determine the Server Behaviour, I started sending Database Health Report every two hours, to try to check what's going on. For them, the expected behaviour is that SQL Server RAM should rise up and down in the performance graph and not stay at the top all the time, and as I understand this is the expected behaviour or SQL Server by design.  But in different points in time, jobs rise to execute, and they finish normally, some time long running transactions are running, but when I run queries for them after the report is generated, they are gone. Is there something I'm overlooking? Is this Normal?  Is there a way to release memory without rebooting the instance?  I've already tried a bunch of solutions


Is there a way to keep someone off my network?

I was looking at my admin panel for the router and saw a computer I don't recognise. I changed the password, reconnected my devices, and it's gone.  Well, it came back again today. It's very annoying, as google bases a lot of things (search suggestions, etc) based on your IP and I keep getting stupid suggestions.  I'm assuming it's one of my neighbors, I'm just not sure which.  I would just change the password, however whoever is doing it clearly has a way to get on secured wifi networks and that wouldn't be any help.   Neither of  answers helped me. They're probably spoofing their MAC or something.  My router is a


Apache is serving SSL when its not in the vhost configuration

We have multiple sites in our apache configuration. All of these sites are defined in their own vhost. However we have a site that is served on SSL when it is not defined in our VHOSTS: Here is the output of apachectl -S VirtualHost configuration: *:443                  is a NameVirtualHost          default server a.com (/etc/apache2/sites-enabled/a.com-le-ssl.conf:2)          port 443 namevhost a.com (/etc/apache2/sites-enabled/a.com-le-ssl.conf:2)                  alias a.com,www2.a.com,a.com,www.a.com          port 443 namevhost az.h.com (/etc/apache2/sites-enabled/az.h-ssl.conf:1)                  alias az.h.com                  alias az.h.com          port 443 namevhost b.com (/etc/apache2/sites-enabled/s.e-ssl.conf:1)                  alias b.com          port 443 namevhost www.c.com,www2.c.com,c.com (/etc/apache2/sites-enabled/c.com-le-ssl.conf:2)                  alias c.com          port 443 namevhost d.com (/etc/apache2/sites-enabled/d-ssl.conf:1)                  alias www.d.com          port 443 namevhost e.com (/etc/apache2/sites-enabled/e-ssl.conf:1)                  alias e.com                  alias www.e.com          port 443 namevhost www.e.com (/etc/apache2/sites-enabled/e-ssl.conf:1)                  alias e.com          port 443 namevhost f.com (/etc/apache2/sites-enabled/f-ssl.conf:1)                  alias f.com                  alias www.f.com          port 443 namevhost www.g.com (/etc/apache2/sites-enabled/g-ssl.conf:1)                  alias g.com          port 443 namevhost www.h.com (/etc/apache2/sites-enabled/h-ssl.conf:1)                  alias h.com                  wild alias *.h.com          port 443 namevhost truck.i.com (/etc/apache2/sites-enabled/truck.i-ssl.conf:1)                  alias truck.i.com          port 443 namevhost i.com (/etc/apache2/sites-enabled/i-le-ssl.conf:2)                  alias i.com                  alias www.i.com          port 443 namevhost www.j.com (/etc/apache2/sites-enabled/j-ssl.conf:1)                  alias j.com          port 443 namevhost www.k.com (/etc/apache2/sites-enabled/k-ssl.conf:1)                  alias k.com *:80                   is a NameVirtualHost          default server a.com (/etc/apache2/sites-enabled/a.com.conf:1)          port 80 namevhost a.com (/etc/apache2/sites-enabled/a.com.conf:1)                  alias www.a.com,www2.a.com,a.com          port 80 namevhost www.c.com,www2.c.com,c.com (/etc/apache2/sites-enabled/c.com.conf:1)                  alias c.com          port 80 namevhost www.d.com (/etc/apache2/sites-enabled/d.conf:1)                  alias d.com          port 80 namevhost www.x.com (/etc/apache2/sites-enabled/x.conf:1)                  alias x.com          port 80 namevhost www.e.com (/etc/apache2/sites-enabled/e.conf:1)                  alias e.com          port 80 namevhost www.e.com (/etc/apache2/sites-enabled/e.conf:1)                  alias e.com          port 80 namevhost www.g.com (/etc/apache2/sites-enabled/g.conf:1)                  alias g.com          port 80 namevhost www.z.com (/etc/apache2/sites-enabled/z.conf:1)                  alias z.com          port 80 namevhost www.h.com (/etc/apache2/sites-enabled/h.conf:1)                  alias h.com                  wild alias *.h.com          port 80 namevhost www.i.com (/etc/apache2/sites-enabled/i.conf:1)                  alias i.com          port 80 namevhost www.j.com (/etc/apache2/sites-enabled/j.conf:1)                  alias j.com          port 80 namevhost www.k.com.com (/etc/apache2/sites-enabled/k.conf:1)                  alias k.com


Run multiple instance of a program in parallel

I have a command, let say php process.php. I want to run 1000 instance of this command to test load caused on the server. How can I do this?  Things to note:   Ctrl+C should terminate all instance at once It is going to run on a single core processor so no need of advance feature like multi-threading. Nice to show current number of running instance on top Commands should output in the same terminal Commands requires no input


Simplest way to make line numbers in listings environment refer to actual source code line number?

The following code:  \documentclass{article} \usepackage[framed,numbered,autolinebreaks]{mcode} \usepackage{filecontents}  \begin{filecontents*}{example_function.m} % create a function for mass of spherical particle fxn_mass_from_density_radius = @(rho, x) 4/3 .* pi .* (x(:)^3) .* rho;  % density rho = 1000; % kg m^{-1}  % define radius r = 1e-6;       % m  % compute particle mass m = feval(fxn_mass_from_density_radius, rho_particle, r);   % kg \end{filecontents*}  \setlength{\parindent}{0pt}  \begin{document}  In the code below we define a function and two variables  \lstinputlisting[firstline=1,lastline=8]{example_function.m} \addvspace{5mm}  In the code below we evaluate the function  \lstinputlisting[firstline=10,lastline=11]{example_function.m} \addvspace{5mm}  \end{document}   results in the following output    Note that there are two framed boxes, one source code file.  Note also that the rendered line numbers both start at 1.  I think that the minimal bit of information that the author should have to provide is the start and end line numbers.  I'd like to avoid having to manually handle the offset.  I'm wondering if the listings package can accommodate this?


In Schawrtz, Page 116, formula 8.23, he seems to suggest that the square of the Maxwell tensor can be expanded out as follows:  $$-\frac{1}{4}F_{\mu \nu}^{2}=\frac{1}{2}A_{\mu}\square A_{\mu}-\frac{1}{2}A_{\mu}\partial_{\mu}\partial_{\nu}A_{\nu}$$  where:  $$F_{\mu\nu}=\partial_{\mu} A_{\nu} - \partial_{\nu}A_{\mu}$$  For the life of me, I can't seem to derive this.  I get close, but always with an extra unwanted term, or two.  Anyone have a hint on the best way to proceed?


How can I change the permissions of a folder from create or delete to list files only on a NTFS partition?

I have many NTFS partitions on my PC.  If I change the permissions of a folder on a NTFS partition from "create and delete files" to "list files only", its permissions will return to "create and delete files" permissions.  But, if I copy that folder and paste it onto the desktop, a Linux partition, the feature works. That is, it will change from "create and delete files" to "list files only".   How can I make the permission changes stay without copying the folder to my desktop?


Windows 8.1 Update stuck on Checking for updates in 2017

At the start of 2017 all Windows 8.1 x64 computers I knew of were stuck on Checking for updates with 100% CPU usage by the Windows Update service(svchost.exe -k netsvcs).   No workarounds and troubleshooters on the internet help. Even a clean Windows 8.1 x64 on the VirtualBox gets stuck.  Edit: This is not a duplicate of another question asked Oct 5 '16. Because the answer there is suggesting to install KB3102812 update. This update was already installed on my system. The solution for a current(2017) problem is to install a different update.


Another question....  I am looking for an Excel formula that will calculate the following...Based of a cells date, I want a cell to return the date of the prior Friday unless the initial cell's date is Saturday then I want the cell to return the date of 2 Friday's prior.   Example...if cell A1 has a date of 10/17/17, then cell A2 will return the date of the prior Friday of 10/13/17. If the date in cell A1 is a Saturday (like 10/21/17) then cell A2 would return the date of the previous Friday (10/13/17 NOT 10/20/17).   This question deals specifically with Friday. My previous post/question was different days. I am not familiar with this complex of a formula. I tried to edit the formula I have for my previous question (=IF(WEEKDAY(A1-2)=1,A1-4,IF(WEEKDAY(A1-2)=7,A1-3,A1-2)), but I am not knowledgeable of this complex of equation.


Launcher and menu bar no longer visible after Mar 2/2018 update

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


Will a faster lens help getting a better (faster/more accurate) focus?

I read that with some cameras (but which?), using an f/2.8 lens or faster enables a more sensitive phase AF point, so there is quantum jump in AF accuracy.  But that's not really my question :) My question is whether I can expect some AF improvement between an f/5.6 lens and an f/4 one, since the standard AF points will have more aperture and light to work with?


Proof for $\left\lfloor\frac 1j\left\lfloor\frac nk\right\rfloor\right\rfloor=\left\lfloor\frac n{jk}\right\rfloor$

Problem: For positive integers $n,j,k$, prove that the following holds:     $$\left\lfloor\frac 1j\left\lfloor\frac nk\right\rfloor\right\rfloor=\left\lfloor\frac n{jk}\right\rfloor$$     I simply need hints to start on this problem. I have verified that it's indeed true by checking a few examples and I can't seem to find a counter-example, so I'm almost sure that the problem is indeed correct.  However, I can't seem to think of a proper (and rigorous) proof of this. Can someone please help me by giving me a few hints?  I want to prove it myself, so I'd appreciate if people don't directly post the proof themselves. Also, please keep your hints as subtle as possible (there's no fun in proving something if the hint gives out most of the answer) :D


Windows 7 - High CPU usage during idle time

I just noticed when I'm away from my laptop running Windows 7 Ultimate 32-bit, after a while CPU fan starts high speed working, but anytime I return back to PC with first input by mouse/keyboard the process seems to terminates.   When I look in task manager's CPU usage history page, it shows 90-100% CPU usage for the past period of time, but for current time CPU usage is low around 0-10%, so I can't find the process using the CPU. Every process explorer I know shows processes for right now, only one application is there logging history of processes at processhistory.sourceforge.net, but after testing, it seems that is not much informative, and I failed to make it showing past processes and their CPU usages.  How could I simply find the process causing this CPU usage?


Noun for "person with intermediate skill"

I'm looking for the noun form of "person with intermediate skill". For example, in the context of a particular activity, "person with no skill" might be designated a novice, and "person with much skill" might be designated an expert. However I know of no such word in between these two extremes.   My only thought is amateur, which has a distinct meaning from describing level of skill, although skill level can often be inferred. I'm looking for a better solution.  EDIT: due to the attention this question has received, I'll try to offer some clarification in order to reduce repeat questions.   "Journeyman" would certainly not work. I am a software developer by profession. However the word I'm looking for should hopefully be profession-agnostic. I am trying to designate the skill level of the person that some learning material might be appropriate for. The word that I'm looking for follows the preposition "for".   For Beginners  For [word for intermediate-skilled person] For Experts  Sorry, but even after all the great answers, I'm still learning towards "amateur" even though it is technically incorrect. Also, the word should not be so esoteric that only people with English degrees know what it means. Keep the ideas coming!


How to run grep and show x number of lines before and after the match

grep returns just the line where it matched the regex and often what I want to really see is a few (say 2) lines above and below the matched one. Is there a simple way to achieve it?  EDIT: OS: Ubuntu based Bodhi Linux.  As mentioned in comments, -C does not work in vanilla but its GNU grep in my case.


(Internal) Fire looks blocky in final render

So I took a sphere, made it a smoke simulator, added wind and increased that to 50.00, and rendered it. For some reason it looks very pixelated. 3D Viewport:   Final Render:   Blender File:


Why Firefox always gets upgraded and Chromium web browser don't?

Why Firefox always gets upgraded to the latest version available and Chromium web browser don't get upgraded to the latest version available? they are both open source software.  I'm using Ubuntu 12.04 and Firefox version at this moment is 36.0.1 but Chromium version is stuck at 37.0.2062.120 although latest Chrome version available at the moment is 41.0.2272.76.  Thank You


How can I prove $\sqrt{2} ^{\sqrt{2}}$ is irrational?

I am learning proofs and a question was posed which asked us to prove that $\sqrt{2}^{\sqrt{2}}$ is irrational. They mentioned this - Hint: try using the log10 function...  I tried my hand at the proof by contradiction. Assuming $\sqrt{2}^{\sqrt{2}}$ is rational. Hence,   $\sqrt{2}^{\sqrt{2}} = \frac{p}{q} \implies \big({\frac{p}{q}}\big)^{\sqrt{2}} = 2$  Can I now say, that we know that $\sqrt{2}$ is irrational, but $\frac{p}{q}$ and $2$ are rational;   If $a$ is rational and $b$ is irrational, $a^b$ must be irrational. *(1)  In our case $a^b = 2$ which is rational: a contradiction to our original assumption.  This is just tomfoolery on my part. I don't know if *(1) is even true or not; how can I approach such a problem?


PCA with continuous and categorical features

I have a dataset with both continuous and categorical features.  I want to reduce the dimensionality, but cannot apply PCA directly on the dataset because of the categorical features.  One solution I thought of was to run PCA exclusively on the continuous features, reduce the dimensions there, and then add the categorical features as they are to the reduced table with the continuous features.  I have not seen this method anywhere, but it makes sense to me, so I was wondering if it's OK.


Hello I was trying to derive wave equation? Can anyone tell me why we calculate curl of curl of electric field and what it signifies?

We know that the curl of an electric field is the rate of change of magnetic flux then why we have to calculate the curl of the curl of the electric field after that. What is the reasoning behind this Faraday's law $$ \nabla\ \times E = -\frac{\partial B}{\partial t} $$ Taking curl of the equation $$ \nabla \times \nabla\ \times E = -\frac{\partial (\nabla \times B)}{\partial t} $$ I would like to know what is the physical significance of taking the curl of the above equation?


How come root can do this, but sudo can't?

I am set up as a sudoer on my Debian machine, and I use it all the time to install software etc... I came across this interesting situation that I am scratching my head about:  I tried to enable the fancy progress bar in apt using this command:  sudo echo 'Dpkg::Progress-Fancy "1";' > /etc/apt/apt.conf.d/99progressbar   I have permissions issues:  /etc/apt/apt.conf.d/99progressbar: Permission denied   However, if I su, then run the command, everything just works.  Why is this so?


I was wondering if someone could help me add a leading zero to this existing string when the digits are sings (eg 1-9).  Here is the string:  str(int(length)/1440/60)


Can anyone help me to calculate and explain me time complexity of this algorithm : function mystery(n)     r := 0     for i := 1 to n − 1 do          for j := i + 1 to n do              for k := 1 to j do                 r := r + 1      return(r)


Im making a Runescape private server, but im having slight problems with compiling. The code i use for my source is:      @echo off "C:\Program Files\Java\jdk1.8.0_131\bin\javac.exe"   -classpath deps/log4j-1.2.15.jar;deps/jython.jar;deps/xstream.jar;deps/mina.jar;deps/mysql.jar;deps/poi.jar;deps/slf4j.jar;deps/slf4j-nop.jar   -d bin src\server\event*.java src\server\model\items*.java src\server\model\minigames*.java src\server\model\npcs*.java   src\server\model\objects*.java src\server\model\players*.java   src\server\model\players\skills*.java   src\server\model\players\packets*.java src\server\model\shops*.java   src\server\net*.java src\server\task*.java src\server\util*.java   src\server\world*.java src\server\util\log*.java src\server*.java   src\server\world\map*.java src/server/gui/*.java   and for my client/auto cache i use:     @echo off Title Compiler "C:\Program   Files\Java\jdk1.8.0_131\bin\javac.exe" -d ./Class/ Java/.java   Java/sign/.java pause   So, i get the same error on both of the codes, and i have no clue how to fix it... The error is: Note: Java\client.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details.  Hope that someone knows how to fix this :)


Wordpress permalink structure with mutliple categories

I am trying to find out whether the permalink structure affects ranking and which of these two permalinks is better to use.  I have nested categories on my blog, now my link looks as follows   https://example.com/blog/software-development/mobile/android/android-blog-post-name   But I am not sure whether such permalink structure is good for page ranking.   Is it better to use the following format instead ?  https://example.com/blog/android-blog-post-name   I would be grateful for any help, advice or explanation.  Thanks.


How to center icons in div consistently?

I am trying to center an icon in my header navigation.  I have the basics down but the center changes depending on if there are multiple icons in the same header.  How can I keep the center icon centered even if the left or right icons are removed?    HTML

   CSS  .mp-center-wrapper{     text-align: center; }  .mp-myheader {     background: #015688 !important;     width:100% }  .mp-icon-hamburger {     background-image:       url("http://icons.iconarchive.com/icons/klukeart/summer/128/hamburger-icon.png");     background-position:center;     background-repeat:no-repeat; }  .mp-icon-xsm {     width: 25px;     height:25px;     background-size: 25px;     display:inline-block; }  .mp-float-left {     float:left; }  .mp-float-right {     float:right; }


Help choosing between two frame sizes based on my dimensions

I would really appreciate some help choosing a size of bike frame. I am stuck between choosing the large or the extra large.   I may go down the route of getting professionally checked on the bike, but there is every chance that since this is a frame company a long way from my house I won't be able to get it properly checked before I try and place an order, only testing on equivalent bikes. I have not decided if I am going for flat bars or drop bars, but more likely drop bars.  These are the bike sizes:    These are my measurements:    A: 186cm (6ft 1inch) B: C: 88cm D: E: 62cm (armpit to bottom of thumb as per picture) F:    Any help would be really appreciated. My feeling is that the large is the right size, but from my preliminary reading it looks like the extra large may be closer?   Thank you


Android - Attempt to invoke virtual method 'boolean java.lang.String.contains(java.lang.CharSequence)' on a null object reference

I am getting the following error:  Attempt to invoke virtual method 'boolean java.lang.String.contains(java.lang.CharSequence)' on a null object reference   on the following lines:  protected void onPostExecute(String s) {         super.onPostExecute(s);         if (s.contains("Error")) {             pd.dismiss();             return;         }   In Particular, this line:   if (s.contains("Error")) {   I don't believe I am missing any code, but a second set of eyes would be much appreciated.