As part of my coping mechanism for leaving university and accepting the inevitable loss of scientific knowledge post university, I am considering subscribing to a scientific journal so that I can continue to learn and not completely lose touch.  However, there is not much on how I should best approach this. How does one chose the best journal? There are many out there and the subscriptions are not that clear on how they work.  I’ve looked online and some websites quote figures of over £1000 a year which is not feasible.     So what is the best way to access scientific research (i) online and (ii) in hard-copy form as an individual with no affiliation to an institute.

For all that is said about the wealth of information that is freely available on the internet, the fact is that most of it is incomplete, dumbed down, lacking in context or downright wrong.   Individuals spend the best part of 20 years completely oblivious to the existence of journals and the process of peer review and even then we'd be lucky if 10% of those with access to journals (usually through an institution) actually bother to invest in them.   Granted that some journals will be totally inaccessible to those without a solid background in some particular field but by and large exposure is a good thing and there are many areas of research where individuals will benefit directly from having read these.  Where does this come from?  I decided I wanted to read Popular Politics in the Late Medieval City: York and Bruge in The English Historical Review today, mainly because it looks interesting and I'm hoping to invest more time into learning about British and European History. Incidentally I also wouldn't mind tucking into Super Stable Clocks, Nature 500, 505 (29 August 2013) and a number of data analysis and big data journals in order to advance my career.   Now, not being affiliated with an institution that subscribes to these journals means that I would typically have to pay between £5 ($10) and £15 ($25) per article that I read... I could probably spend £100 just to pass an hour by.  Question   What's being done to address the lockdown on 'higher' education material? I've noticed that the Directory of Open Access Journals publishes open articles and other firms are doing similar, mainly with journals in new fields? How could I, as an individual outside of an institution, gain journal access without it costing so much money?


I have this error:  "error C4430: missing type specifier - int assumed. Note: C++ does not support default-int"  with this code example :  //A.h     #include "B.h" class A{     B* b;     .. };  //B.h #include "A.h" class B{      A* a; // error error C4430: missing type specifier - int assumed. };

I often find myself in a situation where I am facing multiple compilation/linker errors in a C++ project due to some bad design decisions (made by someone else :) ) which lead to circular dependencies between C++ classes in different header files (can happen also in the same file). But fortunately(?) this doesn't happen often enough for me to remember the solution to this problem for the next time it happens again.  So for the purposes of easy recall in the future I am going to post a representative problem and a solution along with it. Better solutions are of-course welcome.     A.h  class B; class A {     int _val;     B *_b; public:      A(int val)         :_val(val)     {     }      void SetB(B *b)     {         _b = b;         _b->Print(); // COMPILER ERROR: C2027: use of undefined type 'B'     }      void Print()     {         cout<<"Type:A val="<<_val<<endl;     } };       B.h  #include "A.h" class B {     double _val;     A* _a; public:      B(double val)         :_val(val)     {     }      void SetA(A *a)     {         _a = a;         _a->Print();     }      void Print()     {         cout<<"Type:B val="<<_val<<endl;     } };       main.cpp  #include "B.h" #include <iostream>  int main(int argc, char* argv[]) {     A a(10);     B b(3.14);     a.Print();     a.SetB(&b);     b.Print();     b.SetA(&a);     return 0; }


I'll be going back to the US in February for 10 days or so and up until this year, I've always traveled with my US passport and my Italian ID card to prove my EU citizenship since I live in the EU. This year I decided to get an Italian passport as well since Dutch customs were being problematic about my Italian ID card each time upon re-entry. Id I travel to the US on my US passport and travel back to the Netherlands on my Italian one, am I required to get an ESTA on my Italian passport for the trip back or is that not necessary?

I am a citizen of two different countries, and have two passports.  How should I use my passports when traveling?


In quantum mechanics I learned about Hermitian operators and eigenstates. It seems that Hermitian operators are always mentioned together with eigenstates. Why is that so? Does it mean that a Hermitian operator acting on a wavefunction always give a corresponding eigenvalue and eigenfunction?

Position, momentum, energy and other observables yield real-valued measurements. The Hilbert-space formalism accounts for this physical fact by associating observables with Hermitian ('self-adjoint') operators. The eigenvalues of the operator are the allowed values of the observable. Since Hermitian operators have a real spectrum, all is well.  However, there are non-Hermitian operators with real eigenvalues, too. Consider the real triangular matrix:  $$ \left( \begin{array}{ccc} 1 & 0 & 0 \\ 8 & 4 & 0 \\ 5 & 9 & 3 \end{array} \right)  $$  Obviously this matrix isn't Hermitian, but it does have real eigenvalues, as can be easily verified.  Why can't this matrix represent an observable in QM? What other properties do Hermitian matrices have, which (for example) triangular matrices lack, that makes them desirable for this purpose?


I have an IEnumerable<string> being passed to me which has the following items:   HP Canon  Lexmark Samsung  Other   Now what I am trying to achieve is order the items alphabetically but I want to keep the other item last. I have gone ahead and used OrderBy(i => i)  which lists the items as follows:   Canon HP Lexmark Other Samsung   The desired result I want is    Canon HP Lexmark Samsung Other   I have tried using .OrderBy(i => i != "Other").ThenBy(i => i) but this puts Other item right at the top.   Can someone tell me how to achieve this please.

I have two tables, movies and categories, and I get an ordered list by categoryID first and then by Name.  The movie table has three columns ID, Name and CategoryID. The category table has two columns ID and Name.  I tried something like the following, but it didn't work.  var movies = _db.Movies.OrderBy( m => { m.CategoryID, m.Name })


I have an assignment where I need to go through a vector of strings.  However my function is not working correctly.  When I am trying to compile it, I am getting an error "no member named 'find' in"std::__vector........  I'll include my header file as well as this function from my implementation file.  Can someone help me track down the issue? Not sure why this won't compile with these find functions...   #include <iostream> #include <fstream> #include <string> #include <ctype.h> #include <sstream> #include "DictionarySet.h" #include <cstdlib> #include <vector> using namespace std;   bool DictionarySet::Contains(string word){    if(Standard.find(word) != Standard.end())     return true;   if(User.find(word) != User.end())     return true;   if(Temporary.find(word) != Temporary.end())     return true;    if(isupper(word[0]))   {     word[0] = tolower(word[0]);      if(Standard.find(word) != Standard.end())         return true;     if(User.find(word) != User.end())         return true;     if(Temporary.find(word) != Temporary.end())         return true;    }      return false; }   here is the header file if you need it  #ifndef _DICTIONARYSET_H #define _DICTIONARYSET_H #include <vector> #include <string> //*** include suitable STL container using namespace std; //*** Deal with namespace    class DictionarySet {     const char * const StandardDictionary;     char * UserDictionary;     string DictionaryPath;      void ReadDictionary(const char * const DictionaryName, vector<string> &Set);  public:     /*** STL container ***/ std::vector<std::string> Standard;     /*** STL container ***/ std::vector<std::string> User;     /*** STL container ***/ std::vector<std::string> Temporary;      bool Contains(string word);     void Add(string word);     void Ignore(string word);     void Initialize();      DictionarySet(const char * const SD = "/usr/share/dict/words", const char * const UD =     "_Dictionary");     ~DictionarySet(); };   #endif

All I want to do is to check whether an element exists in the vector or not, so I can deal with each case.  if ( item_present )    do_this(); else    do_that();


I have a select field as follows:  <select id="shippingSelect" tabindex="3" onchange="Cart.update();">     <option value="">Select Shipping Option</option>     <option value="Free">Free Shipping</option>     <option value="Reg-Airmail">Registered Airmail</option>     <option value="EMS-Express">EMS-Express Shipping</option>     <option value="DHL-Express">DHL-Express Shipping</option> </select>   I am setting the selected value in html 5 local storage with key "shippingSelect" .  I want to disable the shipping select and display the user last selected option as selected field.  I am able to disable the select field if local storage set.   if (shipEmpty && isEmpty) {     $("#shippingSelect").attr('disabled', 'disabled');     $("#shippingSelect").css('pointer-events', 'none');     $("#shippingSelect").prop("disabled", true); }   But the select display displays "Select Shipping Options" rather than the last user selected option value in drop down.   I tried using   if (shipEmpty && isEmpty){ $("#shippingSelect option:selected").text() );   How can i display last selected option as Selected Option. The disabled select field must display last selected option.  How is that possible in jQuery ??  update: $("#shippingSelect").val(myObject);   was the solution

I have a drop-down list with known values. What I'm trying to do is set the drop down list to a particular value that I know exists using jQuery.  Using regular JavaScript, I would do something like:  ddl = document.getElementById("ID of element goes here"); ddl.value = 2; // 2 being the value I want to set it too.   However, I need to do this with jQuery, because I'm using a CSS class for my selector (stupid  client ids...).  Here are a few things I've tried:  $("._statusDDL").val(2); // Doesn't find 2 as a value. $("._statusDDL").children("option").val(2) // Also failed.      How can I do it with jQuery?     Update  So as it turns out, I had it right the first time with:  $("._statusDDL").val(2);   When I put an alert just above it works fine, but when I remove the alert and let it run at full speed, I get the error     Could not set the selected property. Invalid Index   I'm not sure if it's a bug with jQuery or Internet Explorer 6 (I'm guessing Internet Explorer 6), but it's terribly annoying.


It looks a bit silly question and not that important question, so it is just out of curiosity. Please bear with me. :)  I have just noticed it this morning that the hat is rendered differently on the avatar between the profile page and the one in the top bar on the left of the reputation count and the badges.  I wonder if it is a bug or whether I am doing something wrong. You can find the screenshots taken below. The difference seems to be appealing for instance at my left eye.

In my profile my hat is on the correct position, but not in the top-bar. This is new. It worked until now.    Works neither in Chrome nor in Firefox.


