Find two numbers $ a$ and $b $ such that the digits of b are the same digits as a in another order and the number $a − b$ has all the digits equal to $1$?  What I thought:  A first natural serial thought where each digit of the corresponding $ a $ number in the $ b $ number is one more, but when we have to put the largest $ a $ digit in $ b $ we realize that subtraction is not possible to give $ 1. $. So another idea is to use the next digit in your favor. For example, when we subtract $ 80 - 79 = 1 $, because if we weigh the subtraction of each house individually, we realize that $ 0 $ uses a dozen of $ 8 $ to subtract it. Thinking this way and doing some examples to get a better view we get the desired $ a $ and $ b $ numbers. Let $ a = $ $987654320$, $ b =$ $ 876543209 $. It is easy to see that $ a $ and $ b $ have the same digits and they are not in the same order. It is also evident after subtracting that reasoning makes sense, since $ a - b = 111111111 $.  I don't know if I could clearly show my thinking.

What is the smallest positive integer $n$, such that there exist positive integers $a$ and $b$, with $b$ obtained from $a$ by a rearrangement of its digits, so that   $a – b = 11\dots 1$ (The number of '$1$'s equal to $n$)?   Is there any example that can satisfy the equation?


I am trying to use command blocks to set up a team death counter for my friends server. We wanted to have a scoreboard that just displays how many deaths a single team has.  I currently have the scoreboards set up with a death objective which counts how many deathcount of each individual person and displays it under their name. I wanted to try using command blocks to set dummy scores on dummy players to be the sum of the deaths each member on the team has.  This is my first time doing command blocks, so if there is a better way to achieve what we want, then it is more than welcome

I am trying to make it to where points for teams are shown in the scoreboard but I can only manage to get player names on there, what command do I use? On 1.16


Can anyone tell me why the following code error?  My guess is, the inner function is somehow detecting a 'new' variable declaration, (i have 'x' on a left side on inner() ).  While it fails because this 'x' appears first on the right side. Is this correct? Am I wrong expecting it to behave normally (i.e Increment the value of x).  In any other context, x can be accessed from the inner function. The only problem happens if I ever put that x on a left side.  def outer(x):     def inner():         x = x + 1         return x     return inner()  outer(1)   UnboundLocalError: local variable 'x' referenced before assignment

What exactly are the Python scoping rules?  If I have some code:  code1 class Foo:    code2    def spam.....       code3       for code4..:        code5        x()   Where is x found?  Some possible choices include the list below:   In the enclosing source file In the class namespace In the function definition In the for loop index variable Inside the for loop   Also there is the context during execution, when the function spam is passed somewhere else. And maybe  pass a bit differently?  There must be a simple reference or algorithm somewhere.  It's a confusing world for intermediate Python programmers.


So... I'm making yet another video. And I want to recreate this effect:  (its in the first 15 seconds) So I have kinda the general idea of how to do this, which may be complete reduntant. My thought is to have 2 planes scaled out on the x axis and y axis, and animate their location, than to put the scene into VSE or MCE, and have video #1 be in the top left, video #2 in the top right, and so on. And I think if I could somehow parent a mask to an empty that is parented to the plane, that would work.   So my question is how do I parent a mask point to an object? Any help GREATLY appreciated!!!  EDIT: Ok, so I'm realizing that parenting masks to an object isn't really going to work. I'm going to use objects in the 3D scene and use the alpha layer to do the masking. But I don't know how to use just the alpha in the VSE. Help?

I'm trying to achieve the merging of multiple video strips like in the following . I think the clip has been animated with a vertical strip.    Could this animated area be achieved with masks in Blender?  If so, how would I go about achieving an animated visible video area, over another video?


I have a Python 3.2 script that I'd like to package for Ubuntu and Debian. I've certainly looked for documentation but I wasn't sure that I was getting the latest and greatest/easiest methods.  If someone with enough knowledge could please point me to the most recent guide on how to do this, it would be very useful to me.  Additionally, given a bit of what I have seen I might need a setup.py file too? If so I need to learn about that too.

I have a single python script that I want to distribute as a deb package. It is a  which shows local date in Unity panel. I did follow  but I could not create a deb package because it fails.   Can someone give me a step-by-step instruction on what I should do? As far as I know this script depends on python-appindicator.   NOTE: I do not want any links to Debian/Ubuntu packaging instructions. I have seen most of them. I don't find them beginner friendly.


I do not want the section numbered, i.e., Roman number I. (as the following figure show). How can I do this?

How would I get rid of the date, and the numbers 1 and 2? My latex code is below. I cant post images as Im a new user, sorry!  \documentclass[10pt]{article}   \begin{document}  \title{Banana Cake} \maketitle   \section{Ingredients}  \begin{itemize}   \item The first item   \item The second item   \item The third etc \end{itemize}  \section{Method} \begin{enumerate}   \item The first item   \item The second item   \item The third etc \end{enumerate}    \end{document}


Let $X = \{1, 2, 3\}$, and let $S = \{(a,b,c,d): a,b,c,d \in X, \text{and each element in X appears at least once in a,b,c, or d}\}$. How can I find $|S|$?  In other words, if I have a set $X$, and a set $S$ of 4-ary sequences over $X$, and in each sequence all elements in $X$ appears at least once, how do I count the sequences in $S$? How can I count similar sequences of different lengths?

Mr. Jones has three shirts: Red, Green and White. Each day he picks randomly a red shirt with probability of $\frac{1}{2}$, green with probability of $\frac{1}{3}$ and white with probability of $\frac{1}{6}$.     What is the probability that he wears all three shirts after 6 days?   My try:   $$\binom{6}{1}\binom{5}{1}\binom{4}{1}\frac{1}{2}\cdot\frac{1}{3}\cdot\frac{1}{6}\cdot[\binom{3}{2}(\frac{1}{2})^2\cdot[\frac{1}{3}+\frac{1}{6}]+[\binom{3}{2}(\frac{1}{3})^2\cdot[\frac{1}{2}+\frac{1}{6}]+[\binom{3}{2}(\frac{1}{6})^2\cdot[\frac{1}{2}+\frac{1}{3}]+\binom{3}{1}\binom{2}{1}\frac{1}{2}\cdot\frac{1}{3}\cdot\frac{1}{6}]$$  First, we pick possessions for red, green and white. Then, we multiply it by the other combinations possible of the other three possessions left, and summing it up (I didn't count all possibilities). The problem is the answer is bigger than 1, so it must be wrong. Also, I guess there is more elegant way.  Thanks in advance.


In 3.5e, there's the permanency spell, which makes other spells permanent. There isn't a spell like this in 5e, but there are ways to make specific spells permanent, usually by casting it in the same spot every day for a year. In this way, the need for permanency has been reduced, but it still would have some uses, like creating a permanent detect thoughts aura.   Have the designers given any reasoning as to why this spell did not make it through editions? Absent of that, is there a consensus in the community that has been reached (e.g. "It would have been too powerful")?

As the title asks, I'm curious about why the permanency spell isn't in 5e. It's not in the PHB, DMG, or any forum page on the interwebs. It's been incorporated into various spells like  or , but what about other spells/effects/conditions?  Anyways, I'm wondering if anyone from Wizards has released any info on this matter. Interview, Twitter, Supplement?


If I had a set of measurements ,eg : $[10.0,11.0,11.5]$ and they each had a relative uncertainty of $10$% meaning my values are now $[10.0±1.0, 11.0±1.1, 11.5±1.15]$ how would I find the average of their uncertainties? Id think either one of two situations:   I simply add their uncertainties so that my new average value becomes $10.83±3.115$ I add their uncertainties and then divide by the total number of measurements like I would when finding the mean of the measurements themselves. So my new average value $10.83±1.08$   Which one of these situations would it be? Would it be something entirely different?  Cheers

The following is taken from a practice GRE question:     Two experimental techniques determine the    mass of an object to be $11\pm 1\, \mathrm{kg}$ and $10\pm 2\, \mathrm{kg}$.    These two measurements can be combined to    give a weighted average. What is the uncertainty of the weighted average?   What's the correct procedure to find the uncertainty of the average?  I know what the correct answer is (because of the answer key), but I do not know how to obtain this answer.


I have this in my init.el:  (global-set-key (kbd "C-h") 'backward-delete-char)   Matlab mode resets my global setting back to "help", and I can't get to use "local-set-key" in the buffer - it doesn't end key sequence when I press C-h, waiting to input of the next character (C-h-).  Is there a way to interactively fix it?

How can I set a key binding that globally overrides and takes precedence over all other bindings for that key?  I want to override all major/minor mode maps and make sure my binding is always in effect.  This of course doesn't work:  (global-set-key "\C-i" 'some-function)   It works in text-mode, but when I use lisp-mode, C-i is rebound to lisp-indent-line.  I can go through and override this binding in lisp-mode and in every other mode individually, but there must be an easier way.  Every time I install a new mode for a new file type, I'd have to go back and check to make sure that all of my key bindings aren't being overridden by the new mode.  I want to do this because I want to emulate bindings I've already learned and ingrained from other editors.


im trying to install software center in kali linux but every time it was giving me error Package  has no installation candidate

It shows this error  oot@kali:~# apt-get install software-center Reading package lists... Done Building dependency tree        Reading state information... Done Package software-center is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'software-center' has no installation candidate


Why am I getting this error in the following:  template<typename T,typename Y> class MyContainer {         std::vector<T> list; public:          void append( T&& elem) ; };  template<typename T> void MyContainer<T,int>::append(T&& elem) {         list.push_back(elem); } int main() { }      error: invalid use of incomplete type ‘class >MyContainer’   void MyContainer::append(T&& elem)   I initially thought that, what if someone passed a second template parameter as double, it won't work, so I need to provide a non specialized member function definition first and may be on top of that I can provide partial specialization.  But even after adding the below I still get the same error:  template<typename T, typename Y> void MyContainer<T,Y>::append(T&& elem) {         list.push_back(elem); }

The following code:  template <typename S, typename T> struct foo {    void bar(); };  template <typename T> void foo <int, T>::bar() { }   gives me the error  invalid use of incomplete type 'struct foo<int, T>' declaration of 'struct foo<int, T>'   (I'm using gcc.) Is my syntax for partial specialization wrong? Note that if I remove the second argument:  template <typename S> struct foo {    void bar(); };  template <> void foo <int>::bar() { }   then it compiles correctly.


Let $G$ be a finite, nonempty set with an operation $*$ such that   $G$ is closed under $*$ and $*$ is associative Given $a,b,c \in G$ with $a*b=a*c$, then $b=c$. Given $a,b,c \in G$ with $b*a=c*a$, then $b=c$.   I want to prove that $G$ is a group, but I don't know how to show that there exists an identity $e\in  G$ such that $e*x=x$ and $x*e=x$ $\forall x \in G$. I also don't know how to show that $\forall$ x $\in G$ there exists a $y \in G$ such that $y*x=e$ and $x*y=e$. How do I do this?

Let $G$ be a non-empty finite set with an associative binary operation so that cancellation law holds, i.e. $ab=ac$ or $ba=ca$ implies $b=c$, for any choices of $a,b,c$ in $G$. Assume that there is an identity element $e$ in $G$. Show that $G$ is a group.  Proof: To show $G$ is a group, conditions must hold. Suppose that $ab=ac$, then $b=eb=(a^{-1}a)b =a^{-1}(ab)=a^{-1}(ac) =(a^{-1}a)c=ec=c$. So left cancellation holds in $G$.  2) Suppose $ba=ca$, then $b=be=b(aa^{-1}) =(ba)a^{-1}=(ca)a^{-1} =c(aa^{-1})=ce=c$. So right cancellation holds in $G$.  3) If $a$ exists in $G$ then $aa^{-1}=a^{-1}a=e$, where $a$ is an inverse of $a^{-1}$. Since inverses are unique, $(a^{-1})^{-1}=a$.  4) Let $x$ be the inverse of $ab$. Then $(ab)x=e$. By associativity we have $a(bx)=aa^{-1}$. Through left cancellation we have  $bx=a^{-1}bx=ea^{-1}=b(b^{-1}a^{-1})$ and $x=b^{-1}a^{-1}$.  Thus $(ab)^{-1}=b^{-1}a^{-1}$. So all conditions hold, $G$ is a group.  Is this proof correct? I know to show $G$ is a group these conditions have to be met. This is all I have to show right?


I’m typing in the command:  /give @p lever 64 0 {can_place_on : [“minecraft:iron_block”]}   and it keeps on coming up with:      line 1 column 2 missing ‘}’ or object member name    I don’t see what I’m doing wrong

