I recently posted a  that is still unanswered. I'm trying to put several articles into a publication. In each article the authorlist is defined using authblk. So I have:  Article 1:  \begin{document} \title{title1} \author[*]{First} \author[**]{Second} \affil[*]{FirstAffil} \affil[**]{SecondAffil} \maketitle Text \end{document}   Article 2:  \begin{document} \title{title2} \author[*]{Third} \affil[*]{ThirdAffil} \maketitle Text \end{document}   Main file:  \documentclass[a4paper]{article} \usepackage{import} \usepackage{authblk}  \begin{document} \subimport{Folder1/}{article1} \subimport{Folder2/}{article2} \end{document}   My problem was that with the second \maketitle (the one corresponding to article 2), ALL the authors appeared.   I solved this problem inserting the following code between the two \subimportcommands:  \makeatletter \renewcommand{\AB@authlist}{} \renewcommand{\AB@affilist}{} \makeatother   In this way the list of authors is reseted.  However, now in the second article the author is PRECEEDED by a comma, so I get something like this:  title1  First* and Second**  *FirstAffil  **Second Affil  Text  title2  , Third*  *ThirdAfiil  Text  I guess that there is some counter associated with the author list that is not reseted, so \maketitle assumes  that the Third author is in fact the third, and not the first one.  Does someone know how can reset this counter (if it exists) or how can I solve this problem anyway?


No Option For Graphics CPU in Render Settings

Specs Windows 10 Pro 64 bit  Intel i7-4810MQ Nvidia K3100M --- [Nvidia Graphics Driver 354.56] --- [Nvidia nView 146.90] comes with graphics driver above. Intel HD Graphics 4600 --- [Intel Graphics Driver v10.18.15.4268] 500 GB Crucial SSD 32 GB Kingston 1866 SODIMML RAM And some other miscellaneous stuff that probably doesn't matter.  Hopefully the image will explain what is happening.  I am just learning Blender and I am trying to render the monkey head. I set the resolution to 1080p HD TV and then 500%. That should strain the pc right? Well when I run the render, all 8 CPU cores go through the roof. I am guessing my Video card is not helping with the process.  I think that I have all the settings correct. Why am I not able to select the graphics cpu under the render tab?


I have the following code which return "YXX". I would like to know why the second print displays an 'X' whereas the key-word virtual is used in the class X. So the line tab[0] = y1 will be set tab[0] as an Y object and displays 'Y' due to the virtual method isn't it ?   #include <iostream>  class X {     public: virtual void f() const { std::cout << "X"; } };  class Y : public X {     void f() const { std::cout << "Y"; } };  void print(const X &x) { x.f(); }  int main() {     X tab[2];     Y y1;     tab[0] = y1;      print(y1);     print(tab[0]);     print(tab[1]);     std::cout << std::endl; }


Show that for any natural numbers, if $S(x)=S(y)$ then $x=y$.

Definition. $0=\emptyset$.  Definition.  $S(x):=x\cup\{x\}$, $S(y):=y\cup\{y\}$.  Definition. $S(x):=x\cup${$x$}.  Theorem1. For all natural numbers $x$ and $y$, if $x\in y$ then $x\subseteq y$.  Theorem2. For all natural numbers $x$ and $y$ if $S(x)=S(y)$ then $x=y$.  Note that we will use Theorem1 for proof of Theorem2.


The same question should not be under both Linked and Related

Here is a recent example of this from  on English SE:  The Related questions should be filtered to remove any questions that already appear under Linked. This will avoid confusing the reader by making them think that these are two separate questions. Moreover, it seems that sometimes the score of the question can be different under Linked and Related due to caching, as pointed out in . Update I was not aware of , thanks for finding it. That was filed as a bug report, and was marked as . However, I would like to rebut the argument provided in the staff answer to that question, in order to have this reconsidered as a request to change the design. The staff answer was  It's not truly redundant because, though the links point to the same place, the fact that they're in both lists provides additional information. Specifically, it tells you that the system agrees that the link someone inserted is, in fact, related. The links are already pretty unobtrusive, so the small benefit outweighs the even smaller cost.  From a design perspective, what is the purpose of the sidebar providing links to similar question? The point of this feature, as far as I can tell, is to refer people who searched for this particular question to similar questions, so that they can find more useful information or perhaps the answer they are looking for in another similar question. The list of Related questions is returned by an algorithm which retrieves questions that have lexical and tag similarities. This is not an absolute list. What is ultimately displayed on the page is probably the top X most Related questions, where X seems to be 7. However, this is an arbitrary number. This does not mean that the 8th most Related question found by the algorithm, which is ultimately not displayed, is necessarily not worth displaying to the user. Websites like SO tend to have tons of questions related to a particular topic. It would be a waste to display the same question in both lists, if the purpose of the lists is ultimately the same (to refer users to questions that might help them). A Linked question, might, theoretically, not be all that relevant in reality. The same applies for a question deemed as Related by the algorithm. So, we do not gain any concrete information if a question appears in both lists. On the other hand, having a question appear in both lists is bad UX in my opinion. This is valuable space, and linking to the same post twice not only causes confusion, but can be a hassle. The way it is implemented now, the color change for a hyperlink that you have already clicked is very subtle and might not be discernible by users with low or moderate vision impairment. You would have to open the hyperlink, realize that it’s the same as the one you already saw, and then go back. So, why not link to a question that could potentially help the user, instead of linking to the same question twice?


Custom question lists January status update

Previous posts:                        After a lackluster December update, I'm happy to report that Custom Question Lists Phase 2 (saving) has shipped!  What's shipped?  If you are participating in the Custom Question List alpha (by ), you'll see a new section in the "More" dropdown:    Clicking the + button launch a dialog with the same options as the Filter and Sort options giving you the ability to save the view.    Once configured and saved, the view will be quickly accessible and configurable from the "More" menu:    Please give it a try.  If you have any questions, bugs, or feedback, you can reply to this post directly or add a new question with the  tag.  What's next?  Phase 3 of this project is to add more utility to these saved lists, adding them to the main left navigation and adding indicators for new content.  We've already made significant progress on this front, our production Tag Server is already set up to send back content notifications and I have a version of the web app running locally.  It still needs to go through architecture review, get a design treatment, and get a healthy dose of performance testing and other scrutiny, but the end is near.


Changing the cursor size in ubuntu 14.04

I have difficulties seeing, so I tried to change my cursor using the instructions from Ubuntu 11, 12 but nothing worked. I have found no one on this Internet with my problem. I run Ubuntu 14.04 and gnome 3.9, I have dconf-editer, compiz-config and they don't do anything to my computer.


Calculating how much vertical space is used by existing elements?

Let's say I have a Header element which has various content that is determining its height rather than a set property. Is it possible to get that height using CSS only? I want that in order to know how much vertical space I have left on the page and size a video div accordingly.  If I had the dimension set manually I could just use height: calc(100vh - headerHeight);  sample:
something

   header {   background-color: yellow;   margin: 0; } p {   font-size: 2em;   padding: 0.5em;   margin: 0;   background-color: pink; } div {   background-color: blue;   height: 100vh; /* This should adjust so it doesn't overflow-y.*/ }


Notify users of possible reviews on toolbar

