Have a simple form with few inputs as a filter criteria. Selecting these and clicking on a submit button executes a callback function that returns a table and a pager.  Code:  //submit button $form['action'] = [ '#prefix' => '
', '#name' => 'ajax_action', '#type' => 'button', '#value' => $this->t('Submit'), '#ajax' => [ 'callback' => '::setMessage', 'wrapper' => 'scrollable', 'method' => 'replace', 'effect' => 'fade',      ], '#suffix' => '

', ];   //table element     $form['table'] = array(    '#prefix' => '

View Data
',    '#type' => 'tableselect',    '#header' => $header,    '#options' => $options,    '#disabled' => $disabled,    '#attributes' => array('id' => 'sort-table'),    '#empty' => t('Select criteria and search data'),     );  //pager element       $form['pager'] = array(   '#type' => 'pager',  '#suffix' => '
',   );   //function to obtain #options               if ($form_state->getTriggeringElement()['#name'] == 'ajax_action') {                 $options = array();         $header = [             'subject_id' => t('Subject ID'),             'ct_availability' => t('CT Availability'),              'sex' => t('Sex'),              'race' => t('Race'),              'cardiovascular_disease' => t('Cardiovascular Disease'),              'registration_age' => t('Registration_Age'),                 ];                $options = $this->getOptions($form_state); //function to get #options          $form['table']['#header'] = $header;         $form['table']['#options'] = $options;         }   //callback function  public function setMessage(array $form, FormStateInterface $form_state) { return (array($form['table'], $form['pager']));   }  This gives the ajax response including a table with the data and a pager The pager has rendered fine but the problem here is that, clicking on it would redirect leading to an error:  "An unrecoverable error occurred. The uploaded file likely exceeded the maximum file size (125 MB) that this server support."  Which I believe is due to the url leading to invalid redirection as below:     hostname/search_data_form?ajax_form=1&_wrapper_format=drupal_ajax&page=1   I've referred to a similar problem form this   But here I'm not theming the form in any twig file and have a challenge to understand how to make the pagination work within the area having table as an ajax response.  Have also referred to another    which suggests to replace the url but the whole page gets reloaded with such approach.  Is there a suitable working approach to have a table with pagination as an ajax response?

So i'm trying to submit a form using ajax, in my form i have the following:          $form['actions']['#type'] = 'actions';         $form['actions']['submit'] = array(         '#type' => 'submit',         '#value' => $this->t('OK'),         '#button_type' => 'primary',         '#prefix' => '
',         '#suffix' => '

',         '#attributes' => array(             'class' => array('proximabold', 'tc', 'transition', 'no-underline', 'ph3', 'pv2', 'mb2', 'dib', 'white'),         ),         '#ajax' => [             'event' => 'click',             'callback' => '::updateTable',             'wrapper' => 'table-wrapper',             'progress' => [                 'type' => 'throbber',                 'message' => t('Verifying entry...'),             ],         ],     );   and a simple updateTable function:  public function updateTable(array $form, FormStateInterface $form_state) {     return "Hello World"; }   But when i click on submit i get the error: An unrecoverable error occurred. The uploaded file likely exceeded the maximum file size (2 MB) that this server supports.  I knew that the error is server side (Maybe i'm wrong), so i went to php.ini (i use PHP7) and update the following lines:  post_max_size = 6144M memory_limit = 6144M upload_max_filesize = 6144M max_file_uploads = 1000   but without luck, this configuration shouldn't be necessary as the request size is only 1.5KB


$f:[0,1] \to \mathbb R$ is a continuously differentiable function, and $f(\frac{1}{2})=0$. I'm trying to show $$( \int_0^1{f(x)} \, dx)^2 \le \frac{1}{4} \int_0^1 (f'(x))^2  \, dx $$ I tried using the mean value theorem but got nowhere.  Are there any hints? Thank you!

Let $f\in C^{1}[0,1]$ such that $f(0)=f(1)=0$. Show that   $$\left(\int_{0}^{1}f(x)dx\right)^2\le\dfrac{1}{12}\int_{0}^{1}|f'(x)|^2dx.$$   I think we must use Cauchy-Schwarz inequality  $$\int_{0}^{1}|f'(x)|^2dx\ge \left(\int_{0}^{1}f(x)dx\right)^2$$ but this maybe is not useful to problem.  The coefficient $\dfrac{1}{12}$ is strange. How find it ?


I have lots of lines (in one feature class) which share the same location but I want to represent them as lines that are next to each other because they have different properties (different OWNERS).  So, my first try was transforming them in "Cartographic Line Symbol' -> 'Line Properties' set my offset different for each one. Which is fine except:    As you can see when I choose to represent the lines according to their owner (color= owner). The offset works great, but I need all the lines to be connected and sink in a junction. Something like this:    So I tought the solution is to create a representation, but not sure how to use a text field (OWNERS) in order to create those parallel lines (the equivalent of Symbology->Categories-> Unique Values-> Value field: OWNER). I know I should use the offset geometric effect. but I'm not sure if this is the solution and how should I do that.  I am using ArcGIS Desktop 10.1.

Some common problems with displaying routes created from street data, such as bus routes, include:   Routes may overlap themselves, such as when a route takes the same road in opposite directions Routes may overlap other routes that take the same street. Routes are often overly detailed, or "noisy", owing to their derivation from street data. Indicating a route's direction unambiguously without overloading it with arrows can be a challenge.   What are some techniques for dealing with these issues in order to create a practical and usable route map, such as this ? Do you know of any such public transport maps that were produced by automatic techniques rather than manual illustration/digitization?  Specifically I am using ArcGIS 10, but solutions involving other software are welcome as well.  One technique I have had some success with for dealing with 1) is using ArcMap's  with a negative offset -- assuming the lines are oriented in the direction of travel, this will offset the lines such that the right and left-hand sides are distinct and oriented as you would expect (at least for  countries, for left-hand traffic countries one would use a positive offset). However the result tends to be a bit wonky around turns, interchanges and and U-turns, and is inflexible when dealing with multiple routes.  Another possibility that I am not very familiar with but which seems promising is  -- however, I have not had much luck in finding examples of using representations for transportation maps and whether it might fit the bill.


My site size is 25GB & Server Space (Ubuntu 16.04) is 25GB, /dev/xda1 shows 19M free, but still it shows xvda1 is 100% full. Any Fix?

I'm using Ubuntu 11.04 and I want to free up some space in my root directory, which is overloaded. I especially want to change the path used for installing applications (they are getting installed directly to the root drive).  Another consideration is that I'm working on a MySQL database server. The server is installed in the root directory itself, so I don't want to  risk losing any data.  Please give me some tips to help sort out this problem.


The Danish movie Jagten (2012), a.k.a The Hunt, ends with Mads Mikelsen escaping from a shooter. I remember that when I saw the movie, they had shown the shooter to be his son. But according to ,      On a hunting expedition to commemorate the event, an unseen person   apparently shoots at Lucas and misses him. Blinded by the setting sun,   Lucas is unable to identify his attacker, who is apparently reloading.   A moment later the unknown shooter, real or metaphor, is no longer ther.   Could anyone tell me if there are two ending versions of the film, or am I wrong here?

At the end of , during the deer hunt, there’s a shot fired right next to Lucas (deliberately missing the shot).   Who fired the shot? Is it Theo's son? What is the meaning of that scene? Is someone warning Lucas that he made a mistake and definitely, Lucas will be punished in the future?


What is "spin" as it relates to subatomic particles? I've heard that it's similar to angular momentum but I've also heard that's not completely the case.

This may seem like a slightly trite question, but it is one that has long intrigued me.  Since I formally learned classical (Newtonian) mechanics, it has often struck me that angular momentum (and generally rotational dynamics) can be fully derived from normal (linear) momentum and dynamics. Simply by considering circular motion of a point mass and introducing new quantities, it seems one can describe and explain angular momentum fully without any new postulates. In this sense, I am lead to believe only ordinary momentum and dynamics are fundamental to mechanics, with rotational stuff effectively being a corollary.  Then at a later point I learned quantum mechanics. Alright, so orbital angular momentum does not really disturb my picture of the origin/fundamentality, but when we consider the concept of spin, this introduces a problem in this proposed (philosophical) understanding. Spin is apparently intrinsic angular momentum; that is, it applies to a point particle. Something can possess angular momentum that is not actually moving/rotating - a concept that does not exist in classical mechanics! Does this imply that angular momentum is in fact a fundamental quantity, intrinsic to the universe in some sense?  It somewhat bothers me that that fundamental particles such as electrons and quarks can possess their own angular momentum (spin), when otherwise angular momentum/rotational dynamics would fall out quite naturally from normal (linear) mechanics. There are of course some fringe theories that propose that even these so-called fundamental particles are composite, but at the moment physicists widely accept the concept of intrinsic angular momentum. In any case, can this dilemma be resolved, or do we simply have to extend our framework of fundamental quantities?


My understanding is that you take the square and then the square root so that positive and negative distances from the mean don't cancel each other out. But if that's the case, why don't you immediately take the square root after the square?

Today I taught an introductory class of statistics and a student came up to me with a question, which I rephrase here as: "Why is the standard deviation defined as sqrt of variance and not as the sqrt of sum of squares over N?"  We define population variance: $\sigma^2=\frac{1}{N}\sum{(x_i-\mu)^2}$   And standard deviation: $\sigma=\sqrt{\sigma^2}=\frac{1}{\sqrt{N}}\sqrt{\sum{(x_i-\mu)^2}}$.   The interpretation we may give to $\sigma$ is that it gives the average deviation of units in the population from the population mean of $X$.   However, in the definition of the s.d. we divide the sqrt of the sum of squares through $\sqrt{N}$. The question the student raises is why we do not divide the sqrt of the sume of squares by $N$ instead. Thus we come to competing formula: $$\sigma_{new}=\frac{1}{N}\sqrt{\sum{(x_i-\mu)^2}}.$$ The student argued that this formula looks more like an "average" deviation from the mean than when dividing through $\sqrt{N}$ as in $\sigma$.  I thought this question is not stupid. I would like to give an answer to the student that goes further than saying that the s.d. is defined as sqrt of the variance which is the average squared deviaton. Put differently, why should the student use the correct formula and not follow her idea?  This question relates to an older thread and answers provided . Answers there go in three directions:   $\sigma$ is the root-mean-squared (RMS) deviation, not the "typical" deviation from the mean (i.e., $\sigma_{new}$). Thus, it is defined differently. It has nice mathematical properties. Furthermore, the sqrt would bring back "units" to their original scale. However, this would also be the case for $\sigma_{new}$, which divides by $N$ instead.   Both of points 1 and 2 are arguments in favour of the s.d. as RMS, but I do not see an argument against the use of $\sigma_{new}$. What would be the good arguments to convince introductory level students of the use of the average RMS distance $\sigma$ from the mean?


