I recently got a new PC. As I always do, I wiped the SSD & reinstalled windows 10 from scratch.   Since installing v1903 it has randomly started shutting down when I hibernate - whether through the option in the power menu or the power button. This could be something to do with v1903, but I don't know that, and can't roll it back to an earlier version because I run several apps for work that require v1903. I have run the power troubleshooter, which turned up nothing.   I am running a dell latitiude E7440 with 16gb of ram, a 256gb SSD, an intel i7 and windows 10 pro.  Can anybody help me fix this problem?

It's a long time problem - Windows 10 is shutting down instead of going to sleep or hibernate. All the power settings are set to sleep/hibernate/nothing for power button/closing lid/idle etc. And still - sometimes it's just getting shutdown! Any idea?  *Windows 10, Version 1607 build 14393.726 Laptop - Asus N550JV*  Updates:  April 2018: Version 1709 build 16299.371  Still happening, I even went through a complete drive wipe and clean install.   May 2018: Version 1803 build 17134.1 - still happening. January 2021: Version 20H2 build 19042 - same thing.


I remove some files using trash-cli:  $ pwd /tmp/test $ sudo trash mfile  $   Then I look for where the deleted file is stored:  $ sudo ls /.Trash/0/ -la total 16 drwx------ 4 root root 4096 May 19 16:52 . drwx------ 3 root root 4096 May 19 16:52 .. drwx------ 2 root root 4096 May 19 16:52 files drwx------ 2 root root 4096 May 19 16:52 info  $ sudo ls /.Trash/0/* -la ls: cannot access '/.Trash/0/*': No such file or directory  $ sudo ls /.Trash/0/files/ -la total 12 drwx------ 2 root root 4096 May 19 16:52 . drwx------ 4 root root 4096 May 19 16:52 .. -rw-rw-r-- 1 t    t       6 May 19 16:48 mfile   Why does filename expansion not work in the second command?  Thanks.

I think there must be simple answer to this, but I can't figure out why this isn't working!  I have a folder in my home directory (well, a few levels down) called installed-plugins. I want to transfer all the contents of that folder (about 15 .jar files) to a different folders, also called installed-plugins.  This is what I am trying:  $ sudo mv /home/jira-plugins/installed-plugins/* /var/atlassian/application-data/jira/plugins/installed-plugins/                                                                                mv: cannot stat `/home/jira-plugins/installed-plugins/*': No such file or directory   What is my error?  The folder is definitely not empty. Here is the ls output:  $ sudo ls /home/jira-plugins/installed-plugins analytics-client-3.15.jar                                  plugin.2223138796603023855.jira-importers-plugin-6.0.30.jar atlassian-chaperone-2.0.3.jar                              plugin.330169947367430109.jira-fisheye-plugin-6.2.8.jar atlassian-client-resource-1.0.jar                          plugin.4363048306537053933.jeditor-2.1.7.2.jar atlassian-pocketknife-api-commons-plugin-0.19.jar          plugin.4438307615842123002.jira-ical-feed-1.0.4.jar atlassian-pretty-urls-plugin-1.8.jar                       plugin.461510159947098121.jira-issue-collector-plugin-1.2.5.jar base-hipchat-integration-plugin-7.8.24.jar                 plugin.5630909028354276764.atlassian-universal-plugin-manager-plugin-2.7.8.jar base-hipchat-integration-plugin-api-7.8.24.jar             plugin.6920509095052318016.atlassian-bonfire-plugin-2.9.13.jar hipchat-core-plugin-0.8.3.jar                              plugin.6952408596192442765.atlassian-bonfire-plugin-2.8.2.jar hipchat-for-jira-plugin-1.2.11.jar                         plugin.7079751365359230322.jira-importers-bitbucket-plugin-1.0.8.jar jira-email-processor-plugin-1.0.29.jar                     plugin.7451827330686083284.atlassian-universal-plugin-manager-plugin-2.21.4.jar jira-fisheye-plugin-7.1.1.jar                              plugin.7498175247667964103.jira-importers-redmine-plugin-2.0.7.jar jira-ical-feed-1.1.jar                                     plugin.7803627457720701011.jira-importers-plugin-3.5.3.jar jira-issue-nav-components-6.2.23.jar                       plugin.7977988994984147602.jira-bamboo-plugin-5.1.6.jar jira-servicedesk-2.3.6.jar                                 plugin.8372419067824134899.jira-importers-plugin-5.0.2.jar jira-workinghours-plugin-1.5.5.jar                         plugin.9081077311844509190.jira-fisheye-plugin-5.0.13.jar plugin.1260160651631713368.stp-3.0.11.jar                  plugin.9128973321151732551.jira-fisheye-plugin-6.3.10.jar plugin.2076016305412409108.jira-fisheye-plugin-3.4.10.jar  plugin-license-storage-plugin-2.8.jar plugin.218965759549051904.jira-importers-plugin-6.1.5.jar  querydsl-4.0.7-provider-plugin-1.1.jar plugin.2211202876682184330.jira-ical-feed-1.0.12.jar       stp-3.5.10.jar


So there's a folder in my directory which contains around 400-500 files (java, cpp, xml & etc) each with one name common for e.g xml_1_ubuntu.xml java_1_ubuntu.java cpp_1_ubuntu.cpp ...  I wanna change the ubuntu in their name (irrespective of their extension/file type) to notubuntu so the work dir will have files like xml_1_notubuntu.xml java_1_notubuntu.java cpp_1_notubuntu.cpp ...  is there anyway I can do this?

One of the ways I quickly rename files in Windows is   F2 > Rename > Tab (to next file) > Rename ...   But in Ubuntu/Nautilus, I can't tab to next file. But being on Linux, I think there must be a command line alternative.  However, sometimes, I may want more control over how to rename specific files. In that case, perhaps its better to be able to tab to the next file


I know this is a commonly asked question in this forum but none of the solution worked for me. Whenever I try to update or, install any package I'm getting this error  dpkg: unrecoverable fatal error, aborting:  files list file for package **'libpeas-common'** is missing final newline  E: Sub-process **/usr/bin/dpkg** returned an error **code (2)**   Please, help me to get rid of this problem.

Reading package lists... Done Building dependency tree Reading state information... Done Calculating upgrade... Done The following packages will be upgraded:   apt apt-transport-https apt-utils dpkg libapt-inst2.0 libapt-pkg5.0 ntpdate   oracle-java8-installer oracle-java8-set-default thermald 10 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. Need to get 0 B/4,389 kB of archives. After this operation, 8,192 B of additional disk space will be used. Do you want to continue? [Y/n] Y Preconfiguring packages ... dpkg: unrecoverable fatal error, aborting:  files list file for package 'linux-generic' is missing final newline E: Sub-process /usr/bin/dpkg returned an error code (2)   I already tried the usual stuff like:   sudo dpkg --configure -a   sudo apt-get -f install  sudo apt-get clean  sudo apt-get update && sudo apt-get upgrade   Any help, thanks!  cat -net /var/lib/dpkg/info/linux-generic.list      1  ^LbM-BM-^FRq^MU^Evalueq^NK^HubU^Mcertificationq^ONU^Hoverviewq^PNU$      2  updated_atq^QNU^Vavailable_translationsq^RNU^Dyearq^SMM-CM-^]^GU^Fimagesq^TNU^Bidq^UNU^Ipaused_atq^VNU^Eindex


I am trying to parse a String to Long which sometimes starts with 0. I want that the result maintains the "0" at the beginning of the Long (e.g. 0247484 instead of 247484).  I have tried this Long.parseLong(city.getId()) but it deletes the first "0".  Thank you

Is there a better way of getting this result? This function fails if num has more digits than digits, and I feel like it should be in the library somewhere (like Integer.toString(x,"%3d") or something)  static String intToString(int num, int digits) {     StringBuffer s = new StringBuffer(digits);     int zeroes = digits - (int) (Math.log(num) / Math.log(10)) - 1;      for (int i = 0; i < zeroes; i++) {         s.append(0);     }     return s.append(num).toString(); }


I'm thinking about the Borsuk-Ulam theorem for $n = 1$. How can I show that every continuous map $f : S^{1} \to \mathbb{R}$ has some $x \in S^{1}$ such that $f(x) = f(-x)$?   My first idea was: I consider the new function $g = f(x) - f(-x)$. Let's now calculate the zero of $g$, i.e. $f(x) = f(-x)$. This equation is true when $f$ is the absolute value function. Is this the right approach?  Thanks in advance

Question is to prove :  $f : S^1 \to \mathbb R$ is continuous then $f(x)=f(-x)$ for some $x\in S^1$  I guess it would be helpful to use intermediate value theorem  Assuming $f(x)\neq f(-x)$ then given any $p\in (f(-x),f(x))$ (assuming $f(-x)<f(x)$) there exists $y\in (-x, x)$ such that $f(y)=p$  I am not very sure of how to use this..   It would be helpful if someone can give some hint which would help me to solve this..  Thank you.


I'm creating a document that contains urls in the bibliography. That works just fine and the urls are broken to new lines at appropriate points.  The only issue I have is that the two pdf viewers I've tested seem to crop part of the url from the end.  Example:  http://google-maps-utility-library-v3.googlecode.com/svn/trunk/markerclusterer/docs/reference.html   becomes  http://google-maps-utility-library-v3   which is exactly the part before the line break.  Here is an image showing the problem (the tooltip shows the problem):    This is the latex document:  \documentclass[11pt]{article} % type of the document \usepackage[english]{babel} % language of all the auto generated text \usepackage[utf8x]{inputenc} % encoding stuff \usepackage[T1]{fontenc} % encoding stuff \usepackage[hyphens]{url} % \url command \usepackage{geometry} % define the geometry of the page \usepackage{lmodern} % <-- THIS BREAKS IT \geometry{a4paper,left=25mm,right=25mm, top=28mm, bottom=28mm}   % the document starts here \begin{document}  Google MarkerClusterer \cite{MarkerClusterer}.  % add the bubliography (without file extension) and style it \bibliography{cite} \bibliographystyle{unsrt}  \end{document}   and the bib file:  @misc{MarkerClusterer,     author = {},     title = {{MarkerClusterer for Google Maps v3}},     howpublished = {\url{http://google-maps-utility-library-v3.googlecode.com/svn/trunk/markerclusterer/docs/reference.html}},     year = {2010},     note = {Last accessed on 2013-09-19} }   I compiled with both pdflatex and lualatex.  The problem seems to be related to the lmodern package, since it works without it.  Does anyone know how to make the url break lines AND still make it clickable (without parts being cropped)?

I've currently got a url link in a footnote in my document. With the hyperref package, everything works correctly. Because the IEEE PDF Express tool doesn't like having the hyperref package, I've removed it and only left in the url package.  However, some strange behavior occurs as a result of this. Instead of just the link being clickable, entire paragraphs of text before/after end up being clickable and going to the same link. This occurs for both Skim and Preview in Mac OSX.  Does anyone have an inkling of what might be causing this?


