Multiple alias domains pointing to the same cPanel account are sharing the same .htaccess file. I need a domain-specific rule that redirects all traffic from aliasdomain.com to https://www.domain1.com only if:   HTTP_HOST is currently aliasdomain.com (with or without WWW and http/https) exclude folder /medias/ - it must still be accessible from aliasdomain.com exclude all *.jpg, *.jpeg, *.png and *.gif files (even if the files are in root of aliasdomain.com) always redirect to https://www.domain1.com root, no wildcard redirect and no redirect to non-ssl http domain1.com needs to be excluded so if the same .htaccess file is on domain1.com it won't interfere.   I tried to adapt various code snippets found on StackOverflow but failed horribly getting it to work :( I asked a question there but mods told me to ask on ServerFault instead so here i am... Help would be really appreciated!

This is a  about Apache's mod_rewrite.   Changing a request URL or redirecting users to a different URL than the one they originally requested is done using mod_rewrite. This includes such things as:   Changing HTTP to HTTPS (or the other way around) Changing a request to a page which no longer exist to a new replacement. Modifying a URL format (such as ?id=3433 to /id/3433 ) Presenting a different page based on the browser, based on the referrer, based on anything possible under the moon and sun. Anything you want to mess around with URL   Everything You Ever Wanted to Know about Mod_Rewrite Rules but Were Afraid to Ask!  How can I become an expert at writing mod_rewrite rules?   What is the fundamental format and structure of mod_rewrite rules? What form/flavor of regular expressions do I need to have a solid grasp of? What are the most common mistakes/pitfalls when writing rewrite rules? What is a good method for testing and verifying mod_rewrite rules? Are there SEO or performance implications of mod_rewrite rules I should be aware of? Are there common situations where mod_rewrite might seem like the right tool for the job but isn't? What are some common examples?   A place to test your rules  The  web site is a great place to play around with your rules and test them. It even shows the debug output so you can see what matched and what did not.


