Dynamically set local variable
How can you dynamically create variables via a while loop?
Adding tags to files in OS X: How to use, where are tags stored, and will they work on a network? Star rating in AJAX with Ruby On Rails Sort Order on Close Vote Queue The Close-Vote queue is large and growing. I searched for definitive information on how that queue is sorted for reviewers, and the nearest I could find is that it is randomized - but that post was some years old.  Would it be possible to sort on order of votes already received? That is, all questions with 4 votes to close are surfaced first (in random order) to reviewers? Questions with 3 votes would come up before ones with 2, etc. In that manner a given question gets out of 'will it close?' limbo faster.   This feature request would, in my opinion, be supportable if the majority of reviewer votes were going to single-vote questions. I cannot (I think) actually find these numbers. If this is the case, the majority of the work is going to an ever-increasing queue, and proportionally fewer votes are being resolved.  Note there are other distributions that could help get in this direction without being a strict ordering, like weighting the chance a given question is surfaced to a reviewer by the number of votes. However, for discussion purposes I thought I'd keep it simple.  Usual apology if this has actually been addressed. Search is sad-making. Using the definition of Riemann integrability, prove that $f $is Riemann integrable on $[0,1]$ The following problem came up on a test, and I didn't get it correctly. Please help me understand the problem.  Problem: Define $f:[0,1] \to \mathbb{R}$ by $$     f(x)=  \begin{cases}     1,&amp; \text{if } x=\frac{1}{n}\\     0              &amp; \text{otherwise} \end{cases} $$ for some integer n.  Using the definition of Riemann integrability, prove that f is Riemann integrable on $[0,1]$ and evaluate the Riemann integral $\int_{0}^{1} f(x)dx$.  My Solution:  Let $\epsilon&gt;0$ and $P$ be the partition of $[0,1]$ such that $P=\{0,\frac{1}{n}- \frac{\epsilon}{3},\frac{1}{n}+ \frac{\epsilon}{3},1\}$.Then note that   $U(f,P)=M_0\Delta x_0 +M_1\Delta x_1+M_2\Delta x_2=0+(\frac{1}{n}+ \frac{\epsilon}{3})-(\frac{1}{n}+ \frac{\epsilon}{3})+0=\frac{2\epsilon}{3}$ and   $L(f,P)=0$.   Thus, for every $\epsilon&gt;0$ $$U(f,P)-L(f,P)=\frac{2\epsilon}{3}&lt;\epsilon$$.  This is the prove that I gave and the mistake that I made was that I fixed n. Some important things that I noticed about this problem were that if you graph the function $f(x)$ most of the points fall to the left or close to zero and a fewer fall to the right. Hence, this makes me believe that I need a partition such that I capture most of the points near zero so that I am only left with a finite number of points close to 1. However, I can't seem to find this partition.Any help would be appreciated. In particular, I would like to know how you come up with the partition since I always struggle to come up with one. Thank you! I find that often after awakening from suspend on Ubuntu GNOME 16.04 with GNOME 3.20 (I have only found this issue on the latest version, though I have not tried with GNOME 3.18 on 16.04) that I get this strange font issue which can't be fixed by restarting gnome-shell and seemingly only by restarting my entire machine:            I do not believe that this is a theme issue as I have tried all the built-in themes (including the dark and light versions) and it is the same for them all. Though it does not seem to affect gnome-shell areas, that is the top-bar, the Activities Overview, etc, are not affected for some reason. So what could this issue be caused by and how can I fix or workaround it?  Information Update:  I have had a look at  but the only options in the gnome-tweak-tool for Antialiasing are Rgba, None, and Grayscale, but none of them seem to have any affect on the issue. Is there something I'm missing? I have a desktop (Ubuntu 13.04 &amp; Win 7 Home Premium) and a Laptop (Ubuntu 12.04), both having WiFi adapters. I also have a WiFi router connected to internet which both my computers can access.  I want to share files between my desktop and my laptop using WiFi (similar to Homegroup on Windows 7 but without using Ethernet cables).  How do I set-up that?  I want to share files using both OSs, if anyone have have information about sharing files with any of the OS please answer! Where did the "play on realms" option go? My Minecraft app now only has the option of "play" and there is no "play on realms" to be found!  I downloaded - and paid for - the multiplayer app, but there doesn't seem to be a way to get to any realms on that app either. Predicate Calculus Practice I've been doing some practice questions in the textbook for an upcoming predicate calculus lecture and I think I've managed to get A and B (possibly C) correct but I am clueless on how I can manage D and E.   For A I got: ∃x(R(x)∧¬B)  For B I got: ∀x(¬R(x)∧B)  For C I got: ∃x(R(x)∧(x=y))   - Not sure if this is even remotely correct    R(X) : ”X is rich”  X = Y : ”X equals Y”  B : ”Bill Gates”  a) Someone besides Bill Gates is rich.  b) Bill Gates alone is rich.  c) At least two people are rich.  d) Exactly one person is rich.  e) Exactly two persons are rich.  The universe of discourse is the set of all people. Cell copy results in jaggy, aliased output Non-numerical citation mark like [Str91] [Samar] [Tro77] "no such file or directory" message when deleting a file that exists on NTFS What is a deterministic method for evaluating a sensible buffer pool size? I'm trying to come up with a sane way to understand if the max server memory (mb) setting is appropriate (either should be lower, or higher, or stay the way it is).  I am aware that max server memory (mb) should always be low enough to leave room for the operating system itself, etc.    The environment I'm looking at has several hundred servers; I need a reliable formula I can use to determine if the present size of the buffer pool is appropriate since RAM is costed per GB allocated to each server.  The entire environment is virtualized, and "physical" RAM allocated to a VM can easily be changed up or down.  I have a particular SQL Server Instance I'm looking at now with a PLE of 1,100,052 seconds, which equates to 12.7 days (the amount of time the server has been up).  The server has a max server memory setting of 2560MB (2.5GB), of which only 1380MB (1.3GB) is actually committed.    I've read several items including one by Jonathan Keheyias () and another by Paul Randal (), and several others.  Jonathan advocates monitoring for a PLE below 300 per 4GB of buffer pool as being too low.  For the SQL Server Instance above, 300 * (2.5 / 4) = 187 results in a really really low target PLE below 300.  This instance has 290GB of SQL Server data (not including log files), and is only used for integration testing.  Assuming the last 12 days is representative of typical usage for this server, I'd say the max server memory (mb) setting could be lowered.  At the other end of the scale, I have another integration-test server with a PLE of 294, that has a max server memory (mb) setting of only 1GB.  This server has only 224MB of SQL Server data not including logs, and is running some BizFlow databases.  This server might benefit from a higher max server memory (mb) setting.  I'm thinking a good starting place for targets that might be assigned too much memory could include looking at:  SELECT      RamMB = physical_memory_in_bytes / 1048576     , BufferPoolCommittedMB = bpool_committed * 8192E0 / 1048576     , BufferPoolCommitTargetMB = bpool_commit_target * 8192E0 / 1048576     , PercentOfDesiredSizeMB = CONVERT(INT,(CONVERT(DECIMAL(18,2),bpool_committed)                              / bpool_commit_target) * 100) FROM sys.dm_os_sys_info;   If BufferPoolCommitTargetMB / BufferPoolCommittedMB is greater than 1, the server is not using the entire buffer pool.  If the machine in question also has a PLE of greater than "x" then it might be a good candidate for a decrease in max server memory (mb).  Since the Buffer Manager:Lazy writes/sec performance counter tracks the number of times SQLOS has written pages out to disk between checkpoints due to memory pressure, this might be another good thing to look at.  DECLARE @WaitTime DATETIME; SET @WaitTime = '00:00:15'; DECLARE @NumSeconds INT; SET @NumSeconds = DATEDIFF(SECOND, 0, @WaitTime); DECLARE @LazyWrites1 BIGINT; DECLARE @LazyWrites2 BIGINT;  SELECT @LazyWrites1 = cntr_value  FROM sys.dm_os_performance_counters dopc WHERE (         dopc.counter_name LIKE 'Lazy writes/sec%' COLLATE SQL_Latin1_General_CP1_CI_AS     )     AND dopc.object_name = 'MSSQL$' + CONVERT(VARCHAR(255),                SERVERPROPERTY('InstanceName')) + ':Buffer Manager';  WAITFOR DELAY @WaitTime;  SELECT @LazyWrites2 = cntr_value  FROM sys.dm_os_performance_counters dopc WHERE (         dopc.counter_name LIKE 'Lazy writes/sec%' COLLATE SQL_Latin1_General_CP1_CI_AS     )     AND dopc.object_name = 'MSSQL$' + CONVERT(VARCHAR(255),                SERVERPROPERTY('InstanceName')) + ':Buffer Manager';  SELECT LazyWritesPerSecond = (@LazyWrites2 - @LazyWrites1) / @NumSeconds;   The above code assumes the server is under load during the 15 seconds it takes to run, otherwise it will report 0; which might be a misleading false-negative.  Should I also look at PAGELATCHIO_* wait stats or some other wait type as an indicator of memory pressure, or lack thereof?   My question is, how can I reliably determine a "good" target value for PLE and max server memory (mb)? What the matter is vs. what is the matter used in the affirmative I want to know what the matter is with her.  I want to know what's the matter with her. I want to know what's her problem.   Is "I want to know what's the matter with her" and 'what's the matter'  incorrect as Cambridge dictionary suggests (). In their explanation it is suggested that the word 'matter' be replaced with 'problem' as is written in the 3rd example.    Thanks for whatever help you can provide on this.  I've read Rathony's link and agree that his link answered the question about inversion. Now my question is specifically about the correctness of using this wording and if it is correct is there a rule in its usage. Screen goes white when posting a comment What is the difference between CurrentCulture and CurrentUICulture properties of CultureInfo in .NET? In .NET there is the CultureInfo class in the System.Globalization namespace. It has two similar properties both returning values of the CultureInfo type: CurrentCulture and CurrentUICulture.  What is the difference between them?   Which one should I use when and why? Is the Macbook 12 inch's USB-C charger interchangeable with other USB-C chargers or devices? If there is only the Macbook 12 inch USB-C charger nearby, can it be used to charge other USB-C devices, such as any Android phones that also use USB-C? (will it be "too powerful" and damage other devices?)  Vice versa, if there is a Quick Charge 2.0 or 3.0 USB-C charger from other devices nearby, can it be used to charge the Macbook 12 inch?  The main concern is about whether it could damage the device or battery. When deriving the quadratic equation as shown in the  () the main proof contains the step: $$ \left(x+{\frac {b}{2a}}\right)^{2}={\frac {b^{2}-4ac}{4a^{2}}} $$ the square root is taken from both sides, so why is  $$\sqrt{4a^2} = 2a$$  in the denominator and not $$ \sqrt{4a^2} = 2\left |a  \right | $$ Could somebody explain this to me? Thank you very much How to achieve this smudge effect in photoshop? What is the typical post processing work flow for amateur photographers? I love photography; I hate postprocessing.  Seeing that I am an amateur, not just by virtue of not getting paid for it, but also being rather new to the whole affair, I already am used to most of my shots just not being that great. While reading blogs and websites I get the impression that condensing ~100 frames in maybe a handful of shareworthy photos is not rare.  But even so, after a vacation quite a few photos have accrued. What is a common workflow to sort, post-process and share photographs for a beginner? What are common postprocessing steps? What kind of automations do people use?    Edit: I phrased the question generically so that it can be of use to as many people as possible. But I understand that without anything to go by, it might be a bit hard to answer. Therefore, while I own no paid-for software, this is what I use:   I have an EOS 500D crop camera as picture source and I use  for development,  for any touching up I need to do. (Which is not much, so far.)  (in a VM) is my photo catalog. My destination is my Flickr stream for the most part, sometimes I send photos directly to family and friends.   On the input side, I mostly am in practice mode; shooting whatever I can place in front of my lens. I have not yet picked a specialty. I would like to minimize time spent fine-tuning photos in software. These sort of "batch processes" are a part I realize is important, but not much fun to me.  I am quite computer-literate, so I am not afraid of piecing together tools that can be of use, but the more "" this can be, the more people who don't spend their life in front of a PC can benefit too. :) If spending money on something will make my life easier, I am quite willing to consider it. However as photography does not bring any income, something as large as Photoshop (for example) is somewhat hard to justify as an investment. For natural numbers $a$ and $b$, show that $a \Bbb Z + b \Bbb Z = \gcd(a, b)\Bbb Z $ For natural numbers $a$ and $b$, show that $a \Bbb Z + b \Bbb Z = \gcd(a, b)\Bbb Z $  I just basically said that the gcd of a and b { written as C } obviously divides aZ and bZ, therefore it can be rewritten as  CdZ + CeZ -> C[dZ + eZ] -> CZ[d+e] where Cd=a and Ce=b.   if a and b and C are natural numbers, then  so are d and e. the sum of d and e is an integer, that when multiplied by an integer produces an integer. therefore  CZ[d+e] = CZ, so aZ + bZ = GCD(a,b)Z  { Where C is the gcd(a,b) }