I am attempting to add 2 sub-class objects to a static Collection of super-class objects. However, when I try to add the objects to the Collection, I'm receiving a null pointer exception and I'm trying to figure out why.  public class MoverLogic{     static Collection<Super> superCollection;      public static void main(String[] args) {     SubAlpha sub1 = new SubAlpha();     SubBeta sub2 = new SubBeta();     superCollection.add(sub1); //I'm getting the null pointer exception here     superCollection.add(sub2); }

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?


Suppose I have two securities A and B in India. I sell A at a profit of 100 INR, and B at a loss of 90 INR. Both transactions are short-term. So my net gain is 10 INR. But I buy B immediately afterwards. Am I still allowed to show my net gain as 10 INR?

Is there any tax law prohibiting losses booked due to wash sales rule in Indian market?  e.g. If I buy a Sun Pharm stock at 634. After 10 days, I sold it at 609.25 and buy again at 608.75 in the same day. Can I still claim loss of 25.75?


I never read far into this book, but I remember the beginning being about an AI, and then a Human family crash-landing on a planet that had wolf-like aliens; these aliens had long necks and formed a consciousness by linking several seperate bodies together into a hive-mind-like pack, which could share and process information together and think as one.

The main premise is that as you head out of the galaxy, the more god-like you become. The inside is the 'unthinking depths'  There was an AI like enemy being, that computer archaeologists let escape, that wants to take over the universe.   One of the god-like beings puts the 'key' of the enemy's destruction into a human created from pieces of an old space battle.  The hero and the created human, who seem to be the only humans left in existence, go to a lower level, less evolved, civilized world, where a human explorer landed long ago who succumbed to the local forces or lizard people, to find the other part of the key and finally defeat the enemy AI by sending a wave of 'slowness', powered by their sun, making most of the galaxy not traversable by hyperdrive, effectively locking the enemy AI in 'space' with no means to travel.  Help!


my system is dell inspiron1525. I want to install fifa13 or 12 in my laptop.I use ubuntu14.04.Show me the way.

Is it possible to install FIFA 13 and Origin using Wine.  My graphics card is ATI and its driver is installed in Ubuntu. I wanted to install FIFA 13 using wine. When I tried FIFA 12, it was installed and getting freezed on the game launch.


When used as an activation function in deep neural networks The ReLU function outperforms other non-linear functions like tanh or sigmoid . In my understanding the whole purpose of an activation function is to let the weighted inputs to a neuron interact non-linearly. For example, when using $sin(z)$ as the activation, the output of a two input neuron would be:  $$ sin(w_0+w_1*x_1+w_2*x_2) $$   which would approximate the function  $$  (w_0+w_1*x_1+w_2*x_2) - {(w_0+w_1*x_1+w_2*x_2)^3 \over 6} + {(w_0+w_1*x_1+w_2*x_2)^5 \over 120} $$  and contain all kinds of combinations of different powers of the features  $x_1$ and $x_2$.   Although the ReLU is also technically a non-linear function, I don't see how it can produce non-linear terms like the $sin(), tanh()$ and other activations do.  Edit: Although my question is similar to , I'd like to know how even a cascade of ReLUs are able to approximate such non-linear terms.

Why are activation functions of  (ReLU) considered non-linear?   $$ f(x) = \max(0,x)$$  They are linear when the input is positive and from my understanding to unlock the representative power of deep networks non-linear activations are a must, otherwise the whole network could be represented by a single layer.


what is my mistake ? why this click function is did not work ? i made this function without each loop, then that function working properly, but why did not work this place ?          <title> NG - REPEAT </title>

                 ID	                 NAME	                 VERSION	                 PRICE	                 ACTION

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


Assume we have a non-empty  $X \equiv \{ A_i \}_{i \in I}$. Then the  asserts that there exists a choice function $F: X \rightarrow \cup X$ such that $F(A_i) \in A_i$. I claim that it is possible to build the choice function using just the . Of course this cannot be true because choice is independent of $ZF$. So where am I going wrong? Constructing the choice function $F$ using $X \equiv \{ A_i \}_{i \in I}$ and powerset axiom  Given an indexed family of sets $X \equiv \{ A_i \}_{i \in I}$, first make this family unique, by creating a new collection of elements $Y \equiv \cup_{i \in I}\{i\} \times A_i$. This  Build the powerset $P = 2^Y$.  Filter subsets of the powerset that have a single element $(i, \text{some element in }A_i)$ for each $i \in I$. Formally, create the set:   \begin{align*} &\operatorname{ChoiceFns} \equiv \{ p \in P : \forall i \in I, \text{there exists a unique $a$ such that $(i, a) \in p$}\} \\ &\operatorname{ChoiceFns} \equiv \{ p \in P : \forall i \in I, (\exists a \in A_i, ((i, a) \in p) \land (\lnot \exists a' \in A_i, a' \neq a \land (i, a') \in p))  \} \end{align*} This now gives us a collection of choice functions, since each element $p \in P$ maps  the index $i \in I$ to a unique element $a \in p$? What am I missing?  How am I able to build a set of choice functions ?

I have been thinking about the following formulation of the Axiom of Choice.:     For any relation $R$, there is a function $H$, which is a subset of $R$, and such that $\operatorname{dmn}H=\operatorname{dmn}R$.   At first, it seemed surprising to me that this did not follow from Comprehension (i.e., from the schema  $\forall x_1, x_2, ..., x_n \forall C\exists B \forall x ( x \in B \Leftrightarrow x \in C \land \phi )$, where $B$ does not occur free in $\phi$).    I thought that for any relation, it seems that we should be able to define a subset of it with the same domain meeting a "functional condition".  But when I tried to do this, I couldn't.  However, I felt like I was getting close when I let $B$ be free in $\phi$, i.e., when I let myself say that $w$ is in $R$ and also anything in $H$ meets such and such conditions, where $H$ is the set (function) whose existence I'm trying to prove.    But my understanding is that Choice does not even follow from Naive Comprehension.  So, I wondered if someone could explain the following precisely.   Why does the above formulation of Choice does not follow from regular Comprehension? Why does it not even follow from Naive Comprehension (assuming that it does not)?


I've noticed that questions will come up that belong on another site within the stack exchange network, however the "it doesn't belong here" option only shows popular sites.   Is it possible to have a context sensitive flag box that reads the questions tags and provide the appropriate options to migrate the question?    For instance, question   was flagged drupal-7,drupal-modules and drupal-theming, yet the option to migrate to the drupal SE site is not present:     Having context sensitive migration would allow the drupal site to appear in the selections.  I think this would be better than using the "needs moderator attention -> other" option, or flagging in another inappropriate way.

Would it be a good idea to change the migration destination sites based on the question tags?   allows one to select from a limited number of destination sites. This group of sites is the same for a whole site, to keep the list short. However, if a question is tagged with , it is likely that  would be a good destination.  What do you think of extending the destination list based on question tags? This would give smaller SE sites a chance of migration input, without polluting the list for all questions. So you still have three or four standard destinations, and then add tag-based destinations to the list.


In The Fellowship of the Ring, the council of Elrond plays with the idea that hiding the ring by sinking it to the bottom of the sea would make it safe.     'Not safe for ever,' said Gandalf. 'There are many things in the deep waters; and seas and lands may change. And it is not our part here to take thought only for a season, or for a few lives of Men, or for a passing age of the world. We should seek a final end of this menace, even if we do not hope to make one.'   Is this meant to be an enigma? Does Tolkien ever mention things in the sea in the Silmarillion or his other works? What does Gandalf even mean? Does it have to do with Numenor? Or does he mean Sea monsters? What are they like? The Watcher in the Water? Are they servants of Sauron? Are they crated by Morgoth like the dragons? Would they wield the ring or return it to Sauron? I'd love to know more about this!

Are there any water based creatures in The Lord of the Rings aside from the  who attacked the Fellowship in Moria?


I'd like to set ssh_config so after just typing ssh my_hostname i end up in specific folder. Just like I would type cd /folder/another_one/much_much_deeper/.  How can i achieve that?  EDIT. It's have been marked as duplicate of "How to ssh into dir..." yet it is not my question.  I know i can execute any commands by tailing them to ssh command. My question is about /ssh_config file not the command.

I frequently login to a server, then cd into a specific directory. Is it possible to simplify these two commands into one?   ssh bob@foo   cd /home/guest   I'd like to avoid changing anything on 'foo' if possible, as I'll have to clear it with the server administrator. I use bash, but I am open to answers in other shells.


In  question, a US citizen is complaining about always getting an "X" receipt when using the APC kiosks. What recourse do people in a similar situation have to fix this problem?  Since APC kiosks are available to , there might be different options for US and non-US citizens.

I'm a US citizen. Every time I use the automated passport kiosks, regardless of the airport or who I'm travelling with, they always give me an X. This means I get to stand in yet another line and get all-but-waved-through when I eventually get to the officer.  In the interest of not having to stand in the first line for the kiosks, am I allowed to just go to the visitors line instead? Or will I get sent back and told to use the kiosks? Or is there some other way to opt out of their use?  When I flew from Guangzhou to LAX in June, I stood in the kiosk line a full 45 minutes, only to receive an X and get sent to the visitors line for another 35 minutes. This is what I'm trying to avoid. Clearly it doesn't matter when flying into, say, BWI where there are no kiosks (and you're going to wait 2 hours for your luggage anyway), but rather for the airports that do have the kiosks. At LAX, everyone in the US citizen line was directed to kiosks.


I'd like to get my gmail space down. Logically the way to do it would be to start with the largest messages first. ( reasoning - start with the things that give the largest benefit.)  My question is: Is there a way to list messages in gmail by descending order of size?

Google has started to warn me that I am almost out of space in my Gmail account. How can I sort my messages by size to identify any expendable large emails in my account?


Pl. see the sentence below   [1]. Hardly had the bell rung when Matthew started running out of his classroom.   I guess the construction is correct. If I change this to   [2]. Hardly the bell had rung when Matthew started running out of his classroom.  [3]. When Matthew started running out of his classroom, the bell had hardly rung.    Is there any grammatical error in these constructions or which one of these is most neat and why. We see the first construction most often.   Thanks---Suddhasattwa, India

There is a sentence:     No sooner had he sat down than he fell asleep.   I just do not understand, is this an inversion? And if so, I still do not understand the sentence.


Looking for either word “ And ” or “ In ” with preceding and ending spaces, I can using following FINDSTR command:  findstr /r /c:” And ” /c:” In “ textfile  Is there a way to do similar search with only on /c parameter? I was hoping this parameter would work: /c:” (And|In) “

findstr /v "black"  File1.txt   Above DOS command will display content of 'File1.txt' which are not matching string "black".  How to modify this command , if I need to filter words "black" and "white" ?


I need to install .ipa file on iPhone simulator.  I tried to change the extension .ipa to .zip and extracted it.  And I got the Payload folder and moved the application inside to my iPhone simulators applications folder at:   /Library/Application\ Support/iPhone Simulator/6.1/Applications/   Application appears on iPhone Simulator, But the application did't running. How to solve the problem then how to run the app.

I have an iphone simulator running on my Mac.   I have a .ipa file, can you please tell me how can I install it on the simulator?


This question and its answers, , very recently asked has me a bit stumped. The OP basically states that the HUP: $$\Delta x\cdot \Delta p\geq \frac{\hbar}{2}\tag{1}$$ implies that $p\neq 0$, always. Or as one commenter ('Sebastian Riese') stated:  The uncertainty conundrum is seen to be solved when looking at the approximations: The position uncertainty goes appropriately to infinity as we approach zero momentum uncertainty.  Now if we look at the very (teachable and) useful example of the $\text{1D}$ particle in a box with $\text{zero}$ potential energy $V(x)=0$ inside and infinitely high potential walls, we know that the ground state energy $E_1$ is non-$\text{zero}$, $E_1>0$. Since as $V=0$, then: $$E_1=V+K=K$$ This clearly implies that there is kinetic energy and thus motion and momentum, i.e. $p>0$. Many, many moons ago I was taught (perhaps badly!) that this non-zero ground state energy is an illustration of the HUP, as it shows $p\neq 0$, in accordance with $(1)$. Because if $p=0$ then it is exactly known, so $\Delta p=0$, which violates the HUP. And from this :  A simple way would be to realise that when $n=0$, the magnitude of the momentum is 0, and thus there are no 'positive' and 'negative' values it could take: it most definitely has a momentum of exactly zero, with no uncertainty. This would be allowed, if you were not in a box. However, placing yourself in a box, meaning that $Δx<∞$, means that you necessarily have a minimal non-zero momentum, using the argument you mentioned earlier.  That seems to confirm the role of HUP in explaining why non-zero ground energy is required. Is this reasoning wrong?

I Appreciate the statement of Heisenbergs uncertainty principle however am a bit confused as to how exactly it applies to the Quantum Mechanical situation of an infinite square well.  I understand how to apply schrodingers equation and appreciate that energy Eigenvalues can be deduced  as   $$E_n=\frac{n^2\hbar^2\pi^2}{2mL^2}$$  However I have read somewhere that the reason that the quantum particle can not have $n = 0$ in other words $E = 0$ is because by having zero energy we also have a definite momentum with no uncertainty and by the Heisenberg uncertainty principle this should lead to an infinite uncertainty in the position of the particle however this cannot be in an infinite well as we know it should be somewhere in the box by definition. Therefore $n$ may be another greater or equal to one.  Surely when $n = 1$ we have the Energy as $\hbar^2 \pi^2 / (2mL^2)$ which is also a known energy and so why does this (as well as the other integer values of $n$) not violate the uncertainty principle.


I do not understand how to properly solve this limit:  $$ \lim_{n\to\infty} \frac{2^{n+1}+3^{n+1}}{2^n+3^n} $$  I thought of breaking it up:  $$ \lim_{n\to\infty} \frac{2^{n+1}}{2^n+3^n} +\lim_{n\to\infty} \frac{3^{n+1}}{2^n+3^n} $$ But I do not see how this will allow me to use any of the limit rules to reduce. I know that the series converges though.   Thanks.

i am pulling my hair out in solving this problem. i know, it is a stupid question but i am not that good at maths, and many thanks for any help   $\lim_{n \to \infty} \frac{2^{n+1}+3^{n+1}}{2^n+3^n}$  my steps are: $\lim_{n \to \infty} \frac{2^{n+1}+3^{n+1}}{2^n+3^n} = \frac{2^{n}2+3^{n}3}{2^n+3^n} = help = ?  $  i know, it diverges as the denominator grows faster than the nominator, but the calculation is killing me now


Whenever i create a css file either by web->css or by javafx project i get the same error      Multiple markers at this line     - Syntax error on token "Invalid Character", interface expected     - Syntax error, insert "InterfaceBody" to complete CompilationUnit   i searched for the solutions but they are generally like create a new css file by web->css but that didn't help me. i further researched and i found that there is no output file for css in bin.Now i don't know what to do.Can anyone help me? here is my code(eclipse Neon):     package application;     import javafx.application.Application;    import javafx.fxml.FXMLLoader;    import javafx.stage.Stage;    import javafx.scene.Parent;    import javafx.scene.Scene;   public class Main extends Application { @Override public void start(Stage primaryStage) {     try {         System.out.println("aaaa");         Parent root=FXMLLoader.load(getClass().getResource("/application/Main.fxml"));         Scene scene = new Scene(root);         scene.getStylesheets().add(getClass().getResource("application.css").toExternalForm());         primaryStage.setScene(scene);         primaryStage.show();         primaryStage.setTitle("pvrock");     } catch(Exception e) {         e.printStackTrace();     } }  public static void main(String[] args) {     launch(args); } }   application.css  #label{      -fx-font-size:30px;   }   Main.fxml      <?xml version="1.0" encoding="UTF-8"?>      <?import javafx.scene.control.Button?>     <?import javafx.scene.control.Label?>     <?import javafx.scene.layout.AnchorPane?>     <?import javafx.scene.text.Font?>        <AnchorPane prefHeight="300" prefWidth="400" xmlns:fx="http://javafx.com/fxml/1" xmlns="http://javafx.com/javafx/8.0.60" fx:controller="application.MainController">        <children>           <Button fx:id="btn1" layoutX="169.0" layoutY="198.0" mnemonicParsing="false" onAction="#f1" prefHeight="23.0" prefWidth="62.0" text="Click me">      <font>         <Font size="10.0" />      </font>   </Button>   <Label fx:id="label" layoutX="146.0" layoutY="112.0" prefHeight="78.0" prefWidth="120.0" />        </children>     </AnchorPane>   MainController.java      package application;      import java.util.Random;      import javafx.event.ActionEvent;     import javafx.fxml.FXML;     import javafx.scene.control.Label;  public class MainController { @FXML private Label label;  public void f1(ActionEvent event){     Random rand=new Random();     int num=rand.nextInt(50)+1;     System.out.println(num);     label.setText(Integer.toString(num));  }  }   screenshot of errors:

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?


I just started working on Ubuntu 16.04 Mini, and I just star working on PHP. When I create php file and put in directory /var/www/ubunturock/dummy.php and run the apache server and when I go to my address ubunturock/dummy.php I get my PHP code file. Any idea?  Here is my PHP code as well:  <?php $servername='localhost'; $username='root'; $password='root';  $schema='demir';  $conn=mysql_connect($servername, $username, $password) or     die('Connection failed : ' . $conn-> connect_error);  mysql_select_db($schema);  $result=mysql_query('SELECT * FROM topics');  echo '
All Topics

'; echo '
'; echo '
ID	Name
'; while($row = mysql_fetch_assoc($result)){     echo '
';     echo '' .$row['id'].'	';     echo '' .$row['name'].'	';     echo '
'; } echo '
'; ?>

I have just reinstalled Apache and PHP5 but when I visit my doc root it just downloads a "download" file. And when I try documentroot/index.php it just downloads the PHP file.  I have PHP installed but Apache doesn't seem to want to execute it. People suggested adding a 'Load Module' line to my httpd.conf but I don't have that file.


If I use my Ubuntu system for more than 24 hrs, the file manager closes automatically. And if I try to open it again, it opens and closes immediately.   I tried to open it using the command sudo nautilus, but that returns  Maximum number of clients reached ** (nautilus:31308): WARNING **: Could not open X display Maximum number of clients reached (nautilus:31308): GnomeDesktop-WARNING **: Unable to open display ':0'  when setting background pixmap  Segmentation fault (core dumped)

I'm hitting a problem whereby X prevents processes from creating windows, uttering something like the following into ~/.xsession-errors:  cannot open display: :0.0 Maximum number of clients reached   Searching around there are lots of examples of people facing this problem, and sometimes people identify which program they are running is using up all the client slots. See e.g.  (Firefox),   (gnome-screensaver).  For what it's worth, I run gnome-terminal, thunderbird, chromium-browser, empathy, tomboy and virtualbox nearly all the time, on top of the normal stuff you get with the GNOME desktop, and occasionally some other bits and pieces.  However my question is not "which of my programs is causing this problem" but rather, how can one go about diagnosing this problem?  In the above (and other) bugs, forum reports, etc., a number of tools are suggested:   xlsclients - lists the client applications for the given display, but I don't think that corresponds to 'X clients' xrestop - a top-style X resources tool, one row per X client. Lots of '' clients, not shown in xlsclients output xwininfo -root -children lists X window objects   From what I can gather, the problem might not be too many clients at all, but rather resources kept around in the X server for clients who have long-since detached.  But it would also appear that you cannot (easily?) relate X resources back to their client.  Can one effectively diagnose this issue once it has started to occur, or is a tedious divide-and-conquer approach for the apps I run the only approach open to me?  Update Jan 2011: I think I have resolved this issue.  For the benefit of anyone stumbling across this, nautilus and/or compiz or something in that chain of software was segfaulting due to a wallpaper I had.  I had chosen an XML file as my wallpaper, which defined a rotating gallery of images.  It was hand-made, but based on /usr/share/backgrounds/contest/background-1.xml or similar.   Disabling the wallpaper and I have not had a crash since.  I'm not marking this as answered yet, since the actual specific problem was not my question, but how to diagnose it was.   Unfortunately this was mostly trial-and-error which sucks.


I'm having some difficulty solving this problem. The information I have is the following:  What is the minimum degree for a polynomial for it to pass through points $A(x_1,y_1)$ and $B(x_2,y_2)$ with predefined slopes $S_1$ and $S_2$.  Thanks in advance!

How can I calculate a Polynomial that passes through the origin and a given point (P) having given tangents at the origin (Ot) and the given point (Op)?  The given point will always be to the right of the origin (Px > 0). The polynomial should be a function of x (i.e. it moves from left to right).  I believe a 3rd degree polynomial will always fit these constraints, but I'm not certain.  I am looking for a function f( x, Px, Py, Ot, Pt ) = ? which plots a polynomial for x, satisfying the four given values.  When x = 0,   f()   = 0 When x = Px,  f()   = Py When x = 0,   f'()  = Ot When x = Px,  f'()  = Pt


I love the Hidden communities feature. Its official definition is (emphasis mine):     Hiding a community means other users will not see it in your Communities list or Top Network Posts.   The "Communities list" part works, but the "Top Network Posts" can be interpreted in two ways; the widget visible on each  (where they're hidden) and the  (where they aren't). Please hide them there as well.  Demonstration  I have Worldbuilding as "hidden" in my Settings' "Hide Communities":    ... but it still shows up in  page, even when not logged in:    Note: Not a duplicate; actually the only answerer there . Also note that while the existing bug report was marked as by design, this is a feature request to change the design.

Recently, I've discovered that the communities that I have hidden are still visible under the 'top', 'reputation' and 'activity' tabs of my Network Profile.        Is this a bug or ? If so, doesn't this defeat the purpose of hiding a community since it can still be found by navigating to the 'reputation' tab?


Is there anyway to backup Outlook data files automatically even if Outlook is running? I thought of a standard task on Task Scheduler and use the copy command but it won't copy if Outlook is running. Is there anything within Outlook or Windows? We'll be using Outlook 2010 mainly but I would like to know about both 2010 and newer versions.

[...] All versions of Outlook use pst files, but the disk location has changed over the years. Right-click your email account on the left in Outlook and select Data File Properties. Click Advanced to see the filename. Only the pst file is essential, but copy the whole folder to back up Outlook’s settings and preferences too. Just copy it back to restore it, or click File, Open, Open Outlook Data File. Outlook can work with any pst file stored anywhere.  Backing up your Outlook data file(s) is as easy as copying your .OST or .PST files over to another hard drive, cloud server, thumb drive, or some other storage medium. You remember how to locate your data files? Open the Mail control panel and click the “Data Files” button. Click “Open File Location…” and you can then back up your data files. [I don't display  here)  After following the instructions above, I arrive at:  C:\Users\[my username]\AppData\Local\Microsoft\Outlook  However, all Outlook Data Files here are .ost, and NOT .pst. In  File > Open & Export > Open Outlook Data File, 'Open Outlook Data File' only works for .pst. What is wrong here? Where's the folder with all the .pst files? How can I backup all my Outlook email accounts simultaneously?


Let $\{(a_{ij},...,a_{in}) \in T^n \mid i = 1,...,s \le n\}$ be a set of vectors. Prove that if $$|a_{jj}| \gt \sum_{i=1, i\neq j}^s|a_{ij}|, \quad 1 \leq j \leq s$$ then the set is linearly independent.  My attempt: I was trying an example with $n=s=3$,  $|a_{11}| \gt $$\sum_{i=1, i\neq j}^{n=3}|a_{i1}|= |a_{21}|+|a_{31}|$   $|a_{22}| \gt $$\sum_{i=1, i\neq j}^{n=3}|a_{i1}|= |a_{12}|+|a_{32}|$  $|a_{33}| \gt $$\sum_{i=1, i\neq j}^{n=3}|a_{i1}|= |a_{13}|+|a_{23}|$  For the linear independence we would have to satisfy, that $x=y=z=0$  $$         \begin{pmatrix}         a_{11} & a_{12} & a_{13} \\         a_{21} & a_{22} & a_{23} \\         a_{31} & a_{32} & a_{33} \\         \end{pmatrix}           \begin{pmatrix}         x \\         y \\         z \\         \end{pmatrix} = \begin{pmatrix}         0 \\         0 \\         0 \\         \end{pmatrix} $$  But I just don't know what's next. Like the $|a_{jj}|$ are on the places where are pivots and if these elements are after Gauss elimination nonzero, then our given set in linearly independent. But I don't know how to prove it. Thanks for help.

Let $a_1,\dots ,a_n \in \mathbb{R}^n$ with $a_i = (a_{i1}, \dots , a_{in})$.  Show that when $\mid a_{jj}\mid \gt \sum_{i \neq j} \mid a_{ij} \mid \; \forall \; j\in \{1,\dots ,n\}$, then $a_1,\dots ,a_n$ are linearly independent.  I want to show that the matrix \begin{matrix} a_{11} & a_{21} & \cdots & a_{n1} \\ a_{12} & a_{22} & \cdots & a_{n2} \\ \vdots & & \ddots & \\ a_{1n} & a_{2n} & \cdots & a_{nn} \end{matrix} can be transformed into an upper triangular matrix with all entries in the main diagonal $\neq 0$.  For the cases $n=1$ and $n=2$ this is easy. However, I fail to show this for the general case; the problem being that the tranformations mess up the coefficients such that I can't use the assumption on the $a_{jj}$'s anymore.  I'm pretty sure that this has already been solved somewhere on here, but I don't know how to search for it.


I have 2 tables. One (domains) has domain ids, and domain names (dom_id, dom_url).  the other contains actual data, 2 of which columns require a TO and FROM domain names. So I have 2 columns rev_dom_from and rev_dom_for, both of which store the domain name id, from the domains table.  Simple.  Now I need to actually display both domain names on the webpage. I know how to display one or the other, via the LEFT JOIN domains ON reviews.rev_dom_for = domains.dom_url query, and then you echo out the dom_url, which would echo out the domain name in the rev_dom_for column.  But how would I make it echo out the 2nd domain name, in the dom_rev_from column?


From terminal unable to locate package error. I have already added repository.

Please tell me the full process of installing Android Studio and its necessary dependencies.


I want to obtain an increase in the size of nested parenthesis with a single command like \left and \right, something like the right term of  but using the code used for the left term. (The image is created using \left(1 + \left(f(x),g(x)\right)\right) and \Big(1 + \big(f(x),g(x)\big)\Big)) I could simply use \bib, \Big, ... but I don't want to keep track of the content all the time. I have no clue how to define a new set of \left and \right for this purpose.

As I prefer outer parentheses to grow larger in nested expressions, I happen to insert \bigl and \bigr and its larger cousins a lot. I have always wondered whether there is a way to do this automagically.  Inserting \left and \right prophylacticly before all opening and closing parentheses and hoping that it sorts things out doesn't do the trick in all cases as seen below.  The left column is without any size changing commands. The middle column as a \left \right pair at every parentheses/brace/bracket and the rightmost column shows my preferred version.    As seen in the middle column of the second and third line the \left and \right pair sometimes makes the outer parentheses larger, on the cost of an extra horizontal space between \Pr and (. The extra space is fine in case of really big opening parentheses but here I'd prefer the regular spacing.  \documentclass{scrartcl} \usepackage{amsmath} \usepackage{amsfonts} \begin{document} \begin{align*} &1-(1-F(x))^n&&1-\left(1-F(x)\right)^n&&1-\bigl(1-F(x)\bigr)^n\\ &\Pr(X_{(1)}\le x)&&\Pr\left(X_{(1)}\le x\right)&&\Pr\bigl(X_{(1)}\le x\bigr)\\ &\mathbb{E}[\min\{X_1,X_2\}]&&\mathbb{E}\left[\min\left\{X_1,X_2\right\}\right]&&\mathbb{E}\bigl[\min\left\{X_1,X_2\right\}\bigr]\\ &\left(\pi-\arccos(\frac{y}{r})\right)&&(\pi-\arccos\left(\frac{y}{r}\right))&&\left(\pi-\arccos \left(\frac{y}{r}\right)\right) \end{align*} \end{document}   As mathematical expressions can be arbitrarly complex there is probably no general way to do this. But I’m not asking for a solution of the general case. A partial solution that works in the simple cases shown above would be a big help. The simple rule could be, that parentheses never shrink below the size of an inner pair. Of course you can immediately think of extensions like a \mid in a conditional expectation that grows with the size of the expectation’s brackets.  What is your preference regarding the size of nested parentheses? Is there a better way to archieve your preferred style despite inserting \bigl \bigr manually?    EDIT:  A colleague pointed me to section 8.3 of Herbert Voß’  document where size problems with parentheses are solved by playing with two TeX parameters within a group around the expression in question. This led naturally to appendix G of the TeXbook where the mechanics of \delimitershortfall and \delimiterfactor are explained.  \delimitershortfall specifies the maximum space not covered by a delimiter (default 5pt) and \delimiterfactor is the ratio for variable delimiters, times 1000 (default 901).  I used them to implement the never shrink below a subformular size idea from above by setting the shortfall to 0pt and the ratio to 1.0.    While it works nicely in line one and three, in line two and four the parentheses now grow too much, and still there is the extra horizontal space introduced by \left.


I am using python 2.7.10 from Anaconda 2.2.0, on Ipython Notebook, and am observing the following apparent bug (see code below).  The same operation on two equivalent lists produces two unequivalent lists.  If it is intended that the two lists are supposed to behave differently because of the different ways that they are initiated, then an equality comparison of the two lists should not evaluate to True (because A == B <=> F(A) == F(B)) . To my mind, this must be a bug either in the list object definition, or the equality operator implementation. Can somebody please confirm that this is a bug and tell me the best way to call this to the community's attention?   > test = [[]]*3  > testtwo = [[],[],[]] > print(test) > print(testtwo) > print(test==testtwo)  [[], [], []] [[], [], []] True      > test[1].append(2) > testtwo[1].append(2) > print(test) > print(testtwo) > print(test==testtwo)  [[2], [2], [2]] [[], [2], []] False

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


I have an internal hard disk of 80 GB in it, I've installed Windows 7. In another External Hard Disk of 1 TB, I've installed Ubuntu 18.04 in a 125 GB Partition. Well this ext hard disk get faulty at times to my PC won't recognize it. When it's so, it is showing entering grub rescue mode and it waits for my command. So literally I can't go to Windows without my ext hard disk.  What I wish to do is to boot the Windows in my internal hard disk even when the external hard disk is unplugged.  PS I'm willing to reinstall my Ubuntu but I don't want to lose any data in my internal Hard disk.

I have Windows 8 pre-installed, and then I installed GRUB with Ubuntu. Ubuntu is not my thing, so now I want to remove it along with GRUB. From what I have learned, with UEFI, GRUB does not overwrite the windows bootloader in the EFI partition and is stored elsewhere. How would I remove GRUB and make my PC use the Windows bootloader instead? It should be noted that I created a separate /boot partition when installing Ubuntu.


I just want to know why we initialize object of a parent class and instantiate it with the child class instead of directly instantiating child class object.  Sample :  List<String> sampleList=new ArrayList<String>();   And Not   ArrayList<String> sampleList=new ArrayList<String>();

Why prefer composition over inheritance?  What trade-offs are there for each approach?  When should you choose inheritance over composition?


My PC has the latest version of ubuntu installed (13.04) and i usually watch movies (also on DVDs) with VLC Player.  Now that i havent watched a dvd in long time i wanted to try it again. But it didn't worked. VLC player starts and switches from play to pause while the drive makes noise in the same rythm. It looks like it is stuck in an infinite loop. the movie player (ubuntu builtin player) gives a warning that says he couldnt play the dvd (no reason said).  i tried more than just one dvd, they all didn't work. half a year ago i watched dvds with vlc player and everything worked fine. maybe there's a problem with third-party-software? does anyone have the same problem? could you please help me with that?

My machine can't play encrypted DVDs on a fresh install.  How do I add this capability?  Another useful bit of information would be what programs are best for playing DVDs, once I'm able to do so.  See the .  Will I be able to play DVD movies from ?


I don't understand this shortcut notation.   Two examples:   propEq  (String → a → Object → Boolean) sortBy (Ord b => (a → b) → [a] → [a])   Can you decipher it?  And yes, I know how to find its docs, but this documentation is rather poorly described

I encountered this term Hindley-Milner, and I'm not sure if grasp what it means. I've read the following posts:  Steve Yegge -  Steve Yegge -  Daniel Spiewak -   But there is no single entry for this term in wikipedia where usually offers me a concise explanation. Note - one has  What is it? What languages and tools implement or use it? Would you please offer a concise answer?


10 years ago it was my first year in University and I bombed a course in programming. I had no programming experience and was competing with people have been programming since 10. I felt stupid and my confidence crushed back then. Since then I have done much more programming in a variety of settings, worked in industry on software projects, and created many projects using various programming languages often under deadline. I have now returned to school and I am deciding to TA a course on the very same subject I bombed in 10 years ago. However, I feel discouraged given my bad performance in this course. I feel like I still don't deserve to help to teach young people. I feel that other people are much more qualified than me even though they may be much younger. Plus I am also questioning if I actually know the concepts. Logically, a lot of the things I know and done are transferable, but I can't get over my self-doubt. In this situation, should I decide to TA this course or not?

is a psychological phenomenon wherein an individual is convinced that they do not deserve the success that they have achieved despite (perhaps extensive) empirical evidence to the contrary.  Some people with imposter syndrome doubt their own ability level. For me, this usually manifests in the thought:  I've somehow convinced everyone into believing that I'm actually good at this.  followed by the horrifying notion that eventually I'll be found out and my world will collapse. I believe that the imposter syndrome is not uncommon in academia. I'm interested to know how other people here have experienced and dealt with it.  In particular, I'm looking for actual tactics that someone might use to combat imposter syndrome.   Why I asked this question: Beyond the obvious reason that this is something I have struggled with for many years and only recently gotten a handle on myself, there's also some evidence that merely realizing that other people experience imposter syndrome helps fellow imposters. As a grad student, I've managed to meet a fair number of people who are in their own struggles with imposter syndrome; however, the tactics and self-trickery that have helped me don't always speak to them and perhaps someone else's methods might.


I found out today that the term for pet names used in an affectionate or an endearing way is hypocorism, I searched online but I couldn't find a term for nicknames used in a derisive sense, such as a term for a teacher that pupils hate. In a sense it would be an antonym for hypocorism, maybe I'm overlooking something obvious.  Looking at the etymology, hypocorism comes the Greek verb for speaking in a childish manner, which itself is a compound of 'underneath' and 'to caress'. It doesn't appear to provide an easy antonym.

Is there a single word or very short phrase to describe the act of contemptuously referring to someone by using a diminutive "nickname", with which that person is not normally associated?  For example, referring to Henry Wadsworth Longfellow as Hank Longfellow? Or William Penn as Billy Penn?


Just doing this for revision, seems much harder than it should be, should I use $x=\tan u$ ? Any help appreciated.

Can anyone give me a hint to evaluate this integral?  $$\int_0^\infty \frac{dx}{1+x^4}$$  I know it will involve the gamma function, but how?


According to maxwell’s equations, a magnetic field is caused by a changing electric field, but where is this changing electric field in the context of a current carrying conductor that has an induced magnetic field around it?   And if there isn’t a changing electric field, what causes the magnetic field to appear?

I'm tutoring high school students. I've always taught them that:     A charged particle moving without acceleration produces an electric as well as a magnetic field.   It produces an electric field because it's a charge particle. But when it is at rest, it doesn't produce a magnetic field. All of a sudden when it starts moving, it starts producing a magnetic field. Why? What happens to it when it starts moving? What makes it produce a magnetic field when it starts moving?


Does someone know how to prove ***EDIT by induction**** that for all integers $n\ge1$, $k\gt0$  $$\sum\limits_{i=1}^{n} {i^{2k+1}}\equiv 0\  \ \  \pmod{\frac{n(n+1)}{2}}$$  I thought this should be a quick outcome from known polynomial expressions for sums of powers, or easy by induction. But I have not been able to write down such a proof.  Thanks for help..  I make the above EDIT to 'deduplicate' (somehow) the question.    This is where I am:   Let $P_{m+1}$ be the $m+1$ degree polynomial such that $P_{m+1}(n) =\sum\limits_{i=1}^{n} {i^{m}}$  From  $$(n+\frac{1}{2})^{m+1}-(\frac{1}{2})^{m+1}=\sum\limits_{i=1}^{n}((i+\frac{1}{2})^{m+1}-(i-\frac{1}{2})^{m+1})$$ after expansion of the binomes on the RHS and rearrangement: $$(n+\frac{1}{2})^{m+1}-(\frac{1}{2})^{m+1}=\sum\limits_{j=0}^{m+1}\frac{\binom{m+1}{j}}{2^{j}}(1-(-1)^j)P_{m+2-j}(n)$$ I obtain a recurrence relationship for the $P_{2k}$ of even degrees $$2^{2k+2}(2k+2)P_{2k+2}(n)=(2n+1)^{2k+2}-1-\sum\limits_{j=1}^{k}2^{2j}\binom{2k+2}{2j-1}P_{2j}(n)$$ that is  $$2^{2k}(k+1)P_{2k+2}(n)=\binom{n+1}{2}\sum\limits_{j=0}^{k}(2n+1)^{2j}-\sum\limits_{j=1}^{k}2^{2j-3}\binom{2k+2}{2j-1}P_{2j}(n)$$ Now if I suppose that, for all $1\le j \le k$, for all $n$, all the $P_{2j}(n)\equiv 0\  \  \pmod{\frac{n(n+1)}{2}}$ , which is true for $j=1$, and since all the $2^{2j-3}\binom{2k+2}{2j-1}$ are integers even when $j=1$,  then I have $$2^{2k}(k+1)P_{2k+2}(n)\equiv 0 \pmod{\frac{n(n+1)}{2}}$$ which is almost (but not quite :-() enough to complete the proof by induction

For any odd positive integer $k\geq1$, the sum $1^k+2^k + \dots + n^k$ is divisible by $n(n+1)\over 2$.   I used induction principle for the solution but cannot prove it.  I took $P(k) = 1^k+2^k+\dots+n^k$.  For $P(1)$ it is true.  For $P(n)$ let it be true.  But for $P(n+1)$ I cannot solve it.


I have a container that effectively, I want to compress the contents to their minimum width without scroll bars. fit-content is close, but allows the content to use more width than it actually needs. I could also explicitly set the container's width, but that requires me to know the min-width of the contents ahead of time.  So in the example below, the box width should default to compressing the inner item to 3 lines. How can the box reclaim this bit of space?    .box {   background-color: green;   resize: both;   overflow: auto;   padding: 1em;   min-width: 2em;   width: fit-content;   height: 10em; }  .el {   background-color: teal;   width: 100%;   min-width: 5em; }

     Lorem isa psalm ipsom

I have a layout similar to:  <div>     <table>     </table> </div>   I would like for the div to only expand to as wide as my table becomes.


So the question I was trying to solve is   "Print the first 4 letters of name on new line [name = 'Hiroto']"  I got a solution, but I was wondering if there was a way to do the same problem using index values to make it work with any name I used.   name = "Hiroto"  new_name = " "  for letter in name:     if letter != "t":         new_name = new_name + letter     if letter == "t":         print(new_name)

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


I'm an undergraduate in their penultimate year in the US, although for financial reasons I am thinking of graduating next month instead of next year. For a long time, I've wanted to go into academia: I just found the idea of doing research and maybe teaching appealing. However:   My GPA is completely wrecked: it's below a 3.0. I was fairly depressed for a few terms, and I probably had a mismatch with my major, which was made all the worse by poor focus and me not realizing it until recently. Most of my coursework has been for things related to my major. Thanks to a strong liberal arts education, I've taken a good selection of other courses, in which I've gotten significantly better grades more consistently, but that's only around 25% of all my courses. (Think generally around the 3.3 range, at a school and presumably departments not known for grade inflation.) I want to go to grad school for something related to this stuff, but I feel like my preparation would be extremely lacking, particularly with my graduation plans. (Too few contacts, not enough experience, etc.) I'm going to a top 10 or so school supposedly not known for grade inflation in the departments I'm interested in, but I have no idea if this helps.   How can I salvage my dreams of going into academia? At one point, I would have just considered it over and gone into industry, but now, with my current interests, I think it's still worth a shot. But I've had friends tell me I have no chance of getting anywhere decent with my grades, and well, even if they're not the best advisors, the issue of lack of experience and potential references is something.

I have a master's degree in International Studies, and a double major with Computer Science from undergrad.  My transcripts suck.  There's no other way to dress it up.  I have pretty good teaching experience, and my GRE scores are awesome, and I suspect my recommendations are as bland as everyone else's.  Basically, to an admissions committee, I suspect I'm the model of a student who is probably smart enough but didn't work hard enough.  I want to do a Ph.D. in Political Science, but the response from my applications is looking pretty grim.  Am I permanently out of the running, or is there something I can do for the next few years which will help to counterbalance my unfavorable GPA?


I am wondering if there exists any one-to-one analytic function mapping annulus to punctuated disk? i.e. if we let $D_1=\{1/2<|z|<1\}, D_2=\{0<|z|<1\}$, is there a one-to-one analytic function $f$ maps $D_1$ to $D_2$?

Suppose $A=\{z\in \mathbb{C}: 0<|z|<1\}$ and $B=\{z\in \mathbb{C}: 2<|z|<3\}$.   Show that there is no one -to-one analytic function from A to B. Any hints? Thanks!


My rowId is like the below, it will follow parent and child relationships  1 1.1 1.1.1 2 2.1 . . . 9 9.1 . 9.9 10 10.1   I am using the following code to sort that beans using rowid's  List<MyBean> sortedList = rootItems.stream().sorted(Comparator.comparing(MyBean::getRowId)) .collect(Collectors.toList());   if I sort like the above then it is sorting like the below  10 11 12 . . 19 2 2.1 . . 3 . .   it should not be like this.  I want to sort like the example of rowid's I have given on top.  Someone suggested me to follow his code.. i.e..,   private static final Pattern SINGLE_DIGIT = Pattern.compile("\\b(\\d)\\b"); static String padWithZeroes(String InputString, int digits) {     final Matcher matcher = SINGLE_DIGIT.matcher(InputString);     StringBuffer sb = new StringBuffer();     while(matcher.find()){          matcher.appendReplacement(sb, pad(digits - matcher.group().length())+matcher.group());     }     matcher.appendTail(sb);     return sb.toString(); }  static String pad(int length) {     final char[] chars = new char[length];     Arrays.fill(chars, '0');     return new String(chars); }   If I follow his code it is returning me a string but not the list of objects.. How can I use that code.. Please help me.

Is there a standard idiom for comparing version numbers?  I can't just use a straight String compareTo because I don't know yet what the maximum number of point releases there will be.  I need to compare the versions and have the following hold true:  1.0 < 1.1 1.0.1 < 1.1 1.9 < 1.10


I would like to convert a UTC time to to the following format (IS0 8601). Eg.  2000-01-01T17:00:00-05:00   Currently I'm using UtcNow.Convert.ToString("s"), which gives me the datetime in the format   2015-12-05T08:49:14   but this skips the time part after the "-" symbol.   Can anybody help on this ?

Given:  DateTime.UtcNow   How do I get a string which represents the same value in an -compliant format?  Note that ISO 8601 defines a number of similar formats. The specific format I am looking for is:  yyyy-MM-ddTHH:mm:ssZ


When downloading the iso it downloads normally for awhile displaying that i have a few hours to wait and then randomly jumps to complete. Upon attempting to burn the iso to USB to install the pendrive program claims numerous file errors and then completes the format of my usb. when i attempt to boot from the usb during post it either comes up with nothing and forces me to reboot my laptop or comes up that i'm missing files and that the boot cannot continue. can anyone help me with this issue?

I've just downloaded a CD image of Ubuntu. I know the installer has a check CD option, but how can I check that the image is good before burning it to CD?


I'm trying to write a WCF function that gives me back the URI of an image in the App_Data folder so I can display it in a silverlight application.  How do I get the location of the App_Data folder so that I can search inside it to find the Image I want to display?

How to access App_Data folder in WCF service?  I have placed a xslt file and I am not able to find the path.


I am in a quite a chicken and egg situation with my Gmail account:   I forgot my password so I can't access from desktop. I am logged in on my iPhone Gmail app. The phone number is not related to the account so can not be used as a recovery method.   I think Google is detecting I am logged in the phone so any attempt to recover the password is not working. I can automatically log in with Safari in the phone, but from there, if I want to change the password it will ask me for the previous one.  Can I use the logged in phone access in any good way to change my Gmail password?

I have forgotten the password or username for my Google account, or I'm unable to access my account for other reasons.  How can I recover my account?  (This Q&A is meant as a general description for all Google and Gmail username/password questions. See: )


I am on Kubuntu 17.04. And I wonder - how can I check whether I am on the latest kernel?  I type this in my terminal:  $ uname -r 4.10.0-21-generic   So is it the latest kernel? If not, how can I update it to the latest one?

How can I check the version of the available package in the Ubuntu repositories without installing it?


How can I create a progress bar with bash?  This is my script :  #!/bin/bash  pass='number1 number12 number13 number14 number15 number16'  chk='number14'  for i in $pass ; do    if [ "$i" == "$chk" ]; then      echo ' Found ^_^'    else      echo 'loading 50%'    fi  done   I want to replace echo 'loading 50%' with anything to create an progress bar.

I think it's something like  this: (Fedora14/bash)  #!/bin/bash  for i in {0..10..1}; do echo -e "$i"'\c' echo -e "\n\r" sleep 1 done   But it doesn't work. Purpose: like this, but without the "clear":   #!/bin/bash  for i in {0..10..1}; do echo -e "$i" sleep 1 clear done   So a counting script that doesn't deletes the whole screen to output +1 number, instead it only deletes the line, where the counting is, so that there could be ex.: a beatifull "progress bar"..


I'm running 12.04 64 bit on my laptop and I have a virtual machine (win7) created and using with virtual box (4.3.6 incl. extension pack).   Further I have an Kyocera FS-1041 printer which I cannot use with linux cause of incompatibility with GDI.  Is there a way to tunnel the printer to my virtual machine and printing there? I already tried some filters for usb in virtual box but I failed.  Any ideas how to solve this problem using a virtual machine?

I'm using Ubuntu Maverick and Virtual Box 3+. I have Windows 7 Ultimate. The problem is that it doesn't detect USB drives in Windows 7, but USB peripherals (mouse + keybord) are working.  I followed , but I can't find the user group vboxusers. How can I continue? I would also like to upgrade to the latest version without any risk (without losing my virtual hard disk drive).


Hello I have generated XML content as string. But I have to convert string to XML data type.  String str = "<?xml version="1.0" encoding="utf-8"?><Message><Rc1>12343322</Rc1><Rc2>125145552</Rc2><Rc3>54682242</Rc3><Rc4>7777332287</Rc4></Message>"   How can I convert this string to xmldoc type?

I have a complete XML document in a string and would like a Document object. Google turns up all sorts of garbage. What is the simplest solution? (In Java 1.5)  Solution Thanks to , I have settled on this implementation. It has the right level of input flexibility and exception granularity for me. (It's good to know if the error came from malformed XML - SAXException - or just bad IO - IOException.)  public static org.w3c.dom.Document loadXMLFrom(String xml)     throws org.xml.sax.SAXException, java.io.IOException {     return loadXMLFrom(new java.io.ByteArrayInputStream(xml.getBytes())); }  public static org.w3c.dom.Document loadXMLFrom(java.io.InputStream is)      throws org.xml.sax.SAXException, java.io.IOException {     javax.xml.parsers.DocumentBuilderFactory factory =         javax.xml.parsers.DocumentBuilderFactory.newInstance();     factory.setNamespaceAware(true);     javax.xml.parsers.DocumentBuilder builder = null;     try {         builder = factory.newDocumentBuilder();     }     catch (javax.xml.parsers.ParserConfigurationException ex) {     }       org.w3c.dom.Document doc = builder.parse(is);     is.close();     return doc; }


I have a 2007 Macbook Pro that is running 10.6.8. I'm actually using it now to ask this question. I also have an iMac running 10.13.6  I can't use my laptop because of its age and because I cannot update it any more, browsers won't work properly etc.  I was advised to try Ubuntu.  As it stands now, I've got the .iso file and I've also converted it to a .dmg file by following the instructions from the Ubuntu site, however, I'm not very technical. I can follow instructions but when it comes to terminology, I don't know a thing!  I also burned a dvd from the iso file from my imac using Etcher. Reason is my computer will not recognise a USB stick to be bootable with. I've tried the terminal commands but they didn't work.  I inserted the dvd in the drive. It didn't mount on the desktop but also didn't give me any errors.  I restarted the computer and held down the Alt/Opt key.  I got the two choices and chose the CD however the CD said "Windows". Screen went black and was then prompted with....    1   2   Select CD Rom Booty Type:_     Keyboard wouldn't let me type anything After googling this, I was even more confused.    Had trouble trying to restart/shutdown computer so only way was to unplug it (battery is useless).    I tried again but this time alt/opt didn't give me the DVD to choose from - the dvd actually spit out at that point. So I booted to my macOS. Re-inserted the DVD but then got an error saying that the cd was unreadable: eject or ignore.    My mac specs are as follows:  Hardware Overview:    Model Name:   MacBook Pro     Model Identifier: MacBookPro1,1     Processor Name:   Intel Core Duo     Processor Speed:  2 GHz     Number Of Processors: 1     Total Number Of Cores:    2     L2 Cache: 2 MB     Memory:   2 GB     Bus Speed:    667 MHz     Boot ROM Version: MBP11.0055.B08     SMC Version (system): 1.2f10     Serial Number (system):   W86180XAVJ3     Hardware UUID:    00000000-0000-1000-8000-0016CB95FE84     Sudden Motion Sensor:     State:    Enabled    This computer works great! It starts up beautifully, all the keys work. The CD drive is actually new (just installed a new one, the old one failed). I can't give this system up! I just can't use it because of outdated programs.

I have a device on which I would like to install Ubuntu. How do I find out if Ubuntu will work on it?


I added a Subdivision Surface modifier, Creased some edges to 1.00 and some white spots appeared. I've never seen that before. Is something wrong with the UV shading?

first time here.  Alrighty, I'm quite new to 3D model design in Blender, but I have a little problem with my book model. The mesh is fine (I think). But there are a good few points where the text mesh goes wrong for some weird reason. If you need to know which version of Blender I'm using, it's Blender 2.69.  When I apply the "subdivision surface" modifier and set the subdivision render to 2, the faces go in and deform in certain areas. As far I'm not sure what is wrong at this point. I've taken two pictures just in case you need them.       Take note that I'm still unaware of some certain tools and common knowledge in Blender, go easy on the in depth reasons and fix details. Just simplify it please :)   Blend file :


In the dictionary  : to become joined in marriage They're planning to get married in October.     (adj): having a husband or wife   So, this is what I think we often say "I'm married" which means "I have a husband or wife", we don't say "I get married". We say "I was married" which means "I had a husband or wife in the past but I may or may not have a husband now" We say "I got married" which is nearly the same as "I had a wedding"   (=to have a wedding) Did you know that they are going to get married?

I am not sure how to explain these phrases to a nonspeaker of English. Have all these examples the same form?  Get (v) married (v past participle)   or it is Get(v) married (adj)  ? Get (v) engaged (v past participle)                   engaged (adj)  ?   Get (v) divorced (v past participle)                  divorced (adj) ? Get (v) promoted (v past participle)                  promoted (adj) ?   Could somebody help me?


I'm trying to install a dual boot Windows 10/Ubuntu 18.04 on my XPS 7390 Developer Edition. Initially Ubuntu 18.04 was installed by Dell. Wifi worked flawlessly on this version.  Today I installed Windows and then a dual boot with the standard Ubuntu 18.04 distribution. This worked, but the Wifi-Card was not being identified in this Ubuntu version.  Now I used the Dell Recovery ISO to get back to the inital state. Wifi is working again. But I still want the dual boot. Is there any way to get the drivers that Dell put in their custom Ubuntu? While they offer windows drivers for the Killer Wifi Card on their website I can't seem to find any ubuntu drivers.   As requested by @Pilot6:  ~$ lspci -knn | grep Net -A3; rfkill list 02:00.0 Network controller [0280]: Intel Corporation Device [8086:2723] (rev 1a)     Subsystem: Bigfoot Networks, Inc. Device [1a56:1653]     Kernel driver in use: iwlwifi     Kernel modules: iwlwifi 03:00.0 PCI bridge [0604]: Intel Corporation JHL6540 Thunderbolt 3 Bridge (C step) [Alpine Ridge 4C 2016] [8086:15d3] (rev 02) 0: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no

Please note that this question is specific to Intel WiFi adapters.  My laptop is an HP ENVY with an Intel AX201 Wifi Adapter. I've dualbooted Ubuntu with Windows.  AX201 WiFi adapter is not supported by latest Ubuntu 18.04 version, because Ubuntu 18.04 comes with Linux Kernel 5.0, whereas support for AX201 comes built-in in Linux Kernel 5.2+. Canonical claims that Ubuntu 18.04 will get Linux Kernel 5.3 sometime next year. However, I wont be able to wait that long.  I tried downloading and installing Kernel 5.2.14, but I cant go beyond Grub: I get the error:     error: you need to load the kernel first.   Other option is to download the Intel Backport Driver, which I tried. That didn't seem to work either. As per the tutorials, I've restarted frequently, but that didnt work either.  Also I'm not quite sure if Intel IWLWIFI Backport driver supports AX201 in the first place.  WiFi works while I'm booted in Windows.  What should I do?  Thanks in advance!  UPDATE  I tried out @Pilot6's answer, and it worked. Thanks!  I have one last question: I've read that if you upgrade the Kernel beyond what Ubuntu 18.4 supports, its kinda unsafe (which I read as prone to system crashes).  I dont want system crashes because I have only one partition (root) for Ubuntu, and any crash would likely mean all my data is lost. One method forward would be to split my Ubuntu partition into root and home.  So if I want to access WiFi on my device safely without risking any crashes, what should I do?  My understanding of Ubuntu and Linux may be wrong as they are built on forum answers only. Please correct me if Im wrong anywhere.


I'm trying to use biblatex-dw and the crossref functionality to make my bibliography more structured and easier to edit. I'm using the mvcollection, collection, and incollection types for the inheritance/tree structure. My problem is that when I define things as in the MWE below, the footnote comes out wrong.   What I want to achieve -- but only for the archival document types -- is to organize the data into a hierarchy, starting with the most detailed (i.e. the specific document) and ending with the leaste detailed (i.e. the archive institution where the archive is situated):   document - volume - archive - archive institution  Therefore, the date would look strange at the end of the line as it refers to the document and not the archive institution. I think it looks much better if the data is clustered. But for normal references like books and articles, I agree the default biblatex ordering is great.   See image example below.  Update: I also tried this with biblatex-chicago and the same thing happens there.  \documentclass{article} \usepackage[backend=biber,citestyle=verbose-ibid,style=footnote-dw,autocite=footnote,idembibformat=dash,idemtracker=false,pageref=true,xref=true, date=iso8601]{biblatex}  \begin{filecontents*}{refs.bib} @mvcollection{MA,     title = {Museum archives}, }  @collection{ClockExhib,     crossref = {MA},     title = { Clocks Project}, }  @incollection{foo,     crossref = {ClockExhib},     author = {Committee},     title = {Meeting notes},     volume = 1,     date = {1979-11-19}, }  \end{filecontents*} \bibliography{refs}  \begin{document}  This is a document.\autocites{foo}  \end{document}   I want to change the order of the details (and as a bonus also learn how to change the field separators...commas, dots, or whatever).   Any ideas would be much appreciated.  By the way, I really want to stick to biblatex-dw.  Actual output of footer:   Desired output:

Suppose I've just made the switch to . I have chosen one of the built-in styles (numeric, alphabetic, authoryear, authortitle, verbose) or of the custom styles available at CTAN, and I've figured out how to sort/compress citations. The bibliography and the in-text-citations look approximately like I want, but need to be tweaked. I've taken a look at the biblatex documentation for advice, but it is somewhat daunting. How do I get started? To add some focus, customization in the following areas would come in handy:   Suppressing of specific BibTeX fields (e.g., publisher); Formatting of fields for specific entry types (e.g., titles of articles not inside quotation marks); Formatting of citation postnotes (i.e., getting rid of "p."/"pp."); Spacing and punctuation in the bibliography (e.g., commas instead of periods as unit separators); Order of first names and last names of authors/editors in the bibliography; Order of certain fields in the bibliography (e.g., swapping location and publisher); Language-specific terms (e.g., replacing "References" with "Works Cited").   Finally, assuming that I'll want to use my style adjustments in a multitude of documents: Where do I put the relevant macro stuff?


I want to monitor a 12V lead-acid battery using an  ADC.  This ADC has a reference voltage of 2.048V. Thus, I (think) need to condition my input from, say a 10V-15V level range to 2 volts (0.4 gain) and then add a DC offset to bring it down to 0V-2V for my ADC.  Can anyone recommend a low current (<1mA), low component solution for me?  Many thanks.

I'm teaching myself EE while designing a 12V DC battery monitor. I'm using a pair of Hall-effect sensors to track charge & load current and looking for the best way to measure the voltage. [An ATmega32u4 will take successive reads with the ADC, compute a 1-second average, and pass that up over USB for logging and analysis.]  The issue of error with ADC really has me spooked. It is essential that I produce meaningful data. There's so many error sources—both in my circuit and in the ADC—that it feels like playing wack-a-mole in the dark. I'm reading lots about calibrating the ADC's reference, but the first step is to pick a method for scaling the input.  My voltage window is 10-15V, specifically a range from 10.5V to 14.4V (3.9V). I came up with two approaches that (hopefully) do what I want:   A 10V Zener diode on the inverting input of a differential op-amp. Rejecting 10V, my range becomes 0.5V to 4.4V (3.9V) and uses nearly the whole range of my ADC.  A 20k : 10k voltage divider. Scaled down 3x, my range becomes 3.5V to 4.8V (1.3V)   I wanted to prove to myself which method would render the best granularity. Since I can also obtain 12-bit accuracy by adding four reads and shifting the result, I compared four possibilities: (assuming ADC ref is 5.0V)   method 1, 0.5-4.4V @10-bit is 800 steps: 4.88mV/step [#3] method 1, 0.5-4.4V @12-bit is 3606 steps: 1.22mV/step [#1] method 2, 3.5-4.8V @10-bit is 266 steps: 14.65mV/step [#4] method 2, 3.5-4.8V @12-bit is 1065 steps: 3.66mV/step [#2]   My question is, do my mV/step figures tell the whole story, or is there some kind of downside to #2 that I'm not seeing?


I want to test some simple code for pep8 compliance using pytest pep8 in Ubuntu 18.04. The command I use in the terminal is  my_name@my_name's-laptop:~/my_folder$ py.test --pep8 simple_flask.py  But it gets stuck at 'collecting 1 item'. But if I press ctrl-c, it executes. I wonder what is wrong. My simple_flask.py code is     from flask import Flask  app = Flask(__name__)   @app.route('/') def hello() -> str:     return 'Hi there from Flask!'  app.run()   Any suggestions on how to solve this?

Given the following code, what does the if __name__ == "__main__": do?  # Threading example import time, thread  def myfunction(string, sleeptime, lock, *args):     while True:         lock.acquire()         time.sleep(sleeptime)         lock.release()         time.sleep(sleeptime)  if __name__ == "__main__":     lock = thread.allocate_lock()     thread.start_new_thread(myfunction, ("Thread #: 1", 2, lock))     thread.start_new_thread(myfunction, ("Thread #: 2", 2, lock))


How does the command "sudo apt-get install git" work on Ubuntu without downloading an executable GIT bash file on Ubuntu as that in Windows(where we download and install)?

What does the apt-get install ... command do?  When I enter apt-get install ... command, there are some texts appearing on the screen, but that does not have enough information for me. I want to know if any file is created / edited, any service is started and other activities...  Is there any .sh file executed when the apt-get install ... run? If so, how can I see the content of that sh file?  The reason for this question is recently I tried to install tomcat7 with apt-get install tomcat7. Everything works fine until I install tomcat7-admin (manager web application), the server became unresponsive to any request. I tried this many times, and this always happen.


In my complex class we are given this problem: Take a continuous function from the complex plane to the real line: $f(z): \mathbb{C} \rightarrow \mathbb{R}$. We also know that $|f(z)| \leq 1$. Show that $$\bigr| \int_C f(z) dz\bigl| \leq 4$$ Where $C$ is the unit circle.  The way I started this was by saying: $$\bigr| \int_C f(z) dz\bigl| \leq \int_C |f(z)| dz \leq \int_C dz = \int_{0}^{2 \pi}ie^{i \theta} d{\theta} = 0$$This to me does not seem right, given what I am doing here is actually assuming the function is analytic, which was never given in the problem!  So now I am trying this: $$sup_{f}\bigr| \int_C f(z) dz\bigl| = sup_{f}\bigr| i\int_{0}^{2\pi} f(e^{i\theta}) e^{i\theta} dz\bigl|$$ While keeping in mind that $|f(z)| \leq 1$ and $f(z): \mathbb{C} \rightarrow \mathbb{R}$  I am however not too sure of how to attack this problem in a smart way, by not just plugging in functions and see what happens.   Thank you for your insight!

I've encountered the following problem in complex analysis:  Prove that if $f$ is a real continuous function such that $|f|\le 1$ then $|\int_{|z|=1} f(z)dz| \le 4$.  I've decomposed $f$ to it's real and imaginary parts and got that it's enough to prove that:  $(\int_0^{2\pi}cos(\theta)g(\theta)d\theta)^2 +(\int_0^{2\pi}sin(\theta)g(\theta)d\theta)^2 \le 16$   Where $g(\theta)=f(e^{i\theta})$.   But now I'm stuck. Any ideas?  Thanks


Google has material design guidelines for its multi-step forms: .  Are there similar guidelines for iOS? If not, are there some de facto standards apps adhere to?  I'm especially curious about the behavior of the back button and if it should be there at all (on Android, this button acts as an "up" button and it wouldn't make sense in a multi-step form, because all the steps are on one level in the screen hierarchy), what the best placement for the stepper is, and whether it should be fixed or scroll with the page.

I need to design a form that may consist of 3 or 4 steps, all of them requesting both mandatory and optional data. The overall form contains a lot of data inputs, so I thought it would be better to split the form into pages or steps, to avoid having a too long vertical scrolling.  I can't find any practical example of such a long form in an existing iOS app, since most of them just request few data to create an account, but my app requires collecting more user input.   Would it be a good approach to build a view for each form step, and push them all in a navigation controller?   The idea is to have the back button in the navigation bar to allow going to the previous step, and a "next" button to go forward, I don't know if placing it in the navigation bar as well, or at the bottom edge of the current view. Or maybe could I use a stepper with arrows similar to the Mail app? I couldn't find anything about it in iOS Human Interface Guidelines, only a stepper with +/- buttons. Or a segmented control, with a segment per step?  However, in iOS Human Interface Guidelines, in navigation bar section I've read that it is intended for "navigation through an information hierarchy" (). I don't know how strict is Apple when applying the guidelines in the document when submitting to the App Store, and if using this approach for peer views, as in this case, would be rejected. Another option I thought, it was using instead a page control and a scroll view... but here comes into play input validation. I suppose that for a long multistep form it should be better to validate each step's inputs before allowing continue, shouldn't it? I find easier to handle this in the first approach (navigation controller and bar), simply enabling the "next" button when the inputs correctly fulfilled, than in the page control approach (where I actually don't know if it is possible to momentarily disable forward page scrolling).


I have a few year old Canon 35mm F/2 lens (). I've been shooting wide-open, but I realize that doesn't make for the sharpest photos. What would you say would get me the sharpest photos without bringing the f-stop down too low?

I've tried googling this, but have never found a satisfactory answer.  I've heard the term "sweet spot" thrown around by some photographers to mean the f-stop of a lens which results in the highest sharpness that lens can achieve.  A few questions on this:   General photographic knowledge states that the higher the f-stop (the smaller the aperture), the largest depth of field you will achieve. This seems to "suggest" the higher the f-stop, the sharper your image will be (all other factor being equal of course). Does the idea of a "sweet spot" trump this rule? (so, theoretically a f11 could be sharper than f22) Is the "sweet spot" an optical algorithm that can be applied to any lens, or is it to do with the particularities of the manufacturing of some lens? Finally, how can I determine the "sweet spot" of my prime lenses?   Note: I know other things come into consideration in sharpness, like ISO, light, glass (lens) etc etc, but please ignore these and assume these are equal for every different lens.  For context, I'm mainly trying to achieve ultimate sharpness in architectural (indoor and outdoor) photography, and urbanscape, where usually I tend to shy away from small depth of field.


I have a Samsung Note 3 and I accidentally deleted an entire photo album from my phones gallery. I didn't enable my device to sync with Gmail. I didn't manually backup any of the data. The images were saved on my phone, not on the SD card. Is there any way for me to recover this deleted photo album? I Google'd and came across SDrescan but that won't work since the images were not initially saved on my SD card.

I just deleted a file on my Nexus S that I really need back. (It was actually part of an app using a sqlite database that did a drop table when upgrading to a new version.)  Presumably I need to root the phone first (which I hear is easy on Nexus phones) but am I in a catch-22 here? Namely, does rooting the phone mean wiping/overwriting the partition where the data lives?  If not, what do you recommend for data recovery tools? Presumably the file was just unlinked and not actively overwritten (per usual when "deleting" a file) so technically the data must be there...


I have a list of entries generated by PHP, each in their own div and each with a unique ID. I'm trying to develop an AJAX call that can remove each entry based on their ID, however whenever I run the script below, it always returns 0.  <div>     Some entry here     <button id="0" class="remove">Remove</button> </div> <div>     Another entry here     <button id="1" class="remove">Remove</button> </div> // ... and so on  <script>     $(".remove").click(function() {         var id = $(".remove").attr('id');         alert(id); // debug         // AJAX call here     }); </script>   Previously I tried the same thing except the other way around - the id returned by PHP was in the class attribute and the id attribute had the value 'remove' and this only returned 0 for the first button. The second button didn't invoke the jQuery script at all.  How can I pass a unique ID to the same jQuery call?

Is there any way to get the ID of the element that fires an event?  I'm thinking something like:    $(document).ready(function() {   $("a").click(function() {     var test = caller.id;     alert(test.val());   }); }); <script type="text/javascript" src="starterkit/jquery.js"></script>  <form class="item" id="aaa">   <input class="title"></input> </form> <form class="item" id="bbb">   <input class="title"></input> </form>     Except of course that the var test should contain the id "aaa", if the event is fired from the first form, and "bbb", if the event is fired from the second form.


I am trying to get the keyboard backlight working on Lenovo Legion Y720. I've tried some of the instructions that are out there so far nothing. Also upgraded the kernel to 4.15.9-041509-generic without success. It would be OK to get at least one color working. Running Xubuntu 17.10 Lenovo Legion Y720 At boot, the keyboard lights lid up for few seconds and then disappears. All hints are welcome.

I just moved from Windows to Ubuntu, but I cannot get the keyboard backlight to work at all. On Windows there was a specific program for controlling the backlight. I have searched for days now without luck. Anyone got a solution?  I am using Ubuntu 18.04


I am relatively new to python, but I am trying to create an automated process where my code will listen for new file entries in a directory. For example, someone can manually copy a zip file into a particular folder, and I want my code to recognize the file once it has completely been copied into the folder. The code can then do some manipulations, but that is irrelevant. I currently have my code just checking for a new file every 5 seconds, but this seems inefficient to me. Can someone suggest something that is more asynchronous?

I have a log file being written by another process which I want to watch for changes. Each time a change occurs I'd like to read the new data in to do some processing on it.  What's the best way to do this? I was hoping there'd be some sort of hook from the PyWin32 library. I've found the win32file.FindNextChangeNotification function but have no idea how to ask it to watch a specific file.  If anyone's done anything like this I'd be really grateful to hear how...  [Edit] I should have mentioned that I was after a solution that doesn't require polling.  [Edit] Curses! It seems this doesn't work over a mapped network drive. I'm guessing windows doesn't 'hear' any updates to the file the way it does on a local disk.


In the code below  var x = 1;  (function () {   console.log(x);   var x = 2; }());   Why is it that when console.log(x), x is undefined?

What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?


If I try to install pip3 my system tells me it's already installed:  $ sudo apt install python3-pip Reading package lists... Done Building dependency tree        Reading state information... Done python3-pip is already the newest version (9.0.1-2.3~ubuntu1). 0 to upgrade, 0 to newly install, 0 to remove and 6 not to upgrade.   However, when I try to use pip3:  $ pip3 --help   Command 'pip3' not found, but can be installed with:  sudo apt install python3-pip   If I try locate it I get the following:  $ locate pip3 /usr/share/man/man1/pip3.1.gz   Where is pip3 and how can I run it?

I am using Ubuntu 16.04, and was experiencing issues with my pip3. Specifically, when I attempted to uninstall a package via  sudo pip3 uninstall   I encountered   Traceback (most recent call last):   File "/usr/bin/pip3", line 9, in <module>     from pip import main ImportError: cannot import name 'main'   I attempted to resolve this issue by reinstalling pip3, specifically   sudo python3 -m pip uninstall pip && sudo apt install python3-pip --reinstall   which succeeded. However, I no longer have a local version of pip3 at all  bash: /home/kurt/.local/bin/pip3: No such file or directory   Using which pip3 in a new terminal I find,  $ which pip3 /usr/bin/pip3   and attempting to use pip3 at all brings me  $ pip3 Traceback (most recent call last): File "/usr/lib/python3/dist-packages/pip/_vendor/__init__.py", line 33, in vendored     __import__(vendored_name, globals(), locals(), level=0) ImportError: No module named 'pip._vendor.pkg_resources'  During handling of the above exception, another exception occurred:  Traceback (most recent call last): File "/usr/bin/pip3", line 9, in <module>     from pip import main File "/usr/lib/python3/dist-packages/pip/__init__.py", line 13, in <module>     from pip.exceptions import InstallationError, CommandError, PipError File "/usr/lib/python3/dist-packages/pip/exceptions.py", line 6, in <module>     from pip._vendor.six import iteritems File "/usr/lib/python3/dist-packages/pip/_vendor/__init__.py", line 75, in <module>     vendored("pkg_resources") File "/usr/lib/python3/dist-packages/pip/_vendor/__init__.py", line 36, in vendored     __import__(modulename, globals(), locals(), level=0) File "<frozen importlib._bootstrap>", line 969, in _find_and_load File "<frozen importlib._bootstrap>", line 958, in _find_and_load_unlocked File "<frozen importlib._bootstrap>", line 664, in _load_unlocked File "<frozen importlib._bootstrap>", line 634, in _load_backward_compatible File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2927, in <module> File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2913, in _call_aside File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2952, in _initialize_master_working_set File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 956, in subscribe File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2952, in <lambda> File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2515, in activate File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2097, in declare_namespace File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2047, in _handle_ns File "/usr/share/python-wheels/pkg_resources-0.0.0-py2.py3-none-any.whl/pkg_resources/__init__.py", line 2066, in _rebuild_mod_path AttributeError: '_NamespacePath' object has no attribute 'sort'   However, I am able to execute without incident when typing sudo -H pip3 -v. Reinstalling pip3 from apt, e.g.  sudo apt-get install python3-pip --reinstall   has no effect. If anyone has any insight, or has encountered a similar problem, I would greatly appreciate any input on how to approach this problem.


I know that $E[X^n]$ is found by $$\displaystyle\int_{0}^\infty{x^nf_x(x)dx}$$   I simplified this to $$\displaystyle\int_{0}^\infty{ \frac{x^{\frac{v}{2}-1+n}e^{\frac{-x}{2}}}{\displaystyle\int_{0}^\infty{{x^{\frac{v}{2}-1}e^{\frac{-x}{2}}}}dx} dx }$$  But I don't know how to proceed, since i shouldn't solve the denominator.

If $X \sim \text{Gamma}(\alpha,\beta)$, how would I go about finding $E\left(\frac 1{X^2}\right)$?


My girlfriend just got a Schengen visa from France.  Is there any consequences if we do not visit France and only visit other countries?  Was planning to visit France next weekend, but the weather looks terrible. Got a Switzerland planned for April.

In case, if I get a multiple-entry Schengen visa in one of the embassies in Ukraine, Kyiv - should my first trip be to the country which issued the visa?  Any there any requirements of this sort? Does this condition vary depending on embassy which issued the visa?  What are the possible consequences on not visiting that country first? Does it somehow depend on country where the embassy is (i.e. non-Schengen and not EU members)?


So I had a problem, sound was going through speakers and headphones - BOTH. Found a guide in this answer:   That I should put this code:  alias snd-card-0 snd-hda-intel options snd-hda-intel model=dell-m4-1 enable_msi=1   To the /etc/modprobe.d/alsa-base.conf file. I did it, and now NO SOUND AT ALL.  Both headphones and line in - does nothing  Sound settings tab shows up - Dummy output.    Any ideas?

The soundcard I want to use is detected and works (it only recently switched to dummy output and didn't allow me to go back). HDMI is no longer listed under Audio and Video - KDE Control Module; everything under audio module is set to dummy output and its the only 'soundcard' on the list now. I can view my previous sound cards in alsamixer, but changing the settings from there does nothing. How can I get my real soundcards to work again? I have already tried the following answers without success:  EDIT: name@name-desktop:~$ lspci -vvv | grep -A8 Audio 00:01.1 Audio device: Advanced Micro Devices, Inc. [AMD/ATI] Kaveri HDMI/DP Audio Controller         Subsystem: ASRock Incorporation Kaveri HDMI/DP Audio Controller         Control: I/O+ Mem+ BusMaster+ SpecCycle- MemWINV- VGASnoop- ParErr- Stepping- SERR- FastB2B- DisINTx+         Status: Cap+ 66MHz- UDF- FastB2B- ParErr- DEVSEL=fast >TAbort- <TAbort- <MAbort- >SERR- <PERR- INTx-         Latency: 0, Cache Line Size: 64 bytes         Interrupt: pin B routed to IRQ 43         Region 0: Memory at ff764000 (64-bit, non-prefetchable) [size=16K]         Capabilities: <access denied>         Kernel driver in use: snd_hda_intel         Kernel modules: snd_hda_intel -- 00:14.2 Audio device: Advanced Micro Devices, Inc. [AMD] FCH Azalia Controller (rev 01)         Subsystem: ASRock Incorporation FCH Azalia Controller         Control: I/O- Mem+ BusMaster+ SpecCycle- MemWINV- VGASnoop- ParErr- Stepping- SERR- FastB2B- DisINTx-         Status: Cap+ 66MHz- UDF- FastB2B- ParErr- DEVSEL=slow >TAbort- <TAbort- <MAbort- >SERR- <PERR- INTx-         Latency: 32, Cache Line Size: 64 bytes         Interrupt: pin A routed to IRQ 16         Region 0: Memory at ff760000 (64-bit, non-prefetchable) [size=16K]         Capabilities: <access denied>         Kernel driver in use: snd_hda_intel  Could this image possibly help?:  There is another soundcard but I'm unsure of what its for because it never outputs sound, but it does have a lot of settings: that sound card is labelled as "HD-Audio Generic".   So I went into Software & Updates under the Additional drivers tab and I see this:  It was on Do not use the device so I changed it and applied the settings but unfortunately the soundcard isn't back even after reboot.