First attempt: sudo apt install libpcap-dev Result:    Reading package lists... Done     Building dependency tree            Reading state information... Done     Some packages could not be installed. This may mean that you have     requested an impossible situation or if you are using the unstable     distribution that some required packages have not yet been created     or been moved out of Incoming.     The following information may help to resolve the situation:      The following packages have unmet dependencies.      libpcap-dev : Depends: libpcap0.8-dev but it is not going to be installed     E: Unable to correct problems, you have held broken packages.   Ok, so I should install libpcap0.8-dev:  sudo apt install libpcap0.8-dev   Result:  The following packages have unmet dependencies.  libpcap0.8-dev : Depends: libpcap0.8 (= 1.8.1-6) but 1.8.1-6ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages.   So I need to install libpcap0.8:  sudo apt install libpcap0.8   Result:  Reading package lists... Done Building dependency tree        Reading state information... Done libpcap0.8 is already the newest version (1.8.1-6ubuntu1). 0 to upgrade, 0 to newly install, 0 to remove and 1377 not to upgrade.   Yay! It worked, so now all I need to do:  sudo apt install libpcap0.8-dev   Result:  The following packages have unmet dependencies.  libpcap0.8-dev : Depends: libpcap0.8 (= 1.8.1-6) but 1.8.1-6ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages.   Oh. Any ideas?

There are now errors when updating and I cannot install most software due to a corrupted  /etc/apt/sources.list   file. Is there a copy I can download to replace it?  The file would be for Ubuntu 12.04 (Final Beta) in the United States.


When I executed the command:  curl https://piwik.openstreetmap.org/piwik.php?idsite=1   I received a warning that binary output can mess up my terminal, which, yes it did having ignored the warning, so my first question is why does binary output mess up the terminal?  I then passed the output to a text file as follows:  curl https://piwik.openstreetmap.org/piwik.php?idsite=1 > binaryFrom_Openstreetmap_php.txt   And this did not result in erroneous output, rather the verbose output in the terminal was:  % Total    % Received % Xferd  Average Speed   Time    Time     Time  Current                                  Dload  Upload   Total   Spent    Left  Speed 100    43  100    43    0     0     17      0  0:00:02  0:00:02 --:--:--    17   Now the second question is, having observed the following to be the content of the text file:  GIF89a  €        !ù    ,       D ;   How is this binary when there are more than two characters? Unless I've been misusing the word binary my entire life, I cant discount that possibility entirely.  And thirdly, when viewed in a text editor on a Linux OS the characters are different to what is displayed when this file is viewed in a Windows 10 OS, why?

If I understand the cat manual correctly:       concatenate files and print on the standard output   cat will take files as argument and print them on standard output. What I don't get is if I use the command:    cat img.png > copy.png   I will obtain 2 png files identical while if I just    cat img.png     I have all chance that my terminal get messed up and misinterpret what I type.     How's that possible?   Binary values are still binary data. Why it does not simply shows a series of 0 and 1 or the interpretation of those binary data in ASCII or whatever the encoding in terminal is?   Is this behavior also possible by cating a text file containing strange characters?   Should a mechanism to prevent this behavior  like try{}catch{} statement should be implemented?


First of all, my previous question was closed bcz it was considered as a duplicate.  But it is not.  I've checked for duplicate links and the link is irrelevant because it only discusses image numbering. So, i'll ask again for the same topic. I want the numbered tag on \begin{align} based on the section. So, for example if i have section 2.3 (2.3 means Chapter 2 and Section 3) my tag must be automatically 2.3.1, 2.3.2,, and so on. Can you help me? Thanks in advance My MWE: \documentclass{book} \usepackage{blindtext} \usepackage{amsmath}  \begin{document} \chapter{One} \section{one} \blindtext \chapter{Two} \section{one} \blindtext \section{two} \blindtext \section{three} \begin{align} c = \sqrt{a^2 + b^2} \end{align} \end{document}  To be clear the result of my equation should be:

Some document elements (e.g., figures in the book class) are numbered per chapter (figure 1.1, 1.2, 2.1, ...). How can I achieve continuous numbering (figure 1, 2, 3, ...)?  And vice versa: Some document elements (e.g., figures in the article class) are numbered continuously. How can I achieve per-section numbering?  \documentclass{book}% for "vice versa" variant, replace `book` with `article`  \begin{document}  \chapter{foo}% for "vice versa" variant, replace `\chapter` with `\section`  \begin{figure} \centering \rule{1cm}{1cm}% placeholder for graphic \caption{A figure} \end{figure}  \end{document}   Bonus question: Is it possible to adjust the numbering of the sectioning headings themselves? Can I, e.g., switch from per-chapter to continuous numbering of sections in the book class?


Does anyone have a reference to an explicit formulation of multiple regression, but in which the bias term is taken out and treated separately? I would especially be interested if either ridge regression and/or press residuals are also treated.

I am running linear regression models and wondering what the conditions are for removing the intercept term.   In comparing results from two different regressions where one has the intercept and the other does not, I notice that the $R^2$ of the function without the intercept is much higher. Are there certain conditions or assumptions I should be following to make sure the removal of the intercept term is valid?


From  post I found that the error "This edit would have to be a suggested edit" occurs because there has already been an edit suggested for the same post, but the error message is still confusing. Can the error "This edit would have to be a suggested edit" be made more verbose?

I was testing some behavior with a low rep account, and when I was trying to suggest a few edits, I was greeted with the following message when trying to submit an edit:    Huh?!?!?!  It was a suggested edit, so why are you telling me it needs to be a suggested edit?  Turns out it was a suggested edit conflict.  The post in question had an existing suggested edit by the time I tried to submit mine.  For brand new users, this is certainly not ideal behavior as it is only confusing to them.  Can this message be changed to something more descriptive?  Or at least less confusing?  I would suggest     This edit cannot be submitted as there is a pending suggested edit on this post.     Note there is a question that looks similar, but is essentially different:  This is a feature request asking that the language be changed, while the other is a support question asking, basically, what it means.


how to calculate this？I have some indistinct memory that it can be solved by induction, but I forget how to do it.

Is there explicit formula for the expression $1^n + 2^n + \dotsc + k^n\,$?  I know that for $n=1$ the explicit formula becomes $S=k(k+1)/2$ and for $n=3$ the formula becomes $S^2$. But what about general $n$?  I know there is a way using the Taylor expansion of $f(x)=1/(1-x)=1+x+x^2+\dotsc\;$, by differentiating it and then multiplying by $x$ and then differentiating again. Repeating this $n$ times, we get  $$\frac{d}{dx}(x\frac{d}{dx}(\dots x\frac{d}{dx}f(x))\dots )=1+2^nx^n+3^nx^n\dots.$$  Now do the same process but with the function $g(x)=x^{k+1}f(x)$. Then subtract them and we get $1+2^nx^n+\dots k^nx^n$. Because we have the explicit formulas $f(x)$ and $g(x)$ we can find the explicit formula by this process for arbitrary $n$. A big problem is that as $n$ grows, it is going take a lot of time finding the explicit formula. My question is therefore: are there other ways?


Context: I am making a switch debouncing wrapper class for InterruptIn called Switch. Switch will allow a user to attach their own function which should be called-back when a real-world switch is pressed and debounced. I'm using Eclipse C++ with the arm-none-eabi-* toolchain.  First off, I found three ways of implementing callbacks with mbed:   The FunctionPointer class, which is deprecated by ARM, but  (with broken hyperlinks to information I think I need). Callback<void()>, the compiler informs me this is The Right WayTM to do callbacks when trying to use deprecated FunctionPointer, but no documentation? event_callback_t, no documentation, and the function responsible for calling the user's attached function takes an int as a parameter?   I'll be using the Callback<void()> way to show the problem I'm having, but all three ways produce the same compile error.  Switch.h:  #ifndef MBED_SWITCH_H #define MBED_SWITCH_H  #include "mbed.h"  class Switch {     private:         Callback<void()> callback_press_;         InterruptIn switch_;          //redacted some debouncing stuff      public:         Switch(PinName pin, bool isActiveHigh);         Switch(PinName pin, bool isActiveHigh, int samplePeriod_us, int sampleCount);          void attachPress(Callback<void()>); //THE PROBLEM FUNCTIONS         template<typename T, typename F>         void attachPress(T* object, F function); };  #endif   Switch.cpp:  #include "Switch.h" #include "CustomNames.h"   // redacted constructors here   //  redacted debouncing functions here   // for attaching a function not associated with any particular class void Switch::attachPress(Callback<void()> function) {     callback_press_.attach(function); }   // for attaching a member function of some other class template<typename T, typename F> void Switch::attachPress(T* object, F function) {     callback_press_.attach(object, function); }   The Problem  Everything compiles, links, and works fine in the real world if I use the first candidate function attachPress(Callback<void()> function) to attach a function not associated with any particular class.  However, when I try to attach a specific member function "testfunc1(void)" of another class "Test" with the second candidate function, I get the following error (from the linker, I think):  Test.o: In function `Test::Test()': Test.cpp:(.text._ZN4TestC2Ev+0x1e): undefined reference to `void Switch::attachPress<Test, void (Test::*)()>(Test*, void (Test::*)())' /home/yankee/programming_projects/cpp-eclipse/SO_EXAMPLE/Makefile:97: recipe for target 'HW4_RACE.elf' failed collect2: error: ld returned 1 exit status Makefile:21: recipe for target 'all' failed make[1]: *** [HW4_RACE.elf] Error 1 make: *** [all] Error 2  03:10:35 Build Finished (took 165ms)   Why is this giving me "undefined reference", and is there a way to fix it?

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


