I am trying to prove that for $p\to \infty$ the p-norm:  $$\|x\|_{p}=\Bigl(\sum_{i=1}^{n}|x_i|^{p}\Bigr)^{\frac{1}{p}}$$ we get:  $$\|x\|_{\infty}=\max\{|x_1|\}$$  $$|x_i|\leftarrow_{\infty}(|x_i|^{p})^{\frac{1}{p}}\leq\Bigl(\sum_{i=1}^{n}|x_i|^{p}\Bigr)^{\frac{1}{p}}\leq (p|x_i|^{p})^{\frac{1}{p}}\rightarrow_{\infty}|x_{i}|$$  It is for an arbitrary $i$ so we take the $\max\{|x_1|,|x_2|,...,|x_n|\}?$

If we are in a sequence space, then the $ l^{p} $-norm of the sequence $ \mathbf{x} = (x_{i})_{i \in \mathbb{N}} $ is $ \displaystyle \left( \sum_{i=1}^{\infty} |x_{i}|^{p} \right)^{1/p} $.  The $ l^{\infty} $-norm of $ \mathbf{x} $ is $ \displaystyle \sup_{i \in \mathbb{N}} |x_{i}| $.  Prove that the limit of the $ l^{p} $-norms is the $ l^{\infty} $-norm.  I saw an answer for $ L^{p} $-spaces, but I need one for $ l^{p} $-spaces. Besides, I didn’t really understand the $ L^{p} $-answer either.  Thanks for your help!


I was just reviewing a first post on RPG.se and noticed some strange UI behavior. As I scrolled down the voting buttons and quote blocks scroll on-top of the banner instead of below. See screenshots below.    I first noticed it with the voting buttons:     But quote blocks also do it:

I was having a look at an old question of mine when I browsed the  from the timeline. I scrolled downwards and realized the Review completed panel comes along for the ride. While that might be , tags flowing over top of it as pictured below probably isn't.  Here's a .gif of the Question and Duplicate tabs flowing over it as well. Note that the timeline button also flows over. If vote buttons are present, they will also flow over it.  Reproduced on Chrome and Microsoft Edge. Update Per  by Tiago Martins Peres, this issue also happens in other Review types, namely Late Answers, First Posts and Low Quality Posts. In addition to that, it is causing the action buttons on reviews to become unclickable if you scroll low enough.  As a temporary workaround, you can use 's , which  this issue.


E: Type '“deb' is not known on line 53 in source list /etc/apt/sources.list N: Ignoring file 'some-ppa.list.save.1' in directory '/etc/apt/sources.list.d/' as it has an invalid filename extension N: Ignoring file 'rethinkdb.lis' in directory '/etc/apt/sources.list.d/' as it has an invalid filename extension E: The list of sources could not be read.I am not able to install any packages of this eror please help

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?


In my application i want to drawing a rectangle on image box using bitmap called myBitmap. and the problem is how to use System.Drawing.bitMap as source for image in C# Wpf .     private void MyRectangle(System.Drawing.Point p1, System.Drawing.Point p2)     {         int var1,var2;         var1 = Convert.ToInt16(image1.Width);         var2 = Convert.ToInt16(image1.Height);          System.Drawing.Bitmap myBitmap = new System.Drawing.Bitmap(var1,var2);          using (Graphics g = Graphics.FromImage(myBitmap))         {             g.Clear(Color.LightBlue);             g.DrawRectangle(new Pen(Brushes.Red),p1.X, p1.Y, p2.X - p1.X, p2.Y - p1.Y);         }         // this.image1.Source = myBitmap;      }

I have an instance of a System.Drawing.Bitmap and would like to make it available to my WPF app in the form of a System.Windows.Media.Imaging.BitmapImage.  What would be the best approach for this?


I'm a US permanent resident, not a citizen yet. I'm originally from… well let's say my country isn't doing great these days. With my current citizenship, it would be a guaranteed rejection. However, since I'm a permanent resident in the US, I think I may have a chance.  I mainly want to stay in Germany for 2-3 weeks. So the right choice would be applying for a Schengen visa from Germany, but I was told it could be extremely difficult, and I was recommended to apply from Spain since it's easier, but I have no intention in staying in Spain. So does it look bad to apply from a country with no intention in staying in it? Which country do you think I should apply to?  My current situation in the US is great. I'm a graduate college student and I have sufficient funds in my bank account. So providing support documents shouldn't be a problem.

My port of entry and exit is Frankfurt, Germany. However i will only be spending a day or two there. I am visiting Spain and Portugal for a week each. So should I be applying to Spain embassy or German embassy? I am an Indian citizen.


I use a lot of "Lists of" in my document, some of them are generated by \listoftheorems. To include these lists in my PDF-bookmarks, I use .  But actually this crashes, when too many bookmarks are produced.  \documentclass{article}  \usepackage{thmtools} \usepackage{xpatch} \xpatchcmd{\listoftheorems}{\@fileswfalse}{}{\typeout{yes}}{\typeout{no}}  \declaretheorem{theorem}  \usepackage{hyperref}  \begin{document}  \tableofcontents \tableofcontents \tableofcontents \tableofcontents \tableofcontents \tableofcontents \tableofcontents \tableofcontents \tableofcontents \tableofcontents \tableofcontents %\tableofcontents %causes crash \listoftheorems  text  \end{document}

