I'm trying to make a combination of two videos. The first video is my input unaltered while the second one (placed below the first) is a filtered version of the first video. I'm able to filter the first video as I want but I've got difficulties in making an output of the two versions combined as I'd like to.  Even following this other question does not help me:    Here is the command that I'm using:  ffmpeg -i ./media/video/video_with_alpha.mov \ -c:v libx264 -b:v 400k -tune zerolatency -profile:v baseline -level 3.0 -movflags +faststart -c:a libfdk_aac -b:a 64k \ -filter_complex \     "[0:v] fifo, lutrgb=r=maxval:g=maxval:b=maxval [T1]; \      [0:v] format=rgba, fifo, lutrgb=r=minval:g=minval:b=minval [T2]; \      [T2][T1] overlay [out_alpha]; \      [0:v][out_alpha] overlay=0:360[out]" \ -map '[out]' -map 0:a ./media/output/video_rgb_above_alfa.mp4   The result I get is the two videos overlapped one to the other like this:   While what I want is like this:   Does any of you know what I'm doing wrong?  Thank you in advance!

I need scale up video from one DOS game using . But with  on left side and  filter on the other one.  Input (320x200)    Output (1280x800)    Here is a command, where's xBR processing whole screen...  ffmpeg     -i input.avi     -sws_flags neighbor     -vcodec libx264 -strict -2     -preset veryslow -qp 0     -filter:v "xbr=4"     output.mp4


I always see toast notice! Code `if-ge v1, v3, :cond_29 invoke-virtual {p0, v1}, Landroidx/collection/ArraySet;->valueAt(I)Ljava/lang/Object; move-result-object v3 invoke-interface {p1, v3}, Ljava/util/Set;->contains(Ljava/lang/Object;)Z move-result v3 :try_end_23 .catch Ljava/lang/NullPointerException; {:try_start_17 .. :try_end_23} :catch_2a .catch Ljava/lang/ClassCastException; {:try_start_17 .. :try_end_23} :catch_2a if-nez v3, :cond_26 return v2 ` Code 2 '   .catchall {:try_start_52  :try_end_53} :catchall_51 throw p1 :cond_54 new-instance p1, Ljava/lang/NullPointerException; const-string v0, "key == null" invoke-direct {p1, v0}, Ljava/lang/NullPointerException;->(Ljava/lang/String;)V throw p1 .end metho'

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I am trying to get something vibrant but realistic for some gentle flowing water like if you were pouring it out of a glass on a table. this is what I got so far but it looks more like paint.

I'm creating a scene with large amounts of water that will be readily visible, containing refraction and at various angles. The scene is an indoor long-course swimming pool, about 50 meters, all of which would be seen by a camera above 5 meters above the water's surface. This is being fluid-sim'd, but there are no quickly-moving objects or people, so any water movement is slower and in bulk. The "remove bubbles" option is enabled.  I've tried using a Mix Shader of Refraction BSDF and Reflection BSDF with the factor coming from a Fresnel node, but the results appear either too glossy or too transparent and overly colored. How can I make the water appear realistic? Changes to shaders (refraction to glass)? Or is tweaking colors sufficient?


I'm trying to install Ubuntu 12.10 in VMWare Player 5. My pc is running Windows 7.   The installation seems to go okay, but when I boot up ubuntu, although it starts up and I see the desktop, I can't see any task bar or basically anything other than the default wallpaper in the background.   When I move my cursor across the screen towards the edges, the desktop flickers and extremely distorted and pixelated objects appear momentarily.  I've tried uninstalling everything, downloading it all again and reinstalling, but I get the exact same problem.  Does anyone recognise this issue? Is there a more stable pairing than Ubuntu 12.10 & WMWare Player 5.0.1, perhaps?

I'm using Windows 7 as the host machine with VMWare Workstation 9. I created a virtual machine Ubuntu Desktop 12.04 LTS 64 bit version. There are two options for log in, Ubuntu and Ubuntu 2D. Whenever I log in to Ubuntu, the task bar will not show up, is like having a black margin all around the desktop background and only the center is visible.  I wish I could attached a pic, but I need at least 10 reputation.  When I move my mouse over the left side of the desktop I can see that something is there but it is shown only as a black square. I tried deleting the virtual machine I created for Ubuntu and re-installed it, but it keeps appearing like that.  When I switched to log in with the Ubuntu 2D version everything worked alright. I could see the task bar, the icons, the clock etc. What might be causing this problem?


I have a laptop with a 64-bit processor, but by accident i installed the 32-bit version of Ubuntu 14.04. i can always back my data up, and re-install Ubuntu, but i want to know if using 32-bit will be slower on a 64-bit processor, than a 64-bit OS on a 64-bit processor. thanks guys

What is the difference between 32-bit and 64-bit Ubuntu? I've heard the 64-bit platform performs better and can detect more than 4GB of RAM. Also, while some apps haven't ported to 64-bit yet, ia32-libs lets a 64-bit machine run them.  If so, why not promote 64-bit over 32-bit?


Why is the total energy of an electron in an atom negative?  We know that $$E = -\frac{e^2}{8\pi\epsilon_0a_0}.$$ What does the negative sign in the above equation means?

The higher the number of the shell (n), the higher is the energy level of the electron. However, why was it necessary to have negative values. So for example, when $n=1$, the energy could be $5 eV$ and for $n=2$, $6 eV$... having positive values could also have supported the idea that as $n$ increases, energy of electron increases. What is the point of having negative numbers, does it somehow aid calculations?


Am getting this error "an error occurred submitting the answer" in stackoverflow  Even here i couldn't add the code its showing the same error message!!