I am trying to grok the comma operator.  The  says:  In a comma expression E1, E2, the expression E1 is evaluated, its result is discarded (...), and its side effects are completed before evaluation of the expression E2 begins (...).  I am unable to grok the clause - "... the expression E1 is evaluated, its result is discarded (...), and its side effects are completed before...".  Specifically, what is retained and what is discarded? For e.g., in the example from : int x = 0; int y = some_number; for(; x < y; ++x, --y) {     // Do something which uses a converging x and y }  When we do a ++x, what is the 'result' (that is discarded) and what is the 'side-effect' (that is 'completed' and perhaps 'retained')?  Shouldn't the result of ++x be discarded and the value of x remain unchanged? Working example showing incrementation of x is . In other words, given a certain expression, how do I deduce if it will be evaluated and its results would be discarded, or if it is a side-effect and its results would perhaps be computed and retained?


The hyperoperation heirarchy in the naturals starts with addition, then multiplication, then exponentiation, then tetration, and so on. Each operation is defined as repeated application of the previous in the sequence. Here, we are defining 0^0, 0^^0, etc, x^0, x^^0, etc as 1. In a discussion on some online forum, someone was remarking that exponentiation satisfies the identity (x^y)^z=(x^z)^y but tetration does not. And of course, exponentiation fails to satisfy the commutative law. He wondered if this process keeps on happening as you ascend the hyperoperation heirarchy. So, what I would like to know is if the sequence of sets of identities of the hyperoperation heirarchy starting from multiplication, is strictly descending. By identities I mean universally quantified equations without constants. If anyone can link me to a paper on this or a similar topic, I would be immensely delighted.

A similar question was asked in .  A paper by Roberto Di Cosmo and Thomas Dufour () asserts in footnote 2 (p.3) that it has been shown "that there are no nontrivial equations for $⟨\mathbb{N}, \mathrm{Ack}(n, \_, \_)⟩$ if $n > 2.$" References make it clear that $\mathrm{Ack}(n,x,y)=H_{n+1}(x,y)$ in the , so the assertion is as follows:     $\text{There are no nontrivial equations for the binary function }(\_\uparrow^y\_)\text{ if }y>1\\ \text{ (i.e., for hyperoperations above exponentiation)}\tag{*}.$   (For this, the above paper cites Charles F. Martin, "Axiomatic bases for equational theories of natural numbers", Notices of the Am. Math. Soc., 19(7):778, 1972, which I have not found online.)  Q.1: What, precisely, is meant by a "nontrivial equation" here?  (The defining recursion $$x\uparrow^{y+1}(z+1)=x\uparrow^y (x\uparrow^{y+1}z),$$ which certainly holds for $y>1$, is evidently considered trivial.)  Q.2: Is the following a valid proof based on assertion $(*)$? ...  Claim:     If $x,y,z$ are integers $\gt 1$, then the value of $\ x\uparrow^y z\ $ uniquely determines $x,y,z$; i.e.,  $$x\uparrow^y z = x'\uparrow^{y'} z' \quad\implies\quad x=x',\ y=y',\ z=z'.\quad \tag{1}$$  (The purpose of restricting the domain to integers $>1$ is to remove obvious counterexamples that arise from equations like $x\uparrow (a\cdot z) = (x\uparrow a)\uparrow z\ \ $ or $\ \ 2\uparrow^y 2=4\uparrow^{y'} 1\ \ $ or $\ \ 1\uparrow^y z=1\uparrow^{y'} z'.$)  Proof:  Suppose, for the sake of contradiction, that there is a counterexample to $(1)$, in which the LHS of the implication holds but not the RHS. Then the LHS is a nontrivial equation for some hyperoperation(s) beyond exponentiation, which is impossible as per $(*)$. QED


Context : I simply add a image to the VSE and render an image in the original resolution and format here being PNG. Problem : The rendering of the image in the VSE changes colors as you can see on this picture :  The Right picture is the original and the left one is the vse rendered. We can clearly see that the colors have changed. Can anyone explain why this is happening ? And give a solution so that colored aren't changed. Thanks.

I already searched the internet but could not find a solution to this. Maybe it is the same question as  but there was no answer.  I want to render a video with tracking, but the output "loses" color information and gets kind of greyish. I first thought that it is related to the renderer, but it happens in Cycles and Eevee. Therefore i made a sample image, added it to the image sequence editor and rendered it as 1 frame. Resulting in the same problem.  I placed the original image beside blenders output so that you can see the difference. The only idea I came up with is that something with the lighting is not correct but I can't find a setting for that.  I am using Blender 2.80 with the default settings. Only set the output resolution to match the input resolution.


This may or may not be linked with the problem described in  (which is apparently site-wide, not just on Super User).  The site-wide activity page (https://stackexchange.com/users/USER-NUMBER/USER-NAME?tab=activity) which shows a summary of one's activity across all Stack Exchange sites seems not to be being updated.     I'm having trouble uploading an example image (imgur is rejecting the request): you can get to the page by clicking the icon/reputation/badges element in the top menu, then the Network Profile link to the top-right and then selecting the Activity tab.   My page shows my last activity as 22 hours ago, although I have answered at least one question and made a number of comments since then.

I  and while on other sites I did not get a 'Reputation Notification' to explain that I was given 2 upvotes for my answer - yet if I manually check my Profile here at meta.SE my total Reputation is in agreement with the amount there.  I'm not knowledgeable about the intercommunication between the servers and sites but I would explain it this way: Super User either failed to send or other sites failed to receive the message the I had a reputation update on Super User.  I should have received either two green star trophies (🏆) of 10 reputation each or one of 20; depending on when I returned to one of the Stack Exchange / Stack Overflow / Super User / etc. sites.  Here's a screenshot showing no reputation change notification for Super User:    Here's a screenshot of my Profile over at Super User showing that I was silently credited:    I'm bringing this up on Meta.SE in case the communication is broken between more sites than just Super User and everywhere else.


I get  this following scheme but it doesn't work in my laptop, i work using texmaker and miKteX 2.9, i always get the error I can't find tikzlibraryhobby.code.tex, i enter the package manager to install it but its not found, can anyone help me to download then install it?  \documentclass[tikz]{standalone} \usetikzlibrary{hobby,patterns}  \begin{document}  \begin{tikzpicture} \draw[thick,->] (52,0) -- (60,0) node[anchor=north west] {$x'$}; \draw[thick,->] (56,-04) -- (56,04) node[anchor=south east] {$x_N$}; \node[draw=red,dashed,thick,circle,minimum width=4cm] (n) at (56,0) {}; \fill[pattern=north east lines,opacity=.6] (58,0)arc(0:180:2cm) -- (58,0); \draw[thick,->] (57.5,1.55) -- (58,2) node[anchor=north west] {$I^{+}(1)$}; \draw[thick,->] (57.5,-1.55) -- (58,-2) node[anchor=north west] {$I(1)$}; \draw (56,0) node[below right] {$O$} node{$\bullet$}; \draw (58,0) node[below right] {$1$} node{}; \draw (54,0) node[below left] {$-1$} node{}; \node[draw,circle,minimum width=2cm] (n1) at (50,3) {};  \begin{scope} \clip[draw](48,1) to[closed,curve through={(50,3) .. (52,4) .. (51,6) ..(47,6) .. (46.6,5) .. (45,3.8) }] (48,1); \node[draw,circle,fill=magenta,minimum width=2cm] (n1) at (50,3) {}; \end{scope}  \node[inner sep=1pt,fill,circle,label={below right: $x_0$}] at (50,3){}; \draw[->,shorten <= -4mm] (n1.90) -- +(0.7,0.7) node[pos=1.3]{$\Omega_1 \cap \Omega$}; \draw[->] (51,6) -- +(0.7,0.3) node[pos=1.3]{$\Omega$}; \draw[->] (n1.300) -- +(0.7,-0.3) node[pos=1.3]{$\Omega_1$}; \draw[->] (n1.10) to[bend left] node[midway,below]{8*} (n.120);   %% 8* = ??? \node at (50,-1){ Some text???}; \end{tikzpicture}  \end{document}

I was trying to reproduce Claudio Fiandrino's answer to .  However, I do not have the hobby package by Andrew Stacey in my local distribution.  After reading  and , I looked at the latest  (build on December 7, 2012) but could not located the hobby package in it.  I found  but do not know where each file is supposed to go in my distribution.  How do I add the hobby package? In general, what would be the easy way to get any new TikZ package installed in a Mac?  EDIT:  I have used the drag-and-drop (mac) method as described below.  (1) Drag pml3array.sty file to /Users/Username/Library/texmf/tex/latex folder. (2) Drag hobby.code.tex file to /Users/Username/Library/texmf/tex/generic/pgf/math folder. (3) Drag pgflibraryfpu.code.tex to /Users/Username/Library/texmf/tex/generic/pgf/libraries folder. (4) Drag tikzlibraryhobby.code.tex to /Users/Username/Library/texmf/tex/generic/pgf/frontendlayer/tikz/libraries folder.  I no longer get the hobby cannot be found error message.  But, is this correct?


I am working with a  country vector dataset () and I am trying to merge country polygons according to custom regions (based on the UN Geoscheme), in order to only have an outer border rather than every single country's border.  My issue is that, seemingly contiguous countries leave artefacts after merging, be it by hand ("edit > merge selected features") or by using the "dissolve" tool ("vector > geoprocessing tools > dissolve").  How come there are stray lines inside the regions? Can I somehow fix that, or should I find a different dataset?  See the following examples in Africa:  Merging by hand    Dissolving according to data

I have a set of polygons representing administrative districts.  The districts were digitized by hand, and there are small spaces (slivers) between polygons where the polygons should be touching. How can I have the polygons snap together, removing the spaces?


I have an query like  SELECT EmployeeName FROM Employee   Query result will be :  Mr. Kamal Mr. Karim Mr. Rahim Mr. Jamal   But I need :  Mr. Kamal , Mr. Karim, Mr. Rahim, Mr. Jamal   Is it possible with a single query.

Consider a database table holding names, with three rows:  Peter Paul Mary   Is there an easy way to turn this into a single string of Peter, Paul, Mary?


I am thinking about applying to graduate studies in physics related Phd or master degree in the US, but my GPA is very low, 2.4/4.0 to be specific. I wonder if there are respectable universities in the US that can accept such low average? Notes:  -I have some experience in research from my undergrad. -I had my Undergraduate degree in physics from a respectable Canadian university.  Thanks in advance!

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


What would be grammatically correct? Would I need to use 's after "Supreme Court"?     ...overruled a prior decision of the Supreme Court, defined in the...   or      ...overruled a prior decision of the Supreme Court's, defined in the...   ...I know I can structure the sentence in a better format as so:     ...overruled a prior decision made by the Supreme Court, defined in the...   However, I want to know which one from the first two is correct.

As  shows, we nearly always use the possessive form of personal pronouns for friend of mine/his/ours/etc.  But when it comes to actual names, we prefer  without the possessive apostrophe. That preference is even more marked with, say, . Not that I think the usage itself is particularly American - it's much the same with .  Personally, I find friend of him grates. In general I've no strong feelings either way as to whether it's friend of Peter or friend of Peter's (though I deplore the possessive in ), but in line with many others, I really don't like the possessive in relation to things like countries.  Why is this?   Edit: Noting an apparent "progression" (pronoun -> person -> nation) marked by reduction in use of the possessive, I checked at a finer "granularity". NGram shows that although it does occur,  virtually "flatlines" against friend of mine. But the bias reduces through of you, of us, and by the time I get to  it's much less extreme. There seems to be something "egocentric" about the double possessive.  Presumably when babies learn to speak, they soon notice that possessive pronouns, possessive apostrophes, and the word "of", all do the same job. Parents would correct a child who says "of mine's", but probably wouldn't even notice the same "redundancy" in "of Peter's". Younger speakers are unlikely to even be talking about something "of America's". Perhaps as we mature we tend to discard the "double possessive" for the more "distant" things that only adults are likely talk about, but we keep it for "closer" people because that's how we spoke when we were younger.  EDIT2 I note that I'm a great fan of him is vanishingly rare compared to ...fan of his, but with ...fan (of John) the double possessive occurs far less often than ...friend (of John's). Usage seems to be affected by the noun before "of" as well as the one after it. This is getting complicated...


My machine only has Ubuntu installed (13.04) but one data drive is NTFS (because I didn't realize that the disk was NTFS formatted when I started using it). I now used Gparted to reduce the partition and make room for a new data partition in ext4 format so that I can move the data there instead, then delete the NTFS partition and resize the ext4 partition to use the entire disk.  After reducing the NTFS partition and creating the ext4 partition, Gparted now Gparted has  an exclamation mark (top) and tells me this (bottom).  I'm asked to run Windows Checkdisk twice, but I don't have Windows installed and it's very tedious to pull the drive out of the computer and hunt down a Windows pc with SATA connectors. Is there any way for me to fix this, besides using Windows?  The NTFS data partition is not available until I've fixed it, so I can't read its data and copy it to the new ext4 partition. If I could just reliably read it, this problem might be irrelevant.     Final update and solution:  I can't accept either answer because the Linux tools could not resolve the problem. In the end, I booted my machine with a Windows 7 installation disk and started the repair/recovery function. In there, I could open a command prompt and run the chkdsk /f which solved the problem :-)

MY NTFS Partition has gotten corrupt somehow (it's a relic from the days when I had Windows installed).     I'm putting the debug output of fdisk and blkid .  At the same time, any OS is unable to mount my root partition, which is located next to my NTFS partition. I'm not sure if this has anything to do with it, though. I get the following error while trying to mount my root partition (sda5)  mount: wrong fs type, bad option, bad superblock on /dev/sda5,        missing codepage or helper program, or other error        In some cases useful info is found in syslog - try        dmesg | tail  or so  ubuntu@ubuntu:~$ dmesg | tail [ 1019.726530] Descriptor sense data with sense descriptors (in hex): [ 1019.726533]         72 03 11 04 00 00 00 0c 00 0a 80 00 00 00 00 00  [ 1019.726551]         1a 3e ed 92  [ 1019.726558] sd 0:0:0:0: [sda]  Add. Sense: Unrecovered read error - auto reallocate failed [ 1019.726568] sd 0:0:0:0: [sda] CDB: Read(10): 28 00 1a 3e ed 40 00 01 00 00 [ 1019.726584] end_request: I/O error, dev sda, sector 440331666 [ 1019.726602] JBD: Failed to read block at offset 462 [ 1019.726609] ata1: EH complete [ 1019.726612] JBD: recovery failed [ 1019.726617] EXT4-fs (sda5): error loading journal   When I open gparted (using live CD), I get an exclamation next to my NTFS drive which states   Is there a way to run chkdsk without using windows ?  My attempt to run fsck results in the following :  ubuntu@ubuntu:~$ sudo fsck /dev/sda fsck from util-linux-ng 2.17.2 e2fsck 1.41.14 (22-Dec-2010) fsck.ext2: Superblock invalid, trying backup blocks... fsck.ext2: Bad magic number in super-block while trying to open /dev/sda  The superblock could not be read or does not describe a correct ext2 filesystem.  If the device is valid and it really contains an ext2 filesystem (and not swap or ufs or something else), then the superblock is corrupt, and you might try running e2fsck with an alternate superblock:     e2fsck -b 8193 <device>   Update: I was able to fix the NTFS partition running chkdsk off Hiren's BootCD, but it seems that the superblock problem still remains.  Update 2: Fixed superblock issue using e2fsck -c /dev/sda5


So the backstory about this is that we are trying to give a reward out with of an enchanted book with a random level. Aka Protection I-V randomly. I know the command /give @p enchanted_book 1 0 {StoredEnchantments:[{id:34,lvl:X}]}, with X being the enchantment level, but is there a way to change that to a random number? Like random of the vanilla enchantments of course. Or do I need to explore scripts for that kind of stuff? Full story, Crazy Crates reward, of a random enchanted book, of a random level. Have the first two down easy, just the random level part.... Thank you ahead of time yall!

I want to make a mini game in Minecraft were I need a random command generator for 9 commands. I need a random command to give the player a random item. I can't do the command block in the dispenser any more because it will just drop out instead of being placed. What different ways are there for generating randomness in commands, and which one would be best for my use? This question is similar to the one about , but I am specifically attempting to get randomness when using commands - the redstone solutions do not apply here.


Consider the data below.  account     product sales  account1    prod1   10.0 account1    prod1   15.0 account1    prod1   12.0 account1    prod1   5.0 account1    prod1   78.0 account1    prod1   45.0 account1    prod1   34.0 account1    prod1   9.0 account1    prod1   19.0 account1    prod2   12.0 account1    prod2   11.0 account1    prod2   14.4 account1    prod2   6.0 account1    prod2   93.6 account1    prod2   54.0 account1    prod2   25.0 account1    prod2   7.0 account1    prod2   22.8 account2    prod3   23.0   Now i want to iterate through the unique products and want to return the comma separated list of sales for unique products.  I want the output to be like   i.e   Prod1  12.0, 16.0, 45.0, 38.0, 69.0, 42.0, 45.0, 65.0, 28.0, 95.0, 35.0, 25.0  Prod2  12.0, 16.0, 45.0, 38.0, 69.0, 42.0, 45.0, 65.0, 28.0, 95.0, 35.0, 25.0   where this 2nd row is the comma separated list of sales for that product.  What is the best way to achieve this in sql server 2008r2 ?  Should i use cursor ?

I'm trying to migrate a MySQL-based app over to Microsoft SQL Server 2005 (not by choice, but that's life).  In the original app, we used almost entirely ANSI-SQL compliant statements, with one significant exception -- we used MySQL's group_concat function fairly frequently.  group_concat, by the way, does this: given a table of, say, employee names and projects...  SELECT empName, projID FROM project_members;   returns:  ANDY   |  A100 ANDY   |  B391 ANDY   |  X010 TOM    |  A100 TOM    |  A510   ... and here's what you get with group_concat:  SELECT      empName, group_concat(projID SEPARATOR ' / ')  FROM      project_members  GROUP BY      empName;   returns:  ANDY   |  A100 / B391 / X010 TOM    |  A100 / A510   So what I'd like to know is: Is it possible to write, say, a user-defined function in SQL Server which emulates the functionality of group_concat?   I have almost no experience using UDFs, stored procedures, or anything like that, just straight-up SQL, so please err on the side of too much explanation :)


I've got a computer having DNS problems with one address only, "microsoftonline.com". Ping doesnt resolve IP but nslookup does correctly. It works from other machines. It is WinXP with no proxies  I have tried google's DNS servers with no avail. Any ideas?  The ping error is "Ping request could not find host...."

On my Windows XP workstation, I can find the machine I want to connect to in DNS with nslookup:  nslookup wolfman Server: dns.company.com Address: 192.168.1.38  Name: wolfman.company.com Address: 192.168.1.178   But, when I try to connect to that machine, I get an error telling me that the machine can't be found (i.e., can't be looked up in DNS):  C:\> ping wolfman Ping request could not find host wolfman. Please check the name and try again.   I am able to connect if I use the IP address directly:  C:\> ping 192.168.1.178  Pinging 192.168.1.178 with 32 bytes of data:  Reply from 192.168.1.178: bytes=32 time=41ms TTL=126 Reply from 192.168.1.178: bytes=32 time=41ms TTL=126 Reply from 192.168.1.178: bytes=32 time=44ms TTL=126 Reply from 192.168.1.178: bytes=32 time=38ms TTL=126   I could work around this by adding an entry to my hosts file, but I would rather find out why this is happening.  The problem is transient, most of the day I can connect to the machine just fine.  How is this possible?  ETA: I left this out for brevity, but it was asked for:  C:\> ping wolfman.company.com Ping request could not find host wolfman.company.com. Please check the name and try again.   ETA: Other applications get the same results.  I only tried ping to simplify.  telnet can't connect, Cygwin apps print a "unknown host wolfman" message.  Update: Using wireshark, I found that my workstation is not attempting a DNS lookup.  It's just reporting the "could not find host" error message.


Given an affine variety $X$ embedded in affine space $\mathbb{A}^n$, there is a simple-minded construction which associates a projective variety $\mathbb{P}(X) \subseteq \mathbb{P}^n$, as follows. If $I \subseteq k[x_1,\dots, x_n]$ is the ideal defining $X$, then $\mathbb{P}(X)$ is defined by the homogeneous ideal $\mathbb{P}(I)\subseteq k[x_0,\dots,x_n]$, where if $f = \sum a_{i_1,\dots,i_k} x_1^{i_1}\cdots x_k^{i_k} \in I$, then $\tilde{f} = \sum_{i_1,\dots,i_k} x_0^{D - i_1 - \dots - i_k} x_1^{i_1}\cdots x_k^{i_k} \in \mathbb{P}(I)$ for $D$ large enough to make all exponents positive.  This is a well-defined operation turning an affine variety (or more generally, affine algebraic set) in $\mathbb{A}^n$ into one in $\mathbb{P}^n$. But it would appear to depend on the embedding of $X$ into $\mathbb{A}^n$. Is this the case? That is, if I have two isomorphic subvarieties $X,X' \subseteq \mathbb{A}^n, X \cong X'$, are the resulting projectivizations $\mathbb{P}(X), \mathbb{P}(X')$ necessarily isomorphic? I suspect not, but I don't have a counterexample.  A little googling turns up something called the  which may be relevant, but it apparently requires a graded ring as input, and the function algebra of $X$ will not typically be graded as far as I can see.

For an affine variety $X\subset \mathbb{A}^n$, we can associate it with $\overline{X}$, which is the closure of $X$ in $\mathbb{P}^n$.   Does $\overline{X}$ depend on the choice of embedding $X\subset\mathbb{A}^n $? Suppose given $f\colon X\subset\mathbb{A}^n\to Y\subset\mathbb{A}^n$，does it induce morphism $\overline{f}\colon \overline{X}\to \overline{Y}$?


I need to get the maximum likelihood estimate of a two-parameter Weibull distribution. I have tried it on my own but everything tends towards using a Newton-Raphson iterative method which I am not conversant with.   I am trying to show that the maximum likelihood is a better approach than graphical hazard plots using a Weibull distribution and now I need to get the maximum likelihood of a Weibull distribution.

Hi can the same be shown to obtain shape and scale parameter for modified maximum likelihood method


I am really new to the Linux world. My system is running really slow since after installing Ubuntu 14.04. It is showing some type of error:  The system is running in low graphics mode. Cannot detect your screen, graphics and devices.   I am running the OS in low graphics mode and I have to go to boot options every time I switch on my PC and select the low graphics mode option in Advanced options for Ubuntu → Recovery mode.   How can I get my system working normally?  sudo lshw -c display  *-display UNCLAIMED description: VGA compatible controller product: C61 [GeForce 6150SE nForce 430] vendor: NVIDIA Corporation physical id: d bus info: pci@0000:00:0d.0 version: a2 width: 64 bits clock: 66MHz capabilities: pm msi vga_controller bus_master cap_list configuration: latency=0 resources: memory:de000000-deffffff memory:c0000000-cfffffff memory:dd000000-ddffffff memory:dff40000-dff5ffff

Note: This is an attempt to create a canonical question that covers all instances of "low-graphics mode" error that occurs to a user, including but not limited to installation of wrong drivers, incorrect or invalid lightdm greeters, low disk space, incorrect installation of graphics card like ATI and Nvidia, incorrect configuration of xorg.conf file while setting up multiple monitors among others. If you are experiencing the "low-graphics mode" error when trying to login but none of the following answers work for you, please do ask a new question and then update the answers of this canonical question as and when your new question gets answered.   When I try to boot into my computer, I am getting this error:  The system is running in low-graphics mode Your screen, graphics cards, and input device settings could not be detected correctly. You will need to configure these yourself.   How do I fix the failsafe X mode and login into my computer?  Answer index:


Your father's father is called your grand-father, yet your father's uncle is typically called your great-uncle (or so it seems with anybody I converse with). Why the inconsistency?

I know that there are  of this word, but "great-uncle" is most common ("great-aunt" has a ).  Why is this, if "grandfather" and "grandmother" are common?


If we consider the sentences in ZFC:  EM that express that exist a model of ZFC.  SM that express that exist a standard transitive model of ZFC.  OM that express that exist a $\omega$-model of ZFC.  By Godel second incompleteness theorem we know that  $\mathsf{ZFC}\nvdash \mathsf{EM}$   What is known about:  $\mathsf{ZFC+EM}\nvdash \mathsf{OM}$   ?  or  $\mathsf{ZFC+OM}\nvdash \mathsf{SM}$  ?  or  $\mathsf{ZFC+EM}\nvdash \mathsf{SM}$  ?

$ZFC + \exists V_\alpha$ model of $ZFC \vdash Con(ZFC + \exists$ transitive standard model of $ZFC)$  and then  $ZFC + \exists$ transitive standard model of $ZFC \vdash Con(ZFC + \exists \omega-model$ of $ZFC)$  For the first one :   We can always find a countable extentional $M \subset V_\alpha$ elementary equivalent to $V_\alpha$. Let $M'$ be the mostowski collapse of $M$. $M' \approx M$ so $M'$ is model of ZFC. And because $M'$ is countable and transitive then $M' \in V_\alpha$ (since $H_{\omega_1} \subset V_{\omega_1}$ and $\alpha$ is surely far larger than $\omega_1$).   So $V_\alpha$ is the model of '$\exists$ a standard transitive model of ZFC'.  For the second one :   I don't really know how to do it... Does anyone have an idea ?


I am running Ubuntu Desktop (so, there's the graphical interface that I'm using). When I double click a '.sh' file, I was expecting it to run. However, it opened up gedit instead. I enabled the permission to execute the file, and I've tried to find a program called 'terminal' or 'bash' to execute the script with, and found nothing that looks like I could use it to execute the BASH script.  Could someone please tell me what I need to do, in order to be able to double click on a BASH script (or, at least right click and run with bash or something like that) and run it?

When I double-click on a script in Nautilus to run it, the script just opens in my text editor with no option to run it. Using Nautilus, how do I run executable text files and/or scripts?


In the following statement, why don't we consider red as noun even though it is the name of a color.      The apple is red.

Hazel Eyes  I found the following paragraph in the , containing the two words “hazel eyes”:     Hazel eyes are fascinating to gaze into. When you look at someone who has hazel eyes, you see colors that are completely different than other eye colors, such as crystal blue or emerald green.      —   I also found some text on another site that says:      Her eyes are hazel.   Hazel is a noun that denotes a colour; how can hazel modify the noun eyes if hazel is also a noun itself? Doesn’t a word always have to be an adjective to modify a noun? Isn’t that what “adjective” means by its very definition: a word that modifies a noun? How can something modify a noun without being an adjective? Is that even possible?  The  I found on the online Oxford Living Dictionaries website doesn’t mention that hazel can ever be adjective; it mentions only that it is a noun:     hazel      ɴᴏᴜɴ         A temperate shrub or small tree with broad leaves, bearing prominent male catkins in spring and round hard-shelled edible nuts in autumn.      Genus Corylus, family Betulaceae: several species, in particular the common Eurasian hazel (C. avellana)   [mass noun] A reddish-brown or greenish-brown colour, especially of a person’s eyes.      [as modifier] ‘the laughing hazel eyes were serious now’         —   How can this be grammatical?     Her eyes (noun) are hazel (noun)?   And also, if you accept that a noun can work as an adjective, then, can adjective work as a noun?


I have installed Ubuntu 20.04 alongside windows 10 in dual boot. But after the restart I am not able see the grub and directly starts windows 10. Therefore not able to boot ubuntu or change any other boot settings. Current bios is UEFI which is default with disabled legacy support. I searched on internet for solution but everyone says need to modify some grub related file and update the grub. But since ubuntu is not booting I cannot try these methods.

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


I'm trying to be all cool and modern and use arrow function es6 js but failed at the first attempt.  Why does this arrow function sumRange NOT work:      var output = sumRange(3);     console.log(output);      sumRange = (num) => {             if(num == 1) return 1;             console.log(num);             return  num + sumRange(num - 1);         }   But here the function DOES work:     var output = sumRange(3); console.log(output);  function sumRange(num){     if(num == 1) return 1;     console.log(num)     return num + sumRange(num - 1); }

I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent.  The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not.  The two ways are:  var functionOne = function() {     // Some code };     function functionTwo() {     // Some code }   What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?


I'm currently can boot a Ubuntu PXE. but the problem is with multi-monitors. I have to run xrandr command to get the dual monitors up. with suggest from   xrandr --output VGA1 --left-of LVDS1   So is there anyway I can make it auto detect if there is more than 2 monitors and auto join 2 monitors. I'm using XFCE Really thanks for any advice on this.

I've got an laptop with a intel chip, and I'd like to setup dual monitors in Xfce.  How do I do this?


I have the following files:  Thesis.tex  \documentclass{scrreprt} \usepackage[english]{babel} \usepackage{blindtext} \newcommand{\bflabel}{\aclabelfont}  \input{classicthesis-config} \begin{document} \chapter{Introduction} \include{input} \end{document}   input.tex  \blindtext   classicthesis-config.tex  ... copied from the distribution ...   When I put \chapter before the \include, what I get is this:    Instead, when I move \chapter{Introduction} to intput.tex, I get this:    I wonder why this is the case.

There are two different commands to incorporate another file into the source of some document, \input and \include. When should I use one or the other? What are the differences between them? Are there more things like them to be aware of?


I want to convert a datetime string to datetime object which will be further processed to display in a different format.  The string is in the for, 2018-04-24T16:42:17Z.  I have tried the following method but it gives error.  import datetime datetime.datetime.strptime('2018-04-24T16:42:17Z', '%b %d %Y %I:%M%p')   Traceback (most recent call last):   File "<stdin>", line 1, in <module>   File "D:\Python\lib\_strptime.py", line 510, in _strptime_datetime     tt, fraction = _strptime(data_string, format)   File "D:\Python\lib\_strptime.py", line 343, in _strptime     (data_string, format)) ValueError: time data '2018-04-24T16:42:17Z' does not match format '%b %d %Y %I:%M%p'   Please help.

I need to parse  strings like "2008-09-03T20:56:35.450686Z" into Python's datetime type.  I have found  in the Python standard library, but it is not very convenient.  What is the best way to do this?


As I was going through the SMPS circuits online I came across this circuit:    I searched and learned that the transformer steps down or step up only AC power supplies and then converted to DC using rectifiers and to boost or to decrease them we use buck booster circuits.  I also found that :  As in DC(voltage being always constant), the change in flux is zero so no mutual induction,thus transformers can't work with a DC supply. Moreover, if DC or a similar rating of AC(Voltage & Current) is fed into the terminals of a Transformer there is a high possibility that it would burn the primary coil.  When a dc supply is provided to the transformer primary no self-induced emf will be generated (no back emf). Therefore heavy current will flow in the transformer primary winding which may result in burning down the transformer primary winding.  I also found the above things on Quora:        The transformer used in this circuit is an SMPS transformer that works on high frequencies. So how this works. I am not able understand it.

I've been taught that a transformer only works with AC, however I see that in power converters, it is rectified to a DC voltage before going to the transformer. How does that work?  If the rectified AC waveform is now DC, how does it pass through the transformer? Is the rectified signal still good enough for the transformer, because it still has a fluctuating component in it, just not negative anymore?  So for example, if I have a 230V mains (with 10% fluctuation) going into my rectifier, the output DC level will range from 293V to 358V. Is this fluctuation/AC component good enough to pass through the transformer?


Below is some source code for a short/brief document. When I compile the short document document only once, the source code \ref{figure:FORMULA:anatomy} becomes ?? in the pdf. If I run PDFLaTeX a second time, the .aux files etc... get updated and the figure reference becomes 1.1.  \documentclass{article} \usepackage{graphicx}                             \begin{document}                               \section{Yellow} \subsection{Submarines}  blah blah \ref{figure:FORMULA:anatomy}.   \begin{figure}[htpb] \label{figure:FORMULA:anatomy}   \centering    \fbox{         \begin{minipage}{\linewidth}             \includegraphics[width=\linewidth]{FORMULA_anatomy}             \caption{I'm a caption}         \end{minipage}     }% end fbox \end{figure}  \clearpage  \end{document}   I have a different document which after running through PDFLaTeX a dozen times still has the figure references showing as ??. How can I get the figure references to render properly? Its very long document, so I will provide a  to the source code rather than pasting in the body of this question.  The source code for the document for which \ref{lable} almost always becomes ?? is

\documentclass{article} \usepackage{algorithm}  \begin{document} \setcounter{section}{54} \section{A section with no label} \begin{algorithm} \label{myalg} \caption{An algorithm with the label `myalg'.} \end{algorithm} Reference to myalg: \ref{myalg}. \end{document}   With this code, the reference givens 55 (the section number); if I move the label after the caption command, I get the correct reference (1).  Why should this be the case? I find it confusing: when thinking about an algorithm as an environment, you expect to be able to label it right after you began it. At the very least I would expect some kind of error or "??" to appear, rather than the previous environment or reference-able entity being used.


Why can't we answer this simple question?  Where does the magnetic field of a permanent magnet come from? What is different about a magnetizable atom that allows it?  Why is it perpetual?   Or is it recurrent?   Charged particles in motion into wave-flux, then the wave-flux back to charged particles in motion?  Primal energy still not explained.   To the back side of Mars and physics still cannot explain the basis of a child's toy.  tecvia

I'm having trouble understanding how a  (not the  that is generated as a result but the material itself) work. The particles are aligned in a specific direction to give rise to force but I don't see how this alignment gives rise to "attraction" or force.


When writing comments, it is possible to write a space after the last character of the code so that it looks like A:<space>. When writing it within a question, however, it does not work.  But there is another problem which occurs when writing something like this in comments. There, it will look like A:<space><end of inline code><no space although " " was written><normal text> Note that there is no normal space between the space written within the inline code environment and the ongoing normal text. I would like to have a normal space after the end of the code block, too.   only answers one part of the problem: Inline code in a question. &lt;a&nbsp; produces <a  and there is a space behind <a  if it is set.  For comments, however, &lt;a&nbsp; does not work. Using the NO-BREAK-SPACE as suggested in  to this question does not work either.

I was answering a question on Stack Overflow and required to use a trailing space in one of my code snippets.  I formatted it like so:  `<a `   And it renders without the trailing space: <a  Using the <code> tag does account for trailing spaces, though in my case it busts because of the <. Here's my formatting with the <code> tag:  <code><a </code>   Here's how it renders:  (Yes, you should see nothing there).  This is a pretty annoying bug. Can we get it fixed?


I'm using the particle system to randomly generate items instead of manually doing it one by one, and then I'm utilizing shaders with a color ramp and random to randomize the base color of the particles. Problem is when I export as an FBX, it refuses to export with the randomized colours, it just sets all the particles to blue. Is there a way to fix this or am I going to have to do each particle manually? I mostly use blender for exporting objects instead of renders, wondering how useful shaders will be to me if at all. Thanks.

I used node textures in a mesh I exported to .FBX.  I then imported it into Unreal Engine 4 and it didn't import any textures; I clicked the Upload Textures option in Unreal Engine.  Is there something I'm doing wrong or is it Blender?


Hypothetical situation: A moderator of a site posts a terrible answer in the main (not meta) site they are a moderator of. Can they see the identities of people who downvote it?

Is there a way to see who voted (upvotes and/or downvotes) on your answers and/or questions?


I'm a newbie to js. Let me illustrate my question with a few examples. Code 1 var temp = { key: "value" }; var data = ["v1", "v2"]; var result = []; for (var i in data) {     var newdata = temp; /** Note here! **/     newdata.key = data[i];     result.push(newdata); } console.log(result); // [ { key: 'v2' }, { key: 'v2' } ]  The result here is unexpected. Code 2 var temp = { key: "value" }; var data = ["v1", "v2"]; var result = []; for (var i in data) {     var newdata = { key: "value" }; /* Note here! */     newdata.key = data[i];     result.push(newdata); } console.log(result); // [ { key: 'v1' }, { key: 'v2' } ]  Now the result is what I want. It looks like the  in Python. But I googled a lot and could not get a satisfied answer. So I have to turn to stackoverflow for help. My question: Does JS have a name binding operation similar with Python? If not, why do these two piece of codes get different results? [Edit] I know about reference in C++, and name binding in Python. And I'm also aware of the differences between these two. The only thing I was confused with was: In JS, is it reference or name binding? Or something else? Thanks to all the comments, I totally understand it's similar with name binding rather than reference. (As I can't find any button to closed this question, I add the answer here.)

So I was playing around the other day just to see exactly how mass assignment works in JavaScript.  First I tried this example in the console:  a = b = {}; a.foo = 'bar'; console.log(b.foo);   The result was "bar" being displayed in an alert. That is fair enough, a and b are really just aliases to the same object. Then I thought, how could I make this example simpler.  a = b = 'foo'; a = 'bar'; console.log(b);   That is pretty much the same thing, isn't it? Well this time, it returns foo not bar as I would expect from the behaviour of the first example.  Why does this happen?  N.B. This example could be simplified even more with the following code:    a = {}; b = a; a.foo = 'bar'; console.log(b.foo);  a = 'foo'; b = a; a = 'bar'; console.log(b);     (I suspect that JavaScript treats primitives such as strings and integers differently to hashes. Hashes return a pointer while "core" primitives return a copy of themselves)


I'm a Grade 12 student. The other day I was messing around with functions on my calculator and I came across $x^{2/3}$. When I evaluated a negative integer as x (using the memory function on my calculator) I was received with a domain error.  I asked my teacher about it and she said it was a fault in the calculator. I took this a bit further and put $(-64)^{2/3}$ into Wolfram Alpha/Google was some weird number like:  -8 +13.8564... i  Can someone explain to me why this does not evaluate to just 8? Using exponent laws that I learned this is equivalent to $\sqrt[3]{-64}^2=(-4)^2=16$.   (By the way I haven't learned about imaginary numbers yet)

My teachers have gone over rules for dealing with fractional exponents. I was just wondering how someone would compute say: $$(-5)^{2/3}$$ I have tried a couple ways to simplify this and I am not sure if the number stays negative or turns into a positive. I know that if a negative number is raised to an odd power it is negative, but fractional powers are neither odd or even. Is there a general rule for dealing with these types of problems?


When I place a uv sphere, it shows the option of how many faces on the sphere. But, when I click somewhere else, the settings disappears. I can't find any settings for it again so how to I change the settings of how many faces on the sphere?

When you first add a cylinder, you have the option to change the number of vertices, etc, but once you do anything else in blender, it seems you no longer can edit those parameters.   Is there a setting anywhere or an add-on that allows these parameters to be edited later on? If not, how easy would such an addon/feature be to create for anyone reading this?


i had used linux once when i was 8 back in 2001 and i used to love it as i played the games that came with the OS, then i left linux until recently since i have been hearing about all this new linux hype so i decided to give it a try.  I have used this OS since one semester now, It lives upto its hype and i am seriously in love with it and i had downloaded wine and have been playing games on it even tho all my games do not work "I'll remain patient and hope it soon becomes better"  Now the only Issue with the operating system is that the games i used to play was slower, then i went to settings and details and noticed that the laptop was using Intel instead of Nvidia GPU and optimus was not supported. I understand that there might be some devs here and experts so could any one write a tutorial for serious noobs it would help me and all the new people starting to use linux.  Also i wonder why ubuntu devs do not integrate Wine into the OS ?.  "Sorry for my english and also if i had asked a question that already had been answered as i didn't find any of them fit to work for my laptop, i bricked the OS multiple times"  P.S i also always get an error when i boot the OS and unity shows.

I just ordered the Nvidia GTX card. I have a dilemma, though. Should I keep using the driver which is available in "additional drivers" in Ubuntu, or should I install the driver from the Nvidia site?  So which driver is the best for me?


for example the connect function from 'react-redux' library, looks something like this:  connect(state)(SomeComponent)   I understand that connect function accepts a single parameter but what does the second parenthesis mean? It seems like another parameter but why does it have to be in a separate parenthesis? what are the use cases? What exactly is the term for this?

I've seen references to curried functions in several articles and blogs but I can't find a good explanation (or at least one that makes sense!)


Silly question. I have a Nikon D5100, that unfortunately just needed to go in for service. I am trying to make sure I don't do whatever I did again. I just got a new 500mm lens, it is quite heavy. Is it possible to damage the camera with a lens that is too heavy for it?

Where can I find information about maximum allowed lens weight for my camera?  I'm asking because I have an opportunity to get an old Soviet-built 80-200mm lens for my Nikon D3100 for a very attractive price. But then it occurred to me: the lens weighs 960g (more than camera itself) and the camera has plastic body, so could it damage my camera?  Nikon website only list compatible types of lenses, but not maximum weight. I'm pretty sure this particular lens will be OK, but this kind of information would be very useful when considering purchasing heavy lenses.  While I'm asking about Nikon, I think the question will be relevant for any camera brand.


Inspired by  - I remember watching a cartoon in my childhood (mid 90s)about a group of people who battled some baddies (I think) in a very mountainous terrain. Their main gimmick was backpacks that could shoot harpoons simultaneously to the front and rear, stretching a rope across the mountains that they would then slide down on. Maybe they also had motors in the backpacks which allowed them to climb upwards on these ropes? Not sure. The cartoon was aired on Cartoon Network, but that's all I can remember about it. It was shown fairly rarely and I only saw a few episodes ever.

There was this 90s team action Cartoon on Cartoon Network back when the Power Zone would play with Swat Cats and Centurions. I just saw a few episodes and I don't think it lasted long. It was similar to the centurions with the protagonists being a large team of guys who would have machines attached to their backs via suits. The machines were the whole length of the person and would allow them to stand in it. The top of the machine would shoot grappling hooks with ropes. The whole cartoon was was set in mountains and canyons and this is how the characters would get across with their individual machines allowing them to zip along the ropeway made by it. Desperate to get the name of this series so that I can just relive a few episodes :)


If I flag a comment from a mod, can the same mod review my flag?

I think I just witnessed a moderator decline a flag raised on his own comment. (I'm hesitant to discuss specifics unless I have to, as I don't mean to put anyone in a negative light.)  Since there are at least 2 other moderators per site, I'm not sure this should be allowed—I feel that either   only uninvolved moderator(s) should be able to view and handle flags on co-moderators' posts, or moderators should be able to view all flags, but a flagged moderator should not be allowed to decline a flag against him- or herself.   I have no personal issue with this moderator. I just felt in this case that there was truth in both sides (the moderator's as well as the flagging user's), and sought a win-win solution, i.e. by improving the disputed answer. Coming back an hour later to see that the moderator unilaterally declined the user's flag—that didn't seem fair to the user...  I am making some assumptions based on the "Last Seen" stat in the moderator tools, so if I'm simply mistaken on what happened, I apologize in advance.


I have more media that can possibly be stored on my iPhone, so I assume that most of it is stored in iCloud and downloaded when required (when I view it).   What happens if I cancel/downgrade my iCloud storage plan?  How do they decide what media is going to be deleted, so that the amount falls within the free plan?   Is there a time period where I can cancel and then sign back up and it'll be as if nothing has happened?

I have a plan of $0.99/month. Now I want to cancel my subscription.  I have 30GB of iCloud Data. I don't know what happen with all my data in iCloud. Will I still be able to get access, or it will be deleted once I cancel my subscription?


I am having this problem with elsarticle. When I compile the file the doi does not appear in the bibliography entries.   \documentclass[review, authoryear]{elsarticle} \usepackage{hyperref, doi}  \begin{filecontents}{mybib.bib} @article{Be05, author  = "Fernando Bernstein and Awi Federgruen", title   = "Decentralized Supply Chains with Competing Retailers Under Demand Uncertainty", journal = "Management Science", volume  = "51", number  = "1", pages   = "18--29", year    =  "2005", doi     = "10.1287/mnsc.1040.0218" } \end{filecontents}  \begin{document} \cite{Be05} \section*{References} \bibliographystyle{elsarticle-harv} \bibliography{mybib} \end{document}   I compile it with TexWorks using the option pdfLaTeX+MakeIndex+BibTex or the option PdfLaTeX/ then bibtex/ then 2 times PdfLaTeX. Everything else works as it should. The problem appears when I use the option  authoryear   If I ommit it it works fine, but then the citations are numbered (as they should) which is not what I want.  Can anyone please explain to me what is wrong with my code and fix this. Thanks.

I am having this problem with elsarticle. When I compile the file the doi does not appear in the bibliography entries.   \documentclass[review, authoryear]{elsarticle} \usepackage{etex} \usepackage{lineno, hyperref, chngcntr, array, booktabs, enumitem, multirow, tabu, subcaption, nicefrac} \usepackage{amsfonts, amsmath, amsthm, amssymb, cleveref, thmtools, thm-restate, lmodern, natbib} \usepackage{wrapfig, graphicx, framed, ragged2e, mathtools, epsfig, adjustbox, parskip, doi} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc}  \begin{filecontents}{mybib.bib} @article{Be05, author  = "Fernando Bernstein and Awi Federgruen", title   = "Decentralized Supply Chains with Competing Retailers Under Demand Uncertainty", journal = "Management Science", volume  = "51", number  = "1", pages   = "18--29", year    =  "2005", doi     = "10.1287/mnsc.1040.0218" } \end{filecontents}  \begin{document} \begin{frontmatter}\title{Some Title}\end{frontmatter} \cite{Be05} \section*{References} \bibliographystyle{elsarticle-harv} \bibliography{mybib} \end{document}   I compile it with TexWorks using the option pdfLaTeX+MakeIndex+BibTex or the option PdfLaTeX/ then bibtex/ then 2 times PdfLaTeX. Everything else works as it should. The problem appears when I use the option  authoryear   If I ommit it it works fine, but then the citations are numbered (as they should) which is not what I want.  Can anyone please explain to me what is wrong with my code and fix this. Thanks.


Show that if $n$ is composite then there exists a prime $p \leq n^\frac{1}{2}$ such that $p\mid n$.  I would like to use contradiction to prove this claim but I'm not sure about how I should contradict this statement.

Prove that if a number $n > 1$ is not prime, then it has a prime factor  $\le \sqrt{n}$.  My answer is that this is not always true, because you can pick a non-prime number that is greater than $1$ and its factor is equal to its square root.


I'm running QGIS 2.6 on OSGeo-Live 8.4 Virtual Machine based on Lubuntu 14.04.  I've set up a GRASS (GRASS GIS 7) environment in QGIS, and I have a merged .tif file of LiDAR images open in QGIS, so I want to use the grass tools to read the LiDAR image. Both the "grass tools" menu option and symbol are not highlighted and I can't select them (but some Grass tools are available such as add Grass raster/vector layer). What am I missing? How can I access the Grass tools?

Apparently, my linux ubuntu setup of QGIS doesn't contain grass gis, although when I initially installed it last week I added grass gis to the command line. Anyway, I typed in once again and installed grass gis 7.0, however while GRASS starts, the plugin QGIS for it doesn't show up. Any ideas?


Thaddeous Zak(Zack) 10. Komp fliger Aushbiloting(?) Regiment 72 Feld post Number 47671 10 Komp Jager Regiment 22 (Luftwaffe) '' OPERATION WALDTEUFEL''. From the 6th to 23rd March 1945, the 11th Luftwaffe Division crossed the Drava River near Valpovo and advanced towards Bolman and Tarjanci. They were pushed back by a counter attack from the 3rd Ukranian Front. His family never heard from him again.

Where can I find information on German soldiers from World War I and World War II?   I am curious to find out about my ancestors' role in the wars, i.e. what rank they had, where they where fighting, with whom and anything else.


Question :  Let $f$ be an entire function . Suppose for each $a \in \mathbb R$, there exist atleast one coefficient $c_n$ in $f(z) = \sum_{n=0}^{\infty}c_n (z-a)^n$, which is zero . Then   $f^{(n)}(0) = 0$ for infinitely many $ n \geq 0$ $f^{(2n)} (0) = 0$ for every $ n \geq 0$. $f^{(2n+1)} (0) = 0$ for every $ n \geq 0$. there exist a $ k \geq 0$ such that $f^{(n)} (0) = 0$ for all $ n \geq k$.   we know that the zeroes of a non constant analytic function is a discete set which is contable . So zeroes of each derivative set is countable . So its union is countable . If $f$ is not a polynomial, then we get a contradiction according to the statement of the question.  Thus $f$ is a polynomial. So (1) option and (4) option are true.  For (2) , $f(z) = z^2$, For (3), $f(z) = z^3$ are counter example.  I would be thankful, if someone check my Solution.  Thank you

I am solving previous year question paper some competitive exam. Give me some hint to solve the following problem.  Let $f$ be an entire function. Suppose for each $a \in \mathbb{R} $ there exists at least one coefficient $c_n$ in $f(z) = \sum_{n=0}^{\infty} c_n (z-a)^n$ which is zero. Then,  a) $f^{(n)}(0) = 0$ for infinitely many $n \ge 0$  b) $f^{(2n)}(0)=0$ $ \forall n \ge 0$  c) $f^{(2n+1)}(0)=0$  $ \forall n \ge 0$  d) $f^{(n)}(0) = 0$ for all sufficiently large n.  Thanks in advance.


What if Light wrote the name of Matsuda in the Death note and in the instructions he wrote that he would kill everyone in the room including L while Light was out of the room. Could he not have done something like this?

in the Death Note states:        Whether the cause of the individual's death is either a suicide or accident, if the death leads to the death of more than the intended, the person will simply die of a heart attack. This is to ensure that other lives are not influenced.      However,  states:        Even though only one name is written in the Death Note, if it influences and causes other humans that are not written in it to die, the victim’s cause of death will be a heart attack      Besides the fact that I find these 2 rules to be contradicting (correct me if I'm wrong), it still made me curious: Is it possible to kill people indirectly with the Death Note?  For example, writing a heart surgeon's name during a operation, or a pilot's name while mid-flight.


I am working on building a model car. I found that the manipulators won't work. The X, Y, Z axis don't do anything except move my 3D Cursor to where I clicked. I tried the Translation manipulator, Rotation manipulator, and the Scale manipulator. Is there anyway I can fix these manipulators so that they can work again?

I'm new to Blender, when I was working on a simple character like in the tutorial I'm following. I tried to change the shape of 2 cubes by moving the x and y arrows on the widget but it's not working and it doesn't even give me an arrow shape when I use box select. Does anyone know why this is happening and how I can fix it?


I’m trying to see what instruments I could use to analyse the following ODE in the complex plane: $ \dot{z} = \exp(it)\cdot \bar{z}$. Where $z$ is a function of real valued time.  ${{}}$

How do I solve $$x'=e^{it}\overline{x}?$$  This is a complex differential equation, but I don't see how to solve it.  Edit: the original ODE is given by $$(x', y')=\begin{pmatrix}\cos t& \sin t\\ \sin t&-\cos t\end{pmatrix}(x,y)$$ I want to show that solutions of this ODE do not remain bounded for all $t$, and the idea was to solve the complex equation.


I am trying to install firefox 27 through canonical repos but it shows firefox 26 as the latest version. How do i install firefox 27 on ubuntu 12.04?

I want to install the latest Firefox on my Ubuntu (64bit) box.  What is the best way to do this? Is there a specific update site or should I download the binaries manually? If doing manually, in which directory should I put the files? In my home directory, or is there a better place?


In college my physics professor showed us a thermoelectric couple powering a fan.  He also explained how if you apply a current it cools one side and heats the other side.  I have been working on a cooler that uses a TEC to cool the inside (see my posts  and ) but something is wrong.  When I give power to the TEC in the correct direction, one side gets so hot I burned myself, but the other side was getting warm.  Why is this side not getting cool?

Recently I ordered a Peltier unit online and received it yesterday. Naturally, I was very excited to play with it. When I first turned it on, One side got hot, an another very cold. I had read that I should attach a heat sink to the hot side of the unit. So straight away, I attached a heat sink and a fan to the hot side (The fan is pulling air out).   I also added a heat sink to the cool side. However, both sides started getting very hot. I have tried reversing the polarity, changing the fan to push, and used voltages from 4 to 12. After nothing worked, I removed the heat sink on the cold side, But still, both side remain stubborn  and insist on getting painstakingly hot.   Anyone got Any Ideas as to what's wrong?  Also, If it helps, at 12v the unit is using roughly 2A...


I suggest people answer with a curse word/short phrase and if the votes on it are net positive then it should be acceptable on normal SO.

Can I use salty, -laden language on Stack Exchange sites, like ?       For more information, see  in the .


This question pertains to USB-C not MagSafe. MagSafe negotiates available power with the . USB Power Delivery (PD) is an unrelated protocol. Answers based on experience with MagSafe are unlikely to be relevant.  I'm considering buying a 2016 MacBook Pro Retina about which :     the Griffin product was only powerful enough to offer 60W of power, not quite enough for the 87W needed to power the larger Pro models at fully   I'm also considering buying a  which it advertised as providing:     Mobile / Laptop Charging Up to 60W   What are the consequences of using a 60W supply instead of an 87W one?  Does it just mean it will take longer to charge the laptop?  Could it have side effects such as putting parts of the system into a slower, low-energy mode?   covers MagSafe power supplies but Charles Duffy's comment suggests that the rules for USB-C may be different.

My girlfriend has a Macbook Air.  The power supply is smaller and lighter than the Pro.  It has an output of 14.85V and 3.05Amps.  My Pro Retina has a power supply that is 20V and 4.25 Amps.    Both supplies have the same Magsafe adapter, so the power supplies seem interchangeable at a physical level, but what would happen if one of us plugs in using each other's adapter?    Could damage result from under-powering my MacBook Pro? (like a brownout)? Could damage result from over-powering her Air? (like a power surge)? Will the Macbook Air charge faster with a Pro adapter?


The question is This is what I have so far:  dict(nafta_capitals) = canadian_capitals, mexican_capitals, us_capitals   Given three dictionaries, associated with the variables , canadian_capitals, mexican_capitals, and us_capitals, that map provinces or states to their respective capitals, create a new dictionary that combines these three dictionaries, and associate it with a variable , nafta_capitals.

I have two Python dictionaries, and I want to write a single expression that returns these two dictionaries, merged (i.e. taking the union).  The update() method would be what I need, if it returned its result instead of modifying a dictionary in-place. >>> x = {'a': 1, 'b': 2} >>> y = {'b': 10, 'c': 11} >>> z = x.update(y) >>> print(z) None >>> x {'a': 1, 'b': 10, 'c': 11}  How can I get that final merged dictionary in z, not x? (To be extra-clear, the last-one-wins conflict-handling of dict.update() is what I'm looking for as well.)


Assume that Alice received 100 ciphertexts encrypted with additive homomorphic encryption, say Paillier, using the same public key that belongs to Bob. Alice added all of them, and wants to know the final sum, so she sends the final result (which is still encrypted of course) to Bob so that he can decrypt it with his private key, and return the result of the sum in clear text to Alice.  How can Alice be sure that Bob didn't give her a number that doesn't match her encrypted sum?  Should I use another additively homomorphic encryption if I want ZKP?

Alice and Bob are going to follow the protocol below.  Are there any crypto-constructions to help Bob verify the correctness of the answer he gets?:   Alice encrypts a set of numbers using some cryptosystem and a secret key (e.g. Paillier crypto-system). Bob multiplies the ciphertexts to obtain an encryption of the sum of numbers. Bob sends to Alice the ciphertext for the sum. Alice decrypts the sum with her secret key and then encrypts the sum with a key known by Bob. Bob receives the sum encrypted with his key and decrypts it successfully.   Question: how can Bob verify that Alice didn't change the sum to a different number before re-encrypting?  Is some sort of zero-knowledge proof helpful?


For example, it takes a car four times the kinetic energy to travel the same distance at twice the speed, which quadruples the drag experienced by the car. This observation is described by the standard equations: Drag  =  0.5 (Velocity2  x  Air Density  x  Surface Area  x  Coefficient of Drag) K.E.  =  0.5mv2 I'd really appreciate it if someone could critique a new explanation based on Newtons second law (force = ma), or confirm if this explanation is correct: For a car travelling at a constant velocity. The force from the engine pushing the car forwards (i.e. Force FORWARD = ma = m/dt x dv), equals mass of air each second (m/dt) that the car travels through and accelerates away from it at a given velocity (dv). The more aerodynamic cars will have a lower 'dv'. Force FORWARD = ma = m x dv/dt  =  m/dt x dv Just to be clear, note that 'm' and 'v' are NOT not the mass or the velocity of the car. This action generates an equal and opposite force, called drag. At constant speed, so no acceleration, the forward force will equal the drag, which is the force required to push the air out of the car's path. Force FORWARD   =   Force DRAG  If the car's speed doubles (x2); then the forward force, drag and kinetic energy required all quadruple (x4), as described by their standard equations above. The explanation for this quadrupling is: (i) The car will travel through twice the mass of air each second (2x ‘m/dt’). (ii) As the car's momentum has doubled, the car will accelerate this air travelled through to twice the velocity as before (2x ‘dv’). The combined effect is to quadruple the total force for drag each second; (i.e. 4x Force DRAG = 2m/dt x 2dv).  In addition, force and energy are proportional for a given distance travelled by the car, based on their respective definitions: Force   =   1 kg m /s2      =   1 N Energy  =   1 kg m2 /s2     =   1 J Given that the distance travelled by the car has not changed, but the force required to push the car forwards and drag have both quadrupled (x4), therefore, the kinetic energy required will also quadruple (KE x 4). This is why it takes four times the kinetic energy and drag to travel the same distance at twice the speed; And why kinetic energy and drag are proportional to velocity2. Is this correct?  Thanks!

As  says:     [...] the kinetic energy of a non-rotating object of mass $m$ traveling at a speed $v$ is $\frac{1}{2}mv^2$.   Why does this not increase linearly with speed? Why does it take so much more energy to go from $1\ \mathrm{m/s}$ to $2\ \mathrm{m/s}$ than it does to go from $0\ \mathrm{m/s}$ to $1\ \mathrm{m/s}$?  My intuition is wrong here, please help it out!


I forgot the real beginning of how the main character got involved, but he has to come to a meeting taking place in a gym with many random peoples (here for the same reason). Some chosen peoples get stuff (the MC receives a gold bag) and the first test begins : simply get out of the gym but in limited time. Once outside, the survivors must get into the high-school building, then inside they'll have to face new trials (escape monster, find items, etc) to finally reach the roof to complete the quest. On the roof there is a portal to a new zone (seems like hotel's interior) for resting, where they can get quests (from a board) to improve their skills. The survivors have months to improve before a war start...

A story about a male protagonist with special eyes that tells him if things are safe or not; green = safe. Can’t remember if it’s a manga or webtoon. It starts with a male protagonist who was dying on a battlefield, the goddess took pity on him, sent his emotions back into his younger self, (not memories). He had eyes that told him what is safe/good and what is dangerous/bad by using colors: green, orange, red. He used this to gamble, his eyes stopped working, borrowed money from his ex-girlfriend (who works in a cafe). Money got stolen while he took a nap by a river, the evil lady who stole his money tried to get him to enter a contract. From his future emotions, he knew he wanted an invitation instead. This leads to a gathering of people in a school gym, their tasks are given. Invited people are given bags with tools. An oni busted out under the floor. People get killed. Stairways with gates, etc. This is considered the tutorial. Points are given after, those points are needed to buy daily necessities. The protagonist had the highest points, given VIP room. Etc.


Which of the following is correct, and why?   Dad has allowed me to purchase a car.  Dad allowed me to purchase a car.

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


there! Hope everyone is doing fine. I've recently upgraded my laptop, Ubuntu 14.04 LTS to Ubuntu 20.04 LTS, but I do miss the wonderful dock the former does have. I mean, scrolling on the dock I could easily switch amongst windows (applications, files, etc), no additional clicks. Would anyone know how to have it on Ubuntu 20.04? Thanks in advance!

I installed ubuntu gnome because i didn't want unity but now i want the option to switch between unity and gnome. How do I get unity working?


Currently, when I want to change owner/group recursively, I do this:  find . -type f -exec chown <owner>.<group> {} \; find . -type d -exec chown <owner>.<group> {} \;   But that can take several minutes for each command. I heard that there was a way to do this so that it changes all the files at once (much faster), instead of one at a time, but I can't seem to find the info. Can that be done?

This conundrum is caused by running git pull from root.   There are various reasons for me to do so... I want my device to update code when booting up, and rc.local is run by root.  It all works mostly fine (npm install tends to fail when run by root, but that's a whole 'nother topic), the problem arises when I try to use the git repository with a non-root user afterward... some of the git files have been written by root, so now I can't use it anymore (permission denied).   So I'd like to recursively chown it back but there doesn't seem to be anything that really works on all of the little git files. I tried the -R flag and ./**/* path.  My guess is that neither of those techniques descend into dot-directories.


I'm taking the second course in Classical Mechanics which is being taught from John R. Taylor's book Classical Mechanics. What I think seriously lacks in my course is the big picture; the course mostly focuses on problem solving and the course instructor, along with the textbook, seem to make no meaningful attempt to delineate in some quantitative detail the advantages (and disadvantages perhaps) of the Lagrangian (and Hamiltonian) formulation; where does everything come from mathematically (rather than just minimizing a functional in analogy with minimizing functions); discussions on symmetries, conservation laws etc.  I'd really like a text that gives someone not only the big picture but also the theoretical aspects of these two mathematical formulations of mechanics for an undergraduate. Recommendations?  I know of books by Chow, Mariona and Thorton, Morin and Taylor but all of them seem to take the problem solving approach rather than theortically analyzing the frameworks as well.

I am looking for a book about "advanced" classical mechanics. By advanced I mean a book considering directly Lagrangian and Hamiltonian formulation, and also providing a firm basis in the geometrical consideration related to these to formalism (like tangent bundle, cotangent bundle, 1-form, 2-form, etc.).  I have , but I would like to go into more details about the [symplectic] geometrical and mathematical foundations of classical mechanics.  Additional note: A chapter about relativistic Hamiltonian dynamics would be a good thing.


Can $\sqrt{x}$ be considered a function for x (set of real numbers greater than or equal to 0)? Moreover, why is the graph of $\sqrt{x}$ only maps to positive y values if for example $\sqrt{9}$ = 3 and -3 shouldn’t it be symmetrical over the x axis?

It is perhaps a bit embarrassing that while doing higher-level math, I have forgot some more fundamental concepts. I would like to ask whether the square root of a number includes both the positive and the negative square roots.  I know that for an equation $x^2 = 9$, the solution is $x = \pm 3$. But if simply given $\sqrt{9}$, does one assume that to mean only the positive root? And when simply talking about the square root of a number in general, would one be referring to both roots or just the positive one, when neither is specified?


I have an interesting problem in building something with robotics.  I am using a PIC16F877A micro-controller to control the robot.  The motors of the robot require 6 volts and the PIC requires 5 volts.  I was wondering if there was an easy way to get both of these required voltages from a common voltage source.  The motors suggest running on 4 AA batteries, and I was going to just use a 7805 voltage regulator to than reduce the voltage to 5 volts, but the regulator requires at least 7 volts to function correctly.  I also thought that I could use a voltage divider network, but none seemed to be convenient.

I am designing a robot using the PIC16F877A microcontroller that will avoid walls and obstacles.  I plan to have it run off of 4 AA batteries.  I was wondering how i would convert the 6 volt input voltage to the 5 volts that the pic needs.  I need to use 6 volts because the h bridge circuit/the motors that I am using require it.  I also need exactly 5 volts, because i need a 5 volt reference voltage for my ADC and to run my sensor off of.  Using two batteries is an option, but I would hope to avoid at all costs.  Finally SMD products won't work, because I would like to build this on a breadboard.  I did ask a similar question here  but my needs have changed since then and the answers wont fit my problem.  How would a normal project overcomethis problem.


I have this bit of php that calls a short code with the date of today in the format i need.  <?php $today = date('d.m');  echo do_shortcode('[table id=1 column_widths="10%|10%|80%" filter="'.$today.'" /]'); ?>  I can put it in a page template and that works, but I would like to use it in a html/txt widget. How can I make a widget from the above?

how can I create a widget out of a php code? It's just a disqus code that I would like to place in the sidebar. I could just paste the code in the widget section (my  tag), but then I would not be able to change it's order with the other wigets. This is why I want to convert this code into a widget.


Consider this Fibonacci equation: $$f_{n+1}^2 - f_nf_{n+2}$$  The problem asked to write a program with given n, output the the result of this equation. I could use the formula  $$f_n = \frac{(1+\sqrt{5})^n - ( 1 - \sqrt{5} )^n}{2^n\sqrt{5}}$$  However, from mathworld, I found this formula Cassini's identity  $$f_{n-1}f_{n+1} - f_{n}^2 = (-1)^n$$  So, I decided to play around with the equation above, and I have:  $$ \text{Let } x = n + 1 $$ $$ \text{then the equation above becomes } f_x^2 - f_{x-1}f_{x+1} $$ $$ \Rightarrow -( f_{x-1}f_{x+1}  - f_x^2 ) = -1(-1)^x = (-1)^{x+1} = (-1)^{n+1+1} = (-1)^{n+2}$$  So this equation either is 1 or -1. Am I in the right track?     Thanks, Chan

Question: Let $F_n$ the sequence of Fibonacci numbers, given by $F_0 = 0, F_1 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 2$. Show for $n, m \in \mathbb{N}$: $$F_{n+m} = F_{n-1}F_m + F_n F_{m+1}$$   My (very limited) attempt so far: after creating a small list of the values $F_0=0, F_1=1, F_2=1, F_3=2, F_4=3, F_5=5, F_6=8, F_7=13, F_8=21, F_9=34, F_{10}=55$ i can see that yes it does seem to work for instance $F_{6+3}=F_5 F_3 +F_6 F_4 = 10 +24 = 34 = F_9$. However, I really don't know where to begin as showing that this must hold in general terms. Should I be looking to use limits? Or perhaps induction? What is the best way to solve this?


What is the name of the thing where objects are well connected and pass through different sections to finally help do one thing at the end in a creative way. Where an object moves along a specific path, hits another which has a new path which moves along and hits another etc? :)

I love that concept whenever any company comes up with it as a part of their marketing campaign but not sure what do we call such action.   The action starts with one tiny thing (say striking a small metal ball) and it hits another thing that swings further and does some action. The beauty continues and finally a big gate may open showing some message/greetings. So, a small tiny ball to a giant gate everything happens kinetically.    and  are two videos showing the action which is brilliantly crafted. I know the word '' but I've always used, heard and seen the phrase in a different context. Even the dictionary uses an example that does not fit to my concern.


I have noticed a chain-like shape when milk is poured from a height into a cup.  The chain pattern repeats itself after some distance till it reaches the milk in the cup.  Any reason behind this?

While pouring a liquid into a glass from a bottle, some streams have a wavy shape, like the one in the following photo:    What causes the stream to be of such a shape?


So in markdown the code >! makes a spoiler block.  Something like >! Hello gives     Hello   with a nice fade in/out effect. However, when you insert an image or tag like >! Hello [tag:bug] it does not display correctly. Example:      Hello this are bugs in StackExchange:    The tag does not hide itself when the mouse is on top of the block. Same for images. Example:   >! This is a picture of Jeff Atwood: ![Jeff Atwood][1] [1]: http://i.stack.imgur.com/3l9vY.png   Gives :      This is a picture of Jeff Atwood: .   The text still fades in/out but the image does not. For the tag, the text fades in/out but the border does not and the text color changed from the background color of the block to green.  On older sites like , you get . The text "eyeballcode" is in the tilder notation thing inside a spoiler. Also, there is no fade in/out effect.

When a spoiler blockquote contains text, the text transitions in smoothly using a CSS transition. If it contains an image, the transition is abrupt.    If the CSS were changed from:  .spoiler:hover img {     visibility: visible; } .spoiler img {     visibility: hidden; }   to:  .spoiler:hover img {     opacity: 1; } .spoiler img {     opacity: 0;     transition: opacity 0.5s ease-in; }   .  Live example:      this is a test this is only a test


I'm trying to copy over a question from my math homework to LaTeX, and can't figure out how to replicate this box between $G_1$ and $G_2$:     I've tried \qed, but that is always preceded with a space:   I've tried \fbox{}, but it is too low in the line:   How do you think my professor achieved the box?

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I was editing some posts and I came across , it has 5 questions in total. My Question is, What flag should I use on posts with multiple questions? Or should I flag at all?

I have looked at the various help pages but I couldn't find a clear guideline for the following issue: often enough someone will ask in the same post (i.e. in the same SE-question) a whole bunch of questions (in the plain English sense of the word), which while may be about the same topic are nevertheless sufficiently distinct that each may require several paragraphs of text to answer adequately.   I can see an upside for leaving related questions grouped together from the asker's perspective: "there's a thread (on SE) answering all my questions about topic T!" On the other hand, from the perspective of organizing questions by having a clear heading/title for each (actual) question and so forth, i.e. from the perspective of SE being a fairly structured database of Q&As instead of being a more like a collection of forum threads "I'm confused about topic T", the omnibus question-list approach seems clearly sub-optimal.  The omnibus approach also makes the issue of accepting answers (and perhaps reviewing such actions) difficult: if two different users give replies to different parts/sub-sets of the question-list, which one is the most adequate one? Even upvoting all partial answers seems iffy because it actually penalizes the user(s) who provides(s) the most complete answer to the question-list: since a user can only give at most one upvote to another user's answer, if user X provides answers to A & B in the same SE-answer, he can only get at most one upvote from user Y, whereas if these were two different SE-answers, he could get two upvotes from user Y.  So, given the above problems, which I think are real enough, is there anything in the SE system addressing list-of-questions question splitting?


Young's double slit experiment we can fire only one electron (particle) we can observed interference pattern? or required more than one particle to observed interference pattern?

In a double-slit experiment, interference patterns are shown when light passes through the slits and illuminate the screen. So the question is, if one shoots a single photon, does the screen show interference pattern? Or does the screen show only one location that the single photon particle is at?


I want direct answer for this and some interpretation with example. why do we need conservative force to define potential energy? what is wrong with non-conservative force and other? I have seen many question here but i don't understand.

A  field is one in which all that matters is that a particle goes from point A to point B. The time (or otherwise) path involved makes no difference.   Most force fields in physics are  (conservation laws of mass, energy, etc.). But in many other applications, the time paths DO matter, meaning that the force field is not "conservative."  What causes a force field to be "non-conservative?" Could you give some examples (probably outside of physics)?


I have a Lenovo laptop, on which I run Ubuntu. I have a pair of bluetooth headphones which I have used with the laptop for some time, without problems. Now I have updated to 20.04, and the headphones do not work: I have checked that i) bluetooth is working, ii) the pulseaudio and pulseaudio-module-blutooth module are installed, iii) bluetooth sees the headphones, and iv) the computer thinks it is sending audio to bluetooth, but the sound actually comes out through the laptop speakers.   systemctl status bluetooth says this: ● bluetooth.service - Bluetooth service      Loaded: loaded (/lib/systemd/system/bluetooth.service; enabled; vendor preset: enabled)      Active: active (running) since Sat 2020-04-25 13:18:52 BST; 22min ago        Docs: man:bluetoothd(8)    Main PID: 11368 (bluetoothd)      Status: "Running"       Tasks: 1 (limit: 9341)      Memory: 1.8M      CGroup: /system.slice/bluetooth.service              └─11368 /usr/lib/bluetooth/bluetoothd  Apr 25 13:18:52 malebranche bluetoothd[11368]: Bluetooth daemon 5.53 Apr 25 13:18:52 malebranche systemd[1]: Started Bluetooth service. Apr 25 13:18:52 malebranche bluetoothd[11368]: Starting SDP server Apr 25 13:18:52 malebranche bluetoothd[11368]: Bluetooth management interface 1.14 initialized Apr 25 13:18:52 malebranche bluetoothd[11368]: Endpoint registered: sender=:1.173 path=/MediaEndpoint/A2DPSink/sbc Apr 25 13:18:52 malebranche bluetoothd[11368]: Endpoint registered: sender=:1.173 path=/MediaEndpoint/A2DPSource/sbc Apr 25 13:19:45 malebranche bluetoothd[11368]: /org/bluez/hci0/dev_E8_07_BF_04_1B_D0/sep1/fd0: fd(38) ready Apr 25 13:21:35 malebranche bluetoothd[11368]: /org/bluez/hci0/dev_E8_07_BF_04_1B_D0/sep1/fd1: fd(53) ready Apr 25 13:30:53 malebranche bluetoothd[11368]: Unable to get io data for Headset Voice gateway: getpeername: Transport endpoint is not connected (107) Apr 25 13:31:09 malebranche bluetoothd[11368]: /org/bluez/hci0/dev_E8_07_BF_04_1B_D0/sep1/fd2: fd(53) ready   However, the sound settings panel says that the sound output is through the headset, but when I press the "test" button, sound comes out through the laptop speakers. This happens both when the configuration is A2DP or HSP/HFP  So, the GUI says that all is well, whereas systemctl status says that something is going wrong.

This is on a machine I upgraded from 18.04 to 20.04 a few days ago. No issues at all getting sound to play out of headphones on 18.04.  The headphones are paired with Bluetooth. I unpaired and repaired them just to be sure. The settings panel for sound has them as an output option and I can select it without issue. However, no sound ever comes out of the headphones. I've even adjusted the volume both in the settings panel, in alsamixer and in pavucontrol. Nothing changes.  I see no errors in the bluetooth service log.  Output of:  { sudo lshw | grep product | head -n1 && sudo lspci -knn | grep Net -A3 && lsusb -v; } >output.txt 2>&1


What exactly is ? Why is it measure of randomness?  I have been told Entropy is measure of randomness and it increases everytime randomness increases. What is Randomness? Randomness in what?  Also let us take a gas filled in an adiabatic chamber which is allowed to expand against vacuum thus Work = 0. Also since it is adiabatic, $Q = 0$. By first law of thermodynamics, change in internal energy is also zero.  Here, entropy would increase since volume has increased but the walls were adiabatic, so be $dQ/T$ should be zero at all points and so should be the integration of it which equals change in entropy.  Please explain.

I am studying entropy and its hard for me to catch up what exactly is entropy.  Many articles and books write that entropy is the measure of randomness or disorder of the system. They say when a gas system is let expand the randomness increases etc. But they end up saying $\frac{\mathrm dQ}{T}$ is the measure of increase in randomness and is called the entropy.  Even if I believe that entropy is the measure of randomness of the system I don't understand:   How does $\frac{\mathrm dQ}{T}$ hold the information about the randomness of the system? How is entropy independent property of any system. I suppose that any two parameter in the equation $PV=nRT$ should completely describe the system. Why would we need entropy?   Thank you.


Currently I have Firefox 45.02 and Thunderbird 38.6.0 installed on my PC.  I have downloaded Firefox 55.0.3 and Thunderbird 52.3.0 from the respective websites but how do I run and install these applications.  If I click on the downloads, all I get is a list of files but I do not see a setup-exe file anywhere.  I am not familiar with Linuc commands but what do I need to run and install.  I am running Ubuntu 16.04.  All responses would be appreciated.

Similar to , what's the best way to stay up to date with the latest stable releases of Thunderbird?


So I store my websites on a partition of my laptops hard drive. Programs and my bash scripts say that this partition does not exist, until I personally open the partition up by clicking the icon on the left side.  I am not sure why that is, and then how I could fix it so it either auto loads on startup or my bash script automatically loads it.

I am on Kubuntu 12.04.  I have five labelled ext4 partitions on an external removable 1 TB external USB hard drive.  When the drive is plugged in, a box pops up, asking me what I want to do for each partition. If I elect to use the dolphin file manager, it mounts the relevant partition on /media/LABEL where LABEL is the label of that partition. Interestingly, the directories on /media disappear after the external drive is ejected.  To enable automated backups, I want to find out if the mounting can be done automatically without having to click on the popup box to select the dolphin file manager? Essentially, I wish to:   automount each partition on USB plugin on /media/LABEL as before where the directories under /media are created automatically on the fly; and On ejection, automatically unmount partitions and remove the directories under /media.   Thanks.


I can see on Ubuntu website that its an open-source software, free to use. Though i would like to know if all Ubuntu OS versions are free to use ? Example 18.04.4 LTS ? What does LTS actually mean in it ? Thankyou

I really need to know if the latest version of Ubuntu is free ?


I am trying to make a password prompt using C++. My code is given below: #include <iostream> #include <string> std::string operator * (std::string a, unsigned int b) {     std::string output = "";     while (b--) {         output += a;     }     return output; } int main(){     std::string pword;     std::string user;     std::cout << "Enter username: ";     std::cin >> user;     std::cout << "Enter password for user '" << user << "': ";     std::cin >> pword;     std::string pword_asterix = ("*") * pword.length();  // ERROR     std::clog << "Noted user '" << user << "' and password '" << pword_asterix << "'.";  But I'm getting the following error from Visual Studio Code:  expression must have arithmetic or unscoped enum type(Line 17)  What should I do?

I want to insert 'n' spaces (or any string) at the beginning of a string in C++. Is there any direct way to do this using either std::strings or char* strings?  E.g. in Python you could simply do  >>> "." * 5 + "lolcat" '.....lolcat'


Find the remainder when $5^{5555}$ is divided by $10000$.  A step by step guide with explanation for a beginner student in modular arithmetic is needed.

How do I efficiently compute $a^b\bmod c$:  When $b$ is huge, for instance $5^{844325}\bmod 21$? When $b$ is less than $c$ but it would still be a lot of work to multiply $a$ by itself $b$ times, for instance $5^{69}\bmod 101$? When $(a,c)\ne1$, for instance $6^{103}\bmod 14$?  Are there any other tricks for evaluating exponents in modular arithmetic?  This is being asked in an effort to cut down on duplicates, see  and .


I'm looking to fill a 3x3 matrix in the most pythonic way from a 1D list.  So transform from the first to the second  [1,2,3,4,5,6,7,8,9]  [ [1, 2, 3], [4, 5, 6], [7, 8, 9] ]   so far I can fill the first as such:  l = [1,2,3,4,5,6,7,8,9] m = [[l[y] for y in range(3)] for x in range(3)]   but this gives  [['1', '2', '3'], ['4', '5', '6'], ['7', '8', '9']]

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


Knowing that both $x \sim \mathcal{N}(0,1)$ and $y \sim \mathcal{N}(0,1)$ ($x,y$ independent from each other), I want to compute  $$\mathbb{P}(3x > -y > x \land x > 0 \land y < 0)$$  I'm aware that if two events are independent, I can take the two probabilities and multiply. E.g., if I were only interested in   $$ \mathbb{P}(x > 0 \land y < 0) $$  I would simply compute $\mathbb{P}(x > 0) \mathbb{P}(y < 0)$.  However, in the problem described above, the condition $3x > -y > x$ is clearly not independent from the two other conditions $x >0 \land y <0$. I think that I should re-formulate the condition to $3x > -y \land -y > x$ ... but that still leaves the issue that the conditions are somewhat dependent from each other.  How can I approach such a problem?

Let X and Y be independent random variables such that $X∼Exp(1)$ and $Y∼Exp(2)$.  Find the probability that $3X+4Y≤5$.  I thought the equation for solving this was the integral from $\int_0^a \int_ 0^{(a-y)} \lambda_1 e^{-\lambda_1 x}\lambda_2 e^{-\lambda_2 y} dx dy$ where $a = 5$, so I first started with the integral from $\int_0^5 \int_0^{(5-y)} 3 \times 1e^{-1x} \times 4 \times 2e^{-2y} dx dy$ and got $23.83828927$ which is much larger than a probability can be. Any help?


The question  is flagged as a duplicate of  and they do not appear to be duplicates at all. The first question is specifically aimed at the Android platform.  In fact,  mentions the word Android in the title, it is tagged as android, and android-networking.  The example given in the question is specifically using the Android API. Mean while, the  question makes no mention of Android in the question, or tags at all.  In fact, The only mention of Android is people asking what the target platform is. The original author of  commented to a question:  are you developing on android? – dogbane Dec 22 '10 at 11:35 Yes.But I wish if there is anyway to find interface typr from native java Apis – dheeps Dec 22 '10 at 11:58  Clearly they are looking for a Java only answer, and not Android specific.

I asked a question regarding a very specific feature of a program and whether or not it works with a larger program.  Within hours someone had marked it with "This question may already have an answer here of a similar question, but not related to my question.  The question I asked IS NOT ADDRESSED in the referred-to question. It's frustrating to spend half an hour putting together an intelligent and specific question, and then have someone mark it as a duplicate (or possible duplicate), which apparently causes people to skip over my question. I haven't received any more responses since the question was flagged.   Two questions:  (1) How do I get this flagging removed and (2) what's the best way to prevent these "helpful" flaggings in the future?


I am working on a research project and I am trying to find one variable (execution time) as a function of a number of other variables/ metrics which were logged during the execution of a job. There are hundreds of these metrics and I want to find out which of these metrics/variables can actually be used for predicting execution times of jobs. So it is dimensionality reduction before I can use some sort of regression or machine learning. The problem is the number of rows (observations) is much smaller (45) as compared to the number of columns and therefore, rank deficiency. I have tried PCA, did not give any significant results. What other techniques can I use to find out a smaller subset of metrics that actually matter in execution time?

I am trying see whether to go for ridge regression, LASSO, principal component regression (PCR), or Partial Least Squares (PLS) in a situation where there are large number of variables / features ($p$) and smaller number of samples ($n<p$), and my objective is prediction.   This my understanding:     shrinks the regression coefficients, but uses all coefficients without making them $0$.  also shrinks the coefficients, but also makes them $0$, meaning that it can do variable selection too.  Principal component regression truncates the components so that $p$ becomes less than $n$; it will discard $p-n$ components. Partial least square also constructs a set of linear combinations of the inputs for regression, but unlike PCR it uses $y$ (in addition to $X$) for dimensionality reduction. The main practical difference between PCR and PLS regression is that PCR often needs more components than PLS to achieve the same prediction error ().   Consider the following dummy data (the actual data I am trying to work with is similar):    #random population of 200 subjects with 1000 variables   M <- matrix(rep(0,200*100),200,1000) for (i in 1:200) { set.seed(i)   M[i,] <- ifelse(runif(1000)<0.5,-1,1) } rownames(M) <- 1:200  #random yvars  set.seed(1234) u <- rnorm(1000) g <- as.vector(crossprod(t(M),u)) h2 <- 0.5  set.seed(234) y <- g + rnorm(200,mean=0,sd=sqrt((1-h2)/h2*var(g)))  myd <- data.frame(y=y, M)   Implementation of four methods:      require(glmnet)   # LASSO   fit1=glmnet(M,y, family="gaussian", alpha=1)   # Ridge     fit1=glmnet(M,y, family="gaussian", alpha=0)   # PLS  require(pls)  fit3 <- plsr(y ~ ., ncomp = 198, data = myd, validation = "LOO")  # taking 198 components and using leave-one-out cross validation   summary(fit3)  plot(RMSEP(fit3), legendpos = "topright")   # PCR   fit4 <- pcr(y ~ ., ncomp = 198, data = myd, validation = "LOO")   The best description of the data is:    $p > n$, most of times  $p>10n$; Variables ($X$ and $Y$) are correlated with each other with different degrees.   My question is which strategy may be best for this situation? Why?