In my special package combination I get the error No room for new \write. \tablecontents and Bad number (16). \tablecontents. The following MWE throws this error in pdflatex and lualatex with TeX Live 2015. As you can see, I add the own content register loi. I can delete nearly every package separately and the error directly vanishes.  Does anyone have an idea what is wrong with this package combination?  \documentclass{scrartcl} % load packages \usepackage{ifluatex} \ifluatex     \usepackage{fontspec} \fi \usepackage{adjustbox, amsmath, blindtext, datatool, fancybox, fixme, graphicx, marginnote, pgfplots} \usepackage{imakeidx} \usepackage{biblatex} \usepackage{glossaries} \usepackage{hyperref} % load package for code code highlighting \usepackage{minted}  % define Open Issue and corresponding List of Open Issues \newcommand{\openissue}[2][Unlabeled]{%     \par%     {\refstepcounter{loicounter}%     \phantomsection% comment out if hyperref is noy used     \addcontentsline{loi}{figure}{%         \protect\numberline{%             \ifcsname c@chapter\endcsname%                 \thechapter.%             \fi%             \theloicounter%         }{#1: #2}%     }%     \textbf{Open Issue -- #1:} #2}%     \par% } % define counter \makeatletter \ifcsname c@chapter\endcsname%     \newcounter{loicounter}[chapter]% \else     \newcounter{loicounter}% \fi% \newcommand*{\listopenissuesname}{List of Open Issues} \newcommand{\listofopenissues}{%     \ifcsname chapter\endcsname%         \chapter*{\listopenissuesname}%     \else%         \section*{\listopenissuesname}%     \fi%     \@starttoc{loi}% } \makeatother  \fxsetup{status = draft} \makeglossaries \makeindex  \begin{document}  % include open issues \listofopenissues % include list of corrections \listoffixmes % include indicies \tableofcontents                            % Inhaltsverzeichnis einbinden  \end{document}


My colleague developer and I cannot find how to implement double-tap or pinch-zoom in the Preview screen on iOS when 'from camera' image import option is used.  We are using standard camera to take a picture.  Once the round button is clicked, the next screen displays the taken picture and two options "Retake" and "Use Photo".  I would like to allow the user to double-tap or pinch-zoom on this screen. Current default behavior does not affect picture zoom in any way.  The screen looks like , but in the latest iOS7 UI.  Please advise if this is possible and what specifically do I need to do to enable zoom in this screen?  Thanks.

I would like to zoom in/out an UIImage object when the user performs the standard pinch action on my application. I'm currently using a UIImageView to display my image, if that detail helps in any way.  I'm trying to figure out how to do this, but no such luck so far.  Any clues?


I'm trying to estimate available power from a solar cell like this one PRT-13781    Includes:  1x Solar Panel - 2W 1x Barrel Plug Adapter - 3.5mm to 5.5mm   Features:  Monocrystalline cells - 19% efficient Open Circuit Voltage: 7.0V Peak Voltage: 6.0V Peak Current: 378mA Peak Power: 2.27 Watts Four screws on back corners of panel allow multiple mounting options Waterproof Urethane Coating UV Resistant   Obviously, the 2W will be obtained in ideal conditions, clear sky, sunny, etc and at MPPT point.  How can I estimate available power for cloudy days, (variation with temperature will be also nice to know) etc. I cannot find relevant documents to start with, however, I will do at some point some measurements.   Until then, I am looking to best effort estimate just to have a start point in choosing the DC/DC MPPT charger, discharging the battery in my actual load conditions, etc.  For example this post question almost the same    but no relevant calculation based on illumination (lux) or percent of rated illumination vs. generated power.  EDITED We can close this question, I finally found a very well documented answer here    Thanks user @Russell McMahon

This is homework. I've tried my best to find the best answer that I could understand and could be accepted by my lecturer.   I've searched my lecture notes, wiki and google to find some good explanation defining solar irradiance. But somehow I still don't understand how I should 'define solar irradiance'. Can someone give me a few good sentences explaining solar irradiance. What are the changes, if any, in a photovoltaic cell (in terms of short-circuit current and open-circuit voltage) if the irradiance is reduced by 50%?


I have learnt about cycloids and have a related question:     What is parametric equation of a locus of a fixed point of a circle   rolling along an ellipse in $\mathbb{R}^2$?

I've gotten interested in describing a circle rolling on an ellipse; specifically, the curve traced out by a point on the circumference of the circle. I want a symbolic solution to the general case, radius $r$, axes $a$ and $b$. I've written nine polynomial equations in terms of various angles and lengths.  Exactly what "solution" means is subject to debate.  Let $(u,v)$ be the point on the circle. Similar to the cycloid, I would like an equation for $u$ in terms of a "natural" angle in the problem.  Similarly, an equation for $v$.  Perhaps it is necessary to have a differential equation, so maybe $du/dt$, $u$, and $t$, where $t$ is an angle in the problem.  I would have thought this was known, but I can't find it anywhere.


I am trying to understand in what situations mathematicians use the expression "without loss of generality". The  states that the expression is useful in symmetric situations such as if we assume two outcomes $a$ or $b$, then we can assign a symbolic math where we can make assumptions such as assume $a>b$, so in such scenario we don't loose any generality as we can equally say assume $b>a$, because symbols are symmetric and can be used interchangeably. Is this the correct understanding of the expression?

Why do we use "without loss of generality" when writing proofs? Is it necessary or convention? What "synonym" can be used?


I've noticed that a few users have something like this on their profiles:    It shows their total reputation across all sites.  How can I add that to my profile?

How do you put a card like this on your profile?    Which groups all your Stack Exchange sites' reputation points, medals and icons.    Is there a minimum reputation check for an Icon to appear on the card?


I have a div class .footer which is my website's footer till now I do not have any content on my webpage so it is on the top of my page after my navigation. please tell some CSS so I can make my footer at the bottom of my page.

I have a simple 2-column layout with a footer that clears both the right and left div in my markup.  My problem is that I can't get the footer to stay at the bottom of the page in all browsers.  It works if the content pushes the footer down, but that's not always the case.


I recently used wine to install steam on my 17.04 system... but after installation, it does not connect to the internet, hence nothing is loading. However, it does print this error  [0623/151506:ERROR:child_process_launcher.cc(443)] Failed to launch child process

I just installed Ubuntu for the first time and am trying to figure a way to play Windows games on Linux. I've read you need to use Wine, and I'm just wondering how exactly I go about doing this correctly. I've read a lot of conflicting information.


Regarding travelling in and out of the US. I am on a J-1 visa and wish to go to The Bahamas in my grace period.    If I want to return to the US after The Bahamas I know that I cannot enter on my visa but can I enter on an ESTA instead?

I'm from Italy and I had a J1 visa for the US for a year and a half. Now it's expired (I'm in the grace period) but I want to stay longer in California to travel a little bit, because this year I did this trainee-ship and I didn't have the possibility to visit all places that I wanted to.  The question is: Can I go to Canada and come back to the US with an ESTA? I'm not subject to the two years rule to go back to Italy? Is it risky after a J1? Do they believe me? How can convince them that I want to travel a little?   Is it easier to do this via Canada than Mexico? My lawyer said yes but I want to be sure.


I need help with my glass material. For some reason when I add glass to my scene it makes these little dots which I can´t get rid of.      This is the node editor for my glass material.

I know that this question is a bit old or maybe overdone, but I'm running the latest edition of Blender and when I use the Cycles engine I get really fuzzy results and I can't find a simple, non-compromising solution to the quality.  I don't know exactly what I'm doing wrong here, but I'm sure others share my frustration.  Leaving everything in default settings, I started a new project and switched to the Cycles render.  I duplicated the cube and set colors for two Diffuse BSDF shaders, then went ahead and made walls and a floor all sharing the same diffuse shader.  I made two windows to emit blue light.  The screenshot has gaps between the walls because of the setup:  I'm aware that it's considered very incomplete and many have come to terms with some amount of noise, but is this normal?  Furthermore, with default settings or not, I can't change the amount of noise produced.  Supposedly, using "progressively refine" in the rendering tab should make it refine itself indefinitely, however Cycles only counts to 10 refines and then stops, creating a render which is a pixel-perfect match of the ordinary rendering method when it's completed.  I understand that there are tricks that can be used to reduce noise, but at the cost of extra processing time and usually small quality conflicts, like blurring.  My question essentially boils down to is this Cycles' current limit?


May someone help me? I am trying to use induction to prove that the formula for finding the $n^{th}$ term of the Fibonacci sequence is:  $$F_n=\frac{1}{\sqrt{5}}\left(\frac{1+\sqrt{5}}{2}\right)^n-\frac{1}{\sqrt{5}}\left(\frac{1-\sqrt{5}}{2}\right)^n$$  I tried to put $n=1$ into the equation and prove that if $n=1$ works then $n=2$ works and it should work for any number but it didn't work. I need to prove that this formula gives the $n^{th}$ Fibonacci number.

May someone help me? I am trying to use induction to prove that the formula for finding the $n$-th term of the Fibonacci sequence is:   $$F_n=\frac{1}{\sqrt{5}}⋅\left(\frac{1+\sqrt{5}}{2}\right)^n-\frac{1}{\sqrt{5}}⋅\left(\frac{1-\sqrt{5}}{2}\right)^n.$$  I tried to put $n=1$ into the equation and prove that if $n=1$ works then $n=2$ works and it should work for any number, but it didn't work. I need to prove that this formula gives the $n$th Fibonacci number.


The following hand-waving argument is in the proof of Lemma 8.4 in Constantin and Foias's Navier-Stokes Equations:     Suppose $X,Y,Z$ are Hilbert spaces such that we have the following embedding properties   $$ X\overset{\text{cpt}}{\hookrightarrow}Y\hookrightarrow Z. $$   ($X$ is compactly embedded in $Y$, and $Y$ is continuously embedded in $Z$.)      Suppose $x_n\to 0$ weakly in $X$. Then $x_n$ convergens strongly in $Y$ and a fortiori in $Z$.    Would anyone explain why this is true (or I misses something that this argument needs more assumptions)? What does "a fortiori" mean here?

I found the following property of compact operators in a proof, and I can't prove it.     Prove that if $T \in \mathcal{L}(E,F)$ is compact, and if $u_n \rightharpoonup u$ (the sequence converges weakly to $u$ in $\sigma(E,E^*)$) then $Tu_n \to Tu$ strongly in $F$.   I was able to prove that $Tu_n$ has a convergent subsequence ($u_n \rightharpoonup u$ implies that $(u_n)$ is bounded in $E$. Then, because $T$ is compact it must follow that $(Tu_n)$ must contain some strong convergent subsequence), but didn't manage to finalize the proof.  Any reference or hints are welcome.


I am novice in Java and I am currently working in Eclipse Kepler. I have a JSP page from where I am reading a text file which is continuously being written using a shell script.                  <b>                     <%                         String filePath = "/home/default/test.txt";                         BufferedReader reader = new BufferedReader(new FileReader(filePath));                         StringBuilder sb = new StringBuilder();                         String line;                          while((line = reader.readLine()) != "Success"){                             sb.append(line+"\n");                             out.println(sb.toString());                         }                                            %>                 </b>   I need the logic to keep reading the log until it reads the final "Success" string and until it doesn't, it should not print any blank rows.  How to solve it?

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?


I know I shouldn't be using that function, and I don't care. Last time I checked the spec for strcat, it said something along the lines of updating the first value as well as returning the same.  Now, this is a really stupid question, and I want you to explain it like you're talking to a really stupid person.  Why won't this work?  char* foo="foo"; printf(strcat(foo,"bar"));   EDIT: I don't know the difference between char[] and char*. How would I allocate a string of 255 characters?  EDIT 2: OK, OK, so char[number] allocates a string of that many bytes? Makes sense. Thanks.  EDIT 3: Also, how would I use a character array without declaring it? Would I typecast it as char[255]?  EDIT 4: strcat((char[256])"foo","bar") returns an error. I'm about fed up with C.  EDIT 5: So does strcat((char[256])"foo",(char[])"bar").  EDIT 5:  char[256] foo="bar";   Real smooth. "identifier expected"

I'm working in C, and I have to concatenate a few things.  Right now I have this:  message = strcat("TEXT ", var);  message2 = strcat(strcat("TEXT ", foo), strcat(" TEXT ", bar));   Now if you have experience in C I'm sure you realize that this gives you a segmentation fault when you try to run it. So how do I work around that?


When, I try to cat the speed file, in /sys/class/net I get the following error  $ cat /sys/class/net/wlan0/speed  cat: /sys/class/net/wlan0/speed: Invalid argument #throws error   Whereas, for eth0 it shows  $ cat /sys/class/net/eth0/speed 1000   Can I know the reason for the error for wlan alone. Also the duplex is unkown for wlan0 but the carrier is set to 1?

I'm trying to find speed of network interface using file-descriptor. It's easy to do it for ethX, just calling cat /sys/class/net/eth0/speed. Unfortunately this method doesn't work with wireless interface. When I call /sys/class/net/wlan0/speed I get error: invalid argument.   So, do you know any /sys/class/net/eth0/speed like analog for wlan interface?


I want to replace '@flipkart.com' to '@Walmart.com' in whole database. I try to use all_tab_colums but this will not able to help to find the string in table.  Please assist.

Is it possible to search every field of every table for a particular value in Oracle?  There are hundreds of tables with thousands of rows in some tables so I know this could take a very long time to query. But the only thing I know is that a value for the field I would like to query against is 1/22/2008P09RR8. <  I've tried using this statement below to find an appropriate column based on what I think it should be named but it returned no results.  SELECT * from dba_objects  WHERE object_name like '%DTN%'   There is absolutely no documentation on this database and I have no idea where this field is being pulled from.  Any thoughts?


Is there a difference between the two sentences in meaning or syntactical correctness? Analyze, in your own words, the difference between the authors. and Analyze in your own words the difference between the authors.

When and how do we use the different kinds of brackets/parentheses — (){}[] — while writing English (not code)?


I have a 1963 house in Texas with Square D breakers and mostly duplex plugs.  All metal outlet boxes. However, there are 8 romex style cables (12-2 with ground) tied to the breakers in the service panel. The ground wires have green insulation and I think there are 8 plugs that have the ground attached to the metal outlet box. Many more outlet plugs are duplex and no grounding (even tested it). I see no conduit or metal cable sheathing anywhere. Is it true I can either 1. replace all breakers with GFI's and then change all plugs to grounded outlets? or 2. Replace just the first outlet coming from the service panel for each circuit with a GFI outlet and then change the rest of the plugs to grounded outlets?  Not much chance to run just a ground wire to each receptacle.  Really want to modernize and end up with legal protected outlets for 110 circuits.

Under the NEC (it was 210(7)(d)(3), but appears to have moved around some), it is permissible to replace an ungrounded receptacle with a GFCI receptacle, then wire further ungrounded or non-grounded (i.e. a NEMA 5 without a ground wire hooked up) receptacles on the circuit to the load side of the GFCI, all in lieu of running a ground wire in order to replace the existing ungrounded receptacles with grounded receptacles.  However: does this permission extend to replacing the branch circuit overcurrent protection device with a GFCI-type circuit breaker (or a CAFCI breaker that provides ground fault protection for personnel)?  Or can only GFCI receptacles be used for this retrofit? The NEC's verbiage does not make mention of breaker-type GFCIs...


I am a very inexperienced server owner and wanted to make sure I have a fix for heartbleed. After updating, "openssl version" still shows 1.0.1e and I wondered what to do to get a heartbleed free version. After googling I found out about "openssl version -b" and Debians "backporting policy"Since my build is from 8.April I assume I have a fixed version. You can find several discussions of users like me being unsettled by this. They are essentially invalidating the significance of version numbers. Why are they doing this?

I am running Debian Wheezy. I have just upgraded my system and should have the latest version of openssl (1.0.1g which fixes a ), but it does not appear to be being used.  I have run:  apt-get update apt-get upgrade   dpkg -s openssl shows: Version: 1.0.1e-2+deb7u5  openssl version shows: OpenSSL 1.0.1e 11 Feb 2013  I have rebooted my system since upgrading. What do I need to do to get openssl using the updated version?


What do you call a person who gives a promise and then denies, and shames and demonizes you for your orginal inquiry. For example a person might promise to sponsor you and then deny of giving such promise and start to shame you for inquiring about sponsorship.

I'm somewhat vexed in that I cannot think of a word that means a "promise breaker" or "person who breaks a promise". There are words that may subsume that, such as "miscreant" or "liar", but I cannot come up with an English word that is limited to a person who breaks promises.  The closest I've come is "piker", which is (a) informal and (b) limited to Australia/NZ, but means (according to the dictionary on my Mac):     a person who withdraws from a commitment.   Is there a more formal and common word that can be used to refer to people who break promises?


I am using a debian stretch live i386 gnome iso image with non-free firmware that I have booted from my usb, and I can find my wifi network but I am unable to connect after entering my password.  There is nothing wrong with the password or router, as I was able to login and use wifi from this pc.  I do not have an ethernet cable, so I have no internet connection on debian and therefore cannot install the necessary firmware via sources.list (let me know if there is a way to do this w/o internet though).    Is there a way for me to download the necessary firmware onto my usb from Microsoft Windows?  My wifi driver is RT3572, and I am using a Lenovo Ideapad 100S with an intel processor.  Any help is greatly appreciated!  If I need to, I will just go out and get an ethernet cable.

I burned a live iso image of debian 9 gnome i386 and booted it from my usb.   Everything worked perfectly, but it was not finding any local wifi.    After reading that the free version was missing the necessary firmware, I burned the debian 9 gnome i386 with non-free firmware and booted from my usb.  This time my wifi was found, but when I entered my password it tried to connect for a few seconds and then disconnected.  I'm not sure what to do from here.  There is no problem with the network or password, as I was able to login and use the internet from the PC I am using now.  Any help is greatly appreciated!


I'm building a system based on one of the old Raspberry Pi model B's (yes, first series) into a very small enclosure. I need to run an Ethernet cable from the POE splitter I have in this enclosure to the RJ-45 connector on the Pi's board, but I find I don't have enough room to do it (at least, not without creating a very small -- three inch -- cable.) I'm wondering if I can simply desolder the RJ45 jack and solder the Ethernet cable directly to the board itself, but I find that there's a lot going on in that jack:    Given all this "stuff" in there, would soldering the wires directly to the board even work?

In a (tentative) new design I want to connect two 100 Mbit/s Ethernet PHY similar to , separated by few inches on the same PCB, with same ground plane (but different power supplies). I have the choice of one of my PHY, but the other is embedded in an as-yet-unspecified PCIe to Ethernet IC (perhaps Gigabit but used in 100 Mbit/s mode), and it is critical that this PHY thinks there is a bona fide 100 Mbit/s Ethernet connection.  I could use the following         – Schematic created using   but I would like to achieve the same without the magnetics, in order to save on cost, purchasing headaches, and if at all possible power consumption.  I can imagine an RC network, perhaps as simple as in this , found thanks to a ; or maybe engineered with attenuation and lowpass, but that will not emulate the fact that with real magnetics, when there is a negative pulse on TX1P, there is a positive pulse on TX1M and RX2M. I am uncertain about if that would prevent some PHYs from working normally.  Anything to suggest that one is confident will work for practically any PHY around?


I'm writing some copy and I'm deciding between "Using X is recommended so that you can see Y" vs "Using X is recommended so you can see Y".  Which is correct and why?

A book suggests that we should not interchange "so" and "so that". "So" means "therefore", and "so that" means "in order that". However, it seems to me that in many cases they don't actually have a difference. For example:     Alice got up at 5:00 A.M., so that she could drive her son to school.   If I substitute "so that" with "so", this sentence presents the exact same causal relation to me:     Alice got up at 5:00 A.M., so she could drive her son to school.   I must have missed something here, since English is my second language. Could somebody explain the difference?


Trying to solve the modular equation $$x \equiv 58^{5745} \pmod{59}$$ I've seen a solution to this that involves using that $58 \equiv (-1) \pmod{59}$, and this in turn means that $58^{5745} \equiv (-1)\pmod{59}$, but I'm missing the rule that explains this step. Can someone clarify?

I've read about Fermat's little theorem and generally how congruence works. But I can't figure out how to work out these two:   $13^{100} \bmod 7$ $7^{100} \bmod 13$   I've also heard of this formula:  $$a \equiv b\pmod n \Rightarrow a^k \equiv b^k \pmod n $$  But I don't see how exactly to use that here, because from $13^1 \bmod 7$ I get 6, and $13^2 \bmod 7$ is 1. I'm unclear as to which one to raise to the kth power here (I'm assuming k = 100?)  Any hints or pointers in the right direction would be great.


Let $x$ be an element of a finite abelian group $G$ where $x$ has maximal order. Then I want to show that $\langle x\rangle$ is a direct summand of $G$. Note that I do not want to use finite abelian group classification theorem, because I want to use this fact to prove it.   My strategy is to find a subgroup $H\le G$ where $\langle x\rangle\cap H = \{e\}$ and $\langle x,H\rangle = G$. But I'm unsuccessful in finding such $H$.

Let $G$ be a finite abelian $p$-group. It is quite elementary to see that if $g \in G$ is an element of maximal order (and thus its span is a cyclic subgroup of $G$ of maximal order) then $G$ can be written as the direct sum $G=\langle g \rangle \oplus H$ for some $H \leq G$ (subgroup of $G$). For a proof see  for example (page 2).  My question: Do we need that $G$ is a $p$-group or does it also work for arbitrary finite abelian groups?   I think it is wrong for general groups because I looked around quite a bit and always only found the above theorem, but I could not find a counter-example.


The series $$1+ \frac12 -\frac13 + \frac14 + \frac15 -\frac16 +....$$ diverges. What procedure should I follow? What test will give the result? I can not move forward with out general term. If someone give me the general term then I can further proceed.

The series is given by ($a>0$) $$\frac{1}{a} +\frac{1}{a+1} - \frac{1}{a+2} +\frac{1}{a+3} +\frac{1}{a+4} -\frac{1}{a+5} +\cdots$$ So how can I move forward? I  can not find the general term  of the series. If someone can give the general term then I can go further.


I am getting an unresolved external symbol error (LNK2019, which seems timely given the current year) on the destructor and a static "factory" method that returns a unique_ptr of a class (see code below).  #ifndef ABC_HPP #define ABC_HPP  #include <memory>  enum SomeEnum { TYPE_A, TYPE_B };  template <SomeEnum Type> class ABC { //------------------------------------------------------------------------------ Constructor / Destructor private:      ABC();      /* Inaccessible Methods */     ABC(ABC&&)                  = delete;     ABC(const ABC&)             = delete;     ABC& operator=(ABC&&)       = delete;     ABC& operator=(const ABC&)  = delete;  public:     ~ABC();  //------------------------------------------------------------------------------ Factory Method public:      static std::unique_ptr<ABC<Type>> Create();  //------------------------------------------------------------------------------ };  #endif /* ABC_HPP */    Here is the implementation of the above class:  #include "ABC.hpp"  //------------------------------------------------------------------------------ Constructor(s)  template <SomeEnum Type> ABC<Type>::ABC() {}  //------------------------------------------------------------------------------ Destructor  template <SomeEnum Type> ABC<Type>::~ABC() {}  //------------------------------------------------------------------------------ Create  template <SomeEnum Type> std::unique_ptr<ABC<Type>> ABC<Type>::Create() {     return std::make_unique<ABC<Type>>(); }  //------------------------------------------------------------------------------    Everything compiles nice and fine... until I do this:  #include "ABC.hpp"  int main(int argc, char* argv[]) {     auto thingA = ABC<TYPE_A>::Create();      return 0; }   I originally tried to compile it on Visual Studio, but I also tried clang and got the same error.  What exactly am I doing wrong here? I feel like I've run into this error before but that I'm just too dumb to remember what the problem was.  I can get rid of the destructor error if I use raw pointers, but I want to use unique_ptr here. I can also get rid of it by simply commenting out the destructor entirely, but that's not cool with me either. Another way is to have the destructor defined within the header, but that's silly; I should be able to separate the implementation.  So far I have not found a way to get the Create method to work. Am I just trying to do too much here? Do I actually have to make a factory class? Am I too much of a dreamer? Is this question too long???  Thanks in advance to anyone who responds. :)

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.)


Today I heard a sentence:     Do you want more potatoes peeled.   But I have always used it as:     Do you want having more potatoes peeled.   Which one is grammartical? Please explain with examples.  Thanks in advance.

Are the following two sentences correct?     I want you to go to sleep.   and     I want you going to sleep.   If they are both correct, what's the difference?


Someone wrote a short story about the Fermi paradox—well, probably more than one person—but I have a specific story in mind.  I can only recall the broad outline.   A group of human explorers find a planet perfect for settlement, but before they can claim it, an alien walks up to them and sits down to tell them a little story.  This is the first alien that any human has ever met and the explorers almost shoot him in fear. But he calms them somehow and explains that humans live in an area of space that has been emptied by war. Everything has been wiped out, except apparently for us.  Here be spoilers:      Why? Because the biggest, baddest aliens of all time used to live there and the rest of the galaxy got together and killed the evil ones off. Didn't humans ever wonder why they had never met any aliens before?   And      All the dangerous aliens had been wiped out except for one planet—Earth.   One more        Then he killed everyone with a thought.   The story was probably written in the late 1940s through the 1950s. It's too straightforward for a 1960s story. I might have read it in an old magazine or in an anthology. I can't be sure.  But I'd sure like to know its name and who wrote it.

So the story goes, humans in a spaceship search for an inhabitable planet, being surprised they found none in the vicinity of Earth. They find one, and it seems uninhabited. At the same time are observed by the aliens, who go down on the planet to meet them. The aliens sit them down and tell them a story about war and conflict that ruled the galaxy, and how all the sentient races in the galaxy got together and got rid of the race that tried to conquer all by blowing up their planets.  In the end you realise man is this terrible conqueror the aliens are talking about.


So I have never used linux or ubuntu before so at the moment I am just trying it out from a USB drive. My problem is that i would like to save files on the internal hard drive of the computer but i have no idea how. Everythime i try saving something it only gives me an option to save on the USB drive.

If you are hurrying to reply, System → Administration → StartUp Disk Creator -- no, that's not what I'm talking about.   I want to try Ubuntu 11.04's Unity without touching my existing Ubuntu install.  To do this, I need to install the nVidia drivers first (sigh).  To do this, I need changes to persist a reboot.  To do this, I need to really install Ubuntu on a USB key.  How do you do that?    What I tried   I tried to make a USB key from , then boot from it, then choose "Install Ubuntu." The installer refused to install to the installation media itself. I tried, from my installed copy of Ubuntu:  sudo kvm /dev/sdb --cdrom .cache/testdrive/iso/ubuntu_natty-desktop-i386.iso   ...but the installer didn't detect the disk properly.


My 9 month old baby is pretty much addicted to his pacifier, and I kind of worry about if I should set some limits to pacifier use - like, he is starting to say a couple of recognizable words, but isn't the pacifier in the way? My first daughter never gave a pacifier a try, it just wasn't her thing. I started giving a pacifier to this one for sleep after a couple of week. Now when he does not have it, he puts anything he can get his hands on in his mouth, so I end up handing it to him. I thought of teething but it's not just when new teeth are showing up, he's been going for everything with his mouth for practically forever. On the other hand when he has his pacifier he actually looks at his toys and bangs them and interacts with them instead on trying to find a way to suck on them. Any advice? I'll admit I'm also confused because his sister was so different...

I've been using it when she gets fussy and she seems to love it. Is this a bad habit to get into? I've heard there are potential dental/breastfeeding/dependency issues. Is there any truth to this?


Prove that if $a \mid b$, then $(2^a-1) \mid(2^b-1)$.   So, I've said the following:   Let $a  \mid b$. $ \implies b=am$ Assume $(2^a-1) \mid (2^b-1)$ $ \implies (2^b-1)=(2^a-1)x$   But I can't figure out what to do with any of this from here forward.

Prove that if $d$ divides $n$, then $2^d  -1$ divides $2^n  -1$.  Use the identity $x^k  -1 = (x-1)*(x^{k-1}  +  x^{k-2}    + \cdots + x +1)$


When I am in boot mode, I only see my windows OS boot but not my Ubuntu pen drive to install Ubuntu. I used Rufus to convert the iso to my Pendrive and when I start to reboot, I don't see my USB drive after pressing F12. What should I do? Thank you in advance

I have a laptop with Ubuntu installed as the only OS. I also have a USB stick with a Windows 7 installation on it. I want to install Windows from the USB stick on my laptop but when I try to restart the laptop to get access to BIOS, I can't seem to find the command for it, its like it skips everything and just says Ubuntu and then takes me to the login screen.  How do I change the boot priority to USB in Ubuntu?


I'm looking for a topological space locally connected but not connected and not locally path connected. Is there any space with this properties? I haven't been able to find one

I'm trying to classify the various topological concepts about connectedness. According to 3 assertions ((Locally) path-connectedness implies (locally) connectedness. Connectedness together with locally path-connectedness implies path-connectedness.), we can draw this diagram:  +--------------------------+ |Connected                 | |             1      +-----+----------------------------+ |                    |  3  |           Locally connected| |   +----------------+-----+     6                      | |   |Path-connected  |  4  |                            | |   |                +-----+------------------------+   | |   |    2           |  5  |  Locally path-connected|   | +---+----------------+-----+                        |   |                   8  |           7                  |   |                      +------------------------------+---|   So, I want to find examples of all these 8 categories, but I can't find an example for 4.      See below The real line The  of two spaces of the 3rd type $[0,1] \cup [2,3]$ The rationals   Actually there is an  that gives an example of type 4, but there isn't any explanation. Can anyone please explain it (why it is not locally path-connected, to be specific) or give another example?


If $A$ is a square matrix which coefficients are the scalar of a field $\Bbb K$ then there exist a linear function $f:\Bbb K^n\rightarrow\Bbb K^n$ such that $$ f(e_j):=A_j $$ where $A_j$ is the $j$-th column of $A$ for any $j=1,...,n$. Then if $I$ is the identity square matrix if $A$ and $B$ are two square matix such that $AB=I$ then there exist two function $f,g:\Bbb K^n\rightarrow\Bbb K^n$ such that the identity square matrix is the matrix of the function $(f\circ g)$ and this means that $(f\circ g)$ is the identity on $\Bbb K^n$. So to prove the statement of the question I have to prove that $(g\circ f)$ is the identity too. So how prove the statement? Could someone help me, please?

If $A$ and $B$ are square matrices such that $AB = I$, where $I$ is the identity matrix, show that $BA = I$.    I do not understand anything more than the following.   Elementary row operations. Linear dependence. Row reduced forms and their relations with the original matrix.   If the entries of the matrix are not from a mathematical structure which supports commutativity, what can we say about this problem?  P.S.: Please avoid using the transpose and/or inverse of a matrix.


I am having a bit of a hard time understanding why instrumentation amps are used over a single differential amp?  For example, the differential signal that I have is very small and comes from a Wheatstone bridge configuration.  I understand some advantages but I am still unsure of what the main reason is for why we use instrumentation amps for small differential signals.   The main advantage I see is that we can control the gain easily by the one resistor Rg, when compared to if a standard differential amplifier was used (since you need to select the resistors etc).   However, why else are these 2 buffer amplifiers with gain needed. What is the reason we add them and why do we want a high impedance input? Since without these amplifiers, the second stage is just a normal differential amplifier Another question is when do we use just a single differential amplifier (why do we need instrumentation amplifiers for small differential signals)

RS Components lists three categories of similar amplifiers: , , and . I think that there should be a single section called Operational Amplifiers. Why do these three separate sections exist? What is the significance of this difference?


My back wheel stopped free wheeling so we took out the back wheel and opened the hub to find that the axle is bent. So we threw away the axle and thought to replace wheel. Now I know the axle can be replaced but i don't know the dimensions of the axle i had.  i looked at the specifications for my bike but i couldn't find any detailing on the rear axle length and diameter. my bike is:   How can I find a replacement for my rear axle?

my bike is:  and everything I have came with the bike, only now the axle of the rear wheel bent and the skewer has lost its grooves.  and I would like to replace the rear wheel with the 12 x 142mm version of:   I want to reuse the old casettes and disc break. I was told to buy new rotor bolts, will these do?   Will I be able to migrate all my previous parts onto this new wheel and will the wheel fit onto my bike?  update: A replacement axle would be prefered. What axle would work for my bike?


Adventurer's League player guide:  Selling Equipment. You can sell any mundane equipment that your character possesses using the normal rules in the PHB. Purchasing Equipment. You can purchase any equipment found in the PHB with your starting gold.  Starting character is a wizard, who takes scholar's pack.  Scholar's pack contains a "book of lore" (worth 25 gold), which I assume serves no real use in AL?  Book sells for 12.5, buy an explorer's pack for 10, sell the extra backpack for 1.  You now have an explorer's pack plus some free ink and paper, plus 3.5 gp. I honestly can't see any reason to take a scholar's pack and not also buy an explorer's pack, you're going to at the very least need rations, so can you just do it this way if your background doesn't give you 10 gold?

I'm starting a new AL game (as a player) and I have a question that's not addressed in the AL material.  According to Adventurers League Player's Guide (page 4)     When you create your D&D Adventurers League character for the current season, take starting equipment as determined by your class and background. You cannot roll for your starting wealth.   Meaning I can't start with whatever I want. However, I am playing a ranged-focused fighter, so the second gear option is of no use to me:   (a) a martial weapon and a shield or (b) two  martial weapons   Can I choose any two martial weapons and sell them for half price to use for purchasing other gear before play? And is there a restriction on how much gold I can get?  For example, two hand crossbows (martial ranged weapons) can net me 75 gp when sold, or two greatswords nets me 50 gp when sold.


I'm currently attempting to use a smoke effect to create an animation. the effect is working fine in solid mode but when I go to render view the smoke does not render. I'm not sure why this is, and would appreciate some help on rendering the smoke. Below is the blend file I am working on:

This is meant to solve this problem once and for all. What is every reason an object isn't showing up in a render or viewport in when using the cycles render engine?


First of all, I'm sorry for asking this which was seemingly asked before, but... In the questions I found, people talk about scope (and I'm familiar with the concept) or about some "callback" or "asynchronous" things that I don't really understand. The reason why I ask this is because all my global variables so far, were normally affected by the great number of functions. The code I have is way too big for me to paste it here, but I'll give you an example.  var ContainsSomeNumber = 50; var AnObjectWithSomeValues ... var TheFunctionInQuestion = function(nameRepresentingTheObject, nameRepresentingNumberVar){    if(nameRepresentingTheObject.lestSayName ==== "SomeString"){       nameRepresentingNumberVar+=5;    } }   Now the thing is, it understands both variables and gets the correct result when I pass them into the function, however, the ContainsSomeNumber variable remains unaffected by the function on a global scale. If I place an alert or log to show me how much it is inside the function, it shows 55, as it should. But once I try to access the modified global variable in another place with the modified value after the function has been run successfully (chrome and firefox show no foul play), it returns the same unmodified value of 50. Is the problem because I didn't use hardcode versions of variables to pass in the function, or what? Because like I said, it sees and modifies it the right way, but only inside the function. Shouldn't scope see the variable as a global one as I didn't write "var" in front of the one I used in the function? I mean, I didn't declare it as a new variable, plus it took it's global value normally. Why doesn't the global variable stay modified by the function?

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


Goal: Show the button "Candy Candy candy" after pressing the button text "Test2"     Problem: It doesn't show the text and what part am I missing in order to complete it?    I have tried using on() and live() but it still doesn't work.    Info: *I'm using jQuery and its ajax    Thank you!    $('#test1').click(function() {   document.getElementById("data1").innerHTML = "<button id='test2' type='button'>Test 2</button>"; });  $('#test2').click(function() {   document.getElementById("data2").innerHTML = "Candy candy candy !"; });  <!DOCTYPE html>      <meta charset="utf-8">   <meta name="viewport" content="width=device-width">   <title>JS Bin</title>         <button id="test1" type="button">Test 1</button>

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


This is my configuration: 1. Ubuntu 14.04 LAMPP server (localhost). 2. WiFi Access Point on ubuntu server. 3. Android device connected to WiFi access point.  I can access localhost from android device by typing IP address of my localhost.  How can I access just typing the name instead of IP address? (for example myserver directly in browser bar)?

I have just had my broadband upgraded to  which means my router has had to change. Previously I was using a Thomson TG585v7 ADSL thingy provided by my ISP. One nice thing about that router was that it would act as a local DNS and allow me to find my other machines on the network by using <hostname>.lan instead of IP addresses.  I've now switched to a Linksys WRT320N ethernet router which connects to my fibre modem, and which I've updated to the latest firmware (1.0.04). I have 2 machines on the network which I regularly want to connect to each other; one is running Windows 7 and the other is running OS X Lion.  The problem I'm having is that I'm unable to connect to my Win7 machine from the OS X machine using the Win7 machine's name. However, I'm able to ping the OS X machine from my Win7 machine using the hostname.


Python script that checks to see if a specific layer file exists in the current workspace and, if it does, converts the layer file to a KML file. Does it work with a shapefile?  Code so far:  for file in arcpy.ListFiles("cities.shp"):     desc = arcpy.Describe(file)     #print "Name: " + desc.BaseName     name = desc.baseName      if name == "cities.shp":          arcpy.LayerToKML_conversion("cities.shp", "cities.kmz")          print "Converted"     else:         print ("There are no layers in ",env.workspace,".")

I was trying to convert all the shp in a folder into kml.  featureclasses = arcpy.ListFeatureClasses() for fc in featureclasses:  # Set Local Variables   composite = 'COMPOSITE'   pixels = 1024   dpi = 96   clamped = 'CLAMPED_TO_GROUND'   scale = 1   outKML = fc[:-4] + ".kmz"   arcpy.LayerToKML_conversion(fc,outKML, scale, composite,'', pixels, dpi, clamped)   It always says Failed to execute. Parameters are not valid. ERROR 000732: Layer: Dataset ZZZ.shp does not exist or is not supported Failed to execute (LayerToKML). But I can manually do it within ArcMap 10.1 Desktop...


I hope i would get logical answers. I  request to post it as soon as possible.

What are 5' and 3' in DNA and RNA strands? Please clarify with some images and please use simple English.


Reopen note:  This question has been marked as a duplicate of a question about so-called weather-it. This question here has nothing to do with weather it. It seems from one of the answers that it might be from an extraposition construction, or from a referential usage. This has nothing to do with 'weather-it' at all.    Question:  Is the word 'It' in:        It's a pity       a pronoun? Or does it just serve as a filler because otherwise there isn't a subject in the sentence?   Is the situation different in the sentence:   It's a pity you cannot come.

I wanted to leave the question title as is so as not to take away from my amusement :).  Anyway,     It's raining.   What is raining? Is it the sky? The clouds? The weather? The rain? What is "it"? Any historical insights on the statement?


The Dirac Lagrangian $$\mathcal{L} = i\bar{\psi}\gamma^{\mu}\partial_\mu \psi - m \bar{\psi}\psi$$ gives a Hamiltonian $$\mathcal{H}(\Pi,\bar{\Pi},\psi,\bar{\psi})=\Pi \dot{\psi}-\mathcal{L}=-\bar{\psi}\gamma^{i}\partial_i \psi + m \bar{\psi}\psi,$$ $$\text{where}\quad  \Pi=i\bar{\psi}\gamma^0.$$ So the Hamiltonian is actually independent of $\Pi,\bar{\Pi}$. Suppose I wanted to start from this Hamiltonian and tried to find the equations of motion via Hamilton's equations $\dot{\psi} = \partial\mathcal{H}/\partial \Pi$ and $\dot{\Pi} = -\partial\mathcal{H}/\partial \psi$, plus equivalent ones for conjugate field.  Clearly something is wrong as the first of Hamilton's equations gives $\dot{\psi}=0$, while the second gives $\dot{\Pi}=i \partial_i\bar{\psi}\gamma^i +m\bar{\psi}$ and I don't see the Dirac equation popping out...

Let us consider Dirac equation $$(i\gamma^\mu\partial_\mu -m)\psi ~=~0$$ as a classical field equation. Is it possible to introduce Poisson bracket on the space of spinors $\psi$ in such a way that Dirac equation becomes Hamiltonian equation   $$\dot{\psi}~=~\{ \psi,H\}_{PB}~?$$  Of course, such Poisson bracket would be graded (super Poisson bracket), but if it exists this would explain on classical level why $\frac{1}{2}$-spinors correspond to fermions.


$$\lim_{(x, y)\to(0, 0)}\frac{x^2\cdot y}{x^2 + y^3}$$ I was trying to find two paths along x-y plane that when followed lead to different limits, but I always got 0.

Find multivariable limit of: $$\lim_{ \left( x,y\right) \rightarrow \left(0,0 \right)}\frac{x^2y}{x^2+y^3}$$ How to find that limit? I was trying to do the following, but i am not able to find a proper inequality: $$| \frac{x^2y}{x^2+y^3} | = |y-\frac{y^4}{x^2+y^3}| \le$$


In Javascript how to clone an object where one or more object properties point to a function ?  JSON.parse(JSON.stringify(object))    The above does not work because in the course of stringify it loses the reference to the function.

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.


Find $$\int_0^2 \arctan(\pi x)-\arctan(x)\, \mathrm dx$$  The hint is also given : Re-write the Integrand as an Integral  I think we have to Re-write  this single integral as a double integral and then do something.  Any one any ideas

Hint given: Write the integrand as an integral.  I'm supposed to do this as double integration.  My attempt:   $$\int_0^2 [\tan^{-1}y]^{\pi x}_{x}$$  $$= \int_0^2 \int_x^{\pi x} \frac { \mathrm{d}y  \mathrm{d}x} {y^2+1}$$  $$= \int_2^{2\pi} \int_{\frac{y}{\pi}}^2 \frac { \mathrm{d}x  \mathrm{d}y} {y^2+1}$$  $$= \int_2^{2\pi} \frac { [x]^2_{\frac{y}{\pi}}  \mathrm{d}y } { y^2+1}$$  $$= \int_2^{2\pi} \frac { 2- {\frac{y}{\pi}}  \mathrm{d}y } { y^2+1}$$  Carrying out this integration, I got, $$2[\tan^{-1} 2 \pi - \tan^{-1} 2] - \frac {1}{2 \pi} [\ln \frac {1+4 {\pi}^2} {5}]$$  But I'm supposed to get $$2[\tan^{-1} 2 \pi - \tan^{-1} 2] - \frac {1}{2 \pi} [\ln \frac {1+4 {\pi}^2} {5}]+ [\frac {\pi-1}{2 \pi}] \ln 5$$  Can someone please explain where I'm wrong? I've failed to pinpoint my mistake. Thank you.


From request  I receive an answer like this:      "\"1   \u0410\u0441\u043a\u043e\u043b\u044c\u0434\u0456\u0432\u0441\u044c\u043a\u0438\u0439".   For request I'm using:  HttpWebRequest request = (HttpWebRequest)WebRequest.Create(FullRequestString);     request.Method = "GET";   I receive response by the construction:  HttpWebResponse response = (HttpWebResponse)request.GetResponse(); using (Stream stream = response.GetResponseStream())  {   using (StreamReader reader = new StreamReader(stream))    {    string line = "";    while ((line = reader.ReadLine()) != null)     {   How can I transform the character like \u043b into cyrillic symbol

Say you've loaded a text file into a string, and you'd like to convert all Unicode escapes into actual Unicode characters inside of the string.   Example:     "The following is the top half of an integral character in Unicode '\u2320', and this is the lower half '\U2321'."


Im a  Nigeria leaving in italy and i have permanent permit of stay and im married to italian citizen can i travel to uk with out visa

I have an Italian permesso di soggiorno and I want to join my husband in the UK. My baby and my husband are Italian nationals. Can I travel with them with only the permesso di soggiorno?


Yes, there are many threads seeking book recommendation on multivariable calculus. Me personally enjoyed "Differential and Integral calculus - Piskunov" and looking something similar in writing on multivariable calculus at any level (intermediate to advance)  Any recommendation will be appreciated.

Due to my ignorance, I find that most of the references for mathematical analysis (real analysis or advanced calculus) I have read do not talk much about the "multivariate calculus". After dealing with the single variable calculus theoretically, it usually directly goes to the topic of measure theory.    After reading the wiki article "", I'd like to find the rigorous proof for this test. The first book comes to my mind is Courant's Introduction to Calculus and Analysis which includes the multivariate case in the second volume.   Motivated by this, I'd like to put the question here:     What are the usual references for the   theoretical treatment for   ?


Is it possible to group all objects at once to their background (If all selected at once)?  For "Asset Export"when exporting huge amount of icons.    Otherwise i have to select every object, like this to group it to its background.    Thanks in advance,

I have a .dwg (AutoCad file) map full of fields (rectangles) that I'm manipulating with Illustrator. Each rectangle has a text inside it that indicates its number. The problem is that there is no association between the rectangle and its number and that's what I'm trying to do. Also the order or drawing is not the same, when I check the layers.  Is there a way with Illustrator that can group each rectangle to the text inside it and this for all the fields? It is possible manually, but impossible to do it for every single field: about 40,000 rectangles.   I guess the approach should have something to do with "closeness" since it's the only data that tells us the correspondence between a rectangle and its number.


I've got python where an assignment to a specific 2d list in python is updating multiple elements and I don't know why.  I'm not looking for a better way to do things as much as I'm trying to understand what is going on here so I get my mistake before just doing something else.  Below is the code and beneath it snippet of what gets printed out after a couple loops.  Notice that with each assignment to an index, the tuple being assigned to that index is written to multiple locations in the 2d list. I don't even know how that is possible.  num_list = [] for num in range(32, 43, 1):     num_list.append((str(num), chr(num) + " ")) print print "num_list:" print num_list print  cols = 4 rows = len(num_list) / cols  arry2d = [[("a","b")] * cols] * (rows+1) print ("arry2d after initialization") print arry2d print   for i, item in enumerate(num_list):         print "i: " + str(i),         print "row: ", i / cols,         print "column: ", i % cols,         print "contents before update: ", arry2d[i / cols][i % cols]         print "item: ", item         print "array 2d after update with item: ", item         arry2d[i / cols][i % cols] = item         print arry2d ----------------------------------------------------   Output  num_list [('32', '  '), ('33', '! '), ('34', '" '), ('35', '# '), ('36', '$ '), ('37', '% '), ('38', '& '), ('39', "' "), ('40', '( '), ('41', ') '), ('42', '* ')]  arry2d after initialization [[('a', 'b'), ('a', 'b'), ('a', 'b'), ('a', 'b')], [('a', 'b'), ('a', 'b'), ('a', 'b'), ('a', 'b')], [('a', 'b'), ('a', 'b'), ('a', 'b'), ('a', 'b')]]  i: 0 row:  0 column:  0 contents before update:  ('a', 'b') item:  ('32', '  ') array 2d after update with item:  ('32', '  ') [[('32', '  '), ('a', 'b'), ('a', 'b'), ('a', 'b')], [('32', '  '), ('a', 'b'), ('a', 'b'), ('a', 'b')], [('32', '  '), ('a', 'b'), ('a', 'b'), ('a', 'b')]] i: 1 row:  0 column:  1 contents before update:  ('a', 'b') item:  ('33', '! ') array 2d after update with item:  ('33', '! ') [[('32', '  '), ('33', '! '), ('a', 'b'), ('a', 'b')], [('32', '  '), ('33', '! '), ('a', 'b'), ('a', 'b')], [('32', '  '), ('33', '! '), ('a', 'b'), ('a', 'b')]]

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


i wanted to install ubuntu and windows alongside but I accidently installed Ubuntu 13.10 using the option "LVM" although i've not selected erase disk and fresh install. Now my systems boots direclt into Ubuntu and I'm unable to see my Windows files on hard drive so I'm unable to access my old data (documents, movies, music, pictures) stored on Windows 8? Can someone help me to bring back my old Windows?

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


Are we allowed to use (') to express possession  or is it incorrect usage?  For example     My parents's wealth is precious to me<

What is the possessive of a noun ending in ‑s?  Are these both right, or is the second one wrong?   the boys' books the boss' car


This is a question following . I pictured all the points of:  $$C = \{x\times 0 \mid 0<x<1\}$$  as a subset of the ordered square. (the question asks me to find the closure)  I calculated its limit points, which are $[0,1)\times 1$, andthe points of $C$, which are $(0,1)\times 0$. In order to calculate the closure (which is what the exercise asks, I need to unite the limit points with the set). Brian told me that $\langle 1,0\rangle$ is also a limit point, but I can't see why:  Look at the image below:   If I take an open set around $\langle 1,0\rangle$, there's no intersection with $C$, which are the points that lie on the ground, that is, the points on $(0,1)\times 0$

I need to find the closure of these sets on the ordered square: $$A = \{(1/n)\times 0 | n\in \mathbb{Z}_+\}$$ $$B = \{(1-1/n)\times \frac{1}{2}| n\in \mathbb{Z}_+\}$$ $$C = \{x\times 0 | 0<x<1\}$$ $$D = \{x\times \frac{1}{2}| 0<x<1\}$$ $$E = \{\frac{1}{2}\times y | 0<y<1\}$$ I know that the closure is just the set itself united with its limit points. For $A$, the set of limit points, I imagine, are $\{<1,0>\}$, that is, the $x$ coordinate is $1$ and the $y$ is $0$. But  is says the reverse. What am I getting wrong? Following the same reasoning, $B' = \{<1,\frac{1}{2}>\}$ $C' = \{<0,0>,<0,1>\}$ What am I doing wrong?


In other words, given a group $G$, is there a construction that produces a group $H$ such that $Aut(H) \cong G$?

Suppose $G$ is a group. Does there always exist a group $H$, such that $\operatorname{Aut}(H)=G$, i. e. such that $G$ is the automorphism group of $H$?  EDIT: It has been pointed out that  the answer to the above question is no. But I would be much more pleased if someone could give an example of such a group $G$ not arising as an automorphism group together with a comparatively easy proof of this fact.


\documentclass[12pt,halfparskip]{scrartcl}  \usepackage[style=authoryear, citestyle=authoryear, sortcites=true,sorting=nyt,backend=biber,pagetracker=true,ibidtracker=constrict, maxcitenames=2]{biblatex}  \DefineBibliographyStrings{german}{urlseen = {zuletzt abgerufen am}, } \DeclareDelimFormat{finalnamedelim}{\addspace\&\space}    \begin{document}  \footcite[53\psq]{Klett2015}  \end{document}   .bib file          @Book{Klett2015,    title =     {Lambacher Schweizer -- Mathematik Qualifikationsphase Grundkurs},    publisher = {Ernst Klett Verlag},    year =      {2015},    author =    {Baum, Manfred AND Bellsted, Martin AND Brandt, Dr. Dieter AND Buck, Heidi AND Dürr, Prof. Rolf AND Freudigmann, Prof. Hans AND Greulich, Dieter AND Haug, Dr. Frieder AND Jörgens, Thomas AND Jürgensen-Engl, Thorsten AND Riemer, Dr. Wolfgang AND Sandmann, Rüdiger AND Schmitt-Hartmann, Reinhard AND Sonntag, Raphaela AND Spielmans, Heike AND Wollmann, Alexander AND Zimmermann, Dr. Peter AND Zinser, Prof. Manfred},    address =   {Stuttgart}}   I've tried to make a MWE (I don't how to input only one reference without an extra file). Unfortunately only the book 'Klett2015' doesn't work with \footcite. I get this:   maxcitenames doesn't seem to be considered. Any ideas? Appreciate your help!

In the header of my document I set the maximal author names to 2:  \usepackage[style=authoryear-icomp, maxbibnames=9, maxcitenames=2, backend=biber]{biblatex}   Now, when I cite texts with two authors, LaTeX gives me the following:     (Author_A/ Author_B 2012: 232)   When I have three authors or more, LaTeX makes it:     (Author_A/ Author_B et al. 2012: 232)   But I want LaTeX to just name the first author if there are more than two authors ... like this:     (Author_A et al. 2012: 232)   Any tips on how to achieve this ?


I'm experiencing difficulties with OAI harvesting.  keeps failing with the following error:  org.springframework.web.util.NestedServletException : Request processing failed; nested exception is java.lang.NullPointerException   I ran all OAI related commands properly, which suggests that the problem comes from my DSpace. I haven't been able to identify the source of the errors because my log files aren't showing me anything unusual.  How can I go about tracking down the source of this issue?

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 always wondered why isn't the Earth shrinking or melting because of the core.

I'm sorry if the answer is obvious for you guys, but why don't we all (including buildings, road, people, the ground) collapse to the center of the earth because of gravity? Is it because we have velocity, just like the earth not falling to the sun (or electrons not falling to the protons)? But that analogy doesn't sound right because those involve wide empty space.


What are some good books with the help of which I can self-study Bayesian from the basics to advanced, mentioning why do we need Bayesian and also which contains numericals, which can boost my concept. I know the basics of Bayes theorem and conditional, but when it comes to Bayesian my knowledge is very abstract. So it would be very helpful if I am suggested a good book which I can download online. Thank You.

Which is the best introductory textbook for Bayesian statistics?  One book per answer, please.


I got this error:  (bleachbit:5510): IBUS-WARNING **: The owner of /home/niider/.config/ibus/bus is not root!

I've read  and am interested in this line:     You should never use normal sudo to start graphical applications as Root.   Why? What is the difference? Please provide a simple explanation, as I'm just a normal desktop user.


I am trying to test a web-application, using python, I am new in python so don't know much Python testing tools, i have written tests in Selenium/Pink/Behat in the PHP world, Now i have to use python for Behavior-Driven-Development (BDD), I have been looked Google, but I couldn't really get a definitive answer. can any one please suggest me best python testing tool, like Behat.  Thanks in Advance

Which are the most advanced frameworks and tools there are available for python for practicing Behavior Driven Development? Especially finding similar tools as rspec and mocha for ruby would be great.


Looking for short story probably golden age about a father that enrolls his child in a school for psychic genius mutants.  He is a latent mutant so he is able to see the secret writing the school uses.  The school is part of an effort to fast track evolution in the human race because of fears of an alien invasion that is also evolving quickly.

I read this somewhere in the early 1990s in a science fiction anthology, I think. The protagonist is a man with a young son. He learns that some of the books that his son has are written in language that he and his son can understand, but most people cannot. He eventually meets the people behind the books and it's explained that the books are written in a way such that only mutants can comprehend it, but that they all also had further talents. He's tested, and it's revealed that his only talent is being able to read the script. Near the end of the story, all of the mutants are going somewhere else (another planet?) and he's told that he cannot join them, but that they would provide a replacement for his son. It ends with him and his wife meeting the simulacrum and finding it indistinguishable from the real thing.  The only other details I recall about it were that the place where the books came from could only be seen by mutants as per the language bit.


I have a laptop running Lubuntu 18.04, with a single hard drive as a bootable disk, and two partitions on it: EFI System Partition and a bigger partition contains everything else (e.g. / an /home).   $ sudo parted -l Model: ATA TOSHIBA MQ01ABF0 (scsi) Disk /dev/sda: 500GB Sector size (logical/physical): 512B/512B Partition Table: gpt Disk Flags:   Number  Start   End    Size   File system  Name                  Flags  1      1049kB  538MB  537MB  fat32        EFI System Partition  boot, esp  2      538MB   500GB  500GB  ext4   I want to separate / and /home in some way, so that messing up with / will have limited interference with /home. For example, I am considering to separate them  into  two different logical volumes using LVM, as suggested by Stephen Kill below. But it seems that , so what shall I do now? (Besides the laptop, I have a Lubuntu bootable flash drive and another laptop also running Lubuntu 18.04).  $ sudo lvmdiskscan   /dev/sda1 [     512.00 MiB]    /dev/sda2 [    <465.26 GiB]    0 disks   2 partitions   0 LVM physical volume whole disks   0 LVM physical volumes  $ sudo pvcreate /dev/sda2   Can't open /dev/sda2 exclusively.  Mounted filesystem?   If I can afford to reinstall Lubuntu on the laptop, will reinstalling the OS help to separate / an /home into different logical volumes? How shall I do exactly?   If I don't want to reinstall Lubuntu on the laptop, what shall I do then?  Did telcoM and Stephen Kitt recommended  the same? What are the steps so that  I   can follow their suggestions  respectively?  :     The problem is that you cannot just add LVM to an existing non-LVM   partition. You would have to shrink your existing partition as much as   you can, then create a new partition to be used as a LVM PV, create   the LV(s) you desire into it, copy the data, update your boot   configuration and initramfs to be aware of LVM, then boot to the LVM   version of the system, and then either repurpose the old non-LVM   partition as a second LVM PV on the same disk and add it to the   existing VG, or remove it and resize the only LVM PV on the disk.        On bootable disks, I have whatever partitions are needed to boot the   system (such as the ESP on EFI systems, or /boot on BIOS or U-boot   systems), and one big partition occupying all the available space,   which is used as a PV in LVM.      you can have one partition for the ESP, and another partition which   you use with LVM: that large partition (/dev/sda2) is a PV, used in a   VG, containing however many LVs you want (one for / and one for /home)

Right now, I have everything in a partition (except EFI system partition). How can I split the partition into two, one for / and one for /home?   How would you use parted to do that step by step?  How would you use gparted to do that step by step?  How would you use LVM to do that step by step?   One thing I am not sure of is that I can't just shrink the partition and create a second partition on the space that is freed by shrinking, because that doesn't move /home to the new partition.  Thanks.    $ sudo parted -l [sudo] password for t:  Model: ATA TOSHIBA MQ01ABF0 (scsi) Disk /dev/sda: 500GB Sector size (logical/physical): 512B/512B Partition Table: gpt Disk Flags:   Number  Start   End    Size   File system  Name                  Flags  1      1049kB  538MB  537MB  fat32        EFI System Partition  boot, esp  2      538MB   500GB  500GB  ext4  $ sudo df -h [sudo] password for t:  Filesystem      Size  Used Avail Use% Mounted on udev            1.7G     0  1.7G   0% /dev tmpfs           340M  1.4M  338M   1% /run /dev/sda2       457G  6.7G  428G   2% / tmpfs           1.7G   27M  1.7G   2% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           1.7G     0  1.7G   0% /sys/fs/cgroup /dev/sda1       511M  6.1M  505M   2% /boot/efi tmpfs           340M   20K  340M   1% /run/user/1000 tmpfs           340M     0  340M   0% /run/user/106


i don't know about the Cayley-Hamilton, soooo how can i prove this?

Given an $n\times n$ upper triangular matrix $A$ with zero on main diagonal, show that $A^n = 0$.   I did some matrix operation and noticed that the diagonal moves up, ultimately all entries will be zero. Is there a nicer way to do it?


I use a desktop with a 4GB Ram and Intel Pentium Gold Processor. Can I run Ubuntu 20.10 smoothly on the desktop?

Does anyone know what are the minimum requirements to install Ubuntu 20.10?


What is the structure of "the higher a mountain" in the following sentence? And what does it mean?  As a general rule, the higher a mountain is, the more recently it was formed.

a) The more I study, the less I learn. b) More I study, less I learn.  Could we rewrite the sentence shown under the letter a) in the form shown under the letter b) without breaking any grammatical rule? If not, why not?


