Showing progress bar while window is loading with wpf window?
How to implement a progress bar using the MVVM pattern
PDF video Embedding Problem I have embed an mp4 video in the PDF file as given below:  \documentclass{beamer} \usetheme{Singapore} \usepackage{media9} \usepackage{hyperref} \begin{document}  \begin{frame}\frametitle{Title}  \includemedia[ width=\paperwidth,height=0.7\linewidth, activate=pageopen, flashvars={aaa.mp4 &amp;autoPlay=true} ]{}{C:/Users/name/Desktop/aaa.mp4}  \end{frame}  \end{document}    There is no compile time error in the code but after running it this massage comes along a  blank pd f file....  "To view the Flash @R Technology content in this pd f file, please install the required version of Flash Player"  I would like to add here that I already have installed the latest version of Flash Player(Adobe Flash Player 12 ActiveX). So,Can anyone tell what version is required to be installed to obtain Video in pd f file. Does the series $\sum \limits _{n=0}^{\infty} \cos(n\pi)$ converge or diverge? Does the series $\sum \limits _{n=0}^{\infty} \cos(n\pi)$ converge or diverge?   On substituting values I get alternate $1$ and $-1$.    So taking sum of infinite GP, I get $\dfrac 1 2$. So it looks like it converges. How do I make money efficiently? In Oblivion, I had two favorite money-makers:   Dump all my stuff except some basic armor and potions, and raid an oblivion tower. The armor and weapons was worth lots, and selling it in Anvil made a lot of cash fast. Harvest an entire farm's worth of crops, create 'restore fatigue' potions and sell them.   Skyrim seems to spoil this:   Merchants have a max-amount per day/QOD/... instead of per item You can't carry as much (or maybe I have yet to discover the strength/feather spells) Alchemy is a lot harder (most common items go into food recipes now, which don't sell for those prices) On top of that, once a dungeon is cleared, it doesn't respawn - so no 'farming' familiar dungeons?   What are some easy/repeatable money making methods in Skyrim? Which are most efficient effortwise/real-life-time wise? How many irreducible monic quadratic polynomials are there in $\mathbb{F}_p[X]$? Can some of you help me with my homework?     I had to count the irreducible, quadratic, monic polynomials in $\mathbb{F}_p[X]$ for arbitrary $p$.    I will show you what I tried myself.  Research effort  First of all the set $\{X^ 2 + bX +c : b, c \in \mathbb{F}_p \}$ contains $p^2$ elemenst. We need to substract the amount of elements that is reducible. These elements are exactly the set $A = \{(X+c)(X+d) : c, d \in \mathbb{F}_p \}$. There are $p(p-1)$ pairs of $(a,b) \in \mathbb{F}_p \times \mathbb{F}_p$ such that $a \neq b$, and there are $p$ pairs such that $a=b$.     When $a$ and $b$ are unequal, whe know that $a$ and $b$ can be swapped without changing anything to the polynomial $(X+a)(X+b)$, so I obtained that $|A| \leq p +(p-1)- \frac{1}{2}(p-1)=p-\frac{1}{2}(p-1)$.  In other to find out these are the elements, or that there are still less, I thought I had to assume that $(X+c)(X+d) = (X+\gamma)(X+\delta)$, to deduce some information about the realation between $(c,d)$ and $(\gamma, \delta)$, but this led to taking square roots in $\mathbb{F}_p$, and I am not familiar with that.  Could you please provide me some more information? I am having a problem with permissions on a Linux server. I am used to BSD. When a directory is owned by a group the user who owns it isn't in such as www-data, files created in it will be owned by that group. This is important because I want files to be readable by the webserver (which I will not run as root) but so a user can still put new files in the directory. I can't put the users in www-data because then they can read every other users websites.   I want the webserver to read all websites, I want users to be able to change their own.  The permissions are set like this on the folders at the moment....  drwxr-x--- 3 john www-data 4096 Feb 17 21:27 john   It is standard behavior on BSD for permissions to work this way. How do I get Linux to do this? When to throw an exception? A charged particle undergoing an acceleration radiates photons.  Let's consider a charge in a freely falling frame of reference.  In such a frame, the local gravitational field is necessarily zero, and the particle does not accelerate or experience any force. Thus, this charge is free in such a frame. But, a free charge does not emit any photons. There seems to be a paradox. Does a freely falling charge in a gravitational field radiate? How do I figure out who's been banished to the penalty box recently? Why "be king", not "be a king"? I've heard people say "be king" (as in "I can't wait to be king") in movies and TV. Why don't they say "be a king"? Which is correct? I am using Adobe Illustrator CS6 to create small images (like icons) for my app so I need pixel precision.  How can I avoid X, Y, W and H properties to have decimals? Can I configure 0 decimals for this properties on my document?  If I use the textboxes with this properties it does right, it increases pixel by pixel, but when draggin with the mouse it uses up to 3 decimals. How do I run an executable using Lua? When should I publish in interdisciplinary versus subject-specific scientific journals? Is the money you get from shorting a stock free to use for going long on other stocks? What are examples of two non-similar invertible matrices with same minimal and characteristic polynomial and same dimension of each eigenspace? Events triggered by dynamically generated element are not captured by event handler Regex (C#): Replace \n with \r\n How can I replace lone instances of \n with \r\n (LF alone with CRLF) using a regular expression in C#?  Sorry if it's a stupid question, I'm new to Regex.  I know to do it using plan String.Replace, like:  myStr.Replace("\n", "\r\n"); myStr.Replace("\r\r\n", "\r\n");   However, this is inelegant, and would destroy any "\r+\r\n" already in the text (although they are not likely to exist). Suppose $z\neq -1$ is a complex number of norm 1m $(|z| =1)$. I know that $z= n + mi$, what is the most straightforward way of solving this problem? I was also given the following sketch for a possible approach. Polynomials with integer coefficients such that $p(a)=b,p(b)=c,p(c)=a$ While studying polynomials a question struck in my mind that  To have a polynomial $p(x)$ with integer coefficients and $a,b,c$ are three distinct integers, then is it possible to have $$p(a)=b$$$$p(b)=c$$$$p(c)=a$$ Add sort by relevance to search jobs In Careers 2.0, individuals can choose "search jobs" and sort by date posted, job title, and company name.  However, Careers 2.0 already knows what tags I'm proficient in, and knows the tags associated with the job postings.  A sort option, relevance, should be added so that jobs matching my skill set, as demonstrated on stack exchange, will float to the top. Would a Jedi (Sith) clone be force-full or force-less Just seen a picture of Vader Force-choking a trooper. And then I started wondering: what if they had cloned a Sith (or a Jedi). Would the clones have the Force? Specifically, would they have the same Force as the original?