I've been working as a research assistant at a fairly reputable lab for about 1.5 years now (it will be two full years come November.) My field of study is Cognitive Neuroscience.  I plan on taking the GRE in November, and I'm confident I will score highly on it.   (Aiming for at least the 95th percentile.)  My undergrad GPA was quite low.  I completely bombed my first year and a half of undergrad, and ended up with a 1.33 GPA the second semester of my Sophomore year.   (I'll add that I also chose my courses terribly, instead of getting my general education requirements out of the way I took Psychology courses that were not even relevant to what I want to do, and usually skipped them).   I almost got kicked out, but I appealed and committed to getting my life together. By graduation I managed to raise my GPA to a 2.85.  I excelled in the advanced courses within my major, and developed great relationships with the faculty. My GPA within my major is probably closer to a 3.2, I haven't calculated it yet from my transcript. I really can't understate how badly my first two years went.  My issue is I'm having difficulty narrowing down a list of PhD programs to apply to. I'm uncertain how much my work experience offsets my low undergrad GPA. Obviously I want to apply to the best possible programs, but I also don't want to waste potentially hundreds of dollars applying to schools I have no shot of being accepted to.  One of my top-choice schools, as of now, is the University of Washington.   Am I deluding myself hoping that I could be accepted there? I plan on meeting with some of my former professors/undergraduate advisor soon, as they know my history and can most likely offer the best advice, but I figured asking on here was also worth a shot.

When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it.


Please see the code below.   The task is to make the code which replaces element inserted by the user and for replacement only for-statement can be used (this is the task requirement). The rest of the elements are to be saved. E.g. when input is "1" the following output is expected "0 2 3 4"  Please help with modification of for-statement following after line  "System.out.println("The following element to de deleted "+removedElement);".  If it is possible please advise on both options when "<" and ">" symbols can be used.  import java.util.Scanner; public class MainClass {  public static void main(String[] args) {       int baseArray [] = {0, 1, 2, 3, 4};      System.out.println("Existing array:");      for(int i = 0; i < baseArray.length; i++){          System.out.println(baseArray[i]);     }      System.out.println("Please indicate number of element to be deleted");      Scanner scr = new Scanner (System.in);      int removedElement = scr.nextInt();      System.out.println("The following element to de deleted "+removedElement);      for (int i = baseArray.length; i>removedElement; i--){         **baseArray[i]=baseArray[i];**      }      scr.close();      for(int i = 0; i < baseArray.length-1; i++){          System.out.println(baseArray[i]);     }  }  }

Given an array of n Objects, let's say it is an array of strings, and it has the following values:  foo[0] = "a"; foo[1] = "cc"; foo[2] = "a"; foo[3] = "dd";   What do I have to do to delete/remove all the strings/objects equal to "a" in the array?


I have a WordPress site that uses ajax to submit a form on the Front-end.  When the form is submitted by a logged-in user, all works fine. When the form is submitted by not-logged-in user, I get a "Bad Request" error.  Here is my code:  JS:  $('form').on('submit', function (e) {     e.preventDefault();      // Submit the POST request     $.ajax({         url: jsobject.ajaxurl,         method: 'POST',         data: {             action: 'fe_submit_form'         }     }); });   PHP:  function fe_submit_form() {     ... } add_action( 'wp_ajax_fe_submit_form', 'fe_submit_form' );   When the user is logged in, all works fine. When the user is not logged it, I never go inside of the "fe_submit_form" php function.  Any ideas?

anyone encountered this bug that it will work when you are logged in but once you log out it won't work anymore.  this is a very simple plugin that will fetch zip code and display the corresponding rate.  here's the code.   TIA!


I think I read this in an anthology. Some guys start to order parts from mail catalog, super-transistors and other components that are really sent by aliens. I cannot really remember how it ended. Does anyone know the title?

Bits I remember about this SF movie which probably originated in late 50s / early 60s:   Humans are flying in a light, general aviation, high winged, single engine aircraft. An alien in a flying saucer abducts the whole kit & kaboodle (plane & passengers). Takes them to a secret terrestrial base Eventually tells them that his computer is damaged and he needs their help to get back to his planet. He needs an astronomer for planetary masses & other information. He needs a mathematician to calculate trajectories and perform other calculations. He needs the woman as eye candy, lol They eventually make it back to the alien home planet which is under attack by its enemy. The attacking aliens are bombarding the original alien's home planet with meteors / asteroids.   That's about all I remember.


I have following sequence index:  [{u'matches_template': 0, u'plate': u'EA7THE', u'confidence': 92.405113}, {u'matches_template': 0, u'plate': u'EA7TBE', u'confidence': 83.526604}, {u'matches_template': 0, u'plate': u'EA7TRE', u'confidence': 82.455276}, {u'matches_template': 0, u'plate': u'EA7T8E', u'confidence': 82.432587}, {u'matches_template': 0, u'plate': u'6A7THE', u'confidence': 80.914902}, {u'matches_template': 0, u'plate': u'BA7THE', u'confidence': 80.913948}, {u'matches_template': 0, u'plate': u'EA7THB', u'confidence': 78.234192}, {u'matches_template': 0, u'plate': u'GA7THE', u'confidence': 78.146278}, {u'matches_template': 0, u'plate': u'EA7TE', u'confidence': 77.999985}, {u'matches_template': 0, u'plate': u'A7THE', u'confidence': 77.449036}, {u'matches_template': 0, u'plate': u'EA7TH6', u'confidence': 76.716492}, {u'matches_template': 0, u'plate': u'6A7TBE', u'confidence': 72.036392}, {u'matches_template': 0, u'plate': u'BA7TBE', u'confidence': 72.035439}, {u'matches_template': 0, u'plate': u'6A7TRE', u'confidence': 70.965065}, {u'matches_template': 0, u'plate': u'BA7TRE', u'confidence': 70.964104}, {u'matches_template': 0, u'plate': u'6A7T8E', u'confidence': 70.942375}, {u'matches_template': 0, u'plate': u'BA7T8E', u'confidence': 70.941422}, {u'matches_template': 0, u'plate': u'EA7TBB', u'confidence': 69.355682}, {u'matches_template': 0, u'plate': u'GA7TBE', u'confidence': 69.267769}, {u'matches_template': 0, u'plate': u'A7TBE', u'confidence': 68.570526}]   I tried for loop to get only plate values from this sequence index.  EA7THE EA7TBE EA7TRE EA7T8E 6A7THE BA7THE EA7THB GA7THE EA7TE A7THE EA7TH6 6A7TBE BA7TBE 6A7TRE BA7TRE 6A7T8E BA7T8E EA7TBB GA7TBE A7TBE A7TBE   This is code for it. But I don't know how to get first of these sequence index. Please help to get first plate value of it.   for candidate in plate['candidates']:           print(candidate['plate'])    I would like to know how to get plate number of maximum confidence value. I know this is stupid question. Sorry for that.

I have a dictionary: keys are strings, values are integers.  Example:   stats = {'a':1000, 'b':3000, 'c': 100}   I'd like to get 'b' as an answer, since it's the key with a higher value.  I did the following, using an intermediate list with reversed key-value tuples:  inverse = [(value, key) for key, value in stats.items()] print max(inverse)[1]   Is that one the better (or even more elegant) approach?


Traveling from Boston via London (Heathrow) to South Africa. Will be in Transit. Do I need a visa?

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 would like to know what does +, - and ? mean in the output of  service --status-all. For example:   [ + ]  acpid  [ - ]  anacron  [ - ]  apparmor  [ ? ]  apport  [ + ]  atd

I need to identify the currently running services but I can't figure out the results of running service --status-all, I mean what does ?, - and + mean ?  $ service --status-all  [ + ]  acpid  [ + ]  anacron  [ + ]  apparmor  [ ? ]  apport  [ ? ]  atieventsd  [ + ]  avahi-daemon  [ ? ]  binfmt-support  [ + ]  bluetooth  [ - ]  brltty  [ + ]  console-font  [ + ]  console-setup  [ + ]  cron  [ + ]  cups  [ + ]  cups-browsed  [ - ]  dbus  [ ? ]  dns-clean  [ + ]  friendly-recovery  [ - ]  grub-common  [ ? ]  irqbalance  [ - ]  kerneloops  [ ? ]  killprocs  [ + ]  kmod  [ ? ]  lightdm  [ - ]  lm-sensors  [ ? ]  mysql  [ ? ]  networking  [ ? ]  ondemand  [ ? ]  pppd-dns  [ - ]  procps  [ - ]  pulseaudio  [ ? ]  rc.local  [ + ]  resolvconf  [ + ]  rfkill-restore  [ + ]  rfkill-store  [ - ]  rsync  [ + ]  rsyslog  [ + ]  saned  [ ? ]  sendsigs  [ + ]  setvtrgb  [ ? ]  speech-dispatcher  [ - ]  sudo  [ + ]  timidity  [ + ]  udev  [ ? ]  umountfs  [ ? ]  umountnfs.sh  [ ? ]  umountroot  [ - ]  unattended-upgrades  [ - ]  urandom  [ + ]  virtualbox  [ - ]  x11-common   And would running this command with sudo make any difference ? I tried it and in my case it didn't make any difference, but may it differ in other setups ?


Ho do I deal in the sql text with fields that have a space character. For example in db biolife I have the field: Species Name both my attempts did not work:  query1.SQL.Text := 'SELECT Species Name FROM biolife'; query1.SQL.Text := 'SELECT ''Species Name'' FROM biolife';    The first one gives error, the second gives wrong result.

I have a paradox table from a legacy system I need to run a single query on.  The field names have spaces in them - i.e. "Street 1".  When I try and formulate a query in delphi for only the "Street 1" field, I get an error - Invalid use of keyword. Token: 1, Line Number: 1  Delphi V7 - object pascal, standard Tquery object name query1.


Let $G$ be a group of order $pq$, where $p,q$ are primes, $p < q$ and $q≢1$ (mod $p$); how do we prove that $G$ is cyclic ? (I have no idea)

If $|G| = pq$,  $p,q$ primes, $p \gt q, q \nmid p-1 $, then how do I prove $G$ is cyclic without using Sylow's theorems?


I am looking for a measure to see if the model that I have used is predicting correctly. E.g., I created a model that uses multiple independent features to predict a dependent feature. The model that I show here is Support Vector Regressor (SVR), although I use other models. During the training, I obtained an R-Squared of 0.29 and during the test, R-squared is -0.67. SVR_model.score(X_train, y_train) -> 0.29 SVR_model.score(X_test, y_test) -> -0.67  I am looking for a measure that gives me a single value that helps me to evaluate if the model is predicting well or not.  What could be the reasons to have a positive R-Squared in the training and a negative R-squared in the testing? How can I say if this model is predicting well? What is the best measure to use? Root Mean Square, Adjusted R-Squared?

Let's say I have some data, and then I fit the data with a model (a non-linear regression). Then I calculate the R-squared ($R^2$).  When R-squared is negative, what does that mean? Does that mean my model is bad? I know the range of $R^2$ can be [-1,1]. When $R^2$ is 0, what does that mean as well?


This is my curl script  #!/bin/bash  PING_STATUS="$(netcat -vz mc.bella.wtf 25565 2>&1)" curl -H "Content-Type: application/json" -X POST -d '{"embeds": [{"title": "Server Status:","color": 16027903,"description": "'"$PING_STATUS"'"}]}' "$WEBHOOK"   This is what I get when I run my crontab:  mc@ubuntu:~$ crontab -l * * * * * /home/mc/server/ping >/tmp/mycommand.log 2>&1 mc@ubuntu:~$ cat /tmp/mycommand.log  curl: (3) <url> malformed   Why is my url malformed when it works fine when running the script by itself?

This is a  about using cron & crontab.   You have been directed here because the community is fairly sure that the answer to your question can be found below. If your question is not answered below then the answers will help you gather information that will help the community help you. This information should be edited into your original question.  The answer for 'Why is my crontab not working, and how can I troubleshoot it?' can be seen below.  This addresses the cron system with the crontab highlighted.


I'm newbie to Ubuntu, I've just started using it, previously when I used cd command to change directory it was working fine but now I'm trying to change the directory using cd command but I'm getting this error on terminal No such file or directory.  I've tried commands shown in screenshot but it doesn't work for me.    Could you please help me to resolve that one.  Thanks in advance.

I'm new to Ubuntu. I'm running Ubuntu 14.04.1 LTS.   My problem is that when I try to access my desktop or any folder at my home directory, it always gives me this error   No such file or directory   even though the folder exists and I can see it with the ls command


Which is correct? "Christmas came three days early to felons" or "Christmas came three days earlier to felons"?  The wave of corrupt presidential pardons began Wednesday. Christmas came three days early to felons George Papadopoulos, former Congressmen Duncan Hunter and Chris Collins, and 17 others. Hunter and Collins lined their family's pockets by misusing campaign funds or inside information. Papadopoulos lied to the FBI in the Mueller investigation. Source:

Imagine you are organizing a lunch and want to ask someone (your friend or sister, etc.) to come over and help you prepare the meal. Which one of the following words works properly in the self-made sentence below? For me they both work correctly:        Can you come over a bit early to help me with lunch?   Can you come over a bit earlier to help me with lunch?


Im trying to install Miniconda on a server. I downloaded the .sh file from    I ran the following:  bash Miniconda3-latest-Linux-x86.sh   I received this message:  installing: python-3.7.1-h0371630_7 ... Miniconda3-latest-Linux-x86.sh: line 373: mydirectory/miniconda3/pkgs/python-3.7.1-h0371630_7/bin/python: cannot execute binary file   Does anyone know what I could do to fix this?

When I login using SSH, all I can see is this...  -bash: /usr/bin/id: cannot execute binary file -bash: [: : integer expression expected   I couldn't do anything in here. Commands such as halt, poweroff, reboot will return command not found.  How can I fix this? I am using Debian Squeeze Linux


I am a programmer, not a designer. So I often need to know how many pixels a certain element is far from top or another element. But I am not sure how to measure this on the fly in the Photoshop CS6.  I changed the ruler to Pixel values. I then zoomed in and made two guides between two points I want to measure. It looks something like this    Is this a proper way to measure the distance? If yes, how do I measure it now? I am sure that Photoshop has a better option than that I have to count pixels from the rules by subtractions.   If this is the wrong way, what is the quickest way to measure the distance between two points on the screen?

Is there any way, aside from looking at the rulers and measuring by eyesight, to find the precise distance between one guide line and another?


Is there a package on Debian or some other Linux media that provides documentation for the C language? I mean in particular man pages. Eg. so that I can check docs for typedef or other basics (and possibly advanced concepts).

While I find that we can read some manuals about Library calls (C library functions) & acsii in Linux. But I still do not find any manual about C precedence order so far.  So you can recommend other useful manual about C now. Thank you!  PS: Note that the manual can be accessed via man command in Linux, so do not take those online manual or books into answers please.


When I import my meshes with textures some import just fine, but others,  just come in all solid pink. I tried saving all the textures then importing but all my models but they just become solid pink. Even the armatures don't load right

I made a character, and its one of my first times texturing, and I saved my character into a new folder, and when I came back to the model ALL the textures were pink, I used to know what to do, but I stopped texturing, how do I bring my textures back?


In the Gilbert and Sullivan Opera 'The Mikado'  (mid-late nineteenth Century) - the words 'Yes, I knew the bird intimately' appear the circumstances which point to a pun meaning a young lady,  this predates the 1915 supposed 'new' use of the word in this context by 50 years  is it not fair then to assume this can be said to be a possible contender for the first use in modern times?

Bird:         (Brit.) a girl or young woman, esp one's girlfriend ()      According to  bird:         "maiden, young girl," c.1300, confused with   (q.v.), but felt by later writers as a figurative use of  (n.1). Modern slang meaning "young woman" is from 1915, and probably arose independently of the older word.      also :         , bird was used for ‘girl’, but this was probably owing to confusion with another similar middle English word, burde, which also meant ‘young woman’. The usage crops up from time to time in later centuries, clearly as an independent metaphorical application, but there does not really seem to be an unbroken chain of occurrences leading up to the sudden explosion in the use of bird for ‘young woman’ in the 20th century.   (www.dictionarycentral.com)      Modern usage of bird meaning girl appears to be unrelated to the old Middle Ages meaning. Etymonline dates it back precisely to 1915.    What is the modern origin of bird meaning young woman?  In what context did they start to use it at the beginning of the 20th century?


I recently purchased tickets for an international trip from France to the Netherlands. The itinerary included an international ticket to Rotterdam, and a local ticket to my final destination. I accessed the ticked via the NS International app on my phone.  Everything went fine until I arrived at my destination, Voorschoten station. This was not a large station, and I found a line of people scanning their OV Chipkaart to open a gate and exit. There didn't appear to be any way out without a card. I didn't have one, so I made a dash behind someone else when the next train arrived.  Now I need to make my return trip from the same station. Is there a legal, standard way to use my electronic ticket to open the OV card gate?

According to the media the Dutch railways are getting rid of the paper-based ticket, relying fully on a chip based prepaid card called the ov chip card. I do have such a card. However, when arriving from abroad I can't iniate this journey on a ov-chip card.  I thought a paper-based ticket for international arrivals would suffice. Much to my surprise I noticed today that they were installing automatic doors, technically sealing the exits. You would need a chip card to operate the sliding doors.    Today they weren't functioning yet, but I worry about future visits. How do I get out of the station with sliding doors sealing of the exits?


In the C# specification for Interface (), there is an example regarding a class implements multiple interfaces:  interface IControl {     void Paint(); }  interface ITextBox: IControl {     void SetText(string text); }  interface IListBox: IControl {     void SetItems(string[] items); }  class ComboBox: IControl, ITextBox, IListBox {     void IControl.Paint() {...}     void ITextBox.SetText(string text) {...}     void IListBox.SetItems(string[] items) {...} }   My question is not about Implicit and Explicit implementation, I was wondering why people wants to include the base interface(IControl in this example) in the class definition? Isn't following definition good enough?  class ComboBox: /*IControl,*/ ITextBox, IListBox     {         void Paint() {...}         void ITextBox.SetText(string text) {...}         void IListBox.SetItems(string[] items) {...}     }   Another example is in the List definition, its base interface list includes the base interfaces of IList<T> and ILit, why?  interface IList<T> : ICollection<T>, IEnumerable<T>, IEnumerable   interface IList : ICollection, IEnumerableclass   List<T> : IList<T>, ICollection<T>, IList, ICollection, IReadOnlyList<T>, IReadOnlyCollection<T>, IEnumerable<T>, IEnumerable

Possible Duplicate:          Would someone explain the differences between these two beasts and how to use them. AFAIK, many  pre.2.0 classes were implemented without generic types, thus causing latter version to implement both flavors of interfaces. Is the the only case why one would need to use them?  Can you also explain in depth how to use them.?  Thanks


How can I prove that the relativistic energy and the impulse cannot be conserved if an electron, which is essentially free, absorbs all the energy of the incident photon?

As simple as in the title.. I would like to know also some mathematics about it!


I want to allow my site's users to submit content for consideration/review. Does a cover photo of a 3:2 ratio fit in well with all screens? Is it what can be considered consistent? What is your best advice/recommendation?

I'm building a web site that will allow users to upload photos. For design and layout purposes, I need to know the most common aspect ratios users will upload. What is the most common aspect ratio of photos (e.g from dSLR, smart phones, etc.)?


My audio output is broken, but I also have an audio input which I don't need.  Is there any chance that I could change them so the input will be the output?

I'm using a Realtek HD audio card built-in my motherboard. The Windows driver comes with a control panel that allows me to select which back panel jacks are used for what. So for example I can make both the blue jack and green jack for output and only the red one for mic-in. (Whereas by default, the blue jack is for line in, which I never need.)  How can I do the same under Linux? If possible, please don't suggest something that involves PulseAudio or JACK; I'd like to do it the plain way, e.g. by editing ALSA configuration files, if possible. The way I understand it, my problem should have nothing to do with software servers redirecting streams, just instructing the driver to treat this jack as so and so because it's hardware supported.  Thank you very much!


I know that IList is the interface and List is the concrete type but I still don't know when to use each one. Is there a better way to decide when to use the interface or the concrete type with some practical scenario.  I want to know why I use IList and why I use List in our project.

Can anyone explain to me why I would want to use IList over List in C#?  Related question:


I'm trying to re-create the authentic black Russian bread that was first mass produced during soviet times. Nowadays you can find it in any Russian market and many international supermarkets in the US. The problem is most recipes I can find online either:  Use a lot of additives such as cacao powder and coffee to color the bread, which don't seem historically plausible  or  Don't achieve nearly the same dark shade as the pre-packaged store variants  Anecdotally, my dad claims that this bread was sold in the Soviet Union in his youth as the cheapest bread available, for those who couldn't afford bread made from finely milled wheat. At its initial inception it was mass produced by the state and supposedly didn't taste great (although it did have that dark black color). Considering it was the cheapest bread around, it seems highly unlikely it was created with cacao or espresso powder in soviet times. Eventually, people started prizing this bread more and recipes evolved until we got the modern variant which most people (at least in Russia) find appetizing. It's possible the modern variant uses the more expensive color impacting ingredients, but it seems more likely that some trick that was used to make the original "dirt cheap" black bread is still employed or borrowed from today. I’ve made a number of different variants following the recipes online and overall I’m happy with the results in terms of taste, but it’s driving me crazy that I can’t figure out how to make the loaf authentically black.

I am interested in making the dense pungent black bread that is traditional in Russia. Recipes for black bread are varied and seem to disagree with one another. Too many of them make spongy, pumpernickel-like loaves which, while good, are not what I'm trying to make.  Is Russian black bread always made with a sourdough starter?  Some recipes have called for cocoa powder or coffee to darken the loaves as just rye flour will often turn out gray instead of dark dark brown. Are such additives common in traditional black bread recipes? If not how is the dark color obtained?


I upgraded my Bomber to a Stealth Bomber, and since then it was unable to attack any city.   The bomber could attack cities. But the stealth bomber just can't. When I went into attack mode of the stealth bomber, it doesn't display the option to attack cities within range. I even tried moving it to other cities and targeting other Civs' cities, but it doesn't work.   And yes, all the cities I was targeting, they belonged to Civs I was at war with.  When I had Gods And Kings, my stealth bombers could still attack cities. This bug has started since I upgraded to BNW.  EDIT: In the question that is linked to this question, with this question marked as a duplicate, it says that the Stealth Bomber fired on the turn before. In my case, it can always fire on units, but never on cities.

My stealth bomber won't fire on an enemy. It fired in the previous turn and now it won't attack my enemy's city. Does anyone have any ideas as to why this is?


Can't get my meshes to stop doing this and it's quite annoying

I was following  on creating a watch and noticed that when I rendered the watch, some pieces were messed up.  I'm new to 3D modeling and I've just learned Blender, I can't explain it well, so here's a picture:    Other examples:     I don't know if it's a problem with my World texture, the object, or the object's texture/material, so I can't even guess how to fix it. What causes this? Is it possible to fix it?


In my understanding of modular arithmetic, any number $x \bmod{1}$ should be zero since any number is divisible by 1.  I'd also like to understand what is meant by "almost all real numbers $\theta > 1$".  If you can explain either one, I'll accept the answer.    You can see both expressions in context in the image below.    This passage is taken from Donald E. Knuth's The Art of Computer Programming, volume 2, seminumerical algorithms, chapter 3, page 152.

Let $A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}$ be a $2 \times 2$ matrix with integer entries and $det(A) = \pm 1$. Consider the toral automorphism defined on 2-torus $f_A : T^2 \to T^2$, $$f_A (x, y) = (a x + b y \;\text{mod}\;1, c x + d y \;\text{mod}\; 1).$$ I don't understand what does it mean $a x + b y \;\text{mod}\;1$ and $c x + d y \;\text{mod}\; 1$. Can someone explain me?


I am using Python trying to figure out a key word and I see the word, "kwargs", which I know is some kind of argument in the called function but I can not find what it means or stands for anywhere.    For example, this entry in the Python documents says...  read_holding_registers(address, count=1, **kwargs)   Parameters:  address – The starting address to read from count – The number of registers to read unit – The slave unit this request is targeting   It looks like a reference to a pointer to pointer but that is all I can tell...  This does NOT even use "**kwargs"  in the parameters list   It uses what looks to me like, "unit" instead of "kwargs".  I can NOT seem to find anywhere what kwargs means.  Maybe it is "Key Word arguments" ?  What am I missing here ?  Any ideas on help here ? thank you ! boB

In the following method definitions, what does the * and ** do for param2?  def foo(param1, *param2): def bar(param1, **param2):


Basically I need a good hint how to solve the problem.I have solved it partly.     $gcd(2^a-1,2^b-1)=2^{gcd(a,b)}-1$.   I have reached till:     $gcd(2^a-1,2^b-1)=gcd(2^{a-b}-1,2^b-1)$   How to proceed from here.  Please give detailed answer if you are using special manipulation or property please do explain how do you use it in this problem to solve it.  Thanks.


Is " Long time no see " Grammatically correct ?   So I use to talk to native English speakers and they use it usually so I want to make sure if it's grammatically correct ? or " I haven't seen you for a long time " should be used instead ?

I have researched and found out long time no see is a direct translate from the Chinese phrase, 好久不见. As much as we use it almost everyday in our lives, is it actually grammatically correct? Since it is a direct translate, is it grammatically approved?


A Tetration is defined as $${^{n}a} = \underbrace{a^{a^{\cdot^{\cdot^{a}}}}}_n$$ or, by a recursion function, $${^{n}a} := \begin{cases} 1 &\text{if }n=0 \\ a^{\left[^{(n-1)}a\right]} &\text{if }n>0 \end{cases} $$ That is, iterated exponentiation (like exponentiation is iterated multiplication). Exponentiation can be expressed as $e^{n\ln a}$   Is there a like way to express Tetrations? That is, a way to calculate for both negative and decimal Tetrations?

This question has been in my mind since high school.  We can get multiplication of natural numbers by repeated addition; equivalently, if we define $f$ recursively by $f(1)=m$ and $f(n+1)=f(n)+m$, then $f(n) = m \times n$.  Likewise, we get exponentiation by repeated multiplication. If $g(1)=m$ and $g(n+1)=mg(n)$, then $g(n) = m^n$.  In my high school mind it was natural to imagine a new function defined by repeated exponentiation: $h(1)=m$ and $h(n+1)=m^{h(n)}$.  These definitions only make sense for $n$ a natural number, but of course there are standard very mathematically satisfying ways to define multiplication and exponentiation by any real number. My question is this:  Can the function $h$ defined above also be extended in a natural way to $\mathbb{R}^{>0}$?  The question is in the spirit of seeking an extension of $f(n)=n!$ to $\mathbb{R}$ and arriving at $\Gamma(x)$.  Let me focus the question, and attempt to make precise what I mean by "in a natural way." Take $h(1)=2$ and $h(n+1)=2^{h(n)}$. $h$ is now defined on $\mathbb{N}$, and $h(2)=4$, $h(3)=16$, $h(4)=2^{16}=65,536$ etc. Is it possible to extend the domain of definition of $h$ to all positive reals in such a way that  a) The functional equation $h(x+1)=2^{h(x)}$ continues to be satisfied for all $x$ in the domain.  b) $h$ is $C^\infty$. (Analytic would be even better but this seems maybe too much to hope for?)  c) All $h$'s derivatives are monotone.  These requirements are my attempt to codify what would count as "natural." I am open to suggestions about what would be a better list of requirements.  If such a function exists, I would like to know how to construct it; if it doesn't, I would like to know why (i.e. outline of proof), and if relaxing some of the requirements (e.g. just the first derivative monotone) would make it possible.  (If the function exists, I am also interested in the questions, "is it unique?" "Could we add some natural requirements to make it unique?" But my main query is about existence.)


