Me and 9 other employees made calls to people who have donated this year thanking them for their donation. I have a csv file of all people that called, who they called, and what was said on the call. I would like to import these interactions into salesforce to the corresponding donor accounts. I did a test import of one of the interactions to make sure that it will be imported the way we want. I imported it into the &quot;task&quot; object with the task subtype as &quot;call&quot; and this is what it showed on the donors account(See photo 1). I would like the upload to look this way (see Photo 2). This example was done manually and not via an import. But, as you can see it shows who called and what they talked about as soon as you click on the account. It's not until I click the blue &quot;Call&quot; hyperlink button when I am only able to see who called and what was said on the call. I would like this information displayed as soon as I go to the account. Could someone please help me with this? Is this possible via importing or will I have to do each one manually?
I am using the Service Console in Lightning Experience, and using the Chatter Feed component on the Case layout to display updates to the Case.  If I use the "Log a Call" Quick Action from the Chatter publisher, these calls are displayed in the Chatter feed.  This is the desired behaviour.  However, if I insert a Log a Call record related to the Case any other way - e.g. using the Developer Console, or my CTI system's custom components - the call does not display in the feed.  If I query the record, it looks exactly the same as the record that is created with the Quick Action.  It just seems that the Chatter post is never made in this situation.  I have checked my Feed Tracking settings:   Task has Enable Feed Tracking and Subject checked Case has All Related Objects checked   How can I enable calls created with a custom component (part of a CTI system) to display in the case feed?
We have set up GA on several websites to gather information about traffic to the site. We know about the organic keywords that are displayed under the Acquisition section of the traffic report. But we have been asked to find a way to display "not provided" keywords typed in by the end user in our Google Analytics report.  Is it possible to accomplish this? I have Ubuntu 18.04 LTS installed. I inserted USB-flash to my laptop. It was automounted to /media/username/DISKLABEL and opened in Nautilus. I can read and write objects to it. How can I access it from the application, which is installed as Snap? I tried snaps of the following applications such as gedit, arduino-mhall119, organize-my-files. All them show me errors if I navigate to /media folder:    Could not read the contents of Media Error opening the directory of '/media': permission denied  Output of active Snap  is below: $ snap interfaces  | grep -v &quot;.*-$&quot; Slot                             Plug :browser-support                 organize-my-files :core-support                    core:core-support-plug :cups-control                    gedit :desktop                         gedit,organize-my-files :desktop-legacy                  gedit,organize-my-files :gsettings                       gedit,organize-my-files :home                            arduino-mhall119,gedit,organize-my-files :network                         arduino-mhall119,gedit,organize-my-files,pulsemixer :opengl                          organize-my-files :pulseaudio                      organize-my-files,pulsemixer :unity7                          arduino-mhall119,gedit,organize-my-files :wayland                         gedit :x11                             arduino-mhall119,organize-my-files,pulsemixer gnome-3-26-1604:gnome-3-26-1604  gedit gtk-common-themes:gtk3-themes    gedit gtk-common-themes:icon-themes    gedit gtk-common-themes:sound-themes   gedit -                                arduino-mhall119:serial-port -                                gedit:avahi-observe -                                gedit:mount-observe  Updates:  connecting mount-observe to Gedit with snap connect gedit:mount-observe does not help. it seems that we need special Snap with support of  interface. I recently moved into an in-law unit of a large old house.  In the kitchen, there are two pipes coming out of the wall (one protruding out a little more than the other).  I had assumed they were gas lines to connect my stove.  But since the stove only connects to one pipe, I'm now wondering if they're actually water lines. Can anyone explain how I can tell the difference? On the other side of the wall is a large closet with the air conditioning system, water heater, and what I think is the gas shutoff valve. Ubuntu Software (Software Center) Crash - Ubuntu 16.04 Android Seekbar with two thumbs How can I assign custom icons to folders? Fedora 25 and disabling whatever is listening on port 111 I've got a Fedora 25 x86_64 stand alone workstation. Something is listening on port 111 (identified with an nmap scan):  $ sudo lsof -i :111 COMMAND PID USER   FD   TYPE DEVICE SIZE/OFF NODE NAME systemd   1 root   36u  IPv4  15170      0t0  TCP *:sunrpc (LISTEN) systemd   1 root   37u  IPv4  15171      0t0  UDP *:sunrpc systemd   1 root   38u  IPv6  15172      0t0  TCP *:sunrpc (LISTEN) systemd   1 root   39u  IPv6  15173      0t0  UDP *:sunrpc   I disabled the Sun gear on the port with the following commands:  $ sudo systemctl disable rpcbind $ sudo systemctl disable sunrpc Failed to disable unit: No such file or directory   After reboot the port is still open.  It appears something other than Sun gear wants to listen on port 111. Or maybe systemd is not respecting my wishes to disable the unused service. Or maybe something else...  How do I determine what is trying to listen on the port, and how do I disable it?    From below:  $ sudo systemctl -a | grep -E "rpc|port"   var-lib-nfs-rpc_pipefs.mount          loaded    active   mounted   RPC Pipe File System   abrtd.service                         loaded    active   running   ABRT Automated Bug Reporting Tool   auth-rpcgss-module.service            loaded    inactive dead      Kernel Module supporting RPCSEC_GSS   fedora-import-state.service           loaded    active   exited    Import network configuration from initramfs   fedora-readonly.service               loaded    active   exited    Configure read-only root support   rpc-gssd.service                      loaded    inactive dead      RPC security service for NFS client and server   rpc-statd-notify.service              loaded    inactive dead      Notify NFS peers of a restart   rpc-statd.service                     loaded    inactive dead      NFS status monitor for NFSv2/3 locking. ● rpc-svcgssd.service                   not-found inactive dead      rpc-svcgssd.service   rpcbind.service                       loaded    inactive dead      RPC Bind   rpcbind.socket                        loaded    active   listening RPCbind Server Activation Socket   rpc_pipefs.target                     loaded    active   active    rpc_pipefs.target   rpcbind.target                        loaded    active   active    RPC Port Mapper Why is travelling around the speed of light a problem? I don't fully understand what would happen if we could travel at the speed of light. But I saw somewhere here that it would mean events happen out of order. But why is this a problem. It is said that cause has to happen before the effect, but why does this have to be linear?   And why is it that the speed of light is the maximum? I take it that light (photons?) are massless, so why can't they travel faster? Can we prevent titles with an unnecessary tag in them? Solving equation involving Euler's totient function Given $m\in\mathbb{N}$, is there a general way to solve the equation \begin{equation} \varphi(n)=m \end{equation} where $\varphi$ is the Euler's totient function? For example, I want to solve for all the $n$'s such that $\varphi(n)=4$. Is there any way to solve it that are also applicable to many (if not general) cases? Combining two sorted lists in Python I have two lists of objects. Each list is already sorted by a property of the object that is of the datetime type. I would like to combine the two lists into one sorted list. Is the best way just to do a sort or is there a smarter way to do this in Python? How to highlight source code in HTML? I want to highlight C/C++/Java/C# etc source codes in my website.  How can I do this?  Is it a CPU intensive job to highlight the source code? Is the uncertainty principle just saying something about what an observer can know or is it a fundamental property of nature? I ask this question because I have read two different quotes on the  that don't seem to match very well. There are similar questions around here but I would like an explanation that reconciles these two interpretations specifically:   Feynman talks about the uncertainty principle in one of his lectures and mentions it as the reason why electrons don't crash into the atom's nucleus: If they did they would have an exact location and momentum which is not allowed by the uncertainty principle. In saying this it is clear that the uncertainty principle is a fundamental property of nature because it has an effect on where an electron can reside. Recently I read - somewhere else but I forgot where exactly - an account of the uncertainty principle where there was explained how we can measure position of a particle by firing another particle into it, the collision disturbs the velocity of the observed particle therefore we can not know its momentum anymore.   Now, 2) very much seems like a limitation of what the observer can know, while 1) attributes a fundamental property of nature to it (electrons don't crash into the nucleus). What is the correct way to think about this? I have a query where I chain two columns. Why does the alias not work in the GROUP BY clause but in ORDER BY clause, it does work? How can I write the select correctly?  SELECT   KOS_VER_ID        AS "Vertrag"   , WHR_ISO_3_CODE  AS "Waehrung"   , KOS_KOA_ST_KZN || '  -  ' || ST_LANGBEZ_EN as "Kostenart"   , SUM (KOS_BETRAG) AS "Summe pro KOA" FROM   KOSTEN   , WAEHRUNG   , SCHLUESSELTABELLE WHERE    KOSTEN.KOS_VERHI_WHR_ID = WAEHRUNG.WHR_ISO_ID   AND KOSTEN.KOS_KOA_ST_KZN = SCHLUESSELTABELLE.ST_ID   AND KOS_VER_ID in (2509, 2510, 2511) GROUP BY   KOS_VER_ID   , WHR_ISO_3_CODE   , KOS_KOA_ST_KZN || '  -  ' || ST_LANGBEZ_EN ORDER BY   "Vertrag"   , "Kostenart" ; How many points in RSA, such that $m^e = m \bmod n$ For every RSA-cryptosystem, there exist some messages $m$, for which it holds that $m^e \equiv m \pmod n$ As to the question, how many such messages exist, this question has already been asked and answered here:  However, I do only understand the answer up to a certain point Suppose that $n$ is only 1 prime. Then it holds that the number of unconcealable messages is $\gcd(e-1, p-1)+1$ This is because in $m^e \equiv m \pmod  p$ , either $m = 0$ or $m \not= 0$. In the latter case $m$ can be expressed as $g^t$, where $g$ is a Generator in $\mathbb{Z_p}$ $g^{t*e} \equiv g^t \pmod p$ $g^{t(e-1) \bmod p -1 } \equiv g^{0 \bmod p -1} \pmod p$ $t(e-1) \equiv 0 \pmod {p-1} $ has exactly $\gcd(e-1, p-1)$  solutions, so the total number of unconcealable messages is, together with $m=0$ , $\gcd(e-1, p-1)+1$ When we now look at real RSA, which has two prime factors in its modulus, it holds that the number of unconcealable messages is $(\gcd(e-1, p-1)+1)\cdot(\gcd(e-1, q-1)+1)$ Why is that so? I suppose it has to do with CRT, but I just cant understand why. How do I backup ssh keys? I am planning to do a fresh install of ubuntu 11.10 in my system. Before that i have setuped key based ssh authentication in this machine. Is it possible to take backup of those ssh keys, so that i  can use that in my new installation. Or else i must setup keybased ssh authentication again? If i can take backup, what are the files i need to copy? Can someone explain it in detail pls. Thanks in advance. New UI encourages askers to confirm or dispute duplicate votes , the banner shown to askers whose questions have attracted at least one duplicate close vote has a couple of new options:    If the author clicks the first button, they're shown a confirmation that clarifies the results of this action somewhat:    If they click "Ok", the question is instantly closed:    If, instead, they edit, they'll be offered this guidance:    ...and once an edit is submitted the choice will go away until another duplicate close-vote is cast.   In just the past day, 80 questions  network-wide have been closed in response to confirmation from the asker; edits by askers are up significantly as well.   We'll be monitoring the results to see if further adjustments are needed. A few open questions surrounding this change include:    Perhaps if the number of votes is below some threshold?   I'm posting this separately from  to allow room for discussion and . I want to delete the record type which is default to the some profiles Number of possible marriage arrangements if Marriage Condition is satisfied Suppose I have a set of $n$ boys and each subset of $1\leqslant k \leqslant n$ boys knows at least $k$ girls then this means that the set of boys $B$ satisfies the marriage condition.  I am doing an exercise from a Graph Theory book and it says we can show by induction on $n$ that the number of possible marriage arrangements is $\geqslant t!$ if every individual boy knows at least $t \leqslant n$ girls or there are $\geqslant t!/(t-n)!$ possible marriages if each individual boy knows at least $t&gt;n$ girls.   I am struggling to see how the induction hypothesis can be implemented to prove the $n+1$ case. When you swap from the $n$ to $n+1$ case the conditions change and I can't see the link between them.  Would anyone be able to point me in the right direction? Distributing distinct apples and pears to three people so that each person receives at least one pear How many ways are there to distribute seven distinct apples and six distinct pears to three distinct people such that each person has at least one pear.   Note: The first part of the problem was the same but the word distinct was replaced with identical apples and pears. That answer is $360$ ways.   What has to be done differently when the word identical is replaced with distinct?