I'm styling my Terminal and what I need is to change the color of the path, if you still don't understand what I mean, here's a pic:    There you can see the shaded area (Jonathans-MacBook-Pro:~ feniixx$), That is what I want of other color than dark yellow, is it possible?

I would like the CasebashMac:bfgenv chris$ part of the following line to appear in a different color in my terminal.  CasebashMac:bfgenv chris$ python


In bash, whenever I try to run a command which is not installed, I get a message which tells that the package is not installed and how to install it. This functionality is provided by installing the Debian/Ubuntu package command-not-found. But in zsh, it only gives the message command not found. So how do I install this feature in zsh?

In the default configuration of bash in ubuntu, when you type the name of a software which is not installed, bash explains how to install it if  the executable if it exists, or how to install an executable with a really close name if it does not exist. For example with emacs (which is not installed on my machine):  $ emacx No command 'emacx' found, did you mean:  Command 'emacs' from package 'emacs23-lucid' (universe)  Command 'emacs' from package 'e3' (universe)  Command 'emacs' from package 'emacs23-nox' (main)  Command 'emacs' from package 'emacs24' (main)  Command 'emacs' from package 'emacs24-nox' (main)  Command 'emacs' from package 'emacs23' (main)  Command 'emacs' from package 'jove' (universe)  Command 'emacs' from package 'emacs24-lucid' (universe) emacx: command not found $ emacs The program 'emacs' can be found in the following packages:  * emacs23  * emacs23-nox  * emacs24  * emacs24-nox  * e3  * emacs23-lucid  * emacs24-lucid  * jove Try: sudo apt-get install <selected package>   With my current configuration of zsh I obtain:  $ emacx zsh: command not found: emacx $ emacs zsh: command not found: emacs   There is also a difference of behavior when making a mistake in the name of an installed software. Say I want to launch gedit instead of kedit. With bash, I obtain:  $ kedit No command 'kedit' found, did you mean:  Command 'xedit' from package 'x11-apps' (main)  Command 'edit' from package 'mime-support' (main)  Command 'nedit' from package 'nedit' (universe)  Command 'gedit' from package 'gedit' (main)  Command 'jedit' from package 'jedit' (universe)  Command 'medit' from package 'medit' (universe)  Command 'ledit' from package 'ledit' (main) kedit: command not found   While with zsh I obtain:  $ kedit zsh: correct 'kedit' to 'edit' [nyae]?   So, my questions are:   Is it possible to have a similar behavior in zsh as with bash when trying to launch an executable not yet installed? If yes, how? Is it possible to display all the possibilities when there is a typing mistake, instead of giving  one correction which can be wrong?


I've a problem : I would like to be able to delete lines beetwen two pattern in a file.   For example be able to delete the line equals to "line 1" beetwin "blablabla++" and "blablabla--"  line1 blablabla++ line1 line2 line3 blablabla-- line1   I've found a way to do it with sed :   sed '/blablabla++/,/blablabla--/{/line1/d}' ./file   It is working great. But the thing is that in my real file is more like :  line1/script blablabla++ line1/script line2/script line3/script blablabla-- line1/script   How could i do that ?   EDIT  I've choosen a bad example.  The thing is that i don't know what the line that i need to delete will be (the line will be sent as parameter). But i know one thing for sure is that they will contain "/" characters.  The thing is that when i do this :   sed '/blablabla++/,/blablabla--/{/$1/d}' ./file   The "/" that $1 contain will mess up with my sed.

In my bash script I have an external (received from user) string, which I should use in sed pattern.  REPLACE="<funny characters here>" sed "s/KEYWORD/$REPLACE/g"   How can I escape the $REPLACE string so it would be safely accepted by sed as a literal replacement?  NOTE: The KEYWORD is a dumb substring with no matches etc. It is not supplied by user.


I want to add time delay in my batch file. The batch file will be running silently at backgorund. Please help me.

When writing a batch file to automate something on a Windows box, I've needed to pause its execution for several seconds (usually in a test/wait loop, waiting for a process to start). At the time, the best solution I could find uses ping (I kid you not) to achieve the desired effect. I've found a better write-up of it , which describes a callable "wait.bat", implemented as follows:  @ping 127.0.0.1 -n 2 -w 1000 > nul @ping 127.0.0.1 -n %1% -w 1000> nul   You can then include calls to wait.bat in your own batch file, passing in the number of seconds to sleep.   (at last!). In the meantime, for those of us still using Windows XP, Windows 2000 or (sadly) , is there a better way?  I modified the sleep.py script in the , so that it defaults to one second if no arguments are passed on the command line:  import time, sys  time.sleep(float(sys.argv[1]) if len(sys.argv) > 1 else 1)


I currently have sort buttons for each column of a table in my application, and when I click on one of the sort buttons I want the ID of that button to be passed into the function so that the correct column is sorted. In my HTML I simply have a table as such...

  I then have a few functions that populate the table with all needed rows from the database. For the function that creates the heading row, it will also append a sort button to the end of each cell in that row. I create the sort button through this following method... const createSortBtn = item => {     let btn = document.createElement("button");     btn.innerHTML = '&#9660;';     btn.id = item;     btn.addEventListener("click", sortTable);     return btn; }  The variable item is the ID I wish to give the button that is being created, the innerHTML is just a down triangle, and then I also add the onclick function. This onclick function goes as so... const sortTable = () => {     let order, index = this.id;     if (document.getElementById(index).innerHTML === '&#9660;') order = "ASC";     else order = "DESC";     window.sessionStorage.setItem("order", order);     window.sessionStorage.setItem("index", index);     makeSearch(); }  Most of the function is not too relevant to my question except for the this.id part. From what I have been able to find so far this seems to be the primary method of acquiring the ID of an onclick button (even in strict mode if what I believe is true). However when it is called in the function it is undefined. I had been thinking that perhaps I could change the code that when I add the onclick function to the sort button it would go like so... const createSortBtn = item => {     let btn = document.createElement("button");     btn.innerHTML = '&#9660;';     btn.id = item;     btn.addEventListener("click", sortTable(item));     return btn; }  ...but that seems to call the function immediately which is not the behaviour I wish for. I have seen that jQuery seems to have quite a few methods of doing this but I am hoping to stick to native JavaScript if possible. Thanks for all help.

The situation is somewhat like-  var someVar = some_other_function(); someObj.addEventListener("click", function(){     some_function(someVar); }, false);   The problem is that the value of someVar is not visible inside the listener function of the addEventListener, where it is probably being treated as a new variable.


I need to print numbers from 1 to 50 in random order without repeating  it .  static void Main(string[] args) {      ArrayList r = new ArrayList();       Random ran = new Random();            for (int i = 0; i < 50; i++)      {         r.Add(ran.Next(1,51));       }       for (int i = 0; i < 50; i++)         Console.WriteLine(r[i]);      Console.ReadKey(); }

What is the best way to randomize the order of a generic list in C#? I've got a finite set of 75 numbers in a list I would like to assign a random order to, in order to draw them for a lottery type application.


I'm trying to update Ubuntu 12.04 to 12.10 so I could update to most current Ubuntu. when I used the "update manager" it doesn't work.  I read that it could be corrupted and to try the code:   sudo apt-get update && sudo apt-get upgrade   then I get a screen that shows: configuring ttf-mscorefonts-installer with a box that has the EULA agreement in it.  Nothing else is showing and nothing is happening. When I click on the red X, I get a message that says a process is going on, but I don't see anything going on.  So how can I get the manager updater to work so I can update to the latest Ubuntu. I have a windows XP laptop 32 bit and I have Ubuntu as a dual boot.

After a recent update, ttf-mscorefonts-installer prompted me to accept its license agreement.     ┌─────────────────┤ Configuring ttf-mscorefonts-installer ├─────────────────┐  │                                                                           │   │ TrueType core fonts for the Web EULA                                          │                                                                               │ END-USER LICENSE AGREEMENT FOR MICROSOFT SOFTWARE                             │                                                                               │ IMPORTANT-READ CAREFULLY: This Microsoft End-User License Agreement           │ ("EULA") is a legal agreement between you (either an individual or a          │ single entity) and Microsoft Corporation for the Microsoft software           │ accompanying this EULA, which includes computer software and may include      │ associated media, printed materials, and "on-line" or electronic              │ documentation ("SOFTWARE PRODUCT" or "SOFTWARE"). By exercising your          │ rights to make and use copies of the SOFTWARE PRODUCT, you agree to be        │ bound by the terms of this EULA. If you do not agree to the terms of          │ this EULA, you may not use the SOFTWARE PRODUCT.                              │                                                                               │                                  <Ok>                                         │                                                                           │   └───────────────────────────────────────────────────────────────────────────┘    Screenshot:   For some reason my terminal will not allow me to accept, or for some reason I am pressing the wrong hotkey...  I've tried every letter on the keyboard and Enter among others...  I'm sure there is a very simple and obvious solution to this.  I've also just tried to remove the package completely however the terminal states that due to the package not being correctly installed, I should reinstall the package before removing it.  Very frustrating!  Essentially, because I cannot successfully install this package, I can't really ever upgrade my system because I always have to end up terminating the terminal with the license agreement (thus the upgrade fails).


If I want to compare the goodness-of-fit of two regression models, with and without intercept, is it valid to compare the squared correlation coefficient between the fitted values and the data? Since the squared correlation would get back the $R^2$ for the model with intercept, it seems to make sense to compute the squared correlation for the model without intercept and use that to make comparison. I am not entirely sure whether this is legitimate. Am I missing anything? If this approach is not valid, what methods can I use to make such comparisons?

In a simple linear model with a single explanatory variable,  $\alpha_i = \beta_0 + \beta_1 \delta_i + \epsilon_i$  I find that removing the intercept term improves the fit greatly (value of $R^2$ goes from 0.3 to 0.9). However, the intercept term appears to be statistically significant.  With intercept:   Call: lm(formula = alpha ~ delta, data = cf)  Residuals:      Min       1Q   Median       3Q      Max  -0.72138 -0.15619 -0.03744  0.14189  0.70305   Coefficients:             Estimate Std. Error t value Pr(>|t|)     (Intercept)  0.48408    0.05397    8.97   <2e-16 *** delta        0.46112    0.04595   10.04   <2e-16 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1   Residual standard error: 0.2435 on 218 degrees of freedom Multiple R-squared: 0.316,    Adjusted R-squared: 0.3129  F-statistic: 100.7 on 1 and 218 DF,  p-value: < 2.2e-16    Without intercept:   Call: lm(formula = alpha ~ 0 + delta, data = cf)  Residuals:      Min       1Q   Median       3Q      Max  -0.92474 -0.15021  0.05114  0.21078  0.85480   Coefficients:       Estimate Std. Error t value Pr(>|t|)     delta  0.85374    0.01632   52.33   <2e-16 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1   Residual standard error: 0.2842 on 219 degrees of freedom Multiple R-squared: 0.9259,   Adjusted R-squared: 0.9256  F-statistic:  2738 on 1 and 219 DF,  p-value: < 2.2e-16    How would you interpret these results? Should an intercept term be included in the model or not?  Edit  Here's the residual sums of squares:  RSS(with intercept) = 12.92305 RSS(without intercept) = 17.69277


