I am having trouble implementing a red black tree which uses a template. I have read and understand the purpose but do not know exactly how to implement it into the header file and .cpp file. I was reading in some forums that they must in the same file as the template and others say that they can be separate but in a .hpp file.  header file  enum nodeColor { RED, BLACK };  template <class myType> struct nodeType {      myType  keyValue;     nodeColor color;     nodeType<myType> *left;     nodeType<myType> *right;     nodeType<myType> *parent;  };  template<class myType>  class redBlackTree {  public:     redBlackTree() {}     ~redBlackTree() {}     void destroyTree();     unsigned int countNodes() const;     unsigned int height() const;     void printTree() const;     void insert(myType);     bool search(myType);  private:     bool search(myType, nodeType<myType> *);     void destroyTree(nodeType<myType> *);     unsigned int countNodes(nodeType<myType> *) const;     unsigned int height(nodeType<myType> *) const;     void printTree(nodeType<myType> *) const;     void rightRotate(nodeType<myType> *);     void leftRotate(nodeType<myType> *);  };   .cpp file  #include "redBlackTree.h" using namespace std;  redBlackTree::redBlackTree() { }    redBlackTree::~redBlackTree() { } void redBlackTree::destroyTree() { } unsigned int redBlackTree::countNodes() const { } unsigned int redBlackTree::height() const { } void redBlackTree::printTree() const { } void redBlackTree::insert(myType) { } bool redBlackTree<myType>::search(myType) { }  bool redBlackTree::search(myType, nodeType<myType> *) { } void redBlackTree::destroyTree(nodeType<myType> *) { } unsigned int redBlackTree::countNodes(nodeType<myType> *) const { } unsigned int redBlackTree::height(nodeType<myType> *) const { } void redBlackTree::printTree(nodeType<myType> *) const { } void redBlackTree::rightRotate(nodeType<myType> *) { } void redBlackTree::leftRotate(nodeType<myType> *) { }   I also know that I did not include parameters. I am mostly asking for how to approach this so that I can get to coding away.

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.)


I would like to install Ubuntu 16.04, I already have 10.04,so is there a chance of my files being lost in installing Ubuntu 16.04 over 10.04?

I am currently using Ubuntu 10.04. I know there is a 10.10 release, but can I upgrade directly to 11.04? Could you walk me through the steps please?


I would like to know why $ \beta = (X^T X)^{-1} X^T y $ is the solution for the ML-estimator for the linear regression.  In principle it is shown, e.g., here in  respectively in specific I would like to know where the inverse comes from?

I was taking an online course and saw linear regression being by gradient descent The intuition behind why the method would work seemed plausible.  I tried understanding normal equation as to why setting individual partial derivates to 0 and solving the equations give the optimal values of theta, but that didn't ring a bell.   Why setting partial derivatives to zero, and solving the equations gives optimal value of theta. I also went through the following . The part about The minimum is determined by calculating the partial derivatives of S(β1,β2) with respect to β1 and β2 and setting them to zero is still dicey to me. Why would it work. Why would it give the values of β1 and β2 for minimized cost function. If we have multiple local optima, would the normal equation method give the global optima? If so, why?


Why isn't this functioning properly? I'm aware of the advanced slice ([::-1]) option but I would like to figure out how to reverse the str this way as well.  word = input("Please enter a word to reverse: ")  cut = len(word) print(word[cut:-cut])

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


This was a comment I made on a joke nomination (and the nomination has since been deleted). I saw it in . The HTML if it helps:

Jun
 9

 	       comment
                 What? I thought expert sex change were going for pay for it.
   A quick scan of my other comments indicate none were on deleted posts, and I don't recall ever seeing comments on deleted posts showing up there before.

When a moderator nominee withdraws their nomination, comments on that post remain present in the user's recent activity list.  This is in direct contrast to comments on deleted normal posts being hidden from recent activity lists (I understand that withdrawn nominations may not be the same as deleted posts in the system).  Comments on withdrawn nominations are also visible via /posts/<nomination_post_id>/comments, although that is less accessible.


If I have this HTML:

  and the JS let elem = document.querySelector('.elem');  Using elem.querySelector(":scope ~ div") does not return anything even though there are div siblings of elem. Using elem.querySelector(":scope > div") returns an element because also there are are div children of elem. How could I select the current sibling of elem?

How do I get the next element in HTML using JavaScript?  Suppose I have three <div>s and I get a reference to one in JavaScript code, I want to get which is the next <div> and which is the previous.


i have a dynamic group: for example we have a list with 20 items in it in this time.... i wanna make this list in 4 individual list with 5 items something like this is in my head..  a = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20] z = len(a)/4 b = [] for i in range(z)   and after i don't know what i should do.......  i did something like this but it's completely wrong:  for i in range(len(a)):     for j in range(z):         b.append(a)   this is my codes:  import maya.cmds as cm import random as random myList = cm.ls(sl = True) random.shuffle(myList) b = [myList[i:i+5] for i in range(0, len(myList), 5)] for i in b:     print str(i)+".v"   the result is:  [u'curve13', u'curve26', u'curve5', u'curve40', u'curve17'].v   but i need:  [u'curve13.v', u'curve26.v', u'curve5.v', u'curve40.v', u'curve17.v'].v

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


