problem in videos
Ubuntu 14.04, problem when install gstreamer1.0-libav, unmet dependencies
LaTeX Classes or Styles for Schedules and/or Calendars? Maybe TeX isn't the best for this particular problem, but any teachers out there use a particular class or package to plan lessons?  Right now I'm just using a spreadsheet, but I always find myself wishing there was a 'lessonplan.sty' or 'classschedule.sty' file out there somewhere so I could still use the LaTeX for equations, tables, lists etc.    A bit of searching yielded a few results, but there doesn't seem to be a consensus.  Anyone used any of these:        Any recommendations from anyone on best way to make calendar-based class schedules and/or lesson plans? When is "seems to be" used instead of "seems"? The baby seems happy/comfortable. The baby seems to be happy/comfortable.   Are these both correct? If both are correct, what are the differences between them? Batch file to delete files older than N days Why doesn't this division work in Python? How do I just restart the nautilus after adding a nautilus script without having to log out. I noticed that I have three warnings when I submitted my Sitemap. They all say this:      When we tested a sample of URLs from your Sitemap, we found that some   URLs redirect to other locations. We recommend that your Sitemap   contain URLs that point to the final destination (the redirect target)   instead of redirecting to another URL.   I'd like to try and resolve this issues but I'm not sure what to do.  Sitemap url for reference: When you call the object.__repr__() method in Python you get something like this back:    &lt;__main__.Test object at 0x2aba1c0cf890&gt;     Is there any way to get a hold of the memory address if you overload __repr__(), other then calling super(Class, obj).__repr__() and regexing it out? I wanted to try out different desktop environments so I installed XFCE, KDE, GNOME, etc on top of Unity in Ubuntu 12.04  After a while I decided that I didn't like those other DEs and would stick to Unity. So I changed my default DE to Unity by configuring gdm.  sudo dpkg-reconfigure gdm   Now I am able to choose my DE at login time and all of DEs are working properly.   But the strange thing is that my boot up screen says 'lubuntu', my login screen is KDE, and my desktop is Unity.   How and why is this happening? Why didn't my gdm configuration have any effect? Does login and boot up screen need to be configured separately from the DE?  There are other similar questions here but they are not the same as this one. I do not want to remove the other enviroments I'm quite happy with having a list of DEs to select from. I want to know how to set proper defaults. Is it possible to use the startup.blend UI layout in older files? new array.sty and colortbl.sty incompatibility? I want to generate sprite-sheets for an isometric projection of various 3d assets purchased from the Unity3D asset store. I'd preferably also render the normal maps. I am a programmer, but new to 3D modeling software (Blender, etc.)  I found two tools for this;  and , but neither supports enough formats to be worth their cost.  There must be an efficient way of isometrically rendering various animations of a 3d assets in Blender&mdash;but I don't know how. How can I do this? Todo comments:Not include and left align? Proof using Prüfer encoding The question is as below:      Show that each vertex $v$ of a tree $T$ appears $deg(v)-1$ times in the Prüfer encoding of $T$, where $deg(v)$ is the degree of $v$ in $T$.   For this, I think there are 3 scenarios a leaf should be considered for: (1) when it is a leaf as part of a tree; (2) a leaf that has been discarded; (3) the remaining edge. I feel like this will result in a short proof which is only two (or so) statements long, but at the same time, feel it is too simple.   EDIT: I've had a look at this again and narrowed it down to 2 cases:   Case 1: The vertex $v$ in question has $deg(v)\ge2$. $v$ then loses its neighbours as the algorithm is applied repeatedly until $v$ becomes a leaf itseelf. At this point, $v$ is attached to another neighbour, leaving an edge. This means the algorithm can no longer be applied and we have obtained the final Prüfer Encoding for the tree $T$.  Case 2: The vertex $v$ has $deg(v)\ge 2$. It loses its neighbours as the algorithm is applied repeatedly but is deleted itself at some point in the process.   Have I gone about this wrong?  Thank you. Finding the unique rock with its weight I have 12 rocks, all have the same weight except for one rock, but I don‘t know which rock is. How do I know which rock is different from other, and also know that rock heavier or lighter, with maximum 3 comparating steps. My only tool is just a balance that can only compare the weight between the rocks. What five odd integers have a sum of $30$? How do I read a text file with variable hexadecimal value columns in matlab? How to Check If A Plugin Is Enabled Through API? I am working to build a reinforcement agent with DQN. The agent would be able to place buy and sell orders for a day trading purpose. I am facing a little problem with that project. The question is "how to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$".  I want to maximize the profit inside a trading day and avoid to place the pair (limit buy order, limit sell order) if the profit on that transaction is less than 100$. The idea here is to avoid the little noisy movements. Instead, I prefer long beautiful profitable movements. Be aware that I thought using the "Profit &amp; Loss" as the reward.  "I want the minimal profit per transaction to be 100$" ==> It seems this is not something that is enforceable. I can train the agent to maximize profit per transaction, but how that profit is cannot be ensured.  At the beginning, I wanted to tell the agent, if the profit of a transaction is 50 dollars, I will remove 100 dollars, then It becomes a penalty of 50 dollars for the agent. I thought it was a great way to tell the agent to not place a limit buy order if you are not sure it will give us a minimal profit of 100$. It seems that all I would be doing there is simply shifting the value of the reward. The agent only cares about maximizing the sum of rewards and not taking care of individual transactions.   How to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$? With that strategy, what guarantee that the agent will never make a buy/sell decision that results in less than 100 dollars profit? Does the sum of reward - # transaction * 100 can be a solution? wildcard * in CSS for classes I have a site with Google Maps on most of the pages. When inspecting content keywords in Google Webmaster tools, content keywords identified by Google-bot for the site include "imagery", "sorry" and "here". These turn out to be part of an error message returned by Google Maps: "Sorry, we have no imagery here". I cannot reproduce this error with normal clients, nor does "fetch as Google" show it. The problem is presumably that Google-bot tries to execute some of the Google Maps Javascript but then shoots itself on the foot and records the error message.  A  shows that this problem is endemic to sites across the internet, including Yelp and many others.  I'd like to convince Google that my site is not about imagery and being sorry, but I'd also like to keep the maps in place. I guess one option would be to transition to , but that's not a great alternative.  There's some , no resolution.