My wife and I are flying back from Jamaica to Dallas through Charlotte with a 1-hour-14-minute connection. Do we have time to make our connection? We've never been to Charlotte.

Is 1h25' enough time to go through customs and immigration in CLT (coming from Rome Fiumicino) before a connecting domestic flight? I have an Italian passport and I am not an US citizen or resident.  If the answer is "probably no", I assume it will be the airline's responsibility to reschedule me on a later flight, if both my flights are operated by the same company and sold on the same e-ticket --- am I correct?


I would like to analyze my PC usage and therefore have a list of when I shut down my laptop or alternatively when I logged out from my account in the last month. Is there any logfile containing this information and if yes, where can I find it?  Using Ubuntu 13.10.

I'm a Rails developer working on a web application on Ubuntu Server 10.04. Due to internal requirements, I was asked to find the last 10 system boot and shutdown times... I have no clue where to find these details. Could someone help me out?


I have a webserver which has 5k requests per second this overloads my server with the cpu usage  host has 12 CPU and 8GB ram [ almost not in use ]  my httpd-mpm configuration is below :   <IfModule mpm_prefork_module>     StartServers          5     MinSpareServers       5     MaxSpareServers      10     ServerLimit         1000     MaxRequestWorkers   8000     MaxConnectionsPerChild   10000 </IfModule>  # worker MPM # StartServers: initial number of server processes to start # MinSpareThreads: minimum number of worker threads which are kept spare # MaxSpareThreads: maximum number of worker threads which are kept spare # ThreadsPerChild: constant number of worker threads in each server process # MaxRequestWorkers: maximum number of worker threads # MaxConnectionsPerChild: maximum number of connections a server process serves #                         before terminating <IfModule mpm_worker_module>     StartServers             10     MinSpareThreads         75     MaxSpareThreads        250     ThreadsPerChild         32     MaxRequestWorkers      8000     MaxConnectionsPerChild   10000 </IfModule>  # event MPM # StartServers: initial number of server processes to start # MinSpareThreads: minimum number of worker threads which are kept spare # MaxSpareThreads: maximum number of worker threads which are kept spare # ThreadsPerChild: constant number of worker threads in each server process # MaxRequestWorkers: maximum number of worker threads # MaxConnectionsPerChild: maximum number of connections a server process serves #                         before terminating <IfModule mpm_event_module>     StartServers             6     MinSpareThreads         32     MaxSpareThreads        128     ThreadsPerChild         64     ServerLimit             32     MaxRequestWorkers     2048     MaxConnectionsPerChild   10000 </IfModule>  # NetWare MPM # ThreadStackSize: Stack size allocated for each worker thread # StartThreads: Number of worker threads launched at server startup # MinSpareThreads: Minimum number of idle threads, to handle request spikes # MaxSpareThreads: Maximum number of idle threads # MaxThreads: Maximum number of worker threads alive at the same time # MaxConnectionsPerChild: Maximum  number of connections a thread serves. It #                         is recommended that the default value of 0 be set #                         for this directive on NetWare.  This will allow the #                         thread to continue to service requests indefinitely. <IfModule mpm_netware_module>     ThreadStackSize      65536     StartThreads           250     MinSpareThreads         25     MaxSpareThreads        250     MaxThreads            1000     MaxConnectionsPerChild   0 </IfModule>  # OS/2 MPM # StartServers: Number of server processes to maintain # MinSpareThreads: Minimum number of idle threads per process,  #                  to handle request spikes # MaxSpareThreads: Maximum number of idle threads per process # MaxConnectionsPerChild: Maximum number of connections per server process <IfModule mpm_mpmt_os2_module>     StartServers             2     MinSpareThreads          5     MaxSpareThreads         10     MaxConnectionsPerChild   0 </IfModule>  # WinNT MPM # ThreadsPerChild: constant number of worker threads in the server process # MaxConnectionsPerChild: maximum number of connections a server process serves <IfModule mpm_winnt_module>     ThreadsPerChild        150     MaxConnectionsPerChild   0 </IfModule>  # The maximum number of free Kbytes that every allocator is allowed # to hold without calling free(). In threaded MPMs, every thread has its own # allocator. When not set, or when set to zero, the threshold will be set to # unlimited. <IfModule !mpm_netware_module>     MaxMemFree            2048 </IfModule> <IfModule mpm_netware_module>     MaxMemFree             100 </IfModule>   and the server is still overloaded   do you have any suggetions? what to check? maybe change any configuration?  thank you!

This is a  about capacity planning for web sites. Related:      What are some recommended tools and methods of capacity planning for web sites and web-applications? Please feel free to describe different tools and techniques for different web-servers, frameworks, etc., as well as best-practices that apply to web servers in general.


I recently came across  and found that the user has been deleted:    Generally, the deleted users will be displayed like this:    Why does that alone has a different view? A deleted user without a user id / name?

It shows no question owner, not even a simple name (without link).   What happened?


I am making a Roblox graphic and whenever I open blender and delete the cube and then I tried to import my OBJ of the Roblox character, but it didn't show up.   I've been dealing with this issue for about 1-2 months now.

I try to import .obj files from this project:  - the files contain Polygon Mesh Data.  When I import the obj file into blender, the outliner shows a new mesh added, but nothing is visible in the 3D viewport:      Any help will be appreciated.


I am working on how to get #pg value from URL using JavaScript, I tried    var url_string = "http://example.com/aus/#pg=0"; //window.location.href var url = new URL(url_string); var pg = url.searchParams.get("pg"); console.log(pg);     But not getting any result, Please help