I have a client who would like their wordpress permalinks to look like this:   /%category%/%state%/%city%/%street%/   I can get this information easily enough with custom meta data in the post editor, but I'm at a loss to see a method for creating custom permalink tags. Can anyone tell me how this might be achieved?  Cheers!

I have publications and I want to simply add year and month to the permalink. Currently the year and month of publication is added to the post as a meta value. I've set up publications as a custom post type and created taxonomy for the specific title of the publication. I would like the permalink to be:  publications/publication-title/year-published/month-published/name-of-post  I simply want to add the meta values for the publication year and month to the permalink.   So far, I've been able to pull the year and month published and add it to the url but unfortunately I keep getting a 404 when I try to access posts. I think I'm taking a wrong turn with one of my steps below ...  Any help would be appreciated.  These are the steps I did in the following order:   Since I was adding publication-year and publication-month to the url, I was reading that I had to make WordPress aware of these custom querystring variables. I added the following functions to register these custom variables:  function pubyear_register_rewrite_tag() {       add_rewrite_tag( '%pubyear%', '([0-9]{4})');   }    add_action( 'init', 'pubyear_register_rewrite_tag');  function pubmonth_register_rewrite_tag() {      add_rewrite_tag( '%pubmonth%', '([0-9]{2}');   }    add_action( 'init', 'pubmonth_register_rewrite_tag');    2) Added the year and month to the permalink structure:  add_filter('post_type_link', 'pub_term_permalink', 10, 4);  function pub_term_permalink($permalink, $post, $leavename, $sample) {     if ( false !== strpos( $permalink, '%publication-title%/%pubyear%/%pubmonth%' ) ) {       //get the publication-title      $publicationtype = get_the_terms( $post->ID, 'publication-type' );       //get the year of the publication      $pubyear = date('Y', get_post_meta($post->ID, 'pub_date', true));       //get the month of the publication      $pubmonth = date('m', get_post_meta($post->ID, 'pub_date', true));       $rewritecode = array(          '%publication-type%',          '%pubyear%',          '%pubmonth%',          $leavename? '' : '%postname%',      );       $rewritereplace = array(          array_pop($publicationtype)->slug,          $pubyear,          $pubmonth,          $post->post_name      );       $permalink = str_replace($rewritecode, $rewritereplace, $permalink);       }     return $permalink; }   3) Add rewrite rules:  function pub_add_rewrite_rules() {       add_rewrite_rule(  '^([^/]*)/([0-9]{4})/([0-9]{2})/([^/]+)?', 'publications/index.php?pagename=$matches[3]', 'top' );   }    add_action( 'init', 'pub_add_rewrite_rules' );   4) Made sure the custom post type is registered and includes this rewrite array:  'rewrite' => array     (             'slug' => 'publications/%publication-type%/%pubyear%/%pubmonth%',     'with_front' => false          ),


The question is from Schaum's Outline of Complex numbers  Provided that $\lim \limits_{n\to \infty} u_n=l$, prove that $\lim \limits_{n\to \infty} \frac{\sum_{k=1}^nu_k}{n}=l$  This is how I have gone about it  $|\frac{\sum_{k=1}^nu_k}{n}-l|$  $=|\frac{\sum_{k=1}^n (u_k-l)}{n}|$  $\le \frac{1}{n}\sum_{k=1}^n|u_k-l|$  Now, since $\lim \limits_{n\to \infty} u_n=l$, $\lim \limits_{n\to \infty} (u_n-l)=0 $ $\to \lim \limits_{n\to \infty} |u_n-l|=0$  I know that this is a necessary condition for $\sum_{k=1}^n|u_k-l|$ to converge, but not a sufficient one. If it does converge, then we are done, since we can say that $\sum_{k=1}^n|u_k-l|=S$, where $S$ is finite, so $|\frac{\sum_{k=1}^nu_k}{n}-l| \le \frac{1}{n}\sum_{k=1}^n|u_k-l|=\frac{S}{n}$, so if $\frac{S}{n}<\epsilon$ i.e $n>\frac{S}{\epsilon}$, then $|\frac{\sum_{k=1}^nu_k}{n}-l|<\epsilon$  The problem is I don't know how to show that $\sum_{k=1}^n|u_k-l|$ actually converges.  Any help would be appreciated, thank you.

Let $a_k\geq 0$ be a non-increasing sequence satisfying $\lim_{k\to\infty} a_k = 0$. Is it always true that $$\lim_{n\to\infty} \frac{\sum_{k=1}^n a_k}n=0$$ ?  I tried proving with "brute force" but failed: Let $\varepsilon>0$. Then there exists a $K\in\mathbb N$ such that $a_k\le\varepsilon$ for all $k\geq K$. Let $C=\sum_{k=1}^K a_k$. We have $$\frac{\sum_{k=1}^{\left\lceil\frac C\varepsilon\right\rceil}a_k}{\left\lceil\frac C\varepsilon\right\rceil}=\frac{C}{\left\lceil\frac C\varepsilon\right\rceil}+\sum_{k=K+1}^{\left\lceil\frac C\varepsilon\right\rceil} a_k\le \varepsilon +\varepsilon\cdot\left( \left\lceil\frac C\varepsilon\right\rceil-K\right).$$  However, this is not good, as the right-hand side depends on $C$, which can get large for small $\varepsilon$.   Also, numerical computations for example with $a_k=\frac1{\log\log k}$ seem to confirm the statement though...  (Additionally, note that I didn't use the non-increasing fact, but I am not sure if it is needed.)


I have a function in Java, but I'm trying to return 3 elements from a function, but so far no luck.  public String retrieveStudentInfo() {     String name = "Miley";     String grade = "56"     String ID = "1043"     return name,grade,ID; //trying to return all the elements in this function. }   based on the function above, I'm trying to return the name,grade and ID at the same time, through a variable like below:  String getStudentInfo = this.retrieveStudentInfo();   Could anyone please help me on this. I've specified the return data type as String but it wouldn't let me return them.

I want to return two objects from a Java method and was wondering what could be a good way of doing so?  The possible ways I can think of are: return a HashMap (since the two Objects are related) or return an ArrayList of Object objects.  To be more precise, the two objects I want to return are (a) List of objects and (b) comma separated names of the same.  I want to return these two Objects from one method because I dont want to iterate through the list of objects to get the comma separated names (which I can do in the same loop in this method).  Somehow, returning a HashMap does not look a very elegant way of doing so.


Singular possessive   Jones's glasses My lawyer's fee   Plural possessive   The Joneses' house Their lawyers' fees   1) Are these possessive forms correct? 2) Is there any difference in the pronunciation between each pair of words?

