I have a system with dual boot for Windows 7 and Ubuntu 12.04. The system uses Grub as its boot loader. But, today by mistake, i shrank the Windows Volume and created a new Volume and all worked fine, except when i restarted to discover that boot-loader has gone wrong. It displays:    error: no such partition   grub rescue>     I ran through google and several forums to finally discover many things. Such as:    grub rescue> ls (hd0) (hd0,msdos5) (hd0,msdos4) (hd0,msdos3) (hd0,msdos1)     Now, i can load back to grub-menu and boot into Ubuntu as well as Windows normally, but by fighting with grub-rescue as:    grub rescue> set root=(hd0,3)/boot/grub   grub rescue> set prefix=(hd0,3)/boot/grub   grub rescue> insmod normal   grub rescue> normal     Although, this takes to Grub-menu for choosing OS, but i want to get away with this. How, can i fix the Grub to get back the screen as earlier? Probably, it requires some resetting in grub, which i can't figure out. Please provide any method. PS: try to suggest a method, that uses normal user account, as i have to go more for getting sudo password. Thanks.

I have a multiboot system set up. The system has three drives. Multiboot is configured with Windows XP, Windows 7, and Ubuntu - all on the first drive. I had a lot of unpartitioned space left on the drive and was reserving it for adding other OSes and for storing files there in the future.  One day I went ahead and downloaded Partition Wizard and created a logical NTFS partition from within Windows 7, still some unpartitioned space left over. Everything worked fine, until I rebooted the computer a few days later.  Now I'm getting:    error: unknown filesystem.   grub rescue>   First of all I was surprised not to find any kind of help command, by trying:    help, ?, man, --help, -h, bash, cmd, etc.  Now I'm stuck with non-bootable system. I have started researching the issue and finding that people usually recommend to boot to a Live CD and fix the issue from there. Is there a way to fix this issue from within grub rescue without the need for Live CD?  UPDATE  By following the steps from , I was able to boot to initramfs prompt. But not anywhere further than that.  So far from reading the manual on , I was able to see my drives and partitions using ls command. For the first hard drive I see the following: (hd0) (hd0,msdos6) (hd0,msdos5) (hd0,msdos2) (hd0,msdos1)  I now know that (hd0,msdos6) contains Linux on it, since ls (hd0,msdos6)/ lists directories. Others will give "error: unknown filesystem."  UPDATE 2  After the following commands I am now getting to the boot menu and can boot into Windows 7 and Ubuntu, but upon reboot I have to repeat these steps.    ls ls (hd0,msdos6)/ set root=(hd0,msdos6) ls / set prefix=(hd0,msdos6)/boot/grub insmod /boot/grub/linux.mod normal   UPDATE 3  Thanks Shashank Singh, with your instructions I have simplified my steps to the following. I have learned from you that I can replace msdos6 with just a 6 and that I can just do insmod normal instead of insmod /boot/grub/linux.mod. Now I just need to figure out how to save this settings from within grub itself, without booting into any OS.  set root=(hd0,6) set prefix=(hd0,6)/boot/grub insmod normal normal   UPDATE 4  Well, it seems like it is a requirement to boot into Linux. After booting into Ubuntu I have performed the following steps described in the :  sudo update-grub sudo grub-install /dev/sda   This did not resolve the issue. I still get the grub rescue prompt. What do I need to do to permanently fix it?  I have also learned that drive numbers as in hd0 need to be translated to drive letters as in /dev/sda for some commands. hd1 would be sdb, hd2 would be sdc, and so on. Partitions listed in grub as (hd0,msdos6) would be translated to /dev/sda6.  UPDATE 5  I could not figure out why the following did not fix grub:  sudo update-grub sudo grub-install /dev/sda   So I downloaded  based on an answer from  post. That seemed to do the trick after I picked the "Recommended Repair (repairs most frequent problems)" option.


Antimalware Service Executable (Win10) has had disk usage pegged at 100% for five hours and counting. Is there any way to get some level of detail what specifically it's doing and/or an estimate of when it will be done?   This seems pretty basic but every search I've tried yields piles and piles of "solutions" that involve disabling the service. I don't want to do that. What is Antimalware Service Executable actually doing? What other solutions are there to fix the problem?  Edit: Explanation of why it is not a duplicate question:  The single answer on the "" is installing a different antivirus program. That's not in any sense an answer for how to find out what Antimalware Service Executable is doing.  Edit: I did not change the subject and I don't think it reflects the question. I am not asking how to make the process stop having high disk usage. I'm asking how to get some information about what the process is currently doing instead of just guessing.

Ever since upgrading to Windows 10 1903 the other day, my CPUs have all been pegged at 100%.  "Antimalware Service Executable" is using 60%, and "Microsoft OneDrive (32 bit)" is using 35% (with the other 5% being spread amongst everything else running).  After running like this for a day or so my computer case (Surface Tablet) is smoking hot.  How can I find out what's causing this problem?  Is there logging I can review for those services?  Known issues with 1903 that I just can't find on Google?


I was making a trading system on my minecraft server (e.x. 64 iron blocks = good armor) and i couldnt figure out how to make the villagers sell custom prefilled chests if you want to do it for me i would love it! Prefilled chest give command:  /give @p chest{display:{Name:"\"Iron Rank\""},BlockEntityTag:{Items:[{Slot:0,id:iron_helmet,Count:1,tag:{Enchantments:[{id:protection,lvl:4},{id:respiration,lvl:3},{id:aqua_affinity,lvl:1},{id:thorns,lvl:3},{id:unbreaking,lvl:3},{id:mending,lvl:1}]}},{Slot:1,id:iron_chestplate,Count:1,tag:{Enchantments:[{id:protection,lvl:4},{id:thorns,lvl:3},{id:unbreaking,lvl:3},{id:mending,lvl:1}]}},{Slot:2,id:iron_leggings,Count:1,tag:{Enchantments:[{id:protection,lvl:4},{id:thorns,lvl:3},{id:unbreaking,lvl:3},{id:mending,lvl:1}]}},{Slot:3,id:iron_boots,Count:1,tag:{Enchantments:[{id:protection,lvl:4},{id:feather_falling,lvl:3},{id:thorns,lvl:3},{id:depth_strider,lvl:3},{id:unbreaking,lvl:3},{id:mending,lvl:1}]}},{Slot:4,id:iron_sword,Count:1,tag:{Enchantments:[{id:sharpness,lvl:5},{id:knockback,lvl:2},{id:fire_aspect,lvl:2},{id:looting,lvl:3},{id:sweeping,lvl:3},{id:unbreaking,lvl:3},{id:mending,lvl:1}]}},{Slot:5,id:iron_pickaxe,Count:1,tag:{Enchantments:[{id:efficiency,lvl:5},{id:unbreaking,lvl:3},{id:fortune,lvl:3},{id:mending,lvl:1}]}},{Slot:6,id:iron_pickaxe,Count:1,tag:{Enchantments:[{id:efficiency,lvl:5},{id:silk_touch,lvl:1},{id:unbreaking,lvl:3},{id:mending,lvl:1}]}},{Slot:7,id:iron_axe,Count:1,tag:{Enchantments:[{id:sharpness,lvl:5},{id:efficiency,lvl:5},{id:unbreaking,lvl:3},{id:fortune,lvl:3},{id:mending,lvl:1}]}},{Slot:8,id:iron_shovel,Count:1,tag:{Enchantments:[{id:efficiency,lvl:5},{id:unbreaking,lvl:3},{id:fortune,lvl:3},{id:mending,lvl:1}]}},{Slot:9,id:iron_shovel,Count:1,tag:{Enchantments:[{id:efficiency,lvl:5},{id:silk_touch,lvl:1},{id:unbreaking,lvl:3},{id:mending,lvl:1}]}},{Slot:10,id:iron_hoe,Count:1,tag:{Enchantments:[{id:unbreaking,lvl:3},{id:mending,lvl:1}]}}]}} 1 sorry if its long but this is the command so if you could please put this into a villager trade i would love it!

I'm trying to set up a shop system in a vanilla minecraft realm and villagers seem like the most streamlined method of doing so, however I'd also like to make it so that other players on the server can program their own villager, or have me program it for them as an operator so that other players can trade with each other through the villager. I figure that since villagers now have a secret inventory, they can collect items, but I was wondering if there's any way to access the items traded to them or if they just disappear.  Currently my thoughts are that a player would initiate a trade, the villagers sells would be linked to individual slots in a chest and the villager buys could be linked to another chest, allowing the player to fill a chest and thus 'program' their villager, and that finally a third chest would be filled with the item the villager receives, while the chest containing the trades would decrement the specific number of the item in the relevant slot.


find a positive continuous function with a finite area : $\int_0^\infty f(x) dx$ , but the limit of $f(x)$ as $x$ goes to infinity doesn't exist. I tried finding such a function but I failed .

Question:  a. Find an example for a non-negative and continuous function s.t. $\int _0^\infty f(x)dx$ is finite but the following limit doesn't exist: $\lim_{x\to \infty} f(x)$.  b. Is it possible that $\int _0^\infty f(x)dx$ is bounded but $f(x)$ is not bounded?  What we did with A: We suggested the function $|sin(x^2)|$ which has periods that get smaller and smaller until they no longer imply on the sum. But since it's a trig function it doesn't have a determinate limit. Wolfram didn't have the integral value for that func, and we were wondering if it really converges and if it is really a good example.  What we did with B: We thought about the function: $f(x)=  { x\in \Bbb N },{e^{-x} \notin \Bbb N }$ and we had a disagreement whether f(x) is integrable. I said no because similarly to Dirichlet function, one sum's limit will be 0 while the other one's will be infinite. My partner said that if I find a $\delta<1$ then the definition of Riemann's integral does hold and so this integral is equal to that of $f(x)=e^{-x}$ She was trying to say this functions integral will be 0, but still it won't be bounded. I disagreed. Who's right?


I am writing books. The references are put in the footnote. When I wrote papers I use Mendeley to generate the reference in a consistent way. But how do I cite them into footnote? Anyone has suggestion?

How can I create this sort of bibliography using biblatex, ie, bibliography at the footer of every page?


Fist off - I am not going to do this job myself, I would just like to try to do this without cutting open the ceiling. We have a 110 GFCI outlet in our garage and I would like to add a 30 amp plug that would come from it's own breaker for our Airstream trailer when I'm working on it in the driveway. The distance from breaker box to the garage wall is about 20 feet. What is the possibility of tying on the new wiring to the existing wiring, pulling it back to the breaker using the existing wiring, and then pulling it all back to the garage together? Is this an unreasonable request to ask the electrician?

