What is the remap to change ControlShiftQ to a single key?

I have AutoHotKey, but am not smart enough to get the correct syntax for the script.  I have tried space::controlshiftQ and controlshiftq::space.  Keeps telling me I have unrecognized action.  Cannot find this specific question in all of their help pages.  What do I need to put in the script to get the computer to recognize that when I push the space bar, I want it to recognize that as pushing control,shift,and the letter Q all at the same time?


How do I search (in some context) for questions that I have not answered?

Sometimes things are slow (no not here; I mean on smaller sites) and I go hunting for questions to answer.  I usually search by tag, but this of course turns up questions I've already answered -- which I often don't remember until I click through from the search results.  How do I search specifically for questions I have not answered?  I tried the advanced-search help but didn't find my answer there.


Per-site Meta reputation updating... slowly

I answered a question on Stack Overflow and it got an upvote. After a great several minutes I went to Meta Stack Overflow, and was surprised that my reputation was still 10 less than main, indicating that it was not up to time. Dear me it's been a quarter. Then I tested on another site and it seems to have the same problem. How can that happen?


I'd created a homebrew ooze monster with the same Split reaction that Black Puddings have. A PC cast Hold Monster on it before it was hit with any attack that would split it, so what would happen after it was cut in half? Would one of the halves still have the Hold spell on it, both of them or neither?


im just getting into python for my discrete structures and algorithms class > and for some reason, im getting an error with my syntax and I don't   understand why can you assist this is the error:       line 10      i = i + 1      IndentationError: unindent does not match any outer indentation level   also for some reason my code isn't printing   #linear search algorithm  def search(list1, n):     i = 0      while i < len(list1):          if list1[i] == n:             print("found now")             return True         i = i + 1      return False   list1 = [1,5,9,3,4,6] n = 6  if search(list1, n):     print("found") else:     print("not found")


If you don't get the question, that's exactly what I want to know.  Imagine we have a ordered list of fruits.  ["Apple", "Banana", "Peach", "Orange"]   I want the 3rd fruit in that list. But you don't know which one I want. How one asks which member in the sequence I want.  like:     What nth fruit do you want?   Now, I know that this is wrong. I'm looking for the right expression to ask this. I hope my question is now clear.


Maximum size and bandwidth of SE "voting telegraphy"? Is this a known thing?

Several months ago I was looking at one of my posts, and I noticed an up vote started to toggle. The vote count incremented by one, then decremented again, cyclicly. At my end the rate seemed faster than 2 Hz, and the toggling continued for several seconds. Say 10 full up-down cycles in all, as a short burst.  It felt a bit spooky, as if someone was trying to "send me a message" and that's weird because there's never been a case of non-verbal communication in SE ;-)  I'm wondering if there is an upper limit to the rate at which someone can indecisively toggle an up vote, or on the total number of toggles, before SE bots say "that's enough", or a limit on what people on the other end see?   Because of the way packets route, I assume this can't be easily used to send secret messages without sever corruption because the timing information is lost, at least as far as the viewer sees on the screen.  Is this a "known thing" and I'm just the last person to find out?


How to install and run GSconnect to have Android integration (fransfer files, send SMS/text, get notification & more) in Ubuntu?

How to install and run the Gnome extension  to connect your Android device with Ubuntu and integrate the device with Gnome Shell, Nautilus, Nemo file browser and Firefox (or Chrome) to be able to transfer files from/to phone, send SMS/text, get notification, monitor battery, sync clipboard between phone & desktop, control volume & music playback and more?


Do these infinite series converge to a finite limit?

Now, I know that there is that remarkable result which finds that $$\sum_{n=1}^{\infty}n=-\frac{1}{12}$$ for $n\in\mathbb{N}$, under some kind of Cauchy limit.   Are there any such convergences for the following series summations?   $\sum_{n=0}^{\infty} n$; $\sum_{n=0}^{\infty} n^2$.


Generic constraint to match numeric types

I'm trying to write an extension method on numeric types to be used in a fluent testing framework I'm building. Basically, I want to do this:  public static ShouldBeGreaterThan<T>(this T actual, T expected, string message)     where T : int || T: double || etc...   Just where T : struct doesn't do, since that will also match string and bool, and possibly something else I'm forgetting. is there something I can do to match only numeric types? (Specifically types that implement the > and < operators, so I can compare them... If this means I'm matching dates as well, it doesn't really matter - the extension will still do what I expect.)


Reloading DIV (site) prevents further OnClick-handlers + visibility