Suppose a ∈ R1, f is a twice-differentiable real function on (a,∞), and M0, M1, M2 are the least upper bounds of $|f(x)|, |f'(x)|, |f''(x)|,$ respectively, on $(a, ∞)$.   Prove that $M_1^2 ≤ 4M_0M_2$.  Hint:  If $h > 0,$ Taylor’s theorem shows that $f'(x) = \frac{1}{2h} [f(x + 2h) − f(x)] − hf''(ξ)$ for some $ξ ∈ (x, x + 2h). $ . . .    My question is how to apply Taylor's theorem so that we get  $$f'(x) = \frac{1}{2h} [f(x + 2h) − f(x)] − hf''(ξ)$$ for some $ξ ∈ (x, x + 2h).$

I was google-ing and came across this question. Till now I don't have any solution.  Let $f$ be a double differentiable function on $(1,\infty)$. Let $M_0=\sup_{x\in R}|f(x)|$, $M_1=\sup_{x\in R}|f'(x)|$ and $M_2=\sup_{x\in R}|f''(x)|$. Prove that $M_1^2\leq 4M_0M_2$.  The only ideas that are striking me are Mean Value Theorem and Taylor's Theorem. How can this be solved?


I am current studying A level physics. I know that current is the same in all parts of a series circuit, however I cannot understand why. If adding resistance to the circuit causes the kinetic energy of the electron to drop ( potential difference) then the speed of the electron after that point should drop. This, in turn, would cause the current to decrease.   Any help is much appreciated

