I just failed , which was shown as being closed as "Not a real question".  Seeing as the vote count was positive, I figured it was an audit, but I selected "Leave Closed" anyways because to me     It's difficult to tell what is being asked here.  This question is ambiguous, vague...   There's no code examples, and the phrasing is clunky at best.  This is my second failed audit in two days for difficult questions (first failed audit is , also now closed), so if I get temporarily suspended, it won't be the end of the world (I'll think of it as a forced vacation).    That said, is there a way to dispute these audits?  Or is posting the audit here sufficient?

I recently received this rather amusing message while reviewing a user's first post:  Congratulations! This was only a test, designed to make sure you were paying attention. This post has already been removed, but thanks for taking time to leave feedback for the author.   What is the purpose of this test? How does the audit work? What happens if I fail? Why was the system expecting me to negatively review a good post, or positively review a bad post? A review is obviously an audit. Should I report it? Do review audits count toward the Reviewer badge? Do robo-reviewers dream of electric sheep?


I had to add the JDK path in the system variables which is under environment variables, but by mistake I deleted the default path which was present in the Path and pasted the JDK path.  So how do I get the default path back?

A user of ours cleared their path, thanks to some directions on the internet.  What is the default path, I am a developer so I have tons of extra stuff in mine, what should my user get on a plain jane one?


First it should grep for Pattern_A, then print all lines before Pattern_A until Pattern_B is found(so basically it should search backwards)      line1    line2    line3    line4    Pattern_B    line5    line6    line7    line8    Pattern_A    line9    line10    line11    Pattern_B    line12    line13    line14    line15    Pattern_A    line16    line17    ....    ....    ....  I want the output to be like this:      Pattern_B    line5    line6    line7    line8    Pattern_A    Pattern_B    line12    line13    line14    line15    Pattern_A

I want to start grepping from the lines that has CK at the end of line and stop grepping when the line has D at the end. I tried grep "$CK" "$D" file..txt, but it didn't work.  Input:  kkkkkkkkkkk    jjjjjjjjjjjjjjjjjj   gggggggggggg/CK   JHGHHHHHHHH    HJKHKKLKLLL    JNBHBHJKJJLKKL   JLKKKLLKJLKJ/D   GGGGGGGGGGGGGG   GGGGGGGGGGGGGG   The desired output:  gggggggggggg/CK   JHGHHHHHHHH    HJKHKKLKLLL    JNBHBHJKJJLKKL   JLKKKLLKJLKJ/D


With windows 10, after a clone in legacy mode, do the PC recognize the product key on the bios by itself or do I need to run the clone in uefi mode to recognize the product key?

I've been using Windows 10 for a couple of month now (joined the Insider Preview).  Now my hard drive started ticking so I've bought a new SSD and I want to move the windows installation to the new hard drive, which has been connected to the computer (unpartitioned). I don't mind and I even prefer reinstalling it over again.   Since I have the free version of Windows 10 pro, can I still reinstall it anew? Does the windows 10 installation offer disk management and partition like the older Windows installations used to? How should I reinstall Winodws 10 x64 the easiest but still remain on free mode?


In The Force Awakens, Kylo tries to take Luke's lightsaber from the ground but Rey is able to pull it away from him with the Force.  In The Last Jedi,       Rey tries to use the Force to steal the lightsaber from Kylo but he fights her for it and they break it.     By all logic, Kylo should've been stronger in The Force Awakens than Rey and so should've been able to get the lightsaber from her then.  But then in The Last Jedi, where Rey has trained and should be stronger, they seem to be equally matched.  Is there a reason for this?

In Star Wars: The Force Awakens, before the battle between Kylo Ren and Rey we watch Kylo trying to force pull Luke's blue lightsaber but without success. Now, in The Last Jedi, Kylo uses the Force to move Luke's Lightsaber and      kills Supreme Leader Snoke.    What has changed and why can Kylo move the lightsaber now?


I need a regular expression which should parse string with white space and if white space exists in a string which ended with quotes (single/double) then it should not parse.  abc cde 'efg hij'k lmn'opq rst' 'ijk lmn' u'v'w xyz 'abc' \'\\\\\'  \'_Notes.txt\'   Requirement O/P:  abc cde 'efg hij'k lmn'opq rst' 'ijk lmn' u'v'w  xyz 'abc' \'\\\\\' \'_Notes.txt\'   I used below pattern for my requirement but this parsing like below  Pattern p = Pattern.compile("[^\\s\"']+|\"([^\"]*)\"|'([^']*)'");   O/P:  abc cde 'efg hij'         //here k is missing lmn'opq rst' 'ijk lmn' u'v'w  xyz 'abc' '\\'   //here original string is \'\\\\\' '_Notes.txt' //here origina string \'_Notes.txt\'

