I add Prolog code to my slides like this:  \documentclass{beamer}  \usepackage{listings} \usepackage{mdframed}  % No navigation symbols at the bottom of each slide \beamertemplatenavigationsymbolsempty  \definecolor{light-gray}{gray}{0.89}  \begin{document}  \defverbatim[colored]\lstMiaFood{ \begin{mdframed}[     frametitle=mia.pl,     frametitlerule=true,     frametitlebackgroundcolor=light-gray!30,     backgroundcolor=light-gray,     roundcorner=2pt,     leftmargin=1,     rightmargin=1,     innerleftmargin=1,     innertopmargin=1,     innerbottommargin=1,     outerlinewidth=2,     linecolor=gray   ]    \begin{lstlisting}[     language=Prolog,     basicstyle=\ttfamily,     keywordstyle=\color{blue}   ] likes(mia, Food) :- isItalian(Food).  likes(mia, Food) :- isAmerican(Food),                     isVegetarian(Food). isItalian(pizza). isItalian(lasagna). isItalian(spaghetti).  isAmerican(frenchFries). isAmerican(hamburger). isAmerican(macaroniAndCheese).  isVegetarian(frenchFries). isVegetarian(macaroniAndCheese).    \end{lstlisting} \end{mdframed} }  \frame{   \frametitle{Test code}   \lstMiaFood }  \end{document}   This works fine and produces slides like these:    I'd like to reuse the style of the listing and the frame which is why I tried to define a \newcommand:  \newcommand{\prologCode}[1]{   \defverbatim[colored]\lstMiaFood{     \begin{mdframed}[         frametitle=mia.pl,         frametitlerule=true,         frametitlebackgroundcolor=light-gray!30,         backgroundcolor=light-gray,         roundcorner=2pt,         leftmargin=1,         rightmargin=1,         innerleftmargin=1,         innertopmargin=1,         innerbottommargin=1,         outerlinewidth=2,         linecolor=gray       ]       \begin{lstlisting}[         language=Prolog,         basicstyle=\ttfamily,         keywordstyle=\color{blue}       ] {#1}       \end{lstlisting}     \end{mdframed}   } }   But this errors with:  (/usr/share/texmf-dist/tex/latex/listings/lstlang2.sty) Runaway argument? {  ! Paragraph ended before \\lstlisting@ was complete. <to be read again>                    \par  l.94 }   Is there a way around this error to reuse the listing and frame style?    Regarding this question being a duplicate  I'm aware of  but its two solutions both produce compilation errors with the MWE I provided above:  ! LaTeX3 Error: The verbatim command '\code' cannot be used inside an (LaTeX3)        argument.   is produced by  \ExplSyntaxOn \NewDocumentCommand{\code}{m +v}{   \exp_args:Nx \scantokens   {     \string\begin{lstlisting}[\unexpanded{language=#1,numbers=none,xleftmargin=0.35cm,framesep=0mm}]       #2     \string\end{lstlisting}   } } \ExplSyntaxOff  \begin{document} \frame{   \frametitle{Test code}     \code{C}{     int x = 200;     unsigned int y = 0;     } } \end{document}   and  Package Listings Warning: Text dropped after begin of listing on input line 110   results from  \lstnewenvironment{code}[1]{\lstset{language=#1,numbers=none,xleftmargin=0.35cm,framesep=0mm}}{}  \begin{document} \frame{   \frametitle{Test code}     \begin{code}{C}     int x = 200;     unsigned int y = 0;     \end{code} } \end{document}

I have been following  about using \NewDocuentCommand with lstlisting and the accepted answer is nice except it is too big and it doesn't quite work for me.   I came up with this example to test xparse:    \documentclass{article} \usepackage{xparse} \usepackage{listings}  \ExplSyntaxOn \NewDocumentCommand{\code}{m +v}{     \begin{lstlisting}[style=#1,numbers=none,xleftmargin=0.35cm,framesep=0mm]         #2     \end{lstlisting} } \ExplSyntaxOff  \begin{document}  \code{C}{ int x = 200; unsigned int y = 0; }  \end{document}   Like stated in the  I first used m as a normal parameter and then +v as a multiline verbatim parameter, but it fails. It looks like I am still missing something...


When following a moving subject carefully by panning the camera, I want to keep the subject steady in the frame and avoid any vertical movement while panning. The goal is to capture the object of the shot with a streaked background while camera is in motion panning and keep the moving subject is sharp.

How do you go about getting great panning shots of things like cars and bicycles so that the background is nice and blurred but the target is sharp as can be. I have tried on many occasion to do panning shots and I just can't get the setup right.  What lens setup, shutter speed would be a good place to start?


I am starting with ObjectiveC at the moment and wondering what this function definition means  - (UITableViewCell *)tableView:(UITableView *)tableView cellForRowAtIndexPath:(NSIndexPath *)indexPath {     ...     // access to tableView, is it a variable?      UITableViewCell *cell = [tableView dequeueReusableCellWithIdentifier:CellIdentifier forIndexPath:indexPath];     ...     return cell; }   I am wondering what is tableView and what does the part before the function name cellForRowAtIndexPath mean.  As i see from the example code, tableViewis a variable. But what does the (UITableViewCell *)tableView:(UITableView *)tableViewmean? I thought the return value is only before the function name?  Update 1 Maybe I should mention i am familiar with languages like c/c++, java, ...  Update 2 I am not interested in the meaning of the function or what its supposed to do, just the syntax and the definition of any function like that

Can someone explain this method declaration syntax for me?  In this function, the number of rows of a UIPickerView (slot machine UI on the iPhone) is being returned.  From my understanding, the Method is called 'pickerView', and returns an NSInteger.    It passes in a pointer to the UIPickerview called 'pickerView' ... first, why is the method called the same name as the parameter?    Next there is NSInteger parameter called component that tells us which component we are counting the rows for.  The logic to decide which is in the body of the method.    What is 'numberOfRowsInComponent? It seems to describe the value we are returning, but it is in the middle of the parameters.    - (NSInteger) pickerView:(UIPickerView *)pickerView   numberOfRowsInComponent:(NSInteger)component {     if (component == kStateComponent)         return [self.states count];      return[self.zips count]; }


I am creating a simple application, where there is a login page, on logging in a Dashboard (recycler view is there with card view along with onClick()).  DashboardAdapter          holder.itemView.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View v) {                 String selected = mdList.getName();                 dashboardView.onMemberDataLoaded(selected);                 //GeneralUtils.showAlertDialog(activity, activity.getString(R.string.card_view) + " " + mdList.getName());             }         });     }   Dashboard Fragment  public void onMemberDataLoaded(String memberList) {   GeneralUtils.showAlertDialog(getActivity(), getActivity().getString(R.string.clicked_on) + " " + memberList);     } }   onMemberDataLoaded comes from a interface DashboardView which is implemented in Fragment

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?


Question: In 2003-2006 the average height of an American aged 20-29 was reported to be 67.25. Many believe that college students are shorter than average. A random sample of students produced the following data:  n=140, mean = 65.39, s = 4.64  Type in the test statistic rounded to TWO decimal places    Solution Attempt: I attempted to tackle this problem by choosing its sampling distribution as 1 sample T-test. I'm given no probabilities, so I don't think it's a Z-test.    Would the setup for the formula for solving for a t-value then be: $$t = \frac{65.39 - 67.25}{\frac{4.64}{\sqrt{140}}} = -4.74$$ Taking this value then and putting into R-Studio as $p value = pt(-4.74, df = 139, lower.tail = FALSE) = .999999$    This means if I choose a 95% confidence interval ... I fail to reject right? Because .9999 >> ..05

Problem The average height of an American was reported to be 70. Many believe that college students are shorter than average. A random sample of students produced the following data:    $n=140$, $mean = 65.39$, $s = 4.64$    Find the test statistics  Steps Taken to Solve I decided that this type of problem was a 1 sample T-test. These are my steps to the Hypothesis Test.     Null Hypothesis = No difference, so $M = M_o = 0$ Alternative Hypothesis = $M < 50$     $t = \frac{50 - 0}{\frac{4.64}{\sqrt{140}}} = 166.7467$     Is this approach correct so far?


I would like to know if there is a way to force close a non-responding program when Task Manager is hidden by that program; I mean the program is covering whole desktop.  So is there a key sequence or something?  This happened to me few times when I used ALT+TAB on games.  I'm using a Windows 10 machine.

I've been using Windows forever, but one thing that has annoyed me is how hard it is to terminate misbehaving full-screen applications. In Linux, I can just switch over to terminal (Ctrl+Alt+F1) and use the terminal to forcefully close a misbehaving program. In Windows, this seems to be only possible using task manager. If a frozen window is set to stay-on-top and full-screen mode, Alt+Tab and Alt+F4 don't work and I can't even use the Task Manager. If I had important work in the background, say, and I'd forgotten to save it, I can't just restart the computer!  What do you do in this circumstance?


There is a huge debate on the internet on the value of $48\div2(9+3)$. I believe the answer $2$ as I believe it is part of the bracket operation in BEDMAS.  yields the same answer. I also believe that if $48\div2\times(9+3)$ was asked it would be $288$ which Mathway agrees with as well. However,  says it is $288$ either way. A friend of mine (who is better at math) told me that there is no such thing as 'implicit multiplication', only shorthand so that is in fact done after the division (going left to right, not necessarily because division occurs before multiplication. But he didn't explicitly give a reason) What is the answer and why?


Here is my simple code in c++..  int getSize(int *array){ int n = (sizeof(array)/sizeof(array[0])); return n;   }  int main(){     int array[4] ={1,2,3,4};     std::cout<< getSize(array)<<std::endl; // prints 2 (first 2 elements) }   I am a newbie in C++. I am not able to figure out the issue.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


I know there are many similar questions if not the same, but I cant get my head around it. I am wanting to get "mScore" which is a variable in my main activity to show on the end of a string which is in my results layout. This is to get their final score and show on my results page as "You Scored : mScore"  Here is some of my code   public int mScore = 0;   if (mButtonChoice1.getText() == mAnswer) {                 mScore = mScore + 1;                 updateScore(mScore);             }   private void updateScore(int point){     mScoreView.setText(""+mScore); }   Again apologies for possible duplicate but I did not understand the other answers and am hoping i will understand better when it's specific for my situation. Only started learning java a week or 2 ago so i'm a bit slow.

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


After seeing  article about what Middle-earth would look like from space, and reading one of the first comments, which indicates that there are hints that Middle-earth is flat, I'm left with what seems to be an obvious question:  Where is Middle-earth?  And is it flat?  Is Middle-earth supposed to be on Earth sometime before recorded history, or on islands or continents that were lost due to the motion of tectonic plates?  Is it supposed to be in a mis-shapen Europe during the historical period that would match the development in Middle-earth?  Or is it supposed to be on a different planet or location entirely?  And if so, what are the indications that it is flat?  (And is it flat or curved?)

I've heard many times that, in his final years, Tokien rejected the idea of a flat Arda, and embraced a new story in which the world was always round and the Sun and Moon existed from the beginning. However, the only texts I've found with this new version are an old Ainulindalë (which was substituted by later ones that returned to the flat-earth) and some texts in HoME: Morgoth's Ring (Myths Transformed). But all of these texts look very incomplete and/or abandoned. While, on the other hand, the Annals of Aman and Grey Annals of the same years tell the old story of the Sun and Moon coming after the Trees. Am I missing then something important? Is there some other text that proves that the round earth was the "true" version?


let A $\in \mathcal{M}_{4,3}(\mathbb{R})$ and B $\in \mathcal{M}_{3,4}(\mathbb{R})$ such as BA$ = \begin{pmatrix} 0&1&1 \\ 1&0&1 \\ 1&1&0 \end{pmatrix}$ show that AB is diagonalizable

If $X \in \mathbb{C}^{m \times n}$ and $Y \in \mathbb{C}^{n \times m}$ ($m \geq n$), how to prove the following?  $$\sigma (XY) = \sigma(YX) \cup \underbrace{\left \{ 0, ..., 0 \right \}}_{m-n}$$  Here, $\sigma$ denotes the set of eigenvalues/spectrum.


Let $G$ be a lie group and $\mathfrak{g}$ it's associated lie algebra.I can quite easily show that if there is a Lie group representation $\rho_{G}$ from $G$ into $L(G)$:  $$ \rho_{G}: G \rightarrow \mathfrak{g} \;  ; g \rightarrow Ad(g)  $$  Such that for any $X \in \mathfrak{g}$,  $Ad(g)X:=gXg^{-1}$  Then we have a corresponding lie algebra representation $\rho_{\mathfrak{g}}$:  $$ \rho_{\mathfrak{g}}: \mathfrak{g} \rightarrow End(\mathfrak{g}) \; ; X \rightarrow ad(X)$$  Such that $ ad(X)Y = [X,Y]$   But why is it true that the generators of this are the structure constants? (i.e the basis of the adjoint algebra is the structure constants?)    Since $ad$ is just a LA homomorphism, if $T_{\alpha}$ is a generator of $\mathfrak{g}$ then, $ad(T_{\alpha})$ must be a generator of $End(\mathfrak{g})$? But $ad(T_{\alpha}) = [T_{\alpha},-]$ Clearly I'm seriously confused about something here...  EDIT   I think my confusion has something to do with a lack of understanding of dual spaces.(?)   The point is, $ad(T_{\alpha}) = [T_{\alpha},-]$ is indeed the corresponding basis operator in the adjoint representation However that operator can be defined (in a certain basis) as a matrix - and the natural basis to define that matrix in is our original $\{T_{\rho}\}$. In which case:     $$ ad(T_{\alpha})_{\text{Basis of}\mathfrak{g}} = \begin{pmatrix} [T_{\alpha},T_{1}].... [T_{\alpha},T_{n}] \end{pmatrix} $$    So that the components of $ad(T_{\alpha})$ in this basis are indeed the structure constants - although technically, it is more correct to say that $ad(T_{\alpha})$ is the abstract generator?

Given the Lie algebra, what is the systematic way to construct the matrix representation of the generators of the desired dimension? I ask this question here because it is the physicists for whom representation of groups is more important than mathematicians.   Let us, for example, take $SU(2)$ for concreteness. Starting from the generic parametrization of a $3\times 3$ unitary matrix $U$ with $\det U=1$, and using the formula of generators $$J^i=-i\Big(\frac{\partial U}{\partial \theta_i}\Big)_{\{\theta_i=0\}}$$ one can find the $3\times 3$ matrix representation of the generators.  However, I'm looking for something else.    Given the Lie algebra $[J^i, J^j]=i\epsilon^{ijk}J^k$, is there a way that one can explicitly construct (not by guess or trial) the $3\times 3$ representations of $\{J^i\}$? Will the same procedure apply to solve other Lie algebras appearing in physics such as that of $SO(3,1)$ (or $SL(2,\mathbb{C})$)?


More specifically, how can I set in the preamble the default options for the figure environment to [htb]? I am trying to separate content from format as much as possible and want to avoid writing \begin{figure}[htb] every time I declare a figure.

In a document I'm writing, I'm using the familiar  option for my floating tables, and I  them. I'd like to avoid repeating that every time I'm creating a table. I assume it's easy to add something in my preamble that makes sure that these two options are used every time I begin a new table environment?  \documentclass{article} \begin{document} \begin{table}[hbt] \centering \begin{tabular}{*3{l}} 1 & 2 & 3\\ a & b & c\\ \end{tabular} \end{table} \end{document}


I'll be flying from Sweden to Germany, and back, so within the Schengen area. Only problem is that the only form of ID I have is an expired national identity card from Sweden. I am a Swedish citizen.  Will this be a problem? Will I not be allowed to pass through security or board the plane? Would getting a temporary passport help?

My current situation is that I have residence permit of Germany (as a stamp in passport) and I wish to apply for UK visa in next few days from Germany and won't have my passport anymore during the processing time.  Instead of waiting for the process, I wish to travel to Scandinavian countries immediately on holidays, later receive my passport from visa center after I return back to Germany.   I am wondering if photocopy of passport and residence permit suffice as identity proof to border control (if I face them)? What else are valid documents that I can show as valid identity proof to border control? What are the exact problems I will face if I face the border control, and they are not satisfied with my travel documents?


How to give Un-delete permission to a particular user having a profile in which many other users are also present?

I have a trigger that doesn't allow me to undelete a record from Recicle Bin in a certain case.   At the same time I also checks security in order to be sure that my user is allowed to Undelete a record, based on the isUndeletable feature of the object:    But the time I want to test it. How can I check the isUndeletable feature? Looking at Profiles and Permission Sets we are only allow to check the CRUD but nothing related to Undelete.  Thanks in advance,


Prove that $\{id, (12)(34), (13)(24), (14)(23)\}$ is a normal subgroup of $A_4$. I see that it's possible to prove this with the following theorem: $$N \trianglelefteq G \text{ if } N\leq G \text{ and } \forall n\in N, g\in G: g^{-1}ng \in N.$$  But is there an easier way to do this? This way isn't hard but it takes quite some time to work through.

I want to show that the Klein four-group is a normal subgroup of the alternating group $A_4$.   I am using the information in , that shows explicitly $A_4$, and Klein four-group as a subgroup.  I know that there is the direct way, by definition, but is there a way that does not require actually multiplying so many permutations ?


I want to extend a loan of $50,000.00 ,interest free, to a friend to start a business. Can he deposit this check into his account and not incur any tax difficulties? Are there any tax implications for me? What are the benefits of funding the firm in a different way?

In the discussion around  it was said that a loan must be at market rate, or it is not considered a loan.  Respecting the wisdom of the people who said that, I'm unclear about how this would work in the general case, since plenty of people do make interest free loans to family and friends, and the IRS would seem to be unlikely to be in the business of policing loan rates.   Ignoring the issue in the original question about later paying off the loan through a gift,  let's say I make an interest free loan to someone, with the genuine intention that they pay it back in full at some later date, and with no intention of cheating the tax system. It would seem to me that he has no income to declare (because only the loan has occurred) and I have no income from the transaction. What exactly do he and I have to declare on our tax forms? Some links to tax office docs would be nice.  EDIT: Since it's been pointed out that it's hard to distinguish between loans and gifts, let's imagine that both parties have made a written loan agreement.


I bought two smart phones for my father and sister in Europe. Will the customs officer in India (Chennai) give any trouble if I carry two new unopened smart phones with the box in my hand luggage? Also, i'm a student, does this give me any advantage over it?

I am planning to travel to India (COK airport, Kerala) from United States. I want to take my laptop as well as my tablet (iPad). Am I allowed to take both in my backpack with my documents related my work. I think I am allowed to take only one computer as per the rule. Will the customs consider my iPad as a computer?  What all I can take?   One of my friends took 2 laptops (1 work and 1 personal) and had trouble at the airport.  Also I am planning to take some wristwatches (7 of them, each avg price is 45 $). I read in a website that I can take stuff up to max 35000 INR. Is that true? In that case, how will I manage my stuff?


I'm unclear on what a wizard's “spells known” means. Namely, are they the spells they can prepare, or the spells in their spellbook?  This is probably really obvious, but I'm just not figuring it out. Thanks!

In 3.X wizards had spellbooks, while clerics had their entire spell list, but they both memorized/prepared spells every day from those lists, and had a certain number of slots for preparing spells in.  Now in 5e preparing spells and spell slots aren't the same thing. What's going on here? How does their spellcasting work now?


In pure QCD in the confinement phase what happens if I add to a system of baryons, which are quarks in the condensed phase, another quark? It doesn't have any quark or antiquark to form a baryon or a meson so how does confinement work in this case?

I simply know that a single free quark does not exist. What is the reason that we can not get a free quark?  If we can't get a free quark then what is single-top-quark?


Where can I ask questions on Architectural Engineering? I could not find any site related to it.  I even checked Area 51 if there is a proposal for this, but there isn't. Does the site exist anywhere?    Architecture is a common field. It should be there.

I would like to ask a question not about software architecture, but physical architecture, i.e., the design of buildings and other elements of the "built environment".  I was looking for a Stack Exchange site to ask what the meaning is of the huge stone symbols on the side of the new Scottish Parliament building.


I'm a third year undergraduate student planning to apply for graduate school in applied math. I have done REU in applied math and had one conference paper. I had decent grades in my undergraduate math courses: mainly A's and A+'s and only a few A-'s. However, I ended up with a C in my first graduate course(Real analysis), which is really discouraging to me. In fact, out of all 20 people in the class, including all the graduate students, only 2 ppl got A and the rest are split into B's and C's. I was originally planning to continue with the sequence (the B part of the course), work harder and get a B or above grade, but after the professor told me that he is going to have even higher standards this semester, that being said, only people who get nearly perfect scores deserve to pass the course, I'm not so sure now. Based on his new standards, only the two people who got A last semester can pass the course and the rest of us would have failed, which is totally insane. I wonder if I should continue with this course, study really hard and try to pass the course, and hopefully get a better grade, or simply drop the class and try some other grad classes? Also how bad does getting a C in a core graduate class hurts and how else can I make up for it? I'm going to apply for grad school next year so I'm short on time, any advice will be appreciated! I'm really desperate right now.

When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it.


I'm zeroing a drive with  dd if=/dev/zero of=/dev/sdd   on a USB 3.0 port and it appears that the disk is writing half of the time and reading half of the time.  17564 be/4 root       10.59 M/s   10.59 M/s  0.00 % 96.60 % dd if=/dev/zero of=/dev/sdd   The performance is slower than what I expect, only being ~10M/s write and it looks like the rest of the bandwidth is being taken up by reads. The disk is not mounted nor being used by any other program.  Is this expected with dd?

I am currently restoring a usb stick with a dd image, I have previously created. However is noticed very poor write speed around ~7 MB/s although the stick is usually much faster.  After looking around a little, I noticed that a lot of data is being read from the USB drive which explains the poor write performance. Nothing but dd is accessing the device at that time.  Edited atop line:  sdd: busy 101% | read 18020 | write 613 | MBr/s 7.04 | MBw/s 7.1   I noticed a similar behavior when writing directly to my md array using dd. However when writing to a mounted filesystem with dd, this does not happen.  So my question is why is read from the usb stick when writing directly to the block device and whether this can be prevented to improve write performance?


We know as a fact that, a lightsaber (during a fight) can be stopped by another lightsaber and also I remember two more Imperial weapons that were able to stop a lightsaber.   One that I know of is the  Z6 riot control baton, and the other one I saw it being used by the robot protectors of General Grievous and also I think it's the same weapon that Rey is using in SW VII.  Do we know of any other similar WEAPONS that can fight against a lightsaber?

The Storm Troopers are the main case here, they get killed easily by blasters and even the Ewok arrows go straight through their 'armour'.   The AT-ST and AT-AT use armour to repel blasters of different strengths so they don't pass through all materials. I understand though that the armour used on these is likely much heavier.   From the prequel trilogy we also have the , which have a shield when not moving. Does anyone other than these droids use this technology?   You may use any of the Scrapped EU, Current EU and the normal U to answer.


For a long time now, "my" bank (Nordea, in Sweden) has announced that it's removing what they used to call "simplified login". This "simplified login" actually meant "the ability to log in without being harassed with hardware dongles and crippled nonsense". While it existed, it allowed me to automate logging in to fetch the current balance as well as seeing if there are any new transactions for me to record into my own bookkeeping system. I didn't want to believe that they would actually go through with it, and they kept postponing the time for when this was to go into action further and further away. But now they finally did it, in spite of my numerous requests for them to not do this, or at the very least provide some kind of API for me to use. They completely ignored every single attempt by me to talk sense to them, just parroting the same standard replies over and over, since they had clearly made up their mind: they will not give even the most basic access to one's account without being forced to actively sit there and manually enter codes into a hardware device or to use an "app" on a surveillance unit ("smartphone"), which is completely useless to me or anyone with half a horse sense left in their mind. The less I comment on their new, severely broken website, the better, but the point is that it makes automation 100% impossible, even for fetching your balance. I'm not talking about making actual money transactions automatically or anything like that. Please note that their so-called "Open Bank API" service is fake. It isn't actually available to individuals like me -- only to major organizations/companies and "app makers" with special permission and a lot of red tape. (They don't make this clear at all for some reason.) So, now I've just spend significant time and effort removing all my code related to Nordea and all the careful automation I've set up to keep track of my finances. It's all gone. They will very clearly never listen to me, their API is not actually available to use, and none of their alleged "methods of login" can be automated. I spent countless hours over a long time coding and thinking about that mechanism, and now it's useless. To make matters even worse, they are actually still going to be charging the same hefty fee monthly from my account, even though I now don't even get to know how much money I have in my account... Switching banks isn't feasible, nor would it do any good as they are all the same. I wonder if they treat people with a lot of money in their accounts the same way as they do me? Do they also have to manually log in with a dongle and codes every time they want to see their account balance or fetch data to update their local bookkeeping database table? That Ethereum/Ether thing sounds promising when they explain it on their website, but I've never met a single person who knew what that even is. They barely have heard of Bitcoin, let alone know how to use it or own any. What should we do now that the powerful, gigantic banks have decided that the slaves don't even deserve even the smallest amount of "power"?

I have just discovered that my local bank, Nordea, has decided to remove the only good thing about their entire operation: the so-called "simplified login" feature on their website, which allows (soon allowed) the customer to log in to a kind of very limited "read-only" mode which basically just allowed you to see your current balance, the last few transactions (limited descriptions) and see whether or not there are any new "customer support messages", but not read those messages, not make any kind of payments, edit accounts, etc.  Now, they will only allow "full" logins, which 100% prevents any kind of automation and requires you to sit with a hardware device and enter numbers into it and then into the webpage before it allows you to see as much as your account balance. Other than being very obnoxious for every customer, it also blocks me and other "advanced" users out from our custom-programmed bots which have always regularly logged in with that "simplified" login method just to regexp out the current balance/new messages and then notify us via whatever mechanism we use privately.  I have previously asked them if they have any kind of JSON/RSS API of any kind, but no. They don't even have as much as e-mail notifications! Nothing except their spyware "smartphone app" which I would never install, nor would I ever allow such a surveillance device to track me 24/7 in the first place. Only by being a registered corporation with special, way more costly account types do you get any kind of "API" access from them, even to do this most basic imaginable task.  Before you tell me to switch banks, the others are at least just as bad (even worse from what I can tell, and for a longer time), and the act of switching banks is practically impossible for me personally.  What I'm asking is if maybe somebody knows of some sort of "hidden standard" or something which all banks in the world support, but don't have documented, for people like me to automate basic things such as knowing my account balance. Needless to say, I have looked for this countless times on their website, asked them about it, and asked other people about it. Nobody seems to know anything, or, if they do, won't tell me.  I know that there are a bunch of "Nordea-supporting" PHP libraries and whatnot on Github, but they are all ancient and even if they were up to date, they were most likely using the same method as I have been using: automating the login process through their "simplified login" mechanism, which is "soon" to be gone. (Probably at new year; they didn't even mention any dates or time frames.)  And yes, I have a Bitcoin wallet and have that fully automated. The problem is that virtually nobody else in the world cares about my Bitcoin, so "switching to Bitcoin" remains a pipe dream which I would be ready to do, but the world clearly isn't.


At the end of The Avengers, Thor takes Loki with him to Asgard as a prisoner. He also took the Tesseract. But why didn't he take Loki's staff? Seeing that S.H.I.E.L.D. used the Tesseract to make weapons of mass destruction, he will surely realize that the staff was of great power and earth's people could use it for making weapons. So why didn't he take the staff with him?

At the end of The Avengers, Thor takes Loki as prisoner & also takes the Tessaract, to be placed in Asgard.   But why didn't he also take Loki's sceptre with him?   It was a source of power & mind control which was later revealed to be the Mind Infinity Stone.


Hi I am working on my dissertation. I need my cover sheet to be like following.                       Dissertation Title                           My name                          (centered)                    A dissertation submitted                       to University....                       (centered)                    Copyrights This copy of                    Dissertation supplied...   But I don't know how to do it exactly. Can anyone please help me with it.

I use article document class and want to make a titlepage. But I need to put more than just author, year and title. I also need to put my university and my supervisor and that is my bachelor thesis. If I just write it there without anything like \author{}, in the .pdf it's on the page before the title page.  \documentclass[a4paper,12pt]{article} \usepackage[utf8]{inputenc}     \usepackage[ngerman]{babel} \usepackage[T1]{fontenc}  \begin{document}  \begin{titlepage}  Bachelorarbeit  \begin{center} University \end{center}  \title{Title}  \author{Frida}  supervisor: Prof XY  \date{\today}  \maketitle \end{titlepage}  \end{document}


I'm looking for a motivation of the unicity (up to isomorphism) of Categorical Quotient of an algebraic group. I would think that the surjectivity of the map is important but it's not asked.

I'm following along Wikipedia page() on universal property, and this seems it should be trivial, but I couldn't finish the proof.  The definition I am working with:   The problem   So I want to prove that if $(A, u)$ and $(A', u')$ are universal morphism from $X$ to $F$, then there exists unique isomorphism $k: A \rightarrow A'$ such that $u' = F(k) \circ u$.   My attempt:   For any $B \in C$ and $f: X \rightarrow F(B)$, there exists unique $h: A \rightarrow B$ such that $f = h \circ u$.  Letting $B = A'$ and $f = u'$, we see that there exists unique $k: A \rightarrow A'$ such that $Fk \circ u = u'$.  This shows existence and uniqueness. We only need that $k$ is isomorphism, but this is the part I cannot prove.   Similarly, there exists unique $k': A' \rightarrow A$ such that $Fk' \circ u' = u$.  Plugging into each equation, we get  $$Fk \circ Fk' \circ u' = F(k \circ k') \circ u' = u'$$  $$Fk' \circ Fk \circ u = F(k' \circ k) \circ u = u$$  but this of course doesn't imply $F(k \circ k') = id$, so it seems useless.   Thanks for your help!


I have the following task:     Give an example of two $\sigma$-algebras such that their intersection is not an algebra   There is a hint that such situation is possible only when their units differ, but I still can't come up to solution.   Let $S_1,S_2$ be our $\sigma$-algebras and $X = S_1 \cap S_2$.  1) $A,B \in X \Rightarrow A \setminus B \in X$. This is obvious because $A,B \in S_i \Rightarrow A \setminus B \in S_i$ (for $i=1,2$).  2) Similarly, $A,B \in X \Rightarrow A \cup B \in X$.  3) Similarly, any countable union is in $X$ too (though we do not need $X$ be a $\sigma$-ring by condition of the task).  So $X$ is at least a $\sigma$-ring and it must not contain a unit (or otherwise it will become an algebra).  If $X$ is countable, then union of all its elements $A = \bigcup A_i$ is contained in $X$. This easily makes $A$ a unit. Thus our $X$ must be uncountable. And from here I can neither prove that $X$ contains a unit nor disapprove it.

I have the following question:    $\textbf{Question}:$ Let $\mathcal{F}_1$ and $\mathcal{F}_2$ be two algebras. Is $\mathcal{F}_1 \cap \mathcal{F}_2$ a $\sigma$-algebra?  I believe the answer is no. I know the definition of an algebra and the definition of $\sigma$-algebra.    I'm assuming I need to show that the intersection of the finite unions of each algebra is finite, but then I get stuck trying to work out how to show it is not a $\sigma$-algebra.  All help is appreciated.  Many thanks, John


In wolfram alpha it says it's 30 but I cannot figure out why.

How can I evaluate $$\sum_{n=1}^\infty\frac{2n}{3^{n+1}}$$? I know the answer thanks to , but I'm more concerned with how I can derive that answer. It cites tests to prove that it is convergent, but my class has never learned these before. So I feel that there must be a simpler method.  In general, how can I evaluate $$\sum_{n=0}^\infty (n+1)x^n?$$


found a question like this and there are four options   R>=1 R>=2*pi R<=4*pi R<=pi, where R denotes radius of convergence. I've tried hard but cant get it how to show in equality. Also there is question in my mind that among four options if the series is not converge at the end point can we discard that option. I'm not sure abut this since we know if anywhere "<" holds we can say "<=" holds, but the converse is'nt not true.   Please help to find the solution. Please answer it in the answer section rather comment. Thanks in advance.  I repost this because dont know why my previous post is locked.

What is the radius of convergence of the power series $$\sum_{n=1}^\infty \frac{\sin(n!)}{n!} x^n$$  I found a question like this and there are four options    $R\geq 1$ $R\geq 2*\pi$ $R\leq 4*\pi$ $R\leq \pi$    where $R$ denotes radius of convergence.    I've tried hard but cant get it how to show in equality.  Also there is question in my mind that among four options if the series is not converge at the end point can we discard that option.  I'm not sure abut this since we know if anywhere "$<$" holds we can say "$\leq$" holds, but the converse isn't not true.


I want to change my Stack Overflow picture, but when I click 'edit' in my profile page and then 'change picture', I'm taken to some stupid Gravatar web site... I really don't want the Gravatar!

.  It would be nice to have the option to just upload an avatar rather than have to use some external service like gravatar.  While gravatar may be convenient and useful, it's also a serious privacy concern because the operators of gravatar have basically got a web bug that allows them to track users and identities across multiple sites.  ISP proxy servers can do similar tracking, associating their own users with gravatars and logins on various sites just by analysing the proxy logs... as can corporate and other proxy servers.  Lots of people don't have a problem with that, but I do.  So I refuse to use gravatar and similar services.  (I'm not terribly happy about OpenID for the same reason — but at least I can set up my own OpenID server if I want to... which is what I'm going to do when I can be bothered.)


Consider this code:  [GlobalErrorBehaviorAttribute(typeof(GlobalErrorHandler))] public class Service1 : IService1 {     public string Recursive(int value)     {         Recursive(value);         return string.Format("You entered: {0}", value);     }   and this is my GlobalErrorHandler:  public class GlobalErrorHandler : IErrorHandler {     public bool HandleError(Exception error)     {         string path = HostingEnvironment.ApplicationPhysicalPath;          using (TextWriter tw = File.AppendText(Path.Combine(path, @"d:\\IIS.Log")))         {             if (error != null)             {                 tw.WriteLine("Exception:{0}{1}Method: {2}{3}Message:{4}",                     error.GetType().Name, Environment.NewLine, error.TargetSite.Name,                     Environment.NewLine, error.Message + Environment.NewLine);             }             tw.Close();         }          return true;     }      public void ProvideFault(Exception error, MessageVersion version, ref Message fault)     {         var newEx = new FaultException(                      string.Format("Exception caught at GlobalErrorHandler{0}Method: {1}{2}Message:{3}",                                   Environment.NewLine, error.TargetSite.Name, Environment.NewLine, error.Message));          MessageFault msgFault = newEx.CreateMessageFault();         fault = Message.CreateMessage(version, msgFault, newEx.Action);     } }   When I call Recursive in the WCF Test Client I get this error. Why can't I handle a StackOverflowException?  Is there any way for handle such this error?

I would like to either prevent or handle a StackOverflowException that I am getting from a call to the XslCompiledTransform.Transform method within an Xsl Editor I am writing. The problem seems to be that the user can write an Xsl script that is infinitely recursive, and it just blows up on the call to the Transform method.  (That is, the problem is not just the typical programmatic error, which is usually the cause of such an exception.)  Is there a way to detect and/or limit how many recursions are allowed?  Or any other ideas to keep this code from just blowing up on me?


I want to use "MaxID" as part of my join condition, but it keeps throwing an error:     ERROR:  syntax error at or near "["   LINE 29:   AND t1.["MaxID"]=t2.id     This is my query:  with MaxIDs as (  select max(id) as "MaxID"  ,elID  from valsum  group by elID ) select  t1.elID ,es.eNum ,es.des ,es.d1 ,case    when es.st = 1 then 'Pink'    when es.st = 2 then 'Red'    when es.st = 3 then 'Blue'    ELSE es.st::text  END AS st ,t1.price from MaxIDs t1 INNER JOIN etime es  ON t1.elID=es.elID join valsum t2  ON t1.elID=t2.elID  AND t1.MaxID=t2.id    WHERE CAST(es.d1 As Date) BETWEEN '01/01/2016' AND '12/31/2016' AND es.st IN (3)  ORDER BY CAST(es.d1 As Date) DESC   I also tried to use the alias w/o the brackets, but the same error was thrown.  How can I join on this field?  With no brackets and no quotes this is the error:  AND t1.MaxID=t2.id         ERROR:  column t1.maxid does not exist   LINE 29:   AND t1.MaxID=t2.id

I migrated a database from SQL Server to PostgreSQL.  Most column names contain double words, for example:  SELECT [Column Name] FROM table;   ...which does not work in PostgreSQL.  What is the correct syntax for PostgreSQL?


After force upgrading dabs in my android application I'm getting the following error from some devices:     Caused by java.lang.NullPointerException: Attempt to invoke virtual   method 'int android.database.sqlite.SQLiteDatabase.getVersion()' on a   null object reference          at com.readystatesoftware.sqliteasset.SQLiteAssetHelper.getWritableDatabase(SQLiteAssetHelper.java:178)   Have anybody ever faced with this kind of problem and how you solved it? Thank you!  UPD: Adding the implementation of my DBManager class:  public class DBManager {      private SQLiteDatabase db;     private Context context;      public DBManager(Context context) {         DBHelper dbHelper = new DBHelper(context);         db = dbHelper.getWritableDatabase();         this.context = context; }  private class DBHelper extends SQLiteAssetHelper {     private static final String DB_NAME = "database.db";             private static final int DATABASE_VERSION = 5;          public DBHelper(Context context) {             super(context, DB_NAME, null, DATABASE_VERSION);             setForcedUpgrade(5);         }       } }

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'm running Ubuntu 18.04, is there any antivirus that can protect me from virus when I'm installing packages from Ubuntu repository or install python packages with pip or conda? I know that there are third party tools for ClamAV, however I don't know which one to choose.

Is there any real-time anti virus for Ubuntu? Which antivirus is good and in real-time (I mean that, if I try to open an infected file or go to a bad website, it stops it).  I read a post in  and here is a part of it:  Anti-virus  If you are running a file server, interface frequently with Windows drives or share files with Windows users, or use virtualization, you will want a virus checker for your Windows files.   Despite extensive misinformation, Linux is not immune from malware (witness the explosion of malware being created for the Linux-based Google Android systems). The malware is not usually spread within the OS itself (as long as the OS is a well-respected distribution obtained through official channels), but in trojan programs downloaded and installed by users outside of the normal software distribution channels (i.e. repositories) of the OS. There is always a danger to using programs downloaded from the Internet from sources other than respected repositories -- it is the primary reason that Debian and (K)Ubuntu retain tight control over their software repositories.   Any file can have malware embedded in it (which is trivial to achieve by concatenation, for example: cat originalfile.avi malware.exe > originalfileplusmalware.avi). The question is whether a user will try to open a file with a program (such as a media player) that has been compromised in a way that allows it to execute the code found in the infected media (e.g. .avi) file. This can occur not only for Windows users but for any OS (including Mac OSX and Linux) with a compromised program (e.g. media player). An example is the extensive problems the Mac OS community is currently having with the Flash player.   Routine scanning of any file downloaded from the Internet, any file imported from another user's computer (even a trusted source, since their attention to virus prevention may not be as compulsive as yours), or any attachment received in an email (even from a trusted sender) should be done with an anti-virus program. So I think that there is a need for anti-virus in Ubuntu.


What's the difference between two concepts,  1. limit of function and 2. continuous function? I looked at their definitions in the textbook written by Rudin and it's so hard to differentiate between them.  They look similar to me.  [Edited]  I can't find the difference between two definition. If they are the same, it means that a function is continous if and only if every point is a limit point. But this is not true. So I want to know what makes a difference between a point being a limit of function and function being itself continuous  Images of Definitions

In "Principles of mathematical analysis" Walter Rudin gives the definition of   $$\lim_{x \rightarrow p} f(x)=q$$  for $f: X \supset E \rightarrow Y$ with $X,Y$ metric spaces, in this way:     for every $\epsilon>0$ there exists a $\delta >0$ such that      $$d_Y(f(x),q)<\epsilon$$      for all points $x \in E$ for which      $$0<d_X(x,p)<\delta$$   where $d_X$ and $d_Y$ are the distances in $X$ and $Y$. After few pages he gives the definition of continuity:     $f$ is said to be continuous at $p$ if for every $\epsilon>0$ there   exists a $\delta >0$ such that      $$d_Y(f(x),f(p))<\epsilon$$      for all points $x \in E$ for which       $$d_X(x,p)<\delta$$   My question is, why did he drop the $0<\dots$ in $d_X(x,p)<\delta$? I though that continuity in $p$ means that the limit of the function in $p$ exists and is equal to $f(p)$, so one should simply replace $q$ with $f(p)$ in the above definition of limit, why changing the condition on $x$?  Doing so a function like  $$f: \{1\} \rightarrow \mathbb{R}$$ which maps 1 to 5, for example, would be continous in 1, since $x=p$ is allowed, but what is the limit of $f$ in 1? It doesn't exist, right?  Is there a deep reason for such a counterintuitive definition?   EDIT:  Maybe I should better clarify my question. I know that this definition works, I am asking why considering a function continuos at isolated points (which is an immediate consequence of this defintion ---> It turned out I was wrong about this).    The only reason I can think of is that this definition agrees with the topological one for continuity, but it doesn't seem to me a good reason since topology came after (and would have agreed no matter the convention).


My problem is the following: I have 2 random variables $X \sim Gamma(2,\mu_2)$ and $Y \sim Exp(\mu_1)$. I have to compute $P(X > Y)$. How can I do that ? Thank you

Let $X \sim Gamma(3,3)$ and $Y \sim Exp(1)$.  How do I calculate $P(X>Y)$?  I believe I rewrite it as $P(X-Y>0)$ but I am unsure how to calculate $X-Y$ for two different distributions?


A tensor of type (r,s) on a vector space V is a C-valued function T on V×V×...×V×W×W×...×W (there are r V's and s W's in which W is dual space of V) which is linear in each argument. We take (0, 0) tensors to be scalars, as a matter of convention. The interpretations of (r,0) tensors are trivial, since they are definitions of multilinear functionals (as a special case (1,0) tensor interpreted as covector (elements of dual space)). We can interpret (1,1) tensors as follows: A(v,f ) ≡ f (Av). Say we have a linear operator R; then we can turn R into a second rank tensor T by T(v,w) ≡ v · Rw where · denotes the usual dot product of vectors. If we compute the components of T we find that the components of the tensor T are the same as the components of the linear operator R. Ok. Everything is good. But I cant understand interpretations of other (r,s) tensors. For example I found in Wikipedia (0,1) tensor intepreted as a vector or (0,2) as a bivector and in general (0,s) tensor as n-vector tensor; or (2,1) tensor as cross product and so on. I want you to show how the tensors in general interpreted. Is it possible for you to show these interpretations like as I did for (1,1) tensor ? Please dont close this post. My answer is not in "What is tensor ?"

I have a pretty good knowledge of physics, but couldn't deeply understand what a  is and why it is so fundamental.


I have created a WCF service and exposed a function which accept List as a parameter.  public bool Execute(string databaseServer, string database, string ClientName, string ERAPayerID, string PlanPriority, List<string> AdjCode, List<string> RemarkCode, List<string> CPT, string Modifier, string renderingProviderNPI)   when I call this function it ask me to provide string[] instead of  List  WriteOffServiceClient client = new WriteOffServiceClient(); bool resutl = client.Execute("server", "database", practiseIdentifier, "", ERAPayerId, pPriority, new List<string>, new List<string>, new List<string>, "", "");   it gives me this error of invalid arguments.When I call it with string it accept it.  WriteOffServiceClient client = new WriteOffServiceClient(); bool resutl = client.Execute("server", "database", practiseIdentifier, "", ERAPayerId, pPriority, new string[5], new string[5], new string[5], "", "");   What do I do If I want to accept only List?

I am returning a List from my WCF method.  In my client code, it's return type shows as MyObject[].  I have to either use MyObject[], or IList, or IEnumerable...   WCFClient myClient = new WCFClient();      MyObject[] list = myClient.GetMyStuff(); or     IList<MyObject> list = myClient.GetMyStuff(); or     IEnumerable<MyObject> list = myClient.GetMyStuff();   All I am doing is taking this collection and binding it to a grid.  What is the best object to assign my returned collection?


Just wondering: why we expect a black hole to have an emissivity of 1? Can anyone give some ideas?

A  absorbs all light/radiation in its reach. According to basic laws of physics, the more energy a body absorbs the more it can emit. Therefore, a black body absorbs all energy directed at it and also emits all energy that's been absorbed.   A  is known to absorb all sorts of every (light, radiation..). If it absorbs -all- energy around it, it should in addition emit all energy it has absorbed. But due to its vast gravity noting can "escape", and therefore nothing is actually emitted. Is a black hole still considered a perfect black body?   Disclaimer: I am no physicists, I am a senior year high school student with an interest for physics. I don't know the preferred terminology of things, especially not in English (2nd language), so if anything is unclear I will explain in comments below.


I tried to prove it with linear combination. Also other information,  $h*\gcd(m, n)=h*am+h*bn$ At each iteration $i$, $y_i=x_iq+r$ Last iteration $t$, so $x_t=\gcd(m, n)$.  Base case: Iteration t. $x_t=h_t*\gcd(m, n)=h_t*am+h_t*bn$. Last iteration, $x_t=\gcd(m, n)$, so $h_t = 1$. Hence, $\gcd(m, n)=am+bn$  I don't know how to prove that m, n are positive integers and a, b are integer.  Assume iteration k, $x_k=h_k*\gcd(m, n)=h_k*am+h_k*bn$, for some integer h, $x_k$ is a multiple of gcd. We need to prove $x_{k+1}=h_{k+1}*\gcd(m, n)=h_{k+1}*am+h_{k+1}*bn$.  I don't know is that correct, if it is wrong, please tell me  Also, I don't know is this prove correct.

I have the following problem:  Let $a, b \in\mathbb{Z}$. Show that $\,\{ ax + by\ :\ x, y \in \mathbb{Z}\} = \{ n \gcd(a,b)\ :\ n\in \mathbb{Z} \}$   I understand that the Bezout's lemma says that $gcd(a,b) = ax +by$, so Im not really how you would go about proving the above, it doesn't really make sense to me. Any help is appreciated1


I'm fairly new to mongodb, and am tackling some devops issues here.  We have a b2b saas product deployed on AWS where there is no network effect between customers, and some customers have much, much larger databases than others. They are currently being run off one central mongodb server and we're getting bad noisy-neighbour problems, we need to isolate the clients who have ridiculously large collections of contacts.  My question is: what is the minimum reasonable mongodb server for a setup where we give individual larger customers their own isolated vpc in aws? Does this need to be a 3 server replica set as indicated in the mongo docs or can one reasonably use one ec2 instance as a production mongo server for a small database?

This is a  about  Related:      I have a question regarding capacity planning. Can the Server Fault community please help with the following:   What kind of server do I need to handle some number of users? How many users can a server with some specifications handle? Will some server configuration be fast enough for my use case? I'm building a social networking site: what kind of hardware do I need? How much bandwidth do I need for some project? How much bandwidth will some number of users use in some application?


I need to prove that $n^2 = {n \choose 2} + {n+1 \choose2}$. I have already proved this using algebra, but I am required to use both algebra and a formal combinatorial proof which demonstrates a bijection between the right and left hand sides.   If someone could show me how to get started with this proof and the general steps to take and why, I would greatly appreciate it.

An exercise in the first chapter of Discrete Mathematics, Elementary and Beyond asks for a proof of the following identity:   $$ {n \choose 2} + {n+1 \choose 2} = n^2 $$  The algebraic solution is obvious to me, but less so the combinatorial logic. I think the right-hand side relates to choosing one of n elements twice in a row to produce a set of two elements, including the possibility of duplicate elements (for instance, one could choose the nth element twice in a row). However, given that the sets discussed thus far do contain duplicate elements, it's odd to then interpret n^2 as a representation of such a set. I'm not too sure what the two parts of the left side mean when taken together, either. How can I think about this intuitively based on the combinatorial meanings of the individual terms?


Short version: Does the Loewner order have the least-upper-bound property? Long version: Suppose I have a finite set of finite-dimensional positive semidefinite matrices $\mathcal{M}$. That is, we have $M\ge 0$ for all $M\in\mathcal{M}$.  Here "$\ge$" is the , which is a partial order on matrices where we say $A \ge B$ when $v^*(A-B)v \ge 0$ for all vectors $v$ (and where "${}^*$" is the adjoint). An "upper bound" on the set $\mathcal{M}$ is a matrix $A$ satisfying $A \ge M$ for all $M\in\mathcal{M}$. For any set $\mathcal{M}$, is there necessarily a matrix $\bar{M}$ that provides a least upper bound in the sense that $\bar{M} \le A$ for all upper bounds $A$? It seems relevant that the space of upper bounds is convex, i.e., if $A$ and $B$ are upper bounds then so is $C_\lambda = \lambda A + (1-\lambda)B$ for any $\lambda\in [0,1]$.  However, it's easy to check that for any two upper bounds $A$ and $B$ there need not be a choice $\lambda$ such that $C_\lambda \le A$ and $C_\lambda \le B$.

How can someone prove, that over a Hilbert space $\mathcal{H}$ with $dim \mathcal{H} \geq 2$, the set of all self-adjoint operators doesn't form a lattice?  I found a result from Kadison, that if two self adjoint operators $A, B$ are not comparable, then they don't have a least upper bound. In 2 dimensions, I got two upper bounds of the (standard) projections $P_1, P_2$, which are not comparable. I think its not enough, but I can't go any further.   Please help!


I'm new to LaTeX and quite impressed with this program! So, I'm willing to concede not being entirely certain that the issue I'm having has to do with data types, or just using \includegraphics{} quirks, but here's my dilemma.  I have looked at  regarding \includegraphics but it didn't sort-of solve my issue.  I have a document using the memoir class:  \documentclass[a5paper, 11pt, onecolumn, openany]{memoir}   I use a custom style .sty file:  \usepackage{KeysToLife}   I wish to use a UDF (\imgpb = image plus page break)  that I define in the .sty with a couple of arguments. The first argument is the name and path of the image file, which would be in the form of "./img/Flourish.png". The second argument is the scale value for that image, which could in the the form of 0.6 or .8 or something along those lines. Here is the \newcommand code I came up with:  \newcommand{\imgpb}[2]{ \begin{center} \includegraphics[scale={#2}]{#1} \end{center} \pagebreak }   This typically would get called from within the document in this manner:  \imgpb{./img/Flourish02.png,0.6}   The error in TexMaker states "Paragraph ended before \Gin@ii was complete. \par  I'm at a bit of a loss how to proceed. When I call the function with just one argument:  \imgpb{./img/Flourish02.png}   it executes just fine... just appears to have a problem with the second argument. Which is of data type double, in Python terms. Am I barking up the wrong tree?  The full document (with issues) is here as a zip file:    Edited to Announce as SOLVED:  Thanks to Marmot and Werner who pointed out the solution. You send arguments, instead of comma-delimited, as separated in curly-brackets:  \imgpb{./img/Flourish02.png}{.6}   Sorted.  I will endeavour to do due diligence in researching the question before I ask the next one.

When I delete the second \item, it compiles fine. However, with the second \item, I get ERROR: Missing $ inserted and the math renders incorrectly:  \documentclass[12pt]{article}  \newcommand \frob[2] {\langle #1,#2 \rangle_F}  \begin{document} \begin{itemize}  \item What I want: $  \langle A,B \rangle_F  \geq  \langle C,D \rangle_F $.   \item What I get: $  \frob{A,B}  \geq  \frob{A,B}  $.  \end{itemize} \end{document}     Would appreciate any help with this issue!


I am new to Linux kubuntu 14, i tried installing kubuntu 14.04 without internet connection which went smoothly, when i finish installing i was surprise to get a network or connection icon with a red sign showing wireless disable.  Since i have been battling with all kind of solution to fix this problem i can't just find any, i went to internet point and also try to connect ethernet wire it didn't work also can someone help me. when i run   lspci -nn    I get   02.06.1 Firewire (IEEE 1394) [0c00]: Texas instruments PCIxx12 OHCI compliant IEEE 1394 Host Controller [104c:803a] 02.0e.0 Ethernet controller [0200]: Broadcom corporation BCM4401-B0 100Base-TX [14e4:170c](rev 02) 10.00.0 Network controller [0280]: Broadcom corporation BCM4311 802.11b/g WLAN [14e4:4311] (rev 01)

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


Previously suggested answers here have not restored the menu bar and launcher.  I've run many updates, enabled the Unity plugin, and scoured Google for commands to restore these items, but with no luck.  Desktop icons appear, however.  The compiz-core version installed is the one referenced in the similar question suggested here.  I installed aptitude and ran the commands to install ubuntu-desktop, and while they appeared to run, they actually downloaded 0B of data and didn't install anything.  Edit 2:  This was marked as a duplicate of  - I should specify that I have taken all steps outlined in the answers on that question, and my desktop still has not been restored.  Specifically, when I run the command to install Unity, it tells me Unity is already installed.

This  forced removal of unity and ubuntu-desktop on my 16.04 Ubuntu system.   The offending package that is missing, but unity needs, seems to be compiz-core-abiversion-20151010. It seems to be a , and I can't find it to download.    As it happens, I mostly use LXDE on this system, but I'd be very unhappy if I used Unity...  Since I do occasionally use the Unity desktop, is there a fix for this?  Edit: related questions are rolling in. Looks like a major quality escape          Edit 2:


Following , I would like to ask, what is the best place in SE network (if any) to ask questions concerning legal part or side of software or services:   What user can, can't, should or shouldn't do in Facebook, Twitter and many more web apps. Can I use this or that software or service commercially or legally in my company? Other questions about license of particular software or service (not general law-related questions).    was given a year ago. Do we have any update? Is there any real chance, any of mentioned Area51 sites will grow to fully-functional SE site? Or do we have any chance for any other place in SE to ask software/service-legal- related questions, not being concerned as off-topic?

Is it appropriate to ask questions about software licenses/licensing on ? Or is the appropriate place  ? Or is there no appropriate site currently and we should suggest such a site on ?


One of my school friends gave me this sum.Its basically a story formated into a sum  STORY  There were 3 friends. They each gave 20 dollars to buy a radio. They bought the radio for 60 dollar. Later the shopkeeper saw that the cost of the radio was 50 dollar. So he went to the friends to return 10 dollar. On the way (of returning) he thought that 10 dollar can't be divided among 3 friends. So he himself took 4 dollar  and rest 6 dollar was divided among three friends.  thus each friend got 2 dollar.  SUM  Initially the shop keeper had 60 dollar.  And each friend finally gave 18*3=54 dollars and the shopkeeper himself took 4 dollar. thus total 58 dollar.  THEN WHERE DID EXTRA  2 DOLLAR GO?????  I tried it in many ways but still could not. can any one help me out.

I'm not sure how well known this "riddle" is but here it goes.  3 people go to a restaurant, each buy food worth 10.00.  When they're done, they give 30.00 to the waitress.  She gives the money to the manager, manager says they paid too much, gives 5.00 back to the waitress.  She comes back to the table, gives a dollar back to each person and then puts the remaining 2.00 in her pocket for tip.  So now, each person has paid 9.00.  9.00 x 3 = 27.00.  Plus the 2.00 in the waitresses pocket is 29.00.  What happened to the 30th dollar?  So what's the issue with this way of calculating (since if you backward it works fine), that doesn't give us the correct result?


I have the following class.  template <class T> class DivideConquerTask { public: DivideConquerTask() = delete; DivideConquerTask(int problemSize, int branchingSize); virtual ~DivideConquerTask(); DivideConquerTask(const DivideConquerTask& other) = delete; DivideConquerTask& operator=(const DivideConquerTask& rhs) = delete; DivideConquerTask(DivideConquerTask&& other) = delete; DivideConquerTask& operator=(DivideConquerTask&& rhs) = delete; ...   and in cpp file  template <class T> DivideConquerTask<T>::DivideConquerTask(int problemSize, int branchingSize) :     _problemSize { problemSize }, _branchingSize { branchingSize } { }  template <class T> DivideConquerTask<T>::~DivideConquerTask() {     /* Currently no resources managed. */ }   I then have a class:  class MergeSortTask final : public DivideConquerTask<int> { public: virtual ~MergeSortTask(); MergeSortTask(int data[], int problemSize, int branchingSize); ...   with cpp file  MergeSortTask::~MergeSortTask() { } MergeSortTask::MergeSortTask(int* data, int problemSize, int branchingSize) :     DivideConquerTask(problemSize, branchingSize), _data { data } { }   and from this I get error messages:  undefined reference to Actors::DivideConquerTask<int>::~DivideConquerTask() undefined reference toActors::DivideConquerTask::DivideConquerTask(int, int)  where Actors is the namespace everything is declared/defined in.  What's the problem here? Why can't it find my base constructor/destructor?  Note: I have omitted some trivial functions that are working fine.

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


What is the definition of function application in material set theories like ZF?  I know how functions are represented using functional relations (optionally paired with the codomain).  I'm aware of the definition of function application in other formal theories such as Martin-löf theory, but there it is a a primitive notion, defined as one of the natural deduction rules. In ZF-like set theories the sets representing functions are a derived notion.  Say I had an arbitrary functional relation $f$ representing some function and a a value $x$ in the domain of $f$. How is the operation that takes $f$ and $x$ and gives me the set $f(x)$ defined using the axioms and rules of ZF+FOL?

I am familiar with the set-theoretical definition of functions.   A function $f : A \rightarrow B$ from a set $A$ to a set $B$ is a subset $f \subseteq A \times B$ of the Cartesian product $A \times B$ such that the following conditions hold:   $\forall a \in A : \exists b \in B : (a,b) \in f$ $\forall a \in A : \forall b, b' \in B : (a,b), (a,b') \in f \rightarrow b=b'$   Is there a purely set-theoretical definition of the function evaluation $f(a)$ for every $a \in A$? I get as far as defining  $f(a) = \{ b \in B : (a,b) \in f \}$ but that defines rather the set of values of a multi-valued function.


After failing another audit, I really believe that comments on audits should be considered a neutral action, just like how clicking the link to the full question/answer is not considered. The logic used is equivalent to "you don't need to see the full question if it's good enough, it should be obvious", which is just complete baloney and completely unnatural, opposite to what a normal person would do. Please change the logic of "known good" review audits - it unfairly attacks legitimate reviewers while it does not do much to lower robo-reviewing. Here's the typical example of such an audit:        As a result of this audit, I got a suspension from the review queue, which I believe is flawed and does not match how genuine reviewers actually would behave in situations such as these - which ultimately is the basis of this feature request.

I just failed these   in First Post, I read the question and thought it seemed reasonable but the user was deleted so to be on the safe side I clicked add comment and I failed the audit.  I'm not sure why adding a comment would be considered a negative action, is the correct option to click No Action Needed or edit?  What was I supposed to do in this situation?  Adding a comment should not be a review audit fail.


I have often wondered at the practice on Stack Overflow, Server Fault, and the other sites where someone will ask a question and an answer will come in that says Look here: http://link elsewhere. Rarely will the link have exactly the answer necessary -- often it's an entire article -- yet these answers get voted up.  Why is that, exactly? I realize this is subjective, but my own thoughts are that one should try and give the answer (even if the answer is 'no, it can't be done' or 'no, I don't think it can be done' -- very different answers) and then if you have a link that explains it, go ahead and post it within the answer.  What does the community think about this?     For more information, see  in the .

I think we can all agree, this sucks:  If you've been around a little while, you've probably encountered hundreds of answers like this in various forums, some of them even marked as "The Answer" by well-meaning1 forum admins looking to close a thread. We could try to enumerate the commonly-observed problems with it...  Link is probably broken If link isn't broken, it's spam If link isn't spam, it's to some broadly-related resource that the answerer found by pressing "I'm feeling lucky" when googling the question's title.  ...but the real issue here is that we don't know! Even if the link was originally pointing directly to the most awesomeest answer ever for exactly the question being asked, there's nothing in the answer itself to even hint at what direction we're being pointed in. Strip the markup, and this is what you're left with:  i think you should take The tutorial HERE! This will help you a lot  Is there even one tiny speck of information there? No. Even the title of the page being linked to would have provided something to go on, but that was entirely too much work. So let me be clear: this sort of response is not an answer. If you see this, flag it. Moderators, if you see it flagged, delete it. There's really only one valid exception to this rule, and that's when the question is:  Suggest me some tutorials where i can learn quick.  Don't get me wrong, it's still a bad answer - but when the question is kinda asking for bad answers this is to be expected. Close or flag the question and move on - this is much more efficient than hanging around to babysit it by deleting every crap answer that inevitably shows up. If you're still reading, you're probably getting really bored by now. "Gee, Shog - answers that contain ZERO information are terrible, horrible, very-bad things? What shocking revelations will you share next?" Yeah. It's really simple... Except, . See, the problem is that once you step away from black-and-white "answers / doesn't answer" decision-making, things get... Interesting. And all those other answers with links in them See, this is an answer:  And so is this:  Yes, they're both very short, and yes, they contain links. But strip the markup, and you still get at least a little bit of useful information. Does that mean these answers should forever hang around the site? No, not necessarily - if it turns out they're just not that useful, they should probably still be removed - or at very least, down-voted so that they rank below other answers. Just remember: if the text of the post contains an honest attempt at answering the question, then it is an answer - so don't flag it otherwise, and if you do, don't complain if your flag gets declined. Answers & Apples If you're still confused, forget about answers. Think about apples instead:  Answers are just like that, but less tasty in pies.  1 By which I mean to say, "criminally lazy"


I have a Python function that returns a set of values say a1,...,an.  Example. The returned set is a1,a2,a3,a4.  def myFunction():     # The code     return a1,a2,a3,a4    I would like to access only a1 and a4 for example, how?  I tried  a1, , ,a4 = myFunction()   but it gives me error too many to unpack  EDIT The error too many to unpackwas only given when I tried a1,=myFunction()

Say I have a Python function that returns multiple values in a tuple:  def func():     return 1, 2   Is there a nice way to ignore one of the results rather than just assigning to a temporary variable? Say if I was only interested in the first value, is there a better way than this:  x, temp = func()


I want to buy a philosophy of mathematics book. I have three options in mind: Philosophy of Mathematics by Øystein Linnebo, Philosophy of Mathematics: Selected Readings by Paul Benacerraf, or The Oxford Handbook of Philosophy of Mathematics and Logic by Stewart Shapiro. My main interests are mathematical platonism and logicism. Do these books cover such topics? If they do, which one, in your opinion, does it better? P.S. Feel free to suggest any other text about Philosophy of Mathematics

I'm trying to learn about the logicist programme by myself so I was wondering, what are some good book/papers/articles on logicism? I'm looking for introductory to medium level texts, nothing very deep.


When I upgrade a package, homebrew prompts this:  ==> Upgrading mysql@5.7 Warning: A newer Command Line Tools release is available. Update them from Software Update in System Preferences or https://developer.apple.com/download/more/.   I have XCode Version 11.3 (11C29) installed, and no updates in System Preferences or App Store      Opening Xcode does not prompt me to install command line tools either, how can I get the latest version?

Hello,    This question is about the Command Line Developer Tools that are usually installed with xcode-select --install and updated via a software update from the Mac App Store (at least until macOS 10.13). I use the developer toolchain on a daily basis and it has always worked and updated without issues.    Today I've updated my mac from High Sierra 10.13.6 to Mojave 10.14.1, and I've lost the ability to update the Developer Tools.    After the update I've executed a terminal command that relies on the developer tools being installed. It was a command to update , although I don't think that the specifics matter, as I believe that any task that tried to access the developer tools would have triggered the same error message.    The error was:   xcrun: error: invalid active developer path (/Library/Developer/CommandLineTools), missing xcrun at: /Library/Developer/CommandLineTools/usr/bin/xcrun       The phrasing was new (maybe), but I thought that it was caused by the usual need to re-install the Developer Tools after some macOS updates.    Later I tried to dig a bit deeper into the failure, and found out that:  $ ls -l /Library/Developer/CommandLineTools/usr/total 0drwxr-xr-x  3 root  admin  96  4 Nov 19:32 share$ which xcrun/usr/bin/xcrun$ xcode-select -p/Library/Developer/CommandLineTools    Still, as I normally do, I entered the command to install and update the Developer Tools in the terminal:  xcode-select --install    This started the usual procedure: modal window to confirm, then request to accept the license agreement, followed by a progress bar. Except that it failed very quickly with an unexpected error:     Can’t install the software because it is not currently available from the Software Update server.     I've tried several times, to no avail. It gets always stuck.    Sometimes, however, the failure causes the System Preferences to report a pending update:      If I open that preference panel it starts searching for updates, and it always finds nothing except the first time that it happened. The first time, it found this:          It literally suggested me to install the updates for macOS 10.11 and 10.13. I have no idea why.  I closed the preference without installing, and as I said it hasn't shown them again. There is also no update available in new Mac App Store.   Is this a known issue? Is there any way to resolve the problem?     Update  Of course I can download the Dev Tools for macOS 10.14 installer from .  Before installing them manually, though, I'm wondering if there is anything that's broken with the system.


There are four different forms of verb pluralisation agreement I'm curious about:  neither thing [has/have] an attribute neither of the things [has/have] an attribute both of the things [has/have] an attribute both things [has/have] an attribute  For each of these forms, should "have" be pluralised, or not? My intuitive guesses are singular, singular, plural and plural; but I have no specific justification.

Bob: "Can I set the font color? Can I customize the text?"  Frank: "Neither of these options is available. Sorry!"    Is "neither is" always correct or should one use "neither are" in some cases and what are the exact rules?  of this-is-why-stackexchange-exists :P


I have 3 different sets of numbers, for example a={1,3,4} b={2,6} c={0}    the size of sets can be variable, e.g. one set with 5 elements, another with 3, etc.  I have saved these values in a hashmap in java,  HashMap H=new HashMap<String,HashSet<Integer>>();   for this example, the keys of H are "a","b",and "c".  I want to make all possible combinations of the numbers in these three sets, that is: 1,2,0 1,6,0 3,2,0 3,6,0 4,2,0 4,6,0    But I have a problem. The number of sets can also be variable, i.e. my HashMap can have 3 to 10 keys. Do you have any idea how I should iterate over the hashmap, so that I can make all possible combinations?  ANSWER: I changed the HashMap to Vector, however, it also works with HashMap with little changes    call the function as follow:    Iterate_over_map(0,new Integer[h.size()],h,final_list);   Iterate_over_map(int count,Integer[] curr,Vector<HashSet<Integer>> h,Vector<Integer[]> final_list) {     if(count>=h.size())     {         final_list.addElement(curr.clone());         return;     }      int next_count=count+1;     for (Integer element:h.elementAt(count))     {          curr[count]=element;         Iterate_over_map(next_count,curr,h,final_list);     }  }   OLD solution  for(int x:H.get("a")) {     v[0]=x;//node1 (an ortholog of node1)     for(int y:H.get("b"))     {         v[1]=y;//node2 (an ortholog of node2)         for(int z:H.get("c"))         {             v[2]=z;//node3 (an ortholog of node3)         }     } }   thanks a lot.

If I have an object implementing the Map interface in Java and I wish to iterate over every pair contained within it,  what is the most efficient way of going through the map?  Will the ordering of elements depend on the specific map implementation that I have for the interface?


Can somebody tell me why this is complaining? I am using SQL Server, with one table called test and 1 column called word  This is my query:  SELECT TOP 1 COUNT(*) AS count,  (LEN(word) - LEN(REPLACE(word,'A',''))) AS letters FROM dbo.TEST  WHERE  word LIKE '******'  GROUP BY letters  ORDER BY count DESC   THis is the result error:  Msg 207, Level 16, State 1, Line 7 Invalid column name 'letters'.   Why is complaining about my alias?

I'm trying to perform a group by action on an aliased column (example below) but can't determine the proper syntax.  SELECT       LastName + ', ' + FirstName AS 'FullName' FROM         customers GROUP BY     'FullName'   What is the correct syntax?   EDIT  Extending the question further (I had not expected the answers I had received) would the solution still apply for a CASEed aliased column?  SELECT            CASE         WHEN LastName IS NULL THEN FirstName         WHEN LastName IS NOT NULL THEN LastName + ', ' + FirstName     END AS 'FullName' FROM         customers GROUP BY          LastName, FirstName   And the answer is yes it does still apply.


I am having trouble to copy an array of objects using Lodash.   Please see the code,   var freshSlots = _.clone(this.bookingSlots); console.log(freshSlots) // It prints the new changed copy this.bookingSlots=this.bookingSlots[0].booked=true // here I am running some loops and changing the property values of this.bookingSlots   As you can see, this cloning is happening by reference that's why I never get the old copy. How can I get the old copy by values?   Thank you.

What is the most efficient way to clone a JavaScript object? I've seen obj = eval(uneval(o)); being used, but . I've done things like obj = JSON.parse(JSON.stringify(o)); but question the efficiency.  I've also seen recursive copying functions with various flaws.  I'm surprised no canonical solution exists.


I've attempted to install Ubuntu 16 desktop alongside Win7 using both a USB drive and DVD install -- Ubuntu 16 runs great directly from the media!  However, in attempting to install alongside Win7 on this Compaq Presario (circa 2010-2011 production), it DOES detect the Win7 operating system but the only choices are to delete the existing OS -OR- "Other" for installs.  I have successfully installed previous versions of Ubuntu alongside Windows on other laptops and have never encountered this issue before.  I believe this laptop has an AMD C10 processor.  Can anyone please help?  Thank you!!!

Whenever I startup from the LinuxLive USB, and try to install Ubuntu 12.04, it only gives me two options instead of the usual 3 or 4. My options are "Replace Windows 7 with Ubuntu" and "Something Else". Whenever I go into "Something else", it looks extremely confusing. How do I install it side-by-side while using the "Something else" section? These are my partitions.   /dev/sda /dev/sda1 ntfs (104Mb, System Required Partition) /dev/sda2 ntfs (1000097Mb, Windows 7 Partition)   Or should I try reinstalling my installer on a CD rather than USB and maybe then it will have the "Install alongside" function?


I need to prove that the following series $$ \sum_{n=1}^{\infty} \bigg(\frac{1}{4}\bigg)^n {2n \choose n}$$ diverges.  I've managed to change it to the following formula: $$ 4^n=(1+1)^{2n}=\bigg(\sum_{k=0}^n{n\choose k}\bigg)^2 \text{ and } {2n\choose n}=\sum_{k=0}^n{n\choose k}^2 \text{ so }$$ $$\sum_{n=1}^\infty \bigg(\frac{1}{4}\bigg)^n {2n \choose n} =\sum_{n=1}^\infty \frac{\sum_{k=0}^n{n\choose k}^2}{\left(\sum_{k=0}^n{n\choose k}\right)^2}   $$ Where do I go from here? I know that the limit of series' sequence goes to $0$ but that isn't helpful really since I need to prove that it diverges.  Also all the ratio tests and root test are inconclusive. I already checked that. Think of 4 as variable $a$. I need to check for which $a$ this series converges. I already know that for $a>4$ it does, but I need to prove that for $a=4$ it diverges. There was a mistake in my calculating of limit in Raabe's test which concluded that this series is indeed divergent.

Given the series $S=\sum_{n=1}^{\infty} \frac{(2n)!}{4^n(n!)^2}$ I'm trying to prove its divergent but with no luck. It doesn't tend to $\infty$ as $n$ grows large and ratio test is inconclusive. I have been trying to do a comparison test but all series less than $S$ that I was able to come up with were convergent. So I'm starting to suspect that the series might actually be convergent, any hints?  Thanks!


I downloaded the full ubuntu install .iso and I have it normally on  my PC, yet I am not able to set it up and it is saved as a normal file.  I tried to open it with many apps as file mnager, WinRar and many other apps yet it doesn't seem to do anything.  I am currently using windows 8 pro.

I would like to see a full how-to guide on how to install Ubuntu.


I was looking at Number.isInteger() on . I came upon this example -  Number.isInteger(5.000000000000001); // false  I changed the value to 5.0000000000000001 and if I execute the same method on the console, the result is:  Number.isInteger(5.0000000000000001); // true  Also 5.0000000000000001 === 5 comes out to be true.  Can someone please explain what's happening here?

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


We run digital magazine websites. We use a carousel to feature content. Since we are interested in the user clicking through to view the content, and not converting them to anything (these are inhouse or association magazines, so no outside subscribers). Is this still a problem? Does the end user not see the carousel, or only sees the first image?

Go to just about any eCommerce site and the homepage is nearly guaranteed to feature a carousel - an auto-rotating panel, usually with some sort of small navigation, usually highlighting new product releases, sales or offers.   Are there any studies out there that look into how effective carousels actually are in terms of conversions and as compared against other ways of displaying similar information? I have a hypothesis that they might be something of a UI cliche, partially supported by looking at click data from some of our own sites.


Followed  link to upgrade openSSL.  openssl version is,  OpenSSL 1.0.2h 3 May 2016  After that tried sudo service nginx restart  $ apt-cache policy openssl     openssl: Installed: 1.0.2g-1ubuntu4.10 Candidate: 1.0.2g-1ubuntu4.10 sudo apt-get install --only-upgrade libssl1.0.0 openssl  Reading package lists... Done Building dependency tree Reading state information... Done libssl1.0.0 is already the newest version (1.0.2g-1ubuntu4.10). openssl is already the newest version (1.0.2g-1ubuntu4.10). The following packages were automatically installed and are no longer required: bridge-utils containerd linux-aws-headers-4.4.0-1048 linux-headers-4.4.0-1048-aws linux-image-4.4.0-1048-aws runc ubuntu-fan Use 'sudo apt autoremove' to remove them. 0 upgraded, 0 newly installed, 0 to remove and 1 not upgraded. lsb_release -a  No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 16.04.4 LTS Release:    16.04 Codename:   xenial  nginx -V nginx version: nginx/1.11.1 built by gcc 5.4.0 20160609 (Ubuntu 5.4.0-6ubuntu1~16.04.9)  built with OpenSSL 1.0.2h  3 May 2016 TLS SNI support enabled configure arguments: --prefix=/etc/nginx --sbin-path=/usr/sbin/nginx --conf-path=/etc/nginx/nginx.conf --error-log-path=/var/log/nginx/error.log --http-log-path=/var/log/nginx/access.log --pid-path=/var/run/nginx.pid --lock-path=/var/run/nginx.lock --http-client-body-temp-path=/var/cache/nginx/client_temp --http-proxy-temp-path=/var/cache/nginx/proxy_temp --http-fastcgi-temp-path=/var/cache/nginx/fastcgi_temp --http-uwsgi-temp-path=/var/cache/nginx/uwsgi_temp --http-scgi-temp-path=/var/cache/nginx/scgi_temp --with-openssl=/usr/local/src/openssl --user=www-data --group=www-data --with-http_ssl_module --with-http_realip_module --with-http_addition_module --with-http_sub_module --with-http_dav_module --with-http_flv_module --with-http_mp4_module --with-http_gunzip_module --with-http_gzip_static_module --with-http_random_index_module --with-http_secure_link_module --with-http_stub_status_module --with-http_auth_request_module --with-threads --with-stream --with-stream_ssl_module --with-http_slice_module --with-mail --with-mail_ssl_module --with-file-aio --with-http_v2_module --with-ipv6   Still getting 'F' in   Screenshots:     Thanks in Advance!

OpenSSL released , warning users of two recently discovered vulnerabilities:   Memory corruption in the ASN.1 encoder (CVE-2016-2108) Padding oracle in AES-NI CBC MAC check (CVE-2016-2107)   Their recommendation is as follows:     OpenSSL 1.0.2 users should upgrade to 1.0.2h   OpenSSL 1.0.1 users should upgrade to 1.0.1t   However, the latest version available for Trusty (14.04) is 1.0.1f-1ubuntu2.19. How come such an old version is still being provided and how do I mitigate this?


At least 4 times i am getting this error. And i dont know why i am getting this error. The 95% of the Project is working at some point i am getting this specific error. i tryed to solve own my own but i couldn't [31/07 06:05:17] Client: [Wife: Jessica Brown - Costumer Accunt: Philip Marine - IP: 84.34.12.67] - Failed reading: [C] 21 RequestBypassToServer ; org/omg/PortableServer/POAManagerPackage/State     java.lang.NoClassDefFoundError: org/omg/PortableServer/POAManagerPackage/State

I am getting a NoClassDefFoundError when I run my Java application.  What is typically the cause of this?


I have heard that using the newer <strong> tag as opposed to <b> creates an ability for some devices to make text "strong" that was already bolded-as in the case of a palm pilot, where it would be underlined if you used <strong>.   I have also heard that older browsers cannot recognize <strong> and <em> and just ignore them, but newer browsers recognize both the old and new tags, making it an advantage to use the older tags if your users/viewers might have old browsers-however some newer devices benefit from the newer tag (like the <strong> vs <b>).   So I was wondering-how does the <em> tag show up on, say, a palm pilot, or similar devices?  What is the advantage and disadvantage of using <em> vs <i>? Or vice-versa?   ~Added after comments and marked as "duplicate"~  Since this seems to some to be a duplicate question, but I can't find my answer, I will rephrase:   What would happen to text in a browser that did not recognize the < i > tag if you used that instead of the < em > tag? How would it appear?  Is there any advantage to using the < i > tag that now appears to be less "correct" to use then the < em > tag? For instance-some devices might recognize it but not the other? Or would it be pretty much obsolete and useless?

What's the difference between <b> and <strong>, <i> and <em> in HTML/XHTML? When should you use each?


Consider this simple implementation of hook_menu()  /**  * Implements hook_menu().  */ function helloworld_menu() {   $items['hello'] = array(     'title' => 'Hello world!',     'page callback' => 'helloworld_page',     'access callback' => TRUE,   );    return $items; }  /**  * Page callback for /hello.  */ function helloworld_page() {   return "Hello World!"; }   This code work when I visit example.com/hello, but so does when I append extra argument to the url like example.com/hello/world. How do I only define the example.com/hello only without getting all these 'derivative' URL defined as well?

This is in connection to drupal.org issue .  That's when I happen to request for page "node/1/aaa/bbbb", I'm served the response for "node/1" (it's parent page).  I can understand, this is the way Drupal menu system has been designed and works for some obvious reasons.   But I'm in a need to change this. Reason we have some aliased urls across the site, links from third party sites are taking (visitors and crawlers) to not existing page for which ideally http 404 response code and page not found to be returned. Instead Drupal showing it's parent page (with http res. code 200). This is leading to duplicate page in Google webmasters and misleading our genuine users.  I have found a  to this issue. However it is working fine only for 80% of cases, some valid urls (admin/*, sites/default/files/ * , system/ajax/*, etc.,) leads to 404 page.  Would like to hear how others are dealing with this duplicate content issue concerning SEO and possible fix!


I am Reading RSA and Public-Key Cryptography by Mollin and I can't make out how El Gamal is different from Diffie Hellman Key Exchange. Any thoughts?

For what kind of usage should we prefer using Diffie-Hellman in order to exchange keys instead of ElGamal, and most important why should we use one or the other?  I do not see a clear difference between these two algorithms. What are their respective advantages?


After installation of the vim-airline and vim-airline-themes packages, what is the best way to use / activate them?  I can manually copy the .vim-files over, but this defeats the purpose of package management with eventual updates. Using vim 8, so I think the answer  is outdated for the new vim 8 package management.

I downloaded vim-youcompleteme from the software center in Ubuntu. But I don't know how to make it work. When I restarted vim and tested, nothing special occurred. And vim-syntastic is the same. Could someone tell me how to make them work? Should I do something with my ~/.vimrc ? Thanks in advance!


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

Does relativistic mass affect space time in the same way as rest mass?    To my understanding, (as I am not an actual physicist, but simply a citizen scientist) relativistic mass is really the measure of an object's energy.  It is not the same as rest mass, which is the definition of mass that a layperson would be familiar with (how much matter an object is composed of).  However, does a change in relativistic mass amount to the same magnitude of gravitational variation as an equivalent change in rest mass?


An unresolvable problem occurred while initializing the package information. Please report this bug against the 'update-manager' package and include the following error message: 'E:Type 'e' is not known on line 18 in source list /etc/apt/sources.list,  E:The list of sources could not be read.,  E:The package lists or status file could not be parsed or opened.'   How do I fix it?

Every once in a while I see users having issues to update due to errors like this:  E:Type 'ain' is not known on line 1 in source list /etc/apt/sources.list.d/some-ppa.list'   with varying types/line numbers/source list files (often after removing a PPA).  How can such an error be fixed?


On a generated project I get 100s of warnings caused by unused imports and such things. Can I bulk cleanup those imports for all files?

Wouldn't it be nice to just do a keystroke and have eclipse organize all imports in all java classes instead of just the one you are looking at? Is this possible? Is there a keystroke for it?


From observing the universe, we know that space expands. I see what that means on cosmic scales.  But what does it mean on smaller scales?  If I have a graduated beaker of 2 liter, and 1 liter of water in it, what should I expect to happen?  As nothing obvious happens, I assume that changes may be small enough to not be visible. But what would I see if the change would be large enough to see it?  Assuming the water does not evaporate, is the level of water in the beaker lowering because the beaker expands?    Would something different happen if the beaker would be very large? If I had a galaxy-sized beaker that does not collapse?*    *let's assume the water somehow does not become a black hole, and is accelerated to the bottom of the beaker

I have looked at other questions on this site (e.g. "why does space expansion affect matter") but can't find the answer I am looking for.  So here is my question: One often hears talk of space expanding when we talk about the speed of galaxies relative to ours. Why, if space is expanding, does matter not also expand? If a circle is drawn on balloon (2d plane), and the balloon expands, then the circle also expands. If matter is an object with 3 spatial dimensions, then when those 3 dimensions expand, so should the object.  If that was the case, we wouldn't see the universe as expanding at all, because we would be expanding (spatially) with it.  I have a few potential answers for this, which raise their own problems:   Fundamental particles are 'point sized' objects. They cannot expand because they do not have spatial dimension to begin with. The problem with this is that while the particles would not expand, the space between them would, leading to a point where the 3 non-gravity forces would no longer hold matter together due to distance Fundamental particles are curled up in additional dimensions a la string theory. These dimensions are not expanding. Same problems as 1, with the added problem of being a bit unsatisfying. The answer seems to be (from Marek in the previous question) that the gravitational force is so much weaker than the other forces that large (macro) objects move apart, but small (micro) objects stay together. However, this simple explanation seems to imply that expansion of space is a 'force' that can be overcome by a greater one. That doesn't sound right to me.


I recently installed Ubuntu 12.04 with wubi along with my windows 7 system. My lan connection is working fine in windows 7 but not showing in ubuntu. I tried everything i found on this forum regarding the same issue but didn't work.  Please tell me which commands' output you need to figure out the issue ? I will post them.

Your situation   You have successfully installed Ubuntu.  You have just downloaded and booted Ubuntu live media.  The latest LTS (see also ) or latest non-LTS release are preferred. See the list of  that are currently supported.) You upgraded your Ubuntu installation to the latest release that the software updater offered you. WiFi worked before, but not now on the new release. You  to new hardware.   Your problem   The wireless of your laptop or desktop is not working. You tried switching the wireless switch off and on and you tried rebooting several times, but you don't see any WiFi access points. You can see your wireless access point, but you cannot establish a connection. You want to analyze the problem, but you don't know where to start or what information you can provide.   This question and answer was written to give people the wireless script that will provide the information needed in most cases to diagnose their wireless issue's.   Related questions