OK, I've been having weird problems for the last 1/2 hour trying to  on StackOverflow, and I keep getting this result (on Firefox 3.6)     The connection was reset      The connection to the server was reset while the page was loading.         The site could be temporarily unavailable or too busy. Try again in a few        moments.   If you are unable to load any pages, check your computer's network        connection.   If your computer or network is protected by a firewall or proxy, make sure        that Firefox is permitted to access the Web.      The problem seems to occur when I try to post some code with 'd--- table' in it, where 'd---' is replaced by the word drop.  I cannot post the following 3 lines, in either SO or this site, if they include the well-known SQL statements DROP.  stat.executeUpdate('d--- table if exists people;'); stat.executeUpdate('create table people (name, occupation);'); prep = conn.prepareStatement(...     'insert into people values (?, ?);');   test again:  'dro* table' 'drop ball' drop the table drop fable drop    t*ble droptable   drop a table  The evil words for me are "drop" and "table"... how come you guys can post? :(  edit: Could someone please suggest another online site that is not stackoverflow that is a quick way to try out a POST request of a text field?  UPDATE: Never mind. I don't know what the answer is, but the same problem occurs on Google's website. So it's not stackoverflow. Now to go to my IT Dept...


Whenever I try to install the eBay app from the play store I get a -24 error code: "unknown error when installing application". I have googled the error and I cannot find anything relating to this. Anyone know what this error is and how to fix it?  I can install other apps. I have an S4 on Kit Kat (4.4.2). I have forced stopped the play store and cleared the data on play services and play store.

I have Android 4.1.2 on Samsung galaxy S2  I install an app and get this error:  unknown error during appliaction install -24  googling this line should clearing Google play cache might help  but it didn't work for me. Any other solution?


I try to automatically zoom map to maximum extent of layer after adding layer to map. I tried to code like this.  var layer = OpenLayers.Layer.WMS(.......);  map.addLayer(layer);  map.zoomToExtent(layer.getDataExtent());   But it doesnt' work. I also changed like this  map.zoomToExtent(layer.getMaxExtent());   It still doesn't work. What can I do to solve this issue.

I have added WMS layers using follow:  basemap = new OpenLayers.Layer.WMS( "Layer Name1", "http://localhost:8080/geoserver/wms/workspacename", {layers: 'workspacename:layername'} );   utility = new OpenLayers.Layer.WMS( "Layer Name2", "http://localhost:8080/geoserver/wms/workspacename", {layers: 'workspacename:layername', transparent:"true"}, {isBaseLayer:false} );   Now I want to get zoom to my utility layer, How can I?  I have tried as following:  map.zoomToExtent(utility.getDataExtent());


I have some unwelcome behavior on my Samsung S4 AOS 5.0.1 (unrooted) phone. A few days ago I start to get attempts to open my web pages (up to 3 times a day so far) while my phone is idle. All cases have been bit.ly links for example:  http://bit.ly/2KG1tdA+ -- http://www.gohoi.com/jaguar-xj/ http://bit.ly/30muksQ+ -- http://www.gohoi.com/lincoln-mkz/ http://bit.ly/2nVdS4m+ -- https://t.co/leK1JpzypD http://bit.ly/34WUUeL+ -- https://fb.itfactly.com/?url=https://l.facebook.com/l.php?u....   As I have no default browser I was able to capture URL and add "+" to end so I can get the detination URL on bitl.ly stats page as shown above in 2nd column. The first link went to at least 0.5 Million devices so somebody out there must have run into this phone abuse.  Is there anyway to trace what process is triggering the open web request (eg using logs, trace tools etc), so I can uninstall the app or disable it if it is builtin. Could it be "Peel remote".

There are lots of discussion on how to see which app is requesting network connection. I have tried the following apps:  tcapturepacket wifi monitor connection tracker   However, none of them was useful. For example, for a short period of time, I uploaded a 30KB pcap file which can be viewed . Still I haven't find out which app is requesting connection and to where it is trying to connect.  I also tried to look at adb logcat, but didn't find useful information. Maybe something has been missed here. Any guess?


An inverted conical water tank with a height of $20m$ and radius of $5m$ is drained through the hole in the vertex at a rate of $2m^3 /h$. What is the rate of change of the water depth when the water is $4m$ deep?

I have been working on this problem for about 2 hours and I can't seem to get it, here is exactly what the question reads. "Water is poured into the top of a conical tank at the constant rate of 1 cubic inch per second and flows out of an opening at the3 bottom at a rate of .5 cubic inches per second. The tank has a height of 4 inches, and a radius of 2 inches at the top. How fast is the water level changing when the water is 2 inches high?"


May I know which sentence is grammatical?     Given n services in sequential composition, where each of them having   l candidates, the total number of combination is l^n.      Given n services in sequential composition, where each of them having   l candidates, the total number of combination are l^n.      Given n services in sequential composition, where each of them having   l candidates, the total number of combinations is l^n.      Given n services in sequential composition, where each of them having   l candidates, the total number of combinations are l^n.

This hurts my eyes to read it and my ears to say it, but the writer stands by          About the same number of people was awarded bachelor's degrees in 2010 as filed for personal bankruptcy (1.6 million).   Is the subject in this sentence singular or plural?


If I understand correctly, AC is not needed in the case of a finite union of countable sets because the choice function can be built with recursion, using the case of 2 sets (which is straight-forward). However, why is AC needed in the case of $\omega$ countable sets (or $\alpha$  infinite (well-ordered) sets, for $\omega\leq\alpha\in\text{Ord}$)? If we take the choice function $G$ to be $\bigcup_{n<\omega}G_n$, where $G_n$ is the choice function for the case of $n$-sets union, such that $\forall m<n \;\; G_m\subseteq G_n$, then $G$ will also be a function and a choice function. Where's my mistake/where do I implicitly use AC? Thanks

Let ${{E_n}}_{n\in \mathbb{N}}$ be a sequence such that every $E_n$ is countable.  Let $g_n : \mathbb{N} \to E_n$ be a bijection for every $n\in \mathbb{N}$.  Let $\alpha (n,k) = g_n(k)$  Let $A$ be the union of $E_n$'s.  Then $\alpha : \mathbb{N} × \mathbb{N} \to A$ is a surjective function.  Since $\mathbb{N} \times \mathbb{N}$ is equipotent with $\mathbb{N}$, there exists a surjective function $f: \mathbb{N}\to A$.  Let $[n]$={$m\in \mathbb{N}$|$f(m)=f(n)$} for every $n\in \mathbb{N}$.  Since $f$ is surjective, for every $n\in \mathbb{N}$, $[n]\ne \emptyset$.  Since $[n] \subset \mathbb{N}$, $[n]$ is well-ordered.  Let $l_n$ designate the least element of $[n]$.  Let $B=\{l_n \in \mathbb{N} | n\in \mathbb{N}\}$  Then $f_{[B]}$ : $B\to A$ is a bijection.  Since $B\subset \mathbb{N}$, $B$ is at most countable. Since $A$ is infinite, $B$ is countable, hence $A$ is countable.  I don't know where i used AC in my argument. Help


I need to store different types of objects in a single container. All the objects that go in the container will have a void continueExecution() function with the same purpose, but the implementation is totally different. I found this question to be very helpful . I tried to implement the answer, but c++ is crushing me. Can you please suggest how to call the derived functions rather than the base functions after getting the object from std::vector? I was really hoping that any calls to base.continueExecution() would call derived.continueExecution(). please see below: Base class: - I created a base class strictly to make all my classes with the same function name be the same type. I will never create an object out of this class. The base class header file: class DelayCommandBase {     public:         DelayCommandBase();         void continueExecution(); };  The cpp file for the base class is just a print statement, and if it’s running that is bad for me (and it is running): void DelayCommandBase::continueExecution()  {     Serial.println("DelayCommandBase continueExecution function... why is c++ so hard?!"); }  Derived class - I have a bunch of these types of files, lets stick to tst.h with a TST class. : class TST : public DelayCommandBase {     // …code...     public:     void continueExecution();     //…code... };  The derived class .cpp file is implementing the continueExecution() and a bunch of other functions. I don't think the issue is there. A third class - this is what manages many objects that are constructed  using the derived classes. In the header file I am creating a vector of base type. I think this is how I can store all the derived classes in a single container (assuming I don't use boost, which I don't want to use). Header file: private:     std::vector<DelayCommandBase> midFlightCommandObjects;  In the .cpp file (all in a single function) an object is created from a derived class, is started via a function call, and is stored: int hardwarePin = 13; int delay = 1000; TST tstCommandObj(hardwarePin, delay); //a working object... Yay  //the object is executed, and all is so happy so far: tstCommandObj.start();  //Then I store it in the vector of base type: if(tstCommandObj.commandIsFinished() == false) {                midFlightCommandObjects.push_back(tstCommandObj);     Serial.println("TST object saved"); }  So far no issues. Now in a different function, in the same manager class I try the following: midFlightCommandObjects.at(i).continueExecution();  and the function in the base class runs, not the derived class with the implementation. I tried making the function virtual, but that didn’t fly. I tried using → instead of . but that gave errors that bend my mind. I tried passing the derived class as a pointer to the base class object and that didn't do anything different. I am not a programmer, and c++ is crushing my belief that I am a competent human. What do I need to do to call the derived class instead of the based class once I pull the objects out of the container?

Someone mentioned it in the IRC as the slicing problem.


I am trying to find a solid definition for what a Poincaré map is and how they are used but the ones online are very complicated. Can someone explain with a simpler definition of what a Poincaré map is, and provide an example of a chaotic system in which a Poincaré map can be used?

What are  and how to understand them?   Wikipedia says:      In mathematics, particularly in dynamical systems, a first recurrence   map or Poincaré map, named after Henri Poincaré, is the intersection   of a periodic orbit in the state space of a continuous dynamical   system with a certain lower-dimensional subspace, called the Poincaré   section, transversal to the flow of the system.   But I fail to understand any part of the above definition...  Examples of Poincaré maps:  The angular momentum and the angle $\theta$ of a , in a poincaré map is described as:    If I'm not mistaken the closed lines are called Tori, but how this interpret this map?   Another example:  : the poincaré map is:    Where $p$ and $q$ are the globalized coordinates for momentum and position. Again   How to interpret this? (Please lean towards a physical explanation when answering.)


writes:     Most econometrics textbooks limit themselves to providing the formula for the $\beta$ vector of the type      $$\beta = (X′X)^{-1} X'Y.$$      Although compact and easy to remember, this formulation is a sort black box, since it hardly reveals anything about what really happens during the estimation of a multivariate OLS model. Furthermore, the link between the $$\beta$$ and the moments of the data distribution disappear buried in the intricacies of matrix algebra. Luckily, an enlightening interpretation of the $$\beta$$s in the multivariate case exists and has relevant interpreting power. It was originally formulated more than seventy years ago by Frisch and Waugh (1933), revived by Lovell (1963), and recently brought to a new life by Angrist and Pischke (2009) under the catchy phrase regression anatomy. According to this result, given a model with K independent variables, the coefficient $\beta$ for the k-th variable can be written as       $$ \beta_k = \frac{cov(y,\tilde{x}_k)}{var(\tilde x)}$$      where $\tilde x_k$ is the residual obtained by regressing $x_k$ on all remaining $K − 1$ independent variables.      The result is striking since it establishes the possibility of breaking a multivariate model with K independent variables into $K$ bivariate models and also sheds light into the machinery of multivariate OLS. This property of OLS does not depend on the  underlying Data Generating Process or on its causal interpretation: it is a mechanical  property of the estimator which holds because of the algebra behind it.   Judd et al. (2017) have a  of this too, pp.107-116.  I'm not sure how you would break a multivariate model with $K$ independent variables into $K$ bivariate models, it seems like you would need more. For example with three independent variables and a constant ($K=4$), I worked out you need 5 base-level regressions (if you don't count the redundant ones in light blue) and 11 regressions of residuals on residuals. Am I missing something?

Not sure if normalize is the correct word to use here, but I will try my best to illustrate what I am trying to ask. The estimator used here is least squares.  Suppose you have $y=\beta_0+\beta_1x_1$, you can center it around the mean by $y=\beta_0'+\beta_1x_1'$ where $\beta_0'=\beta_0+\beta_1\bar x_1$ and $x_1'=x-\bar x$, so that $\beta_0'$ no longer has any influence on estimating $\beta_1$.  By this I mean $\hat\beta_1$ in $y=\beta_1x_1'$ is equivalent to $\hat\beta_1$ in $y=\beta_0+\beta_1x_1$. We have reduced equation for easier least square calculation.  How do you apply this method in general? Now I have the model $y=\beta_1e^{x_1t}+\beta_2e^{x_2t}$, I am trying to reduce it to $y=\beta_1x'$.


I drew a histogram of my data:  Totalclaims<-replicate(Number,simulateclaims()) v<-sort(Totalclaims) hist(v, main = "Distribution of total claims", xlab = "simulated number of claims in next 12 months", ylab = "Frequency", breaks = seq(6050,6650,l=100))   and when I tried to add the density curve:  lines(density(v), col = "black", lwd = 2)   the result is a line on the axis, does anyone know why?

Basically, I'm just trying to plot a curve over my histogram for the weight of a few students.   lines(density(weight), lwd = 2, col = "red")   However, what I get is a line on the bottom of the graph. I suppose the density has to be such that the integral of the curve is 1. What command should I be using instead of density, if I want to have a fitting curve for the histogram?


In C programming if i will declare a structure with private fields and some public methods, will it behave as a class?

This question was .  Now I'd like to learn the differences between a struct and a class in C++. Please discuss the technical differences as well as reasons for choosing one or the other in OO design.  I'll start with an obvious difference:   If you don't specify public: or private:, members of a struct are public by default; members of a class are private by default.   I'm sure there are other differences to be found in the obscure corners of the C++ specification.


Please help me: I added this repositories manually and i cant remove them  echo 'deb http://download.opensuse.org/repositories/home:/Horst3180/Debian_8.0/ /' > /etc/apt/sources.list.d/vertex-theme.list  wget http://download.opensuse.org/repositories/home:Horst3180/Debian_8.0/Release.key   I tried to use removing the key using apt-key list and then removing using the id, it successfully removed the key but when i use apt update i get this output:  W: GPG error: http://download.opensuse.org/repositories/home:/Horst3180/Debian_8.0  Release: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 5A7D1D38BEB6D886 E: The repository 'http://download.opensuse.org/repositories/home:/Horst3180/Debian_8.0  Release' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   I just want to be able to run apt update normally like when a fresh OS install was made

I've added many PPAs using the add-apt-repository command. Is there a simple way to remove these PPAs? I've checked in /etc/apt/sources.list for the appropriate deb lines but they aren't there.   This is on a server system so a command line solution would be great!


Im confused looking for an older version of Ubuntu, i know that you can download it using bittorrents but is there any other way, just by desktop downloading. I just want desktop ubuntu 16.04 version. not the latest one.

I am unable to find the link for downloading Ubuntu 16.04 onto my   desktop/laptop. I am able to see the link only for 18.04, but I need 16.04.


There does not exist a polynomial $p(x)$ with integer coefficients which gives a prime number $\forall x\in \mathbb{Z}$    My attempt:    I defined a polynomial as $p(x)=a_0(x-a_1)(x-a_2)\ldots(x-a_n)$. So, whenever $x$ takes an integer value, the polynomial cannot generate a prime number unless the polynomial is a linear one. But I have serious doubts about this solution, suppose any factor is of the form $(x^2+x+1)$ which cannot be factorised into linear factors with integer coefficients. Please help. Thank you.

I recently encountered this following proposition:  For every polynomial, there is some positive integer for which it is composite.  What is the most elementary proof of this?


Since it is an exercise from an oral exam, I have added some indications I had.  $f : \mathbb R \to \mathbb R$, such that $f^2$ and $f^3$ are $C^{\infty}$, show that $f$ is $C^{\infty}$.  The two isolated hypothesis are not sufficient, since there is a problem in zero for the cube root, and since you can take $f$ that takes $1$ and $-1$ without regularity but its square will be constant.  How to proceed with the two hypothesis?    Here, the indications I have from the candidate who has taken the oral exam:  -First, show that $f$ is $C^1$: Suppose $f(0) = 0$ (it is exactly the problem, and by translation we consider that it is in $0$). Suppose they exist and use the Taylor expansions of $f^2$ and $f^3$ up to a non-zero order. Find a polynomial link between both coefficients using equivalents. If they do not exist, $f^2 =o(h^4)$ so $f$ is $C^1$ in $0$ (?).  -Use the general Taylor expansion (with integral remain) for $f^3$.  Suppose the coefficients are not all zeros, (change the bounds to $0$ and $1$), show that the parameter integral is $C^{\infty}$, then take the cube root (??).

Let $f: \mathbb{R} \to \mathbb{R}$ be given. Assume that the square and cube of $f$ are smooth. Is $f$ smooth? That is if $f \cdot f \in C^{\infty}$ and $f \cdot f \cdot f \in C^{\infty}$, does it follow that: $f \in C^{\infty}$   I got this from another question on SE.   So, $f(x)^2$ is infinitely differentiable, and so is: $f(x)^3$   Also, realize:  $$f(x) = \frac{f(x)^3}{f(x)^2}$$  But what can I do?


I’m a citizen of Ghana, and I will be landing at Dubai International Airport, where I will need to switch airlines. Do I have to get a transit visa?

Do I need a transit visa for a layover via airports in the UAE, such as Dubai International Airport or Abu Dhabi International Airport? If so, what are the requirements for such a visa? Can I get the transit visa on arrival?


Convert Hex to Decimal  Example:  It would ask a Hex. Shown below.  Enter Hex: 8000 8000 1000 0100  Then,  The Result: 32768 32768 4096 256  Convert each hex to decimal.  HEX  = DECIMAL  8000 = 32768  8000 = 32768  1000 = 4096  0100 = 256

How do you convert between hexadecimal numbers and decimal numbers in C#?


The Windows 10 Start Menu is doing some odd things. Autodesk programs will place shortcuts in a program specific folder in the Autodesk folder, for example C:\ProgramData\Microsoft\Windows\Start Menu\Programs\Autodesk\Revit 2018  However, the Start menu basically ignores that last folder and lists all links under Autodesk in the start menu. Given that most Autodesk programs have anywhere from 3 to 5 or 6 links, and AEC first often have 4-5 Autodesk programs installed, and often multiple years as well, you can easily get 30-40 shortcuts under Autodesk, which is basically useless.  However, some programs are presented correctly it seems, so I assume there's some information somewhere that forces one behavior or the other. Any suggestions on a thread to follow?

In previous versions of Windows (95-7), you could tree folders in the Start Menu.  In other words, you could have the Start Menu\Applications folder (now "All Apps") and have folder work and folder games in it. Games would have a shortcut to Minecraft, while work would have a shortcut to Word. In previous versions, when selecting a folder, you could choose to pick a subfolder.  When I navigate to folder, I get 2 options. Go to games or work. Lovely.  Now that option is dust. There is no option to get something like that without software. It shows all of the applications A-Z and therefore will not do something like that. Only one folder is open/closeable but all the subfolders and their contents are just mashed up there. For example, if I had a folder named Folder: (like in the photo)  | -Folder **main folder**   | --Work **subfolder**   | }--Word **item**   | --Games **subfolder**   | }--Minecraft **item**   It would show like this:  ** **F** **   Folder >   ** **G** **   And once I click Folder > it displays:  ** **F** **   Folder >   Minecraft   Word     ** **G** **   So to make a long story short, how do I make Windows show the subfolders in Folder?   P.S.  If you can find a way to make Windows 10 short the applications by name like in Windows 8.1, that would be much appreciated.


In C# I am starting a 3rd party application that takes 2 - 3 hours to complete. I need the output of the Process to write to the console in real time. I have done research on BeginOutputReadLine() and RedirectStandardOutput from Microsoft's website but my code is still not working.  Currently my code is only showing the output when the process is finished. I don't know where its gone wrong.  static void Main(string[] args) {   Process process;   process = new Process();   process.StartInfo.FileName = "C:\\ffmbc\\ffmbc.exe";   process.StartInfo.Arguments = "-i \\\\dssp-isi-t\\TMD\\B002C010_130520_R2R7.2398v5.mxf -an -vcodec libx264 -level 4.1 -preset veryslow -tune film -x264opts bluray-compat=1:weightp=0:bframes=3:nal-hrd=vbr:vbv-maxrate=40000:vbv-bufsize=30000:keyint=24:b-pyramid=strict:slices=4:aud=1:colorprim=bt709:transfer=bt709:colormatrix=bt709:sar=1/1:ref=4 -b 30M -bt 30M -threads 0 -pass 1 -y \\\\dss-isi-t\\MTPO_Transfer\\dbay\\B002C010_130520_R2R7.2398v5.mxf.h264";   process.StartInfo.UseShellExecute = false;   process.StartInfo.CreateNoWindow = true;   process.StartInfo.RedirectStandardOutput = true;   process.OutputDataReceived += new DataReceivedEventHandler(OutputHandler);   process.StartInfo.RedirectStandardInput = true;   process.Start();   process.BeginOutputReadLine();   process.WaitForExit();   process.Close(); }  private static void OutputHandler(object sendingProcess, DataReceivedEventArgs outLine) {   string line;   line = (outLine.Data.ToString());   Console.WriteLine(line); }

I'm developing an Windows Forms application that requires me to call a separate program to perform a task.  The program is a console application and I need to redirect standard output from the console to a TextBox in my program.    I have no problem executing the program from my application, but I don't know how to redirect the output to my application.  I need to capture output while the program is running using events.    The console program isn't meant to stop running until my application stops and the text changes constantly at random intervals.  What I'm attempting to do is simply hook output from the console to trigger an event handler which can then be used to update the TextBox.  I am using C# to code the program and using the .NET framework for development.  The original application is not a .NET program.  EDIT: Here's example code of what I'm trying to do.  In my final app, I'll replace Console.WriteLine with code to update the TextBox.  I tried to set a breakpoint in my event handler, and it isn't even reached.      void Method()     {         var p = new Process();         var path = @"C:\ConsoleApp.exe";          p.StartInfo.FileName = path;         p.StartInfo.UseShellExecute = false;         p.OutputDataReceived += p_OutputDataReceived;          p.Start();     }      static void p_OutputDataReceived(object sender, DataReceivedEventArgs e)     {         Console.WriteLine(">>> {0}", e.Data);     }


From other post, I know I should run  sudo apt-get build-dep octave before install octave,  but it returns: Reading package lists... Done Building dependency tree Reading state information... Done The following packages have unmet dependencies:  gfortran : Depends: gfortran-4.8 (>= 4.8.2-5~) but it is not going to be installed  libarpack2-dev : Depends: libarpack2 (= 3.1.5-2) but it is not going to be installed  libcurl4-gnutls-dev : Depends: libkrb5-dev but it is not going to be installed  libfltk1.3-dev : Depends: libfltk-gl1.3 (= 1.3.2-4) but it is not going to be installed  libfontconfig1-dev : Depends: libfontconfig1 (= 2.11.0-0ubuntu4) but 2.11.0-0ubuntu4.1 is to be installed  libftgl-dev : Depends: libftgl2 (= 2.1.3~rc5-4+nmu1) but it is not going to be installed                Depends: libgl1-mesa-dev or                         libgl-dev                Depends: libglu1-mesa-dev but it is not going to be installed or                         libglu-dev  libglpk-dev : Depends: libsuitesparse-dev  libhdf5-dev : Depends: libhdf5-7 (= 1.8.11-5ubuntu7)  liblapack-dev : Depends: liblapack3 (= 3.5.0-2ubuntu1) but it is not going to be installed  libqrupdate-dev : Depends: libqrupdate1 (= 1.1.1-1) but it is not going to be installed E: Build-dependencies for octave could not be satisfied.   then I tried to run sudo apt-get install gfortran-4.8, it returns  Reading package lists... Done Building dependency tree Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  gfortran-4.8 : Depends: gcc-4.8-base (= 4.8.2-19ubuntu1) but 4.8.4-2ubuntu1~14.04 is to be installed                 Depends: gcc-4.8 (= 4.8.2-19ubuntu1) but 4.8.4-2ubuntu1~14.04 is to be installed                 Depends: libgfortran-4.8-dev (= 4.8.2-19ubuntu1) but it is not going to be installed E: Unable to correct problems, you have held broken packages.   should I uninstall the conflicting packages and re-try above steps? will this action breaks other dependencies, how can I find out?  appreciate the comments if anybody encountered this problem.

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


I have this ClassParent class  class ClassParent<T> {      public void set(T t)     {          //setter code      } }   Then I have this ClassChild extending the ClassParent  class ClassChild extend ClassParent<String> {      public void set(String str)     {          //setter code     } }   Instantiating a new instance of ClassChild class.  ClassParent<String> child = new ClassChild();   Clearly, to preserve polyporphism, java compiler will create a bridge method in the ClassChild class. My question is, after I compiled the code using javac command, I want to see how the compiled code looks like, but I don't know how to do it. I opened the .class file using NotePad++, but I just saw gibberish. How do I view the compiled code is my question. I am new to programming in general. Thank you

What program can I use to decompile a class file? Will I actually get Java code, or is it just JVM assembly code?  On Java performance questions on this site I often see responses from people who have "decompiled" the Java class file to see how the compiler optimizes certain things.


I was wondering if there are any statements that could help forming an opinion on whether the CH is "true" or not.  I am thus looking for all statements, preferably of this character or simple ones, which are equivalent to the CH.

My understanding of logic is really basic, and I ask this question out of curiosity.  Is there an explicit example of a statement whose proof uses the continuum hypothesis and is unprovable in $ZFC + \lnot CH$.   ADDED: Preferably I'm looking for an example outside set theory.


It happens pretty often that I upvote an answer, then find out it was wrong. In the past, it was possible to change your vote once, at least I think so. Currently, you guys are giving me two options:   Do not vote until I test the answer, which means I'll forget to upvote 50% (or more) good answers that helped me Edit something just to be able to change that vote (but that would be nasty), when I find out answer actually sucks Upvote all other answers to make it up when I find out the answer I upvoted sucks   And guys, many answers that were voted to heaven actually suck. Often there's almost as upvoted comment saying "I have a XY problem with this answer, can you explain?". But the upvotes keep coming nevertheless.

I downvoted  and now really can't say why, so I wanted to remove my downvote. However, I get the message:  You last voted on this question yesterday Your vote is now locked in unless this question is edited  Why is this? I don't think I voted on it multiple times, and even when I did, I can change my mind, can't I?


i need some help setting up what is basically the same as a piston in a car engine's cylinder. i know i can just use keyframes and NLA strips but im after a more dynamic approach that wont require a bunch of edits to change the speed or phase. ideally i want to connect the rotation to the up and down motion of the control handle im using for the rest of the parts but i am stumped. i have animation nodes installed so solutions using that are also viable. suggestions appreciated as im at my wits end.

I've only done a very little animation and rigging before, and I keep getting stuck trying to rig the pistons and rotor of the Stirling engine I built.     What should happen is that one piston moves in as the other moves out, and through the attached arms, the rotor should spin. Animating the rotor and the piston heads was easy enough, but getting the arms that go from the piston heads to the end of the shaft arm to move right endlessly confuses me.   Each end of each arm moves differently over the course of a cycle. With animating, I can't figure out how to interpolate so the arms stay where they should.  With armatures, I have tried for a while, but keep getting stuck when it comes to how to have one end of a bone moving in a circle while the other end is moving in a straight line.  Edit: The answer below elegantly resolved my problem, so i've updated this with the finished .blend file in case it's useful someone else.   Here is the .blend file:


I am trying to construct a Galois field of order $t$, where $t$ is odd. I can do it when $t$ is an odd prime power. Is there any way to construct a Galois field when $t$ is not a prime power?

Let $F$ be a finite field. How do I prove that the order of $F$ is always of order $p^n$ where $p$ is prime?


I am fairly new with creating batch files.  I have made a batch file with the following content:  "C:\Program Files (x86)\Runtime Software\DriveImage XML\dixml.exe" /bC /c /l /t"B:\DRIVE IMAGES\Windows10_maintenance_backup   This allows me to run DriveImage XML and take a backup simply by running the bat file.  I would like the bat file to automatically make a folder with today's date so that:  B:\DRIVE IMAGES\Windows10_maintenance_backup   Becomes:  B:\DRIVE IMAGES\2016.01.20\Windows10_maintenance_backup   How can I achieve this by editing the .bat file? I have had a look at foxidrives solution  but I do not know how to implement the solution.

Update: Now that it's 2016 I'd use PowerShell for this unless there's a really compelling backwards-compatible reason for it, particularly because of the regional settings issue with using date. See @npocmaka's     What's a Windows command line statement(s) I can use to get the current datetime in a format that I can put into a filename?  I want to have a .bat file that zips up a directory into an archive with the current date and time as part of the name, for example, Code_2008-10-14_2257.zip. Is there any easy way I can do this, independent of the regional settings of the machine?  I don't really mind about the date format, ideally it'd be yyyy-mm-dd, but anything simple is fine.  So far I've got this, which on my machine gives me Tue_10_14_2008_230050_91:  rem Get the datetime in a format that can go in a filename. set _my_datetime=%date%_%time% set _my_datetime=%_my_datetime: =_% set _my_datetime=%_my_datetime::=% set _my_datetime=%_my_datetime:/=_% set _my_datetime=%_my_datetime:.=_%  rem Now use the timestamp by in a new ZIP file name. "d:\Program Files\7-Zip\7z.exe" a -r Code_%_my_datetime%.zip Code   I can live with this, but it seems a bit clunky. Ideally it'd be briefer and have the format mentioned earlier.  I'm using Windows Server 2003 and Windows XP Professional. I don't want to install additional utilities to achieve this (although I realise there are some that will do nice date formatting).


which one is correct or more natural: "the cake is purple and gold" or "the cake is purple and golden", and "a gold cake" or "a golden cake" still speaking of its colour? Thank you all.

Adjective or noun?      A golden spoon or A gold spoon   What to use? A spoon is made of gold.     Dictionary says:      -made of gold   But then... (the same page)     golden (adjective) - bright yellow in colour like gold   So, what should we prefer while referring to a spoon made of gold?


I have a Macintosh server computer with 3 users: admin, git, and server. Admin is the only administrator on the computer, while git and server are normal users. I can log in to all 3 over ssh, using public key authentication only for admin and server, while password authentication is enabled for git.  In short, I want to be able to log in directly to all 3 accounts via ssh, but only be able to switch accounts using su when I logged in first using admin. Is there a way to configure this in sshd_config?  Alternatively, is there a way you can disable su only for certain users?  The server is a a Mac Mini running macOS 10.13.5 and I am using the SSH server from the sharing menu, if that info is important.

I recently reinstalled iTunes and I noticed something peculiar. The "original" version of iTunes has a user in the permissions known as "wheel" that is set to "Read Only". I dragged this version of iTunes to the trash and installed a new copy, and when I look at the properties for iTunes it no longer says wheel, but rather just admin.  Here is a screenshot with the new version (left) and the old version (right):    What is the "wheel" user"? How is it set (I can't seem to set it in the GUI)? Why would the permissions be different now? It's not a problem, I'm just terribly curious.


I have a directory of jpgs with filenames in the following format: 2020-06-01-000533.jpg 2020-06-01-001528.jpg 2020-06-01-002532.jpg ... 2020-060390235533.jpg  I don't want to rename them because these filenames are useful for other aspects of this use case. I would like to run the following ffmpeg command on these files in order to create an MP4 from them: ffmpeg -i <this directory of files> -r 24 -c:v libx264 -pix_fmt yuvj420p output.mp4  I've seen solutions in StackExchange that recommend using glob, but that doesn't work on Windows 10.

I have 15 video files which I want to merge with ffmpeg. I want to save time by merge all of the video files in a single command line, not cut it one by one and merge it. Thanks.


I'm going through this blog about the difference between function declarations and function expressions.  It gives these two examples.  They call the first an "anonymous function expression" and the second a "named function expression."  // anonymous function expression var a = function(){    return 3; }  // named function expression var b = function bar(){    return 3; }   I tested these two in Chrome's JS console and I see the following:  a() => 3  b() => 3  bar() => bar is not defined   My question is: In the second function expression declaration, what is the point of "bar"? In general, why does one ever use a named function expression?

I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent.  The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not.  The two ways are:  var functionOne = function() {     // Some code };     function functionTwo() {     // Some code }   What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?


Let $p$ and $q$ be primes such that $p \equiv 1 \pmod 4$ and $\left( \frac q p \right) = -1$. Show that $\textbf Z[\sqrt {pq}]$ is not a UFD.   I tried some examples like $p=5$ and $q = 2$. But I have no clue about the general case. Any hint?

This is exercise 8 on page 147 of Jacobson's Basic Algebra:     Let $p$ be a prime of the form $4n+1$ and let $q$ be a prime such that $ \left( \frac{q}{p} \right) =-1$. Show that $\mathbb Z[\sqrt{pq}]$ is not factorial.   Here, $ \left( \frac{q}{p} \right) =-1$ means that $\overline{q}$ is not a quadratic number in the field $\mathbb Z / (p)$.  In the special case when $p=5$ and $q=2$, $9 = 3 \cdot 3 = (\sqrt{10} +1 )(\sqrt{10 }-1)$, with $3$ and $\sqrt{10} +1$ or $\sqrt{10} - 1$ nonassociates. But I have no idea what can I do with the general case.  I know that primes of the form $4n+1$ can be written in the form $m^2 + n^2$ with $m,n \in \mathbb Z$. But when $q$ is odd and not of the form $4n+1$, $pq$ is not the sum of two quadratic numbers. How can I use the fact $\left( \frac{q}{p} \right) =-1$?  Thanks~


I have reached level 5, but all of a sudden I don't seem to see any pokestops or gyms or pokemons its like just the map is there and nothing else no matter which place I go.

Pokemon GO isn't working at all for me right now. I'm in one of the following circumstances and can't do anything:   My game is displaying a "Try Again" message I'm stuck on the Loading Screen When I sign in I get a message that the servers are experiencing problems. I see the map but nothing is loaded, and my team color is wrong The "loading" Pokeball just ends up spinning and I can't catch or interact with things When I try to catch a Pokemon, the Pokeball just sits on my screen doing nothing Gym opponents will drop to 1 HP and won't take any more damage or attack When I open a pokestop, the pokestop image and the name of the pokestop does not load.   What's causing this? Is there a way to fix it?


Hey guys,  I just installed Ubuntu 13.10 on my Asus U46E-BAL6 laptop.  There are a few icons in the tray up top that I dont use, and I was wondering how I could remove them.  For example, I never need to use the mail icon or keyboard icon.  Any ideas?

I'm wondering how it's possible to remove the little mail indicator applet in the global menu. I've uninstalled all the programs that use it, like Thunderbird, Empathy, and Gwibber, since I don't use any of them, but the icon is still there.  Any ideas?


Here is something odd that I came across while experimenting with the 'is' keyword. When I use Python built-ins to create identical objects, Python assigns the same id to them:  >>> a = str() >>> b = str() >>> id(a), id(b) (29857888 29857888) >>> a is b True   Creating the string explicitly works the same way:  >>> a = '' >>> b = '' >>> id(a), id(b) (29857888 29857888) >>> a is b True    However, when I make my own classes, Python assigns different ids.  >>> class MyClass: ...    pass >>> c = MyClass() >>> d = MyClass() >>> id(c), id(d) (16566256 16566800) >>> c is d False   How/why does Python do this? Is there a way to implement this "id matching" functionality for my own classes?

Why does the following behave unexpectedly in Python?  >>> a = 256 >>> b = 256 >>> a is b True           # This is an expected result >>> a = 257 >>> b = 257 >>> a is b False          # What happened here? Why is this False? >>> 257 is 257 True           # Yet the literal numbers compare properly   I am using Python 2.5.2. Trying some different versions of Python, it appears that Python 2.3.3 shows the above behaviour between 99 and 100.  Based on the above, I can hypothesize that Python is internally implemented such that "small" integers are stored in a different way than larger integers and the is operator can tell the difference. Why the leaky abstraction? What is a better way of comparing two arbitrary objects to see whether they are the same when I don't know in advance whether they are numbers or not?


Reopen request:  Yes, this is marked as duplicate.  ** What I am asking is a shell script that can help me achieve updating packages with .deb and .tar.gz, but NOT how .deb will affect apt-get update, and NOT just manually compile the .tar.gz and manually update the package.  As I've mentioned before:   queries the adding of PPA in /etc/apt/sources.list.d/, which is not what I wanted, because I said there is no PPA available already. Also, I don't like using other PPAs, I prefer a script that is viewable and editable by me at any time I want.   shows no sign of (even) automatically downloading the .tar.gz packages. Also, what it talks about is manually updating source code packages, but what I want is a custom script that I can automatically download the source code, compile it and also automatically install it.  For some more information, I already know the existence of Arch Linux's AUR, and according to  which previously also flagged suggested duplicate, it is saying that an equivalent to Arch Linux's AUR is Ubuntu's PPA, which is not what I wanted.  I am now requesting to reopen this question. Please, and please understand what I want, not just marking some topics I don't need, and then say "This is a duplicate question".  Also check out  on this.    Question:  I know that we can automatically update packages using apt or apt-get if they are installed via PPA.  However, recently I found out that a package I installed, which is downloaded from the Internet in .deb format, is seriously outdated. There is no offical or unoffical PPA available for that program.  Also, another program that I complied long ago (also downloaded from the Internet, .tar.gz format) is also outdated.  Is it possible to have a shell script that can automatically check for updates online, download the .deb and .tar.gz packages, automatically compile it, and install it in Ubuntu?    For reference only:   Preferred: wget, make, crontab I understand the risk of using such scripts (risk of malicious downloads), I can personally bear it because I know how to remove infections when the system got infected by viruses. If anyone want me to specify a package I want to update, please use  and  (it's .tar.gz package).

I'm having some difficulties exactly understanding how the the whole update thing work in Ubuntu and good practice for installing software.  I understand I have a  /etc/apt/sources.list file where all my repositories are listed, and that these repositories are queried when I use apt-get update - to later be used with e.g. apt-get upgrade.  This makes perfect sense and I recently installed spotify by adding deb http://repository.spotify.com stable non-free to this "sources" list.    But then I got confused...  When I went to download Google Chrome I merely had to download and grab a .deb file, and Chrome installed with no problem... but I don't see any new entry in /etc/apt/sources.list...  So how does apt-get update know where to query concerning Chrome updates?  Has it somehow been added to one of the already listed repositories in the sources file?  I would like all my installed software to be encompassed by the update function.


Their work is still far from (being) finished.   Can 'being' be omitted in the sentence above?

Not being good at swimming, he didn't like it.   Could we omit the word "being" here?     Not good at swimming, he didn't like it.   Which one is grammatically correct?


I'm following the accepted answer from this question:   The answer claims the XPath query being used gets the href values from the links but this doesn't seem to be the case with my code. To clarify, this is the accepted answer:  //div[@class="widget-content"]//a/@href   My XPath is as follows:  //tr/td//a/@href   This only seems to select the links, rather than the href values.    So in this case, I then have to use a foreach loop to select the href values.  foreach(var link in links) {     var hrefValue= link.Attributes["href"].Value; }   First question, why does this happen? Second question, is there a way to directly get the href values?  For further context. I'm trying to select all href values from inside a HTML table.  EDIT: Example of HTML I'm trying to parse:

I'm trying to retrieve a specific image from a html document, using html agility pack and this xpath:  //div[@id='topslot']/a/img/@src   As far as I can see, it finds the src-attribute, but it returns the img-tag. Why is that?  I would expect the InnerHtml/InnerText or something to be set, but both are empty strings. OuterHtml is set to the complete img-tag.  Are there any documentation for Html Agility Pack?


I'm looking for a word (or concise phrase) that describe a wish/desire that is too optimistic or demanding to be realistic.  Examples:     To hope that human beings will always remain rational is a ____.      A world free from scarcity seemed like a childish ____.

An example might be a car that is fast, luxurious, reliable, gets great gas mileage, and is very cheap. Clearly we'd all love to own such a car, but it doesn't exist, and probably never will. There's also some naiveté in assuming it would.  Is there a metaphor, idiom, or other phrase that connotes this?  "Gee, that sounds like a wonderful car, but unfortunately, it's a _____."    UPDATE:  With regard to the proposed dupe - that question has the same accepted answer, but it's not the same question. Two different questions can have the same answer. Please let me know if you disagree.


If width is the extent in the first dimension, height in the second and depth in the third, is there a name for the extent of an object in the fourth spatial dimension?   And what about a five, sixth and higher dimensions?

Given that measurement along the X, Y and Z axes correspond to the terms "width", "height", and "depth", is there an accepted term for spatial measurement along the W axis when dealing in four dimensions?  For that matter, are there such terms for additional dimensional axes?


I'm running 12.04 and want to upgrade to the latest stable version.  How do I do that without losing my data files?

I just need some advice on upgrading from 12.10 to 13.04.  What happens when I upgrade? Do my files, settings, and internet bookmarks stay intact? I can't find any resources to help me with this.


I upgraded to Win10 from Win7, been having horrid memory leaks. Basically I can't run my computer for more than 7 days, my virtual memory would reach 55GB+ and make my computer non-responding. It's on "system managed" setting, though I tried giving it more manually and it would just fill up too.  My old Win7(before the Win10 upgrade) on this same computer was fine, could run for 3 months+ without issue. My laptop that has Win10 is also fine, it's now on for 2 months and memory use is minimal.   This is my MEMMAP, poolmon and ProcessHacker info:     This is how long my PC been on for the above screenshot:   This is my PC specs:   Please let me know if there's any other info needed to diagnose the issue.   Btw I have tried poolmon/WPA to diagnose the issue according to various guides found here, but for some reason I'm still unable to determine the cause of the memory leak. So you'll have to tell me exactly what to do differently with poolmon/WPA to find the cause. Thanks!!

A few days ago I updated my PC to Windows 10. However, after some use my PC started to slow down until it was impossible to use – it was due to high memory usage. After a restart, everything came back to normal (total usage around 25% of 8GB of RAM). However, during a few hours of usage the memory builds up again to 70%, and if not restarted it further goes to 100%, and later on even freezes. Task manager does not help very much as it does not show all the processes (added screenshots below). Also tried RAMMap but it gives an error: "error refreshing database". I tried Googling this question, yet without much success.  I do not know much about PCs, but maybe some of you know this issue, or could help to find out what is using my RAM.


My friend suggested nuking the following limit using Taylor, but I am convinced there is a 'nicer' method to solving it. $$\lim_{x\to\infty}x^{\frac23}\left((x+1)^\frac13-x^\frac13\right)=?$$ Multiplying it through to obtain the expression $(x^3+x^2)^\frac13-x$ hasn't helped, and neither has multiplying with the conjugate to obtain the expression $\frac{x^\frac23\left((x+1)^\frac23-x^\frac23\right)}{(x+1)^\frac13+x^\frac13}$. Is there are neat algebraic manipulation that can be performed to evaluate this limit? Thanks!

How can I show:      $$\lim_{x\to\infty}x^{2/3}((x+1)^{1/3}-x^{1/3})=1/3$$   I've tried multiplying with its "conjugate" but that doesn't seem to help that much.  Thanks!


How do I buy a SIM card for my cellphone in Paris? Also, is there anything I should keep an eye out? (things like fees, cellphone-compatibility in europe...) and do they have pre-paid plans (in Brazil we have those, I don't know how it's called in other parts of the world, but its simply a plan wich you pay before using, and once your credit is over you cannot make any more calls before recharging the SIM card).  If you know any, please post some buying places near the Arc de triomphe.

I will be driving through France soon and would like to have a local prepaid sim with data capabilities. I found a very interesting sollution in the , but I need a French delivery address. I don't have that on such a short notice, so I am looking for a plan that I could buy while on route (gas station, shopping malls, etc)


I want to compute the following ratio: $$\frac{\int_0^1x^n\sqrt{1-x^2}}{\int_0^1x^{n-2}\sqrt{1-x^2}}$$  As I found from wolframe it is $\frac{n-1}{n+2}$. I am trying to solve the integral using the following substitution:  $$f(x) = x^{n-2}\sqrt{1-x^2}$$ $$\frac{\int_0^1x^2f(x)}{\int_0^1f(x)}$$  But I am sticking here.

given $\displaystyle I_{n}=\int^{1}_{0}x^n\sqrt{1-x^2}dx$, then finding value of $\displaystyle \frac{I_{n}}{I_{n-2}}$  Attempt: put $x=\sin \theta$ and $dx = \cos \theta$  $\displaystyle I_{n} = \int^{\frac{\pi}{2}}_{0}\sin^{n}\theta \cdot \cos^2 \theta d \theta = \int^{\frac{\pi}{2}}_{0}\sin^{n}\theta (1-\sin^2 \theta)d \theta $  could some help me how to solve it, thanks


I want to copy one row from one table to another table. But in the process I want change value of id. For example to 20. How to do it?  I have this code  INSERT INTO work_done SELECT * FROM work_todo WHERE id = 10

I am trying to INSERT INTO a table using the input from another table. Although this is entirely feasible for many database engines, I always seem to struggle to remember the correct syntax for the SQL engine of the day (, , , , and ).  Is there a silver-bullet syntax coming from an SQL standard (for example, ) that would allow me to insert the values without worrying about the underlying database?


Exception: Could not retrieve the required installation files   That happens everytime Wubi is finished installing Lubuntu. I know there are questions like this, except I can't use a USB big enough for Lubuntu, and my PC will not work with CD/DVD drives.  The full log is too big to paste, but here's the last few lines.  01-20 18:07 DEBUG  TaskList: ### Finished get_metalink 01-20 18:07 DEBUG  TaskList: New task download 01-20 18:07 DEBUG  TaskList: ### Running download... 01-20 18:07 DEBUG  btdownloader: downloading http://cdimage.ubuntu.com/lubuntu/releases/12.04/release/lubuntu-12.04-desktop-i386.iso.torrent > C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso 01-20 18:28 DEBUG  TaskList: ### Finished download 01-20 18:28 DEBUG  TaskList: New task check_iso 01-20 18:28 DEBUG  TaskList: ### Running check_iso... 01-20 18:28 DEBUG  CommonBackend: Checking C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso 01-20 18:28 DEBUG  Distro:   checking Lubuntu ISO C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso 01-20 18:28 DEBUG  WindowsBackend:   extracting .disk\info from C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso 01-20 18:28 DEBUG  Distro:   parsing info from str=Lubuntu 12.04 "Precise Pangolin" - Release i386 (20120423) 01-20 18:28 DEBUG  Distro:   parsed info={'name': 'Lubuntu', 'subversion': 'Release', 'version': '12.04', 'build': '20120423', 'codename': 'Precise Pangolin', 'arch': 'i386'} 01-20 18:28 DEBUG  Distro: wrong version: 12.04 != 12.04.3 01-20 18:28 DEBUG  TaskList: ### Finished check_iso 01-20 18:28 DEBUG  TaskList: New task download 01-20 18:28 DEBUG  TaskList: ### Running download... 01-20 18:28 DEBUG  downloader: downloading http://cdimage.ubuntu.com/lubuntu/releases/12.04/release/lubuntu-12.04-desktop-i386.iso > C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso 01-20 18:29 DEBUG  downloader: Download start filename=C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso, url=http://cdimage.ubuntu.com/lubuntu/releases/12.04/release/lubuntu-12.04-desktop-i386.iso, basename=lubuntu-12.04-desktop-i386.iso, length=721727488, text=None 01-20 20:05 DEBUG  TaskList: ### Finished download 01-20 20:05 DEBUG  downloader: download finished (read 721727488 bytes) 01-20 20:05 DEBUG  TaskList: New task check_iso 01-20 20:05 DEBUG  TaskList: ### Running check_iso... 01-20 20:05 DEBUG  CommonBackend: Checking C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso 01-20 20:05 DEBUG  Distro:   checking Lubuntu ISO C:\ubuntu\install\lubuntu-12.04-desktop-i386.iso 01-20 20:05 DEBUG  Distro: wrong version: 12.04 != 12.04.3 01-20 20:05 DEBUG  TaskList: ### Finished check_iso 01-20 20:05 ERROR  TaskList: Could not retrieve the required installation files Traceback (most recent call last):   File "\lib\wubi\backends\common\tasklist.py", line 197, in __call__   File "\lib\wubi\backends\common\backend.py", line 600, in get_iso Exception: Could not retrieve the required installation files 01-20 20:05 DEBUG  TaskList: # Cancelling tasklist 01-20 20:05 ERROR  root: Could not retrieve the required installation files Traceback (most recent call last):   File "\lib\wubi\application.py", line 58, in run   File "\lib\wubi\application.py", line 132, in select_task   File "\lib\wubi\application.py", line 158, in run_installer   File "\lib\wubi\backends\common\tasklist.py", line 197, in __call__   File "\lib\wubi\backends\common\backend.py", line 600, in get_iso Exception: Could not retrieve the required installation files 01-20 20:05 DEBUG  TaskList: # Finished tasklist

So I tried to install lubuntu 2 times now, and it seems that it won't install because at the very last of the install progress I get the error: Could not retrieve the required installation files for more ingormation, please see the log file ()  I tried a live USB and it just doesn't boot up.  Anyone know what the problem could be? I'm on a 64 bit i7 gtx560 system  Kind regards, Gilles


I am trying to create an "ienumerable" with name "FreelancerProjectsNoduplication" that "ienumerable" should not contains duplicated records. I mean the records that have the same value for "BugetType" property should take only first one of these records and skip other records that have the same value for "BugetType" property. How to do that?  FreelancerProjectsNoduplication = _context.FreelancerProjects.GroupBy(f => f.BugetType).Where(g => g.Count() > 1).SelectMany(g => g),

I am playing with LINQ to learn about it, but I can't figure out how to use Distinct when I do not have a simple list (a simple list of integers is pretty easy to do, this is not the question). What I if want to use  on a list of an Object on one or more properties of the object?  Example: If an object is Person, with Property Id. How can I get all Person and use Distinct on them with the property Id of the object?  Person1: Id=1, Name="Test1" Person2: Id=1, Name="Test1" Person3: Id=2, Name="Test2"   How can I get just Person1 and Person3? Is that possible?  If it's not possible with LINQ, what would be the best way to have a list of Person depending on some of its properties in .NET 3.5?


I am executing following steps to mount my server and copy the files. But it interrupts for password. How can I do it automatic ?  sudo apt install cifs-utils   sudo mount -t cifs -o user=user.name //192.168.X.X/BAfolder  /media  cp -r /media/BAfolder/* /home/techy/Documents/files/

On one particular machine I often need to run sudo commands every now and then. I am fine with entering password on sudo in most of the cases.  However there are three sudo commands I want to run without entering password:   sudo reboot sudo shutdown -r now sudo shutdown -P now   How can I exclude these commands from password protection to sudo?


I want to typeset things that     I'm already aware of   Q-circuit, which has nice custom macros for this purpose, but is based on the relatively slow and clunky XyPic TikZ, which I can use to manually set things up (that's how the picture I've hotlinked was drawn)   Are there any other alternatives I should know about?


Building a device that will sit inside a liquid that will be a max of -80C and trying to figure out what my options are for measuring the temperature.  I was thinking a thermocouple but not sure if that's a good approach.  What have you used that you liked?  Thank you

I am planning to build a series of Arduino-controlled temperature-reporting units for a room full of "Ultracold" -80°C freezers. (I ultimately want to convert the signal to a serial stream that will interface with my existing system.)  So far I have only found  and other sensors that are only rated to -55C. In my application they would spend most of their time around -80C. I only need about 0.5 to 1 degree accuracy at those temperatures.  Does anyone know a source for a low-temperature sensor that would be arduino-compatible, reliable, and be able to be placed at the end of a wire (to be passed into the freezer through a small port)?  Small update below.


Suppose you come across a community wiki answer and feel you have something to expand/change/correct. What is the accepted etiquette for editing community wiki answers? Is there a strong sense of "ownership", or are we free to "make like a wiki"?

Some questions and answers are marked Community Wiki and are owned by a community wiki user:  (In fact, this very question is one of them)  Why have Community Wiki posts? How do Community Wiki posts work? How does a post become a Community Wiki post? How can the Community Wiki status be removed from a post? How can I find Community Wiki posts?


Why can't root send a fatal signal to PID 1/init process (sudo kill -9 1)?  As stated .

Can root kill init process (the process with pid 1)? What would be its consequences?


I want to ask, what happens with reputation in case if someone offers some reputation as a bounty for a question, but during bounty time there is zero answers (or given answers are deleted by moderators because they are useless).  Does reputation goes back to person who offered the bounty or it just vanishes?

It's possible to offer and award bounties of reputation on questions.   What is a bounty? How can I find questions that have a bounty attached? How do I start a bounty? When can I start a bounty? Why is the system requiring me to choose a bounty amount that's higher than the minimum? Can I use Markdown formatting in the bounty remarks? Can I edit the remark? How long is the bounty period? How do I award a bounty? Can I award a bounty to my own answer? Can I award a bounty to an old answer? If I offer a bounty on someone else's question, can I award the bounty to their answer? After awarding the bounty, can I remove it or move it to another answer at a later time? What happens if there's no answer after the bounty period? What happens if I feel my question is still unanswered? What is automatic awarding? Are bounty awards exempt from the 200 points/day reputation limit? How does Community Wiki mode affect bounties? How does user deletion or post dissociation affect bounties? Can I award a bounty to an answer from a deleted user or one where the author was dissociated? Can I offer a second bounty after the first one has expired? Can I raise my bounty? What happens if a bounty question is closed or deleted? Why can't I vote to close or migrate a bounty question? What happens if I delete my account while I have an active bounty? Do I keep an awarded bounty when I delete my answer? What happens if a question where I awarded a bounty later gets deleted or migrated? Can I cancel my bounty? Can I affect / divide / share part of my bounty to two (or more) users? How many outstanding bounties can a single user have?      See also:  in the Help Center


How long answer is considered OK in Stack Exchange sites? Are there any limits, assuming, that entire text of answer is somehow valuable and percentage of blah, blah is limited to minimum?  I have just wrote  and I have doubts, if I didn't cross the line?  BTW: Is this the longest / one of the longest answer in Stack Exchange / Stack Overflow? :>

There's one question in SO I'm planning to answer with a really long answer. While I'm still baking my post, these questions dawned to me:   What is the maximum character length of a post? How many links can I include, at most? How about the number of images? What is the character limit on the question title? Do the limits on questions apply to answers as well, or do they have different ceilings?


I'm trying to learn python and as a test i tried to make a BMI calculator  #BMI Calculator  name = raw_input ("What is your name?: ") weight = raw_input ("Hello %s What is your weight? (kilo): "% (name)) height = raw_input ("And what is your height? (cm) ")  #Calculations: weight / height^2 * 10000  weight = int(weight) height = int(height)  BMI = (weight / height ** 2) * 10000  print "%s, your BMI is %s"% (name, BMI)   But there seems to be something wrong with the calculations because i always end up with a BMI of 0? whats wrong?

Is there a benefit to using one over the other? In Python 2, they both seem to return the same results:  >>> 6/3 2 >>> 6//3 2


I was trying to demonstrate the Proposition 2.9 of Atiyah and MacDonald's Introduction to Commutative Algebra. But I couldn't do the following:     Let $M$, $M'$, and $M''$ be $A$-modules, $v$ and $u$ be homomorphisms, and   $$0 \longrightarrow\operatorname{Hom}(M'',N) \stackrel{\bar{v}}\longrightarrow\operatorname{Hom}(M,N) \stackrel{\bar{u}}\longrightarrow\operatorname{Hom}(M',N)$$   be a sequence exact for all $A$-module $N$. Then the sequence   $$M' \stackrel{u}\longrightarrow M \stackrel{v}\longrightarrow M'' \longrightarrow 0$$   is exact. Here, $\bar{v}(f)=f\circ v$ and $\bar{u}(g)=g\circ u$.   I suppose there is a particular A-module N that holds this, but I couldn't find it.  Somebody can help me? Thanks.

The following simple claim is used without proof in Proposition 2.9 of Atiyah and MacDonald (p.23). Although I believe I can prove it with a fairly involved argument, the claim is treated by the authors as a triviality so I feel like there should be a simple argument. Is there such an argument?      Let $M, N$ be $A$-modules. Let $v\colon M \to N$ be a homomorphism. Suppose that for all $A$-modules $P$, the dual maps $v^*\colon\operatorname{Hom}(N,P) \to \operatorname{Hom}(M,P)$ are injective. Then $v$ is surjective.   (Note that the claim is trivial for free modules, but I am looking for a general proof).


I am using PHP's mail() function to send emails (sendmail process is running). But all the mails are going to spam (in case of gmail). I have tried many tricks that I found on the net but none is working, please tell me about any sure-shot trick.

This is a tricky one and I've always relied on techniques, such as permission-based emails (i.e. only sending to people you have permission to send to) and not using blatantly spamish terminology.  Of late, some of the emails I send out programmatically have started being shuffled into people's spam folder automatically and I'm wondering what I can do about it.  This is despite the fact that these particular emails are not ones that humans would mark as spam, specifically, they are emails that contain license keys that people have paid good money for, so I don't think they're going to consider them spam  I figure this is a big topic in which I am essentially an ignorant simpleton.


I have a doubly linked list data structure that looks like the following:    Node structure is as follows:  typedef struct {     int32_t type;     int32_t valueint;     double  valuedouble;     struct  cNODE *next;     struct  cNODE *prev;     struct  cNODE *child; } cNODE;   Each node has a child element which can point to another node/doubly linked list of the same element(node) type. Till now, I used the following code to delete this complete data structure:  /* Delete a cNODE structure. */ void cNODE_Delete(cNODE *c) {     cNODE*next;     while (c)     {         next=c->next;         if (!(c->type)) && c->child)         {            cNODE_Delete(c->child)         };         free(c);         c=next;     } }   But this is a recursive function. I have a certain requirement where I can't use recursion. Can this deletion be implemented without recursion? Any examples are appreciated.

I've used recursion quite a lot on my many years of programming to solve simple problems, but I'm fully aware that sometimes you need iteration due to memory/speed problems.  So, sometime in the very far past I went to try and find if there existed any "pattern" or text-book way of transforming a common recursion approach to iteration and found nothing. Or at least nothing that I can remember it would help.   Are there general rules? Is there a "pattern"?


I am trying to deploy a connected app to higher orgs through Copado but am getting the error as "Consumer key is already taken" and so for that am trying to create a yaml and upload it in the pipeline record (as of my knowledge this approach will help to resolve error) but am unable to create a correct yaml structure... Please check below yaml structure which i am trying with. Any help is appreciated!! Thanks!! regex_lib:   remove-simple-tag: '((?ms)<consumerKey>(.+?)<\/consumerKey>)'    rules:   remove-consumer-Key:       extensions:        - ConnectedApp       regex_name: remove-simple-tag       branches:       replace_values:        - '(?ms)<consumerKey>(.+?)<\/consumerKey>'       replace_with:

I built a changeset and I was able to include all my classes, but it was a surprise that salesforce has not provided any option to deploy a connected app.  So how do I go about deploying a connected app? Do I need to create it in every other environment?


I'm interested in the exact barrier of $$\ln(n!)= \Theta(n\ln(n))$$  and if it even exists.  This means, there is a $c_1, c_2$ , so that $$\ln(n!) \le  \Theta(n\ln(n) c_1$$  $$\ln(n!) \ge  \Theta(n\ln(n) c_2$$  or  $$0 \le \lim\limits_{n \to \infty}\frac{\ln(n!)}{n\ln(n)} \ge \infty$$  I could use de l'Hospital for the limit fraction, since it's $\frac{\infty}{\infty}$ but the derivate of $\ln(n!)$ causes problems. Also I don't know how I could prove the two statements above or how to prove them wrong. Any help is appreciated.

In an example that I found, it is said that $\log(n!)$ has the same big-O complexity as $\log(n^n)$. Please explain why this is the case.


Reading Wald's book (page 380, end of the first paragraph of section 14.1) while the author is giving an overall discussion of quantum field theories you can read     However, for the more interesting case of a theory with interactions (i.e., for a field or fields satisfying nonlinear equations) one is led unavoidably to consider the products of field operators at the same spacetime point. Such quantities have no natural mathematical meaning, and consequently, with the exception of some simple models in lower spacetime dimensions, there are at the present no known examples of quantum field theories of physically reasonable interacting fields which are mathematically well defined.   What does Wald exactly mean by mathematically well defined, which are the problems, for example in QED that make it ill defined?

It is usually said that QED, for instance, is not a well-defined QFT. It has to be embedded or completed in order to make it consistent. Most of these arguments amount to using the renormalization group to extrapolate the coupling up to a huge scale, where it formally becomes infinite.  First of all, it seems bizarre to me to use the renormalization group to increase resolution (go to higher energies). The smearing in the RG procedure is irreversible, and the RG doesn't know about the non-universal parts of the theory which should be important at higher energies.   I have read in a note by Weinberg that Kallen was able to show that QED was sick using the spectral representation of the propagator. Essentially, he evaluated a small part of the spectral density and showed that it violated the inequalities for the field strength $Z$ that are imposed by unitarity + Lorentz invariance, but I do not have the reference.  So what I would like to know is :   What does it take to actually establish that a QFT is not well-defined?   In other words, if I write down some arbitrary Lagrangian, what test should I do to determine if the theory actually exists. Are asymptotically free theories the only well-defined ones?   My initial thought was: We would like to obtain QED (or some other ill-defined theory) using the RG on a deformation of some UV CFT. Perhaps there is no CFT with the correct operator content so that we obtain QED from the RG flow. However, I don't really know how to make that precise.   Any help is appreciated.


this question is on application of derivatives and I can't understand how the formula of the perimeter would be derived to the maximum.

Problem. What is the side lengths of an isosceles triangle with $6cm$ perimeter which has the largest area? I solved this problem as below and I would like to learn  that if there is anything wrong: Let us say that the side lengths are $a$ and the bottom length is $6-2a$. By using pythagorean theorem we can conclude that the height $h$ is equal to $\sqrt{6a-9}$. Then, the area of the triangle can be given as $f(a)=(3-a)(\sqrt{6a-9})$. So $f'(a)=-\sqrt{6a-9}+\cfrac{3}{\sqrt{6a-9}}$. Finally, $f'(a)=\cfrac{12-6a}{\sqrt{6a-9}}$ and $f'(a)=0 \iff a =2$.


How can I integrate $$\sqrt{\tan x}+ \sqrt{\cot x}$$  What method should I approach with?

How to calculate following integration?  $$\int\left( \sqrt{\tan x}+\sqrt{\cot x}\right)dx$$


If $\lim_{n \to \infty}a_n=a$ then $\lim_{n\to \infty}\frac{a_1+a_2+...+a_n}{n}=a$ I need to prove this, and was thinking to use some inequality related to the geometric and harmonic, but unfortunately my efforts did not pan out as hoped. Does anyone know how this would be proven?

Prove that if $\lim_{n \to \infty}z_{n}=A$ then:  $$\lim_{n \to \infty}\frac{z_{1}+z_{2}+\cdots + z_{n}}{n}=A$$ I was thinking spliting it in: $$(z_{1}+z_{2}+\cdots+z_{N-1})+(z_{N}+z_{N+1}+\cdots+z_{n})$$ where $N$ is value of $n$ for which $|A-z_{n}|<\epsilon$ then taking the limit of this sum devided by $n$ , and noting that the second sum is as close as you wish to $nA$ while the first is as close as you wish to $0$. Not sure if this helps....


Recently, I immigrated to the OpenLayers 4 and I've just wondered if there is any 3rd-party or plugins in order to add Google Maps layers such as Satellite, Hybrid and etc in my project. How should I achieve this?  Why isn't it support anymore?  Edit:  I see the below link in StackExchange. Someone says that we can use leaflet instead of OpenLayers, which isn't my goal and someone else introduced the ol3-google-maps plugin which integrated Google Maps into the OL3. but it's named OL3 and I confused about it. Can I use it with OpenLayers 4 and is it compatible well?

I want to know if the latest version of Openlayers (v4.0.1) supports Google Maps as a Tile Layer. I can't find any document ion about this. If Openlayers doesn't support Google Maps, could someone  tell me if there is any way to do this?


The tag bar's placeholder text is snipped, and only shows “Typ” (or rather, “Ty” and half a “p”):    Firefox and Chrome latest on Mac latest.

I've noticed that the background text "Type a tag" at the bottom of the "Ask Question" page is cut off:        Reproduced in Microsoft Edge.


I am trying to validate the following XML using a schema.  <?xml version="1.0" encoding="ISO-8859-1"?> <Noticias xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="UXMLS-5.xsd">   <Noticia dia="12" mes="3" año="2004" seccion="Nacional">     <medio tipo="radio">Onda Cero</medio>     <periodista>Fermín Bocos</periodista>     <titular>Atentado bestial en Madrid</titular>     <resumen>Resumen de la noticia Atentado bestial en Madrid</resumen>   </Noticia> </Noticias>   and I am stuck when validating the below line from the above:   <medio tipo="radio">Onda Cero</medio>   I am capable of validating "Noticia", which has attributes, as it isn't a final element with a type associated, I can't when it is the child element with content associated to it though.  I tried many approaches, with not luck so far, also I wasn't able to find a solution online. Any ideas? Am I missing something or is it just not possible doing it?  UPDATE: This is the XSD so far, keep in mind that the "medio" bit is wrong.  <?xml version="1.0" encoding="UTF-8"?> <xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" elementFormDefault="qualified">   <xs:element name="Noticias">     <xs:complexType>       <xs:sequence>         <xs:element name="Noticia" maxOccurs="unbounded">           <xs:complexType>             <xs:sequence>               <xs:element name="medio" type="xs:string">                 <xs:attribute name="tipo" type="xs:string">                   <xs:simpleType>                     <xs:restriction base="xs:string">                       <xs:enumeration value="radio"/>                       <xs:enumeration value="prensa"/>                       <xs:enumeration value="television"/>                     </xs:restriction>                   </xs:simpleType>                 </xs:attribute>               </xs:element>               <xs:element name="periodista" type="xs:string"/>               <xs:element name="titular" type="xs:string"/>               <xs:element name="resumen">                 <xs:simpleType>                   <xs:restriction base="xs:string">                     <xs:pattern value="[a-zA-Z0-9]{60}"/>                   </xs:restriction>                 </xs:simpleType>               </xs:element>             </xs:sequence>             <xs:attribute name="dia" type="dia"/>             <xs:attribute name="mes" type="mes"/>             <xs:attribute name="año" type="xs:integer"/>             <xs:attribute name="seccion" type="xs:string"/>           </xs:complexType>         </xs:element>       </xs:sequence>     </xs:complexType>   </xs:element>   <xs:simpleType name="dia">     <xs:restriction base="xs:integer">       <xs:minInclusive value="1"/>       <xs:maxInclusive value="12"/>     </xs:restriction>   </xs:simpleType>   <xs:simpleType name="mes">     <xs:restriction base="xs:integer">       <xs:minInclusive value="1"/>       <xs:maxInclusive value="31"/>     </xs:restriction>   </xs:simpleType> </xs:schema>

I'm having difficulty searching for this. How would I define an element in an XML schema file for XML that looks like this:  <option value="test">sometext</option>   I can't figure out how to define an element that is of type xs:string and also has an attribute.   Here's what I've got so far:  <xs:element name="option">     <xs:complexType>         <xs:attribute name="value" type="xs:string" />     </xs:complexType> </xs:element>


I am trying to export this rock model over to Unreal Engine 4. So far, i can import the mesh, but i cant figure out how to import the textures. keep in mind that the texture is made purely from Nodes (veroni, noise ect) so importing the .png isnt possible     just to clarify, i would like to import the textures, made purely using nodes, into Unreal Engine 4 (if possible).  Thanks

I have a sphere having a planet material MADE WITH NODES, and I want to convert this material into an image texture; because this material is made with nodes and only works in Blender, but I want to use in another software. This is my sphere material :   For Example : This is Jupiter :  And this is the texture :  In this case I used a downloaded image for Jupiter to be the material but I want the opposite, I want to change the material to image texture Like The shape of Jupiter texture. Is there anyway in Blender that can achieve my goal ? This is the file with my sphere material .  Textures Needed :  Albedo / Color / Diffuse Normal Map Roughness Glossines  I am using normal nodes and I am not useing the new Principled-shader


is it possible to upgrade windows 7 pro (volume license) to enterprise without rebuilding the whole pc.  i would use anytime upgrade but it's not available on the volume license edition.

From our license info page from MS:  Agreement Info: MOLP-Z Std ... License Date: 2011-03-02 Microsoft Invoice No: 91.... Reorder/Upgrade End Date: 2013-03-31  MS Win Pro 7 Sngl Open 1 License  Part no: FQC-02872 Qty: 120 MS Win Server CAL 2008 Sng Open 1 Part no: R18-02709 Qty: 120  Now we want to upgrade to Enteprise but the reseller says "Sorry, you need to buy new licenses, 120x Win7Pro (FQC-02872) and 120x SoftwareAssurance (FQC-02368).  Are they trying to rip us off?? "Upgrade End Date" still not here and why do we need to re-order exactly same part number (FQC-02872) only 1 year later?


I am preparing a presentation of proposal thesis and I need to know how I can change the size of one block in beamer. I can not use this command. I need to personalize the size for each block  \addtobeamertemplate{block begin}{%  \setlength{\textwidth}{0.9\textwidth}% }{}

I use a custom Beamer theme for my presentations. In my presentations I'd like to use blocks (\begin{block}…\end{block}). These blocks are rendered slightly too wide to fit into my theme. Is there a way how I can set the default width of blocks, e.g. to .9\textwidth?


How do I show the following by producing formal or informal proofs?   ⊢ (¬A → ¬B) → (B → A ) ⊢ ¬B → (B → A)   I can use the Modus ponus (MP) rule, and deduction theorem (DT). And I have these 3 axioms:   α → (β → α) --- (A1) (α → (β → γ)) → ((α → β) → (α → γ)) --- (A2) (¬β → ¬α) → ((¬β → α) → β) --- (A3)   Thank you!

The issue is Exercise 1.47 (d) in Elliot Mendelson's "Mathematical Logic". The exercise is to prove $(\lnot C\implies\lnot B)\implies(B\implies C)$ by using the three axioms $(A1,A2,A3)$ without using the Deduction theorem (and without any hypothesis).  The axioms are:  $A1: B\implies(C\implies B)$  $A2: (B\implies(C\implies D))\implies((B\implies C)\implies(B\implies D))$ $A3: (\lnot C\implies\lnot B)\implies((\lnot C\implies B)\implies C)$  The only inference rule is MP.  I have a proof but it is long. My proof is based on the proof of Lemma 1.11 (d) which proves $(\lnot C\implies\lnot B)\implies(B\implies C)$ but uses the Deduction Theorem (Proposition 1.9). Then, like Mendelson suggests in exercise 1.49, I apply the process used to prove the Deduction Theorem to the steps. To be precise, I assume $(\lnot C\implies\lnot B)$ as a Hypothesis $H$. If $C_1,C_2,\dots,C_n$ is a proof of $(B\implies C)$ that uses $H$ then stepwise I prove $H\implies C_i$ for $i=1,\dots,n$. The last step is $H\implies C_n$ which is what we want to prove.  This way requires around 4 uses of Axiom1, 4 of Axiom2, 1 Axiom3, and 9 uses of Modus Ponens.  Do I miss a shorter proof?


I have installed LaTeX 2016 on Debian Stretch (ruby 2.5 docker image) and I would like install packages from 2014 repository (), but when I tried install something, I see this error: /usr/bin/tlmgr: cannot download: download did not succeed:  ftp://tug.org/historic/systems/texlive/2014/tlnet-final/tlpkg/texlive.tlpdb.sha512  Problem is, that the new tlmgr does not support md5 files and requires sha512 files, but in repository aren't sha512 files. How can I solve it? I tried set no-checksums=1 in the config file, but it doesn't help. I'm not sure if the config file has correct location; also I'm not sure if no-checksums=1 should help. I tried these locations for the config file: /usr/local/share/texmf/texmf.cnf /root/texmf/texmf.cnf /root/.texlive2016/texmf-config /etc/texmf/texmf.cnf   kpsewhich -var-value=TEXMFSYSCONFIG /etc/texmf  kpsewhich -var-value=TEXMFCONFIG /root/.texlive2016/texmf-config  My steps: apt-get update apt-get install -y texlive-base texlive-bibtex-extra tlmgr init-usertree tlmgr option repository ftp://tug.org/historic/systems/texlive/2014/tlnet-final tlmgr install babel-czech  LaTeX and tlmgr version: pdfTeX 3.14159265-2.6-1.40.17 (TeX Live 2016/Debian) tlmgr revision 41476 (2016-06-18 02:45:25 +0200) tlmgr using installation: /usr/share/texlive TeX Live (http://tug.org/texlive) version 2016  Edit: Question isn't about upgrading TL, but using an archived repository from more recent TL. So I disagree, that it is a duplicate question. Question is how to use the archived repository from 2014 with TL 2016. In tlmgr it is possible to set archived repository.

Every year TeX Live provides a new version. My recollection is that soon after a new version is released, the old version's tlmgr stops fetching updates to packages. They provide  with the disclaimer     This procedure is not bullet-proof, or especially recommended   There is no upgrade path for Windows. Looking at the , it is not clear to me what is actually changing between releases such that a full new install is required/recommended. I always thought of TeX Live as providing useful binaries (e.g., pdflatex, biber, and makeindex) and a convenient way of updating  packages. What am I missing? Why does TeX Live need a new install every year?


A definition in classical geometry (for example, Birkhoff's formulation, but I suppose it could be all of them) is that a line is always considered to be parallel to itself. I understand this is probably for convenience, but in my mind since two distinct lines are parallel if they have no points in common and a line has infinitely many points in common with itself. Perhaps the idea is to ease the definition that two (non-parallel) lines intersect at one and only one point?   Q: What's the purpose/what inconvenience would be caused if we didn't have that definition?

We are learning vectors in class and I have a question about parallel lines and coincident lines. According to wikipedia a parallel line is:      Two lines in a plane that do not intersect or touch at a point are called parallel lines.   But another reference says     Side by side and having the same distance continuously between them.   According to the above definition, you can have two parallel lines with a distance of zero but this contradicts the first definition. So which is it?  EDIT:  If it is the second definition then you can have two lines that are coincident and parallel right?


I had a general question on what to do when no ground truth data is available and clustering is initiated.   Are there still metrics which can indicate how good or bad the clustering worked on the "baseline" data set? I am not sure how to tune the initial model without appropriate measures for (internal) model performance on the baseline data.   What is a best practice?

One of the biggest issue with cluster analysis is that we may happen to have to derive different conclusion when base on different clustering methods used  (including different linkage methods in hierarchical clustering).  I would like to know your opinion on this - which method will you select, and how. One might say "the best method of clustering is which gives you the right answer"; but I may question in response that cluster analysis is supposed to be an unsupervised technique - so how do I know which method or linkage is the right answer?  In general: is a clustering alone robust enough to rely on? Or we need a second method and get a shared result to be based on both?  My question is not only about possible ways to validate / evaluate clustering performance, but is broader - on what basis do we select/prefer one clustering method/algorithm over another one. Also, is there common warnings that we should look around when we are selecting a method to cluster our data?  I know that it is very general question and very difficult to answer. I only would like to know if you have any comment or any advise or any suggestion for me to learn more about this.


Mr. ABC has lived in California since 2010, and he resides with his wife and two children.  Please let me know if "has lived in" in the above sentence is correct? Should it be " has been living in ...." since he still resides in California.  .......................  Since graduating from the University in 2009, Mr. ABC has resided in Las Vegas.   Same question as above.  * Should it be " has been residing in ...." since he still resides in California.  Thanks & Regards

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


Please help I’m very confused about this. If $[r]$ and $[s]$ are two cosets of the set $R/A$ (Where $A$ is an ideal of the ring $R$) why are we allowed to define $[r]*[s]=[rs]$ when we only know that $[r]*[s]$ is a subset of $[rs]$?

Say $R$ is a commutative ring and $I\in R$ is an ideal. Let us consider the quotient $R/I$. It is created by taking every element $a\in R$, and adding all the elements of $I$ to it. The elements of $R/I$ are of the form $a+I$ and $b+I$, $\forall a,b\in R$.   Now $$(a+I).(b+I)=(a+i_{1}).(b+i_{2}),\forall (i_{1},i_{2})\in I \times I$$  $$(a+i_{1}).(b+i_{2})=ab+a.i_{2}+b.i_{1}+i_{1}i_{2}=ab+I$$  We know that $a.i_{2}+b.i_{1}+i_{1}i_{2}\in I$.   If $(a+I).(b+I)=ab+I$, then taking suitable $(i_{1},i_{2})\in I\times I$, we should be able to prove $(a+i_{1}).(b+i_{2})=ab+i_{3},\forall i_{3}\in I$. However, can every element in $I$ be generated by taking suitable $i_{1},i_{2}\in I$? And if not, is that the reason why $(a+I).(b+I)$ has to be defined as equal to $ab+I$ in violation of the distributive property of ring elements? This has confused me for a long time.   EDIT: I figured addition does not have to be defined as such because $(a+i_{1})+(b+i_{2})=a+b+i_{1}+i_{2}$, where $i_{1}+i_{2}\in I$. In fact, every element $i\in I$ can be constructed by taking $i_{1}=0$ and $i_{2}=i$. Hence, $(a+I) + (b+I)=a+b+I$ naturally. This is the logic I followed to determine that $(a+I).(b+I)$ doesn't quite work as nicey. I'm not sure if this logic is flawed or not as I haven't had the opportunity to ask anybody.   Thanks for your help in advance!


I have found this piece of code in a project I am working on:  +new Date(DateTime)   Note the + before new. If I pass in this value:  '2020-09-15T01:00:00Z'   It outputs this value:  1600131600000   Can anyone explain to me what this value is? It is not unix time - or at least the unix time moment outputs:  moment().unix(DateTime) = 1531737560   I am cleaning up my date formats within the project and cannot work out how to recreate this with moment...  EDIT:  How can I recreate this in moment.js?

I've seen this in a few   function fn() {     return +new Date; }   And I can see that it is returning a timestamp rather than a date object, but I can't find any documentation on what the plus sign is doing.  Can anyone explain?


Orphaned Tag Wikis are sad. They hang around, shambling, and groaning and wait... that's zombies. Or maybe teenagers.  What does happen in many cases is they can be ambiguous, get misused, and on some larger sites end up needing many man hours of cleanup.   On the other hand, people who create a tag ought to know what it's for. We can change them later. If its a new user, it also ensures the user's put some thought into it, and lets people review it better. Making them write at least an excerpt, that's peer reviewed. In short, can we make sure that the need and goal of any new tag is clearly stated when its created?

When a new tag is created, should there be some kind of notification to the user?  This could serve a dual purpose:   To make the user check that this tag is really required.  Is it spelt right? Might there be a more appropriate tag to use instead? - See  To promote the creation of tag wikis.   These are both beneficial to the site.  Making users think twice about their tags reduces the amount of retagging edits that are needed and reduces noise.  Promoting tag wikis means that more new tags would come with explainations, making them more user-friendly for others.  Creating a new tag is a privilidge earned at 1500 reputation.  Hopefully the user has gained a feel for the ethos of SO by this point, and is either enjoying being a contributer or is mainly asking good, well recieved questions.  The user is probably also wanting to contribute to the site further (even if just to gain reputation), and so it makes sense to me that there should be a gentle push towards taking a little bit of time to write a short wiki for the tag you just created.  By no means should this be mandatory, and the precise format of this gentle push is more in the scope of UX guys to think up, but I wanted to see how people felt about some kind of discreet notification.  I thought of two forms this notification could take:  Option 1 - at the time of tagging      Option 2 - after posting      Update: Raphael has suggested in the comments that this could be implemented as a 10K user tool.  While I think that's a good idea on its own, I don't think it should be used instead.  I think that encouraging users with less than 10K to complete wikis for their own tags is likely to get some wikis written because there is a sense of ownership over your own tag, and by giving it a wiki you are giving it a better start in life. As with a child, users will want to equip their tag with the tools it will need to survive in the big wide world.