When the directory contains lots of files (that is, the scroll bar is showing), if I double-click a directory to navigate into and then go back to the previous directory, Windows File Explorer does not maintain the original scrolling position, but the directory I had clicked gets placed at the end of the listing.  For example, in the screenshot below, I was viewing C:\Windows, and then navigated into C:\Windows\ShellComponents, and then went back to C:\Windows. Note that the ShellComponents was originally in the middle (left image), but now is at the bottom (right image).  This behaviour is very annoying when I have to search the sub-directories. Is this a bug or an intended behaviour? Can I force it to keep the previous scrolling position?   ->

I'm running Windows 7 Ultimate 64-bit and I'm having some weird behavior. In Windows Explorer, I'm viewing a directory with lots of sub-directories in "Details" view. I'm scrolled down a bit (see 1st screenshot).    I enter a sub-directory (in this case, KDiff3) via double-click, then navigate back via the back button. Now, Windows Explorer has forgotten its original vertical scroll position. It's still highlighting the sub-directory I just came from, but now it's scrolled so that that sub-directory is all the way down (see 2nd screenshot).    I've never experienced this behavior before and it's a bit of a pain. Does anybody know how to fix this?


In a Q&A on this site I recall @KHibma pointing out where in the ArcGIS Pro Help any changes to the syntax (like extra parameters) of a particular tool/function since ArcGIS Pro 1.0.0 could be found.  I have searched hard to try and relocate that Q&A without success so, if my recollection is correct, can anyone point me at where to find that documentation or that Q&A (which this will be a duplicate of)?

I have a suspicion that  has one more parameter at ArcGIS Pro 2.1.2 than it did at ArcGIS Pro 2.0.  Is the ArcGIS Pro 2.0 Help still available online to check this?  I would have expected to find it linked at the  page like the old documentation for ArcMap is.


Prove that for any natural number n the following equality holds:   $$ (1+2+ \ldots + n)^2 = 1^3 + 2^3 + \ldots + n^3 $$  I think it has something to do with induction?

How can I prove that     $$1^3+ 2^3 + \cdots + n^3 = \left(\frac{n(n+1)}{2}\right)^2$$    for all $n \in \mathbb{N}$? I am looking for a proof using mathematical induction.  Thanks


