How does transvoxel algorithm work and how can I implement It?

After wasting over three days of researching on DuckDuckGo/Google, trying to understand  and existing implementation, I come here to clarify the subject for me and made it easier for the next person who wants to implement it.  Here is the  which explains well what the algorithm solves. So now I'm happy to find something that solves my current problem, so I would like to implement it to my code, but the website doesn't explain how to implement it or sharing code (except tables). So I was looking for existing implementation of the transvoxel algorithm:   : Looks great but this solution all-in-one (octree, caching, voxel, etc.) I really tried to understand the transvoxel class into this one, but no. : Looks great too but again, all in one. I tried too to understand, I translated the code from C++ to C#, but no again.   Finding for marching cube was so easy, one class copy&paste, one public function.  So I gave up the idea to use existing implementation. Why not implementing it myself? (Sadly I don't have the skill to fully understand what the paper said, for example the ambiguous case).  The first thing I didn't understand was if transvoxel is a modified marching cube or a seconds layer that modify the work of the marching cube. In the C++ code (second link of the list) the code uses a implementation of marching cube and transvoxelize each border, on the paper they talk about 19x19x19 voxel data on 16x16x16 chunk and about a modified version of marching cube.  So do you guys can explain me how the transvoxel algorithm works and how can I implement it on my existing project?  My existing project is an Unity3D project which uses marching cubes for an infinite world, LOD chunk are ready, the only one thing missing is fixing crack between different LOD level chunk.


A point in a closed set in Euclidean Space

''There exists a point in a closed set which is at minimum distance from a point not in the set.''  I have no idea why this is true.  Any help will be appreciated.


Consider $P(n)$ as a number of $n$-permutations, which each cycle have even length, and ...

Consider $P(n)$ as a number of $n$-permutations, which each cycle have even length, and $N(n)$ as a number of $n$-permutations, which each cycle have odd length. Calculate $P(2n)-N(2n)$


When is "seems to be" used instead of "seems"?

The baby seems happy/comfortable. The baby seems to be happy/comfortable.   Are these both correct? If both are correct, what are the differences between them?


Class data member doesn't change after the assignment

There is a code:  class A {     int x = 12; } public class Program {     public static void main(String [] args) {         A a = new A();         int d = 10;         a.x = d;          System.out.println("a.x: " + a.x + ", d: " + d);          d = 52;         System.out.println("a.x: " + a.x + ", d: " + d);     } }   The output is:  a.x: 10, d: 10 a.x: 10, d: 52   Why a.x doesn't change? As I understand during the assignment the left value take a reference of the right value, and if right value will changed after, the left value must change too. Why it doesn't happen?


When trying to install ibus-avro in Ubuntu 14.04 the following results appear. What I should do?  The following packages have unmet dependencies:   ibus-avro: Depends: ibus (>= 1.4.1-3ubuntu1) but is to be installed            Depends: libibus-1.0-0 (>= 1.4.1-3ubuntu1) but it is not going to be installed            Depends: gjs (>= 1.32.0-1ubuntu1) but 1.40.1-0ubuntu0.3 is to be installed            Depends: gir1.2-gjsdbus-1.0 but it is not going to be installed


I found this in toptal.com. how come output of this is ten 10 times?  delegate void Printer(); static void Main() {       List<Printer> printers = new List<Printer>();       for (int i = 0; i < 10; i++)       {            printers.Add(delegate { Console.WriteLine(i); });       }        foreach (var printer in printers)       {            printer();       } }


I want to generate a PDF by passing HTML contents to a function. I have made use of iTextSharp for this but it does not perform well when it encounters tables and the layout just gets messy.  Is there a better way?


My company is sending me for a business trip to UK but now after doing all the work of appointment and biometrics I reviewed the soft copy of my application form and I saw that by mistake I put my father's first name in my mother's surname field. I don't how this happened but I think I was in a rush and really had no idea because this is the first time I was supposed to travel. I am so depressed and tensed now and I am 100% sure they'll reject my application on the basis of this mistake. I don't know how I'll tell about this to my employer. Does anyone have any suggestion please?


Is there any program to provide a consistent interface across multiple archive types?

At the moment, if I download a compressed file, it could be any of a .tar.gz archive, a tar.bz2 arhive, a .zip archive or a .gz archive. And each time I do so, I have to remember what the command line options for that program are.  Is there any CLI program where I can just go:  undocompression somefile.??  and let it figure out what format the archive is in? (overly long name used to avoid conflicting with any real program)


What tool do you recommend to track changes on a Linux/Unix server

I manage several Linux servers for clients in several roles like email, caching, web serving, filtering, firewalling/routing, and so on.  Since I don't own these computers and just provide remote support, central management systems like Puppet don't seem like they are the correct tool.  (Please correct me if you think I am wrong about this assumption)  What tools do you recommend to track changes of configuration files, package installs and so on?  I am thinking something like  may be near to what I need, but I want to know if there is something better.    Update  We will have backups of the systems, and I wouldn't expect this type of a tool to be an alternative to a backup.  This is about keeping track of changes of configuration and having a system to know what changed when, by who, and hopefully why.


Related tag list in Top Users for tag contains tag itself

On the , no matter which one of the subtabs (user, hot, new or synonyms) is selected, the list of related tags contains a tag itself:        To see this, click "top users" in the tag hover infobox or "more »" in the tag info page under Top Answerers. All subtabs are affected.


So just now, I had a bug in my site that caused my custom navigation bar's buttons to be sized and spaced incorrectly. I had no idea where this bug came from, and had to search around for awhile to find the answer. It turns out that SharePoint decided it would be a good idea to inexplicably add a few lines of:  nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;  nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;   between my   in my DevHome.aspx (I'm using Angular for this particular project). So, why does Sharepoint do this, and how do I prevent it? This is not the first time SharePoint has randomly added an nbsp to my page.  Thanks in advance.


Is placing existential quantifier before universal different from placing universal quantifier before existential?

if I write "there exists x for all y (statement)" vs " for all y there exists an x (statement)" . does it make any difference?  does the first statement mean that there is an x which makes the (statement) valid for all the y? does the second statement mean" for any given y, there will be an x which makes the (statement) true? Or do the statements mean same?


How can I group different levels of classes of a categorical variable in logistic regression?

Suppose I have a categorical variable neighborhood, which can take the classes Neighborhood1, Neighborhood2, Neighborhood3.  I would like to know which neighborhoods can be grouped and what neighborhoods differ in their effect from the rest, and then merge the ones with similar effects into one class.  I thought about running a logistic regression model and group all the classes with no statistical significance into one. (A note here, I would run the model with no intercept, because the baseline class method wouldn't be appropriate)  Do you think that is viable? Any other suggestion on how to proceed?


A tensor of type (r,s) on a vector space V is a C-valued function T on V×V×...×V×W×W×...×W (there are r V's and s W's in which W is dual space of V) which is linear in each argument. We take (0, 0) tensors to be scalars, as a matter of convention. The interpretations of (r,0) tensors are trivial, since they are definitions of multilinear functionals (as a special case (1,0) tensor interpreted as covector (elements of dual space)). We can interpret (1,1) tensors as follows: A(v,f ) ≡ f (Av). Say we have a linear operator R; then we can turn R into a second rank tensor T by T(v,w) ≡ v · Rw where · denotes the usual dot product of vectors. If we compute the components of T we find that the components of the tensor T are the same as the components of the linear operator R. Ok. Everything is good. But I cant understand interpretations of other (r,s) tensors. For example I found in Wikipedia (0,1) tensor intepreted as a vector or (0,2) as a bivector and in general (0,s) tensor as n-vector tensor; or (2,1) tensor as cross product and so on. I want you to show how the tensors in general interpreted. Is it possible for you to show these interpretations like as I did for (1,1) tensor ? Please dont close this post. My answer is not in "What is tensor ?"


Why don't the std::fstream classes take a std::string?

This isn't a design question, really, though it may seem like it. (Well, okay, it's kind of a design question). What I'm wondering is why the C++ std::fstream classes don't take a std::string in their constructor or open methods. Everyone loves code examples so:  #include <iostream> #include <fstream> #include <string>  int main() {     std::string filename = "testfile";           std::ifstream fin;      fin.open(filename.c_str()); // Works just fine.     fin.close();      //fin.open(filename); // Error: no such method.     //fin.close(); }   This gets me all the time when working with files. Surely the C++ library would use std::string wherever possible?


Border rendering suddenly not supported by sequencer & odd problem with rendering

Whenever I render a single frame of my animation, for all key frames except one it will just give me black real quick while that odd one out will show me an older render of mine from that same keyframe. I could switch cameras, change the position of anything in the scene, or alter rendering settings but it will just give me back the inital 720p render without even looking like it rendered anything at all.  When border is enabled in the rendering, I get an error message saying "Border rendering is not supported by sequencer."


jQuery click function not working with unordered list

I'm having some issues with  code.  I'm trying to dynamically create images as unordered list items that can be clicked and repeat the process.  However, when I get to the second level, I'm not able to click on the images to get them to generate additional list items underneath.  Can someone tell me what I'm doing wrong here?  I'm able to click on any one of the first three images (all with the same class) and it works; I'm not sure why the second tier wouldn't work.  $(".pic").on('click',function() { var parent = $(this).parent().append("

"); });  $(".child").on('click',function() { alert($(this).parent().attr('class')); var parent = $(this).parent().append("

"); });


I know it sounds like a weird question to ask but I find it unusual nobody has actually told me. I know what it does but not what it is... I have some kind of idea that it's actually matter and matter is energy and everything in the universe is just kind of intermingled if that makes sense..? I don't know! But can somebody help me understand, that would be great! Thanks


WordPress question mark displayed for russian

I am using the following code to display the posts.    $args = array(     'posts_per_page' => -1,     'post_type' => 'products',     'post_status' => 'publish',     'post_parent' => 0,     'orderby' => 'menu_order',     'order' => 'ASC', ); $the_query = new WP_Query($args);


How to make ridge structure of crispy chicken

In food shop, we see many fold ridges on crispy chicken like this Picture:   While googling about the secret, I found most of them advised to put the chicken pieces in a bag after dipping it in the butter, then shake, dip and re shake. But in practical, this shaking process does not create ridges structure [Like in the above picture]. In many youtube videos, although at the beginning of the video, it is showing ridges picture, but after completion of the video, the chicken pieces do not cover with ridges. Some other advised to use corn flakes to make these ridge structure. But corn flakes are expensive.  My question is how to make these ridges without corn flakes? Is there any alternative or real video tutorial?


I was wondering if I could autorun my script as soon as I opened the blender file?


What if both null hypothesis and alternative hypothesis are wrong?

In hypothesis testing, alternative hypothesis doesn't have to be the opposite of null hypothesis. For example, for $H_0: \mu=0$, $H_a$ is allowed to be $\mu>1$, or $\mu=1$. My question: Why is this allowed? What if in reality, $\mu=-1$ or $\mu=2$, in which case if one applies, say, likelihood ratio test, one may (wrongly) conclude that $H_0$ is accepted, or $H_0$ is rejected and hence $H_a$ is accepted?   What about this proposal: $H_a$ should always be the opposite of $H_0$? That is, $H_a: H_0$ is not true. This way, we are effectively testing only a single hypothesis $H_0$, rejecting it if the p-value is below a predefined significance level, and not have to test two hypotheses at the same time that can be both wrong.