Many questions already ask about this topic ( , , etc.) and their answers vary, but they always give exceptions to the apostrophe-s rule, for example:      6.24 The general rule for the possessive of nouns covers most proper nouns, including most names ending in sibilants."   Examples they give include Kansas’s, Ross’s land, and Jones’s reputation. Exceptions include Jesus’  and Moses’.  Which names does this apply to?  Is the Aeneas’  form correct, or is it Aeneas’s instead?


I am new to Python, but I have experience in other OOP languages. My course does not explain the main method in python.   Please tell me how main method works in python ? I am confused because I am trying to compare it to Java.   def main(): # display some lines  if __name__ == "__main__": main()   How is main executed and why do I need this strange if to execute main. My code is terminated without output when I remove the if.  The minimal code -   class AnimalActions:     def quack(self): return self.strings['quack']     def bark(self): return self.strings['bark']  class Duck(AnimalActions):     strings = dict(         quack = "Quaaaaak!",         bark = "The duck cannot bark.",     )   class Dog(AnimalActions):     strings = dict(         quack = "The dog cannot quack.",         bark = "Arf!",     )  def in_the_doghouse(dog):     print(dog.bark())  def in_the_forest(duck):     print(duck.quack())  def main():     donald = Duck()     fido = Dog()      print("- In the forest:")     for o in ( donald, fido ):         in_the_forest(o)      print("- In the doghouse:")     for o in ( donald, fido ):         in_the_doghouse(o)  if __name__ == "__main__": main()

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


