"Side effects", or "Side-effects"?
When should com­pound words be writ­ten as one word, with hy­phens, or with spaces?
Creating additional Virtual Host Ubuntu Server pkgloader is not finding l3regex If $X$ and $Y$ are independent $N(0,\sigma^2)$, then $X^2+Y^2$ and $X/Y$ are independent? If $X$ and $Y$ are independent, then $X^2+Y^2$ and $X/Y$ are independent? I was solving the problem for the case that $X$ and $Y$ are independent $N(0,\sigma^2)$.  So i found that $X^2+Y^2$ is negative exponential, $X/Y$ is Cauchy distribution. How can i prove that $X^2+Y^2$ and $X/Y$ are independent?  Also, what it will be if the case for general random variable $X$, $Y$ with  $X^2+Y^2$ and $X/Y$ are defined? What is the strict aliasing rule? When asking about , people sometimes refer to the strict aliasing rule. What are they talking about? latex : Exclude draftwatermark from specific pages I am using draftwatermark package. Is there any option to exclude watermark from some specific pages? Say no watermark from pg 3-4. I can not use xwatermark package. It conflicts with the geometry package of my document.  MWE:  \documentclass[12pt,a4paper]{exam} \usepackage{draftwatermark}  \usepackage{lipsum}   \SetWatermarkAngle{45}  \SetWatermarkLightness{.8}  \SetWatermarkFontSize{10cm}  \SetWatermarkScale{5}  \SetWatermarkText{\tt{12345}}  \begin{document}  \lipsum[1-20]  \end{document} I haven't been writing C for very long, and so I'm not sure about how I should go about doing these sorts of recursive things... I would like each cell to contain another cell, but I get an error along the lines of "field 'child' has incomplete type". What's up?  typedef struct Cell {   int isParent;   Cell child; } Cell; In Random forest algorithm, Breiman (author) constructs similarity matrix as follows:   Send all learning examples down each tree in the forest If two examples land in the same leaf increment corresponding element in similarity matrix by 1 Normalize the matrix with number of trees   He says:     The proximities between cases n and k form a matrix {prox(n,k)}. From their definition, it is easy to show that this matrix is symmetric, positive definite and bounded above by 1, with the diagonal elements equal to 1. It follows that the values 1-prox(n,k) are squared distances in a Euclidean space of dimension not greater than the number of cases.    In his implementation, he uses sqrt(1-prox), where prox is a similarity matrix, to convert it to distance matrix. I guess it has something to do with the "sqaured distances in a Euclidean space"-quoted above.  Can somebody shine a little light on why it follows that 1-prox are squared distances in a Euclidean space and why he uses squared root to get distance matrix? Using Image exportToDrive in Google Earth Engine? I want to export image to drive for my roi. For this i have specified a geometry(roi). But exported map doesn't cover the area specified and it's not showing the color palette. Is there any possible way to export a colored image (which shows in my layer) to Drive? Why it's not covering the region I have specified. Problem is in export.To.Drive section. But all the codes are given to check error that i did.  Code was:    var region = ee.FeatureCollection('users/karmakersourav/shape')   .filter(ee.Filter.eq('NAME_1', 'Chittagong'));   var addNDVI = function(image) {     var ndvi= image.normalizedDifference(['B4', 'B3']).rename('NDVI');     return image.addBands(ndvi);   };    var cloudMask = function(image) {     var clouds = ee.Algorithms.Landsat.simpleCloudScore(image).select(['cloud']);     return image.updateMask(clouds.lt(25));   };   // Select the land mask.   var landMask = function(image) {   var datamask = hansenImage.select('datamask');   // Create a binary mask.   var mask = datamask.eq(1);   return image.updateMask(mask);   };     // Load a Landsat collection, apply the NDVI and cloud/water masking functions over it.   var collection1 = ee.ImageCollection('LANDSAT/LE07/C01/T1_RT_TOA')     .filterBounds(region)     .filterDate('2008-01-01','2008-12-31')     .map(addNDVI)     .map(cloudMask)     .map(landMask)     .select('NDVI') ;   print(collection1);     //reducer   var annualNDVI = collection1.reduce(ee.Reducer.median());   var region_NDVI = annualNDVI.reduceRegions({     collection: region,     reducer: ee.Reducer.median(),     scale: 30 // the resolution of the dataset   });     var ndviParams = {min: -1, max: 1, palette: ['blue', 'white','green']};   var boundParams = {palette: ['black']};   Map.addLayer(annualNDVI.clip(region), ndviParams, 'NDVI', 1);    Map.addLayer(region, boundParams, 'LA', 1);    //here's the problem  Export.image.toDrive({    image: annualNDVI,    description: 'CTG_NDVi',    scale: 30,    region: roi,    fileFormat: 'GeoTIFF',    maxPixels: 1e12,    formatOptions: {       cloudOptimized: true     }   });     My imports was:  var image = ee.Image("UMD/hansen/global_forest_change_2015_v1_3"),       region = ee.FeatureCollection("users/karmakersourav/shape"),       hansenImage = ee.Image("UMD/hansen/global_forest_change_2015"),       roi = /* color: #98ff00 */ee.Geometry.Polygon(           [[[91.26571433292804, 22.382447200369512],           [91.70516745792804, 22.24015355729955],           [91.81503073917804, 21.50608889294255],           [91.99081198917804, 21.158146277513005],           [92.36434714542804, 20.74775339022756],           [92.38631980167804, 21.362918378188724],           [92.68868864595584, 21.285515736407884],           [92.66671598970584, 22.12251851402064],           [92.42501677095584, 22.964696114885136],           [92.43600309908084, 23.237540932485988],           [92.31515348970584, 23.620600408965007],           [92.21627653658084, 23.781555321668222],           [92.04049528658084, 23.691042604440895],           [91.90865934908084, 23.731278240693108],           [91.89767302095584, 23.47960242153599],           [91.75485075533084, 23.28800680321665],           [91.77682341158084, 23.08602889002461],           [91.61202848970584, 22.99503954262493],           [91.46920622408084, 23.277915158047364],           [91.34835661470584, 23.308187798303887],           [91.22750700533084, 23.600467103459394],           [91.28243864595584, 23.872005072934794],           [91.32638395845584, 24.082808607079368],           [91.24947966158084, 24.263221977268092],           [91.06271208345584, 24.223152164577193],           [90.73312223970584, 23.88205115062075],           [90.63424528658084, 23.660857737733508],           [90.54635466158084, 23.328365731356676],           [90.65621794283084, 22.83312931280329],           [90.98580778658084, 22.437667249990497],           [90.98580778658084, 22.071621721722586]]]); When closing a question as a duplicate, it is becoming harder and harder to search for a good original as the pool of questions and answers grows and grows.  While the new dupe closing dialog is a huge step forward, it doesn't always work - if you've spent some time on the site, you know there are perfect answers to many new questions but you can't always find them. Or can't be bothered to, as your time is limited.  A way to further improve this could be introducing a vote for canonical answers.  It could, for example, work like this:   Answers get a new icon, the "canonical vote" (signified here by a cannon because I can't think of anything that makes sense right now.)     Only users with a certain minimum rep (maybe 1k+ or 2k+) see this icon. The icon would work like the favourite icon: You can toggle it on or off at any time. The hover message for the icon could read e.g.      This is a "canonical answer": It answers the question asked in the most extensive and general way, and is very likely to benefit other users with the same problem.    Questions that contain an answer with three or more canonical votes get special  treatment:      They show up on the top in search results; maybe even under a special heading ("Questions with canonical answers")  They show up prominently in the "close as dupe" dialog (i.e. the canonical votes influence the metric that is used to determine the questions shown there).  There could be some rewards for users whose answers receive "canonical" votes - maybe a badge if ten of your answers get at least three canonical votes, or a counter of canonical answers in your profile. It would be really interesting as it's a badge that you can't game your way to, but this whole rewarding part is entirely optional.  would be a great safeguard against over-use of this feature.    Dupe (but sans cannon):       Related: On the one hand, I see very few posts in the review queue when I visit.  On the other hand, I see a lot of pretty awful first posts sitting on the front page.  This leads me to suspect that robo-reviewers are blowing through the queue.  Given how empty the queue is, could you please increase the number of people who have to check in before a post leaves the queue?  Of course, some honey-pot solution to detect and disable the auto-clickers would be even better. So in the first 5 or 6 books, it was very clear that the wand chooses the wizard and the power/level of the spells the wizard produces is based on the knowledge and skill of the wizard.  This is referenced by people constantly being telling Harry that he wasn't skilled enough to perform certain spells, or Bellatrix telling Harry that he needed to mean the Cruciatus curse for it to be effective.  However, in the 7th book, this entire idea is changed to the wand being the thing that's powerful and regardless of the wizard's/witch's skill or knowledge, he/she could still perform a very advanced spell if it's something the wand could handle.  Goyle accidentally creating a fire serpent is something that instantly comes to mind from the movies(I don't remember if that happened in the book).  So, my question is, what actually holds the power, the wizard/witch, or the wand? How can I get fireworks? What are the requirements for making fireworks appear at the end of a level in the original Super Mario Bros.? I'm looking for a single word, for someone who...   keeps seeing everything that is wrong with everybody else.  never seems to see the good of other people, only the bad things. points at others, as if he forgets he has weaknesses himself. does not brag about himself, he just seems to be dissatisfied with everyone else.   I prefer a word that is as unambiguous and clear-cut as possible. Prove that:$\int_{a}^{b} f(x) dx = b \cdot f(b) - a \cdot f(a) - \int_{f(a)}^{f(b)} f^{-1}(x) dx$ As the title asks, why didn't the basilisk bite received in the Chamber of Secrets destroy the Horcrux inside the bitten person?   Yes, I know Fawkes quite quickly healed the bite wound with his phoenix tears, but when Harry used the basilisk fang to destroy Tom Riddle's diary the destruction of that Horcrux was immediate. When Ron hit the locket with the Sword of Gryffindor, it was destroyed immediately. Although the destruction of the ring occurred off-page, Dumbledore used the Sword of Gryffindor to destroy it, so presumably, like the locket, it was gone right away. Nagini died straightaway when Neville decapitated her. The destruction of the Hufflepuff cup happens off-page. The diadem seems to have been destroyed by Fiendfyre immediately as well, as when Harry examined it outside the Room of Requirement it was already leaking a blood-like substance, and then it cracked in half. When Voldemort hit Harry with Avada Kedavra in the forest, Harry woke up in limbo with the last fragment of Voldemort's soul - that awful flayed baby-like being - separated from him immediately.   Is there a logical/canon-based explanation for why the fragment of Voldemort's soul residing in Harry wasn't destroyed upon Harry being bitten by the basilisk?  NOTE: I've read the HP Wiki's entry on Horcruxes; however, I find the HP Wiki to be inconsistent in its accuracy, so I'm hesitant to accept the Wiki's explanation on the matter. I'd prefer an explanation constructed from information in the books or a statement by JKR, or the like. How to migrate from test environment to production environment? The migration is from the local environment to the production environment. The production environment has run some time and created a lot of articles.   In order to add new things to my site, I added a custom theme and installed CCK, Views and other modules in my local test environment. Now that the local test environment is finished, how do I migrate it to the production environment, without destroying the content of its database? Invisible software updates list in Software Updater Beamer -- not indenting itemize in a single environment The output in the MWE posted at the end of this post is shown below. Notice how the default indentation from itemize gives an asymmetric slide w.r.t the spacing to the left and right of the itemize environment. How can I push the bullet points to the left so that the spaces to the left and right are the same? Such a solution would ideally be:   implementable on a one-off basis, so that it is applied when necessary (since some itemize environments should be given the default indentation) independent of the margin size, so that the solution doesn't need to be changed when the margin size is changed     \documentclass{beamer}   \begin{document}  \begin{frame}{A title} \begin{itemize} \item Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod \item tempor incididunt ut labore et dolore magna aliqua. \item Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi \item ut aliquip ex ea commodo consequat. \begin{itemize} \item Duis aute irure dolor in reprehenderit in voluptate velit esse \item cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat \end{itemize} \end{itemize}    \end{frame} \end{document} Lifting idempotents modulo a nilpotent ideal The problem is this:      Suppose $I \subseteq R$ is a nilpotent ideal and there is $r \in R$ with $r \equiv r^2 \pmod I$. Show $r \equiv e \pmod I$ for some $e \in R$ idempotent.   I have spent a few hours rolling around in abstracta with no destination. I believe that if I could write down a concrete example of this, the example could guide me through the abstract definitions and show me where to look for an idempotent in $R$. I have looked at 2x2 matrices and could not find any such examples. Might anybody have one? I have 20 to 3o computers on my network and I have a copy of the debian packages on /var/cache/apt/archives but when I take this downloaded copy to any other machine I need to hit an "apt-get update" , How do I avoid this ? Where is the list of packages which is updated by that command stored. I need to copy them as well, and use it on a computer which is completely offline.