Hello Ubuntu community. I am a Syrian IT student who tries always to gain new skills but due to conflicts in Syria we are not allowed to download important programs such as Android Studio which is the main reason for me. being forbidden is the opposite goal of GNU and Open Sources projects so please if any one can give us a way to get access to download many important programs to us i would be very thankful.. UPD: to be specific I can access any website using Firefox Anonymox addon but the real problem is that i can't download any thing from these websites


I'm really concerned because a need to know if Ubuntu is totally free for a company. I mean, if I use a private software, I have to pay that license package, but Have I to pay for use Ubuntu? Have I to get a license?


Is it possible to create a cartoon mouth using Bezier curve?

I am trying to create a cartoon character with a simple mouth, but there are no tutorials that answer my question. Can I use a curve to animate a mouth? And if so, how can I?


Can I have more than one superuser account in unix?

I've started learning Unix (coming from the windows world) and was wondering if I can create other users in the Unix with the same powers as the root user and # on their shell prompts?


How do I execute a file from a FAT USB drive?

I'm trying to install a portable app onto my USB drive such that it is compatible with both Ubuntu and Windows (specifically, a program called eToys). Support is already built into the app for both operating systems - there's etoys.sh for Ubuntu and etoys.exe for Windows. I decided to install onto a FAT drive since that can be read from both systems. This works fine for Windows, but for some reason I cannot execute etoys.sh on Ubuntu.  The problem is not with the file - when the whole folder is copied to the local hard drive, the app works great in Ubuntu. But when I try to execute it from the USB, it opens the file in a text editor.  I then tried to run it from a terminal, but I got the message Permission denied.  I've had the same problem with other executables as well.  Is there an easy way to execute things from a USB stick?


Messed up my Downloads folder. How to get it back?

I've changed my Downloads folder location to D:\Test\Downloads.  Then I accidentally set the Desktop folder to D:\Test.   After getting it back to C:\Users\MyName\Desktop, the D:\Test\Downloads is not marked as a user folder anymore, meaning that at properties, the Location option is not more available.   Trying to get it back, I've created a folder named Downloads at C:\Users\MyName\Downloads, but it also does not have the Location option.  When I run (Windows+R) shell:Downloads, windows cannot find it.  So, how can I get back the Downloads folder?    OS: Windows 7 x64 Pro.


The counselor recommended that he go to a community college.   I found the above example . What is the context and why not goes after he?


Model is multiple colors and renders with artifacts

A couple days ago I decided to try Blender.    Why on screen do some faces have a different color and some "scratches"? How do I make all of the 3d model one color? And after rendering I have some artifacts (see screenshot). What is the reason of this?


Stereo sound through whole 5.1 speaker set - is it possible with WinXP or 7?