I have read in the internet that the charges do not have any other path to go and they must go through the same in a series circuit,hence the current is same.  It was quite convincing but what confused me was: "A resistor is a passive two-terminal electrical component that implements electrical resistance as a circuit element. Resistors act to reduce current flow..."(according to the Wikipedia). This means that the resistors slow down the rate of flow of charges. By definition, electric current is the rate of flow of charges. Then must not the current be reduced in a resistor even when the amount of charge is same?


If a hobgoblin wizard had a familiar summoned, would that familiar count as an ally, thus boosting the Saving Face ability?  Saving Face: Hobgoblins are careful not to show weakness in front of their allies, for fear of losing status. If you miss with an attack roll or fail an ability check or a saving throw, you can gain a bonus to the roll equal to the number of allies you can see within 30 feet of you (maximum bonus of +5). Once you use this trait, you can't use it again until you finish a short or long rest.

Most of the time, it should be really easy to determine who is my ally and who is not. The people who try to kill me are most likely my foes, whereas the people who entered the dungeon with me are probably my allies.   But sometimes it’s not that simple. What if one of my party members got replaced by an evil doppelganger, who plans to kill me in the near future? What if one of my allies infiltrated the court of the evil king and I accidentally have to fight her, while she is (unbeknownst to me) under the effect of a  spell? What if a character fell in love with the BBEG and just wants to save him from himself, while the BBEG hates the character and actively tries to murder him?  Most spells and abilities that affect others specify the targets as “creatures” or “willing creatures”. Some explicitly affect allies only. That’s why I want to know, how to determine who’s allied with whom. Do I have to think that someone is my ally for someone to count as my ally? Does someone else have to believe to be my ally in order to count? Do both of us have to agree on being allies? Is there an objective observer who determines who’s allied? Can Person A be the ally of Person B, while Person B is not the ally of Person A?  There are many examples for spells/abilities that care about allies, among others:   the Exalted Champion feature from the  (SCAG, p. 132-133), that grants allies within 30 feet advantage on Wisdom saving throws. the Inspiring Surge feature from the  (SCAG, p. 128), that allows one or two allies within 60 feet to make a melee weapon attack as a reaction.   With features like this, you could accidentally affect someone who’s not actually your ally. You could fail to affect someone who is actually your ally, but you don’t know it (yet). Or you could affect someone who doesn’t want to be affected (because they don’t want to be allied with you). This all depends on the interpretation of the word “ally”. I’m not sure if "ally" is a defined game term (but I don’t think so), or if I have to rely on the dictionary definition. That’s why I want to ask:  How do I determine who’s allied with whom?


I have a comp sci project:  Prompt the user to enter a word.     If the word is “Neil,” then ask the user to enter a letter. If the letter is a or b, display “Peart.” If it’s another letter, display “Xanadu.” If the word is “Geddy,” then ask the user to enter a number. If the number is odd and divisible by 9, display “Lee.” If the number is negative or equals 2012, display “YYZ.”   I typed the code for this and everything works except one thing. After I write Neil and it asks me to write a letter, if I type a or b it doesn't output Peart it outputs Xanadu.   import java.util.Scanner;  public class Rush  {      public static void main()      {        Scanner myReader = new Scanner (System.in);        System.out.print("Enter a word:" );        String word = myReader.nextLine();         if (word.equals ("Neil"))        {            System.out.print("Enter a letter: ");            String letter = myReader.nextLine();            if  (letter == "A" || letter == "a" || letter == "B" || letter == "b")            {              System.out.println("Peart");                        }            else             {              System.out.println("Xanadu");              }        }        if (word.equals ("Geddy"))        {            System.out.print("Enter a number: ");            int number = myReader.nextInt();            if (number % 2 != 0 && number % 9 == 0)            {               System.out.println("Lee");             }            if (number < 0 || number == 2012)            {                System.out.println("YYZ");            }        }      }  }

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?


Showing that $ \frac{2a_1^2}{a_1+a_2}+\frac{2a_2^2}{a_2+a_3}+...+\frac{2a_n^2}{a_n+a_1}\geq a_1+a_2+...+a_n$ holds for positive $a_i$s.  I've tried adding $a_1+a_2, a_2+a_3,...,a_n+a_1$ respectively to the terms of the LHS and using AM-GM on them, but it didn't get me to the needed point. Also tried AM GM on the whole LHS, but couldn't get much. How is it done?