It seems that many flavor and food preferences can be explained in the context of regulating feeding behavior. Generally, organisms tend to enjoy those foods which are optimal for them to feed on and provide the best nutrition. There are well-known exceptions to this, such as:   Artificial chemicals (eg. the supposedly sweet-tasting but deadly polyethylene glycol) which are very rare in nature, thus there was no opportunity for an appropriate taste perception to evolve Nutrients which are desirable in moderation but dangerous in excess (eg. sugar), but have only become readily available recently thanks to technology (thus once again moderated consumption has not had opportunity to evolve)   But humans in particular also seem to enjoy consuming a large variety of foods that one would expect to be unpalatable or mildly harmful. For instance various peppers, spices, hot sauces, wasabi, mustard and so forth, don't appear to provide much of a nutritional benefit. Indeed their chief property of interest, the spicy flavor, is a defense mechanism: The plant attempts to make itself unpalatable or toxic to deter predation. Why is it then that this very defense mechanism has ironically become prized as a food ingredient by humans, to such an extent that wars have been fought over access to spices? And why is it that humans do not consider (for instance) pure, fresh, raw meat to be more delicious than meat with seasoning or condiments?    There has been a similar question (see comments) on here but that has also not attracted a good answer. I think this exemplifies the enduring interest in the subject and as such I'd like to keep this question open to stimulate a better response from more recent visitors.

Peppers evolved chemicals like capsaicin to discourage animals from eating them, and that chemical itself can cause internal damage if consumed in large quantities, though this is usually only a concern for the hottest of peppers (which people do eat).   Still, why is it that humans seem to be the only animal that often "like" spicy food?


Denote $M_n(\mathbb R)$ to be the vector space of all real matrices of order $n$. Assume $W$ is a linear subspace of $M_n(\mathbb R)$, and $\dim W \geqslant n^2-n+1$. Prove that $W$ contains at least one non-singular matrix.  I am clueless about this question. Can anyone help?

I am sure the answer to this is (kind of) well known. I've searched the web and the site for a proof and found nothing, and if this is a duplicate, I'm sorry.  The following question was given in a contest I took part. I had an approach but it didn't solve the problem.     Consider $V$ a linear subspace of the real vector space $\mathcal{M}_n(\Bbb{R})$ ($n\times n$ real entries matrices) such that $V$ contains only singular matrices (i.e matrices with determinant equal to $0$). What is the maximal dimension of $V$?   A quick guess would be $n^2-n$ since if we consider $W$ the set of $n\times n$ real matrices with last line equal to $0$ then this space has dimension $n^2-n$ and it is a linear space of singular matrices.  Now the only thing there is to prove is that if $V$ is a subspace of $\mathcal{M}_n(\Bbb{R})$ of dimension $k > n^2-n$ then $V$ contains a non-singular matrix. The official proof was unsatisfactory for me, because it was a combinatorial one, and seemed to have few things in common with linear algebra. I was hoping for a pure linear algebra proof.  My approach was to search for a permutation matrix in $V$, but I used some 'false theorem' in between, which I am ashamed to post here.


I would like to light up a 3W LED from Cree having a forward voltage of 2.9 V at 350 mA. It's maximum drive current is 1 A and gives 300 lumens/m2 output. I am considering lighting up this LED using supercapacitors.     The objective is to light the LED for 5 hours.   Based on this objective, I tried to calculate the capacitance required in reverse using the following formula:  (Energy stored in the capacitor)/(Power of the LED) = Time required for the LED to glow)  Additionally, I came to know that If a switching circuit is used, the losses for the supercapacitor charging operation would be less as a resistor dissipates 50 percent of the input energy. If the voltage drop across this circuit is 1 V, then taking this into account as well, I obtain:  \$\frac{\frac12 C V^2 - \frac12 C 1^2}{1.05(P_{led})} = 5\text{ h}\$  As the supercaps are generally rated at 2.7 V, I substitute V to be 2.7 and obtain the capacitance to be 18270 F which is extremely high. I needed to cross verify the theoretical capacitance required to get this LED to glow for 5 hours is right or not.  If I go for a 2.7 V, 500 F supercapacitor, I am obtaining the LED to glow for 30 minutes.  From what I have read about the supercaps, the charging rate is quite high for the supercaps, and assuming that I am generating electricity simultaneusly to charge the supercap and simultaneously light the LED, Would it be feasible?  I am imagining the 2.7 V 500 F supercap as a big tank with an inlet and an outlet. The inlet is quite high because of high charging rate whereas the outlet rate is slower. The inlet rate is 5 W and the outlet rate is given to the 3 W LED.  I am giving a 5 W power input using the right switching circuit to feed it into the supercapacitor. If this is the case, would I be able to instantaneously light this LED. If not how? What would be the right circuit I should implement to use it as a buffer.

I have a bright white LED from a flashlight. Aproximatley How long will it light up with a 150 farad 2.5 volt capacitor. Do I need a resistor? And if so how many Ω? The capacitor is a maxwell 150 farad 2.7 volt boostcap .


I Want to verify Email Address without sending an Email because when we know it's invalid Email, So why i send Email

I need to send hundreds of newsletters, but would like to check first if email exists on server. It's called  validation, at least I think so, based on my research on Internet.    There's several libraries that can do that, and also a page with open-source code in  (), but I have hard time reading ASP Classic, and it seems that it uses some third-party library...    Is there some code for SMTP validation in C#, and/or general explanation of how it works?


According to this video, faster than light travel is analogous to time travel. Does this mean that if I could instantly teleport 1 light year away, and then sent a laser pulse to my friend, my friend would interpret the event as happening in the past?  Would it take him a year to see the pulse? Or would he see it immediately and interpret that the event occurred 1 year ago? The video I mentioned seems to suggest that my friend would interpret the event as happening in the past, I wanted to confirm.  What do they mean when they say that faster than light travel analogous to time travel?

Let's say I have two planets that are one hundred thousand lightyears away from each other. I and my immortal friend on the other planet want to communicate, with a strong laser and a tachyon communication device.  I record a message on the tachyon communication device and release the message at exactly the same time as I activate the laser, both of which are directed to the other planet which is one hundred thousand lightyears away. Say it is the year 0 for both of us at the time I did this.  If tachyons existed, then the message would arrive to my friend before the photons in the laser. It would arrive, say, a thousand years earlier. From my vantage point, that message will arrive to her at year 99,999; the same would be true for my friend's vantage point. However, she will only see the laser at year 100,000.  So since she got the message at year 99,999, she immediately sends me a reply back going through the same procedure as I did. She records a message and releases it at the same time as the laser. The tachyons will arrive 1,000 years earlier than the laser, so for me, I will receive the message at year 199,998. I will receive the laser, however, at year 199,999.  It seems to me that communication this way does not violate causality. I will still have received the message after I had sent it.   If tachyons truly violated causality, though, I realize it should arrive at year -1 for her, and so she can reply to me at year -2, which would mess me up by year 0 as I will ask her how she knew I was planning on sending her a message before I sent it. I could send her a different message, which she would end up receiving at year -1, and will end up confusing her as she would have received one message asking her out, and the other asking her how did she know I was asking her out. She then decides I am crazy and sends me a message at year -2 that she does not want to date me, and so she will have both turned me down and entertained me before I have even asked her out.  On the other hand, let's go back to year 0 and add a third device to our list: an Alcubierre drive. After I send out the message and the laser, I get impatient and do not feel like waiting 99,999 years, so I get on my Alcubierre drive spaceship and arrive on her planet at the same year 0. My friend is not in her office, so I leave a note to her also immortal secretary saying I dropped by and that she should expect a message for her in year 99,999.  I then get back on my Alcubierre drive and land back on my planet, still on year 0. Meanwhile, the tachyons and photons I sent out are still racing to arrive to her. By year 99,999, she receives the message just as I Alcubierre drive back to her, and I pick her up for dinner.  But the point of my question is, it seems to me that just going faster than light, if that alone was what you had, would not violate causality. It must be something else. I understand time dilation and that things with mass cannot travel at the speed of light, but using the Alcubierre drive, hypothetically speaking, I was still able to outpace the photons while also having mass. It still did not produce causality problems. Alcubierre drives are also valid solutions to GR.  It seems circular to me to say that what makes traveling faster than light violate causality is because it violates causality (if faster than light communication was divorced from causality problems, then the causality problem would cause itself -- thereby violating causality and, hence, we would scrap it and conclude that there is no causality problem after all).  What is it that I am missing? If someone could help me out, that would be excellent. I've been itching to ask my friend out for a few millenia now. :)


I've got a question about the distribution of the random variable $Y = X_{1}X_{2}$, where $X_i \sim \operatorname{N}(0,1)$, and $X_1$, $X_2$ independent.  Specifically, I need to find the MGF of $Y$.  Here's what I've tried:  The $r^\text{th}$ moment of $Y$ is given by:  $$\begin{align} \operatorname{E} (Y^r) & = \operatorname{E} (X_1^r X_2^r) \\ & = \operatorname{E} (X_1^r) \operatorname{E} (X_2^r) & \text{because } X_1 \text{ and } X_2 \text{ are independent} \\ \end{align}$$  Since $X_i \sim \operatorname{N}(0,1)$, I know that the $r^\text{th}$ central moment is given by:  $$ \operatorname{E}(X_i^r) = \begin{cases} 0       & r \text{ odd} \\ (2r-1)! & r \text{ even} \\ \end{cases}$$  Because $\operatorname{E}(X_i^r)$ does not depend on $i$, $\operatorname{E} (X_1^r) = \operatorname{E} (X_2^r)$ and so  $$\operatorname{E} (X_1^r) \operatorname{E} (X_2^r) = ((2r-1)!)^2 \quad \text{for } r \text{ even}$$  But I can't really derive a formula for the $r^{\text{th}}$ integral, especially if I don't know how the formula for $\operatorname{E}(X_i^r)$ looks before plugging in $t=0$.   Are there other ways to derive the MGF of $Y$?   EDIT:  I also need to show that $Y$ can be expressed as a difference of two independent, Gamma-distributed variables.

We are given two independent standard normal random variables $X$ and $Y$. We need to find out the M.G.F of $XY$.  I tried as follows : \begin{align} M_{XY}(t)&=E\left(e^{(XY)t}\right)\\&=\int_{- \infty}^{\infty}\int_{- \infty}^{\infty}e^{(XY)t}f_X(x)f_y(y)dxdy \\ &=\dfrac{1}{2\pi}\int_{- \infty}^{\infty}\int_{- \infty}^{\infty}e^{(xy)t}e^{\frac{-x^2}{2}}e^{\frac{-y^2}{2}}dxdy \\ &= \dfrac{1}{2\pi}\int_{- \infty}^{\infty}\int_{- \infty}^{\infty}e^{-\dfrac{(x-ty)^2}{2}}e^{\dfrac{-t^2y^2}{2}}e^{\frac{-y^2}{2}}dxdy \\ &= \dfrac{1}{\sqrt{2\pi}}\int_{- \infty}^{\infty}e^{\dfrac{-t^2y^2}{2}}e^{\frac{-y^2}{2}}dy \\ &= \dfrac{1}{\sqrt{2\pi}}\int_{- \infty}^{\infty}e^{-y^{2}(\frac{1}{2}+t^2)}dy \\ &= \dfrac{1}{\sqrt{1+2t^2}} \end{align} Is this correct ?