I have some jQuery/JavaScript code that I want to run only when there is a hash (#) anchor link in a URL. How can you check for this character using JavaScript? I need a simple catch-all test that would detect URLs like these:   example.com/page.html#anchor example.com/page.html#anotheranchor   Basically something along the lines of:  if (thereIsAHashInTheUrl) {             do this; } else {     do this; }   If anyone could point me in the right direction, that would be much appreciated.


I have a 2012 Macbook Pro and a Dell U2417H monitor.  Using the software that came with Spyder Pro 4 the monitors ended up looking radically different in color temperature.  The Macbook Pro display was much, much cooler than the Dell.  I calibrated again, but this time using the Dispcal+Argyll tools (using the Spyder 4 input device).  The two displays are much closer, but still different (the Dell is still warmer).  Note that I'm not a color profile pro. I just accepted the defaults when using both toolsets.  Am I expecting too much?  Should I expect them to look the same?

I have a pair of pretty nice monitors (HP ZR30w) which I calibrated with a pretty good calibrator (i1-Pro) and after I calibrated both they still show colors every so slightly differently.  My left monitor has a little more magenta color to it in photos.  Is monitor calibration only ment to get things 'close'?  Other people in the office have experienced similar issues with their pairs of monitors, both HP ZR30w and Dell 3007WFP-HC monitors.  If I can't even get colors to match between my two exact same monitors connected to the same computer I have little confidence that colors on my monitors will look the same on somebody else's calibrated monitor :p


This problem is pretty simple. I am trying to make a perfectly round tube like a pipe. I made a bezier circle and increased the depth to make it thicker but now it looks like a flattened oval. How do I make this tube perfectly circular? Here is what it looks like.   Also here is a link to the file.

I have a series of objects that I have procedurally generated use Bezier or Nurbs curves for which I then attached a Bevel and Taper object.  When I use a Bezier curve the objects come out correctly. See below (ignore the color)   However, when I use a Nurbs curve, with the same exact Bevel and Taper object, they come out very distorted. See below:   Even when I reduce the size of the bevel object the mesh is still very inconsistent. However, ideally, I shouldn't need to adjust the size at all.  One other point that may be important. When I generated the objects using Bezier curves I would insert a curve and then randomize things like curvature and size to get the final object. Then I would apply the bevel and tapers. However, I created the nurbs curves from a list of 3D coordinates (5994 points) loaded from a CSV(doing something similar to this thread: ).  Does anyone know what the cause of the distortion is? Ideally, the objects created from the nurbs curves would look exactly the same as the bezier curve.  Here I've uploaded the files with the Nurbs curves that I'm having trouble with:   And this is the file with Bezier curves that works as it should.    These files are exactly the same except one uses a Nurbs curve and the other uses the Bezier curve.


I am curious to know how stackoverflow or any stackexchange site loads content dynamically.  For example, When you are on a specific tag's page the questions keep on loading as they get asked. I can see there is no ajax call taking place in the network section of my browser.  I am curious to know which technology is being use in SO for loading this content dynamically.  Many thanks for those who give their time answering this question.

We have deployed a new feature that hopefully help with keeping you instantly updated as new questions and answers are posted.  All sites except for Stack Overflow have a new activity indicator on the homepage which will show when new posts are asked or answered.    We have also enabled updates on the questions page for the newest and active tabs for all sites except Stack Overflow.  If you open a browser to these tabs you will receive instant notifications when new questions are asked or answered.    Stack Overflow has a massive amount of activity so we have decided to limit this feature to tags only.  Both the "newest" and "active" tab will have updates after first selecting a tag or tag combination.    We recently added support for new answers and comments:        Now for the gotchas - in order to use this feature you must have a browser that supports web sockets.  See:   for a list of browsers that currently support web sockets.  UPDATE  As a few have mentioned below we are now experimenting with updating comment counts, votes on a post, and your reputation score.


I've recently learned that many d20 games have their rules accessible for free under OGL in form of a System Reference Document. I'd been quite reluctant to d20, but since it's free, I've thought of giving it a try.  My question is: what do official books add compared to the free SRD, apart from nice illustrations? I mean, settings, hooks? Extra rules?

Does the  core rulebook contain any information that is not included already on  that would make it worth it to buy the PDF version of the manual? Or does it only have extra descriptive text?


My kids are dual Danish and US citizens. My husband and I are permanent US residents, our kids  being born here.   When we travel back and forth between Denmark and the US, we have been solely using the kids US passports.   Obviously, for entry into the US (and check in at the airport) they need to use their US passport, as they have no visa.   On arriving in Denmark, they have a automatic 90 day travel visa, so just showing the US passport have been enough.   There are a couple of other questions around this I explored on the site: ,  and more, and all of them state that you have to use the passport of the country you enter if you hold that passport, and that in some cases you are required to.   However, we have not been doing this for kids, as I heard anecdotally that it can cause trouble when entering the US. A friend of mine with dual US/other citizen ship used his other passport when entering that country, and at some point he was asked on US re-entry where he had been, and why he had no stamps in his passport. He was told by the US immigration officer that you have to use the same passport for your entire travel.   Is this correct? Or should I use my kids Danish passports for entering Denmark?

I am a citizen of two different countries, and have two passports.  How should I use my passports when traveling?


When I run sudo apt-get update in the terminal, I got this and I don't know what the problem is:  W: Unknown Multi-Arch type 'no' for package 'compiz-core' W: Unknown Multi-Arch type 'no' for package 'compiz-gnome' W: Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-max W: Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-min W: Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-max W: Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-min W: Unknown Multi-Arch type 'no' for package 'libkf5akonadisearch-bin' W: Ignoring Provides line with DepCompareOp for package php-psr-http-message-implementation W: Ignoring Provides line with DepCompareOp for package php-psr-log-implementation W: Ignoring Provides line with DepCompareOp for package php-math-biginteger W: Unknown Multi-Arch type 'no' for package 'compiz-core' W: Unknown Multi-Arch type 'no' for package 'compiz-gnome' W: Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-max W: Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-min W: Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-max W: Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-min W: Unknown Multi-Arch type 'no' for package 'libkf5akonadisearch-bin' W: Unknown Multi-Arch type 'no' for package 'compiz-core' W: Unknown Multi-Arch type 'no' for package 'compiz-gnome' W: Unknown Multi-Arch type 'no' for package 'compiz-core' W: Unknown Multi-Arch type 'no' for package 'compiz-gnome' W: You may want to run apt-get update to correct these problems   Can anyone help?

I'm trying to upgrade my 14.04 machine to 16.04 using do-release-upgrade. After downloading the package lists for wily, I see the following errors:  Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-min Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-min Unknown Multi-Arch type 'no' for package 'libkf5akonadisearch-bin' Ignoring Provides line with DepCompareOp for package php-psr-http-message-implementation Ignoring Provides line with DepCompareOp for package php-psr-log-implementation Ignoring Provides line with DepCompareOp for package php-math-biginteger Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-min Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-min Unknown Multi-Arch type 'no' for package 'libkf5akonadisearch-bin' Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' You may want to run apt-get update to correct these problems   It then proceeds to abort the installation. The suggested run of apt-get update doesn't seem to do anything. Googling for the above error messages yielded others having similar problems when upgrading to other, previous releases, although I've not come across any apparent fixes. It's suggested that an apt upgrade could fix the problem, but I don't see a way to easily do that (it's up to date with the latest trusty package).  What should I do in order to upgrade directly to 16.04?


In C4D I can control which objects to affect with a light, in the image below only the main object is affected by the light source, the background and other objects are not affected. But I haven't found a way to do this in blender!  Is it possible to specify which objects to affect with a light source?

I want to create an effect on a character where their skin and clothing are effected by two different light sources. The clothing should only reflect a bright bounce light, but have the skin should not be affected by this light source.    In the example image I have two objects a cube, a sphere and three emission  lights . I want the two white lights to hit both objects, and I need the purple light to hit and reflect off of the sphere, but ignore the cube entirely (no reflections).  Someone suggested to composite the layers together, it works... but this is very impractical and cumbersome because it forces the background to be transparent and it will be a pain to try and layer together a more complex scene, especially if its animated which is what I want this effect for.  I know you can have objects ignore shadows and all kinds of other things so im hoping someone knows how to get an object to ignore light with a few settings.


I have only one very simple shell script in /etc/hourly.cron. It just controls a Twitter bot- it runs a short python script that posts to Twitter using tweepy. It does not involve email or any sendmail commands.   I had this set up for nearly a year with no problems, but now it is failing with odd errors related to sendmail.  First, in /var/log/syslog, I was getting this:  Dec 30 10:17:01 sarah-ThinkPad-X220 CRON[29527]: (root) CMD (   cd / && run-parts --report /etc/cron.hourly) Dec 30 10:17:02 sarah-ThinkPad-X220 cron[865]: Please install an MTA on this system if you want to use sendmail! Dec 30 10:17:02 sarah-ThinkPad-X220 CRON[29526]: (root) MAIL (mailed 2136 bytes of output but got status 0x00ff from MTA#012)   I then installed postfix to try to debug this and got this:  Dec 30 15:17:01 sarah-ThinkPad-X220 CRON[4542]: (root) CMD (   cd / && run-parts --report /etc/cron.hourly) Dec 30 15:17:03 sarah-ThinkPad-X220 cron[865]: sendmail: fatal: open /etc/postfix/main.cf: No such file or directory Dec 30 15:17:03 sarah-ThinkPad-X220 postfix/sendmail[4546]: fatal: open /etc/postfix/main.cf: No such file or directory Dec 30 15:17:03 sarah-ThinkPad-X220 CRON[4541]: (root) MAIL (mailed 250 bytes of output but got status 0x004b from MTA#012)   I am a cron novice and have no idea why an MTA would be needed at all. Any help would be appreciated.

I have a fresh install of Ubuntu 12.04.1 LTS an a number of servers.  I have not added any cron jobs or edited my crontab on those servers, however, at around the same time for each machine, I get a 75% CPU spike and the following info in my syslog at the time of the spike:  CRON[8380]: (CRON) info (No MTA installed, discarding output)   I have mono-complete installed and am running a service stack webserver.  What is the best way for me to stop this from happening?  I would like to be able to remove the CPU spike.


I'm looking to lock down our Solaris 10, RHEL 5, and SLES 11.2 servers. It has come to my attention that some of the users have no passphrase for their SSH keys. Is there a way I can check for this with a script?  Update  Below I have posted the script I wrote from the answer @tylerl gave me. I'm posting this incase someone else needs this info in the future. There is most likely better ways to do this, but this works. I still need to write additional scripts for the accounts that are not automounted. Thanks everyone for all the help  #!/bin/bash # This script is for checking for a blank passphrase. Meaning no passphrase to secure your SSH key. # Script most be run as root. # Example: sudo ./check-sshkeys  mount share:/vol/home /mnt ls /mnt >/tmp/ls for s in `cat /tmp/ls` do echo -e "\e[1m User $s \033[0m "  if ls /mnt/$s/.ssh/id_rsa 2>/dev/null         then grep ENCRYPTED /mnt/$s/.ssh/id_rsa || echo -e "No RSA passphrase"         else echo "RSA key not found" fi if ls /mnt/$s/.ssh/id_dsa 2>/dev/null         then grep ENCRYPTED /mnt/$s/.ssh/id_dsa || echo -e "No DSA passphrase"         else echo "DSA key not found" fi done rm /tmp/ls umount /mnt

Some of my Linux & FreeBSD systems have dozens of users. Staff will use these "ssh gateway" nodes to SSH into other internal servers.  We're concerned that some of these people use an unencrypted private SSH key (A key without a . , because if a cracker ever gained access to their account on this machine, they could steal the private key and now have access to any machine which uses this same key. For security reasons, we require all users to encrypt their private SSH keys with a passphrase.  How can I tell if a private key is not-encrypted (e.g. Does not contain a passphrase)? Is there a different method to do this on an ASCII-armored key vs. a non-ASCII-armored key?  Update:  To clarify, assume I have superuser access on the machine and I can read everybody's private keys.


While playing around with random variables, I noticed a following pattern: If $X \sim Bin(n, p)$, then $E[X] = np$, $\mu(X) = \lfloor np \rfloor$, $|E[X] - \mu(X)| = \{np\} \leq \sqrt{np(1-p)} = \sqrt{Var[X]}$ If $X \sim Geom(p)$, then $E[X] = \frac{1}{p}$, $\mu(X) = - \lfloor \frac{1}{\log_2(1-p)} \rfloor$, $|E[X] - \mu(X)| = |\frac{1}{p} + \lfloor \frac{1}{\log_2(1-p)} \rfloor| \leq \frac{\sqrt{(1-p)}}{p} = \sqrt{Var[X]}$ If $X \sim U[a; b]$, then $E[X] = \mu(X) = \frac{a + b}{2}$ $|E[X] - \mu(X)| = 0 \leq \frac{a-b}{2\sqrt{3}} = \sqrt{Var[X]}$ If $X \sim N(\mu, \sigma)$, then $E[X] = \mu(X) = \mu$ $|E[X] - \mu(X)| = 0 \leq \sigma = \sqrt{Var[X]}$ If $X \sim Exp(\lambda)$, then $E[X] = \frac{1}{\lambda}$, $\mu(X) = - \frac{\ln(2)}{\lambda}$, $|E[X] - \mu(X)| = \frac{\ln(2)-1}{\lambda} \leq \frac{1}{\lambda} = \sqrt{Var[X]}$ If $X \sim Pareto(x, \alpha)$, then $E[X] = \frac{\alpha x}{\alpha - 1}$, $\mu(X) = \alpha 2^{\frac{1}{\alpha}}$, $|E[X] - \mu(X)| = |\frac{\alpha x}{\alpha - 1} - \alpha 2^{\frac{1}{\alpha}}| \leq \frac{x}{\alpha - 1} \sqrt{\frac{\alpha}{\alpha - 2}} = \sqrt{Var[X]}$ It left me wondering, whether it is a part of some general pattern or just a coincidence. My question is:  Is it true for any random variable $X$ with finite second moment, that $|E[X] - \mu(X)| \leq \sqrt{Var(X)}$?  I tried applying Markov and Chebyshev inequalities to prove this inequality in general, but without success (no idea how to apply them to median).

I want to solve the following problem in T.Tao's random matrix theory book. Let $X$ be a random variable with finite second momment. A median $M(X)$ of $X$ saisfies $\mathbb{P}(X>M(X)),\mathbb{P}(X<M(X))\leq 1/2$. Now I wan to prove that for any median: $$M(X)=\mathbb{E}(X)+O((\mathbb{Var}(X))^{1/2})$$  I think we have to use Chebyshev's inequality for this, which I have done to obtain: $$\mathbb{P}(X>\lambda \sigma)\leq \mathbb{P}(|X|>\lambda \sigma)\leq \frac{1}{\lambda ^2}$$ where $\sigma=(\mathbb{Var}(X))^{1/2}$. But I fail to interprete this...


I develop an application with Laravel 5 and use sqlite during development. I want to switch to something faster later on. I'd like to have a string as unique identifier for the users-table. Is this a problem in any way? For example with foreign keys? Or is there no difference to auto-increment integers?

I am not very familiar with databases and the theories behind how they work.  Is it any slower from a performance standpoint (inserting/updating/querying) to use Strings for Primary Keys than integers?


I would like to install gcc compiler by this command apt install build-essential  and after pressing Yes, it asks me to insert some media.  Media change: please insert the disc labeled  'Ubuntu 18.04.4 LTS _Bionic Beaver_ - Release amd64 (20200203.1)' in the drive '/media/cdrom/' and press [Enter]  and this prompt repeats again and again  What's wrong?

I can't update 12.04 LTS. The Update Manager shows this:  CD/DVD 'Ubuntu 12.04 LTS _Precise Pangolin_ - Release i386 (20120423)' is required Please insert the above CD/DVD into the drive '/media/cdrom/' to install software packages from it.   The image I downloaded and burned to CD is from  the PC (Intel x86) desktop CD version. I burned many CDs but the result is the same.


What does the rounded star icon do exactly on ? I cant find anything in the FAQ or on meta about it.  Thanks.

What does bookmarking a question mean? How do you bookmark a question? Do users get updates on their bookmarked questions? Are my bookmarks publicly visible? How do you see your own bookmarks? How do you see other users' bookmarks? How do you see which users have bookmarked a particular question? What impact does the bookmark system have on the voting system? Can I "un-bookmark" a question? Can I search within my bookmarks?


This is my first grammar-related post in this forum. It's my honour to be associated with professional native English teachers.  My question is based on the nuanced difference between Simple Present Tense vs Future Simple Tense. Look at the sentence below. To me, the word "will" is required here unless the writer replace "anymore" with "again" here. What do you think?   I never go anywhere with Eric again.   Thank you,  English lover

Why can we use the following statement when we mean future events?     What time do you get there?   Or should we rather say:     What time will you get there?   Is there a difference?


Let f be a non-negative Lebesgue measurable function with $\int_\mu\ f \,d\lambda< \infty$. Show that for each $\epsilon>0$, there exists a $\delta>0$ such that $\lambda(E)<\delta$ implies $\int_E\ f \,d\lambda< \epsilon$.  --I think I need to use the simple function $\phi=f\chi_E$ such that $\phi<f$ but I do not see how to tie that into the standard epsilon-delta proof with a finite l Lebesgue integral.  --I also know that $\lambda(A_c)\leqslant(1/c)\int_E\ f \,d\lambda$ from the previous problem so I am assuming I will need to use that.

Suppose $f$ is in $L^1$ space of $\mu$, where $\mu$ is the Lebesgue measure. Prove that to each $\epsilon >0$, there exists a $\delta >0$ so that the Lebesgue integral of the absolute value of $f$ is less than $\epsilon$ (over the set $E$) whenever the measure of $E$ is less than $\delta$.  I know that the integral of $f$ is finite. So for arbitrary $f$ we can find the integral of $f$ to be less than some $\epsilon$, but how would I connect that with the measure of $E$ less than $\delta$. Any help would be welcome.


Please post further comments or answers to   The probability that an initial quantum state $|\psi_i\rangle$ evolves to become the final quantum state $|\psi_f\rangle$ is given by  \begin{eqnarray} P_{i \rightarrow f} &=& |\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle|^2 \tag{1}\\ &=& \langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle^*\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle \\ &=& \langle\psi_i|U^\dagger_{i \rightarrow f}|\psi_f\rangle\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle \\ &=& \langle\psi_i|U_{f \rightarrow i}|\psi_f\rangle\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle \end{eqnarray} where $U_{i \rightarrow f}$ is the forward-time evolution operator and $U_{f \rightarrow i}=U^\dagger_{i \rightarrow f}$ is the corresponding backward-time evolution operator.  Equation (1) seems to show that the probability $P_{i\rightarrow j}$ can be interpreted as the system first evolving forwards in time and then evolving backwards in time.  Perhaps this is an example of Murray Gell-Mann's  that "Everything not forbidden is compulsory"? At the quantum level, below observable probabilities, there is nothing to stop time flowing both forwards and backwards.  Does this reasoning help to explain the Born rule?

The probability that an initial quantum state $|\psi_i\rangle$ becomes the final quantum state $|\psi_f\rangle$ is given by  \begin{eqnarray} P(i \rightarrow f) &=& |\langle\psi_f|\psi_i\rangle|^2 \tag{1}\\ &=& \langle\psi_f|\psi_i\rangle^*\langle\psi_f|\psi_i\rangle \\ &=& \langle\psi_i|\psi_f\rangle\langle\psi_f|\psi_i\rangle. \end{eqnarray}  Equation (1) seems to show that the probability for the transition ($i\rightarrow f$) can be interpreted as the system both moving forward in time ($i\rightarrow f$) with amplitude $\langle\psi_f|\psi_i\rangle$ and backward in time ($f\rightarrow i$) with amplitude $\langle\psi_i|\psi_f\rangle$ simultaneously.  Does this reasoning help to explain the Born rule? (Is it like the Transactional Interpretation of QM?)  I guess we must experience the macroscopic direction of time ($i\rightarrow f$) in accord with increasing entropy in an expanding universe whereas microscopically QM works both forwards and backwards in time.  Addition  This is an improved version of the argument including time-evolution operators.  The probability that an initial quantum state $|\psi_i\rangle$ evolves to become the final quantum state $|\psi_f\rangle$ is given by  \begin{eqnarray} P_{i \rightarrow f} &=& |\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle|^2 \tag{2}\\ &=& \langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle^*\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle \\ &=& \langle\psi_i|U^\dagger_{i \rightarrow f}|\psi_f\rangle\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle \\ &=& \langle\psi_i|U_{f \rightarrow i}|\psi_f\rangle\langle\psi_f|U_{i \rightarrow f}|\psi_i\rangle \end{eqnarray} where $U_{i \rightarrow f}$ is the forward-time evolution operator and $U_{f \rightarrow i}=U^\dagger_{i \rightarrow f}$ is the corresponding backward-time evolution operator.  Equation (2) seems to show that the probability $P_{i\rightarrow j}$ can be interpreted as the system first evolving forwards in time and then evolving backwards in time.  Perhaps this is an example of Murray Gell-Mann's  that "Everything not forbidden is compulsory"? At the quantum level, below observable probabilities, there is nothing to stop time flowing both forwards and backwards.


Could anyone please give me an example of a Lebesgue measurable set which is not a Borel set and explain to me why?  I guess it is the Cantor-Lebesgue set, but I am unable to say why. Could anyone help me please?

exact duplicate of   BUT! can you please translate Miguel's answer and expand it with a formal proof? I'm totally stuck...     In short: Is there a Lebesgue measurable set that is not Borel measurable?      They are an order of magnitude apart so there should be plenty examples, but all I can find is "add a Lebesgue-zero measure set to a Borel measurable set such that it becomes non-Borel-measurable". But what kind of zero measure set fulfills such a property?


Let $f$ be a function from $\Bbb R$ to $\Bbb R$ such that $f(x)$ is rational when $x$ is irrational, and $f(x)$ is irrational when $x$ is rational. Can $f$ be continuous?   Thanks for your help.

Is there a way to prove the following result using connectedness?  Result:  Let $J=\mathbb{R} \setminus \mathbb{Q}$ denote the set of irrational numbers. There is no continuous map $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(\mathbb{Q}) \subseteq J$ and $f(J) \subseteq \mathbb{Q}$.


W: GPG error: http://download.opensuse.org  Release: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 85753AA5EEFEFDE9 W: GPG error: http://download.opensuse.org  Release: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 51AFC9B27331E9C4 thx

I added some extra repositories with the Software Sources program. But when I reload the package database, I get an error like the following:     W: GPG error:  trusty InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 8BAF9A6F   I know I can fix it using apt-key in a terminal, according to the official Ubuntu documentation. But I would have liked to do it graphically. Is there a way to do this without using a terminal?


I have a laptop running Linux with a 4GB RAM stick that came with it. It's a DDR3 1066 MHz stick. I also have a 1GB DDR3 1333 MHz stick lying around.  I've read somewhere that it might not be good to pair up RAM sticks that are not equal in a computer (the set should be symmetrical), so if they were both 1333 MHz or both 1066 MHz I wouldn't be asking this. But since the 1GB one is faster, is it advantageous to install both and end up with 5GB of RAM?  This question relates to  which says that the speed bottlenecks to the slowest rate, which I think would mean that they will both work at 1033. Does that mean that I should then install both RAMs?  Thanks.

I have a 4GB DDR3 800Mhz recently I installed another 4GB. It turns out it's  DDR3 667MHz. Does it really matter I should own both rams 800MHz?    Slot1 shows recent RAM installation. ALSO I don't know if this is 1600MHz (it shows 800x2 and 667x2 for other) or just 800MHz ram.


I am a newbie at DSLR photography and still trying to get my head around the various filters one can buy. I currently have the default 18-55mm f/3.5-5.6 AF-P VR Lens and the Tamron 70-300mm Lens. I would like to buy a CP as I have heard that one can take good landscape shots with it, however I have no clue how to go about choosing one. There are some "popular" websites that are selling these for really cheap along with a UV filter, while dedicated photography shops are selling them at a much higher price. I would like a CP that I can use with both these lenses.  I would be grateful for any recommendations.

It was suggested that I should get myself a polarizer filter to get over my reflection problem. (  )  I found out that a Nikon 52mm Circular Polarizing Filter CPL   while I can get another filter for less than half the price — . (Please note that I know nothing about these filters and googled them just for the example.)  What is the difference between polarizer filters?  I need to remove the glare and nothing else — would either of the two do the magic for me? What filter do you recommend for me?


I am wondering if random forest models require an independent observation assumption.   My date includes observations from the same participants, but I do not have a way to identify each participant. I would like to analyze this using random forests or decision tree, but I am not sure if I have to worry about the independent assumption like regression models or not.  I would appreciate your guidance and literature would be of great help.

In statistical learning, implicitly or explicitly, one always assumes that the training set $\mathcal{D} = \{ \bf {X}, \bf{y} \}$ is composed of $N$ input/response tuples $({\bf{X}}_i,y_i)$ that are independently drawn from the same joint distribution $\mathbb{P}({\bf{X}},y)$ with  $$ p({\bf{X}},y) = p( y \vert {\bf{X}}) p({\bf{X}}) $$  and $p( y \vert {\bf{X}})$ the relationship we are trying to capture through a particular learning algorithm. Mathematically, this i.i.d. assumption writes:  \begin{gather} ({\bf{X}}_i,y_i) \sim \mathbb{P}({\bf{X}},y), \forall i=1,...,N \\ ({\bf{X}}_i,y_i) \text{ independent of } ({\bf{X}}_j,y_j), \forall i \ne j \in \{1,...,N\} \end{gather}  I think we can all agree that this assumption is rarely satisfied in practice, see this related  and the wise comments of @Glen_b and @Luca.  My question is therefore:      Where exactly does the i.i.d. assumption becomes critical in practice?    [Context]   I'm asking this because I can think of many situations where such a stringent assumption is not needed to train a certain model (e.g. linear regression methods), or at least one can work around the i.i.d. assumption and obtain robust results. Actually the results will usually stay the same, it is rather the inferences that one can draw that will change (e.g. heteroskedasticity and autocorrelation consistent HAC estimators in linear regression: the idea is to re-use the good old OLS regression weights but to adapt the finite-sample behaviour of the OLS estimator to account for the violation of the Gauss-Markov assumptions).   My guess is therefore that the i.i.d. assumption is required not to be able to train a particular learning algorithm, but rather to guarantee that techniques such as cross-validation can indeed be used to infer a reliable measure of the model's capability of generalising well, which is the only thing we are interested in at the end of the day in statistical learning because it shows that we can indeed learn from the data. Intuitively, I can indeed understand that using cross-validation on dependent data could be optimistically biased (as illustrated/explained in ).   For me i.i.d. has thus nothing to do with training a particular model but everything to do with that model's generalisability. This seems to agree with a paper I found by Huan Xu et al, see "Robustness and Generalizability for Markovian Samples" .   Would you agree with that?  [Example]   If this can help the discussion, consider the problem of using the LASSO algorithm to perform a smart selection amongst $P$ features given $N$ training samples $({\bf{X}}_i,y_i)$ with $\forall i=1,...,N$ $$ {\bf{X}}_i=[X_{i1},...,X_{iP}] $$ We can further assume that:   The inputs ${\bf{X}}_i$ are dependent hence leading to a violation of the i.i.d. assumption (e.g. for each feature $j=1,..,P$ we observe a $N$ point time series, hence introducing temporal auto-correlation) The conditional responses $y_i \vert {\bf{X}}_i$ are independent. We have $P \gg N$.    In what way(s) does the violation of the i.i.d. assumption can pose problem in that case assuming we plan to determine the LASSO penalisation coefficient $\lambda$ using a cross-validation approach (on the full data set) + use a nested cross-validation to get a feel for the generalisation error of this learning strategy (we can leave the discussion concerning the inherent pros/cons of the LASSO aside, except if it is useful).


I need your help to solve a problem I have with the Google SERP for my site. My site is www.personalmedia.it, now if I search the keyword "personalmedia" the result is this one:        You can see that the link below the title is not personalmedia.it, but ypma.it. ypma.it is the company's old site, that now has a redirect to personalmedia.it.  Why Google is showing that URL instead of the real URL of the real site?  Another strange thing: if I search the keyword "personal media" the result is this one:        In this case you can see the above problem, plus another one: the highlighted text in the description is not the text that I wrote in the description metatag as shown here (which correctly appears in the above case):        The highlighted text belongs to the page, but shouldn't be the meta description what is shown in SERP?

I'm just wondering how it is possible that IGN.com has this in its title tag:      Video Games, Cheats, Walkthroughs, Game Trailers, Reviews, News, Previews & Videos at IGN   while on Google its title is simply "IGN".   How can one achieve such a thing? Does it use some special meta tag I can't see?


Did Tolkien ever describe in any detail, other than Gandalf's own words, what happened to him in the brief period when he was "dead"?  For that matter, can we truly say that Gandalf did in fact die? It is my understanding that Gandalf was a Maia. In Tolkien's universe, are Maiar capable of dying? Would he have gone to the Halls of Mandos? Was Eru responsible for bringing him back? These are the sorts of questions I'm trying to answer, as my understanding of the event is vague and mysterious.

In the first book of the LoTR, after his fight with the Balrog of Moria, Gandalf the Grey changed to .   My question is, who made the decision to 'promote' him from grey to white? Was it ? Or was it the ? Or was it the ?


I have this problem with my MacBook: when I turn it on, the battery reports 0%. After replacing the battery, I've the same problem.  New battery  has 4 cycles and 100% of charge capacity.  I have already tried SMC reset.  Is it a possible High Sierra problem? Has anyone solved it?

I have two mid 2012 MBPs. Sometime last year they both started randomly shutting down and showing the 'please plug me in to power' image when trying to start them up. That would be fine if the batter was at 1% or less but this happens when the battery is at anywhere from 30% to as high as 48% full. The power cycle info says 500 cycles or so. Both of them do this. They are both patched current, always. I asked Apple they suggested NVRAM PRAM and SMC reset, as expected, which had no effect. Any ideas?


I am preparing notes for a class using beamer in LaTeX. I use \uncover pretty liberally for answers. Is there a way to print notes for students that doesn't have answers. Here's a sample of my code:  \section{Week 1} \subsection{Basic Definitions} \begin{frame}{Example: Marijuana Legalization} \\ A local radio station is interested in determining how North Carolina  residents feel about marijuana legalization.  The station set up a special  phone number which could be called by  people  who  wished  to  voice  their   opinion.   The  station  found  that  67\%  of  the  1,624 callers support  legalization.  \begin{itemize} \item What is the parameter of  interest?\\ \uncover<2-> {{\color{wolfred}proportion of all North Carolina residents who support  marijuana legalization}} \item What is the population? \\\uncover<3->{{\color{wolfred}All North Carolina residents}} \item What is the statistic?\\\uncover<4->{{\color{wolfred}67\%, the  proportion of callers who support the legalization of marijuana.}}  \end{itemize} \end{frame}

I am preparing lecture slides for a class. I would like to hide some of the slides from the students. As an example, I would like to be able to compile students.pdf which has only student slides 1 and 2 (i.e., "teacher slide" is hidden); but teacher.pdf which has all three slides.  \documentclass{beamer}  \begin{document}  \begin{frame}{Student slide 1} blah blah blah \end{frame}  \begin{frame}{Teacher slide} secret stuff not to be shared with students \end{frame}  \begin{frame}{Student slide 2} blah blah blah \end{frame}  \end{document}   How would I do this in beamer? In a regular document, e.g., article, I would use the comment environment.  I feel that the approach in  is overkill for my needs.


Today I went through a link in Oxford stating       If the verb has only one syllable and ends with a single vowel plus a consonant (e.g. stop), then you need to double the final consonant before adding -ed and -ing:      stop-stopped-stopping   but then I remembered the words: come and flow.   If we follow this rule it would be comming and flowwing when we add -ing suffix. However it would make the words look strange and alienated cause i have never seen anyone write it like that (at least to the extent of my study). So can you guys help me clarify this situation? Thanks in advance.

Hoping is the present participle of hope. hopping is the present participle of hop. Hoping has only one p while hopping has two. What difference does it make? Why is hoping not hopping?  Edit: I changed mop to hop because of a comment by Kat.  Kat: Why would you compare hope to mop instead of hope to hop (in which case I think your answer will become obvious)?


My husband and three children are Australian, my youngest is 7 and her Australian passport has expired.   Will she be able to travel back to Australia on her British passport and just prove she is Australian when we arrive?

I was going to have to miss my brother's wedding on Jan 4th but he bought me a flight today. But my Aussie passport is expired and was only an emergency passport to begin with. I'm born and bred Aussie, just been away for ten years. I'm hoping to arrive on UK passport, show the expired Aussie one and the wedding invite and my return ticket for two weeks later and hope they understand.   What are my chances? Also planning on going to the Aussie embassy on Monday to see what they say but want to know my chances of just entering on a UK passport.


Im using Windows 8.1 and have multiple PDF files that i want to print. At the moment the only way i know to print those PDF files is by opening the file with the default Windows 8 PDF reader and then use the print option. It is a slow procedure when i have tons of PDF files to print.  I remember that on windows XP/7 i had the option to select all the files i wanted to print, right click on the selection and then choose print.. but thats not an option on windows 8.  Does anybody know about an app or way to achieve this on windows 8?

Is there a way to print several PDF files at once?  I have a bunch of individual files that I want to print (about 42).  Printing each one is tedious.  Does anyone know a way to print a whole series at once?  Maybe something like a PDF reader with a "Print All" function?  I ask because this isn't the first time I've run into this problem and have never been able to find a good solution...


A sentence with a list of questions inside quotation marks, how do I separate them? I can't find a solid answer anywhere.   Option 1: In simple terms, Naikan is based on three questions: “What have I received?” “What have I given?” and “What troubles and difficulties have I caused?”   Option 2: In simple terms, Naikan is based on three questions: “What have I received?”; “What have I given?”; and “What troubles and difficulties have I caused?”.  Option 3: In simple terms, Naikan is based on three questions: “What have I received?”, “What have I given?”, and “What troubles and difficulties have I caused?”.  Or would it be no question mark at all? In simple terms, Naikan is based on three questions: “What have I received”, “What have I given”, and “What troubles and difficulties have I caused."  The quotation marks have to be in it.

In my report a need to write a list of example questions that someone might ask, but I would like to do it in a sentence rather than a separate list. Here is an example:     This poses questions such as "How should I punctuate it?", "Are the quotes necessary?", "Are the commas in the correct place?", and "Should I have used a colon, or a semi-colon?"


I much prefer less over more for paging output since it has a much nicer command interface. However, it has the very annoying feature of clearing the screen back to its original state on exit. The one feature of more that I like is that it leaves the screen alone so you can see the state it was in when you decided to exit (usually at the end of the file).  Even running less in the LESS_IS_MORE emulation mode, the screen is cleared. Is there a way to prevent less from doing this?

How to force the less program to not clear the screen upon exit?  I'd like it to behave like git log command:    it leaves the recently seen page on screen upon exiting it does not exit the less even if the content fits on one screen (try git log -1)   Any ideas? I haven't found any suitable less options nor env variables in a manual, I suspect it's set via some env variable though.


I have troubles proving the next result:     \begin{equation} \limsup\sqrt[n]{n|a_{n}|}=\limsup\sqrt[n]{|a_{n}|} \end{equation}   where $a_{n}$ is a bounded sequence.   My attempt: Since $\limsup(s_{n}t_{n})\leq\limsup(s_{n})\limsup(t_{n})$ and $\lim\limits_{n\rightarrow\infty}\sqrt[n]{n}=1$ I have the inequality $\fbox{$\leq$}$. But I can't prove the other inequality.  I will appreciate any hint, thanks.

I'm having trouble with this homework question:  "Let there be a sequence $\left(b_{n}\right)_{n=1}^{\infty}  $ such that $\lim_{n\rightarrow\infty}\left(b_{n}\right)=1$. Let there also be some bounded sequence  $\left(a_{n}\right)_{n=1}^{\infty}$  Prove that the following statement is correct: $\limsup\left(b_{n}a_{n}\right)=\limsup\left(a_{n}\right)  $"  Alright so I sat a good two hours on this question with no major breakthroughs as of yet. I have some semi-proofs all of which use some arbitrary assumptions which I can't make.    Any hints?  Thank you!


When I launch  tlmgr update --self in a terminal, I obtain the following error message :   Unknown docfile tag:  texmf-dist/doc/latex/pythontex/pythontex_quickstart.pdf details=""Quick start" documentation" at /usr/local/texlive/2013/tlpkg/TeXLive/TLPOBJ.pm line 127, <TMP> line 129108.   How can I fix this problem ?

Today my TeX Live 2013 stopped updating packages. I use tlmgr to update packages but it's crashing with the following error:  $ sudo tlmgr update Unknown docfile tag:  texmf-dist/doc/latex/pythontex/pythontex_quickstart.pdf details=""Quick start" documentation" at /usr/local/texlive/2013/tlpkg/TeXLive/TLPOBJ.pm line 127, <TMP> line 127939.   The command   sudo tlmgr update --self --all --reinstall-forcibly-removed   does not fix it.


I'm running Windows 7. Yesterday, when I opened a website with Firefox, I saw 3 ads at the top of the site.  Then, when I checked other websites with different browsers, I saw these ads:    In the page source, I can't see any code for these ads. After using Inspect Element, this code was added to the header:     And the code in the body for this ad is:     I don't see any new and unwanted plugins in my browsers, and I haven't installed Hotspot Shield.  Is this malware, and if so, how can I remove it?

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


I'm stuck on proving the following theorem:  "Let $B = \{u_1,u_2, . . . ,u_m\}$ and $B' = \{v_1, v_2, . . . , v_k\}$ be bases for a non-zero subspace $S$ of $\mathbb R^n$. Then $m = k$. That is, any two bases for a subspace have the same cardinality."  I have thought about doing a proof by contradiction for the statement, doing cases where $m \gt k$ and $m \lt k$. Let us assume that B and B' are bases of S. Suppose that $m \gt k$ without loss of generality, then is it true that either $B$ is linearly dependent or $B'$ does not span S? If so, how would you prove it because I've tried so many different ways and I can't seem to find on that works.  It's not enough to prove by extending or reducing any of the sets since there is the possibility that $B \cap B' = \emptyset$  Any help would be much appreciated. Thank you in advance.

My textbook explains the proof, which I don't understand:  "Consider two bases $v_1...v_p$ and $w_1...w_q$ of V. Since the vectors $v$ are linearly independent and the vectors $w$ span V..."  How exactly does $w$ span V?   The book then says the same for vectors $v$, that $v$ spans V and hence $p=q$, but I don't really understand how you can assume that given two sets of vectors that are basis, one set must span V.


Which is correct: "there ARE a wealth of opportunities" or "there IS a wealth of opportunities?"

There is a large quantity of people.   There are a large quantity of people.      Are both correct?


Hi i was wondering what is the fastes workflow might be for citing in writelatex with new the Mendeley integration.   For those who are unfamiliar with writelatex and mendeley integration; writelatex generates a .bib file based on my complete Mendeley library, which is quite large. The .bib file is then placed conveniently in a project folder and linked directly to my Mendeley library. While in writelatex the .bib can be easily accessed as a popup screen, but searching within the .bib is limited to highlighting search words(meaning it does not "go-to"). After scrolling through 2000 lines i usually find the specific bibtex key i am looking for and manually type \cite{key}, but this is a very time consuming experience.   Any suggestions as to how the optimal workflow is intended?   Thanks.

I know that it is required to first create a database of references stored in a .bib file. Mendeley exports my reference list in .bib format. But how can I know what to write in curly brackets in \cite{} to refer to a particular author? Do I need to keep the .bib file open and find the relevant name to cite? Or am I missing something? What is your recommendation for referencing in LaTeX?


I'm writing a program that finds whether a word/phrase up to 8 characters is a palindrome. No matter what I put in as input, even if it is a palindrome, my program prints my else statement. I checked and made sure the code I wrote actually prints the input in reverse and it does. So I'm not quite sure what the problem is.  import java.util.Scanner; public class hw5 { public static void main(String[] args) { Scanner in = new Scanner(System.in); String word, newWord; int lengthOfWord; char lc;//last character      System.out.print("Enter word/phrase of 8 characters or less: ");     word = in.nextLine();      word = word.toLowerCase();     newWord = word;     lengthOfWord = word.length();     lc = word.charAt(lengthOfWord -1);       lc = word.charAt(lengthOfWord -1);      if (word.length() == 2)         newWord = lc+word.substring(0,1);     else if (word.length() == 3)         newWord = lc+word.substring(1,2)+word.substring(0,1);     else if (word.length() == 4)         newWord = lc+word.substring(2,3)+word.substring(1,2)+word.substring(0,1);     else if (word.length() == 5)         newWord = lc+word.substring(3,4)+word.substring(2,3)+word.substring(1,2)+word.substring(0,1);     else if (word.length() == 6)         newWord = lc+word.substring(4,5)+word.substring(3,4)+word.substring(2,3)+word.substring(1,2)+word.substring(0,1);     else if (word.length() == 7)         newWord = lc+word.substring(5,6)+word.substring(4,5)+word.substring(3,4)+word.substring(2,3)+word.substring(1,2)+word.substring(0,1);     else if (word.length() == 8)         newWord = lc+word.substring(6,7)+word.substring(5,6)+word.substring(4,5)+word.substring(3,4)+word.substring(2,3)+word.substring(1,2)+word.substring(0,1);     else         newWord = "error, not enough or too many characters";      if (newWord == word)         System.out.println("it is a palindrome");     else         System.out.println("it is not a palindrome");      System.out.println(newWord);

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


So far I have tried this:  Let $c = \gcd(a,b)$. We can say that $a = cx$ and $b = cy$ such that $x$ and $y$ are positive integers that are relatively prime. Then we have that $$ab = (cx)(cy) = c(xyc) = gcd(a,b)(xyc)$$ In order to show that $\gcd(𝑎, 𝑏) \cdot \mathrm{lcm}(𝑎, 𝑏)  = ab$, we must show that $xyc = \mathrm{lcm}(a,b)$.  We will prove this by contradiction.  Assume that $z = \mathrm{lcm}(a,b)$ and that $z<xyc.$ We see that $xyc = (cx)y = ay$ and $xyc = (cy)x = bx$. This means that $a\mid xyc$ and $b\mid xyc.$ So, the lcm of $a$ and $b$ must also divide $xyc.$ Since $x\mid a$ and $y\mid b$, we know that $x\mid z$ and   $y\mid z$. So, we can say that $xy\mid z.$  So z = xyn such that n is an integer and we will assume that $n<c$. Since z|xyc, we have that n|xyc. So c = nm where m is an integer greater than 1. So, we have: a = cx = nmx and z = xyn and that nmx|z so m|y b = cy = nmy and z = xyn and that nmy|z so m|x Since m > 1, we see that x and y are not relatively prime which means that $z<xyc$ cannot be true so z=xyc. So, we have that ab = cz = lcm(a,b) ⋅ gcd(a,b)  But I was told this is incorrect. Is there another approach?

I'm looking for an understandable proof of this theorem, and also a complex one involving beautiful math techniques such as analytic number theory, or something else. I hope you can help me on that. Thank you very much


I am trying to make a Footer sticky. I have asigned three areas in CSS with grid-areas. Header, Main and Footer. When I apply the code:  bottom: 0px;     position: absolute;   I will lose the footer area when I inspect the element in a browser. See below.  Below is my code:   * {   padding: 0;   margin: 0;   box-sizing: inherit; }   /* html -  */  html {   box-sizing: border-box;   font-family: 'Comfortaa', cursive;   color: white; }  html body {   width: 100%;   height: 100%; }  body {   background-color: #df92d2;   line-height: 1.6;   width: 100%;   display: grid;   grid-template-columns: auto;   grid-template-rows: auto;   grid-template-areas: " header " " main " " footer "; }  header {   grid-area: header;   background-color: #993a4a; }  nav {   width: 100%;   overflow: hidden; }  ul {   list-style-type: none;   overflow: hidden;   background-color: #993a4a;   text-align: right; }  li {   display: inline-block;   padding: 6px; }  nav ul li a {   text-decoration: none;   color: white; }  main {   grid-area: main;   width: 100%;   background-size: cover;   position: relative; }  main img {   height: 500px;   width: 100%; }  footer {   grid-area: footer;   background-color: #993a4a;   text-align: left;   height: 40px;   width: 100%;   bottom: 0px;   box-sizing: border-box;   bottom: 0px;   position: absolute; } <link href="https://fonts.googleapis.com/css2?family=Comfortaa:wght@300;400;500;600;700&display=swap" rel="stylesheet">
SPOOFY

Home

 Products

 Gallery

 About us

 Contact

Welcome to SPOOFY
         To make a long story short. How can I keep my 3 grid areas and have a sticky footer?

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


If $$X \sim \mathscr N(\mu_1,\sigma_1^2)$$  $$Y \sim \mathscr N(\mu_2,\sigma_2^2)$$ $X$ and $Y$ are independent, how to show that  $$X+Y\sim \mathscr N(\mu_1+\mu_2,\sigma_1^2+\sigma_2^2)$$  Hint: $$\frac{1}{\sqrt{2\pi}} \int_{-\infty}^\infty e^{-\frac{x^2}{2}}dx=1 $$

Given $x_1, \ldots, x_N$, independent and all distributed as a   Gaussian with mean $\mu$ and variance $\sigma^2$. Then, the average   $$\bar{x} = \frac{1}{N}\sum_{i=1}^Nx_i$$ is distributed as a Gaussian   with mean $\mu$ and variance $\frac{\sigma^2}{N}.$   This is a very well-known result. Anyway, I'm looking around to find a proof for this and I'm not having luck.


I have recently asked  and comments there helped, but I still can't get the result that I am looking for. I reduced my problem to a simple case:  Here is my test_bib.bib:  @article{Franklin1999,  author = {Franklin Allen and Risto Karjalainen}, title = {Using genetic algorithms to find technical trading rules}, year = {1999}, volume = {51}, pages = {245-271}, journal = {Journal of Financial Economics}  }   When I try to run this code:  \documentclass[12pt]{article} %\usepackage{cite} \usepackage{natbib}  \begin {document}  \title{My Title} \author{MyName}  My test \citet{Franklin1999} %\bibliographystyle{plain} \bibliographystyle{plainnat} \bibliography{test_bib}  \end {document}   I get this error:  ! Package natbib Error: Bibliography not compatible with author-year citations.   What am I doing wrong? I think that format of my .bib file is wrong, but I don't see where.  When I run the code with commented out parts for cite and use \cite instead of \citet everything works fine.

I am trying to figure out how to make author's name and year show up every time I make a reference.  For example:  my_bibtex.bib has this entry:  @article{Franklin1999,  author = {Franklin Allen and Risto Karjalainen}, title = {Using genetic algorithms to find technical trading rules}, year = {1999}, volume = {51}, pages = {245-271}, journal = {Journal of Financial Economics}  }   If in my_paper.tex I use this line:  Important result has been found by \cite{Franklin1999}   My output looks like:  Important result has been found by [1]   But I want it too look like:  Important result has been found by Franklin 1999   I there a way to do it?  My bibliographystyle is set to plain  \bibliographystyle{plain}  \bibliography{my_bibtex}


\documentclass[a4paper]{report}  \begin{document} \[\phantom{\ast}\hfil a\hfil\ast\] As you can see, the \verb"\hfil"s get ignored… or at least the one on the right does. But if I swap \verb"\phantom" and \verb"\ast", I get: \[\ast\hfil a\hfil\phantom{\ast},\] where the \verb"\hfil" is still being ignored. Therefore I infer both are being ignored. \end{document}   Why does that happen?

In , a way of getting \hfill-like behaviour in the align environment is described, but for my purposes, I need one that works in the equation environment. (I want to display some commutative diagrams next to each other, but for some reason, tikzcd does not like being inside align.)    Why does TeX ignore \hfill inside displayed mathematics? How can this be worked around?   I suppose I could in principle just put the various blocks inside $...$, but for consistency, it would be probably be better to have all displayed mathematics in equation or similar environments.


If you have a Venezuelan passport, and if you have a Belgium residence permit and are married to a Dutch man, do you need a transit visa when you change planes in London on your return trip to Amsterdam? UK border check will be done in between flights.  If I check the government site, I think it is not necessary because of the Belgium residence permit. Am I right? It's not all clear to me.

Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.


I am traversing through directories and moving old files to a different location. For eg. a file located in path /a/b/c/d.txt I want to move to /x/a/b/c/d.txt without errors. Is it possible in a single command? If mv doesn't work , then combination of cp and rm will work?  Only need to move single file at a time. If dest tree exists already then it should not raise an error. If dest tree doesn't exist then, create.   doesnt seem to address the requirement. Also I am able to get this done in multiple lines of code. So could there be predefined one-liner kind of option? (Want to integrate this with a programming language)

cp has a useful feature --parents that allows a file's directory structure to be copied to another directory:  $ cp -v --parents source/directory/from target/ ‘source/directory/from’ -> ‘target/source/directory/from’   How do I similarly move a file?


Let $f:[−1, 1] \to \mathbb{R}$ is continuous. Suppose we have    $$ \int_{−1}^1 \sin^n(x)f(x) dx=0 \quad \forall n \in \mathbb{Z}^+. $$ Show that $f(x) =0$ on $[-1,1]$.   I tried using $u = \sin(x)$, but it didn't really get me anywhere yet. Please, some insight would be gracious.

Assume $f:[−1, 1] \to \mathbb{R}$ is continuous and for all $n \in \mathbb{Z}^+ $ we have $\int_{−1}^1 \sin^n(x)f(x) dx=0$. Show that $f\equiv0$.  Possibly Stone - Weierstrass and the sandwich theorem. But I don't really understand how to apply the first theorem at all. Help or hints are welcome.


I have seen in many SMPS there is a Y cap placed between AC ground and DC ground. What is the need of this Y cap?

It seems that a well-designed SMPS has a capacitor connecting the ground planes of the primary and secondary sides of the transformer, such as the C13 capacitor . What is the purpose of this capacitor?  I've let myself understand that it's for EMI suppression, but what kind of EMI does it suppress, and how? It seems to me to be the only leg of an open circuit and thus completely inert, but obviously I'm wrong about that.


It is easy to send a message to myself in the future: I can put a letter in the post and will receive it tomorrow.  Can you think about a way to send a message to myself in the past; it does not need to be a complex message, only a bit of information would be enough.  Moreover, consider that money, physical resources, and manpower are infinite.

I read somewhere that according to relativity, it is possible - involving black holes and other stuff - to jump into the past. Is it possible for anything to go back in time either continuously or by jumping?


I have a question about the tabular. How do you obtain the attached tabular?

I want to make a symmetric matrix in TikZ and don't want to show the upper diagonal elements.  \documentclass[tikz]{standalone} \usetikzlibrary{matrix, positioning, calc} \usetikzlibrary{shapes.geometric, fit}  \begin{document}  \begin{tikzpicture}[baseline=(U.center)] \matrix [matrix of math nodes, left delimiter=[ ,right delimiter={]},  nodes={outer sep=1pt}] (U) {   0  &   \textcolor{white}{9} & \textcolor{white}{3} & \textcolor{white}{6} & \textcolor{white}{11}   \\[0.1cm]  9  &   0 & \textcolor{white}{11} & \textcolor{white}{11} & \textcolor{white}{11}   \\[0.1cm]  3  &   7 & 0 & \textcolor{white}{11} &  \textcolor{white}{11}   \\[0.1cm]  6  &   5 & 9 & 0 &   \textcolor{white}{11}   \\[0.1cm] 11 & 10 & 2 & 8 &   0   \\[0.1cm]  };  \foreach \x in {1,...,5}{  \node[black,  left = 3 mm of U-\x-1] (U-\x-6) {$\x$};  };  \foreach \y in {1,...,5}{  \node[black, above= 1 mm of U-1-\y] (U-6-\y)  {$\y$};  };  \draw[red] ([shift={(4pt, 2pt)}]U-1-1.north west) -- ([shift={(5pt,2pt)}]U-5-5.south east); \draw[red] ([shift={(-5pt, -2pt)}]U-1-1.north west) -- ([shift={(-4pt,-2pt)}]U-5-5.south east);  \draw[red] ([shift={(5pt, 2pt)}]U-1-1.north west) -- ([shift={(-5pt,-2pt)}]U-1-1.north west); \draw[red] ([shift={(5pt, 2pt)}]U-5-5.south east) -- ([shift={(-5pt,-2pt)}]U-5-5.south east);  \node [draw, circle, red] at (U-5-3) {};  \node[black,  left = 6 mm of U] {$\mathbf{D}=\left\{ d_{ij}\right\}=$};  \end{tikzpicture}  \end{document}     I wonder how to get the blank upper diagonal elements without using the white text color of the elements. Thanks


For example, I want to have a method to get typeof(int) from "int", typeof(List<int>) from "List<int>", typeof(Dictionary<string, int>) from "Dictionary<string,int>", etc. If the friendly name is an ambiguous one in the calling context, it's ok to throw an exception or simply return a null. I can use a dictionary to store the map for all built-in friendly types, but it would be too complicated to map every concrete generic type manually. I cannot find a way to build up all the friendly names I may need. Is there some "eval" method in C# like in some script languages? I.e. so I can simply run typeof with the friendly name as input and get a Type object reference as the return value?

I want to get a System.Type given only the type name in a string.  For instance, if I have an object:  MyClass abc = new MyClass();   I can then say:  System.Type type = abc.GetType();   But what if all I have is:  string className = "MyClass";


I have a lot of 404 errors on my webmaster's page. I don't know how google ended up on those urls. I checked my site many times to see if any links to those pages appear, but found nowhere. Is google trying out new urls on its own depending on the url structure?. Will these 404 errors result in bad outcome to my seo.

I was checking on Google webmaster tools for my blog site to see if there's any indication on why my blog traffic decreased to half in one day and i saw 43 Not Found crawl errors and 5 in Sitemap Not Found errors.   The 5 Not Found errors in Sitemap were the links to categories. I guess I renamed categories that's why Google can't find the links.   As for the 43 other Not Found errors, I see blog post titles that contain ' or . For example "McDonald's" or "O.N.E."  They weren't found by Google crawler.   There is also a blog post with /CachedYou at the end and a blog post with /www.example.com attached at the end.  They weren't found by Google crawlers either.   How do I correct those Not Found Errors?


I am a Nigerian doctor working in Saudi Arabia. I am married with 2 children but my family resides in Nigeria. I was denied a plab 2 visa recently (see picture) and I am planning to reapply. I have also been denied 2 years ago for a visit visa due to lack of funds/fund parking. What are changes I could make to improve my chances?  By changes I mean:  1 Should I reduce my proposed length of stay to 3 days? This I already plan to do.  2 The only evidence that I have booked for this exam is the confirmation email usually sent after paying. How do I go about getting it certified like the ECO hinted? Should I include other things like a receipt generated from the GMC website? Also include all the email communication I have had with the GMC?  3 I stated I wanted to familiarize myself with the UK healthcare system. This was interpreted by the ECO to mean I wanted to do a clinical attachment. Should I explain this in my cover letter, on the application website or totally ignore it?  4 I applied for a PLAB visa. However I was assessed under the clinical attachment category. Should I point it out or keep quiet?  5 This last application was in Nigeria during my leave, now I plan to apply in Saudi Arabia. Does this affect my outcome positively or otherwise?

Many of the UK visa refusals we see here share a common pattern and the prevailing reasons refer to V 4.2 (a) and (c).    I do understand that, while the applicants may describe very different individual circumstances, there's a consistent pattern and, broadly, fall into specific categories:    Credibility (lifestyle, lack of ties, visit history, lies & omissions) Funding (insufficient funds, provenance of funds, funds parking) Sponsorship (family, friends, employer)   Question: What most commonly triggers a UK visa refusal where V 4.2 (a) and (c) are given as the grounds?  Secondarily: Given that there is a clear pattern, to what extent are these refusals predictable? Does sponsorship make a difference? Is there a set of personal circumstances, however abstract, where a refusal is all but guaranteed? For example, why do those we see here on TSE who sought entry for the PLAB or British Army appear to be refused with a common theme? Is there a uniform shortcoming or is it just discrimination?   PLAB: What is about applications for a visa, for the purpose of sitting the Professional and Linguistic Assessments Board (PLAB) exam, that seem to invite refusals. After all, the test is given so that international medical graduates can show that they qualify to practise medicine in the UK. The first part, PLAB 1, can be taken in centres outside of the UK. However, PLAB 2 can be taken only in the UK. Why can't you can't get a visa just to sit the exam, promising that you'll leave immediately after?    British Army: Since Commonwealth citizens are eligible to apply online to join, even those who don't reside in the UK, why is it so difficult to get a visa just to attend an interview to see whether you are suitable? Even with an invitation from the Army, such visa applications seem to be unsuccessful. Isn't a career in the British Army a valid reason?     Lastly:  After such a refusal, what approaches would increase the chance of a successful application?


I have noticed that one of my tag badge counters (xsd) has stopped recording votes.   This is very annoying.   It's been stuck on 96 despite at least 4 votes and an awarded answer on questions for that tag in the past few days.

From my , I learned that all tag related info on profile will be updated daily at UTC 03:00.  However, something is wrong here. It's now UTC 05:00+, but my tag number, say 93 (c++) is not updated against yesterday. I am pretty sure about this and I did earn some more points throughout the day. Sorry for not be able to capture the screenshot yesterday, but I did check this number 10 hours ago (which belongs to yesterday, also 93).  Is there a bug happening here? Or updating time different?    UPDATE: As of 24 Jan, the tags are still not updated with the proper values.  UPDATE2: Fixed around 25 Jan, UTC 03:00, at least for me.


I have lost a very valuable shulker block in an ocean, in my minecraft world. It had 56 diamonds, 64 iron bars, few gold ores, a trident, a nautilus shell, a heart of the sea, and a few stacks of ice. It is very valuable, and I really want it back, but I don't know where I left it. The sea is way too large to explore it by myself, so are there any ways to get it? P.S. My world is in 1.16, so mcedit doesn't work. It also has cheats and commands disabled, but I can make a copy of my world and work on that one.

I've placed a command block making it day all the time. I want to turn it off, but I've lost it. What's the quickest way to find it?


I have set up two ssl certificates on apache2 but when i enter with domain the first certificate works and when i enter with server ipadress it shows me the same certificate which i have on domain.  I have disabled default and default-ssl vhosts.  Here are my virtual hosts:  <VirtualHost *:443>     ServerAdmin mail@example.com     ServerName example.com:443     ServerAlias www.example.com:443     DocumentRoot /var/www/example.com/public_html     ErrorLog /var/log/apache2/error-log.log     CustomLog /var/log/apache2/custom-log.log common     DirectoryIndex index.html index.php index.xhtml index.htm     #Allow phpmyadmin /usr/share/phpmyadmin     <Directory /usr/share/phpmyadmin>         Options -Indexes FollowSymLinks         AllowOverride None         Order deny,allow         allow from all     </Directory>     <Directory />         Options -Indexes FollowSymLinks         AllowOverride None         Order deny,allow         Deny from all     </Directory>     <Directory /var/www/>         Options FollowSymLinks MultiViews -Includes -ExecCGI -Indexes         AllowOverride All         Order allow,deny         allow from all         LimitRequestBody 104857600     </Directory>      ScriptAlias /cgi-bin/ /usr/lib/cgi-bin/     <Directory "/usr/lib/cgi-bin">         AllowOverride None         Options +ExecCGI -MultiViews +SymLinksIfOwnerMatch         Order allow,deny         Allow from all     </Directory>      ErrorLog ${APACHE_LOG_DIR}/error.log     LogLevel warn     CustomLog ${APACHE_LOG_DIR}/access.log combined      Alias /doc/ "/usr/share/doc/"     <Directory "/usr/share/doc/">         Options Indexes MultiViews FollowSymLinks         AllowOverride None         Order deny,allow         Deny from all         Allow from 127.0.0.0/255.0.0.0 ::1/128     </Directory>      SSLEngine on     SSLOptions +FakeBasicAuth +ExportCertData +StrictRequire     SSLCertificateFile /etc/apache2/ssl/first-ssl.crt     SSLCertificateKeyFile /etc/apache2/ssl/first-ssl.key     SSLCertificateChainFile /etc/apache2/ssl/first-ssl.crt </VirtualHost>   <VirtualHost *:443>     ServerAdmin example@example.com     ServerName 188.226.208.247     DocumentRoot /var/www/     SSLEngine on     SSLOptions +FakeBasicAuth +ExportCertData +StrictRequire     SSLCertificateFile /etc/apache2/ssl/second-ssl.crt     SSLCertificateKeyFile /etc/apache2/ssl/second-ssl.key </VirtualHost>

My apache2 configuration is problematic: I've two website on a server:   domain1.tdl domain2.tdl   One of them (domain2.tdl) must be and is accessible on port 443 (with SSL). All domains must be and are accessible by port 80. But when we try to access to domain1.tdl on port 443 the domain2.tdl files are display. So, on port 443, domain2.tdl is accessible by domain1.tdl and domain2.tdl. I don't want it !  My configuration:  domain1.tdl:  <VirtualHost *:80>   DocumentRoot /home/sites/domain1.tdl/www   ServerName domain1.tdl   ServerAlias www.domain1.tdl   ServerAdmin xxx@mail.com   RewriteEngine on   <Directory "/home/sites/domain1.tdl/www">     AllowOverride All     allow from all     Options -Indexes   </Directory> </VirtualHost>  <VirtualHost *:443>   DocumentRoot /home/sites/domain1.tdl/www   ServerName domain1.tdl   ServerAlias www.domain1.tdl   ServerAdmin xxx@mail.com   RewriteEngine on   <Directory "/home/sites/domain1.tdl/www">     AllowOverride All     allow from all     Options -Indexes </Directory>   domain2.tdl:  <VirtualHost *:80>   DocumentRoot "/home/sites/domain2.tdl/web"   ServerName domain2.tdl   ErrorLog /var/log/apache2/site/error_domain2.tdl.log                 CustomLog /var/log/apache2/site/access_domain2.tdl.log combined   <Directory "/home/sites/domain2.tdl/web">     allow from all     Options -Indexes   </Directory>   ServerAlias www.domain2.tdl </VirtualHost>  <VirtualHost domain2.tdl:443>   DocumentRoot "/home/sites/domain2.tdl/web"   ServerName domain2.tdl   ErrorLog /var/log/apache2/site/error_domain2.tdl.log   CustomLog /var/log/apache2/site/access_domain2.tdl.log combined    SSLEngine on   SSLCertificateFile /etc/ssl/private/domain2.tdl/domain2.tdl.crt   SSLCertificateKeyFile /etc/ssl/private/domain2.tdl/domain2.tdl.key   SSLCACertificateFile /etc/ssl/private/domain2.tdl/GandiStandardSSLCA.pem   SSLVerifyClient None    <Directory "/home/sites/domain2.tdl/web">     allow from all     Options -Indexes   </Directory>   ServerAlias www.domain2.tdl </VirtualHost>


Can someone please give me a hint on how to solve this?     Let $S=\mathbb{R}\setminus \left \{ -1  \right \}$ and define a binary operation on $S$ by $a\circ b=a+b+ab$. Prove that $(S,\circ)$ is an abelian group.   I cannot just say $a\circ b=a+b+ab=b+a+ba=b\circ a$, so what should I do?

The operation $@$ is defined on the real numbers as $a @ b= ab + b + a$  a) Show that $0$ is an identity for the operation.  b) Show that some real numbers have inverses under the operation.  c) Find a counter-example to show that, for this operation inverses do not exist for all the real numbers.  I have so far came to understand as far as: $a, b,c \in \mathbb{R}$ Identity: Ia= aI= a @ b I= @ b + b + I I @ b = I b + b + I


I am trying to figure out if I am using htop correctly.  A top on this VM reveals:  top - 17:52:39 up 98 days, 23:05,  1 user,  load average: 0.04, 0.01, 0.00 Tasks: 178 total,   1 running, 177 sleeping,   0 stopped,   0 zombie Cpu(s):  0.1%us,  0.0%sy,  0.0%ni,  0.9%id,  0.0%wa,  0.0%hi,  0.1%si, 98.9%st Mem:   7025100k total,  2956284k used,  4068816k free,    12276k buffers Swap:  8191992k total,   729080k used,  7462912k free,  1756724k cached    PID USER      PR  NI  VIRT  RES  SHR S %CPU %MEM    TIME+  COMMAND            25778 manga     20   0 1052m 228m 3228 S  1.3  3.3 959:15.39 python              26343 manga     20   0 1054m 231m 3208 S  1.0  3.4 938:22.52 python              25712 manga     20   0  988m 225m 3208 S  0.7  3.3 948:48.92 python              26316 manga     20   0 1054m 234m 3200 S  0.7  3.4 930:13.21 python              15500 root      20   0  102m 4664 3612 S  0.3  0.1   0:01.12 sshd                    1 root      20   0 19360  652  420 S  0.0  0.0   0:04.22 init                    2 root      20   0     0    0    0 S  0.0  0.0   0:30.26 kthreadd                3 root      RT   0     0    0    0 S  0.0  0.0  18:54.61 migration/0   .... etc ...   While an HTOP on the same machine shows what looks to be maxed out CPUs?    Am I reading this right?  Or is it reversed and that is how 'free' the cpus are?

By default, htop shows colored status bars for processors, memory, and swap. From left to right, the bars are colored green, blue, yellow, and red depending on some thresholds. What does it mean when the Memory bar has a small level of green and blue, and almost all the remainder is yellow? The swap bar is empty. The color settings for htop are "default".


I am trying to replicate the style of the following pseudocode.   The following minimal working example almost produces what I want except the extra vertical space between lines 7 and 8. How can I resolve this issue? Is there an easier way to format pseudocodes this way?  \documentclass[12pt]{article}  \usepackage[noend]{algpseudocode}  \setlength\parindent{0pt} \newcommand{\Def}[3]{\textbf{#1}\ \textsc{#2}\ifthenelse{\equal{#3}{}}{}{(#3)}} \algrenewcommand{\alglinenumber}[1]{\footnotesize#1\hspace{1em}}% <- This line  \begin{document}      \Def{procedure}{Euclidian}{$a,b$}     \begin{algorithmic}[1]         \State $x \gets a$         \State $y \gets b$         \While{$x \not= y$}             \If{$x < y$}                 \State $x \gets x - y$             \Else                 \State $y \gets y - x$             \EndIf         \EndWhile         \State \textbf{return} $x$     \end{algorithmic}  \end{document}   Edit I have tried clrscode3e this time. It worked, but required me to hack the package code. I still wonder if there is an easier solution.  \documentclass[12pt]{article}  \usepackage{clrscode3e}  \setlength\parindent{0pt}  % Restore \gets \let\gets=\leftarrow  % Print 'do' and 'then' \renewcommand{\Do}{\textbf{do}\addtocounter{indent}{1}} \renewcommand{\Then}{\textbf{then}\addtocounter{indent}{1}}  % Indent recursively (\hspace is used instead of \>) \renewcommand{\putindents}{\ifnum\value{thisindent}>0%     \hspace{1.5em}\addtocounter{thisindent}{-1}\putindents% \fi}  % Line number separation (hspace is added) \makeatletter \renewcommand{\liprint}{\protected@xdef\@lilabel{\thecodelinenumber}%     \ifnumberedline\thecodelinenumber\fi\'\hspace{0.25em}\Indent% } \makeatother  \begin{document}      \begin{codebox}     \Procname{\textbf{procedure} $\proc{Euclidian}(a,b)$}     \li $x \gets a$     \li $y \gets b$     \li \While $x \not= y$ \Do     \li     \If $x < y$ \Then     \li         $x \gets x - y$     \li     \Else     \li         $y \gets y - x$             \End         \End     \li \Return $x$     \end{codebox}     \end{document}   Edit 2 The patch proposed by @egreg fixes vertical alignment, but I have one more issue. In the first MWE, the marked line left-aligns the line numbers by increasing the separation. However, it cannot handle multidigit line numbers. What are your suggestions?

I'm currently typesetting some pseudocode and was up to now pretty happy with the algorithmicx package and the algpseudocode command set. However, I would now like to use the noend option to omit end lines. That works, but unfortunately introduces additional whitespace (see lines 6 and 7 in the example below). I fiddled around with negative \vspaces but could not come up with a consistent value that works in all cases.    \documentclass{article} \usepackage[noend]{algpseudocode}  \begin{document}  \begin{algorithmic}[1]   \Function{lsolve}{$L$, $b$}     \State $x \gets b$     \For{$j \gets 0$ to $n - 1$}       \State $x_j \gets x_j / l_{jj}$       \ForAll{$i > j$ where $l_{ij} \neq 0$}         \State $x_i \gets x_i - l_{ij} x_j$       \EndFor     \EndFor     \State \Return $x$   \EndFunction \end{algorithmic}  \end{document}   Is there any way to patch algorithmicx or do I have to finetune the pseudocode on a case by case basis?


Lady is stuck in mansion, imprisoned in her mind perhaps, someone trying to gain control of her company or her spouse’s company for its IP? Side story involves police force made up of clones including one set named Jerrys, one in particular starts to go rogue as he becomes more self aware; he is married to another clone a lady who is meant to be a ‘comforter’ and whose life suddenly has purpose now that she has been assigned to help the lady in the mansion. Big firefight at the end. Maybe an underground private train too? Nanotechology including weapons that can transform themselves (+ repair)  Thanks!

Media use bee-like paparazzi cameras, one character works at a consumer research firm that uses virtual reality Matrix-style plugging into people’s heads to survey their opinions on products; this character is younger (or small), maybe named Tag? Trig? Trip? He lives in a group-home type of situation where everyone pitches in some money/currency into a box in the house (like a coin box). Some random guy on the roof in a garden shed who has special powers, can’t touch or be touched, something like that. I think the book has a key event at a ball game or stadium involving the guy from the roof? Book may or may not also have nano-viruses in the world where cities are shielded from particular nano-viruses (I might be mixing this up with something else)