is there a tool in blender that works similiar to how the looping tool in 3ds max works in which it will calculate my loop to auto clean my geometry. or make a curve i've been using loop tool addon however it it doesn't clean existing geometry just curves. It would be helpful if the tool also does like in max moves the edges to the center between the two existing edges. the tool that i'm looking for is set flow. if there are other tools like this in blender or a good addon to add similiar functions that would be helpful i dont want to spend hrs cleaning geometry if it can be sped up.      so if the geometry is screwy like this i need to clikc the loop flow a few times to get this thats what i am looking for
Is there a way in blender or an addon that allows me to select a bunch of faces (or verts) and evenly distributes (or relaxes) them into quads clean quads.  Without screwing up the vert ID/order.  Edit: I would like to have the shapes of my quads to turn into perfect squares while maintaining the volume of the object and the vertex order.
USB-C Charging Speeds / Charger Outputs I own a 2016 Macbook (with the USB-C charging) - at the time and in response to all of the reports of poor cables and poor chargers, I bought a meter so I could see what the throughput of my cables/chargers was. However, having run some tests I'm now not sure what to consider normal / what is harmless to the battery.   For all tests I used an original Apple C-C cable - though was able to replicate with two third party cables I own.  I have the original Apple block charging at 14.3 V / 1.99 A and a third party block that charges the same.  Another third party block which advertises USB PD and 3 A is currently charging at 20 V / 1.43 A  I've done some research online but I can't find any articles that indicate what a normal USB PD output is relative to the devices that connect to it and would appreciate any guidance / assistance.   TL;DR: Have Apple charger which charges at one voltage/amperage. Bought several others advertised at PD which are higher voltage, lower amperage. Not sure what is 'safe', or 'fast', or does least overall damage to battery. How to prove $\sum_{n=0}^{\infty} \frac{n^2}{2^n} = 6$? I'd like to find out why  \begin{align} \sum_{n=0}^{\infty} \frac{n^2}{2^n} = 6 \end{align}  I tried to rewrite it into a geometric series  \begin{align} \sum_{n=0}^{\infty} \frac{n^2}{2^n} = \sum_{n=0}^{\infty} \Big(\frac{1}{2}\Big)^nn^2 \end{align}  But I don't know what to do with the $n^2$. How to make a GIS inventory? My office will be seeing a big change in its GIS section. This section has been operational since the 1980's and has a huge collection of GIS data (i.e., shapefiles, raster files, data, etc) but never been through any inventory. Now it will happen.   Is there any automated way to extract all the information about the GIS data (i.e., shapefile, arc-info coverage, layer file, *.mxd, gdb, raster file, and more) from a PC to an Excel file? The information may include date of creation, date last edited, folder or container name, etc. I have a very large codebase (read: thousands of modules) that has code shared across numerous projects that all run on different operating systems with different C++ compilers. Needless to say, maintaining the build process can be quite a chore.   There are several places in the codebase where it would clean up the code substantially if only there were a way to make the pre-processor ignore certain #includes if the file didn't exist in the current folder. Does anyone know a way to achieve that?  Presently, we use an #ifdef around the #include in the shared file, with a second project-specific file that #defines whether or not the #include exists in the project. This works, but it's ugly. People often forget to properly update the definitions when they add or remove files from the project. I've contemplated writing a pre-build tool to keep this file up to date, but if there's a platform-independent way to do this with the preprocessor I'd much rather do it that way instead. Any ideas? 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. Counting inversions in an array I'm designing an algorithm to do the following: Given array A[1... n], for every i &lt; j, find all inversion pairs such that A[i] &gt; A[j]. I'm using merge sort and copying array A to array B and then comparing the two arrays, but I'm having a difficult time seeing how I can use this to find the number of inversions. Any hints or help would be greatly appreciated. If $f(x)=x-\int^{\frac{\pi}{2}}_0f(x)\sin(x)dx$ find the explicit function for $f(x)$ in its simplest form Distribution of range of Uniform $(0,1)$ distribution Let $X_1,...,X_n$ be iid as $U \sim [0,1]$ with pdf $f(x) = 1(0 &lt;x&lt; 1)$. Determine the range distribution.   I have managed to determine the distribution of the minimum and the maximum, however I cannot/do not know how to determine the distribution of range.   Minimum:  $f_N = n(1-x)^{n-1}$ and maximum $f_M= nx^{n-1}$   I am aware that the calculation of range distribution is based on convolution: $f_R=\int f_{N,M}(x,x-r)dx$, However I cannot get the correct result, which according to my lecture slides is : $f_R= n(n-1)r^{n-2}(1-r)$  Could someone break this down for me ? My math background is not great Will inverse functions, and functions always meet at the line $y=x$? If I have a function, the inverse function, by definition will be a reflection of the original function in the line $y=x$, so if I wanted to find the point of intersection, instead of solving it with equating both of the functions to equaling each other, could I assume that the point of intersection, between the two functions, will always be at the point $y=x$? This would enable me to solve problems much easier, instead of having to solve quartic equations, for example. To perform a bit flipping attack, the previous block is modified by using XOR. This results in an altered plaintext. However, now the ciphertext of the previous block is altered, hence it will result in an invalid format. Am I correct or am I missing something?   For example, suppose I have the following plaintext name=jcconvenant;photo=picture.jpg;admin=false;colour=red;  and the correspoding ciphertext c26a5697689463d662f540e55e2a1ecef9c5df20133dfe49d6d3c369679a95ff4f4c5a490f530b2a2f25db40da64f1e9302724ce61b9a435e23f4d600252a143  Suppose we perform a bit flipping attack and get the following ciphertext c26a5697689463d662f540e55e2a1ecef9c5df20133dfe49d6c1d07071c495ff4f4c5a490f530b2a2f25db40da64f1e9302724ce61b9a435e23f4d600252a143  Then the resulting plaintext will still look corrupted.   ¶ä╚°  h8ì│►Nƒz│Ioé¤ßkü2KÀQiý4I@pg;admin=true;;colour=red;  Is there a way to perform bit flipping while still obtaining a valid plaintext? If $\mathbf A$ and $\mathbf B$ are Hermitian, when does $\det(\mathbf A-\lambda\mathbf B)=0$ have only real roots? Let $\mathbf A, \mathbf B$ be Hermitian matrices of the same size. What is the characterization of $\mathbf A, \mathbf B$ such that $p(\lambda)=\det(\mathbf A-\lambda\mathbf B)=0$ has only real roots?   If $\mathbf B$ is positive definite (I corrected this), it is easy to see $p(\lambda)$ has only real roots. How do you correctly say large numbers I saw a post on  which links to a video where a person . Is he saying a large portion of the numbers wrong? Back in high school my algebra teacher was extremely picky.  If we were going to say the number 135, we would say one hundred thirty-five.  If a person said one hundred and thirty-five my teacher would interpret that to mean 100.35.  Was my algebra teacher wrong, or did Jon just waste over 80 hours counting to 100,000 incorrectly. I tried searching the web, but searching for ‘numbers and’  doesn’t work very well.  Can you point me to a reference or style guide that describes how to properly say large numbers? How to replace a video on YouTube I only have access to the server via a terminal and I can't use graphical tools such as GParted! I want to create a new partition from a part of the root (about 768mb) for swap.  # df -h Filesystem      Size  Used Avail Use% Mounted on /dev/vda         20G  1.3G   18G   7% / udev             10M     0   10M   0% /dev tmpfs           199M  4.9M  194M   3% /run tmpfs           100M   12K  100M   1% /run/user tmpfs           5.0M  4.0K  5.0M   1% /run/lock I have decided to switch from Powerpoint to Beamer, and for my first presentation I'd like to use the , and the same colors as in this goggle slide template:  .  I tried to do some research about it, the closest answers I found are the question  and the . I tried this code:  \documentclass{beamer} \usepackage[frenchb]{babel} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc}  \usetheme{metropolis}  \definecolor{bluegreen}{rgb}{3, 166, 155} \definecolor{pitchblack}{rgb}{0, 0, 0} \definecolor{lightbeige}{rgb}{255, 251, 241} \definecolor{mediumgray}{rgb}{183, 183, 183}  \setbeamercolor{background canvas}{bg=pitchblack} \setbeamercolor{normal text}{fg=lightbeige} \setbeamercolor{headline}{bg=bluegreen, fg=mediumgray}  \begin{document} \begin{frame}     \frametitle{The title}     Lorem ipsum... \end{frame} \end{document}   I does everything I want, except that the title bar's background color is lightbeige:    What did I do wrong? Or what argument should I pass to \setbeamercolor to get it right? Thanks in advance :-). how does capacitor work ? how do they conduct electricity ? Sorry, i am novice in electronics, trying to understand basic fundamental of electronics.  1. How does capacitor conduct current when two plates aren't physically connected. ! LaTeX Error: Undefined color `BLACK' i have written all the text in black color, but i get this error several times in the same page:  ! LaTeX Error: Undefined color `BLACK'.   i tried to solve it by writting this: \definecolor{black}{gray}{0,0,0} but it didn´t work.   what should i do? Cardinality of equivalence relations in $\mathbb{N}$ I came across this long proof on this site:    But I would like to know whether my direction can work.  Say we want to find the cardinality of all equivalence relations in $\mathbb{N}$. Since it is a subset of all relations in $\mathbb{N}$, I conclude it has a cardinality smaller or equal to $\aleph$. Now, define an injective function from $P(\mathbb{N})$ to the set of equivalence relations by matching each subset of $\mathbb{N}$ with the identity relation (which is an equivalence relation in $\mathbb{N}$.  Therefore the cardinality of all equivalence relations in $\mathbb{N}$ is greater or equal to $\aleph$ and using CSB we get the desired result.  Seems legit? How do I use Moq to mock an extension method? I am writing a test that depends on the results of an extension method but I don't want a future failure of that extension method to ever break this test. Mocking that result seemed the obvious choice but Moq doesn't seem to offer a way to override a static method (a requirement for an extension method). There is a similar idea with Moq.Protected and Moq.Stub, but they don't seem to offer anything for this scenario. Am I missing something or should I be going about this a different way?  Here is a trivial example that fails with the usual "Invalid expectation on a non-overridable member". This is a bad example of needing to mock an extension method, but it should do.  public class SomeType {     int Id { get; set; } }  var ListMock = new Mock&lt;List&lt;SomeType&gt;&gt;(); ListMock.Expect(l =&gt; l.FirstOrDefault(st =&gt; st.Id == 5))         .Returns(new SomeType { Id = 5 });   As for any TypeMock junkies that might suggest I use Isolator instead: I appreciate the effort since it looks like TypeMock could do the job blindfolded and inebriated, but our budget isn't increasing any time soon. @ variables in Ruby on Rails