I am under the impression that increased participation in the review queue is, on the whole a good thing.  It encourages people to feel an ownership in the community and partially responsible for the site as a whole.  On Programmers.SE, I've seen what I believe to be an uptick in flagging to close (non-audits with no votes in the close queue).  I believe that to be a good thing as it indicates to me that there are at least a few on P.SE who may some day become more active participants in the site.  On the other hand, I don't often see too many new names in the "recent reviews" page.  There are often new names scattered about on close votes of recent questions which suggests to me there is a population of 3+k users who don't review, but do close recent questions.  While the close queue at P.SE is completely different than the one at SO (we start wondering about it in chat when it hits 20 and occasionally motivate people to help smash the queue back to 0), I was wondering if there wasn't something that could be done to help direct everyone possible to review (or at least be aware of it - there was a comment at one point of a 10k user who wasn't aware of anything in the /review link after clicking it as a new user and not seeing anything in it that could be done by him).  The suggestion  Next to the review link display the number of reviews that user is capable of doing at this time, akin to the way the 10k banner looks when there are flags or edits outstanding.  Many people perceive numbers as "there is something here that needs my attention".  Inbox size, alerts on mobile device apps, notifications, etc...  Using this it would be possible to point people to the review part of the application and help them become a more active participant in the site and the community as a whole.  This number would be:  min(first post queue size, first post audits doable) + min(late answer queue size, late answer audits doable) + ...    There seems to be some confusion about what this would be and what the numbers on it would be.  I have used my considerable art skills (sorry, no pie) to make a mockup of what this would look like based on the current snapshot of what I see on P.SE    "Wait," you say... "why is that a 20?  Shouldn't it be 24?"  Nope.  Because on P.SE I can only do 20 close vote reviews a day (smaller queue or something of that nature).  If you hit it with someone who hasn't reviewed most of the queue, you'll actually see that its 60.  And still the answer should be 20.  And so, min(60,20) + min(0,20) + min(0,20) + min(0,20) + min(0,20) (those are the other queues there too) is 20.  And that's the number that should be shown.  This should be something that you can get to 0 every day.  Making it something that is an unmanageable number makes it something people will ignore, and that's not what this is suggesting.


Not all Borel sets are Jordan measurable.  For instance, the set of rational numbers is Borel but not Jordan measurable.  But my question is, are all Jordan measurable sets Borel sets?  I know all Jordan measurable sets are Lebesgue measurable, but of course not all Lebesgue measurable sets are Borel sets.


Making combobox with list of fields (from layer also selected in combobox) in pyQGIS?

I am new to python and pyqqis.  I do not have the methods defined in initGUI  how do I do?  layers = self.iface.legendInterface().layers() layer_list = [] for layer in layers:     layer_list.append(layer.name()) self.dlg.comboBox.addItems(layer_list)  selectedLayerIndex = self.dlg.comboBox.currentIndex() selectedLayer = layers[selectedLayerIndex] fields = selectedLayer.pendingFields() fieldnames = [field.name() for field in fields] self.dlg.comboBox_2.addItems(fieldnames)   The problem is, that in second combobox there are fields from first on layerlist layer, not the selected one.


I would like to be able to live-stream presentations online in case my school closes. My presentations are in power point. Ideally I would like to share my screen so I can use other software simultaneously. Finally I would like student to be able to ask questions from home and be heard by everyone, but I would like to have control over who is heard.  Any software recommendations? Even better if it's open source, or at least free


EmailSendDefinition + specify tracking folder

Is it possible to specify the tracking folder when created an ESD  / EmailSendDefinition via the soap api?   Doesnt look like it is based off the Objects properties.


Prove: (p ∧ q) ∨ (q ∧ r) ∨ (r ∧ p) ≡ (p ∨ q) ∧ (q ∨ r) ∧ (r ∨ p)

I tried reversing absorption on the RHS to expand all terms then group the individual element but I end up getting the LHS  and the RHS.I was thinking maybe I can expand the LHS reversing using the same method and show that each sides can be expanded to the same form. However I feel there is a better way to prove this using only the laws where one side becomes the other.Thoughts?


Why do texts on classical mechanics never mention any derivative of position beyond the jerk, while at the same time being general in the sense of using of generalized coordinates?


Need a custom currency format to use with String.Format

I'm trying to use String.Format("{0:c}", somevalue) in C# but am having a hard time figuring out how to configure the output to meet my needs. Here are my needs:   0 outputs to blank 1.00 outputs to $1.00 10.00 outputs to $10.00 100.00 outputs to $100.00 1000.00 outputs to $1,000.00   I've tried String.Format("{0:c}", somevalue) but for zero values it outputs $0.00 which is not what I want. I've also tried String.Format("{0:$0,0.00;$(0,0.00);#}", somevalue), but for 1.0 it outputs $01.00. String.Format("{0:$0.00;$(0.00);#}", somevalue) works for most cases, but when somevalue is 1000.00 the output is $1000.00.   Is there some format that will fit all 5 cases above? All of the documentation I've read only details the basics and doesn't touch on this type of scenario.


I'm posting links to photos on Dropbox of 3 de Buyer skillets I own. They have been placed into the dishwasher over and over again against my advice unfortunately. I want to know if what I'm seeing on them now is rust, and if so are they permanently damaged or is there something I can do to revive them?


How to add a header in .htaccess bases on filetype (mime type)?

I would like to add two extra HTTP headers to all responses that are of filetype (mime type) text/html, but not other files.  The current headers (edited):  curl -I https://www......  HTTP/1.1 200 OK Date: Fri, 23 Feb 2018 20:43:15 GMT Server: Apache Expires: Thu, 19 Nov 1981 08:52:00 GMT Cache-Control: no-store, no-cache Vary: Content-Type,Accept-Encoding X-Frame-Options: SAMEORIGIN Connection: keep-alive Content-Type: text/html; charset=UTF-8 Content-Language: de-DE   The <If> statement I tried is not working (my idea was to check for text/html, and if that is set, then also add two extra headers with Header set.  I have checked multiple sources like , but cannot seem to find the answer.  This is one of the things I've tried that seems most logical to me. Do a check for a current header; if result is true then add extra headers.  <If "%{HTTP:Content-Type} in { 'text/html' }"> Header set Header1 test Header set Header2 test </If>   But I do not know if this ENV is taken from the request or response header.  Does anyone know of a way to achieve this -- add custom HTTP header in the response based on mime type?  Thanks.


Which sentence is correct?  During the storm, those in private homes suffered most or suffered the most.  Are both equally accepted as grammatical in English?


Is it possible to implement autoboxing for your own classes?  To illustrate my example, this is what I might want to write:  Foo foo = "lolcat";   And this is what Java would do (as per my own definitions, somewhere, somehow), under the hood:  Foo foo = new Foo(); foo.setLolcat("lolcat");   So, is this possible somehow, or is it a JVM-feature only?


how to find epsilon-delta definition of a limit

Use epsilon-delta definition of limit  To show :  $\displaystyle \lim_{x \to 0}  x\sin \left(\dfrac{1}{x}\right) = 0$   How to explain this in detail with step by step explanations?


Aaalright, i really need some help to this, because im really confused. Im trying to connect to a database on phpmyadmin.  <?php mysql_connect('localhost', 'root', ''); mysql_select_db('test_database'); ?>   Here im using "mysql_connect". When i run it, it says that this extension deprecated/outdated and that i have to use "mysqli_connect".  So now i'm just using the same code as above, but just with the "i" at the end instead.  What am I doing wrong?    In advance, thanks!  PS: My first language is NOT english. Hope you will understand it.


I just bought iPhone5S. While I need converter to use iPhone5S charger, instead I am using an iPad2 charger.   Is it OK if I do that? What's the different (in terms of voltage, ampere, and so on) of iPad2 and iPhone5S charger?


Who is sample No. 118 in The Case of Charles Dexter Ward?

In H. P. Lovecraft's The Case of Charles Dexter Ward, Dr. Willett      Enters Joseph Curwen's dungeon and resurrects a dead person identified as No. 118 by reciting the incantation of the Ascending Node over his salts.   Dr. Willett is told by      The resurrected Joseph Curwen, impersonating Charles Dexter Ward, who he secretly murdered,   that   " 'twas Number 118, and I conceive you would have shook had you looked it up in my list in t'other room."  No. 118 himself gives Dr. Willett a note asking the doctor to      kill Joseph Curwen.   It soon becomes clear that No. 118 is opposed to the nefarious dealings that have been transpiring and desirous of being an ally of Dr. Willett.  Who is No. 118?  Earlier in the story,      The grave of Ezra Weeden, a primary instigator in Joseph Curwen's initial downfall and the romantic rival of Curwen, is robbed. There doesn't seem to be any other mention of Weeden in the 20th century occurrences, so without a further connection the passage seems superfluous.   The shared goals of these two people seem to indicate that No. 118 may, in fact, have been that person, but the      Note given by No. 118 to Dr. Willett in eighth century Latin seems to indicate someone much older than Ezra Weeden.   It also occurred to me that No. 118 could be      The recently murdered Charles Dexter Ward himself. Ward's reference to killing Dr. Allen (who is actually an alias of Curwen) and dissolving his body with acid and No. 118's mention of doing the same to Curwen seem to support the idea, but that still doesn't explain the archaic note. Ward is described as writing in a somewhat modern style, at least as opposed to Curwen. It also doesn't explain why Curwen would want to murder Ward if he was going to resurrect him later anyway.


Events not triggered when button is added via AJAX

I am using AJAX to dynamically add a button to the DOM. This button is supposed to trigger a function on click but it's not.  Here is the MWE:   index.html   <!DOCTYPE html>        <meta charset="UTF-8">

     btn.html      <button class="my_btn">Click here</button>   script.js   $(document).ready(function () {     // Adds the button to index.html     $.ajax({         type: "GET",         url: "btn.html",         dataType: "html",         success: function (html_text) {             $('#btn_content').html(html_text);         }     });      // Click event that is not triggerd     $('.my_btn').click(function () {          console.log("This is not working");     }) });   A similar issue was mentionned but not answered with a practical solution at the time.   Any thoughts?


Finding the uniformising parameter of a DVR

I am looking to find the intersection number of the affine plane curves $F=Y^2-X^3+X$ and $G=(X^2+Y^2)^3-4X^2Y^2$, and I need to do it with the order function of the local ring of $F$ at the origin.   So my attempt goes as follows:  $$k[X,Y] \twoheadrightarrow \Gamma(F)=k[X,Y]/(F) \hookrightarrow \mathcal{O}_{(0,0)}(F)$$ $$ G \mapsto \bar{G} = G\mod (F) \mapsto \frac{\bar{G}}{1} $$  Then I get the intersection number as $I((0,0),F\cap G) = \text{Ord}_{(0,0)}^F(\bar{G})$.  For the map onto the coordinate ring of $F$, I wrote $X\mapsto x, Y\mapsto y : y^2=x^3-x$. From there I thought that $\bar{G} = (x^2+(x^3-x))^3 - 4x^2(x^3-x)$. The map into the local ring (which I know should be a DVR as the origin is a simple point of $F$) is a natural injection, so I thought I should be able to write $\bar{G} = u\cdot t^n$ as one can do in a DVR. I can't! I'm not sure what is going wrong.


I've build a WCF Service to accept a file and write it to disk. The front-end consists of a page with SWFUpload which is handling the upload on the client side. Apparently, SWFUpload posts the data with a Content Type of: multipart/form-data.  I would think this ok but on the Service side I get an error. The error is "ProtocolException" expecting text/xml. I've tried different message encodings in the bindings but nothing seems to work.  How can I get this file uploaded using multipart/form-data?


How can I make a Windows 10 PC sleep from Command Prompt or PowerShell? For example, to shutdown PC we can use the following:  shutdown /s /f    or to hibernate...  shutdown /h /f   Is there any command like these to make computer sleep?


Why is an empty set not a terminal object in categories $\mathsf{Top}$ and $\mathsf{Sets}$?

From Awodey: In any category $\mathsf{C}$,  an object $0$ is initial if for any object $C$ there is a unique morphism $0 \to C$,  an object $1$ is terminal if for any object $C$ there is a unique morphism $C \to 1$.  First I was puzzled by the fact that we can do mappings from a zero set to any other set in a category $\mathsf{Sets}$. But then after I accepted it conceptually, I do not understand why there is no unique morphism to an empty set from every object in a category $\mathsf{Sets}$. Is this because we cannot map a non-empty set to an empty set (since our mapping is total) although we can map an empty set to a non-empty set?  Please, note, I am familiar with the proposition saying: Initial (terminal) objects are unique up to isomorphism.


I want to put this  ="'Other Sheet'!C"&D5   (where D5 = 1432)  in a cell and get the actual value the formula refers to rather than the formula as a string (current result). How can I do that?


How do I install an operating system on a hard drive then copy it to a new drive?

I have a computer with only one harddrive but I have a spare harddrive that I can temporarily use.  I can't format my computers harddrive because I still need to use the operating system every day and to setup, install and update all my works programs it would take over 24 hours so to prevent downtime I want to install the operating system and programs to a second harddrive and then once it's setup correctly I need to wipe the first harddrive and copy the entire os, files...etc back over to the first, now clean drive.  Is there a way to do this or is it better to do it with partitions or something?  Any ideas?


onkeypress registers enter key multiple times on dynamically created DOM using jquery

Dynamically appended elements:  +'
'             +'<form action="" class="ckit-composer-form">'                 +'
'                     +'<textarea data-ckit-composer-textarea placeholder="Add your reply" autocomplete="off" name="message" class="form-control ckit-composer__textarea"></textarea>'                 +'
'             +'</form>'                +'
'    I'm unable to bind keypress event into the textarea above like this:  jQuery('[data-ckit-composer-textarea]').bind('keypress',function(){     alert('hi');//does not invoked });   So i'm doing using inline onkeypress event and this does work:  <textarea data-ckit-composer-textarea placeholder="Add your reply" autocomplete="off" onkeypress="enterMe()" name="message".....><textarea>   enterMe() function which registers key press multiple times  function enterMe(){  jQuery('[data-ckit-composer-textarea]').keypress(function(event){     var keycode = (event.keyCode ? event.keyCode : event.which);      if(keycode == '13'){     alert('hi);//invokes many times     } }); }   How do I make alert('hi) invoked only once per ENTER keypress? I'm nt holding on it continuously or pressed it twice fastly which would have caused it to run multiple times.. What else could be the reason for this and how to solve it, pllease?


Compiling python with custom library path

I'm trying to install the latest Python version on my workstation at work. Unfortunately I don't have root access, and they won't do it for me, so I have to compile from source and put it in ~/local/bin.  I've downloaded the source, and run ./configure --prefix=~/local && make && make install. However, I get an error that says ModuleNotFoundError: No module named '_ctypes' when it tries to install pip.  According to here:    I need to install libffi-dev. So I downloaded the source and ran ./configure --prefix=~/local && make && make install there.  Now my problem is that it installed the .so files in ~/local/lib64, and the installer tells me I need to link against the library by using libtool or the LD_LIBRARY_PATH env var or some linker flags.  I need to run the python make but it needs to point to both that library directory and the default one. I can't seem to figure out how to do it because none of the options suggested are working.  Thanks!


"setAdapter" with Spinners in fragment is not working

I am trying to implement spinners, and at the Line  spinner1.setAdapter(adapter1);   I get the following error:     java.lang.NullPointerException: Attempt to invoke virtual method 'void android.widget.Spinner.setAdapter(android.widget.SpinnerAdapter)' on a null object reference   This is my Code:  public class Temp extends Fragment implements AdapterView.OnItemSelectedListener{     private static final String[] paths1 = {"sam1", "sam2", "sam3", "sam4"},             paths2 = {"1", "2", "3", "4"};     private String name,seq;     private Spinner spinner1,spinner2;     private TextView tv1;     private ArrayAdapter<String> adapter1,adapter2;      @Nullable     @Override     public View onCreateView(@NonNull LayoutInflater inflater, @Nullable ViewGroup container,                              @Nullable Bundle savedInstanceState) {         View attendFragView = inflater.inflate(R.layout.fragment_attendance, container, false);          //Spinner 1 code         spinner1=(Spinner)attendFragView.findViewById(R.id.regPageFacSpinner1);         adapter1=new ArrayAdapter<String>(attendFragView.getContext(),R.layout.spinner_lay_notched,                 paths2);         adapter1.setDropDownViewResource(android.R.layout.simple_spinner_dropdown_item);         spinner1.setAdapter(adapter1);         spinner1.setOnItemSelectedListener(this);          //Spinner 2 Code          spinner2=(Spinner)attendFragView.findViewById(R.id.regPageFacSpinner2);         adapter2=new ArrayAdapter<String>(attendFragView.getContext(),R.layout.spinner_lay_notched,                 paths1);         adapter2.setDropDownViewResource(android.R.layout.simple_spinner_dropdown_item);         spinner2.setAdapter(adapter2);         spinner2.setOnItemSelectedListener(this);           final EditText et1 = (EditText) attendFragView.findViewById(R.id.secOtpFac);         tv1=(TextView)attendFragView.findViewById(R.id.attendPageFac5);          Button genOtp = (Button) attendFragView.findViewById(R.id.otpGenButFac);         genOtp.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View view) {                  String dept= et1.getText().toString();                 String name=spinner1.getSelectedItem().toString();                 String seq=spinner2.getSelectedItem().toString();                 JSONObject attendJSONSend = new JSONObject();                 try {                     attendJSONSend.put("name", name);                     attendJSONSend.put("seq", seq);                     attendJSONSend.put("dept", dept);                 } catch (JSONException e) {                     e.printStackTrace();                 }             }         });         return attendFragView;     }      @Override     public void onItemSelected(AdapterView<?> adapterView, View view, int i, long l) {      }      @Override     public void onNothingSelected(AdapterView<?> adapterView) {      } }


In MySQL is there any function like "level" in Oracle

I'm facing a scenario, where if the input is 10, I want a sequence of numbers (1,2,3,...10).  In oracle the level function provides that function, and I wish to know how to perform the same task in MySQL.   Thanks...


Wondering if the lenght of this domain is too long

Working on the structure of this domain     Wondering if the lenght of the address is too long and how would seo be affected or improved


Creating Multi-Part Polygons that touch internally using ArcGIS Desktop?

I have a set of parcels as illustrated in the image below. There are currently no multi-part features in dataset. What I would like to do is to merge (not the right word) all of the parcels with same address, say 421 for example. I want to have these three polygons as one multi-part polygon, that still has the same geometry, as in it doesn't dissolve the lines.     When I have tried this thus far, the lines dissolve resulting in only the boundary being preserved.     I feel like there is a super easy was to do this, but I can't find it. I have full access to ArcGIS Advanced and use it to manage the topology of this dataset.


Length of period of fraction bounded by denominator

Calculating the decimal expansions of the first values for $\frac{1}{n}$ with $n \in \mathbb{N}, n>0$, we observe no period longer than the denominator: $$1, 0.5, 0.\overline{3}, 0.25, 0.2, 0.1\overline{6}, 0.\overline{142857}$$ Is it always true? Another observation is that prime numbers seem to yield longer periods than composite numbers.


Override background image/color in the community using the Napili template

I've been testing the customization capabilities of communities with napili template. One of the very basic things I cannot easily do is, branding. I can update the logo, but not the background. It seems I need to override the CSS, found the below snippet that helps to change the background,  .default-bg-overlay {     background: white none repeat scroll 0 0 !important; }  The above one change the header color, but not the body, I also cannot set the background image. What would be the right way to do it?


I would love to have the review and  from the website inside the app so that we can review low quality posts, edits and delete requests while we are having some free time when commuting to work or during classes or w/e.


I saw this today, I checked in Mathematica and the integral comes out to $\pi$, but I have no idea how to solve it.     FREE Wi-Fi: The Wi-Fi password is the first $10$ digits of the answer.   $$\int_{-2}^2\left(x^3\cos\frac x2+\frac12\right)\sqrt{4-x^2}\ dx$$


Should higher ISOs really be preferred (all other things being equal)?

My understanding of the ISO setting on digital cameras is that, unlike film-cameras, changing the ISO does not evoke any physical change in the camera.  Rather, it simply tells the camera to multiply the analog-voltages it reads from the sensors by a constant number, which increases the brightness of that pixel in the output JPEG image.  And since the RAW files store the actual voltages read, before any changes to the brightness take place, the values in the RAW file will be the same regardless of the ISO setting.  Thus, if you're snapping pictures in RAW format only, the ISO setting does absolutely nothing (Also it would mean digital cameras with higher ISOs are completely a marketing gimmick).  However,  contradicts that.  It shows the following image:  which claims that the ISO setting does affect the RAW output! †  It also states "to minimise noise get as much light into the camera as possible then use the highest ISO you can without overexposing."  If my understanding is correct, all images with the same shutter-speed will result in the same (RAW) image, regardless of ISO setting.  However, if the explanation in the above post is correct, (RAW) images that were taken with an incorrectly-exposed ISO setting can't be corrected in software without introducing extra noise.  (I found  online in which several 'experts' argue back and forth about which understanding is correct, but never reach a conclusion)    To figure out which understanding is correct, I tried shooting an image at various ISOs and shutter-speeds, in RAW+JPEG mode.  I then loaded the RAW files into Photoshop and applied auto-correct within "Camera Raw" (before the JPEG conversion).    These were the results (click to enlarge):   (All shots taken with Sony a390 DSLR.  Aperture f/5.6, 18-55mm zoom lens set to 55mm)  And for comparison, here were the JPEGs created for those same shots by the camera (no Photoshop correction applied):    It appears we're both wrong (What!?!??!!?).  The ISO setting definitely did have a major difference in the final RAW image, but it seems that even when it causes under-exposure, using the lowest ISO setting still resulted in the least amount of noise!!  I assume that, to understand why that is, I need to know exactly how the ISO setting works in DLSRs - could someone please explain that to me?  Is the sensor somehow physically made more sensitive, or is it a simple digital (or possibly analog) amplification of the voltage signal?  Or does it work differently in different cameras (mine is a rather low-tier DLSR)?  If the sensor doesn't physically become more sensitive, why does the ISO setting affect the RAW image?  Why did an underexposed ISO100 image result in less noise (after photoshop correction) than the same image with the same aperture/shutter at (a correctly-exposed) ISO3200?    † (At least, I think that's what he's saying.  The post is ambiguous as to whether the auto-correction was done to the RAW or the JPEG file.  I'm just assuming it was done to the RAW, though, as doing it to the JPEG would just be stupid - he'd be amplifying the compression+quantization noise, not the camera noise, which would make the entire post incorrect)


direct product commutes with tensor product?

Let $(A_i)_{i\in I}$ be a family of right $R$-modules and $M$ be a left $R$-module, where $I$ is an index set. The natural homomorphism $$\varphi:(\prod_{i\in I}A_i)\otimes_RM\to \prod_{i\in I}(A_i\otimes_RM)$$ given by $(a_i)\otimes m\mapsto(a_i\otimes m)$ is not always a bijection. It is  easy to obtain $\varphi$ is a surjection provided $M$ is finitely generated. If we assume that $M$ is finitely presented, can we prove $\varphi$ is a bijection?


Array syntax in Java: what is the significance of the [] location

String S[] = new String[3]; String[] S = new String[3];   Both ways are proper in Java. Does it mean that for every type Type[] x is the same as Type x[]?


pronunciation of article 'a' in phrases vs. in sentences

One of my teacher corrected me when I read the article 'a' as /ey/ in a phrase. And he said it should be /uh/.  A banana (/uh/)  I know that both are acceptable /ey/ and /uh/, but is there really a difference on the pronunciation when it is in a phrase or a sentence?


How can I make the browser see CSS and Javascript changes?

CSS and Javascript files don't change very often, so I want them to be cached by the web browser. But I also want the web browser to see changes made to these files without requiring the user to clear their browser cache. Also want a solution that works well with a version control system such as Subversion.   Some solutions I have seen involve adding a version number to the end of the file in the form of a query string. Could use the SVN revision number to automate this for you:   Can you specify how you include the  variable of another file? That is in the HTML file I can include the Revision number in the URL to the CSS or Javascript file. In the  it says about Revision: "This keyword describes the last known revision in which this file changed in the repository".  Firefox also allows pressing CTRL+R to reload everything on a particular page.  To clarify I am looking for solutions that don't require the user to do anything on their part.


Does anybody else sometimes have trouble docking? I am granted docking permissions, I have my landing gear out, and I am in the "docking circle" (it shines in blue).  Most of the times I just bump into the station while hoovering down. After a few retries (including sometimes flying a kilometer from the station and back), the docking is successful.  To be more detailed, this is my procedure:   Ask for docking permission and get granted. Fly to the docking pad, at the same time toggling the landing gear Position myself over the landing pad, in the accepted landing zone Use vertical controls to lower altitude   In other words, a quite straight-forward procedure.   This is getting quite annoying. Has anybody else experienced this? Is there a workaround?


I have a copy of my RPi's SD card made with dd if=/dev/mmblk0 of=backup.img. This creates a 32GB file. Only about 6GB of it is actually used, the rest is just data from deleted files. How would I remove the old, useless data? It doesn't have to shrink the image file, just zero out whatever isn't needed


How to view raster attribute data in QGIS?

I have a single band, 8-bit, unsigned integer tif (National Land Cover Data).  When I view it in Arcmap 10.4.1, I am given the opportunity to also view it's attribute table:    However, when I view this same tif in QGIS 2.16.3, there is no option to open the attribute table:    With QGIS I can also load the tif's .dbf file, which contains the attribute data, but I don't see how to join that to the tif.    In summary, how do I view a tif's associated attribute data?


If $B$ is invertible, show that rank($AB$) = rank($A$).    I've seen this question asked elsewhere but all had answers I didn't understand. I know how to solve the following problem     If $A$ is invertible, then rank($AB$) = rank($B$)   Because if $Bx=0$, then $ABx = A0 = 0$, and when $ABx=0$ then $Bx=0$ because $A$ is invertible, so null($AB$)=null($A$), and by the rank-nullity theorem, rank($A$) = rank($AB$).   However when $B$ is invertible, as in the problem we have to tackle, I don't know how to use that fact. $ABx = 0$, but $B$ is in the middle so we can't simply get rid of it to get a meaningful expression.  Does someone know how to tackle this?


Difference between an asp.net website vs asp.net web application

In VS 2008, whats the difference between an asp.net website vs an asp.net web application? What are the advantages / disadvantages of each?  Thanks


How to solve 2nd degree complex polynomials with complex numbers as coefficients?

I tried to solve this complex polynomial:  $$(1 + i)z^2 + (-1 + 7i)z - (10 - 2i) = 0$$  When I did the whole discriminant thing and I got $\sqrt{18i}$ which I don't know how to deal with. Usually my dicriminant doesn't contain the i inside of it. How are equations like these solved?  Thank you.


Solve the system of congruence relations:  $2x+3y\equiv 1\pmod {11}$  $x+4y\equiv 4\pmod {11}$  Could someone give a hint how to solve this system.  I know that Chinese remainder theorem can't be used because modulo numbers ($11$) are not relatively prime.


Sorting a list depending of the value of a key

I have a list that contains names of users.  List<String> members = new ArrayList<>();   And I store the users and their points like this:  Map<String, Integer> membersAndPoints = new HashMap<>();  for(String member : members) {     membersAndPoints.put(member, Utils.getPoints(member)); }   Note that the points are not unique, if more than one user has the same points, they have to be in a similar position. Then I want to sort the members depending on the values of the map, that's what I dont know how to do. If a member has 1000 points, and no one else has more than that, that member would be in the position 0 of the ranking, and so on.  List<String> ranking = new ArrayList<>();    Looking at the respones I got I did this, but I'm not sure if its that what I want or not.  Collections.sort(clans, new Comparator<String>() {                     @Override                     public int compare(String o1, String o2) {                         return Integer.valueOf(Utils.getPoints(o1)).compareTo(Integer.valueOf(Utils.getPoints(o2)));                     }                 });   Edit: I did this, and it works:  List<String> list = new ArrayList<String>() {             {                 add("Example1");                 add("Example2");                 add("Example3");                 add("Example4");                 add("Example5");             }         };         list.sort(new Comparator<String>() {             @Override             public int compare(String s1, String s2) {                 return getFor(s2).compareTo(getFor(s1));             }         });         for(String s : list) {             System.out.println(String.format("%s : %s", s, getFor(s)));         }     }      public static Integer getFor(String s) {         switch (s) {         case "Example1":             return 29;         case "Example2":             return 94;         case "Example3":             return 67;         case "Example4":             return 34;         case "Example5":             return 94;         default:             return 0;         }     }


Stack Exchange account instead of OpenID

I am currently using OpenID connected with a Yahoo email address. I want to create a normal Stack Exchange account and connect it with my current account. I don't want to use Yahoo OpenID any more. Is it possible?  I could not find a way to do it.


Is weakly continuous implies strong continuous?

Let $(X, \|\cdot\|_X), (Y, \|\cdot\|_Y)$ normed spaces, operator $A: X \longrightarrow Y$ weakly continuous. Is $A$ continuous with respect to the strong topology?  Thanks in advance for your ideas.


My Nikon D3100 not taking pictures when its switch to "A" mode of 18-55mm lens, but it take pictures when it's to "M" mode of 18-55 lens, but zoom in is very blur its clear in zoom out?


Combinatorial Proof for Binomial Identity: $\sum_{k = 0}^n \binom{k}{p} = \binom{n+1}{p+1}$

I am studying combinatorics and I came across the identity $$\sum\limits_{k=0}^n \binom kp =\binom {n+1}{p+1}.$$ I have read the algebraic proof and it does not appeal to me. Is there an elegant counting trick we can use to arrive at this identity?


As usual, when my brain's messing with something I can't figure out myself, I come to you guys for help :)  This time I've been wondering why stdafx.h works the way it does? To my understanding it does 2 things:   Includes standard headers which we might (?) use and which are rarely changed Work as a compiler-bookmark for when code is no longer precompiled.   Now, these 2 things seems like two very different tasks to me, and I wonder why they didn't do two seperate steps to take care of them? To me it seems reasonable to have a #pragma-command do the bookmarking stuff and to optionally have a header-file a long the lines of windows.h to do the including of often-used headers... Which brings me to my next point: Why are we forced to include often-used headers through stdafx.h? Personally, I'm not aware of any often used headers I use that I'm not already doing my own includes for - but maybe these headers are necessary for .dll generation?  Thx in advance


How did the Doctor remember the ship name?

In Deep Breath (series 8) the Doctor tries to remember a previous incident with      clockwork androids stealing human body parts to repair machinery.   Yet he can't. During another conversation with the episode's main "villain", he finally remembers a few parts of his own history.  He's looking at the backside of some kind of fuse and reads the name      SS Marie Antoinette   and shortly later combines this with the name of the supposed sister ship:      SS Madame de Pompadour   The actual event he remembers has been depicted in an episode of series 1 (2005).      However, as far as I remember, at the end of The Girl in the Fireplace the Doctor just kept wondering why the droids wanted Madame de Pompadour specifically. As far as I know it's only shown to the audience that the ship's hull has Madame de Pompadour written on its flank, essentially revealing its name.   So did I just miss the Doctor noticing the name? Or is this a plot hole?


How to test router-to-PC connection speed?

Is there a way to benchmark how fast my router is connected to my PC, independent of the internet?  I've had slower-than-usual internet-based benchmarks, and I'm having a hard time figuring out if it's because of a bad router-to-PC connection (interference, bad signal, etc.) or if it's indeed because my internet is actually slower.


Revise the AER bibliography style to write out all names if a piece has three authors

For aer.bst, citations with 3 or more authors are listed using et al. I need to modify the bibliography so that citations with 4 or more authors are listed using et al., but that citations with 3 authors have all the names written out. For example, I want "See Adams, Brown, and Clark (2003)" as opposed to "See Adams et al. (2003)." I'm using natbib with LaTex: \usepackage{natbib,har2nat}  In order to do that, I need to modify the function format.lab.names.abbr.  Might someone know how to do this?  FUNCTION {format.lab.names.abbr} { 'name.list :=   name.list num.names$ 'numnames :=   numnames #1 >     { numnames #2 >         { name.list #1 "{vv~}{ll}" format.name$ " et al." * }         { name.list #2 "{ff }{vv }{ll}{ jj}" format.name$ "others" =             { name.list #1 "{vv~}{ll}" format.name$ " et al." * }             { name.list #1 "{vv~}{ll}" format.name$ " and " *               name.list #2 "{vv~}{ll}" format.name$ *             }           if$         }       if$       field.used editor.field = {", eds" *} {} if$     }     {         name.list #1 "{vv~}{ll}" format.name$         field.used editor.field = {", ed" *} {} if$     }   if$ }   FUNCTION {format.lab.names.full} { 'name.list :=   #1 'nameptr :=   name.list num.names$ 'numnames :=   numnames 'namesleft :=     { namesleft #0 > }     { name.list nameptr "{vv~}{ll}" format.name$ 'temp :=       nameptr #1 >         { namesleft #1 >             { ", " * temp * }             { temp "others" =                 { " et~al." * }                 { " and " * temp * }               if$             }           if$         }         'temp       if$       nameptr #1 + 'nameptr :=       namesleft #1 - 'namesleft :=     }   while$   numnames #1 > field.used editor.field = and {", eds" *} {} if$   numnames #1 = field.used editor.field = and {", ed" *} {} if$ }


Is it possible to recover the key to a decrypted file?

Is it possible to recover the key to a decrypted file if you have the initialization vector and it uses RijndaelManaged in CBC mode? If so how?   The file I want to recover the key from is a xml that looks like this without encryption. It has a xml element called Test.  <?xml version="1.0" encoding="utf-8"?> <Test />   When it is encrypted with the key stackoverflow (73868cb1848a216984dca1b6b0ee37bc = md5 hash) and the initialization vector below, the file look like this ¥4!¬Hw[î!71ôtž|!¢¬TÞ;u?þª-†•ÈÏ‰eßŽKtSsbZ®ÕµR©Ù«í‹:    Initialization vector:  byte[] iv = new byte[] {     55, 66, 77, 192, 57, 100, 11, 111,     25, 86, 96, 66, 22, 122, 133, 43 };   Is it possible to reverse the key from that or are it bulletproof?


If you exert force on a charge, doesn't it violate the conservation of energy?

You briefly accelerate a charge for some time, and it will both radiate electromagnetic energy and gain kinetic energy.  The kinetic energy it gains seems to be governed by Newton's Second Law, so by putting some amount of work into the system, somehow we get that amount, plus a little bit more, of energy out?


Rinsing vs not rinsing until 30 mins after brushing teeth (dry sensation)

First timer here.. I don't know this situation has been asked/shared before or not, but I couldn't find any similar question online.  So I have read the recommendation that better we do not rinse after brushing teeth and just let the toothpaste do its work for 30 minutes before rinsing/eating/anything.  I have been doing that. I make sure to also spit excess toothpaste. However, I always feel this dry sensation in my mouth. Why? Because I also read that, in addition, it is not recommended to swallow/ingest the toothpaste..  So for more or less 30 minutes, my mouth does nothing..not even swallowing saliva because I know I will swallow the toothpaste. And when the duration ends, I suffer from this dry sensation..and just go on to quickly rinse by water and hope the suffering ends. This of course keep repeating twice everyday.  If it is only 15 minutes, I think I am fine..but yes, I am such a strict person following scientific-looking recommendation strictly. So if it is recommended for maximum benefit that:   Don't rinse for around 30 minutes, just spit out excess toothpaste after brushing. Don't swallow toothpaste.   Then I do just that..and that dry sensation inside my mouth is unavoidable.  Is there any solution to this?  Thank you very much for the help and suggestions! Really appreciate it!  EDIT: Some sources (but the thing is I also don't know the reliability):  On not rinsing?       On not swallowing (in large amount of course)?       Nevertheless, my main thing is not mainly about criticizing each source, but about asking the better advice here. Thank you.


Movie with a robot in a female skin who is discovered by her boyfriend

I’m trying to find the title for a movie or possibly a tv show a saw as a kid. I remember it being in the mid 90s to early 2000’s. It was about a robot that had female skin and was later discovered by the boyfriend and I want to say bubble gum had some kind of effect on the robots. Sorry I don’t have much to go off of and I searched every where and can’t find anything.


Just installed Ubuntu 20.04 - Not being able to connect to Wifi

I posted the below yesterday, got an update that there is an extensive answer here:  My issue is that in step 1, I get: 14e4:4311 rev2 and is does not appear in the table in the next step. There is 14e4:4311 rev1 but not rev2. Can you pls add it to the relevant table? thank you. just installed Ubuntu 20.04 on HP Pavillion dv6000 notebook. After installation completed, tried to browse through firefox and seeing Im not connected. Explored some relevant questions, and I do know Ubuntu can see my device as when going to terminal and typing command: lspci -vvnn | grep -A 9 Network  Getting the info. that it is Broadcomm Here is exactly what I get: 02:00.0 Network controller [0280]: Broadcom Inc. and subsidiaries BCM4311 802.11b/g WLAN [14e4:4311] (rev 02)     Subsystem: Hewlett-Packard Company BCM4311 802.11b/g Wireless LAN Controller [103c:1374]     Control: I/O- Mem+ BusMaster+ SpecCycle- MemWINV- VGASnoop- ParErr- Stepping- SERR+ FastB2B- DisINTx-     Status: Cap+ 66MHz- UDF- FastB2B- ParErr- DEVSEL=fast >TAbort- <TAbort- <MAbort- >SERR- <PERR- INTx-     Latency: 0, Cache Line Size: 64 bytes     Interrupt: pin A routed to IRQ 16     Region 0: Memory at f4000000 (64-bit, non-prefetchable) [size=16K]     Capabilities: <access denied>     Kernel driver in use: b43-pci-bridge     Kernel modules: ssb  Not sure if I understand correctly but now I need to get a firmware install package and then driver both for Linux/Ubuntu for Broadcomm 4311 but this is where I go lost as when looking those, found some install package on  but there were many options there and I was not sure if Im on the right path of maybe there is a much simpler way or Im not reading the issue correctly. Help will be appreciated.


In many equation editors (e.g. MS Word 2007 and Daum Equation Editor), there's a double square bracket. Is there a TeX equivalent for [[, ((, )), and ]]?


When do I need to re-install instead of upgrading?

Actually i need to know if i'm using 14.04 or 15.04 then do i'll need to a fresh installation of os after several time 5 yrs or 9 months?


How to create personalised prints as in this image?

Can someone tell me what software I would use to create personalised prints where the words form a shape like a heart, or a babies pram or a rocket ship?    I've tried looking for myself but I don't know where to start. Thanks


Is there any law prohibiting the use of a home made check?

Are there any laws prohibiting the use of home made checks, or must I always use a bank created check. Is there a legal directive I can reference?


Is WD elements with NTFS format supported on Ubuntu?

I brought a WD Elements 1tb external hdd and I'm planning to install Ubuntu on my laptop.(not a dual boot). So I was wondering will the hdd work on Ubuntu, it's ntfs formatted.I dont want to format it again just for ubuntu. i want it to be able to work on different os platforms as well


Prove that $G$ has a subgroup isomorphic to $G/H$.

Let $G$ be a finite abelian group of order $n$ and let $H$ be a subgroup of $G$ of order $m$. Show that $G$ has a subgroup isomorphic to $G/H$.   Here are my thoughts:  Define $\mu_n := \{z \in \mathbb{C}|z^n=1\}$ and $\mu:=\bigcup_{n=1}^{\infty}\mu_n$.  Since a finite abelian group is self-dual, we have $G/H \cong \operatorname{Hom}(G/H,\mu)$.   By the structure theorem for finite abelian groups, we have $$G \cong \mathbb{Z}_{n_1}\times \cdot \cdot \cdot \times \mathbb{Z}_{n_s}$$ where $n_{i+1}|n_i$ for $1 \leq i \leq s-1$ and $n_1\cdot \cdot \cdot n_s=n$, and $n_i \geq 2$ for all $i$.  Also, we have $$H \cong \mathbb{Z}_{m_1}\times \cdot \cdot \cdot \times \mathbb{Z}_{m_l}$$ where $m_{i+1}|m_i$ for $1 \leq i\leq l-1$ and $m_1 \cdot \cdot \cdot m_l=m$, and $m_i \geq 2$ for all $i$.   I want to somehow write $G/H$ as a product of cyclic subgroups of the $\mathbb{Z}_{n_i}$, for now denote this product by $A_1\times \cdot \cdot \cdot \times A_s$, where $A_i \leq \mathbb{Z}_{n_i}$, so that then I can write $$\operatorname{Hom}(G/H,\mu) \cong \operatorname{Hom}(A_1, \mu)\times \cdot \cdot \cdot \times \operatorname{Hom}(A_s, \mu).$$  Then, since $\operatorname{Hom}(A_i,\mu) \leq \operatorname{Hom}(\mathbb{Z}_{n_i},\mu)$ and (by an already known result) $\operatorname{Hom}(\mathbb{Z}_{n_i},\mu) \cong \mathbb{Z}_{n_i}$, I will have $$\operatorname{Hom}(G/H, \mu) \leq \mathbb{Z}_{n_1}\times \cdot \cdot \cdot \times \mathbb{Z}_{n_s}. $$  My problem is I cannot see how to write $G/H$ as such a product or if it's even possible. I appreciate any guidance and suggestions. Thanks.


regex extracting mac address into string

I'm trying to use regex to extract a MAC address from a string. The regex that I've used should work.  raw_mac_string returns a ether <mac_address>  What I'm trying to do is get original_mac to extract the <mac_address> from raw_mac_string.  original_mac when run, keeps giving error: AttributeError: 'NoneType' object has no attribute 'group'  Thanks for the help  I guess my question is, how can I extract the MAC address from a string that contains other text as well?  #get original mac address     global original_mac     raw_mac_string = subprocess.check_output('ifconfig en0 | grep ether | awk "{print $2}"', shell=True)     print "raw_mac"+raw_mac_string     original_mac = re.match(r"/^(?:[[:xdigit:]]{2}([-:]))(?:[[:xdigit:]]{2}\1){4}[[:xdigit:]]{2}$/", raw_mac_string).group()


What is the chroot command used for when resetting a password in RHEL/CentOS 7?

I'm trying to wrap my mind around exactly how password reset procedures work in CentOS/RHEL 7 and I'm missing some fundamental knowledge.   In    I see that chroot /sysroot is necessary but I don't understand why or what this step is specifically doing.  Example verbiage:    (Source A) "5 – Now access the system with this command." (Source B) "BOOM. You are in single user mode. The shell prompt! --looks like :/# type chroot /sysroot" (Source C) "then use chroot to go into a chroot jail"   Suffice it to say, these procedures are a little sparse on explanation. :-(  Can someone please elaborate a little more?


Does infinite mass mean infinite gravitational force?

So, if I was to travel at speed of light, I would need infinite energy which means infinite mass. If I have infinte mass and energy I would bend space-time extreme. Does that mean that I would create so much gravitational force that I would be able to pull all things in universe on me (or destroy them). I know that we can't travel at speed of light because of infinite mass/energy but this is just theoretical question. And if I wrote something stupud, I'm sorry :) I'm stil beginner with our universe.


Real world experience in scaling and tuning performance

The website I'm working is allegedly going to have a massive hit rate soon after launch. The client is talking about the possibility  of around 2500 hits per second over a day or so.   Ignoring the fact that this hit rate is probably wild client optimism and apart from getting the largest servers possible, what is the best way that Drupal should be configured to support a large hit rate.  I've read Scaling the , ,  and many other pages, but what I'm looking for is real experience of doing this, what works, what doesn't, and what to expect.


Beginner C++: Why is this switch statement giving me an error?

int menuDecision = displayMenu();    //WHILE USER DOESN'T SELECT QUIT while(menuDecision != 3){ /*     if(menuDecision == 1){         Queue myQueue;     }     else{         Stack myStack;     } */      switch(menuDecision){         case 1: Queue myQueue;                 break;         case 2: Stack myStack;                 break;     }      menuDecision = displayMenu();  }   How come when I run the above as a switch statement it's giving me an error but when I use the if/else-if it works? Basically the program instantiates an object depending on what is selected in the menu.Once an object is created the constructor is called, and the constructor calls another function and so on...Basically a new object is created each pass in the while Loop. Since I'm not getting a lot of feedback in my code, would the above implementation be considered 'bad programming'?  Thanks!  Edit: The error is:   main.cpp:27:4: error: cannot jump from switch statement to this case label                         case 2: Stack myStack;                         ^ main.cpp:25:18: note: jump bypasses variable initialization                         case 1: Queue myQueue;


Can we make the set of all non-negative integers a field?

Can we define any kind of addition and multiplication on the set of all non-negative integers such that it becomes a field. I think not. Can we prove this ? If we have only a finite collection with prime cardinality then only it may become a field.


Convergence in distribution, probability, and 2nd mean

Let $\mathbb P(X=1) = \mathbb P(X=-1) = 1/2$. Define       $$X_n = \begin {cases} X & \text{with probability } 1- \frac{1}{n}\\  e^n & \text{with probability }  \frac{1}{n} \end {cases}$$      Does $X_n \leadsto X$ (i.e., converge in distribution)? Does $X_n \stackrel{P}{\rightarrow} X$? Does $\mathbb{E}[(X-X_n)^2] \to 0$?   I think $X_n \leadsto X$ because just by picturing the CDF  as n goes to infinity, their CDFs converge. Can I get some confirmation on this?  But for convergence in probability, I'm having trouble with the limits.   To do this, what I'm trying to do is find $\mathbb P(|X_n-X| \leq \epsilon)$ and then just take 1 minus that as shown on this site:   If $X_n = X$, then $|X_n - X|$ is just $0$ so for all $n$, $|X_n -X| < \epsilon$ But if $X_n = e^n$ then I have the two cases for $X$. For $X=1$, $|X_n-X| = |e^n-1| \leq \epsilon$. and For $X=-1$, $|X_n-X| = |e^n +1| = e^n + 1 \leq \epsilon$. This is where I am stuck. I'm trying to find conditions relating $n$ and $\epsilon$ similiar to here the example on the site. But I'm not sure how to get that from $|e^n - 1| \leq \epsilon$ and  $e^n + 1 \leq \epsilon$ .  Am I even on the right track?


what condition we need to use "." in command line?

a question - in some case, I saw command line like this   . ./test.sh  I'm curious why use "." before "./test.sh" what condition we have to use "." before a command?


How can I calculate the limit of exponential divided by factorial?

I suspect this limit is 0, but how can I prove it?  $$\lim_{n \to +\infty} \frac{2^{n}}{n!}$$


Why isn't the graph of $y=|x|$ a smooth manifold?

Consider the graph of $y=|x|$ from $-1<x<1$. Equip it with a single chart, the projection onto the $x$-axis. Is it now a smooth manifold? It seems like it shouldn't be smooth, but perhaps with only one chart, any manifold is smooth (because it trivially satisfies the compatibility condition)?  What chart could we put on there that would not be smoothly compatible with this first one?


Most of the time (but not always) when I post a comment it is only relevant for a short time - a day or two.  For example a comment might say "Please post some code." A reply might be "Thanks, I've added code to the question."  From this point on, both comments are nothing more than a distraction from the question itself, and from any more helpful comments which appear under the question.  If my comment received a few votes, it will appear in the short list of comments and possibly drown more valuable content.  If I'm diligent, I might come back and delete my comment, but then we have a hole in the conversation which can be even more of a distraction. Ultimately eventually the responder should come back and delete their response, but this is unlikely to happen if the responder is a passer-by and has no ongoing interest in the question.  The votes on answers to  indicate that the community preference is to delete your own comments when they become irrelevant, but in practice I don't think this happens often, and when it does, it can break comment continuity.  I'd love to see a mechanism whereby I could post a comment, and it would be deleted after a day or two. Users replying to the comment could use the same mechanism.


Password is not required when log in to ubuntu 14.04LTS

I am using ubuntu 14.04  LTS for a week only. First, there was a password. Then I made the setting 'log in without a password.' After 2 days I again made a password. It is required for authentication nd installing apps. But when I log in to ubuntu, its not needed ! I can log in without it. There's no option for password. Btw, I turned automatic login off, and changed the password several times but no result come out.  What can I do ?


Passing parameter from javascript helper to apex method in lightning

This is related to Lightning component framework. Though, I have passed challenge (till 4), however result is not as expected. I am passing boatTypeId as a parameter from helper-onSearch to apex method-getBoats(). getBoats() return list of boats having the same boatTypeId. Below is my helper and the apex class.  ({     onSearch : function(component, event, helper) {        // console.log('In Helper');         var action=component.get('c.getBoats');         var btypeId =component.get("v.boatTypeId");         console.log('BoatSearchResult helper boattypeId '+btypeId);         action.setParam({"boatTypeId" :btypeId});         action.setCallback(this,function(response) {             if(response.getState() === 'SUCCESS')             {                 console.log('response from server'+ response.getReturnValue());                 var boatslist = response.getReturnValue();                 console.log('Number of Boats returned'+boatslist.length);                 component.set("v.boats",boatslist);             }              else             {                 console.log('Error caught in !!!');             }         });         $A.enqueueAction(action);     } })     public with sharing class BoatSearchResults {      @Auraenabled     public static List<Boat__c> getBoats(string boatTypeId)     {        if(boatTypeId != '')        {            system.debug(boatTypeId);            system.debug('Hello again');            return ([Select Id, BoatType__c , Contact__r.Name, Name, picture__c from Boat__c Where BoatType__c = :boatTypeId]);            // return ([SELECT Id, BoatType__c, picture__c, Name,contact__r.Name from Boat__c]);             }        else        {            system.debug('Hello again2');            return ([SELECT Id, BoatType__c, picture__c, Name,contact__r.Name from Boat__c]);         }     } }   Couple of issues here, I find here:   boatTypeId passed in the getBoats() is always null  If boatTypeId is null , then else part of getBoats() should be executed, but  if part of the method is executed all the times. (Maybe I am missing basics  of SOQL here)   Can someone point me in the right direction?


Android null pointer exception while passing value to another application

public String name, email, phone; NotificationCompat.Builder notification1;  Button aprv;  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.activity_main2);      aprv=(Button)findViewById(R.id.btnapp);     Bundle bundle=getIntent().getExtras();      name=bundle.getString("Name");.......................##     email=bundle.getString("Email");     phone=bundle.getString("Phone");      TextView textView1=(TextView)findViewById(R.id.tv1);     TextView textView2=(TextView)findViewById(R.id.tv2);     TextView textView3=(TextView)findViewById(R.id.tv3);     textView1.setText(name);     textView2.setText(email);     textView3.setText(phone);   Null pointer exception shown in the line with hashtags.  Here's the intent code in another activity. I set the manifest correctly.  Intent intent = new Intent("com.example.user.adminapp.Main2Activity"); intent.putExtra("Name", name); intent.putExtra("Email", email); intent.putExtra("Phone", phone); startActivity(intent);


Is it possible for both sides of an encounter to be surprised?

Is it possible for both sides of an encounter to be surprised and if so what would happen? This is a hypothetical idea I just came up with but it made me wonder what would happen. Would the surprise for all intents and purposes cancel each other out as nobody can act on their first turn or is there some other way for things to play out. If you can provide an example in your answer so I can better understand it.


I'm facing a problem with updating Ubuntu 14.04 to Ubuntu 16.04

I tried doing this  Optional command for temporary root privileges. So you won't need to keep typing sudo.  $ sudo su   enter password. (Note. This is not required, you can continue to use sudo, if you choose.)  First step, make sure your current Ubuntu Version's installed packages are up to date.  $ sudo apt-get update && dist-upgrade   Y when prompted  After that finishes...  $ sudo apt-get install update-manager-core   Next up  $ sudo do-release-upgrade   But it brings me this error 'The package 'linux-headers-3.13.0-generic' needs to be reintalled, but it is impossible to find some appropriate archives'


Automatically change Ubuntu wallpaper at a certain hour

So I am using Ubuntu and I have encountered many softwares and workarounds for changing wallpapers automatically, BUT, it all pertains to time intervals and what I want is by certain time period.  Like I got this wallpapers for dawn, morning, noon, afternoon, dusk and night. And I want to set my wallpapers that each of them transitions at a certain hour, e.g. 4 am, 8 am, 12 pm, 3 pm, 6 pm and 8 pm. NOT through every 3 hours or so, PLEASE.  I encountered wallch, SyncWall and Variety, but didn't see my intended purpose. Syncwall was close enough, except that it causes a bug with dual monitor wallpapers.  Any other apps/softwares that you could suggest? A manual script would also do, if you may.


How to prove that 4900 is the only perfect square pyramid number above 1?

defines a square pyramid number $a(n)$ as one that evaluates to $$\sum_{a=0}^n{a^2}=\frac{n(n+1)(2n+1)}6$$ The first several solutions are $${0, 1, 5, 14, 30, 55, 91, 140, 204, 285, 385, 506, 650, 819, 1015, 1240, 1496, 1785, 2109, 2470, 2870, 3311, 3795, 4324, 4900, 5525, 6201, 6930, 7714, 8555, 9455, 10416, 11440, 12529, 13685, 14910, 16206, 17575, 19019, 20540, 22140, 23821, 25585, 27434, 29370,...}$$  As you can see, the only solutions on this list for which $a(n)$ is itself a perfect square are when $n=0,a(n)=0$, $n=1,a(n)=1$, and $n=24,a(n)=4900$. In fact, the first comment on the OEIS page claims that these are the only such numbers in this sequence, a claim later confirmed in 2013 by Watson.   Is there a mathematical proof of this, beyond brute force guess-and-check?


General closed form of $\int_{0}^{\theta_0} \frac{1}{\sqrt{\cos \theta-\cos \theta_0}} d\theta$

I once asked a  about how to integrate the reciprocal of the square root of cosine.  Is  there a general closed form for the integral $$\int_{0}^{\theta_0} \frac{1}{\sqrt{\cos \theta-\cos \theta_0}} d\theta$$   in terms of the gamma function?  Thank you.


Uniqueness of solution of differential equation $y'=y$

In school, I have recently been learning about simple differential equations. We know that the solution of $y'=y$  is $y=Ae^x$, where $A$ is a constant. But how can we know that it is the only solution? The only thing I can figure out is that $y$ is continuously differentiable. Help me, please.


How can I access unselectable text from windows?

How can I access/copy unselectable text from windows (in Windows 7)?  For example, when a warning/error/info popup box (or window) appear, is there a way to access the text of it (when the text is unselectable)?  I'm wondering if there's a utility or method to possibly access such, sort of like a "DOM Inspector" for a web browser.  Note:  The text is in the form of a label, and not any sort of textbox or inputtable text element.


Securely erase hard drive using the Disk Utility

I am planning on selling my laptop. So I formatted my disk using the Disk Utility and chose to overwrite the disk with zeroes.  Two questions:  Is this the same as overwriting the disk using dd?  sudo dd if=/dev/zero of=/dev/sda   And is this method secure enough so that buyers can't easily recover the previous data? Or should I take additional measures (like encrypting the disk, destroying the headers, etc.)?


Travel to other countries on a Schengen Visa

I have a Schengen visa from Switzerland which I'm touring this Summer  However they gave me a visa for 1 year.  Can I use the same visa to travel to Santorini, Greece (with a 1 night layover in Vienna, Austria)?


I've just installed ubuntu 16.04 on my laptop, but my wireless card doesn't work. What can i do to fix it?  lspci -vvnn | grep -A 9 Network   03:00.0 Network controller [0280]: Broadcom Corporation BCM43142 802.11b/g/n [14e4:4365] (rev 01) Subsystem: Lite-On Communications Inc BCM43142 802.11b/g/n [11ad:6675] Control: I/O- Mem+ BusMaster+ SpecCycle- MemWINV- VGASnoop- ParErr- Stepping- SERR- FastB2B- DisINTx- Status: Cap+ 66MHz- UDF- FastB2B- ParErr- DEVSEL=fast >TAbort- <TAbort- <MAbort- >SERR- <PERR- INTx- Latency: 0, Cache Line Size: 64 bytes Interrupt: pin A routed to IRQ 255 Region 0: Memory at f7800000 (64-bit, non-prefetchable) [size=32K] Capabilities: <access denied> Kernel modules: bcma, wl


Video no longer appearing in video editor?

I am new to blender and animation in general. I poured hours into one simple 2d animation. i had a basic version that saved and worked. I came back and made some visual improvments and added sounds. but now there is no image appearing in the video editor and whenever i try to render it sticks at zero frames and shows a black screen.. (i can still load the file and play it perfectly with sounds and everything, the problem comes as soon as i try to render again.)  what am i doing wrong?? ive been trying to fix it for so long!  Edit: I can render the animation but all frames are black


Geometric intepretation of transpose of matrix

Whenever we see a matrix $A=\bigl( \begin{smallmatrix} 3 & 2 \\ 1 & 2 \end{smallmatrix} \bigr)$ and $v=(3, 2),$ we can visualize that $(3, 2)$ represent the coordinates of $\mathbf i$ vector and $(1,2)$ represents the $\mathbf j$ vector. And to visualize $A$ as a whole, we can see it as a matrix that transforms can  the vector $v.$ when we multiply it. So, we can visualize $A^{-1}$ as a matrix that undoes the transformation by $A.$ Similarly, the determinant of $A$ gives the area. How can I visualize the transpose of a matrix as well as matrices that have a complex number as an element? Thank you.


Longtable: page breaks within row possible?

I am editing a longtable. Some of my cells contain a lot of text. Page breaks seem to happen only where table rows end/begin. I'd like, however, for the rows to span pages; it's fine with me if, for example, the first few lines of a row are at the end of one page and the rest of the row's lines are on the next page.


How to force all subsubsections to be referenced as sections?

I am using the hyperref and autoref package to do cross-referencing in my document. When I am referring to subsubsection such as 3.1.1, I want to it to compile as section 3.1.1 and not subsubsection 3.1.1. How do I do that?


Below I have a Php Registration form that is working well, but am a bit concerned as the form is wide open for an Sql injection attack, I am aware about it but have very limited coding knowledge to prevent it, but still learning.   Have managed to add a Captcha to prevent bots from auto-filling the form and submitting, but unfortunately the same can't be said of being able to validate the First name and Last name,am just wondering how can I safeguard myself against such an attack.  The Relevant code is shown below, Thank You!  1) Check.php  <?php     session_start();     $captcha = $_POST['captcha'];     $captcha_answer = $_SESSION['captcha_answer'];      if($captcha != $captcha_answer) {         echo 'Captcha is incorrect!';     }     else {         echo 'Captcha is correct, congratulations! :)';     } ?>     <?php        if(isset($_POST['registration']) && $captcha == $captcha_answer)     {         require "connection.php";            $FirstName = strip_tags($_POST['FirstName']);          $LastName = strip_tags($_POST['LastName']);          $Msisdn = $_POST['Msisdn'];          $month = $_POST['month'];          $day = $_POST['day'];          $year = $_POST['year'];          $date = $year . "-" . $month . "-" . $day;          $dob = date('y-m-d', strtotime($date));          $Gender = $_POST['Gender'];          $Faith = $_POST['Faith'];          $City = $_POST['City'];          $MarritalStatus = $_POST['MarritalStatus'];          $Profession =$_POST['Profession'];          $Country = $_POST['Country'];          $query="insert into users set FirstName='".$FirstName."',LastName='".$LastName             ."',Msisdn='".$Msisdn."',dob='".$dob."',Gender='".$Gender."',Faith='".$Faith."',City='".$City."',MarritalStatus='".$MarritalStatus."',Profession='".$Profession."',Country='".$Country."'";       mysql_query($query)or  die("".mysql_error());               echo "Successful Registration!";                } ?>        2) Registration.php

Sign Up

It's free and anyone can join
      <form method="post" action="check.php" enctype="multipart/form-data">

             FirstName:	             <input type="text" name="FirstName" maxlength="10" required="" >

             LastName:	             <input type="text" name="LastName" maxlength="10" required="">


I can't login My drupal website (D 7.23) now. I have changed the password and tried to login back, but still the problem exists. After I reset the password by using the one time password and can log in, but when we log out and try again to login, it will be a failed one.  Please help me to solve it.


Viewshed / Line of Sight analysis- as a batch process?

I wish to carry out a line of site analysis similar to the subject in here (preferably within QGIS):   Scenario:  I have two points, A and B. Point A is a signal provider and Point B is a signal receiver. Point A is at X altitude and Point B is at    Y altitude. There may be hills between Points A and B (represented by either vector contour lines or a raster DTM) that block Point B from receiving signal.  Data:   A vector shapefile containing hundreds of points (the viewing position / Point A)  A vector shapefile containing several thousands of points (each point in this shapefile represents a position that needs to be viewed / Point B) A 50 m resolution DTM in raster format (currently looking for higher resolution free data for the UK)     Question:  How can I establish that Point As are able to view all of Point Bs (via say, a mask?). And how do I run this as a batch process? At the moment I can only run the line of sight (LOS) analysis for one coordinate at a time:


If $m < n$ then $\mathbb{R}^m \subset \mathbb{R}^n$ have null measure

Show that if $m <n$ then $\mathbb{R}^m$ seen as subset of $\mathbb{R}^n$ has zero measure.  A set $X \subset \mathbb{R}^m$ have zero measure if for all $\epsilon > 0$ it is possible to obtain a sequence of open cubes $m$-dimensional $C_1 , C_2 , ..., C_i , ...$ such that $X \subset \bigcup_{i=1}^{\infty} C_i$ and $\sum_{i=1}^{\infty} vol(C_i) < \epsilon$  I have tried to use the following theorem:     If $m<n$ and  $f:U \rightarrow \mathbb{R}^n$ of class $C^1$ in a open set $U \subset \mathbb{R}^m$ then $f(U)$ has null measure in $\mathbb{R}^n$.   I use the function $f: \mathbb{R}^m \rightarrow \mathbb{R}^n$, $f(x_1,...,x_m)=(x_1,...,x_m,0,...0)$.  My doubt is if this function satisfies the hypotheses of the theorem and the question.


Schengen area travel after Maltese residence permit expiry. Australian passport

Have been in Malta for over 90 days (since 28th Sept 2014) - though received a residence permit which expires 5th February.    Does this mean I cannot visit any other Schengen areas after this date?    My return flight leaves from Rome on February 20th and I was planning on visiting Spain, Hungary and The Netherlands before then.


How do I install a 32-bit proprietary deb on a 64-bit system without causing dependency problems?

I know Guitar pro doesn't support 64 bit, but i did get it to work with this command   jeggy@jeggy-XPS:~$ sudo dpkg --force-architecture -i GuitarPro6-rev9063.deb [sudo] password for jeggy:  Selecting previously unselected package guitarpro6:i386. (Reading database ... 285729 files and directories currently installed.) Unpacking guitarpro6:i386 (from GuitarPro6-rev9063.deb) ... dpkg: dependency problems prevent configuration of guitarpro6:i386:  guitarpro6:i386 depends on gksu. dpkg: error processing guitarpro6:i386 (--install):  dependency problems - leaving unconfigured Processing triggers for bamfdaemon ... Rebuilding /usr/share/applications/bamf.index... Processing triggers for desktop-file-utils ... Processing triggers for gnome-menus ... Errors were encountered while processing:  guitarpro6:i386   And even after i get that error the program perfectly works fine and updating and adding PPA's to the system works great, but when I'm trying to install some other software i get this error:  jeggy@jeggy-XPS:~$ sudo apt-get install elinks Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies:  elinks : Depends: libfsplib0 (>= 0.9) but it is not going to be installed           Depends: liblua50 (>= 5.0.3) but it is not going to be installed           Depends: liblualib50 (>= 5.0.3) but it is not going to be installed           Depends: libtre5 but it is not going to be installed           Depends: elinks-data (= 0.12~pre5-7ubuntu1) but it is not going to be installed  guitarpro6:i386 : Depends: gksu:i386 but it is not going to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).   And whenever i write "apt-get -f install" i get this  jeggy@jeggy-XPS:~$ sudo apt-get -f install [sudo] password for jeggy:  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required:   dconf-gsettings-backend:i386 python-levenshtein python-indicate libav-tools libstartup-notification0:i386   libxmuu1:i386 libavfilter-extra-2 libbabl-0.0-0 libgegl-0.0-0 libgconf2-4:i386 python-vobject libgtk-3-0:i386   libpam-cap:i386 python-utidylib libdconf0:i386 python-iniparse python-xmpp libpam-gnome-keyring:i386   libxcb-util0:i386 python-farstream Use 'apt-get autoremove' to remove them. The following packages will be REMOVED:   guitarpro6:i386 0 upgraded, 0 newly installed, 1 to remove and 7 not upgraded. 1 not fully installed or removed. After this operation, 84,0 MB disk space will be freed. Do you want to continue [Y/n]? y (Reading database ... 286979 files and directories currently installed.) Removing guitarpro6:i386 ... dpkg: warning: while removing guitarpro6:i386, directory '/opt/GuitarPro6/updater' not empty so not removed. dpkg: warning: while removing guitarpro6:i386, directory '/opt/GuitarPro6/Data/Soundbanks' not empty so not removed. Processing triggers for bamfdaemon ... Rebuilding /usr/share/applications/bamf.index... Processing triggers for desktop-file-utils ... Processing triggers for gnome-menus ...   And now Guitar Pro is deleted.  How can i install Guitar Pro and still be able to install other software afterwards?


Variance of Geometric Distribution in terms of successes only

$$ Prove: var(X) = \frac{1-p}{p^2} $$ I solved for $$E[X^2]-E[X]^2$$ I did the following for $E(X)$ $$ E(X) = (\frac{1}{p}) $$ I did the following for $E(X^2)$ $$E(X^2)=\sum^\infty_n n^2p(1-p)^n$$ $$E(X^2)=p\sum^\infty_n n^2(1-p)^n$$ $$E(X^2)=p\left(\frac{p^2-3 p+2}{p^3}\right)$$ $$E(X^2)=\frac{p^2-3 p+2}{p^2}$$ I don't know where I make a mistake but when I solve it I end up with this instead: $$ V(X) = (\frac{p^2-5p+2p+1}{p^2}) $$ Where did I go wrong?


Is editing part of Youtube audio in a video possible via the Youtube editor?

I have an uploaded video and I want to cut sections of audio (strong language) or add beeps on top without reuploading the video.


Is there any way to change my login from a Gmail account to Stack Exchange?

Currently I am logging in to Stack Overflow with my Gmail account. But at my next company, there is no access for Gmail accounts.  So is there any way to change my Stack Overflow login from a Gmail account to Stack Exchange (or some other provider)?  Obviously, I want to keep all of the reputation that I have earned, and associate it with my new account!


$A,B$ both are singular matrix and also rank $AB$ = rank $BA$. Then is the following true?

Suppose $A,B$ are two $n\times n$ complex matrices such that $A,B$ both are singular matrix and also rank $AB$ = rank $BA$. Then is it true that $AB$ and $BA$ will have the same minimal polynomial?  I have tried to find counterexample. But I am not getting.


How to transfer my account from old phone to new phone

I bought a new phone and want to know how to transfer my account from old phone to new phone without starting all over again?


Measure of the Cantor set plus the Cantor set

The Sum of 2 sets of Measure zero might well be very large for example, the sum of $x$-axis and $y$-axis, is nothing but the whole plane. Similarly one can ask this question about Cantor sets:  If $C$ is the cantor set, then what is the measure of $C+C$?


Time dilation and twin paradox - can this be explained in plain English?

If one twin goes with an extremely fast rocket to Alpha Centauri and back, time is going slower for him, so when he comes back, the twin that stayed on the Earth is older.  But... if we look from the relative position of the rocket, the Earth rushed 4 light years away and then came back -- so the twin on the rocket should be older.  When the rocket is at cruising speed, neither accelerating nor decelerating, aren't Earth and the Rocket equally "correct"?  So, does that mean that acceleration and deceleration make the twin in the rocket younger?  But then acceleration and deceleration cause time dilation and not speed?  I know there are multiple questions already there about twins, but I can't understand the answers...  Can this be explained for someone with no physics background, in plain 5th-grade level English without manifolds, integrals, homotopy, etc?


Horizontally/Vertically Straightening a Shape in Illustrator

Let's say I have a shape that I rotated at an awkward angle of let's say 34°. I close the document, return a few hours later, and want to straighten the it back to its original 90° or 0° angle. The problem is I don't remember the angle I originally rotated it at. Shift + Rotating nor resetting its bounding box does the trick. Any shortcuts/options I'm overlooking here? For example how would I rotate this quadrilateral so that it sits horizontally straight and looks like a box.


Proving that sequence is in $\ell^\infty$

Let $(y_k)_{k\in\mathbb{N}}$ be a sequence in $\mathbb{K}$ with the property that for all sequences $(x_k)_{k\in\mathbb{N}}\in\ell^1$ the sequence $\sum_{k=1}^{n} x_k y_k$ has a limit in $\mathbb{K}$ for $n\to\infty$. Prove that $y\in \ell^\infty$. I tried to define an operator $T_y: \ell^1\rightarrow \ell^1, (x_k)_{k\in\mathbb{N}}\mapsto  (x_ky_k)_{k\in\mathbb{N}}$, but as I do not know about absolute convergence of $(x_k y_k)_{k\in\mathbb{N}}$, I am not sure if it really maps to $\ell^1$.


I"m tryting to do sudo apt install youtube-dl but im getting the below error during installation.    E: Failed to fetch http://in.archive.ubuntu.com/ubuntu/pool/universe/t/tbb/libtbb2_4.4~20151115-0ubuntu3_amd64.deb  Temporary failure resolving 'in.archive.ubuntu.com'   also, as per suggestion  i do apt-get update --fix-missing  but not helping much


Ethernet RFID reader not connecting to PC

I have purchased a ACM812a RFID reader and want to connect it to my PC via an ethernet cable. I thought it would just be a plug and play application but it is rather becoming a frustrating issue. The RFID reader manual or lack of there of, doesn't provide an IP address for the reader. So I have researched that I can use Winshark to ascertain the IP address of the reader. However even this software fails to extract the IP address of the reader, see picture below. The IP address of the computer is 169.254.106.15.    The reader application is shown in the picture below. From the picture, you can see the application requires an IP address and a port number. Can someone please help to get the IP address of the reader and how to get the port number so I can run the RFID reader application? (The 6000 port no. and 192.168.1.192 IP address is just a dummy that default when the application opens).  The reader RJ45 connector has 4 wires connecting to the RJ45 connector and my ethernet cable connecting the reader to the PC as 8 wires. Is this also an issue?   The model of the router is: B315s - 936 Huawei     Pictures of reader:


Does Windows 10 OEM License will work if I replace the HDD and install the windows from Microsoft ISO

I have a Lenovo Ideapad 310 which sometimes going 100% Hard disk usage. I research on the internet and found out removing "system interface" software make work fine. I did it and performance of system increase. I remove every bloatware Lenovo add into my PC by default.  Today I got wasted 30 minutes. System hangs too much. If I update my system to SSD and install the Same windows 10 Home Edition which I have by download Windows 10 Recovery Media (Windows 10 Recovery tools) it's give me the ISO of my system.  Does my OEM licene will work. My system is 1TB and if I am getting 128 or 256GB SSD then what kind of issue will come.


Is there any way to convert a bunch of .ogg files in a folder to .mp3 using ffmpeg?

Is there any way to convert a whole heap of .ogg files in about 30 folders in a folder containing those folders to .mp3 files and put them in another folder using the command ffmpeg? The previous methods I have tried all led to the same error: "*.ogg no such file or directory"  If possible could you please tell me how? I cant find anything relating to this specific question.  Edit: I've tried to edit the command and now it's giving me this error: (this goes for all of the files in the folder)  /Users/Macbook/Downloads/Minecraft+Sound+Pack+1.13/step/wood6.ogg~/Downloads/Minecraft\ Sounds/step/wood6.mp3: No such file or directory   I used this:  $ for file in ~/Downloads/Minecraft+Sound+Pack+1.13/step/*.ogg  > do >     fullfilename=$(basename "${file}") >     filename="${fullfilename%.*}" >     ffmpeg -i "$file""~/Downloads/Minecraft\ Sounds/step/$filename.mp3" > done   I think it's trying to link both directories together.


Brand new to WordPress. Using it from GoDaddy and when I try to upload my video .mov file (it's only 10MB) I get an error saying it's not a valid media type. Any ideas? Thanks.


passing string of arguments in a url string

My variables:  var strArgsString = "?Category=Customer&Year=2014"; var intModuleNo = "2"; var strOrigDashName = "Invoices"   My AJAX Post:      var jqxhr = $.post("includes/saveParameters.asp?dname="+strOrigDashName+"&mod="+intModuleNo+"&args='"+strArgsString+"'", function() {     alert("success"); }) .fail(function() {     alert("error"); });   It returns a fail because the "args" value is treated as a continuation of the full query string.  Im sure there will be many ways to do this but how can i get "?Category=Customer&Year=2014" treated as a string on my .asp file?  At the moment I have these  strDashboardName = Request.QueryString("dname") intModuleNumber = Request.QueryString("mod") strParamsArgString = Request.QueryString("args")   Any solution appreciated, but preferance given to the most efficient, thanks.


I'm new to Java, and am having trouble understanding why the if/else statement in this code seems to believe the strings a and c are not equal.  public class Main {     public static void main(String[] args) {         String a = "foo";         String b = "Foo";         String c = b.toLowerCase();          System.out.println(c);          if (a == c) {             System.out.println("Strings are equal");         }         else {             System.out.println("Strings are NOT equal");         }     } }   Here is the output:  foo Strings are NOT equal   I'm using www.learnjava.org and their webservice to compile/execute code, if that matters.    Thanks


What is the Mediator in this Feynman Diagram $q\bar{q} \rightarrow gg$?

Let's consider the t-channel version of the process $q\bar{q} \rightarrow gg$. What is the mediator in this case, a $q$ or a $\bar{q}$? Naively, I would have thought a $q$ (as to have one fermion line), but I am not $100 \%$ sure.


Change size of section, subsection, subsubsection, paragraph and subparagraph title

I would like to increase the size of pretty much every headlines, so that it is more prominent than the normal text.  I read about the  package, but can't seem to find good example how to use the package.  Using Gonzalo Medina does in fact change the font size, however, it changes the default font as well.  Before:    After:


Why does removing the constant term prevent the dummy variable trap?

I understand that if you have a dummy variable with $m$ categories that you should include $m-1$ categories in order to avoid perfect collinearity between regressors. However I don't understand why removing the constant term prevents the issue of perfect collinearity, because all of the categories will still sum to 1. For example: Suppose we have a dummy variable 'gender', with the categories being male and female. If we include both categories in the model without an intercept, the model is given by $y = \beta_1male + \beta_2female$. Don't we still have the issue of perfect collinearity because $male + female = 1$? We could rewrite this as $male = 1 - female$ so the regressors are still perfectly collinear because there is an exact linear relationship between them. How has removing the intercept helped us? (I am yet to learn about matrix algebra, so please provide answers that do not require knowledge of matrix algebra if possible).


What is it that makes an electron maintain a distance from the positively charged nucleus? Why aren't electrons merely pulled into and absorbed by the nucleus ?


Power set of a finite set is finite proof, no cardinality of power set

Prove that $\mathcal{P}(A)$ of a finite set $A$ is finite.      I need to prove this without using the cardinality of $\mathcal{P}(A)$.  This is my attempt, which is by induction: $\newcommand{\lbrac}[1]{\left(#1\right)}$ $\newcommand{\sett}[1]{\left\{#1\right\}}$ $\newcommand{\pset}[1]{\mathcal{P}\lbrac{#1}}$ Proof by induction over cardinality.  If $A = \varnothing$, then $\pset{A} = \sett{\varnothing}$, which is finite.  Suppose that for a set $A$ of cardinality $n$, $\pset{A}$ is finite.  Let $A$ be a set of cardinality $n+1$. $A$ is not empty, since it is of cardinality $n+1 > 0$, and therefore pick some $x\in A$. It follows that $A = \lbrac{A-\sett{x}}\cup\sett{x}$. We claim that $$ \pset{A} = \pset{\lbrac{A - \sett{x}}\cup\sett{x}} = \pset{A - \sett{x}}\cup\sett{C | C\in\pset{A}\wedge x\in C} $$ Suppose $B\in\pset{A} = \pset{\lbrac{A-\sett{x}}\cup{x}}$. Then either $x\in B$ or $x\not\in B$. If $x\in B$, then $x\in B \wedge B\in\pset{A}\Rightarrow B\in C$. If $x\not\in B$ then $B\subseteq A - \sett{x}$.  \newline Either way, $B\in \pset{A - \sett{x}}\cup\sett{C | C\in\pset{A}\wedge x\in C}\Rightarrow \pset{A}\subseteq\pset{A - \sett{x}}\cup\sett{C | C\in\pset{A}\wedge x\in C}$.  Suppose $B\in\pset{A - \sett{x}}\cup\sett{C | C\in\pset{A}\wedge x\in C}$. Then either $B\in\pset{A-\sett{x}}$ or $B\in\sett{C | C\in\pset{A}\wedge x\in C}$ (or both).  If $B\in\pset{A-\sett{x}}$, then $B\subseteq(A-\sett{x})\cup\sett{x} = A$, and if $B\in\sett{C | C\in\pset{A}\wedge x\in C}$, then by definition, $B\subseteq A$. Either way, we get that $B\in\pset{A} \Rightarrow \pset{A - \sett{x}}\cup\sett{C | C\in\pset{A}\wedge x\in C} \subseteq \pset{A}$.  Since we have shown both sets are contained in each other, they are equal.  My goal is to now prove that $\sett{C|C\in\pset{A} \wedge x\in C}$ is finite. I didn't manage to do so without non rigorous claims that could also "prove" the main question.  If this set is finite, and by induction hypothesis $\pset{A - \sett{x}}$ is finite, I'll be done.  Any ideas on how to prove $\sett{C|C\in\pset{A} \wedge x\in C}$ is finite?


I need to write this equation  See that below argmin there is a w, I am not getting how to write like that. Any help will be appreciated. Thank you.


Number of valid weight combinations in an ANN

Is it correct to assume that there is an infinite number of combinations of weights that a neural network can have in its connections in order to produce a specific output when given a certain set of inputs?  In other words, when we are training a neural network using backpropagation, does it mean that we are not looking for the only possible ideal configuration but rather for one out of an infinite number of ideal configurations?  Is there proof for either of the situations?


StackExchange is not defined - All Browsers

I'm currently not able to use Stackoverflow, AskUbuntu and I suppose many other websites using the same engine as the CSS seems to not appear. I've tried clearing cookies, I'm running on Ubuntu and the issue is happening both in Mozilla and in Chrome. Screen looks like this  . I've seen other posts with this problem, but none of them resolved my issue. Here's console  code that I get:  Failed to load resource: net::ERR_CONNECTION_REFUSED http://cdn.sstatic.net/stackoverflow/all.css?v=fa3753e2f985 Failed to load resource: net::ERR_CONNECTION_REFUSED http://cdn.sstatic.net/Js/stub.en.js?v=870bf30df33b Uncaught ReferenceError: StackExchange is not defined (index):27 Uncaught ReferenceError: StackExchange is not defined (index):36 Uncaught ReferenceError: StackExchange is not defined (index):215 Uncaught ReferenceError: StackExchange is not defined (index):306 Uncaught ReferenceError: StackExchange is not defined (index):3185 Failed to load resource: net::ERR_CONNECTION_REFUSED http://edge.quantserve.com/quant.js Failed to load resource: net::ERR_CONNECTION_REFUSED


Do I have to move swap partition to the right side?

According to  I just expand my sda4 to include unallocated space, my question is after create 2 new partitions sda7, sda8, do I need to move the swap partition to the most right of the disk? (I really don't know this, I saw  which moving the swap partition to the right side)  Thanks.


Is an account merge a valid work around to have Two-Factor Authentication in my account?

I log into my SE account with SE. And I read that they won't be adding support for 2FA. But there's no article informing a work around for the people who signed up with SE in the first place.  First I thought I could  with a site supporting 2FA and remove the SE login. But there's no way to remove the first login.  there was a way to remove logins but it's not working.  So my last hope is I can create another SE account and sign up with a site supporting 2FA, and then follow the  and hope that they leave the second account's login as the only one (something I'm not sure will happen).  Thanks in advance for any help you can give me. I hope I'm not seeing something and there's a much more simpler solution.


Finitely many prime ideals lying over $\mathfrak{p}$

Let $A$ be a commutative ring with identity and $B$ a finitely generated $A$-algebra that is integral over $A$.  If $\mathfrak{p}$ is a prime ideal of $A$, there are only finitely many prime ideals $P$ of $B$ such that $P\cap A=\mathfrak{p}$.   Let me say that I am aware of  answer, but I can't follow through the hint.  Also, I don't know how to extend to work for algebras rather than extension rings.