It is possible in Oracle 18c to rename the default sid (XE) in a custom SID? I tryed using Oracle Database Configuration Assistant but having not success. how can i possibly do? Thanks
I needed to change the SID of an Oracle XE database (not the Service Name) to match a production database.  When I tried searching online, most of the pages were describing changing or adding a service name through tnsnames.ora; that's not what I needed to do.
How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help. Why does the Cauchy distribution have no mean? Is there a way to see that $ \nabla_\mu g_{\nu \rho} = 0 $ without explicit computation, where $\nabla_\mu$ refers to the covariant derivative? In books, it is usually said that this is a consequence of the fact that parallel transport preserves dot product. How ? number of ways to make $2.00 How many different ways can you make $2.00 using only 1 cent, 5 cent, 10 cent, and 25 cent pieces, and 1 and 2 dollar bills (there are 100 cents in a dollar)? I have worked out an equation:  $$p + 5n + 10d + 25q + 100l + 200t = 200$$  Where all variables are non-negative integers. But I don't know what to do from here to figure out how many different sets of non-negative integers there are that satisfy this equation. What do I do next? Are Harry Potter and Ginny Weasley Distant Relatives? Accented letters with IM FELL fonts I am having an error compiling the following code with xelatex and lualatex:  ** WARNING ** "seac" character deprecated in Type 2 charstring. ** ERROR ** Type2 Charstring Parser: Parsing charstring failed: (status=-1, stack=5)  Output file removed.  \documentclass{article}  \usepackage{xunicode} \usepackage{fontspec}  \setmainfont[Mapping=tex-text,Ligatures={Common}, Numbers={OldStyle}]{IM FELL English PRO} \begin{document}  Buongiorno a tutti. Trallallà.  \end{document}   The error disappears when I omit the accented à. It also doesn't happen when I use other fonts.  Could you suggest any workaround?  Thank you, A How do I get the value of text input field using JavaScript? Lock keys panel indicator for MATE Desktop I have no indicator LEDs on my keyboard to show whether Caps-Lock is on (I don't have Num-Lock and Scroll-Lock keys so the best option would be to have an indicator only for Caps Lock, but three indicators would be better than none)  I would really like to see the lock-keys status in the indicator panel so I can tell at a glance whether I'm typing my passwords correctly    I'm using Ubuntu MATE 16.04. I've seen  but it relates to Unity DE. First Order Time-Variant System : Picard Method I looking at a time variant first order system. I am trying to prove that a sequence of functions $x^{[k]}(t)$ generated using Picard iterations converges uniformly on some interval $[0,T]$.  Given:  $\dot{x}(t)=A(t)x(t)$ where $x(0)=x_0$  $x(t)=x∈R^n$ where $A(t)$ is a $n×n$ matrix  Assume there exists $M$ such that $||A(t)||\le M$ for all $t\ge 0$ and that $A(t)$ is a piecewise continuous function. Show that, for any $T &gt; 0$, a solution exists in the interval $[0,T]$.  I know that $x(t)=x_0+\int^t_0A(τ)x(τ) dτ$ must be satisfied if the solution does indeed exist.  I am supposed to use Picard iterations to prove this, which I am not familiar with yet. But I know that they are of the form: $x^{[k+1]}=x_0+\int^t_0A(τ)x^{[k]}(τ) dτ$. Where $x^{[0]}(t)=x_0$  Can I use the standard Picard proof to prove this or do I need to start somewhere else?  I was also asked to show that this method satisfies  $|x^{[k+1]}(t)-x^{[k]}(t)|\le |x_0| $$\frac{π^{k+1}(t)}{(k+1)!}$ where $π(t)=\int^t_0||A(τ)||dτ$.  I have no idea where to start with this, but hopefully it will become clearer once I finish the first part. Differentiation - simple case In the book calculus made easy, page 22 the case of the negative power for   $y=x^{-2}$    $$\begin{align}  y+dy &amp; =(x+dx)^{-2}\tag{1}\\ \\ &amp; = x^{-2}\left(1+\frac{dx}{x}\right)^{-2}\tag{2} \end{align}$$  How do they get from $(1)$ to $(2)$?  And why isn't the binomial function applied to the second line but applied on the third line (the line that comes after line $(2))$? I keep reading about  ('PPAs') and people answer questions with a link to a PPA. What's the best way to use these?     There are multiple valid answers for this question spanning over several versions of Ubuntu. For your convenience, an index of each is below. Proof using Prüfer encoding The question is as below:      Show that each vertex $v$ of a tree $T$ appears $deg(v)-1$ times in the Prüfer encoding of $T$, where $deg(v)$ is the degree of $v$ in $T$.   For this, I think there are 3 scenarios a leaf should be considered for: (1) when it is a leaf as part of a tree; (2) a leaf that has been discarded; (3) the remaining edge. I feel like this will result in a short proof which is only two (or so) statements long, but at the same time, feel it is too simple.   EDIT: I've had a look at this again and narrowed it down to 2 cases:   Case 1: The vertex $v$ in question has $deg(v)\ge2$. $v$ then loses its neighbours as the algorithm is applied repeatedly until $v$ becomes a leaf itseelf. At this point, $v$ is attached to another neighbour, leaving an edge. This means the algorithm can no longer be applied and we have obtained the final Prüfer Encoding for the tree $T$.  Case 2: The vertex $v$ has $deg(v)\ge 2$. It loses its neighbours as the algorithm is applied repeatedly but is deleted itself at some point in the process.   Have I gone about this wrong?  Thank you. How to output string completions to stdout? Can you deliver it [when,after] it [is | will be] assembled? I took a bunch of photos at my son's martial arts club using a D90 with a 50mm F1.8.  The club is lit with overhead fluorescent lighting, and I was getting some weird results where some shots are "white", others have an "orange cast", and still others are partly white and partly orange in the same shot.  I suspect it has to do with the combination of the frequency of the light flicker and with the camera shutter speed. Here is a sequence of 3 shots that show the problem.  The shots were taken with 1/500s at F2 and ISO-800 and with Auto-WB.  First shot ("white/normal"):    Second shot ("orange cast" at top):   Third shot ("orange cast" at bottom):   These were taken in burst mode within a second of each other.  Can anybody tell me what is going on?  And, how I can avoid this? Folland, "Real Analysis", Chapter 5.3, Exercise 36:     Let $\mathcal{X}$ be a separable Banach space and let $\mu$ be   counting measure on $\mathbf{N}$.  Suppose that   $\left\{x_n\right\}_1^\infty$ is a countable dense subset of the unit   ball of $\mathcal{X}$, and define $T \colon L^1(\mu) \to \mathcal{X}$   by $Tf = \sum_1^\infty f(n) x_n$.  (a)  $T$ is bounded.  (b)  $T$ is   surjective.   I have proved (a).  I would like help on (b).  Here are my ideas so far.    Say we want to show $y \in \mathcal{X}$ is in the image of $T$.  Reduce to the case $||y|| = 1$ and let $x_{n_m} \to y$.  My thought is to produce for each $N$ a function $f_N \in L^1(\mu)$ such that $||y - \sum_n^\infty f(n)x_n|| &lt; 1/N$ and also such that the $f_N$ converge in $L^1(\mu)$ to some $f \in L^1(\mu)$.  Then use the continuity of $T$ to conclude $T(f) = y$.    The way I have been setting up my inequalities is as follows. Pick $M_N$ such that for all $m &gt; M_N$, $||y - x_{n_m}|| &lt; 1/N$.  Then I want to define $f_N$ so that $$\sum_n^\infty f_N(n) = \sum_{m &gt; M_N}^\infty f_N(m) = 1, $$ hence $$||y - T(f_N)|| = ||\sum_{m &gt; M_N}^\infty f_N(m) y + \sum_n^\infty f_N(n)x_n|| \leq \sum_{m &gt; M_N}^\infty f_N(m) || y - x_{n_m} || &lt; \frac{1}{N}. $$  Presumably, if the $f_N$ are appropriately chosen, then I can find a dominating function and apply the Dominated Convergence Theorem to finish up.    However, getting all these hypotheses to hold simultaneously has been difficult.  In essence, the difficulty seems to be in requiring that the $f_N$ be "normalized" as well as possess a dominating function.  If this method is feasible, at least it seems to require a bit of analysis to show the desired series all converge.  Perhaps I am missing something cleaner.  If so, a simpler solution would be much appreciated.    -Thanks. How to demonstrate that there is no all-prime generating polynomial with rational cofficents? In Guardians of the Galaxy vol. 2, we see long-distance space travel. It involves piloting your ship into some sort of "jump point" that opens up in space, taking the shape of a honeycomb-like structure with a single hex missing.  The way it's describe, these points are fixed in space: early in the movie, the Guardians have to out-run an enemy fleet to reach the one they need; later on, we see them fly through a very long series of them in sequence. It's also made clear that doing too many of these "jumps" in a row has consequences for the passengers.  The process seems to be similar to, say, the Mass Effect relay setup, mixed with a bit of Star Wars hyperspace travel.  Is this the first time we have seen long-distance space travel in the MCU? Is there anything from the source material that explains how this works from a logistical standpoint? If there's any information on the "science" behind it, that would also be helpful. Strange character when using listings package I'm seeing an odd character like a very flat U, where there should be a space, with the listings package. See example below. Does anyone have any idea why this is happening, or how to get rid or work around it?  \documentclass{standalone} \usepackage{underscore} \usepackage{listings} \usepackage[usenames,dvipsnames, rgb, svgnames, x11names]{xcolor} % Text layout \topmargin 0.0cm \oddsidemargin 0.5cm \evensidemargin 0.5cm \textwidth 16cm \textheight 21cm  \lstnewenvironment{cmd}[1][]{%   \lstset{language=sh, backgroundcolor=\color{LightSteelBlue1}, #1}} {}  \begin{document} \begin{cmd}[caption=Configuration file section including filters] [affy6] [...]     [[hapmap]]     phenofiles = "data/Hapmap6.0/Pheno/hapmappheno_909.csv",     genofile = "/data/snppy/Hapmap6.0/Geno/birdseed-v2.calls.txt"     anno_filter = "chromosome = 5"     idlink_filter = "studyid = 'CEU'"     some_other_stuff = "foo = bar" \end{cmd} \end{document} Given a DateTime object, how do I get an ISO 8601 date in string format? Given:  DateTime.UtcNow   How do I get a string which represents the same value in an -compliant format?  Note that ISO 8601 defines a number of similar formats. The specific format I am looking for is:  yyyy-MM-ddTHH:mm:ssZ