Search and replace a string with another string which has backslash within unix file
How to insert strings containing slashes with sed?
What is the default /etc/inittab file on a fresh install of Debian Jessie? I'm looking for the full contents of the default /etc/inittab file on a fresh install of Debian 8.7 before any system-specific modifications are made.    I searched for this on the Debian website and other forums, but could not find it. Unable to login after password change, having home directory encrypted Frequency of the sound when blowing in a bottle I’m looking for a word I’m struggling to remember that refers to a job or role which is inconsequential and usually created in order to install someone in a company, not based on their merit.  An example would be creating a vague new role for a friend’s son. The word I’m looking for refers to the actual job itself - it’s a noun that would replace the ‘job’ (e.g “they put so and so’s cousin in a ____”).   I believe the word may not be a strictly formal or technical word but I don’t think it was slang. For $G$ group and $H$ subgroup of finite index, prove that $N \subset H$ normal subgroup of $G$ of finite index exists Here is the problem: From any IP address not belonging to your mail server:  telnet me.myemailserver.com 25    helo me.someserver.com mail from: &lt;yourusername@mydomain.com&gt; rcpt to: &lt;yourusername@mydomain.com&gt; data This is spam.  Buy my stuff. .   I'm using Postfix.  I'm having a problem finding a solution to requiring SMTP-AUTH for email claiming to be from mydomain.com.  Googling around, this guy has identified the same problem (where I cut-n-paste with some modifications) the above example from:   This link   gets close to a solution but it has a side effect of requiring SMTP-AUTH for mail not from mydomain.com.  For mail not claiming to be from mydomain.com, I would do the usual RBL and Spam filtering.  In short, I want to reject mail to local domains (mydomain.com) from outside/unauthenticated clients claiming to be from local domains (mydomain.com).  This is what I tried: I've tried both permit and reject as the default.  Here is exact excerpt from my main.cf:  smtpd_recipient_restrictions = reject_unauth_pipelining,                            permit_sasl_authenticated,                            check_recipient_access pgsql:/etc/postfix/pgsql-recipient.cf,                            reject_unauthenticated_sender_login_mismatch,                            reject_unauth_destination,                            reject_unlisted_recipient,                            check_sender_access pgsql:/etc/postfix/pgsql-sender.cf,                            reject_unlisted_sender,                            reject_invalid_hostname,                            reject_non_fqdn_hostname,                            reject_non_fqdn_sender,                            reject_non_fqdn_recipient,                            reject_unknown_sender_domain,                            reject_unknown_recipient_domain,                            reject_rbl_client cbl.abuseat.org,                            reject_rbl_client sbl.spamhaus.org,                            reject_rbl_client sbl-xbl.spamhaus.org,                            reject_rbl_client bl.spamcop.net,                            reject_rbl_client dnsbl.njabl.org,                            reject_rbl_client blackholes.wirehub.net,                            reject_rbl_client relays.mail-abuse.org,                            reject_rbl_client dialups.mail-abuse.org,                            reject_rbl_client blackholes.mail-abuse.org,                            reject_rhsbl_sender dsn.rfc-ignorant.org,                            (reject and permit both tried here) My machine is currently running Windows 7. I have 2 partitions: OS (C:) and DATA (D:). I intend to do a native Ubuntu 14.04 install. Assuming I format my Windows OS partition, will I have full access to my D partition in Ubuntu ? I am not asking for a solution to speed it up, i simply want to know how long it should take!  I would also like a way to speed it up but not something technical, im new to Blender! In the context of metric (and in general first-countable) topologies, it's reasonably clear what a closed set is: a set $F$ is closed if and only if every convergent sequence of points in $F$ converges to a point also in $F$. This naturally generalises to the definition of a closed set in an arbitrary topological space using the concept of limit points... but limit points are defined in terms of open sets, which are, to me, somewhat more mysterious than closed sets.  I was once told that ultrafilters axiomatise the concept of (sets of) big sets. I'm hoping here to find a similar conceptual picture of topologies defined by systems of open sets, preferably without reference to closed sets. One such explanation I've seen is that open set axiomatise the concept of nearness, which, I suppose, is fair enough at least for metric topologies. Indeed, if something is "happening" at points near $x \in X$, then it's usually the case that every open neighbourhood $U \subseteq X$ of $x$ contains an open subset $V \subseteq U$, $x \in V$, such that the something "happens" at all points in $V$. But what about non-metrisable topologies, particularly the coarse ones where there are no "small" open sets?  Consider, for example, the Zariski topology on affine $n$-space $\mathbb{A}^n$. $\mathbb{A}^n$ is irreducible, so every non-empty open set is dense. It seems reasonable to interpret this to mean that every non-empty open set is "large". Indeed, if we work over the complex numbers, then in the usual metric geometry, Zariski-open sets are unbounded and have full measure, so are very large indeed, so I don't think it's fair to say that open sets are capturing the notion of nearness here.  I'm also curious about the history of point set topology. When were the axioms first written down? What were the first "non-geometric" examples of topological spaces — "non-geometric" here referring to either non-metrisable topologies or topologies on sets other than sets of points of some intuitively geometric object — and were they part of the motivations for creating point set topology? Single question thread with multiple questions, some duplicates I've recently run into many questions where to author asks several related questions in one post, many of them asked before.   I'm wondering what out policy is on such questions:   Should I vote-close them as being not constructive? Should I vote-close them as duplicates? Should I leave them be? Or even suggest an answer?    - Each of the questions: Waiting for an AJAX request with selenium, and headless browsing in selenium have been asked here before, but he asked both in one.  I've done my best to search for similar questions here in meta but I was unable to find any, reading appreciated. A question was asked in one of my friend's interview. The question was to determine the right form from the below sentences.     Q. Correct form of English:          Samuel was with Susan and I   Samuel was with Susan and me   Samuel was with I and Susan   Samuel was with me and Susan   None of these      Now I vaguely remember a rule of thumb from my school days. That is "2-3-1" i.e. where all the persons are acting in a sentence, second person comes first, then third person and it is followed by first person.  So according to this theory, 1 seems to be correct to me. Is this theory correct? Is it possible to bring built-in lightning components into aura component? I have a form that needs to let the user select 3 out of 5 products, something similar to Order > Add Product (Modal). I was wondering if there was a way to bring that piece into my component (markup) and add some sort of filter that only shows the products I want to show.  What I found so far:  &lt;lightning:listView objectApiName="Products2" listName="productsView" showActionBar="true" enableInlineEdit="true" showRowLevelActions="true"/&gt;   But Product2 is not supported for that component.  also these from browser inspector:  forceMultiAddUsingLVM forceListViewManager   These are data-aura-class attributes when rendered.  I'm looking for directions here. Thanks in advance. Prove the following inequality:   $$\dfrac{e^x + e^{-x}}2 \le e^{\frac{x^2}{2}}$$   This should be solved using Taylor series.  I tried expanding the left to the 5th degree and the right site to the 3rd degree, but it didn't help.  Any tips? For multiple OTP keys, why not do this:  Key = Hash[(EC)DH Shared Secret + Counter]  The counter will increase per message, and the output of the hash will be random for each new unique input into it. What are the problems or weaknesses with this design??  EDIT: For clarification: both parties will have the shared secret from an ECDH exchange, random numbers from Pythons os.urandom for generating the ECC key How to configure an exposed filter in a view using a date picker? Copy maintenance plans to a different server Is there a way to copy maintenance plans from one SQL Server 2012 to another? Both servers are not accessible via the same copy of Management Studio at the same time (on different networks). Why do we need to use:  extern "C" { #include &lt;foo.h&gt; }   Specifically:     When should we use it? What is happening at the compiler/linker level that requires us to use it?   How in terms of compilation/linking does this solve the problems which require us to use it? wanted to get end date for Current Fiscal Quarter in apex any ideas, how to get this information. Strictly Upper Triangular $n\times n$ Matrices form a Nilpotent Lie Algebra over $\mathbb{C}$ for $n\geq 2$ I have been attempting this problem for a while, it is an assignment problem so I don't want somebody to just post the answer, I'm just looking for hints.  Let $\mathfrak{u}(n,\mathbb{C})$ be the Lie algebra of strictly upper triangular $n\times n$ matrices over $\mathbb{C}$.  I am trying to show that $\mathfrak{u}(n,\mathbb{C})$ is a nilpotent Lie algebra for $n\geq 2$.  This is what I have looked at so far.  I have done some explicit calculations (I shall omit the bulk of them and just summarise below) for $n=2,3,4$ and have come up with some ideas.  Let $L=\mathfrak{u}(n, \mathbb{C})$.  If $n=2$,  $L^1 = [L, L] = &lt;0&gt;_{\mathbb{C}}$  So $L$ is nilpotent.  If $n=3$,  $L^1 = [L, L] = &lt;e_{13}&gt;_{\mathbb{C}}$  $L^2 = [L, L^1] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  If $n=3$  $L^1 = [L,L] = &lt;e_{13},e_{14},e_{24}&gt;_\mathbb{C}$  $L^2 = [L,L^1] = &lt;e_{14}&gt;_{\mathbb{C}}$  $L^3 = [L, L^2] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  So my hypothesis so far is that for an arbitrary $m\in\mathbb{N}$, $L^{m-1}=\{0\}$  My instinct is to do this by induction. My base case, $n=2$ has already been shown. Now I assume that $\mathfrak{u}(n,\mathbb{C})$ is nilpotent for $n=k$ ($k\in\mathbb{N}$) and consider the case for n=k+1.  However, I have no idea how to link these two cases together. I have read in Introduction to Lie Algebras and Representation Theory - J.E. Humphreys that $L^k$ should be spanned by basis vectors $e_{ij}$ where $j-i=k+1$ - however in my calculations for $L^1$, I obtain an $e_{14}$ which does not satisfy 4-1=2.  Am I missing something completely obvious? Or have I made a mistake somewhere? (I have checked my calculations numerous times, but cannot find any errors!)  Thanks,  Andy. If I took a picture of a windmill on the horizon — given that I know the sensor size and the focal length of the lens and other factors to do with the shot — could I calculate how far away an object is from the photographer?