Let $a_1, a_2, a_3, \dots , a_n$ be positive real numbers whose sum is $1$. Prove that $$\frac{a_1^2}{a_1+a_2}+\frac{a_2^2}{a_2+a_3}+ \ldots +\frac{a_n^2}{a_n+a_1} \geq \frac12\,.$$  I thought maybe the Cauchy and QM inequalities would be helpful. But I can't see how to apply it. Another thought (might be unhelpful) is that the sum of the denominators on the left hand side is $2$ (the denominator on the right hand side). I would really appreciate any hints.


Let $0\le c \le b \le a $. Show the identity is true with combinatorial proof.  $ {a \choose b} {b \choose c} = {a \choose a-c}{a-c \choose b-c}$. By using algebra, I can find out that both sides are dividing $a$ into 3 sets $(a-b), (b-c), c$, but I have no clue how to use combinatorial proof. The multiplication part is confusing.   Edit: I didn't know this question has been asked before. After looking at the hint, is it correct to say we choose committee first because we have ${a \choose a-c}$ which is same as  ${a \choose c}$?  Edit: LHS is saying we choose $b$ out of $a$ into group I and then we choose $c$ out of $b$ into group II. RHS is saying we take $a-c$ out of $a$ in the group II. Then group II would be left with $c$. Next we choose $b-c$ out of $a-c$ into group I. Thus, group I and group II have same numbers on both sides. Is this right? And is this a complete proof?

I am trying to give a non-algebraic proof for this equality:  $$\dbinom{a}{b}\dbinom{b}{c}=\dbinom{a}{a-c}\dbinom{a-c}{a-b}$$  So far, I could only use the identity $\dbinom{x}{y}=\dbinom{x}{x-y}$.  What I got is $\dbinom{a}{a-c}\dbinom{a-c}{a-b}=\dbinom{a}{c}\dbinom{a-c}{b-c}$. But I don't think I have made any progress from there. It seems reasonable if we think about the identity, but I just find it difficult to give a proper proof for it.  Thanks for the help.


Two weeks ago (11/30/17) our email opens dropped by about 40%.   We are an extremely small, niche, nonprofit religious site. Our newsletters titles have not changed and are not particular spammy ("Emma Lazarus, Maud Nathan and Alice Menken: Notable American Jewish Women", "Rav Kook and His View on the Modernization...")  Anecdotally, for email accounts that we monitor, we can see that from the past two weeks started going to spam. The accounts we monitor are gmail.  Neither our site nor our IP (shared) are on any blacklist sites.  I am not sure where to go from here to look for answers.

When sending or forwarding emails using a personal or company domain using a  website or email client, how do I prevent the email from being incorrectly marked as spam?


I have this question as homework:      Find the minimum value of the expression: $|z|^2 +|z-3|^2 +|z-6i|^2.$   Here's what I did: I plotted the points (0,0), (0,6), and (3,0) on the argand plane and joined them to make a triangle.   Now here is where I doubt myself. I found it centroid (1,2) and this should be the centre of mass if unit masses are kept at every vertex. Yes, centre of mass. Now the Moment of Inertia of a planar object is minimum about the axis passing perpendicular through its centre of mass and also from the parallel axis theorem  $ I = Icom + md^2$ where $ Icom = (1)|z|^2 + (1)|z-3|^2 + (1)|z-6i|^2$ I is the moment of Inertia about any axis parallel to Icom at a distance d from it.  So the minimum value of expression must be minimum about this point only. My answer is also correct.  If I am correct how do to explain it mathematically or using mathematic theorems or axioms. Otherwise how do I do it.  Thanks.  I can shift this to Physics Stack Exchange if this doesn't fit here. Sorry for no LaTeX as I have just started using Stack Exchange from mobile. Please edit whatever required.

Question:     For:$$|z - z_1|^2+|z - z_2|^2+|z - z_3|^2+\cdots+|z - z_n|^2 = S$$   Prove that the minimum value of $S$ is when:$$z = \frac{z_1+z_2+z_3+\cdots+z_n}{n}$$   I have no idea how to even start this question. I tried to do it graphically but that didn't get me anywhere. However, I feel that the easiest proof for this would be graphically.


I'm not sure whether I should use ORing or OR'ing when referring to the action of applying the Boolean operator OR to two terms. I am a native English speaker and I know that someone would understand what I mean (in the context of computer science), but I am not sure if this is an actual word. I haven't found any meaningful results in a reputable dictionary, though I have seen OR'ing used. My gut feeling is that an apostrophe should be used because it would clearly separate the noun in the word and help the reader identify that this is an unusual word. Another example of this would be how butter is a noun and buttering is a verb meaning to apply the related noun to something; however, this is a commonly used word. Something more unusual, yet feasible, would be mayonnaise'ing (or mayonnaising).   Aside: I lack knowledge of linguistics to beable to include relevant jargon and terms to this question. My instinct is that this question title can be phrased to be more general and helpful to others; if someone has a suggestion to reword the question title to be of more help to others, I would be happy to do so. Also, I tagged this as best as I could and would not be opposed to improving the tagging by suggestions from knowledgeable users.

I'm writing a scientific/technical text which involves describing some low level code.  I need to complete the following sentence:     When two values are combined, their tags are _ _ _ _ _ _ together   Where the dashed line should be filled with a word specifying the tags have been combined using a bitwise OR operation (or AND operation).  I also need the word for the present tense.