I have the posterior distribution P(a,b|c). I would like to find the marginal posteriors P(a|c) and P(b|c). I am not sure if a,b are conditionally independent given c.   I know how to calculate the marginal probability when there is no conditioning. I am confused as to how to go about it when there is conditioning.   Any help is appreciated. Thanks in advance.

I am looking at part a) and I have found the marginal p.f for $Y$ to be $e^{-2}2^{y}/y!$. I have set up for the equation for the marginal p.f for $X$ but I have no idea how to start it. Help would be appreciated.


I checked one of the other  - and I still seem to have a different equation than they offer (as far as I can tell). I'll use the notation the books used, btw.  In one of my reference books, they first derived the Rayleigh-Jeans formula (I can include how they derived it, if that will help):  $$u(v,T) = \frac{8\pi v^2}{c^3}k_BT,$$  ($k_B$ - Boltzmann constant, $v$ - frequency, $T$ - temperature)  Then they "re-derived" Planck's formula by replacing the integral with the summation and ended up with:  $$u(v,T) = \frac{8\pi v^2}{c^3} \frac{hv}{e^{\frac{hv}{kT}}-1}$$  ($h$ - Planck constant)  However, the next book I looked at puts Planck's Law in terms of $\lambda$:  $$u(\lambda) = \frac{8 \pi hc\lambda^{-5}}{e^{\frac{hc}{\lambda kT}}-1} = \frac{8\pi}{\lambda^5}\frac{hc}{e^{\frac{hc}{\lambda kT}}-1}$$  By the way, the Rayleigh-Jeans law the second book derived is:  $$u(\lambda) = \frac{8\pi kT}{\lambda^{-4}}$$  My questions are:  If both functions are valid, why are only one of them mentioned in each book?  Why can't I find the function with $v^2$ on Wiki, or PSE... is the first book wrong?

I am drawing a blank when it comes to equation transformation. Wikipedia  for the spectral radiance of black body:   First as a function of frequency $\nu$: $$I(\nu, T) = \frac{2 h \nu^3}{c^2}\cdot\frac{1}{e^\frac{h \nu}{k T} - 1}$$ Then as a function of wavelength $\lambda$ : $$I'(\lambda, T) = \frac{2hc^2}{\lambda^5}\cdot\frac{1}{e^\frac{h c}{\lambda k T}-1}$$   And I don't see how they get $\lambda^5$ term. I'm assuming that the transformation is just $\nu \rightarrow c/\lambda$, but that gives $$ \frac{2 h \nu^3}{c^2} \Rightarrow \frac{2 hc}{\lambda^3} \neq \frac{2hc^2}{\lambda^5} $$  Similar transformation happens at other parts in the article also. I'm obviously missing something, likely completely trivial.


I use Ubuntu 12.04 LTS on a dual boot system. I upgraded my PC's motherboard to Gigabyte GA-H77M-D3H motherboard. 12.04 no longer sees the network interface !  I now want to upgrade to 13.04. Is there a 13.04 download I can put onto a DVD and then upgrade 12.04 after I have booted up 12.04 ?

I am currently using Ubuntu 10.04. I know there is a 10.10 release, but can I upgrade directly to 11.04? Could you walk me through the steps please?


The F number is a ratio calculated purely from the focal length of the lens and the size of the aperture. Any light meter talks in terms of F, Shutter, and ISO.   Different glass, or just different number of elements, is going to change the number of photons that get though the lens; we compensate for ND filters by adjusting F. What am I missing? Why aren't  part of exposure calculations?  In other words, I know what T numbers are, and how they differ from F-stops. What I don't know is why handheld light meters and related tools have no provision to take T into account, but talk only in terms of F.

seem to be well-regarded for their versatility and accuracy of metering.  What puzzles me about them is how can they account for the different light transmittance of different lenses? It's easy for an in-camera metering system that meters  so any peculiarity in transmittance is already applied to light when it reaches the metering sensor. But a standalone meter does not have the privilege of looking at the world through the lens it meters for. I tried looking it up in  and , but this issue was not touched upon at all.  This leaves several variants how it could be handled -   light meter uses  for aperture display/input, and photographer is expected to perform the adjustments to and from  (which are used by cameras); light meter assumes some median transmittance of lenses of its era, and automatically accounts for that; photographers simply ignore the matter - even a 75% transmitting lens will be off only by about half a stop, no big deal; each light meter used is expected to know that you have to dial in some exposure compensation to account for the light loss; ...   So how does it work in real world?


I submitted a sitemap of my website to Google. () The sitemap : () The robots.txt :  Sitemap seems correct, Google validated 112 links in Google Search Console after only few hours. However, if i look for my website with the following Google request : "site:japan1900.com" i see only 9 results. At this point i think it is not a question of time. I should tell you that first time i sent the sitemap was 2 months ago and i deleted it 3 days ago and tried again. URL were validated twice but somehow never been reflected in search. Also that i have a different website using the same architecture / sitemap and not having this issue. What can i do to find the issue ? To me, sending the sitemap, receiving validation, would be enough to appears in Google Search, even with pretty bad ranking but appearing in "site:" search. Here something looks wrong, and i feel blocked.

We use a  on Stack Overflow, but I have mixed feelings about it.  Web crawlers usually discover pages from links within the site and from other sites. Sitemaps supplement this data to allow crawlers that support Sitemaps to pick up all URLs in the Sitemap and learn about those URLs using the associated metadata. Using the Sitemap  does not guarantee that web pages are included in search engines, but provides hints for web crawlers to do a better job of crawling your site.  Based on our two years' experience with sitemaps, there's something fundamentally paradoxical about the sitemap:  Sitemaps are intended for sites that are hard to crawl properly. If Google can't successfully crawl your site to find a link, but is able to find it in the sitemap it gives the sitemap link no weight and will not index it!  That's the sitemap paradox -- if your site isn't being properly crawled (for whatever reason), using a sitemap will not help you! Google goes out of their way to make :  "We cannot make any predictions or guarantees about when or if your URLs will be crawled or added to our index"  "We don't guarantee that we'll crawl or index all of your URLs. For example, we won't crawl or index image URLs contained in your Sitemap."  "submitting a Sitemap doesn't guarantee that all pages of your site will be crawled or included in our search results"   Given that links found in sitemaps are merely recommendations, whereas links found on your own website proper are considered canonical ... it seems the only logical thing to do is avoid having a sitemap and make damn sure that Google and any other search engine can properly spider your site using the plain old standard web pages everyone else sees. By the time you have done that, and are getting spidered nice and thoroughly so Google can see that your own site links to these pages, and would be willing to crawl the links -- uh, why do we need a sitemap, again? The sitemap can be actively harmful, because it distracts you from ensuring that search engine spiders are able to successfully crawl your whole site. "Oh, it doesn't matter if the crawler can see it, we'll just slap those links in the sitemap!" Reality is quite the opposite in our experience. That seems more than a little ironic considering sitemaps were intended for sites that have a very deep collection of links or complex UI that may be hard to spider. In our experience, the sitemap does not help, because if Google can't find the link on your site proper, it won't index it from the sitemap anyway. We've seen this proven time and time again with Stack Overflow questions. Am I wrong? Do sitemaps make sense, and we're somehow just using them incorrectly?


Newbie here. Writing function that prints out all the subsets of a set using generator (yield statement). The problem is, I cannot make it so that it uses yield and works for sets of all lenghts, not only three, like in my code below. I can make it work for 4 and 5 obviously, but the ladder gets bigger, which is just ridiculous, let alone pythonic and elegant.  ABC = ['a', 'b', 'c']  def subsets(group):     for i in [group[0], []]:         for j in [group[1], []]:             for k in [group[2], []]:                 yield filter(None, [i, j, k])  for element in subsets(ABC):     print element   The output (for this 3-item list) should  be:  ['a', 'b', 'c'] ['a', 'b'] ['a', 'c'] ['a'] ['b', 'c'] ['b'] ['c'] []

I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe?


According to me both should be onto. I think so because g(x) can take any value as it is onto so f(g(x)) for range should like f(x) and hence should be onto. Could you tell wbere I am wrong and give an example as well.

I know that the map $f:A\to B$ is a surjective function (onto) if for all $b$ in $B$, there exists an $a$ in $A$ such that $f(a)=b$   But I am having trouble getting started with this proof since it involves the composition of two surjective functions.


When Mr. Smith returned from Europe in 1966, he found that he had in his possession 35 British sixpence coins, 55 French ten-centime pieces, and 77 Greek drachmas. Mr. Smith converted each of these coins to its value in American money (rounded off to the nearest cent) and found that the total was worth $5.86. How much was each coin worth in 1966 (to the nearest cent)?  I started by setting up the equation 35B+55F+77G=586, but I was not sure how to solve a three-variable diophantine equation.

Find one integer solution to the Diophantine equation   \begin{equation*} 18x+14y+63z=5. \end{equation*}   If this were only a linear equation over $\mathbb{Z}^2$, then I could easily solve it by using the extended Euclidean algorithm... but I have no idea how to do this with more than 2 unknowns...


I am getting this error:   The following packages have unmet dependencies:  udev : Depends: libudev1 (= 204-5ubuntu20.2) but 204-5ubuntu20.4 is to be installed E: Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages.  I've tried to apt-get dist-upgrade and I got the same message:  The following packages have been kept back:   libudev1 udev 0 upgraded, 0 newly installed, 0 to remove and 2 not upgraded.   I am using ubuntu 64bits 14.04 Thank you guys!

I upgraded on a fresh install to Ubuntu 12.10, and I've tried installing wine many times, but I always get this:  This error could be caused by required additional software packages which are missing or not installable.  Furthermore there could be a conflict between software packages which are not allowed to be installed at the same time. The following packages have unmet dependencies:  wine:   It won't let me install the dependencies either it says it needs another set of dependencies to install them. Using Asus KJ50 64bit OS, dual boot with Windows 7  sudo apt-get install wine1.5 Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  wine1.5 : Depends: wine1.5-i386 (= 1.5.15-0ubuntu1) but it is not installable            Recommends: gnome-exe-thumbnailer but it is not going to be installed or                        kde-runtime but it is not going to be installed            Recommends: ttf-droid            Recommends: ttf-mscorefonts-installer but it is not going to be installed            Recommends: ttf-umefont but it is not going to be installed            Recommends: ttf-unfonts-core but it is not going to be installed            Recommends: winbind but it is not going to be installed            Recommends: winetricks but it is not going to be installed E: Unable to correct problems, you have held broken packages.