I installed Ubuntu 16.05 alongside Windows 10 on a Dell Inspiron 3543 laptop. Installation was successful, but could not get the WiFi connected to the internet.  I can see my SSID being displayed on the drop down menu, but WiFi doesn't work after I click it and enter the WiFi password. The WiFi icon is displayed with an "empty WiFi" sign.    How can I fix this so that I can access the internet?  I followed instruction from the duplicate page step by step and still have the issue.

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.


How can I typeset a big summation with index next to it (like that one in the photo below) instead of an index in the bottom ?! . I need help please :) .

I'm very familiar with how symbols display differently in inline mode (with $ ... $) vs. how display math shows them (with \[ ... \] or $$ ... $$).  Two examples would be with limits  $\lim_{n\rightarrow \infty}f(x)$   vs.  \[ \lim_{n\rightarrow \infty}f(x) \]   and with sums  $\sum_{n=1}^{x} n^2$   vs.  \[ \sum_{n=1}^{x} n^2 \]   My Question is:     How do you display these things in inline mode (with all the nice inline formatting) as if they were in display mode ?   The inverse -- how to display things in display mode as if they were in inline mode -- is also of interest.


I have an embedded device running a linux environment built with Yocto.  I have both openssh-server and nginx running, both of which take 1 minute to start because they are waiting on enough entropy:  From dmesg: 56.338824] random: crng init done  uname: Linux beaglebone 5.0.12-jumpnow #1 Wed Sep 25 22:09:50 UTC 2019 armv7l GNU/Linux  Is there any way I can speed up this process?  Perhaps cache some entropy between reboots?  There is no mouse or keyboard, and may be very little to no network traffic for faster entropy generation.