I was reading the Channel Divinity abilities of the Oath of Vengeance of the paladin and under Vow of Enmity, it says  As a bonus action, you can use your Channel Divinity to choose a creature within 10 ft. and gain advantage on attack rolls against it for 1 minute or until it drops to 0 HP or falls unconscious.  My question is can this spell be cast on an invisible creature, since it is not written that I need to see it ? For reference, Channel Divinity: Abjure Enemy says the following:  As an action, you can choose one creature within 60 ft. of you that you can see to make a WIS saving throw (14). Fiends and undead have disadvantage on this saving throw. On failure, the creature is frightened and its speed is reduced to 0 (and it can't benefit from bonuses to speed) for 1 minute or until it takes any damage. On success, the creature’s speed is halved for 1 minute or until the creature takes any damage.  Here is proof that I'm reading it in DnDBeyond, on my character's page

My party and I are very new to D&D, so we are still learning a lot of the rules.  Anyway, I have chosen the Oath of Vengeance for my paladin. During a battle, I wanted to use Vow of Enmity against my enemy. However, my DM said I couldn't use it because I didn't have a specific vengeance against said enemy. He basically told me that I can only use the vow if I can come up with a reason as to why the enemy deserves it. What are the requirements to use Vow of Enmity? Can I really only use it if I can come up with a reason to swear vengeance against the enemy? Or I am just able to use it whenever I want (once per rest, obviously, using Channel Divinity) simply because I have taken the Oath of Vengeance?


I have a physically damaged HDD that can still be detected by disk utility, but I cannot access the files inside. I tried using Data Rescue 3 but the UI was very clunky and I always end up having to restart the computer for it to work. It did manage to scan it once and recover many files, but not some specific file types I was looking for. But due to the clunky UI I couldn't scan it again.  Any programs that are reliable and known to recover files from damaged hard drives ?   Note :    It is connected externally via USB. The HDD was on a Windows Desktop, but using the mac to read it

My hard drive died in my macbook and it no longer will start up. It will not mount in an external enclosure but disk utility is still reading that the hard drive is there, and I tried to repair disk and I am getting this error: (Disk Utility can’t repair this disk. Back up as many of your files as possible, reformat the disk, and restore your backed-up files.) So my question is how do I backup my files if the hard drive won't mount? The only way that I have been able to see the hard drive is through disk utility. I just want to be clear that I am using mac os x snow leapard.


I want to show that for any convergent series $\sum_{n=0}^{\infty}a_n$ with $a_n>0$ there exists a sequence $(b_n)$, $\lim\limits_{n \to \infty} b_n = \infty$, such that $\sum_{n=0}^{\infty}a_nb_n$ converges. Any hints?

In Bergman's companion notes to Rudin, he says that "If a sequence of positive terms has convergent sum, so does every sequence of positive terms which decays more rapidly." So given a sequence $\{a_n\}$ of positive terms such that $\sum_n a_n$ converges, if $\{b_n\}$ is such that $$ \lim_{n\to\infty} \frac{a_n}{b_n} = +\infty, $$ then $\sum_nb_n$ converges. I can prove this given $\{a_n\}$ and $\{b_n\}$. However, can we find $b_n$ which decays more slowly, i.e. $$ \lim_{n\to\infty} \frac{b_n}{a_n} = +\infty $$ such that $\sum_n b_n$ converges?  Similarly, we have the claim "if a sequence of positive terms has divergent sum, then so does every sequence of positive terms which decays more slowly."


I know this question had been asked in the past also and I had read those answers but some of them are outdated and may not hold good now. So, I am just asking it again to get the latest info.  I am holding an Indian passport and with an expired US visa. Can I travel with Lufthansa without having a transit visa from the USA to India via Munich?   As per this document, it looks an Indian citizen can travel with an expired US visa.    I also read other conflicting answers which says you can't transit via Germany if you have an expired visa.  My itinerary is  -> Boston - Munich - New Delhi with 3 hours layover in Munich.  Can anyone please help with this.  Update: Today I had sent an email to German consulate in Boston about the same and below is the reply which I had received from them.   Dear Applicant, When leaving the US while holding a valid US resident status (eg. Green Card, Visa),  no Airport Transit Visa is required.  If your resident status has expired, even if you  hold an I-797 Approval notice, please note:  The longer the time gap between, the expiration date  of the visa and the return from the USA, the higher  the likeliness of facing complications when transiting  through Germany.  The final decision whether an airplane can be boarded  or a transit zone can be entered, without a transit  visa, lies with the Airlines or German Border Police,  respectively.  Therefore the Embassy advises clients, whose US-Visa  has expired to apply for a transit visa.  Please note:  Airport transit privilege does not apply and you  will need a visitor visa  1. if you have to pick up your baggage and/or have  to check-in again (please verify with your airline).  2. if you are transiting through two or more airports  in the Schengen Countries (for example:  Miami-Frankfurt-Paris-India or  New York-Frankfurt-Munich-India).  3. if you hold an open ticket.  You will find additional information regarding airport  transit visas on our website here:  https://www.germany.info/us-en/service/05-VisaEinreise/ airport-transit-visa/924624   So, I am going to avoid my travel via Germany.

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


I am getting an error like this:  IndentationError: expected an indented block  def pure_cnn_model():  datagen = ImageDataGenerator( featurewise_center=False, samplewise_center=False, featurewise_std_normalization=False, samplewise_std_normalization=False, zca_whitening=False, rotation_range=45, width_shift_range=0.2, height_shift_range=0.2, horizontal_flip=True, vertical_flip=False)  datagen.fit(x_train)

When I compile the Python code below, I get      IndentationError: unindent does not match any outer indentation level     import sys  def Factorial(n): # Return factorial     result = 1     for i in range (1,n):         result = result * i     print "factorial is ",result     return result   Why?


Why is %appdata% C:\Users\<user>\AppData\Roaming and not just C:\Users\<user>\AppData?  And whats the difference between AppData\LocalLow and AppData\Local?  Related, but no duplicate:

I have a workstation running Windows Server 2008 that's logged into an  domain, and I have a dual boot with Ubuntu Linux. When running Linux, I'd like to be able to use the same Thunderbird profile I use under Windows, so I pointed Thunderbird to use a profile I found under:  \Users\(myname)\AppData\Local\Thunderbird\Profiles   It turns out it was not the correct profile -- it had the right configuration, but the Inbox was an old version. I eventually found out the correct path was:  \Users\(myname)\AppData\Roaming\Thunderbird\Profiles   What's the rationale behind those different places to store application data?


I tried bridging, it kind of works but ruins the normals, I also tried extruding and the "to sphere" function. That was even worse. Thanks.

I need to create cyllinder with 16 vertices on top but only 4 vertices on bottom plane. Im trying to merge faces and dissolve edges, but the resulting object looks deformed, cut out.


I'm pretty new to ubuntu. Trying to run  sudo apt-get update I receive the following error:   Ign:1 h.ttp://dl.google.com/linux/chrome/deb stable InRelease Hit:2 h.ttp://dl.google.com/linux/chrome/deb stable Release                Ign:3 ttp://ppa.launchpad.net/mjblenner/ppa-hal/ubuntu bionic InRelease  Err:4 ttp://ppa.launchpad.net/mjblenner/ppa-hal/ubuntu bionic Release      404  Not Found [IP: 91.189.95.83 80] Hit:6 ttp://security.ubuntu.com/ubuntu bionic-security InRelease         Hit:7 http://us.archive.ubuntu.com/ubuntu bionic InRelease Hit:8 http://us.archive.ubuntu.com/ubuntu bionic-updates InRelease Get:9 http://us.archive.ubuntu.com/ubuntu bionic-backports InRelease [74.6 kB] Reading package lists... Done                                  E: The repository 'http://ppa.launchpad.net/mjblenner/ppa-hal/ubuntu bionic Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   Any ideas?

When updating, I get the following error message:   W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file.   Here, I find another statement on this error:   This recommends removing certain PPAs; and, I'm not sure if I should do that since it might mean not getting the updates that I need.    Is this what I should do?


I had a check that I had found while I was sorting through papers, and I figured it hadn’t been cashed because it was pretty much intact and still attached to the pay stub. So I deposited it, thinking that if I had deposited once before it would deny the transaction, but the deposit went through. Afterwards, I went through my transactions and saw the exact same amount had been deposited before. After seeing that, I called the bank and told them, and they said they didn’t see the transaction go through twice. When I told them the transactions were months apart, they seemed like they didn’t know what to do. So I called again the next day, and they said the same thing. The check was for $91. I don’t know what I should do now. I don’t want any problems with that. I can’t afford it.

I recently had the stupidest idea to change my direct deposit from Wells Fargo to Bank of America (my BOFA account is about 6 months old).   Since I changed it 2 weeks in advance I was shocked when I received a check for payday. Plus I need to return back $100 to a co-worker. A co-worker worker said that how he deposits his check with BOFA. I Mobile deposited the check and was expecting some part to be available.   I got a message saying that full balance would be available on Friday, I deposited the Check on Wednesday morning around 9AM. Then Friday came and it said that would be available the Thursday next. By then I was very mad rent was coming up so I wanted to canceled my account, I even set an appointment to cancel but I couldn't.  I researched online and by what saw it seemed more likely they'll denied the check or something! I even was charged a $2 return posted check fee. So went to place I thought was a Western Union that I frequently do money transfers with. It turns out they are a check cashing place that processes Western Union. I cashed the check there.   So today at 4pm almost 2 weeks later I received a call from HR  saying that I cashed my check twice and they will sue me. I don't know why they didn't call me first. Upon checking my account BOFA cleared it. So I explained what had happened and was advised to pay it fast. Because it was late and Wells Fargo still have me at $600 limit I scraped around my other accounts and came up with $740. Still owe about $630 which I will be pay the next day. But the teller told me she'll tell her manager and the may file a  police report.   My question is:     What can I do to assure them that I didn't do it purposely and not to press charges?   Since I won't cancel due to not wanting seem fishy to my employer. Do I need to inform BOFA of this accident. I don't want any surprises later.   Will I be arrested?   Should I send HR the receipts as proof that I handled that situation?   I feel ashamed how do I move on from this? The general manager already sent email to retrain all employees on check frauds.


Having this code:  var Person = function(_name){      this.name = _name; }  Person.prototype.surname = 'Jiménez';   What's the difference between this.name and Person.prototype.surname, what changes when inherited? what's the difference then when:  var newPerson = new Person('Carlos');

What's the difference between  var A = function () {     this.x = function () {         //do something     }; };   and  var A = function () { }; A.prototype.x = function () {     //do something };


I need some help here. I am trying to convert some numbers and running in to some weird things.   I declare a double to the value 264210.35. I then multiply it with 100, and in my opinion i get the wrong result.               double value = 264210.35;              double sum = value.Value*100;             //sum = 26421034.999999996              var longSum = (long) sum;             //longSum = 25421034   When i then multiply it with 100 i excpect to get the sum of 26421035, but i don't. I get 26421034.999999996. When i use a normal calculator and multiplies the value with 100 i get 25421035. How come i don't in this case?  And when i then cast it to a long, it ends up being 26421034. Which then makes it one didgit wrong.

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


Could anybody please  explain in detail  the sentence     "Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo."   I have seen the  but am unable to get it properly.

What are some examples of awkward sounding but grammatically correct sentences?


I can't understand why we multiply by $dx$ in differential equations to integrate? People say so that we know what are we integrating with respect to, but this is obviously not true right?  What does $\;x\,dx = (y-y^2)\,dy\;$, for example, mean?  If $dx$ or $dy$ are very very small with a limit that goes to zero how can we multiply by zero?  What's a differential?  This is not an exact duplicate. I still don't know what a differential is.

$dx$ appears in differential equations, such us derivatives and integrals.  For example, a function $f(x)$ its first derivative is $\dfrac{d}{dx}f(x)$ and its integral $\displaystyle\int f(x)dx$. But I don't really understand what $dx$ is.


any news on  ? Any way around it? Please help, I really need it.   EDIT Since it seems a difficult unsolved issue, what I am asking for is a quick fix, that may help for a decent output. In particular is there any easy way to ask to render \cite into the next page, instead of a split between two pages. Since I need it within a footnote, it would not look so ugly.   EDIT  normal space between words enlarged space between words (link moved to next page)

I'm using hyperref for links in pdflatex and I have the following problem: when a bibliography citation spans across a page-break (which usually occurs with long author names), then an additional green link frame is visible at the footer and the link links the whole header of the following page.  Code (with the list of all packages I'm using):  \documentclass[a4paper,12pt,oneside]{book}  \synctex=1 % synchronize with texmaker  \usepackage[utf8x]{inputenc} \usepackage[T1]{fontenc} \usepackage[left=3.5cm, right=2cm, top=3.5cm, bottom=2.5cm]{geometry} % sizes \usepackage{newcent}  % font, Century Schoolbook \usepackage{graphicx} % include graphics \usepackage{setspace} % control line spacing \usepackage{amssymb}  % math \usepackage{amsmath}  % math \usepackage{amsthm}   % theorems \usepackage{cite}     % numeric citations \usepackage{epigraph} % quotations \usepackage{booktabs} % nice looking tables \usepackage{url}      % recognize urls \usepackage{hyperref} % links in PDF \usepackage{enumitem} % enhanced enumerations \usepackage{fancyhdr} % fancy headers and footers \usepackage{color}    % allow colors \usepackage{pdfpages} % include assignment PDFs \usepackage{texshade} % sequence alignments   \usepackage{lipsum} % just for the sake of this example  \fancyhead{} \fancyhead[LO]{\nouppercase{\textsc{\leftmark}}} \fancyhead[RO]{\nouppercase{\textsc{\thepage}}} \fancyfoot{} \setlength{\headheight}{15pt}  \begin{document}  \onehalfspacing \mainmatter \pagestyle{fancy}  \chapter{An Example Chapter}  \lipsum Stuff stuff stuff stuff stuff stuff Stuff stuff stuff stuff stuff stuff Stuff stuff stuff \cite{reference} Stuff stuff stuff stuff stuff stuff Stuff stuff stuff stuff stuff stuff Stuff stuff stuff  \bibliographystyle{apalike} \bibliography{references}  \end{document}   BibTeX file references.bib:  @Article{reference,    Author="LongSurnameOfTheFirstAuthor, D.  and LongSurnameOfTheSecondAuthor, R. ",    Title="Example text",    Journal="Journal of example articles",    Year="2004",    Volume="21",    Number="12",    Pages="2326--2339",    Month="Dec",    Note={[DOI:\href{http://www.example.com}{example}]} }   Output:    How can I get rid of this?  I'm using pdfTeX 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) and BibTeX 0.99c (TeX Live 2009/Debian).


How should often be pronounced in formal speech? "off-ten" or "of-fen"?

I heard people saying "Of-fen" as well as "Of-ton". Till now I have been using the first one but few days ago I had an interviewer who pronounced often "Of-Ton" while interviewing.


Since I upgraded to 17.04, my mouse has become a lot slower. I had set it to max fast, which I like, but now it feels like less than half as fast. I have to move my hand a lot further to reach the other end of the screen, while before, a short twist of my wrist would do the job.  How can I make my mouse pointer a lot faster, if in the settings menu it's already at maximum? I'm looking for increasing pointer acceleration in particular.  Please, Ubuntu developers, make increasing mouse speed and acceleration easy.

Is there way to increase the mouse speed in KDE4? I don't want any pointer acceleration, it's just the mouse speed that I want to change.  Edit: Unfortunately, editing the xorg.conf is not an option for me, because I want the users to be able to configure the mouse speed themselves and it is company policy do deny users permission to change the xorg.conf.


Let $\mathbb{C_+}=\{z\in\mathbb{C} :\text{Im}(z)>0\}$. If $f: \mathbb{C_+} \to \mathbb{C_+}$ is analytic and $a\in  \mathbb{C_+}$, is $|f'(a)| \leq \frac{\text{Im} (f(a))}{\text{Im}(a)}$?  This seems like it would be related to Schwarz's lemma, but we are in $\mathbb{C_+}$ instead of in $\mathbb{D}$.

Studying for a preliminary exam, I came across the following question:     Let $D = \{z \in \Bbb C : \text{Re}( z )> 0\}$ and $f : D \to D $ be a holomorphic function. Prove that $$|f'(z)|\leq\frac{\text{Re}(f(z))}{\text{Re}(z)}\quad \text{for all }z\in D.$$   I thought the best way might be to use the fact that harmonic functions satisfy the maximum modulus principle, too, along with the limit definition of the derivative, but I wasn't able to get it worked out. How should I approach this problem?


When two atoms attracted to form bond, energy is released. But where does this energy comes from. Is this energy released when electrons goes to their ground state or somewhere else?

Image a situation:   We have two atomic hydrogen atoms.  We magically collide them together dead center and perpendicular.  Each atom has exact amount of kinetic energy. We collide them with precisely enough energy to form molecular hydrogen (H2). Chemical reaction occurs: H + H -> H2 + energy My question is:    How the bond formation energy is being released?  Is it some kind of EM radiation? Photons? 2.1. If it is photons, what determines their energy and direction? If it is not EM, what is it? Vibration of the new molecule? 3.1. If it is "vibration" why does the hydrogen molecule do not decay into two atomic hydrogen?  Is there only one mechanism of energy release? Does it depends on the bond type?    I tried to search, but I can find only formulas/laws without a description how does it happens in 3D space, step-by-step with drawings/schemas/simulations.


The command   \DeclareMathSymbol{\sha}{\mathalpha}{cyrletters}{"58}   produces the russian letter Sha (III)  Which number do I have to replace 58 with in order to get the labial b?

Note I'm not actually planning on writing any, for instance, Russian prose or even any Russian words. It's just that, on paper, I've always had the habit of denoting sets by uppercase roman letters, sets of sets by script letters and, when the need arises, sets of sets of sets by uppercase Cyrillic letters. Is there some package I can load which will allow me to typeset (in LaTeX math mode) Cyrillic letters much as I would typeset Greek letters? ie. $\Zhe$ to produce an uppercase zhe. Thanks!


If my friend uses the backwards compatibility to play GTA 5 360 version on Xbox One S, and I use the Xbox One S version of the game, can I still play GTA 5 with him?  We will both be playing on our Xbox One S's, just different versions of the game - the Xbox 360 version and the Xbox One S version.

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


I work with different routers, I want my laptop to stop connecting to various wireless networks when a wireless connection is lost. Is there a way to prevent my computer from doing this?  Bonus: If windows could only re-connect with the network it had before, that would be perfect.    Operating system: windows 7

I have a internet connection with a Wi-Fi router. I use my Dell laptop to connect to it and it automatically connects to this network whenever it is available. This is just fine for me, However, sometimes one more wireless network becomes visible in my range and it seems my laptop tries to automatically connect to that network also. This causes a momentatry loss of network which is very irritating. Is there any where to configure windows not to try to connect to other networks than the one I use?


I'm running QGIS 2.8 Wien on Windows 8.1. I got this error:      The program can't start because qgis_core.dll is missing from your   computer. Try reinstalling the program to fix this problem.   I got the same error last week, uninstalled and reinstalled QGIS and it worked. But there must be a better way to fix the error than reinstalling QGIS every time it bombs out.

I have a fresh install of QGIS 2.4. When trying to open a .shp file I get the error message below.  I've followed their advice and have done several re-installs and also cleared all qgis files from my system (Parallels on Mac OS X 10.6) before those re-installs. I've tried QGIS 2.2 which caused the same problem.  Funnily all worked for a day, the following day and since not anymore...  Has anyone come across this before?


I've seen several answers for earlier versions of windows, but not 10 -- I'm runnning Windows 10.0.17134, if that matters.  It's currently set so that, on double-clicking a BAT file, it opens in Notepad++, so it's clearly something I did inadvertently (probably trying to set a program for editing, as opposed to opening). I've looked in "Settings / Choose default apps by file type" and see that BAT and CMD are both set for Notepad++, but I don't know how to reset it. If I click on the current setting, it allows me to choose Notepad++ (again, I guess) or "find an app in the app store"; after a LONG time searching (I guess) it says there are no results for ".bat". There's nothing about restoring the default.  How can I get this done?

Windows 8 64-bit. The user I'm logged in as has admin rights. When I open a cmd windows the window title even says "Administrator: cmd.exe".  So, I set my .bat file association to have the .bat file opened in Notepad++, and now I can't set it back to run the bat file when I double click on it. I've tried several web pages which told me to edit the registry to no avail.   When I do try to merge a .reg file into my PC, I get an error "You do not have permissions" or something. My user is not "administrator" but my user "chuck" does have admin rights. It always has.    I tried , the .reg file merged without error this time, but when I double click on a .bat file it still opens in Notepad++. I downloaded the file to change the .bat file assoc only. Do I have to restart the PC?  I also tried making the registry edits here: . It didn't work either.  The .bat file extension cannot be changed in the Associate File Extension with a Program in the Control panel. When I try to associate cmd.exe with a .bat file I get an error like "You cannot associate that program with this file." I found  but there is no .bat file entry under FileExts. Also on this link I have no no UserChoice key to delete for HKEY_CURRENT_USER\Software\Microsoft\Windows\CurrentVersion\Explorer\FileExts\.bat\UserChoice.  Rebooted PC, I still have the same problem. I will make sure Notepad++ is not restoring associations with itself each time it runs. EDIT: As far as NPP preferences are concerned, it does not register .bat files.    Any more ideas? I have been dealing with this for 3 months off and on now.   NOTE: Some fixes for this problem work on Windows 7 but DO NOT work on Windows 8.     UPDATE: Fixed it. I had to    Make a shortcut to regedt32.exe on my desktop.   Right click shortcut and do "Run As Administrator", even though my user has admin rights.  Search the whole registry for the string "notepad" whereon I found the sneaky little thing here: HKEY_CURRENT_USER\Software\Microsoft\Windows\\**Roaming**\OpenWith\FileExts\\.bat and deleted the UserChoice item.  Reboot windows.


A book I once owned and read back in late-80's or early-90's that I have not been able to identify title & author for:  It was a SF story concerning tiny native lifeforms, living on either a planetoid or possibly a dead/neutron star, that evolve at a seemingly accelerated time rate. Most of their story is told in the few days of observation (from orbit) by a human expedition to the planet, during which time-frame the race below progresses from stone-age tech level to being more advanced than the human observers, and eventually flying up to meet the humans in small advanced craft powered by micro-singularities... one of which accidentally 'disintegrates' the tip of a human scientist's nose in the process.

Does anyone remember the title and/or author of a sci-fi book about single-celled organisms that ended up saving the life of some astronauts?  The organisms launched a mission into space and fixed something in the astronauts spaceship.  The book dealt extensively with the concept that time passes much more quickly for single-celled organisms.  I read it in 1984.


I would like to use the \s16o2 newcommand for S$^{16}$O$_2$. How to define it? Thank you for your help!

I tend to use \newcommand to define macros for symbols I use often, e.g. \newcommand{\hankel}{H^{(1)}_0}.  One inconvenience of this approach is the fact that command names cannot include numbers.  What I ideally want is to map something like \H0 to H^{(1)}_0.  I imagine this could be done with some macro expansion/snippet package, or one might use \newcommand to define a command that takes a parameter, etc.  Before I start experimenting, though -- is there a canonical way of dealing with this problem?


How does one create a launcher for an application in Wine under Ubuntu 14.04 LTS?  Instructions at "" say, 'right click on the desktop and select "Create a launcher."'  Unfortunately, when I right click on the desktop, the options do not include "Create a launcher." Instead, I get, "New Folder "New Document", "Paste", "Organize Desktop by Name", "Keep Aligned", and "Change Desktop Background".  Thanks.

I'm able to locate stuff with the dash home then drag it down to the launcher bar on the left of the desktop, but what if the application installed via Wine isn't found via the dash search? I've right clicked on the application in the .wine directory and found no options to create a launcher either.


I would like to have a Bluetooth adapter powered off at the startup, but at the same time to be able to turn it on when I need it. I have found this advice: Add rfkill block bluetooth into /etc/rc.local before exit 0 command. This delivered the desired result in Gnome (at Dell D630 with Ubuntu 14.04) and now, when I need to turn power On at Bluetooth I just open System Tools->Preferences->Bluetooth and I can Enable it in there easily.  Now I want do the same in KDE (at Dell E6410 Kubuntu 14.04).  However, if I patch the file as above I am not able to turn Bluetooth On any more during the working session, the icon disappears and even error message is hanging in a proper window until cold power cycle.  and   Nevertheless there is place to (un)tick 'Powered' in tool Configuring Bluetooth -> Configuring Bluetooth Adpaters , please see this screenshot below.  I would like not to have this ticked at the startup. How to do that? I have not found setting which specifies this in any KDE tool, that's why my question is: how to the same what untick 'powered' does but from the command line? Then I could add such a string to, say, /etc/rc.local. The direct answer I did not get yet.   Finally I got a really WORKS FOR ME thing  by doing what is Maco's answer in this RICH THREAD,   To disable the bluetooth driver from loading on startup:  sudo $EDITOR /etc/modprobe.d/blacklist.conf   add:   blacklist btusb   Enabling it later should just be:  sudo modprobe btusb   OKAY, that's what I wanted to do - run it again, on the go, without reset. Unfortunately namely this method is keeping my LED Bluetooth indicator (at physical panel) is turning ON, which confuses me, whether it's powered or not?   BUT the most important question for me is - does this turns off the radio module itself? I would like to have no any radiation from the Bluetooth when it is turned off at startup by any means. If it's doable please point out by what approach.   Thanks.

How can I deactivate Bluetooth on system startup?


I'm trying to use Ubuntu to create a Mac Boot USB using a Mac installation iso file. I tried Startup Disk Creator, but that won't recognise the iso file. Can anyone here point me in the right direction to achieving this?

I already know how to do it on Mac OS X (plenty of instructions online).  But is it possible to do it on Ubuntu? If yes, how?


I need to go to Egypt from, I will going back from another country, so a single ticket would be enough. I don't mind flying from another European country since Brussels is well connected by budget airlines, preferably from Cyprus, my question is, are there now any ferry still running to Egypt and how they expensive?

Are there any ferries to Egypt from Italy, Turkey, Greece or any country from south Europe?


Suppose $f_{n}$ is a sequence of functions in $L^{p}(\mathbb{R}^{d})$ such that $\|f_{n}\|_{L^{p}} \leq 1$ for all $n$ and $f_{n}(x) \rightarrow f(x)$ pointwise almost everywhere as $n \rightarrow \infty$. If I also know that $f_{n}$ converges weakly in $L^{p}$ to an $\bar{f}$, then is $\bar{f} = f$ a.e.?

I'm trying to prove the following   Theorem: Let $\{f_n\}_{n\in\mathbb N}\subset L^p(\Omega)$, $f_n \to f$ in $L^p(\Omega)$ ($\Omega\subset\mathbb{R}^n$ is open and bounded, $1\leq p \leq \infty$) and $f_n \to \hat{f}$ almost everywhere. Then $f=\hat{f}$ almost everywhere.  Ideas for the proof:  We should prove that $$\int (f-\hat{f}) =0$$ We can write $$\int (f-\hat{f}) = \int (f-f_n)+\int (f_n-\hat{f})$$ Then, by weak convergence, the first integral tends to $0$ (because $1\in L^\infty\subseteq L^p$).  The problem is the limit of the second integral. We can write $$ \int (f_n-\hat{f})=\int_{\Omega \cap E} (f_n-\hat{f}) + \int_{\Omega\cap E^c} (f_n-\hat{f})$$ where $E=\{x: f_n(x) \not \to \hat{f}(x)\}$. Then $|E|=0$ and the first integral vanishes.   My question is: What should I do with the second integral? Is it enough if I use the Lebesgue Dominated Convergence Theorem, since by Hölder inequality I can easily dominate $\{f_n\}$ in $L^1$?


Is there a customer key to the "_PushTag" data view? I need it for API uses and SSJS development.

Is there any way of doing something like,  <script runat=server>     Platform.Load("core","1");     //initialize DE     var _Sent = DataExtension.Init("_Sent");     //retrieve data     var _Sent_data = _Sent.Rows.Retrieve();     Write("Length: " + _Sent_data.length); //returns 0 </script>   What would the external key for a system dataview be?


I am using our university network for my research work, and was given a new PC with Ubuntu 18.04, and an Intel i7-7700. I work a lot with machine learning applications, so I am constantly moving huge datasets (~ 30-50 GB) of relatively small files. With Linux, I run into severe performance problems when doing so, especially when using Nautilus.   For example, when working with the AVA-Dataset (255530 .jpg-images), Nautilus takes FOREVER (~3 Minutes??) to simply open the folder and display the contents! Note that I am using list layout, without any thumbnails that have to be displayed, or anything like that - just the filename, and that's it. On my Windows machine, opening similar image folders only takes about 2-3 seconds. Am I doing something wrong, or is this a general Linux-specific problem?   Help and suggestions greatly appreciated! :)

I'm wondering why Nautilus is very slow when opening a directory containing lots of files. My /usr/lib dir for example has 1900 files and it takes approximately 5+ seconds to show everything. It has been like this since I installed Ubuntu few months ago and it's really quite annoying sometimes. I don't have powerful hardware but I know that Windows Explorer is so much faster than this.   Is there anything that can be done to speed it up?  Ubuntu 10.04


I've one string with this format:  A B C D   How can I have the same pattern in a column?


I have a bib file called putascitas.bib (generated through Mendeley in Bibdesk).  Now, what do I have to do to just get the references in the end of the document? Nothing I do seems to work.  Thanks.

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}


We have built a LR model (online SGD ) in Spark. There are more that 15 categorical variables only as independent variables.  At run time new values come in few of the columns.  We have used StreamingLinearRegressionWithSGD of Spark Mlib to build the model.    How should I handle new values in the model at run time? Any guidance would be helpful.    How does model handle the coming of new variables at run time on production in industry? (Irrespective for tool/framework used to build model)?

I originally posted this in stackoverflow (as given ) but was told to try here since it might be more relevant here. I am very new to statistics and R in general so my question might be a bit dumb, but since I cannot find my solutions online I thought I should try ask it here.  I have a data frame dataset of a whole lot of different variables very similar to as follows:   Item | Size   | Value    | Town ---------------------------------- A     |  10    |   800   | 1 B     |  11    |   100   | 2 A     |  17    |   900   | 2 D     |  13    |   200   | 3 B     |  15    |   500   | 1 C     |  12    |   250   | 3 E     |  14    |    NA   | 2 A     |        |   800   | 1 C     |        |   800   | 2   Basically, I have to try and 'guess' the Size based on the type of Item, it's Value, and the Town it was sold in, so I think a regression method would be a good idea.  I now use a regression as follows:  lm(Size ~ factor(Item) + factor(Town) + Value,...)  The problem however, occurs when I try and predict the Size using this model. I have the following lines of code:  pmodel <- lm(Size ~ factor(Item) + factor(Town) + Value,...) prediction <- predict(pmodel, dataset2)   (where dataset2 is a subset of dataset which has all the empty "Size" values which I want to predict)  But this now comes up with the error:  Error in model.frame.default(Terms, newdata, na.action=na.action, xlev = object$xlevels): factor factor(Town) has new levels   Is there any way around this, or is there any way I can get the model to make prediction based on the other values if it encounters a 'level' which is not in the original dataset?


I am running a site with 2 GB ram on centos. Using LAMP  Everyday for a few hours (about 3 to 4 hours) apache goes down. It takes too long to load a page and most of time it shows Request time out. But other ports are okay like ftp also 7778, as I am using kloxo.  I am not a server expert but I have googled and done a bit research and I think this is a ddos syn attack.  I used netstat -n | grep :80 | grep SYN |wc -l to look into syn connections  During the attack it shows a number more than 3000. But when my site backs to normal it shows a number around 100.  So please help me. and tell me how to stop this this is really pissing me off.

This is a  about DoS and DDoS mitigation.   I found a massive traffic spike on a website that I host today; I am getting thousands of connections a second and I see I'm using all 100Mbps of my available bandwidth.  Nobody can access my site because all the requests time out, and I can't even log into the server because SSH times out too!  This has happened a couple times before, and each time it's lasted a couple hours and gone away on its own.  Occasionally, my website has another distinct but related problem: my server's load average (which is usually around .25) rockets up to 20 or more and nobody can access my site just the same as the other case.  It also goes away after a few hours.  Restarting my server doesn't help; what can I do to make my site accessible again, and what is happening?  Relatedly, I found once that for a day or two, every time I started my service, it got a connection from a particular IP address and then crashed.  As soon as I started it up again, this happened again and it crashed again.  How is that similar, and what can I do about it?


Let $G$ be a group and let $N$ and $K$ be normal subgroups of $G.$  All I can think of to start is by noting that if $N$ is a normal subgroup of $G$ then for all $x \in G, xax^{-1} \subseteq N.$ Also if $K$ is a normal subgroup of $G$ then for all $x \in G, xbx^{-1} \subseteq K.$ Not sure how to work with this to show $aba^{−1}b ^{−1} \in N \bigcap K.$

How to show if $H,K$ are normal subgroups in a group $G$ then $[H,K] \leq H \cap K$.  Here $[H,K]$ is the commutator subgroup.  I have tried to start it but instantly failed:   I want to show firstly that $[H,K]\subseteq H \cap K$ but I don't understand what an arbitrary element of $[H,K]$ would even look like so I have something to work on.  I thought it could look something like $h^{-1}k^{-1}hk$ but then I thought that we are working with the smallest subgroup containing elements of this form but that might not be what the actual elements are?  Could anyone help?


Consider the following code:  #include <stdlib.h>  int main() {     int* p = (int*)malloc(10 * sizeof(int));     printf("P = 0x%p\n", p); // prints some address     p[0] = 0;     printf("P[0] = %d\n", *p); // prints 0     free(p);     printf("P = 0x%p\n", p); // prints same address     printf("P[0] = %d", *p); // prints -572662307 always }   Why does the value of *p change so quickly after freeing up the memory?  I know it's undefined behavior to access and change freed memory. I'm just asking how come that cell always gets garbage written into it every time?

In Visual Studio, we've all had "baadf00d", have seen seen "CC" and "CD" when inspecting variables in the debugger in C++ during run-time.  From what I understand, "CC" is in DEBUG mode only to indicate when a memory has been new() or alloc() and unitilialized.  While "CD" represents delete'd or free'd memory.  I've only seen "baadf00d" in RELEASE build (but I may be wrong).  Once in a while, we get into a situation of tacking memory leaks, buffer overflows, etc and these kind of information comes in handy.  Would somebody be kind enough to point out when and in what modes the memory are set to recognizable byte patterns for debugging purpose?


Find the three smallest positive integers $K$ (two digits or greater) with the following properties:      1) $K=\frac{(n)(n+1)}{2}$ for some $n$      2) Each digit of $K$ is the same.   I was able to find the three $K's$ which are $55,66,666$ However, I am looking for a more systematic way. I was able to find the three numbers by testing $n$ I got the following:  For:  $55: n=10 $  $66: n=11 $  $666: n=36$  I am thinking about how can someone solve this problem without a calculator. I believe this problem is written to use a certain idea but I can't seem to find it. Does anyone see it?   As for my research, I've been reading about triangular numbers with the same digits. Someone suggested that I should $(n)$ and $(n+1)$ in prime factorization form.  I noticed that you can't get $6666$  If you try $n=115$, you get $6670$. So $6666$ is not possible.    So basically, I am looking for strategies in how to approach this problem. Any ideas?

For which $x$ exists sum $1 + 2 + 3 + \ldots + n$, where $n > 3$, which has notation $xxx\ldots x$?   In other words, I am looking for a sum of natural numbers which gives a result which has all same digits, e.g. $5555555$ or $22222222222222222$, or whatever else.  How to find this series and how to proof it for all possible series?  I have found the following examples:   $1 + 2 + 3 + \ldots + 10 = 55$ $1 + 2 + 3 + \ldots + 11 = 66$ $1 + 2 + 3 + \ldots + 36 = 666$     And what about next series which ends with (different) repeating $x$? Hot to find and proof it?


What is the mathematically rigorous way to answer the question: "what is the largest fraction less than 1"? (or to explain why it cannot be answered in the manner worded).

It can't be $5$. And it can't be $4.\overline{9}$ because that equals $5$. It looks like there is no solution... but surely there must be?


private static final  SecureRandom no = new SecureRandom(); Why should we finalize no  in here ??

I've found a couple of references () that suggest using final as much as possible and I'm wondering how important that is. This is mainly in the the context of method parameters and local variables, not final methods or classes. For constants, it makes obvious sense.  On one hand, the compiler can make some optimizations and it makes the programmer's intent clearer. On the other hand, it adds verbosity and the optimizations may be trivial.  Is it something I should make an effort to remember?


I want my std::cout  to print 000111222333 ..., but what i'm getting instead is 0111222333 ..., and i don't know why, here is my code:   int threeCounter =1; int outPut =0; for (int i =0; i<300;i++){      if(threeCounter > 3 ){         outPut++ ;         threeCounter=1;      }      cout << outPut << endl;     threeCounter++;  }   I tried the very same code in matlab, and it's producing the correct sequence:   threeCounter=1; outPut =0; for i =1:300      if(threeCounter >3)          outPut=outPut+1;         threeCounter=1;      end     disp(outPut)     threeCounter=threeCounter+1;  end

How can I format my output in C++? In other words, what is the C++ equivalent to the use of printf like this:  printf("%05d", zipCode);   I know I could just use printf in C++, but I would prefer the output operator <<.  Would you just use the following?  std::cout << "ZIP code: " << sprintf("%05d", zipCode) << std::endl;


I need to have a dash (or a bar) over a letter in a name, say G\=o ro for Goro, with one o "accented". The TeXBook tells me to do this: \=o for the dash over o. It does not seem to be working. I also tried \={o} which is on AMS website (since I am using AMSTeX), but it is not working either. I am puzzled, because other accents over letter seem to work.   Please note, the claim that the question has been answered before is incorrect, since the answers referred to concern Latex, not AMSTeX. See further discussion down below. Therefore, the problem has not been solved yet.   Minimal example  \input amstex \documentstyle{amsppt} \document   \={o}  \enddocument

How to type these special letters from European languages in latex? ä, é, and L'?


I'm intermediate Java programmer and C at beginner level, I'm willing to contribute to Ubuntu, how can I start and where to start from?   Pls explain me in detail.Interested in small projects.

I'd like to contribute to Ubuntu development some day. If you're a developer of Ubuntu could you tell me/us what are the prerequisites to start?   What languages and technologies are needed to know, how to make familiar with development (overview over the project) and development process? I am interested in the core of the distribution, the main parts, not writing applications.  I'd like to read some advice from the developer who has already some experience and can say the main points of his learning path and difficulties (that are general enough for typical Ubuntu distribution developer) he had to overcome.


I came across a name card from an academic staff, with title after the name written as PH.D    Is this proper?  WW

Question pretty self-explanatory. Should the abbreviation of the Latin term philosophiae doctor be written as PhD (no periods) or Ph.D. (with periods)?


Prior to the Battle of Scarif,      Bail Organa informed Mon Mothma that they will need every edge they can get against the inevitable confrontation against the Death Star. Mon Mothma caught on that Bail was probably planning to seek out his "Jedi friend". She appeared not to know it to be Obi-Wan, let alone that Bail actually had two surviving Jedi friends.   So the question: In light of the magnitude of the situation, why did the Rebellion seek the aid of only Obi-Wan but not also Yoda when they need every advantage they can get to destroy the Death Star?  Arguably, a superweapon like the Death Star would be an issue grave enough to force Yoda out of exile if his aid had been sought to save the galaxy, in my personal opinion.

We all knew from ANH that Leia was on a mission to bring Obi-Wan to Alderaan.  Now, in Rogue One we saw Mon asking Bail Organa to call "his jedi friend". Since Yoda always took a position of leadership both among the Jedi Order and among the Republic, shouldn't the Alliance have called for him, instead of Obi-Wan? Bail also knew that Yoda was in hiding, they meet together at the end of Episode III.  I realize that Yoda is in hiding so the Emperor and Vader would not feel his presence. Also, I know he said to Obi-Wan:     Yoda: Until the time is right disappear, we will.   Meaning they would stay in hiding until it was time to train Luke. But, since you are already going to call for a Jedi for help, why Obi-Wan and not Yoda? Or even both?


I knew playstore authority ( None other than google)  take some time to analyze the app and then gives permission.Am I right? What do they do to analyze the app? and how they check all assets( image or audio or video) are used without infringing copyright ?

I have found so many apps on the Google Play Store which are just useless. There are so many apps whose names are like "Useless App", "Nothing" and just rubbish, even in their app descriptions, it is written that this app does nothing, and those apps really do nothing. And the irony is that even these apps have hundreds of thousands of downloads. How does Google test the apps uploaded?


I have a bash script like:  files="${@:2}" for f in $files; do   echo $f done   which takes the shell expansion from the second argument to the last, and print it. However it does not work with files with spaces. It prints files:  test image.jpg   as  test image.jpg   If I use:  for f in "${@:2}"; do   echo $f done   without assigning it to $files, it works fine.   I also tried to use the first case with quoted "$files", and does not work. It prints all files in one line. How can I assign the file names to another variable, while still making it work when using expansion like for in loop?

Or, an introductory guide to robust filename handling and other string passing in shell scripts.  I wrote a shell script which works well most of the time. But it chokes on some inputs (e.g. on some file names).  I encountered a problem such as the following:   I have a file name containing a space hello world, and it was treated as two separate files hello and world. I have an input line with two consecutive spaces and they shrank to one in the input. Leading and trailing whitespace disappears from input lines. Sometimes, when the input contains one of the characters \[*?, they are replaced by some text which is is actually the name of files. There is an apostrophe ' (or a double quote ") in the input and things got weird after that point. There is a backslash in the input (or: I am using Cygwin and some of my file names have Windows-style \ separators).   What is going on and how do I fix it?


Calculation of $\displaystyle \sum_{m=1}^{\infty}\sum_{n=1}^{\infty}\frac{m^2n}{3^n\left(m\cdot 3^n+n\cdot 3^m\right)}$.  $\bf{My\; Try::}$   Let $\displaystyle S = \sum_{m=1}^{\infty}\sum_{n=1}^{\infty}\frac{m^2n}{3^n\left(m\cdot 3^n+n\cdot 3^m\right)}=\sum_{m=1}^{\infty}\left[\frac{1}{3}\cdot \frac{m^2}{ \left(3m+3^m\right)}+\frac{1}{3^2}\cdot \frac{2m^2}{(3^2m+2\cdot 3^m)}+.........\right]$  Actually I did not understand how can i solve it, Help me  Thanks

I need help with the following exercise:  determining the value of the next sum:  $$\sum _{ m=1 }^{ \infty  }{ \sum _{ n=1 }^{ \infty  }{ \frac { { m }^{ 2 }n }{ { 3 }^{ m }(n{ 3 }^{ m }+m{ 3 }^{ n }) }  }  } $$ First time I face a double sum. I have not the slightest idea how to begin to work it


I'm fairly active on UX StackExchange and have noticed a lot of tags on the site with no definition.  I'd like to volunteer to clean up some of this, but I can't find a decent way to query tags with no definitions on ux.stackexchange.com  Is this a view available to users?  I've tried  and  on stackexchange meta but haven't found an answer.  thanks?

Is it possible to find out the tags that are old and have no tag wiki?  Wouldn't it be good to find out the tags without it and possibly have a proper wiki for them? It would improve the tags a lot IMO.


I have following exercise: If $[C,D]$ is a c-number and $f(x)$ is a well-behaved function (i.e. all derivatives exist and are finite), show that: $$[C, f(D)]=[C,D]f'(D)$$  where $f'(D) = \frac{d}{dx}f(x)$  I used expansion: $$f(D) = \sum_{k} a_k D^k $$ that way: $$\sum_k a_k [C,D^k]=\sum_k a_k k [C,D]D^{k-1}$$  I don't know how to show that  $$[C,D^k]=k[C,D]D^{k-1} $$  Do I need to expand function from operator in another way?

I am trying to show that $[A,B^n] = nB^{n-1}[A,B]$ where A and B are two Hermitian operators that commute with their commutator. However, I am running into a little problem and would like a hint of how to proceed.  If A and B commute then $[A,B] = ABA^{-1}B^{-1} = e$ where e is the identity element of the group.  $$\therefore AB=BA$$  $$n=1; [A,B^1] = (1)B^0[A,B] = e$$ This statement is certainly true. however moving on to $n = 2$ I find...  $$[A,B^2] = AB^2A^{-1}B^{-2} = ABBA^{-1}B^{-1}B^{-1} = BBAA^{-1}B^{-1}B^{-1}$$  Where in the last step I have used the fact that A and B commute to rearange the terms. However, it is plain to see that this last term simply reduces to the identity as well and for the n = 2 case we have:  $$[A,B^2] = e \ne 2B[A,B] = 2Be = 2B$$  Clearly I have assumed something I shouldn't have. The fact that there is a multiplicative factor of n implies I should be adding things, but I thought if I kept it as general as possible, the answer should just fall out naturally. I don't want an answer please, only guidance.


I have the following code:  \documentclass{article} \usepackage{graphicx} \begin{document} Introduction  \begin{figure}[h!]   \includegraphics[width = 0.5\textwidth]{example-image-a}   \label{fig:a}   \caption{Image a} \end{figure}  \begin{figure}[h!]   \includegraphics[width = 0.5\textwidth]{example-image-b}   \label{fig:b}    \caption{Image b} \end{figure}  Comparison of Fig. \ref{fig:a} to Fig. \ref{fig:b}.  \end{document}   After running pdflatex on the document twice, the figure labels do not show up:    What is wrong?

\documentclass{article} \usepackage{algorithm}  \begin{document} \setcounter{section}{54} \section{A section with no label} \begin{algorithm} \label{myalg} \caption{An algorithm with the label `myalg'.} \end{algorithm} Reference to myalg: \ref{myalg}. \end{document}   With this code, the reference givens 55 (the section number); if I move the label after the caption command, I get the correct reference (1).  Why should this be the case? I find it confusing: when thinking about an algorithm as an environment, you expect to be able to label it right after you began it. At the very least I would expect some kind of error or "??" to appear, rather than the previous environment or reference-able entity being used.


This is my code  >>> ll = 'window.DETAILS_PAGE_MAP_GLOBALS = {GOOGLE_MAPS_LONGITUDE: 55.2378015294,GOOGLE_MAPS_LATITUDE: 25.0463764816}' >>> print(re.match('GOOGLE_MAPS_LATITUDE:\s*(\d+\.\d+)', ll)) None   I always get None though I am sure 100% that the regular expression is correct.  could you help please?

What is the difference between the search() and match() functions in the ?  I've read the  (), but I never seem to remember it.  I keep having to look it up and re-learn it.  I'm hoping that someone will answer it clearly with examples so that (perhaps) it will stick in my head.  Or at least I'll have a better place to return with my question and it will take less time to re-learn it.


I need to extend one of the walls by approx 30 inches.   I will be using pressure treaded 2x4 in bottom of the wall and wall will be about 83 inches high.   Which anchors should I use to secure the wall to the concrete floor? How long they should be?   Will Tapcon 1/4 x 3” work for this project?   How many anchors will I need? I was planning to use three: both ends and somewhere in the middle.   Thanks.

I'm using Pressure treated lumber for the bottom plate in a basement finishing project.   What should I use to seperate the wood from the concrete? What are ways to secure the bottom plate to the floor?


I am looking to test if two mean and standard deviation values I obtain are not significantly different (comparing a sensor method to the gold standard).  I am planning on using a two-tailed t-test in python, but I am getting confused when interpreting the results.  Does a high p-value mean that there is no significant difference and the two methods are similar?  I know this is an incredibly basic question but I don't really know statistics.  I plan on using scipy's ttest_ind and here is a box plot of my data where I am comparing each blue and orange box:

After taking a statistics course and then trying to help fellow students, I noticed one subject that inspires much head-desk banging is interpreting the results of statistical hypothesis tests.  It seems that students easily learn how to perform the calculations required by a given test but get hung up on interpreting the results.  Many computerized tools report test results in terms of "p values" or "t values".  How would you explain the following points to college students taking their first course in statistics:   What does a "p-value" mean in relation to the hypothesis being tested?  Are there cases when one should be looking for a high p-value or a low p-value? What is the relationship between a p-value and a t-value?


W: GPG error:  precise Release: The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 E: The repository 'http://us.archive.ubuntu.com/ubuntu precise Release' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.

There are now errors when updating and I cannot install most software due to a corrupted  /etc/apt/sources.list   file. Is there a copy I can download to replace it?  The file would be for Ubuntu 12.04 (Final Beta) in the United States.


The given sentence is-  'As no one knows the truth as fully as him, no one but him can provide the testimony.'  As far as the highlighted part is concerned, I improved it as-  'As no one knows the truth as fully as he does, no one but he alone can provide the testimony.'  What's is wrong in the above sentence? I am struck.

This was posted on facebook and people are saying it is incorrect, it should be: "...as you and I"   Which is correct?


Two elements $a$ and $b$ of a group $G$ are conjugate if there is an element $g$ in the group such that $b = g^{–1}ag$.   I was going through the  on conjugacy classes and was curious about this:   What can we say about a group $G$ in which all its elements are conjugate? Does it have any special properties? Can there exist such a non-trivial group $G$?

Can you show me a reasonably simple (using only elementary group-theoretic tools) example of infinite group with just 2 conjugacy classes ?


If $f$ is a periodic function with period $L$, show that the integral $\int_{a}^{a+L}f(x)dx$ is independent of a.   I appreciate your help.

I am stuck on a question that involves the intergral of a periodic function. The question is phrased as follows:  Definition. A function is periodic with period $a$ if $f(x)=f(x+a)$ for all $x$. Question. If $f$ is continuous and periodic with period $a$, then show that $$\int_{0}^{a}f(t)dt=\int_{b}^{b+a}f(t)dt$$ for all $b\in \mathbb{R}$.  I understand the equality, but I am having trouble showing that it is true for all $b$. I've tried writing it in different forms such as $F(a)=F(b+a)-F(b)$. This led me to the following, though I am not sure how this shows the equality is true for all $b$, $$\int_{0}^{a}f(t)dt-\int_{b}^{b+a}f(t)dt=0$$ $$=F(a)-F(0)-F(b+a)-F(b)$$ $$=(F(b+a)-F(a))-F(b)$$ $$=\int_{a}^{b+a}f(t)dt-\int_{0}^{b+a}f(t)dt=0$$ So, this leaves me with $$\int_{a}^{b+a}f(t)dt-\int_{0}^{b+a}f(t)dt=\int_{0}^{a}f(t)dt-\int_{b}^{b+a}f(t)dt$$ I feel I am close, and I've made myself a diagram of a sine function to visualize what each of the above integrals might describe, but the power to explain the above equality evades me.


OK my krabby is a boy with sheer force and a staryu who hold a everstone and is timid do you think I will get a staryu with its hidden ability?

I want to legitimately breed a competitive team, but I don't know how to breed for hidden abilities unless I just breed two Pokemon who have their normal ability(s) together until I breed one with a hidden ability. Does someone know a useful trick or item I could use?


I want to generate a list of random numbers between a specified range and of a certain size.  I've tried using streams, and I think this is probably the best solution. I couldn't get it working myself, but I have not learned enough about streams yet.  The following code works for my problem, but I'd like to be able to use something from the Java api if possible. If I were to use stream's map method, I would need to use a consumer with n -> ThreadLocalRandom.current().nextInt(min, max + 1), but I could not appropriately collect at the end of my stream.  import java.util.*; import java.util.concurrent.ThreadLocalRandom;  class Scratch {     public static void main(String[] args) {         System.out.println(getRandList(100, 0, 10));     }      /**      * Get n random integers within the range of min and max      */     static List<Integer> getRandList(int size, int min, int max) {         List<Integer> integers = new ArrayList<>(size);         for (int i = 0; i < size; i++) {             integers.add(ThreadLocalRandom.current().nextInt(min, max + 1));         }         return integers;     } }   The referenced duplicate does not address my question directly, I wanted a List<Integer> and Oleksandr's solution provides a IntStream.

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 trying to add a geometry column to an existing table in PostgreSQL inside a plpgsql function using   EXECUTE format('ALTER table %I add column geom geometry(Point, 102003)', target_table);   Its raising an error "type "geometry" does not exist".   There is PostGIS extension installed in the database which I am running. Only thing is my table are not in public schema.

I'm trying to add a geometry colunm to a table in a database with postgis extention enabled (other tables in this schema even have geometry colunms), but it fails:  ALTER TABLE my_schema.my_table ADD COLUMN geom geometry(MultiPolygon, 4326);   gets me an error:  ERROR:  type "geometry" does not exist   although   CREATE EXTENSION postgis;   returns   ERROR:  extension "postgis" already exists   I'm running Postgres 9.5, but I cannot tell postgis verion because it throws another error   ERROR:  function postgis_full_version() does not exist   Although postgis is listed under extensions in pgadmin.


I get an error screen from software updater that system is not connected to internet. . However, the system is connected to internet and all other function over the network are working perfectly fine. Please guide, how to go about the upgrade to latest 20.04.  i further used  sudo apt update and got the following errors:-  $ sudo apt update Ign:1 cdrom://Ubuntu 20.04 LTS _Focal Fossa_ - Release amd64 (20200423) focal InRelease Err:2 cdrom://Ubuntu 20.04 LTS _Focal Fossa_ - Release amd64 (20200423) focal Release   Please use apt-cdrom to make this CD-ROM recognized by APT. apt-get update cannot be used to add new CD-ROMs Hit:3 https://deb.opera.com/opera-stable stable InRelease Hit:4 http://archive.ubuntu.com/ubuntu focal InRelease                          Ign:5 http://ppa.launchpad.net/alexlarsson/flatpak/ubuntu focal InRelease       Hit:6 http://security.ubuntu.com/ubuntu focal-security InRelease                Hit:7 http://archive.canonical.com/ubuntu focal InRelease                       Hit:8 http://archive.ubuntu.com/ubuntu focal-security InRelease                 Hit:9 http://archive.ubuntu.com/ubuntu focal-updates InRelease                  Ign:10 http://ppa.launchpad.net/clipgrab-team/ppa/ubuntu focal InRelease        Hit:11 http://archive.ubuntu.com/ubuntu focal-backports InRelease         Hit:12 http://ppa.launchpad.net/costales/yaru-colors-folder-color/ubuntu focal InRelease Ign:13 http://ppa.launchpad.net/heyarje/libav-11/ubuntu focal InRelease Ign:14 http://ppa.launchpad.net/ravefinity-project/ppa/ubuntu focal InRelease Err:15 http://ppa.launchpad.net/alexlarsson/flatpak/ubuntu focal Release   404  Not Found [IP: 91.189.95.83 80] Err:16 http://ppa.launchpad.net/clipgrab-team/ppa/ubuntu focal Release   404  Not Found [IP: 91.189.95.83 80] Err:17 http://ppa.launchpad.net/heyarje/libav-11/ubuntu focal Release   404  Not Found [IP: 91.189.95.83 80] Err:18 http://ppa.launchpad.net/ravefinity-project/ppa/ubuntu focal Release   404  Not Found [IP: 91.189.95.83 80] Reading package lists... Done E: The repository 'cdrom://Ubuntu 20.04 LTS _Focal Fossa_ - Release amd64 (20200423) focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/alexlarsson/flatpak/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/clipgrab-team/ppa/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/heyarje/libav-11/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/ravefinity-project/ppa/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   how can i liquidate these errors. i am completely new to linux. Can someone please guide me through this?  Further, i used lsb_release -a  and got  No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 20.04 LTS Release:    20.04 Codename:   focal

Update  appear to have been updated recently (as of writing this the last update appears to have taken place on 3rd of June) to include the following statement:  The -d switch is necessary to upgrade from Ubuntu 18.04 LTS as upgrades have not yet been enabled and will only be enabled after the first point release of 20.04 LTS.  Also note that .  TLDR (as of 15 Aug 2020):   is the canonical tracking document for the first Focal Fossa point-release (20.04.1). It’s a live document. The Ubuntu release team will be updating it as we work on releasing 20.04.1. […] Upgrades from 18.04 to 20.04.1 are still disabled as we are working through a few upgrade blockers   Edit The answers (so far) do not answer the question. The question is pretty simple. Ubuntu.com points to a "FinalRelease", which turns out to be a "Development Release", see evidence below. I'm not asking how and when to upgrade. I'm pointing out what seems to me to be an apparent inconcistency (in semantics, linguistics, logic) in the way Ubuntu names or labels its releases. From an answer to the question I'd except someone to pick up and acknowledge this inconsistency. An answer could start with a "Yes, ..." or a "No, ...", for starters. (Moreover, a good answer could distinguish between the release being in dev stage and/or the upgrade process (e.g. from LTS to LTS) being in dev stage, if appropriate.) This question, as I see it, is not a duplicate. Futher, I think it is a question which deserves a non-patronizing answer. Thanks.   indicates that today (23rd April 2020) the new Ubuntu 20.04 LTS is to be released.  See "condensed screenshot" here:  Indeed, it seems that that's what happened, see  and :  However, when following the instructions to upgrade (from 18.04 LTS to 20.04 LTS) found  and elsewhere (edit: actually , too!), even prior to the July point release, I'm a bit confused to see that the instruction is to use update-manager -d which also points to the "Development Release" (see screenshot below) rather than the "FinalRelease" (see screenshot and link above). Is the "Final Release" (which I'm after) the/a "Development Release"? Why isn't it called something like "Production Release" or "Final Release"? When will it no longer be referred to as "Development Release"? In July? I'm confused :(


How do I reduce the filesize of videos? For some reason, by phone takes giant videos. The worst of these is a 20 minute video that takes up an entire 13 GB. How can I shrink the filesizes of these? They are mp4s encoded in H.264 and MPEG-4 AAC and play at 30 fps.  It's okay if there is reduction in quality.   I tried using avconv to reduce resolution, but even though this outputted a video with smaller dimensions, the size had bizarrely increased.  What is a good way for reducing the sizes of these file?

I would like to convert a Mp4 file in HD into a Mp4 file of lower resolution. Is there any software that can be used for this?


I am trying to show that F2 (the free group on 2 elements) has an infinite index, free subgroup of rank 2. As it has to be a free subgroup of rank 2 I'm guessing I need to find 2 elements in F2 that generate a free subgroup together (satisfying no relations between them), and then also add in the constraint that the group they generate has infinite index in F2. However, I'm really struggling to get my head around what it means for a group to have 'infinite index' and how, even if I found such a pair of elements somehow, how I could prove that they had infinite index in F2. Also, this question occurs before material about topological methods such as covering spaces, so I would like to answer this without such tools, so I guess purely algebraically. Any hints, suggestions or indeed solutions would be much appreciated.

This is a homework question: I need to find three subgroups of the free group with two generators, $F_2$, with certain properties. I have found the other two by constructing covering spaces of $S^1 \vee S^1$ and using fundamental groups; I don't think that this approach works here:     Show that $F_2$ has an infinite index, free subgroup of rank two.   If anyone could nudge me in the right direction I'd be very grateful!


I know there is a lot of thread on this but I'm still trying to figure out what is the best option now in 2018.   Is there a kind of built-in method to integration voice control inside my c# WPF application? What is the best solution (free or paid) ?   I just need something to start with and make sure I'm going to the right direction. (since many thread and infos are not recent)  Thanks.  Michel

I have need to write an application which uses a speech recognition engine -- either the built in vista one, or a third party one -- that can display a word or phrase, and recognise when the user reads it (or an approximation of it).  I also need to be able to switch quickly between languages, without changing the language of the operating system.  The users will be using the system for very short periods.  The application needs to work without the requirement of first training the recognition engine to the users' voices.  It would also be fantastic if this could work on Windows XP or lesser versions of Windows Vista.  Optionally, the system needs to be able to read information on the screen back to the user, in the user's selected language.  I can work around this specification using pre-recorded voice-overs, but the preferred method would be to use a text-to-speech engine.  Can anyone recommend something for me?


I want permanent storage that will be added to about every week. The old stuff needs to be kept secure and new stuff needs to be added every week. I am presently using DVD. This seems reasonably good. I have some older discs and most data seems retreivable. However, the last few files on every discs no longer seem accessible on most of my DVD readers. However, an old 10 years old DVD reader can still read those files, so it might be a case of the original DVD writer writing a little bit more data than the new DVD readers can read. Is my assumption that DVD writers write/read different amounts of data correct? In 2020 I am reading articles saying:  SSD drives can only be written to a certain number of times and then become unusable. I cannot find how permanent the data is once written. Does anyone know how long, once written, the data will last?  HDD only last about 3-5 years, so this seems a bad way of storing data long term. Is that correct? Is that due to the moving parts?  The DVD presently seems the most sturdy, but is obviously limited to about 4GB per disc. The data is on a disc which is disconnected from the reader with the moving parts than can be replaced. Would Blu Ray be a better/similar option. I think that is about 25GB per disc for a comparible price?  I am presently saving on DVD+R, but can only find BluRay-R. What is the difference? I was always told to buy +R DVDs as they were better, but I never knew why. Can someone explain?  Does anyone know any other, better long term storage device? What is everyone's personal choice they use? It has to be added to every week, but the old data needs to be kept secure.   PS. I do not want to use the cloud.

This question was inspired by . There have been other similar questions, but none with the same criteria.  This is two questions in one.   How do you store financial/critical records that should survive anything but a fire and should be available for decades? Lets say I want to store family photos/videos and want people do be able to find them in storage 100 years from now and still be able to use them. How would this be done?   Criteria   Long term means 30+ years guaranteed. 100+ years average. [If this is not practical, use the closest solution] High volume means a couple terabytes. Answers can be 'no-compromise/industrial' solutions or practical solutions for the home office/small business user. Media will not be active during the timespan. (i.e., if you suggest hard drives, they will not be spinning).  Further, there is no expectation of needing to read these archives. They are there for emergency or "for future generations" purposes. Should not require maintenance (if at all possible).    My thoughts:   CD-R/DVD-Rs have proven to me, even in the short term, to be a terrible medium for backups. They seem to be very fragile and seem to lose their data a very short time even when in pristine condition. I can't help but think that storing data on a couple of 1TB hdd's and then expecting them to spin up correctly a decade or two later to be a terrible idea. Am I wrong? Industrial tape drives seem like a viable option?


From  we learn that in order for Bash to perform auto-completion one must perform . /etc/etc/bash_completion.d/foobar (note the space after .) in order for Bash completion to work.  $ /etc/bash_completion.d/ssh bash: /etc/bash_completion.d/ssh: Permission denied $ . /etc/bash_completion.d/ssh $ ls -l /etc/bash_completion.d | grep ssh -rw-r--r-- 1 root root   297 Jan 28 18:04 ssh   Is . a shortcut for the source command? If not, then what is it? It is impossible to google for, man source returns nothing, and apropos source and info source give so much irrelevant information that I cannot tell if what I'm looking for is in there. How might I even begin to RTFM to find the answer to this question myself?

I was viewing my .bash_profile file, and I saw this written inside a block of if statement:  if [ -f ~/.bashrc ]; then        . ~/.bashrc    Can someone explain what the second line is actually doing?


Does anyone have any research or a/b testing regarding whether people are more likely to read and retain information when type is on an image as opposed to a standard background? I'd imagine that people tend to skip over type on images because of the visual distraction, but I'd like to have some data to back up that assumption.

The new fad is to place background images behind text. Best practice guidelines say it's important for the image to be relevant to the content. From a usability point of view, the content is less readable. You see this happening a lot on apple.com.  I'm curious what the big guys like the NN/Group would have to say about this. Bad for usability, marketing guys want it... worth it? I'd like to hear your thoughts.  And thank you to the mods who want to call this question a duplicate, but I'm talking about text on top of background images. The other question on this talked about color consistency affecting contrast. Thanks for your consideration.


How can I prove this? If $A, B ⊂ R^L$ are convex sets, then $A + B$ is also convex, where  $A + B =\{c ∈ R^L :$ There is $a ∈ A , b ∈ B$ such that $c=a+b\}$

Let $A$ and $B$ be two convex subsets in $\mathbb{R}^n$.    Define a set $C$ given by   $$C = A + B = \{a + b : a \in A \mbox{ and } b \in B\}.$$   Is $C$ a convex set?


I try to install NetBeans IDE on my MacBook Air (2017) with macOS Sierra. I tried both from .dmg file and directly with Homebrew, with the same result - the installation freezes. Have any of you guys had this problem?  Here is the screenshot of what I've been seeing for like 2 hours:

I want to install Eclipse or Netbeans on macOS Sierra. When I try to run Eclipse, I get an warning that Java 6 is needed. I downloaded the latest version of Eclipse to be sure.     So I tried Netbeans:    While at the same time the System settings report that Java 8 is installed and up to date.    How can I get either Eclipse or Netbeans working on macOS Sierra?


What should I do, if I have some issues and when searching on a Stack Exchange site, I found that the same question is already asked by someone else, but yet not answered (or answered but that's not accepted)?   If I ask the question it would be an exact duplicate at that Stack Exchange site. (I do not have enough reputation to comment, or to put bounties on the asked question.)

Suppose you had a question, and you really want a good answer that would solve your problem, but noticed it was already asked by someone else. However, no one has posted any answers. The question is technically considered "unanswered", but a lot of users who would otherwise bother to give a correct answer probably skip the question completely for some reason.  What should I do in this case?  One idea is to ask a new, completely identical question, in the hope users will notice the new question and post an answer there. But would that go against SE policy?     Note: This is adapted from , but that doesn't cover the case where the original question is unanswered. Also, it is not a duplicate of , as that question asks about getting attention for one's own questions, while this one and the one linked above ask about getting an answer if someone else has already posted the same thing.


I have these classes:  class Animal(abc.ABCMeta):     @abc.abstractmethod     def speak(self):         raise NotImplementedError()      def speak_twice(self):         self.speak()         self.speak()  class Cat(Animal):             def speak(self):         print("Meow")  class Dog(Animal):         def speak(self):         print("Voff")   And the outcome is this:  Meow Meow   when I use buster.speak_twice()  I want the outcome to be this:   "Meow Meow"   I've tried changing a lot in the speak_twice function, like making the 2 different speak to str() and returning it and I've tried to change it to print.

I'd like to do it in Python. What I'd like to do in this example in C: #include <stdio.h>  int main() {     int i;     for (i=0; i<10; i++) printf(".");     return 0; }  Output: ..........  In Python: >>> for i in range(10): print('.') . . . . . . . . . . >>> print('.', '.', '.', '.', '.', '.', '.', '.', '.', '.') . . . . . . . . . .  In Python print will add a \n or space, how can I avoid that? Now, it's just an example, don't tell me I can first build a string then print it. I'd like to know how to "append" strings to stdout.


My question is very simple, i want to download ubuntu 13.04 from ubuntu official website, can any one tell me from where should i download it

I want to know where I can find updated information about all the stable and in-development versions of Ubuntu, where I can find this information?     This question is meant to be a canonical question. It expects to answer the following questions:         Is X version stable yet?   Is X version in beta?   Is X version still supported?   What versions are still supported?   What are the versions in Beta/Alpha?   Until where X version will be supported?   Have X version ceased support?   When will be X version released?   Where I can download any release?   When will the next LTS version of Ubuntu be released?         The list is not exhaustive.


this is the loop im executing for(int i=0;i<str.length;i++){     if (str[i]==strFind) {         str[i]=strReplace;         count++;     } }  The problem is that if the last word of the sentence has a period in some test cases and it doesn't have a period in some.And if i replace the word in the given manner. I cannot retain the period. Is there a simpler solution for this? Also, can replace all take a sting variable(strReplace-user input)?

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?


Can someone help me on SQL Query to filter rows according to a string.   Consider i want to display all rows which contains a string = 'PARIS'. No speicific column to mention. Need filtering at entire row level.  Is it possible?  Thanks in advance.

Is it possible to search every field of every table for a particular value in Oracle?  There are hundreds of tables with thousands of rows in some tables so I know this could take a very long time to query. But the only thing I know is that a value for the field I would like to query against is 1/22/2008P09RR8. <  I've tried using this statement below to find an appropriate column based on what I think it should be named but it returned no results.  SELECT * from dba_objects  WHERE object_name like '%DTN%'   There is absolutely no documentation on this database and I have no idea where this field is being pulled from.  Any thoughts?


Does  trigger ETB (enter the battlefield) effects?  My guess is, that the card doesn't trigger ETB effects, since it's already in play. But the lack of rulings that specify this case make me unsure.  To compare, on 's gatherer page, the rulings mention ETB effects:     Enters-the-battlefield abilities of the creature card Lazav is copying won’t trigger as Lazav is already on the battlefield when it becomes a copy of that creature card.   's gatherer page doesn't specify any such ruling. Can I assume it's the same for it as well?

I want to cast  on a strong creature on my battlefield so that my 's ability will trigger.  The creature that will become the copy is already on the battlefield, but when it becomes a copy of the strong creature, will this trigger my Hamletback Goliath's ability?   For reference, Hamletback Goliath reads:     Whenever another creature enters the battlefield, you may put X +1/+1 counters on Hamletback Goliath, where X is that creature's power.


This is what I have to prove:  $\lim_{n\rightarrow\infty}\inf a_n\leq\lim_{n\rightarrow\infty}\inf(\frac{1}{n}\sum_{i=1}^na_i)\leq\lim_{n\rightarrow\infty}\sup(\frac{1}{n}\sum_{i=1}^na_i)\leq\lim_{n\rightarrow\infty}\sup a_n$  Note, that $a_n$ and $b_n$ are bounded sequences. I'm gonna be totally honest: I have no clue where to even start with this proof. Can someone give me some advice?

This is a question from the book Methods of Real Analysis by R. R. Goldberg.     If $(s_n)$ is a sequence of real numbers and if $$\sigma_n=\frac{s_1+s_2+\cdots+s_n}{n}$$ then prove that: $\operatorname{{lim sup}}\sigma_n \leq \operatorname{lim sup} s_n$.   I don't have any idea how to start working on this problem. Please help. Thanks.


I tried to solve but could not develop the left part of the equation    Thanks

a) Give a combinatorial proof that for every $n \geq r \geq 1$ that:  $$\sum_{i = 0}^{n} \binom{i}{r - 1} = \binom{n + 1}{r}$$  And use (a) to concoct a formula for $1^2 + 2^2 + ... + n^2$


Hi I am given this problem and I am supposed to use fermat's theorem. Here is it is: Prove that $$24^{31} \equiv 23^{32} \pmod{19}$$  We are supposed to solve it by setting up the congruence like this:  $$24^{31} \equiv x \pmod{19}$$  $$23^{32} \equiv x \pmod{19}$$  I am just confused how to break it down.  I was hoping someone can guide me through this question

I was given this problem (I have to prove) and not sure if I use fermat's theorem  $24^{31} ≡ 23^{32} (mod 19)$  If I do use fermat's is this right:  I would do the LHS first:  $24^{18}·24^{13} ≡ 1·24·24^{12}$  RHS:  $23^{18}·23^{14} ≡ 1·23^{14}$  I am not sure where to from here or if it is correct thus far. I have looked at some other posts but they have not helped with this problem.


I wanted to use the "Randomize Transform" tool as described   Or in the first half of that .  Following the video, after seperation of each individual cube into single objects, when I want to use the tool, everything is greyed out, like in the attached screenshot.    What am I doing wrong here?

I have lost functionality in the tool shelf. When I click on a selector or something in the bottom part of the tool self that you can hide and unhide, nothing happens. I can see the options but when I click it doesn't work. See screenshot where it says "Add Cylinder".


I wanted to draw a simple protocol flow using the tikz package. However, I got some errors and really don't know how to deal with them.  Here's the code in LaTeX:  \documentclass[12pt]{article} \usepackage{tikz} \usepackage{tkz-base,tkz-fct} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{graphicx} \usepackage{psfrag} \usepackage{amsmath} \usepackage{msc} \begin{document}  \begin{figure*}[!h] \center \resizebox{12cm}{!} { \begin{msc}{$IJS_{NK, dec/enc}$} \small \setlength{\instwidth}{1.7 cm} \setlength{\instdist}{2.3 cm} \setlength{\bottomfootdist}{0.2 cm} %\setlength{\instwidth}{2 cm} %\setlength{\instdist}{3.75 cm} \setlength{\envinstdist}{1.2 cm} \setlength{\topheaddist}{0.5 cm} \instfoot  \declinst{I}{\scriptsize new node}{$I$}  \declinst{R}{\scriptsize neighbour node}{$R$} \declinst{J1k-1}{\scriptsize intermediate nodes}{$J_{1:k-1}$} \declinst{Jk}{\scriptsize \:\: intermediate node}{$J_{k}$} \declinst{S}{\scriptsize Sink}{$S$}  % left to right messages \mess{$m_1 = \{n_I, I, R\}_{K_{DH}(I,S)}$}{I}{R} \nextlevel \mess{$\{n_R, m_1\}_{NK}$}{R}{J1k-1} \nextlevel \mess{$\{n_{J_{k-1}}, ..., n_{J_1}, n_R, m_1\}_{NK}$}{J1k-1}{Jk} \nextlevel \mess{$\{n_{J_k}, ..., n_{J_1}, n_R, m_1\}_{NK}$}{Jk}{S} \nextlevel  % right to left messages \nextlevel \mess{$\{n_{J_k}, ..., n_{J_1}, n_R, m_2\}_{NK}$}{S}{Jk} \nextlevel \mess{$\{n_{J_{k-1}}, ..., n_{J_1}, n_R, m_2\}_{NK}$}{Jk}{J1k-1} \nextlevel \mess{$\{n_R, m_2\}_{NK}$}{J1k-1}{R} \nextlevel \mess{$m_3$}{R}{I} %\nextlevel \end{msc} } \fbox{ \begin{minipage}{11.5 cm} $m_2 = \{pk(I), \{n_I, I, R, S\}_{K_{DH}(I,S)}\}_{K_{DH}(R,S)}$\\ $m_3 = \{K(R,I), \{n_I, I, R, S\}_{K_{DH}(I,S)} \}_{pk(I)}$ \end{minipage}  } \caption{$IJS_{NK, dec/enc}$: Proof by Induction.} \label{figure : IJS-NK-dec-enc Induction} \end{figure*}  \end{document}   I compile it in console using: pdflatex -synctex=1 -interaction=nonstopmode toc.tex.  My pdflatex version is:  pdfTeX 3.1415926-2.5-1.40.14 (TeX Live 2013/Debian) kpathsea version 6.1.1 Copyright 2013 Peter Breitenlohner (eTeX)/Han The Thanh (pdfTeX). There is NO warranty.  Redistribution of this software is covered by the terms of both the pdfTeX copyright and the Lesser GNU General Public License. For more information about these matters, see the file named COPYING and the pdfTeX source. Primary author of pdfTeX: Peter Breitenlohner (eTeX)/Han The Thanh (pdfTeX). Compiled with libpng 1.2.49; using libpng 1.2.50 Compiled with zlib 1.2.8; using zlib 1.2.8 Compiled with poppler version 0.24.5   However, I'm using it "inside" TeXMaker on Kubuntu 14.04.  pdflatex -synctex=1 -interaction=nonstopmode toc.tex > errors.txt:  Here's the *.log file: , and the errors .  xelatex toc.tex > xelatexerrors.txt:     latex toc.tex > latexerrors.txt:    Adding \usepackage[pdf]{pstricks} produced an empty pdf (I did pdflatex -synctex=1 -interaction=nonstopmode toc.tex > errors.txt), here're the erros:


Is it possible to make the display on a Android phone to a TV or a PC Monitor?   What are the methods that I can connect the Android phone to a TV (e.g. plasma TV) or a PC Monitor and then modify some configuration in the phone so that the display will be shown in the TV or the PC Monitor screen?

I have scoured the Internet and come here as my last hope.  I currently have the Galaxy S4, M919v. I own two 24 inch Samsung monitors.  Is there any method for me to display my Android screen onto one of my monitors?  I want to basically play my Android games, using my Android phone, but have them displayed on my monitors. My 24 inch monitor has the same resolution as my phone, so I figure the graphics should be great.  I am trying to find a WIFI/micro-usb cable solution to this problem without buying any types of additional connectors.


When I was studying cross and dot products, I learned that the cross product of two vectors A and B is perpendicular to both A and B. But my mind is unable to understand that. Since both A and B are lying in same plane, how can their cross product be in a different plane?  I also found this concept in circular motion, where the torque is outwards from the plane of paper in which the circle has been formed. When I asked my teacher about that, he told me     This is not an actual direction, this is just a symbolization. The particle doesn't actually feel any force or such in that direction.   If this is so, then a particle should also not feel a force in a uniform magnetic field in which the particle is moving perpendicular to the field, because the force is perpendicular to both the velocity and the magnetic field.  Please help. I am confused here.

I have an intuition problem  calculating torque using the cross product formula.  As for example let the magnitude of the force be 50 lbs and length of the  wrench be one foot and you are exerting force in a clockwise motion and the angle you apply the force 60 degrees.  This is an example so I can ask my question.  Using the right hand rule the torque points  perpendicular to the force you are applying to the bolt. In this case since the sine of 60 degrees is about .86 it would be (.86)(50) foot lbs. How can the bolt turn clockwise if the force is concentrated perpendicular to where it needs to turn?  The cross product formula demands the torque be perpendicular. Obviously my mistake but I don't see where.