Hi I usually write whole beamer presentations in bulleted list which creates automatic indentation which produce odd looking lot of left margin space. I want to start bulleted list like normal text without indentation. I tried packages like \usepackage{enumitem} which is not working in beamer. Kindly suggest some solution
I can't figure out how to line up the symbols of an itemize environment in beamer with the left part of the main text. In other words, I would like to supress the left margin in beamer itemize lists.  It would be nice if the solution worked with any itemize label defined with  \setbeamertemplate{itemize item}[]   In order to make myself clearer, what beamer produces by default is something like:  Main text. Main text. Main text...    * Item 1    * Item 2    * Item 3    ....   and the desired result is   Main text. Main text. Main text... * Item 1 * Item 2 * Item 3 ....
What are Virtual Methods? Why would you declare a method as "virtual".   What is the benefit in using virtual? I'm trying to generate a secret key to be used for HMAC SHA-256 signature processing. I've seen many sample of keys with variable length from 32 characters to 96 characters.  What is the ironclad rule for this key size? I have two checkboxes in a lightning component, when we click on the first checkbox it marks true to the other checkbox, it works well only with the UI tags but doesn't work when I convert it to lightning tag  &lt;ui:inputCheckbox aura:id="box3" change="{!c.selectAll}"/&gt;  &lt;ui:inputCheckbox aura:id="boxPack" value=""                                                          change="{!c.checkboxSelect}"/&gt;   below are the lightning tags  &lt;lightning:input type="checkbox" aura:id="box3" onclick="{!c.selectAll}"/&gt;  &lt;lightning:input type="checkbox" aura:id="boxPack" value=""                                                          onclick="{!c.checkboxSelect}"/&gt;   controller  checkboxSelect: function(component, event, helper) {         // get the selected checkbox value           var selectedRec = event.getSource().get("v.value");         // get the selectedCount attrbute value(default is 0) for add/less numbers.          var getSelectedNumber = component.get("v.selectedCount");         // check, if selected checkbox value is true then increment getSelectedNumber with 1          // else Decrement the getSelectedNumber with 1              if (selectedRec == true) {             getSelectedNumber++;         } else {             getSelectedNumber--;         }         // set the actual value on selectedCount attribute to show on header part.          component.set("v.selectedCount", getSelectedNumber);     },      selectAll: function(component, event, helper) {         //get the header checkbox value           var selectedHeaderCheck = event.getSource().get("v.value");         // get all checkbox on table with "boxPack" aura id (all iterate value have same Id)         // return the List of all checkboxs element          var getAllId = component.find("boxPack");         // If the local ID is unique[in single record case], find() returns the component. not array            if(! Array.isArray(getAllId)){             if(selectedHeaderCheck == true){                  console.log('true');                 component.find("boxPack").set("v.value", true);                 component.set("v.selectedCount", 1);             }else{                 component.find("boxPack").set("v.value", false);                 component.set("v.selectedCount", 0);             }         }else{             // check if select all (header checkbox) is true then true all checkboxes on table in a for loop               // and set the all selected checkbox length in selectedCount attribute.             // if value is false then make all checkboxes false in else part with play for loop              // and select count as 0              if (selectedHeaderCheck == true) {                 for (var i = 0; i &lt; getAllId.length; i++) {                     component.find("boxPack")[i].set("v.value", true);                     component.set("v.selectedCount", getAllId.length);                 }             } else {                 for (var i = 0; i &lt; getAllId.length; i++) {                     component.find("boxPack")[i].set("v.value", false);                     component.set("v.selectedCount", 0);                 }             }          }        }, I have heard that there are some Pokémon that are region specific.  Could someone please clarify which Pokémon are region specific and in which regions that they can be found in? When I install "Installer for Microsoft TrueType core fonts" (ttf-mscorefonts-installer) from the Software Center on 14.04, it gives a positive response--but after this I get a download error. It seems that the files actually providing the fonts are never retrieved. Is there any way to resolve this? Does anyone know the general strategy for summing a series of the form:  $$\sum_{n=1}^{\infty} \frac{1}{n^2 + a^2},$$  where $a$ is a positive integer?  Any hints or ideas would be great! Is it possible to downgrade an OEM Windows 8 install to Windows 7? I recently purchased an ASUS K55A. Like all Windows 8 machines, it come with a UEFI feature called Secure Boot. This basically makes sure that the laptop won't load anything other than the Windows 8 OEM version that came with it.  However the Asus UEFI allows for me to disable Secure Boot, and therefore I should be able to revert to Windows 7, Linux, etc. (drivers may or may not be supported). When I insert my Linux Mint boot disc and try to boot from it, though, nothing happens. There isn't even a boot priority list in the UEFI settings (I can provide screenshots later). It just says "Windows 8 Bootloader" and also on the other tab it says "WINDOWS 8 BOOT OVERRIDE".  Has anybody purchased a Windows 8 machine and successfully installed Windows 7 or Linux on it? Understanding reference counting with Cocoa and Objective-C I'm just beginning to have a look at Objective-C and Cocoa with a view to playing with the iPhone SDK. I'm reasonably comfortable with C's malloc and free concept, but Cocoa's references counting scheme has me rather confused. I'm told it's very elegant once you understand it, but I'm just not over the hump yet.  How do release, retain and autorelease work and what are the conventions about their use?  (Or failing that, what did you read which helped you get it?) How do I figure out the right size font / text for a given read distance? Polygamma function series: $\sum_{k=1}^{\infty }\left(\Psi^{(1)}(k)\right)^2$ Applying the , I found: $$S=\displaystyle\sum_{k=1}^{\infty }\left(\Psi^{(1)}(k)\right)^2\lt\dfrac{2}{3}\pi^2$$ where $\Psi^{(1)}(k)$ is the polygamma function. Is it known any sharper bound for the sum $S$? Thanks. all the LaTeX-tutorials tell me how LaTeX is an extention simplifying the building of TeX documents. Understandably, no one uses plain TeX anymore, right?  But I seem to learn better when I grasp the link between TeX and LaTeX. Does someone have a link to example files in plain TeX? I'd like to know which commands, macros etc. are LaTeX-specific. How can I make a div not larger than its contents? Logical explanation why exponentiation operation is not commutative and associative Considering Peano axioms we'll define addition, multiplication and exponentiation operations.  We can then prove that addition and multiplication operations are commutative and associative. The proof for addition operation is pretty straightforward but for for multiplication it a bit more difficult. For example, to prove associativity, we have to prove distributivity first.  Moreover, for the definition itself it is not obvious that commutativity should take place, because the definition is not symmetric.  $a \cdot 0 := 0$  $a \cdot S(b) := a \cdot b + a$  Here $S(b)$ is the "next" function from Peano axioms  This definition is not symmetric with respect to $a$ and $b$, so commutivity is not obvious.  For exponentiation operation neither commutivity nor associativity take place. And I am very curious about the logical explanation why that happens  NOTE: The explanation I am looking for is somehow similar to a Abel–Ruffini theorem which explains WHY there is no an algebraic solution for a general polynomial equation When documenting location, should current or historical place names be used? When I am documenting records, do I use the name of a city or country as it is called today or as it was in the year an ancestor was there?  Related to: Are there any known uncountable transfinite increasing sequences of real numbers? The real numbers are uncountable, so assuming the axiom of choice there is at least transfinite sequence of real numbers $r_0, r_1, r_2, ..., r_\omega, r_{\omega + 1}, ..., $ up to (and possibly including) $r_{\omega_1}$ that contains an uncountable number of terms. However, it's not guaranteed that $r_0 &lt; r_1 &lt; ..., r_\omega &lt; ...$  Is there a known transfinite sequence of real numbers that is monotonically increasing and which contains uncountably many real numbers?  Thanks! I am performing a meta-analysis with 137 study arms. From each arm I have extracted a proportion of a disease. Here are my proportions:  [1] 0.002710027 0.000000000 0.000000000 0.000000000 0.017857143 0.000000000 0.010269576 0.000000000 0.000000000 0.000000000 0.000000000  [12] 0.010000000 0.053691275 0.052631579 0.070351759 0.000000000 0.108333333 0.262626263 0.013043478 0.000000000 0.007000000 0.000000000  [23] 0.000000000 0.000000000 0.240000000 0.000000000 0.033333333 0.000000000 0.000000000 0.000000000 0.000000000 0.013201320 0.000000000  [34] 0.005361930 0.002308403 0.000000000 0.000000000 0.000000000 0.030000000 0.046296296 0.000000000 0.020000000 0.045454545 0.161073826  [45] 0.000000000 0.000000000 0.000000000 0.095238095 0.007194245 0.001472754 0.000000000 0.000000000 0.000000000 0.000000000 0.012048193  [56] 0.000000000 0.048780488 0.000000000 0.086253369 0.033898305 0.011966701 0.004162331 0.062790698 0.005555556 0.004451039 0.287356322  [67] 0.083333333 0.000000000 0.000000000 0.014666667 0.006160164 0.023809524 0.000000000 0.000000000 0.000000000 0.001552795 0.102564103  [78] 0.030555556 0.000000000 0.000000000 0.000000000 0.000000000 0.029411765 0.000000000 0.000000000 0.000000000 0.000000000 0.000000000  [89] 0.003231018 0.000000000 0.037500000 0.040247678 0.000000000 0.000000000 0.007299270 0.014598540 0.000000000 0.015118790 0.000000000 [100] 0.000000000 0.005555556 0.000000000 0.000000000 0.000000000 0.003039514 0.042145594 0.250000000 0.307692308 0.324444444 0.002057613 [111] 0.008333333 0.000000000 0.027522936 0.022598870 0.000000000 0.000000000 0.000000000 0.135278515 0.033333333 0.000000000 0.000000000 [122] 0.003690037 0.003412969 0.000000000 0.017391304 0.004237288 0.033210332 0.000000000 0.008928571 0.038834951 0.030303030 0.142857143 [133] 0.170000000 0.000000000 0.112903226 0.000000000 0.007299270   A majority of the proportions has zero value. I am struggling with whether I should go for logit or arcsine transformation. One source says that arcsine transformation should not be used . On the other hand, I several zero counts. With logit transformation values 0 and 1 are mapped to infinity, and according to another source I should go with arcsine transformation . Furthermore, I found another study close to my topic in which they used arcsine transformation. The default in R with metaprop function is logit.   Which one I should go with my data? Email from IOS with attachments larger than 7.5Mb gets stuck in outbox and constantly tries to resend. Costs us hundreds in data fees Storage for Eldritch Horror Is there an optimal strategy for storing Eldritch Horror cards and tokens so that game play is facilitated.   I am not looking for answers that including "zip bags" and other things to keep the game element safer while is storage. Although, a strategy that works well for both cases will clearly be superior to one that only works for game play.  I am not limiting this to commercial solutions. I am quiet happy to build your custom made solution if you release the specification/plans of course!  Although, it it requires a 3D printer, more power to you. How can I make my laptop boot automatically from the hard drive without having to press F10 each time? I followed the instructions in  to   Once I installed Windows I found that I have to press F10 to select the hard drive every single time to make it boot into Windows. I tried re-enabling Secure Boot but then I am unable to find the hard drive in the bootable devices list.  What should I do?    my labtop is sumsang core i3  i mean that when i wanted to change my windows i can not find cd-rom in the list of F10 i saw the Instructions of this link    i Succeeded to do that and i changed my windows but then i can not go to windows automatically  I had to press F10 to select hard drive and i can go to windows i want To what it was before so I make secure boot (enabled) but I can't find hard drive on the list of F10.  maybe i Erred in doing my new windows  If i changed my windows again i can go to windows automatically or not  please i wait your advice and Instructions Why the statement "there exist at least one bound state for negative/attractive potential" doesn't hold for 3D case? Previously I thought this is a universal theorem, for one can prove it in the one dimensional case using variational principal.   However, today I'm doing a homework considering a potential like this:$$V(r)=-V_0\quad(r&lt;a)$$$$ V(r)=0\quad(r&gt;a)$$ and found that there is no bound state when $V_0a^2&lt;\pi^2\hbar^2/8m$.  So what's the condition that we have at least one bound state for 3D and 2D?