When I log in with LightDM on my laptop running Debian Unstable, it recently started to hang for around 2 minutes until journalctl shows the message kernel: random: crng init done. When I press random keys on my keyboard while it hangs, it logs in faster (around 10 seconds). Before I didn't have this issue, is there any way I can fix it?  Edit: using linux-image-4.15.0-3-amd64 instead of linux-image-4.16.0-1-amd64 works, but I don't want to use an older kernel.


i created a field called : (sitename_ar) and i have two rows (two domains) in  {domain} field :  and i have in my database these two fields {node} and {domain_access} :   and i want display in view page: node : Title node : Domain (sitename_ar) i have created a view and i added a Title field and a Global:php field to call rows from database :  and i addedd those lines :  but always it display the same field (the first row) :  How i can Join all those 3 fields and display for each node her domain (with sitename_ar)

I have a view that's generating a block showing upcoming events. On the main site those events might be coming from multiple domains (the site is using Domain Access) and I'd like to show the domain owner as a link to their site sub-domain.  Example:  Aug. 14 - Sample Event Domain Owner (http://owner.mydomain.com)   Is there a way that I can add this directly to the view? If not, what is the most effective/correct method for coding that into a view template override?


I have maybe a simple question. Here two code-snippets to show what I mean:  Example 1:  public interface SomeInterface{   public void someMethod(...); }   Example 2:  public interface AnotherInterface{   void anotherMethod(...); }   So, Example 1 is completely clear to me but Example 2 isnt.    In fact, is there any difference between those two examples expect the public-modifier?     On one hand I found that methods from Interfaces are implicitly public but on the other hand I have found that methods declared in an Interface are "package-public" (I dont now if thats the correct description) - saying these are visible to all classes in the same package as the Interface. For now I am completely confused.. So could someone please explain me whats right?  Thanks anyways.

Should methods in a Java interface be declared with or without the public access modifier?  Technically it doesn't matter, of course. A class method that implements an interface is always public. But what is a better convention?  Java itself is not consistent in this. See for instance Collection vs. Comparable, or Future vs. ScriptEngine.


i have made a little "Support Ticket" system but i have a little problem.  If you add ' to the textarena it does not send data to database.  PHP:  <?php    if(isset($_POST['submit'])) {    $subject = $_POST['subject'];   $message = $_POST['message'];   $steamid = $_SESSION['steamid'];    $message = htmlspecialchars( str_replace('','',$message) );   $subject = htmlspecialchars( str_replace('','',$subject) );    $date = date('d.m.Y, G:i');    $db -> query("INSERT INTO tickets (userId, subject,message, status, date) VALUES ('".$steamid."', '".$subject."', '".$message."', '1', '".$date."') ");  }  ?>   HTML:  <form action="support" method="POST">   <input maxlength="50" type="text" class="form-control" name="subject" placeholder="Subject..." style="margin-top:10px" required>   <textarea maxlength="500" name="message" class="form-control" placeholder="Your message..." style="margin-top:10px" required></textarea>   <input type="submit" class="btn btn-success" name="submit" style="margin-top:10px" value="Submit" /> </form>   I were wondering if the problem is because of $message = htmlspecialchars( str_replace('','',$message) );  FIXED:  I added this $message = mysql_real_escape_string($_POST['message']);

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


Who gave Harry Potter his scar, and how did it come in the shape of a lightning bolt? Does it hurt often?

Why does Harry have a scar when Avada Kedavra leaves no trace?     ‘The Muggle authorities were perplexed. As far as I am aware, they do not know to this day how the Riddles died, for the Avada Kedavra Curse does not usually leave any sign of damage ... the exception sits before me,’ Dumbledore added, with a nod to Harry’s scar.   Half-Blood Prince - page 343 - Bloomsbury - chapter 17, A Sluggish Memory   What caused Harry to retain a scar from Avada Kedavra, when no one else in know history showed any signs of cause of death when Avada Kedavra was used?  What caused Harry's scar?  I'd love an answer based in canon, such as the books, interviews with J.K. Rowling, or Pottermore.


I don't have much experience generating vector tiles dynamically. Instead I use Tippecanoe.  I'm looking at generating tiles from PostGIS and see at least three options:   PostGIS + Geoserver (with vector tiles extension) PostGIS + Tegola PostGIS, using its own native  function.   So: What is the benefit of using an additional layer on top of PostGIS rather than its own direct support for vector tile generation?

I was trying  and  I was setting up Tomcat and all.   I suddenly had a question ... why do we need MapServer and GeoServer?   Can these servers pull data from the database layer as the user asks and only presenting what user has asked from the database?


We are a software publisher. Our installer EXEs are signed with our code signing certificate issued by Thawte. Recently, our installers are being flagged as "####.exe is not commonly downloaded and could be dangerous" --the call-to-action being discard.  These files do not have any malware in them. VirusTotal lists no error for the files. These files were created newly but were signed using our certificate that is in use for the past 1 year  On what grounds is Chrome flagging this as "dangerous". How many downloads does it need to be completed before it is no more "uncommon"?  How can we prevent such a dialog from appearing in the future?

I'm a software developer, and I'm trying to publish some open source software on my site. My software is designed for Windows users, so I want to use a single file "setup.exe" or something likewise.  I currently have a test application and I've created an installer with: "Inno Setup 5" (I'm not attached to that program, so if you know a better one I'll try that) and published it on my site (here).  But when I try to download it chrome says:"setup.exe is not commonly downloaded and could be dangerous." this scares away people, and I can't have that. And when I do confirm that I want to keep it (by clicking the small arrow on the side) and I install it, Windows (SmartScreen) says:"Windows protected your PC".  I need to get rid of both these errors, and I can't find a working solution. Please help.


I have been reading about black holes in Stephan Hawking's 'A Brief History of Time'. Then I was reading more about it on Wikipedia; I am making a school project on it. I do not really remember what made me ask this question, ie. whether all black holes have the same mass density. But, then I also saw (or saw again, because that book has it too) the 'No-Hair Theorem' which states that 'all black hole solutions of the Einstein-Maxwell equations of gravitation and electromagnetism in general relativity can be completely characterized by only three externally observable classical parameters: mass, electric charge, and angular momentum.' - Wikipedia. So, it doesn't look like the mass-density with change for a black hole. Would it? Do all black holes have the same mass-densities or not?

How do scientists calculate that density? What data do they have to calculate that?


I saw That Prolog and Lisp are two languages that I should use if I want to create an Artificial intelligence software.  What so special with that both, that isn't with C++\C\C#? Its mean its more easier to create Artificial intelligence softwares with this? or there is really more functionality I can use for achieve my target, that with the others I have not.?

I've been learning Lisp to expand my horizons because I have heard that it is used in AI programming. After doing some exploring, I have yet to find AI examples or anything in the language that would make it more inclined towards it.  Was Lisp used in the past because it was available, or is there something that I'm just missing?


If I use SHA256 as a hash function, and I try all inputs starting from 0 to 2^256 (means all possible combination of 256-bit), then will it give me 2^256 unique output without any collision?      Or in other words, does 2^256 different inputs maps to 2^256 different output in SHA256?

It's been said that .  It the corresponding statement true for typical cryptographic hashes, like MD5, SHA-1, SHA-2 or SHA-3?  For example, would SHA-512 be bijective when hashing a single 512 bit block?


I developed an Angular application and I will consume the RESTful service developed using Java (JAX-RS - Jersey).  This is my service:  @POST @Path("/add") @Consumes(MediaType.APPLICATION_JSON) @Produces(MediaType.APPLICATION_JSON) public Response addNewContact(Contact instance) {     Contact contact = new Contact(instance.getLastName(), instance.getFirstName(), instance.getPhone_1(),             instance.getPhone_2(), instance.getEmail());     contact.setPicture("Unknown.png");     try {         dao.save(contact);         return Response.status(200).entity(contact).build();     } catch (Exception e) {         return Response.status(400).entity("IMPOSSIBLE D'AJOUTER CETTE PERSONNE").build();     } }   This is the config in web.xml :  <servlet>  <servlet-name>jersey-serlvet</servlet-name>  <servlet-class>     com.sun.jersey.spi.container.servlet.ServletContainer  </servlet-class>  <init-param>   <param-name>com.sun.jersey.config.property.packages</param-name>   <param-value>ma.restfull.services</param-value>  </init-param>  <init-param>   <param-name>com.sun.jersey.api.json.POJOMappingFeature</param-name>       <param-value>true</param-value>  </init-param>  <load-on-startup>1</load-on-startup> </servlet>  <servlet-mapping> <servlet-name>jersey-serlvet</servlet-name> <url-pattern>/api/*</url-pattern> </servlet-mapping>   My entity is this:   @AllArgsConstructor @NoArgsConstructor @Entity(name = "contact") public class Contact {  @Id @GeneratedValue private int id;  @Column(name = "first_name", length = 50, nullable = false, unique = false, updatable = true, insertable = true) @Getter @Setter private String firstName;  @Column(name = "last_name", length = 50, nullable = false, unique = false, updatable = true, insertable = true) @Getter @Setter private String lastName;  @Column(name = "phone_1", nullable = true, unique = false, updatable = true, insertable = true) @Getter @Setter private String phone_1;  @Column(name = "phone_2", nullable = true, unique = false, updatable = true, insertable = true) @Getter @Setter private String phone_2;  @Column(name = "email", nullable = true, unique = true, updatable = true, insertable = true) @Getter @Setter private String email;  @Column(name = "picture", nullable = true, unique = false, updatable = true, insertable = true) @Getter @Setter private String picture;  public Contact(String lastName, String firstName, String phone_1, String phone_2, String email) {     super();     this.firstName = firstName;     this.lastName = lastName;     this.phone_1 = phone_1;     this.phone_2 = phone_2;     this.email = email; } }   but, when I send the request I get this   the object sent by Angular is like this:   Object { lastName: "Nom", firstName: "Prénom", phone_1: "12346565464", phone_2: "1234567890", email: "aaa@aaa.com", id: 0, picture: "Unknown.png" }

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?