I need to select n records at random from a set of N (where 0 < n < N).  A possible algorithm is:     Iterate through the list and for each element, make the probability of selection = (number needed) / (number left)      So if you had 40 items, the first would have a 5/40 chance of being selected.      If it is, the next has a 4/39 chance, otherwise it has a 5/39 chance. By the time you get to the end   you will have your 5 items, and often you'll have all of them before that.   Assuming a good pseudo-random number generator, is this algorithm correct?    NOTE  There're many questions of this kind on stackoverflow (a lot of them are marked as duplicates of ).  The above algorithm is often proposed (e.g. 's answer) and it's always questioned (e.g. see , , , ...).  Can I have a final word about the matter?

Say I have a linked list of numbers of length N. N is very large and I don’t know in advance the exact value of N.   How can I most efficiently write a function that will return k completely random numbers from the list?


I was using pscp to copy files from a Windows machine to a Linux machine. I accidentally got the path wrong and now there are files that I can't seem to remove. I think it is because of the slashes in the name... It is telling me the file or directory doesn't exist. I am attaching a photo. Thanks!

I somehow managed to create a file that doesn't seem to have a filename. I found some information regarding how to get more details of the file in the following   However, I tried some of the suggestions listed and can't seem to delete the file. I'm not sure what I did to create it, but it happened while trying to copy an xml file.   Some info on the file is as follows;  > ls -lb total 296 -rw-r--r--   1 voyager  endeavor  137627 Jan 12 12:49 \177  > file * :               XML document  > ls -i  417777      I tried to find using the inum switch and then pipe that to rm as that seemed like the most foolproof way of getting rid of it. However, the example given at the bottom of the thread linked below failed for me. Example was:  > find -inum 41777 -exec ls -al {} \; find: illegal option -- i find: [-H | -L] path-list predicate-list   so I tried using the path list first like the following, but that didn't work either:  > find . -inum 41777 -exec ls -al {} \;   I'm not sure what the non-printable character \177 is or how I can pass that to an rm command, but I really want to make sure I don't mess up any other files/directories in my attempt to delete this file.


What's faster: a warp drive from Star Trek, or a hyperdrive from Star Wars?

As far as I can tell, both universes have equally objective ideas of speed.  Do we know how fast the two ships, Millennium Falcon and USS Enterprise-D, can go?  Which is faster?


If you take this picture of a telescope   It has several gaps through it. My lecturer was mentioning how as long as the holes and imperfections in your disk are less than the wavelength of light you are observing, they can be ignored. He said the telescope shown above was used to measure hydrogen line emissions with wavelength of about 20cm. My question is, if the gaps are about a few cm wide, wont the incoming light diffract?   Is it just that the gaps and imperfections are significantly smaller than the the wavelength so there is no diffraction and just reflection?

Radio telescopes use wire mesh to save cost. How does that work? Won't the waves go through the gaps?


In python, I have code that needs to be triggered and the top of every minute.  I have a while loop.  What is the best why to watch the time and when a new minute start then execute?  Thanks    while True:    if TOP_OF_MIN:         run_code()

I want to repeatedly execute a function in Python every 60 seconds forever (just like an  in Objective C). This code will run as a daemon and is effectively like calling the python script every minute using a cron, but without requiring that to be set up by the user.  In , the solution appears to effectively just  for x seconds. I don't need such advanced functionality so perhaps something like this would work  while True:     # Code executed here     time.sleep(60)   Are there any foreseeable problems with this code?


I use some suggestion over this site but I found NullPointerException at this line:  policy.createFooter(XWPFHeaderFooterPolicy.DEFAULT, parsFooter);

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


I have a static method in a non static class. I would like to use this keyword in this static method.  Or is there another implementation that is similar to this.

I'm trying to use the this keyword in a static method, but the compiler won't allow me to use it.  Why not?


I want to know if McAfee anti virus and firewall will work on Ubuntu 12.04.3 and if not what is recommended. I have noticed web pages locking and reporting FBI Virus. If Ubuntu is safe why does my browser lock until I restart my computer?

I thought that there was no need to scan for viruses either in Ubuntu or any Linux distros until I found virus scanner packages clamtk and klamav in Ubuntu software center yesterday.  This leads to the following questions:   How do viruses differ between Linux and Windows? How do the strategies for protection differ between Linux and Windows? Should a virus scanner package be installed on my system? If so, which would be a better option?


I have 2 domain. Domain No.1 contains a sitemap index: http://example1.com/sitemap-index.xml with content like this:  <sitemapindex> <sitemap> <loc>http://example1.com/0.xml</loc> <lastmod>2014-11-23</lastmod> </sitemap> <sitemap> <loc>http://example1.com/1.xml</loc> <lastmod>2014-11-23</lastmod> </sitemap> </sitemapindex>   And domain No.2 contains sitemaps (http://example2.com/0.xml, http://example2.com/1.xml, ...). I will submit http://example1.com/sitemap-index.xml to Google Webmaster Tools. Normally, I will save sitemap files to same domain but this time, I want to save sitemap files to the other domain? Will Google allow this?

I am using a "cloud" hosting provider (Heroku) to host my webapp. Since I don't have access to a permanent file system, I am storing my sitemap.xml in Amazon S3.  I wanted to know the SEO implications of the following 2 options for submitting the sitemap to search engines (Google & Bing) via their webmaster tools:  1) Create on endpoint on my domain:  that performs a 301 redirect to the S3 hosted sitemap.  Provide the url hosted on my domain to the search engines. This is the option I am currently using. It seems to work fine with Google, but I noticed a "sitemap error" with Bing - I am monitoring this as I am not yet sure what the cause is.  2) Apparently, there is a way to do "cross domain" sitemap submission whereby I get the S3 URL approved by the search engine, then I can directly submit the S3 url as my sitemap.  Also I am currently pointing the sitemap entry in robots.txt to the sitemap url hosted on my domain (not to S3).  Is one of these methods preferred from an SEO perspective? Like I said, I am using option (1) but I want to be somewhat confident that the crawlers will be OK with the HTTP 301 that I'm using.


i spend hole day on looking what is going on. In one class I've got simple listview with multiple choice. At the end each choice is put to String array and share to next class.  SparseBooleanArray checked = listView.getCheckedItemPositions();         ArrayList<String> selectedItems = new ArrayList<String>();     for (int i = 0; i < checked.size(); i++) {         // Item position in adapter         int position = checked.keyAt(i);         // Add sport if it is checked i.e.) == TRUE!         if (checked.valueAt(i))             selectedItems.add(adapter.getItem(position));     }      String[] outputStrArr = new String[selectedItems.size()];      for (int i = 0; i < selectedItems.size(); i++) {         outputStrArr[i] = selectedItems.get(i);     }     Intent intent = new Intent(getApplicationContext(),             ReadComments.class);      // Create a bundle object     Bundle b = new Bundle();     b.putStringArray("selectedItems", outputStrArr);      // Add the bundle to the intent.     intent.putExtras(b);      // start the ResultActivity     startActivity(intent);   In ReadComments class i've made simple method:  public String[] tablica(){         Bundle b = getIntent().getExtras();         String[] resultArr = b.getStringArray("selectedItems");         return resultArr;      }   which bring back my data. When I put it to another method in the same class:  String resultArr[] = tablica();          int x = 0;         for (Map<String, String> mListaMar : mListaMarketow) {             lat = mListaMar.get(TAG_SZER);             longi = mListaMar.get(TAG_DLUG);             name = mListaMar.get(TAG_MARKET);             x=0;               for (x = 0; x < resultArr.length; x++) {                 if (resultArr[x] == name) {                      ustawMape();                     }}}        UstawMape() method is responsible for show marker on google map. My problem is a logical problem because everything is working fine but ustawMape() method should show many markers and right now it show only one (construcion of ustawMape() is ok because without for loop it's work ok). The clue is very simple first loop for bring data from JSON and the second one should filter and show only this which user choose in listView. PLZ help my somebody!!

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?


I have a problem that dual boot system did not set a date and time as usual when I set that date and time every time I login.

Dual boot system Windows XP Pro and Ubuntu 12.04.  I have the bios set for the correct time and Ubuntu set for US Eastern time.  Ubuntu will boot up and the time will be off by -4 hours.  If I correct the time in Ubuntu then when I boot up in Windows XP the time will be off by + 4 hours.  This is a fresh install of 12.04. I did not have this problem before reinstalling Ubuntu.


For the sequence $ a_n=\dfrac{2^n}{n!} $, is there a way to show that the $\lim_{n \to \infty }\dfrac{2^n}{n!}=0$? I know that it is bounded above by $2$ because it is a decreasing sequence. I also know that the closest number it will every get to is $0$ because it won't be negative. However, is there a way of showing that the limit goes to $0$?

Why is     $$\lim_{n \to \infty} \frac{2^n}{n!}=0\text{ ?}$$   Can we generalize it to any exponent $x \in \Bbb R$? This is to say, is     $$\lim_{n \to \infty} \frac{x^n}{n!}=0\text{ ?}$$     This is being repurposed in an effort to cut down on duplicates, see here: Coping with  duplicate questions.  and here: .


The first function(widget_cancel) is used to remove the widgets from a gui using tkinter. The second function is used to create the labels and entry widgets in the gui. The problem that I am facing is that despite globally declaring the variable names in the second function(adding) …I seem to be getting a error while calling the first function(widget_cancel), the error is below this code and I have tried .destroy() too but it doesnt seem to work THE CODE IS: def widget_cancel():      Username.place_forget()    def ADDING():       global Username,passw,addrss,emil,lblfrstrow,lblsecrow,lblrdrow,lblfrtrow,lblfifrow,lblsixrow,ag,imagecalen,okbtn,submitbtn      # Definging the first row      lblfrstrow = tk.Label(root, text ="Username -", )      lblfrstrow.place(x = 50, y = 20)       Username = tk.Entry(root, width = 35)      Username.place(x = 150, y = 20, width = 100)                  lblsecrow = tk.Label(root, text ="Password -")      lblsecrow.place(x = 50, y = 50)                 passw = tk.Entry(root, show="*", width = 35)      passw.place(x = 150, y = 50, width = 100)                 lblrdrow = tk.Label(root, text ="address -", )      lblrdrow.place(x = 50, y = 70)       addrss = tk.Entry(root, width = 35)      addrss.place(x = 150, y = 70, width = 100)       lblfrtrow = tk.Label(root, text ="DOB -", )      lblfrtrow.place(x = 50, y = 90)       lblfifrow = Label(root, text ="email -", )      lblfifrow.place(x = 50, y = 110)       emil = tk.Entry(root, width = 35)      emil.place(x = 150, y = 110, width = 100)       lblsixrow = tk.Label(root, text ="age -", )      lblsixrow.place(x = 50, y = 130)            ag = tk.Entry(root, width = 35)      ag.place(x = 150, y = 130, width = 100)               imagecalen= Button(root, text ="c",                                 bg ='blue', command = image)     imagecalen.place(x=130, y=90, width = 10)      okbtn = Button(root, text ="ok",                                 bg ='white', command = rom)      okbtn.place(x = 150, y = 230, width = 55)        submitbtn = Button(root, text ="Submit",                                 bg ='blue', command = submit)      submitbtn.place(x = 150, y = 320, width = 55)  THE ERROR IM GETTING IS:  Username.place_forget() NameError: name 'Username' is not defined  How do I resolve this...thanks in advance...btw in writing the code in sublime text editor and running it on git bash

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


In the warlock spell list, it says that they have 9th level spells, but they only get up to 5th level spell slots. How does that work?

Instead of a “Spell Slots for Spell Level” table, the warlock just has two columns: one for number of slots and one for slot level, because all of their slots are the same level.   However, the table on PHB p. 106 only goes up to the 5th slot level. It looks like the higher levels are misprinted as they should go up to 9th level slots (as the warlock's spell list has spells of 6th, 7th, 8th, and 9th levels). What is the correct progression? Is a warlock’s slot level the same as the maximum slot level of a wizard of the same class level?


I have a hair particle group, that takes buildings from a building group, and places them on a grid. This works perfectly fine. I recently added an emitter system to each of the buildings in the building group to show random lit windows. It shows perfectly fine in the preview when looking at the group of buildings, but when looking at the hair particle system, the buildings show as usual, but the emitter doesn't work. There are a few other buildings using the same emitter system in the scene that are not in the building group, which the emitter system is working fine.   It works fine if I convert the emitter system, but is not ideal. Is there a way to get this nested particle system to work, without converting?  Thanks in advance.

I have a seed object with some particle hair strands. I've specified this object to be instanced in another particle system, then specified that object to be instanced in yet another particle system.  To clarify:      I have a cube with hairs strands I have a Suzanne coated in cubes with hair strands (the hair strands only appear in the render, which is fine) I have another Suzanne coated in Suzannes, but these Suzannes don't have cubes or strands like I was hoping..     Is there a way to get the particle systems to keep recursing, so that the last Suzanne is coated in Suzannes coated in cubes coated in strands?


Can someone please decipher into common language this wheel/tire info? Rough wheel dimns (by measurement) apprx 57 cm largest dia. x 25mm apprx rim width. To fit H/E rim? Tyre fitted Kenda K898-005 54-359. I want to fit thinnest road tyres (slicks?) on these rims.  Please advise ('cos I'm not even sure of the wheel size in lay language) thanks Peter

I tried getting a good measurement with my caliper, but the flexibility of the tire doesn't help much. Let's say I have a 26"x2.125" tire. I know this fits on an ISO 559mm bead seat diameter rim, and 26" = 660.4mm. 26":  The OD of the tire including the tread? The OD of the tire excluding the tread? When aired up or deflated? Means it fits a 559mm ISO BSD None of the above?  2.125":  Width of tread? Width of sidewall? Inflated or deflated?  Essentially, I'm converting the tire sizes to "height off rim in mm" and drawing them with a wheel in a web application, so I need to know how "tire size" translates to this measurement. I'm somewhat assuming that the fractional sizes can be converted to the same measurement, but I'm aware that they have certain differences - so any help there would be of value as well.  has been helpful, but still leaves me with the questions above.


I am trying to prove the following identity: $$B_n(1-x)=(-1)^nB_n(x)$$  I know that $$B_n(1-x)=\sum_{k=0}^n\binom n k B_n\cdot (1-x)^{n-k}$$ (I do not know how to write here exactly what I want. So I mean that $(1-x)$ in degree $(n-k)$).  Hence $$B_n(1-x)=\sum_{k=0}^n\binom n k B_n \sum_{i=0}^{n-k}\binom{n-k}{i} (-1)^ix^i$$  Hope, you understand what I mean. Thanks for attention!

Consider the Bernoulli polynomials $B_n(x)$ given by the expansion  $$\frac{te^{xt}}{e^t-1} = \sum\limits_{n=0}^{\infty}B_n(x)\frac{t^n}{n!}.$$  I want to prove the identity $$B_n(1-x)=(-1)^nB_n(x).$$  This formula is given in a lot of books, but unfortunately without any proof. Therefore I'm wondering how to prove it. Do you have any idea?  I tried for instance:  $\sum\limits_{n=0}^{\infty}B_n(1-x)\frac{t^n}{n!}=\frac{te^{-xt}}{e^t-1}e^t=\left(\sum\limits_{n=0}^{\infty}B_n(-x)\frac{t^n}{n!}\right)\sum\limits_{n=0}^{\infty}\frac{t^n}{n!}=\sum\limits_{n=0}^{\infty}\left(\sum\limits_{l=0}^n\binom{n}{l}B_{l}(-x)  \right)\frac{t^n}{n!}$.  Hence  $B_n(1-x)=\sum\limits_{l=0}^n\binom{n}{l}B_{l}(-x)$.  But I do not know how to proceed.  On the other hand I know that $B_n(x+1)-B_n(x)=n x^{n-1}$. Hence  $B_{n}(1-x)=B_{n}(-x)-n(-x)^{n-1}$. But again, I do not know how I can go further.   Hopefully someone can help me.  Best regards


While editing a post in mobile web I'm not seeing the Cancel button:        Full web has it:

I know from experience that editing a post from a mobile device is not the easiest task.  When editing a post tonight, I decided I'd like to cancel the edit. However, there was no "cancel" link. There is one on the full site (presumably a result of ).  I think it would be rather convenient if we had a cancel link on the mobile version of the edit page.


I've searched the net for it, but couldn't find any method for LaTeX. Is it possible to make insert an image rounded by text? Like this strawberry?  \documentclass[a4paper]{article}  \usepackage[english]{babel} \usepackage[utf8x]{inputenc} \usepackage{amsmath} \usepackage{graphicx}  \begin{document}  \end{document}   Kind regards Basilius Sapientia

How do insert image between text and text wrap with shapepar or other package?


After looking for the new chapter of One Piece, I came across . Here they said     The second week of august marks the annual summer break from the publisher Shueisha.   Remembering the golden week from begin May, it made me wonder what other annual breaks mangakas have and when we shouldn't expect a new release to come out.

What are the instances that there is no manga (like Naruto, Bleach and One Peace) release? Are there certain events that prevent them from releasing? Then what are these events (aside from taking a break)? Is there some sort of calendar of events for this?.


How do I adjust the Time & Date manually via terminal (CLI) on Ubuntu 14.04?

When I go to change the date and time it doesn't work. I try to unlock but it just won't unlock. If there is any way to make it work please help.  I know it isn't very descriptive but I really would appreciate some answers.


I am trying to debug some .htaccess problems on Apache but I am new to mod_rewrite.c. I would like to know whether I need to restart Apache in XAMPP whenever I make modifications to the .htaccess files, or whether these are parsed and applied whenever a web page is served independently of whether Apache is restarted.

I have pushed my .htaccess files to the production severs, but they don't work. Would a restart be the next step, or should I check something else.


I used the command  mv folder_name ....   I thought by using .. twice, it would move it back two folders.   Unfortunately my files disappeared.   I need to recover them.

I was attempting to utilize the mv command to move a file onto a remote server. I ended up executing the command...  mv sqlreport.php myuser@mywebsite.org   Unfortunately, this did not work. Worse, my file seems to have disappeared. A new file, myuser@mywebsite.org, has appeared, but it is not a directory (In that I cannot cd into it).  Any tips on where my file may have gone, and how to rescue it?


When there are many suggested edits in the queue, a random selection of them is shown.  This is more annoying than useful, but there's a case when it's especially annoying: if someone edits both a tag wiki and the corresponding excerpt, the two are not shown together to reviewers. This leads to extra reviewing effort.  Please ensure that suggested edits to a tag wiki and the corresponding excerpt are always shown together. (Keep allowing different decisions, of course.)  I guess this feature request won't be implemented until the new  UI comes out, but please do make sure it's done there.

At the moment, in major part because they are two separate post objects in the system, the excerpt and the body of a tag wiki count as two separate posts with regards to suggested edits in the queue. Mechanically, this is sane, but when it comes to handling the actual queue, it can be confusing. A body edit might consist of little more than a bed of links, which looks bad. But then an excerpt is shown that includes the rest of the data, and since excerpts can be included on the actual wiki page, it makes a lot more sense when they're taken in the same space.  And this is how they are composed, too. The actual edit interface for working on tag wikis has both the excerpt and the body on the same page. In a sense, the excerpt behaves a lot like the "title" of the wiki, if we make a parallel to normal post edits.  Thus, my suggestion (which is to say a suggestion that I repossessed from Robert Cartaino) is that when suggested edits are reviewed for tag wikis, that they be presented in a single unit, treating the excerpt the same as how a title is treated in a question edit. This way, relevant information that is crossed between the two isn't lost because they are reviewed separately.


I briefly helped out a friend, who has an HP laptop (not new). I saw she had a start button for her Windows 8 floating in the corner of her desktop. Is this something HP provided? I didn't get a chance to investigate and I'm pretty sure she didn't download a third-party program.

I just bought a new Windows 8 laptop, but I want to get rid of the new "Modern UI" Start Screen, and get the old Start Menu back. How do I do this?


Let $A, B\in M_n(\mathbb{C})$ s.t. $AB=BA$. Show that the eigenvalues of $A+B$ is the sum of eigenvalues of $A$ and $B$.   First I tried to find a counterexample and I found out this property without proof.

Suppose $A$ and $B$ are two commuting square matrices over an algebraically closed field. It is true that the spectrum of $A+B$ is contained in the set $\{\lambda_1+\lambda_2:\lambda_1 \in \sigma(A), \lambda_2 \in \sigma(B)\}$ where $\sigma(A)$ denotes the spectrum of $A$?  If so, can you provide a reference for this? can more be said?  Thanks


I'm trying to use a 3.5 jack microphone in Ubuntu 14.04, the problem is that Ubuntu doesn't have noise suppression by default, so I got a very loud static noise.   I installed libwebrtc-audio-processing-0 and libwebrtc-audio-processing-dev and tried to activate it using pactl load-module module-echo-cancel aec_method=WebRTC, but I got an error:     Failure: Module initialization failed  I also tried to enable it in /etc/pulse/default.pa with:  load-module module-echo-cancel source_name=echosource aec_method=webrtc set-default-source echosource   But it makes the sound applet crash, and doesn't work anyway.   How I can make this work?

Is it possible to do realtime noise-removal with PulseAudio, so the sound output that's coming out is smoother?


I hope you're doing great. I want to set the color properties (for example blue) of the cite command in Beamer (citep and citet) but I don't know how. How can I do it? That is my code.  \documentclass[xcolor=dvipsnames,t]{beamer} \definecolor{mikadoyellow}{rgb}{1.0, 0.77, 0.05} \definecolor{yaleblue}{rgb}{0.06, 0.3, 0.57} \usetheme{warsaw} \usefonttheme{serif} \setbeamerfont{section in head/foot}{family=\sffamily} \setbeamerfont{subsection in head/foot}{family=\sffamily} \setbeamerfont{author in head/foot}{family=\sffamily} \setbeamerfont{title in head/foot}{family=\sffamily} \setbeamercolor*{palette primary}{use=structure,fg=black,bg=red} \setbeamercolor*{palette quaternary}{fg=white,bg=black} %\usepackage[spanish]{babel} \usepackage{multirow} \usepackage{ragged2e} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{gensymb} \usepackage{xcolor} \usepackage{hyperref} \justifying \usefonttheme{professionalfonts} \usepackage[none]{hyphenat} \usepackage{cancel} \usepackage{tikz} \usepackage[round]{natbib} \usepackage{color} \usepackage{colortbl} %\let\oldcite=\citet %\let\oldcite=\citep  %\renewcommand{\citet}[1]{\textcolor[rgb]{0,0,1}{\oldcite{#1}}} %\renewcommand{\citep}[1]{\textcolor[rgb]{0,0,1}{\oldcite{#1}}}  %\def\@citet#1#2{{\hypersetup{linkcolor=blue!black}[{#1\if@tempswa , #2\fi}]}}  \newcommand{\textunderscript}[1]{$_{\text{#1}}$} \setbeamersize{text margin left=20pt,text margin right=20pt}  \title[Title 2]{Title}    \author{Author}  \date{\today}   \begin{document} \sloppy { \addtobeamertemplate{headline}{% \setbeamercolor{section in head/foot}{use=palette quaternary, fg=palette     quaternary.bg} }{} \begin{frame} \titlepage \end{frame} } %-------------------------START----------------------------   \section{Problem definition} \subsection{Introduction} \frame{ \citep{Ansari2014} and \citet{Ansari2014} }    \begin{frame}[allowframebreaks] \bibliographystyle{apalike} \bibliography{ref_qualify} \end{frame} \end{document}   Thanks in advance

I'm using natbib for citation with a custom bibstyle. I'm working on a presentation using LaTeX beamer and for some reason the citation marker doesn't have the colour that is specified to hyperref. The citation marker is black instead of green. I'll give you a MWE:    \documentclass{beamer} \hypersetup{   colorlinks,   citecolor=green,   linkcolor=red }  \usepackage{filecontents} \begin{filecontents}{mybib.bib} @ARTICLE{Bar2011,   author = {F. Foo and F. Bar},   title = {Foo and Bar},   journal = {Journal of Foo},   year = {2011},   volume = {1},   pages = {1--3} } \end{filecontents}  \usepackage[comma,numbers,sort&compress]{natbib} \bibliographystyle{plain}  \begin{document} Dummy referefence to~\cite{Bar2011} \bibliography{mybib} \end{document}   For the purpose of the MWE I have selected the plain bibstyle, however, changing that to something else (including the custom style I want to use) doesn't affect the label colour.    Is there any patch for this problem?


Both  and  return about 3-4m hits on Google. Though with the latter, Google asks me "Did you mean: so damn difficult".   Ngrams:

I know Americans commonly use "damn" or "damned" to describe things. Sometimes, more appropriately, it's even "darn" or "darned". For example,  This damn/damned computer is too slow.  However, I can't wrap my head around when to use "damn" and when to use "damned". Or is only one of them correct?


This question is relevant to  I posted earlier. (I thought it would be better to post it separately. But if not, please let me know.)  I learned from  that the shell built-in commands are treated specially and normal external commands are executed on child process.  This time, I would like to trace system calls such as fork, clone, or execve to monitor what really happened after typing command. But I can only trace an execve call execve("bin/ls",,,) = 0 when I execute strace like this way.  strace -etrace=execve,clone ls   That means, as I guess, I can only monitor system calls which are called after a child process is created.   To monitor all system calls related to creating new process, What I have to do? To invoke command with bash -c like strace -etrace=execve,clone bash -c '{ ls; }'  would be helpful in this case?

Inspired by this question, titled: , while attempting to answer this I tried the following command and was a bit surprised that I couldn't run it:  $ strace cd $HOME   Is there a method I can make use of to run strace for the builtin commands to Bash?


I can't start bounty on questions on child metas. How to promote them then? I think it is better do so as I can offer a bounty on it, points for which will be deducted from my main reputation.

If I want to draw people's attention to a post on a child meta site, how can I do that? I want to get people  over at Area 51 to see what they think of the idea, because it requires opinions from the community. However, posts on the discussion zone of Area 51 rarely get activity, so it seems like I'm out of luck, unless something is changed. And from the sounds of , it seems like this is a problem on all child metas.  That post is similar, but while it talks about increasing activity in general, I am talking about how to raise participation to an individual post; the equivalent of a bounty  I can't use bounties because reputation is the same.   Could there be another way of drawing attention to individual posts?


I don't have any of the specified documents for travelling to Nepal as an identity proof. Can I use an  instead as proof of identity?

I'm a citizen of India and I'm travelling to Nepal by air. Is an Aadhaar Card a valid document used for travelling to Nepal by air?


my friend has LG G3, recently updated to Android 6.0 Marshmallow and he gets -504 error code when he tries to install official Facebook app. I even tried to download .apk and tried multiple version but no progress. It doesn't looks like it's a gateway problem and he's pretty desperate. I looked at some answers and tried removing cache etc. but nothing has solved the problem. I look for any help. Thanks very much for any reply. -Feldrod

Yes. I've read all other questions regarding this problem. Like this one:  It's the same problem as this one but with more background information and an other app:   The details: My device is an Ulefone Be Touch 2 running Android 5.0.  My connection is perfect. To be sure I tried different networks, among them are 3G, 4G and wifi on ADSL, VDSL, cable and fiber. I've also used Tor and 3 different VPN providers in 3 countries on 2 continents. Let's say I ruled the network out.   A single app does not install: OpenKeychain.  Currently I have 126 apps installed. It does not install via desktop browser > play store > install button.    I have enough free space (40GB). The app is 7MB.   Re-adding Google account and clearing caches did not work.    Even a complete device wipe and re-install didn't work.     Downloaded the apk and tried manual installation, same error.   I also own a Nexus 7 (2013 wifi) and the app installs fine on that device.


The redshift effect must work on all frequencies, so blue would be shifted down to some lower frequency, and ultra violet would be shifted down also, into the visible area. How would you know what part of the (pre-redshifted) spectrum you were looking at?

Doppler redshift of distant galaxies gave first hint that the universe is expanding. I am curious to know how this redshift is actually measured and interpreted from observation. Suppose I observe some  visible line say red with wavelength \lambda_1.  This is not enough to tell that this line is redshifted, i.e., the  original line emitted from that galaxy had a smaller wavelength. How do I know the value of that particular line when it was emitted from that galaxy? It appears that mere observation of a line is not enough. So how do we proceed?


So im rather new this whole linux stuff but i took a pc and installed 18.04 on it. after using that for a while i decided that i wanted a change in scenery so i upgraded to 19.10 since that was the version it told me was the latest... this all went fine, no complications at all. later on i was on my normal pc that runs windows and i made an ubuntu vm out of sheer boredom and saw that 20.04 was actually the latest release when i was looking for an iso as the one i had was still 18.04. so when i went back on to 19.10 machine i thought i would be as simple it was upgrading from 18.04, but boy was i wrong. the only error ive really gotten is "This version no longer supported. Please install a supported version." anyone have any ideas?

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


I'm working on my first game, and taking the opportunity to brush up my C++ (I want to make as much of it as portable as I can.)  Whilst working on the technology tree and how it affects actors (spaceships, planets, crew, buildings, etc) I can't find a pattern that decouples these entities enough to feel like a clean approach.  Just as an idea, here's the type of effects these actors can have on one another (and techs too)   An engineer inside a spaceship boosts its shield A hero in a spaceship in a fleet increases morale A technology improves spaceships' travel distance A building in a planet improves its production   The best I can come up with is the Observer pattern, and basically manage it more or less manually (when a crew member enters a spaceship, fire the event; when a new building is built in a planet, fire the event, etc etc.) but it seems to be too tightly coupled to me.  I would love to get some ideas about how to approach this better.

Overview:  Lots of games with RPG-like statistics allow for character "buffs", ranging from simple "Deal 25% extra damage" to more complicated things like "Deal 15 damage back to attackers when hit."  The specifics of each type of buff aren't really relevant.  I'm looking for a (presumably object-oriented) way to handle arbitrary buffs.  Details:  In my particular case, I have multiple characters in a turn-based battle environment, so I envisioned buffs being tied to events like "OnTurnStart", "OnReceiveDamage", etc.  Perhaps each buff is a subclass of a main Buff abstract class, where only the relevant events are overloaded.  Then each character could have a vector of buffs currently applied.  Does this solution make sense?  I can certainly see dozens of event types being necessary, it feels like making a new subclass for each buff is overkill, and it doesn't seem to allow for any buff "interactions".  That is, if I wanted to implement a cap on damage boosts so that even if you had 10 different buffs which all give 25% extra damage, you only do 100% extra instead of 250% extra.  And there's more complicated situations that ideally I could control.  I'm sure everyone can come up with examples of how more sophisticated buffs can potentially interact with each other in a way that as a game developer I may not want.  As a relatively inexperienced C++ programmer (I generally have used C in embedded systems), I feel like my solution is simplistic and probably doesn't take full advantage of the object-oriented language.  Thoughts?  Has anyone here designed a fairly robust buff system before?  Edit: Regarding Answer(s):  I selected an answer primarily based on good detail and a solid answer to the question I asked, but reading the responses gave me some more insight.  Perhaps unsurprisingly, the different systems or tweaked systems seem to apply better to certain situations.  What system works best for my game will depend on the types, variance, and number of buffs I intend to be able to apply.  For a game like Diablo 3 (mentioned below), where nearly any bit of equipment can change a buff's strength, the buffs are just character stats system seems like a good idea whenever possible.  For the turn-based situation I'm in, the event-based approach may be more suitable.  In any case, I'm still hoping someone comes along with a fancy "OO" magic bullet which will allow for me to apply a +2 move distance per turn buff, a deal 50% of damage taken back to the attacker buff, and a automatically teleport to a nearby tile when attacked from 3 or more tiles away buff in a single system without turning a +5 strength buff into its own subclass.  I think the closest thing is the answer I marked, but the floor is still open.  Thanks to everyone for the input.


This is one of the basic properties of modular arithmetic: $$a\equiv b \pmod m \Longleftrightarrow \dfrac{a}{\gcd(a,b)}\equiv \dfrac{b}{\gcd(a,b)} \pmod{ \dfrac{m}{\gcd(m,\gcd(a,b))}}.$$ How would I prove it rigorously?

I'm having some trouble proving the following proposition:  Let $m \in \mathbb N$ and $a,b,k \in \mathbb Z$, then: $$ka \equiv kb \pmod{m} \iff a \equiv b \pmod{\frac{m}{\gcd(k,m)}}$$  I began by trying to prove that $a \equiv b \pmod{\frac{m}{\gcd(k,m)}} \implies ka \equiv kb \pmod{m}$ but I got stuck with: $$a\gcd(k,m) \equiv b \gcd(k,m) \pmod{n}$$ Then I also tried to prove that $ka \equiv kb \pmod{m} \implies a \equiv b \pmod{\frac{m}{\gcd(k,m)}}$ But I also was not able to conclude anything. This is my first time learning modular arithmetic and I'm still confused with the concepts and have no intuition with this at all, this is perhaps why I'm having some trouble solving these types of questions. How can I prove this?


I started studying c programing.while learning some basic programs I got a doubt that why we r using "return 0" at the end of the program even if I am not writing that return 0 also I am getting correct outputs ( for basic programs). I want to know... 1) what is the need of using? 2)if we won't write what will happend?

What is the correct (most efficient) way to define the main() function in C and C++ — int main() or void main() — and why? And how about the arguments? If int main() then return 1 or return 0?  There are numerous duplicates of this question, including:       — For C++, with a very good answer indeed.     Related:


I want the confirm dialog when I press the power button. It worked in 15.10. I tried tweaks tool and dconf editor, neither work. In dconf there are 2 entries one doesn't work, the other doesn't have an option for "interactive". Tweaks tool has the option, but it doesn't work.  Ubuntu Gnome 16.04 LTS on Asus zenbook ux305  Thank you

I am used to have an interactive menu when i press my power button, but since I recently installed GNOME 3.18, i found out that the only available actions for power button press are : "nothing", "suspend" and "hibernate".  In dconf-editor, there are two entries for this:  org.gnome.settings-daemon.plugins.power button-power org.gnome.settings-daemon.plugins.power power-button-action   The first one contains all options (hibernate, interactive, suspend, poweroff, nothing,..), but the second one contains only three (hibernate, suspend, nothing).  The problem is that it seems that GNOME uses the second entry (power-button-action).   Since i don't want to use hibernate, and suspend does not work on my computer (that's another issue), i'd like to map an interactive menu to be executed when power-button-action is set to hibernate.  The command for the interactive menu i want is:  gnome-session-quit --power-off   I run Ubuntu GNOME 16.04 LTS 64-bit with GNOME Shell 3.18.4 on a Dell Inspiron 3537.  More generaly, i would like to be able to display the interactive shutdown menu when pressing the power button (by any means necessary, no especially going through this way). I tried to map the power button to gnome-session-quit --power-off using the GNOME keyboard setting, but it doesn't seem to be triggered.  Thank you.


I am using Xubuntu 14.04. In the File Manager, the Date Modified column doesn't show the modification time. How can I make it display the time, along with the date?

The detail view of Thunar shows the modification time as localized date (dd.mm.YYYY for my location), which is fine, but I would like to see the time, too.   And it doesn't show the recently modified files in the same manner, butnew years new years  decorates them as 'yesterday, today, monday' and so on, which is a nice programming etude, but not really useful to me.   Au contraire - it is pretty annoying to have this mixture in the interface. The next version will look into my calender and mark some files 'easter 2007, moms birthday 2002' and 'third monday of last month'. Thank you!   But if ohters prefer it - I'm fine. I just want to know whether I can modify the setting somehow. This is Xubuntu 12.04 LTS, Thunar 1.2.3.


I've seen posts pop up every once in a while on virus coding, and I went to flag them, but I didn't see a category under which to do so. After further investigation, I've had no luck finding rules against it, so I presume this means that there are no rules against it (correct me if i'm wrong). So my question is, why is this allowed, is it even legal, and should we allow it?

I recently saw a question on Stack Overflow relating to the . The guy wasn't asking for code at all, meerly asking what the process involved.  It was immediately slapped with a comment directing him to the  (which after reading I still couldn't see why the asker was being directed there), and closed shortly thereafter as "Not a real question".  Since I asked this question, it has been suggested that the question was closed because the asker was asing whether he could ask a question, or because he may have been asking how to unlock his iPhone, where I assumed he was asking for the technical specifics of what happened. Both fair points, it may have been my mistake  As Brad has stated the question  received a very positive response. Another relevant question suggested by Brad, but received a negative response:   Now I know some people out there want to be the Stack Overflow Police, and some people are scared of questions that slightly hint at subversive or underhand methods, or that the asker is trying to do something illegal (either for the sake of the site, or for maintaining their own halos).  However in my opinion it is perfectly acceptable to ask about processes and methods, even in the areas of reverse engineering and programming practicies that are invariably used to exploit other software. Questions like "How do I crack software X?" are obviously unacceptable.  I'd like to know what the community thinks about this; what is your opinion?  Is it ok to ask about shady practices, for educational purposes, as long as they are non-specific (in terms of cacking a certain piece of software, or asking for code to unlock iPhones, etc.)


Consider the following set theoretical result of Schröder-Bernstein-Cantor:  Let $A$, $B$ be sets. Assume we have injections $f : A \rightarrow B$ and $g : B \rightarrow A$. Then there exists a bijection $h : A \rightarrow B$.  Although this fact seems obvious, its proof is not completely trivial (see  ) But what about the following statements?   Let $A$ and $B$ be finite-dimensional vector spaces. Assume we have monomorphisms $f : A \rightarrow B$ and $g : B \rightarrow A$. Then there exists an isomorphism $h : A \rightarrow B$. (true) Let $A$ and $B$ be vector spaces. Assume we have monomorphisms $f : A \rightarrow B$ and $g : B \rightarrow A$. Then there exists an isomorphism $h : A \rightarrow B$. (true?) Let $A$ and $B$ be Hilbert spaces. Assume we have monomorphisms $f : A \rightarrow B$ and $g : B \rightarrow A$. Then there exists an isomorphism $h : A \rightarrow B$. (true) Let $A$ and $B$ be groups. Assume we have monomorphisms $f : A \rightarrow B$ and $g : B \rightarrow A$. Then there exists an isomorphism $h : A \rightarrow B$. (true?)   How far can you generalize the original result of Schröder-Bernstein-Cantor, at least in categories where monomorphisms are injective and isomorphisms are bijective?

The Cantor-Bernstein-Schroeder theorem states that if there are two sets $A$ and $B$ such that there exist injective (alternatively, surjective, assuming choice I think) maps $A \to B$ and $B \to A$, then $A$ and $B$ are in bijection.  It then seems natural to try to strengthen the result to other structures.  If $A$ and $B$ are, say, groups (or rings, modules, etc) such that there are injective homomorphisms from each to the other, then $A$ and $B$ are isomorphic.  I'm wondering if there are any results on this, or if there are known counterexamples.  The theorem for sets alone is nontrivial, so I feel like any results about how it holds for other structures would be quite interesting.


How to draw this comutative diagrams in LaTeX

Can anyone help me in giving commands for commutative diagrams in LaTeX ? It doesn't seem to appear properly in the LaTeX guides that I have. A command for a simple triangular diagram with arrows associated to maps would be good enough, or maybe some appropriate reference.


I have a top of the Line (from bottom) Canon 1200D camera, 18-55 stock and 50mm 1.8. I want to spend on a Sigma 18-35 f/1.8 but some of my friends are suggesting to upgrade the camera first instead of going for this lens. Is it worth upgrading my camera first, or just go for a new Sigma ? I can spend upto $700.   I have gone through some questions too like  and  but i have a different camera model and I mostly shoot in low light, mostly random shots including portraits and landscapes. (Learning Phase). Thats why i was thinking to go for sigma 18-35 lens but on the other hand better camera body will have higher ISO noise reduction and higher dynamic range.

I have an entry-level Nikon DSLR, and I cant decide if I should upgrade my camera body or upgrade from a  AF-S DX Nikkor 18-200mm to whatever else might be recommended?


I have a lot of divs on my site.

   Now I want to select the div with jquery. But i only want the divs with the classe slide. And not the divs with the classe slide bx-clone.  How can i make that select statement?

In jQuery I need to do an if statement to see if $this doesn't contain the class '.selected'.  $(".thumbs").hover(function(){  $(this).stop().fadeTo("normal", 1.0); },function(){ $(this).stop().fadeTo("slow", 0.3);  });   Basically when this function is run (on hover) I don't want to perform the fades if the class '.selected' has been appended to the div, this will mean that the image will be at full opacity to signify that it's selected. Searched on Google to no luck even though it's a simple question of how to use an IF statement...


Spending most of my time in a backend, frontend isn't really my forte and my skills in debugging are next to none for it (aside from F12 trial-and-error).  I have created a list (for Google Maps purposes) from the data entered backend side.  As you can see, treybake2 has the email of: t.taylor@domain.co.uk - 21 characters.  treybake has an email of t.taylor@some-domain.co.uk - 26 characters.  Yet, the latter of the options (which has the longer email) seems to wrap how I'd expect whereas the shorter email address drops to a new line entirely.  Here is the markup for the tel/email section:

                  <?php echo $dealer->tel; ?>

                  <?php echo $dealer->email; ?>

   As you can see by the class names, it uses Bootstrap.  Here is, hopefully, the relevant CSS:  #dealer-list {     background: #f6f6f6;     height: 350px;     margin-bottom: 0;     margin-top: 0;     overflow-y: scroll;     padding: 20px 15px }  #dealer-list li {     background: #fff;     box-shadow: 2px 2px 0 rgba(0, 0, 0, .1);     font-size: 12px;     margin-bottom: 15px;     padding: 15px }  #dealer-list li div {     margin: 5px 0 }  div.no-padding {     padding: 0 }   I'm for the most-part, a scrub when it comes to frontend, and I can't really set up xdebug for this kinda thing xD  So, how do I begin to try and debug my span? Logically, if any were to drop to a new line, surely it would be treybake2? Why is the other way round?  Edit:  Forgot to put in my desired output: treybake is how I want all emails to be displayed.

I have a long string (a DNA sequence). It does not contain any whitespace character.  For example:  ACTGATCGAGCTGAAGCGCAGTGCGATGCTTCGATGATGCTGACGATGCTACGATGCGAGCATCTACGATCAGTCGATGTAGCTAGTAGCATGTAGTGA   What would be the CSS selector to force this text to be wrapped in a html:textarea or in a xul:textbox?


I am using static template members in a class; the templates are instantiated in a cpp built in a software. I have a plug-in for the software that uses the  name() template method in the header, but does not build the source file which contains the instantiation. The build works on Linux with g++-4.9 but fails on MinGW 4.8. I want to know how to make it work with the almost same compiler, but on Windows instead.  .hpp :   enum class ToplevelMenuElement {     FileMenu,      ...     AboutMenu };  enum class FileMenuElement {     New,     ... ,     Quit };  // Others menus macros are defined  class MenuInterface {     public:         template<typename MenuType>         static QString name(MenuType elt);      private:         static const std::map<ToplevelMenuElement, QString> m_map;         static const std::map<FileMenuElement, QString> m_fileMap; };   .cpp :   template<> QString MenuInterface::name(ToplevelMenuElement elt) {     return m_map.at(elt); }  template<> QString MenuInterface::name(FileMenuElement elt) {     return m_fileMap.at(elt); }  const std::map<ToplevelMenuElement, QString> MenuInterface::m_map {     {ToplevelMenuElement::FileMenu, QObject::tr("File")},     ...     {ToplevelMenuElement::AboutMenu, QObject::tr("About")} };  const std::map<FileMenuElement, QString> MenuInterface::m_fileMap {     {FileMenuElement::New, QObject::tr("New")},     ...,      {FileMenuElement::Quit, QObject::tr("Quit")} };   Error :  undefined reference to `QString MenuInterface::name<ToplevelMenuElement>(ToplevelMenuElement)'   Is there any flag to use to make some kind of lazy instantiation ? Or should I build the .cpp containing the template instantiation in my plug-in ?

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


Prior to Daenerys Targaryen announcing Gendry Baratheon as the Lord of Dragonstone, who was considered as the Lord of Dragonstone?   Based on the TV show, it was shown that Stannis Baratheon and his army were garrisoned at Dragonstone. After the death of Stannis (in the TV show), was there any indication with reference to who was Lord of Dragonstone?

Is anything known about Dragonstone after:      Stannis Baratheon is killed in his bid for the Iron Throne?   As the seat of the naval defense of King's Landing and the birthplace of Daenerys Targaryen, she has a vested interest in taking it.   At the conclusion of Season 6 Episode 10, is Dragonstone unoccupied?


I am trying to implement a version of map that is equivalent to Array.prototype.map using "for loop" and it works similarly yet in the end, it gives me something unusual.  My code is as below:  // the global Array  1. var s = [23, 65, 98, 5];  2. Array.prototype.myMap = function(callback){ 3.   var newArray = [];  4.  console.log(this); // prints 23,65,98,5 which is correct 5.  for(let element in this){ 6.    console.log(this[element]); // this line and the push doesn't work well 7.    newArray.push(callback(this[element])); 8.    console.log("element: " + newArray); 9.  } 10.    console.log("final: " + newArray); 11.  return newArray; 12. };  13. var new_s = s.myMap(function(item){ 14.     return item * 2; 15. });   `  The output of the code is as below:  23,65,98,5 23 elem: 46 65 elem: 46,130 98 elem: 46,130,196 5 elem: 46,130,196,10 function (callback) {   var newArray = [];    window.__console.log(this);   for (var element in this) {     window.__console.log(this[element]);     newArray.push(callback(this[element]));     window.__console.log("elem: " + newArray);   }   window.__console.log("final: " + newArray);   return newArray; } elem: 46,130,196,10,NaN final: 46,130,196,10,NaN   If you look, the final array is printing NaN because of adding the function(callback), but the strange thing is that after the line of declaring a newArray, which I am logging "this"(line 4), the function(callback) is not added. Can somebody please explain what happened and why it is added?  If instead of the for loop, I add the forEach loop it works properly, only with the for loop is that it acts weirdly. (this.forEach(a => newArray.push(callback(a)));)

I've been told not to use for...in with arrays in JavaScript. Why not?


I wanted to copy a file using cp, however, I happened to type rm and the file was deleted.  How can I recover it?  The file is stored in a mobile hard disk drive with FAT32 file system  I'm using Mac OS X  Hoping someone can help me!

Possible Duplicates:             I thought that all operating systems would merge folder content when being moved to the same location. Imagine my surprise when that didn't happen and I have hundreds, if not thousands of files that have gone missing and are nowhere to be found.  Because they were not "deleted" they are not in the trash bin.  I've tried to do some recovery using a program called stellarPheonix but after about a 24hour scan, it didn't recognize any of the raw files (.dng,.arw) as image files and so I couldn't see if they could be recovered. It also didn't show the directory structure, which would be handy.  I tried a quick scan, but all it showed was files that were still on the HD, not sure what the point of that is.  I've used recover 2000 on Win and it does a good job, does anyone know of anything that works quickly and reliably for this kind of file recovery. (I don't think I should have to do a sector-by=sector for this kind of file loss)


Hi all I am working on a citation for my whitepaper I used  to generate my .bib file. However I can't get the citation to show   Here is the code in my LaTeX file    \documentclass{article}   \usepackage{biblatex}   \addbibresource{References.bib}   \begin{document}  Someone must have found a simple solution  \cite{references}.  \printbibliography   \end{document}   Here is my References.bib file    @misc{references,    month = {09},    title = {bibliographies - How do I add "citations" at the end of the document as done here?},    url = {https://tex.stackexchange.com/questions/134180/how-do-i-add-citations-at-the-end-of-the-document-as-done-here},    urldate = {2020-05-01},    year = {2016},    organization = {TeX - LaTeX Stack Exchange}  }   Here is the output of the code    I am using ubuntu, texmaker and all files are in the same directory   Running F11 bibtex in TexMaker I get the following error  Process started   This is BibTeX, Version 0.99d (TeX Live 2017/Debian) The top-level auxiliary file: Using References-bib.aux I found no \citation commands---while reading file Using References-bib.aux I found no \bibdata command---while reading file Using References-bib.aux I found no \bibstyle command---while reading file Using References-bib.aux (There were 3 error messages)   Process exited with error(s)   I'm not sure if I am missing anything else THANKS ALL!!!

I've browsed the forums and found a number of posts that have addressed this issue, but none of the solutions seem to work for me. I have the following script that I just copied from the bibtex home page to get familiar with it. Instead of the citation number I get a question mark. I compile using Latex+Bibtex+Latex+Latex+PDFLatex+ViewPDF just as has been previously suggested and the problem persists.   \documentclass[11pt]{article} \usepackage{cite}  \begin{document}  \title{My Article} \author{Nobody Jr.} \date{Today} \maketitle  Blablabla said Nobody ~\cite{Nobody06}.  \bibliography{mybib} \bibliographystyle{plain} \end{document}   My bibliography (Bib.bbl)  @misc{ Nobody06, author = "Nobody Jr", title = "My Article", year = "2006" }    Looking at previous posts one thing that is concerning is that my .bbl looks empty as shown below. Further, I don't have a .blg  \begin{thebibliography}{}  \end{thebibliography}


In the last fifty years, eminent physicists have discovered that the physical parameters of our universe are fine tuned, which means that a slight change in these parameters would render life as we know it impossible. Thus, the probability is very low that a universe with random values of these parameters has life as we know it.        This has led theists to argue that the physical parameters of our universe must have been deliberately selected by God to produce life. Atheists counter that, if there are an unlimited number of other universes then, regardless of how low the probability of life in any particular universe is, life must be found in at least one universe, and we just happen to be in that particular universe. Indeed, were the parameters not those needed for life, we wouldn’t be here to inquire about it. Theists counter by saying that there is no evidence for other universes, but they have forgotten that the  burden of proof is on them to show that there aren’t other universes because design inference based on statistics depends on proving that the available number of trials is limited. This is made clear by the following example. Consider an event that has a probability of occurrence of 1 out of a billion. If the total number of available trials is 100, then we don’t expect to observe this event. But if the total number of trials is a trillion, we do expect to observe this event because it is well known that, if the total  number of trials is equal to or greater than the reciprocal of the probability, then we expect to observe that event. In conclusion, since the burden of proof is on the person who is trying to prove something, and since design inference requires proving that the total number of trials is limited, and since there is no way to prove that the total number of trials is limited, classical design arguments for the existence of God are fallacious. Is there any way to rescue classical design arguments based on statistics?

It is well known that the probability of life arising in a universe of our sort is vanishingly small. Theists have used this fact to argue that life is designed by God. However, if there are an infinite number of parallel universes as part of a  such as , then even that very infinitesimal probability seems to compel the existence of life as a necessary truth. If one is justified in invoking an infinite number of parallel universes, even the most unlikely event must occur in one particular universe. This argument seems to mirror race conditions among infinities and infinitesimals. So, if conventional statistical reasoning is applied, doesn't this obviate mathematically ? What is the current state of philosophical arguments in quantum physics and natural theology in regards to the collision of these two theories?


Why do almost all words that are "able" written like:   Comparable Disposable Doable Writable   Except for the word "Convertible"?  Can someone explain this to me or are there no rules tied to this? (I was just curious).

This question comes about because I usually always spell the word incorrectly and the spell checker underlines in red the word: compatible.  In my head, I always want to spell it compatable, and my logic is as follows.  First, look at a definition:     Definition of compatible   a. - Capable of existing in harmony; congruous; suitable; not repugnant; -- usually followed by with.    There's a few words in there that make sense to my brain. Capable and suitable both have the -able suffix, because they can do something.  The root of the suffix is pretty self-explanatory.  Able, suggestive of the ability to do whatever it is that the suffix is appended to.  Examples of words that make sense to me are:    persuadable: the ability, or able-ness to be persuaded placable: [...] to be placed unappeasable: the inability, or unable-ness to be appeased   Other words of which the spellings are confusing to me: accessible, compatible, fallible, immersible  Why the -ible, and not -able when the end result seems to be expressing the same able-ness?  To me, they should be spelled accessable, compatable, fallable, immersable.  What's the root of -ible being used and not -able?


I used to use Ubuntu Hardy on my old laptop. But haven't used it since then. My desktop is really old. It is Dell with Intel(R) Pentium(R) D CPU 2.66 GHz with 1.00gb Ram, 140gb hard-drive. Since Microsoft isn't supporting Windows XP anymore, which Ubuntu version can I use with these computer specs. Also, I need to be able to use some type of media library that is friendly with a iPod so I can sync my mom's playlists and so on.

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


Burnt 16.04 iso to disk. Won't boot to disk even though bios set to cd/dvd as 1st boot. Install folder on disk does not have installable file. Win7 Pro  system. Help please.

I would like to see a full how-to guide on how to install Ubuntu.


I have an array that can hold 5 integers.In the for loop I use Math.random() to fill the array with random integer values between 0 and 10 that can be positive or negative. How can I receive the negative value? Someone recommended me to multiply by -1 the formula to fill out array with positive and negative values but when I do this all my values in the array are negative. I think the problem is in this line    int r = 0 + (int) (Math.random() * 10 *(-1));   This is the code:   public class Random   {   public static void main(String [] args)   {       int [] arr= new int[5];        for(int k=0; k<arr.length; k++)      {           int r = 0 + (int) (Math.random() * 10 *(-1));           arr[k] = r;      }       int j = 0;      while(i<arr.length) {          System.out.print(arr[i] + " ");          j++;      }    } }     Now my output is -7 -3 -3 -5 -6    I want my output to be 7 -3 3 -5 6

How do I generate a random int value in a specific range? I have tried the following, but those do not work: Attempt 1: randomNum = minimum + (int)(Math.random() * maximum);  Bug: randomNum can be bigger than maximum. Attempt 2: Random rn = new Random(); int n = maximum - minimum + 1; int i = rn.nextInt() % n; randomNum =  minimum + i;  Bug: randomNum can be smaller than minimum.


I am writing a function which is passed in a list which is partially filled.  I'd like to set some of the fields within the list inside this function.  I thought that passing it as a reference would allow me to do this, however, I get the following error:     Error 1   Cannot modify the return value of 'System.Collections.Generic.List.this[int]' because it is not a variable   I am wondering what I might need to do to tell C# that I wish to have the option of modifying the contents of the list.  Here is a summarized version of my code:      public static void Determine_RTMM_Descriptor(ref List<Struct_Descriptor_Type> symbols, string Dwarf_Output_Filename)     {         ...         lines = System.IO.File.ReadAllLines(Dwarf_Output_Filename);          //loop on symbol names         for (int idx = 0; idx < symbols.Count; idx++)         {              if(symbols[idx].size == 0)                  symbols[idx].size = (int)new System.ComponentModel.Int32Converter().ConvertFromString(split_line[DwarfInterface.SIZE_INDEX]);          ...     }   Thanks in advance for any help.

I have this struct:  struct Map {     public int Size;      public Map ( int size )     {         this.Size = size;     }      public override string ToString ( )     {         return String.Format ( "Size: {0}", this.Size );     } }   When using array, it works:  Map [ ] arr = new Map [ 4 ] {     new Map(10),     new Map(20),     new Map(30),     new Map(40)};  arr [ 2 ].Size = 0;   But when using List, it doesn't compile:  List<Map> list = new List<Map> ( ) {     new Map(10),     new Map(20),     new Map(30),     new Map(40)};  list [ 2 ].Size = 0;   Why?


I've to detect if two time periods are overlapping. Every period has a start date and an end date. I need to detect if my first time period (A) is overlapping with another one(B/C).  In my case, if the start of B is equal to the end of A, they are not overlapping(the inverse too)  I found the following cases:    So actually I'm doing this like this:  tStartA < tStartB && tStartB < tEndA //For case 1 OR tStartA < tEndB && tEndB <= tEndA //For case 2 OR tStartB < tStartA  && tEndB > tEndA //For case 3   (The case 4 is taken in the account either in case 1 or in case 2)  It works, but it seems not very efficient.  So, first is there an existing class in c# that can modelize this(a time period), something like a timespan, but with a fixed start date.  Secondly: Is there already a c# code(like in the DateTime class) which can handle this?  Third: if no, what would be your approach to make this comparison the most fast?

Given two date ranges, what is the simplest or most efficient way to determine whether the two date ranges overlap?  As an example, suppose we have ranges denoted by DateTime variables StartDate1 to EndDate1 and StartDate2 to EndDate2.


Can a body posses pure rolling in smooth inclined plane.In smooth  inclined plane the centre of mass of body is accelerating.So to maintain the pure rolling there should be angular acceleration.But no one provides the torque because the only forces Gravity and Normal reaction passes through centre.

There is a ball rolling down an incline, with no slipping. If we consider the point of contact between the ball and the inclined plane to be the pivot point (for our torque calculations), then I have noticed that friction is no longer in play, and gravity (and normal force) is the reason for the torque. However, if we consider the center of mass of the ball to be the pivot point, friction is the only factor, since both the normal force and gravity effect the center of mass (so the net torque caused by them is 0, since the pivot is the center of mass). However, both of these produce different torques.. for different reasons. So my question is,   Is gravity the reason a ball rolls, or is friction? And why?  [Note: This is not homework, it is a genuine question I had while looking at some physics problems.]


In a book document I must assure that the same text (a few lines) appears at several places, despite editing. Using the text editor to include the same text snippet does not guarantee consistency in the end.   I can do it with defininig  \newcommand{\partof}{\textit{part\_of}\xspace}   or  \def\verlag{my book title}   which seems ok for small pieces, but not for longer ones. what is the best practice? what is the difference between newcommand and def?

Inspired by a , I have some that essentially all boil down to asking  What are the differences between \def and \newcommand?  In particular, I wonder   Is it possible to have parameters passed to \defed commands, both optional and required? Is there a \redef command equivalent to \renewcommand? I have only ever used \newcommand -- is there any reason I should change that habit?   but I welcome comments on anything else I may not have thought of in this list!


I have a layer with a repeating field name, thus different groups of features (I also have a numerical group field). How can I add a field group_id, using QGIS expressions? What I want is kind of a uniqe identifier per group, counting from 1 to the last element contained in the group (see screenshot). What I tried: Using array_length (array_agg( "group", "group")), I get the number of features per group (field no_in_group). With  generate_series (1, [features per group]), I get an array, counting from 1 to the last no. of each group. However, I'm stuck how to assign each element of the array to one feature of the group. I suppose that array_foreach () will do the job, but I'm unsure how to use it in this case. Screenshot: the field with red outline is what I want to get: a unique, incrementing id, starting from 1 for each group. Here, I introduced the values manually to make clear what I'm looking for:

I've got a dataset of buildings roof segments in shapefiles. I need to sequentially number the roof segments from 1 to n of each building. Is there a way to do it with the QGIS field calculator? Actual:  Expected:  It's pretty similar to that question on arcpy:


I want to know if the following is correct:  If $G$ is abelian, then is trivial since any subgroup is normal and because of Lagrange, it has an element of order $p$.   If $G$ is not abelian, then, I can supose $q > p$, so, Sylow says that $n_p | q^2$, $n_p \equiv 1(p)$, $n_1 | p^2$, $n_q \equiv 1(q)$, so $n_q =1$ or $n_q = p^2$, since if $n_q=p$, it can't happen that $n_q \equiv 1(q)$.   If $n_q = 1$ then $G$ is not simple. Otherwise, $n_q = p^2$, so $p^2 \equiv 1(q)$, so $q | p^2-1 = (p-1)(p+1)$. Since $q$ is prime, this means that $q|p-1$ or $q|p+1$. But it can't be that $q|p-1$ for the same reason as before. So $q|p+1$. But the only primes that can accomplish this are $p=2$ and $q=3$. So I'm left with the case that $|G|=36$, but this is a case I already know from before that is not simple.  Is this correct?  Thanks

Let $p,q$ be primes and let $G$ be a group of order $p^2q^2$, what's the best way to show $G$ is non-simple?      I know it suffices to show that one of the Sylow-p or Sylow-q subgroup of $G$ is normal, but the counting elements argument doesn't work here since different Sylow subgroups may have non-trivial intersection.


So I have that $\binom{n}{  c}\times \binom{n-d}{b-c} = \binom{n }{ d}\times  \binom{d}{c}$.  I am trying to prove it by using number of players to prove this. What should be the best way to prove this? I can't seem to figure out what should go in n-d b-c.

I want to prove this equation, $$ \binom{n}{a}\binom{n-a}{b-a} = \binom{n}{b}\binom{b}{a} $$ I thought of proving this equation by prove that you are using different ways to count the same set of balls and get the same result. But I'm stuck. Help me please.   (Presumptive) Source: Theoretical Exercise 1.14(a), P19, A First Course in Pr, 8th Ed, by S Ross.


I am taking a course in Mathematical Physics Junior Level (Undergraduate).  We are working from Arfken's "Mathematical Methods for physicists", but i am finding trouble with it specially in the determinants and matrices chapter, since it is not detailed enough. any suggestions for a more detailed book?

I am taking a course in Mathematical Methods for physicsPhysics (Junior Level).   We are working from   > Mathematical Methods for physicists, George B.Arfken .    I just need online resources covering ( Matrices, Determinants, Vector Analysis, Tensors and differential forms and Vector spaces...etc) to study and understand from.


I need to identify items with a string of characters that is not apparently progressive. What I mean is that if I generate successive identifiers, they should not look like:  1, 2, 3, 4... a, b, c, d... k4f, k5f, k6f...  Also, the string should be preferably short and human-readable, ideally something you could easily say on the phone. So, a GUID is not a good candidate; a 6-characters long string with only uppercase consonants and numbers fits. Finally, the identifier has to be generated and reasonably guaranteed to be unique. GUIDs would be perfect for this, as it is extremely improbable to generate twice the same GUID when working at a reasonable rate. Assume that a "reasonable rate" is about 500 per day. Progressive integers (even in hex form) would work great, but then they'd be evidently progressive. What algorithm can I choose? I'm open to solutions like using a progressive ID and mangling it so that it doesn't look like it's progressive.

A few months back I was tasked with implementing a unique and random code for our web application.  The code would have to be user friendly and as small as possible, but still be essentially random (so users couldn't easily predict the next code in the sequence).  It ended up generating values that looked something like this:  Af3nT5Xf2   Unfortunately, I was never satisfied with the implementation.  Guid's were out of the question, they were simply too big and difficult for users to type in.  I was hoping for something more along the lines of 4 or 5 characters/digits, but our particular implementation would generate noticeably patterned sequences if we encoded to less than 9 characters.  Here's what we ended up doing:  We pulled a unique sequential 32bit id from the database.  We then inserted it into the center bits of a 64bit RANDOM integer.  We created a lookup table of easily typed and recognized characters (A-Z, a-z, 2-9 skipping easily confused characters such as L,l,1,O,0, etc.).  Finally, we used that lookup table to base-54 encode the 64-bit integer.  The high bits were random, the low bits were random, but the center bits were sequential.  The final result was a code that was much smaller than a guid and looked random, even though it absolutely wasn't.  I was never satisfied with this particular implementation.  What would you guys have done?


I want to prove that for $u,v \in V$, $\langle u,v \rangle =0$ iff $\|u\| \le \|u+av\|$ for all scalars $a \in \mathbb{F}$. Here $\mathbb{F}$ is the field of $V$ which is either complex or real numbers.   The ($\Rightarrow$) implication has been proved. What I need is ($\Leftarrow$). I tried expanding the norm $\|u+av\|$ but what I get is that  $\langle u,v \rangle \ge 0$. How do I prove it equal to 0?  Am I missing some small step? Please help, Thanks.

Prove that $\langle u,v\rangle=0\Longleftrightarrow \|u\|\leq \|u+av\|$.  So far I can get the $\Longrightarrow$ very easily, but I need some help with the $\Longleftarrow$ implication, any hints would be greatly appreciated.  Please no answers, I just want a small nudge to get me in the right direction, I've been stumped on this for a little bit.  Here's what I have so far:  ($\Longleftarrow$)  Assume $\|u\| \leq \|u+av\|$  $\|u+av\|^2=\langle u+av,u+av\rangle=\langle u,u\rangle+ \langle u,av\rangle+\langle av,u\rangle+\langle v,v\rangle=\|u\|^2+\bar{a} \langle u,v\rangle+a\langle v,u\rangle+\|v\|^2=\|u\|^2+ \bar{a}\bar{\langle v,u\rangle}+a\langle v,u\rangle+\|v\|^2$  Thoughts/ideas?


Is there any automation thats downvotes every answer I gave? Or could it be that somebody doesn't like me? What could I do against it?

I just noticed that I lost a bunch of points from my reputation score, and I used the "reputation" tab on my user profile page to try and track down the cause.  During my investigation, I noticed there was an unusual event of type "reversal". In the normal place of a question title, it says "voting corrected".     What does this mean, and what caused it?  Did I do something wrong? Why did I lose all of that reputation? Is the system punishing me for leaving too many good answers?  Is there any way to earn it back?


Not sure if I framed below question properly, let me know if anything you want me to clarify in the comments.  Implications of double slit experiment show concious observation affect the 'reality as we know it' on bigger scale of Einsteins relativity.  Consider below scanarios(Lets assum the detector of type magnetic needle detector)  Scenario 1. Detectors Off + Recording Off(No paper for recording, needle movement On) => Interference pattern  Scenario 2. Detectors On + Recording On => Expected two band pattern  Scenario 3. Detectors On + Recording Off(No paper for recording + Needle movement On) => Interference pattern  When we perform the experiment with the "detectors on" but the "recording off" shows the same results as if detectors are off.    Now when recording if off(no paper for recording) the needle still moves and has effect on correcponding air molecules come in contact with the needle and as per law of conservation of information, information can still be recovered.  If law of conservation of information is correct then we would have seen the same effect for Scenario 2 and Scenario 3. So do above result contraict the law of conservation of information?  ====Update  If we say magnectic needle affecting air molecules cannot be recovered that means information is lost which is against conservation of information theory.   Also if system decides(whether to produce defraction pattern or two band pattern) based on our capabilities of recovering the information then how does system know our capability of what information can be recoverd by us ? If in future we become advanced enough to be able to recover that information will the scenario 3 produce defraction pattern ?  -- The question "The Double Slit Experiment - delayed measurement " does not deal with law of conservation of information which is specifically I am acking about.

I'm not a physicist; I'm just curious about what would happen.  According to this video "" (at 2:50):     "Somebody decided to leave the detectors on but just not take any data. [...] So if it was also going to a magnetic tape - there was no magnetic tape loaded. [...] And what do you think happed? They got this. They got the diffraction pattern."   So the act of measuring (beeing concious of the data) destroys wave-form pattern?  If so lets consider these cases:   What if I'd throw a dice after the experiment to decide if I should look at the data or to destroy it? (e.g. look at the data if the number on dice is even) What if the information about measurement would need to travel longer period of time than the particle would need to hit the wall?    To above cases: Would it mean that information travelled instantly - faster than light or that "the particle can look into the future"?


I recently bought a laptop (Lenovo Y410P) with Windows 8 pre-installed and I'm trying to dual boot Windows 8 and Ubuntu 13.0.  I created a bootable usb using Pendrive. Then I changed the Boot Mode to Legacy Support and the boot order so it boots from the flash storage first. When I restarted the computer, I got the error message  "SYSLINUX 4.06 EDD 2012-10-23 Copyright (c) 1994-2012 H. Peter Anvin et al"  and it just hung there.   Fair enough. After some googling I formatted my flash drive in FAT format instead of FAT32. The "SYSLINUX..." error message is gone but now it hangs on a purple screen    Does anyone have a suggestion what to do here? I've looked at various posts but none of them seems to have a solution that the author confirmed it worked.

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


$$\int^{\infty}_{0} e^{-at^2}  \cos(2 x t) \, dt = \frac{1}{2} \sqrt{\frac{\pi}{a}} e^{\frac{-x^2}{a}}$$ for Re$(a)>0$,  for all real value greater than zero.  I took this equation from the book, , Equation number $7.4.6$

Prove that :  $$ \frac{\sqrt{\pi}}{2} e^{-\frac{a^2}{4} } =\int_0^{\infty} e^{-x^2} \cos( a x) \ \mathrm{d}x$$    the only thing I can think of is differentiating the RHS and trying to get :  $$ -2 f'(a) =a f(a) $$ But I couldn't do it.  Can anyone show me how to do this ?


I was having some trouble when trying to read zip file from Android external SD card.   Here is my code:  File[] fileArr = mVersionUpgradeViewModel.getZipFileFromSDCard(); for(int i = 0; i < fileArr.length; i++){     System.out.println(fileArr[i]); }  public File[] getZipFileFromSDCard() {     File[] matchingFiles = new File[0];     File f = Environment.getExternalStoragePublicDirectory(Environment.DIRECTORY_DOWNLOADS);     if(f.exists()) {         matchingFiles = f.listFiles(new FilenameFilter() {             public boolean accept(File dir, String name) {                 return name.endsWith("zip");             }         });     }     return matchingFiles; }   And my emulator folder structure:    The zip folder is there. But with the code above, I am getting error message like:  Caused by: java.lang.NullPointerException: Attempt to get length of null array     at com.mainapp.asynctask.VersionUpgradeTask.doInBackground(VersionUpgradeTask.java:86)     at com.mainapp.asynctask.VersionUpgradeTask.doInBackground(VersionUpgradeTask.java:15)     at android.os.AsyncTask$2.call(AsyncTask.java:333)   The error is pointing to the first for loop. It was working last time. But after I tried the newer version installation code, the method above breaks. Any ideas?  Thanks!

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


I'm new to this field. I'm trying to open in QGIS the layers that are provided in this page: .  (each layer has a links option)  I have some links but I dont have any info on what standard are those, or how do I open them. (They seem to be served by Geoserver). I tried with OpenGeo Explorer plugin but those Links dont work. I also tried to add them as WMS/WMTS Layer in QGIS but nothing. (the legend of the layer appears some times, but the vector layer itself doesnt show up)  I have seen two types of links in that page so far.   and    Anyone knows what tool should I use to access & analyse those layers?

I am trying to import WMS from geoserver link to QGIS 2.8.4 & the latest 2.12.1:    QGIS get the request and show the layers of the workspace, and also the get info. My problem is that the layer is not visible in the view.  It works fine with version 2.2:


I am wondering if there is a way to check if a give point (x y z) in a scene lies on the surface of any mesh object in that scene using Python script?  I mean, the point should lie on the mesh surface, not inside (maybe not exactly should be close enough if exact accuracy is impossible). So if the scene contains 1 cylinder of radius 1 centered at the origin, then the origin is not counted, but the points (1, 0, 0) or (0, 1, 0) are.

I need a python script that would help me determine if a point is inside a cylindrical mesh.  I tried the .pointInside(point, selected_all=False) but it is deprecated in the newer versions of blender and google search yielded a couple of scripts (below) and they don't work for me.  Ray-casting method: ()  import bpy import mathutils def pointInsideMesh(point,ob):  axes = [ mathutils.Vector((1,0,0)) ]  outside = False  for axis in axes:     mat = ob.matrix_world     mat.invert()     orig = mat*point     count = 0     while True:         location,normal,index = ob.ray_cast(orig,orig+axis*10000.0)         if index == -1: break         count += 1         orig = location + axis*0.00001     if count%2 == 0:         outside = True         break return not outside print(pointInsideMesh( mathutils.Vector((3,0,0)),bpy.context.active_object))   And one described here ()  ## normals should be pointing out import bpy obj = bpy.context.object cur = bpy.context.scene.cursor_location.copy() cur = obj.matrix_world.inverted() * cur cpom = obj.closest_point_on_mesh(cur) vec = cur - cpom[0] dot = cpom[1].dot(vec) if dot < 0.0: print(dot, 'inside') else: print(dot, 'outside')


I want to order a dict by the value of a key. I read this tutorial to sort a dict but it doesn't specify how to order a dict by key or I don't understand how .  I read this data from a json named tweets.json with the following code  with open('tweets.json') as json_file:  json_data = json.load(json_file)   {   "json_data": [     {       "Tweets": "Today, it was my great honor to welcome and host the 2018 @NASCAR Cup Series Champion, @JoeyLogano and @Team_Penske to the @WhiteHouse! ",        "date": "Tue, 30 Apr 2019 23:21:16 GMT",        "id": 1123366738463162368,        "len": 159,        "likes": 23487,        "retweets": 5278,        "sentiment": 1,        "source": "Twitter for iPhone"     },      {       "Tweets": "....embargo, together with highest-level sanctions, will be placed on the island of Cuba. Hopefully, all Cuban soldiers will promptly and peacefully return to their island!",        "date": "Tue, 30 Apr 2019 21:09:13 GMT",        "id": 1123333508078997505,        "len": 172,        "likes": 69469,        "retweets": 22433,        "sentiment": 1,        "source": "Twitter for iPhone"     },      {       "Tweets": "If Cuban Troops and Militia do not immediately CEASE military and other operations for the purpose of causing death and destruction to the Constitution of Venezuela, a full and complete....",        "date": "Tue, 30 Apr 2019 21:09:13 GMT",        "id": 1123333506346749952,        "len": 189,        "likes": 75502,        "retweets": 28047,        "sentiment": 1,        "source": "Twitter for iPhone"     }    ] }   I want to use this function OrderedDict() but I don't know how to specify the key likes  How I can sort this dict by the key likes ?

I have a list of dictionaries and want each item to be sorted by a specific value. Take into consideration the list: [{'name':'Homer', 'age':39}, {'name':'Bart', 'age':10}]  When sorted by name, it should become: [{'name':'Bart', 'age':10}, {'name':'Homer', 'age':39}]


I need a counterexample to the following statement: if A, B are subgroups of a group G, and A is a normal subgroup of B, B is a normal subgroup of G, then A is a normal subgroup of G. I've tried using groups such as $Z/nZ$ and $Z_n^{*}$, but neither seem to work. Thanks for your help.

Suppose $G$ is a group and $K\lhd H\lhd G$ are normal subgroups of $G$. Is $K$ a normal subgroup of $G$, i.e. $K\lhd G$? If not, what extra conditions on $G$ or $H$ make this possible?  Applying the definitions, we know $\{ghg^{-1}\mid h\in H\}=H$ and $\{hkh^{-1}\mid k\in K\}=K$, and want $\{gkg^{-1}\mid k\in K\}=K$. Clearly, the best avenue for a counterexample is if $gkg^{-1}\not\in K$ for some $k\in K$ and $g\in G-H$.  If no such element exists, $\{gkg^{-1}\mid k\in K\}\subseteq K$ implies $\{gkg^{-1}\mid k\in K\}=K$ because if $k'\in K$, $gk'g^{-1}=k\in K\Rightarrow k'=g^{-1}kg\in\{gkg^{-1}\mid k\in K\}$.


I am trying, but I found $im(z) =0$ I want to know where is my mistake My attempt : $(1+z)^n=(1-z)^n$ We put $z =e^{i\theta}$ $(1+e^{i\theta})^n=(1-e^{i\theta})^n$ $\Leftrightarrow $$(-e^{-i\pi} +e^{i\theta})^n=(-e^{-i\pi} - e^{i\theta})^n$ $\Leftrightarrow $$(e^{\frac{i\theta-\pi}{2}}(e^{\frac{i\theta+\pi}{2}}-e^{\frac{-i(\theta+\pi) }{2}}) ) ^n=(-((e^{\frac{i\theta-\pi}{2}}(e^{\frac{i\theta+\pi}{2}}+e^{\frac{-i(\theta+\pi) }{2}}) ) ^n$ $\Leftrightarrow $$(e^{\frac{i\theta-\pi}{2}}(e^{\frac{i\theta+\pi}{2}}-e^{\frac{-i(\theta+\pi) }{2}}) ) ^n=(e^{-\pi} ((e^{\frac{i\theta-\pi}{2}}(e^{\frac{i\theta+\pi}{2}}+e^{\frac{-i(\theta+\pi) }{2}}) ) ^n$ $\Leftrightarrow $ $ (sin (\frac{\theta +\pi}{2}) e^{i\frac{\theta}{2}}) ^n=(cos(\frac{\theta+\pi}{2})(e^{i\frac{\theta-\pi}{2} - \pi})^n$ $\Leftrightarrow $$-sin(\frac {\theta}{2}) =cos(\frac {\theta}{2}) $ and $e^{i\frac{\theta}{2}}=e^{i\frac{\theta-\pi}{2} - \pi}$ $e^{i\frac{\theta}{2}}=e^{i\frac{\theta-\pi}{2} - \pi}$$\Rightarrow $$cos(\frac {\theta}{2})  +isin(\frac {\theta}{2}) =cos(\frac{\theta-\pi}{2} - \pi) +isin(\frac{\theta-\pi}{2} - \pi)  $ $\Rightarrow $ $cos(\frac {\theta}{2})  +isin(\frac {\theta}{2}) =-cos(\frac {\theta-\pi}{2})  - isin(\frac {\theta-\pi}{2})$ $\Rightarrow $ $cos(\frac {\theta}{2})  +isin(\frac {\theta}{2})=-sin(\frac {\theta}{2}) +icos(\frac {\theta}{2})$ We know that:$-sin(\frac {\theta}{2}) =cos(\frac {\theta}{2}) $ So $2 isin(\frac{\theta}{2}))= 0$ $\Rightarrow $ $im(z) =0$

So, I have to prove that if $(1+z)^n = (1-z)^n$ then $Re(z) = 0$ 'without actually solving the equation.' I see that I can easily transform the equation by interpreting $z$ as $a+bi$: $(1+ a + bi)^n = (1- a - bi)^n$. Then I see that the real parts on both sides must be equal, so $$1+a = 1-a \Longrightarrow a =-a$$ $$ a = 0 \Longrightarrow Re(z) = 0 $$ And here comes my question - is that any good? I mean it seems too simple, I think I don't understand something.


I'm writing some notes to my class and I create a table but is too wide and it cannot be compiled in my document. Could you help me with my code? I think I need to modify the rows because some part of the contents are too long and that creates the error but I'm really beginner using Tables. Thanks to anyone.  \begin{table}[h]     \centering     \begin{tabular}{l|c|l|r}     &\textbf{Parámetro} & \textbf{Definición} & \textbf{Intensidad}\\\hline\hline     1&Especialización & El puesto ejecuta un número reducido de tareas diferentes & Muy alta\\     2&Formalización de comportamiento & Puesto con tareas simples diseñadas por personas diferentes al ejecutor & Muy alta\\     3&Entrenamiento & Práctica de un trabajo por un largo tiempo, fuera del trabajo y solitariamente & Muy baja\\     4&Adoctrinamiento & Conjunto de valores, objetivos o cultura común & Muy baja\\     5&Planificación y control & Planificación: Definición de tareas antes de la ejecución. Control: Monitoreo de las tareas después de la ejecución & Muy alta\\     6&Comunicación informal & Coordinación fuera del plan & Muy baja\\     7&Centralización & El poder pertenece en la parte alta de la estrategia & Relativamente alta     \end{tabular}     \caption{Tipos de alineamiento}     \label{tab:my_label} \end{table}

I have a table that I want to insert on a page, but at least one (perhaps both) of the following conditions are met:   The table is too wide to fit within the text block or page. That is, I'm exceeding some horizontal restriction. The table is too tall to fit within the text block or page. That is, I'm exceeding some vertical restriction.   What are my options to make this table fit? If it doesn't fit, regardless of my attempts, what other options exist?


Is there an advantage, that Canon or Nikon's entry level dSLRs hold over their competition ones (notably Sony) for a young enthusias who wants to learn more but is currently, and probably won't in the immediate future, not interested in investing too much in lenses, apart from the starting one and maybe one with that.  More interested in technique and composition.  Edit: mattdm beautifulyl put it in the comments below, so I'll just steal his words. Apart from being able to upgrade indefinitely into the ecosystem, what would be the reasons for choosing Canon/Nikon entry level models?

We have a question and answers outlining the . I'm interested in the other DSLR makers, and how the cameras they make compare in terms of significant features, system design philosophy, and unique or interesting photographic capabilities enabled or made easier by these cameras. Likewise, what such things are not handled as well?  Take "the big two have more market share" and the associated advantages of availability, accessibility, and third-party support and documentation .  I'm not interested here in compact cameras, interchangeable-lens cameras with electronic viewfinders, or in rangefinders. (If you're interested in that, though, see )  P.S.: Differences in lens lineups are covered at


Let $A$ be an additive category, with objects $X$ and $Y$.  If there exists direct sum decompositions $X = Y\oplus Y'$ and $Y = X \oplus X'$ in $A$, must $X$ and $Y$ be isomorphic?   If one only assumes that there exist monomorphisms $X\to Y$ and $Y\to X$, the answers is No in the category of abelian groups, as explained in answers linked to in the comments.  However, the question about direct summands is not resolved there.

The Cantor-Bernstein-Schroeder theorem states that if there are two sets $A$ and $B$ such that there exist injective (alternatively, surjective, assuming choice I think) maps $A \to B$ and $B \to A$, then $A$ and $B$ are in bijection.  It then seems natural to try to strengthen the result to other structures.  If $A$ and $B$ are, say, groups (or rings, modules, etc) such that there are injective homomorphisms from each to the other, then $A$ and $B$ are isomorphic.  I'm wondering if there are any results on this, or if there are known counterexamples.  The theorem for sets alone is nontrivial, so I feel like any results about how it holds for other structures would be quite interesting.


What symbol is the one after the word "code" above? Is this \varrho or just the @ symbol? How do I pronounce it?  \[ \varrho \]

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I want to be able to unlock screen, or login to physical user while I'm connected with ssh connection. I know this might be unsafe etc. However that's ok for me at the moment. What options do I have to do this?

Is there a way to unlock and lock screen from command line, via ssh? I know /System/Library/CoreServices/Menu\ Extras/User.menu/Contents/Resources/CGSession -suspend command, but it doesn't seem to work via ssh. The perfect solution would be a command, that I could type logged via ssh and it would unlock the screen or lock it back again, so I don't need to tell anybody my password, if he wants to use it. Is there any builtin tool, that would provide such functionality?


I know that both "in order to Verb" phrase and "so as to Verb" phrase describe the purpose of doing something.  But, I would like to know if there are any differences between them.  For example, the below two sentences might be examined about it.     Sentence A: "We went early so as to get good seats."      Sentence B: "We went early in order to get good seats."

Are there any differences (general or regional differences) between "in order to", "so that" and "so as to"?  I've seen that they may be interchangeable, but I'm not so sure.


Hi everybody I need some help with minecraft. I an a command : /kill @e[type=!Player,ArmorStand] and it didn't work What I wanted : A command that kills every entity except ArmorStand and Players. Could someone help me?

I've asked this question towards a developer for Minecraft and I thought I'd ask here too since they might not see the question.  How do I select all but two types of entities in Minecraft?  For example, something like: /say @e[type=![Player,Item],r=50] (to clarify I also tried type=Item,Player, type=Item,type=Player etc)  Should select any entity that does not match players or items, so things like Creepers, Ghasts, XPOrbs, PrimedTNT and so on within a radius of 50 blocks and print them to the chat.  Instead it ignores one of the flags, and works with the other instead.


This is an exercise in Karatzas and Shreave's book on stochastic calculus. The $X_n$'s are real random variables on a probability space with $\sigma$ algebra $\mathscr{F}$.  I don't know what my uniformly bounding $L^1$ function should be. I appreciate any help.

Let $\{\mathcal{F}_n\}_n$ be a decreasing sequence of sub-$\sigma$-fields of $\mathcal{F}$($\mathcal{F}_{n+1}\subset\mathcal{F}_n$) and let $\{X_n\}_n$ be a backward submartingale($E[|X_n|]<\infty$, $X_n$ is $\mathcal{F}_n$ measurable and $E[X_n|\mathcal{F}_{n+1}]\geq X_{n+1}$).  If we know $l=\lim_{n\rightarrow\infty}E[X_n]>-\infty$, how to prove that $\{X_n\}_n$ is uniformly integrable? Many thanks!  I have an idea, it is enough to show:    $\sup_nE[|X_n|]<\infty$;  $\forall\epsilon>0$, $\exists\delta>0$ s.t. $\forall A\in\mathcal{F}$ such that $\mathbb{P}(A)<\delta$, we have $\sup_nE[1_{A}|X_n|]<\epsilon$.    For $|X_n|=2X_n^+-X_n$, we have  $$E[|X_n|]=2E[X_n^+]-E[X_n]\leq 2E[X_0^+]-l\leq 2E[|X_0|]-l$$  which implies $\sup_nE[|X_n|]<\infty$.  Secondly, $\forall A\in\mathcal{F}$, we can suppose without loss of generality that $A\in\mathcal{F}_0$.  $$E[1_{A}|X_n|]=2E[[1_{A}X_n^+]-E[[1_{A}X_n]$$  Does someone have an idea for this term? Thanks a lot.....