You can write a bash functions several ways:  function JoinStrings {     ...; }   Or  function JoinStrings () {     ...; }   Or  JoinStrings () {     ...; }   Is there any difference between these functions? Why are there 3 different ways to write a function in bash? (Are there more ways to write function?)

I can define bash functions using or omitting the function keyword. Is there any difference?  #!/bin/bash  function foo() {   echo "foo" }  bar() {   echo "bar" }  foo  bar   Both calls to functions foo and bar succeed and I can't see any difference. So I am wondering if it is just to improve readability, or there is something that I am missing...  BTW in other shells like dash (/bin/sh is symlinked to dash in debian/ubuntu) it fails when using the function keyword.


Short version  How can I pipe text from a local machine/server and append it (not overwrite) to a file in a remote machine/server?    Long version  I wished to append my ~/.ssh/rsa_pub (public key) from local to a remote ~/.ssh/authorized_keys.   So I tried this (and hoped for the best):  scp ~/.ssh/id_rsa.pub user@local:user@remote/.ssh/authorized_keys  So I accidently overwrote the remote authorized_keys instead of appending to it... Since my accident, I need to append all those authorized_keys that I lost, one by one, using copy-paste.  Is there a way I can append to the remote's authorized_keys, rather than overwriting it?   Perhaps there is a tool made specifically for things like authorized_keys, but I am also (and more) interested in a general solution along the lines of:  cat local_machine_file.txt >> remote_machine_file.txt   Where I only care about appending to the end of the file, and not at a specific line of a file.    What I tried  Well I read the whole of man scp, several ssh key generating tutorials, and . The latter is actually what inspired me to unintendedly overwrite remote's authorized_keys... After reading all these ssh key generating tutorials I am generally frustrating at how much they all seem to focus on "generating private/public keys from scratch", assuming the remote and local machines do not already have .ssh/* stuff already in them. I also spent several hours in total searching among: SO, SuperUser and here.

To get my public key onto a server I normal copy the contents of my public key, then SSH into the server, then I run vi .ssh/authorized_keys, then paste my key into the file and save.  There has got to be an easier, one step way using SCP or something like that. Of course I want to append my key to authorized_keys, not overwrite it and the permissions of authorized_keys needs to remain at 600


I want to run a NE555 timer in astable mode, but I only want it to turn on when a 3.3v is supplied, I want to make use of a transistor to do the switching.  At the moment i am using a 2N2222 transistor, but cant seem to get the design right. Can someone please help me to design the switching transistor.    Will this circuit work?

I would like to ask for best solution for my issue.  I need high side switch for 24VDC 6mA (it is enable signal for a device). This device I want to control by Arduino (input 5 V 20mA).  What is the best solutions for this low current?  I tried to use Sziklai pair, but PNP transistor is still open. I don't know how to calculate resistors between NPN and PNP :-(. Do I have to use a sziklai pair or is there something else?         – Schematic created using   Thank you so much  Lukas


:     ...the entropy of any closed system not in thermal equilibrium   almost always increases.   I understand that the second law of thermodynamics is based on the statistical unlikelihood of fast-moving molecules to aggregate.  However, if it is only "almost always" then why is the phenomenon stated as a law?  Is it because we have not yet observed the unlikely aggregation?

My book uses the argument that the multiplicities of a few macrostates in a macroscopic object take up an extraordinarily large share of all possible microstates, such that even over the entire lifetime of the universe, if each microstate had an equal chance of being accessed, fluctuations away from equilibrium would never occur.  My question to this statistical proof is this: In the real world, is there really an infinitesimal but nonzero chance that macroscopic systems could access some of the more unlikely macrostates (e.g. heat transfer from a cold object to a hot object)?


Suppose $X$ is a metric space . If $X$ happens to be separable ,then countably many open subsets are enough to form a base.  How to prove this one?  Any suggestion will be appreciated.

A collection $\{V_{\alpha}\}$ of open subsets of $X$ is said to be a base for $X$ if the following is true: For every $x\in X$ and every open set $G\subset X$ such that $x\in G$, we have $x \in V_\alpha \subset G$ for some $\alpha$. In other words, every open set in $X$ is the union of а subcollection of $\{V_{\alpha}\}$.   Prove that every separable metric space has a countable base.   Proof: Let $(X,d)$ be a metric space and $D=\{d_j\}_{j\in \mathbb{N}}$ be the countable and dense subset of $X$. Let $U$ is an open set in $X$ then for $x\in U$ $\exists \varepsilon_x>0$ such that $N_{\varepsilon_x}(x)\subset U$. Then $\exists d_j\in D$ such that $d(x, d_j)<{\varepsilon_x}/{4}$ $\Rightarrow$ $d_j\in N_{{\varepsilon_x}/{4}}(x)\subset U$.   It's easy to check that $N_{{\varepsilon_x}/{4}}(d_j)\subset N_{{\varepsilon_x}}(x)$. Indeed, if $z\in N_{{\varepsilon_x}/{4}}(d_j)$ then $d(z,d_j)<\varepsilon_x/4$ and since $d(x, d_j)<{\varepsilon_x}/{4}$ then by triangle inequality: $$d(z,x)\leqslant d(z,d_j)+d(x, d_j)<{\varepsilon_x}/{4}+{\varepsilon_x}/{4}<{\varepsilon_x}.$$  Hence $z\in N_{{\varepsilon_x}}(x)$ and inclusion $N_{{\varepsilon_x}/{4}}(d_j)\subset N_{{\varepsilon_x}}(x)$ holds.  By the way $N_{r}(d_j)\subset N_{{\varepsilon_x}}(x)\subset U$ for $r\in \mathbb{Q}$ and $r<{\varepsilon_x}/{4}$. Thus for every $x\in U$ we associate an open ball with center at some point $d_j$ of $D$ and rational radius $r$ such that $x\in N_{r}(d_j)\subset N_{{\varepsilon_x}}(x)\subset U$.  Thus $$U=\bigcup\limits_{d_j\in U} N_{r_j}(d_j).$$ This set equality can be verified very easy. Inclusion $\subseteq$ I described in above paragraph. Converse inclusion is not difficult: if $z\in \bigcup\limits_{d_j\in U} N_{r_j}(d_j)$ then $z\in N_{r_j}(d_j)$ for some $d_j\in U$. But these balls  arranged so that $N_{r_j}(d_j)\subset U$ then $z\in U$.  Hence collection of balls $\{N_{r}(d): r\in \mathbb{Q}, d\in D\}$ is a countable base.  Is my proof correct? Can anyone check it please? Sorry if this topic is repeated but I would like to know is my proof correct.


I want to write an Android app in Python, something along the lines of converting a .py file to an APK.

We are working on an  version and this platform has a nice Python API..  However, there is nothing official about Python on Android, but since  exists, is there a way to let the snake and the robot work together??


Well I tried on "mouse and touchpad" but there isn't any option to disable tap to click:    Then I tried:  synclient MaxTapTime=0   That returned:  Couldn't find synaptics properties. No synaptics driver loaded?   So how to disable tap to clip on touchpad?  Using Ubuntu 16.04  After I solved the problem with the answer suggested by @Vitor, as sugested in comments I got from xinput:  ⎡ Virtual core pointer                      id=2    [master pointer  (3)] ⎜   ↳ Virtual core XTEST pointer                id=4    [slave  pointer  (2)] ⎜   ↳ YSTEK USB Mouse                           id=10   [slave  pointer  (2)] ⎜   ↳ eGalax Inc. eGalaxTouch EXC7910-1018-13.00.01 id=13   [slave  pointer  (2)] ⎜   ↳ AlpsPS/2 ALPS GlidePoint                  id=15   [slave  pointer  (2)] ⎜   ↳ PixArt Microsoft USB Optical Mouse        id=12   [slave  pointer  (2)] ⎣ Virtual core keyboard                     id=3    [master keyboard (2)]     ↳ Virtual core XTEST keyboard               id=5    [slave  keyboard (3)]     ↳ Power Button                              id=6    [slave  keyboard (3)]     ↳ Video Bus                                 id=7    [slave  keyboard (3)]     ↳ Video Bus                                 id=8    [slave  keyboard (3)]     ↳ Power Button                              id=9    [slave  keyboard (3)]     ↳ HP Truevision HD                          id=11   [slave  keyboard (3)]     ↳ AT Translated Set 2 keyboard              id=14   [slave  keyboard (3)]     ↳ HP Wireless hotkeys                       id=16   [slave  keyboard (3)]     ↳ HP WMI hotkeys                            id=17   [slave  keyboard (3)]   xinput list-props 13  Device 'AT Translated Set 2 keyboard':     Device Enabled (143):   1     Coordinate Transformation Matrix (145): 1.000000, 0.000000, 0.000000, 0.000000, 1.000000, 0.000000, 0.000000, 0.000000, 1.000000     Device Product ID (263):    1, 1     Device Node (264):  "/dev/input/event3"

I have a problem with my touchpad; I can't scroll down with 2 fingers and I don't know why. I have searched on Google about my problem and I've found some answers but none of them don't work for me.  One solution I found was to go in System Settings -> Mouse & Touchpad -> Touchpad and check the Two-finger scrolling, but I don't have that option.    Another solution was to try to reinstall, which also didn't work. Yet another solution was to go in Ubuntu Software Center, type synaptic and install the Synaptic Package Manager but that didn't work, either.      What can I do to be able to scroll with two fingers?


I'm using visual studio in C programming, but what I realized that for this question, when I run the code, and enter 3.74 cgpa it outputs Invalid CGPA mark! rather than Degree classification: "Upper Second-Class Honours", also same thing for the males values, not really sure what the problem, dose anyone know what is the reason? #include <stdio.h> main() {     float cgpa = 0;     char gender = 0;      printf("Enter your gender (M/m or F/f): ");     scanf_s(" %c", &gender, 1);      printf("\nEnter your CGPA: ");     scanf_s("%f", &cgpa);      if (gender == 'f' || gender == 'F')     {         if (cgpa >= 3.75)             printf("\nDegree classification: \"First-Class Honours\" \n");         else if (cgpa <= 3.74 && cgpa >= 3.00)             printf("\nDegree classification: \"Upper Second-Class Honours\" \n");         else             printf("Invalid CGPA mark!\n");     }     else if (gender == 'm' || gender == 'M')     {         if (cgpa >= 2.50 && cgpa <= 2.99)             printf("\nDegree classification: \"Lower Second-Class Honours\" \n");         else if (cgpa >= 2.00 && cgpa <= 2.49)             printf("\nDegree classification: \"Third-Class Honours\" \n");         else             printf("Invalid CGPA mark!\n");     }    }

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


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

If you are reading this, you may have been affected by one of our post quality bans. If so, it is important that you  to understand what has happened and how to regain the permissions that you lost. While trying to ask a question, one could see:  We are no longer accepting questions from this account. See  to learn more.  Likewise, for answers:  We are no longer accepting answers from this account. See  to learn more.   Why am I getting this message? Are deleted posts taken into account too? Is a question/answer ban the same as a suspension? How do I avoid getting a question ban? How long do I have to wait before I can post again? What can I do to release the ban? How can I reactivate my account? Can I simply create a new account? I'll just ask somewhere else on the SE network, and they'll migrate my question to the correct site! Will a ban on one Stack Exchange site affect my standing on other sites in the network? Does this apply to meta sites too? My account is in good standing. Why am I still blocked?


I use https for my website. all my http requests are redirected to the https. I have submitted my sitemap. and google search console is showing below error for few of my web pages.  Duplicate, submitted URL not selected as canonical   my few essential pages is not showing up in google search results because of above error.  how can i resolve this?

Google's new webmaster tools has a  section 'Index coverage'>'Excluded'>'Submitted URL not selected as canonical'.  I am getting 3 internal links in the section "Submitted URL not selected as canonical" of my website.   am not sure why these internal links are showing up there.  I had updated canonical tags for these 3 links.  (I am not sharing links cause may be my account marked as spam)   has some information about it, but doesn't say how to fix it:     Submitted URL not selected as canonical: The URL is one of a set of duplicate URLs without an explicitly marked . You explicitly asked this URL to be indexed, but because it is a duplicate, and Google thinks that another URL is a better candidate for canonical, Google did not index this URL. Instead, we indexed the canonical that we selected. The difference between this status and "Google chose different canonical than user" is that, in this case, you explicitly requested indexing.


I am running Lubuntu 14.04 b43.  Sorry I seem to have the same problem as many others. I have spent the last two or three days looking for other solutions and tried many of them to no avail.  I get the error firmware missing on boot up but it doesn't stay long enough to copy it.    My wireless is BCM4312 LP-PHY 14e4:4315. I am running a completely fresh install of Lubuntu 14.04 on an old Dell Inspiron.  I have tried loads of things including:  Fwcutter and firmware installer eg, and I have tried to install it with this code:  sudo apt-get install linux-firmware-nonfree sudo modprobe -r b43 && sudo modprobe b43   But I have had no luck. Please can you help?

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


My last flag has been declined by moderator, and now I see a message:      Your last flag was declined - please review it before flagging this post!   for ALL new flags. These new flags are currently in pending state. So I think notice message should be fixed to focus on last processed flag, not a pending ones.

I went to flag something, and in the flag dialog I got the message  "Your last flag was declined - please review it before flagging this post!"    That's all well and good, but when I went to review my flags, the statement is not accurate.  My last 5 flags were all marked 'helpful'.  The 6th down the list is marked 'declined', but that wasn't my last flag.  The message should probably be modified to correspond to the actual condition that triggers it.  Perhaps it should say     One of your flags was recently declined - please review it before flagging this post!   I'm going to guess that this message is triggered if, of all the flags of mine that have been handled by a moderator, the one that was most recently handled was declined. This isn't necessarily the last flag that I raised (the one I raised most recently), as moderators might handle them in a different order than I raised them, and it's not necessarily the flag at the top of the list.  Thus, calling it my "last" flag seems like it could cause confusion.  Yes, I realize this is extremely minor.


I am very new to Ubuntu and trying to install some soundfonts. One of them is in .rar. Do any of you know a way to open this type of fiel and make it operational?  Thanks,  Martin

I just realized I can't unrar .rar files on my Ubuntu machine!  What's the easiest way to accomplish this fundamental task? If possible I'd love something like 7Zip that I can just right Click, and extract and have the program worry about how to do it regardless if it's a .zip, a .rar or a .foo compressed file.


The computer I'm trying to install on has NO other os on it. After seeing the screen that asks if I want to  Try ubuntu without installing Install ubuntu Check disk for defects Test memory Boot from first hard disk   I select install Ubuntu and it takes me to the normal black screen BUT mine gets stuck on it and never continues the boot.   After this I tried using a USB that I created with netbooter or something, after clicking install Ubuntu it says binary white listed and doesn't work.

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


Is there a way to change the weather in Xbox 360 minecraft?  I like working with the sound of the rain and seeing the rain  but it doesn't happen often?  anyway to force a change?  Either using an in-game element or using a program to edit the xbox 360 minecraft save?

In Minecraft, weather is really rare and I like having it. I'd especially like to see thunderstorms. What I was wondering is if there was a way to control or influence the weather? I'm guessing no, but there's no harm in asking... right? Thanks for the help.


What is the best way to update the slug of a custom taxonomy that is registered by a plugin? I want to know the minimal amount of parameters for this or if i need to go and copy paste all of the original parameters. This seems like it can be error prone if the plugin has an update. The codex says you will overwrite the original when using register_taxonomy so is there a better way to do this or a different function?

Today I needed to change the arguments on a custom taxonomy that was already registered by a . Specifically I wanted to set the show_admin_column argument to true and change the rewrite slug so that it wasn't just the taxonomy slug. In this case, it was a "People" post type with a "People Category" custom taxonomy.  I was surprised this wasn't asked before, so here's a question and answer.


This is my array:  Array (     [0] => Sos, Ser     [1] => Sos, Ser, Pieczarki     [2] => Sos, Ser, Szynka     [3] => Sos, Ser, Salami     [4] => Sos, Ser, Szynka, Pieczarki     [5] => Sos, Ser, Szynka, Ananas     [6] => Sos, Ser, Salami, Pieczarki     [7] => Sos, Ser, Tunczyk, Cebula )   I want to delete duplicates. array_unique() doesn't work. Desired result:  $result = array('Sos', 'Ser', 'Pieczarki', 'Szynka', 'Salami', 'Ananas','Tunczyk','Cebula');

How can I remove duplicate values from a multi-dimensional array in PHP?  Example array:  Array (     [0] => Array     (         [0] => abc         [1] => def     )      [1] => Array     (         [0] => ghi         [1] => jkl     )      [2] => Array     (         [0] => mno         [1] => pql     )      [3] => Array     (         [0] => abc         [1] => def     )      [4] => Array     (         [0] => ghi         [1] => jkl     )      [5] => Array     (         [0] => mno         [1] => pql     )  )


If you try to block with your finger the flow of the water out of the faucet or a water hose, the water's speed increases. But while you're blocking the water flow out of the faucet by turning the handle, the speed doesn't increase. So what's the difference between the two ?

Let's say you have a garden hose connected to an ordinary water tap which is opened fully. If you pinch the end of the hose, water leaves the hose at a higher speed (and this can be useful while watering plants, to reach pots which are further away). However when a tap (with no hose connected) is opened only slightly, water flows out at a low speed, possibly even in drops.  The actions of pinching the end of a hose and of almost-closing an open tap seem similar, so why the difference in behaviour?


The PS/2 keyboard is available in the BIOS. But after the Windows 10 system is booted, keyboard is not detected.

I was just told that PS2 Keyboards aren't compatible with windows 10.  Is this true.  I was under the impression that they should work fine?


I have a function which gives me randomly a combination of letters from A-Z and numbers from 0-9. I want to generate 20000 keys out of this. My question is now that I want to determine the probability to create unique keys.   I tried it the following:  $$nCr(36 + 4 - 1,4) = 82251$$  I want to find out how random 20000 keys are, so:  $$\frac{20000}{82251} = 0.2431$$  So the probability that I get a non unique key is $24.31$ percentage.  Are these thoughts correct?  I appreciate your answer!

Assuming "complete randomness" and given a string with a length of 20 characters where each character may be one of 62 possible characters:    What are the total number of combinations possible? (Guessing 20 to the power of 62.)  Also, if new strings are randomly selected one after another and added to a list of strings selected so far, how many strings must be selected before the chance of selecting a string that has already been selected is below 1-in-100000 ($10^{-5}$)?   Note: 62 comes from: numeric digits (0-9), uppercase letters (A-Z), and lowercase letters (a-z).


What happens if we try to integrate a function like $\frac{1}{z}$ over the circle radius one centered at one, since the function is holomorphic in the interior, but at the point on the contour $z=0$, the function does not exist.  What about the general case of a function being holomorphic on a circular domain and we take the contour integral on the boundary. How do we do it?

There are many theorems in complex analysis which tell us about integration $\int_{\gamma} f$ where $f$ is continuous (or even differentiable) in the interior of $\gamma$ except finitely many points.   I would like to see how should we solve $\int_{\gamma}f(z)dz$ where $\gamma$ contains a singular point of $f$.   For example, in solving $\int_{|z|=1} \frac{1}{z-1}dz$, I slightly pulled the curve $|z|=1$ near $1$ towards left, so that $\gamma$ will not contain $1$; then the singularity of $\frac{1}{z-1}$ will not be inside this deformed curve, so integration over deformed curve is zero, so taking limit, I concluded that $\int_{|z|=1} \frac{1}{z-1}dz=0$.   However, if I pull the curve near $1$ on the right side, then the singularity of $\frac{1}{z-1}$ will be inside this deformed curve, and integration is then non-zero.   I confused between these two processes; can you help me what is the correct way to proceed for finding integration along curves, in which singularity of the function is on the curve?


I'm very confused by the behavior:  int main(void) {     char *test_string = "test_string";     *test_string = 'a'; //segfaults     return 0; }     int main(void) {     char test_string[] = "test_string";     *test_string = 'a'; //OK     return 0; }     I expected it should  have worked the same since N1570, Section 6.3.2.1(p3) states the following:     Except when it is the operand of the sizeof operator, the _Alignof   operator, or the unary & operator, or is a string literal used to   initialize an array, an expression that has type ‘‘array of type’’ is   converted to an expression with type ‘‘pointer to type’’ that points   to the initial element of the array object and is not an lvalue.   Why does the first segfault?

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


I am answering a question regarding the simplicity of a group of order 380 and wondering if my approach is okay.  380 = 2^2 * 5 * 19, so the Sylow 5 subgroups have order 5, are cyclic, and if there are more than 1 of them, then we must have 76 of them. Hence, we have (5-1)*76=304 elements of order 5. Now, looking at the Sylow 19 subgroups, if there are greater than 1 of them there must be 20, but we don’t have enough space for all of those elements in the group, hence there is only one Sylow 19 subgroup, a normal subgroup, and so the group is not simple.

How can I show that a group with 380 elements is not simple?


I had my DNA tested through Ancestry.com. My closest match shares 2041cm. Is it safe to say this is probably a half-sibling? Are other ways of confirming this relationship?

Given two tests that share some cM of autosomal DNA, how can I easily find the predicted relationships that such shared cM would suggest? For example, a 2,200 cM match suggests it could be either: grandparent, half-sibling, or grandchild.


Could anyone tell me?   The No. of Continuous function satisfying the condition $$xf(y)+yf(x)=(x+y)f(x)f(y)$$ is   $1,2,3,$ or  none of them?  or give me hints please.

Find all $f:\mathbb R\to \mathbb R$ such that $\forall x,y\in\mathbb R$ the given equality holds: $$xf(y)+yf(x)=(x+y)f(x)f(y)$$   My try: whenever $y=0$, we have $$x\cdot f(0)\cdot(1-f(x))=0$$ So the solutions can be either generated by: $$f(x)=\begin{cases}c & c\in\mathbb R & x=0\\ 1 & x\neq 0\end{cases}$$ where $c$ generate an infinite amount of solutions, or it can be any function satisfying $f(0)=0$. However, I can't seem to find a way to check such a solution on the initial equation (we have to check it since we've simply eliminated the impossible solutions and we've only found that the solutions can be somehow generated using the way I've shown). Note that this generates the trivial solutions $f(x)=0$ and $f(x)=1$ as well.  Is my reasoning correct? If so, how can I check whether all the generated functions satisfy the initial equation?  Off-topic, but do $f^2(x)$ and $f(x)^2$ denote the same concept? My teacher uses the former while my book uses the latter (for squaring $f(x)$). Which one is correct, or are both of them correct?


I know this might seem like a duplicate, but I've seen the other posts, and they're problems and different than mine.  I installed Ubuntu along side Windows 10, and now I want to take more 30Gb from the hard drive I installed Ubuntu on. However, I'm not being able to do it.  I was following  video on youtube, and my problem begins at minute 10:45. He is able to resize the extended partition while mine is locked. I also noticed that my ext4 root partition is inside the extended one. Here's what it looks like:   I'm super new to this, so I'm sorry if I'm doing something stupid. Thanks

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


I'm having some trouble proving the question above, most because i'm getting a proof that works even if $(a,b) \neq 1$ and i just can't find my mistake.  Proof: if $(n, ab) = 1$, $\exists x$, $y \in \mathbb{Z}$ such that $x\cdot n + y\cdot ab = 1$, but this means that $x\cdot n + ya \cdot b = 1$ and $x\cdot n + yb\cdot a = 1$ and so $(n,a) = 1$ and $(n,b) = 1$. Now, if $(n,a) = 1 = (n,b)$, $\exists x'$, $x''$, $y'$, $y'' \in \mathbb{Z}$ such that $x'\cdot n + y'\cdot a = 1$ and $x''\cdot n + y''\cdot b = 1 \Rightarrow x'\cdot x''\cdot n^2 + x'\cdot y''\cdot n\cdot b + x''\cdot y'\cdot n\cdot a + y'\cdot y''\cdot a\cdot b = 1 \Rightarrow n\cdot (x'x''n + x'y''b + x''y'a) + y'y''\cdot ab = 1 \Rightarrow (n,ab) = 1$  Note that i did not request that (a,b) = 1 at any time.

Let $a,b,n$ be integers such that  $\gcd(a,n)=\gcd(b,n)=1$. How to show that $\gcd(ab,n)=1$?   In other words, how to show that if two integers $a$ and $b$ each have no non-trivial common divisor with and integer $n$, then their product does no have a non-trivial common divisor with $n$ either.     This is a problem that is an exercise in my course.   Intuitively it seems plausible and it is easy to check in specific cases but how to  give an actual proof is not obvious.


I've placed two figures in the same heading Specification and Design but when I compile the document in TexStudio, the second graphic Proposed physio application prototype system architecture is shown under a different heading Results and Evaluation  Does anyone have any idea as to why?  This is the section of document where I've placed the two figures:  \subsection{Specification and Design} \label{sec:Specification and Design}   \begin{figure}[h] \caption{ Proposed project time line.} \centering \includegraphics[width=1\textwidth]{initial_timieline} \end{figure}      The platform being used for the application was initially proposed to be a Windows Universal application.But the C sharp wrapper being used to interface with the Myo arm band relies heavily on platform invocations which the Windows Universal application platform doesn't support. Owing to this the platform chosen for development was windows presentation foundation.     \begin{figure}[h] \caption{ Proposed physio application prototype system architecture, detailing flow of user input.} \centering \includegraphics[width=1\textwidth]{gesture_arc} \end{figure}     \subsection{Implementation} \label{sec:Implementation}    \section{Results and Evaluation}   Output:

Is there any package or a method to force LaTeX to keep floating environments like table and figure closer to where they are declared?


After doing some revision to my paper to include changes suggested by the referee (who will not see the paper again, having recommended the paper for publication), is it OK for me to make a minor change of my own, in the manuscript (before I send it to the editor)? Should I declare this in the list of changes or should I wait till the paper is officially accepted for publication by the journal? Would it then be up to the editor to check the validity of the slightly changed statement?  (I've noticed something minor in the manuscript, which needs to be fixed - and amounts to changing a couple of words in the comments section).

Suppose I write a paper and submit it to a conference. The paper gets some weak rejects and weak accepts and lots of criticism, but the conference is not that prestigious, so they accept it anyway.  Obviously, if I agree with the reviews, I will want to change the paper (which is in part what the reviews are for). But how far can I go with these changes? If the paper is computer science, for instance, I may easily run additional experiments, or slightly change the setup and re-run the existing experiments. If I submit the paper with these results, I will basically be publishing experiments that have not, in their current form, been peer-reviewed.  At what point do changes to a submitted paper post peer review become unacceptable?


Let $s$ be the number of variables and $n$ be the degree of the monomials we want to count in $R[X_1,\dots,X_s]$. Then show, that the count is    $$\delta(n,s):=\binom{s-1+n}{s-1}.$$   The question is a duplicate, but I have so far not been satisfied with any of the seen answers. Not here, not on google/lecture notes etc.. So here goes a proof using as little combinatorics as possible - the only proof with very little combinatorics involved I have seen here used that the substitution  $$R[[X_1,\dots,X_s]]\to R[[X]], X_i\mapsto X$$  is a well-defined homomorphism - something I have only seen as a statement in Zariski's "Commutative Algebra" Volume II...  So here goes my question + answer.

says that the number of different monomials of degree $M$ in $N$ variables is $$\frac{(M+N-1)!}{M!(N-1)!}\; .$$ Can anyone explain why this is true?


Please see my   I want the green middle div to fill the remaining space of the wrapper div no matter how much content it has.  If it matters I'm including bootstrap too.

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


I have a player that wants to build a Dragonborn Outlander Ranger/Sorcerer, with Slaad as the first Favored Enemy.  The archetypes for the Sorcerer are Draconic Bloodline and Wild Magic. Being Dragonborn fits the Draconic Bloodline. And her backstory, in which she was used in a Slaadi ritual, fits rather well with the Wild Magic archetype. As such, the player would like both archetypes.  My thoughts are that I will simply let them Multiclass in Sorcerer twice, thus becoming Rang 3/Sorc (Dragon) 1/Sorc (Wild) 1. While I realize this goes against the standard rules, I can't see where it conflicts. So, my question is this: Are there any other guidelines for acquiring multiple archetypes within the D&D 5th edition class system that I am missing?

The way that 5e works, each class has a sub class that dictates a heap of class features. The question here is generally, can a character of a specific class take levels in that same class in order to gain access to the low level features of another sub-class.  The best example of this would either be the wizard or the cleric taking additional levels of wizard/cleric in order to gain access to another domain or school.  Like can a Life cleric take levels of Storm cleric or similar?  If this were allowed, what would the effects be on Maximum spell level and other class level based abilities?


In my bib library, the author is like "John, W.W.C", but when I make  bibliography with bibliographystyle IEEETrans, it comes out like "W. John". Could you help me out? Thank you.  The bib lirary is as follow:  @article{articletocite,  author={Jo, W.W.C. and Hu, J.},  journal={Journal} title={Title},  year={2014},   }   The tex file is as follow:  \documentclass[11pt, final, journal, letterpaper, doublecolumn]{IEEEtran} \usepackage{algorithm} \usepackage{algorithmic} \usepackage{graphicx} \usepackage{balance} \usepackage{caption} \usepackage{multirow} \usepackage{array} \usepackage{amsmath} \usepackage{amssymb} \usepackage{amsthm} \usepackage{subcaption} \usepackage{flushend} \usepackage{placeins} \title{Title} \author{Author} \begin{document} \maketitle \bibliographystyle{IEEEtran}  \bibliography{paper.bib} \end{document}

I'm using a modification of the plainyr BibTeX style. Although my bib-file contains all initials for some authors (e.g. B.D. McKay), I end up with just the first initial in my document (e.g. B. McKay). I thought about editing the BibTeX style myself, but after seeing the code, I decided against it. Maybe there are some people who are more knowledgeable in this area of expertise.  I want my final document to include the initials for all the names, and not just those of the first name.  This is the relevant code of the BibTeX style, or at least, I think it is the relevant code.  FUNCTION {format.names} { 's :=   #1 'nameptr :=   s num.names$ 'numnames :=   numnames 'namesleft :=     { namesleft #0 > }     { s nameptr "{f.~}{vv~}{ll}{, jj}" format.name$ 't :=       nameptr #1 >         { namesleft #1 >             { ", " * t * }             { numnames #2 >                 { "," * }                 'skip$               if$               t "others" =                 { " et~al." * }                 { " and " * t * }               if$             }           if$         }         't       if$       nameptr #1 + 'nameptr :=       namesleft #1 - 'namesleft :=     }   while$ }


I have a problem with compiz since a recent update, it uses 160 to 170% of cpu according to top, the laptop's fan is going full speed. And it goes up with time, after 30 minutes it's over 270%.  Here's the apt log from when it started:   About my laptop, it has 16GB RAM, Intel® Core™ i7-6700HQ CPU @ 2.60GHz × 8 processor, a Quadro M1000M graphic card and running 64-bits ubuntu 16.04.1 LTS.  I can see with nvidia-smi that compiz is using the graphic cards (another member here had issues with their drivers).  Changing options from CCSM did not solve the issue.  Any idea how to fix this?   EDIT: Tried metacity --replace to temporarily use something else than compiz, but compiz keeps on running anyway even if I try to kill it before.  None of the answers marked as duplicate help me in any way, it seems to be a completely different issue (no more related to those 3 or 5 years old you mentioned).

Any tips?   Intel Core 2 Quad x64  Ubuntu precise 12.04 Dell OptiPlex 760 nvidia graphics driver


I'm trying to write a java message switch application by using a multi-threaded server and two clients. However I'm stuck at one point as error occurs when I try to run my programmes. Here are my codes for the server:   public class EchoServer extends Thread {  private static ServerSocket serverSocket; private static Socket connection1; private static Socket connection2; private BufferedReader input; private PrintWriter output; final static int portNumber = 4434;  public EchoServer(Socket in,Socket out) throws IOException{      connection1 = serverSocket.accept();      connection2 = serverSocket.accept();      input = new BufferedReader(new InputStreamReader(in.getInputStream()));     output = new PrintWriter(out.getOutputStream(),true); }  public void run() {     String inputLine;          while((inputLine=input.readLine())!=null){             if(inputLine.equalsIgnoreCase("quit"))                 break;             System.out.println("received:" + inputLine);             output.println(inputLine);         }             System.out.println("received quit,exiting");     }  public static void main(String args[]){               serverSocket = new ServerSocket(portNumber);          System.out.println("listening on port:"+ portNumber);          EchoServer echoserver1 = new EchoServer(connection1,connection2);         EchoServer echoserver2 = new EchoServer(connection2,connection1);         echoserver1.start();         echoserver2.start();      } }   I also wrote two classes for client. When I run the server and then the first client, they work as expected. However when I try to run the second client, a NullPointerException is thrown, regarding to the following two lines:          input = new BufferedReader(new InputStreamReader(in.getInputStream()));         EchoServer echoserver1 = new EchoServer(connection1,connection2);   I know it's a rather long piece of codes to look at, but I'm really stuck as I can't see the problem here. The earlier single threaded version of server I wrote worked without error, so I know there's something to do about the multithreaded. Any help and advice is really appreciated. Thanks!

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


class Animal               { public: virtual void say() const { std::cout << "mew ?\n"; } }; class Lion : public Animal { public: virtual void say() const { std::cout << "roar !\n"; } }; class Autobus              { public: virtual void say() const { std::cout << "vroum !\n"; } }; // 1 client acting on these classes struct PetSomething {     void operator()(const Animal& a)  { cout << "It says ";  a.say(); }     void operator()(const Autobus& a) { cout << "It makes "; a.say(); } };  int main(void) {   std::variant<Animal, Autobus> thing; // Declaration of $\textrm{\szif thing}$   thing = Animal();   std::visit(PetSomething{}, thing);   // Displays "It says mew ?"   thing = Autobus();   std::visit(PetSomething{}, thing);   // Displays "It makes vroum !"   thing = Lion();   std::visit(PetSomething{}, thing);   // Displays "It says mew ?"   thing = 666;                         // Type error           }    and I'm wondering what type of polymorphisme we are using here, and why we have this behavior specially here :  thing = Lion();   std::visit(PetSomething{}, thing);   // Displays "It says mew ?"

Someone mentioned it in the IRC as the slicing problem.


Does domain name affect seo ,, what if I have only 1 keyword in domain name ,, or no keyword in domain name ,,, a want to start a tech blog , is having "bit' in domain name good/OK?  Its not gonna be a electronics related blog just purely tech stuff (except ec) ,, Q seo effects of  having a top level domain vs a national level domain (.com/.net vs .in)  Q .com vs .net.   Seo affects

I need a counsel about my websites' domain.  Let's say I have just bought two domains: xyz.com and xyzphotography.com.  As we can see, the first one is shorter but way less meaningful than the second one. The second one contains a photography keyword but it's longer.  I have only one website which is my photography portfolio. Can you advise me how to set those domains to make it all as SEO-friendly as possible? Which one should be the main one, does the rest should work on their own or have some kind of SEO-friendly redirect to the main domain?


For example two points can be seen as the boundary of a line segment in $\mathbb{R}$. The plane $\mathbb{R}^2$ can be seen as the boundary of some set in $\mathbb{R}^3$ and so on. Can any set be seen as the boundary of some other set?

Which sets occur as boundaries of other sets in topological spaces?  Of course the boundary of a set is closed. But is every closed set in a topological space, the boundary of some set in that space?  It is tempting to assert that boundaries have empty interiors, but this is not true, as is shown by the fact that the boundary of $\mathbb{Q}$ in $\mathbb{R}$ is $\mathbb{R}$. In fact it can be seen in general that the boundary of a dense set with empty interior is the whole space. Thus the only boundary in an indiscrete space is the whole set. (This is sort of complementary to the comment of Daniel Fischer below.)  However the intuitive feeling comes right for open sets (and then for closed sets as well): The boundary of an open set cannot contain an open set.  This question concerns all subsets of a topological space.  An alternative question shall be to characterise all topological spaces in which every closed set occurs as a boundary.  Note: I have now  this on MathOverflow.


I wonder why the covariance between estimates of slope ($\hat{\alpha}$) and intercept ($\hat{\beta}$) is $-\bar{X}\times Var(\hat{\beta})$. How can I derive this solution by not using matrix?  I add a new picture of my solving steps. I tried to use the rule of variance - which is $Var(x+y)=var(x)+var(y)+cov(x,y)$ - to derive covariance of $\hat{\alpha}$ and $\hat{\beta}$. But as you can see, the final solution I got is something wrong. I can't understand why '$-\sigma^2/2n$' adds to $-\bar{X}\times Var(\hat{\beta})$.  Can you plz help me find the stage in which I made mistake...?

I am reading a book on linear regression and have some trouble understanding the variance-covariance matrix of $\mathbf{b}$:    The diagonal items are easy enough, but the off-diagonal ones are a bit more difficult, what puzzles me is that  $$ \sigma(b_0, b_1) = E(b_0 b_1) - E(b_0)E(b_1) = E(b_0 b_1) - \beta_0 \beta_1 $$  but there is no trace of $\beta_0$ and $\beta_1$ here.


I was using Ubuntu LTS 20.04. I have countered many problems with this version of Ubuntu like Basic desktop actions are not available, etc.  So, I want to download a new and better version of Linux. Please suggest me best version of Linux which I should use, which have almost no such issues.

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


I'd like to use a relative div to fill it up with inline-block-elements aligned next to each other that all got the same width & same height (= squares).   So if there are n elements the relative div should get scrollable in x-direction. This is working so far as you can see in the example code below:    .outer {   position: absolute;   width: 100%;   height: 100%; }  .parent {   position: relative;   width: 90%;   height: 40%;   overflow-y: hidden;   overflow-x: scroll;   text-align: center;   white-space: nowrap;   background: red; }  .item {   background: yellow;   display: inline-block;   width: 4%;   margin: 0% 3%; }  .item::after {   content: "";   display: block;   padding-bottom: 100%; }

     But now I'd like the item-elements (yellow squares) to vertical align into the red parent-div (relative div) so that the distance from top to center and from bottom to center is identical. Please have a look at this image:    Note: I do not want to change the hierarchy (keep the parent elem relative & the outer elem absolute, etc...)  How can I achieve this?

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...


I watched a short intro to Unix from the 70s (  3D animation starts at 1:56), at the end the general tripartite architecture of Unix was displayed as a 3D animation. Because I have seen already diagrams of the ovarall Linux architecture, I became confused.  Both diagrams, Unix and Linux, share the Kernel, but then Unix is wrapped by the Shell and the Shell by the Utilities. Linux instead is only wrapped by the Userspace, and the Shell does not wrap anything but is just one of many processes within the Userspace.  How do Unix and Linux differ on a very basic level, what do they have in common ? Why is Unix tripartite and Linux two-layered ?  Is a Shell a complete different concept within Unix than in Linux ?

So, there are lots of different versions of Unix out there: HP-UX, AIX, BSD, etc. Linux is considered a Unix clone rather than an implementation of Unix. Are all the "real" Unices actual descendants of the original? If not, what separates Linux from Unix?


My mobile is Micromax Canvas HD Plus .It has 4 GB inbuilt memory and 16 GB external memory card.I have selected SD Card as default location to install apps but still when I try to install app from Play Store it shows above error.My SD Card is nearly empty.  I searched a lot .Uninstalling Play store updates,Clearing Cache nothing worked.

If you're not used to seeing the 'low on internal storage' notification, what is it that you're doing to keep your phone's internal memory from filling up so quickly?   The 'SD Card and Phone Storage' menu in the settings doesn't really tell me much other than how much is free. And, I don't really have that many applications installed. The top 5 storage hogging apps on my phone are Gmail (18.6 MB), Twitter (17.5 MB), Facebook (12.55 MB), Maps (9.63 MB), and Swype (6.06 MB).  So, are there apps out there (besides your normal file manager ones, like Astro) that will help monitor internal phone storage? Is there something I should be doing to keep my phone storage use to a minimum?


I have an application listing in my application and I would like to allow people to right-click on an item and show the Windows Explorer context menu.  I'm assuming I would need to use the IContextMenu interface, but I'm not really sure where to start.

I have a file listing in my application and I would like to allow people to right-click on an item and show the Windows Explorer context menu. I'm assuming I would need to use the IContextMenu interface, but I'm not really sure where to start.


var currentDate = Thu Aug 14 2014 05:30:00 GMT+0530 (IST); // This is dateTimeobj  var deptDate = Thu Aug 14 2014 14:23:24 GMT+0530 (IST); // This is dateTimeobj  alert(currentDate == deptDate); // false   How can I compare these two dates, while ignoring the time portion?

Can someone suggest a way to compare the values of two dates greater than, less than, and not in the past using JavaScript? The values will be coming from text boxes.