Often, when making a command block contraption, you need to set an entity's data tag. These tags can sometimes be very long, with many layers of nested curly and square brackets. For example, this is the command to summon a villager with a single custom trade:  /summon Villager ~ ~ ~ {Profession:3,Career:2,Offers:{Recipes:[{buy:{id:minecraft:diamond,Count:6b}},sell:{id:minecraft:diamond_hoe,tag:{ench:[{id:16s,lvl:10s}]}]}}   The single-line command block interface of Minecraft makes it incredibly difficult to find and fix errors, especially when it comes to mismatched brackets. In fact, for illustration purposes, I put an error in the above command.  What techniques can I use to find and fix unbalanced square or curly brackets when writing long and complicated data tags?


My question detected as a similar question, and the similar answer is to throw your SD in the garbage! I want to update my question by asking, what happens technically when a microSD card happens to act like that? It is totally readable, but not changeable, either delectable or formattable. It turned to a stone slab with carved data on it. I recently trying to format and reuse a microSD card, which turned to "Secure Digital Storage Device" by an android phone 7.1 version. The data on the card is available and totally accessible but every moment I want to delete a folder it is automatically recovered. Even when I used it on the desktop, I did not insert it into the phone. Every possible solution in links like below turned out to not work.  I used many ways to solve this issue, which provided with other websites, they all failed to work: Diskpart Format, Use the Registry. Please note that I don't want to use third-party software. please do not post solutions like that. I am curious how this card is so undeletable, I can use it for other purposes, and this discussion open for your explanation. but for now, I want a method to simply reuse my micro sd as an ordinary sd card

I have, not one but two microSD cards that my phone (Samsung Galaxy Young, Gingerbread OS) seem to have broken. One is 1GB and the other is 2GB. The 1GB one won't be formatted.  When I put the 1GB one into the computer the computer prompts for a formatting. I don't care for the content so I tried to format it, but to no avail; the format fails and I have no idea what to do to make it work again.  I tried using the SDformatter software, but it can't format the card as it is write protected. I'm googling to solve it but so far no success.  My computer OS is win7 if that's of any relevance.


From what I understand, in calculating  $$\sigma^2 = \frac{\sum (X - \mu)^2}{N}$$  the only reason why the squaring is done is to make distance from mean always positive.  So my question, why couldn't we do something like this  $$\sigma = \frac{\sum \left|X-\mu \right|}{N}$$  instead?

The variance of a random variable $X$ is defined as $E[(x-\mu )^2]$. Why can't it be defined as $E[|x-\mu |]$. i.e., What is the basic idea behind this definition. Thank you.


I occasionally see things like:  cat file | wc | cat > file2   Why do this?  When will the results (or performance) differ (favourably) from simply:  cat file | wc > file2

A lot of command-line utilities can take their input either from a pipe or as a filename argument. For long shell scripts, I find starting the chain off with a cat makes it more readable, especially if the first command would need multi-line arguments.  Compare  sed s/bla/blaha/ data \ | grep blah \ | grep -n babla   and  cat data \ | sed s/bla/blaha/ \ | grep blah \ | grep -n babla   Is the latter method less efficient? If so, is the difference enough to care about if the script is run, say, once a second? The difference in readability is not huge.


I am currently unable to boot my ubuntu and am currently writing on my dual-booted windows 8.1.  I'll quickly wrap-up what I did before.   got ubuntu 13.04, played around a bit. Installed nvidia drivers, readonly-mounted an earlier SSD with Windows 8 on it after this I got a whitescreen and thought I'd better go with ubuntu 12.04 can't boot it, getting a black screen.   What I already tried:   reinstalling 12.04 (didn't change anything) running boot-repair (didn't change anything) running it with "nomodeset" in grumb vs. nvidia problems (didn't work, couldn't get any further)   So what I got now is the URL from boot-repair  and I also managed to check out my ubuntu partition in windows (boot.log is empty but a "dmesg"-file has some information, but I don't know wheter how or if at all to share that).  Thanks for any attempt in helping me.

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


I think I might've accidentally removed the main Ubuntu repository after trying to remove a different repository. In the attached screenshot it shows what repositories I have, am I missing any? If I am, what would be the command to add it back?

There are now errors when updating and I cannot install most software due to a corrupted  /etc/apt/sources.list   file. Is there a copy I can download to replace it?  The file would be for Ubuntu 12.04 (Final Beta) in the United States.


He is good looking. He is looking good.   How to understand "looking" in the first sentence? Is it exactly the same meaning as in #2?

I have been told that 'you look good' is the perfect compliment to give. Because 'you are looking good' is not colloquial. How correct is it?  For example, if I have to ask others about myself:   How do I look? How am I looking? (This would be incorrect I guess)   Having said that, I've come across 'you're looking good / nice' kind of dialogues in English movies.   How to differentiate the uses of both?


Is $|P(\mathbb{N})| = |\mathbb{R}|$?  If so, what is the argument?  I know that the cardinality of the power set greater than the cardinality of the natural numbers, and I assume that the cardinality of the power set of the natural numbers is smaller than that of the power set of the real numbers, though I have not been able to prove this to myself definitively (it simply seems intuitive that the power set of a countable set is smaller than the power set of an uncountable set).  The two approaches that I have considered have been:  (1) Create a bijection between $P(\mathbb{N})$ and $\mathbb{R}.$  (2) Show that there exists no uncountable set smaller than the power set of the real numbers.

What is the simplest way of proving (to a non-mathematician) that the power set of the set of natural numbers has the same cardinality as the set of the real numbers, i.e. how to construct a bijection from $\mathcal{P}(\mathbb{N})$ to $\mathbb{R}$?


new Date("6/18/2014") !== new Date("6/18/2014");   returns true  new Date("6/18/2014") === new Date("6/18/2014");   returns false  moment(datestring) returns the same as above.  How can this be and what is wront with the date comparisons.

Can someone suggest a way to compare the values of two dates greater than, less than, and not in the past using JavaScript? The values will be coming from text boxes.


I am trying to overlap two SVGs that were previously one SVG - I just separated the layers so I would have more control. Here is my code: <Grid container direction="row" justify="center" style={{ height: '90vh', paddingTop: 80, backgroundImage:`url("/media/bg/bg-2.svg")`, backgroundSize:'cover'}}>                     <Grid item sm={5} style={{ color: 'white', maxWidth: 500, paddingTop: 140 }}>
 Lorem Ipsum

                             Lorem Ipsum
                     </Grid>                     <Grid item sm={6}>                                                                                </Grid>                 </Grid>   My aim is to get the two SVGs sitting on top of each other like  I am aware that it may be a SCSS/CSS problem, but no idea what kind of code would give me the desired results. All help greatly appreciated :)