I nicked an electrical cable while doing a plumbing repair and so need to fix it. I previously  about repairing the damage in place, but there are receptacles 6-10 feet away on either side of the damaged wire, so it may not be too difficult to just pull new wire. Most of the wire is run horizontally through the studs, which is great, but it will at least be stapled at both boxes (and possibly more). The horizontal run is ~18" up from the floor, while the receptacles are ~6". There is also an inside corner the wire is run through. Wire is 12/2.  Is it possible to use the existing wire to fish the new wire, even though the existing wire is stapled? Would I need to open up the wall to remove the staples?  I found a , but that pertains to telephone wires which sometimes use different staples than electrical wires.


In Windows Explorer, I would like to search for all files in a specific folder and its subfolders with the file extension .doc. To do that, I tried to enter .doc in the search bar on the top right of the window. That gave me as a result all the files containing doc, not necessarily with that file extension, including folders named "doc".  In Windows XP, there was if I remember correctly something to only search for one file type, but I can't find anything like that in Windows 7.  How to only search for files with a specific file extension and not other files which contain that extension in their name?

I'm somewhat disorganized in my file saving habits, so I wind up using the Search function in Windows Explorer more often than one should. I was wondering, is it possible to have Windows find all files of a certain extension ( like, say for example all .rar files) if it is, how?


My sentence reads something like, "These parameters are being affected on varying a and b conditions." I want it to sound like, " The affectees of parameters a and b are ... " I don't know if I can use affectee here or if that is even a word.  I have found rare usage of this word affectee and never for a parameter. Any suggestions?

Take the following simplified sentence:      A,B and C are commonly affected by X.   If I want to formulate a sentence, where the message is to highlight A,B and C; so something like     A, B and C are important because they are the common affectees of process X.   The word affectee does not exist in OED or any other dictionary I look at (). Is there a better word for this purpose?   I am OK with using a synonym, so the word does not need to  stem from affect.


There has been very strange bug in every version on of Windows from 7 to 10 (Windows 7/8/8.1/10). I have been trying to google it for seven years without success because I don't know how to explain it shortly. So now I will try my best to explain it. The problem is about taskbar icons (from this point I will call this bug "the problem"). It happens once or twice a month and it is resolved after restarting Windows but it is still very annoying. Normally taskbar icons are highlighted when you hover mouse pointer above them. But when this problem happens the last icon you hover stays highlighted until you hover mouse above another icon. There is also another problem. Normally when you hover mouse above the taskbar icon which belongs to currently opened application, after some time application window preview shows up and disappears shortly after you move away mouse from it. But when the problem happens the preview appears instantly and stays even after you move away pointer from application taskbar icon. The preview stays until you move mouse above another icon and the problem continues till restarting Windows. So that's it. I'm not very good at explaining things so that's was the best I could do. Feel free to ask anything in comments to clarify things. To be clear I have never used any third party theme app or anything like it. Because this bug was in all versions of Windows I have used and also I have never seen it on other computera or even heard of it, one might think that problem is with my hardware, so here are some of my laptops specs:  Current Operating System: Windows 10 Pro 64-bit  CPU: AMD E-450, Zacate 40nm Technology  RAM: 4.00GB DDR3 @ 665MHz (9-9-9-24)  Motherboard: ASUSTeK Computer Inc. K53BR (CPU 1)  Graphics:  Generic PnP Monitor (1366x768@60Hz)  384MB ATI AMD Radeon HD 6320 Graphics (ASUStek Computer Inc)  1024MB ATI AMD Radeon HD 7400M Series (ASUStek Computer Inc)  CrossFire Disabled   Storage: 298GB Western Digital WDC WD3200BPVT-80JJ5T0 (SATA)  Optical Drives: HL-DT-ST DVDRAM GT51N  So my questions are:  1) Is anybody there who has the same problem or has even heard of it?  2) Is it possible to fix it?

After running Win 7 for some unknown period of time, the taskbar icon highlight starts to stick (video demo here: ). If I restart or kill explorer.exe and relaunch, it goes away.  Any idea what might be causing this?


s = '' # case 1 print(s[0]) # case 2 print(s[:1]) print(s[0:1])  In the first case I get an IndexError: string index out of range, yet the second case is perfectly correct. I'm confused; shouldn't they be the same? In both cases we're printing the character at position 0 in the string. I can get the idea of the the Error, after-all, there are no characters in the string, but I'd expect both cases to give the same Error. Thanks!

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.


Prove this function is differentiable and find it's derivative. $$ S(x)= \begin{cases} \frac{\sin x}{x} & x\neq0\\ 1              & x=0 \end{cases} $$ The derivative in $\mathbb{R}-\{0\}$ is : $\frac{x\cos x-\sin x}{x^2}$, but I don't know how to find the derivative at $x=0$

the question I am attempting is:  Show $f '(0) = 0$ for:  $$f(x) = \left\{ \begin{array}{lr} \frac{\sin(x)}{x} & : x \neq 0\\ 1 & : x=0 \end{array}  \right.$$  So I got stuck after the following working:  $$ f'(0)  =  \lim_{h \to 0} \frac{f(0+h) - f(0)}{h} \\  = \lim_{h \to 0} \frac{\frac{\sin(h)}{h}-\frac{\sin(0)}{0}}{h}\\ = \lim_{h \to 0} \frac{\sin(h)}{h^2} $$ and the above limit does not exist. Am I not applying the derivative definition right? or am I going wrong somewhere else?   EDIT:  I now see that f(0) = 1 from the definition of the function, however I still have: $$\lim_{h \to 0}\frac{\sin(h)-h}{h^2}$$ which I am struggling to evaluate. Splitting into two fractions the first fraction is still the one from above which does not exist.  Also this must be from definition of derivative directly and not by L'Hopitals rule as it has not been taught yet.


I was reading a book on group theory and there was problem in the book that states:      Prove that the dihedral groups $D_n$ are all Lagrangian for $n\geq3$.   Apologies the previous hint was not for this question.  If anyone could answer this question is would be hugely appreciated.

It is known that the converse of  isn't true in general. More precisely it is known that the following proposition:  If $G$ is a finite group of order $n$ and $m\mid n$ then there exists a subgroup $H$ of $G$ such that $\operatorname{order}(H)=m$.  isn't true for all finite groups $G$. My questions are:   For which groups $G$ does the converse of Lagrange's Theorem (as stated above) hold? More precisely, if $G$ is a group for which the converse of Lagrange's Theorem as I mentioned above holds then what properties must $G$ satisfy?  If there is no complete classification of such $G$s then can someone give me references to works by other mathematicians where they try to give at least a partial classification of these $G$s?    Please note that I am not interested in knowing a complete classification of the groups for which a partial converse holds ( does the job in some sense). I want to know a complete classification of the groups for which the converse of Lagrange's Theorem as I mentioned above holds.


I'm really new to the whole Ubuntu thing, I've been and still am a windows user, for my windows server I would just use RDC (remote desktop connection) and be done with it, as in apps are still running when I close RDC.  For Ubuntu I've been using SSH but as soon as I close it anything I've started ends. Also while I prefer a GUI it seems that most stuff in the Ubuntu is terminal based and I'm ok learning this.   I'm currently running the standard version of Ubuntu 16.04 LTS

Let's say I launch a bunch of processes from a ssh session. Is it possible to terminate the ssh session while keeping those processes running on the remote machine?


I have only just started learning C++, and I see that functions are usually declared and defined separately, for example:  // Declaration void sayhi(std::string name);  // Definition void sayhi(std::string name) {   std::cout << "Hello, " << name; }   I tried looking up but most of the questions were for the cases of Class, but my question is in more general terms, why do we separate them? What's the benefit?

Why does C++ have header files and .cpp files?


I have a bash script to capture images using the webcam and it depended on ffmpeg. I recently upgraded from 13.10 to 14.04 and noticed that ffmpeg was removed and this script wouldn't work anymore. Searching led me to answers that suggested adding some ppa to repository and install ffmpeg. But I do not want to add any unofficial ppa. What to do? What is the official substitute for ffmpeg?

I tried to install ffmpeg in trusty/Ubuntu 14.04 and got the following message:  $sudo apt-get install ffmpeg  Reading package lists... Done Building dependency tree        Reading state information... Done Package ffmpeg is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'ffmpeg' has no installation candidate   Why isn't the package available?


I had recently installed a version of VMWare Workstation that I had to uninstall and to look for instructions about doing so I came across  thread.  It stated writing this command to see if there was any version of VMWare Workstation installed:     vmware-installer -l   So what I want to know is, just like the quoted command for VMWare, how do I know about other commands that exist to let me know if a particular product is installed on my computer or not?  Thanks for looking in.

At our university we can get almost any ubuntu package installed we want, but we are not superusers ourselves (we need to request packages being installed).  With some libraries it is not always easy to know whether the package is already installed or not. Is there a simple way/command to check this?


I have a few older flags, the oldest one being from Jun 27 at 23:03, still showing as active.  Since then I've had over 20 newer flags handled. Is there an issue with the displaying of the status, or perhaps an issue with the queue (I don't know how the flag queue works)?

Why does it take so long to review a flag suggested by a user?  When I flag a question or comment, some get a response quickly whereas some of them get a response after few or more hours.  Is there any flag review condition which cause so much time to be taken for different flags?  Or are there different moderators for different flag posted?


I use the style verbose-ibid, and I need it to use ibid (without a page number) when the last entry is exactly the same as the previous one (that is, same work, same page).  Right now, for the minimum working example below, the footnotes I get are     Author. Book A, p. 1.   Ibid., p. 1.   However, I need     Author. Book A, p. 1.   Ibid.   How do I do this?  \documentclass[12pt]{book}  \usepackage[backend=biber, style=verbose-ibid]{biblatex} \usepackage{filecontents}  \begin{filecontents}{test.bib}  @book{a,   title = {Book},   author = {Author}, }  \end{filecontents}  \addbibresource{test.bib}  \begin{document}  Here is some reference.\footcite[1]{a} Here is some reference.\footcite[1]{a}  \printbibliography  \end{document}

I'm trying to adapt the citation formatting provided by the verbose-trad2 style for biblatex to conform to very particular specifications I've been given. I think verbose-trad2 is the closest to all my needs amongst the default ones.  The citations are to be given in footnotes, usually as \footcite{}, but occasionally with \footnote{Some remark... \cite{}.}. What I call here a full citation is the whole info on a work: author, title, publisher, date, etc. What I call an abbreviated citation is just author (always complete!), abbreviated title, and optionally the page number. The first time a work is cited, I must use the full citation, and then it depends on whether other works are cited in between or not, but never more than the abbreviated citation.   The biblatex related code I've already come up with can be found . The LaTeX document itself is an article with the option onepage.  First, two hacks I have already applied.   Always print the full name of the author. Thus I set idemtracker=false. The word Idem must be used when two subsequent citations share the same author and title (instead of the default Ibid in verbose-trad2). Thus I redefined ibidem = idem.   Second, there are things I still need to adapt, for which I don't have the faintest idea, even after looking through the documentation and this site. (I may have missed something, because I'm not at ease with low-level tex or biblatex code, I apologize if that's the case.)   When two subsequent citations share the same author, title and page number (given in the square bracket argument of the \footcite[]{} command), just print Ibid. (nothing else). Always begin the foonote section of a new page with a full or abbreviated citation (author (full), abbreviated title, page number), never start with an idem or ibid. even if the last citation on the previous one is similar/same. I thought the biblatex documentation implied this would work out of the box, but it doesn't seem to. (Optional) Abbreviated title means: if there is only one work by the author, use the expression op. cit., else use an abbreviated form of the title (do I necessarily have to use the shorttitle field in the bibTeX entries?)   Thanks in advance for any suggestions and help!


