put one page completely landscape
How to translate and rotate the heading of landscaped pages?
How to persistently control maximum system resource consumption on Mac? Before Mavericks, I could use /etc/launchd.conf file to change maximum system resource consumption, for example:  limit maxfiles 16384 unlimited limit maxproc 16384 unlimited   It no longer works in Mavericks.  What is the correct way to do it in the recent version of OS X? What is needed for a game's stats to be saved? Last night I played a few games with my friend. While in the last game, I suddenly remembered something I had to do and was about to leave but my friend told me that I would lose my progress if I did so. I stayed until the end, through the scoreboard screen and quit while the next map was loading. Taking a look  now, I can't see any of yesterday's games. I don't remember how much XP I had yesterday so there is no sure way for me to check that. I had gotten a dozen ribbon and I don't see them in the feed, but there could be specific conditions to be showing them.  My questions then.   If you quit a game early, do you lose progress / XP? What if you quit on the scoreboard? Do you need to wait for the next map to load to save your progress? Any idea why the games aren't showing up? Some of them I definitely waited for the next map to load. Is there a delay for them to be shown on Battlelog?   Thanks. How to prove whether a matrix has rank $1$ If $u$ $∈ \mathbb R^{m \times 1}$ and $v ∈ \mathbb R^{n \times 1}$ how do you show that the $(m \times  n)$ matrix $uv^T$ has rank $1$? Would providing an example be sufficient to prove it? InDesign CS5 tables: Can I automatically fit rows or columns to the size of content? You know how Excel has the function "Autofit," where you select a whole row or a whole column and it resizes the entire thing to the height or depth of the largest content item? I want to do that in an InDesign table, but with one click. (I know I can drag the column out until the overflow box goes away, but I want to know if there's some automated function I'm overlooking.) Does this automatic function exist anywhere? Let X be a T1 space, and show that X is normal if and only if each neighbourhood of a closed set F contains the closure of some neighbourhood of F Let $X$ be a $T_1$-space, and show that $X$ is normal if and only if each neighbourhood of a closed set $F$ contains the closure of some neighbourhood of $F$.  I saw this statement in the book Introduction to topology and modern analysis by Simmons. I tried to prove it but I did not get any where. How may it be proved? Translation help review queue? Generating DLL assembly dynamically at run time Currently I have some code that is being generated dynamically.  In other words, a C# .cs file is created dynamically by the program, and the intention is to include this C# file in another project.  The challenge is that I would like to generate a .DLL file instead of generating a C# .cs file so that it could be referenced by any kind of .NET application (not only C#) and therefore be more useful. Is there a missing definite article before caliph in 'the group's leader, XYZ, as (the) caliph'? How does the linux kernel know device major and minor numbers? As far as I know, the kernel detects hardware, adds information to sysfs creates a device in /dev and then generates a udev event. My question is, do device drivers do all of this or it is the kernel itself? If drivers do it, then they would know the device major and minor number to create the file in devtmps.   I also understand (maybe wrongly) that it is udev who calls modprobe to load the drivers that handle a device.   I was told that they do so with the contents of the MODALIAS uevent environment variable, thus loading all modules whose aliases match this string (the correct driver). In short: what are the steps of hardware detection in linux and WHO performs each step: the kernel itself, the driver inside the kernel or udev in userspace. Thanks. Details on the Origin of Sting Is there an overall view of your cities? launch a VM on Ubuntu On Ubuntu 14.04, I installed VirtualBox on which I have created 2 Ubuntu virtual machines.  Does Ubuntu provide a way to launch  the virtual machine I want at a particual moment ? Is there any solution for this problem by developing a .sh script for example or using any other programming language ? I have an older iPod touch which which supports up to iOS 6.1.6 and nothing newer.  This device is equipped with a Linea Pro barcode scanner and previously had an application called "" installed.  Recently I was attempting to do some work on a web application I wrote and realized that I needed to update to a newer version of Web Barcode - but unfortunately the Apple ID saved on my device was deactivated a few years ago.  So I went to settings and updated it with my current Apple ID.  Then again tried to update the App from the Apple store.  Still no dice - it was asking me for the password on the old account.  So then I figured I'd just remove it and reinstall from scratch.  Deleted the app and went to the store but now I am met with a message that the new version requires at least iOS 8.0.  I feel I followed a very logical series of steps to update this application and while I can understand that I won't be able to install the newest version, how can I get the old version back?  The device is completely useless without the barcode scanning application and the Apple store is now refusing to install any version at all on my device.  What can I do to get the original version of this application reinstalled? Multi armed bandit for general reward distribution I'm working on a multi-armed bandit problem where we do not have any information about the reward distribution.   I have found many papers which guarantee regret bounds for a distribution with known bound, and for general distributions with support in [0,1].   I would like to find out if there is a way to perform well in an environment where the reward distribution does not have any guarantees about its support.  I'm trying to compute a nonparametric tolerance limit and using that number to scale the reward distribution so I can use the algorithm 2 specified on this paper (). Does anyone think this approach will work?  If not, can anyone point me to the right spot?  Thanks a bunch! Ubuntu 14.04, Intel Chromebook, no sound Java is one of my programming languages of choice.  I always run into the problem though of distributing my application to end-users.  Giving a user a JAR is not always as user friendly as I would like and using Java WebStart requires that I maintain a web server.  What's the best way to distribute a Java application?  What if the Java application needs to install artifacts to the user's computer?  Are there any good Java installation/packaging systems out there? Is there a simple way to change the thickness of a curved tube without scaling its overall size? E.g. scaling the minor radius of an already created torus without affecting its major radius or change the bevel width of a curve that has already been converted to a mesh. Series of books featuring dragons, enchanted forests, magic swords, etc When I was younger I read a series of 3 or 4 books involving largely traditional mages/dragons/enchanted forests.  I'd like to buy it for some of my younger extended family members but I can't remember the name of it.  Here's what I remember from this:   I read the last book first, in which the son of a woman turned out to be largely one of the main characters in the other books takes an enchanted sword into a forest on a quest to do something. At one point in one of the earlier books the group was travelling through a swamp like area to get to a tower where a witch(or mage lived). There was a king (possibly the son's father) who was frozen in a castle during the last book. The evil mages/witches would melt (but not die) when some spell was cast on them. I read the series circa 1992 (estimated), comparable to the DragonLance series it was geared towards a younger audience (I don't remember any sex/brutal slayings of anyone). I believe in the first book the mother of the son in the last book runs away from home and becomes something of a maid to a dragon. I can't remember if there were evil dragons or not, I seem to remember that at least some of them were good (or at least largely neutral).   If I think of any other details I'll add them. $$\dfrac{1}{\sqrt 1}+\dfrac{1}{\sqrt 2}+\dfrac{1}{\sqrt 3}+\cdots+\dfrac{1}{\sqrt n}\geq \sqrt n$$ I want to prove this by Induction  $$n=1 \checkmark\\ n=k \to \dfrac{1}{\sqrt 1}+\dfrac{1}{\sqrt 2}+\dfrac{1}{\sqrt 3}+\cdots+\dfrac{1}{\sqrt k}\geq \sqrt k\\ n=k+1 \to \dfrac{1}{\sqrt 1}+\dfrac{1}{\sqrt 2}+\dfrac{1}{\sqrt 3}+\cdots+\dfrac{1}{\sqrt {k+1}}\geq \sqrt {k+1}$$ so $$\dfrac{1}{\sqrt 1}+\dfrac{1}{\sqrt 2}+\dfrac{1}{\sqrt 3}+\cdots+\dfrac{1}{\sqrt k}+\dfrac{1}{\sqrt {k+1}}\geq \sqrt k+\dfrac{1}{\sqrt {k+1}}$$now we prove that $$\sqrt k+\dfrac{1}{\sqrt {k+1}} &gt;\sqrt{k+1} \\\sqrt{k(k+1)}+1 \geq k+1 \\ k(k+1) \geq k^2 \\k+1 \geq k \checkmark$$ and the second method like below ,   and I want to know is there more Idia to show this proof  ? forexample  combinatorics proofs  , or using integrals ,or fourier series ,....    Is there a close form for this summation ?  any help will be appreciated . Is it possible to cross the Wagan border by car? I was planning a trip by car when I found something a bit weird in :if you try to cross from Lahore to India, it tells that you have to 6457 km detour.  Is it possible to cross this border driving? If not, is there another way to cross without having to make more than 6000 km?