I'm new to regular expressions and would appreciate your help.  I'm trying to put together an expression that will split the example string using all spaces that are not surrounded by single or double quotes. My last attempt looks like this: (?!") and isn't quite working. It's splitting on the space before the quote.  Example input:   This is a string that "will be" highlighted when your 'regular expression' matches something.   Desired output:  This is a string that will be highlighted when your regular expression matches something.   Note that "will be" and 'regular expression' retain the space between the words.


i have a control on the page that is an image:     that is fine an i can get the correct ID.  when another image is added dynamically using JS it looks like this:     when i get this ID it returns the first image ID and not with the value of "2_" or the new name attribute added into the dynamic object, code just returns blank.    code is based on the click event of the clicked image class:  $('.serviceSearch1 .nf-image').click(function () {     alert(this.name);     alert(this.id); });   on the browser source i can see the correct values though. Im confused as to what is going on and any help would be greatly appropriated!  I have no control over the html and javascript automation. That is due to a third party!   it looks like the browser as shown above is uptodate but in code its not updating (has old values).  marked in blue is the new repeating section that is auto generated (not by me by third party):    in each repeating section contains an image that i have shown above.  as noted when the image is clicked it calls the click event but the attribute values are all old. The first image contains no name attribute but any new repeating control does noting its current index. so first has none, second has "2_", third has "3_" and so on.. i need those name values but when i access them on the click event its blank and the ID's are the same as the first image. The controls are added dynamically by third party which i assume is using JS. hope that helps.

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


Suppose $X$ is exponentially distributed with the rate parameter $\lambda$. If we have the expected value of $\log X$ as \begin{equation} \langle \log X\rangle=-\gamma-\log\lambda \end{equation} where $\gamma$ is the Euler–Mascheroni constant. Now I am wondering how I can compute a lower bound for $X\log X-\log \Gamma(X)$ since this is a concave function? I originally wanted to compute the following integral \begin{equation} \langle \log \Gamma(X)\rangle=-\exp(-\lambda X)\log\Gamma(X)+\int \psi(X)\exp(-\lambda X)\mathrm{d}X \end{equation} where $\psi(X)= \frac{\mathrm{d}}{\mathrm{d}X}\log \Gamma(X)$. I came across  which they are tackling more and less the same problem as mine and they suggested this bound: \begin{equation}\label{eq:lb} \begin{split}     x\log x-\log\Gamma(x)&\ge x^*\log x^*-x^*-\log x^*-\log\Gamma(x^*)\\     &+\Big(\log x^*-\frac{1}{x^*}-\psi(x^*)\Big)(x-x^*)+\log x+x \end{split} \end{equation} It seems it works just for small $x^*$. I wonder whether there is a tighter bound or not? Any suggestion would be appreciate?

If the expected value of $\mathsf{Gamma}(\alpha, \beta)$ is $\frac{\alpha}{\beta}$, what is the expected value of $\log(\mathsf{Gamma}(\alpha, \beta))$? Can it be calculated analytically?   The parametrisation I am using is shape-rate.


Is it normal that on 17.10 Shutter doesn't work properly? When I try to get a screenshot, all I get is this stuff:   Is there a way to fix it? Are there working alternatives to Shutter for 17.10?

After upgrading to Ubuntu 17.10 I noticed some of my screencasting applications are not working, for example screencasting tools like SimpleScreenRecorder and vokoscreen. ()  Also I noticed features like screenshot from GIMP is not working properly, producing blank screenshots (). Shutter too is producing glitchy screenshots ().  Screen-sharing option on Skype is also not working ().  The issue occurs sometimes on later Ubuntu releases too.  Why is this happening and how do I fix this?


I am working on a chat application wherein I need the sender's and recipient's names to be highlighted on each chat message that is sent or received along with the respective time stamp. I have a textbox say 'txtclient' and I am throwing all the sender and receiver messages to this textbox. Since all the text is being displayed here, I cannot set the textbox's forecolor since it will be applied to all the text in it. kindly help. Here is the string whose color I want to be different or highlighted:   private void newThreadClientChat() {     SetText (DateTime.Now.ToString() + " : " + clientgetsetname + " : " + clientgetset + "\r\n"); }

How can I paint in red every time I meet the letter "A" in RichTextBox?


I have built a PC back a couple of years ago which requires a wired Ethernet cable (didn’t come with a wireless NIC). I have purchased a game through Steam when I was with my dad in Florida and I have been wanting to play it for a couple of months now. As of right now, I currently do not have the resources to purchase a wireless NIC, as I am in the process of moving. I do have a laptop which has Steam but due to it’s specs, cannot run the game I want to run. I was wondering if it was possible to copy the game launcher and all of the required files (including .dlls) onto my gaming PC and run it from there. I don’t know if it can due to Steam’s functionalities but I thought it was worth asking.

I have just bought a new computer and I have everything migrated over except for my Steam games.  I looked in Program Files/Steam/ and I found a folder full of the games I have downloaded, but I do not know if it is safe to just copy these folders from one computer to another (seeing as a lot of other applications will not work if you do this), or is there another recommended way?  I don't really feel like re-downloading all my games. I don't have the time nor bandwidth to download 20GB over a 1.5mbps connection.  Is it possible to contact Valve and get a disk with the games on it?


I am using R and e1071 package to tune a C-classification SVM.  My question is: regardless of the kernel type (linear, polynomial, radial basis or sigmoidal), is there any good criterion to choose the range in which cost and $\gamma$ parameters should range over and/or to choose what the granularity should be (that is, as an example, gamma = 10 ^ (1:2) or gamma = 1:2 or gamma = 100 ^ (1:2))?  I add a second question: can tune.svm() return the best kernel type, too?  Thanks,


After moving my website files & database from Hetzner VQ virtual server to CX virtual server I am getting ‘502 bad gateway nginx error’ when trying to open www.1luxuryphones.com in a browser, and can see the following errors in /var/www/vhosts/system/1luxuryphones.com/logs/proxy_error_log:  2018/04/08 15:20:43 [error] 4568#0: *2721 connect() failed (111: Connection refused) while connecting to upstream, client: 77.98.74.207, server: 1luxuryphones.com, request: "GET / HTTP/1.1", upstream: "http://172.31.1.100:7080/", host: "www.1luxuryphones.com", referrer: "http://www.1luxuryphones.com/"   My Hetzner VQ virtual server was running on Debian 6.0.7 with Plesk 11.0.9 and has a dedicated IP address 78.46.151.222, and everything was working fine.  My CX server is running on Debian 9.4 with Plesk Onyx 17.8.11, and has a private ip address 172.31.1.100 which is configured 1:1 via NAT on public IP 88.99.186.220, and now I cannot access my website anymore.  In Plesk panel > Tools & Settings > IP addresses I have configured IP 172.31.1.100 so it has external IP 88.99.186.220.  However based on the proxy_error_log above it seems there is nothing listening on 172.31.1.100:7080, so the nginx cannot successfully forward the traffic.  Would someone know what could be done to fix this problem?  Many thanks

This is a  about Connection Refused    We see a lot of questions to the effect      When I try to connect to a system I get a message      Connection refused      Why is this ?


In , I see answers for pre-14.04, 14.04, 15.10 "and newer", and other information, but there is not an accepted answer for 16.04 specifically, which is what I want to determine. Should I create a config file in , should I install , or is there a newer recommended solution?

How is the /tmp directory cleaned up? Is it automatic? If so, how frequently is it cleaned up?


If I issue SELECT ID FROM TestAhmet I get this result:  1 3 5 2 4   but what I really need is one row with all the values separated by comma, like this:  1,2,3,4,5   How do I do this?  ps: I cant do this :

To illustrate, assume that I have two tables as follows:  VehicleID Name 1         Chuck 2         Larry  LocationID VehicleID City 1          1         New York 2          1         Seattle 3          1         Vancouver 4          2         Los Angeles 5          2         Houston   I want to write a query to return the following results:  VehicleID Name    Locations 1         Chuck   New York, Seattle, Vancouver 2         Larry   Los Angeles, Houston   I know that this can be done using server side cursors, ie:  DECLARE @VehicleID int DECLARE @VehicleName varchar(100) DECLARE @LocationCity varchar(100) DECLARE @Locations varchar(4000) DECLARE @Results TABLE (   VehicleID int   Name varchar(100)   Locations varchar(4000) )  DECLARE VehiclesCursor CURSOR FOR SELECT   [VehicleID] , [Name] FROM [Vehicles]  OPEN VehiclesCursor  FETCH NEXT FROM VehiclesCursor INTO   @VehicleID , @VehicleName WHILE @@FETCH_STATUS = 0 BEGIN    SET @Locations = ''    DECLARE LocationsCursor CURSOR FOR   SELECT     [City]   FROM [Locations]   WHERE [VehicleID] = @VehicleID    OPEN LocationsCursor    FETCH NEXT FROM LocationsCursor INTO     @LocationCity   WHILE @@FETCH_STATUS = 0   BEGIN     SET @Locations = @Locations + @LocationCity      FETCH NEXT FROM LocationsCursor INTO       @LocationCity   END   CLOSE LocationsCursor   DEALLOCATE LocationsCursor    INSERT INTO @Results (VehicleID, Name, Locations) SELECT @VehicleID, @Name, @Locations  END      CLOSE VehiclesCursor DEALLOCATE VehiclesCursor  SELECT * FROM @Results   However, as you can see, this requires a great deal of code.  What I would like is a generic function that would allow me to do something like this:  SELECT VehicleID      , Name      , JOIN(SELECT City FROM Locations WHERE VehicleID = Vehicles.VehicleID, ', ') AS Locations FROM Vehicles   Is this possible?  Or something similar?


I was messing with CompizConfig and I lost the top panel where it tells the time and has the exit buttons and whatnot. Could someone help me get the top panel back? Thank you.

I've installed 11.04 but some windows effects were off, so I tried to re-enable them. While in the process, however, I ended up losing that handy menu (normally on top) where we have the Ubuntu icon, and the volume and shutdown menus.   How can we restore that panel?  Thanks in advance.


pow(5,2) returns 24.9999 or 25.00001 depending on a compiler but when we assign it to a double variable then it becomes 25 how?  Ex   double d=pow(5,2);   here pow() returns 24.9999 or 25.0001 so d should store these values not 25

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


I know that there are several closely related older posts about LuaTeX.         As of recently I started entertaining the idea of switching my default engine form pdfTeX to LuaTeX. The main upshot as I see naively right now is the direct availability of a powerful scripting language from within my latex documents. That is related to my older questions about automatic document update as well as embedding animations into the presentation.  Before I make a leap of the faith I would like to know the current pitfalls of using LuaTeX over pdfTeX. How do people use PSTricks with LuaTeX? Any issues with Powerdot class? Are there any issues with bibtex or even commonly used packages for math publications?   Edit: I am still goofing off in front of the computer and testing LuaTeX engine. I tried on several complex documents with figures, bibliography files and similar. Works like a charm with the usual workflow for PSTricks  lualatex --output-format=dvi file.tex -> dvips file.dvi -> ps2pdf file.ps   I think I am going to edit my .profile and switch to lualatex unless I encounter a major problem.

In this question  various differences between LuaTeX and XeTeX (and ConTeXt) are discussed. And in this question  a recipe for switching from pdfLaTeX to XeLaTeX is given. In this question, I would like a similar recipe for using LuaLaTeX. I'm particularly interested in the degree to which LuaTeX can be used as a drop-in replacement for pdfTeX.  I'm not interested in things that LuaTeX can do that pdfTeX can't.  So the question is:  What do I need to do to use LuaLaTeX instead of pdfLaTeX to compile existing or new documents?  Some specific sub-questions:   What packages are compatible with pdfLaTeX but not with LuaLaTeX? Are there any packages specific to LuaLaTeX that should be loaded in most LuaLateX documents?


I want to show that $$\frac{1}{\sum_{1}^{n}a^2}\leq \frac{n}{\left ( \sum_{1}^{n}a \right )^2}$$ Until now, I only have $$\left (\sum_{1}^{n}a  \right )^2\leq \left (\sum_{1}^{n}a^2 \right )n$$ Please, any idea on how to procede?

Let $n$ be a natural number and $a_1,a_2,\ldots,a_n$ are real numbers. Then prove that  $|\sum_{i=1}^n a_i|\le  \sqrt{n\cdot \sum_{i=1}^n a_i^2}$.   At first I tried to prove for $n=2$ i.e, $|a_1+a_2|\le \sqrt{2(a_1^2+a_2^2)}$, but unable to proceed. Give me some hint to proceed.


What I want to do is have an auxiliary function inside my .c file that will only be used within another function in the file, and has no use outside that specific case. Therefore, it's not of great use for the interface to contain it, but I'm just wondering whether that is possible and/or a good practice, as well as if there's an alternative that is more elegant.

The question was about plain  functions, not  static methods, as clarified in comments.  I understand what a static variable is, but what is a static function?  And why is it that if I declare a function, let's say void print_matrix, in let's say a.c (WITHOUT a.h) and include "a.c" -  I get "print_matrix@@....) already defined in a.obj", BUT if I declare it as static void print_matrix then it compiles?  UPDATE Just to clear things up - I know that including .c is bad, as many of you pointed out. I just do it to temporarily clear space in main.c until I have a better idea of how to group all those functions into proper .h and .c files. Just a temporary, quick solution.


I constantly have the problem that I want to push a text snippets/links/images quickly from my Windows pc to my iPhone, without it being plugged or on the same Wi-Fi.  Every time, it seems to be a hassle. I send myself emails, or whatsapp messages.  There must be a solution. Does anyone know a remedy for this?

I usually send emails to myself, but I wonder if there is a better way to share something quickly from my PC\laptop to iPhone.


I'm a town hall level 5 and on one of my raids I've taken 120k resources each and I noticed that I got 200 dark elixir, but I don't have dark elixir storage.   Where does it go? When I get a dark elixir storage will i start with 200? or does it all go to waste?

are you able to attack an enemy's dark elixir storage without your own dark elixir storage to hold the stolen resource?  Furthermore if you are able to attack it what consequences occur.


I've got an almost completely fresh install of 64-bit Windows 10 on my wife's laptop. It has a Core i5 processor and 4 GB of memory.  If I leave it on for too long, it gets slower and slower. It fills up the RAM and then it fills up the page file. And then it'll show the error:     Your computer has run out of memory.   I'm not confusing "available" with "free" or anything like that. The system is literally out of memory.  It appears Windows 10 isn't showing all of the processes running on the system. Task Manager and Resource Monitor both report no processes running. But the disk utilization and RAM utilization totals are bright red because they're at 97% RAM and 100% disk. A look at the “Processes” tab shows nothing using more than 10 MB of RAM, and there's only maybe two dozen total background processes, all using no disk.  So I want to know:   Are there processes that Windows hides? If do, how do I find them?  What's causing my memory problem?   I set the computer to reboot. Five minutes later, it's still trying to close down Task Manager and Resource Monitor. How can this happen? What possible reason could exist for a fresh install of an operating system to have this problem?  Okay, let's look at some pictures.      [edit] Nope. Poolmon doesn't show the problem. I'm hitting 4 GB usage again, and poolmon doesn't show it:    [edit] Two more, from the next commenter, running RAMMap:  Notice that "process private" is HUGE (which I have read is memory dedicated to a single process) and yet, no related processes show up in the process list.

A few days ago I updated my PC to Windows 10. However, after some use my PC started to slow down until it was impossible to use – it was due to high memory usage. After a restart, everything came back to normal (total usage around 25% of 8GB of RAM). However, during a few hours of usage the memory builds up again to 70%, and if not restarted it further goes to 100%, and later on even freezes. Task manager does not help very much as it does not show all the processes (added screenshots below). Also tried RAMMap but it gives an error: "error refreshing database". I tried Googling this question, yet without much success.  I do not know much about PCs, but maybe some of you know this issue, or could help to find out what is using my RAM.


English prepositions are difficult even for/to me.   Which one is correct, for or to? Is there a difference? Can they be used interchangeably?

Which one should be used?      To me, it makes no difference, but I'm not really sure why.   vs     For me, it makes no difference, but I'm not really sure why.


Package reads "2 8in 12vdc LED strips".  Plugged into a car they get hot enough to melt. Plugged into a 12vdc 120mA transformer they work great.   What resistor do I need to bring car amperage down to 120mA?

When I plug A 12V DC 8" LED strip into my car, it gets too hot to touch, but when I plug it into A 110V AC to 12V DC 120mA transformer, it works great; "cool to the touch".   So do I go buy a resister and put it in line? If so, what resister do I ask for and which band goes to the LED side?


I have the following image:    Is there a way to easily "straighten" the lines, in order to obtain the following image?    I have done this with the "Liquify" command. As you can see, the result is far from being perfect, but maybe there is something easier and better, e.g. using something like warping or other similar options.  I am currently using Photoshop 2018.  Can someone suggest which is the best way to achieve the desired result in this situation?

I have photographed some pages of a book for reading. This is much faster than scanning and you don't have to carry the heavy books. However, the photographed books are not as nice: curved, skewed, and shadowed, as opposed to the much flatter, cleaner scanned books. Especially when you're trying to print them out.  Google's used some specific technique of converting books to e-books with a camera and a laser overlay.  But is there any home user software that can flatten a curled photographed book photograph?  Or maybe there is some technique which you can use in Photoshop?  What is the best way to achieve that?  Example:


Back when I mainly used Windows, I always exported a text file containing my installed programs from the software "CCleaner" before reinstalling my operating system, so that I had a list with all the software I would have to reinstall and not miss anything.  Unfortunately, I can't seem to find such a list in Ubuntu (using Xfce currently, but also just in general). Also, it would be helpful if that list did not include just all packages, such as plymouth, gedit and nautilus, which are installed by defauly anyway, but only those installed by the user.  Is there a way to obtain such a list?

I'd like to get a list of packages installed manually by apt or aptitude and be able to find out whether a foobar package was installed manually or automatically. Is there any neat way of doing that from the command line?


I heard it expressed on gotel radio station;  "Don't go nowhere" can it be correct?

In my native language, double negations "cancel out". I have been trying to learn English using movies and such things, but double negation confuses me. I see instances when double negation cancels out, and some when they do not.  For example, "I haven't got no money" is interpreted as "I have no money." "There wasn't anyone who didn't enjoy the party" is interpreted as "Everyone enjoyed the party."  Is this context dependent? If so, how does one decide which interpretation is correct?


can I bring a cheese slicer (aka cheese plane) in my carry-on bag? It's a domestic flight, if it matters.  By cheese plane, I don't mean a grater - It slice cheese into thin slices. I'll look for a link on amazon.  By domestic flight, I mean internal U.S. flights.

Will I be permitted to pack a cheese grater in my carry-on bag for a domestic U.S. flight, or will this be considered a "potential weapon" and prohibited?


I'm much confused about these two sentences.  Which one is the correct one?  I heard that we can't use " Who are, who were,  who have"?  Is this okay to say?  One of my friends said.  His explanation is given below.   'Who have' is not correct. 'Who' isn't followed by are, have or were in a question wether the subject is singular or plural. In your example no matter the group is created by a person or more than one person, we would only ask who has created to find out about the subject.  Actually, we discussed this above mentioned question. After that, he shared his views which have been added by me over here.  Thanks in advance.

The situation is that:  We've already read three English novels.  Which is the correct question for that situation?   Who has already read three English novels?  Who have already read three English novels?    Or could both be correct? Please also provide the grammatical reasons for your answers.


I want show that      If $ n  \geq 3$ , A subgroup $H$ of $S_n$ having index 2 is $A_n$.   Say $H$ is such a subgroup. Since $A_n$ is a normal subgroup of $S_n$,$H$ normalizes $A_n$ .  By 2nd isomorphism theorem , $HA_n$ is a group such that $$ HA_n / A_n \mbox{ is isomorphic to } H/ H \cap A_n$$  What shall i do?

How to prove that the only subgroup of the symmetric group $S_n$ of order $n!/2$ is $A_n$?  Why isn't there other possibility?  Thanks :)


There are quite a few links referring to whether a MacBook GPU is CUDA capable       Apart from the information stated in the above posts, is there even a MacBook capable of running CUDA?  Apple has been supporting Intel Graphics GPUs for quite some time. Is there a possible NVIDIA GPU for Macs to enable CUDA support?  Do the new MacBooks of 2015 (and the possible 2016) come with a CUDA capable GPU?

After visiting this page:    I don't know if my MacBook Pro is suitable for CUDA developement. After About This Mac I see this:    It does not seems to be a graphic card in this list:   But I asked several times before buying this machine if it is capable for gpu stuffs. And I can correctly runs program that uses shaders. And, more important, I have installed CUDA driver and toolkit and they doesn't seems to give any error. But If I try to compile manually something with CUDA.. it doesn't work.


In a 3D world I simulate that a coin is being pushed over a plane (applying a force in his rigidbody where y-axis = 0) using a top-down view.  Some time ago but using Box2D, I was able to calculate the amount of force required to stop the coin in a desired position with just one push.  Box2d-js  var fps=60; var groundFriction = 0.01; var force= new Box2D.Common.Math.b2Vec2(distance.x * coin.box2dBody.GetMass() * fps * (groundFriction * fps),       distance.y * coin.box2dBody.GetMass()* fps *(groundFriction * fps)); coin.box2dBody.ApplyForce( force, coin.box2dBody.GetWorldCenter(), true );   In order to simulate the friction, during the update, I substracted the groundFriction(0.01) to the linearvelocity of the objects in movement in every frame.  Now using Unity with a more complex physics engine I cant replicate the same.  Unity3d  Vector3 posFinal = transform.position + direction * distFinal; Vector3 distanceVecFinal = posFinal - transform.position; float fps= 1/Time.fixedDeltaTime //50 fps Vector3 force = new Vector3(distanceVecFinal.x  * myBody.mass * fps, 0,      distanceVecFinal.z  *    myBody.mass * fps); myBody.AddForce(force);   I think that in the final formula I should add the friction of the objects, but I am not sure how to do it. Maybe this is not the only thing that I should change.  I need help pls!  tl&dr Calculate the required force for making move an object to a desired position in a plane with just one push.

I bought a book called Programming game AI by example and I am trying to implement the arrive steering behavior. The problem I am having is that my objects oscillate around the target position; after oscillating less and less for awhile they finally come to a stop at the target position. Does anyone have any idea why this oscillating behavior occur? Since the examples accompanying the book are written in C++ I had to rewrite the code into C#. Below is the relevant parts of the steering behavior:  private enum Deceleration {     Fast = 1,     Normal = 2,     Slow = 3 }  public MovingEntity Entity { get; private set; }  public Vector2 SteeringForce { get; private set; }  public Vector2 Target { get; set; }  public Vector2 Calculate() {     SteeringForce.Zero();      SteeringForce = SumForces();      SteeringForce.Truncate(Entity.MaxForce);      return SteeringForce; }  private Vector2 SumForces() {     Vector2 force = new Vector2();      if (Activated(BehaviorTypes.Arrive))     {         force += Arrive(Target, Deceleration.Slow);          if (!AccumulateForce(force))             return SteeringForce;     }      return SteeringForce; }  private Vector2 Arrive(Vector2 target, Deceleration deceleration) {     Vector2 toTarget = target - Entity.Position;      double distance = toTarget.Length();      if (distance > 0)     {         //because Deceleration is enumerated as an int, this value is required         //to provide fine tweaking of the deceleration..         double decelerationTweaker = 0.3;          double speed = distance / ((double)deceleration * decelerationTweaker);          speed = Math.Min(speed, Entity.MaxSpeed);          Vector2 desiredVelocity = toTarget * speed / distance;          return desiredVelocity - Entity.Velocity;     }      return new Vector2(); }  private bool AccumulateForce(Vector2 forceToAdd) {     double magnitudeRemaining = Entity.MaxForce - SteeringForce.Length();      if (magnitudeRemaining <= 0)         return false;      double magnitudeToAdd = forceToAdd.Length();      if (magnitudeToAdd > magnitudeRemaining)         magnitudeToAdd = magnitudeRemaining;      SteeringForce += Vector2.NormalizeRet(forceToAdd) * magnitudeToAdd;      return true; }   This is the update method of my objects:  public void Update(double deltaTime) {     Vector2 steeringForce = Steering.Calculate();      Vector2 acceleration = steeringForce / Mass;      Velocity = Velocity + acceleration * deltaTime;      Velocity.Truncate(MaxSpeed);      Position = Position + Velocity * deltaTime; }   If you want to see the problem with your own eyes you can download a minimal example .  Thanks in advance.


Is there any application in macOS (MacBook Pro) which can work like SuperPuTTY / PuTTY CM does in Windows? I am looking for a free one.  What I need is to organize my ssh sessions. I can ssh to my machines using terminal but they are individual windows and kind of hard to get IP addresses / names every time I need to connect to them.  It can also be an application which uses terminal application in Mac for ssh ..

Is there a good  (free telnet / ssh client) equivalent for OS X?  I know that I can just use terminal and an ssh command, but I want some sort of application that will store connection info, passwords, logs, etc for me, much like PuTTY.  Does this exist?


Im trying to run my file and I keep getting the error:  ERROR - Error: Found biblatex control file version 3.4, expected version 3.3. This means that your biber (2.7) and biblatex (3.9) versions are incompatible. See compat matrix in biblatex or biber PDF documentation.  I already tried downloading Biber from here  I then put the biber file next to my tex document and it still gives the same error message.  I searched for Biber in the package manager and could not find it. How can I update my Biber to 2.9?  After trying to select all to update, the process won't work.

I'm trying to switch from BibTeX to biber and ran into the problem that biber does not produce any output file. I noticed several questions about problems with biber e.g.,            ,                       But none of them helped me in my particular situation (which was actually just an old version of biber somewhere in the path of my OS). Since I also noticed that several questions regarding problems with biber were closed as too localized since the underlying problem was due to formatting of a bib resource or similar simple issues, I would rather like to ask for a general troubleshooting guideline for using biber (since I saw many hints like "check/delete the cache", "check versions of this and that" etc.).  What steps are to be taken and what things (in particular files) to be checked if biber does not produce an output file (and its output on the command line does not directly give you the advice what to do)?


Age  12-17  18-24   25-34   35-44   45-54   55-64   65+ Category 1       5   16  14  44  13  12  0 2       0   1   3   0   0   0   0 3       3   2   6   1   0   1   0 4       27  3   3   13  0   3   2 5       0   4   4   9   6   7   4   The above is results of questionnaire data, I was going to use the chi^2 test on this but as it has very small values and values of zero, it is not appropriate.  I would like to test the if there is a relationship between age and category (which is about where the shop, i.e five 12-17 year olds shop at category 1).  What test if any could I use?  thanks

I applied a survey consisting of 12 questions to 120 people and each questions include 4 nominal categories; I want to make comparison of people's answers according to their socio-demographic characteristics such as their educational level or socioeconomic status. All of my comparison criteria consist of nominal categories and number of categories change between 3 to 6. I cannot drop or combine comparisons; categories in other words number of categories are fixed.    My question is when I compare the frequency distribution of people's answers based on their education levels (for example) through chi-squared test, I got a warning that says (for instance) 7 cells have less than count five; minimum expected count is; 43.  I got this warning for almost my all questions - demographic characteristics comparisons.    Shall I underestimate this warning and use my test results or is there a different test I should use? If I should use a different test, which one?


I spotted this on Super User but I believe the same or similar messages can appear on any SE site. Below are two messages that contradict each other. They appeared in a single post, one under the other:    (For the record, the screenshot is from .) The first message states [emphasis mine]:  Closed. This question […] is not currently accepting answers.  The second message states [again, emphasis mine]:  Locked […]. Comments on this question have been disabled, but it is still accepting new answers and other interactions.  The question at the time was not accepting new answers. The first message was right, the second message was wrong in this matter. The second message should be corrected. It should reflect the actual status of the question. It should not contradict with the first message.

When a question has a "comments-only" lock, the following notice is displayed on top of the question:  Locked for X days. Comments on this question have been disabled, but it is still accepting new answers and other interactions.  However, I noticed that if the question is closed (even before the lock), the same notice is used:  ..which could be confusing, especially for new users. Proposed change to the notice on closed questions:  Locked for X days. Comments on this question have been disabled, but it is still accepting [votes and] other interactions.  Or, as others have suggested, the additional "but it is still accepting [...]" part can simply be removed as it hardly provides any new information.


Based on the definition of $e: = \lim_{x\to\infty} \left(1+\frac1x \right)^x$, how can we show that   $$\lim_{x\to \infty}\left( 1-\frac{\lambda}{x} \right)^x  = e^{-\lambda}?$$  So far I've tried changing variables, $\eta = \frac{-x}{\lambda}$, so $=\lim_{\eta \to -\infty}\left( \left( 1 + \frac1\eta \right)^\eta \right)^{-\lambda}$. But then we would need to show $\lim_{\eta \to -\infty}\left( 1 + \frac1\eta \right)^\eta =e$.

I knew that $e^x=\lim \limits_{n\to+\infty }{\left(1+\frac{x}{n}\right)^n}$. But I've never seen its proof. So I tried to prove it using $\exp(\ln x)=\ln(\exp(x))=x$. Here is what I've tried so far :   $$ \left(1+\frac{x}{n}\right) ^n=e^{n\ln(1+\frac{x}{n})}$$ $$\text{I'll now study just } {n\ln\left(1+\frac{x}{n}\right)}.$$$$ \text{If this function has the line }y=x \text{ as oblique asymptote, then the equality is proven.}$$  $$ n\ln\left(1+\frac{x}{n}\right) = n\ln\left(\frac{n+x}{n}\right)$$  $$=n[\ln(n+x)-ln(n)]$$ $$=n\left[\int_1^{n}\frac{dt}{t}+\int_{n}^{x}\frac{dt}{t}-\int_1^{n}\frac{dt}{t}\right]$$ $$=n[\ln(x)-\ln(n)]$$  But I just don't know how to show that this expression has an oblique asymptote $y=x$. I've thought that if there is an oblique asymptote as $n$ goes to infinity, than for a huge $n$, we have :  $$\ln\left(1+\frac{x}{n}\right)\approx \frac{x}{n}\approx0$$ Which looks correct but we could have any other function $f(x)$, $\ln\left(1+\frac{x}{n}\right)\approx\frac{f(x)}{n}\approx 0$. Which doesn't prove the oblique asymptote because $x$ is constant.  So how can prove $e^x=\lim \limits_{n\to +\infty } \left(1+\frac{x}{n}\right)^n$? And where did I go wrong?


I just picked up a mint SMC Takumar 28mm f3.5 lens. From what I read people say it provides quite good image quality. And the things I read about my Canon T3 kit lens 18-55mm f3.5-5.6 IS, is that it is garbage.  So I was excited to do an A B comparison of these two lenses. And I could not really notice a difference. In some cases the takumar was sharper, but then another case would arise where the kit lens was sharper. Maybe my test weren't very controlled.  Either way, what should I be comparing when assessing image quality? And why does it vary?  Now in the case that parameters are held constant....  Can a lens ever vary the color of the image? If so why?  Could a lens vary the sharpness of an image? If so why?  What other attributes of image quality usually vary across lenses?

When reading lens reviews on the Internet, I often find subjective statements about the image quality that a lens produces, such as "good contrast" or "sharp". The problem is that I don't think I am capable to actually see these qualities on an image. I don't even think I could tell the difference between a cheap kit lens and a top lens, if not by "this just looks better".  So my question is: without looking at sharpness tests and MTF curves, how do you learn to judge the quality of a lens based only on sample images? What are the characteristics you look for and what constitutes good or bad in each of them?


I used to think that to use a bibliography, one always needs to load either biblatex or natbib however in my current thesis template, neither package is loaded and yet there is a bibliography (from .bib file generated by JabRef in biblatex mode).  When I try to use the biblatex package, I get errors reffering to the way the bibliography style is set.  What is the Latex default bibliography "tool"? Also if everything's working fine, why would I want to use biblatex?  (Using TexStudio, TexLive, JabRef)

According to , biblatex and natbib are packages while biber and bibtex are backends. If I don't specify either any package or any backend, it still compiles fine. Which package and backend combination is being used in this case?  demo.tex  \documentclass{article} \begin{document}  \nocite{*} \bibliographystyle{ieeetr} \bibliography{pub}  \end{document}   pub.bib  @article{janssen1996evaluation,     title={Evaluation of the DNA fingerprinting method AFLP as a new tool in bacterial taxonomy},     author={Janssen, Paul and Coopman, Renata and Huys, Geert and Swings, Jean and Bleeker, Marjo and Vos, Pieter and Zabeau, Marc and Kersters, Karel},     journal={Microbiology},     volume={142},     number={7},     pages={1881--1893},     year={1996},     publisher={Soc General Microbiol} }  @article{vos1995aflp,     title={AFLP: a new technique for DNA fingerprinting},     author={Vos, Pieter and Hogers, Rene and Bleeker, Marjo and Reijans, Martin and Van de Lee, Theo and Hornes, Miranda and Friters, Adrie and Pot, Jerina and Paleman, Johan and Kuiper, Martin and others},     journal={Nucleic acids research},     volume={23},     number={21},     pages={4407--4414},     year={1995},     publisher={Oxford Univ Press} }


this is a function that chooses items randomly from a given array until all are taken and only then repeating  i actually copied the code from a post because i couldn't understand how the variable copy's scope works .  PS : here's the post   thanks in advance for the help .  function randomNoRepeats(array) {   var copy = array.slice(0);   return function() {     if (copy.length < 1) { copy = array.slice(0); }     var index = Math.floor(Math.random() * copy.length);     var item = copy[index];     copy.splice(index, 1);     return item;   }; }  var chooser = randomNoRepeats(['Foo', 'Bar', 'Gah']); chooser(); // => "Bar" chooser(); // => "Foo" chooser(); // => "Gah" chooser(); // => "Foo" -- only repeats once all items are exhausted.

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


Have you ever noticed that Chewbacca can't say the word "Chewbacca"? What is the out-of-universe origin of this name? George Lucas is a well known fan of Japanese film, but I can't imagine him naming a character Chuu-baka (eg. "moderately stupid"). What language does this come from?

Chewbacca (Chewie to his friends) is the Wookiee in the original Star Wars trilogy.  We know his name because people other than he say his name.  Whenever he speaks, it's in growls and other noises, he can't verbalize Basic like the humans and C-3P0 can.  But, he also can't enunciate the name 'Chewbacca'.  Other Wookiees have the same issue, they have names that they obviously couldn't pronounce.  How does Chewbacca have that name, when he himself cannot pronounce it?


Can you use three quotes in a sentence by including a quote within a quote? Eg "' xxx ' xxx"

How would embedded quotations be used when quoting from passages/sources within an essay? What would be the difference between normal quotations and embedded quotations?


I wish to add a buffer into project that will update the buffer fields when new points/ polygons are added into the project

I use QGIS (2.10.1) to create buffers around polygons.  I often create a series of buffers, and later need to edit the underlying polygons.  It is frustrating to start from scratch in re-create several buffers based on the changes when this happens.  Is there a way to create a 'live' buffer, that will automatically update to changes made to the parent polygon, or as a second best, a means to replicate with one click, the buffer settings and formatting that you originally created?


I know there are some posts talking about this, but I don't understand them at all. I am trying to compute the Lie algebra of the affine maps: Aff(n)$=\{\begin{pmatrix} A & v   \\ 0 & 1   \end{pmatrix} / A \in GL(n,\mathbb{R}), v \in \mathbb{R}^n \} $. I know it must be $\mathfrak{aff}(n)=\{\begin{pmatrix} A & b   \\ 0 & 0   \end{pmatrix} /  \in \mathfrak{gl}(n,\mathbb{R}), v \in \mathbb{R}^n \}$ and I have proved that if $X$ is in $\mathfrak{aff}(n)$, then $X$ is of the form $\begin{pmatrix} A & b   \\ 0 & 0   \end{pmatrix}$. For the other inclusion, I don't know how to proceed. I tried to compute the exponential of such a matrix but I didn't get anywhere.

Let $G$ be the Lie group of affine transformations, $$\{x \mapsto Ax+b,A \in GL(n), b \in \mathbb{R}^n\}.$$ We can represent these maps as matrices $$\begin{pmatrix} A & b   \\ 0 & 1   \end{pmatrix}.$$  Now, I read that one can describe the Lie algebra $\mathfrak{g}$ as the set of matrices $\begin{pmatrix} A & b   \\ 0 & 0   \end{pmatrix}$ How can I rigorously show that this is indeed the Lie algebra of $G$?


My First Question! But it's in two parts. Context: I am given a Probability Density Function, and the question wants me to find the density of a statistic. Given pdf: $$f(x, \theta, \phi)=\frac{1}{\theta \phi}\left(\frac{x}{\theta}\right)^{\frac{1-\phi}{\phi}}, \quad 0 \leq x \leq \theta, \quad 0<\phi<1 $$ Show that the density of the statistic $$T=X_{(n)}$$ is given by $$ f_{X_{(n)}}(x)=\frac{n}{\theta \phi}\left(\frac{x}{\theta}\right)^{n / \phi-1} \quad \text { for } 0 \leq x \leq \theta $$otherwise zero. Part 1: What Statistic is this?$$T=X_{(n)}$$ I don't know what it means or what is it called. Is it the nth observation? Part 2: How do you find the density of a statistic? If the statistic was the mean, would it possible to find the density of the mean? Am I making sense? I am not primarily from a Stat Background, but I've been holding on due to my math so far. But there might be some painfully obvious things I'm unaware about. Thank You for being patient. Edit: The question mentions a hint, I am not looking for the solution but rather explanations for my conceptions, so this might be unnecessary but nonetheless.  Hint: You might consider using the following$$P\left(X_{(n)}<x\right)=P\left(X_{1}<x, X_{2}<x, \ldots, X_{n}<x\right)$$

If an item follows normal distribution, average also follows normal distribution. What about minimum and maximum?


I need a book on mathematical optimisation which covers as many topics from the following list as possible:   Introduction (Graphs, Paths, Network Planning, Spanning Trees, Matchings),  Matroids (Independence Systems and Matroids, Bases, Circuits and Ranks, Maximization over Independence Systems and Matroids Minimization over Bases Systems) Running Time of Algorithms (Algorithms, Encoding Length, Polynomial-time Algorithms, first Polynomial-time Computations),  Dynamic Programming (Multilevel Decision Processes, Knapsack Problem, Shortest Walks and Paths), Optimization in Networks (Flows and Cuts, Augmentation, Algorithm of Dinic),  Elements of Complexity Theory   It would also be helpful if you could tell me the prerequisite background for the same.

Recently, I heard some talks about Optimization. And I am beginning to love that field.  I want to study beginning optimization, what book can you recommend for me? Also what tips can you give to a beginner in studying this field?  Thanks a lot.


Does a Pokémon's weight and height influence their CP?   Or are the differences between Pokémon weight/height purely cosmetic, i.e. "just for fun"?

Whilst checking my Pokémon, I saw one Pidgey with very small CP value in comparison to his brethren. I noticed his weight is smaller, and he has an "XS" mark (see the screenshot).   Is this special? Can I do something with it? Is it more valuable?


How do I actually copy some fixed text to clipboard using javascript? This is my code and it's not working maybe there's another way and I don't know. <button onclick="Copy()">Copy</button> <script> function Copy() { document.execCommand("copy","Some text here"); }     </script>  I want to copy some fixed text using just button, so I don't have to select texts manually and copy them. Thanks.

What is the best way to copy text to the clipboard (multi-browser)? I have tried: function copyToClipboard(text) {     if (window.clipboardData) { // Internet Explorer         window.clipboardData.setData("Text", text);     } else {         unsafeWindow.netscape.security.PrivilegeManager.enablePrivilege("UniversalXPConnect");         const clipboardHelper = Components.classes["@mozilla.org/widget/clipboardhelper;1"].getService(Components.interfaces.nsIClipboardHelper);         clipboardHelper.copyString(text);     } }  But in Internet Explorer it gives a syntax error. In Firefox, it says unsafeWindow is not defined. A nice trick without using :


I would like to find an group isomorphism $f:\mathbb{Z}/17\mathbb{Z}\times \mathbb{Z}/561\mathbb{Z}  \to \mathbb{Z}/51\mathbb{Z}\times \mathbb{Z}/187\mathbb{Z} $. By the fundamental theorem of a finite abelian group and the Chinese remainder theorem, we know that those groups are isomorphic, but I want to show it by constructing an isomorphism. However, I don't know what the first step is. The only thing I know is that $f(0,0)=(0,0)$ since an isomorphism maps an identity element to an identity element. Then I saw  and tried to mimic the way, like $f(x,y)=(x\mod{51},y\mod{187})$, but it is obviously not a surjection. Now I am stuck here. Any help?

How would one go about proving that $\mathbb{Z}_m\oplus \mathbb{Z}_n \cong \mathbb{Z}_d\oplus \mathbb{Z}_l $ as groups, where  $l=\mathrm{lcm}(m,n)$ and $d=\gcd(m,n)$?    I am attempting to use the fundamental theorem of finitely generated abelian groups but am struggling. In the interest of honesty, this is a past exam question that I am attempting for which the solutions are not available. EDIT: As the question was asked in the paper, the Chinese Remainder Theorem would not be permitted since this is only proved in the follow-up course.


Got/Gotten- Which one should I use and is there a trick?

I see these two expressions are used almost identically in different contexts. Is there a difference between I have got and I have gotten?


What is the distance between two objects in space as a function of time, considering only the force of gravity? To be specific, there are no other objects to be considered and the objects in question are not rotating.  For instance, say you have two objects that are 6 million miles apart. One is 50,000 kg and the other is 200 kg. Say I want to know how much time has passed when they are 3 million miles apart. How would I go about doing that?  EDIT: Looking at the other question I am having trouble following David Z's steps in his answer. Intermediate steps would be helpful. In particular I don't see how the integration step works. I also don't understand why the initial r value, ri remains as a variable after it's derivative has been set to 0, wouldn't the integral of that derivative (i.e. the function ri) be 0 + C? I also don't see how you wind up with a term that includes 2 under a square root sign.  I can not ask for the intermediate steps on the question itself because I do not have the reputation points.   I think it probably answers my question or will once I understand it, but I am not sure.  EDIT: I can sort of understand the integration step. But it seems like he is integrating with respect to two different variables on both sides, the variables being r on the left and the derivative of r on the right. There must be something I'm missing here.

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


If someone asks help on a subject, and I am lacking in knowledge on it, which is appropriate or correct?  I am really not into it I am not really into it  The intention is to convey that I am not well versed in this particular subject.

I can't distinguish the difference in meaning between these  two sentences.   It really doesn't matter.  It doesn't  really matter.    It seems that there is a nuanced difference, but I cannot see what this is.


After my camera app crashed this process is running and consuming 42% of battery but today morning it disappeared but still my battery is draining out too quickly! Even restart doesn't help.   Screenshot (click image for larger variant)  How can I get things back to normal?

Recently, mm-qcamera-daemon has been causing massive battery drain on my Nexus 5, and making it become rather warm. At the same time, the camera appears to be locked, meaning opening the default camera app (or any camera app) causes the alert Camera is currently in use to appear.  Numerous forums around the web site apps such as Snapchat and a Yahoo video app as the issues, but I've never installed these apps before.  Restarting the phone does seem to fix the issue, but after awhile (more than 12h) later, the battery starts draining again.    UPDATE: Like the top answer says, this problem should have been fixed by the 4.4.4 Kitkat update that rolled out.


Let $X,Y,Z$ be three topological spaces, let $X\times Y$ have the product topology, let $p_X:X\times Y\to X$ and $p_Y:X\times Y\to Y$ be projective maps, and let $f:Z \to X \times Y$ be a function.  I want to prove that $f$ is continuous if and only if $p_X \circ f: Z \to X$ and $p_Y \circ f:Z \to Y$ are continuous.  Given the fact that the projective maps are continuous, one direction is clear.  Now suppose $p_X \circ f$ and $p_Y \circ f$ are both continuous and let $U \times V \subseteq X \times Y$ be open. Then $U$ and $V$ are open in $X$ and $Y$ respectively, and $U \times V = p_X ^{-1}(U) \cap p_Y ^{-1}(V)$.  Thus $f^{-1}(U \times V) = f^{-1}(p_X ^{-1}(U) \cap p_Y ^{-1}(V)) = f^{-1}(p_X ^{-1}(U)) \cap f^{-1}(p_Y ^{-1}(V)) = (p_X \circ f)^{-1}(U) \cap (p_Y \circ f)^{-1}(V)$ is open in $Z$ as the intersection of two open sets. In this last step we used the continuity of $p_X \circ f$ and $p_Y \circ f$. Hence $f$ is continuous.  I am not entirely sure about this proof. I believe it contains some error, but I can't quite put my finger on it.  All remarks, corrections or improvements would be highly appreciated.  Edit: I should clarify what I mean by the product topology: Let $(X, \tau_X)$ and $(Y, \tau_Y)$ be topological spaces. $X \times Y$ is said to have the product topology $\tau$ if $\tau = \{ U\times V : U \in \tau_X , V \in \tau_V \}$. I hope this isn't too unorthodox a definition of the product topology. It is the one I have been working with all year. I am trying to prove the statement above using this definition of the product topology.  Second edit: In my previous edit, I gave a false definition of the product topology. It should be defined as the topology obtained from the basis $\{ U\times V : U \in \tau_X , V \in \tau_V \}$. In particular, this implies that if $U$ and $V$ are open in $X$ and $Y$ respectively, then $U \times V$ is open in $X \times Y$, but the converse is not necessarily true.

I read the definition of a universal property of a product of topological spaces. Generally it says that for map $f$ from $\mathbb{X}$ to $\mathbb{Y}$ and map $g$ from $\mathbb{X}$ to $\mathbb{Z}$ there exist unique map $h$ from $\mathbb{X}$ to $\mathbb{Y}\times \mathbb{Z}$ such that projection of image of $h$ equals to image of $f$ and image of $g$. For what purpose we use this property and isn't it just $h(x)=(f(x),g(x))$ ?  Thanks.


Within Finder, it would be sweet to have an "Open Terminal here" like in Linux Ubuntu. It should open a Terminal within the path Finder is currently pointing to.

I've seen Automator and AppleScripts that open a terminal to the path of the file currently selected in a Finder window.  I think it would be more useful to me to simply have a button on the Finder toolbar that opens a terminal window to the current directory listed in the Finder.  How can I get a Terminal-here button added to the Finder toolbar?


Let $f:[a,b]\to[a,b]$ be a continuous function which is differentiable  on $(a,b)$ and $f(a)=a$ and $f(b)=b$. Prove that there exists two distinct points $c$ and $d$ such that $f'(c)f'(d)=1$.   Since the function is continuous on closed interval and differentiable on open interval therefore by mean value theorem there exists $c$ such that      $f(b)-f(a)=f'(c)(b-a)$.  From there I got $f'(c)=-1$ but I am unable to find $c$ and $d$ such that $f'(c)=-1$ and $f'(d)=-1$ so that I could say $f'(c)f'(d)=1$.   And by fixed point theorem I got $f'(x)$ is greater than $1$ since $f$ does not have unique fixed point, but how to continue further?

Let $f:[0,1]\to\mathbb{R}$ be continuous with $f(0)=0$, $f(1)=1$ and $f$ is differentiable on $(0,1)$. Show that there are distinct $\xi,\eta\in(0,1)$ so that $f'(\xi)f'(\eta)=1$.  I think this requires mean value theorem. But this does not help since if apply the theorem to $f$ we can only get $f'(c)=1$ for some $c$.


I would like to know if compactness is equivalent to limit point compactness in general for any topology. If so I'd like to see a proof, other wise I'd like to see a counter example. I am curious about this because I want to get an intuition for compactness, limit point compactness makes intuitive sense to me as a way of determining if you can "escape" the space by getting ever closer to a point "outside" the space, however the idea of open covers and open sub covers seem to come out of no where, I'd like to see an example where there 2 definitions differ so that hopefully I can see the need for the compactness definition that we use.  This is not a duplicate of limit point compactness implies compactness as I am not just asking about the first direction of implication but rather both directions of implication, I also want to know if compactness implies limit point compactness.

I have a question about the following counterexample, why  $U_n = \{n\} \times Y$ has not finite collection covering $X$?   Is it because if you take a finite set $S\subset U_n$ then it's impossible to have $X\subset \bigcup S$ since X is infinite?  Counterexample:  Let $Y$ consist of two points; give $Y$ the topology consisting of $Y$ and the empty set. Then the space $X = \mathbb{Z}_{+} \times Y$ is limit point compact, for every nonempty subset of $X$ has a limit point. It is not compact, for the covering of $X$ by the open set $U_n = \{n\} \times Y$ has not finite collection covering $X.$


There is a file named partner like:  abc def ghi   There is another conf file like:  part=abc var=x var=y id=123  part=def var=z id=345   and so on...  I am making a shellscript which reads line from 'partner' using while loop, then searches the block containing that partner name in conf file using sed. After that, and finally replacing id value (eg: from 123 to 123_1 )using sed and storing the new block in another file.  while read -r var || [[ -n "$var" ]] do sed -n '/part=$var/,/^$/p' conf.cfg | xargs sed 's/id=123/id=123_1/g' >> new.txt done   What am I doing wrong? As it only gives me empty lines of text as output.

I want to do:  cat update_via_sed.sh | sed 's/old_name/new_name/' > new_update_via_sed.sh   in my program.  But I want to use variables, e.g.  old_run='old_name_952' new_run='old_name_953'   I have tried using them but the substitution doesn't happen (no error). I have tried:  cat update_via_sed.sh | sed 's/old_run/new_run/' cat update_via_sed.sh | sed 's/$old_run/$new_run/' cat update_via_sed.sh | sed 's/${old_run}/${new_run}/'


For which integers $n$ there exists integers $0\le a,b,c < n$ such that $n^2=a^2+b^2+c^2$? I made the following observations:  For $n=1$ and $n=0$ those integers doesn't exist.  If $n$ is a power of 2 those integers doesn't exist. Let $n=2^m$ with $m>0$ the smallest power of 2 for which there exists $a,b,c$ such that $\left (2^m\right )^2=4^m=a^2+b^2+c^2$. Since $4^m$ is divisible by 4, $a^2+b^2+c^2$ has to be divisible by 4 too. This is only possible if $a^2\equiv b^2\equiv c^2\equiv 0\pmod 4$, so we can write $a=2a',b=2b',c=2c'$ with $a',b',c'\in \mathbb{N}$. But then we get $\left (2^{m-1}\right )^2=4^{m-1}=a'^2+b'^2+c'^2$, so $m=1$, otherwise $2^m$ wouldn't be the smallest power of two with this property. It is easy to check that $n=2$ doesn't work, so for $n=2^m$ the statement doesn't hold.  I suspect (but can't prove) that for all other values the statement holds. It would be enough to prove that for all odd primes $p$ there exists $a,b,c$ such that $p^2=a^2+b^2+c^2$, since for all other values of $n$ there exist some $p,m$ such that $n=pm$. Then we get $n^2=(pm)^2=(ma)^2+(mb)^2+(mc)^2$.

Consider the set of integers $x_1, x_2, x_3, x_4$  Such that:  $$x_1^2 + x_2^2 + x_3^2 = x_4^2$$  How does one compute all the solutions to this system?  I have the following method in place for computing solutions given the initial condition that $$x_1^2 + x_2^2 = y^2$$ for some integer $y$.  One can make the standard Pythagorean triple reduction given this condition and then repeat the reduction again thus generating a general solution for all integers.  But what if there exists 3 square numbers such that the sum of any 2 squares in this set if not a square but the sum of all 3 squares is a square? I have no reason to rule out this possibility and no way of generating such solutions  As a side note:  Given a number and told that it is part of a Pythagorean triple (let's say it's the hypotenuse) how do you find the other squares that sum to it?


I tried this  string *codes = (string*)malloc(256*sizeof(string)); codes[0] = "";   in C++. But it didn't work, but when I tried  string *codes = new string[256]; codes[0] = "";   This worked. I did not understand the basic idea behind why this is happening. Could someone please tell me.  Thanks

I see in C++ there are multiple ways to allocate and free data and I understand that when you call malloc you should call free and when you use the new operator you should pair with delete and it is a mistake to mix the two (e.g. Calling free() on something that was created with the new operator), but I'm not clear on when I should use malloc/ free and when I should use new/ delete in my real world programs.  If you're a C++ expert, please let me know any rules of thumb or conventions you follow in this regard.


I am facing a weird regex issue. This is a simple regex to replace a-z with a space. But it only replaces up to a certain fixed length.  import re  s = 'aaaaaaaaaaaaabbbbbbbbbbbbbbbbbccccccccccccccccccdddddddddddddddddd' s = unicode(s, 'utf-8') s = re.sub(r'[a-z]', ' ', s, re.UNICODE) print s   On running this code, the output is                                  ccccccccccccccccdddddddddddddddddd   If I remove the re.UNICODE flag, then it works fine. Can someone please explain why is this happening.

The Python docs say:     re.MULTILINE: When specified, the pattern character '^' matches at the beginning of the string and at the beginning of each line (immediately following each newline)... By default, '^' matches only at the beginning of the string...   So what's going on when I get the following unexpected result?  >>> import re >>> s = """// The quick brown fox. ... // Jumped over the lazy dog.""" >>> re.sub('^//', '', s, re.MULTILINE) ' The quick brown fox.\n// Jumped over the lazy dog.'


When I compile my code, I get the following:  Display ommitted hash table:  Exception in thread "main" java.lang.NullPointerException at Hash.display_hash_table(Hash.java:268) at Driver.main(Driver.java:20)   Here are the relevant portions of code:  public void display_hash_table()  {     System.out.println("Display ommitted hash table: ");      pw.append("Display ommitted hash table: \n");      for (int i = 0; i < table.length; i++) {          System.out.println(String.valueOf(i) + "\t" + table[i].getData());          pw.append(String.valueOf(i) + "\t" + table[i].getData() + "\n");      }      System.out.println("The total number of probes is: " + String.valueOf(this.count_probe) +     "\n");      pw.append("The total number of probes is: " + String.valueOf(this.count_probe) + "\n");  }   and      omitted_words.display_hash_table();   Does anyone have any suggestions on what could possibly be my error?  Thank you!

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I recently had  that promptly got closed. After a meta discussion, a user made a very good edit, after which the question was re-opened and now (at the time this post was made) has 11 upvotes.  So what I wanted to propose is the possibility of a badge that gets awarded for editing a closed question and causing it to be re-opened. This would be a good way to encourage people to try to salvage closed questions that have the potential for improvement. Closed questions getting improved and re-opened no doubt leaves a positive impression on new users, and gives lets them see firsthand exactly what was wrong with their question (and what was right with it).  I recognize that there are more things to take into consideration here. Particularly, how can we be certain that a particular edit is the cause of it being re-opened? For this I have a few ideas:   Perhaps it can be awarded to the most recent edit. I recognize that this has the potential for "gaming" in that a person can see that a post is about to be re-opened and make an inconseqential edit in order to earn the badge. Maybe it can be awarded to the most  recent edit before the first re-open vote? Another idea which may be a bit more fair is this: maybe it should only be awarded if there has only been one edit to the post before the first vote to re-open. This is more fair, but of course it has the problem that it will at times fail to award the badge when it was deserved (i.e. when someone makes a great edit that salvaged the question, but someone else just made a simple grammar edit, it will cause the former person's edit not to be recognized).   This is just something I wanted to throw out there. Since this is just an idea, I'll just tag it as discussion instead of feature request.

We should give a badge to editors who improve closed questions so much that they get reopened.  David Fullerton suggested this badge as part of , which explains the motivation. I just thought it deserved a full-fledged, standalone request. (Actually, when I read his answer, the idea felt very familiar, and I was certain that it had been proposed before. However, I couldn't find any existing proposal after a relatively long search.)  There are lots of possible variants on this idea, which I'll let people hash out in discussion. Things to consider:   How many questions do you need to get reopened to earn the badge? What if there are already reopen votes on a question you're editing? What if a question gets re-closed after reopening? Re-reopened? Should it matter if the question you edit is your own? If some user posts a bad question, a couple people vote to close, a Good Samaritan edits the question into shape, and no more close votes get cast, should the Good Sam get the badge? What's a good name? David suggested "Resurrection." I'm not a huge fan of that, for two reasons. First, it sounds too much like Revival and Necromancer, but this badge doesn't work like either of those. Second, it implies that closed questions are dead, which is exactly the image that we're trying to eliminate. Bronze, silver or gold?


Does every complete category have a terminal object, and dually every cocomplete category an initial object?   If so, can someone indicate to me how one can see that?

I understand terminal objects, but I falter when trying to achieve them using the approach of diagrams, the category of constant diagrams $\mathcal{C}^{\mathcal{J}}$ and limits.  I have the empty category 0, now I have a diagram $D: \mathcal{J} \to \mathcal{C}$. However this diagrams image should be empty, because there are no objects or morphisms to map. At this point, I'm confused, because I can't get to the universal property $\forall c \in \mathcal{C}. \exists! f: c \to T$ anymore, because I'm missing T. (EDIT: I get that this is how it is supposed to be)  But continuing with the category of constant diagrams, even if I have a constant diagram mapping everything to one object / morphism, there is nothing to map, so the functors image is still empty. So now I'm missing both $T$, and any kind of $c$.  EDIT: It seems to me, have I chosen 1, instead of 0, I would have come up with that is considered the definition of the terminal category. What am I missing?


I guess, I know how to solve inequalities with absolute value, but I have problems with this one.  $||a|-|b||\le |a-b|$  $a,b\in \mathbb{R}$  I tried to solve the inequation like this:  case1: $a>0$   case2: $a<0$   I started with case 1. than we have two possibilities $b<0$ and $b>0$   Firstly I took $b<0$ and I had another two possibilities  $|a+b|>0$  $|a+b|<0$  I take $|a+b|>0$ and in this case I had two possibilites according to to right side of the inequation  $|a-b|>0 ........... a+b\le a-b ......b\le-b$  $|a-b|<0..........a+b\le -a+b .......a\le -a$  I can do the same with other possibilites, but how do I know, if my solution (or even method) is right? there are so many conditions, that I am lost in them.  Thank you for your time.

I've seen the full proof of the Triangle Inequality  \begin{equation*} |x+y|\le|x|+|y|.  \end{equation*} However, I haven't seen the proof of the reverse triangle inequality:  \begin{equation*} ||x|-|y||\le|x-y|. \end{equation*} Would you please prove this using only the Triangle Inequality above?  Thank you very much.


When ever I get attacked I always lose 20 trophies. One night I lost 50 trophies due to a bad defense. Can anyone help me with this?

Are there any pointers to think about when placing defensive structures? For example, should all defensive structures be walled off from each-other? Obviously it is ideal to have walls between every single building, but because of the limit on the amount of walls you can build this is not possible.  Right now, I'm winging it. I am using a strategy where the defensive structures and the storage are walled in, while the other buildings (barracks for example) are outside the walls to act as cannon fodder.  How can I improve this strategy?


A word for a person who if left in an impossibly perfect environment, would find a way to be upset with how perfect it was. Someone who will invent issues to be offended about. Someone who is never satisfied. I found a similar post here but it's not quite the same:  I'm not talking about someone who holds onto problems after they're fixed, but someone who must always have a problem at all times, no matter how small. Drama Queen is close, but not quite right. Entitled is very close.

I spoke to a woman who had several issues dealing with a common process we go through at work. I gave her several solutions to her issues and even explained that one of her main issues was not really even an issue, just something she wasn't understanding fully and actually had the power to manage and maintain. She fought me throughout our conversation and kept repeating that she was having these issues, even as I tried to reinforce that these were solvable and manageable problems. After it was completely clear that everything had been explained and taken care of, she was obviously hesitant to accept that things were actually okay and seemed to want to not be okay with everything, just sighing and repeating, "Well... okay. But.... okay."  It was like she just wanted to be mad, perhaps because she was just foul-tempered, but also like she did not want to let go of the problem. I talk to these people every now and then who just seem unable to let go of that pessimistic mindset and want there to be a problem. Is there a word for this kind of person or a suitable adjective? The words I've come up with that touch on what I'm thinking of are argumentative, irrational, disagreeable, and dramatic, but none of these fully encapsulate that certain quality of just seeming to NEED there to be a problem.


This happened a few years ago in a bus form Paris to Cologne. I leaned the seat backwards as far as possible and the person behind me heavily complained about not having enough space. I saw that she leaned her seat backwards too (to be fair, there were no people behind her), but I said we all don't have a lot of place and I'm trying to sleep, so I leaned the seat backwards anyway. The person in front of me did it too and I didn't complain about it, because obviously I'm going to have less space, but it's a lot easier to sleep if you lean your seat backwards.  I'm not looking for interpersonal advice. I'm more interested in knowing if there are any guidelines or rules about this. Am I allowed to lean the seat backwards or does the person behind me need to approve this?  If it matters, the bus, me and the person behind me were all from Germany. The bus company is "Mango Tours", but I'm hoping for an answer which doesn't depend on the company.  Edit   provides information about flights, so I guess it's the same in a bus. But I can't say for sure.

I can totally understand . On a short hop, I don’t have any sympathy for anyone using his “right” to recline his seat. The seat pitch on short flights these days make you an anti-social person by default if you choose to recline. I had my share of not being able to even drink a cup of coffee because somebody just wanted to “rest”.  I usually try to reposition my legs as much as possible, not only because I have to, but also to try to make the journey as unpleasant for the rester as it is for me. I’m aware that is just childish behaviour, so I am wondering whether there are more effective and more civilized countermeasures to make the flight pleasant for both of us.


My four year son just asked this. I'm at a loss to answer.  Being still partially biological. But kind of stuck in the suit.  Has this ever been covered in old or Disney EU?

I've always wondered what the deal was with Darth Vader's "crotch door". Does he use a catheter (due to all his injuries) or does he simply flip the door up and whip it out? I've never really seen the the back of his suit under his cape to see if there a corresponding "back door".   It doesn't look like he carries a catheter bag nor a colostomy bag in his suit or anything.     Is this addressed anywhere either in canon or legends sources?


Let $p$ be a prime. I want to show that $p | a^p - a$. I want to use induction.   I showed that this is true for the case $a = 1$. I'm having trouble with the bridge.

Its very easy to prove $p\mid n^p-n$ for p=3,5,7, it fails for p=9 because $$     (n+1)^9-(n+1)= n^9+9n^8+36n^7+84n^6+126n^5+126n^4+84      n^3+36n^2+8n $$ and $84= 2²\times 3\times7$. Is it true for any $p$ prime? I have checked many primes, but have no idea for the general case.


Preface: I understand generics and how they're declared at the class level (e.g. class MyClass<T>) but I've never seen it declared at the level of a static method, and without any explicit bindings (e.g. class MySubclass<String> extends MyClass).  I found this code snippet in an app I'm working on (I didn't write this part). I've never seen a method declared this way. <T> is not defined anywhere else in the class. Intent.getExtras().get() returns an Object which may actually be a String, Boolean ...etc.  private static <T> T getItemExtra(final Intent intent, final String extraName) {     T item = null;      if(intent != null && intent.getExtras() != null) {         item = (T) intent.getExtras().get(extraName);     }      return item; }   Sample usage:  String s1 = getItemExtra(someIntent, "some_string_extra"); Uri u1 = getItemExtra(someIntent, "some_uri_extra");   How does the JVM know what type to use for <T>? (Yes this method compiles and executes successfully).

I'm looking at some GXT code for GWT and I ran across this use of Generics that I can't find another example of in the Java tutorials. The class name is  if you want to look at all of the code.  Here are the important parts:  private RpcMap map;  public <X> X get(String property) {   if (allowNestedValues && NestedModelUtil.isNestedProperty(property)) {     return (X)NestedModelUtil.getNestedValue(this, property);   }   return map == null ? null : (X) map.get(property); }   X is defined nowhere else in the class or anywhere in the hierarchy, and when I hit "go to declaration" in eclipse it just goes to the <X> in the public method signature.  I've tried to call this method with the following two examples to see what happens:  public Date getExpiredate() {     return  get("expiredate"); }  public String getSubject() {     return  get("subject"); }   They compile and show no errors or warnings.  I would think at the very least I would have to do a cast to get this to work.  Does this mean that Generics allow a magic return value that can be anything and will just blow up at runtime?  This seems counter to what generics are supposed to do.  Can anyone explain this to me and possibly give me a link to some documentation that explains this a little better?  I've went through Sun's 23 page pdf on generics and every example of a return value is defined either at the class level or is in one of the parameters passed in.


how to change the boot logo(with commands) for 18.04 LTS

With regards to Plymouth --  Are there alternative boot screens available?  What's the easiest way to change the boot screen?


I want to do a fresh install (and SSD upgrade) of Mojave on a mac-mini that currently runs Mojave, but whose performance is so horrendous that it is barely usable1.  Easy .. just download Mojave and create a bootable installer and I'm off to the races.  However, the system that I want to use to create the bootable installer is not capable of running Mojave (see my  question), and when I go to download the installer from the App store, Apple stops me with a message saying:     We could not complete your purchase.      This version of macOS 10.14.3 cannot be installed on this computer.   Is there any way to get around this limitation?  I am not attempting to install Mojave, just download it to a working system.  Edit   Note that I the suggested dupe is not a dupe of my problem.  The nominal answer suggests using the direct links on the App store to download the installers.  But as I mentioned above, that is what I have already tried to do (and have failed with the above noted message).  I am also trying to do the opposite of that question.  I am trying to download a newer version of macOS onto to a older computer.     And I've gone through all the standard checks and can't see anything that would cause the situation.  But there seems to be lots of people suffering unexplainable slowdowns.  This fresh install and new SSD is meant as a hail Mary.  And at $70 for a 500GB Mushkin SSD it is a no-brainer anyway.

Sometimes it's hard to search for older versions of macOS & OS X  on the App Store.  This is an attempt to provide the canonical QA for this issue, as per the Meta QA -  I expect it to be modified over time to hopefully become a complete information resource.  How can I get any older version of a Mac OS to be able to run as a VM, or to reinstall on my Mac?


I have the following architecture:  public interface IStatus {     string StatusName {get;} } public class A: IStatus {     public string StatusName {get {return "A Status";}} }  public class B: IStatus {     public string StatusName {get {return "B Status";}} }  public class C: IStatus {     public string StatusName {get {return "C Status";}} }   I tried the following and I can see in debug all the relevant classes but I am not sure how to get the StatusName property for each one of the classes. I presume, I need to create an instance of each class somehow and ask for the StatusName property.  public class Test {     var type = typeof(IStatus);     var types = AppDomain.CurrentDomain.GetAssemblies()             .SelectMany(s => s.GetTypes())             .Where(p => type.IsAssignableFrom(p));          foreach (Type mytype in types)         {             var i = mytype.GetMember("StatusName");             if (i.Count()!=0)             {                 var n = i.GetValue(0);             }                        } }   The expected result I need is a list of string with values:     "A Status",     "B Status",     "C Status"

One may not always know the Type of an object at compile-time, but may need to create an instance of the Type.    How do you get a new object instance from a Type?


I have a new request from the user and these are the following requirements   Request to have an sftp user account and disable shell access Sftp User should only see their home directory (ie..  /home/user1) and should not able to see other home directory Sftp user should able to write directly inside the /home/user1   As I see most of the forums you can write only by adding additional folder like /home/user1/upload.  Here are my configurations below, I'm using RedHat 6.5 with openssh-server-5.3p1-112.el6_7.x86_64 version.   /home directory is currently set as root:root /home/user1 currently set as root:root  contents of /etc/passwd  $ cat /etc/passwd user1:x:806:806::/home/user1:/sbin/nologin cat /etc/group sftponly:x:2002:user1  contents of /etc/ssh/sshd_config          $ cat /etc/ssh/sshd_config Subsystem sftp internal-sftp -u 0022  Match group sftponly     ChrootDirectory %h     ForceCommand internal-sftp     X11Forwarding no     AllowTcpForwarding no  contents of /home   $ ls -la /home drwxr-xr-x 2 root root 4096 Oct 29 10:23 user1    With this permission and configuration above sftp is working fine but I could not meet the requirement of the user because he needs to upload a folder directly in his /home/user1 directory  I've also tried to set an ACL:      $ setfacl -m user:user1:rwx /home/user1     $ getfacl /home/user1      # file: user1/     # owner: root     # group: root     user::rwx     user:user1:rwx     group::r-x     mask::rwx     other::r-x      $ sudo service sshd restart   I expect that I can able to write already but it failed to connect using winscp or filezilla it saying Network error software caused connection about, Authentication failed.  When I look the sshd logs:  $ tail -f /var/log/secure fatal: bad ownership or modes for chroot directory "/home/user1"   This means setting the ACL can cause an issue.

I have a linode and I access via ssh throw terminal. I need to create an sftp user which his default directory (and the only he can access) is /var/www/xxxxxx.com/public_html/directory  Now, I did it, but when I try to connect I get broken pipe or connection rejected by peer  What I did is this:  $ adduser --home /var/www/xxxxxx.com/public_html/directory/ username $ chown username:username /var/www/xxxxxx.com/public_html/directory/ $ chmod 755 /var/www/xxxxxx.com/public_html/directory/ $ nano /etc/ssh/sshd_config   In /etc/ssh/sshd_config I added the following lines  Match User username    ChrootDirectory /var/www/xxxxxx.com/public_html/directory/    AllowTCPForwarding no    X11Forwarding no    ForceCommand internal-sftp   What am I doing wrong?  EDIT: This is the actual error    EDIT2: this is the error in filezilla    EDIT 3: auth.log   Oct 15 17:47:11 (none) sshd[361]: fatal: bad ownership or modes for chroot directory "/var/www/xxxxxxxxxxxx.com/public_html/extras_html"


I’d like to know if there is a way of obtaining a correlation/association test between two point layers in QGIS (or another open source software if not possible in QGIS)?  I have two point layers- one layer is the location of individuals (long and lat coordinates) who have contracted an infection. The second layer is the long and lat coordinates of important buildings (e.g. schools). I’d like to know if the location of infected individuals is correlated/associated with the location of important buildings.

The attached dataset shows approximately 6000 saplings in approximately 50 variable sized forest gaps.  I am interested in learning how these saplings are growing within their respective gaps (i.e. clustered, random, dispersed).  As you know, a traditional approach would be to run Global Moran's I.  However, aggregations of trees within aggregations of gaps seems to be an inappropriate use of Moran's I.  I ran some test statistics with Moran's I using a threshold distance of 50 meters, which produced nonsensical results (i.e. p-value = 0.0000000...).  The interaction among the gap aggregations are likely producing these results.  I have considered creating a script to loop through individual canopy gaps and determine the clustering within each gap, although displaying these results to the public would be problematic.    What is the best approach to quantify clustering within clusters?


I was trying to install Teamviewer, but I was getting a dependency error. I tried to install the required packages, but with no luck.  I'm getting this error:  Unpacking teamviewer (from teamviewer_linux_x64.deb) ... dpkg: dependency problems prevent configuration of teamviewer:  teamviewer depends on lib32asound2; however:   Package lib32asound2 is not installed.  teamviewer depends on lib32z1; however:   Package lib32z1 is not installed.  teamviewer depends on ia32-libs; however:   Package ia32-libs is not installed.  dpkg: error processing teamviewer (--install):  dependency problems - leaving unconfigured Errors were encountered while processing:  teamviewer   I tried   sudo apt-get -f install   Getting   Package ia32-libs is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source However the following packages replace it:   lib32z1 lib32ncurses5 lib32bz2-1.0  Package lib32asound2 is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'lib32asound2' has no installation candidate E: Package 'ia32-libs' has no installation candidate   I can't even get to the   sudo dpkg -i teamviewer_linux_x64.deb   If I force installation  sudo dpkg --force-depends -i teamviewer_linux_x64.deb   Although it's "Setting up Temviewer" it gives me this:    How can I fix this problem?


MS announce free upgrade from Windows 7/8 to Windows 10 for non-corporate licences, from :  Get a free upgrade to Windows 10 starting July 29, 2015.   Is it safe to take this offer so any installed software and drivers would still work?  Is it possible to install and run without issues software that built for Windows XP/7/8 on Windows 10?  Is Windows 7 drivers compatible with Windows 10? I have out of life support hardware with drivers built for Windows 7...

I have a Windows Vista computer.  How can I check if all my hardware is supported by Windows 10?  I don't want to purchase it and then find out there are no drivers for the chipset or whatever.


Create new database with CHARSET=utf8 and in that i insert currency symbols. When i try to fetch data with symbol using mysql_fetch_object but it can't display properly. I already add utf8 charset at header as below.   &ltmeta http-equiv="Content-Type" content="text/html; charset=utf-8">  But it's not display currency symbol.when i write that symbol on page than it's display but not from database.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I have a minilaptop which shift keys do not work. I want to remap the layout so when I press CapsLock key it behaves like shift. I have seen many turials on this matter but most of them are either too broad or too specific, and I have not been able to solve this problem.  My minilaptop runs Ubuntu 18.04 with the LXDE desktop.  Edit: issue solved!  Answer below.

I'd like to switch my Ctrl and Alt keys under Linux (to make it more Mac-like).  How do I do this?  If it helps, I'm running Ubuntu 9.04.


So, I am at the end of the last book      Rand is fighting Moridin. Moridin grabs the true power in Shayol Gol. Rand warns him this could burn him from the pattern. Moridin responds that at least it would be an end.    So, why doesn't he just use balefire on himself? Wouldn't this have the same end result? Is it possible?

In the Wheel of Time series, is it possible to commit suicide by balefire, or would the time-erasing properties of balefire undo your suicide, leaving you alive?


According to () Time Entanglement is different than regular entanglement (spacial) we have. Would you please explain what time entanglement is and how does it work?

Quantum entanglement links particles through time, according to this study that received some publicity last year:    at   S.J. Olson, T.C. Ralph, Extraction of timelike entanglement from the quantum vacuum,  S.J. Olson, T.C. Ralph, , Phys. Rev. Lett. 106, 110404 (2011)     Timelike entanglement may be regarded as a non-classical resource in a manner analogous to the spacelike entanglement that is often studied in the Minkowski vacuum, since any quantum information theoretic protocol may utilize conversion of timelike entanglement to spacelike entanglement as a step in the protocol.      I have read all the reviews in the popular press, most of the "time-travel-discovered" type, but I am looking for more sober comments, i.e. material written by physicists who have studied the paper. What does this result really mean? I would appreciate pointers to reviews, comments etc.


This is probably a bit of a silly question, but I would rather ask now before investing hundreds in a new DSLR camera so that I don't regret it later.  In short, I currently have a Pixel XL which I use for all of my photography (as a hobby). The Pixel XL is probably by far the best phone camera I have used, but it is only a phone camera.  Still, phone camera or not, the phone itself is a $900 piece of equipment, and it makes me wonder if investing in a ~$380 DSLR is still going to be a major "step up" for my first true DSLR camera.  So is this still a good choice, or should I save up and invest in something a bit better? If the latter, any recommendations (again, for someone who has never used a true DSLR camera before)?

I am thinking of buying a camera to learn photography. Most of the time I'll be shooting portraits and landscapes. But I am not sure where I should start. Most of my friends tell me that I should get an entry level DSLR, but I am not sure if I have the persistence and enthusiasm to carry it all day in a backpack. But the camera on my cellphone doesn't seem to be enough to begin with.  So what I want is some expert advice (preferably with professional experience). Can most compact fixed-lens or mirrorless cameras fit the situations I mentioned? Or do I really need to go to a DSLR to get a tool to learn photography?


$\lim_{x\to 0+}=(1/x)^{\sin x}$  I think I should rewrite it into a from $e^{\ln}$ , but I can't continue the calculation after this step.

Calculate $$\lim_{x\to 0}\dfrac{1}{x^{\sin(x)}}$$  I'm pretty much clueless here, only that there is L'hospital obviously here.   Would appreciate any help.


My South African passport expires next year, but my USA visa is still valid for 8 years. Will the USA visa be carried over to my new passport?

My old passport is in my maiden name and has already expired. My B1/B2 visa to travel to United States is still valid but is stamped in my old passport with my maiden name.   My new passport has my new name (old name got changed after marriage) but has details (like old passport number, father and mother's name) related to my old passport.    Will I be allowed to travel to US as long as I carry the my old as well as new passport?  Or Do I need to again get the visa stamped on my new passport?


I encountered this problem while visiting Engineering, which has MathJax enabled.  Questions in the hot network questions that have dollar signs in them get rendered as if it was a MathJax encoding.  The actual question title was "Getting \$10,000, have \$16,000 balance on two credit cards - How to allocate payments?"  but it gets rendered as:

Recently, the TeX.SE question  got onto the Hot Network Questions list.  Like many questions on TeX.SE, it contains some TeX markup in its title.  Unfortunately, on , this markup gets parsed and rendered as math:    I propose that either:   the entire Hot Network Questions sidebar should be excluded from MathJax parsing by styling it with the tex2jax_ignore class, or at least, any hot questions from TeX.SE should be so excluded from MathJax parsing.   Or I suppose we could always implement , which asks for all questions with TeX in the title to be excluded from Hot Network Questions entirely.  That might be throwing out the baby with the bathwater, though.    Ps. This issue is partially masked by , which causes MathJax not to be rendered in many elements that are hidden by default and revealed using jQuery .show(), such as all but the first five questions in the Hot Network Questions sidebar.  The  user script contains a generic fix for that bug, so users who have it installed will see this issue more frequently, but it occurs even without SOUP whenever a question with TeX markup in the title happens to show up among the top five hot questions that are always visible by default.


I'm trying to remember a single-word that I Google'd yesterday (because I didn't know what it meant) which is a word for "Talking about a subject at great lengths", that's almost the exact definition that I still remember, but I can't find the word anymore. I remember that it may be used academically as well because there were some tutorials that I saw about "How to X" (X being the word).

There's a word I thought I knew at some point, but can no longer remember what it was.  I tried looking up various thesaurus websites to no avail.  Similar words to what I'm looking for, but not quite:   Elaborate: too neutral -- I'm looking for a more negative connotation. Elucidate: too positive a connotation. Ruminate: The direction is correct, but it is about "thinking about something in too much detail" vs actually describing it so. Describe ad nauseum: 3 words, and awkward sounding.   Example sentence: "He began to __ the topic"  To clarify, I'm looking for a verb.