Is it possible to access arguments like this?   let a = 0;  let b = 1;   if (a === 0 || b === 1) {       let args = this.arguments; // placeholder -> this is what this question is about        console.log(`${} is equal to 0 and ${} is equal to 1!`);       // expected output: a is equal to 0 and b is equal to 1!  }   Subsequently, with the same function, would it be possible to do something like:   let a = 0;  let b = 1;   if (a === 0 || b === 1) {       let args = this.arguments; // placeholder -> this is what this question is about        console.log(`${} is equal to ${} and ${} is equal to ${}!`);       // expected output: a is equal to 0 and b is equal to 1!  }

In Python one can get a dictionary of all local and global variables in the current scope with the built-in functions locals() and globals().  Is there some equivalent way of doing this in Javascript?  For instance, I would like to do something like the following:  var foo = function(){ alert('foo'); }; var bar = function(){ alert('bar'); };  var s = 'foo'; locals()[s](); // alerts 'foo'   Is this at all possible, or should I just be using a local object for the lookup?


I'm trying to help my kids why their elementary-school physics.  Their lesson today says that "work" is done only when a change in position is accomplished by the applied force.  I have absolutely no background or training in physics whatsoever.  So my question is if two people were to stand facing each other with a book (or another object) between them, and they both applied equal force to opposite sides of the book (each person attempting to push the book toward the other person) would that be "work" in the physics sense?  Since each person is accomplishing a change in the book's movement (stopping it from moving) would that not be considered work?  I guess my question involves two forces instead of one.  Maybe that makes a difference?

I read the definition of  as  $$W ~=~ \vec{F} \cdot \vec{d}$$  $$\text{ Work  =  (Force) $\cdot$ (Distance)}.$$ If a book is there on the table, no work is done as no distance is covered. If I hold up a book in my hand and my arm is stretched, if no work is being done, where is my energy going?


In the wolfram given equation $\displaystyle\int \dfrac{dx}{x^n+1}=x\ {}_2F_1\left(1,\dfrac{1}{n};1+\dfrac{1}{n};-x^n\right)$,  But what it's mean? How we can solve without this.

I am attempting to derive the result:  $$ \int \left(1+x^n\right)^{-1/m}dx= x\,_2F_1\left(\frac 1m,\frac 1n;1+\frac 1n;-x^n\right)$$  First, I start off with the binomial expansion of the integrand to get:  $$\int\sum_{k=0}^{\infty}\frac{(1/m)_k}{k!}\left(-x^n\right)^kdx  $$  Then, I pull out a $-1$ and interchange summation and integration:  $$\sum_k\int (-1)^k\frac{(1/m)_k}{k!}x^{nk}dx  $$  $$ \sum_k (-1)^k\frac{(1/m)_k}{k!}\frac{x^{nk+1}}{nk+1} $$  $$ x\sum_k \frac{(1/m)_k}{k!}\frac{(-x^n)^k}{nk+1}  $$  So, I'm just right there, but not sure how to express this series in the general form of a hypergeometric series with the two additional Pochhammer symbols.  I even typed this last series into Mathematica, and it returned the Hyper. Function. What am I missing, or how do I transform this last series into the desired form?


I have a huge problem. My hard disk seems to be dead. I did a lot of things but I guess it's really gone. The thing is that I don't have CDs o DVDs of the OS X Lion (it's a macbook pro A1278 bought in 2012) and no backup in time machine. I lost all my files so I'm already grieving.   The thing is, if I buy a new HDD, how do I get the OS X there?

I have 13 inch mid 2010 macbook pro. Just installed new 1T hard drive but now am hesitating on what to do next. I have my old hard drive converted to external drive and a back up drive as well.


I have a table with several columns such as "pcode", "completion in %" and "pstatus". For example:   pcode P_Name     completion  subordinate         pstatus p123  inventory     10%         sanjay           progrssing   p123  test          20%         komal            progrssing p124  asd           20%         ritika           progrssing p124  qwsdf         10%         asd              progrssing   I want to get result with different code with highest complete% with other column. All field are text. I'm using asp.net using c# and msaccess database.  What I'm looking for as a result is:    pcode P_Name     completion  subordinate         pstatus   p123  test          20%         komal           progrssing   p124  asd           20%         ritika          progrssing

Table:   UserId, Value, Date.   I want to get the UserId, Value for the max(Date) for each UserId. That is, the Value for each UserId that has the latest date. Is there a way to do this simply in SQL? (Preferably Oracle)  Update: Apologies for any ambiguity: I need to get ALL the UserIds. But for each UserId, only that row where that user has the latest date.


Find the number of 2's between 0 and n?  The way I thought is to count how many 2's are there of length k(number of digits in n).  This is similar to find all permutation of digit[0-9] of length k that have at least one 2 in it.  Is there a better way to do this?

If $2$ numbers $n$ and $m$ are given, how can be found out the number of numbers with zero between and including $m$ and $n$ ($m \leq n$)?. For example, if $m=10$, $n=100$ the numbers with zeroes are $10,20,30,40,50,60,70,80,90,100$ .i.e 10 numbers.  My question is that there is any recursive formula to calculate the number of  numbers with zero in a given range. If so, what is that? And what is the reasoning behind it? Please explain it clearly.


What do you think the effect on search engine ranking will be if one uses an underscore in a domain name?

In response to ,  said:     Something about having a domain name begin with a digit just feels ... off  to me.    Does it affect site ranks on search engines?  Do you think people will be less likely to visit it? Is this just a programmer response, since most variable names can't start with a digit?


I've seen many many references across this site to C-Canon, G-Canon and a couple of N-Canons when answering Star Wars questions.  I assume G-Canon has something to do with George Lucas but what are the other canon levels and what do the letters (G, C, N) letters represent?

For all types of derivative works, namely:   Movies Novels Comic books Other written works (including RPG materials) Cartoons Video games Derivative movies (such as the infamous Ewok movies and even more infamous )   According to what rules does something become "canon" and who is responsible for the evaluation of a published work?


I'm using the desktop 64bit version of Ubuntu Linux for raspberry pi 4 (8G) (Latest version as of the 26th of December 2020) i can't download Steam, the Linux version from their website, and the one from Ubuntu's software store. I'll be talking about both. for the website download, it says i don't have libc.so.6, and for the Ubuntu software store, it says that it's "missing the following dependencies:" but it doesn't list any dependencies, it just ends the message. any suggestions, I barely know anything about the terminal and almost all "fixes" for these issues don't seem to work. any ideas?

I am having trouble opening the  client after I have already installed it. I am using . I have installed Steam directly from their website. When I try to open steam, it says: Steam needs to install these additional packages: libgl1-mesa-dri:i386, libgl1:i386, libc6:i386  and asks for my password. I put it in, but now it says: .......... Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package libgl1-mesa-dri:i386 E: Unable to locate package libgl1:i386 E: Unable to locate package libc6:i386 Press return to continue:  I press the return key, it starts running, but then it stops loading and a window pops up that says:  You are missing the following 32-bit libraries, and Steam may not run: libc.so.6  What should I do? I just started using Ubuntu this past week.


I am trying to upgrade my kernel, but I would like to avoid updating all of the packages that a sudo apt-get dist-upgrade causes.  I am running Ubuntu 14.04, if that matters.  Is there a way to only upgrade the kernel?

How do I update a single package? As far as man apt-get says apt-get upgrade doesn't take a package/list of packages as parameter:     upgrade      upgrade is used to install the newest versions of all packages   currently installed on the system from the sources enumerated in   /etc/apt/sources.list. Packages currently installed with new   versions available are retrieved and upgraded; under no circumstances   are currently installed packages removed, or packages not already   installed retrieved and installed. New versions of currently installed   packages that cannot be upgraded without changing the install status   of another package will be left at their current version. An update   must be performed first so that apt-get knows that new versions of   packages are available.


How would I obtain the following solution to the following non-linear ordinary differential equation:  $$ \frac{1}{2}\left(\frac{dR}{dt}\right)^{2}-\frac{GM}{R}=E $$  Where $E<1$. The solution has the form:  $$ R(\theta)=R_{0}(1-\cos\theta) $$ $$ t(\theta)=t_{0}(\theta-\sin\theta) $$  It is an equation which crops up in cosmology and galaxy formation, in terms of spherical collapse. But often, this solution is just given. No actual method for arriving at this solution.

I'm just reading over some Cosmology notes and there is a little ODE solve that I am not quite understanding.  I have an equation of the form:  $$ \ddot{R}=-\frac{GM}{R^{2}} $$  Integrating gives:  $$ \dot{R}^{2}=+\frac{2GM}{R}+C $$  The notes are essentially saying that this can be solved with a parameter $\theta$:    Could anyone run through the method for solving ODE's such as this.  In terms of density this can be written as:  $$ \dot{R}^{2}=\frac{4\pi{G}}{3}\rho_{0}R $$


Having already read through , however in Herstein's Abstract Algebra, I was required to prove it when we're not sure if identity is in the set.  If $G$ is a finite set close under an associative operation such that $ax=ay$ forces $x=y$ and $ua=wa$ forces $u=w$, for every $a, x, y, u, w\in G$, prove that $G$ is a group.  How to show it then? I have no idea what to do at all.

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


Someone told me that $0\times \infty = 1$.   I am baffled by this because I thought you cannot multiply by infinity because it isn't a real number. If you can, is it possible to explain how and give some a proof?

I did a bit of math at school and it seems like an easy one - what am I missing?  $$n\times m = \underbrace{n+n+\cdots +n}_{m\text{ times}}$$  $$\quad n\times 0 = \underbrace{0 + 0 + \cdots+ 0}_{n\text{ times}} = 0$$  (i.e add $0$ to $0$ as many times as you like, result is $0$)  So I thought an infinite number of $0$'s cannot be anything but $0$? But someone claims different but couldn't offer a reasonable explanation why. Google results seemed a bit iffy on the subject - hopefully this question will change that.


Entropy is a consequence of heat. The heat death of the universe results in an approach to absolute zero temperature. Does this mean the end of the universe is low entropy?

Scientists say that entropy of our universe is increasing as it is expanding and our universe is cooling down gradually from the time of its birth. If something is getting cooler and cooler, then how can it become more random (entropy increase) with the passage of time? According to laws of thermodynamics, at absolute zero temperature, the entropy is zero. That means as we go down and down to the temperature scale entropy must decrease, but why is it not happening in the case of our universe?


I have to check a column if it doesn't exists in SqlDataReader. I tried using reader.IsDBNull and reader.GetOrdinal, but still getting error "Index Out of range".

How do I check to see if a column exists in a SqlDataReader object?  In my data access layer, I have create a method that builds the same object for multiple stored procedures calls.  One of the stored procedures has an additional column that is not used by the other stored procedures.  I want to modified the method to accommodate for every scenario.  My application is written in C#.


I have a large text file.  I need to quickly pull a bunch of lines, say from #14600 to #14700, from this file, as a separate file.  How it could be done?

What's a good way of extracting say, lines 20 -45 out of a huge text file. Non-interactively of course!


I installed Ubuntu 18.04.3 yesterday using a USB, no problems, all went great. The problem is that after reboot the laptop boots instantly into W10, which was pre-installed. Tried to change the bios to legacy from uefi but it doesn't work. I tried EasyBCD but it says that my laptop is booting in EFI mode and it doesn't support it. I also tried EasyUEFI but this doesn't work either. The codes i tried in W10 cmd are :  bcdedit /set {bootmgr} path \EFI\ubuntu\grubx64.efi bcdedit /set {bootmgr} path \EFI\Microsoft\Boot\bootmgfw.efi I tried the boot repair but it doesn't work either. I tried the first method from this tutorial  and after that when I try to boot to legacy it gives me intel undi pxe-2.1 (build 083) error on startup.  Is there something I can do? I can log into ubuntu only with the usb and its not even my installation its the try without installation mode.

I have installed Ubuntu 15.10 alongside Windows 10 with UEFI. To install Ubuntu, I chose the option install alongside Windows 10 or something similar to this. Then I created a new partition for Ubuntu and installed it. After installation, the boot menu did not show up. Initially I thought Ubuntu has not been installed, but when I plugged in the USB drive and wanted to install Ubuntu I saw an option of reinstalling Ubuntu on my machine. So, I found out that Ubuntu is installed. Pressing F8 and F12 also does not help. Can anyone help me bring up the GRUB boot menu? In Windows, I also entered the command bcdedit /set {bootmgr} path \EFI\ubuntu\grubx64.efi in cmd, but still the boot menu does not show up.  Reply (Himanshu) : Just boot in bios and, if you can, add boot option with name say ubuntu and path EFI/ubuntu/shimx64.efi. No need for live PCB or anything. Move the boot option to top. This is for dell GUI bios but I assume it works for all. Or you may want to see  or , where you can enable Windows Boot Loader for one boot or forever as you wish, and boot Ubuntu from it. If you want now, you can use the installed Ubuntu terminal to use the commands update-grub to use GRUB instead. (Not enough reputation to answer properly btw.)


Hi is there a way to install ubuntu on my Samsung Galaxy Tab 2 10.1" Model# GT-P5113 I wanted to use the nexus 7 intaller but it requires "fastboot" but my tab does not have fastboot as it has a TI OMAP Processor not a Tegra. so is there a manual method to get the same result as the nexus 7? My device does support ODIN flashing And clockwork mod..

With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time.  Note from foss & Oli: We are making this the master question for all future "Will this work on <insert random tablet/phone/device here>?!" questions


Which emulator for the Game Boy Advance is recommended for Linux (Lubuntu) that doesn't run too slowly such as VBA-M in my case and that supports the same kind of features like VBA nowadays (2017)?

Is there any good GameBoy Advance Emulator for ubuntu which supports loading gameshark or action replay saves?


Let $X$ be a metric space and $C(X)$ be the set of all continuous and bounded functions with domain $X$. If $f,g\in C(X)$ define the distance between these functions by: $$ d(f,g) = \sup\limits_{x\in X}|f(x)-g(x)| $$ To prove $d$ is a metric, we have to show it satisfies $4$ properties: $$ d(f,g)\geq0 $$ $$ d(f,g)=0 \quad\text{iFF}\quad f(x)=g(x) $$ $$ d(f,g) = d(g,f) $$ $$ d(f,g) \leq d(f,h)+d(h,g) $$ I showed the first three without much difficulty, so my question is related to proving the last property. To do this, I let $f,g,h \in C(X)$ and fixed $x_0\in X$. Then by the triangle inequality for real numbers we know that: $$ |f(x_o)-g(x_o)|\leq|f(x_0)-h(x_0)|+|h(x_0)-g(x_0)| \quad \ \forall \  x_0\in X $$ If the above statement is true for all $x_o \in X$ that it must be true that we can simply take the supremums of both sides of the inequality and it still holds true. I'm not quite convinced of this logic, however, because couldn't the given distances be dependent on different points (i.e. maybe $d(f,g)=k$ occurs at $x_o$ while $d(g,h)=l$ occurs at $x_1$. If this were the case, I don't believe my argument holds up. However, I'm also not sure what else to try. Any hints would be much appreciated!

Let $X=C[0,1]$ be the set of all continuous functions on $[0,1]$. For any two functions $f,g\in X$, set $$d(f,g)=\|f-g\| = \sup \limits_{0\leq x \leq 1} |f(x)-g(x)|.$$  Prove $(X,d)$ is a metric space.    My attempt:  This question comes down to showing that $d$ is a metric, which means that:   $d(f,g)\geq 0$ $d(f,g)=0\iff f=g$ $d(f,g)=d(g,f)$ Triangular sadness.     1) Nonnegativity is guaranteed by taking the supremum of the absolute value of a sum, since the absolute value of a sum is non-negative, the supremum of non-negative numbers is non-negative.  $\square$    2) For the supremum of $|f(x)-g(x)|$ to be equal to $0$, the greatest number for $|f(x)-g(x)|$ from $0\leq x\leq 1$ must be $0$, hence $|f(x)-g(x)|=0$ for all values on this range, and thus $f(x)=g(x)$ is the constant zero map.  $\square$    3) $|f(x)-g(x)|=|g(x)-f(x)|$ implies that $\sup \limits_{0\leq x \leq 1} |f(x)-g(x)|=\sup \limits_{0\leq x \leq 1} |g(x)-f(x)|$ $\square$    4) Triangular sadness:  We need to prove that $d(f,g)\leq d(f,h) + d(g,h)$  I.e.  $\sup \limits_{0\leq x \leq 1} |f(x)-g(x)|\leq \sup \limits_{0\leq x \leq 1} |f(x)-h(x)|+\sup \limits_{0\leq x \leq 1} |g(x)-h(x)|$  Now I am not sure how I can 'behave' with the sup 'function'. Can I do the following?  $$\sup|f(x)-g(x)| = \sup|f(x)-g(x)+h(x)-h(x)|=\sup|f(x)-h(x)+(h(x)-g(x))|$$ Then use normal triangular inequality:  $$\sup|f(x)-h(x)+(h(x)-g(x))|\leq \sup(|f(x)-h(x)|+|h(x)-g(x)|)=\sup(|f(x)-h(x)|+|g(x)-h(x)|)$$   This is obviously less than $\sup \limits_{0\leq x \leq 1} |f(x)-h(x)|+\sup \limits_{0\leq x \leq 1} |g(x)-h(x)|$, but I don't know how to prove it. How do I finish that one off.


