Shortening URLs in the SMS being sent from Service Cloud We are sending SMS messages from Service cloud using Transactional API(Marketing Cloud).We were planning to send attachments but transactional API does not support attachments hence we have decided to include attachment links in the SMSes. But the links for those attachments are quite big.How can we personalize/shorten the url. My plan is to send a small url in the SMS and when the user clicks,he must be redirected to the original attachment url. How can this be implemented and Is it even feasible?Please share your expertise and options you see to implement this use case. Just to inform all the templates are already configured in Service Cloud and we cannot redo the wheel to configuring the templates in marketing cloud with AMPScript.
Is there any way to shorten URL in SMS in Marketing Cloud? I am trying to schedule an SMS in the journey to the subscribers who did not open their email. I want to redirect the subscribers to their hosted email page.  I am using the below code to populate hosted email link in email.  %%=RedirectTo(CloudPagesURL(383,'Id',@Id))=%%   In the message, it's showing up.        How can I shorten this URL?
Started new job. Rollover previous employer 401k to new 401k, IRA or Roth IRA? Changing order of features in shapefile I couldn’t find any proof on the internet. I would appreciate an elementary proof , but any help would be appreciated!  Thank you. Can a wizard using an arcane focus quarterstaff and a shield still cast somatic component spells? If there is a wizard that, by some means, has acquired proficiency in the use of shields, can said wizard use his shield in one hand and his arcane focus quarterstaff in the other and still cast somatic component spells?  Since the quarterstaff has been crafted to also be an arcane focus, and the Sage Advice Compendium states that you can provide the somatic components of spells with the same hand wielding the arcane focus, in this case an arcane focus quarterstaff, could that wizard still be able to perform somatic component spells while using a shield in the other?  I understand War Caster is the feat that allows you to cast somatic component spells even while using a shield and weapon or two weapons in each hand, but is this a simple way around those rules seeing as this "weapon" is your arcane focus? I would like to believe it is not, but I'm not fully fluent in the ways of spellcasting. Ever since I upgraded to 15.10, fdisk -l reports 16 ram disks (/dev/ram0 ... /dev/ram15). I'm a bit unsure what those are needed for. Is it safe to delete them? If not, how can I get rid of that fdisk output? Someone gave me a bunch of envelopes of pizza crust yeast, "specially formulated for pizza crust". The packets also say that no rise time or proofing is needed, and that it's "NOT recommended for bread baking." The ingredients are yeast, enzymes, sorbitan monostearate, l-cysteine, and ascorbic acid. It does provide a recipe for pizza crust, with just mixing and a bit of kneading.   What has actually been done to this yeast to make it work like this? (What are those enzymes?) And is there any way I can use it for other things, or is it really only good for things like pizza crust? Why is serial data transmission faster than parallel? Intuitively, you would think that parallel data transmission should be faster than serial data transmission; in parallel you are transferring many bits at the same time, whereas in serial you are doing one bit at a time.  So what makes SATA interfaces faster than PATA, PCI-e devices faster than PCI, and serial ports faster than parallel? How can I sound proof bathroom walls? I'm trying to figure out the best, least intrusive way of sound proofing the walls of a bathroom. The bathroom shares a wall with my bedroom, and my 3 yea old's bedroom. The main problem is the sound of water running (plus every bump on the counter and everything) echos loud and clear through the wall into my sons room.  I found  and it seems like a good choice. Another option is adding another layer fo drywall with something like  between them. But all the walls and ceilings in the house are textured. So replacing just one or two walls in a room is just not possible.   This is the layout of the two rooms. I've added red box around the wall with the most noise.   Is there anything else I'm missing here that I could do to dampen the noise short of tearing the bathroom apart? Please help me out with this problem:  Let $f_n(x) : [0,1] \to \mathbb R$ be a sequence of continuous functions convergent at every $x \in [0,1]$ to a continuous function $f: [0,1]  \to \mathbb R$ . Does $f_n$ converge uniformly to $f$?  My first solution: I read this example in  posted earlier and I think it works: Take a sequence $f_n:[0,1] \to \mathbb R$ such that $f_n$ increases linearly from $0$ to $1$ on the interval $\left[ 0,\frac{1}{n} \right]$, decreases linearly from $1$ to $0$ on the intreval $\left[ \frac{1}{n}, \frac{2}{n} \right]$, and is $0$ on $\left[ \frac{2}{n},1 \right]$. Then $f_{n} \to 0$ nonuniformly.  Is this answer true? Also, if anyone can give some examples of such function with detailed proof, I will very appreciative? What are the minimum root filesystem applications that are required to fully boot linux? Should 'Hi', 'thanks', taglines, and salutations be removed from posts? How to show $\lim_{n \to \infty} a_n = \frac{ [x] + [2x] + [3x] + \dotsb + [nx] }{n^2} = x/2$? This question came from the prelim exam I took last month. I have a proof that seems a bit unwieldy to me (posted as an answer), so I'm opening it up to ask if there are other ways of showing this.     Let $x$ be any positive real number, and define a sequence $\{a_n\}$ by   $$ a_n = \frac{ [x] + [2x] + [3x] + \dotsb + [nx] }{n^2} $$   where $[x]$ is the largest integer less than or equal to $x$. Prove that $\displaystyle{\lim_{n \to \infty} a_n = x/2}$. Compact topological space with closed graph implies continuity Let $X,Y$ be topological spaces and $f:X \rightarrow Y$  If $Y$ is compact and $G(f)$ (graph of $f$) is closed, show that $f$ is continuous.   I consider an open set in $X$, and as $G(f)$ is closed, $(X \times Y)-G(f)$ is open. And I guess I need to do something here. Then I can get some open sets. Also, I notice that compact is something relate to "finite". I guess I can use the compactness to do finite intersection or union and get the result finally.  But what should I do in the middle or I am not even on a right track. How to make a process invisible to other users? How could you launch a process and make it invisible to the top command? The process is started by a normal user (not root), and should not be visible to other normal users. If a Matrix Has Only Zero as an Eigen-Value Then It Is Nilpotent Prove that a matrix with only zero eigenvalues must be nilpotent.   How will I be able to prove this? What's the incentive to flag duplicates? How does this JavaScript/jQuery syntax work: (function( window, undefined ) { })(window)? unzip error "End-of-central-directory signature not found" I try to unzip a zip file, but got an error:  $ unzip COCR2_100.zip  Archive:  COCR2_100.zip   End-of-central-directory signature not found.  Either this file is not   a zipfile, or it constitutes one disk of a multi-part archive.  In the   latter case the central directory and zipfile comment will be found on   the last disk(s) of this archive. note:  COCR2_100.zip may be a plain executable, not an archive unzip:  cannot find zipfile directory in one of COCR2_100.zip or         COCR2_100.zip.zip, and cannot find COCR2_100.zip.ZIP, period.   I googled but didn't find a solution. I was wondering why it is and how I should fix it? Thanks!  The zip file can be downloaded from . It is an application, and here is its website .  My OS is 10.10. From Geneva airport to Lausanne station A method for evaluating sums/discrete functions by assuming they can be made continuous and differentiable? Suppose I had a function that satisfied the property $f(x)=f(x-1)+g(x)$.  For any $x\in\mathbb N$, it is easy enough to see that this boils down to the statement  $$f(x)=f(0)+\sum_{k=1}^xg(k)$$  If we return to our functional equation and differentiate it $n$ times, we get  $$f^{(n)}(x)=f^{(n)}(x-1)+g^{(n)}(x)$$  Once again, for any $x\in\mathbb N$, we have  $$f^{(n)}(x)=f^{(n)}(0)+\sum_{k=1}^xg^{(n)}(k)$$  One could then integrate both sides.  For example, this asserts that  $$\sum_{k=1}^xg(k)=xf'(0)+\int_0^x\sum_{k=1}^tg'(k)dt$$  If the sum inside the intagral is generalized to any upper bound.  How would I justify this for discrete functions?    An example of this is letting $f_p(x)=\sum_{k=1}^xk^p$, as it seems to follow the above result.  We can see from the above that  $$f_p(x)=a_px+p\int_0^xf_{p-1}(t)dt$$  $$a_p=1-p\int_0^1f_{p-1}(t)dt$$  which appears to be a true recursive formula.    Under what conditions can I extend discrete functions $f(x)$ and $g(x)$ into continuous differentiable functions and apply this method?