Ok, so I've been ripping my hair off for the past 2 days now. I'm developing a web-site with a car catalog which contains the following hierarchy (taxonomy hierarchy):  -brand1 --model1 --model2 --model3 -brand2 --model1 --model2 --model3   ...and so on.  What I'm trying to achieve is when a user selects a parent term (brand), they'll see all the nodes from all the children terms. Currently a parent term doesn't display anything.   I already Googled my problem but none of the solutions seem to work for me (or it's possible I'm doing something wrong).  My configuration is as follows: Drupal 7.2x Views 3.7 Taxonomy Menu 1.4 module - used for generating menu trees from vocabularies. Pathauto 1.2    I use views to display the whole vocabulary - and it works as intended.  Can some one please give me a step-by-step guide on how to achieve this? Especially if it involves Views, as I'm still a noob with Views.  Is it possible the Taxonomy Menu module is causing trouble?
I make use of the view: "taxonomy term". Is there an easy way to also show the children of a term, next to the nodes beloging to this term?  Example:  Cars - Volvo --- Family_cars --- Sports_cars - Honda --- Parts --- ... Trucks - ...   When you see the "cars" page I want to show all articles about cars (but not about Volvo, Honda, ...) AND I want to show the children (Volvo, Honda, ...) When you click one of these I want to show all the articles belonging with them, again with their children.
Complex zeros of the polynomials $\sum_{k=0}^{n} z^k/k!$, inside balls PATH variable resets with reboot Just as the title indicates my PATH variable resets after every reboot. I read that I have to edit my bashrc file's PATH variable, but I don't have anything there that suggests anything related to the PATH variable. In most of the mechanics textbooks , the  is stated without any justification or an experiment to confirm this law. Also after introducing this law forces are also decomposed without any justification. Please suggest any links or books related to this. Any help will be appreciated. Thanks in advance. Sequence of a product of functions in $L^p. L^q$ with $p,q$ conjugate The question is: if $f_i$ is a sequence of functions in $L^p$ converging to $f$ and $g_i$ a sequence in $L^q$ converging to $g$ show that $f_ig_i$ converges to $fg$ in $L^1$ for $p,q$ finite and $\frac{1}{p}+\frac{1}{q}=1$. Does this result hold if $p=1, q=\infty$?  So I think I showed the first part. $||f_ig_i-fg||_1=||f_ig_i-f_ig+f_ig-fg||_1\leq||f_ig_i-f_ig||_1+||f_ig-fg||_1 = ||f_i(g_i-g)||_1+||g(f_i-f)||_1\leq||f_i||_p||g_i-g||_q+||g||_q||f_i-f||_p$   (by Holder's inequality) which goes to $0$ as $i\rightarrow\infty$.  However the second part of the question throws me off because I don't see why this proof doesn't work just as well for $p=1,q=\infty$.  Am I missing something? Does the second part also hold? How to install MariaDB? What is the most stable/safest way to install MariaDB? bash: ./program: cannot execute binary file: Exec format error I'm trying to run a program, but an error happens like this:  bash: ./program: cannot execute binary file: Exec format error   The result of file program was:  program: ELF-32-bit LSB executable, ARM, EABI4 version 1 (SYSV), dynamically linked(uses share libs), for GNU/LINUX 2.6.16, not stripped   How can I fix this error?  I'm using Ubuntu 14.04.2 (amd64) with VMware. I also tried with Ubuntu i386, but result was same. Android app "Unknown error" when uploading photo Spent a half hour on this. Android 5.1.1 latest version SE app (Play Store won't let me update so latest).   Tried to upload photo into an answer. "Something went wrong".  Did tricks to reduce photo size to 275k -- same.    45k rep on the stack.  Here is the photo..... oh wait.  How do I solve? Is an idle temperature of 66°C for the A10-6800K CPU normal? I have an A10-6800K CPU and Piriform Speccy says that my CPU temp is 66 celcius in idle, the same goes for HWMonitor.  Is this normal/ideal? I have a  with a . Grammatical number agreement in a complex phrase using singular "they" Executing a certain action for all elements in an Enumerable How to arrive at $\int_{0}^{1} f^3(x) \, dx < (\int_{0}^{1} f(x) \, dx)^2$? Define $f : [0,1] \to \mathbb{R} $ differentiable satisfying $f(0)=0$ and $0&lt;f'(x)&lt;1$. Prove:  $\displaystyle\int_{0}^{1} f^3(x) \, dx &lt; \left(\displaystyle\int_{0}^{1} f(x) \, dx\right)^2$ I found the following answer,  Define $F(x)=\displaystyle\int_{0}^{x} f^3(t) \, dt - \left(\displaystyle\int_{0}^{x} f(t) \, dt\right)^2$ We have $$F'(x)=f^3(x)-2 \left(\displaystyle\int_{0}^{x} f(t) \, dt\right)f(x)=f(x)\left[f^2(x)-2 \left(\displaystyle\int_{0}^{x} f(t) \, dt\right)\right]$$ and $$\left[f^2(x)-2 \left(\displaystyle\int_{0}^{x} f(t) \, dt\right)\right]'=2f(x)\left[f'(x)-1\right]$$ from which we can arrive at the conclusion.  But I felt a little confused. In the past I usually proved the inequality by classical inequalities and something like Taylor expansion to use the condition about derivative. But this answer is little out of my expectation. Do we have other proofs or ideas to arrive at $\displaystyle\int_{0}^{1} f^3(x) \, dx &lt; \left(\displaystyle\int_{0}^{1} f(x) \, dx\right)^2$? And other thoughts about solving these types of issues? I think when we talk about $\left(\displaystyle\int_{0}^{1} f(x) \, dx\right)^2 &gt;\ldots \,$ it's a little difficult to deal with. I don't quite know what tools to use. Do any (non-hardware) RNGs exist which could be used to create an OTP for crypto purposes? I'm looking for an ASCII art generator (text is preferred, but images will do too) in the  style, but with text instead of trains. Any suggestion? How do I erase/format a harddisk from a live CD? I need to format a drive containing an old install of Ubuntu 10.04, to install Vista (not my idea!) Vista setup apparently refuses to format non-FAT32 or NTFS partitions. However, I can't seem to format it from my live CD (Ubuntu 11.04) at all; I keep getting "device is busy" errors. What is the simplest way to format this drive? Unexpected gaps in IDENTITY column I'm trying to generate unique purchase order numbers that start at 1 and increment by 1. I have a PONumber table created using this script:  CREATE TABLE [dbo].[PONumbers] (   [PONumberPK] [int] IDENTITY(1,1) NOT NULL,   [NewPONo] [bit] NOT NULL,   [DateInserted] [datetime] NOT NULL DEFAULT GETDATE(),   CONSTRAINT [PONumbersPK] PRIMARY KEY CLUSTERED ([PONumberPK] ASC)     );   And a stored procedure created using this script:  CREATE PROCEDURE [dbo].[GetPONumber]  AS BEGIN     SET NOCOUNT ON;      INSERT INTO [dbo].[PONumbers]([NewPONo]) VALUES(1);     SELECT SCOPE_IDENTITY() AS PONumber; END   At the time of creation, this works fine. When the stored procedure runs, it starts at the desired number and increments by 1.  The strange thing is that, if I shut down or hibernate my computer, then the next time the procedure runs, the sequence has advanced by almost 1000.   See results below:    You can see that the number jumped from 8 to 1002!   Why is this happening?  How do I ensure that numbers aren't skipped like that?  All I need is for SQL to generate numbers that are:   a) Guaranteed unique.  b) increment by the desired amount.    I admit I'm not a SQL expert. Do I misunderstand what SCOPE_IDENTITY() does?  Should I be using a different approach? I looked into sequences in SQL 2012+, but Microsoft says that they are not guaranteed to be unique by default. Seems like this is the most powerful weapon of all: transport your enemy into a bulkhead, planet, etc. Transport your enemy's ship inside a planet, etc.  Is there some technical reason that it can not be used this way? Is it necessary to use commas in lists before the conjunction? I have seen many sentences like this:     "Capitalism, Socialism, and Anarchism"   and this:     "She was happy, and cheerful"   Do we have to use a comma before "and", or is it incorrect?  If it is not, then why? force long text inside \item[{\texttt{}] to wrap Why is it that scanf() needs the l in "%lf" when reading a double, when printf() can use "%f" regardless of whether its argument is a double or a float?  Example code:  double d; scanf("%lf", &amp;d); printf("%f", d); How to pronounce "Stannis's"? I know that the &quot;s&quot; becomes &quot;z&quot; when it comes after a voiced sound. And it is pronounced as &quot;s&quot; when it comes after a voiceless sound. I also know rules about possessives but I don't know how natives pronounce a word when it ends in S and &quot;apostrophe S&quot; is added to it. For example: &quot;Stannis's army&quot;. Do you add another syllable to it? Like Stannisiz? or just Stannis and ignore the possessive S? I really have difficulty in pronouncing words that end in S and possessive S is attached to it.