Is there a way to search for a value in the entire database without quoting each table that it might or might not be in?   For example:   select all.tables from db where all.tables = value.x
Given a number, how do I discover in what table and column it could be found within? I don't care if it's fast, it just needs to work.
What TV show has kids entering a video game of some sort? I've been searching the entire Internet for this show about 4 teenagers that enter a video game world where they have to fight monsters that looked like insects. Every time they had to enter the world, they'd go down in the sewers and one of the guys had a skateboard, a girl had a scooter and that's what I can remember. There was also one guy that always stayed behind to check their "health" in the game and pull them out in case they took too much damage to avoid them dying inside the game. I don't know if it was animated or not so there's not much to go on at all but hopefully someone might know what show it is? Regarding field-level security, does Lightning Process Builder run as system-level permissions or user?  That is:   Can I trigger an update to a field that the current user cannot edit? Can I filter based on a field the current user cannot read? Where can I rent a decent mountain bike in Zürich? I am going for a 4 day trip in Zürich and I would like to bike quite a lot. Though biking is quite advertised, I failed to find a decent bike rental shop in the city. Would highly appreciate some tips! What is the command to remove all files but not directories? Let's say I have a directory tree like this:  FOLDER:     file1     file2     file3     Subfolder1:         file1         file2     Subfolder2:         file1         file2   If I used rm -r FOLDER/*, everything in FOLDER would be deleted including sub-directories. How can I delete all files in FOLDER and in its sub-directories without deleting actual directories? Concatenate multiple files with two blank lines as delimiter? I'm trying to join Markdown files with two newlines between each file.   I've tried using the following command:  paste -sd '\n\n' file1.md file2.md   This joins the files with a newline, but not two newlines, as I need.   What command can I use to join an arbitrary number of files with two \n characters between each join? Does Wolfram Mathworld make a mistake describing a discrete probability distribution with a probability density function? On this link (Sentinel1  for a SLC product), the resolution is written as a range from the highest corresponding to low incidence angle, to the lowest resolution corresponding to high incidence angle.  My question is how is the resolution related in general to the incidence angle? And if they are really related, why is the resolution affected by the change in the incidence angle? About Trivariate Normal Distribution I am working on a paper, and have a problem regarding ellipsoid and Trivariate Normal Distribution. Suprisingly I can't find much in literature but I found your in one of your answers:     Because this construction has nothing to do with "confidence" per se,   the objective is to establish some convention for describing the shape   and relative size of the points. Using 1.96 sort of works (for three   variables): it contains about 72% of the probability of the trivariate   normal distribution. But as the number of variables increases this   method produces ellipses that are far too small. For instance, with 10   variables it will contain only 4.6% of the probability; using 4.28   instead of 1.96 in this case will contain 95% of the probability.   How did you get this number 72%? Or do you have some literature to recommend to me in which I can find this. I would appreciate it very much! how can I extrude curve shapes onto curve without tapering I'm stuck. Can't figure out how I can extrude a closed curve onto a NURBS curve without it looking tapered.   I notice that when it's set to "2D" there is no tapering, but I want to do it on 3d.  Thanks for help. Polynomial degree 3 Equation If $\left(1+\sin \phi\right)\cdot \left(1+\cos \phi\right) = \frac{5}{4}\;,$ Then $\left(1-\sin \phi\right)\cdot \left(1-\cos \phi\right)$ If $\displaystyle \left(1+\sin \phi\right)\cdot \left(1+\cos \phi\right) = \frac{5}{4}\;,$ Then $\left(1-\sin \phi\right)\cdot \left(1-\cos \phi\right) = $  $\bf{My\; Try::}$ Given $\displaystyle \left(1+\sin \phi\right)\cdot \left(1+\cos \phi\right) = \frac{5}{4}\Rightarrow 1+\sin \phi\cdot \cos \phi+\sin \phi+\cos \phi = \frac{5}{4}.$  So $\displaystyle \sin \phi+\cos \phi+\sin \phi \cdot \cos \phi = \frac{1}{4}\Rightarrow \left(\sin \phi+\cos \phi\right) = \frac{1}{4}-\sin \phi \cdot \cos \phi.$  Now $\displaystyle \left(1-\sin \phi\right)\cdot \left(1-\cos \phi\right) = 1-\left(\sin \phi+\cos \phi\right)+\sin \phi \cdot \cos \phi =\frac{3}{4}+\sin 2\phi$  Now How can I calculate $\sin 2\phi.$  Help me, Thanks .NET String.Format() to add commas in thousands place for a number Is it possible to use text-overflow:ellipsis on multiline text? Is there a way to force a C# class to implement certain static functions? Best word for "unable to change" How to make a complete factory reset, without anyone being able to retrieve my data? I will have a few Android phones that I will have to let go.   I would like to make a proper clean wipe of the data, without no one being able to retrieve them, and do a factory reset.  I have read about the , encrypting the device before doing a factory reset, doing both, etc.  Since I am not an Android/adb guru, I would like to know if some of you would have some idea on how to achieve this with certainty.  I know "certainty" is a big word when it comes to proper data erasure on flash memory but still.  I have found some answers here and somewhere else, saying that encrypting and doing a factory reset on your Android device is enough, but I could not find a reliable source.  Just a few information that could be useful:   I'm running Linux as my OS and, therefore, I'm not looking for a Windows-based solution My devices are non-rooted and (almost) identical (Samsung A510F + 1 A510FD) Long boot delay on Ubuntu loading/splash screen following regular dist-upgrade on clean SSD install (18.04) I'be been running 18.04 since a clean SSD install on the day of it's official release, without issues. Power on to login was seconds (max 10)  Then, I did a regular upgrade this morning:  $ sudo apt update &amp;&amp; sudo apt dist-upgrade   The packages installed/upgraded were:  Install: linux-headers-4.15.0-24:amd64 (4.15.0-24.26, automatic), linux-headers-4.15.0-24-generic:amd64 (4.15.0-24.26, automatic), linux-modules-extra-4.15.0-24-generic:amd64 (4.15.0-24.26, automatic), linux-modules-4.15.0-24-generic:amd64 (4.15.0-24.26, automatic), linux-image-4.15.0-24-generic:amd64 (4.15.0-24.26, automatic) Upgrade: gnome-control-center-data:amd64 (1:3.28.1-0ubuntu1.18.04.1, 1:3.28.1-0ubuntu1.18.04.2), linux-headers-generic:amd64 (4.15.0.23.25, 4.15.0.24.26), gnome-control-center:amd64 (1:3.28.1-0ubuntu1.18.04.1, 1:3.28.1-0ubuntu1.18.04.2), linux-image-generic:amd64 (4.15.0.23.25, 4.15.0.24.26), linux-signed-generic:amd64 (4.15.0.23.25, 4.15.0.24.26), gnome-control-center-faces:amd64 (1:3.28.1-0ubuntu1.18.04.1, 1:3.28.1-0ubuntu1.18.04.2), linux-generic:amd64 (4.15.0.23.25, 4.15.0.24.26)   I rebooted once the upgrade had completed, and noted a 2-3 minute delay on the Ubuntu loading/splash screen (prior to login) (without any progress/activity indicated on the dots).  I powered off and tried to boot again, but am getting this delay consistently now. Also close down is much slower too.  Update #1 (2018-07-03): Analysis on systemd:  $ sudo systemd-analyze blame 3min 53.073s plymouth-quit-wait.service     2min 20.699s snapd.seeded.service          49.949s snapd.service           6.186s NetworkManager-wait-online.service           1.148s dev-sda2.device           1.098s plymouth-start.service   Showing that plymouth-quit-wait.service (which I now believe is related to the Ubuntu loading/splash screen) and snapd.seeded.service were by far the longest running services to initiate. So I compared the times before the dist-upgrade and after:  $ journalctl -u plymouth-quit-wait.service --since today -- Logs begin at Fri 2018-04-27 13:01:30 BST, end at Tue 2018-07-03 12:38:05 BST. -- Jul 03 04:15:43 user-laptop systemd[1]: Starting Hold until boot process finishes up... Jul 03 04:15:46 user-laptop systemd[1]: Started Hold until boot process finishes up. -- Reboot -- Jul 03 04:21:17 user-laptop systemd[1]: Starting Hold until boot process finishes up... Jul 03 04:24:52 user-laptop systemd[1]: Started Hold until boot process finishes up.   Before the upgrade plymouth-quit-wait.service took 3 seconds. After the upgrade it took 3 minutes 35 seconds  $ journalctl -u snapd.seeded.service --since today -- Logs begin at Fri 2018-04-27 13:01:30 BST, end at Tue 2018-07-03 12:42:14 BST. -- Jul 03 04:15:43 user-laptop systemd[1]: Starting Wait until snapd is fully seeded... Jul 03 04:15:43 user-laptop systemd[1]: Started Wait until snapd is fully seeded. -- Reboot -- Jul 03 04:22:47 user-laptop systemd[1]: Starting Wait until snapd is fully seeded... Jul 03 04:24:49 user-laptop systemd[1]: Started Wait until snapd is fully seeded.   Before the upgrade snapd.seeded.service took 0 seconds. After the upgrade it took 2 minutes 2 seconds.  Update #2 (2018-07-06): This morning's boot saw the return of the delay. So I guess we're still waiting for the kernel/plymouth/snapd update.  Update #3 (2018-07-12): The problem seems to be resolved, but I didn't see any update to snap or plymouth, and I'm still running 4.15.0-24 kernel. So I'm not sure which package update fixed the problem, or if it just resolved itself somehow. Reading the bug updates on launchpad it's unclear to me what was done (or is being done) to what package/s. If anyone can clarify that would be very useful. What is the difference between [0-9]+ and [0-9]++? Generate the smallest $\sigma$-algebra containing a given family of sets My teacher gave me an example of performing the subject:     Example      Let $\Omega = \Bbb R$ and $\mathcal R = \{(-\infty,-1),(1,+\infty)\}$.   Then $\sigma(\mathcal R) = \{\emptyset, \Bbb R, (-\infty,-1),  (1,+\infty), [-1, \infty), (-\infty,1],  (-\infty,-1)\cup(1,+\infty),[-1,1]\}$.   There was a different example, where she also generated the smallest  $\sigma$-algebra for the family of sets $\mathcal A = \{A,B\} \subset 2^\Omega$ in the same way: $\sigma(\mathcal R) =  \{\emptyset, \Omega, A, B, A^C,B^C,A\cup B, (A\cup B)^C\}$.   I certainly understand why $\emptyset$, $\Omega $ and a family of sets itself are there, and I certainly know that $\sigma$-algebra is closed under the operations of complement and union. What I don't understand about the other elements of generated $\sigma$-algebras: why we are taking exactly them? Does this work in a general case? Why is human vision restricted to 400-700 nm? Across the electromagnetic spectrum, 400-700 nm is a narrow spectrum of frequencies and focused in the region of short wavelengths. For example, radio waves cover a large range of frequencies unexploited by the visual system. So what biological reason is there that evolved us to use such a small frequency bandwidth for vision?