I want to overlay one image with another using CSS. An example of this is the first image (the background if you like) will be a thumbnail link of a product, with the link opening a lightbox / popup showing a larger version of the image.   On top of this linked image I would like an image of a magnifying glass, to show people that the image can be clicked to enlarge it (apparently this isn't obvious without the magnifying glass).


My gdm login screen looks like this:     not like:    How to make it took like the second image?

I was wondering if it is possible to get the GNOME 3.2 GDM login theme working on Ubuntu 11.10. I installed GDM alongside LightDM, but the GDM greeter is really ugly.


I am trying to solve an equation for a project that I am undertaking. The equation is very long and its probably not necessary to show it all here. Most of the equation is fairly straightforward; i.e., $1+(\frac{w}{W})(\frac{d}{t})$, etc. but at the very end it reads $\left(1+\frac{w}{W}\right)\left(\frac{D}{T}\right) \cdot \frac{1}{T}$.        $w$, $W$, $D$, and $T$ are all either constants or variables that I have solved already. My question is, what is the "$\cdot$" symbol asking me to do?  In the equation in the book, the "$\cdot$" is in the centre of the dividing line between $1$ and $T$, as opposed to down low like a period or full stop. I appreciate that I have phrased this question in an awkward manner, but as is obvious, I am no maths expert.  Here is a photo of the equation in the book:

I just went to a site to practise some maths as I am studying some maths on my OU course in computing and IT and I ran into some symbols that I did not understand  The questions were   solve $16+14/2+3\cdot 5-11$ (the point was placed halfway between the top and bottom of the numbers) $(11-5)\cdot (63-59+6)/12$, once again point is halfway between top and bottom   Can someone explain what this means if it is different to a decimal point?  Also this symbol was used in other questions $|$ and I was wondering what this meant as well  In context it was the number $-5$ can be written as and one answer was $|-5|$ and another choice was $-|-4|-1$


Can anyone can help me to know if need to install a driver in my notebook, and where to check to see what drivers are available to be installed?.

I've just installed Ubuntu and I need either video, wireless, or some sort of other manufacturer (non-opensource) driver. How can I run the tool that will fetch all of these for me? I'd like graphical instructions.  Related:


Can anyone tell me how long it will take a moderator to give details about a flag? Can a moderator roll back my reputation, if I am downvoted by mistake?

When we flag questions and answers as spam, abuse or requiring attention, how exactly do the moderators use the information? I'm guessing there's a shared queue somewhere that moderators can all see. Is there some method of knowing whether something that has been flagged has been addressed yet? How do you make sure that two moderators swooping down to fix an edit war don't get into an edit war with each other? How do you see and use the details we enter when we flag a post as requiring moderator attention? Do you see the name of the user who submitted the report, or just the report? Can we see a screenshot of the flag queue? I guess the whole flagging mechanism seems pretty opaque. I'm hoping a moderator can outline the details of what they do with the reports. I know we have the details of , but I'd find it easier to use if I knew what is done with it.


I am creating a table for bookmarks in my database as the following picture, the bookmark can be on a place or an event,  then it can be be regular user or by business user:  e.g.  business user with id (1) made a bookmark on place id (1) e.g.  business user with id (2) made a bookmark on event id (6)  in such a way my table contains the following indexes to allow only for single bookmark for place or event by any user.  Table structure with indexes   but then the table looks like this when I insert values for bookmarks:    my question is what is the effect on storing a table like this on database, can I improve the table structure without making many small tables of it?

What exactly does null do performance and storage (space) wise in MySQL?  For example:  TINYINT: 1 Byte TINYINT w/NULL 1 byte + somehow stores NULL?


I have a point feature class with 130 rows that represent the vertices of a trail I generated. I calculated the z height for each verticy/row. Now what I want to do is calculate the elevation change from one row to the next.      so I want to add a new field called, Z change with the number being how many feet from the below row to the above one.

I'm trying to calculate an angle between points using a field calculator.  Is it possible to reference the previous or next FID with reference to the current one using the field calc?   Eventually I'd like to have an angle between the next and previous point be input into a field for the current point - like shown below


I use Maven to create WAR of my JEE Application.  Here my pom.xml   <finalName>myproject</finalName> <sourceDirectory>${basedir}/src</sourceDirectory> <plugins>   <plugin>     <groupId>org.apache.maven.plugins</groupId>     <artifactId>maven-war-plugin</artifactId>     <version>2.5</version>     <configuration>         <warSourceDirectory>WebContent</warSourceDirectory>         <failOnMissingWebXml>false</failOnMissingWebXml>         <outputDirectory>/var/www/myproject/webapp</outputDirectory>     </configuration>       </plugin>    <plugin>      <inherited>true</inherited>     <groupId>org.apache.maven.plugins</groupId>     <artifactId>maven-compiler-plugin</artifactId>     <version>3.2</version>     <configuration>       <source>1.8</source>       <target>1.8</target>     </configuration>   </plugin> </plugins>    The generated WAR is copied in output folder defined in pom.xml (/var/www/myproject/webapp) but then i want to unpack it before launch my server (Tomcat).  How can i do?  Thanks, Lorenzo

I have a Maven pom that uses <packaging>war</packaging>.  But actually, I don't want build the war-file, I just want all the dependent jars collected and a full deployment directory created.  So I'm running the war:exploded goal to generate the deploy directory:  <plugin>     <groupId>org.apache.maven.plugins</groupId>     <artifactId>maven-war-plugin</artifactId>     <executions>         <execution>             <phase>package</phase>             <configuration>                 <webappDirectory>target/${env}/deploy</webappDirectory>                 <archiveClasses>true</archiveClasses>             </configuration>             <goals>                 <goal>exploded</goal>             </goals>         </execution>     </executions> </plugin>   The trouble is, the war file still gets built.  Is there a simple way of having <packaging>war</packaging> execute the war:exploded goal instead of the war:war goal?  Or is there another simple way to do this?


I'm new to Blender. I did the donut and cup (blender guru). When I render, the glass cup is pixelated. Why is that? I have a Nvidia Quadro RTX 3000 graphic card. Also, the menu on the bottom right hand side i.e. texture, light, render etc., it's all huge now. I don't know what happened.

I know that this question is a bit old or maybe overdone, but I'm running the latest edition of Blender and when I use the Cycles engine I get really fuzzy results and I can't find a simple, non-compromising solution to the quality.  I don't know exactly what I'm doing wrong here, but I'm sure others share my frustration.  Leaving everything in default settings, I started a new project and switched to the Cycles render.  I duplicated the cube and set colors for two Diffuse BSDF shaders, then went ahead and made walls and a floor all sharing the same diffuse shader.  I made two windows to emit blue light.  The screenshot has gaps between the walls because of the setup:  I'm aware that it's considered very incomplete and many have come to terms with some amount of noise, but is this normal?  Furthermore, with default settings or not, I can't change the amount of noise produced.  Supposedly, using "progressively refine" in the rendering tab should make it refine itself indefinitely, however Cycles only counts to 10 refines and then stops, creating a render which is a pixel-perfect match of the ordinary rendering method when it's completed.  I understand that there are tricks that can be used to reduce noise, but at the cost of extra processing time and usually small quality conflicts, like blurring.  My question essentially boils down to is this Cycles' current limit?


suppose you have a data set having 3 columns: ID, user, date.  is it possible to filter the data based on the minimum date even if some of the rows have identical IDs?  sorry if the question is a bit unclear. hopefully the image below  will help clear things.  there are two records having ID=1, with different users as well as dates. what i want to retrieve is the record having an ID=1, USER=A, DATE=2013-01-20 because its date is earlier than that of the second record (ID=1, USER=A, DATE=2013-01-21)  i want to achieve the same effect for the three records having an ID=2. the desired record is ID=2,USER=C,DATE=2013-10-20  basically i want to group these records by their IDs and then from that grouping, get the one with the lowest date

What is the best way to remove duplicate rows from a fairly large SQL Server table (i.e. 300,000+ rows)?  The rows, of course, will not be perfect duplicates because of the existence of the RowID identity field.  MyTable  RowID int not null identity(1,1) primary key, Col1 varchar(20) not null, Col2 varchar(2048) not null, Col3 tinyint not null


Alright, so my friend and I are setting up a new website. We expect heavy DDoS attacks, so our plan is to use nginx to proxy from various cloud servers so that people can't find our actual server's IP.  However, we need to link all these proxy servers up to one domain, so that when the domain (we'll say domain.com) is requested, it chooses a proxy server to send the user to and sticks them there. It also, however, needs to check if the server it's sending the user to is actually up and running (and has internet connectivity). If the server it's sending the user to is under attack, it kind of defeats the purpose of the proxy servers in the first place.  Any idea on how to do this?

This is a  about DoS and DDoS mitigation.   I found a massive traffic spike on a website that I host today; I am getting thousands of connections a second and I see I'm using all 100Mbps of my available bandwidth.  Nobody can access my site because all the requests time out, and I can't even log into the server because SSH times out too!  This has happened a couple times before, and each time it's lasted a couple hours and gone away on its own.  Occasionally, my website has another distinct but related problem: my server's load average (which is usually around .25) rockets up to 20 or more and nobody can access my site just the same as the other case.  It also goes away after a few hours.  Restarting my server doesn't help; what can I do to make my site accessible again, and what is happening?  Relatedly, I found once that for a day or two, every time I started my service, it got a connection from a particular IP address and then crashed.  As soon as I started it up again, this happened again and it crashed again.  How is that similar, and what can I do about it?


I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


In my web application, I am importing and exporting users to/from the application. So, for that I would like to have a single word to generally represent 'Import/Export process'.   I've gone through . But it is talking about business trading and all. I'm not expecting that meaning for it.  So, please suggest one. Thanks :)

What word could describe an operation of either importing or exporting?  X is to import and export as migration is to immigration and emigration.  Porting isn't the word I'm looking for, I don't think, but that's what I'm getting at. Cheers!


I am trying to resolve an issue with apps opening another icon for its running instance.

I've created a custom launcher file: [Desktop Entry] Type=Application Name=P4V Comment=Perforce Visual Client Icon=/usr/lib/p4v/P4VResources/icons/P4-V_128x128.png Exec=/usr/bin/p4v Terminal=false Categories=Development;  And dragged this file to my launcher. However, when I click the icon, it opens the application under a 2nd, different icon (I click the top one, it opens the application under the bottom one):  The bottom icon isn't present until after I launch the application using the top P4v icon that I manually added.


I have:  double num1 = sc.nextInt();   I used:  double sin  = Math.sin(Math.toRadians(num1));   and made the output:  if(calc.contains("sin")) {     System.out.println (sin); }   if i typed in for num1:  30 and it calculates sin. It gives me 0.49999999999999994

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


Can I get the  badge from sharing a link to a deleted question? If so, does it only count if 10K users follow it, or does it track all clicks on the link by unique IP addresses?

I recently filed what I initially thought was a bug, but was mostly user error here on Meta, and tweeted about it. Once it was pointed out to me that it was user error about 2 hours after I posted it, I deleted the question.  I've just been awarded the  for that deleted question, which while nice from a badge point of view feels fraudulent, as most people would see the question as a broken link:


I try to use  (versions 3.0.13, 3.0.11, 3.0.10, and 3.0.9) in QGIS 3.12.1, none of them are functioning.  Your suggestion would be of great help.

I have updated to QGIS 3.4 Madeira version.  However, I can't find  for this new version.  Is it not available for newer versions?


We have two positive numbers $a$ and $b$. It surely means that they might be $0$ or bigger than $0$ (and they are real numbers). $$a,b\ge 0$$ $$a,b \in \mathbb{R}$$ So now we must prove that: $$\frac{a+b}{2}\ge\sqrt{ab}$$ In fact I don't know how to use relations of fractions to prove it. Would you explain an easy way?!

The arithmetic - geometric mean inequality states that $$\frac{x_1+ \ldots + x_n}{n} \geq \sqrt[n]{x_1 \cdots x_n}$$ I'm looking for some original proofs of this inequality. I can find the usual proofs on the internet but I was wondering if someone knew a proof that is unexpected in some way. e.g. can you link the theorem to some famous theorem, can you find a non-trivial geometric proof (I can find some of those), proofs that use theory that doesn't link to this inequality at first sight (e.g. differential equations …)?  Induction, backward induction, use of Jensen inequality, swapping terms, use of Lagrange multiplier, proof using thermodynamics (yeah, I know, it's rather some physical argument that this theorem might be true, not really a proof), convexity, … are some of the proofs I know.


Overall 	 14	 2,277	 2,619,106,616	   Let's say we have that and I want the 2,277 in a string how would I cut it?

I have a C# WPF application that needs to consume data that is exposed on a webpage as a HTML table.    I tried using Linq to Xml to parse the Html document, but this only works if the HTML document is extremely well formed (and doesn't have any comments or HTML entities inside it).  I have managed to get a working solution using this technique, but it is far from ideal.    I am after a solution that is intended for parsing HTML.  I have hacked "solutions" before, but they are brittle.  I am after a robust way of parsing/manipulating the document.  I'd ideally like something that makes the task as easy as it would be from Javascript/JQuery.  Does anyone know of a good .Net library or utility for parsing/manipulating HTML?


I am trying to build an application that detect if user's input(first 20 byte) exist on  my database.  But I am stuck at sanitizing and making placeholder to it. Especially, this part $stmt->execute(), any advise and recommendation will be appreciated!  <?php     echo <<<_END             <form method='post' action='test.php' enctype='multipart/form-data' >                 Tester: <input type='file' name='uploadfile'>                 <input type='submit'>             </form>     _END;      if($_FILES){         require_once 'login.php';         if (!$conn) {             die(mysql_fatal_error());           }         $type = $_FILES['uploadfile']['type'];         if($type == "text/plain"){             $name = $_FILES['uploadfile']['name'];             $fh = fopen($name, 'r') or die("File Does not exist");             $content = file_get_contents($name, FALSE, NULL, 0, 20);             $content = sanitizeMySQL($conn, $content);             fclose($fh);             $stmt = $conn->prepare("SELECT * FROM storage WHERE mydata like ?");             $stmt->bind_param("s", $content);             $stmt->execute();             //$stmt->bind_result($content);             if (!$stmt) {                 echo "Not Exist";             } else {                     echo "Exist";             }         } else {             echo  "txt only <br>";         } }

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


I have copied a folder with many subfolders into  C:\test   Windows explorer is saying now that some folder names make the directory path too long.  What can I do against this? I really can not change the source folders names and I have to copy those folders!  I use Windows 8.1 Pro  The problem is NOT that a single folder name is too long.  The problem IS that the whole directory path seems to be too long.

When I was copying a directory structure to a new location where the target folder had a name slightly longer that the source, I encountered the following error indicating that the file name was too long.  The interesting part is that I then used Scooter Software's Beyond Compare app to compare the Source folder to the target folder to identify the files that failed to copy. I was suprised to find that BC was able to copy the files to the target folder so both folders matched 100%.   I think the file name in question was 258 characters long. Previously, based on error messages that I probably seen in Windows Explorer, I thought that Windows had a 255 character limit on file names, including path. Since I was able to copy the following 258 char file name using Beyond Compare, this appears not be be the case.   Is there a Windows file name length limit? Why is Windows Exploere's max length 255?  It looks to me like the "name too long" restriction was   C:\Expand\tfs2010\Healthcare-Finance_IT\Main\MLR Rebates Web Services\Load_MLR_REBATE_IBOR_INFO\Load_MLR_REBATE_IBOR_INFO\Service References\IborServiceReference\Load_MLR_REBATE_IBOR_INFO.IborServiceReference.locateProfileBySourceSystemIdResponse.datasource


I'm rewatching the Battlestar Galactica miniseries and I spotted something odd:     Tigh: Munitions depot confirmed, but we have two problems. One, the   Ragnar station is at least three days away at best speed. Two, the   entire Cylon fleet is between here and there.       Adama: Specialist.       Specialist: Sir.       Adama: Bring me our position.       Specialist: Yes, sir.       Tigh: You don't want to do this.       Adama: I know I don't.       Tigh: Because any sane man wouldn't. It's been, what, twenty,   twenty-two years?       Adama: We trained for this.       Tigh: Training is one thing, but - if we're off in our calculations by   even a few degrees, we could end up in the middle of the sun.       Adama: No choice. Colonel Tigh, please plot a hyperlight jump from our   position to the orbit of Ragnar.       Tigh: Yes, sir.       Dualla: (in tears) Priority message, sir.       Tigh: Engineering, spin up FTL drives one and two.       Man: Spinning up FTL drives one and two.       Tigh: Lieutenant Gaeta, break up the FTL tables and warm up the   computers. We are making a jump.   This gives the impression that no one had done a FTP jump since the original cylon war? Is this right? Why not?

In the miniseries the first time we hear about FTL jumps (Adama ordering the jump to Ragnar Anchorage), there's an exchange on how dangerous it is ("we could end up in the middle of a sun") and after the jump they actually clap. So it seems like jumping is a big deal, but not much later it turns out that random civilian ships jump all around, and giving the impression that it is very routine to jump for a lot of ships. So what's the deal with that first jump?


I'm looking to ask for some clarification about following paper  but I'm not sure which StackExchange site best suited for such questions.  Example question:     What does -< symbol denote? A concrete operation or just a shortcut for reducer operation?   Would it best be answered by  under Haskell tag? Or perhaps by ? Or even ?  Could anyone point me to the correct site?

There seems to be more than a few computer science/programming Stack Exchange networks (is that the correct term?). Stack Overflow, being the first, has by far the most users, questions, and answers.  What is the reasoning for creating the others, and are there clear guidelines for which kinds of questions should be posted? I can see a large amount of potential overflow, many cases of people not getting a good answer to their question, because the person who has the answer isn't browsing that particular network at the moment.  I understand that they were probably created for organizational purposes, but wouldn't it almost make more sense to just have them as categories under Stack Overflow, keep them separated but still connected, instead of making people have to create multiple 'account's, one for each network?  I am sure there was a very good reason to break them up, but as someone that is new to SE, it can be somewhat intimidating to decide which one to post in to ensure you get a good answer. For example, if I am a computer science student, my first instinct might to be to post in the computer science network, until I see that it literally has 1% of the users as the Stack Overflow network, which still seems to be for programming/computer science related questions.  So my second instinct would then to be to post it into the Stack Overflow site on the basis that I have a significantly higher chance of my question being seen and getting a good answer. Then I notice that there is also a 'programmers' network, and I don't even begin to know where that fits in. I, and I am assuming most people, will probably just post on Stack Overflow to be safe.  My question is, other than the short little description blurb of each one, is there a clear cut set of guidelines which what each network is intended for, what kinds of questions should go to each one, and is anything being done to encourage people to post in these newer, smaller (more specialized?) networks as opposed to just posting in big daddy Stack Overflow?  Now again, this is for computer science/programming/"why isn't this code doing what I want?" related questions, I am not saying that if I had a question about Linux or WordPress or something I would have the same confusion.


So I just started learning blender from the Blender guru: Blender Beginner Tutorial Series. I am at part 4 where he wants to edit the icing of the donut. I wanted to try to move it too with pressing g-key and then z-key, it doesn't really goes well as you can see on the screenshots I took. I just goes from the one point directly to a sharp point in my icing and I don't know why. Did I do something with a shortcut? Or something in my settings? Can someone help me?   "icing"   "icing going wrong"

My cursor is moving by every selection by large increments!  Normally when I use Blender, I am able to select and move objects to any coordinate. Now, all of the sudden, when I select an object or mesh the selection moves by an inch or so in each direction.  How do I reset it to normal?


I have the following code \sum_{i<j}^{}\sum Cov(X_i, X_j) which renders     How can I move the i<j subscript to the center underneath the two sigmas (which will result in a "shift")? Preference will be given to the simplest solution.

I would like to place a lower limit under two consecutive \sums, somewhere in between. So I have \sum_{j=1}^{\infty}\sum_{k=1}^{\infty} and would like to place j>k in the lower limit between the two sums. I believe the multiple integral operator has this kind of functionality.


Starting to learn javascript but am confused as to how to define a class.  Is the following a way to define a class?   var bar = function (a, b) {     var product = a*b;     var sum = a+b;      return function() {return product / sum}; };   I think that it is just a function but was told that it was also a class.

I prefer to use OOP in large scale projects like the one I'm working on right now. I need to create several classes in JavaScript but, if I'm not mistaken, there are at least a couple of ways to go about doing that. What would be the syntax and why would it be done in that way?  I would like to avoid using third-party libraries - at least at first. Looking for other answers, I found the article  that discusses object-oriented programming in JavaScript. Is there a better way to do inheritance?


I was following  on updating an EOL distribution. I want to upgrade from 15.10 (wily).  I am using apt-get rather than aptitude that is used in the guide. I added the .list sources file in my /etc/apt/sources.list.d directory.   when I run sudo apt-get update it tells me it is unable to fetch those packages. I investigated a bit and I can see  that all the old releases are there except Wily. Is this an oversight or am I following an outdated guide?

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


I’ve found a few of these tiny bugs on the windowsill next to my bed. Can anyone tell if it is a bedbug nymph, psocid, or something else?? I’m hoping it’s not the former! Edit: They were very small maybe 1 to 2 mm

I have a large wooden cutting board which is used in my kitchen mainly for preparing egg pasta. The wood type is Populus (poplar or aspen or cottonwood).  The main ingredients used with the cutting board are: flour (mainly soft wheat flour), hens' eggs, white sugar, butter, and baking powder.  After the food preparation, the cutting board is cleaned by scraping away the ingredients remains.  The board has some cracks and some small unknown insects are living inside the cracks.   The board has also a lot of holes due to woodboring beetles but I think the woodworms operated long time ago and they no longer live in the cutting board.  The unknown insect has an approximate length of 1 mm (along the direction of their movements) and a width of 0.3 mm. The unknown insects do not have wings, they just walk. I am not able to see how many pairs of legs they have.  The color of the insect is pale brown.  The cutting board was free from these unknown insects some months ago but then they appeared.  My questions:   What insects are they? Are these insects poisonous to humans? How can I get rid of them?   Update  The unknown insects could be Acarus siro, I will try to get a picture of the insects.  Update 2  Here is a picture. The bottom part of the image is a one Euro coin, the top part of the image is a caliper (each bright area is one mm tick).   Some more pictures:


When I tried installing VLC plugin libde265 , I got this error message  E: Write error - write (28: No space left on device) E: The package lists or status file could not be parsed or opened.   I also keep getting that /tmp is out of disk space. What should I do? Here's output of df -h  Filesystem      Size  Used Avail Use% Mounted on udev            2.9G   12K  2.9G   1% /dev tmpfs           583M  1.5M  582M   1% /run /dev/sda7        43G   29G   12G  72% / none            4.0K     0  4.0K   0% /sys/fs/cgroup none            5.0M     0  5.0M   0% /run/lock none            2.9G   53M  2.8G   2% /run/shm none            100M   44K  100M   1% /run/user overflow        1.0M  1.0M     0 100% /tmp /dev/sda5       385G  118G  267G  31% /media/shashank/F0007F2C007EF944   On using the command   sudo umount /tmp   I get  umount: /tmp: device is busy.         (In some cases useful info about processes that use          the device is found by lsof(8) or fuser(1))   Since earlier questions were just solved by running the above command,I am posting a new question about this find out any remedies if possible

I'm not able to run update manager as I get an error saying that there is not enough free space in the /tmp directory. I've practically cleaned out the tmp directory but the error persists.  here's df-h  /dev/loop0       13G   11G  952M  92% / udev            2.0G  4.0K  2.0G   1% /dev tmpfs           785M  920K  784M   1% /run none            5.0M     0  5.0M   0% /run/lock none            2.0G  584K  2.0G   1% /run/shm /dev/sda6        20G   14G  6.4G  68% /host  overflow        1.0M   16K 1008K   2% /tmp


First of all, I'm not entirely sure what to call polynomial functions that can have x raised to negative integers powers, so I will just call them polynomial type functions.  The integral of every polynomial type function is another polynomial type function, unless, of course, our polynomial type function has $\frac{1}{x}$ in it. In that case, our integral is obviously $\ln{x}$.  In the case of every other function in the form $x^{k}$ for some integer $k$, we can use power rule to find the integral. With $\frac{1}{x}$, there is a problem, since our integral will have had a constant of $0$ multiplying the term, nullifying it.  So my question is, why does it happen to be true that every single polynomial type function has a polynomial type integral, except $\frac{1}{x}$? $\frac{1}{x}$ happens to be the only function where using power rule to evaluate the integral doesn't work, and it also happens to the be the only one without a polynomial type integral.  This can't be a coincidence: the two special properties of $\frac{1}{x}$ must be related. What about $\frac{1}{x}$ makes it so special?

I've learned in my analysis class, that     $$ \int \frac{1}{x} \mathrm dx = \ln(x). $$   I can live with that, and it's what I use when solving equations like that. But how can I solve this, without knowing that beforehand.  Assuming the standard rule for integration is     $$ \int x^a \, \mathrm dx = \frac{1}{a+1} \cdot x^{a+1} + C .$$   If I use that and apply this to $\int \frac{1}{x} \,\mathrm dx$:  $$ \begin{align*}   \int \frac{1}{x}\mathrm  dx &= \int x^{-1} \,\mathrm dx \\                       &= \frac{1}{-1+1} \cdot x^{-1+1} \\                       &= \frac{x^0}{0} \end{align*} $$  Obviously, this doesn't work, as I get a division by $0$. I don't really see, how I can end up with $\ln(x)$. There seems to be something very fundamental that I'm missing.  I study computer sciences, so, we usually omit things like in-depth math theory like that. We just learned that $\int \frac{1}{x} dx = \ln(x)$ and that's what we use.


You probably know about question duplicates. I was thinking you could take that scenario, except in answers to try to prevent spam answers and exact duplicates of an answer that already answered the question.

While the etiquette of dealing with duplicate answers , there hasn't been a great way to deal with these, "Uh, yeah, I said this, too" types of behavior than the almighty downvote.   It would be nice to have a "Duplicate Answer" option on the flag menu. Five flags auto-deletes the answer, as with any other flag. In order to prevent abuse, the flagged answer would have to have the last owner edit (including original post) be younger than the original answer's original posting by at least 2 minutes.  Also, this ability should be a 5,000+ rep privilege, since we currently have no fanfare of rep from 3,001 to 9,999, and a power like this has a bit more umph than closing a question.  Thoughts?


I thought this would be a simple question, but I'm having trouble figuring it out. Not a homework assignment btw. I am a physics student and am just genuinely interested in physics problems involving math, which would be all of them.  So lets say we drop an object from a height, $R+r$, it falls toward earth. This height, $R+r$, is far enough away that the $g$ it experiences is a fraction of $g$ at sea-level. Let's just say that air resistance is negligible, and it wouldn't be that complicated to just integrate from $0$ velocity to the terminal velocity piece wise and deal with the rest of it later.  So the key here is that acceleration is changing with time. I thought I could simplify this by saying it changes with distance, and it has nothing to do with time, but this didn't really help, my guess is that maybe time is important (doh).  I tried integrating acceleration with time, and ended up nowhere. I tried integrating $a=GM/R^2$ with respect to $R$ from $R+r$ to $R$ and ended up with a negative function.  I saw somewhere someone tried to expand with taylor series, they even have something similar on hyperphysics, but I can't figure out how to obtain the polynomials that precede the variables.    This is the hyperphysics site where they use polynomials to find the distance.   Maybe I can't solve this because I haven't taken a course in differential equations yet. What I want to know is how to calculate the distance at any time.

The common understanding is that, setting air resistance aside, all objects dropped to Earth fall at the same rate. This is often demonstrated through the thought experiment of cutting a large object in half. The halves clearly can't then fall more slowly just by being sliced in two.  However, I believe the answer is that when two objects fall together, attached or not, they do "fall" faster than an object of less mass alone does. This is because not only does the Earth accelerate the objects toward itself but the objects also accelerate the Earth toward themselves. Considering the formula: $$ F_{\text{g}} = \frac{G m_1 m_2}{d^2} $$  Given $F = ma$ thus $a = F/m$, we note that the mass of the small object doesn't seem to matter as when calculating acceleration the force is divided by the $m$ term, its mass. However, this overlooks that the force is actually applied to both objects, not just to the smaller one. The acceleration on the second, larger object is found by dividing $F$, in turn, by the larger object's mass. The two objects' acceleration vectors are exactly opposite, so closing acceleration is the sum of the two:  $$ a_{\text{closing}} = \frac{F}{m_1} + \frac{F}{m_2} $$  Since the Earth is extremely massive compared to everyday objects, the acceleration imparted on the object by the Earth will radically dominate the equation. As the Earth is $\sim 5.972 \times {10}^{24} \, \mathrm{kg} ,$ a falling object of $5.972 \, \mathrm{kg}$ (just over 13 pounds) would accelerate the Earth about $\frac{1}{{10}^{24}}$ as much, which is one part in a trillion trillion.  Of course in everyday situations, we can for all practical purposes treat objects as falling at the same rate because of this negligible difference—which our instruments probably couldn't even detect. But I'm hoping not for a discussion of practicality or what's measurable or observable, but what we think is actually happening.  Am I right or wrong?  What really clinched this for me was considering dropping a small Moon-massed object close to the Earth and a small Earth-massed object close to the Moon. This made me realize that falling isn't one object moving toward some fixed frame of reference, but that the Earth is just another object, and thus "falling" consists of multiple objects mutually attracting in space.


I would like to know if an 'and' is always necessary before the last item in a colon list. Is the following correct, or should I place an 'and' before 'grapes'?  The basket contained a variety of fruits: bananas, apples, oranges, grapes.  Thanks.

He called her, emailed her, texted her, tweeted her—all to no use.   Strictly speaking, I would need to write texted her and tweeted her, but I'm omitting and to convey a rhythm and sense of urgency. What do you call this kind of construction, and is it accepted grammar (at least for creative writing, if not in an academic context)?


In my university's lab, we have typical "e/m apparatus"'s, i.e. a cathode ray tube nested between a Helmholtz coil. Here is the manual for the device we are using.  When operating the device, we typically set the acceleration voltage to around $200 \text{V}-400\text{V}$, so that means the electrons flying in circular trajectories should have kinetic energies around $200 \text{eV}- 400 \text{eV}$. The tube is filled with low-pressure Helium, which gives rise to a blue-ish arc characterizing the electron trajectories.  My understanding is that the free electrons elastically scatter with the Helium atoms, mostly ionizing them. An electron will then join back with the ionized Helium atom, producing a photo-emission. Here are some crucial numbers for inert Helium:   To excite a single electron by a single level, i.e. $\text{(1s)}^2\rightarrow \text{(1s)(2s)}$: $\color{red}{19.8\,\text{eV}}$. To ionize a single electron, i.e. $\text{(1s)}^2\rightarrow \text{(1s)}$: $\color{red}{24.6\,\text{eV}}$ To ionize two electrons, i.e. $\text{(1s)}^2\rightarrow \text{(no electrons)}$: $\color{red}{79\,\text{eV}}$   None of these energies correspond to wavelengths of visible light (at all!). How then is there a blue-ish glow? Clearly my understanding of what is actually going is flawed.    [Sources]  [1] Helium energies:   [2] Energy to Wavelength converter:   [3] Lab Manual:

Related:   After reading Lisa Lee’s OP on an electron deflection tube, although she had some misunderstandings on its operation, I still believe that her question is still relevant. If one looks at the Thomson e/m tube filled with helium gas (made by ), the tracer light is created by de-excited electrons, not by an electron beam interacting with a phosphor as in Lisa Lee's OP. That is, the accelerated electrons scatters off of a low pressure helium gas and emit a tracer line to follow the electrons path, as shown below.     Now if you look at the bright line spectrum of helium,     One can clearly see that there are two “cyan” color lines around 500 nm. Following in Lisa Lee’s footsteps, there is a series of question one can ask: (1) which line is emitted by the Helium gas atoms? Or are both lines emitted? (2) How can a variable accelerating voltage for the electrons always produce the same tracer line color? In theory, I assume that if I decreased the energy of the electron beam, I could produce red (around 670 nm) or yellow (around 590 nm) tracer lines, but that doesn’t happen. Somehow, it appears to me that the e/m tube is “tuned” just right so that the emitted light is always this “cyan” color. Why?


We are given two equations:  $$ \left\{ \begin{array}{c} \sqrt{a}+b=11 \\ a+\sqrt{b}=7 \\ \end{array} \right. $$  How to find the value of $a$ and $b$ by solving the equation? All I could do was use the hit and trial method. Help me with this!

I want to solve this system of equations, I have been out of Maths for a long!!  $$\sqrt{x}+y=7$$  $$\sqrt{y}+x=11$$  Just wondering easiest step to find values for $x$ and $y$ from the above equations?


I can't log into minecraft launcher or the website. When I use forgot password, it won't send me the email. I've had my account for a long time now..

I quit and restarted Minecraft because it was being slow/lagging a lot to see if it would help.  Unfortunately, when I opened it up I was logged out and every time I try to login it gives me this message:     Username or password incorrect!   So, I re-typed everything and made sure to type it all correctly and it still won't let me log in. I also noticed that as soon as I hit login the password becomes blank.   I have purchased the game so it's not like a trial has expired or anything like that. What can I do to fix this?


Does JavaScript pass by references or pass by values? Here is an example from . I am very confused about the my parameter for the rectangle function. It is actually undefined, and redefined inside the function. There are no original reference. If I remove it from the function parameter, the inside area function is not able to access it. Is it a closure? But no function is returned. var shape = function (config) {     var that = {};     that.name = config.name || "";     that.area = function () {         return 0;     };     return that; };  var rectangle = function (config, my) {     my = my || {};     my.l = config.length || 1;     my.w = config.width || 1;     var that = shape(config);     that.area = function () {         return my.l * my.w;     };     return that; };  myShape = shape({     name: "Unhnown" });  myRec = rectangle({     name: "Rectangle",     length: 4,     width: 6 });  console.log(myShape.name + " area is " + myShape.area() + " " + myRec.name + " area is " + myRec.area());

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


When I started playing I got through TH3 and linked it to my Gmail account, but then I realized I was spending a lot of gems with that village and wanting to create another account. What I did was I uninstalled the client and re-installed it again and create another village and got through TH6 and tried to link it on the same Gmail account but it's asking me if I want to load my previous account which has TH3 which I did and now I can't go back to my TH6 village.  If anybody could help me with this one, that would greatly appreciated!

So someone saved a level 2 to my Google+ account and now I can't transfer my game to my new phone because there isn't a second way to restore my progress.  It caused me to get kicked from my clan and I've shamefully spent a lot of money on this game! I don't want to lose it. Is there any way to restore it?


I have a file ANIL.sh created years back. I want to find files created after ANIL.sh.  I know how to find particular file using the find command. But I am not sure how to get files created after ANIL.sh.  Any suggestions?

I need a shell script which finds files which are created 1 hour before or 1 hour after a particular file (test.txt) was created.   If I go with find -newer, that means I'd have to create a temporary file, use touch to change the time on that 1 hour before the creation time of the test.txt file, and then use -newer tempFile to find the files which are newer than the tempFile, ultimately finding the files which are created 1 hour before the test.txt file. Then I have to go back through that process to find those an hour or more older than the file I'm interested in. That seems like a lot of extra work to go through to answer a simple question.  I also see find -mmin, but I worry that it's an extension to POSIX find.  Any other suggestions?


How can I force Ubuntu to apply a specific monitor resolution through terminal?  In my case I have a monitor of resolution 1600*900@60fps but Ubuntu shows only two resolutions both awkwardly lower than the monitor.

After installing Ubuntu 10.04 with my Samsung SyncMaster B2030, native resolution (1600X900) is not found in the list of resolutions.


i'm making a intro in blender 2.76b .when i click compositing i don't see the view , select , add ... if you don't understand, here's 2 screenshot (i took one from a video)  the one from the video (How i want it to look like):   my verision   but the thing is that when i start i new prodject it looks normal again and then i switch to my prodject it isn't there! please help me (Sorry if i used wrong tag)

The bar at the very bottom of the screen went away while I was trying to make an intro, its the one with all the frames and options of view, marker, frame, playback, start, end, and the play button. Please help me, how do I get it back!?


I inherited some data that lines up correctly on the map, but in face are in different coordinate reference systems/SRID. Here is a screenshot example:    The CRS of the green layer is:   EPSG: 4326   The CRS of the purple layer is:  EPSG: 2264   They are lined up correctly on the map, but to do stuff in PostgreSQL/PostGIS with them, they need to be in the same CRS/SRID. If I change the CRS of the green layer to match the purple layer, naturally the green layer is now way off the map.  I could manually recreate the green layer, but this would be time consuming. Is there a better solution? Could I re-create the green layer as it is, but with a different CRS? Either using some tool in QGIS or in PostgreSQL/PostGIS?

How do I change the projection of my shapefile using QGIS? The default projection is set to EPSG:3003, I want to change it to WGS84 EPSG:32632. When I do a reprojection or I change projection in the properties mask I don't have the correct result. On the left, I have the plan coordinates but they are not correct for the EPSG shown on the right:


My computer is wired to my audiomixer and then to my headphones. If i turn the volume off my mixer up i can literately hear my computer(if my computer is'nt playing audio ofcourse). I can hear  it when i maximize or minimize a window. I can hear my mouse hovering over a link in a browser,..  I have multiple soundcards, and only the one on my mainbord gives me this "interference" How can it be that i can hear software? Is there anyone here that can give me an explanation.

Today I installed sound card drivers of my motherboard (Asus P6T SE), and now I have started hearing the things that are happening on my screen. When I scroll, or change windows, basically cause a redraw on screen, I hear noises kind of resembles each action. And I am not on drugs.  What causes this and how can I fix that?


when comb is rubbed with hair, and brought near small pieces of papers, small paper pieces gets a towards comb. Here the comb gets negatively charged and when brought near piece of paper where do electrons go because after sometime attraction of paper pieces towards comb stops and comb doesnt have negative charge then. Why does it happen so ? What is the reason for it ?  If a glass rod is rubbed with silk, rodna and silk gets positive or negative charge respectively, an when they are seperated after charge gets nuetral. Why does it happens? What is the reason behind this ?

It is always told as a fact without explaining the reason. Why do two objects get charged by rubbing? Why one object get negative charge and other get positive ?


I have to run some code only when a particular element in the DOM (img tag) exists, if not then I want to run some other code. Below is what I have till now.  Original Code:   ed.on('blur', function (e) {         var iFrame = $('iframe');          $("img[src*='blob']", iFrame.contents()).each(function (i) {             var originalUrl = $(this).prop('src');             var that = $(this);             // SOME CODE             );         });   Below is what I want      ed.on('blur', function (e) {     var iFrame = $('iframe'); ******If ( img[src*='blob' exists in the iFrame )********     $("img[src*='blob']", iFrame.contents()).each(function (i) {         var originalUrl = $(this).prop('src');         var that = $(this);         // SOME CODE        );     }        else     {        // Do something else     } });   So basically if I cannot find  $("img[src*='blob']" in the iframe I want to run some other code. Please guide me.

I would like to manipulate the HTML inside an iframe using jQuery.  I thought I'd be able to do this by setting the context of the jQuery function to be the document of the iframe, something like:  $(function(){ //document ready     $('some selector', frames['nameOfMyIframe'].document).doStuff() });   However this doesn't seem to work. A bit of inspection shows me that the variables in frames['nameOfMyIframe'] are undefined unless I wait a while for the iframe to load. However, when the iframe loads the variables are not accessible (I get permission denied-type errors).  Does anyone know of a work-around to this?


How do I check the MD5 and SHA1 of an ISO file? It's a Windows 7 iso.

I have a lot of iso-files downloaded from internet. I want to check the hash from my Ubuntu 12.04 and 12.10. Is there any application on Ubuntu to check the MD4, MD5, SHA-1, and CRC hash?  I need the CRC hash-checker to check my Windows 8 iso files.


I am a new learner of Physics, and I am just wondering is the translational effect of a force that does not pass through the center of mass of an object as big as the translational effect of another force of the same magnitude that does pass through the center of mass of the same object. Considering the following situation.  Thanks for reviewing the question.

When applying a force outside of the center of mass of the body, the body will get both linear and angular momentum. Right?  Does the linear velocity from this force equal to the linear velocity from the same force, which is applied on the center of mass?  $$v_{\text{center}} = v_{\text{non-center}}\quad\text{? (no vectors)}$$  If it does: How is it that the energy applied to the system is equal? In one we have both rotation and linear movement, and in the other just linear movement.


I'm writing my bachelor thesis on various topics from set theory and descriptive set theory (mainly topological games), and I just read a paper in which the Baire Space $\mathbb{N}^\mathbb{N}$ is dubbed $\mathbb{R}$. Here is how it justifies it:     Since any two uncountable polish spaces are borel ishomorphic and since many set-theoretic questions are invariant under borel isomorphism it is customary to dub any uncountable polish space $\mathbb{R}$. Also in set theory it is often desirable to deal with a version of $\mathbb{R}$ which is transparent from a combinatorial point of view, so we will work with the Baire space $\mathbb{N}^\mathbb{N}$.   I don't really understand what they mean by "transparent from a combinatorial point of view". I have an intuition on why it is desirable to work with the Baire space. In fact I'd say that it is because it is pretty close to $\mathbb{R}$ (it is homeomorphic to the irrational numbers with the relative topology) and, in a certain sense, it allows to contruct its elements in a much simpler way than in $\mathbb{R}$. This emerges for example in the elegant characterization of continuous functions in the Baire space. So my questions are:   What do they mean by "transparent from a combinatorial point of view"? Is my intuition on the construction of the baire space elements formalizable in some way? It is in some way related with the total disconnection of the space?  If the answer to the previous question is affermative then the reason why the Baire space is desirable can rely also on this consideration (on the element construction)?   Thanks!  EDIT: this is the link to the article I was quoting:  I want to point out that the article doesn't say anything more than the quote I posted in this regard.

In most Descriptive Set Theory books, the rationale for working with the Baire space ($\mathbb{N}^{\mathbb{N}}$) as opposed to the real line ($\mathbb{R}$) is that the connectedness of the latter causes 'technical difficulties'.   My question is, what are these technical difficulties, and why does Descriptive Set Theory (normally?) stick to zero-dimensional Polish spaces?  Thanks in advance.


How to protect user to clear checkbox using javascript ?  I want to protect clear checkbox from user using javascript  (not use disabled tag) How can i do that ?  <input type="checkbox" id="c1" checked> Do not uncheck

I thought they could be, but as I'm not putting my money where my mouth was (so to speak) setting the readonly attribute doesn't actually seem to do anything.  I'd rather not use Disabled, since I want the checked check boxes to be submitted with the rest of the form, I just don't want the client to be able to change them under certain circumstances.


It is true that so far, nothing has ever been observed to travel faster than light in vacuum. However, just because nothing so far has yet to travel faster than light does not mean that nothing in the universe can travel faster than light.   Are there solid evidence supported by experiments to support the assertion that nothing travels faster than light?

Is it possible to have an alternative theory which is consistent with experiments supporting GR, but which doesn't mandate a speed limit on causality?  In other words, I understand there is experimental evidence for gravitational/relativistic time dilation, spacetime curvature, etc. but is there any inherent reason why these effects cannot be explained without the max speed requirement?  QM clearly shows that "communication" can happen instantaneously but, supposedly, causality cannot break the speed limit.  I also know the speed of light is derived from other principles, but is there anything that says that speed has to be a max limit of any kind?  I want to emphasize that the QM "communication" doesn't imply causation or information exchange, merely the establishment of the entangled attribute.  Bell's inequality tells us that the attributes were not predetermined and were only established upon measuring one of the particles.


The line in question causing the issue is:  \item Blah blah blah \approx blah("blah") blah   I also tried \left( and \right), but that didn't change anything.  No error is thrown when \approx is removed.

I want to write this simple equation in latex        2/|w|   In which |w| is the norm of w,,  I tried with         \frac{2}{\|w\|}   And get error "Missing $ inserted"  then I use this     \frac{2}{$\|w\|$}   And still get same error..  Does someone know how to solve this problem??


Trying to capture all text between tags.  Code:  $test = '<test>foo<tests> asdlkfjklas lkflsdakj <test>sdfsd<tests> asdlkaskl <test>235234<tests>';  $match = '/<test>(.*)<tests>/';  preg_match_all($match, $test, $nextLink);   Result of print_r:  Array ( [0] => Array ( [0] => foo asdlkfjklas lkflsdakj sdfsd asdlkaskl 235234 ) [1] => Array ( [0] => foo asdlkfjklas lkflsdakj sdfsd asdlkaskl 235234 ) )

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


I recently sent a paper to a journal which has now been reviewed by 2 reviewers. Both of them have some good points that I should change. However, both reviewers also suggest to include specific papers to "enhance" my paper.  However: These papers are barely related to my paper.   In case of reviewer 1 the whole research group of the papers suggested by this reviewer is identical for each paper. In case of reviewer 2 five papers have been suggested. Even though different authors are listed two identical authors appear on each of these papers. Sometimes as a first author, sometimes not. But it seems obvious to me that one of these two authors must be reviewer 2.   I don't know how to deal with that. Should I write the editor? Should I ignore their suggestions? Should I include at least one of these references to make them happy? Their general opinion about our paper was good.

I had submitted a paper to a reputed Computer Science Journal. The reviewer has a lot of constructive changes, in addition to that he also suggested citing a few more papers, all by the same author. Since this is a double blind process, we don't know each other's identity. So, is it common for reviewers to suggest references in this field or any other field ?


I'm driving a Czech rental car into Germany and would like to have an Umweltzone sticker so that I can drive into cities. Where can I get one while on the road and what documents are needed?  The car itself is a brand new Skoda that certainly meets the environmental requirements. It just needs the sticker to certify this.

I am driving to Germany today and just noticed that I am traveling to a city which requires a  so called "Umwelt-plakette" or environmental badge to enter. Normally you need to order them in advance. Is it possible to buy them somewhere while on the road?


Allow $d(n)$ to be the number of divisors of $n$. Show that there are $d(m)$ ways to write $n$ as the sum of consecutive integers where $m$ is the largest odd divisor on $n$. I have absolutely no idea where to go. The hint given to me is that $$\ x + (x+1) +... + (x+r-1) + (x+r) = (r+1)x + \frac{1}{2}r(r+1)$$ I can set the above expression equal to $n$, but this still confuses me.

All the positive numbers can be expressed as a sum of one, two or more consecutive positive integers. For example $9$ can be expressed in three such ways, $2+3+4$, $4+5$ or simply  $9$. In how many ways can a number be expressed as a sum of consecutive numbers?  In how many ways can this work for $65$?  Here, for $9$ answer is $3$, for $10$ answer is $3$, for $11$ answer is $2$.


When im making a forward selection and looking for the AIC, I get some large negative numbers. My code: OnlyIntercept = lm(Risk ~ 1, data = train.df) step.forward = step(OnlyIntercept, scope=list(lower = OnlyIntercept, upper = logReg), direction = "forward", k=2)  The output for model with only intercept:  Start:  AIC=-1309 Risk ~ 1                  Df Sum of Sq RSS   AIC + Score_MV       1     26.85 200 -1424 + Score_A        1     22.80 204 -1406 + District_Loss  1     12.55 214 -1360 + PARA_A         1      9.96 217 -1349 + Sector_score   1      7.07 220 -1337 + Score_B.1      1      5.82 221 -1331 + Money_Value    1      5.39 222 -1330 + TOTAL          1      5.31 222 -1329 + PARA_B         1      4.17 223 -1324 + History        1      3.40 224 -1321 + numbers        1      3.19 224 -1320 <none>                       227 -1309  Even with all more variables included, the AIC is still very negative. How do i interpret this?

My question is related to the thread .  I often get negative AIC values from the software I use.  I notice it most when I'm doing time series.  But here is what I don't get.  When defining the AIC like   $$AIC = 2k-2\ln(L)$$  $L$, the likelihood, is a joint probability and to my understanding must be bound between 0 and 1.  Mathematically this implies the $AIC$ must be positive.  So I don't know what my software is giving me for the value labeled $AIC$.  Any thoughts?


Since upgrading to MacTeX 2016 the following example no longer compiles as expected:  \documentclass{article} \usepackage[T1]{fontenc} \usepackage{amsmath} \usepackage{breqn}  \begin{document} \begin{align}  x &= y, && \text{(foo)} \end{align} \end{document}   with the text (foo) appearing a total of four times in four different sizes. The problem is due to the inclusion of breqn.  Without using breqn, or if using a previous version of MacTeX, everything is as expected.

MWE needs to be compiled with LuaTeX to reproduce the problem:  \documentclass[11pt]{report}% \usepackage{amsmath,mathtools} \usepackage{breqn}                          \begin{document} $J^{\ast} = \text{JFK} \to \text{NO} \to \text{SFO}$ \[ J^{\ast} = \text{JFK} \to \text{NO} \to \text{SFO} \] \end{document}   Gives (no compile error or any warning) the following strange output    I have to use breqn package. If I remove it, then I get the expected output    Is there a way to work around this, so I can use breqn and get correct output?  TL 2015. filelist: (compiled with lualatex)  This is LuaTeX, Version beta-0.80.0.1 (TeX Live 2015) (rev 5863)   *File List*   report.cls    2014/09/29 v1.4h Standard LaTeX document class   size11.clo    2014/09/29 v1.4h Standard LaTeX file (size option)  amsmath.sty    2013/01/14 v2.14 AMS math features  amstext.sty    2000/06/29 v2.01   amsgen.sty    1999/11/30 v2.0   amsbsy.sty    1999/11/29 v1.2d   amsopn.sty    1999/12/14 v2.01 operator names mathtools.sty    2015/11/12 v1.18 mathematical typesetting tools   keyval.sty    2014/10/28 v1.15 key=value parser (DPC)     calc.sty    2014/10/28 v4.3 Infix arithmetic (KKT,FJ)  mhsetup.sty    2010/01/21 v1.2a programming setup (MH)    breqn.sty    2015/08/11 v0.98d Breaking equations    expl3.sty    2015/12/20 v6326 L3 programming layer (loader)  expl3-code.tex    2015/12/20 v6326 L3 programming layer  l3pdfmode.def    2015/11/11 v6250 L3 Experimental driver: PDF mode flexisym.sty    2015/08/11 v0.98d Make math characters macros   cmbase.sym    2007/12/19 v0.92 mathstyle.sty    2015/08/11 v0.98d Tracking mathstyle implicitly graphicx.sty    2014/10/28 v1.0g Enhanced LaTeX Graphics (DPC,SPQR) graphics.sty    2014/10/28 v1.0p Standard LaTeX Graphics (DPC,SPQR)     trig.sty    1999/03/16 v1.09 sin cos tan (DPC) graphics.cfg    2010/04/23 v1.9 graphics configuration of TeX Live   pdftex.def    2011/05/27 v0.06d Graphics/color for pdfTeX infwarerr.sty    2010/04/08 v1.3 Providing info/warning/error messages (HO)  ltxcmds.sty    2011/11/09 v1.22 LaTeX kernel commands for general use (HO) supp-pdf.mkii pdftexcmds.sty    2011/11/29 v0.20 Utility functions of pdfTeX for LuaTeX (HO) ifluatex.sty    2010/03/01 v1.3 Provides the ifluatex switch (HO)    ifpdf.sty    2011/01/30 v2.3 Provides the ifpdf switch (HO) luatex-loader.sty    2010/03/09 v0.4 Lua module loader (HO) epstopdf-base.sty    2010/02/09 v2.5 Base part for package epstopdf   grfext.sty    2010/08/19 v1.1 Manage graphics extensions (HO) kvdefinekeys.sty    2011/04/07 v1.3 Define keys (HO) kvoptions.sty    2011/06/30 v3.11 Key value format for package options (HO) kvsetkeys.sty    2012/04/25 v1.16 Key value parser (HO) etexcmds.sty    2011/02/16 v1.5 Avoid name clashes with e-TeX commands (HO) epstopdf-sys.cfg    2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Live  ***********   Update  I found another case of duplication when using breqn, which does not involve \text at all. But the solution provided below also fixes this issue. I am adding this second case here for reference just in case it might be useful. Here is MWE  \documentclass[11pt]{article} \usepackage[T1]{fontenc} \usepackage{amsmath,mathtools} \usepackage{breqn} \begin{document} \[ \underset{\mathbf{S}} {\operatorname{arg\,min}}      \sum_{i=1}^{k} \sum_{\mathbf x \in S_i}       \left\| \mathbf x - \boldsymbol\mu_i \right\|^2  \] \end{document}   The output is    After adding the patch in the answer below the correct output is now given, which is


How do I determine how many spell slots I have if I multiclass into more than one spellcasting class? For example, I have a character that is a level 3 Wizard, a level 5 Eldritch Knight Fighter, a level 4 Arcane Trickster Rogue, a level 4 Paladin, and a 4 Warlock. How many spell slots do I have and how do I determine this?

If I multiclass into 2 or more classes/subclasses that can cast spells, how do I determine what spells I know or can prepare?  For instance, if I am playing a multiclassed character with 1 level in warlock, 2 levels in bard, and 3 levels in paladin, how do I determine which spells I know/have prepared?    Related:


I want to install code that has optional support code. In prior versions of Ubuntu, I could view those support code options in a software installer app, like the Ubuntu Software app available now - but more general.   I have Canonical Partners checked in Software & Updates, but cannot find several codes I want; e.g., gfortran, paraview, vmtools . . .   So, if I want to install a code using "sudo apt-get install paraview" (say), is there a way to get a list of support codes (oe code options) for the target code? (paraview, paraview-dev, paraview-doc,paraview-python, libxdmf3 . . . )  I can get a list using apt-cache search, but I don't know how to install what code(s) I want.   Thanks, Tim

Every time I install a package:  sudo apt-get install <pkg>   apt-get displays a list of suggested packages. I have simply ignored these so far, but some of these suggestions are actually good (and some are not). I would like to recover all these lists into one big list (so that I can review it and decide if there is some package I want to install), but I could not see them in /var/log/apt/history.log.   That is, I'm looking for something like  list = [] for package in installed_packages:     list.append(package.name) print list


Would you show me if they mean the same thing? or, which one is incorrect?   A. Whom did you go with?  B. Who did you go with?

Many times, I've been asked the difference between "who" and "whom". I myself know the difference, but it is hard to explain to others. What is the easiest way to explain it to those with a basic understanding of English? A mnemonic (if possible) would help.


Sometimes, I see a dialog asking for the unlock password of the GNOME Keyring.   This dialog doesn't tell me anything about the application which wants to access the keyring secrets. Thus,I would like to know if is possible to get any information which can help to identify it.  I don't like to know how to disable the password dialog, but rather how to know which application is causing it, in order to uninstall it.

A couple of weeks ago a popup has appeared whenever I startup telling me that an application wants to access the keyring but it doesn't say which one. I'm used to seeing the application name on the popup but here it just says 'application'.    I haven't changed any passwords or did anything that might have something to do with that,  to my knowledge.  I saw this  but like I said, I haven't changed any of my passwords, and I don't want my keyring password to be empty.  How can I find out which application is asking to unlock the keyring and fix it?  Here's how it looks like:


How can i make the option selected in jquery by Name  Here is the   Here is the script  <select name="zoom_cat[]" style="margin-left:15px;" id="contact_country">     <option value=""  selected="selected">Nothing</option>    <option value="0">Singam</option>   <option value="1">Karadi</option>   <option value="2">Poonai</option>   <option value="3">Yaanai</option> </select>   And here is the script   var myText = "Singam";         $("#contact_country option:text=" + myText +"").prop("selected", "selected");

I have a select control, and in a javascript variable I have a text string.  Using jQuery I want to set the selected element of the select control to be the item with the text description I have (as opposed to the value, which I don't have).  I know setting it by value is pretty trivial. e.g.  $("#my-select").val(myVal);   But I'm a bit stumped on doing it via the text description. I guess there must be a way of getting the value out from the text description, but my brain is too Friday afternoon-ed to be able to work it out.


Let's say the variable numbers=$@ where $@is from user input. The user typed in ./script.sh 901.32.02 and I want to get the first digit 9 and store in another variable. How can I do this? I was told to do    for n in `seq 1 $count`     do var=${numbers[0]}   done   but that prints out the whole input if I echo $var instead of just 9.

If I have really long output from a command (single line) but I know I only want the first [x] (let's say 8) characters of the output, what's the easiest way to get that? There aren't any delimiters.


I tamed an ocelot with raw cod, and I was letting it walk towards me, and it also showed hearts when I fed it. But it didn't change to a tamed ocelot, and it won't sit. I'm on laptop 1.4.

I have several raw fish and have been trying to tame an ocelot. However, every time I get it to approach and feed it a fish, it simply wants to breed. I am playing on SMP, and have tried logging in/out to see if maybe the texture just didn't change, but it appears the ocelot is simply un-tamed. The  that this should tame the ocelot.  Is this a bug or a change? How can I tame this ocelot?    Here is a screenshot of my second attempt. This time, unlike last, clicking with the fish caused the ocelot to also flee. I am not sure if this is the same ocelot or not.


I am flying on Emirates from South Africa via Dubai to Australia and my stop-over is about six hours before I fly to Perth. Do I need a visa? I am South African.

I have read that, at the time of writing (2013), UAE visas are:   96-Hour : Valid for passengers in transit Tourist : Maximum 30 days Visit   : Maximum 90 days   But I am only connecting flights, so I am staying in the airport. And can't find any information regarding that case.  I only could find  something implicitly saying that you do not need a visa if staying in the airport:     Can I leave the airport when transiting through Dubai?      This depends on the nationality stated in your passport and on the   length of your stop in Dubai. Travellers of most nationalities require   visas to enter Dubai, and regulations frequently change, so if you   wish to leave the airport while in transit through Dubai, please check   your visa requirements with your local UAE embassy before you start   your journey. Travellers of certain nationalities may obtain visas at   the airport on arrival.   see also:


Every time I use the 3d manipulator it moves all of the other objects in the scene:   They are multiple meshes and the image illustrates the way they move at different speeds

My problem is that I sometimes lose the ability to independently translate or otherwise transform any parts of a single mesh. If I try, for example, to just translate several faces, edges, or vertices, then the entire mesh will stretch and displace itself in order to follow the translation. Or, alternatively, if I try to translate just one face then the whole mesh will move as if I'm translating in Object Mode.  I'm not really sure I know how to describe this problem properly. I don't even know how to reliably reproduce it. It seems to happen to any given mesh at random, and it doesn't stop happening to that mesh unless I delete and remake it.  I assume that I must be doing something wrong to cause this to happen. Does anyone have any ideas? Thanks.


I put my program in startup applications because of this. The directory /var/log is taking around 36 GB space.   Can I delete syslog and syslog.1 file which are taking the highest percentage of storage in /var/log directory?

( deals with a similar issue, but it talks about a rotated log file.)  Today I got a system message regarding very low /var space.   As usual I executed the commands in the line of sudo apt-get clean which improved the scenario only slightly. Then I deleted the rotated log files which again provided very little improvement.  Upon examination I find that some log files in the /var/log has grown up to be very huge ones. To be specific, ls -lSh /var/log gives,   total 28G -rw-r----- 1 syslog            adm      14G Aug 23 21:56 kern.log -rw-r----- 1 syslog            adm      14G Aug 23 21:56 syslog -rw-rw-r-- 1 root              utmp    390K Aug 23 21:47 wtmp -rw-r--r-- 1 root              root    287K Aug 23 21:42 dpkg.log -rw-rw-r-- 1 root              utmp    287K Aug 23 20:43 lastlog    As we can see, the first two are the offending ones. I am mildly surprised why such large files have not been rotated.  So, what should I do? Simply delete these files and then reboot? Or go for some more prudent steps?  I am using Ubuntu 14.04.  UPDATE 1  To begin with, the system is only several months old. I had to install the system from scratch couple of months back after a hard disk crash.  Now, as advised in ,  I first checked the offending log files using tail, no surprise there. Then, for deeper inspection, I executed this script from the .  for log in /var/log/{syslog,kern.log}; do    echo "${log} :"   sed -e 's/\[[^]]\+\]//' -e 's/.*[0-9]\{2\}:[0-9]\{2\}:[0-9]\{2\}//' ${log} \   | sort | uniq -c | sort -hr | head -10 done   The process took several hours.  The output was in the line of,   /var/log/syslog : 71209229  Rafid-Hamiz-Dell kernel:  sda3: rw=1, want=7638104968240336200, limit=1681522688 53929977  Rafid-Hamiz-Dell kernel:  attempt to access beyond end of device 17280298  Rafid-Hamiz-Dell kernel:  attempt to access beyond end of device    1639  Rafid-Hamiz-Dell kernel:  EXT4-fs warning (device sda3): ext4_end_bio:317: I/O error -5 writing to inode 6819258 (offset 0 size 4096 starting block 54763121030042024)        <snipped>  /var/log/kern.log.1 : 71210257  Rafid-Hamiz-Dell kernel:  attempt to access beyond end of device 71209212  Rafid-Hamiz-Dell kernel:  sda3: rw=1, want=7638104968240336200, limit=1681522688    1639  Rafid-Hamiz-Dell kernel:  EXT4-fs warning (device sda3): ext4_end_bio:317: I/O error -5 writing to inode 6819258 (offset 0 size 4096 starting block 954763121030042024)    (/dev/sda3 is  my home directory. As we can find,   lsblk /dev/sda NAME   MAJ:MIN RM   SIZE RO TYPE MOUNTPOINT sda      8:0    0 931.5G  0 disk  ├─sda1   8:1    0 122.1G  0 part / ├─sda2   8:2    0   7.6G  0 part [SWAP] └─sda3   8:3    0 801.8G  0 part /home    Why a process will want to write beyond the limit is actually outside the scope of my comprehension. Perhaps I will want to ask a different question in this forum if this continues even after a system update.)  Then, from  (you may want to check  for a deeper understanding), I executed,   sudo su - > kern.log > syslog   Now, these files have zero sizes. The system is running fine before and after a reboot.   I will watch these files (along with others) in the next few days and report back should they behave out-of-line.  As a final note, both  the offending files (kern.log and syslog), are set to be rotated, as inspection of the files (grep helped) inside  /etc/logrotate.d/ shows.  UPDATE 2  The log files are actually rotated. Looks like the large sizes were attained on a single day.


After running a stable dual boot system with Win7 for years, I had to upgrade to Win10 recently. Windows worked but as anticipated, destroyed the grub loader. I restored it via chroot method and can now boot Ubuntu, but Win10 no longer works. Selecting the correct entry results in "cannot find image". OS-Prober does not find Win10. Even Microsoft's own bootrec cannot find Windows now!  sda1 Windows sda2 / sdb1 EFI system.    And this is how the Win10 entry in grub looks like:  menuentry 'Windows 10' {     search --fs-uuid --no-floppy --set=root **the UUID of sdb1**     chainloader (${root})/EFI/Microsoft/Boot/bootmgr.efi }   Of course I could now go and reinstall Win10, but that would only get me back to square one.  I have tried out turning secure boot on/off and starting windows from bios. Nothing makes a difference.   Edit:  I am quite certain that I installed both systems in EFI mode, non secure, way back when. This time round, I made sure to install Win 10 in EFI mode and ran the USB stick in EFI more too for the grub repair.  Here's the link to the boot summary:    Edit II: My initial post was bit sloppy. I did not upgrade the Win7 installation to Win10; Win10 was a clean install into sda1 that was previously occupied by Win7.

I installed Windows on my computer, followed by an installation of Ubuntu. However, now I'm unable to boot into my Windows install.  What can I do to fix this?