I'm gathering some data in a Google Spreadsheet, there's a column for phone numbers and when trying to enter a phone number (e.g., +54 11 4785 7992) the spreadsheet automatically tries to make a formula or something like that and shows #ERROR.  I tried to set the cells as PLAIN TEXT but it continues assuming that I want a formula and not just plain text and I don't know why.  Any help?

I am to store international standard phone numbers (starting with a plus sign followed, usually, by plain numbers) in a Google spreadsheet column. An example of such a phone is  +420123456789   When I enter this phone it turns to just 420123456789 to be seen in the cell and =420123456789 to be seen in the formula/value bar. I would like to disable this conversion.  I've tried using Format → Numbers → Plain text applying it to the whole column as well as to the particular cell but it doesn't seem to work.  Any ideas how to overcome this?


I have a small problem in my thesis:  I need the Bibliography to be left-justified and used a simple \begin{flushleft} command to realize that:  \bibliographystyle{unsrtnat}  \lhead{\emph{Bibliography}} \begin{flushleft} \bibliography{Bibliography}  \end{flushleft}   I realized though, that when adding this flushleft command, that a blank page gets created in front of the Bibliography. Any idea as to why that is happening?  I am using:  \documentclass[a4paper, 11pt, oneside]{Thesis} \usepackage[square, numbers, comma, sort&compress]{natbib}

I have a reference entry in the bibliography that appears as follows:  [50] AB MySQL.    MySQL:  The  world's  most  popular  open  source  database,      http://www.mysql.com/, 2005.   How to prevent auto-justification for specific references?


I am offered governmental scholarship (GSch) that I do not want to use for some reasons. I also don't want to lose the chance of PhD in a top university. I would use GSch, if I cannot get funded admission from a top university. Please read my  for more explanation of my situation.  My question is that do universities offer an admission without funding? So that, then I will have a chance to say 'I have another source of funding. Let me do PhD there'. For example, will I know I am in the waiting list? Do they put all the rejected students in the list?   Or should I mention about the GSch at the first place? or maybe I should mention it only in applications of some universities.  Would I loose a good acceptance chance of mentioning at the first place, if I wait for rejection/waiting list decision?

This might sound odd, yet here is my story. I was lucky to get governmental scholarship (GSch) for 4-5 years of PhD to study abroad. But It requires student to work as Assistant Professor in a relatively smaller university in my homeland for 8-10 years afterwards. Which I would not like myself bound to after my PhD.  This is an advantage for sure to get admission in a top university. But by myself (without using GSch), I might also get funded by TA/RA. In that case, I wouldn't use GSch.  Should I mention GSch in the first contact with PIs or in PhD applications (i.e. in SOP)? I am asking this because once I inform them about GSch, it is unlikely to get TA/RA funds even though I deserve. I also don't want to lose the chance of PhD in a top university, I use GSch if needed. So there is a trade-off.  I can think of three possibility:  1 - Mentioning the GSch in the first contact, hoping that they will promise funding anyway if they this I deserve.  2 - Mentioning it in the first contact as it is a possibility.  3 - Sending another email and mention it if they reject me because of lack of funding (Would they say it is lack of funding?).  P.S. : I am planning to apply mostly to positions in U.S.  P.S.2 : Sorry for bad English level, edits are welcome.  Edit : If I decide not to get back to my country, I have to pay scholarship in 5 years with ~50% interest.


Looking for a supported method to remove orphaned servers from SharePoint 2013 Farm.  Initial process that led to current situation:    Removed server from farm by using PSConfigGui   Upon navigation to Production Sites, server is still counted as a front-end for 3rd Party Licensing Purposes.  Still populated in Central Admin with Distributed Cache service still tagged on server.  Attempted to remove by clicking on Remove Server  Received Error: cachehostinfo is null  Checking ULS Viewer revealed the following error A failure occurred SPDistributedCacheServiceInstance::UnprovisionInternal()... isGraceFulShutDown 'False' , isGraceFulShutDown, Exception 'System.InvalidOperationException: cacheHostInfo is null     at Microsoft.SharePoint.DistributedCaching.Utilities.SPDistributedCacheServiceInstance.UnProvisionInternal(Boolean isGraceFulShutDown)'

I have setup a development environment for SharePoint 2013 so we can begin testing our 2010 content, however I am running into trouble starting the Distributed Cache service. Note that this is currently a clean install, there is no 2010 content or installation. We are using Server 2012, SQL Server 2012 (v11.0.2100) and SharePoint 2013. AppFabric 1.1 was installed as a prerequisite for Sharepoint 2013.  Looking at the Windows Server Services, I can see that the AppFabric Caching Service is Running.  I have ensured that AppFabric is installed and configured correctly, and have setup a network share, however, when I go to start the Distributed Cache service, I get the error:      cacheHostInfo is null   When digging into the logs using the correlation id, I end up with this line here:     A failure occurred in SPDistributedCacheServiceInstance::Provision. cacheHostInfo is null for host 'my_server_name'.   where my_server_name is the name of the dev server.  I looked at the AppFabric Config wizard, and it states "This machine is a part of an AppFabric Caching cluster." So according to AppFabric, it is all setup, and the network share is linked correctly.  The service is linked to a user account which I have created for this purpose and have given it the permissions required through Local Security Policy (Bypass traverse checking, Generate security audits, Log on as a service). This user has been granted access to the network share.  Is there anything else I need to check or try to get this running? Or has anyone seen this error before?


After installing Ubuntu 12.04 on a Toshiba AC100 several days ago, as described at , and seeing during the installation that the OS was able to use the camera (the installer suggested to make a photo for the first user), I wanted to play with the camera.  I couldn't understand how to find a "photo booth" program in the new-style menu+desktop (not the classical menu with sections), so I remembered the popular "cheese" Linux program, and installed it via the Software Update tool (or whatever it is called; can be invoked from the panel on the desktop).  But cheese doesn't start, i.e., it crashes. (The  telling the same.)  As I said, the camera could be used by the OS on this machine -- this could be seen in the installer.  Which "photo booth" programs can be installed and used without crashes in Ubuntu 12.04 on a Toshiba AC100 in order to play with the webcamera?

I am running Ubuntu GNOME 15.04 and I find Cheese very basic, are there any alternatives (I have already read this , however that is only really on video recording, and I would like a balance)?  Specifically, I would like an application which can:   Record from the webcam Take pictures Record audio Take screencasts (audio recording included in that as well)   Is there a program that can do all this?


how can I set automatic recording all changes that were done at tables records (Updates) and to get some info / logging summery? thanks

This is a question regarding general DB inner workings, not particular to an implementation or paradigm, though answers for certain technologies are welcome. I am asking if there is a way to listen to what commands the database has received, or something like read an inner log of the database, at least the last changes. I need such a functionality to be able to find if there were changes to a table and if so, read the particular row that has changed. It is assumed changes to the columns are not to happen. I am only a listener of the database, hence I am not able to program triggers.


A computer in our household got hit by the FBI "ransomware" virus.   Here are details of what happened (Win 7 Home Premium):   Family member was in a forum. AVG Free (which was up-to-date) warned of an attack. An Adobe Flash install popped up. Windows UAC popped up confirming Flash install. We answered No/Cancelled to each Flash install prompt. But it (and UAC dialog) wouldn't go away. Both would pop back up after clicking No or Cancel. We restarted the computer (Start -> Restart) without ever answering Yes to the Flash install. -On reboot the FBI Ransomware screen displayed and we were sunk.   We tried booting into Safe Mode but the ransom screen STILL appeared. Yes, even in Safe Mode.  Was hoping there'd be a list of instructions with quick steps for removing this virus. Thought I found it with  but that question was marked as a duplicate with redirect to  which contains loads of general techniques for malware removal --many very involved and impractical if you're trying to get back up FAST. (If that's possible.)  Is there any set of instructions for what to do to remove this specific ransomware infection, including not being able to boot to Safe Mode?

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