Is it possible to "upmix" (split) stereo output from games, winamp, youtube and so on through 5.1 speaker set? Movies from DVD or some games uses all 6 speakers, but most of today's usage does not.  I know foobar2000 can upmix stereo MP3 to all speakers, I'd like to process all stereo sound that way.  Is there any solution for Windows XP or 7?  EDIT: I'm talking about onboard 5.1 sound output AC97 nForce2 chipset in my case. Definitely low-end. EDIT2: No digital output, 3 analog mini-jacks there.


       <input type="text">ADD

   $(document).ready(function(){     $("#add").click(function(){         $("#addnew").append("
<input type=\"text\">delete
");     });     $('#ab').click(function(){        alert();      }); });   I clicked #add. Append
<input type=\"text\">delete
 later click #del. No function.  I have two  ajax functions. Call PHP include html code


History substitution fails when implemented in shell script

The below command works in command line  rsync -avh -r /Source/09_03_2016/ /Destination/ echo $(basename !:3)      Output 09_03_2016   But when I do this in shell script it does not work  #! /bin/bash  /usr/bin/rsync -avh -r /Source/09_03_2016 /Destination/; echo $(basename !:3)      Output  !:3


[![I am having problem understanding reversed biased pn junction as the explaination provided by my book or any other source about flow of current in forward biased condition seems equally applicable for RB conditions also i.e. current should flow in both conditions.   Read the explaination of my book it say,in FB electrons and holes combine near the pn junction and cease to exist and at the same time a covalent bond breaks near the positive terminal of battery in p region,of which electron travel to the positive terminal of battery and hole towards the junction and at the same time an electron releases from negetive terminal of battery and into the n region hence completing the circuit.  Now what I am saying,apply the same rules in RB and current will flow regardless of biasing.As in RB postive terminal is connected to N-type and negetive to P-type and holes in p-region and electrons in n-region are pulled away from the junction.Now what should happen is electron from negetive terminal of battery should combine with holes in the p-type and a covalent bond break at pn junction,of which electron should travel to the n-region and electron present in n-region should move to positive terminal of battery and hence completing the circuit.So where is the catch. ][1]][1]  [1]:


Ubuntu 12.04.2 Dual boot UEFI Windows 8 Preinstalled CX21903W Ultrabook

Hi i have a problem trying to install ubuntu. The machine is a CX Ultrabook model CX.21903W Intel I5 with 500GB hard disk, 8 GB ram and 32 GB SSD.   From , and according to the steps guide:   We create a partition from Win8 (70 GB) using the win8 program. Confirm-SecureBootUEFI=True. From Win8, shift + Restart and from special menu we selected the UEFI Firmware Setting. From BIOS Option:   Option 1) Disable Secure Boot. Option 2) Disable UEFI (Not Available) from Option 1: Three  ways is available.  With Secure Boot enable -> We can't  even boot ubuntu. A red windows saying Soft unproper signed.   With Secure Boot disable -> and this config in boot device order:  1 - UEFI: USB 2 - Windows Boot Manger 3 - Others   with CSM (Compatibility Support Module): enable -> GRUB appears and selecting try Ubuntu then a black windows appears and nothing happens. The same result if install ubuntu is selected. With Secure Boot disable -> and this config in boot device order:   1 - USB (No UEFI) 2 - Windows Boot Manger 3 - Others   with CSM (Compatibility Support Module): enable -> GRUB appears and selecting try Ubuntu, -> Ubuntu boots and we can even install it.  Rebooting and just changing the boot order as  1 - Ubuntu [] 2 - Windows Boot Manger 3 - Others then nothings happens. Booting from LiveUSB again and, as per instructed, making Boot-Repair (A warning windows: Ubuntu is working in legacy mode.). Saving changes and rebooting, Grub works but selecting Ubuntu, a black windows appears and nothing happens. Selecting Win8, Win8 boots and works.   Up until now we are unable to install Ubuntu.  Any suggestion will be welcomed.  Kind regards and thanks in advance.


Link between moment-generating function and characteristic function

I am trying to understand the link between the moment-generating function and characteristic function. The moment-generating function is defined as: $$ M_X(t) = E(\exp(tX)) = 1 + \frac{t E(X)}{1} + \frac{t^2 E(X^2)}{2!} + \dots + \frac{t^n E(X^n)}{n!} $$  Using the series expansion of $\exp(tX) = \sum_0^{\infty} \frac{(t)^n \cdot X^n}{n!}$, I can find all the moments of the distribution for the random variable X.  The characteristic function is defined as: $$ \varphi_X(t) = E(\exp(itX)) = 1 + \frac{it E(X)}{1} - \frac{t^2 E(X^2)}{2!} + \ldots + \frac{(it)^n E(X^n)}{n!} $$  I don't fully understand what information the imaginary number $i$ gives me more. I see that $i^2 = -1$ and thus we don't have only $+$ in the characteristic function, but why do we need to subtract moments in the characteristic function? What's the mathematical idea?


How do I bind the tmux prefix to a Super?

I find even Ctrl+b to be very emacs like but I understand the point. I'm wondering if I could bind it to a single keypress of a key I don't other wise use? namely Super_L (also known as the left windows key. for why I say Super_L start xev in a terminal and press that key)


In general relativity, if an object has no speed is it then not affected by gravity?

The way I understood general relativity is that there is no force of gravity but instead all object just move forward but the space they move through is distorted and that's why their trajectory seems to be different than a straight line. Now here is the question, if an object is not moving at all, i.e. it has no speed, does that mean that even though space is curved around them there is no speed to move the object towards the larger object?


Python code executes but nothing happens

I'm trying to write a script that looks into a database and lists all the datasets that begin with zone. The script then enters into a for loop and copies a map into each on the datasets listed. The code returned exit code 0 and it even prints the zone in the interactive window, but the map isn't copied into the respective datasets. This is the code I have so far:  import arcpy import os PATH = r"C:\Users\Daimon Nurse\Desktop\DFMPROJECT\DFM.gdb" PATH2 = r"C:\Users\Daimon Nurse\Desktop\DFMPROJECT" arcpy.env.workspace = PATH arcpy.env.overwriteOutput=True  zones = arcpy.ListDatasets("Zone*") mxd = arcpy.mapping.MapDocument(r"C:\Users\Daimon Nurse\Desktop\DFMPROJECT\Complete Final Capstone Map\Complete Z2 Campus Map_Landscape1.mxd") for zone in zones:     print zone     mxd.saveACopy(PATH2 + zone +  ".mxd")


Set and cardinality injection and surjection proof

Let X be a set. Prove there is an injection from $X \rightarrow 2^X$. Prove that there is not a surjection from $X \rightarrow 2^X$.   My try- Assume to the contrary that $f: X \rightarrow 2^X$. is a surjection and consider the set $M=\{x\in X | x \not\in f(x)\} $. Then show to show that M doesn't have a pre-image. So, there is no surjection.


Will animals spawn less likely in offline mode?

In Minecraft, I usually play by myself in the single player game mode. Now I had to disable the internet access on my laptop because of an overload on internet usage. When playing Minecraft I searched for some pigs and horses to bring back to my city, but after an hour of looking around I only found a few chickens (that I happily murdered).   Do animals spawn less frequently in offline mode or is this just sheer coincidence?


Notation to refer to all the n element subsets of a set?

Is there a notation to refer to all the n element subsets of a set? I know the power set denotes all of the subsets.


Building a triangle from random segments

The problem  Let's consider the interval $[0, 1]$. We break this interval randomly in two parts. Then we choose the bigger part and again we break it randomly into two parts. At the end we have three parts of the interval. Breaking points are distributed uniformly. I am to find the probability of getting a triangle from these three pieces.  My attempt  First of all let's notice that a triangle can be build iff:   $a+b>c$, $|a-b| < c$,   where $a, b, c$ are lengths of our triangle sights.  Let's denote the breaking points by $x$ and $y$. Suppose $x > \frac{1}{2}$. We do have three intervals after breaking our segment: $[0, y], [y, x], [x, 1]$.  The first condition of triangle's existence is trivially fulfilled. The second one implies: $$y > x - {1}{2} \text{  and  } y < \frac{1}{2}.$$ I calculated that: $$f_{Y|X}(y|x) = \frac{f(x, y)}{\int \limits_{\infty}^{\infty}f_X(x) \mathbb{1}_{[0,x]}(y) \mbox{d}y}.$$ Where $f(x) = \mathbb{1}_{[0,1]}(x)$ and $f(x, y) = \mathbb{1}_{[0,1]}(x)\mathbb{1}_{[0,x]}(y)$.  I don't really know how the integration should look like. I would appreciate any tips or hints.


How exactly do I explain why the proof is incorrect?

Explain in detail why the following “proof” is incorrect.   Theorem $1$. All positive integers are equal.   Proof. We show that any two positive integers are equal, from which the result follows. We do this by induction on the maximum of the two numbers. Let $P (n)$ be the statement “if $r$ and $s$ are positive integers and max{$r, s$} = $n$ then $r = s$”.   Clearly $P (1)$ is true. Suppose that $P (n)$ is true and let $r, s$ be positive integers whose maximum is $n + 1$. Then max{$r−1,s−1$} = $n$. By the inductive hypothesis, $r−1=s−1$ and hence $r=s$. Thus $P(n+1)$is true.   The result is now proved by mathematical induction.


PDA for this CFL $L=\{a^i b^j c^k, k=i*j, i,j=0,1,2...\}$

I have troubles constructing pushdown automata for the following language: $L=\{a^i b^j c^k \mid k=i*j; \quad i,j=0,1,2...\}$ .I am not interested in the automata itself, just the idea of handling the product.


How to make a contour map from a list of points and values?

I need to create a nice map with contours that represent various thematic data on a scale of a country, for instance, average temperatures in Germany.  I have a list of coordinates with the values, and that's it. I am a bit lost here what's the best approach. The output should be a PDF or raster map (I am not interested in a web service). The base map can be very basic with just country borders and optionally major cities.  My idea was to use matplotlib and somehow overlay the contours over a map, but I don't think that it'd look professionally made and appealing.  What are your recommendations? Can QGIS do the complete job?


How can I find out the current location of the logged in user?  When a user is logged in I just want to search the current location of user and save the lat and long in the database . How can I do that? Please help.


How to Find the Percentage Between Two Ratios?

If 0% = 900 and 100% = 1800, how do you find the percentage of 1200? Question: 1200 = ?% ms = milliseconds In other words, on a timeline from 0ms to 1800ms, if an object weren't to move until 900ms passed, and it would have moved exactly 0% during that time. What percent would it have moved until it stopped at 1200ms? This formula would be used on a website :)


Dispatch Two internet connections in Ubuntu

I have two internet connections and I want to use them simultaneously in Ubuntu server to increase bandwidth and use this Ubuntu server as gateway for my LAN.


I was given this series:  Let $q \in \mathbb{C}, \mid q\mid <1. $  $$\frac{1}{2}\sum_{n=0}^{\infty} (n^2 +3n +2)q^n $$  Now I have to show that   $$\frac{1}{(1-q)^3}=\frac{1}{2}\sum_{n=0}^{\infty} (n^2 +3n +2)q^n$$  and proof whether or not this series converges absolutely.  For the convergence I guess I have to use one of the many convergence criteria and for the equality I have no clue how to even start.


I'm looking for a motivation of the unicity (up to isomorphism) of Categorical Quotient of an algebraic group. I would think that the surjectivity of the map is important but it's not asked.


Will I receive a message if my question or answer was flagged?

If I asked a question and it was flagged by others, will I receive a message?


How to use blender change material color with python

I have a model about blender,there is a object （name's car_AudiA8） with multi-material，I want to copy a new object from the object ("car_AudiA8"),then change new object's color and old object's color is not affected,my method is :  obj = bpy.data.objects["car_AudiA8"] mesh = obj.data new_obj = bpy.data.objects.new("car_AudiA8", mesh) bpy.context.scene.objects.link(new_obj) bpy.ops.object.make_single_user(object = True, obdata = True, material=True,texture = True ) for slot in bpy.data.objects[new_obj.name].material_slots:     if (slot.name.startswith("carpaint.Black")):         bpy.data.materials[slot.name].diffuse_color = (1,0,0)  but when the method doesn't work,I don't know reason. when render the object , car's color doesn't change.


What happens if a Vargouille victim dies before turning?

Title says it all, a humanoid gets the Vargouille curse, but dies before they turn.  What happens, does the curse break, or just pause like in daylight, or do they still turn in the same rate, or do they turn immediately?  (So basically, can a Revivify spell be used as a pseudo Remove Curse?)


Translated to English using Google:  I bought a notebook asus f552cl that has the ability to use either the integrated video card or video card intel nvidia geforce 710m with optimus technology. Now on ubuntu 12.04 (the only one that does not give me problems with the network adapter atheros), is used only the intel integrated card, but I would always use the nvidia. How do I install the drivers for the nvidia card and make it usable by default? Thanks and sorry for the problem possibly even stupid    Original question:     Ho comprato un notebook asus f552cl che ha la possibilità di utilizzare o la scheda video integrata intel o la scheda video nvidia geforce 710m grazie alla tecnologia optimus. Ora su ubuntu 12.04 (l'unico che non mi da problemi con la scheda di rete atheros), viene utilizzata solo la scheda intel integrata, mentre io vorrei utilizzare sempre la nvidia. Come devo fare ad installare i driver per la scheda nvidia e renderla utilizzabile di default? Grazie e scusate per il problema possibilmente anche stupido


How do I find out what hard disks are in the system?

I need to know what hard disks are available, including ones that aren't mounted and possibly aren't formatted. I can't find them in dmesg or /var/log/messages (too much to scroll through). I'm hoping there's a way to use /dev or /proc to find out this information, but I don't know how. I am using Linux.


Question about Angle-Preserving Operators

This an exercise out of Spivak's "Calculus on Manifolds".  Edit:  There was a typo in the exercise as is noted below in the answers.  The statement has been edited to reflect this.  Given $x,y\in\mathbb{R}^{n}$, the angle between $x$ and $y$ is defined by  $$\angle(x,y) = \arccos\left(\frac{\langle x,y \rangle}{|x|\cdot |y|}\right),$$ where $\langle x,y \rangle$ denotes the standard Euclidean inner product.  A linear operator $T:\mathbb{R}^{n}\to\mathbb{R}^{n}$ is said to be angle-preserving if $\angle(T(x),T(y)) = \angle(x,y)$ for every $x,y\in\mathbb{R}^{n}$.  The exercise as stated:  Let $\{x_{1},\dots, x_{n}\}$ be a basis for $\mathbb{R}^{n}$.  Then suppose that $\lambda_{1}, \dots, \lambda_{n}\in \mathbb{R}$ are such that $Tx_{j} = \lambda_{j}x_{j}$ for each $j = 1,\dots, n$.  Then $T$ is angle-preserving only if (not if and only if!)$|\lambda_{i}| = |\lambda_{j}|$ for every $1\leq i\leq j\leq n$.  I'm having problems with the $(\Rightarrow)$ direction.  My best attempt (which seems to lead nowhere) is to suppose that $|\lambda_{j}|\neq |\lambda_{k}|$.  Then by assumption, \begin{align*} \angle(Tx_{j},Tx_{k}) & = \arccos\left(\frac{\langle Tx_{j},Tx_{k} \rangle}{|Tx_{j}|\cdot |Tx_{k}|}\right)\\ & = \arccos\left(\frac{\langle \lambda_{j}{x_{j}},\lambda_{k}{x_{k}} \rangle}{|\lambda_{j}{x_{j}}|\cdot |\lambda_{k}{x_{k}}|}\right)\\ & = \arccos\left(\frac{\lambda_{j}\lambda_{k}\langle {x_{j}},{x_{k}} \rangle}{|\lambda_{j}|\cdot|\lambda_{k}|\cdot|{x_{j}}|\cdot |{x_{k}}|}\right)\\ & = \arccos\left(\text{sign}(\lambda_{j})\text{sign}(\lambda_{k})\frac{\langle {x_{j}},{x_{k}} \rangle }{|{x_{j}}|\cdot |{x_{k}}|}\right)\\ \end{align*} may also be calculated as \begin{align*} \angle(Tx_{j},Tx_{k}) & =  \angle(x_{j},x_{k})\\ & = \arccos\left(\frac{\langle x_{j},x_{k} \rangle}{|x_{j}|\cdot |x_{k}|}\right). \end{align*}  Then since $\arccos$ is injective, I believe I can make the jump that $\text{sign}(\lambda_{j})\text{sign}(\lambda_{k}) = 1$, which does not resemble the conclusion that I should arrive at.  Note:  I wasn't sure what tag to put this under, so anyone who knows better please feel free to adjust.  Thanks for any help you can give.


Does rooting an android phone effectively also unlock it from network

If you root an android phone does this also unlock it from a network?  I.e. say you had a moto g locked to the vodafone network, and then you rooted the phone, would it then be unlocked from vodafone?


Suppose $G$ is a group and $H,K \trianglelefteq G$. If $H \cap K =1$ the $hk=kh$ for all $k \in K, h \in H$?  Here is what I have so far:  Take $h \in H$ and $k \in K$ we wish to show $hk=kh$ or equivalently $hkh^{-1}=k$. Now I know $hkh^{-1} \in K$ since $K$ is normal in $G$ but I don't know how to show that $hkh^{-1}=k$ i.e. it is the element we want it to be not some other element of $K$. I haven't used the fact that $H \cap K=1$ yet so I guess it follows as a consequence of that but I'm not seeing how at the moment.


I'm currently in possession of 2 different versions of Stephen King's The Gunslinger.  One of those is found  and here is a paragraph (found on page 6).     Perhaps the campfires were a message, spelled out one Great Letter at a time. Keep your distance, partner, it might say. Or, The end draweth nigh. Or maybe even, Come and get me. It didn’t matter what they said or didn’t say. He had no interest in messages, if messages they were. What mattered was that these remains were as cold as all the others. Yet he had gained. He knew he was closer, but did not know how he knew. A kind of smell, perhaps. That didn’t matter, either. He would keep going until something changed, and if nothing changed, he would keep going, anyway. There would be water if God willed it, the old-timers said. Water if God willed it, even in the desert. The gunslinger stood up, brushing his hands.   The other version, I don't know where it comes from. Here is the same paragraph.     Perhaps the campfires are a message, spelled out letter by letter. Take a powder. Or, the end draweth nigh. Or maybe even, Eat at Joe’s. It didn’t matter. He had no understanding of the ideograms, if they were ideograms. And the remains were as cold as all the others. He knew he was closer, but did not know how he knew. That didn’t matter either. He stood up, brushing his hands.   These differences seem too big to be a simple different edition of the book. What is the 2nd version, and how does it relate to the current official The Gunslinger, linked above?    Edit: by googling this exact paragraph, I have found the same version in some piracy ebook websites. Is it perhaps a commonly pirated version of Gunslinger?


Find the sum of finite series $S=\sum_{k=1}^{2015}{(-1)^{\frac{k(k+1)}{2}}}k$

Find the sum $S=\sum_{k=1}^{2015}{(-1)^{\frac{k(k+1)}{2}}}k.$  I partitioned k in two categories Either k is congruent to 0 , 3 mod(4) or congruent to 1,2 mod(4). But still I didn't get answer


recursively add directory name to file name

Given the following structure:  source/   dir1/    file1.ext1    file2.ext2   dir2/    file3.ext3     dir3/      file4.ext4   I want to achieve the following:  destination/  dir1file1.ext1  dir1file2.ext2  dir2file3.ext3  dir3file4.ext4   In other words, I want to move all the files, recursively, from source to destination, appending the original subdirectory name to the file name.


itoa() is a really handy function to convert a number to a string. Linux does not seem to have itoa(), is there an equivalent function or do I have to use sprintf(str, "%d", num)?


How do I show that for $T: X \rightarrow X$ where X is complete and $T^m$ is a contraction that T has a unique fixed point $x_0 \in X$.   I know there exists $\lambda_1 \in (0,1)$ for $x, y \in X$ such that $d(T^mx, T^my) \leq \lambda_1 d(x, y)$ and I need to show that T is a contraction and then apply the fixed point theorem but how do I do that?


We have a prime $p$ and an integer $k > 0$. When does the following equation stand?  $(p-1)! + 1 = p^k $  I have obviously tried for some little numbers, and in some cases, it stands:  For $ p=2$ and $k=1, 1 + 1 = 2$.  For $ p=3$ and $k=1, 2 +1 = 3.$  For $ p=5$ and $k=2, 24 + 1 = 25.$  Any ideas, how to prove, if there are more, and if yes, what are the solutions?


Is it bad/dangerous/damaging to set laptop fan speed to max all the time?

I use  to set my fan speed to maximum (the maximum provided in HWiNFO, there may be higher speeds) all the time I am using my laptop to cool the processor and GPU while video editing and playing games but also when doing normal tasks. Basically, all the time the laptop is on.  Is this damaging to the processor or the GPU or the fan itself? Does it shorten its life for example?


Suppose I have two tables that don't have many columns (3, for example). How can I position them side by side?


Question about permutations and cycles (Groups and Symmetries)

Let $a = (123)(456)$ be in $S_{10}$. Find a permutation $b$ in $A_{10}$ such that the disjoint cycle form of does not contain any $3$ cycles and $a$ is in $\langle b \rangle$.  Attempt: I'm assuming that $b$ must also assign each integer to the following one in each of it's cycles (or part of a cycle) containing $1$ to $6$. But I'm not sure how to rebracket $a$ so that $b$ doesn't have a cycle of the form (###) while some other element in it's generated group sends $3$ back to $1$ and $6$ back to $4$. Is this right?


I am seeing a weird issue with my laptop installed with Ubuntu. When I log in and enter a terminal, I am missing groups:  ~$ groups ant   If I explicitly specify the username, I see all the groups:  ~$ groups ant ant : ant adm cdrom sudo dip plugdev lpadmin sambashare docker   The effect this has is that (e.g.) I cannot run docker commands in the shell. However, if I su into a new session, I do get the groups and docker commands run fine:  ~$ su ant Password:  ~$ groups ant adm cdrom sudo dip plugdev lpadmin sambashare docker   This only started happening this morning after a fresh reboot, and I'm not sure what I could have done to have broken things. Only thing that stands out is that I installed openvpn prior to the reboot.  Any ideas on how to solve this would be gratefully recieved!


I tried to log into Minecraft today to find that my password isn't working. I tried to change it, but I can't login to my email because I forgot the answer to my security question. I tried changing the email to a different one, but that didn't work for some reason (it kept saying "invalid email"). I don't have my transation ID because I forgot which credit card I used.  Does this mean that I have to buy a new Minecraft account?


Convert string to an array of ASCII values

I am trying to make a method that will take each character from a string, convert each charcter to ascii and then populate an array with the ascii values.  The method I have made prints random characters so I must have an issue in this funtion.   public class Caesar {  public int[] stringToSymbolArray(String str){     str = str.toUpperCase();     int stringLength = str.length();      int[] symbolArray = new int[str.length()];      for (int i = 0; i < stringLength; i++) {         char character = str.charAt(i);         int ascii = (int) character;         symbolArray[i] = ascii;     }     return symbolArray; }   }


Subdivision failed on boolean-subtracted object

I'm working on this project including a cylinder with holes in it. I've made the holes using the boolean modifier by subtracting smaller cylinders from the main cylinder. Here's an image of the entire object in case that helps to answer my question:    The object got lot's of edges that I want to smooth out using the subdivision modifier, but like a lot of you might know, this action will cause an action resulting in this mess:      I'm pretty sure the problem is caused by all the loose vertices around the holes that aren't connected to anything. Please speak your mind and tell me if I'm wrong.  I've tried to connect all the vertices between the holes, which resulted in a way better finish than before, but still not perfect. It takes forever to do so, and I end up with way more vertices than I need, so I'd prefer an alternative if possible. Here you can see the result I got, but be aware I haven't done this on the inside, so focus on how it on the outside:      I know you can just subdivide the cylinder before subtracting the holes, but then the holes don't get smoothed out. This was the solution answered to another question asked by 'user5199' on this link:   That is, of course, a possible way to fix the problem, but I think there has to be a simpler way to smooth everything (incl. the holes) without destroying the object as shown on my 3rd image.  Any suggestions? Any experience?


Can we prove that the eigenvalues of an $n\times n$ orthogonal matrix are $\pm 1$ by only using the definition of orthogonal matrix?

Can we prove that the eigenvalues of an $n\times n$ orthogonal matrix are $\pm 1$ from the definition of orthogonal matrix alone?   An $n\times n$ matrix $A$ is orthogonal iff $AA^T=A^TA=I$.  Is it possible to use solely this definition, without using the result proven from this definition which says orthogonality preserves length, to show that the eigenvalues of $A$ is $\pm 1$?


Exception while retrieving all available Site-Columns Sharepoint Client Model

I'm trying to retrieve all available site-columns from my sharepoint site. This is what I do:  ClientContext clientContext = new ClientContext(siteURL); clientContext.Credentials = websService.Credentials; Web web = clientContext.Web; clientContext.Load(web, w => w.AvailableFields); clientContext.ExecuteQuery(); FieldCollection availableColFields = web.AvailableFields;   But I'm getting an exception here:      An unhandled exception of type 'Microsoft.SharePoint.Client.ServerException' occurred in Microsoft.SharePoint.Client.Runtime.dll   Additional information: Requested value 'CheckBoxes' was not found.   It occurs at:  clientContext.ExecuteQuery();   NOTE: This didn't happen earlier. I also created a new site-collection and there I got the same exception except this time the Requested value '' was not found. was not Checkboxes.  Can anyone please help me understand what causes this exception and what can be done to resolve it. Thanks in advance.  Updated: I tried retrieving the columns using:  clientContext.Load(web, w => w.Fields); clientContext.ExecuteQuery(); FieldCollection availableColFields = web.Fields;   The issue is still there.


how to install a tar file with a command?

im search on many website to install it.but they sad if there is a INSTALL file,but in my file there no such of that named file.so,is there a way to install it from terminal?


how to add node in compositing window using Python

I have Created a Material and Added Some Nodes using Python Script. Now I wan't To Add Some Nodes To Compositor using Python How to do that ? Can anyone tell that directly or Should I share the Code Which I wrote Earlier to create a Material and adding some diffuse and glossy nodes.


Projection on a closed convex in a Banach space, without inner product.

It is a know fact that in any real Hilbert space $E$, given a point $a \in E$ and $C$ a closed convex and non-empty set in $E$, theres one and only one $x \in C$ such that $d(a,x) = d(a,C)$.  My question is: can it be extended to norms not coming from an inner product in a Banach space? It is easy to prove that:   Uniqueness of such a $x$ is guaranteed when $(E, \| . \|)$ is a strictly convex space. The existence always holds if $E$ is finite dimensional.   So does the existence holds without any assumption on the dimension of $E$, even if it's a strictly convex Banach space?


Recently, I've seen a few examples of people writing either "I took the TOEIC test" or "I took the TOEFL test". They tend to be ESL students, so I don't want to be a grammar Nazi about it, but for my own curiosity, I wonder if the redundancy (e.g. the Test of English for International Communication test) is considered grammatically incorrect. Google has not yielded any satisfactory results, so I'm curious if anyone here has some insight.


Consider the set $X=\{S\in M_2(\mathbb C):A=A^* \}$  Further given that all the eigen values of $A$ have modulus less than equal to 1.  Is the set $S$ compact?  I know that a Hermitian Matrix is Unitarily Diagonalisable by the Spectral theorem .So every element in $S$ is of the form $$         \begin{matrix}         a & 0 \\         0 & b  \\         \end{matrix} $$  where $|a|\leq 1;|b|\leq 1$  Hence bounded ;  But I cant show the set is closed ?  Any help


Any reason why find does not merge multiple slashes into one?

Is it true that find is not supposed to be doing even the most simple path unification/simplifications operations, such as coalescing multiple successive slashes together ()?  For example the output of find ./// is:  ./// .///somefile […]   (tested with find from GNU and busybox)  If so then why is that? Is there any sensible use case I'm missing? Perhaps for the case that someone is grepping the output of find inside scripts?  BTW, Also interesting is the output of GNU's find for find ./// -maxdepth 0 -printf '%h\n' (%h is supposed to be ): .// (simply one fewer /)


How do I address a letter when I do not know the name or gender of the person I am writing to?

If I write a letter to someone I have not written to before, I do my best to discover their name and use the appropriate title and their surname.  I recently needed to write to the administration section of a University, and I was wondering whether the traditional "Dear Sir/Madam" was still acceptable given the fact that some women prefer to be called "Ms" instead of "Miss" or "Mrs" and that the LGBTQ members of society may not identify as either Male or Female.  I have read ,  and even , however, none of them seem to provide an answer.  Note that I do not believe this is a duplicate of  as that question does not take the concern of gender identity into account, merely the concern of not knowing who to address a letter to.  Can anyone enlighten me on current protocol?


I'm sorting json objects in the json array by passing the key name. Here is the code snippet. public static void main(String[] args) {         String jsonArrStr = "[{\r\n" + "    \"id\": 6,\r\n" + " \"name\": \"manu\"\r\n" + "}, {\r\n"                 + " \"id\": 8,\r\n" + " \"name\": \"bharath\"\r\n" + "}, {\r\n" + " \"id\": 5,\r\n"                 + " \"name\": \"magadi\"\r\n" + "}]";          JSONArray jsonArr = new JSONArray(jsonArrStr);         JSONArray sortedJsonArray = new JSONArray();          List<JSONObject> jsonValues = new ArrayList<JSONObject>();         for (int i = 0; i < jsonArr.length(); i++) {             jsonValues.add(jsonArr.getJSONObject(i));         }         Collections.sort(jsonValues, new Comparator<JSONObject>() {             // You can change "Name" with "ID" if you want to sort by ID             private static final String KEY_NAME = "id";              @Override             public int compare(JSONObject a, JSONObject b) {                 System.out.println("a " + a.toString());                 System.out.println("b " + b.toString());                 Object valA = new Object();                 Object valB = new Object();                  try {                     valA = a.get(KEY_NAME);                     System.out.println("valA " + valA);                     valB = b.get(KEY_NAME);                     System.out.println("valB " + valB);                 } catch (JSONException e) {                     // do something                 }                  return -valA.toString().compareTo(valB.toString());                 // if you want to change the sort order, simply use the following:                 // return -valA.compareTo(valB);             }         });          for (int i = 0; i < jsonArr.length(); i++) {             sortedJsonArray.put(jsonValues.get(i));         }          System.out.println(sortedJsonArray.toString());      } }  this above code works for all the data-types. Currently I'm able to do sort when we have a pass single key name. example:- Order by firstName |ASC But how to handle this for multiple key. example:- Order by id,firstName | ASC and it should work like how ORDER BY function is working in db


How can I completely wipe a USB stick that seems to crash any program that tries to use it?

I have no use for the data on the drive, I just need to wipe it. The drive seems to crash any program that tries to use it, like File Explorer, Disk Management, and even the dd if=/dev/zero of=/dev/sdX command on an Ubuntu install. Is there any way I can wipe the drive? Format and the dd command do not work, are there any other methods?


How do I make my textures transparent instead of white?

I'm creating a texture pack and the glass keeps turning white instead of clear. I'm using Microsoft Paint for it and clear and white look the same, so I'm very confused. How can I fix this?


SharePoint 2013 Workflow runtime doesn't work?

I have a problem when I try to start a Workflow 2013 in SharePoint Server 2013. I believe the error is related with permissions, but I cannot be sure.  Here is the error message in the log:  RequestorId: ef9edb7c-cc3d-5e10-3681-eada907596a4.  Details: System.ApplicationException: HTTP 401 {"Transfer-Encoding":["chunked"],"X-SharePointHealthScore":["0"],"SPRequestGuid":["ef9edb7c-cc3d-5e10-3681-eada907596a4"],"request-id":["ef9edb7c-cc3d-5e10-3681-eada907596a4"],"X-FRAME-OPTIONS":["SAMEORIGIN"],"MicrosoftSharePointTeamServices":["15.0.0.4420"],"X-Content-Type-Options":["nosniff"],"X-MS-InvokeApp":["1; RequireReadOnly"],"Cache-Control":["max-age=0, private"],"Date":["Thu, 31 Jan 2013 16:36:44 GMT"],"Server":["Microsoft-IIS\/8.0"],"WWW-Authenticate":["NTLM"],"X-AspNet-Version":["4.0.30319"],"X-Powered-By":["ASP.NET"]}  The HTTP response content could not be read.  'Error while copying content to a stream.'. at Microsoft.Activities.Hosting.Runtime.Subroutine.SubroutineChild.Execute(CodeActivityContext context) at System.Activities.CodeActivity.InternalExecute(ActivityInstance instance, ActivityExecutor executor, BookmarkManager bookmarkManager) at System.Activities.Runtime.ActivityExecutor.ExecuteActivityWorkItem   The question is: What permissions do I need to configure in SharePoint for the WF publisher and the WF manager service account?  I’ve set a WF Manager service account named “wfservice” (this account is a local admin and has the sysadmin permissions in SQL Server), and I published the workflow and tested it using the account “wfuser”. Both accounts have full control permissions in the web app and are site owners, for testing WF 2013 purposes.  I’ve already done the DNS flush, as mentioned in Andrew Connell’s article, and I’m still getting an Unauthorized exception in the Item Workflow Status.  Anyone knows what’s going on? Which permissions do I need to configure?


How to prove if $a_n$ and $b_n$ converge and $a_n,b_n \ge 0$ then $a_n b_n$ also conveges?.

If $a_n$ and $b_n$ are sequences of non-negative numbers and both converge, how do I argue that $\sum a_n b_n$ also converges? My attempt: I tried to argue that $a_n b_n\le(a_n+b_n)^2=a_n^2+2a_nb_n+b_n^2$, but I am stuck on how to proceed from here.. I have a feeling that I should use the comparison test, but I am not too sure.


Which question list should I look to find my unanswered question?

I have asked a question that has just 10 views. I want to be sure that others will see the question in one list at least!  But I cannot find any list having my question in the middle. Has the question gone to 2nd and 3rd page? or what?  The question is on Stack Overflow.


How do I assess the length of text within a pgffor \foreach loop

I would like to be able to write something like the following:  \documentclass{article} \usepackage{tikz} \usetikzlibrary{calc} \newlength\aelengtha \newlength\aelengthb \newlength\aelengthc \begin{document}  \begin{tikzpicture}  \coordinate (Q) at (0,0);  \foreach \myn [count=\myc from=1]               in {apple,                   orange,                   this is a long line,                   short} {   \pgfextra{%%     \settowidth\aelengthb{\texttt{\myn}}     \ifdim\aelengtha<\aelengthb       \global\aelengtha=\aelengthb       \typeout{==>resetting=\the\aelengtha}     \fi}   \typeout{==>\the\aelengthb}   \node[anchor=base west,font=\ttfamily] at ($(Q)+(0,-\myc\baselineskip)$) {this \myn\ is an item}; }  \end{tikzpicture}  \end{document}   But, for some reason, no lengths are actually calculated.  So I tried to find a pgf solution and came up with the following:  \documentclass{article} \usepackage{tikz} \usetikzlibrary{calc} \newlength\aelengtha \newlength\aelengthb \newlength\aelengthc \begin{document}  \begin{tikzpicture}  \coordinate (Q) at (0,0);  \foreach \myn [count=\myc from=1]               in {apple,                   orange,                   this is a long line,                   short} {   \pgfmathparse{width("\myn")}   \aelengthb=\pgfmathresult pt   \pgfextra{%%     \ifdim\aelengtha<\aelengthb       \global\aelengtha=\aelengthb       \typeout{==>resetting=\the\aelengtha}     \fi}   \typeout{==>\the\aelengthb}   \node[anchor=base west,font=\ttfamily] at ($(Q)+(0,-\myc\baselineskip)$) {this is \myn\ an item}; }  \end{tikzpicture} \typeout{==>\the\aelengtha}  \end{document}   But this isn't really calculating the width of the text I want to work with.  What I would like to do is write something like  \pgfmathparse{width("\texttt{\myn}")}   But that results in an error:  ! Argument of \XC@definec@lor has an extra }. <inserted text>                  \par  l.28     }  ?    I've also tried:  \pgfmathparse{width("\noexpand\texttt{\myn}")}   without any luck either.  How can I make a calculation of the true textwidth that's being formatted within the \foreach loop?  UPDATE  There's something about the tikzpicture environment that seems to dislike or prevent my code for measuring the width of text from working.  For example, everything compiles fine in the example below (sans tikzpicture)  \documentclass{article} \usepackage{tikz} \usetikzlibrary{calc} \newlength\aelengtha \newlength\aelengthb \newlength\aelengthc \begin{document}  \foreach \myn [count=\myc from=1]               in {apple,                   orange,                   this is a long line,                   short} {   \settowidth\aelengthb{\texttt{\myn}}%%   \ifdim\aelengtha<\aelengthb     \global\aelengtha=\aelengthb     \typeout{==>Length A=\the\aelengtha : recalculated}   \fi   \typeout{==>length B=\the\aelengthb} }  \typeout{==>length A=\the\aelengtha : Final}  \the\aelengtha  \end{document}   So, this lead me to consider writing the following:  \documentclass{article} \usepackage{tikz} \usetikzlibrary{calc} \newlength\aelengtha \newlength\aelengthb \newlength\aelengthc \begin{document}  \begin{tikzpicture}  \coordinate (Q) at (0,0);  \foreach \myn [count=\myc from=1]               in {apple,                   orange,                   this is a long line,                   short} {   \pgfinterruptpicture     \settowidth\aelengthb{\texttt{\myn}}%%     \ifdim\aelengtha<\aelengthb       \global\aelengtha=\aelengthb       \typeout{==>Length A=\the\aelengtha : Resetting}%%     \fi    \typeout{==>Length B=\the\aelengthb}%%   \endpgfinterruptpicture   \node[anchor=base west,font=\ttfamily] at ($(Q)+(0,-\myc\baselineskip)$) {\myn}; }  \end{tikzpicture}  \end{document}   which works!  But, the tikz manual specifically says that \pgfinterruptpicture is not meant to be used in this fashion.  Apart from getting a valid working example, I would also like to understand why my original example above fails to work as expected.


Showing that the sum of the angles of a hyperbolic triangle are less than $\pi$

Using the law of cosines for sides: $\cosh(a) = \cosh(b) \, \cosh(c) - \sinh(b) \, \sinh(c) \, \cos(\alpha) $ I have to show that $\alpha + \beta + \gamma < \pi$ Unfortunately I find no ansatz for this question.


I want to know how is the length of array calulated in this program?

Why it is used division of sizeof(arr1[0]) to calculate length of array? It can be calulated simply without dividing it with sizeof(arr1[0]). Kindly explain this if anyone knows the reason     #include <stdio.h>    int main()   {       //Initialize array        int arr1[] = {1, 2, 3, 4, 5};        //Calculate length of array arr1       int length = sizeof(arr1)/sizeof(arr1[0]);        //Create another array arr2 with the size of arr1.        int arr2[length];        //Copying all elements of one array into another       for (int i = 0; i < length; i++) {            arr2[i] = arr1[i];        }          //Displaying elements of array arr1        printf("Elements of original array: \n");       for (int i = 0; i < length; i++) {            printf("%d ", arr1[i]);       }        printf("\n");        //Displaying elements of array arr2        printf("Elements of new array: \n");       for (int i = 0; i < length; i++) {            printf("%d ", arr2[i]);       }       return 0;   }


Origin and formation to the ERROR ‘Dimension too large’

When I tried to compile:  \documentclass{standalone} \usepackage{tikz} \begin{document} \begin{tikzpicture} \draw[very thin, red] (0,0) circle (2); \foreach \i in {0, 1, 2, ..., 46} \draw[very thin, red] ({360 * \i / 100}:1) circle (1); \end{tikzpicture} \end{document}   I got:  ! Dimension too large. <recently read> \pgfmath@x   l.6 ...thin, red] ({360 * \i / 100}:1) circle (1);  I can't work with sizes bigger than about 19 feet. Continue and I'll use the largest value I can.   And if I turn 46 to 45, say \foreach \i in {0, 1, 2, ..., 45}, that code will pass the compiling.  It seems that some value I was trying to calculate is larger than the TeX engine can handle.   After searching TeX.SX for about half an hour, I got ,  and . These questions have been solved, however, the origin and structure of the problem still remain unclear. Hence, I decide to raise this question: what is the limit (its origin and formation), and how can I avoid it.  Any clues would be appreciated.


We know that Avada Kedavra is "unblockable"  Why doesn't everyone use Avada Kedavra then, Molly Weasley vs. Bellatrix for example?   Why didn't they both just cast Avada Kedavra to finish the duel instantly?


$f_n$ defined on $[0;1]$ by $f_n(x)=x^n$, $f_n(x)$ weakly-converges if $\forall x \in I$ $(f_n(x_0))_{n\in \mathbb{N}}$ have a finite limit.   And it goes without saying (tell me if that's too weak to prove) that  $\forall x\in [0,1],f_n(x)\rightarrow 0$  $f_n(x)$ converges uniformly to $f(x)$ if $\forall\epsilon\ge 0,\exists N\in \mathbb{N}|f_n(x)-f(x)|\le\epsilon$  An it exists such a N because $\lim\limits_{n\rightarrow +\infty}|x^n-f(x)|=0$  but I'm not quite sure about the uniform-convergence as far as I don't know what's hidding behind $f(x)$ alone without $n$.


How to Legally Use Google Imagery and Maps in ArcGIS Desktop and Web Applications?

With companies like  and  offering solutions to view Google imagery and maps inside ArcGIS for Desktop, there is clearly a legal way to develop a similar product yourself. My question is how can this be accomplished and what licensing is required?  We would like to (legally) view and print Google imagery and maps inside ArcGIS for Desktop, Flex based web mapping applications, and JavaScript web mapping applications. My dream is to somehow provide this as a map service or image service using ArcGIS for Server.


I learned at school that the z-axis is up. It is the same in modeling software like Blender. However in many games the y-axis is up.  What is the reason?


Why Tesla Electric Cars Use Induction Motor?

Most Electric cars these days      use  Brushless        DC Motors. However recently someone told  me that Tesla cars use Induction motor (AC) instead? Why is it so?  Are        DC Brushless      Motors feasible compared to Induction motor?


Are historically-locked questions supposed to be hidden on meta sites now?

On main Q&A sites, it's always been the case that questions with historical locks are "hidden" or "unlisted" from most users: they don't turn up in any question lists, and only show if someone follows direct links to them. , though, such questions weren't supposed to be hidden in this manner on meta sites. But this doesn't seem to be the case anymore.  on this site has a historical lock, and is tagged . However, if you follow the tag link above, you won't see that question listed in the list of questions with that tag. At first, I thought that this was a Meta.SE specific bug, as it was being treated as a main site for these purposes. However, I have two reasons to doubt that: first, this site is correctly classed as a meta site for many other purposes (e.g. allowing unanswered duplicate targets, disabling the RemoveAbandonedQuestions Roomba criterion, etc.), and second, I found  which talks about a historically-locked question on a per-site meta that was hidden in the same manner. That post was made in January 2016, so it seems to have been broken for a long while. Why are historically-locked questions hidden on meta sites now? Is this a (long-standing) bug, or was there a feature change at some point? (Or was the May 2012 edit incorrect?)


Create a keyword in python instead of inheriting from a class

Is it possible to create a keyword in python that's equivalent to inheriting a class? So given class: class Hello:   pass  I could write keyword Custom:  pass  which would be equivalent to class Custom(Hello):   pass


Setting an alias for copying the current path from shell to clipboard fails

I have added the following alias to my .zshrc: alias pwdc="echo -n $PWD | xclip -selection clipboard"  it seems the present working directory is not getting updated, when I move to a different directory. I have tried this too: alias pwdc="echo -n `pwd` | xclip -selection clipboard"  Can somebody please explain me what am I doing wrong? any suggestion will be helpful, thank you!


Here I get a querystring depending upon the value from the command shell_exec().  I am receiving a value the querystring but shell_exec() is not working.  I am using a webcam connected to Raspberry pi 3 so the command in shell_exec() is to turn the webcam ON an OFF.  $output=shell_exec('sudo /etc/init.d/motion start')   code:  <?php $status=$_GET['status']; if($status == 'on') {     $output=shell_exec('sudo /etc/init.d/motion start'); } if($status == 'off') {     $output=shell_exec('sudo /etc/init.d/motion start'); }   How do I solve the execution issue?


how can a list:  ['tuple1_1', 'tuple1_2', 'tuple2_1', 'tuple2_2']   elegantly be transformed to a list of tuples:  [('tuple1_1', 'tuple1_2'), ('tuple2_1', 'tuple2_2')]   in python?  Something like %2 to form tuples maybe?


I'm in a bit of a pickle, I have to perform a query on a database with rather poor data quality. I am trying to evaluate a field which contains a date, but which was defined as a nvarchar. I thought I would be able to cast the value to an integer but this fails as there also non-date values in the date field (random letters and signs,etc...).   What I decided to do is as follows:  SELECT q.foo, cast( q.bar as int)  FROM ( SELECT foo,bar FROM table where ISNUMERIC(bar) = 1) as q  WHERE q.bar > 20140401   But this still crashes stating conversion failed on the nvarchar value '.       '. I expected that all values would  be castable to int as they were numeric?


Cannot shrink C: Partition beyond 297 MB

What I am trying to accomplish is to shrink my C drive by 50 GB and make that 50 GB into a new partition to install windows 8 on.   In Disk Management it shows I have Disk 0 with 4 partitions :    SYSTEM (199 MB) C (909 GB) Recovery (D) (21 GB) HP_TOOLS (102 MB).    (Unfortunately I cant include the picture because I dont have 10 rep on this site).   And the issue I have is that when I right click on C to shrink the partition it says that the shrink space available is only 297 MB, when at the top of the screen it indicates that C has 472 GB of free space. Why is it not allowing me to shrink more than 297 MB?


C# get generic type arguments from within the executed generic method without directly referencing them, i.e. typeof(T0)

Is it possible to get generic type arguments from within the executed generic method without directly referencing them (i.e. typeof(T0))? For example: public static List<(T0?, T1?, T2?, T3?, T4?)> ParseParameter<T0, T1, T2, T3, T4>(this JArray array, params string[] columnCodesCaseIndependent) {     var genericArgs = MethodBase.GetCurrentMethod()!.GetGenericArguments();          // ...      return result; }  Testing the above in debugger I see:  {Name="T0", FullName=null} same as above for the rest  So the types are not the ones actually used. net5.0


How to enable thumbnail previews for my non-standard (mp4 avi mov mkv) video files in Windows 8?

I've installed the default VLC player to decode my .mp4 files but I'd like to enable a thumbnail view in the explorer. All I see at the moment is the traffic cone (the default icon for files associated with VLC).   Possibly related are these Windows 7 questions, but I'm not sure what carries over:


I have downloaded the newest version of Arduino (to use with my Arduino Due) from here: .   At the moment I have extracted it into /home/$USER and am running it by going into arduino-1.5.6-r2 and running the executable directly.   How can I have it so it is installed as it would be if I had downloaded it using apt-get install arduino?


How to relate areas of circle, square, rectangle and triangle if they have same perimeter??

I was given a question which was like:     Suppose that a circle, square, rectangle and triangle have same perimeter. How area their areas related??   My work:  I broke the question in parts and tried to prove it seperately:  STEP $1$. Suppose the given perimeter is $P$.So the radius of circle will be ${r=P/2\pi}$.  And hence area of the circle will be:   ${P^2/4\pi}$.  Side of square will be $P/4$ and hence area of square will be $P^2/16$.   It is obvious that ${P^2/4\pi}$  >  $P^2/16$.   So Area of circle is more than area of square.  STEP $2$: Whether by using $AM>GM$ inequality or by using a bit of differentiation, we can get that product off two quantities is maximum when they are equal.  So, Area of square is more than Area of rectangle.  Here, the hardest part come (at least for me). I can't relate the area of triangle to any of Circle, Square or Rectangle. It would have been easy if the triangle was Equilateral, Right angle but the question is talking about a general triangle.  However, when I considered the situation with different examples (Assuming the perimeter and calculating the area, I got the relation:  Circle > Square > Rectangle > Triangle.  I shall be highly thankful if you guys can establish the relation in purely mathematical way.  EDIT: This question does not ask that whether circle have the largest area among all 2-D figures or not. The OP just want to relate the areas of Circle, Square, Rectangle, Triangle in a pure mathematical way.


How to ask for a newer software version?

I would like to know what's the recommended procedure to submit a request for a newer software version?  An example: I really like gThumb a lot, but the current version in Ubuntu 13.04 & 13.10 is 3.0.2. The last gThumb is 3.2.3 and was released this last august.  So, how to submit the request about refreshing a software like gThumb?  Thanks?


Like, really, really, really small.    No option to resize. Changing hats does not change the size, unfortunately all other hats become just as small.


Intel Atom Cpu D510 1.66GHz Dual Core 32 bits can run in 16.04 or 17.04?

What is the ideal version for this machine (Intel Atom Cpu D510 1.66GHz Dual Core 32 bits) I think the problem is that the minimum requirement is a 2GHz dual processor. What can be another option?


Should you use present or past tense when telling people about your work experience?

Say, I worked for a Japanese bakery in 2010-2012. Now that I am going to tell the people in the new bakery shop about my experience. Shall I say: (1), "I have two years of experience in bakery", or (2), "I had two years of experience in bakery".  I pick (2) beacuse the two-year experience is past, but I am not sure if I am correct. Please help me.


I am new to Latex, and I am trying to plot train of pulses of two variables, something like:  z = A * delta(x-x_0) * delta(y - y_0)  The best I can get at the moment is just a single mark where I would like to have at least a thin bar representing the delta. My data are in a .txt file. The first two columns represent the position for which the Dirac deltas are non-null, while the third column represent the amplitude of the Dirac delta in the specified position.  This is the image I get:    This is my code:      \begin{figure}[htb]     \centering  \begin{tikzpicture} \begin{axis} [view={-75}{25}, %axis equal, xlabel={$\bar{\alpha}/\omega_0$},  ylabel={$\omega / \omega_0$}, zlabel={$\lvert S_{\Psi} \rvert [mWb]$}, zlabel style={rotate=-90},  axis background/.style={fill=white}, xmajorgrids=true, ymajorgrids=true, zmajorgrids=true, grid style=dashed,] \addplot3 [only marks, mark size=0.5, color = blue] table[]{./img/cyclic_spectra_239.txt}; \end{axis} \end{tikzpicture}  \end{figure}


Why can't I copy a 7 GB file to an external USB HD with 120 GB free?

Yes, why can't I?  I was stashing away some old photography backup zips last night. I could copy 4 of my > 1 GB backup zips to my external USB connected hard-drive when I got the error message "Cannot copy file. Not enough free space." (sort of) for a zip of roughly 7 GB.  But there are 120 GB free. Why is this?   EDIT: Clarification - the files that I could copy was smaller than 4 GB. The failing one was 7 GB. The cause seems to be the FAT32 4 GB limit.


Texture shows in render but not in 3d view

What are reasons my UV map doesn't show up in 3D view?    3D view in object and edit mode only shows a wireframe.   However when I render, I can see the UV map applied.


How can I give a script its own icon in the Unity launcher?

With Ubuntu 16.04, if you create a launcher (desktop file in ~/.local/share/applications) with a custom icon for a terminal application (so with Terminal=true) then when you start it, it will spawn a new standard terminal icon, and your custom icon will pulse and disappear within a few seconds.  In 14.04, it just worked as expected. (it would not start a new standard terminal icon).   Any idea what to do to change this behaviour? I have a few terminal apps that I want to launch from unity and the new behaviour is problematic (I lose trace of which is which since they all end up with the standard terminal icon)...


Salesforce connecting to a JWT service via Named Credentials - JWT Token Exchange

Use Case I would like to prepare a demo for a client where we can from Salesforce access a third-party API. The authentication protocol for the external third-party API is  SF will issue a JWT and send it to the external authorization service. The authorization service will exchange the provided JWT token for the access token. When calling the 3rd party service, SF will send the access token received from authorization service to your 3rd party service as a bearer token.  Let's assume that the third-party API authorization service supports JWT as a bearer token for authorization. Salesforce Org1 to Salesforce Org2 To verify the above I have set up two Salesforce Orgs. In one Salesforce Org1 I have set up a Connected App (see below). I have also created a self singed certificate to be configured in the Connected App.  Certificate  I then tested that I can connect to Salesforce Org1 Connected App from Mulesoft (see below):  From Mulesoft I can now access the APIs exposed by the Salesforce Org1. However, what I have done next is to set up another Salesforce Org2 to call the APIs on Salesforce Org1. The final outcome is to show that from Named Credentials from Salesforce Org2 I can consume the APIs on Salesforce Org1 using the JWT Token Exchange option. I then need to set up a Named Credentials. Can anyone explain what do I need to enter in the fields in the screenshot below? Is the issuer field the email address of the administrator that set up the Connected App in Salesforce Org1? In particular the JWT Signing Certificate. I do not have any Certificate in my Salesforce Org2 yet.  Thank you :-)


When saving Ai file as Jpeg it gets blurry

When I save my .ai file as Jpeg by pressing Ctrl+Alt+Shift+S and it gets blurry. No matter how high or low I set in presets. Why? Help!!


Why did Eukaryotes evolve to have linear DNA and not circular like Prokaryotes? What are the pros and/or cons?


Having y-axis in log scale base 2 using pgfplots

I have made a chart using pgfplots as written below and I want to have the y-axis in logarithmic scale. This code works fine but the base of the logarithm is 10. How can I change it to base 2?  \begin{tikzpicture}     \begin{axis}[         height=0.5\textwidth,         width=\textwidth,         xlabel=LabelX,         xtick={1,...,10},         ylabel=LabelY,         ymode=log,     ]         \addplot[mark=*,blue] table[x=V,y=R] {data1.data};         \addplot[mark=x,red] table[x=V,y=E] {data2.data};     \end{axis} \end{tikzpicture}


Ubuntu 14.04 and Dell E6440 - sound and mouse working after suspend/resume

I've installed fresh Ubuntu 14.04 on Dell Lattitude E6440 and i've encountered two strange issues when doing full system start/restart: - mouse scroll when full restart is working very fast. One turn of the wheel cause very large change of value (window scroll, sound change etc.) But when i suspend and resume laptop it starts working correctly (one turn of the wheel and small change of value - the same as in previous versions of Ubuntu) - sound from speakers - the same issue. When full restart the sound does not come from internal laptop speakers. It works though through headphones. After suspend/resume internal speakers starts to work.  What can be a cause of these issues ?


is there a way to make Chrome Default Page Zoom Setting %80?

there are just %90, %75, and smaller values  %90 setting is too big and %75 setting is too small for me.  How can i set chrome default page zoom setting to %80?    edit:   chrome version : Version 31.0.1650.57 mac os x Version 10.9 screen resolution : 1920 x 1080


Windows 7 update stuck while downloading

In Short: On an Eee PC 1015, I am not able to update the newly installed Windows 7 system that came with that Netbook. Updates only worked in small increments, rebooting multiple times, and the SP1 does not download.  After getting a used Asus Eee PC 1015 PED (Windows 7 Starter, 250 GB harddisk), I did this F9 Recovery offered at the boot screen. This seems to overwrite the System partition with factory install. I would not exactly call this a fresh Win7 installation as ASUS did some modifications.   When I first connected the newly installed system and checked for updates, it said "Windows is up to date" - which is impossible. Is this suspicious? Have you ever heard of malware infecting the recovery system?   After rebooting, tens of updates were shown, but the download was stuck at "downloading .. 0 KB, 0% complete". After hours of waiting, I then shut the system dowd. The shutdown button actually promised to install updates before shutdown, and so it did.  This repeated about five times: Stuck while downloading, seems to have downloaded something, updates installed on reboot. Now all that is left is the "Windows 7 SP 1 (KB976932)" and 4 optional updates that I do not want either.   The best guess I can make is that the service pack takes very long - three hours, at least - to download (despite its size of allegedly 61 MB) and that the progress meter is broken. Where can I get more information about the downloading process? I am relatively new to Windows, but there have to be logfiles somewhere I guess?     I believe these are not culprits:   my connectivity. I can access the Web and have good bandwidth both with wired and wireless connection. I am on a reliable company network without restrictive firewall. ASUS Liveupdate. This wants me to install two bogus ASUS updates, I have not complied but can't believe they are necessary ("ASUSWebStorage" and "Vibe Fun Center")


Are there $a,b \in \mathbb{N}$ that ${(\sum_{k=1}^n k)}^a = \sum_{k=1}^n k^b $ beside $2,3$

We know that: $$\left(\sum_{k=1}^n k\right)^2 = \sum_{k=1}^n k^3 $$   My question is there other examples that satisfies:  $$\left(\sum_{k=1}^n k\right)^a = \sum_{k=1}^n k^b $$


Confusion about the regularity axiom, the specification axiom, and the existence of the universe

Some time ago I enrolled in a class called "Introduction to Real Analysis" in which we learned a lot about Set theory and it's axioms, I learned about the specification axiom, about Russell's paradox and (my favorite part) the nonexistence of the set of all sets. Later on discussing with friends they told me that this was nonsensical since the axiom of regularity (which I didn't knew) solves the Russell's paradox.  Reading in Wikipedia and in other materials about the axiom of regularity I couldn't understand why it is needed. It isn't clear to me how it is true and why we should 'believe' in it, Isn't the axiom of specification more than enough to define a set? Aren't the two getting in the way of each other?  And is my favorite proposition false?  The universe exists?


I am sick of correcting the alignment of the last two columns and its multirows  I want  21 dimensions reduced to 9 dimensions   comes exactly side by side to   Combine accuracy of 9 dimensional reduced  Feature Vector is 80\%   SIMILARLY  9 dimensions Further reduced to 7 dimensions   comes side by side to  Combine accuracy of 7 dimensional reduced     Feature Vector is 88\%   SIMILARLY same for the last "row"    \documentclass[journal]{IEEEtran} %\usepackage{array} % loaded twice \usepackage{multicol} \usepackage{graphicx} \usepackage{rotating}% added, for rothead \usepackage{array, makecell, multirow, tabu}%merged in one line %\newcolumntype{L}[1]{>{\raggedright\let\newline\\\arraybackslash\hspace{0pt}}m{#1}} % not used %\newcolumntype{C}[1]{>{\centering\let\newline\\\arraybackslash\hspace{0pt}}m{#1}} \newcolumntype{C}[1]{>{\centering\arraybackslash}m{#1}}% in this table is better use this definition \begin{document} \begin{table*}   \settowidth\rotheadsize{DIMENSIONS}   \renewcommand\multirowsetup{\centering}    \renewcommand{\arraystretch}{1.5}   \centering   \caption{Extreme Learning Machine(ELM) with kernel classifier accuracy of   combine reduced feature vectors whose individual classifier accuracy was low}   \begin{tabular}{|l|l|r|C{1.5cm}|C{1.5cm}|C{1.5cm}|C{2cm}|C{2.5cm}|}     \hline      Algorithm     & Dimension         &  \multirow{6}{*}{\rothead{ADD THESE\\ DIMENSIONS}}             & Total after Adding Dimensions                 & Classifier                     & Dimension Reduction Technique                         & Reduced Dimension                             & Accuracy  \\      \cline{1-2} \cline{4-8} LBP & 4D    &               & \multirow{5}{=}{4D + 6D + 4D\\ + 3D + 4D = 21D}                  & \multirow{5}{=}{ELM with RBF kernel}                      & \multirow{4}{=}{Eigenvalue as Dimension Estimator,                                           PCA as Dimension Reduction}                          & \multirow{4}{=}{21 dimensions reduced to 9  dimensions}                                        \newline                                & \multirow{4}{=}{Combine accuracy                                                  of 9 dimensional reduced                                                   Feature Vector is  80\%}\smallskip\newline \\     \cline{1-2} RGLBP  & 6D    &   &   &   &  &\multirow{5}{=}{9 dimensions Further                                                   reduced to 7 dimensions}                                             &\multirow{5}{=}{Combine accuracy                                                            of 7 dimensional  reduced                                                                Feature Vector is  88\% } \newline       \\     \cline{1-2} BDIP   & 4D    &   &   &   &   &\multirow{7}{=}{7 dimensions Further                                                   reduced to 6 dimensions}                                         &\multirow{7}{=}{Combine accuracy of 6                                                     dimensional reduced                                                     Feature Vector is 100\% }\newline   \\     \cline{1-2}  HOG      & 3D    &   &   &    &   &   &   \\     \cline{1-2}  Combine and     & 4D    &   &   &    &   &   &    \\  reduced fv of   &       &   &   &       &   &   &  \\  poor individual  &       &   &   &       &   &   & \\     accuracy algorithms   &       &   &   &       &   &   & \\       \hline \end{tabular} \label{table:table6} \end{table*} \end{document}


How do we prove that $$ \sum_{i=1}^{n}(x_i-\bar{x})^2\lt\sum_{i=1}^{n}(x_i-a)^2 $$  where $a$ is any value other than $\bar{x}$, the arithmetic mean.  My Attempt: $$ \sum_{i=1}^{n}(x_i^2-2x_i\bar{x}+\bar{x}^2)\lt\sum_{i=1}^{n}(x_i^2-2x_ia+a^2)\\\sum_{i=1}^{n}x_i^2-2\bar{x}\sum_{i=1}^{n}x_i+\sum_{i=1}^{n}\bar{x}^2\lt\sum_{i=1}^{n}x_i^2-2a\sum_{i=1}^{n}x_i+\sum_{i=1}^{n}a^2\\-2\bar{x}.n\bar{x}+n.\bar{x}^2\lt-2a.n\bar{x}+n.a^2\\-2\bar{x}^2+\bar{x}^2\lt-2a\bar{x}+a^2\\-\bar{x}^2\lt-2a\bar{x}+a^2 $$ But how do I proceed further or is there any better way ?


My institution which I'm responsible to obey their writing rules for my PhD dissertation does not have any LaTeX templates and they insist on their weird MS Word template. They do not accept the text I've written with LaTeX. Even though i have tried to imitate the Word template which they provided and i have achieved desired properties in  most of the text a fair amount of issue still remains. One big issue for me is; they want me to put a specific little title on the page number column of table of contents. Do you have any idea how to achieve this?


javafx - how to connect fx-controller and service class

I am working on personal application and trying to use javaFX. Actually I am stuck on connecting a controller and a service. the idea is to seperate the code to get a better architecture. I've searched many information but I couldn't find the right answer in my case. If someone has an idea, I'd appreciate.  Controller  public class SettingsController extends AbstractController implements Initializable {  private final static Logger logger = LoggerFactory.getLogger(SettingsController.class);  @FXML public TextField logFilepath;   @FXML public TextField outputFilepath;  @FXML private Button saveSettings;  /**  */ @Override public void initialize(URL url, ResourceBundle rb) {     logger.debug("initialize");      //do something }  /**  */ public void save() {     logger.debug("save");      final String logPath = logFilepath.getText();     final String outputPath = outputFilepath.getText();      System.out.println(logPath);      settingService.save(logPath, outputPath);      Stage stage = (Stage) saveSettings.getScene().getWindow();     stage.close();       }   settingService Interface  public interface SettingService {  /**  */ void save(final String logPath, final String outputPath);   }  settingServiceImpl  public class SettingServiceImpl implements SettingService {  /**  */ private static final Logger logger = LoggerFactory.getLogger(SettingServiceImpl.class);  /**  */ public SettingServiceImpl() {     super(); }  @Override public void save(final String logPath, final String outputPath) {     logger.debug("save");      final Properties prop = new Properties();     OutputStream output = null;      try {         output = new FileOutputStream("settings.properties");         prop.setProperty("log_directory", logPath);         prop.setProperty("output_directory", outputPath);         prop.store(output, null);      } catch (IOException io) {         io.getMessage();      } finally {         if(output != null) {             try {                 output.close();             } catch (IOException iot) {                 iot.getMessage();             }         }     } }   }  AbstractController   public abstract class AbstractController {  /**  */ protected SettingService settingService;  public AbstractController() {     super(); }   }  When I run my application, It works until I am calling the method save from my controller -> I am always getting the same error as NPE   Caused by: java.lang.NullPointerException at com.analyzer.controller.SettingsController.save(SettingsController.java:139)   If I remove the save method's parameter -> settingService.save(str, str) - and replace variables LogPath and outputPath by simple Strings, it works .. So it seems like I don't have the right to calling methods with parameters inside a controller handler.   worth ! I wanted to make a bit complex by declare a ServiceOut class which could help me to construct my In and Out services but it's the same :(


Proving that $e^{f(z)} $ is holomorphic if $ f(z) $ is holomorphic

Suppose that $f(z)$ is holomorphic, such that $e^{f(z)} $ is a constant. I want to show that $f(z)$ also has to be a constant. I have solved the problem by assuming that $h(z) = e^{f(z)} $ also is holomorphic. How can i prove that $ h(z) $ is holomorphic?


Word to describe relationship between "infinitesimal" and "infinite"?

Would infinitesimal and infinite just be antonyms of each other?


I have a 146GB HDD in one of my servers that I want to replace with a 120GB SSD. Can I just clone the drive with dd and have it boot just fine?  Are there any repurcussions to cloning to a smaller drive?  (The drive is nowhere near full so there shouldn't be much at the end of the disk). The server itself only had whatever partitions Proxmox sets up when it installs.


Finding the primary key table name in SQL server

I have an issue with composite primary keys. Having the name of a table, I need to know which columns are foreign keys and I need to know the names of the tables they relate to.  Now this would be easy if it weren't for the fact that the related table have a composite primary key.  sample:  Table Fruits [pk] FruitId [pk] OwnerId      Name   Table Desserts [pk] DessertId      Name [fk] FruitId [fk] OwnerId   Given the above, I need to query sql "Give me a list of columns in table Desserts that have a fk relationship and tell me the name of the table and column it relates to.  Thanks for any help provided!


New login & signup pathway for the Stack Exchange network

We will be rolling out a new, fully re-factored and redesigned login & signup pathway on Meta tomorrow morning, just missing  back in October.    As many of you are aware, our current design has been around for years.  To keep everything secure, we had to use iframes and redirect users to openID.stackexchange.com during parts of our sign-up process.  We've known for quite a while where we wanted to take the design, but we were  to make it work.  What you'll find in the new version:   End to end SSL A simplified design placing the services that 95% of our users need front and center ( Don't worry, all of the old services are still there.  Except MyOpenID. It's still dead.) No more redirects to openID.stackexchange.com for email verification or account recovery Shorter, and separate, pathways for signup and login that don't use iframes.   We hope this new design will be easier and less confusing for new users and quicker for existing users.  Since this is a full refactor, it's likely we've missed some edge cases during internal testing. We would be very appreciative if you guys could kick the tires a little and let us know if something doesn't look right.  Please post requests and bug reports in this thread until we rollout network wide.    The new login and signup pages have now been rolled out on Meta - do your worst!


How to tell the number of Application Domains created in a .Net application?

I have a .Net (C#) process and I want to be able to tell the number of AppDomains that have been created.  How can I do this?


Calculating the force required to lift a weight with a screw

I am trying to learn physics by myself as I do not have a good teacher at school. I've been reading Feynman Lectures on Physics and I can't figure out how he found  out this number. Here is an excerpt of :      Let us now illustrate the energy principle with a more complicated problem, the screw jack shown in Fig. 4–5. A handle $20$ inches long is used to turn the screw, which has $10$ threads to the inch. We would like to know how much force would be needed at the handle to lift one ton ($2000$ pounds). If we want to lift the ton one inch, say, then we must turn the handle around ten times. When it goes around once it goes approximately $126$ inches. The handle must thus travel $1260$ inches, and if we used various pulleys, etc., we would be lifting our one ton with an unknown smaller weight $W$ applied to the end of the handle. So we find out that W is about $1.6$ pounds. This is a result of the conservation of energy.       If you divide $2000$ pounds by  $1260$ in you get $\frac{100}{63}$, which is $1.58$, a number close enough to $1.6$ pounds, which according to Feynman is the weight that we need to apply to the end of the handle. I believe, however, that this calculation is wrong given a dimensional analysis of such operation.  Here is my dimensional analysis:  $\frac{2000 pounds * 1 in}{ 1260 inches }$ = $\frac{[M] * [L] }{[L]}$ = ${[M]}$ And this is wrong, as we are suppose to get a force, not a mass.  I found this , where you can find what I think is an email from an student reporting the teacher that he believes he got the number diving  $\frac{5}{\pi}$ . Can you also explain me this?   Finally, in a thread in a Physics Forum question,they concluded that $1.6$ is just the force to keep the system at equilibrium, and you need $\text{a force} > 1.6$ to actually lift the ton. After, someone said that Feynman would have said this answer is wrong. Why is that?


Can a wand be crafted so that its spell is affected by special abilities?

A level 10 creator can use the feat  to create a wand of  modified by the metamagic feats  and . Normally, the price of such a wand is 30,000 gp ([1 (spell level) +3 (metamagic adjustments to spell level)] ×10 (caster level) ×750 gp).  However, if the creator has the trait  (snowball), can the creator make a nearly identical wand except at a total adjusted spell level of 3 instead of 4 yet that has the same effect?  And if the creator possesses the supernatural ability  (or another ability that allows the creator to change one energy type to another), can that creator create a wand of snowball that's, instead, a wand of fire snowball that deals fire damage?


Is there a firewall for Ubuntu 14.04.1 that asks for every program that wants to   enter or exit?


Earliest possible date for a folder / file attribute?

Just for some context, so people understand why I'm doing what I'm doing...  My movie collection is stored in this fashion;  Movies (folder)  |---- Movie title, Year released (folder)        |---- Movie title (file)   This means all my movies are stored in alphabetical order, which is (usually) great, as I generally know what I want to watch and can just search for (or scroll to) it.  However, as a requirement for another project, I downloaded . This app - unsurprisingly - allows you to change the attributes of files and folders.   To give me some more options for movie storage and sorting, I have been working my way through my films, and editing the Date Modified and Date Created attributes to the release date of the film. This gives me the option to sort by release date, so if I decide I want to watch a new film, but don't necessarily have a film in mind, I can easily sort by newest releases.  Now, actually onto my question - what is the earliest date that a file / folder could have as its created / modified date? I just tried to set a films date to , but Windows explorer is now showing the Date Modified as blank. If I open the folder properties (right click > Properties) then it shows the correct date, it just seems to be explorer which doesn't like it.  EDIT: I thought it might be something to do with , however I have tried dates after 1970 and I'm still getting a blank space in Windows explorer.


Simple binomial theorem proof: $\sum_{j=0}^{k} \binom{a+j}j = \binom{a+k+1}k$

I am trying to prove this binomial statement:     For $a \in \mathbb{C}$ and $k \in \mathbb{N_0}$, $\sum_{j=0}^{k} {a+j \choose j} = {a+k+1 \choose k}.$    I am stuck where and how to start. My steps are these:   ${a+j \choose j} = \frac{(a+j)!}{j!(a+j-j)!} = \frac{(a+j)!}{j!a!}$ but now I dont know how to go further to show the equality.  Or I said:   $\sum_{j=0}^{k} {a+j \choose j} = {a+k \choose k} +\sum_{j=0}^{k-1} {a+j \choose j} = [help!] = {a+k+1 \choose k}$  Thanks for help!


I was studying  and this is the code .   U1 = np.random.rand(*H1.shape) < p # first dropout mask   Why does it fail when I try to do this?  import numpy numpy.random.rand(*1) < 2    I understand that the rand() function takes in a number which is why I am confused that the code is supposed to work.


While hunting down some wrong-flipped faces I find it a bit tedious to differentiate the color of the wrong-sided face with the right-sided face.  It would be very handy if the wrong-sided faces would have the color red. How can I use a trick for that?


I'm studying abelian varieties from Milne's book, but I'm having difficulty juggling different conventions and definitions of basic concepts, like those of algebraic and projective varieties. First, let me write some terminology the way I understand it.   Classically, an affine $k$-variety is a Zariski closed (zero set of some family of polynomial), irreducible subset of $k^n$ where $k$ is any field, and an affine algebraic set is just any Zariski closed subset. A projective $k$-variety is a Zariski closed (zero set of some family of homogeneous polynomials) subset of $\mathbb P^n$.   The definition of an algebraic ($k$-)variety is somewhat more delicate. According to Milne's Algebraic Geometry notes, an affine $k$-variety is any locally ringed space isomorphic to some $(V,\mathcal{O}_V)$ where $V$ is affine algebraic and $\mathcal{O}_V(U)$ is the set of regular functions on $U$ (rational functions with a denominator that doesn't vanish on $U$). First question: how is this definition of an affine $k$-variety related to the one above?   Next, Milne defines an algebraic prevariety over $k$ as a locally ringed space admitting a finite open cover of affine $k$-varieties, and then an algebraic $k$-variety is a separated algebraic prevariety over $k$. What confuses me with this definition is that I don't recognize a scheme structure on Milne's definition of a variety. My second question is, is it true that the affine $k$-varieties $(V,\mathcal{O}_V)$ are affine (k-)schemes. In particular, to what ring $R$ is $(V,\mathcal{O}_V)$ isomorphic to $\operatorname{Spec} R$?  Finally, Qing Liu's definition of an algebraic $k$-variety is as follows. An affine $k$-variety is "the affine scheme associated to a finitely generated (reduced) $k$-aglebra". Which affine scheme is this? Is it simply $\operatorname{Spec} k[T_1,\dots,T_n]/I$ with $I$ radical? How does one make this association precise? Finally, Liu's algebraic $k$-variety is a $k$-scheme admitting an finite cover of affine $k$-varieties.   I suppose the ultimate question is this. What is the relationship between affine algebraic sets in $k^n$, sheaves of reduced, finitely-generated $k$-algebras, and the scheme $\operatorname{Spec}k[T_1,\dots,T_n]/I$ where $I$ is a radical ideal, and what does it mean for a variety to be affine or projective in these contexts?


Proving that $\mathscr L=\{0^n \big|\text{n is the square of a natural number }\}$ is non regular using the pumping lemma

I need to prove that the language $\mathscr L=\{0^n \big|\text{n is the square of a natural number}\}$ is non regular using the pumping lemma   My try:  $\mathscr L=\{\overbrace{\epsilon}^{0^2},\overbrace{0}^{1^2},\overbrace{0000}^{2^2},\overbrace{000000000}^{3^2},\overbrace{0000000000000000}^{4^2},\dots\}$  Suppose that $\mathscr L$ is regular so $\exists$ a word '$x$' with length of at least $n$   $|x|\geq n $ such that  $(1)\,\,\,|uv|\leq n$  $(2)\,\,\,|v|\geq 1$  $(3)\,\,\,uv^iw \in \mathscr L$  Now, let as choose the word $\color{blue}{x=0^{n^2}}$  $|x|\geq n$ so we can use $(1)-(3)$  $x=\underbrace{000000\dots}_{n^2\text{ times}}$  $x=uv0^kw=\underbrace{uv0^k}_{\text{n zeros   }}\overbrace{w}^{n^2-n\text{ zeros }}$  Let as choose $\color{blue}{i=??}$      I'm difficult choosing the word '$\color{blue}x$' and choosing  $\color{blue}i$ to come to contradiction with the lemma