JAVA method that computes and prints a total sum of items
Calling a method in java and returning beer cost
I want to create posters for my poster presentation on a conference. What tools or LaTeX classes are available for preparing posters ? Let $X$ be a beta distributed variable with parameters $a$, $b$. Let $Y$ be a beta distributed variable with parameters $c$, $d$. Let $Z = \max(X, Y)$.  Does anybody know of a fast way to compute the mean and variance of $Z$ given $(a, b, c, d)$?  $X$, $Y$ don't necessarily need to have beta distributions, but they should be similar -- in $[0, 1]$.  What I really want to find is a way to quickly approximate the distribution of the sample max of a bunch of random variables. Let $Z = \max(\{X_1, X_2,\dots , X_n\})$. If I know parameters (not necessarily beta-distribution) for $X_1, X_2,\dots, X_n$, can I quickly compute a set of parameters (same distribution as $X_i$) to form a distribution that closely approximates $Z$?    EDIT: To clarify, the purpose of this has to do with programming AI for board games. If we are evaluating a position in a chess game and we determine one move leads to a 60% chance of winning while all others have a 20% chance of winning, then we value the position as a 60% win. This is the minimax algorithm... However, what I'm curious about is whether this can be improved upon. In the simple case, we approximate: $$ \mu_c = \max(\{\mu_1, \mu_2,\dots, \mu_n\}) $$ where $\mu_c$ is the expectation from the current position and $\mu_i$ is the expectation from each of the sub-trees.  It seems like we should be able to do better than this. Can we find a function f that replaces max and closely approximates parameters for the distribution of the sample maximum? $$ (\mu_c, \sigma_c) = f\left(\{(\mu_1,\sigma_1), (\mu_2,\sigma_2), \dots, (\mu_n, \sigma_n)\}\right) $$ In this case, we still want $\mu_i$ to be the expectation from each of the nodes. However, $\sigma_i$ does not necessarily need to be variance/standard deviation; just a parameter that represents uncertainty.  Just as: $$ \max(\{a, b, c\}) = \max\left(\{\max(\{a, b\}), c\}\right) $$ We should expect: $$ f\left(\{a, b, c\}\right) \approx f\left(\{f(\{a, b\}), c\}\right) $$ So $f$ does not necessarily need to take parameters for more than two nodes.  One thing, however, is that $f$ should be relatively fast to compute. If the integrals must be calculated, I think doing double exponential integration might work well, but I'm not sure -- Evaluate $\int \frac{1}{(x^2+1)^2}dx$ $$\int \frac{1}{(x^2+1)^2}\mathrm dx$$ Look simple, but I stuck a little bit. What method is better in this situation? Please, help. Can my child attend a private school whilst I'm on USA ESTA? I am British, currently staying in the USA for 6 weeks on an ESTA Visa Waiver. I am living with a local family and whilst here my child (9 years old) has been attending a private (non-state) school with the children of the local family.  Today somebody told me that by having my child attend a private school I may be in violation of the terms of the ESTA Visa Waiver.  I have found nothing about this at   Where can I find official documentation / online advice about this? Difference between StringBuilder and StringBuffer What is the main difference between StringBuffer and StringBuilder? Is there any performance issues when deciding on any one of these? Is there a word or phrase for two nouns or adjectives joined by a conjunction (usually "and") in a fixed sequence?        alive and well           fast and furious   hat and gloves   pen and pencil   law and order   wit and wisdom   salt and pepper   bacon and eggs   horse and carriage   Adam and Eve   ladies and gentlemen   loud and clear   heads or tails   yes or no   dead or alive I'm programming a presentation in LaTeX using the beamer class.  However, it defaults to 4:3 aspect ratio slides, while everything I use is 16:9. Is there an easy way to change this using a command or two? Let $\{x_n\}$ and $\{y_n\}$ be sequences of real numbers which converge to $\ell$ and $m$ respectively. Show that  $$\lim_{n\to \infty} \frac{1}{n}\sum_{k=1}^{n}x_ky_{n+1-k}=\ell m$$  This is a problem I found in a book, it seemed to be routine, but now I can't solve it.  What I tried :     Let us take some $\epsilon&gt;0$. Now after a stage $N$, both $|x_n-\ell|&lt;\epsilon$ and $|y_n-m|&lt;\epsilon$. Now I wanted to break the sum $$\left|\frac{1}{n}\sum_{k=1}^{n}x_ky_{n+1-k}-\ell m\right|$$in two parts, one upto $N$, and other one for $N+1$ to $n$. Now we need this to be arbitrarily small. But here I am lost. I don't know how to proceed anymore. Because when I take $x_i's$ to make up a finite sum, then the $y_j's$ are there too with $j$ very large. I think this is the main idea, but unable to do anything further. Can someone help me? Thanks. How to let `dpkg -i` install dependencies for me? Say, I have foo-1.2.3.deb which depends on perl and python, however, running command:  dpkg -i ./foo-1.2.3.deb   won't install these dependencies. So I must apt-get install perl python by hand.  How to make dpkg -i install these dependencies for me automatically? VPN server on Google Compute Engine with OpenVPN Fix corrupt NTFS partition without Windows MY NTFS Partition has gotten corrupt somehow (it's a relic from the days when I had Windows installed).     I'm putting the debug output of fdisk and blkid .  At the same time, any OS is unable to mount my root partition, which is located next to my NTFS partition. I'm not sure if this has anything to do with it, though. I get the following error while trying to mount my root partition (sda5)  mount: wrong fs type, bad option, bad superblock on /dev/sda5,        missing codepage or helper program, or other error        In some cases useful info is found in syslog - try        dmesg | tail  or so  ubuntu@ubuntu:~$ dmesg | tail [ 1019.726530] Descriptor sense data with sense descriptors (in hex): [ 1019.726533]         72 03 11 04 00 00 00 0c 00 0a 80 00 00 00 00 00  [ 1019.726551]         1a 3e ed 92  [ 1019.726558] sd 0:0:0:0: [sda]  Add. Sense: Unrecovered read error - auto reallocate failed [ 1019.726568] sd 0:0:0:0: [sda] CDB: Read(10): 28 00 1a 3e ed 40 00 01 00 00 [ 1019.726584] end_request: I/O error, dev sda, sector 440331666 [ 1019.726602] JBD: Failed to read block at offset 462 [ 1019.726609] ata1: EH complete [ 1019.726612] JBD: recovery failed [ 1019.726617] EXT4-fs (sda5): error loading journal   When I open gparted (using live CD), I get an exclamation next to my NTFS drive which states   Is there a way to run chkdsk without using windows ?  My attempt to run fsck results in the following :  ubuntu@ubuntu:~$ sudo fsck /dev/sda fsck from util-linux-ng 2.17.2 e2fsck 1.41.14 (22-Dec-2010) fsck.ext2: Superblock invalid, trying backup blocks... fsck.ext2: Bad magic number in super-block while trying to open /dev/sda  The superblock could not be read or does not describe a correct ext2 filesystem.  If the device is valid and it really contains an ext2 filesystem (and not swap or ufs or something else), then the superblock is corrupt, and you might try running e2fsck with an alternate superblock:     e2fsck -b 8193 &lt;device&gt;   Update: I was able to fix the NTFS partition running chkdsk off Hiren's BootCD, but it seems that the superblock problem still remains.  Update 2: Fixed superblock issue using e2fsck -c /dev/sda5 Reference for creative set criterion theorem Submitting ACM Conference papers to ArXiv I'm a little confused. The  states:     ACM authors hold the right to post copies of their own peer-reviewed accepted ACM works on any non-commercial repository or aggregation that does not duplicate ACM tables of contents, i.e., whose patterns of links do not substantially duplicate an ACM-copyrighted volume or issue. Non-commercial repositories are here understood as repositories owned by non-profit organizations that do not charge a fee for accessing deposited articles and that do not sell advertising or otherwise profit from serving articles.   However, the  site states:     Can I publish the published version of my publication on arXiv?       No. An ACM author cannot grant arXiv.org or any other publisher rights to distribute their works that have been published by ACM.   SHERPA/Romeo shows ACM as being a "Green Publisher", which would support the case that I can upload to ArXiv.   states that I can upload pre- or postprints under certain circumstances, but does not explicitly mention Arxiv, positively or negatively.  So, what is it? Can I submit a paper I published with an ACM Conference (ACM WiSec, if that makes a difference) to ArXiv or not? As I understand it, ArXiv is a non-profit, so it would fit the terms of the publishing policy. Or is this related to the rights you have to grant ArXiv upon submission?  If I can only publish a specific version of the paper, which one? How should a bot earn enough reputation to perform the actions necessary for that bot? We all know it: bots that chat. There are also bots that flag, or perform other actions. And usually we like them for doing that, like . So every now and then, a new bot is created, and usually you would ask a question using that bot or suggest enough edits to get the reputation necessary for that bot to operate. Instead of suggesting 100 edits, Undo has found a more efficient way, namely by . Now someone could frown on this action or not, actually it is the least intrusive way to get the bot the reputation necessary (I guess no one really likes a bot to suggest 100 edits just for the sake of earning enough reputation). The question is: is this actually the best way? Was this action allowed or should we look away because it is Smokey? Should we maybe have a special bot user status which derives the privileges from its master user? Anything else you want to share on this? Related: Does someone knows if it exists some ppa packages source for the newest Ubuntu version 19.10 i had problem with that when i upgraded from Ubuntu 19.04 to 19.10 i didn't work? How do I get the subscribers of an event? I need to copy the subscribers of one event to another event. Can I get the subscribers of an event (like MyEvent[0] returning a delegate)?  If this is not possible I would use the add accessor to add the delegates to a list. Would that be the best solution? Zorn's lemma and maximal ideals Let's consider two statements: Zorn's lemma and theorem about existence of maximal ideals in commutative ring with $1$.  It's easy to prove that Zorn's lemma implies existence of maximal ideals.  I wonder if the converse proposition is true, i. e., does existence of maximal ideals implies Zorn's lemma? My approach was to construct a ring structure on an ordered set which satisfies Zorn's lemma condition such that existence of maximal ideal implies existence of maximal element in the set, but I didn't succeed. The workings of the Hall effect? I want to ask about the workings of the . Why do the electrons come to rest on the edge of the wire? The magnetic field pushes them up, and the electric field pushes them forward. Shouldn't they reach the top of of the conductor and then stop moving up but continue moving forward?  Why does the magnetic field stop them from continuing to flow? The magnetic force is up so why would it effect their velocity forwards? Why won't Amanita move in and settle down? I keep getting an alert that Amanita would like to settle down. I have a house ready for them however they still won't move in. Who is this NPC and why won't they settle down? Abstract algebra book recommendations for beginners. I am taking abstract algebra in this semester. I find that my lecturer didn't provide enough examples for understanding. So I would like to ask what are the recommended books which has lots of solved problems and exercises? The lecturer said in this semester, he will cover group theory, ring theory and a bit of field theory. Which book contains extensive information in these three fields?