This is a restart manga which i read few years back. The girl has a harsh life and a terrible fiancée because of this, she dies and wakes up again as her younger self. Determined to avoid the inevitable future, she starts to learn swordsmanship and becomes very good at it, sort of like a genius. Then in order to avoid the future she already experienced, she decides to join the army which a prince leads. She very quickly becomes acquainted with the top brass and fights with the prince. The setting is medieval with dukes and counts. The girl is a noble's daughter.
It’s a story of a female protagonist who has a harsh life. Just as she is about to die, she time travels back into her young self. To avoid the future she already lived, she decides to gets strong by learning swordsmanship. After a while, she joins the army under the command of a prince who wears an eye patch. She is quite OP, and helps the prince. It was kind of a medieval setting manga, with dukes and earls and count types. Time is when the use of sword and magic is prominent.
Getting a domain name off of the blacklist I have a friend who purchased a domain name recently that he found out (after buying it) is apparently blocked by many corporate firewalls or proxies b/c it's been tagged as porn by the blacklist db they're using.    Are there any common agencies he can appeal to in order to get the domain name off the black lists?  It's not just one corporation, either, he's looking at marketing a subscription-based service to a certain industry, so any contacting a particular firewall/proxy admin and have them manually update the blacklist won't scale well.  Thanks in advance. Paul Why does my Mac's list of "Open with" applications start listing the apps twice and sometimes three times? Replacing the nth instance of a regex match in Javascript I'm trying to write a regex function that will identify and replace a single instance of a match within a string without affecting the other instances.  For example, I have this string:  12||34||56   I want to replace the second set of pipes with ampersands to get this string:  12||34&amp;&amp;56   The regex function needs to be able to handle x amount of pipes and allow me to replace the nth set of pipes, so I could use the same function to make these replacements:  23||45||45||56||67 -&gt; 23&amp;&amp;45||45||56||67  23||34||98||87 -&gt; 23||34||98&amp;&amp;87   I know that I could just split/replace/concat the string at the pipes, and I also know that I can match on /\|\|/ and iterate through the resulting array, but I'm interested to know if it's possible to write a single expression that can do this.  Note that this would be for Javascript, so it's possible to generate a regex at runtime using eval(), but it's not possible to use any Perl-specific regex instructions. Prove the identity $\binom{2n+1}{0} + \binom{2n+1}{1} + \cdots + \binom{2n+1}{n} = 4^n$ I've worked out a proof, but I was wondering about alternate, possibly more elegant ways to prove the statement. This is my (hopefully correct) proof:  Starting from the identity $2^m = \sum_{k=0}^m \binom{m}{k}$ (easily derived from the binomial theorem), with $m = 2n$:  $2^{2n} = 4^n = \binom{2n}{0} + \binom{2n}{1} + \cdots + \binom{2n}{2n-1} + \binom{2n}{2n}$  Applying the property $\binom{m}{k} = \binom{m}{m-k}$ to the second half of the list of summands in RHS above:  $4^n = \binom{2n}{0} + \binom{2n}{1} + \cdots + \binom{2n}{n-1} + \binom{2n}{n} + \underbrace{\binom{2n}{n-1} +\cdots \binom{2n}{1} + \binom{2n}{0}}_{\binom{m}{k} = \binom{m}{m-k} \text{ has been applied}}$  Rearranging the above sum by alternately taking terms from the front and end of the summand list in RHS above (and introducing the term $\binom{2n}{-1} = 0$ at the beginning just to make explicit the pattern being developed):  $4^n = (\binom{2n}{-1} + \binom{2n}{0}) + (\binom{2n}{0} + \binom{2n}{1}) + \cdots + (\binom{2n}{n-1} + \binom{2n}{n})$  Finally, using the property $\binom{m}{k} + \binom{m}{k-1} = \binom{m+1}{k}$ on the paired summands, we get the desired result:  $4^n = \binom{2n+1}{0} + \binom{2n+1}{1} + \cdots + \binom{2n+1}{n}$ What's the meaning of 90-plus? What's the meaning of 90-plus? More than 90? If so, please tell me more ways to say "more than 90". Thank you! Input password into SSH without typing What is the difference between the dashed and solid attack bars? I was flipping through my Pokemon list to see which kind of attacks they had, and I notice there was a small different between the attacks. Some attacks contained a dashed blue bar where as others contained a solid blue bar.   What is the difference and significance between the two? How to sort a Google Sheets Query by a custom ordering I have a table of choir members with a “name” and a “voice type” column. How can I write a query that orders them by decreasing pitch level of the voice type (i.e. soprano > contralto > tenor > bass)?  Is there in the  something similar to ?  I also tried the , but it does not seem to have an option for custom ordering, either. Leave Convert to Edit button enabled all the time in the moderator flag list In the moderator flags list, there is a &quot;Convert to Edit&quot; button on answers which are posted by the person who posted the question. This button is disabled at times, and I am not sure that the algorithm used is useful. My proposal is that the Convert to Edit button in the flag list should always be enabled, as it seems fairly frequent that it's disabled when it would be useful. Justification When the button is disabled, it is required that we pop open the answer view in the flag list, and use the regular Mod menu and choose convert to edit there. When we do that, however, we experience this issue:  (that should also be fixed, by the way!) Here are two items currently in the queue:    Note that one has the button enabled, while the other does not. The only differences I can see in those two answers is the age and the number of answers. Neither question has an accepted answer, but the one with the button disabled only has that single answer. I've only just now noticed that difference with these two posts, so I'm not 100% sure if that's the determining factor. 1 It is perhaps coincidental, but these buttons being (dis)abled are reverse of the action needing to be taken. The one with the disabled button needed to be converted to an edit; the one with the enabled button was an attempt to answer their own question. If I'm right about the determining factor here (that the answer is the only one), I'm not sure that's useful. A good bit of the time, an asker will post an answer due to people requesting additional information. In such cases, it seems like it will be likely there are no other answers. 1  Note 1: I was looking to create a userscript to enable these buttons, and I found something that I think is related as to the reason. It looks like the ones which are disabled are on answers which have comments on them. I noticed the title attribute of those buttons says, &quot;There are comments on the post. Please review&quot;. That does seem to make some sense in theory. However, it still seems like I am often converting them, anyway. With the above-linked, separate issue regarding how the 'mod' link on the expanded view works, this is still a bit of an impediment to our workflow. It occurred to me to check if the button was reenabled once you expanded the view, but it does not. Maybe that's an alternate solution. My plan for my userscript is to enable the button, but change the text color (and leave the title attribute), to point out that there are comments. Here is a question as phrased in Advanced Linear Algebra (Steven Roman):     Show that a linear operator $\tau$ on a finite-dimensional complex inner product space $V$ is normal if and only if whenever $S$ is an invariant subspace under $\tau$, so is $S^\perp$.   I'm only interested in the $\Rightarrow$ direction. Wikipedia (and ProofWiki)  that uses some kind of computation with the trace. Linear Algebra Done Right chooses an orthonormal basis and then uses the fact that $\Vert \tau v \Vert = \Vert \tau^* v \Vert$.  However, the above  proofs seem a bit too computational to me. Can the following argument work?  (Use $\odot$ for orthogonal direct sum.) Suppose that $\tau$ is normal and write $$V=E_{\lambda_1} \odot \cdots \odot E_{\lambda_k}$$ where the $E_{\lambda_i}$ are the eigenspaces of $\tau$. If $S$ is a $\tau$-invariant subspace then $\tau|_S$ is diagonalizable, so $$S=\widetilde{E}_{\lambda_1} \odot\cdots\odot \widetilde{E}_{\lambda_k}$$ where the $\widetilde{E}_{\lambda_i} \le E_{\lambda_i}$ are the eigenspaces of $\tau|_S$ (which could be trivial). Then choose orthogonal complements $D_i$ such that $E_{\lambda_i} = \widetilde{E}_{\lambda_i} \odot D_i$, and then $$S^\perp = D_1 \odot\cdots\odot D_k.$$ Since each $D_i$ is a subspace of an eigenspace, they are all $\tau$-invariant. Assurance that ST_Envelope works with geography as expected Using PostGIS, I have a table of data with geographic points defined as last_known_coordinates GEOGRAPHY(POINT,4326). I want to find all of these within a geographic bounding box with given top left and bottom right geographic coordinates, and be sure that the calculations are geographic, not geometric, e.g. that the results account for the curvature of the earth. The query I'm using contains the fragment: last_known_coordinates &amp;&amp; ST_MakeEnvelope(?, ?, ?, ?, 4326)::geography As you can tell I'm a bit new to this, and I know what I want, but not necessarily how to do it correctly. Other answers hint that this is correct, but I'd like to know for sure: Will this point data and SQL fragment take into account the curvature of the Earth in the bounding box? Test whether string is a valid integer Heartbleed: What is it and what are options to mitigate it? I was wondering how to run a command as another user from a script.  I have the script's owner set as root. I also have the following command being run within the script to run the command as the hudson user:  su -c command hudson   Is this the correct syntax? Make account merges propagate to chat Mock vs MagicMock Function is Continuous When Restricted to Closed Sets Which Cover the Space Suppose that $\{A_i\}$ is a finite collection of closed sets in $X$ such that $X = \bigcup A_i$, and $f : X \to Y$ restricted to each $A_i$ is continuous. Then $f$ is continuous.   Okay. The base case ($n=2$) is just the pasting lemma. I am having a little trouble with the inductive case, specifically with what the hypothesis is and how to deal with continuity with respect to subspaces. I believe the inductive hypothesis is to assume that any function over a topological space that is the union of $n-1$ closed sets such that the function restricted to each of these $n-1$ closed set is continuous must be continuous over the whole space. Then I assume I have a topological space $X = \bigcup_{i=1}^n A_i$, where each $A_i$ is closed, and a function $f : X \to Y$ such that $f|_{A_i}$ is continuous for each $i$. Thus $X = \bigcup_{i=1}^{n-1} A_i \cup A_n$, where $C = \bigcup_{i=1}^{n-1} A_i$ is closed since it is a finite union of closed sets. If I can show $f|_C$ is continuous, then I simply apply the pasting lemma to finish the problem. Give $C$ the subspace topology, and notice that each $A_i$ is closed in $C$. Thus we have a topological space $C$ that is the union of $n-1$ closed. But do I still have continuity $f$ restricted to $A_i$ since I am no longer considering them subspaces of $X$ but of $C$? When one says $f|_{A_i}$ is continuous, is one saying that $f$ is continuous when restricted to $A_i$ and $A_i$ is given the subspace topology?  EDIT:  I think I figured out the lemma I need. Claim: Let $A$ and $C$ be subspaces of $X$ such that $A \subseteq C$. Topologize $C$ with subspace topology with respect to $X$. Then the subspace topology on $A$ as a subspace of $X$ (call it $\tau_X$) is the same as the subspace topology of $A$ as a subspace of $C$ (call it $\tau_C$).   Proof: Let $U$ be open in $X$. Then $A \cap U$ is some open set in $A$ as a subspace of $X$. Since $C$ is a subspace of $X$, $C \cap U$ is open in $C$ as a subspace of $X$. Then $A \cap (C \cap U) = (A \cap C) \cap U = A \cap U$ is open in $A$ as a subspace of $C$, thereby proving $\tau_X \subseteq \tau_C$. Now let $O$ be some open set in $C$ as a subspace of $X$. Then $A \cap O$ is some open subset of $A$ as a subspace of $C$. But $O = C \cap U$ for some open set in $X$. Therefore $A \cap O = A \cap (C \cap U)= A \cap U$, which is also open in $A$ as a subspace of $X$. Hence $\tau_C \subseteq \tau_X$  Kind of obvious. But it was hard to spot the need for this lemma when I was considering subspace of subspaces and continuous functions, etc. Am I right in thinking this is the lemma I need? The ending I got is :      the genocide   When I reset my file, my past choices still take effect. I want to start a clean run.  I don't want to buy the game again, what do I do? Is there a sandbox to post test questions? I have noticed a behaviour that may or may not be a  bug. It is a discrepancy between the preview and the rendered result, which is why I would need to post a question to check it out.  Is there an official place to do that? I am considering attacks on Two-Key Triple-DES Encryption assuming $2^{32}$ known plaintext/ciphertext pairs (that's a mere 32 of ciphertext) by the method devised by Paul C. van Oorschot and Michael J. Wiener:  (in ), or another published method not requiring significantly more DES computations. As a synthetic information for decision makers, I am looking for an independent estimate of how much time this is expected to require, assuming all the RAM ever built by mankind to that day (of April 2012) was put to full use. Note: I'm purposely not asking when the attack could become feasible using all the RAM ever built by mankind, because estimates on the amount of RAM mankind will build, and when, are less falsifiable. Update: I am not considering cost; neither of RAM, power, logic including DES engines (as long as the number of DES operations remains within $2^{90}$). I am willing to assume that the amount of RAM used, and its effective speed, are the only factors to account for in determining the expected duration of the attack. This is similar to the hypothesis made by the authors of the linked paper, that their attack is limited by the amount (or cost) of RAM used, with all other factors of secondary importance. Update: sadly, nobody dared answer the question and the bounty period is over. Thus  is a first order answer to criticize.