I have a DOM like this:

                          <button type="button" id="updateCatalogue">
     add new row
   I also have a JS-function which triggers correctly, when clicking "click new row". Have a look here:  $('.addNewRow').click(function() {      // determine closest wrapper     var wrapper = $(this).closest(".questions");     var kategorieId = $(this).data("row");      // add another row     $("
<input type='text' class='textinput_questions new_question' data-category='"+kategorieId+"' name='new_question["+kategorieId+"][]'><input type='checkbox' class='radioinput' style='margin-left: 6px !important;' name='new_questionActive[]'>").insertAfter(".question_wrapper:last"); });   This code works perfectly fine when I open my site and navigate manually to the DIV I'm currently in. Worth mentioning, I'm doing a bit ajax-stuff, which I guess is part of the problem:  $('#updateCatalogue').click(function() {      // inserting stuff      $('.new_question').each(function() {         data = "some data";         $.ajax({             url: "my-file.asp",             type: "GET",             data: data,             success: function(response) {                 console.log(question);                  // reload the frame afterwards                 $(".inner-content").load(location.href + " #catalogue");             }         });     }); });   The part in the updateCatalogue-function is processed correctly and the code inside my-file.asp is doing its job as well. But as soon as the page "reloads", I can't click on "add new row" anymore... or more like, it doesn't do anything after that. No JS errors in my console.  Since I'm reloading the whole page, I should have access to everything, right?      Sidenote: These functions are in $(document).ready() if this is important for that    These elements are not dynamically created (I guess), since the site is reloaded, even though trough an ajax-call


Why are potential differences equal across two capacitors in parallel, but charge on each capacitor is not?

Two or more capacitors are said to be connected in parallel if each one of them is connected across the same two points. In a parallel combination of capacitors potential difference across each capacitor is same but each capacitor will store different charge. Why is this true? Why is the potential difference across each capacitor in parallel the same and why will each capacitor store different charge?  Also, in series, why are Potential difference across each capacitor different, while charge is the same?


Why a working script does not execute as a cron job?

I wrote a script to backup a database. When I execute it directly, it works. I tried to make it a cron job and while it runs (I checked with service status cron) it seems that it silently fails.  Here is the script:  #!/bin/bash echo "Starting mongo backup" mkdir /home/ubuntu/backups docker exec -it mongodb mongodump --archive=/root/mongodump.gz --gzip docker cp mongodb:/root/mongodump.gz /home/ubuntu/backups/mongodump_$(date +%Y-%m-%d_%H-%M-%S).gz echo "Mongo dump complete" printf "[default]\naccess_key=\nsecret_key=\nsecurity_token=\n" > ~/.s3cfg s3cmd put /home/ubuntu/backups/* s3://my-backup-bucket/ echo "Copy to S3 complete" rm /home/ubuntu/backups/* -r echo "Files cleaned"   I used only absolute paths (EDIT: yeah actually I didn't), no environment variable, no un-escaped %. I don't know what I missed.


How to perform databse testing in selenium webdriver

I am new in selenium.i am trying for the database testing in selenium webdriver using eclipse.  i have install mysql 6.3 server and configure ojdbc14.jar and mysql-connector-java-5.1.25.jar in eclipse please help me for how to perform databse testing?


Is there an abelian group $R$ with multiplication operator with this properties ?    (i) $a(bc)=(ab)c$ (ii) $a(b+c)=ab+ac$  , $(b+c)a=ba+ca$        And a unique element $e$ s.t   (iii) $ea=a\quad \forall a\in R $     But there exists $x\in R$ s.t $xe\neq x$ .


How do I reinstall macOS to my Mac after formatting the main drive accidentally?

I recently installed Windows to my Mac and I have just formatted my hard drive on windows mistakenly while I was making a new hard drive partition on Windows. Now I cannot boot to macOS anymore.   How do I reinstall macOS to my Mac?


If you fall for a long enough period of time, would you eventually hit or break the speed of light?

If you theoretically fall through an infinite hole, and since the longer or higher you fall, the faster you would progressively go, would you eventually hit or even surpass the speed of light, and if this were so, wouldn't we time travel from going faster than it?


Is a Barbarian Totem Warrior a Spellcaster?

At third level, a Barbarian can take the Path of the Totem Warrior, gaining (among others), the following feature:  Spirit Seeker Yours is a path that seeks attunement with the natural world, giving you a kinship with beasts. At 3rd level when you adopt this path, you gain the ability to cast the Beast Sense and Speak with Animals spells, but only as rituals.  Is a Barbarian Totem Warrior a Spellcaster, for the purpose of using magic items that require attunement by a Spellcaster? If so, what is the spellcasting ability of a Totem Warrior, for the purpose of using magic items? The  and answers gloss over this particular case, but without giving a definitive answer for it.


I accidentally closed the window for the verfication code

I wanted to create an account for Ubuntu One, but I got impatient when the email with the verification code didn't arrive... I thought I might have typed the wrong address, closed the window and tried again. it told me the address already existed and I just got the code. But since I closed the window I missed it. Is there any way to recover the code?


Are the bonuses from the Belt of Physical Perfection and similar items temporary?

I'm confused about the wording in the description of the  and several other items that raise stats.  Do they only raise the stats for the first 24 hours and then they don't work anymore?


Running multiple commands for multiple files on one line

I'm attempting to run multiple commands on the same line for multiple files. I have little experience with Linux and I've run into an issue with this command:  tail -n +3 "/usr/local/tmp/csce215/election2008/"*/*.csv | head -n -1 > polls.csv   I'm attempting to get the "middle section" of each file by using tail and head in succession. Unfortunately, tail runs for each file correctly, but head only seems to run for the very last file. Is this possible to do in one command, or is there a better method for doing this? I'd preferably like to use head and tail.


Prove commuting matrices have the same eigenvectors.

Suppose $\mathbf A$ and $\mathbf B$ are both real, symmetric matrices. Suppose $\mathbf B$ has an eigenvalue $\lambda$ corresponding to eigenvector $\mathbf v$. Suppose that $\mathbf A$ and $\mathbf B$ commute. Therefore $$ \mathbf {BAv} = \mathbf {ABv} = \mathbf {A} \lambda \mathbf v = \lambda \mathbf {Av}$$ Therefore $\mathbf {Av}$ is an eigenvector of $\mathbf B$.   But this isn't good enough. For example, maybe (the transformation associated with) $\mathbf A$ maps $\mathbf v$ to some subspace orthogonal to $\mathbf v$. In that case $\mathbf {Av}$ is still an eigenvector of $\mathbf B$, but $\mathbf A$ does not simply scale $\mathbf v$ so $\mathbf v$ is therefore not an eigenvalue of $\mathbf A$.   What is missing from my proof to show that $\mathbf v$ is an eigenvector of $\mathbf A$ ?


Why the M1 chip memory limit is set to 16GB,it is mentioned  that it is based on 64 bit ARM architecture, shouldn't it share the same memory limit which is 16 Exabytes? According to the linked answer, it should have 34 address lines, has that number been made official?


How do I split an object into 2 parts when editing on another person's file?

So I was looking for free tree assets to add to my game and was trying to split the leaves from the trunk. The model is all in one object so I can't just delete it. Any ideas?


SFINAE check if expression compiles and return std::true_type

I want to get std::true_type if the following expression compiles:  template<typename T> static constexpr std::true_type check(T*) ?????? std::declval<T>().func_name( std::declval<Args>()... ) // method to check for   and std::false_type otherwise which I normally do with  template<typename> static constexpr std::false_type check(...);   I search something like enable_if which returns me a constant type if the expression compiles. Seems so easy but breaks my head :-)


What are the meaning of each category under WIPE menu in TWRP?

I'm new in using TWRP (version 3.0.0-0 to be specific), there are some menu or operation that confuses me.  Under WIPE menu and inside Advanced Options there are many choices to wipe, which are:   Dalvik / ART Cache, Cache, System, Data, Internal Storage, MicroSD, USB OTG   Can you explain what are each of those means one by one?  and also can you elaborate one by one the effect of wiping each of those 7 categories, for example IF let say I ONLY wipe Data, THEN it will only delete app data not the app itself nor any music, videos, pictures, downloads.  and also what will Factory Reset do? will it wipe all of those 7 categories? or will it only wipe some of them? if only some of them deleted, which of those 7 categories will be deleted under Factory Reset?  Lastly I notice that under Home > Advanced > Partition SD Card > on MicroSD I saw that the value stated there around ~5000MB while my external SD Card (removable MicroSD) is much more than that, which is 16GB, so it occurred to me that word "MicroSD" inside TWRP is not the same as the physical removable disk (SD Card / MicroSD), am I right? If yes, then what is the meaning of MicroSD inside TWRP?  Thank You.


Question 8. Jackie has 14 close friends. Find the number of ways she can invite 5 of them to dinner under the following conditions:   A. There are no restrictions.  B. Two of the friends are married to each other and will not attend separately.  C. Two of the friends are not speaking to each other and will not attend together.  So for no restrictions I think it would just be 14 choose 5.For B, I think it would be 14 choose 5 minus 10 because for each of the 5 "slots" that a friend could take up if one of them is from the married couple and the other isn't there it is a null possibility hence it is subtracted. For C, I think it would be 14 choose 5 minus 5 because there are 5 "slots" and if there are both people present in this set of 5, then that option would be subtracted. Am I going about this correctly? Thanks.


Why there is no value for $x$ if $|x| = -1$?

According to the definition of absolute value negative values are forbidden.  But what if I tried to solve a equation and the final result came like this: $|x|=-1$ One can say there is no value for $x$, or this result is forbidden.  That reminds me that same thinking in the past when mathematical scientists did not accept the square root of $-1$ saying that it is forbidden.  Now the question is :"is it possible for the community of math to accept this term like they accept imaginary number.  For example, they may give it a sign like $j$ and call it unreal absolute number then a complex number can be expanded like this:  $x = 5 +3i+2j$ , where $j$ is unreal absolute number $|x|=-1$  An other example, if $|x| = -5$, then $x=5j$  The above examples are just simple thinking of how complex number may expanded  You may ask me what is the use of this strange new term? or what are the benefits of that?  I am sure this question has been raised before in the past when mathematical scientists decided to accept $\sqrt{-1}$ as imaginary number. After that they knew the importance of imaginary number.


What to use to clean your chain (and cogs)?

I've just tried cleaning my chain and cogs with some really hot water and washing-up liquid. I also used a toothbrush, j-cloth and a non-scratch scourer. After over an hour of some serious elbow grease I could shift some of the outer dirt and muck, but still can't get the base layer of grease off. What can I use to completely strip the grease and muck off the chain?


Prove that $n! \geq 2^{n-1}$ for $ n\geq1$

Mathematical Induction:-Prove that $n! \geq 2^{(n-1)}$ for $n\geq 1$.  I tried mathematical induction but could not


How do I plot the graph of arctan using Tikz, NOT using pgfplots

I am trying to plot the atan() function, but it keeps giving me an error. This is my code. What in the world am I doing wrong? Why doesn't it plot on the graph I made. Also I cannot use pgfplots.   \begin{tikzpicture} \draw [help lines] (-5,-pi) grid (5,pi); \draw [->,thick] (-5,0) -- (0,0) -- (5,0) node [below] {\small $x$}; \draw [->,thick] (0,-pi) -- (0,pi) node [left] {\small $y$}; \foreach \x in {-5,-4,...,5} \draw (\x, -0.1) -- (\x,0.1); \foreach \x in {-5,-4,...,-1} \node at (\x, -0.1) [below] {\tiny $\x$}; \foreach \x in {1,2,...,5} \node at (\x, -0.1) [below] {\tiny $\x$};  \draw (-0.1, -pi/2) -- (0.1,-pi/2); \draw (-0.1, -pi/4) -- (0.1,-pi/4); \draw (-0.1, pi/4) -- (0.1,pi/4); \draw (-0.1, pi/2) -- (0.1,pi/2);  \node at (-0.1, -pi/2) [left] {\tiny $-\pi/2$}; \node at (-0.1, -pi/4) [left] {\tiny $-\pi/4$}; \node at (-0.1, pi/4) [left] {\tiny $\pi/4$}; \node at (-0.1, pi/2) [left] {\tiny $\pi/2$};  \draw [scale=0.5,domain=0:5,variable=\x] plot (\x,atan(\x r));  \end{tikzpicture}


defining new functions such that their names have a normal font

There are predefined functions somewhere such that when you use them in default theorem environments, their names appear in a normal (non-italicized) font. I want to be able to define my own functions and have this same effect. Here is an example of what I've been doing:  \documentclass{article} \usepackage{amsmath,amsthm,amssymb} \newtheorem{thm}{Theorem} \newcommand{\dom}[1]{\text{dom}{#1}}  \begin{document} \begin{thm} function has normal font: $\sin(0)$ \\ function does not have normal font: $\dom{f}$ \end{thm} \end{document}   How do I accomplish this?


How to get MethodInfo of a generic method on a non generic .NET type?

I have this little problem, that I cannot figure out which arguments to pass to Type.GetMethod in order to get back the MethodInfo of a generic method on a non generic type. Specifically, I have this type definition:  public static class A {   public static B F<T>(bool dummy)   {   }   public static B F<T>(IEnumerable<T> arg)   {   ...   } }   I have tried several takes at Type.GetMethod, but none would return the MethodInfo of the F method.  I am aware that I can invoke Type.GetMethods or even Type.FindMember, but I am interested in Type.GetMethod.  Any ideas?  Thanks.  EDIT  Actually, my code is a bit more complex. The generic method is overloaded, so I cannot use the Type.GetMethod with just the function name. I tried these variants:  typeof(A).GetMethod("F", BindingFlags.Static | BindingFlags.Public, null, new Type[]{ typeof(IEnumerable<>) }, null) typeof(A).GetMethod("F`1", BindingFlags.Static | BindingFlags.Public, null, new Type[]{ typeof(IEnumerable<>) }, null) typeof(A).GetMethod("F[T]", BindingFlags.Static | BindingFlags.Public, null, new Type[]{ typeof(IEnumerable<>) }, null) typeof(A).GetMethod("F[[T]]", BindingFlags.Static | BindingFlags.Public, null, new Type[]{ typeof(IEnumerable<>) }, null)


Remove HTTPS site from Google search index because users are getting a certificate error

We have a busy website where we never used SSL. Recently its indexed by Google as https://www.example.com.  The users are getting security certificate errors.   In google webmaster tools we can only remove the relative URL. For example, any thing after http://www.example.com.   I am using IIS 6.0 to host the site .net website.   I have seen similar posts here and there and almost all of them recommend a redirect. I don't want to set up a redirect as it will slow down the site loading. I guess I would also need to setup a new website on IIS  with HTTPS protocol and then do the redirect to HTTP site?


How to download the latest Ubuntu repo and make it available locally in my PC offline?

I want to install Ubuntu in a PC with no internet access.  I want to have a local copy of the repositories in an external HD drive. This external HD drive is formatted as NTFS and has about 1 TB of free space.  How much space will I need to have a full copy of the repositories? Where and how do I download it? How do I set it up so that when I plug in the external HD, my PC sees it as the source repository?  Update: I have been reading , and I downloaded all the files inside  (binaries for architecture amd64). I think I've done something wrong, because it totals to only about 50 MB. Isn't it supposed to be around 50 GB?


KDE Desktop icons glitched after suspend (Kubuntu 16.10)

I have a system76 laptop (Oryxp3) which works flawlessly with Kubuntu, hibernation and suspension too, drivers and everything too (battery sucks, but it's mostly a software problem which will take a lot of time to address), but for whatever reason only the DESKTOP makes some weird glitches when resuming from suspension/hibernation.  I can fix it by changing Layout from "Folder view" to "Desktop", applying and then reverting back to "Folder view", so it seems like a refresh problem.  Although I would love to have either a proper fix to refresh my desktop after suspend, or a command to do that. A hack or a workaround that I can bind to a command, I'm just too lazy to unlock widgets, right click, change option, apply, revert, apply every restore from suspension.  My GPU is NVIDIA GTX 1070 with NVIDIA drivers: 375.39  Here is how it looks, although sometimes is worse and the font gets all colored in weird ways and it's unreadable:


collision doesn't work in render (it works well when I play a preview before rendering!)

I'm trying to make some balls fall on a cube and not to fall through it. everything works well after I set the stickiness to 10, but in the render result the balls go though the cube (I'm using blender 2.8 and tried EEVEE and Cycles render but both don't work) I've tried working around all the settings in render, particles and collision taps but non of them worked.


Show that $\operatorname{Hom}_R(F,M)$ is isomorphic to $M^n$

Let $R$ denote a commutative ring with $1$, $M$ an $R$-module and $F$ a free $R$-module with rank $n$. Show that $\operatorname{Hom}_R(F,M)$ is isomorphic to $M × ⋯ × M$ (n times). How would I go about this? I did prove that $\operatorname{Hom}_R(M,N)$ is an $R$-module  for any $M,N$ $R$-modules just before.


Can the update statement in for loop work with both postfix with prefix? (i++ and ++i)

For example #include<stdio.h> int main() {     for(int i=1; i<=10; ++i)     {         printf("%d \n", i);     }     return 0; }  Can the ++i in the for loop updation be i++?


Calculating the transfer function and bode plot

What is the transfer function and bode graph when k=0 and k=1?


Can one be "interested with" something?  As an example, I have a co-worker that asks:      "Are you interested with this position?"


How to solve this equation in general $ax^3+bx^2+cx+d=0 ?$

For example if you have $ax^2+bx+c=0$ then solution given by formula $$x=\frac{-b\pm\sqrt{b^2-4ac}}{2a}.$$  Is there formula like this for $ax^3+bx^2+cx+d=0 ?$


Hierarchical sample MySQL or cluster sample

A table contain data like      And i want it like this     I want all the text in one row, without repetition of user_id using MY_SQL.


I have created an application in .Net with Microsoft SQL Server for desktop with a local database and an online application with an online database.  Data entry will be done on both platforms in real-time.  How can I synchronize the desktop database with the online database (as primary) in real-time without any data loss?


backup compatibility between SQLExpress 2012 and 2016

May I make a backup from SQLExpress 2012 and restore it into a SQLExpress 2016?


Send an email from an iPhone app containing an img tag

I am trying to send the user to the mail app from my native app. I would like the embed a  tag into the body of the message. I know this is possible because the 'LOL Cats' app does it. I have been trying without success:      NSString *url1 = [NSString stringWithFormat:@"mailto:email@email.com?subject=Check%20Out%20This%20Faux%20Screen&body=<img%20src=\"http://www.sample.com/FauxFoneServer/screenShot/getScreenByID?cur=%@\"/>The%20awesome%20person%20who%20sent%20you%20this%20email%20thinks%20you%20should%20visit%20http://www.fauxscreen.com"                          ,[ScreenShotsAppDelegate sharedDelegate].viewController.curImage.imageID]; [[UIApplication sharedApplication] openURL:[NSURL URLWithString:url1]];


The Follow Questions and Answers feature is now live across the Network

We are happy to announce that the  follow question and answer feature is now live across the Network, including Stack Overflow, all Stack Exchange sites, and all Meta sites. (International Stack Overflow sites will have it turned on in a day or two once we have translations all set.) You can follow any question or answer (that you did not author) by clicking on the [follow] button that is shown in the menu immediately below the post (alongside the [share] button):    After you have followed a post, you will get inbox notifications for all new answers (in the case where you followed a question), comments, edits, and notices. You will not receive notifications for any action that you performed. As was mentioned in the earlier post, we are not making changes at this point to the notifications received by a post owner, or due to @mentions. The initial release had been planned to only include question following. Thanks to many folks who chipped in over the past few weeks, we are happy to release both question and answer following at the same time. These are available in both the regular and mobile views. We are still planning on two more related releases:  Follows profile tab and question listing filter: A tab for follows will be added to your user profile activity page. Each user will be able to view this tab that will provide a listing of followed questions and answers, with standard sorts, and the ability to unfollow from the listing. Users (with the exception of moderators and authorized staff) will not be able to see this information about other users (nor will it be made public in the API, SEDE, or data dumps). We will be renaming the Favorites feature to Bookmarks. As we mentioned in the preview post, the feature will be the same as Favorites, with the name and icon updated to more accurately represent user expectations and usage. And you will be able to both "bookmark" and "follow" a question.  We hope that this new feature will allow you to have better access to the content that you care about and want to keep tabs on. Update (June 11, 2020): The user profile tab and the rename of Favorites to Bookmarks have been released.


How to change timezone in recovery mode?

I have a MacBook pro and I'm trying to instal OS X El Capitan on a clean formatted SSD hard drive. While installing I encounter an error saying "this copy of the instal os x el capitan application can't be verified...". After some search in the internet I realized the problem is due to date and time being not correct. I corrected the time but I couldn't find a way to change the time zone because whenever I type "systemsetup" command I receive the "command not found" error. I will be more than happy if anyone can help me with this problem. Thanks


Do you know the value of an attack or damage roll on you before the hit is resolved?

In D+D 5e, there are many effects that enable AC, attack rolls, or damage rolls to be modified after being rolled but before the hit is resolves. Examples are the Shield spell and the "Parry" Battle Master maneuver.  When the opponent makes an attack roll against you, is the DM supposed to roll and say, e.g. "does an 18 hit your AC", or are you supposed to tell the DM your AC in advance and he just tells you if it hit or not? This is relevant because in the first case, you will always know if a Shield spell (for instance) would avoid the attack.  Same thing with damage rolls - do you know how much damage was rolled before you decide whether to use a Parry?


foo="bar"; if(foo == "bar"){ doX(); }else{ "But this ALWAYS runs" } Why?

My class implements a very simple prototype of an RPN calculator.  The following construct isn't working. Why? What am I doing wrong here?  public boolean executeCommand(String command) {     if(command == "+")      { add();          return true; }else     if(command == "-")      { subtrair();     return true; }else     if(command == "*")      { multiplicar();  return true; }else     if(command == "/")      { dividir();      return true; }else         {             System.out.println("The command does not exist.");             return false;         } }   The output is always, no matter what the string contains,  The command does not exist.   Why? I really don't get it! If someone could please explain, I'd be thankful!    In more detail  The method in question is:  public boolean executeCommand(String command) {     Scanner str = new Scanner(command);      if (str.hasNextDouble()) {         dataStack.push(str.nextDouble());         return true;     } else {          System.out.format(" DEBUG: command: %s$%n", command);          if(command == "+")      { add();          return true; }else         if(command == "-")      { subtract();     return true; }else         if(command == "*")      { multiply();     return true; }else         if(command == "/")      { divide();       return true; }else         if(command == ".")      { print();        return true; }else         if(command == ".s")     { showStack();    return true; }else         if(command == "exit")   { exit();         return true; }else             {                 System.out.println("The command does not exist.");                 return false;             }     } }   which, for any input I threw at it, (except for numbers, of course), resulted in:   DEBUG: command: [COMMAND HERE]$ The command does not exist.     Source code  I removed some irrelevant source code; (i.e. some methods, package name) but it is still compilable and runnable:  import java.util.Scanner; import java.util.LinkedList;  public class RPNCalculator {      public static void main(String[] args) {         RPNCalculator calc = new RPNCalculator();         calc.startInteractiveMode();     }      protected Scanner scanInput;     public LinkedList<Double> dataStack;     protected boolean interactiveModeEnabled;      public RPNCalculator() {         scanInput = new Scanner(System.in).useDelimiter("\\s+");         dataStack = new LinkedList<Double>();     }      public String getCommand() {         return scanInput.next();     }      public boolean executeCommand(String command) {         Scanner str = new Scanner(command);          if (str.hasNextDouble()) {             dataStack.push(str.nextDouble());             return true;         } else {              System.out.format(" DEBUG: command: %s$%n", command);              if(command == "+")   { ommitedOp("add");      return true; }else             if(command == "-")   { ommitedOp("subtract"); return true; }else             if(command == "*")   { ommitedOp("multiply"); return true; }else             if(command == "/")   { ommitedOp("divide");   return true; }else             if(command == ".")   { ommitedOp("print");    return true; }else             if(command == ".s")  { ommitedOp("showStack");return true; }else             if(command == "exit"){ ommitedOp("exit");     return true; }else                 {                     System.out.println("The command does not exist.");                     return false;                 }         }     }      public void startInteractiveMode() {         interactiveModeEnabled = true;          while (interactiveModeEnabled) {             String command = getCommand();             executeCommand(command);         }     }      public void ommitedOp(String method){         System.out.println("Command exists!");     } }


Prove that $\int_X |f|^p = \int_0^\infty pt^{p-1} \mu (\{x:|f(x)| \geq t\}) dt$

I am stuck in this problem. We can assume that we are working in a $\sigma$-finite measure space and we have some measurable function $f$.  Now, the first thing I do is obtain two integrals  $$\int_0^\infty pt^{p-1} \mu(\{x:|f(x)|\geq t\}) dt = \int_0^\infty \int_Xpt^{p-1} \chi_{\{x:|f(x)|\geq t\}} d\mu dt$$  Now, since we are working under the assumption that $p>0, t\geq 0$ and also since the indicator function $\chi$ is non-negative, we can use Fubini's theorem to swap the integrals, and get  $$\int_X \int_0^\infty pt^{p-1} \chi_{\{x:|f(x)|\geq t\}} dt d\mu$$ From here, I am unsure if I should somehow prove that the integrand is Riemann-integrable so I can perform a change of variables. On the other hand, I saw that, for the special case $p=1$, the following identity is used:  $$\int_0^\infty \chi_{\{x:|f(x)|\geq t\}} dt = \int_0^{|f(x)|} dt$$  Is it possible to use a change of variables $s = t^p$ to get the following integral?  $$\int_0^\infty \chi_{\{x:|f(x)|^p\geq s\}}ds=\int_0^{|f(x)|^p}ds$$  If so, how can this be made rigorous? Also, how do I prove the identity?


Ctrl+Alt+F7 doesn't switch back to X session in Kubuntu 18.04 Bionic

After I switch to virtual console using Ctrl+Alt+F6 I could not get back to X session using Ctrl+Alt+F7 - only blinking cursor is shown. Tried chvt - same result. Have to reboot and lost all my opened apps which is very inconvenient. Kubuntu version is 18.04 Bionic.  Could anybody help?


in this example, how can I customize \autoref. ie instead of printing table 1, it puts Tab.1 same question with Figure = Fig. and equation = Eq.  \documentclass{article} \usepackage[T1]{fontenc} %\usepackage[francais]{babel}  \usepackage{graphicx} \usepackage[font=footnotesize,labelfont={bf,sc,small},figurename=Fig.,tablename=Tab.]{caption} \usepackage[colorlinks=true,linkcolor=blue]{hyperref}   \begin{document}  change the writing of \autoref{tab} to Tab.1  \begin{table}[htbp] \begin{center} \begin{tabular}{|l|l|} \hline table & Tab. \\ \hline figure & Fig. \\ \hline equation & Eq. \\ \hline \end{tabular} \end{center} \caption{Exemple d'environnement table} \label{tab} \end{table}  \end{document}


Suppose, that $ K $ is normal subgroup of $ N $, and $ N $ is also normal subgroup of $ G $. Prove, that $ K $ needn't be normal subgroup of $ G $. I can give only counter-example?


Restoring a SQL Server 2008 R2 backup on SQL Server 2005

I'm getting an error whenever I restore a testing database on SQL Server 2005 that was backed up from SQL Server 2008 R2. It seems that I cannot restore from a higher version of sql onto lower version, how can I solve this?     The media family on device is incorrectly formed. SQL server cannot process this media family. RESTORE HEADERONLY is terminating abnormally.   I already tested to restore the same file in its own server (SQL Server 2008 R2) and it works, so it's not corrupted.  I cannot install the updated version of SQL into my older server, so how can I use my older SQL Server 2005 as a dev server but with the updated life data from a different instance?


Is there any way to start Steam in offline mode without logging in first?

I recently find myself needing to start Steam in offline mode rather frequently (my wife is hogging my account to play Plants Vs. Zombies, and most of what I play doesn't really need to be online).  I was wondering if there is some way to launch Steam in offline mode without first logging in (and selecting it from the menu), since that usually beats the purpose.  While I know that killing my network connection before launching Steam is an option, I am looking for a more "civilized" way, such as a command line switch or something of the sort.


Ramanujan's radical and how we define an infinite nested radical

I know it is true that we have  $$\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+\cdots}}}}=3$$  The argument is to break the nested radical into something  like  $$3 = \sqrt{9}=\sqrt{1+2\sqrt{16}}=\sqrt{1+2\sqrt{1+3\sqrt{25}}}=...=\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+\cdots}}}}$$  However, I am not convinced. I can do something like  $$4 = \sqrt{16}=\sqrt{1+2\sqrt{56.25}}=\sqrt{1+2\sqrt{1+3\sqrt{\frac{48841}{144}}}}=...=\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+\cdots}}}}$$  Something must be wrong and the reason behind should be a misunderstanding of how we define infinite nested radical in the form of  $$ \sqrt{a_{0}+a_{1}\sqrt{a_{2}+a_{3}\sqrt{a_{4}+a_{5}\sqrt{a_{6}+\cdots}}}} $$ I researched for a while but all I could find was computation tricks but not a strict definition. Really need help here. Thanks.


Prove that three points are enough to draw/define one and only one circle, how would this be done?


Why is the differentiation of $e^x$ is $e^x$?

$$\frac{d}{dx} e^x=e^x$$ Please explain simply as I haven't studied the first principle of differentiation yet, but I know the basics of differentiation.


Resolution Settings when Rendering Animation

I finally found where the format menu is (yay) but when I rendered the animation it came out 360x240 size. It's going to be in a video displayed on large TV screen so that's not going to work. So now where do I adjust settings so it's 1280x720 when animation is rendered? I'm so so close and getting excited that I may end up being able to this for intro on my project. (Using the 20th Century Fox logo animation)


Counter-example to exponential law for locally compact [non-Hausdorff] spaces

There is a natural bijection $$ \operatorname{Map}(X\times Y,Z)\cong\operatorname{Map}(X,\operatorname{Map}(Y,Z)),\quad f\mapsto(x\mapsto(f(x,{-})).  $$ If $X$, $Y$, $Z$ are topological spaces one can ask if the 'exponential law' $$ C(X\times Y,Z)\cong C(X,C(Y,Z)) $$ still holds. And for the compact-open topology on $C(-,-)$ it is well-known that if $Y$ is locally compact and Hausdorff (or just strongly locally compact) and $X$ is Hausdorff, then above bijection induces such a homeomorphism.  I'm asking for a counter-example to the exponential law in the case where $Y$ is still (strongly) locally-compact but no separation axioms are assumed.  Comments. AFAICS,   If $Y$ is (strongly) locally-compact the set-theoretical exponential law always induces a bijection between LHS and RHS. This bijection maps open sets of the form $M(K_1\times K_2,U)$ to open sets of the form $M(K_1,M(K_2,U))$ (where $M(K,U)=\{f:f(K)\subset U\}$). If $X$ is Hausdorff the later sets form a subbase of the compact-open topology on RHS.   This explains where Hausdorff condition is used in the proof (in the form it's written e.g. in Hatcher's AT book) — but I'd still would like an explicit counter-example.


Basic demonstration concerning the natural logarithm...

Recently saw a question that asked me to show that $\ln\left(\sqrt{2} - 1\right) = - \ln\left(\sqrt{2} + 1\right)$. How can I demonstrate that the LHS equals the RHS?


Optimization paramters read-only mysql 5.7 database?

What's the best way to configure a MySQL database that is only read-only, and will never have any modifications made to it?  1) I have increased my innodb_buffer_pool_size to 70% of available RAM  2) Increase query cache size to 40mb  Running against a load generator, after some time the database starts bottlenecking to only 1000 statements per second.  The configuration is 2-cores, 8GB ram 50GB SSD. The database contains a single InnoDB 13 GB table with the same exact query running on two indexed columns.  We are using a vertx server to hit the database. The symptom we see is that the web service performance degrades after 15-20 minutes of heavy load.  Where can the bottleneck be? What parameters should we optimize?


If the observable universe keeps expanding would we eventualy see light 24/7.... clouds permiting?

If we can see more observable universe could there be a time when day and night looked the same?


Is it possible to find power armor in the wasteland?

If you send somebody out in the wasteland for long enough with good enough luck, is it possible to find power armor or any other legendary gear?


Windows 7 - how to set up file sharing between domain clients?

How can I setup a share on a client computer in a Windows 2012 Essentials domain?  I have 2 PCs logged into this domain, and I would like to share computer A's documents with computer B.  Is there a way to do this?


I routinely hear the word "efficate" being used.  For example, "The most powerful way to efficate a change in the system is to participate."  I do not find entries for this word in common English dictionaries, but I do not have an unabridged dictionary.  I have checked the OED (I'm not sure if it is considered unabridged), and it has no entry for "efficate".  It does have an entry for "efficiate", which is used in the same way.  Wordnik has an  for "efficate" with over 1800 hits, thus providing some evidence for the frequency of use.  I personally like the word and find the meaning very clear and obvious when others use it.  If it's not currently an "officially documented" word, perhaps its continued use will result in it being better documented.


Creating a custom applet (AppIndicator?) Unity

I have a little GTK application I've created which is basically a simple Switch. I would like to see if anyone knows if it is possible to add to the menubar in ubuntu. Almost like the power button in the corner. I'd just like to be able to have it sit there and toggle it from time to time to have it run custom code (which turns on my air conditioner via curl/wifi smart plug) similar to a widget I suppose. So rather than having a separate application it just sits there neatly up the top. Any ideas on how to do this if it is possible which I will assume it is but I don't know how ;-)  Executive summary; take a standard GTK switch button and attempt to embed it into the unity menu bar, is it possible?  Thanks Jack


I recently saw an MO post  which claimed that LaTeX does not support French-style numbering, where references to (3.7.6) appear as (6) inside Subsection 3.7, as (7.6) inside Section 3, and as (3.7.6) all other places.  Of course, the default reaction to such a claim is "yes it does; you just have to use package …", but I don't know what package to fill in.  To be clear, what I am looking for is, as near as possible, how to make the following a working document:  \documentclass{article} \usepackage{???} % What to use? \begin{document} \begin{section} \eqref{eq:eq} % => (2.1.1)  \begin{section} \eqref{eq:eq} % => (1.1)  \begin{subsection} \begin{equation}\label{eq:eq} 2 = 1 + 1. \end{equation} All that wait for \eqref{eq:eq}? % => (1) \end{document}   I'm illustrating this with equations, but I'd like it to work for all numbered environments.  Bonus points if the answer can really fit the French style, where, for example, the propositions in Subsection 9.6 are numbered only if there is more than one, and otherwise references to the lone proposition in that subsection will be numbered "Proposition 9.6".  (Despite my calling this 'French' style, the first example that comes to mind is Borel's "Linear algebraic groups"  .)  Apologies in advance if this is a duplicate; I can't believe that it's not, but I couldn't find it.  I searched here for "French numbering" and "local numbering", but the former just seemed to turn up accidental coincidences of 'French' and 'numbering' in the same post, and the latter to turn up posts about changing the label format for one particular result, but still having all references to it format the same way.


Word for a person who loses or has lost faith?

Does a word exist for a person who has lost faith?    I am looking for a single word that represents a person who lost faith, e.g. in religion, humanity, himself. The more general, the better.


Choosing cell size in LAS Dataset to Raster Tool

I am creating a raster from an LAS Dataset (LAS Dataset represents only the ground return).    I am wondering how do you choose the sampling size? (which I have set to cell size)  My point spacing is 1.886 and my point density is 0.2811.


Ubuntu 16.04 LTS wifi suddenly stopped working at all Alienware 13

I have installed Ubuntu 16.04 on my Alienware 13 laptop and everything worked like charm for couple of weeks. Then, suddenly, the wifi completely stopped working. I am not aware of installing any updates, it really happened from day to day.   I reinstalled the system and the same happened again - after a week or so it suddenly stopped working.  Here are some outputs people usually asked for:  rfkill list 0: dell-rbtn: Wireless LAN     Soft blocked: yes     Hard blocked: yes 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no 2: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no  lspci -knn | grep Net -A2 01:00.0 Network controller [0280]: Qualcomm Atheros QCA6174 802.11ac Wireless Network Adapter [168c:003e] (rev 20)     Subsystem: Bigfoot Networks, Inc. Killer N1525 Wireless-AC [1a56:1525]     Kernel driver in use: ath10k_pci     Kernel modules: ath10k_pci    dmesg | grep ath  [3.412880] ath10k_pci 0000:01:00.0: enabling device (0000 -> 0002) [3.413610] ath10k_pci 0000:01:00.0: pci irq msi-x interrupts 8 irq_mode 0 reset_mode 0 [3.665367] ath10k_pci 0000:01:00.0: Direct firmware load for ath10k/cal-pci-0000:01:00.0.bin failed with error -2 [4.981098] ath10k_pci 0000:01:00.0: qca6174 hw2.1 (0x05010000, 0x003405ff sub 1a56:1525) fw SW_RM.1.1.1-00157-QCARMSWPZ-1 fwapi 5 bdapi 2 htt-ver 3.1 wmi-op 4 htt-op 3 cal otp max-sta 32 raw 0 hwcrypto 1 features ignore-otp,no-4addr-pad [4.981102] ath10k_pci 0000:01:00.0: debug 0 debugfs 1 tracing 1 dfs 0 testmode 0 [5.057702] ath: EEPROM regdomain: 0x6c [5.057705] ath: EEPROM indicates we should expect a direct regpair map [5.057707] ath: Country alpha2 being used: 00 [5.057707] ath: Regpair used: 0x6c [5.064516] ath10k_pci 0000:01:00.0 wlp1s0: renamed from wlan0   Any help would be very appreciated. Especially explaining, why it stopped working so suddenly.


I am playing a level 11 wizard and I have a  familiar. It has the  type, which grants 6 + INT_MOD skill points per hit dice.   Familiars have hit dice equal to their master's hit dice.   Familiars get the best of the master's skills and their own skills:      Skills: For each skill in which either the master or the familiar has ranks, use either the normal skill ranks for an animal of that type or the master’s skill ranks, whichever is better. In either case, the familiar uses its own ability modifiers. Regardless of a familiar’s total skill modifiers, some skills may remain beyond the familiar’s ability to use. Familiars treat Acrobatics, Climb, Fly, Perception, Stealth, and Swim as class skills.   Based on their , (as well as  and ), it seems to me that the Pseudodragons have the following skill points already assigned to their base kit:   Diplomacy: 2  Fly: 2 10 Perception: 2 Sense Motive: 2 Stealth: 5 13 Survival: 2   If that's accurate, then it seems that I should have 51 additional skill points to assign for the familiar's skills. Is that right, or am I completely misunderstanding how skills work for familiars?


Let $M$ and $N$ be square matrices such that $M^2+N^2=MN$. Then prove that $MN-NM$ is singular.  So basically I have to prove: $\det(MN-NM)=0$. I tried to prove this by multiplying the given condition by the inverse of matrices $M$ and $N$, but could not come to the answer. Could anyone please give a hint?


Getting Started with reledmac/reledpar Package (Parallel Text)

I want to use the parallel text feature of the  package with requires the  as far as I understand.  I tried the very basic example from the documentation (, page 8) and I get an error message.  Before you want to compile my example make sure that your system is updated. The packages are pretty new.  \documentclass[]{scrbook}  \usepackage[]{reledmac} \usepackage[]{reledpar}  \begin{document}  \begin{pairs}     \begin{Leftside}         Text left.     \end{Leftside}     %     \begin{Rightside}         Text right.     \end{Rightside} \end{pairs} \Columns  \end{document}      ! Package reledpar Error: \Columns called without previous pairs   environment.


Proof of Convergence: Babylonian Method $x_{n+1}=\frac{1}{2}(x_n + \frac{a}{x_n})$

a) Let $a>0$ and the sequence $x_n$ fulfills $x_1>0$ and $x_{n+1}=\frac{1}{2}(x_n + \frac{a}{x_n})$ for $n \in \mathbb N$. Show that $x_n \rightarrow \sqrt a$ when $n\rightarrow \infty$. I have done it in two ways, but I guess I'm not allowed to use the first one and the second one is incomplete. Can someone please help me?  We already know $x_n \rightarrow \sqrt a$, so we do another step of the iteration and see that $x_{n+1} = \sqrt a$.  Using limit, $x_n \rightarrow x, x_{n+1} \rightarrow x$ (this is the part I think it's incomplete, don't I have to show $x_{n+1} \rightarrow x$, how?), we have that   $$x = \frac x 2 (1 + \frac a {x^2}) \Rightarrow 1 = a/x^2 \Rightarrow x = \sqrt a$$ b) Let the sequence $x_n$ be defined as $x_{n+1}= 1 + \frac 1 {x_n} (n \in \mathbb N), x_1=1$. Show that it converges and calculate its limit. "Tip: Show that sequences $x_{2n}$ and $x_{2n+1}$ monotone convergent to the limit." I didn't understand the tip, how can this help me? Does it make a difference if the number is odd or even? Thanks in advance!


Understanding return statement in the function finding the median of numbers

I have this function:  def median(numbers):     middle = int(len(numbers)/2)     return numbers[middle]  print(median([4, 5, 6, 7, 8]))   The writing style of this line is a bit confusing for me:  return numbers[middle]   If I am not mistaken it returns the input numbers' order in a list. Is there a different way to read this line?


How to solve $\int_0^{\infty} \frac{\log(x+\frac{1}{x})}{1+x^2}dx$?

Here is my question  $$\int_0^{\infty} \frac{\log(x+\frac{1}{x})}{1+x^2}dx$$  I have tried it by substituting $x$ = $\frac{1}{t}$. I got the answer $0$ but the correct answer is $\pi log(2)$. Any suggestion would be appreciated.


Tangents of ellipse going through a point outside of it

I have an ellipse: 5x^(2) + 9y^(2) = 45; and a point M = [0; -3]; how do I find tangents of said ellipse that go through the point M? Please, help.


How would you find this sum mathmatically?$$\sum_{i=0}^\infty \left( \dfrac{1}{2} \right) ^{i!}$$   What techniques would you use to solve this as well?


How is missing data calculated on Likert Scale?

I have the following scales:   1 (Strongly Disagree); 2 (Disagree); 3 (Not Applicable); 4 (Agree); 5 (Strongly Agree);     Questionnaire responses:   Question Item1: 2; Question Item2: 3; Question Item3: 1; Question Item4: 1; Question Item5: 4;   If I need to average the above responses into the Excel Sheet, while treating Question Item2: zero (since it is considered missing data), do I need to divide by 5 or 4 items to obtain the average?  $$\text{Average} = \frac{2 + \mathbf 0 + 1 + 1+ 4}{5}\quad\text{or}\quad\text{Average} = \frac{2 + \mathbf{\_} + 1 + 1+ 4}{4}$$  Kindly advise.


How to include css for plugin setting page?

I have created a plugin settings page in the WordPress dashboard menu. I want to include css file for that settings page. How can I do that? I am trying following in my plugin, but it does not include the css file on the plugins settings page:  function my_enqueue_styles() {     wp_enqueue_style( 'my_plugin', plugins_url('my_plugin/plugin.css') ); } add_action( 'wp_enqueue_scripts', 'my_enqueue_styles' );


Does the Mind Spike spell end if the target foes out of range?

Mind Spike says  On a failed save, you also always know the target’s location until the spell ends, but only while the two of you are on the same plane of existence.  DnD Beyond lists this having a range/area of 60ft. Does this mean if my target teleports (remaining on this plane of existence) away I stop knowing where they are outside of the 60ft? Or is that the initial range?


How does ist come that c and today is not visible in fetchingData() ? I get a NullPointer-Exception when running the code in main-class :/ Thanks for any help!  public class InputData {      Calendar c;     Date today;      String DATE_FORMAT = "MM/dd/yyyy";     SimpleDateFormat sdf;      Double[][] hPrice;     Double[][] qhPrice;     Double[][] qhEua;     Double[][] qhGas;     Integer[][] qhTemperature;     Integer[][] qhAirpressure;      Date[][] qhDate; // may be useful some day     Date[][] qhWeatherDate; // may be useful some day      public InputData() {         Calendar c = Calendar.getInstance();         Date today = new Date();         today = c.getTime();         SimpleDateFormat sdf = new SimpleDateFormat(DATE_FORMAT);         System.out.println(sdf.format(today));     }      public void startFetching() {         // +++ Access-Import EUA's +++         Access aQuery = new Access();         c.add(Calendar.DATE, -1);         today = c.getTime();         aQuery.eua(sdf.format(today));


Does one have to list all publications on a CV?

Some years ago, I published some papers that I'm not particularly proud of. They aren't in prestigious or widely known venues in my field, and I'm sure that few if any people in my field have seen these papers. When I apply for a job, am I permitted to omit these publications from my CV? Or am I, for some reason, obligated to list all prior publications?


Can I install 1333 MHz memory onto a laptop supporting up to 1066 MHz memory?

I have a question regarding my laptop's RAM.  I have 2 slots. One is empty; the other one has a Samsung SODIMM 204-pin 2GB DDR3 1333MHz SDRAM CL9, non-ECC, unbuffered module, running at 1066 (!) MHz, because the motherboard supports this maximum frequency, and in single channel mode.  Is it OK for me to add, in the empty slot, a Samsung SODIMM 204-pin 2GB DDR3 1066 MHz SDRAM CL8 (!), non-ECC, unbuffered RAM module?  Will they work fine with both running at 1066 MHz?  And will it be activated in dual channel mode in this case?    Well, the different apps show me that the RAM module is running at 1066 MHz, the guide for my laptop says it supports 1066 MHz DDR3 Dual Channel. And also they show me that it runs in single channel mode. Tried to see the tech specs on an almost similar laptop, with 2 modules identical to this one, they run both at 1066 MHz (even if they are 1333 MHz both), and the Dual Channel mode is activated (Dual Channel Ungaged, supose it's ok).


5 Band resistors and correct orientation

few days ago i bought few (about 500) resistors and i noticed that they have 5 color bands instead of 4. My question is how do i count them (which color is the tollerence) and how should i put them? Do they have a good or bad orientation like + or - ? I tried to use an online calculator but i dont know the first and the last band.


How do I fix NullPointerException for populating a controller in JavaFX?

Building an application in JavaFX, using a table to populate customer name and id and then added a button that launches another form once a customer name is selected from the table. I am getting errors in.  I have tried to change the name populateCustomerAllName, tried to change the return type   @FXML  public void handleAddButton() {     if(customerAllTable.getSelectionModel().getSelectedItem() != null) {         selectedCustomer = customerAllTable.getSelectionModel().getSelectedItem();     } else {         return;     }     Dialog<ButtonType> dialog = new Dialog();     dialog.initOwner(appointmentMain.getScene().getWindow());     FXMLLoader fxmlLoader = new FXMLLoader();     fxmlLoader.setLocation(getClass().getResource("AppointmentAdd.fxml"));     try {         dialog.getDialogPane().setContent(fxmlLoader.load());     } catch(IOException e) {         System.out.println("AppointmentAdd Error: " + e.getMessage());     }     ButtonType save = new ButtonType("Save", ButtonBar.ButtonData.OK_DONE);     dialog.getDialogPane().getButtonTypes().add(save);     dialog.getDialogPane().getButtonTypes().add(ButtonType.CANCEL);     AppointmentAddController controller = fxmlLoader.getController();   //error with populating .getCustomerAllName         controller.populateCustomerAllName(selectedCustomer.getCustomerAllName());     dialog.showAndWait().ifPresent((response -> {         if(response == save) {             if(controller.handleAddAppointment(selectedCustomer.getCustomerAllId())) {                 monthAptTable.setItems(AppointmentDB.getMonthlyAppointments(selectedCustomer.getCustomerAllId()));                 weekAptTable.setItems(AppointmentDB.getWeeklyAppoinments(selectedCustomer.getCustomerAllId()));             } else {                 Alert alert = new Alert(Alert.AlertType.ERROR);                 alert.setTitle("Error");                 alert.setHeaderText("Add Appointment Error");                 alert.setContentText(controller.displayErrors());                 alert.showAndWait().ifPresent((response2 -> {                     if(response2 == ButtonType.OK) {                         handleAddButton();                     }                 }));             }         }     }));        public void populateCustomerAllName(String name) {     customerAllName.setText(name); }        Caused by: java.lang.NullPointerException at   views.AppointmentAddController.populateCustomerAllName(AppointmentAddController.java:170) at views.AppointmentMainController.handleAddButton(AppointmentMainController.java:155)   Expected results are when clicking on the addAppointment button the customers name is populated into the customer field.


Puzzle Ring - Does Kadala have a chance of dropping this?

Can the Puzzle Ring (2.0 version) drop from Kadala? Is there even a slight chance of this.


How can I ensure that friends with iPhones send me SMS/text instead of iMessages?

I have an android phone and normally use the Google Messages app for sending and receiving SMS. Yesterday, I used the macOS Messages.app app for the first time to send a friend a link.  I guess they have an iPhone, because now when they text me it comes to Messages.app instead of to my phone.  I'm assuming this will be the same for all other iOS users. How do I prevent all Messages.app and iOS Messages users from sending me NON-SMS messages?  Thinks I have tried:  Closing Messages.app.  I still get macOS notifications of messages. In Messages > Preferences… > Accounts > [my email address], untick "Enable this account".  Then my friends messages disappear and I never see them at all, at least until I reenable in Messages.app. Looking in System Preferences and on icloud.com and appleid.apple.com to see if there is some setting I can disable—but I've not found anything relevant. Using  to unregister my mobile number.  When I attempted this it gave me the message "Your phone number is not registered with iMessage."  This question was closed as a duplicate of , but as noted my phone number is not registered with iMessage, so that question is not relevant. Am I doomed to never receive SMS from iPhone users ever again?


Twist shifter cannot shift down – what might be the cause?

My son's bike is stuck on 7. When we try to shift down to 1, there are no clicks. It just shoots right back to 7. This is a dial/twist/grip shifter, not a trigger shifter. I do not think it has anything to do with the derailleur, but want to confirm.


How to Interpret p-value for categorical variable in multiple linear regresion?

I have a query on how to interpret the result for multiple regression with categorical variables. I have categorical variable called Stay_In_current_city_years which has 5 levels. After running the linear model I get an output with 4 different p-values.   How do I interpret this result? Does it mean that Stay_In_current_city_years1 with p-value=.0746 is not a significant predictor and Stay_In_Current_City_Years2 with p-value=.005 is a significant predictor?  If so how would remove the variables which are not statistically significant?    Thanks


If $a+\frac{1}{b}, b+\frac{1}{c}, c+\frac{1}{a}\in\mathbb{Z}$, find $a+b+c$.

Let $a,b,c$ be positive rational numbers such that  $a+\frac{1}{b}, b+\frac{1}{c}, c+\frac{1}{a}$ are all integers. Find all the possible values of $a+b+c$.  it would be too complicate to solve by quadratic equation(the discriminant is 6 degree polynomial of 3 variables...).  Either, no thought at all…


There was a show (in color) in either the 1970's or 1980's.  The episode I'm trying to find had a man (I seem to remember him working in a deli or butcher shop) whose father had died in WWII when his troop ship was sunk.  Somehow the son got a radio that was broadcasting as if it was WWII.  The son radios a warning to the troop ship.  The next morning, he goes to the shop and his father is there!  Somehow, his warning had gotten though and saved his father.  The son is overjoyed.  Then, outside, the morning newspaper is dropped on the corner...by someone dressed in German military uniform.  The newspaper name is something like "Cleveland Beobachter".  His father was saved, but Germany won WWII.  I've looked through episode guides of all the sci-fi anthology shows I could find, but no luck.  I'm certain it was from an anthology show, as it certainly was not from a serial.  Does anyone happen to remember what this episode and show was?


Receive email notifications when an answer is edited

I've asked one question (). Someone had kindly given an answer to my question. Consequently, I am alerted through my Stack Exchange inbox, on the upper-left corner. If I so choose, I would also receive an an email in my real email address (e.g. GMail) alerting me that I have a new Stack Exchange message.  However, when that answer-giver edited his answer and made it more helpful, I received no notification in my Stack Exchange inbox, nor did I have an option for receiving emails about this edit.  I had to visit my question manually to see if there was any changes. And, yes, there it was! I really wish we didn't have to manually check our questions to see if any answer-giver has edited his answer.  Could you please allow us to receive email notifications when someone edits their answers to our questions (or to any question we are following)?


PHP Startup: Unable to load dynamic library '/usr/lib64/php/modules/json.so' undefined symbol: ZVAL_DELREF

I have an issue where I am unable to use JSON, which would appear to be because of the following error. There is another thread on this forum this touches on a similar issue, but it's not quite the same.  I am using CentOS 5.6 and have the following pear packages installed:  [crmpicco@eq-www-php53 ~]$ pear list PHP Warning:  PHP Startup: Unable to load dynamic library '/usr/lib64/php/modules/json.so' - /usr/lib64/php/modules/json.so: undefined symbol: ZVAL_DELREF in Unknown on line 0 Installed packages, channel pear.php.net: ========================================= Package          Version State Archive_Tar      1.3.7   stable Auth_SASL        1.0.2   stable Console_Getopt   1.3.1   stable Image_Barcode    1.1.2   stable Mail             1.1.14  stable Net_SMTP         1.2.10  stable Net_Socket       1.0.8   stable PEAR             1.9.4   stable Structures_Graph 1.0.4   stable XML_RPC          1.5.4   stable XML_Util         1.2.1   stable json             1.2.1   stable   and have the following PHP packages installed:  [crmpicco@eq-www-php53 ~]$ yum list installed | grep php php.x86_64                           5.3.10-1.w5                       installed php-cli.x86_64                       5.3.10-1.w5                       installed php-common.x86_64                    5.3.10-1.w5                       installed php-devel.x86_64                     5.3.10-1.w5                       installed php-gd.x86_64                        5.3.10-1.w5                       installed php-ldap.x86_64                      5.3.10-1.w5                       installed php-mcrypt.x86_64                    5.3.10-1.w5                       installed php-mysql.x86_64                     5.3.10-1.w5                       installed php-pdo.x86_64                       5.3.10-1.w5                       installed php-pear.noarch                      1:1.9.4-1.w5                      installed php-pear-Net-Socket.noarch           1.0.8-1.el5.centos                installed php-soap.x86_64                      5.3.10-1.w5                       installed php-xml.x86_64                       5.3.10-1.w5                       installed   The error:  [crmpicco@eq-www-php53 ~]$ php -v PHP Warning:  PHP Startup: Unable to load dynamic library '/usr/lib64/php/modules/json.so' - /usr/lib64/php/modules/json.so: undefined symbol: ZVAL_DELREF in Unknown on line 0 PHP 5.3.10 (cli) (built: Feb  2 2012 23:23:12) Copyright (c) 1997-2012 The PHP Group Zend Engine v2.3.0, Copyright (c) 1998-2012 Zend Technologies   My repolist reads as:  [crmpicco@eq-www-php53 ~]$ yum repolist Loaded plugins: changelog, fastestmirror Excluding Packages in global exclude list Finished repo id                                                           repo name                                                                                status base                                                              CentOS-5 - Base                                                                                3,548+43 epel                                                              Extra Packages for Enterprise Linux 5 - x86_64                                                           6,815+156 extras                                                            CentOS-5 - Extras                                                                                245+23 rpmforge                                                          Red Hat Enterprise 5 - RPMforge.net - dag                                                                11,016+67 updates                                                           CentOS-5 - Updates                                                                                233 webtatic                                                          Webtatic Repository 5 - x86_64                                                                             211+183 repolist: 22,068   I am getting HTTP 500 errors everywhere that I use JSON so my application is non functional right now.


Create invisibility cloak (alpha mask material)

How can I create an invisibility cloak? It should be an invisible object which causes other specified objects to become invisible when it covers those objects.


I've been looking for a comparator IC for a circuit I'm trying to build and I'm a little confused with what I've found. I've looked at some parts labeled as comparators but it looks like the parts are just Op-Amps with different ratings. I'm aware that comaprators can be built using Op-Amps, however, I assumed that any extra design that was needed, such as preventing hysterisis in the circuit, would be built into the IC. From what I've seen from the data sheets, however, it looks like they're just plain old op amps. So my question is, are comparator ICs just Op-Amps, or do they have the extra circuitry I'm thinking of? In other words, will I be able to just plug in the two voltages I want to compare or will I have to add some parts around the IC first? It might seem like a silly question but I'm new to PCB design and I wanted to make absolutely sure before I purchased my part. For reference, I've looked at TLV1702-Q1 and LMV7275-Q1 among other parts on TI's website, both of which came up when I searched for comparators.


I'm working on a problem sheet and it ask to discuss the convergence of  $$\sum \frac{n!}{{n}^{n}}$$ By D'Lembert's ratio test, $$\lim_{n->\infty}\frac{{a}_{n+1}}{{a}_{n}} = 1$$ and so, is inconclusive.  Using Cauchy's root test,  $$\lim_{n->\infty}({\frac{n!}{{n}^{n}}})^\frac{1}{n}=1$$  What are my alternatives?  Should I take the integral of the term of the series above? Would integrating factorial works?


How to find all possible sequences within a list of lists in python?

I am unsure how to return all possible sequences within a list of lists. It is important that the index in the main list corresponds to the position in the sequence. Input: list = [["Lys", "Arg"],['Gly'],["Phe", "Tyr"]]  Output: ["Lys", "Gly", "Phe"] ["Arg", "Gly", "Phe"] ["Lys", "Gly", "Tyr"] ["Arg", "Gly", "Tyr"]  Thanks in advance.


I wrote this code in WinBUGS but I can't run it! It says 'multiple definitions of node tau'  model {for(i in 1:N) {IQ[i]~dnorm(mu,tau)} mu~dnorm(90,tau.mu) tau~dgamma(35.64,5022.8) sigma2.mu<-sigma2/22 tau.mu<-1/sigma2.mu tau<-1/sigma2 } #Initial values list(mu=0,tau=1) #Data list(N=4, IQ=c(96,98,77,66))   Can someone help me find the mistake?


How to keep 4 Linux kernels in /boot by default before they are removed automatically

I did some digging around and found that the automatic clean-up for kernels is in /etc/kernel/postinst.d/apt-auto-removal and the file states:  # In the common case this results in two kernels saved (booted into the # second-latest kernel, we install the latest kernel in an upgrade), but # can save up to four. Kernel refers here to a distinct release, which can # potentially be installed in multiple flavours counting as one kernel.   but that script is way above my head and I cannot easily find how autoclean anything but the last 4 kernels.


How is "targeting" a spell defined for the Order Domain cleric's Voice of Authority feature?

The  cleric's 1st-level Voice of Authority feature gives one ally a bonus attack.  It reads as follows:  You can invoke the power of law to embolden an ally to attack. If you cast a spell with a spell slot of 1st level or higher and target an ally with the spell, that ally can use their reaction immediately after the spell to make one weapon attack against a creature of your choice that you can see. If the spell targets more than one ally, you choose the ally who can make the attack.  If I use an area-of-effect spell that includes them, does it count as targeting them? If so, would I have to center the spell on them? Or is it limited to spells that specify a certain number of targets? How about spiritual weapon? If I target them with the spiritual weapon, would they get an attack?


Prove or disprove $a^{10}=b^{10} \pmod{10\alpha}$

Today I got a question:  Find the remainder when $2^{1990}$ is divided by $1990$  I tried as follows  $199$ is a prime, so by Fermat's theorem  $$2^{199}\equiv 2 \pmod{199}$$  Now I used if $$a\equiv b \pmod{\alpha}$$  Then $$a^{10}\equiv b^{10}\pmod{ 10\alpha}$$  Then$$2^{1990}\equiv 2^{10}\pmod{1990}$$  Which is the answer.  But I am not able to prove the property that I had used. I would be pleased if someone would help me to prove or disprove the property. If I had used a wrong property then please provide other method to find the remainder.


A Way to Add Text Before Your Hyperlink in Google Spreadsheets?

Is there a way to add text before the hyperlink?  So for example:     This section needs reworking. You can find the section HERE.    HERE would be the text replacement for the actual link. The actual text would read like this.  This section needs reworking. You can find the section =HYPERLINK("www.yourlink.com", "HERE").   When I try this is does not work, so I am thinking if there is a way it might use some different code.


How to solve infinite repeating exponents

How do you approach a problem like (solve for $x$):  $$x^{x^{x^{x^{...}}}}=2$$  Also, I have no idea what to tag this as.   Thanks for any help.


Blender is playing animation very slowly

after animating for a while,  my animation started to play very slowly in Blender, I have no idea why. It was playing very quick and smooth before but now it is very slow    A screenshot during one of the playbacks.


How to fix "(initramfs) unable to find a medium containing a live file system" on custom Live USB?

I've noticed that a lot of people have asked this before, but no method that I've found seemed to work, so I apologize in advance.  I've created a custom Live USB using the Ubuntu Customization Kit and a stock image of Ubuntu Desktop 14.04 64-bit. The reason for creating the custom image is because I would like a lot of the tools that I use regularly (Qt, ADT, build-essential, etc) to already be available instead of having to download 1GB+ every time I'm somewhere without my regular machine.  I'm using YUMI 2.0.0.2 to create by bootable USB flash drive, which works great for the stock image.  Whenever I try to load ANY customized ISO via USB generated by UCK, it gives the error message:  (initramfs) unable to find a medium containing a live file system   However, when I burn the ISO to a DVD, it boots without a problem.  I've edited the isolinux.cfg to put 'vmlinuz.efi' at the end of live-media-path, thinking that might be it. I've tried to find information about where Ubuntu looks for the UUID of the device, only found it in the 'casper-uuid-generic' file.  Anyone have any ideas? Thanks for any help!


How to read and write into file using JavaScript?

Can anybody give some sample code to read and write a file using JavaScript?


How to reset my password without rebooting?

I lost my password to a VM running 11.04, but have ssh access via public key authentication.  Is there any way I can reset the password without a reboot? (This is to avoid downtime of services it's running.)


If $A,B$ are $n\times n$ matrices and we have that $AB= I_n$, why do we need to show that $BA=I_n$ as well to show that $A$ is an inverse of $B$?


I am confused about the try-finally execution when there exists return; in the try block. In my understanding, the finally block will always be executed, i.e. before returning to the calling method. While considering the following simple code:  public class TryCatchTest {     public static void main(String[] args){         System.out.println(test());     }     static int test(){         int x = 1;         try{             return x;         }         finally{             x = x + 1;         }     } }   The result printed is actually 1. Does this mean the finally block is not executed? Can anyone help me with it?


When can the relative pronouns "who", "which", "that" etc. be safely omitted?

For example, instead of      The guy who is beside me is a jerk     I can say        The guy beside me is a jerk.    It is okay if I don't use the relative pronoun here, either way is correct. But instead of "The guy who sits beside me is a jerk" I cannot say "The guy sits beside me is a jerk." And I cannot say "The people sit beside me are jerks." or "The people sit beside me keep changing." etc.   What is the rule about this? In what situations do I have a chance to not to use the relative pronoun?


What do you call the space where you park a car? Parking spot, space, bay or what?

I am looking for the correct/common way to call the single spaces which are generally clearly visibile  in parking lots   as you can see from the picture:     I would probably call them "parking slots," but I am not sure if that is correct and I could not find any reference apart from , which clearly refers to a different context.   According to the Collins Dictionary a   is:       a space in a car park designed to be large enough to park a vehicle in   Any reference to American English or British English would be appreciated.


Single or Double quotes when defining an alias?

I know that contents of double quotes are expanded, whereas the contents of single quotes are not, such that  echo '$1'   gives  $1   where as   echo "$1"   gives  <the argument - blank in this particular example>   the same as   echo $1   However, the question  led me to wonder why double quotes and not single quotes were used when declaring the alias, thus:  alias cutf="_cutf"   instead of   alias cutf='_cutf'   I would have employed single quotes as in the latter example. Most examples on the web use single too, unless there is some expansion required. However, in this case, no expansion, to my eyes, is apparent. Is it that, in this case, they are interchangeable, or are the double quotes necessary because a function definition is employed?


I've been struggling with this problem, actually I was doing a program in python and did   1j ** 1j(complex numbers) (In python a**b = $a^b$ )   and found out the answer to be a real number with value $0.2079$, How to calculate this value of $i^i$?


Where does add the path this command: export PKG_CONFIG_PATH=/usr/local/lib/pkgconfig

I am trying to install pocketsphinx and after installation I should run these commands:  export LD_LIBRARY_PATH=/usr/local/lib export PKG_CONFIG_PATH=/usr/local/lib/pkgconfig   But I am interested to know where does this command add the paths? If I want to do it manually, how can I do that?


Interpreting Mediation Output when Direct Effect is not Stat. Sig but ACME and Total are

The mediation package in R returns results in which:   Average Direct Effect (ADE) (the unmediated effect) is not statistically significant The Average Causal Mediated Effect (ACME) (the effect of the mediator alone) is positive and statistically significant The Total Effect (ADE+ACME) is larger than the ADE and ACME alone, positive and statistically significant   Does this indicate that the variable being mediated can only act through the mediator DV? I'm not quite certain as to how this would be interpreted.  Thank you for any help.


Where is the section with the top questions?

I like some of the changes in the new stackoverflow/stackexchange site but I miss the section with the top questions (when you clicked on the stackexchange name) - it was like my morning newspaper! Can I find the top questions somewhere else?


Java difference between Short.parseShort and Short.valueOf

I have recently stumbled upon  on Stack Overflow where one person suggests using Short.parseShort(String s) and another Short.valueOf(String s).  I have tried both myself, and I found no difference in functionality and the  didn't really help me either:     Short.parseShort:   Parses the string argument as a signed decimal short. The characters in the string must all be decimal digits, except that the first character may be an ASCII minus sign '-' ('\u002D') to indicate a negative value or an ASCII plus sign '+' ('\u002B') to indicate a positive value. The resulting short value is returned, exactly as if the argument and the radix 10 were given as arguments to the parseShort(java.lang.String, int) method.      Short.valueOf:   Returns a Short object holding the value given by the specified String. The argument is interpreted as representing a signed decimal short, exactly as if the argument were given to the parseShort(java.lang.String) method. The result is a Short object that represents the short value specified by the string.   Both accept the additional Parameter radix, and both throw a NumberFormatException.  They seem to be identical, but if that is the case, why do both exist?


What bike+equipment for a long daily urban commute?

In the (distant) past I commuted 6 km (more than half an hour) each way, on a cheap bike with big knobbly tyres.  Soon I'll have a new commute: 18 km each way, daily. That's much further than I've done in the past, and I don't want it to take 2 hours each way; but  suggests that it's feasible:      Most people who reside 10 to 20 kilometres away will also find it quite easy to cycle to work, although the distance in the high end of this range will become a little more demanding.   If I can do it in 80 minutes or even less each way, that would be ideal. I'm 49 years old, 6 foot tall, and weigh 170lb, and I want to commute by bike because otherwise I'd be getting no exercise in my week at all.  I've never bought or ridden anything but a cheap bike.  What equipment should I buy then, to commute 11 miles each way through a city (Toronto) on  flat, paved roads, shared with cars:   Wheels? Tyres? Clipless pedals and shoes? Gears? Handlebars (e.g. flat or dropped)? Frame (size, shape, material)? Mud-guard/fender?


this is my adapter code:  public class DataAdapter extends RecyclerView.Adapter<DataAdapter.ViewHolder>  implements Filterable{   private ArrayList<AutoData> resultList; private ItemClickListener itemClickListener;    public DataAdapter(ArrayList<AutoData> resultList) {     this.resultList= resultList;     this.itemClickListener = itemClickListener; }  @Override public DataAdapter.ViewHolder onCreateViewHolder(ViewGroup viewGroup, int i) {     View view = LayoutInflater.from(viewGroup.getContext()).inflate(R.layout.item_place_card, viewGroup, false);      return new ViewHolder(view, itemClickListener); }  @Override public Filter getFilter(){      Filter filter = new Filter() {         @Override         protected FilterResults performFiltering(CharSequence charSequence) {             FilterResults filterResults = new FilterResults();              filterResults.values = resultList;             filterResults.count = resultList.size();             return filterResults;         }          @Override         protected void publishResults(CharSequence charSequence, FilterResults filterResults) {           }     };     return filter; } @SuppressLint("NewApi") @Override public void onBindViewHolder(ViewHolder viewHolder, int position) {      viewHolder.tv_name.setText(resultList.get(position).getName());     viewHolder.tv_address.setText(resultList.get(position).getAddress());  }  @Override public int getItemCount() {     return resultList.size(); }    public static class ViewHolder extends RecyclerView.ViewHolder implements View.OnClickListener{      private TextView tv_name;     private TextView tv_address;     private EditText editText;     private WeakReference<ItemClickListener> itemClickListenerWeakReference;        public ViewHolder(View view, ItemClickListener itemClickListener) {         super(view);          itemClickListenerWeakReference = new WeakReference<>(itemClickListener);         tv_name = (TextView)view.findViewById(R.id.name_text_view);         tv_address = (TextView)view.findViewById(R.id.address_text_view);         view.setOnClickListener(this);          editText = (EditText) view.findViewById(R.id.location_input);      }       Context mCon;       MainActivity mainActivity;       @Override     public void onClick(View v) {           String string = (String) tv_name.getText();         Toast.makeText(v.getContext(), "ROW PRESSED = " + string, Toast.LENGTH_SHORT).show();         mainActivity.etPlace.setText((string));     } }   when I run my app I see this Error:     java.lang.NullPointerException: Attempt to read from field   'android.widget.EditText   com.example.user2.trafficmap.MainActivity.etPlace' on a null object   reference                         at com.example.user2.trafficmap.DataAdapter$ViewHolder.onClick(DataAdapter.java:133)   how can I fix this problem?


How to export music files of a playlist into one folder?

Over a period of time I have assembled mulitple playlists. I would like to export the songs of these playlists into corresponding folders. I have tried looking into windows media player but couldn't find any such option.


Possible Duplicate:          Is there an advantage to it?  I mean, SSD is essentially random access memory.


Publishing with a Pseudonym that uses my legal first name as last name

I will soon be published at a peer-reviewed journal and this is my first publication in my career. My concern is that I'm Asian descent and have an extremely common last name, and personally I do not wish to be identified with my legal last name at all.  On the other hand, my Asian first name is relatively unique. Also, I've been going by an English nickname since I moved to US, and all the people I know knows me as my nickname since I always introduce myself with it in person and in my resume.  So, I thought I would choose my publishing name that is unique and personal to be  not this:  [legal first name] [legal last name]  but this:  [daily-used nick name] [legal first name].  I thought about adding my nickname as middle name, but this still results in tons of same names due to my last name.  The question is, would this be considered a good idea if I will always use this for publishing from now on? Or would it cause any big troubles in future career, such as employers having a difficulty with identifying my work or other issues? Are there any potential issues with this style of pseudonym?  I read other similar posts about publishing in pseudonym, but the closest I could find to my question was this:


How to move rightarrow higher up between Figures?

At the moment I have this code :   \begin{figure} \centering \includegraphics[width= 0.4\textwidth]{before} $\rightarrow$ \includegraphics[width= 0.4\textwidth]{after} \end{figure}   which produces the following :    Is there some way I can move the rightarrow higher up, between the figures, instead of at the bottom? In particular, I'm wondering if it is possible without redoing my Tikz figures.


This is the 3rd question from the 2nd chapter of the book "A Walk Through Combinatorics - Miklos Bona"  The question is as follows -  At a tennis tournament, there were $2^n$ participants, and any two of them played against each other exactly one time. Prove that we can find $n+1$ players that can form a line in which everybody has defeated all the players who are behind him in the line.  The proof stated is as follows -   "Induction on $n$. For $n = 1$, the statement is trivially true. Now assume the statement is true for n and prove it for $n + 1$. The winner $X$ of a tournament with $2^{n+1}$ participants must have won at least $2^n$ games (why?). Take $X$, and $2^n$ people he defeated. By the induction hypothesis, we can find $n + 1$ people among the $2^n$ people defeated by $X$ who can form a line with the required property. Then we put $X$ to the front of this line and we have obtained a line of length $n + 2$ that has the required property."  My problem with this -   The winner in a tournament with $2^{n+1}$ players has at least $2^n$ as proven here by @Martund -    But the winner $X$ may have more than $2^n$ wins, in which case we may not find a set of $2^n$ players who lost to $X$ for us to apply induction and extract the line of $n$ players? How do we fix this?


Proving any two consecutive terms in Fibonacci series are co-prime without usage of $\gcd$.

I intend to prove that consecutive Fibonacci series terms are co-prime using only property of linear combinations, without recourse to $\gcd$ of the first two terms of the series being $1$, or any way to $\gcd$.  My analysis is based on simple fact that in a Fibonacci series, in general a term is reflected thrice, as shown below:  Let the Fibonacci series be having terms at each step of computation denoted by : $F_{n+1} = F_{n} + F_{n-1}$ with the terms being given in a sequence by:  $$ \begin{align} F_{n} =& \ F_{n-1}+ {\overbrace{F_{n-2}}^{\large last}} \\ F_{n-1} =& \ {\overbrace{F_{n-2}}^{\large middle}} + F_{n-3} \\ {\overbrace{F_{n-2}}^{\large first}} =& \ F_{n-3} + F_{n-4} \\ F_{n-3} =& \ F_{n-4} + F_{n-5} \\ & \ ... \\ F_2=& \ 2.F_1   \end{align} $$  Say, $F_{n-2}$ becomes first, middle and last terms in successive linear combinations. This means that an $even$ term will  lead to first time being a 'first term' (as a sum of two odd numbers); then as 'middle term' (as a sum of itself, and $F_{n-3}$, an odd term), with sum on l.h.s., $ F_{n-1}$ being an odd number (as sum of even & odd) ; then finally as a 'last term' with the sum $F_{n}$ being again an odd number, as $F_{n} = 2.F_{n-2} (even) + F_{n-3} (odd)$.  Definitely, odd and even terms are co-prime, but if some more polished explanation is offered by the property of linear combinations.


In the following sentence, should I use in or on?     If I ever make a list, not only will you be in/on it, you'll top it, too.


Why is the '/storage/emulated/' directory inaccessible?

The /storage directory and the /storage/emulated/0 directory is accessible in a non-rooted Android OS. So, why is the /storage/emulated directory not accessible in a non-rooted Android OS ?


Launch Velocity for Simple 3D Projectile

This is a pretty easy question, but I can't quite figure out the answer. I have:   The initial position of a projectile. The gravity vector. The (stationary) target I want to hit. A maximum launch speed of the projectile.   I want to calculate the initial velocity the projectile must be launched at to hit the target, assuming it follows a ballistic trajectory.


What is the scheme for textual representation of keystrokes in screen?

How can I derive the character sequence that represents a certain keystroke in screen? I mean, what bind takes as input. For instance, 's' represents the obvious keystroke on the 's' key. 'S' represents 'shift+s'. But the representation of other more complex combinations are unclear to me and the scheme that is followed seems quite obscure.  I have searched all around and , but I couldn't find the answer. So I guess the best is to try to understand the general scheme. I have also seen , but it's now working for me.  Can someone explain what scheme/rules screen follows for this? What are the rules to derive the representation of any arbitrary key combination? And are they screen specific, or shared with other software? Other GNU software maybe? Where is this documented?


Stack Exchange iOS app crashes when opening questions with large code blocks

Whenever I attempt to open questions in the Stack Exchange iOS app with extremely large sections of formatted code (like  on Code Review), the app will crash.   Version information:   App Version: 1.6.2.5 Device: iPhone 6s Plus OS Version: Version 10.3.2 (Build 14F89)   After I updated the app to 1.6.6, it did not crash immediately upon opening an offending question, but if I scrolled down by any significant amount, the app would still crash.


$\quad A\subset\mathbb{R}$ is measurable and $m(A)>0$. then $m\left(\mathbb{R}-\bigcup_{q\in\mathbb{Q}}q\cdot A\right)=0$.  How to prove it ?  $ q \cdot A $ is a dilation or contraction of each element in $ A$ for example if $ A=(1 ,3],  2A= 2(1 ,3] = (2,6].$ The proof  is trivial if $ A $ is an interval or countable union of intervals but not so for arbitrary sets.  This question is not a duplicate of  because taking logarithm $ log_{10} (qA) =log_{10}A+log_{10}q$ , $ log_{10} q $ is not always a rational number


Evaluation of the double integral $\int_{[0,1]×[0,1]} \max\{x, y\} dxdy$

Evaluate:  $$\int_{[0,1]×[0,1]} \max\{x, y\} dxdy$$     I am totally stuck on it. How can I solve this?


Removing rows using join and skip some of them - MySQL

I'm having a hard time to use a MySQL query.  If I do the following:  SELECT ads.id_ad  FROM tab_ads ads, tab_orders orders  WHERE (ads.id_user = 111 AND ads.id_ad = orders.id_ad)   It gives me the correct answer, which is: "show me the ads belonging to user 111 that have been sold"  What I want is to remove all ads, except the ads that have been sold.  So I change the equal to not equal in the where criteria:  SELECT ads.id_ad  FROM tab_ads ads, tab_orders orders  WHERE (ads.id_user = 111 AND ads.id_ad != orders.id_ad)   And it gives me trash results.  Ex: I have three tables:  tab_ads id_ad - title - etc. 01 - title1 02 - title2 03 - title3  tab_orders id_order - id_ad - amount - etc. XX          - 01     -  $10  tab_users id_user - name - etc. 110 - Dr. Jivago - etc. 111 - Sherlock - etc.   I need to remove all ads from 111 (Sherlock) where there's no sell. So I need to remove ad 02 - title2 and 03 - title3 because ad 01 - title1 has been sold and I need to keep it for future consultation.


Does it work once a week or does it continually trim the system?  I have seen answers for this but they refer to Ubuntu 14.04 but not to Ubuntu 15.04


How to convert a PIL Image into a numpy array?

Alright, I'm toying around with converting a PIL image object back and forth to a numpy array so I can do some faster pixel by pixel transformations than PIL's PixelAccess object would allow.  I've figured out how to place the pixel information in a useful 3D numpy array by way of:  pic = Image.open("foo.jpg") pix = numpy.array(pic.getdata()).reshape(pic.size[0], pic.size[1], 3)   But I can't seem to figure out how to load it back into the PIL object after I've done all my awesome transforms.  I'm aware of the putdata() method, but can't quite seem to get it to behave.


Is the speed of quantum entanglement interaction greather than $c$?

How  much time should not elapse between  measurements of e- and e+ spin computed at a distance ot 1km to not detect effects of the entanglement? There should be a finite speed? Maybe greater than $c$?


certbot renow nginx not resart but site work

I have a website to ubuntu 16.04 and i use certbot to my certificat ssl and when a run this commande   certbot renew --pre-hook "service nginx stop" --post-hook "service nginx start" --force-renewal   i have i big problem the certificat as been renew but nginx will not restart but my website and the certificat work perfectly. when i go to my website i have no bug but ngnix is not start and a not have apache   when i tap this systemctl status nginx.service  if have this errors       Dec 24 09:00:06 jobs nginx[13997]: nginx: [emerg] bind() to [::]:80 failed (98: Address already in use) Dec 24 09:00:06 jobs nginx[13997]: nginx: [emerg] bind() to 0.0.0.0:443 failed (98: Address already in use) Dec 24 09:00:07 jobs nginx[13997]: nginx: [emerg] bind() to 0.0.0.0:80 failed (98: Address already in use) Dec 24 09:00:07 jobs nginx[13997]: nginx: [emerg] bind() to [::]:80 failed (98: Address already in use) Dec 24 09:00:07 jobs nginx[13997]: nginx: [emerg] bind() to 0.0.0.0:443 failed (98: Address already in use) Dec 24 09:00:07 jobs nginx[13997]: nginx: [emerg] still could not bind() Dec 24 09:00:07 jobs systemd[1]: nginx.service: Control process exited, code=exited status=1 Dec 24 09:00:07 jobs systemd[1]: Failed to start A high performance web server and a reverse proxy server. Dec 24 09:00:07 jobs systemd[1]: nginx.service: Unit entered failed state. Dec 24 09:00:07 jobs systemd[1]: nginx.service: Failed with result 'exit-code'.   i try   but is not work


LaTex Compiler in Springer Journal type misunderstands that "_" in biblio is a mathematical expression

LaTex Compiler thinks that "_" in biblio file is a mathematical expression that represents the beginning of subscript letter. Which library should I use or what should I do? My sample code is as follows: \begin{filecontents*}{example.eps}  gsave newpath   20 20 moveto   20 220 lineto   220 220 lineto   220 20 lineto closepath 2 setlinewidth gsave   .4 setgray fill grestore stroke grestore \end{filecontents*}  \RequirePackage{fix-cm}  \documentclass[smallextended]{svjour3}  \smartqed \usepackage{graphicx}  \journalname{Journal of Cryptographic Engineering}   \usepackage[acronym,toc,shortcuts]{glossaries} \usepackage{amsmath} \usepackage{graphicx} \usepackage{lineno} \usepackage{array} \usepackage{longtable}  \begin{document}  \cite{10.1007/3-540-44983-3_4}  \bibliographystyle{spmpsci} \bibliography{biblio}  \end{document}  My biblio file is as follows: @InProceedings{10.1007/3-540-44983-3_4, author="Aoki, Kazumaro and Ichikawa, Tetsuya and Kanda, Masayuki and Matsui, Mitsuru and Moriai, Shiho and Nakajima, Junko and Tokita, Toshio", editor="Stinson, Douglas R. and Tavares, Stafford", title="Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms --- Design and Analysis", booktitle="Selected Areas in Cryptography", year="2001", publisher="Springer Berlin Heidelberg", address="Berlin, Heidelberg", pages="39--56", isbn = "978-3-540-44983-6", doi = "10.1007/3-540-44983-3_4" }


why the height of a frame is not constant in ie7

i was developing a page which has two frames, the left frame is a treeview file, when click one of the file it will display on the right frame.the main page code is below  <frameset  id="main_frame" cols="210,*" rows="*">             <frame src="FramesetLeftFrame.jsp" id="treeframe" noresize="noresize"/>             <frame src=""  id="basefrm" noresize="noresize"/> </frameset>   the question is the treeview display correctly in chrome and firefox, but in ie7 the treeview becomes auto-height!when i click a folder with the files becomes more the height becomes higher.how can i fix the problem? i have tried add a min-height = 100% or height = 100%,it does not work.    by the way, the tree is maked by javascript. FramesetLeftFrame.jsp is below:    <SCRIPT src="ua.js"></SCRIPT>    <!-- Infrastructure code for the TreeView. DO NOT REMOVE.    -->   <SCRIPT src="ftiens4.js"></SCRIPT>     <!-- Scripts that define the tree. DO NOT REMOVE. -->    <%@include file="buildTree.jsp" %>   </HEAD>  <BODY>       <SCRIPT>initializeDocument()</SCRIPT>           <NOSCRIPT>             A tree for site navigation will open here if you enable JavaScript in your browser.           </NOSCRIPT> </body> </html>   Thank you guys!


I was checking some theoretical properties with a concrete example. At some point, I needed to use Wolfram Alfa in order to get the equality $$\sum_{k=0}^n \binom{2k}{k}\binom{2(n-k)}{n-k} = 4^k .$$ So now, I have two reasons to know this equality is true: A blind trust in Wolfram, and the fact that this equality must be true for all $k\in \mathbb{N}$ as an indirect byproduct of an unrelated proposition. This is a little unsatisfactory, and I wanted to find some direct proof, bonus points if it use combinatorics, but I couldn't work it out or find an answer online. Maybe some of you know some tricks that make this equality obvious?


Add per-site Meta questions and answers to network profile Top Questions and Top Answers lists

When I look at my own , I can see all my top questions and answers by their score on there. Even MSO is there. But some of my best posts are on . Looking at others, it seems all per-site Meta's are not included. Why are they excluded from this? And if there isn't a reason why, can we have them added? Some of the best answers and questions users post are on their own sites meta, and they need some time to shine.