Why "I will call you back" instead of "I will call back you"? Here "call back" is a phrasal verb, and "back" is a particle. Then why are we separating the particle?  Is there any rule for it?

I just read a book to learn English. And the topic I read is about the phrasal verbs, but a big doubt has come up to my mind.  Is it correct to change the position of the preposition (putting it with the verb instead of after the direct object)?  As in:  Common structure:   My wife backs me up over my decision to quit my job. We have to blow 50 balloons up for the party.  I need to break these shoes in before we run next week. Please help me out to get this job done.   So, would it be correct to do the following:   My wife backs up me over my decision to quit my job. We have to blow up 50 ballons for the party.  I need to break in these shoes before we run next week. Please help out me to get this job done.


Graphics Memory: 4 GB Graphic Processor: NVIDIA GeForce GTX 940MX Processor: Intel Core i7-7500U (7th Gen) Game is loading from HDD   I have fairly recently bought the Dell 7560 with the aforementioned specifications. I have bought an original copy of GTA V. And I have installed and kept updated the GeForce Game Ready Driver.  However, I am facing a lot of lag and a very bad experience while playing the game even with minimum settings. This is just frustrating. Just loading the game fires up the fans as if I am launching Falcon Heavy.  The game is installed on my hard drive.  My question is, are there any software which I should install to optimise my gaming experience?  How do I enhance my gaming experience? Any tips? Thanks

Is there a service that I can use to check if my machine will be able to run a certain game?


In some texts (mainly complex analysis or harmonic analysis) I sometimes see the following double subset symbol $\subset\subset$ for inclusion relation of two regions, e.g., $\Omega$ and $\Omega'$ are two regions in $\mathbb{C}$ such that $\Omega \subset\subset \Omega'$. I never figured out what it means exactly; I always interpreted it as the closure $\overline{\Omega}$ is contained in $\Omega'$ (so that some nasty boundary effects can be avoided). Is that right? Or does $\subset\subset$ mean some other kind of inclusion? Thanks.

I have read the book Function Theory of Several Complex Variables of Krantz. But there is a notation the meaning of which I don't know. The notation is $\subset\subset$. For example, "let $\Omega\subset\subset \mathbb{R}^{n}$ be a connected open set".    Can somebody give me a definition?


Which of the following is correct?        Devon Police is recording incidents       or        Devon Police are recording incidents

With reference to this question  and as per my understanding police is always plural. But I got shocked after seeing police used as a singular noun in :     Two days after the death of the 23-year-old gangrape victim, Delhi Police on Monday said it has finalised around 1,000-page chargesheet in connection with the incident and plans to submit it in court on Thursday.     I can't figure out why they have used police as singular. It's one of the prominent newspapers in India. I doubt myself about its usage. Could anyone elucidate it further?


I'm reading a program in (.NET) C++ made by someone else, and I can't figure out what this means:  BinaryWriter^ file = gcnew BinaryWriter( File::Open( "Data.al", FileMode::OpenOrCreate ));   What DOES the ^ do in this sentence?  and what about this:  void GetEEDataRx(array<Byte> ^%EE)   What is the purpose of the ^%

I just came across this code and a few Google searches turn up no explanation of this mysterious (to me) syntax.  Hashtable^ tempHash = gcnew Hashtable(iterators_);  IDictionaryEnumerator^ enumerator = tempHash->GetEnumerator();   What the heck does the caret mean? (The gcnew is also new to me, and I asked about that .)


I'm trying to compare the current working directory's path with my home directory's path.  user@machine:~$ echo $PWD /home/user user@machine:~$ if ["$PWD" = "/home/user"]; then echo True; else echo False; fi bash: [/home/user: No such file or directory False user@machine:~$ if ["$PWD" = "whatever"]; then echo True; else echo False; fi bash: [/home/user: No such file or directory False   I expected it to print True in the second command and False in the third, while not printing bash: [/home/user: No such file or directory. Why is it printing this and how do I get it to work as I wanted to?

I am using the below script to move two days back when script runs at starting two days of the year and also check first and second days of every month and move two days back. if [$month="01"] && [$day="01"]; then         date="$last_month/$yes_day/$last_year"         fulldate="$last_month/$yes_day/$last_year" else         if [$month="01"] && [$day="02"]; then                 date="$last_month/$yes_day/$last_year"                 fulldate="$last_month/$yes_day/$last_year"         else                 if [ $day = "01" ]; then                         date="$last_month/$yes_day/$year"                         fulldate="$year$last_month$yes_day"                 else                         if [ $day = "02" ]; then                                 date="$last_month/$yes_day/$year"                                 fulldate="$year$last_month$yes_day"                         else                                 date="$month/$yes_day/$year"                                 fulldate="$year$month$yes_day"                         fi                 fi         fi fi  But my bad am getting the below error message Etime_script.sh: line 19: [06=01]: command not found Etime_script.sh: line 24: [06=01]: command not found