The error, which I am getting:     Caused by: java.lang.NullPointerException: Attempt to invoke virtual   method 'android.view.View com.github.irshulx.Editor.findViewById(int)'   on a null object reference           at com.example.verma.inspire.PostActivity.onCreate(PostActivity.java:45)           at android.app.Activity.performCreate(Activity.java:6975)           at android.app.Instrumentation.callActivityOnCreate(Instrumentation.java:1213)*   the file PostActivity.java:  import android.content.Intent; import android.support.v7.app.AppCompatActivity; import android.os.Bundle; import android.support.v7.widget.Toolbar; import android.view.LayoutInflater; import android.view.MenuItem; import android.view.View; import android.view.ViewGroup;  import com.github.irshulx.models.EditorTextStyle; import com.github.irshulx.Editor;  public class PostActivity extends AppCompatActivity {      private Toolbar mToolbar;     private Editor editor;      @Override     protected void onCreate(Bundle savedInstanceState) {          super.onCreate(savedInstanceState);         setContentView(R.layout.activity_post);          mToolbar = (Toolbar) findViewById(R.id.update_post_page_toolbar);         setSupportActionBar(mToolbar);         getSupportActionBar().setDisplayShowHomeEnabled(true);         getSupportActionBar().setTitle("Update Post");          editor = (Editor) editor.findViewById(R.id.editor); //error here         setUpEditor();     }      ... }   and the XML layout:  <?xml version="1.0" encoding="utf-8"?> <RelativeLayout     xmlns:android="http://schemas.android.com/apk/res/android"     xmlns:tools="http://schemas.android.com/tools"     xmlns:app="http://schemas.android.com/apk/res-auto"     android:layout_width="match_parent"     android:layout_height="match_parent"     tools:context=".PostActivity">      <include         android:id="@+id/update_post_page_toolbar"         layout="@layout/app_bar_layout" />      <com.github.irshulx.Editor         android:layout_width="match_parent"         android:id="@+id/editor"         app:render_type="Editor"         app:placeholder="Start writing here..."         android:paddingTop="10dp"         android:paddingLeft="10dp"         android:paddingRight="10dp"         android:layout_height="wrap_content"         android:paddingBottom="100dp" />  </RelativeLayout>

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


What does \hskip 60pt plus 100pt minus 100pt mean? I used to think of this as a mechanical spring with natural width and some string constant k. But, I know that it is not exactly so, since the plus and minus need not be exact, and, also, the text box has maximal and minimal width, whereas a Hookean spring has infinite elasticity.  Now, the nice thing about Hookean strings is that they can be . Here are some questions:   Does TeX inner engine rely on this property to model several adjacent boxes as one? Does the physics of spring carry through to TeX? Did Knuth develop the math and physics of glue? Are there any instances in which \hboxes are connected in parallel? If TeX glues are likened to physical springs, what are TeX springs in the physical world?   If you do not like the springs analogy, the questions are then restricted to creatures created by \hbox and glues. Is it the case that the serial concatenation of two of these, cannot be represented with a single box with different glue?  More abstractly, what are the elasticity functions of compound creatures? Is it a  of some kind?

I had a question about dynamic vspaces () and there was a hint I should use a stretchable glue. Searching with Google didn't give me a helpful answer.  I would be glad, if someone can explain it and give me a simple example to understand how it works.


I am aware of such atrocities as the  or  but I do not count these by any stretch of the imagination to count. Are there any canon or legends mentions or references to Christmas anywhere within the galaxy?  Please label answers as canon or legends.

As noted in  question, the concepts of heaven and hell appear to exist in the galaxy far, far away;  Han even mentions the latter in The Empire Strikes Back:  RANDOM JERK REBEL GUY:  Your Tauntaun will freeze before you reach the first marker! HAN SOLO:  Then I'll see you in HELL!  The modern concepts of heaven and hell have their origins in the so-called Abrahamic religions:  Christianity, Judaism, and Islam. Therefore, since the galaxy far, far away has heaven and hell, it is logical to ask if the galaxy far, far away has some concept of the Abrahamic god. Adding fuel to the fire, DVK's answer  notes that Han's freighter contains a compartment he hasn't been able to open.  The ID number on the compartment is identical to the ID number on the crate in which the Ark of the Covenant is stored in Raiders of the Lost Ark.  Surely, if a holy relic associated with the Abrahamic god of Judaism is referenced (and perhaps located) in the galaxy far, far away, it is sensible to ask if that same god is known to some of the galaxy's inhabitants in some form or another.   Does the concept of the Abrahamic god of Judaism, Christianity, and Islam exist (in any form, or to any degree) in the galaxy far, far away? Note 1: I don't think this is addressed in the movies, and although I would prefer a canonical answer, Legends will do, if nothing else is available.  However, the Star Wars Holiday Special is not an acceptable source. Note 2:  The substance of this question is fundamentally different from "Do Heaven and Hell exist in Star Wars", because that question and its answers don't address the Abrammic god in any way.


I posted an answer to this question.       I am allowed to make comments to my post, but not to other peoples posts? How do I put a linebreak in a comment?  When I press enter, the comment get submitted.    Linebreaks End a line with two spaces to add a  linebreak:    I'm running Firefox 24 on Fedora 19 lxde.

Across the Stack Exchange network you may leave comments on a question or answer.  How do comments work? What are comments for, and when shouldn't I comment? Who can post comments? Who can edit comments? How can I format and link in comments? My comment doesn't contain some of the text I typed in it; why? My comment appears to be long enough, but I can't post it because it's too short; why? Who can delete comments? When should comments be deleted? Why can't I comment on specific posts even if I have enough reputation to comment? When can comments be undeleted? What are automatic comments? How can I link to comments? Anything else I should know about comments?  Also see the FAQ articles on  and .


I'd like to apologize in advance if this is not ubuntu related issue, but I did not manage to find any other topics regarding my problem.  What's going on: I'd like to start using screen recording software called Open Broadcaster (OBS). But I ran into an issue when the recorded screen is black and only the cursor is visible.  I've found many similar topics about this problem, but most of them were related to Game Capturing mode. I can not get this done with Screen Capture mode.  The interesting thing is that Window Capturing mode (recording specific application windows - browser, editor, etc.) works. But that does not meet my needs.  Unfortunately I did not play around with this before my recent dist upgrade to Ubuntu 17.10 so I can not confirm if this was a problem even before upgrade or if it's brand new thing. The fact is, that I did not manage to find any similar issues which regards, once again, Screen Capture mode.  Any advices or tips are strongly appreciate.  Thanks a lot!

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


I want to add a redirect link on Webform submission button when a user submit a webform I want to redirect them in different page.  How can I redirect a user after they submit the webform ?

I'd like to do something pretty straightforward: After user fills out a , I'd like a button that simply redirects them to a URL (in this case it's to a demo sandbox). Of course I'd want the user to fill in their info to capture for lead-generation purposes. My  is set up correctly in that it correctly captures all the user fields and submits them to me via email. However, upon completion "click" I'd like to have the user redirected to a determined internal URL www.mysite.com/foo  I can't figure out how this is done with the vanilla webform settings. Am I missing something obvious?


I'm trying to see how good a custom topographic map could be using only free data  For the moment I'm just playing with the data so of course the colours are not pretty. I did some classification and used some land cover data anyway I have a raster layer as background with the main land cover basically swamp forest and no vegetation. Since the result of a vectorization was awful and hard to fix I'm going to stay with the raster as background, the question is:  How to avoid the squared shape on my map? I would like to smooth the area to have a prettier map. I tried the bilinear interpolation but it creates white boundaries around the area and with the Nearest neighbour it's not pretty.  I tried some generalization tools as well but they are way too strong!  So what would you do?  Here is what I have done so far:

I have a DEM that I would like to smooth or generalize to remove topographic extremes (chop off peaks and fill-in valleys). Ideally, I would also like to have control over the radius or level of "blurriness". In the end, I will need a set of rasters that range from slightly blurry to really blurry. (Theoretically, the blurriest would be a constant raster of the arithmetic mean of all values).  Are there any tools or methods I can use (based on Esri, GDAL, GRASS)?   Do I need to home bake my own  routine?   Could I use a low-pass filter (e.g. ArcGIS's ), and if so, would I need to run it a bunch of times to get the effect of a large radius?


When creating stacked bar charts with pgfplots, how can I avoid printing those (and only those) "nodes near coords" if there is too little space? The following MWE illustrates the problem:  \documentclass{standalone} \usepackage{tikz} \usepackage{pgfplots} \pgfplotsset{width=7cm,compat=1.12} \begin{document} \begin{tikzpicture}  \begin{axis}[   ybar stacked,ylabel={participants},   symbolic x coords={tool1, tool2},   xtick=data,x tick label style={rotate=45,anchor=east},   nodes near coords,clip mode=individual] \addplot+[ybar] plot coordinates {(tool1,1) (tool2,4)}; \addplot+[ybar] plot coordinates {(tool1,5) (tool2,0.2)}; \legend{never,rarely} \end{axis} \end{tikzpicture} \end{document}   There is too little space for the node "0.2", so how could I avoid printing it, but keeping all the others?

I can't figure out a way to prevent small values showing in my labels. A problem that looked very similar to mine can be found in . Due to my non-existent coding skills I couldn't figure out this on my own. So here is the code I've got so far:  \documentclass{article}  \usepackage{tikz} \usepackage{pgfplots} \pgfplotsset{compat=1.10}  \definecolor{RYB1}{RGB}{128, 177, 211} \definecolor{RYB2}{RGB}{251, 128, 114} \definecolor{RYB3}{RGB}{190, 186, 218} \definecolor{RYB4}{RGB}{255, 255, 179} \definecolor{RYB5}{RGB}{141, 211, 199} \definecolor{RYB6}{RGB}{253, 180, 98}  \pgfplotscreateplotcyclelist{ColorListBar}{ {RYB1!50!black,fill=RYB1}, {RYB2!50!black,fill=RYB2}, {RYB3!50!black,fill=RYB3}, {RYB4!50!black,fill=RYB4}, {RYB5!50!black,fill=RYB5}, {RYB6!50!black,fill=RYB6}, }  \begin{document}      \begin{figure}[H] \begin{center} \begin{tikzpicture} \pgfkeys{      /pgf/number format/precision=2,      /pgf/number format/fixed zerofill=true,     /pgf/number format/fixed } \begin{axis}[ ybar stacked, bar width=9mm, nodes near coords, enlargelimits=0.3, legend style={at={(0.5,-0.20)}, anchor=north,legend columns=-1}, ylabel={ylabel}, symbolic x coords={A, B, C}, xtick=data, cycle list name=ColorListBar ] \addplot plot coordinates {(A,0.26) (B,0.32) (C,0.32)}; \addplot plot coordinates {(A,0.28) (B,0.29) (C,0.35)}; \addplot plot coordinates {(A,0.05) (B,0) (C,0.01)}; \addplot plot coordinates {(A,0.13) (B,0.17) (C,0.17)}; \addplot plot coordinates {(A,0.06) (B,0.01) (C,0.01)}; \addplot plot coordinates {(A,0.05) (B,0.07) (C,0.01)}; \legend{1, 2, 3, 4, 5, 6} \end{axis} \end{tikzpicture} \end{center} \end{figure} \end{document}    This results in a Figure that looks like this:    I would like to remove the labels that currently have the value 0.01 and thus look very cluttered. How could this be achieved?


Is there any way to generate reversed taper geometry? In other words: I'd like to generate the geometry you can see in the following picture just by using displacement modifiers or by using nodes:  Q: Is something like this possible by using displacement? The purpose of me thinking that this is nearly impossible is because if having a larger displacement on top, how am I supposed to depict a tapering gradient bellow it visually on a map? You can not show a dim gradient bellow a bright surface on a displacement map right? Note: This question is not specifically about cones, it is about any type of displacement where I have a bigger surface on top of a smaller surface. For better illustration consider a plane , Subdivide it 100 times and switch to cycles rendered mode with Displacement type set to Displacement and bump. The if i create the following Node tree , i can get the following result. The node tree is finding the Length of the origin and using a color ramp to manipulate the falloff of the resulting spherical gradient and passing through a displacement map to get the final result , but how can i taper at the bottom and have a bigger surface at the top?

I have a 2d flat mesh that i would like to manipulate without any distortion to create a 3D shape. Typically for the pie below, joining the 2 edges together would make a 3D cone. Do you have any idea of which modifier to use ?


Why is $5 + 5z + 5z^2 + ... + 5z^{11}  =  \frac{(5z^{12} - 5)}{(z - 1)}$ ? I don't understand how you can rewrite it to that.  Z is in this case a complex number: (for example: $z = 0,8(0,5 + 0,5i\sqrt{3}) = 0,4 + 0,4i\sqrt{3}$). Is it also possible to write the $5 + 5z + 5z^2 + ... + 5z^{11}$ with a summation (sigma) sign?

Why does the following hold:  \begin{equation*} \displaystyle \sum\limits_{n=0}^{\infty} 0.7^n=\frac{1}{1-0.7} = 10/3\quad ? \end{equation*}  Can we generalize the above to      $\displaystyle \sum_{n=0}^{\infty} x^n = \frac{1}{1-x}$ ?   Are there some values of $x$ for which the above formula is invalid?  What about if we take only a finite number of terms? Is there a simpler formula?     $\displaystyle \sum_{n=0}^{N} x^n$   Is there a name for such a sequence?    This is being repurposed in an effort to cut down on duplicates, see here: Coping with  duplicate questions.  and here: .


Prove that if p is a prime then there exist $\ ϕ(ϕ(p^2 )) = (p − 1)ϕ(p − 1)$  primitive roots modulo $p^2.$  I know how to prove the theorem  Let p be prime and let d ∈ N be a divisor of p − 1. Then there are exactly ϕ(d) elements a mod p such that ordp(a) = d. In particular, there are ϕ(p − 1) primitive roots modulo p.  Not sure how to go about proving the first statement, any ideas what theorems I would use?

Prove if $n$ has a primitive root, then it has exactly $\phi(\phi(n))$ of them.   Let $a$ be the primitive root then I know other primitive roots will be among $\{a,a^2,a^3 \cdots\cdots a^{\phi(n)} \}$ because any other number will be congruent modulo $n$ to one of these. Then I figured as the answer is $\phi(\phi(n))$ so for $a^k$ to be primitive root, $k$ must be coprime with $\phi(n)$.But I don't know the reason.Am I missing any silly point?


I have a 100 year old picture on what appears to be mounted on cardboard. How can I preserve it?  I haven't tried anything to preserve it other then keeping it between paper, which isn't working.   How do you keep the picture from disintegrating?

A friend of mine has some very old photos where the deterioration process seems to have increased in the past few years, and the owner is worried about the preservation of these old memories.  They have been stored inside an album within plastic sleeves. The owner is not aware of the display method prior to that.   I have been informed by the owner that since being in their possession, they seem to be looking worse than when first viewed and seem to be falling apart.   He is looking for the best way to preserve these photos inside an album, but not really sure what would be the best method. I have suggested for the albums as a whole to be stored in vacuum sealed bags for now, but I'm not even sure if that is good!  I am looking for any suggestions or personal experiences from anyone who has had to deal with such photos and what they did to preserve their memories.


I am going to London in February and am not sure about all the uses of the Oyster Card. Can I use the Thameslink with an Oyster Card? Even in off-peak times such as 5am or 12 am?

I read many contradictions as to whether one can use a Oyster card from Gatwick Airport to central London.  What is the most time-efficient way to go from Gatwick to "Old Billingsgate" (Monument tube station is nearby)? Public transportation is preferred over taxi.


I'm running QGIS 2.6 on a Mac, and trying to create buffers around a point shapefile. The process seems to work: (Vector>Geoprocessing Tools> Buffer(s), I select my input layer, leave the segments at 5, and set the distance, create a new output shapefile in the same folder as the input layer, and set the new layer to appear.  A layer IS created, but it's an ovoid ellipse that is massively too large - when I set it for '500 metres', it came out covering most of Eurasia and Africa! I tested the settings, and to at '0.01 metres', it produced an ellipse measuring approx 1200x1450 metres.  What is causing this, and how do I fix it? I wonder if it's related to the co-ordinate system I'm using, as the project is WGS84-PseudoMercator and the input shapefile is WGS84 (I didn't intentionally make them different).  Any help gratefully received! Adam

I  have had no luck getting the buffer tool to accept anything but degrees as units of measure.  I have found lots of stuff saying the layer needs to be reprojected and saved but it hasn't worked at all for me.   Is there a way I could create a buffer without using ftools or at least force the units to meters somehow?  As a workaround I converted meters to degrees (lat) and used that but the final product needs to be as close to reality as possible.  Things I've tried:   setting every unit option I could find to meters (where possible). setting everything to NAD83/Maryland (data is for Washington, DC) and saving it as such (as layers in ESRI shape files). reimporting the reprojected layers setting relevant layers to Google Mercator   The was tried followed by creating a buffer. Many were tried in combination. QGIS 1.7.3 Slackware64 current (qgis from SBo-13.37 repo, tried on multilib and plain 64it with same results)


I was wondering if I have the key and the encrypted Hill Cipher message(s). I can definitely figure out the charset involved. But the order is missing. Assuming that I use 37 modulo or higher. How would I go about cracking it?

I've been struggling on this problem for a while now : the Hill cipher is well-known to be vulnerable to known-plaintext attack due to its linearity. Given a key matrix $K$ of size $n\times n$, one can retrieve the key with as little as $n^2$ plaintext/cipher text couples.  All examples found on the Internet assume an alphabet where $A=0, B=1 \dots Z=25$, but how could we break the Hill cipher using a know-plaintext attack without any clue over the alphabet permutation nor the key matrix ?  I've tried several things such as  the whole set of equations together, however it requires several divisions in $\bf{Z}_{26}$ which aren't possible (i.e. division by even numbers or 13)


rendered screenshot   editor view     Notice the dark faces. Even though it's not in shadow from anywhere and all normals are correctly facing as far as i can tell. I have also tried different/fresh material but that doesn't seem to affect this issue.    edit: replies to the comments (dunno how else to answer them) : 1. the link is invalid. goes to a 404 page. 2. the lighting setup is a the default blender sun lamp.  3. the mesh is not distorted at all. its appearance is due to the weird rendering issue. 4. thanks for the correct link. this awesome service should be integrated directly into this forum imo.  i see that this question is a duplicate, so moderators feel free to delete if required. I did search for an answer here before posting, guess I was using wrong keywords.

Here is the viewport in material view.  The node setup is just a PNG texture into a diffuse shader.    And this is in rendered view.  I've tried using environmental lighting as well as a directional light, and while the lit parts become brighter/washed out, the darker parts stay dark.  Normals are correct and there is no z-fighting.  Ambient Occlusion is not enabled.  Changing to Flat shading makes it worse.    Update:  Any modifier that alters the mesh (bevel, subdivide, etc) make the problem go away instantly.


Prove that for a polynomial function $f$ with degree $n$ if $f(x) \geq 0$ for all $x$, then $f(x) + f'(x) + \cdots + f^{(n)} (x) \geq 0$.  Give me some hints for this and please explain to me how you have come to those hints.

I have $P(x)$ a polynomial with degree $n$ ,$P(x) \ge 0$ for all $x \in$ real.  I have to prove that:     $f(x)=P(x)+P'(x)+P"(x)+......+P^{n}(x) \ge 0$ for all $x$.   I tried different methods to solve it but I got stuck.Any suggestion or advice is welcomed.


I know this question may seem duplicate, but having searched all the possibilities, I could not find exact answer to this problem. Having a surface, for example $x^2+y^2-z^2=-1$, and a plane, such as $x+2y+3z=0$, what are the major techniques to evaluate the distance between surface and plane? Any complete explanation will be strongly appreciated.   Note: In fact, I want to evaluate shortest distance by using Lagrange Multipliers. So if there is not any concrete method, any help towards "shortest distance" by using Lagrange method would also be kindly appreciated.

I'm trying to find the minimal distance between the surfaces described by $z=x^2+y^2$ and $x+y-2z=8$. I would imagine there are several approaches including the use of Lagrange multipliers. I attempted to find the spot when their normal vectors are parallel ( since i believe if these vectors are not parallel there is a direction that will bring the distance lower). So if $U(x,y,z)=x^2+y^2$ and $V(x,y,z)=x+y-2z$ are functions describing these surfaces then their normal vectors are $(2x,2y,-1)$ and $(1,1-2)$ respectively. Then I want their cross product to be zero; this is at $(1/4,1/4,z)$. But when i solve for $z$ and I cannot simultaneously satisfy both equations. What gives?! Am I along the right line of thinking?


Firstly I'll just give a brief example of where my query came from. I was watching the episode of Futurama where Bender meets God after being fired from the planet express ships torpedo tube. The crew can't catch him because they were going top speed when he was fired meaning he's going much faster.  From this, I started to think a lot about moving objects utilising the speed of the object they're moving from and my thoughts eventually arrived at this. If you have a motor on a table attached to a large disc, then you attached another motor and independent power supply to the top of the disc, and then attached that to another smaller disc with their centres aligned.  If you switch on the first motor and spin the first disc, they entire structure would move as one, but if you then remotely switched on the second motor spinning the smaller disc in the same direction, the smaller disc would be spinning faster.  An example of this principle I used to explain it to my friends is the idea of shooting a gun forward from a train moving at the speed of a bullet()  My question is, could this effect be used to make an object travel/spin at or near the speed of light, perhaps through using several of these spinning discs on top of each other? Thoughts?

Let's say I fire a bus through space at (almost) the speed of light in vacuum. If I'm inside the bus (sitting on the back seat) and I run up the aisle of the bus toward the front, does that mean I'm traveling faster than the speed of light? (Relative to Earth that I just took off from.)


I have a car that I purchased for $6k. It drives fine, but needs a new computer, which will cost $2.8k. The diagnosis already cost $400. Given that doing this repair will be 46% of the car value, I am trying to consider ways to reclaim value for the car. The car is valued by  at $4k. Doing the repair only raises the value (good to excellent) to $4.9k  What options do I have to regain the value of the vehicle? Tax deduction, sale, etc.

Recently I paid a lot (almost one month of my salary) for repairing my car. I am wondering if there is a way to get deduction on federal or state taxes (USA, California).


I have encountered an instance where object properties look like this:  $this->property   and this:  $this->_property   What does the _ mean before ->? What difference does it make in terms of coding?

While looking over various PHP libraries I've noticed that a lot of people choose to prefix some class methods with a single underscore, such as  public function _foo()   ...instead of...  public function foo()   I realize that ultimately this comes down to personal preference, but I was wondering if anyone had some insight into where this habit comes from.  My thought is that it's probably being carried over from PHP 4, before class methods could be marked as protected or private, as a way of implying "do not call this method from outside the class".  However, it also occurred to me that maybe it originates somewhere (a language) I'm not familiar with or that there may be good reasoning behind it that I would benefit from knowing.  Any thoughts, insights and/or opinions would be appreciated.


I know two different ways to write the following:  We can either type $(a_{ij})_{\mathop{1\le i\le n}\limits_{1\le j\le n }}$ or, as shown , $(a_{ij})_{\underset{1 \leq j \leq n}{1\le i\le n}}$. The output (the picture above) is the same in both cases. Notice that 1< j < n has a smaller size than 1 < i < n. I found . So I typed $(a_{ij})_{\mathop{1\le i\le n}\limits_{\mbox{\tiny\(1\le j\le n\)}}}$. The result is pretty ugly:  Could you please tell me how to write it correctly?

Is there a way to force a line break inside a math mode text?  My example:  \[   \underbrace{....}_\text{Some long text that should be multiline} \]   Trying  \text{Some long text that\\ should be multiline}   Didn't do the trick.


Hi I already tried all solution from , and used PostLogin option of GDM.... The problem is all of these option are only works when system boots up but it's not what I Ask.  I want an script execute everytime user unlocking his/her account after awakening from suspension.  I Already used systemd and udev but they are not the solution because   My script have depend on X so I have to be sure that X is already started The script should run as the user that login not root.   I use GDM 3.20 on Arch Linux    I dont realy care if the script runs before login (for example script run for all avalible user)

I'd like to run a script if the Gnome session is locked and unlocked. Is there a way that I can intercept this and perform certain actions when the desktop is locked or unlocked?


From the 1987 Spanish Mathematical Olympiad: Prove, for all natural numbers $n$ with $n > 1$, that $1\sqrt{n\choose1} + 2\sqrt{n\choose2}+3\sqrt{n\choose3}+\cdots+n\sqrt{n\choose{n}} < \sqrt{{2^{n-1}}{n^3}}$.  I tried using some estimates on the size of $n\choose k$, like ${n \choose k} \leq \frac{n^k}{k!}$, but nothing seemed to work, mainly due to all the choose functions being enclosed within square-roots.

Prove that for every positive integer $n \ge 2$ $$\sum^n_{k=1}k \sqrt{\binom nk}\leq\sqrt{2^{n-1}n^3}$$ I tried it by induction but I didn't know how to end it.


I'm not a native English speaker and I find English quite difficult and confusing and one of the reasons is because of its tenses—which I find challenging and rewarding once everything becomes clear—so I would like to ask which of these two are correct:        I thought we talked about this before     I thought we had talked about this before      I've read somewhere that I should use the past perfect tense to indicate past action that occurred prior to another past action, and Past perfect verbs are always formed by using adding ‘had’ before the past participle form of the verb.  E.g. had + talked  In the examples above, "thought" and "talked" are both past actions, but "talked" happened before "thought", so my guess is that sentence no. 2 is the correct one, but I'm not so sure because sentence no. 1 is used most of the time in movies and conversation.   What are your thoughts about this?

I noticed that my American friends tend to use the past perfect form when they use the verb mention in its past form, almost despite of the context of the sentence. I hear them say  "you had mentioned" a lot more often even in situations where the use of simple past would have been perfectly fine. Have you noticed it too and is it one of those unwritten rules, or is there a more formal explanation to it?  It seems like there was more verbs like that, but I am having a hard time remembering it now. If I do, I will edit the post and likely change the title to accommodate other verbs.


Can't use limit rules as $\sqrt{n^2+1}$ and n are not convergent sequences

I want to use the definition of the limit to show that $\sqrt{n^2+1}-n$ converges to 0.  The definition is as follows: if $\sqrt{n^2+1}-n$ converges to 0, then $\forall \epsilon>0$, there exists an $N>0$ such that $n\ge N \implies \mid\sqrt{n^2+1}-n\mid<\epsilon$.  Now I want to start backwords in order to figure out how to pick N. I know:   $\mid\sqrt{n^2+1}-n\mid=\sqrt{n^2+1}-n$   since $n$ is a natural number and $\sqrt{n^2+1}>n$. So I need to pick an N such that $\sqrt{n^2+1}-n<\epsilon$. I tried multiplying $\sqrt{n^2+1}-n$ by $\frac{\sqrt{n^2+1}+n}{\sqrt{n^2+1}+n}$ but that didn't really seem to help.   Do you have any ideas on how to find this N?  Thanks


I tried a lot of things to make it work. I've tried about 40 articles but nothing seems to work.  This is the unclaimed message:   *-network UNCLAIMED               description: Network controller        product: Realtek Semiconductor Co., Ltd.        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:02:00.0        version: 00        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress cap_list        configuration: latency=0        resources: ioport:4000(size=256) memory:b4200000-b420ffff   I tried something with bcmwl  sudo apt-get purge bcmwl-kernel-source   and   sudo apt-get remove bcmwl-kernel-source   Info about the wireless card:  02:00.0 Network controller: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter     Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter     Flags: fast devsel, IRQ 255     I/O ports at 4000 [size=256]     Memory at b4200000 (64-bit, non-prefetchable) [size=64K]     Capabilities: <access denied>   I even tried installing the b43 but it didn't help.  Output of nmcli device:  DEVICE  TYPE      STATE      CONNECTION          eno1    ethernet  connected  Wired connection 1  lo      loopback  unmanaged  --        Output of networkctl status:  WARNING: systemd-networkd is not running, output will be incomplete.  ●        State: n/a        Address: 10.0.0.2 on eno1                 fdac:15a9:fea6:0:7d36:1c7e:50eb:dc12 on eno1                 fdac:15a9:fea6:0:856d:ebdd:18b9:d2d0 on eno1                 fe80::3b03:3eeb:f213:5fd on eno1        Gateway: 10.0.0.138 (VTech Telecommunications Ltd.) on eno1    Output of sudo lshw -short -class network:  H/W path       Device  Class          Description ================================================= /0/100/1c.4/0          network        Realtek Semiconductor Co., Ltd. /0/100/1c.5/0  eno1    network        RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller   Output of ls -l /etc/resolv.conf:  lrwxrwxrwx 1 root root 39 Apr 21 15:27 /etc/resolv.conf -> ../run/systemd/resolve/stub-resolv.conf   Output of dmesg | grep -i eth:  [    1.912278] wmi_bus wmi_bus-PNP0C14:00: WQ data block query control method not found [    1.912282] wmi_bus wmi_bus-PNP0C14:00: WQ data block query control method not found [    1.912285] wmi_bus wmi_bus-PNP0C14:00: WQ data block query control method not found [    1.912289] wmi_bus wmi_bus-PNP0C14:00: WQ data block query control method not found [    1.912555] wmi_bus wmi_bus-PNP0C14:01: WQBC data block query control method not found [    1.912590] wmi_bus wmi_bus-PNP0C14:01: WQBJ data block query control method not found [    1.933328] r8169 Gigabit Ethernet driver 2.3LK-NAPI loaded [    1.945215] r8169 0000:03:00.0 eth0: RTL8168h/8111h, e4:e7:49:33:9c:6b, XID 54100800, IRQ 129 [    1.945222] r8169 0000:03:00.0 eth0: jumbo features [frames: 9200 bytes, tx checksumming: ko] [    1.962196] r8169 0000:03:00.0 eno1: renamed from eth0 [    2.000103] VGA switcheroo: detected Optimus DSM method \_SB_.PCI0.RP01.PXSX handle [   11.610285] Bluetooth: BNEP (Ethernet Emulation) ver 1.3

We just bought a Lenovo  (which is supposed to have the Intel 8265 for wireless). This laptop was bought in part because it is certified to run Ubuntu and as such to me at least it would make sense for things to work out of the box... but no such luck.  First, I installed Ubuntu 17.10 and after installation realised Wi-Fi was not working. I also tried Ubuntu 16.04 from a USB drive since that is the version of Ubuntu it is certified for, but no luck there either.  The wireless chip is not detected by lshw (or even lspci by the looks of it), ip link does not show a wireless interface, and the iwlwifi kernel module is not loaded at boot (I can load this myself using modprobe iwlwifi but this does not make Wi-Fi work). I think it is a combined Wi-Fi/Bluetooth chip, and Bluetooth does appear to work (or at least Bluetooth shows up in Gnome and rfkill list).  modinfo iwlwifi | grep 8265 shows me a file ending in -34 is supposedly loaded but only a file ending in -33 (and some other lower numbers) is present in /lib/firmware, if that helps).  I have also installed the Linux 4.14.9 kernel in an attempt to get things to work, but this did not resolve the issue either.  Further information  root@ThinkPad-E570:~# modinfo iwlwifi | grep 8265 firmware:       iwlwifi-8265-34.ucode root@ThinkPad-E570:~# rfkill list all 0: tpacpi_bluetooth_sw: Bluetooth     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no root@ThinkPad-E570:~# dmesg | grep iwl root@ThinkPad-E570:~# lspci -nnk | grep 0280 -A3 05:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. Device [10ec:c821]     Subsystem: Lenovo Device [17aa:c024]   Update  I just noticed that the laptop does not have an Intel wireless chip at all, but in fact has a Realtek one... which means that the  of the shop I bought this laptop at were not accurate... Sigh. Same problem stands, however, just with a crappier wireless chip.


Program for display method  void display() {     String selection = MediaStore.Audio.Media.IS_MUSIC + " != 0";     ContentResolver contentResolver = getActivity().getContentResolver();     Uri uri = MediaStore.Audio.Media.EXTERNAL_CONTENT_URI;     Cursor cursor = contentResolver.query(uri, null, selection, null, null);      if (cursor != null && cursor.moveToFirst()) {         int songTitle = cursor.getColumnIndex(MediaStore.Audio.Media.TITLE);         int songArtist = cursor.getColumnIndex(MediaStore.Audio.Media.ARTIST);         do {             int i = 0;             String title = cursor.getString(songTitle);             String artist = cursor.getString(songArtist);             songsList.add(title + "\n" + artist);             i++;         } while (cursor.moveToNext());     }     cursor.close();     songsList = new ArrayList<>();     songsAdapter = new ArrayAdapter<String>(getActivity(), android.R.layout.simple_list_item_1, songsList);     l1.setAdapter(songsAdapter);      l1.setOnItemClickListener(new AdapterView.OnItemClickListener() {         @Override         public void onItemClick(AdapterView<?> parent, View view, int position, long id) {          }     }); }   Error for display method  2019-03-05 23:16:59.323 504-504/? E/ANDR-IOP: IOP HAL: Received pkg_name = com.noob.audioplayer pid = 0 2019-03-05 23:16:59.723 18049-18049/com.noob.audioplayer E/AndroidRuntime: FATAL EXCEPTION: main Process: com.noob.audioplayer, PID: 18049 java.lang.NullPointerException: Attempt to invoke virtual method 'void java.util.ArrayList.add(int, java.lang.Object)' on a null object reference at com.noob.audioplayer.SongsFragment.display(SongsFragment.java:137)

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


var fruits = [];         fruits[0] = {name:"apple", stock:"1box"}         fruits[1] = {name:"banana", stock:"2box"}         fruits[2] = {name:"banana", stock:"3box"}   so in case of this object is there any simple way to add new field inside of list like this? for example  fruits[0] = {name:"apple", stock:"1box", **taste:"good"**}   like this.  i tried create new template and copy original data and paste to the new template, for example  function fruit_2(name, stock, taste){ this.name = name; this.stock = stock; this.taste = taste; }//create new template   and re-add element from the fruit[0] and then fruit[1] to new template like this  but i was wondering if there is easier or faster way.  thank you for reading my question.  i will appreciate any help! thanks!

How do I append an object (such as a string or number) to an array in JavaScript?


Our Sorcerer wanted to cast a Lightning Bolt as their attack on a monster that had made it into melee with that Sorcerer.  DM said could make the attack, but it would provoke an OA (that would likely kill the sorcerer).   Player argued that as a magic-using character they would be as adept as a Fighter doing a melee attack. The range being Self was integral to the issue. What lies beyond the initial target was not in question. AoE was not relevant.  DM ruled (and yes, whatever he decides is what we go with, I'm here looking for discussion of rules and logic of the situation), that it took enough time summoning the magic that the monster would get a free shot. Player countered that a successful attack would stop the spell anyway.  Player maintained that it was essentially a melee attack he was making as the range was less than 5 feet (starting with the caster) and should not provoke OA.  Which position is correct though? Does casting Lightning Bolt within an enemy's reach provoke an Opportunity Attack?  @Rubiksmoose This question is different enough from your provided generic answered question. Those who are versed in earlier version rules will benefit from the specifics of this question. As well as the specific differentiation between ranged attacks and the lightning bolt characteristics.

What provokes an opportunity attack?  In 3.X moving out of a threatened square, standing up from prone, casting a spell (unless cast defensively), or making a ranged attack provoked, while in 4e moving out of a threatened square or making a ranged/area attack provoked.


I've been asked the following question:  What three odd integers from the set {1,3,5,7,9,11,13,15} that when summed together equals to 30? Note that any integer can be used more than once.  Is there any possibility to solve these kind of questions with some formulae? Note I have gone through the answers for making it with 5 numbers.

I've been asked the following question:  What five odd integers from the set  $\{1, 3, 5, 7, 9, 11, 13, 15\}$ that when summed together equals to $30$? Note that any integer can be used more than once.   If my limited knowledge of maths is correct, there should be no answer, as no odd number of odd integers summed together can give an even number.


I have a TikZ node positioned between two other nodes using fit:  \documentclass{article} \usepackage{tikz} \usetikzlibrary{fit}  \pagestyle{empty} \usepackage{parskip}  \newcommand{\mybox}[1]{     \begin{tikzpicture}         \node (t) [minimum width=.4\linewidth,anchor=north west,draw] at (0,5){box above};         \node (b) [minimum width=.4\linewidth,anchor=south west,draw] at (0,0){box below};         \node [fit=(t.south west) (b.north east), inner sep = 0, draw, align=flush left]{#1};     \end{tikzpicture} }  \begin{document} \mybox{     {\large Here we} have\newline some...      ...somewhat {\bfseries longer arbitrary text} content. } \end{document}     Now I would like to vertically align the contents of the node at the top and also add some padding around the node contents. How can I do this?

The output from the following script \documentclass{article} \usepackage{tikz} \usepackage{graphicx} \begin{document} \begin{tikzpicture}   \node(title)[text width = 0.25\textwidth, text height = 3 cm, draw]{title};   \end{tikzpicture} \end{document}  is  How can I vertically align the text in the node? Specifying the text depth as in \node(title)[text width = 0.25\textwidth, text height = 1cm, text depth = 1 cm, draw]{     title line 1\\     title line 2\\     title line 3};  Does not result in the text being vertically centred.


I have a mesh representing my character. I want to give it a partially transparent greyish silhouette when other objects are blocking it from view of the camera.  I'm using Ogre3D, and GLSL as a shading language, but this is a pretty technology/language agnostic question.

How can I draw outlines around 3D models? I'm referring to something like the effects in a recent Pokemon game, which appear to have a single-pixel outline around them:


I'm new at this stuff, so I'm trying to send stuff to sketchup with a brushed metal detail. But the brushed material doesn't show on the preview. What is it I'm doing wrong? Do I have to bake it? How do I bake brushed metal, which I'm trying to do?

I used node textures in a mesh I exported to .FBX.  I then imported it into Unreal Engine 4 and it didn't import any textures; I clicked the Upload Textures option in Unreal Engine.  Is there something I'm doing wrong or is it Blender?


Can anyone help me solve this question  Does the limit exists?  $$\lim_{(x,y) \to (0,0)}\frac{xy^2}{x^2+y^4}$$  I tried using polar coordinates to solve this problem but I got $\frac{0}{0}$ which is an undefined number so I conclude that the limit does not exists. Also I tried to sub $y=mx$ to to test for disco unity but I keep getting $0$. I even tried $y=mx^2$ but I still get $0$. Can I use polar coords to test whether the limit exists or not?

$$\lim_{(x,y) \to (0,0)} \frac{{x{y^2}}}{{{x^2} + {y^4}}} = 0$$ Please, Anyone could suggest me some way for this?. Thanks.


Heyho,  I am using the separation-of-variables method for quite a while now, but what was always bothering me a bit, is why is it possible to do those operations. I'll give a concrete example (source Wikipedia):  $$\frac{dy}{dx}=xy^2 + x \Rightarrow \frac{dy}{1+y^2} = x \:dx \Rightarrow \int{\frac{dy}{1+y^2}} = \int{x \:dx} \Rightarrow \cdots$$  and so on. My problem lies in step 2. Why can I just treat the differential operator like a variable?

I see an equation like this:  $$y\frac{\textrm{d}y}{\textrm{d}x} = e^x$$  and solve it by "separating variables" like this:  $$y\textrm{d}y = e^x\textrm{d}x$$ $$\int y\textrm{d}y = \int e^x\textrm{d}x$$ $$y^2/2  = e^x + c$$  What am I doing when I solve an equation this way?  Because $\textrm{d}y/\textrm{d}x$ actually means  $$\lim_{\Delta x \to 0} \frac{\Delta y}{\Delta x}$$  they are not really separate entities I can multiply around algebraically.    I can check the solution when I'm done this procedure, and I've never run into problems with it.  Nonetheless, what is the justification behind it?  What I thought of to do in this particular case is write  $$\int y \frac{\textrm{d}y}{\textrm{d}x}\textrm{d}x = \int e^x\textrm{d}x$$ $$\int \frac{\textrm{d}}{\textrm{d}x}(y^2/2)\textrm{d}x = e^x + c$$  then by the fundamental theorem of calculus  $$y^2/2 = e^x + c$$  Is this correct?  Will such a procedure work every time I can find a way to separate variables?


Is there a hotkey to switch between tabs in Gedit? Ctrl+Tab and Ctrl+PageUp are not working. I'm using Ubuntu 14.04.

If I have multiple tabs open, how do I move from one to another? (Ubuntu 11.10; gedit 3.2.1)


Is there a way to convert the code below to have a dot added between the numbers it puts out? I'm not trying to use an algorithm or foreign library. I'm trying to continue my python knowledge with the built-in modules first  print(list("😀".encode("utf-8")))

What would be your preferred way to concatenate strings from a sequence such that between every two consecutive pairs a comma is added. That is, how do you map, for instance, ['a', 'b', 'c'] to 'a,b,c'? (The cases ['s'] and [] should be mapped to 's' and '', respectively.)  I usually end up using something like ''.join(map(lambda x: x+',',l))[:-1], but also feeling somewhat unsatisfied.


How do I setup the file system and partitions to dual-boot Windows 7 and Ubuntu?  Bootmgr is missing, and the OS cannot be found. I've looked at a few utilities, like UBCD, but they are somewhat technical and I don't wish to mess up my system any more than it already is.

I need my pre-installed version of Windows 7 (or any other version of Windows), how could I install Ubuntu without erasing it?


During the different franchise series (excluding ENT) there are only very few encounters with new or unknown species the crews of the ships don't understand. Most often even the most alien species utilizing recognizable speech seem to speak English (or whatever dubbing you're watching).  .    But how about Voyager traveling through Delta quadrant, which hasn't been explored yet? It's a first contact situation almost every single time. Yet the universal translator seems to pick up their language instantly, even on real first contacts, greetings, etc. The translator probably isn't able to scan brain waves etc. when other, more important systems (like target scanners, sensors, etc.) can't get through shields either.  Also I'm afraid it still doesn't explain situations when some of the crewmen are outside without any scanning gadgets on them. Sometimes even without their com badges.

In Star Trek, there are universal translators on the ship to make communications between the different species possible.  But there are countless times when Klingons talk in Klingon and English, when Picard quotes French or Latin, when characters say a few lines here or there in some foreign tongue to show they know the language.  Why doesn't the translator translate these phrases, too, if all other languages are instantly translated?


I find myself using the actual F* only for F1 to F6, but for music and sound controls I use the function instead. I've tried using functions by default, and it works great for F7 to F12, but then I need to use fn for the first half. I've also tried disabling the functions by default, but then I end up using fn for the other half of the function keys.  Is there a way to configure the keyboard so they trigger the actual F* only for some function keys, and the function for others?

I want to override F1 and F2 behavior, since I have external display and Mac can't control display's brightness. The rest of the keys should retain their non Fx  I know about "Use all F1-F12 keys as standard function keys.", but I don't want to change all of the keys to be F when pressed, just some of them. (For me single press music and volume control is necessary.)  Is there a way to pick some of the function keys to default to numbered function instead of the "Apple" definitions system wide?


I have java syntax. Sory I'm still not figure out why this happen.  public class TestString {   public static void main(String [] args){     int i=-1;     String a=((Object)i).toString();     if(a=="-1"){         System.out.println("Same");     }else{         System.out.println("Not");     }   } }   And then the result is "Not" what the problems why -1 string different with -1 int in object?

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


I am looking for a way, if possible, of specifying file paths not relative to the main document but to the subdocument in which they are contained. As background:  I am writing my thesis chapter by chapter. I have written each chapter as an independent document, edited it, and now want to combine all chapters into one document. Each chapter document is structured to have a main.tex which contains the preamble, the \begin{document}, etc. The actual text is contained in a file called toc.tex which contains the section structuring of each chapter and in turn imports the documents containing each section. So main.tex looks something like this:  PREAMBLE \begin{document} \maketitle \tableofcontents \input{toc.tex} \printbibliography \end{document}   each toc.tex looks something like the following:  \section{A} \input{./Content/A.tex} \section{B} \input{./Content/B.tex}   This means that I can compile each chapter individually. My plan was now to compile the overall thesis by using a main_thesis.tex which looks something as follows:  PREAMBLE \begin{document} \maketitle \tableofcontents \input{toc_thesis.tex} \printbibliography \end{document}   where the file toc_thesis.tex looks as follows:  \chapter{Introduction} \input{./chapters/Introduction/toc.tex} \chapter{Body} \input{./chapters/Body/toc.tex}   My folder structure would thus looks along the following lines:  thesis    chapters       Introduction          Content          Figures       Body          Content          Figures   When I now compile main_thesis.tex I get an error message saying File `./Content/intro.tex' not found. \input{./Content/intro.tex}, i.e. the file toc.tex in the Introduction chapter can't find the file intro.tex which is contained in ./chapters/introduction/Content as it is looking in ./Content which doesn't exist.   As far as I understand this is because the paths apparently are always relative to where the main file resides not the inputted subfile (). My question is, is there anyway of changing this behaviour to get LaTeX to use the paths relative to the input files not the main file? I am using TeXStudio should this be of relevance to the question.

I'm currently using doxygen to generate some documentation for a project,  and doxygen generate some LaTeX code that then can be used to generate a nice pdf.  But let's say I would like to write another document, and in that document include the doxygen generated LaTeX code as a part of that document.   How would I do that? Has anybody done this type of stuff?    My try is to get the code, generate the LaTeX code without the "header". So I end up with a dir called code/doc/latex/, seen from the place where I have my own main.tex.  And try in include that LaTeX code from my main.tex with input.  \input{ code/doc/latex/refman.tex }   But when I try to include the code/doc/latex/refman.tex (the doxygen, main.tex),  he complains that he can't find the other LaTeX files that was generated by doxygen. It seems like he is searching in the same dir as my main.tex and not in code/doc/latex/.  This is more or less how the refman.tex looks like:  \chapter{Todo List} \label{todo} \hypertarget{todo}{} \input{todo} \chapter{Class Index} \input{annotated} \chapter{File Index} \input{files} \chapter{Class Documentation} \include{struct__offsetChannel} \include{struct__offsetPixel} \include{struct__tPixel} ... ...   Any ideas would be welcome.  A solution could be to write a script that edits all the generated LaTeX code, and simply adds this path but this seems like a overly complicated solution.    Update:  The error I get is like this one  ! LaTeX Error: File `todo.tex' not found.     Update:  If I change all the \input \include and \includegraphics like this it works.  \input{todo} -> \input{code/doc/latex/todo}   But there must be a way to make LaTeX understand that he should look into the code/doc/latex/ for the code?


I have windows xp iso file, and I want to upload it on a usb (pendrive).  Then I want to install the Windows on my computer.  How can I burn the windows .iso file on my pendrive?

I want to burn a Windows ISO to a USB device in Ubuntu. How do I do this?   I know how to burn a Ubuntu ISO into a USB device, but with a Windows ISO it's not the same.


Ever since I learned about fractions in Elementary School, I've known how to work with them. The problem is, although I remember the mathematical rules, I don't remember how I assimilated the equality between fractions and divisions when I was younger. This is really troubling to my mind because it feels like I partly understand this concept. I know that the denominator represents the amount of parts a whole was divided into and that the numerator represents the amount of parts I'm working with. Let's say, I want to divide 3 by 4. The result of this division is 3/4. But, in this case, I'm dividing 3 wholes by 4. Doesn't this come into conflict with the definition of the denominator, which is the amount of parts in which 1 whole is divided into?   This confusion is really bugging me and I'd really appreciate if someone could clear it up. Thanks for the attention.

Can anybody explain what a fraction is in a way that makes sense. I will tell you what I find so confusing:   A fraction is just a number, but this number is written as a division problem between two numbers! There is no answer to this division problem, I mean if I try to calculate what the result is I'll just get a fraction as a result! So if I inputed this into my calculator: $\frac{1}{2}$, I will get a result of $0.5$, which itself is a fraction: $\frac{5}{10}$!


I would like to perform string substitution in several files.  The string is particular as it is in the form  use module_plotting and I need to avoid the replacement when encountering a string like use module_plotting_debug.  Thanks is advance for the answer(s)

I have a list of replacements like so:  search_and -> replace big_boy -> bb little_boy -> lb good_dog -> gd ...   I need to make replacements for the above, but at the same time avoid matching strings that are longer like these:  big_boys good_little_boy   I tried this:  sed -i -r "s/$(\W){search}(\W)/$\1{replacement}\2/g"   But the above does not work when the string ("good_dog" in this case) occurs at the end of a line like so:  Mary had a 'little_boy', good_little_boy, $big_boy, big_boys and good_dog  Mary had a 'lb', good_little_boy, $bb, big_boys and good_dog   And I doubt the above would work when the string occurs at the start of the line too. Is there a good way to do the search and replacement?


What is the practical proof for $-1(-1)=+1$. Actually multiplication is repetitive addition. I am struggling how can I provide an activity to prove practically $-1(-1)=+1$

Someone recently asked me why a negative $\times$ a negative is positive, and why a negative $\times$ a positive is negative, etc.  I went ahead and gave them a proof by contradiction like so:  Assume $(-x) \cdot (-y) = -xy$  Then divide both sides by $(-x)$ and you get $(-y) = y$  Since we have a contradiction, then our first assumption must be incorrect.  I'm guessing I did something wrong here. Since the conclusion of $(-x) \cdot (-y) = (xy)$ is hard to derive from what I wrote.  Is there a better way to explain this?  Is my proof incorrect?  Also, what would be an intuitive way to explain the negation concept, if there is one?


I am new to QGIS. I am looking for any plugin or any manual method in QGIS for finding minimum distance (perpendicular distance) from a point which is part of one shapefile to nearest line among many lines which is part of another shapefile. MMQGIS is not useful for this purpose.   I used v.net.connect command.  I am getting minimum distance (perpendicular distance) from points which are part of one shapefile to nearest line among many lines which is part of another shapefile, but there is one problem. I am not identifying from the attribute table which distance belongs to which line.   In the attribute table, there 32 distance values for 32 points w.r.t nearest line. Is there any method to identify which distance value is belong to which nearest line? I want to identify the line identity in attribute table w.r.t distance value


I recently updated from Ubuntu 18.04.4 to 20.04.1. Now I noticed that the icons on the Desktop disappear shortly when I delete a file by pressing the Del key. There is no flickering when I delete a file in my HOME folder for example. Environment  Window manager: Gnome 3.36.3 Desktop environment: ubuntu-wayland Linux distribution: Ubuntu 20.04.1  Maybe related I also noticed that I cannot drag and drop files from the desktop into an open folder. I have to Ctrl + X and Ctrl + V the files.

In Ubuntu 20.04, on the desktop, there is a number of actions I wish I could do, such as, by order of importance :  use keyboard shortcuts such as select all, copy / paste. use drag & drop with icons deactivate the "mouse over" highlight, and restrict the clicking area to only the icon, not the surrounding square  To put it simply, I'd like to have the exact same features as offered by the desktop of Ubuntu 18.04 (probably related to a specific version of GNOME, and not Ubuntu itself). Am I missing something obvious here? I actually see no reason why those actions are removed or deactivated on the desktop, since they all work in any Nautilus window.


Our company would like to understand the effects:   If we have single table with Primary Key Identity column, int primary key IDENTITY(1,1),  and the Application is conducting multi-threading parallel processing, trying to conducts 1000s of simultaneous inserts on one table.   Would the identity primary key column fail, with a primary key violation in any way, for example: processors are trying to input the same identity number?  Or was SQL designed to be successful even in multithreading parallel insert?  Note: IDENTITY_INSERT is OFF

TL;DR: The question below boils down to: When inserting a row, is there a window of opportunity between the generation of a new Identity value and the locking of the corresponding row key in the clustered index, where an external observer could see a newer Identity value inserted by a concurrent transaction? (In SQL Server.)  Detailed version  I have a SQL Server table with an Identity column called CheckpointSequence, which is the key of the table's clustered index (which also has a number of additional nonclustered indexes). Rows are inserted into the table by several concurrent processes and threads (at isolation level READ COMMITTED, and without IDENTITY_INSERT). At the same time, there are processes periodically reading rows from the clustered index, ordered by that CheckpointSequence column (also at isolation level READ COMMITTED, with the READ COMMITTED SNAPSHOT option being turned off).  I currently rely on the fact that the reading processes can never "skip" a checkpoint. My question is: Can I rely on this property? And if not, what could I do to make it true?  Example: When rows with identity values 1, 2, 3, 4, and 5 are inserted, the reader must not see the row with value 5 prior to seeing the one with value 4. Tests show that the query, which contains an ORDER BY CheckpointSequence clause (and a WHERE CheckpointSequence > -1 clause), reliably blocks whenever row 4 is to be read, but not yet committed, even if row 5 has already been committed.  I believe that at least in theory, there may be a race condition here that might cause this assumption to break. Unfortunately, documentation on Identity doesn't say a lot about how Identity works in the context of multiple concurrent transactions, it only says "Each new value is generated based on the current seed & increment." and "Each new value for a particular transaction is different from other concurrent transactions on the table." ()  My reasoning is, it must work somehow like this:   A transaction is started (either explicitly or implicitly). An identity value (X) is generated. The corresponding row lock is taken on the clustered index based on the identity value (unless lock escalation kicks in, in which case the whole table is locked). The row is inserted. The transaction is committed (possibly quite a lot of time later), so the lock is removed again.   I think that between step 2 and 3, there is a very tiny window where   a concurrent session could generate the next identity value (X+1) and execute all the remaining steps, thus allowing a reader coming exactly at that point of time to read the value X+1, missing the value of X.   Of course, the probability of this seems extremely low; but still - it could happen. Or could it?  (If you're interested in the context: This is the implementation of . NEventStore implements an append-only event store where every event gets a new, ascending checkpoint sequence number. Clients read events from the event store ordered by checkpoint in order to perform computations of all sorts. Once an event with checkpoint X has been processed, clients only consider "newer" events, i.e., events with checkpoint X+1 and above. Therefore, it is vital that events can never be skipped, as they'd never be considered again. I'm currently trying to determine if the Identity-based checkpoint implementation meets this requirement. These are the exact SQL statements used: , , .)  If I'm right and the situation described above could arise, I can see only two options of dealing with them, both of which are unsatisfactory:   When seeing a checkpoint sequence value X+1 before having seen X, dismiss X+1 and try again later. However, because Identity can of course produce gaps (e.g., when the transaction is rolled back), X might never come. So, same approach, but accept the gap after n milliseconds. However, what value of n should I assume?   Any better ideas?


I am macOS rookie and now have difficulties with Safari, I would like to find how I can save tabs?   For example some tabs were open, than I close Safari and turn off laptop, next time when I turn on laptop and open Safari I would like my tabs restored and open again...

I'm looking for a more efficient way to manage my tabs in Safari. Specifically something that allows me to move multiple tabs at once to a new window.  I often find myself following a link for a new subject/idea, then another, and so on and so on, until I find myself with a dozen tabs that should really be in their own window, but it's a pain to manually find and drag each one. I'd love to be able to do it in one fell swoop. Any suggestions?