I have been trying to solve a codewar question but when I use Math.Pow I get interesting results. like I enter 3 as base and 3 as power but result I know I should use double but int works fine in other projects :D using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks;   namespace SoloLearn { class Program {     static void Main(string[] args)     {     int value = 371;     int cL;     List<int> NumberList = new List<int>();          string Sayı = value.ToString();             //to make value to string so I could      int L = Sayı.Length;                        // count length and putto array     char[] charArray = Sayı.ToCharArray();            foreach(char chr in charArray)  // getting digits multiply with himself for L times     {                                      cL = chr;                 //    chr İS 3 BUT WHEN ASSİGNED TO cL İT CHANGES TO 51         Console.WriteLine(chr)    // gives 3         Console.WriteLine(cL)     // gives 51         double nmbr = Math.Pow(cL, L);       // calculating power etc         int charr = (int) nmbr;              // assign result to int         NumberList.Add(charr);               // take assigned int to list     }      int Total = NumberList.Sum();       if (Total == value)     {        Console.WriteLine("true");     }      else      {       Console.WriteLine("false");     }     }      }     }

I have a char in c#:  char foo = '2';   Now I want to get the 2 into an int.  I find that Convert.ToInt32 returns the actual decimal value of the char and not the number 2.  The following will work:  int bar = Convert.ToInt32(new string(foo, 1));   int.parse only works on strings as well.    Is there no native function in C# to go from a char to int without making it a string?  I know this is trivial but it just seems odd that there's nothing native to directly make the conversion.


Let $R$ be a ring. Denote $M_{n,n}(R)$ as the matrix ring over $R$. I've already proven that $M_{n,n}(I)$ is an ideal of $M_{n,n}(R)$ $\Leftrightarrow$ $I$ is an ideal of $R$.   Is there a short way to prove that $M_{n,n}(I)$ is a prime ideal of $M_{n,n}(R)$ $\Leftrightarrow$ $I$ is a prime ideal of $R$?  note: every ideal is considered to be two-sided.

I have to do the following question:  Given a unital ring $R$ and a natural number $n$ $\geq 1$, identify (with proof) the prime ideals of the matrix ring $\mathbb{M}_{n}(R)$.  I understand the theory, but putting it all together is proving difficult.   I understand that the prime ideals of $\mathbb{M}_{n}(R)$ should be $\mathbb{M}_{n}(\mathbb{P})$.  Can anyone suggest any steps as to how to prove this?


I think I have seen both patterns in Java:  int array[] = { 1, 2, 3 }; int[] array = { 1, 2, 3 };   Are they both correct? Why are they both correct? Is one of them preferred/recommended?  My question is: when does the [] go after the type, and when does the [] go after the identifier when initialising arrays?

I have recently been thinking about the difference between the two ways of defining an array:   int[] array int array[]   Is there a difference?


Currently I am writing a function that includes random samples with some restrictions. It is possible at the last step there is no valid condition to choose and my function will be stuck.  Is there a way to set run time limit for this function? Let's say after 2 seconds, if there is no result returned, and it will run the function again until it returns the result within 2 seconds. Thanks in advance.

I'm calling a function in Python which I know may stall and force me to restart the script.   How do I call the function or what do I wrap it in so that if it takes longer than 5 seconds the script cancels it and does something else?


I have a wide-angle lens, but the hood does not come off. The lens is a Rokinon/Samyang AF 14mm f/2.8. Is there a way to use a filter besides using an adapter filter?

I am toying with the idea of picking up either the  or the  lens.  These lenses have a built-in petal-shape hood and a "bulb-like" front element. I came across a few reviews about the 14mm f2.8 lens but all of which mentioned the "unusuall" front element and the if so special lens cap that should always be on the lens when not in use. At least  says it is not possible to mount front filters on these lenses. Surely, there is a way...  In situations where I would be normally using these lenses I would want to be able to use ND filters. Is there any way to filters to these type of lenses and if so how and what type?


I have ALL the perks for enchanting (100) ALL the perks for smithing (100) and all the perks for destruction (100 again) yet I can only enchant my daedric helmet with fortify destruction to 15%.  I want to do the thing where you can get 100% fortify destruction if you doi it on four peices of apparel, however I don't know what I am doing wrong :(

I was making a set of Fortify Alchemy to 29% to be able to create stronger enchantments. For some reason my Fortify Alchemy gear only goes to a maximum of 23% and I've read/seen people creating enchantments with a 29% bonus.  I have 100 Alchemy skill and 100 Enchantment skill with all the necessary perks.  I was trying to do this:


If sequence $x_n$ converges to $x$, prove that $\sqrt x_n$ converges to c. I know I have to estimate   $| \sqrt x_n - \sqrt x |$. But I cannot start. Thanks

Show that if $x_n \to x$ then $\sqrt{x_n} \to \sqrt{x}$ I have been stuck on this for a while. I tried $$|\sqrt{x_n} - \sqrt{x}| = \frac{|x_n - x|}{|\sqrt{x_n} + \sqrt{x}|},$$ and then I at least can get the top to be as small as I want, so I have $$\frac{\epsilon}{|\sqrt{x+\epsilon} + \sqrt{x}|},$$ but I get stuck here at choosing the N, and I don't know if my first step in breaking down the absolute value is legitimate. Please help.


How can one or all of the following be done. Get all classes during runtime in Scala  in a package that extend a particular trait with a custom annotation

Is it possible to find all classes or interfaces in a given package? (Quickly looking at e.g. , it would seem like no.)


Is this acceptable to revise a manuscript more than what reviewers suggested? In fact, due to some issue, the authors may find out that there are some issues even reviewers could not address, so they decided to extend the revision border.  P.s. What about imposing changes so that affect the title, abstract and a large portion of  manuscript. In an advise to a friend of mine, I warned him of doing so because it results in a new paper not a standard revised version. Nonetheless, I told him that is the case of such comprehensive revision he should carefully explain reasons behind that decision. Can such rational explanation convince the reviewers to consider another round of review?

I submitted a paper to an applied mathematics journal. I have since found a way to generalize one of the results.  Is it acceptable to update the paper during the first review step even if I have not been requested to improve on this particular aspect?  I understand that this would create extra work for the reviewers since they would have to check that part again. However, writing a brand new paper with the additional result would probably cause even more extra work for the review community. I also understand that a dissemination strategy that incorporates some salami slicing might be better for my career, but somehow I am opposed to doing that kind of thing.


I have PS4 and GTA-V, my friend has the GTA-V too, but he have PS3. I have PSNPlus, but my friend  not yet. The reason he don't have it, is because we want to try to play GTA-V online, but togheter.  My question is:  When he buy PSN-Plus, we will be able to play togheter online? I ask it because we have different PlayStations..

Grand Theft Auto Online exists on five different platforms: XBox 360, PS3, XBox One, PS4, and PC. Do any of these play on the same servers, allowing people on differing platforms to play together?


All groups of order 6 are isomorphic to either $S_3$ or $\mathbb{Z}_6$.  Without knowing that, I was trying to derive how many structurally distinct groups of order 6 exists by constructing the multiplication tables.  And I came upon the following statement on this :       Having all non-identity elements have order 2, means the group is abelian.   Is this trivial? Could I know that before trying to build the table?

What is the intuition behind the fact that if every element in a group is of order $2$, we have that the group is abelian? I can prove it, but I do not know the intuition behind it.


I'm fairly new to Ubuntu, and just realised that all my ppa's I've been adding are http only  Are there plans for https support in the future?

Are repository updates secure?  As a bear of little brain from the developer side, I cannot understand why the repository list is http://security.ubuntu.com and the other http(unsecured) sites listed in /etc/apt/sources.list.  Without a certificate chain match this appears as "ask any responder for a list of packages to update" instead of "ask the ubuntu.com site..."  Can any network choose to spoof the update sites, and is this a common practice to provide a locally cached and vetted copy?


Show that $\Sigma_{j=1}^{n} \dfrac{1}{j(j+1)} = \dfrac{n}{n+1}$  I am  having trouble trying to show this since this series doesnt seem to represent any arithmetic or geometric form of common difference.

I am trying to prove the summation formula using induction:  $$\sum_{k=1}^n \frac{1}{k(k+1)} = 1-\frac{1}{n+1}$$  So far I have...  Base case:   Let n=1 and test   $\frac{1}{k(k+1)} = 1-\frac{1}{n+1}$  $\frac{1}{1(1+1)} = 1-\frac{1}{1+1}$    $\frac{1}{2} = \frac{1}{2}$   True for n=1   Induction Hypothesis:   Assume the statement is true for the n-th case   $\sum_{k=1}^n  \frac{1}{k(k+1)} = 1-\frac{1}{n+1}$  Inductive Step:   Prove, using the Inductive Hypothesis as a premise, that   $$\sum_{k=1}^{n+1}  \frac{1}{k(k+1)} = \sum_{k=1}^{n}  \frac{1}{k(k+1)} + \frac{1}{(n+1)(n+2)} = 1-\frac1{n+1} + \frac{1}{(n+1)(n+2)} = \frac{(n+1)(n+2)}{(n+1)(n+2)}+\frac{-2-n}{(n+1)(n+2)}+\frac{1}{(n+1)(n+2)} = \frac{(n+1)(n+2)-2-n+1)}{(n+1)(n+2)} = \frac{(n+1)(n+2)-n-1}{(n+1)(n+2)} = \frac{n^2+2n+1}{(n+1)(n+2)} = \frac{(n+1)(n+1)}{(n+1)(n+2)} = \frac{n+1}{n+2}$$  To prove $$ 1-\frac{1}{n+2} = \frac{n+1}{n+2} $$ Multiply both sides by $n+2$ to get an equivalent expression. $$ (1-\frac{1}{n+2}) * (n+2) = (\frac{n+1}{n+2}) * (n+2)  $$ $$ n+1=n+2−1 $$  Does this all make sense? How can this be improved upon?


I read a post on here about boltzmann brains a few days ago, and got curious on the subject. From the articles I read, it seems that they are saying that we are almost 100 percent likely to be BBs instead of humans. These ideas have worried me tremendously.   I also read this post () Which only amplified my anxiety because that post seemingly says that yes, we probably are BBs.   Are those article's statements that we are almost certainly BBs true? And is that other post also correct?

Starting from the assumption of a cosmology in which  dominate over evolved ones, it is not immediately obvious to me that there is a real problem, since only Boltzmann brains indistinguishable from evolved brains will be posing the question in the first place.  In other words, the vast majority of Boltzmann brains will not be troubled by the paradox because their memories will not be consistent with a stable/large physical universe, and so they would never ask such a question in the first place.  So we must only consider the subset of Boltzmann brains whose experiences would be so consistent with a universe like ours that they would pose the question "why are we not Boltzmann brains?" And in such cases, even though we may be Boltzmann brains, our experiences would be indistinguishable from evolved brains.  Is this a criticism of the Boltzmann brain paradox that has been dispatched with, or is it a legitimate cause to be suspicious of whether it is really a paradox at all?


I was taking some inside pictures with my Nikon D3100 and 18/55 lens when, all of a sudden, the lens started to work funny -- the more I zoomed in on the subject, the fuzzier the picture looked in the viewfinder. I shut the camera down. The next day I tried it again and saw the same effect. Then I got the idea of seeing how a picture would actually look on the LD screen, and just as suddenly, what I saw through the viewfinder was normal. Things were OK again. What happened?

I have a fairly new Nikon D7000 (I've taken about 2000 pictures).   Something happened during my last trip, where thew viewfinder never gets sharp anymore. It always looks out of focus, regardless if i am in manual or automatic mode.   Pictures still come out sharp, and when I switch to the LCD screen I can see the focus, but not in the viewfinder.   Is there some sort of tuning that needs to be done?


Define a function $\phi$ on $\mathbb{R}$ by $\phi(x) = |x|$ for $x\in [-1,1]$ and $\phi(x+2)=\phi(x)$ for all $x\in \mathbb{R}$. Show $|\phi(t) - \phi(s)|\leq |t-s|$. Attempt: for $x\in \mathbb{R}$, $\phi(x)$ =  $\bigg\{\begin{array}{cc} |-1 + \{x\}| \ \text{,if} \ [x]=1 (\mod2) \\ \{x\}\ \ , \text{if}\ \ [x] = 0(\mod 2)\end{array}$ where $\{x\}$ is the fractional part of $x$ and $[x]$ is the greatest integer of $x$. can't proceed further

Let $f(x) = |x|$ for $x \in [-1,1]$ and extend $f$ to all of $\mathbb R$ by requiring $f(x+2)=f(x)$. Prove that $|f(x)-f(y)|\le|x-y|$ for all $x$ and $y$.   This is easy to observe on a graph but my proof is long and a bit tedious. Just curious if there is a quick/elegant way?


I was thinking how to show that $0!=1.$ I came up with this arguement.    $n!=n\times(n-1)!,$ so with $n=1$, we have $1!=1\times0! \implies 0!=1.$ Is this correct ? Or there are some better proofs for this ? Or is it simply an assumption.

How can I prove  from first principles that $0!$ is equal to $1$?


In conditional expectation, why is $E(X \mid X)=X$ instead of $E(X \mid X)=E(X)$? If we know the distribution $X$, wouldn't the expected value of the distribution just be $E(X)$?

I tried to show that $E(X\mid X=x)=x$, which would lead me to get $E(X\mid X)=X$ but I am having trouble doing so. I know that the definition of conditional expectation (continuous case) is: $$E(X\mid Y=y)=\int_{-\infty}^{\infty}x f_{X\mid Y}(x\mid y)\,dx$$ This led me to write: $$E(X\mid X=x)=\int_{-\infty}^{\infty}x f_{X\mid X}(x\mid x)\,dx$$ but I don't know what $f_{X\mid X}(x\mid x)$ is (if that's even a valid notation...)  I do note though that I don't know anything about $\sigma$-fields or Borel sets, as someone had tried to explain me once. Is it possible to prove this in an "elementary" way?


Is it appropriate to use the coefficient of variation (CV) for non-parametric data?   I'm not sure whether it is appropriate since you use the mean of the data to calculate it together with the SD. While for parametric data the median is more representative for the central tendency. But perhaps I'm overlooking something.

I was reading a  where the author mentions: "The coefficient of variation is primarily a descriptive statistic, but it is amenable to statistical inferences such as null hypothesis testing or confidence intervals. Standard procedures are often very dependent of the normality assumption and current work is exploring alternative procedures which are less dependent on this normality assumption."  The paper is from 2010. So my question is: has there been any recent "advancements" in terms of a coefficient of variation statistic that is not dependent upon the normality assumption? And, is this what one may call a non-parametric CV?


Psionic Spells is a 1st level Aberrant Mind Sorcerer feature that gives a fixed list of spells known at specific levels, and on 1st level the feature gives arms of Hadar, dissonant whispers, and mind sliver. This feature also has the following rule for replacing spells from the Psionic Spells list:  Whenever you gain a sorcerer level, you can replace one spell you gained from this feature with another spell of the same level. The new spell must be a divination or an enchantment spell from the sorcerer, warlock, or wizard spell list.  Given you gain a level at 1st level, and given you gain this feature at 1st level, does that mean you could then replace one spell gained from the Psionic Spells list with another spell at 1st level? (i.e. arms of Hadar for Tasha's hideous laughter) (In my very specific case I'm multiclassing into Sorcerer; if that matters.)

Assume a Divine Soul Sorcerer. The spellcasting feature of the class states (highlight mine):  Additionally, when you gain a level in this class, you can choose one of the sorcerer spells you know and replace it with another spell from the sorcerer spell list, which also must be of a level for which you have spell slots.  Can I do this when I gain level 1 in the class? Let's say I choose the affinity good, which gives me the cleric spell "Cure Wounds" because of the Divine Magic feature:  Your link to the divine allows you to learn spells from the cleric class. When your Spellcasting feature lets you learn or replace a sorcerer cantrip or a sorcerer spell of 1st level or higher, you can choose the new spell from the cleric spell list or the sorcerer spell list. You must otherwise obey all the restrictions for selecting the spell, and it becomes a sorcerer spell for you. In addition, choose an affinity for the source of your divine power: good, evil, law, chaos, or neutrality. You learn an additional spell based on that affinity, as shown below. It is a sorcerer spell for you, but it doesn't count against your number of sorcerer spells known. If you later replace this spell, you must replace it with a spell from the cleric spell list.  If my class allows me to replace a spell when I gain Level 1, then the Divine Magic would allow me to replace the "Cure Wounds" with for example "Guiding Bolt". Now intuitively I would say no, because Level 1 is the first level and you can't have less, so you don't "gain" it. However some features explicitly state "Starting at 1st level", for example the feature "Favored by the Gods" from the same Divine Soul Sorcerer. This does hint to me that there might be a "gaining" of 1st level, otherwise this extra wouldn't be necessary.  Starting at 1st level, divine power guards your destiny. If you fail a saving throw or miss with an attack roll, you can roll 2d4 and add it to the total, possibly changing the outcome. Once you use this feature, you can't use it again until you finish a short or long rest.  Bonus question: Is it any different if I multiclass into sorcerer and my first Divine Soul Sorcerer level is not my first character level?