The Force can be used for moving objects, including living animals.  There are a few instances I can think of where the Force is used on a person, such as Anakin using the Force in Season 1, Episode 4 of The Clone Wars on Padme when she has to jump between trains.  Has there ever been a situation, in TV shows, comics, or the EU, where a Jedi has used the Force on their own body, such as propelling themself up a ledge or almost flying?  I am excluding cases such as jumping higher than normal; I am thinking of more outright examples.

In The Empire Strikes Back Yoda uses the Force to lift Luke's X-Wing out of the water and put it on land.  In Attack of the Clones and in many instances in the second series of The Clone Wars, Anakin (and others) use the Force to jump higher than they could otherwise, or to jump from very high locations, but I don't think I've ever seen the Force used for outright self-levitation.  But if Yoda could lift the X-Wing, shouldn't a strong Jedi be able to lift himself and, essentially, fly with the help of the Force?


I have been taught about the partial correlation coefficient.   I later read that there is alao such a thing as a conditional correlation coefficient, and that these are not the same.  What is the difference between the two?

From      Formally, the partial correlation between $X$ and $Y$ given a set of $n$ controlling variables $Z = \{Z_1, Z_2, …, Z_n\}$, written $ρ_{XY·Z}$, is the correlation between the residuals $RX$ and $RY$ resulting from the linear regression of $X$ with $Z$ and of $Y$ with $Z$, respectively.     It says earlier that     partial correlation measures the degree of association between two random variables, with the effect of a set of controlling random   variables removed.   I was wondering how the partial correlation $ρ_{XY·Z}$ is related to the correlation between $X$ and $Y$ conditional on $Z$? There is a special case for $n=1$.     In fact, the first-order partial correlation (i.e. when $n=1$) is nothing else than a difference between a correlation and the product   of the removable correlations divided by the product of the   coefficients of alienation of the removable correlations. The   coefficient of alienation, and its relation with joint variance   through correlation are available in Guilford (1973, pp. 344–345).   I was wondering how to write the above down mathematically?


How can I position a paragraph within a div to the very bottom?  I am trying a position-relative (on div), position-absolute (on p) combo but it doesn't work. I want the "Read more" text to be at the very bottom of the div because there are several of these divs next to each other and they very in text length.   HTML:

Joia

Concept design for an eCommerce solution for a local art store (exercise).

Read More

   CSS:    .card-body {         position: relative;     }      .read-more {         position: absolute;         bottom: 0;         left: 0;     }

Given the following HTML:

     Copyright Foo web designs

    I would like #copyright to stick to the bottom of #container. Can I achieve this without using absolute positioning?


Block quotes on Buddhist beta site comments are black text on black background.

Update: This is fixed on version 1.0.43 as per the accepted answer below.  Already saw ,  and . They are old and seem to be about previous versions.  I just updated to the version 1.0.41 of the Android app that brings the new feature - Achievements. Sadly, I think the stress of World Cup has made you guys not do a good job with it. It's buggy.  When I open my Achievements panel and tap on any post, I get this:    After I get this, it persists throughout the rest of the app. For example, if I go to the feed and open another question, I get this too.  Detailed reproduction steps are available in AD7six's answer.  My Device: Samsung Galaxy SIII LTE GT-I9305 Android: Stock ROM 4.3 Jelly Bean  Other Devices: - Device model, Android version, Reported by - HTC Desire, 4.2.2, xd6_ - Huawei Ascend, 4.2, Manu343726 - LG Optimus F3, 4.1.2, Rocket Hazmat - LG Optimus G, 4.3, Canadian Luke - Samsung Galaxy Nexus (Sprint), 4.3, Chrono Kitsune - Samsung Galaxy Note II, 4.3, Katja Christiansen - Samsung Galaxy SII GT-I9100, 4.1.2, AD7six - Sharp SH837W, 4.1.2, timrau - Sony Xperia SP, 4.3, pepoluan - Sony Xperia Z1, 4.3, user2313067 - Unknown, 4.2.1, Deer Hunter


Is it possible to use JavaScript to open an HTML select to show its option list?

How can you programmatically tell an HTML select to drop down (for example, due to mouseover)?


I have 4GB pendrive. while trying to formatting, it gives Write protected message. The pendrive is not having write protection notch. I have tried is on Windows as well as on Fedora 13.  cfdisk & fdisk or mkfs; nothing is working they are giving the same message that could not format write protected drive.  Disk /dev/sdb: 4016 MB, 4016046080 bytes 90 heads, 25 sectors/track, 3486 cylinders Units = cylinders of 2250 * 512 = 1152000 bytes Disk identifier: 0x000ae90f  Device     Boot      Start         End      Blocks   Id  System /dev/sdb1   *           4        3487     3917824    b  W95 FAT32   cfdisk /dev/sdb Opened disk read-only - you have no permission to write  sudo tune2fs -l /dev/sdb tune2fs 1.41.9 (22-Aug-2009) tune2fs: Bad magic number in super-block while trying to open /dev/sdb Couldn't find valid filesystem superblock.

When I plug in my USB flash drive, it shows up on my computer as write-protected or read-only. I am unable to transfer data to it, nor can I modify or delete any files already stored on it. I also cannot repartition or reformat the drive using Windows Disk Management, DiskPart, GParted, or other tools. The drive does not have a write-protect switch.  Why did this happen and what can I do about it? Is there a way to remove the write protection?  (Note that this can happen with some memory cards, too, as they often use controllers similar to those used in flash drives. In some cases, the system may report that the drive or card was formatted successfully even though it was never actually formatted; the original data reappears when the device is reinserted.)     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.


I use an online calculator in order to calculate $x^5-1=0$  I get the results    x1=1  x2=0.30902+0.95106∗i  x3=0.30902−0.95106∗i  x4=−0.80902+0.58779∗i x5=−0.80902−0.58779∗i   I know that this is the correct answer because my roots have to be on the complex plane but I do not understand how can I get the results!

How to find roots of $X^5 - 1$? (Or any polynomial of that form where $X$ has an odd power.)


I am using boolean through modifier.also use subdivision modifier on both objects. But why this shadow as shown on picture show up.i tried to simplefy sub modifier but no the result i wanted to.Mesh seems to screw up after boolean.

I tried to manipulate a cube with the Boolean modifier. I tried to cut out an edge of the cube with a cylinder. Also, the shading result looks awful in FLAT SHADING mode, so I turned on SMOOTH SHADING.   Has anyone an idea how to achieve a better result. (I also cut out a Sphere first, this made the result less awful).   I used Blender Internal and rendered with smooth shading for smoothness.  Using flat shading looks okay, except the "round" cutouts :/  Face normals are okay.  First image is smooth shading.    EDIT: User Pisurquatre suggested the EdgeSplit modifier, works perfect to me (Maybe a little tweaking here and there):


I installed XBMC using the Ubuntu Software Centre along with some codec packs on a fresh install of 12.04 today. I tested it with all kinds of media and everything ran great except for DVDs. Ubuntu and XBMC acknowledge there is a disc in the drive, but when I prompt XBMC to play it, it loads for a second and then stops.   Any ideas about what might be going wrong?

My machine can't play encrypted DVDs on a fresh install.  How do I add this capability?  Another useful bit of information would be what programs are best for playing DVDs, once I'm able to do so.  See the .  Will I be able to play DVD movies from ?


I have a char ('-') and a number (80) of times it should be repeated in a string. I need to get a string of that char repeated given number of times:  -------------------------------------------------------------------------------------------------------------   I know I can do result += myChar x N times in a loop. I don't think it is very efficient. Is there a better way to do that?  By the most efficient I mean: fastest

What is the best or most concise method for returning a string repeated an arbitrary amount of times?  The following is my best shot so far:  function repeat(s, n){     var a = [];     while(a.length < n){         a.push(s);     }     return a.join(''); }


java program  input:-My input is:- googshaopobuieoele and  output which I want is  7 ?   Note:- whatever my input I want to count only consonent not vowels.  `   int j;       int Count=0;     String scc="googshaopobuieoele";     String  s[]=scc.split("");     System.out.println(s.length);      for( j=0;j<s.length;j++)     {          if(s[j]!="a" && s[j]!="i" && s[j]!="o" && s[j]!="u" &&s[j]!="e")             Count++;     }     System.out.println(Count); }}   `

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?


The book English Grammar: Understanding The Basics makes the following declaration:     If you can use many with a noun (when it is pluralized), it’s a count   noun. If you can use much with a noun, it’s a noncount noun.   and elsewhere, it says:     If you can use fewer with a noun (when it is pluralized), it’s a count noun. If you can use less with a noun, it’s a noncount noun.   Consider this example: "I have less high schools in my area than in your area." According to the grammar rules above, high schools is a noncount noun but, far as I know, it is a count noun.

I've just received a memo which says (effectively)      As more people leave, there will be less people available.   I want that word to be fewer. Are there guidelines for which word ought to be used when?


I have downloaded debian-9.3.0-amd64-DVD-3.iso from internet. I just opened it with help of File Explorer and copied its content to a usb. I tried to boot my pc with that usb, but my usb was not detected in the boot menu and I did the same while installing ubunbtu, ubuntu media was detected.(i installed it and used it for 3 months). Where did I do wrong with the Debian?

I am running Windows 10 and am starting to learn how to boot from USB devices.   I have a 16GB USB (USB 3.0) drive and I want to do the following:   Make the 16GB USB drive run Debian Linux. Keep Windows 10 on my C: drive. Not partition my hard drive or set up a dual boot. Run the OS from my USB drive. Let all of my files and programs be saved to the USB (so I don't think that a live OS would be suitable). It should work as though it was a dual boot as in the way files are saved. Make it work on any computer it is plugged in to (assuming the BIOS is compatible).   I already know how to boot from a USB in my BIOS but I am unsure as to where to get an ISO file and how to install it to the USB.


I have a 5.5qt KitchenAid stand mixer with the burnished spiral ("pigtail") dough hook. This is not the C-hook. When I make a small amount (for example, using 250g of flour or approximately 2 cups) of standard-hydration dough, instead of kneading, the dough will wrap itself around the dough hook and spin in the bowl. I'm using speed 2.  Pulling the dough off the hook and allowing it to relax for 5 minutes will make it knead again for a bit (but not long, a minute or two at most).  Oiling the dough hook helps some, but the oil of course comes off, then it sticks again.  I've adjusted the height per the manual, so that's set correctly.  Other than switching to the coated dough hook (which is currently being shipped to me) or making a larger batch, is there anything else to do to prevent the dough from sticking to the hook?

I just got a new stand mixer - a nice, heavy 500W mixer with a 5-liter bowl. Until now, I'd been making bread by hand and kneading it on the countertop.  So the first thing I tried was using the mixer with the kneading hook, but I find that the dough tends to get wrapped around the hook and just spins around along with it.  I guess I'm doing something wrong, but I'm not sure if it's my technique or my ingredients. I'm using the same bread recipes as I did before. Any ideas?  Edit:  Thanks for all the input, guys. Here's some more info:   The mixer is a Kenwood KMix KMX-50. I've tried adjusting the height of the dough hook up and down, I'm not sure how far from the bowl's surface it should be. Any suggestions? I don't think I doubt it's a volume/quantity issue - I'm using a kilo of flour, which is around the 1.3kg bread weight limit of the spec. I mix at low speed.   I'll try Sobachatina's suggestion and try to add water. Let's see how it turns out. Thanks for all your suggestions!


When updating our website from XHTML to HTML5, will changing the following things result in rendering problems for our site in older browsers like Internet Explorer 8:   Specify <!doctype html>. (The current XHTML web pages are well-formed enough) Add new specific HTML5 semantic block tags like <header> and <article>. We are not going to use CSS for these tags - just wrap the existing parts of the site. Add microdata attributes to the existing tags like <p>.   After reading some books and many Internet articles, I see no problems as the new tags and attributes will be simply excluded from rendering as unknown in those older browsers. However, I admit, in practice there can be some issues, especially with IE. Does anybody have any real experience with that?

We are considering the pros and cons of switching from XHTML 1.0 Transitional to HTML5 for our website (for instance, to enhance our SERP positions by using microdata and new specific HTML5 tags for better indexing by search engine crawlers).   The current web pages are well-formed enough, so specifying <!doctype html> and some "polishing" is the only thing we need to do.  However, as we can see from the stats for our website, many of our visitors are still using old versions of browsers like IE8 (7.3%) which may know nothing about HTML5.  The question is: can changing our website to HTML5 cause serious rendering and usability issues?


I understand a good bit of the ARM system architecture. you have an ARM system on chip containing the CPU, GPU, peripherial devices, baseband processor and both CPU and Radio firmware. Supposedly the application OS is stored on the phone's internal flash memory chip and the bootloader ROM on the chipset firmware boots on top or before the app OS on flash module 0? Is this like a BIOS in a desktop PC?  Or is it that Android itself is stored in this on-chip firmware and the Root disk or Home directory is flash module 0, and it works like a live image booting from a CD or ROM?  What is the first thing to load in a. Android phone/tablet? Where is the main OS stored and where is the recovery bootloader stored? What about the radio firmware for phones?  When a phone boots, what is the animated splash screen and music tone played? Why does that flash video/animation always show the manuacturer logo screen, and then the Android OS video?

From the user's perspective when switching on the phone, I see two boot animations in my  running CM10. The first animation is from LG and the second animation is from CM10. Then it settles in with a locked screen ready for my input. What happens behind the scene (screen) during a boot process when an Android device is switched on? It will be helpful if the answers can help a non geek to understand various process and jargon (like, fastboot, bootloader, recovery, if applicable, etc.) regarding boot sequence.


I have used a BufferedReader to read in information from a txt file. I know the file is reading but I cannot select the first index (bookID number) to go through my if statement. I want the first line of the string to match with the bookID and then complete the if statements without skipping to the book is not found statement. Code below.   String bookID =  jTextField7.getText();     String quantity = jTextField8.getText();       jLabel9.setText("Item #" + Integer.toString(currItem) + "info");      jButton8.setEnabled(false);     jButton9.setEnabled(true);      BufferedReader br = null;     String sCurrentLine;      try {          //String sCurrentLine;         br = new BufferedReader(new FileReader("inventory.txt"));           while ((sCurrentLine = br.readLine()) != null) {            String[] split = sCurrentLine.split(",");           System.out.println(sCurrentLine);                  if (split[0] == bookID) {                     int discount = calculateDiscount(Integer.parseInt(quantity));                     double itemSubTotal = (Integer.parseInt(quantity)*new BigDecimal(split[2]).doubleValue()*(discount/100));                     subTotal += itemSubTotal;                      String info = split[0] + " " +  split[1] + " " + split[2] + " " + quantity + " " + Integer.toString(discount) + " " + (Integer.parseInt(quantity)*new BigDecimal(split[2]).doubleValue()*(discount/100));                     books.add(info);                     jTextField9.setText(info);                         return;                 }         }     }     catch (IOException e ){         e.printStackTrace();     }     finally {         try {             if (br != null)br.close();         }         catch (IOException ex) {             ex.printStackTrace();         }     }      JOptionPane.showMessageDialog(null, "Book ID " + bookID + " not in File");   }                                          I would appreciate any help. Thank you.


I had Windows 10 (which I use primarily) on one drive of my computer and Ubuntu 16.04 on another drive.  I updated Ubuntu to 17.10, but it would crash shortly after starting up.  Now, what I did next is probably what caused the rest of my problems and I will never do it again, but I'm hoping someone can help me through it.  In Windows, I deleted all of the partitions on my Ubuntu drive and planned to reinstall.  The reinstall ended with the same freezing problem, but when I restarted I was greeted with:  error: no such device: (series of letters and numbers which I assume is the device) error: unknown filesystem Entering rescue mode... grub rescue>   I have tried looking around for solutions and it appears I have removed Grub.  I have a bootable USB that can boot to the "try Ubuntu without installing" without it crashing, but I can't follow the other answers I've found.  I would like to return to a state where I only have Windows so I can try to get Ubuntu to work at a later time.  Edit: I should clarify that I already attempted to use ls in the rescue mode screen.  All of the (hdX,msdosY) returned an error.  Also sudo-installing grub did not work either.  Edit2: Looking at  question, I found that all of my drives/partitions returned:  Filesystem is unknown.   Other than (hd1,msdos6) and (hd1,msdos1) which returned:  Filesystem is ext2   I am not sure which of these is Windows and which is Ubuntu.  Can I try the solution in the link for either or is there something else I should do first?  Edit3: I tried the code in Update 3 of the linked solution with both of the ext2 filesystems.  Both returned:  file '/boot/grub/i386-pc/normal.mod' not found.

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.


Is there a way to add a superscript "6" into the "content" CSS property for a pseudo element? I've been all over the web, trying different Unicode strings and glyph codes to try to get this to work, but haven't found a solution.  Thanks!  EDIT: Sorry for not clarifying... I'm needing to put the superscript "6" amongst other text in the same "content" property. Looks like I'll need to just define a different encoding for my CSS and drop it in as a literal character.

How can I get superscript done, only in CSS?  I have a stylesheet where I mark the external links with a superscript character, but I'm having a hard time getting the character aligned correctly.  What I have currently, looks like this:  a.external:after {   font-size: 50%;   vertical-align: top;   content: "+"; }   but it doesn't work.  Naturally, I'd use the <sup>-tag, only if content would allow for HTML...


I have found that some number when passing through parseInt are changing to other number.  console.log( parseInt( 10153315281647662, 10 ) ); //10153315281647662 console.log( parseInt( 10153315281647663, 10 ) ); //10153315281647664 console.log( parseInt( 10153315281647664, 10 ) ); //10153315281647664 console.log( parseInt( 10153315281647665, 10 ) ); //10153315281647664 console.log( parseInt( 10153315281647666, 10 ) ); //10153315281647666 console.log( parseInt( 10153315281647667, 10 ) ); //10153315281647668 console.log( parseInt( 10153315281647668, 10 ) ); //10153315281647668 console.log( parseInt( 10153315281647669, 10 ) ); //10153315281647668 console.log( parseInt( 10153315281647660, 10 ) ); //10153315281647660   var str = '{ "id" : 10153315281647663 }'; console.log(  JSON.parse( str ) ) // id : 10153315281647664   I was working with few large numbers and parseInt or changing str to JSON with number is changing the numbers in result. This is not becasuse of integer stack overflow because the larger numbers 10153315281647666 is parsing correctly while 10153315281647663 is not, what can be the reason behind this?  I have fixed the issue by parsing everything into string, but what is the cause of this?

Is this defined by the language? Is there a defined maximum? Is it different in different browsers?


I am doing a speaker driver circuit. When I connect the oscilloscope probe to the output (emitters of npn/pnp complementaries) to where also the speaker is connected; the sound of speaker and the waveforms on the oscilloscope is satisfying. However, when I disconnect the osc probe and leave the speaker alone, than the sound gets much more noisy.   Why does that happen so?

Well, it will be a broad schematic. To summarize, there my approach is:   Yellow part is for oscilations at three different freqs(around 0.8 - 2 kHz, different for each of the three signals), sinusoidal, I can get nice 6 Vpeak sine waves, observed with oscilloscope, no noise, smooth. In the orange part, I use classical potentiometers to change the amplitudes of the signals. For this part, I suspect from the potentiometers, I know they are very unstable but I somehow have to use them. Then, red part, adds the signals together, nothing fancy. Finaly, the green part is my design to drive an 8 ohms speaker.   Now, when I connect the speaker, I get a noticable noise on the speaker output. It is both understandable from sound and also checked by oscilloscope. I have heatsinks for transistors, and I suspected from them for the reason I explained in my .     when I inspect the signals in the circuit via oscilloscope, I see there is some noise on waveforms, while trying to understand where it comes from, I have touched the heatsink (...) It becomes much smooter.   However, then, I thought it might be resulting from something else and wanted to get your opinions about it. What can I do to minimize the noise ? Would soldering things on something like  solve things?  Things to note:   I got satisfying results in simulations, everything was as I wanted. However the reality spoiled me. I implement the circuit on a breadboard for now, while prototyping, I suspect it may be bad in terms of noise. I don't know it is relevant or not but the noisy parts are mostly in the upper parts of sinusoidal waves.   Thanks in advance.


With the definitive edition I want to play more of this old game. One problem I've always had is how to chat only to allies or everyone. It's unclear to me where the default Enter chat goes to, it seems everyone. How can this be specified?

I very rarely see chats too all and don't know how to do it myself. Normally it's SHIFT + ENTER The following hotkeys have been tried: - SHIFT + ENTER - CTRL + ENTER - ALT + ENTER


7a. Prove by Mathematical Induction that $4^{n+1}+5^{2n-1}$ is divisible by $21$.

Induction: Prove that $4^{n+1}+5^{2 n - 1}$ is divisible by 21 for all $n \geq 1$.


If I download OptiFine, can I still play Minecraft with someone who doesn't have OptiFine?  Or will this mess up the game somehow?

I'm wondering if I could play Minecraft with my friend. A modded Minecraft, only myself with mods and him without mods.  Is it possible?


I know that one can approximate expectations of a function with respect to a pdf as such $$ \mathbb{E}_{p(x)}[\phi(x)] = \int \phi(x) p(x) dx \approx \frac{1}{N}\sum_{i=1}^N \phi(x^{(i)}) \qquad\qquad \text{where } x^{(i)} \sim p(x) $$ How can I approximate a normalizing constant in a similar way using Monte Carlo? $$ \mathcal{Z} = \int \widetilde{p}(x) dx \approx \,\, ? $$

This is a recurring question (see ,  and ), but I have a different spin.  Suppose I have a bunch of samples from a generic MCMC sampler. For each sample $\theta$, I know the value of the log likelihood $\log f(\textbf{x} | \theta)$ and of the log prior $\log f(\theta)$. If it helps, I also know the value of the log likelihood per data point, $\log f(x_i | \theta)$ (this information helps with certain methods, such as WAIC and PSIS-LOO).  I want to obtain a (crude) estimate of the marginal likelihood, just with the samples that I have, and possibly a few other function evaluations (but without rerunning an ad hoc MCMC).  First of all, let's clear the table. We all know that the harmonic estimator is the . Let's move on. If you are doing Gibbs sampling with priors and posteriors in closed form, you can use ; but I am not sure how to generalize outside of those cases. There are also methods that require you to modify the sampling procedure (such as via ), but I am not interested in that here.  The approach I am thinking of consists of approximating the underlying distribution with a parametric (or nonparametric) shape $g(\theta)$, and then figuring out the normalization constant $Z$ as a 1-D optimization problem (i.e., the $Z$ that minimizes some error between $Z g(\theta)$ and $f(\textbf{x}|\theta) f(\theta)$, evaluated on the samples). In the simplest case, suppose that the posterior is roughly multivariate normal, I can fit $g(\theta)$ as a multivariate normal and get something similar to a Laplace approximation (I might want to use a few additional function evaluations to refine the position of the mode). However, I could use as $g(\theta)$ a more flexible family such as a variational mixture of multivariate $t$ distributions.  I appreciate that this method works only if $Z g(\theta)$ is a reasonable approximation to $f(\textbf{x}|\theta) f(\theta)$, but any reason or cautionary tale of why it would be very unwise to do it? Any reading that you would recommend?  The fully nonparametric approach uses some nonparametric family, such as a Gaussian process (GP), to approximate $\log f(\textbf{x}|\theta) + \log f(\theta)$ (or some other nonlinear transformation thereof, such as the square root), and  to implicitly integrate over the underlying target (see  and ). This seems to be an interesting alternative approach, but analogous in spirit (also, note that GPs would be unwieldy in my case).


I have seen the compound words "en dash" and "em dash" sometimes appear with a hyphen ("en-dash") and sometimes without. Are both the hyphenated and the unhyphenated forms correct?

Some compound words are written without hyphens (nonaggression, nonbeliever), some with hyphens (well-intentioned), and others with spaces (post office).  Is there a rule or good guide as to which option should be used?


I know that any subset of V with more than k vectors is always linearly dependent, but how do I include matrix A into the vectors given to prove the statement?   Also, for part (b), does the statement mean that Ax=0 only has the trivial solution since V intersects span{u1, u2, ..., uk}={0}?  Any help would be appreciated! Thank you!

Let $u_1, u_2,... , u_k$ be linearly independent vectors in $\Bbb R^n$.  Let $A$ be an $m × n$ matrix and $V$ the solution space of the homogeneous linear system $Ax = 0$  Prove that if$V \cap \text{Span}\{u_1, u_2,...,u_k\} = \{ 0\} $, then $Au_1, Au_2,...,Au_k$ are linearly independent.  I have an idea that to prove linearly independence of $Au_1, Au_2, ..., Au_k$ I have to show that the equation $c_1Au_1, c_2Au_2, ..., c_kAu_k = 0, c_1, c_2,...,c_k \in \Bbb R$ , only has the trivial solution $c_1=c_2=...=c_k=0$  any help is appreciated!


In the DS9 episode "In the Cards", when Jake wants to acquire a baseball card:     JAKE: I'm Human, I don't have any money.      NOG: It's not my fault that your species decided to abandon currency-based economics in favor of some philosophy of self-enhancement.      JAKE: Hey, watch it. There's nothing wrong with our philosophy. We work to better ourselves and the rest of humanity.   Quark is certainly not going to give free drinks to the Humans just because he is impressed with the moneyless philosophy of the humans. I can understand if he gives free drinks to beautiful Jadzia Dax to attract other male paying customers. Other than her, I expect everyone else has to pay. However, how can they pay if they have no money?

From a variety of sources, including , we know that the Federation (or at least the humans) don't use money. This raises the problem that humans frequently visit worlds where there is currency, and, in the case of DS9, operate a station that has currency frequently in use (for example, Federation personnel frequently attend Quark's bar). Additionally, we see human traders.   My question is, how do humans get "money" (credits, latinum, etc.)? How would a human even get the resources to purchase their own merchant ship or the resources to fill its cargo holds with merchandise? If Federation personnel can simply be given money for the asking, why haven't they poured so much money down Quark's throat that he chokes on it?


I am a Turkish citizen.  For a 4 nights trip, I booked two flights: going to Austria and returning back from from Switzerland, visiting only these two. I have no time to acquire visas of these countries as the trip is just next month.  However, I can obtain a German visa with 'business purposes' easily (likely a multiply entry one). It is possible that I will visit Germany later this year, within the duration of the German visa.  Now, would I get in trouble if I just grab the German visa ASAP and use it first to travel Austria and Switzerland?   I might also stay in Germany for a night if that helps. Or book some hotels to pretend my main destination is Germany, and cancel afterwards. But don't want to get into trouble with later during visa applications.

In case, if I get a multiple-entry Schengen visa in one of the embassies in Ukraine, Kyiv - should my first trip be to the country which issued the visa?  Any there any requirements of this sort? Does this condition vary depending on embassy which issued the visa?  What are the possible consequences on not visiting that country first? Does it somehow depend on country where the embassy is (i.e. non-Schengen and not EU members)?


I have a large number of ECW format raster images and would like to use with GDAL (and ultimately in QGIS) on Mac OSX.  Having seen that there is no official ESRI support for the ECW library on any other platform other than Windows, I managed to get hold of the old version of the libecwj2-3.3 library. There are a few versions knocking around, but none of them will successfully compile.  Anyone had any success compiling the ECW library on OSX (10.6.7) and then compiling GDAL with ECW support.

I bought a imac recently and I tried to install qgis: without success! It is not possible to read the raster files.  I installed GDAL ECW plugin, but it is necessary to copy and paste another file from  ERDAS ECW/JPEG2000 following this instruction.  "VERY IMPORTANT POST-INSTALL  You MUST download and install the ECW SDK yourself. I don't have the means to enforce export restrictions. I'm sorry, but installation is a manual process for now:  Go to . Select "ERDAS ECW/JPEG2000 SDK" from the Product popup. Click on the MacOSX line, then the Download Now link.  Open the downloaded disk image and run the installer. It will install into the top of your boot drive, /Intergraph. Dig into this folder to Desktop_Read-Only/redistributable/libstdc++.  Copy the libNCSEcw.dylib file to:  /Library/Application Support/GDAL/1.11/Libraries  and copy the whole Desktop_Read-Only/etc folder here to:  /Library/Application Support/GDAL/1.11  so it looks like (there may be other files in Libraries and PlugIns for other installed plugins):  Library Application Support GDAL 1.11 etc Libraries libNCSEcw.dylib PlugIns gdal_ECW_JP2ECW.dylib  You can trash the installed Intergraph folder when done to save a few hundred MB of space.  I failed the procedure! Could you help me?


is there any way to open a visual force page from lighting web component. I have already tried this thing, but that is not working for me.  this[NavigationMixin.Navigate]({              type: 'standard__webPage',                 attributes: {                     url: '/apex/Vf page name '                 }         });

The LWC framework includes the NavigationMixin.Navigate functionality that can be used to obtain URLs or perform navigation to generated URLs. This supports a number of different page types, as covered in the . What I can't find is how to create a URL to a specific Visualforce page, with parameters and compatible with communities. Using the "web page" navigation type seems wrong to me, since the URL for a Visualforce page varies based on whether access is direct or within a community. Do you know what the correct approach is for navigating from a flexipage via an LWC component to a Visualforce page in the same org, passing the page some parameters?


When going through with learning Grahams number, I got stuck at   $$3↑↑↑3$$  Working it through, we have  $$3↑3=3^3$$ $$3↑↑3=3^{3^3}=3↑(3↑3)$$  As such, it would appear to me that  $$3↑↑↑3=3^{3^{3^3}}=3↑(3↑(3↑3))=3↑(3↑↑)$$  Which is incorrect; the correct answer being  $$3↑↑↑3=3↑↑(3↑↑3)$$  What I'm wanting to know is where the error in the way I've worked it through, and how working $3↑↑(3↑↑3)$ through backwards to $3↑↑↑3$ would look?

I've done some research, and found this on Wikipedia. \begin{matrix}a\uparrow b=a^{b}=&\underbrace {a\times a\times \dots \times a} \\&b{\mbox{ copies of }}a\end{matrix} \begin{matrix}a\uparrow \uparrow b&={\ ^{b}a}=&\underbrace {a^{a^{{}^{.\,^{.\,^{.\,^{a}}}}}}} &=&\underbrace {a\uparrow (a\uparrow (\dots \uparrow a))} \\&&b{\mbox{ copies of }}a&&b{\mbox{ copies of }}a\end{matrix} I'm still a bit confused on this topic. I've done a lot of research, but I can't seem to understand this. Could somebody explain this in an understandable way? From what I can gather, for example 2↑↑3 would be 2^2^2 = 16? Then 2↑↑↑3 would be 2^2^2^2 = 256? Am I correct, or have I mis-interpreted this?


I need to create a pseudo code that will prompt for time in 24 hours format, convert it to 12-hour format and also whether it is AM or PM. It will have to repeat until sentinel time of 9999 is entered. Below is what I had come out with, is it correct?    Prompt for time Get time Enter this loop:  DOWHILE (time != 9999)   IF (time < 0000 OR time > 2400 OR (time%100 >=60))  Display 'Invalid time'   ELSE  IF (time >= 1200 AND time <= 2400 )      format  = 'pm'     hours = (time/100) - 12     mins = time%100     Display 'The new time is ', hours, '.', mins, format    ELSE     format = 'am'  IF (time/100 = 00 )     hours = (time/100) + 12     mins = time%100     Display 'The time is ', hours, '.', mins, format   ELSE      hours = time/100     mins = time%100     Display ' 'The time is ', hours, '.', mins, format   ENDIF   ENDIF  ENDIF  ENDO

I have a tab delimited file where each record has a timestamp field in 12-hour format:     mm/dd/yyyy hh:mm:ss [AM|PM].   I need to quickly convert these fields to 24-hour time:     mm/dd/yyyy HH:mm:ss.   What would be the best way to do this? I'm running on a Windows platform, but I have access to sed, awk, perl, python, and tcl in addition to the usual Windows tools.


I have been recently taught limits  in calculus but I don't see any real life applications. Are there any? Thanks.

This morning, I read Wikipedia's informal definition of a limit:     Informally, a function f assigns an output $f(x)$ to every input $x$. The   function has a limit $L$ at an input $p$ if $f(x)$ is "close" to $L$ whenever   $x$ is "close" to $p$. In other words, $f(x)$ becomes closer and closer to $L$   as $x$ moves closer and closer to $p$.   To me that sounds like something that might be better described as a 'target'.  If I take a simple function, say one that only multiplies the input by $2$; and if my limit is $10$ at an input $5$: then I've described something that seems to match the elements contained in Wikipedia's definition. I don't believe that that's right. To me it looks like an elementary-algebra problem ($2p = 10$). To make it more calculusy, I could graph the function's output when I use inputs other than $p$, but that really wouldn't give me anything but an illustration of the fact that one's answer moves farther from the right answer as it becomes more wrong (go figure).   So limits are important; what I've just described is trivial. I do not understand them. I know calculus is often used for solving real-world challenges, and that limits are an important element of calculus, so I assume there must be some simple real-world examples of what it is that limits describe.   What is a simple example of a limit in the real world?  Thank you  -Hal.


First, what is the correct way to change the hostname in Linux ? I followed some steps on the internet and sometimes it does not take effect. Besides, the new hostname does not appear when I ping my PC from another one on the same LAN. So how to change the host name and make it appear on the LAN ?

Here are details of the machine I want to access using its hostname:  $ hostname hostname $ cat /etc/hosts 127.0.0.1   localhost 127.0.1.1   hostname.company.local  hostname   It's a default Debian 6 (Squeeze) install, so I didn't fiddle with anything yet.  This is what I get from a machine (running Debian Unstable) trying to access above machine:  $ ping hostname ping: unknown host hostname $ ping hostname.company.local ping: unknown host hostname.company.local $ cat /etc/resolv.conf nameserver 192.168.2.21 nameserver 192.168.2.51 search company.local


Client OS - Window XP  Domain Controller:- Window server 2008 Standard R2  I had one Windows XP system. I want to find out when the system has started or boot ( at what time and date ). I don't know which parameter / word should I search for in Event Log.  For finding out shutdown time, I simply find the word "Shutdown" in Event Log.  Can you guide me which word should I should search for to determine Start up or boot time?

How can I easily see a history of every time my Windows Server has restarted or shutdown and the reason why, including user-initiated, system-initiated, and system crashed?   The Windows Event Log is an obvious answer but what is the complete list of events that I should view?  I found these posts that partially answer my question:    includes several answers that partially address the full restart history  includes an additional event id  includes some of the same event ids   but those don't cover every scenario AFAIK and the info is hard to understand because it is spread across multiple answers.  I have several versions of Windows Server so a solution that works for at least versions 2008, 2008 R2, 2012, and 2012 R2 would be ideal.


Let $f$ be continuous on $[a,b]$ and define $g$ as follows : $g(a) = f(a)$ and, for $a < x \le b$ let $g(x)$ be the maximum value of $f$ in the subinterval $[a,x]$. Show that $g$ is continuous $[a,b]$.    My attempt: Clearly $g(x)$ is monotonically increasing function, so it cannot have discontinuities of the second type, and $g(x+)$, $g(x-)$ exists. So it is enough to show that $g(x+) = g(x-)$, as for a monotonic function $g(x-)\le g(x)\le g(x+)$.  Any hints on how to show that $g(x+) = g(x-)$ ? or maybe there is a different way to approach this problem.

Suppose $f\colon [a, b] \to \Bbb R$ is continuous. Define $F(x):= \sup \{f(y)\mid y \in [a, x]\}$. Prove $F(x)$ is continuous.   What I have so far:  For $x \le b$, the set $\sup\{f(x)\mid y \in [a, x]\} \not= \emptyset$. By Completeness then, $\sup\{f(y)\mid y \in [a, x]\}$ exists and is finite. So by the Intermediate Value Theorem, there exists a $x_0\in [a, x]$ such that $f(x_0) = s_{0_k}$, where $s_{0_k} = \sup\{f(x)\mid y \in [a, x]\}$.  Then choose a sequence $\{s_n\}$ in $[a, x]$ such that $s_n\to s_{0_k}$. Since there exists a sequence in a closed, bounded set that converges to the supremum of that set.  Also then $s_{0_k}\in [a, x]$ by the Comparison Theorem. And since $f$ is continuous, $\lim f(s_n) = s_{0_k}$.   Observe that as $x_n\to b$ as $n \to \infty$ and that $s_{0_k}$ is monotone increasing. Thus each $s_{0_k}\to s_0$ where $s_0=\sup\{f(y)\mid y \in [a, x]\}$. Thus each $s_{0_k}\to s_0$, hence $F(x)$ is continuous at each $s_{0_k} \in [a, b]$.  First off, is this correct? Secondly, It seems to me there is a simple answer, but I can't see it any ideas?


Have troubles with encoding in Webapi answer:   The problem is:     Sk�rzana tapicerka   Have been surfing the internet for 2 days, but even after trying these solutions, there's no result. I read the XML file of web service:   And on the first line there is: <?xml version='1.0' encoding='UTF-8' ?>  (It's strange but this line is visible only in Maxhone (browser))  Encoding of my files - UTF-8 without BOM. Also sent a header: header('Content-Type: text/html; charset="utf-8"'); And even used META: <meta http-equiv="Content-type" content="text/html; charset=UTF-8" />  But nothing helps. Also I tried to guess the encoding by changing it in browser, but no result too. I know, that in Poland the most used encoding is ISO-8859-2. But, I think the API's answer still UTF-8.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I am trying to add a value to a variable using the += function. This is the code I am using:  function getAnswer() {     var num1 = Number(document.getElementById('numone').value);     var num2 = Number(document.getElementById('numtwo').value);     var oper = document.getElementById('oper').value;     var numberOfEquation = 0;     numberOfEquation += 1;     if (oper == '+') {         var p = document.createElement('p');         var txt = document.createTextNode(num1+num2 + ' - Equation ' + numberOfEquation);         p.appendChild(txt);         document.body.appendChild(p);     } else if (oper == '-') {         var p2 = document.createElement('p');         var txt2 = document.createTextNode(num1-num2 + ' - Equation ' + numberOfEquation);         p2.appendChild(txt2);         document.body.appendChild(p2);     }     console.log('You did an equation!'); }   I don't know what went wrong.

What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?


Is it possible to prevent the autocompletion box from showing?    As you can see I am showing a datetime picker, but there is a autocompletion box in the way. Can I prevent it from showing?

How do you disable autocomplete in the major browsers for a specific input (or form field)?


Among all the admissible functions $y = y(x)$, find those that extremise the functional   $$J[y] = \int_0^1 (yy')^2dx$$    subject to the constraint $\int_0^1 y^2 dx =3$ and the boundary conditions $y(0)=1, y(1)=2$.   Am I correct in saying denoting $F=(yy')^2 + \lambda y^2$. Thus the extrema corresponding to this problem are the extrema for the functional, $$J[y] =\int_0^1 F dx$$ and therefore they are solutions of the Euler-Lagrange equation $$\lambda y -y^2y''-(yy')^2=0.$$ Could some clarify whether my Euler-Lagrange equation is correct. I am pretty confused as to where to go from here. Any help would be grand.

Extremise the functional: $$ J[y]=\int_0^1 (yy')^2 dx$$ subject to the constraint  $$ \int_0^1 y^2 dx=3, $$ And the boundary conditions $y(0)=1$ and $y(1)=2$.


i am attempting to upgrade from 10.04 lts to 12.04.4 . The download appears in download window,i would like direction on what to do next to finish the download / upgrade.

What are the different ways I can use to upgrade Ubuntu from one release to another?


Can any one give a hint to prove that, there are infinitely many irreducibles in $F_q[T]$, function field.

Are there infinitely many irreducibles in the ring of integers of any algebraic number field ?  I tried to follow the same argument as we usually do for integers. Suppose there are finitely many irreducibles, say $p_1,\ldots ,p_n$ and let $\alpha :=1+ p_1\cdots p_n$. Now if $\alpha $ is not a unit then it must have an irreducible $p$ such that $p|\alpha$ but then $p$ can not be any of the $p_i$'s and we have a contradiction. $\textit{What if $\alpha$ is an unit ? Is it possible for $\alpha$ to be an unit ?}$   Of course, one can replace $p_1\cdots p_n$ by $p_1^{k_1}\cdots p_n^{k_n}$ for any $k_1,\ldots ,k_n\in\mathbb{N}$ and the same argument would go through.


I have to write a post for my college website and it is the format of a "listicle". An introduction followed by short paragraphs with each paragraph getting a heading. My question is regarding these headings and the article title.  I am doing research on the listicle format and I see most have titles where every word is in the capital case. Even are headlines through the articles are given the same treatment.  For example,   20 Crushes Who Made Your Heart Soar In 2018 Who Said It: Harry, Ron, Or Hermione? Choose Your Dream Wedding And We'll Reveal How You'll Meet Your Soulmate Eat A Ton Of Food At A Buffet And We'll Tell You Which Disney Channel Star You Actually Are   Why is this done and more importantly is this correct?

Are there any concrete rules that say which words (parts of speech) in a title should start with a capital letter? What would be a correct capitalization for the title of this question?


I am living in London for a few months. I have been living in London for a few months.   What is the difference?  Is number one a common error?

I have studied "present perfect" and "present perfect continuous" for a week. I know forms, verb and helping verb I should use when I write them.  For me, they have nearly same definition because I can use them interchangeably in Thai language. (My native language)  For example, the sentences        I have learned English language in the past few weeks.    I have been learning English language in the past few weeks.       have no difference in meaning to me. They both mean "I began learning the English language in the past and I am still learning it"  Can I use them interchangeably in English? Or is there any difference between them? For example, when should I use present perfect but not present perfect continuous?


Weather is always unpredictable and there can easily be a situation where its last day of visa and transport is shut due to bad weather.  In such a scenario, you will not able to leave the country and in worst case you might struggle to reach airport which may lead to overstaying.  Is this illegal and can it impact future visa process?  P.S: Main focus of my query is Schengen visa but yes any general applicable rule would also help

I am a student going to Germany on guest Scientist visa. In the application form I had to fill date of departure and arrival and they have given me visa for exact dates as mentioned on my invitation letter and flight tickets booked by the research lab. Hypothetically, if my flight gets canceled on that day, will I end up violating visa duration?  EDIT: My current visa duration is only 78 days


I have a question concerning pre and post increments with logical operators if I have this code   void main() {int i = - 3 , j = 2 , k = 0 , m ; m=++i||++j&&++k; printf("%d %d %d %d",i,j,k,m);}   knowing that the increment and the decrement operators have higher precedence than && and ||  So they'll be executed first Then the && is higher than means -2||3&&1 which gives the values -2 3 1 1 for the printf    but the output I get when trying on VS2010 is -2 2 0 1   Does anyone have any explanation for that ?  Regards,,

Does the ANSI standard mandate the logical operators to be short-circuited, in either C or C++?  I'm confused for I recall the K&R book saying your code shouldn't depend on these operations being short circuited, for they may not. Could someone please point out where in the standard it's said logic ops are always short-circuited? I'm mostly interested on C++, an answer also for C would be great.  I also remember reading (can't remember where) that evaluation order isn't strictly defined, so your code shouldn't depend or assume functions within an expression would be executed in a specific order: by the end of a statement all referenced functions will have been called, but the compiler has freedom in selecting the most efficient order.  Does the standard indicate the evaluation order of this expression?  if( functionA() && functionB() && functionC() ) cout<<"Hello world";


I have noticed that TeX Live 2017 has been released. But I am using 2016 version. Is there any way to upgrade 2016 to 2017 without installing fully 2017 version?

I have texlive 2016 installed on my windows OS, to use texlive 2017 you need to download it (over then 2.5GO), I think this is a tedious operation every time you  want to pass from an old texlive to a recent one.  My question is is there a posibility just to upgrade texlive 2016 to texlive 2017without removing, downloading, and installinig  the entire texlive?


I have a   HashMap<String,Integer> wordMap = new HashMap<String,Integer>();   I need to print the elements in such a way that they are in decreasing order of Integer values and the if two strings have same Integer values, they must be displayed in alphabetical order. i.e If   HashMap={(it,2),(worst,1),(the,2),(of,2)}  , The output should be::   it-2 of-2 the-2 worst-1

I am relatively new to Java, and often find that I need to sort a Map<Key, Value> on the values.  Since the values are not unique, I find myself converting the keySet into an array, and sorting that array through array sort with a custom comparator that sorts on the value associated with the key.  Is there an easier way?


I have a laptop with 2.50 GB of Ram and the CPU being clocked @ 1.46/1.47 GHz running Windows 7. I wanted to install Ubuntu 18.04 on it. Will it be okay to do it?

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


I know when you normally unlock weapon slots as answered in , but mine's a little different. I have a few characters that have already beaten the entire game, or almost the entire game (right before the end of the final mission). If I create a new character, is there any way to unlock all his weapon slots without playing through to the point at which he gets all four weapon slots?  I ask this because I have a character that I've done this for, but I'm not positive how. It might have been because I was farming the Warrior and this character finished that mission, but I'm not sure.  edit: Character A has finished the game on Normal and TVHM, and is on the very last mission right before calling the moonshot on UVHM. Character B is a newly created character. I started the game in UVHM with Character A, brought in Character B to call the moonshot, then saved on Character B. I think that's why all the weapon slots are unlocked on Character B, but I'm not positive.

I would like to play with the same level and questlines as my friend's characters, which are mostly Level 30+ and in True Vault Hunter Mode, but some of my characters that I'd like to play are in a low level and are not yet in True Vault Hunter Mode. I would also like to have all weapon slots unlocked.     I'd rather not play through the game again to be near the same level as them.  I've checked out  but I am unsure on what fields to edit or toggle to make my characters be like what I described.


It is broadly accepted that developers should test updates through a staging site before releasing them to the live server, however once the development updates require modifications in Wordpress DB, things get complicated, as users in the live site will update the DB too.  The only (muddled) flow I can imagine is the following:   Test on a local server (WAMP, XAMP, etc) Once ready to deploy, put the live site in maintenance mode Backup live site (Duplicator, sqldump, etc) Create a clone of locked live site to the staging site Upload modifications from local environment to the staging site Test the staging site Push the staging site to live. Remove maintenance mode   Drawbacks of the flow above:   downtimes may be longer than expected for users while the developer is carefully testing updates in the staging site; may require manual management of modifications: for instance, siteorigin pagebuilder layouts are stored in the db, so once a layout is modified, it must be imported manually in the staging site; in this case it could be adequate to simply drop & import pages into the staging site, and if working, importing them in the live site    I wonder if is there a better and more automated way to achieve this.  What do you think?  EDIT, as requested, some solutions have been proposed in the past but none offers a definitive solution:   9/2010 -  12/2011 -  9/2014 -  1/2015 -

I have a problem with WordPress database synchronization between development and production and I am wondering how other people solving it. I am aware about  but it doesn't really cover the nastier and more realistic use case.  Say I have a live WordPress website. I took a dump of everything, replicating it on our dev environment. I started making changes. 1 week later I am ready to deploy my updates. In the meantime, database on production site has changed(new posts, new comments, etc.). How do I synchronize changes between production and development during the rollout and is it possible to automate(somewhat at least) this process?


I'm using the  as the default font family in my document. I would prefer to use the italics of this font family as the default math mode text for equations and inline maths, i.e. the font accessed by using \textit{x y z a b c} for example.  Does anyone know how I can set the math mode font to be the default italics mode of the Baskervaldaf font package?    Specifically I want the result where using, $ a b c x y z$, or \begin{equation} gives the font style

thanks for your help in advance. I was wondering how to use the mainfont type for some features in the math environment. For example, let's say I'm using "font A" which I've uploaded using some otf file for the text and for math environment I'm using default LaTeX math font. While font A doesn't have greek letters, I'd still like to use it for the math environment when feasible (for example, letters of the alphabet and words like "max," "lim," etc.) How can I get my math environment to use font A for this but default math environment for the items that aren't accounted for in font A?  (Disclaimer: I know people will say you shouldn't mess with fonts/math environments like this, and I generally agree, but choosing not to do something and not being able to do it are separate things--and I'd still like to know how!)


I have a really good book (.pdf) that i would like to take some code from there. I know that book was written with LaTeX, so my question is if there are any kind of way to take that .pdf and reconvert to .tex file?  Thanks in advance.

I know that hardly any information is passed to the PDF when a .tex file is compiled.  But is there a tool that can convert a PDF document back to (La)TeX?


Let $f_n:[0,1]\rightarrow \mathbb{R}$ be continuous functions such that:   $|f'_n(x)|\leq \frac{1}{\sqrt x}$ and $\int_0^1f_n(x)dx =0$ for every $n\in N$. Prove that exists a subsequence of $(f_n)$ which converges uniformly.   I know that I must apply Arzelá-Ascoli theorem. The problem then comes to show that the sequence $(f_n)$ is uniformly bounded and that it is equicontinuous.   What I have noted/done so far:  Since $|f'_n(x)|\leq \frac{1}{\sqrt x}$, if $x,y\in [0,1],x\neq y$, then  $$|f_n(y)-f_n(x)|=|\int_x^yf'_n(t)dt |\leq\int_x^y|f'_n(t)|dt\leq\int_x^y\frac{1}{\sqrt t}dt\leq\int_0^1\frac{1}{\sqrt t}dt = K$$  but I can't use this to solve the problem. Any help? Thanks in advance

Let $f_n$: $[0,1]\to\mathbb{R}$ be differentiable satisfying both:  $$\begin{align} (1)& \int_0^1f_n(x)dx=0,\quad \forall n\in\mathbb{N},\\ (2)& |f'_n(x)|\le \frac{1}{\sqrt{x}},\quad\forall x\in(0,1]. \end{align}$$  Prove that $f_n$ has a uniformly convergent subsequence on $[0,1]$.  I want to apply Arzela-Ascoli Theorem, so I try to show that $f_n$ is uniformly bounded and equicontinuous. But I only get that $f_n$ is pointwise bounded. And I have no idea how to use the first condition.


In the Windows 10 edition, I'm trying to create a capture the flag (banner) map which detects if the flag has been dropped and replaces it back at that team's base but I can't manage to set up the command. So far I have tried: /testfor @e[type=Item] {Item:{id:minecraft:banner}}  to receive: Syntax Error: unexpected "{" at "ype=Item] >>{<<Item{in:m"  I know some commands are slightly different between Bedrock and Java, so I could have the wrong syntax. Also, it would be great if it could detect the colour as well. Please, could someone enlighten me? Note: It is not the same as the question:  because I want to test for a block, not setting it so you are only able to place it on specific blocks. It is also not a duplicate of  as this question was written first, therefore they have asked a duplicate of my answer!

This question was recently split into different questions for each workaround. See   meta posts for more information.   Can you use NBT tags in commands? I’ve tried commands that normally work in Java Edition like: give @s minecraft:planks 30 1 {display:{Lore:["Wooden planks"]}} give @s stone_pickaxe{Unbreakable:1b} give @s item_frame{EntityTag:{Invisible:1b}} summon villager ~ ~ ~ {Offers:{Recipes:[{buy:{id:"emerald",Count:5b},sell:{id:"diamond_sword"}}]}} summon tnt ~ ~ ~ {Fuse:20s}


Recently, while answering a Server Fault question, I stumbled upon a copied Server Fault question and answer at what looks like a content aggregation or text scraping site.    Here's the original thread:  Here's the copied site: http://www.answerspice.com/c118/1787456/spf-include-too-many-ip-addresses   To be fair, the "copied" site gives attribution to all of its scraped content. However, this brought up an interesting topic in my mind which led to three questions:   Is there even an offense if a site scrapes trilogy content or are we all just one big GPL family? If this is an offense, does attribution (such as what AnswerSpice does) lessen the offense in cases like this?  What is the proper thing to do if a site is found to be scraping content from one of the trilogy sites in a way that is not allowed?

of Stack Overflow, all content posted on Stack Exchange sites by their users (i.e. you wonderful people) has been provided to the whole universe under . For my fellow non-lawyers, that license basically means:   Anyone can use any Stack Exchange posts at any time without having to ask for permission Making money off of the copied content is permitted You don't even have to copy stuff from here verbatim; you can just use it as a starting point and make whatever edits you want There are just two rules you have to follow:   You have to provide . Simple links to the original post and author info are just fine. You have to  and allow other people to use your content, as long as they follow these very same rules. How meta!    (If you ever forget any of that, and want to refresh your memory, the license info is linked to in the footer of every page.)  There are, in fact, a lot of people who republish varying amounts of our content for assorted reasons. Unfortunately, there are some Stack Content Republishers Attributing Poorly and/or Excelling at Ranking (SCRAPERs, for short).  In this context, "attributing poorly" means any use that doesn't follow our attribution rules or make any other reasonable attempt at give credit. This can get pretty egregious; I've seen SCRAPERs that not only don't link back to SE originals, but also use fake author info and post dates to make it harder to find originals. By "excelling at ranking," I'm referring to copycat sites that end up higher in Google results than the original SE sites do for the same content. That's not necessarily wrong, but in some cases, it indicates inappropriate SEO hackery.  So, the question is: what can you do if you spot a SCRAPER?


I am issuing the following rsync command (obfuscating the exact path & host), which should copy two binaries:  rsync -e "ssh -p 443" -a --info=progress2 -z user@remote:/srv/cgi-bin/ . user@remotes's password:    5,970,149 100%    6.78MB/s    0:00:00 (xfr#2, to-chk=0/3)   From every standpoint I can tell, the command completed successfully.  root@rapunzel:/s/h/p/cgi-bin # >>> ll total 5.7M -rwxrwxr-x 1 marcus marcus 3.9M Sep 10  2014 german-numbers -rwxrwxr-x 1 marcus marcus 1.9M Sep 10  2014 german-numbers-cgi   But when I attempt to run any of the binaries, I get the following error  root@rapunzel:/s/h/p/cgi-bin # >>> ./german-numbers zsh: no such file or directory: ./german-numbers   So it seems that the binary is not "quite there", but on the other hand I can clearly open and read it:  root@rapunzel:/s/h/p/cgi-bin # >>> head -n1 ./german-numbers ELF04��'4('$444444�=%�=%@%����t��I%������HHHDDP�tdT;%T�T�llQ�td/lib/ld-linux.so.2GNUGNU,B�]2�h$���ɢҒ�S'��� @�P                                                                                ����ݣkĉ����|(�CE���K��8��]���?�������g���FcH▒3        �_��,�%}�??��>fM7�sn�������F����A{S3a��������,b��)�P▒h�wza�S~�y��*-��y�L                                                                                �����m���<�lp�6����W$%xZ�G��X{��V���� �!� �!�t����@��ԅ����I��ԅ��� ��Ș               ��librt.so.1__gmon_start___Jv_RegisterClasseslibutil.so.1libdl.so.2libgmp.so.3__gmpz_tdiv_qr__gmpz_and__gmpz_tdiv_q__gmpz_tdiv_r__gmpz_fdiv_qr__gmpn_gcd_1__gmpz_fdiv_q__gmpz_fdiv_r__gmpz_ior__gmpz_mul_2exp__gmp_set_memory_functions_fini__gmpz_sub__gmpz_xor__gmpz_com__gmpz_gcd__gmpz_fdiv_q_2exp__gmpz_init__gmpz_mul__gmpz_divexact__gmpn_cmp__gmpz_addclock_gettimetimer_deletetimer_settimetimer_createdlopendlerrordlsymlibm.so.6modfldexplibc.so.6_IO_stdin_usedepoll_createfflushstrcpysprintfsetlocalefopenstrncmpftruncatestrrchrregexecpipeftruncate64mmap64siginterruptepoll_waitftellstrncpyforksigprocmaskregfreeunlinkpthread_mutex_lockselectmkdirreallocabortgetpidkillstrdupmkstempstrtodstrtolisattysetmntentmmapctime_rfeoffgetscallocstrlensigemptysetmemset__errno_locationtcsetattrfseekgetpagesizeeventfddup2pause__fxstat64sigaddsetpthread_mutex_unlockstdoutfputcgetrusagefputsregerrormemcpyfclosemprotectmallocraisegetgid__lxstat64nl_langinfohasmntopt__xstat64getenv__ctype_b_locregcompstderrsigdelsetmunmapgetuidgetegid__sysv_signalpthread_mutex_initfwritefreadgettimeofdayiconv_closesigactionepoll_ctlstatfsgeteuidlseek64strchrendmntentutimegetlineiconviconv_opentcgetattrbsearchfcntlgetmntent_rmemmovefopen64access_IO_getcstrcmpstrerror__libc_start_mainvfprintfsysconf__environ__cxa_atexit_edata__bss_start_endGLIBC_2.1GLIBC_2.0GLIBC_2.2GLIBC_2.3GLIBC_2.7GLIBC_2.3.4GLIBC_2.3.2GLIBC_2.1.3   I am out of ideas why zsh (and for the record: bash aswell) wont find that file, does anybody have an idea?

I have currently a strange problem on debian (wheezy/amd64).  I have created a chroot to install a server (i can't give any more detail about it, sorry). Let's call its path /chr_path/. To make things easy, I have initialized this chroot with a debootstrap (also wheezy/amd64).  All seemed to work well inside the chroot but when I started the installer script of my server I got : zsh: Not found /some_path/perl (the installer includes a perl binary for some reasons)  Naturally, I checked the /some_path/ location and I found the "perl" binary. file in chroot environment returns :  /some_path/perl ELF 32-bit LSB executable, Intel 80386, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.2.5, not stripped   The file exists, seems ok, has correct rights. I can use file, ls, vim on it but as soon as I try to execute it - ./perl for example - I get : zsh: Not found ./perl.  This situation is quite understandable for me. Moreover :   I can execute other basic binaries (/bin/ls,...) in the chroot without getting errors I have the same problems for other binaries that came with the project When I try to execute the binary from the main root (/chr_path/some_path/perl), it works. I have tried to put one of the binaries with a copy of my ls. I checked that the access rights were the same but this didn't change anything (one was working, and the other wasn't)


I'm using the following regular expression to validate email addresses:      ([_A-Za-z0-9-+]+(.[_A-Za-z0-9-]+)*@[A-Za-z0-9-]+(.[A-Za-z0-9]+)*(.[A-Za-z]{2,})$)   but I am getting Catastrophic Backtracking in Regular Expression when the string is:     abc@damkovnai.un;efg@damkovnai.un;hij.kumar@damkovnai.un;klm.verma@damkovnai.un;   When I remove the last semicolon, the result is true, but when the semicolon exist in last position in the string then the output is Catastrophic Backtracking, even though I want the result to be false.

I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps.  It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps?


I'm new to Git and using GIT Desktop to pull and push code. I got this error while I was pulling code from the repository. I got this error how can I resolve it

I want to resolve merge conflicts in my Git repository. How to do that ?


Suppose you have a webpage requires you to input your username and password for authentication.   The username name "abs" and the password is "1234abcd" - you gain entry to the your profile.   But my question is, why is that if I input "abs' --" in the username field and no password, it still returns my profile page?   What is happening behind the scenes with the server, SQL and user?  I just cant seem to understand this. Thanks guys for any help.

Just looking at:   (Source: )  What does this SQL do:  Robert'); DROP TABLE STUDENTS; --   I know both ' and -- are for comments, but doesn't the word DROP get commented as well since it is part of the same line?


I'm running tests for my board class in a game I am making, and continue getting a nullpointerexception when I try to search for an object in my array.   public class Board extends java.util.Observable{  //10x10 array that holds the tokens private Token board[][];  /**  * Constructs board   */ public Board(){     board = new Token[10][10]; }  /**  * Adds token to the board at the location that the token is  * @param token     token to be added  */ public void addToken(Token token){     Location loc = token.getLocation();     board[loc.getX()][loc.getY()] = token;      //notifies view that it needs to redraw the board     notifyObservers(); }  /**  * move token that is already on the board  */ public void moveToken(Token token){     //checks if the piece is in the board     boolean moved = false;      //finds piece     for(int i = 0; i < board.length; i++){         for(int j = 0; j<board[i].length; j++){             if(board[i][j].equals(token)){  //THIS IS THE LINE THAT CAUSES THE ERROR                 board[i][j] = null;                 moved = true;             }         }     }     //if piece is not on board, throw error     if(!moved) throw new GameError("Attempted to move token that is not on the Board");      //add the token in its new location     addToken(token); }   The exception is caused in the moveToken method, which I call in the following test.      @Test  public void testAddToken(){     Board b = new Board();     Token[][] board = b.getBoard();     Token t = new Token('a', "a....", true);     t.setLocation(new Location(4,4));     b.addToken(t);     board = b.getBoard();     assertEquals(board[4][4],t);     t.setLocation(new Location(2,1));     b.moveToken(t); //THIS IS WHEN THE ERROR IS CAUSED     assertEquals(board[2][1],t); }   I added some System.out.print tests to check when exactly the error is caused, and it happens on the very first loop, when both i & j are zero.   Thank you in advance for any help!

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?


For the launch of the Halo Master Chief Collection, I have ordered a new Xbox One.    I won't be home until late evening, and so I'd like to be able to start playing the single player campaign as soon as possible (At this point I don't care about saving progress, I just want to have a look).   Will I be able to unpack my Xbox One, put the disc in and be ready to play without connecting to Xbox Live for updates? Or will I be required to connect to the internet, sign in to my existing xbox live account, download dashboard updates, game updates etc. before I am able to play?

My friend does not have the internet. They will not have the internet under any circumstances, but they want to buy a new console now that the Xbox 360 is obsolete. We have both heard that both the PS4 and Xbox One REQUIRE connection to work at all by downloading some patch first.  That isn't an option for me (and no they wont bring it here I already asked and they refused with the words "I don't go near the net ever except if forced to at work").  Will either console just work out of the box?  Whichever she gets isn't ever going to be updated unless the discs of games do so. Its never going to be online, she isnt interested in online gaming at all, doesn't have an internet, or even email.  She won't even have a smartphone or MP3 player.


This is a working pendrive. I can write on the main partition, delete from it. Everything possible can be done. Just can't format it. Formatting tools on OS other than Mac show format complete but nothing happens to the pendrive. MacOS show error which is given below.  I really need help. Even if you are not sure of the solution, please suggest something. I really need it.  I formatted a pendrive in macOS using disk utility (GUID, macOS extended journaled).   Then I copied macOS setup for hackintosh. Then I used clover(software to make macOS pendrive bootable) to mount the efi partition. It created a 200MB efi partition. Later I needed to format the drive to use it. On windows, disk management doesn't show the option to delete the efi partition. It shows option to delete the larger partition but even after clicking delete nothing happens. I read many articles on internet. I used diskpart as administrator and selected my disk and used clean command. It showed disk cleaned successfully but it lied. The disk is the same. With efi partition and the data on the main partition also there. I first tried macOS disk utility to erase the disk but it says failed to erase the disk. Under details, it says this operation requires partition unmounted -69830. I booted into my linux, used terminal df to list disks. Then unmounted the pendrive using umount. Then formatted using mkfs. All commands are sudo. Terminal showed cleaning disk, creating partition table etc. After it was over, I see again that the disk is unaffected. It's new pendrive. Worked fine. No problems with pendrive whatsoever.   I also tried third party softwares but they all do what diskpart in Windows and terminal in Linux did which is => showed formatting completed but actually nothing happened to the pendrive. Please help me format it.

When I plug in my USB flash drive, it shows up on my computer as write-protected or read-only. I am unable to transfer data to it, nor can I modify or delete any files already stored on it. I also cannot repartition or reformat the drive using Windows Disk Management, DiskPart, GParted, or other tools. The drive does not have a write-protect switch.  Why did this happen and what can I do about it? Is there a way to remove the write protection?  (Note that this can happen with some memory cards, too, as they often use controllers similar to those used in flash drives. In some cases, the system may report that the drive or card was formatted successfully even though it was never actually formatted; the original data reappears when the device is reinserted.)     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.


In wordpress gallery(through add media) when i create a gallery it default shows the thumbnail size image.   Instead of it i want to set to show the medium size image by default.  It is not good and takes lot of time to edit the old post for the tag manually: [gallery size="medium"]  So i want to show the medium size by default. It can be through functions.php

when I create a gallery I get this code generated yet I can;t find out how  <img width="150" height="150" src="http://localhost/wp2/wp-content/uploads/2012/06/28_0120-150x150.jpg" class="attachment-thumbnail" alt="_28_0120" title="_28_0120">   What function generates the thumbnail URL and how does the thumbnail image generated and cropped to the size of 150-150?  I forgot to mention: for the gallery page I use get_children, so this is what I need to work with


Is it possible to import a class in Java which is in the default package?  If so, what is the syntax?  For example, if you have  package foo.bar;  public class SomeClass {     // ...   in one file, you can write  package baz.fonz;  import foo.bar.SomeClass;  public class AnotherClass {     SomeClass sc = new SomeClass();     // ...   in another file.  But what if SomeClass.java does not contain a package declaration?  How would you refer to SomeClass in AnotherClass?

I'm working now together with others in a grails project. I have to write some Java-classes. But I need access to an searchable object created with groovy. It seems, that this object has to be placed in the default-package.   My question is: Is there a way to access this object in the default-package from a Java-class in a named package?


I am trying to find a story about a freelance guy in the tech industry of San Francisco who shares a cigarette with a friend of his, wakes up really sick, and transforms into physical perfection (I think his friend worked for the government).   A few random memories; while changing the man has to eat three cheeseburgers a day, wakes up really sick, and somewhere there's the phrase about his stomach being "tight as a drum." I read it about 5 years ago, possibly on Salon.com. And help would be greatly appreciated!

Not sure about more specifics, patient might have been voluntary or forced, but he hides a keyboard to connect into himself when alone and hacks himself to enable escape.  Implant control autonomous systems, and control metabolism, make himself stronger, etc.  Ends up escaping and never recovered by the facility later, using his implant for his own benefit.  The patient might have been overweight computer geek at the start, but the implant help him lose the fat and get into super physical shape.


I've seen a lot of people in this situation, but every time the variables differ and so does the solution for it.  I think I have everything installed correctly. I have Nvidia GeForce 540M with Bumblebee drivers installed.  What happens is, every two times when Ubuntu starts it tells me it is running in low-end graphics mode. I say OK and it crashes at the next window. I just restart and it starts normally.  I've made:  lspci -nn | grep '\[030[02]\]:   and the answer was:  00:02.0 VGA compatible controller [0300]: Intel Corporation 2nd Generation Core Processor Family Integrated Graphics Controller [8086:0116] (rev 09) 01:00.0 3D controller [0302]: NVIDIA Corporation GF108 [GeForce GT 540M] [10de:0df4] (rev ff)

Note: This is an attempt to create a canonical question that covers all instances of "low-graphics mode" error that occurs to a user, including but not limited to installation of wrong drivers, incorrect or invalid lightdm greeters, low disk space, incorrect installation of graphics card like ATI and Nvidia, incorrect configuration of xorg.conf file while setting up multiple monitors among others. If you are experiencing the "low-graphics mode" error when trying to login but none of the following answers work for you, please do ask a new question and then update the answers of this canonical question as and when your new question gets answered.   When I try to boot into my computer, I am getting this error:  The system is running in low-graphics mode Your screen, graphics cards, and input device settings could not be detected correctly. You will need to configure these yourself.   How do I fix the failsafe X mode and login into my computer?  Answer index:


When $n = p^k$, where p is prime and k is a positive integer if $x^2  ≡ x$ (mod $p^k$), then $p^k$ divides $x^2-x = x(x-1)$, since $x$ and $x-1$ are coprime, $p^k$ divides either $x$ or $x-1$, so $x ≡ 0$ (mod $p^k$) or $x ≡ 1$ (mod $p^k$). When n is not in the form of $p^k$, on checking of counterexamples, $4^2  ≡ 4$ (mod $6$), where $4$ is not congruent to $0,1$ modulo $6$ and $6$ is a product of distinct primes. Please suggest the general approach to prove that there exists solution other than $x ≡ 0,1$ (mod $n$) for this case.

I need the idempotent elements of $Z_{900}$ $2^2\cdot 3^2\cdot 5^2=900$ Of course there's $$0 \pmod 4 \\ 0 \pmod 9 \\ 0 \pmod {25} \\ $$ and $$ 1 \pmod 4 \\ 1 \pmod 9 \\ 1 \pmod {25} \\ $$ I found the answers by making a C++ program to test all numbers, but I don't know how to quick solve on paper. This is the output of the program $(0, 0, 0) \rightarrow 0 \\ (1, 1, 1) \rightarrow 1 \\ (0, 0, 1) \rightarrow 576 \\ (0, 1, 0) \rightarrow 100 \\ (1, 0, 0) \rightarrow 225 \\ (1, 1, 0) \rightarrow 325 \\ (0, 1, 1) \rightarrow 676 \\ (1, 0, 1) \rightarrow 801 \\$


For a few weeks I have been seeing these strange white borders around some windows:    Here a browser window is in the front and the weird frame is not there.    What could be the cause and how can I fix it?

NB: Nvidia has released an official fix; please see ,  and/or .  Upon waking up Ubuntu 16.04 from Suspend, the following graphical glitches appear around all windows, context menus, and similar:      This is currently known to affect the following NVIDIA cards running the proprietary drivers:  NVIDIA GeForce 610M, driver version 375.39, 340.102 NVIDIA GT 630M, driver version 375.39 NVIDIA GTX 650, driver version 375.39 NVIDIA GT 740M, driver version 378.13 NVIDIA GTX 745, unknown driver version NVIDIA GTX 850M, driver version 375.39, 378.13 NVIDIA GT 940M, driver version 375.39 NVIDIA GTX 950M, unknown driver version NVIDIA GTX 960M, driver version 378.13 NVIDIA GTX 970, driver version 375.39 NVIDIA GTX 970M, driver version 375.39 NVIDIA GTX 980 TI, unknown driver version NVIDIA GTX 1060, driver version 375.26, 375.39, 378.09 NVIDIA GTX 1070, driver version 378.09  The above above list has been sourced from reports from other users here on AU,  thread, and  thread. NB: This is be no means an exclusive list. It probably effects nearly all Nvidia cards.  Furthermore, this issue has been replicated on a clean install where the only change was a software update and the installation of the latest NVIDIA drivers.  What is going on, and how can it be resolved?


I have tried this:  sudo add-apt-repository ppa:atareao/telegram sudo apt-get update sudo apt-get install telegram   But no gain it provides an older version of Telegram. So I thought to ask a new question on how to install the latest version of Telegram in Ubuntu 16.04

After installing Telegram Desktop on Ubuntu 16.04 by these commands:  sudo add-apt-repository ppa:atareao/telegram sudo apt-get update sudo apt-get install telegram   I get this error:  $ telegram telegram: Panic - Unable to find your tty (pts/2) in /var/run/utmp


Since my Asus VivoBook keyboard shortcut to change de keyboard lightning level is not working, I made a bash script and configured it to be activated when I press a combination of keys. This is my script:  level=$(cat /sys/class/leds/asus\:\:kbd_backlight/brightness)  [[ $level = 3 ]] && echo 0 | sudo tee /sys/class/leds/asus\:\:kbd_backlight/brightness || echo $(($level+1)) | sudo tee /sys/class/leds/asus\:\:kbd_backlight/brightness   The script is working when I run it on terminal, but when I press the keys, it doesn't, I think because of the sudo permission that requires a password. Is there any way I can change the script permissions so that when I run it in the background it doesn't request for the password?

Inspired by this ....  I am the sole person using my system with 12.04. Every time I issue a sudo command; the system asks for the user password (which is good in its own way).  However I was thinking; without activating the root account; how can I execute the sudo commands which will not ask for user password to authenticate.  NOTE: I want to execute sudo command without authenticating via password; only when they are executed via terminal. I don't want to remove this extra layer of security from other functions such a while using 'Ubuntu software center' or executing a bash script by drag-drop something.sh file to the terminal.


If I have one array for example [1 4 3 7 4 9 5 1 5 6 3].   How to delete repetitive numbers and give in the output array like this [1 4 3 7 9 5 6]?

I have been working with a string[] array in C# that gets returned from a function call. I could possibly cast to a Generic collection, but I was wondering if there was a better way to do it, possibly by using a temp array.  What is the best way to remove duplicates from a C# array?


All i did was hit cntrl+b... Please help!

In the 3d viewport I am using a border region to only render things inside the selected region. I did this with CtrlB. I cannot get rid of the region. How can I make the border disappear?


I often find that the headers section of a file get larger and larger all the time but it never gets smaller. Throughout the life of a source file classes may have moved and been refactored and it's very possible that there are quite a few #includes that don't need to be there and anymore. Leaving them there only prolong the compile time and adds unnecessary compilation dependencies. Trying to figure out which are still needed can be quite tedious.  Is there some kind of tool that can detect superfluous #include directives and suggest which ones I can safely remove? Does lint do this maybe?

I am working on a large C++ project in Visual Studio 2008, and there are a lot of files with unnecessary #include directives. Sometimes the #includes are just artifacts and everything will compile fine with them removed, and in other cases classes could be forward declared and the #include could be moved to the .cpp file.  Are there any good tools for detecting both of these cases?


I am running Ubuntu 14.10 on a Lenovo T540 laptop.  In addition to information about how to update and maintain the drivers for this laptop I would like general information about how to update this laptop's drivers on any version of Ubuntu (if it differs). Perhaps there's a repo for this? I didn't see anything like this after a few Google searches, and  command doesn't display anything when I run it and I'm still having issues.  It would be helpful to get any information on how to generally go about updating any computer's driver running Ubuntu.  Finally, it would be helpful to get information about generally how to go about updating any computer's drivers running any distro of Linux.  Also, I appreciate stability and reliability would it be better to run 14.04 LTS for these purposes?  These questions: Newb and all that.

Is there a package of Ubuntu drivers as driver pack solution? I tried to search for it, but I did not find it. If there is, how can I easily get it?


I have a server running with Ubuntu 12.10. But now I am unable to update because I need to install update-manager-core which is not possible because my version is no longer supported.  Is there a way to upgrade my server to a newer, supported version or should I let it running as it is (only web- and fileserver).

What are the different ways I can use to upgrade Ubuntu from one release to another?


Is there any substance in the brains of Vulcans that makes them feel less feelings?

I've seen a few Vulcans lose control of their emotions in various Star Trek media. Primarily Spock, who is in fact half-Vulcan.  I was under the impression that the ability to control emotions was down to training and ritual. Is it also linked to genetics?


I have many Winform(VB.Net) apps with a Local/Dev/QA/Prod environment setup. I would like to dynamically load environmental config information and access it as if it was in the app.config file using System.Configuration. I haven't found a good solution for this yet. Maybe I'm expecting too much and will have to manually deserialize the environmental config. I'm looking for ideas on how to implement this environmental config?  Here's a list of what I'd like:   The environmental config is a file on the file system containing an XML structure(similar to the app.config). Dynamically load environmental config based on environment. Environmental config can contain connection strings and other settings. Multiple additional config files is acceptable. Use the built in System.Configuration calls to access the values. Basically I would like to avoid having to write a custom deserializer.   I would prefer not to use these options if possible:   Using a configsource parameter in the app.config to point to an external config. This would need to be edited for each environment and it would override(I think) the section where it's set. Using a custom deserializer. I know this could be done and it may be the actual solution. It just seems that this should be solvable without doing this. Using System.Environment isn't practical since it reads/writes to the registry for system variables.

I know I can open config files that are related to an assembly with the static ConfigurationManager.OpenExe(exePath) method but I just want to open a config that is not related to an assembly. Just a standard .NET config file.


I have a local coordinate system built with Ubisense sensors and tags (it is a real-time locating system used to automatically identify and track the location of objects or people). The local coordinate system is simply a cartesian coordinate system, which I can define the origin and axies at will except the rule that x-y panel must be horizontal, thus the z axis is vertical. After setting up the system, I can get coordinates of tags in the contained area where the sensors can get signals emitted from the tags and locate the tags. Now, I have the problem to convert the (x,y,z) coordinates into global system coordinates.  I made a model myself which took the origin of local coordinate system as a reference point and calculate the difference of other points in lat and lon to make the transformation. However, I guess there must be more standard and accurate way to deal with such problem. Since I am new in this field, I did google something and read some pages. However, there is rarely content relevant with this topic(much I found is from some standard to another, however is not a standard coordinate system, it is cartesian but not geocentric).   Can anyone give any hints or suggestions for this problem?

I don't know so much about coordinate systems...  In my office we use to deal with spatial data coming from archaeological sites. Each site has its own x-y-z coordinate system (GCS). Three simple ortogonal cartesian axis. In the last years we have been managing this spatial data through GIS software (ArcGIS), without using specific coordinate system (just leave it as "undefined")  I'd like to know if there exisits any GCS designed to deal with such datasets using simple cartesian orthogonal axis, without grid distortions of the typical GCS. In addition, I'd like to know if this system is suitable for using it in an online mapping application.  By the way, we manage 2D (ArcMap) and 3D (ArcScene) environments and work with "mm" as length base unit.   If such a thing doesn't exists, maybe someone knows how to create it.


From what I've been seeing and reading Robb Stark's plan does not make ANY sense.  What is the point of attacking the south rather than just holding the north? At the end of the day control of a land is only there if there are men to hold it. Why not just stay in Winterfell and rule the North as it's own kingdom? Perhaps build a wall or check point or two on the southern border to hold off southern invading forces.  This question is different from its supposed duplicate  because it is not about whether the rebellion should have happened. Independence is not official until it is recognized publicly unlike the contention in the duplicate.  This question is about his tactics to secure independence.

I really can't get this. With such a strong feudalism, does kneeling down mean so much? I think there is not much difference between being 'King in the North' or 'Warden of the North'. The difference is only symbolic. Why did the North rebel when they are practically independent and why did the İron Throne go to war for territories that they don't actually dominate? I don't know if any tax regimes or any foreign threats for Westeros exist.


Can anyone find a hole in my proof or tell me how to make it stronger or simpler? The "lemma above" referenced in the fourth paragraph is a small but solid proof showing that $r$ is strictly less than $b$ in the division algorithm if it's written $a=bq+r$.  $\mathbf {Theorem}$ If $m$ and $n$ are positive integers that are relatively prime, then there are integers $a$ and $b$ such that $am+bn=1$. $\mathbf {Proof}$ Let $D = \{d \in \Bbb Z : am+bn>0\}$. Then there is a least element $l$ in D. Since $m$ and $n$ are relatively prime, we need only show that $l$ divides $m$ and $n$. Suppose $l$ does not divide $m$. Then there are integers $q$ and $r$ such that $m=ql+r$. Rewritten, we have that $r=ql-m=q(am+bn)-m=qam-m+qbn=m(qa-1)+n(qb)$. Thus, $r \in D$. By the lemma above, $r<l$, contradicting that $l$ is the least element of $D$. We conclude then that $l$ divides $m$. Switching $m$ for $n$ gives the same result for $n$. Since $m$ and $n$ are relatively prime, $l=1$ and it follows that there are integers $a$ and $b$ such that $am+bn=1$.

I would appreciate hints to this. I've done part (a) but am unconfident. Wondering how I could approach part (b)    Question's comment -- The aim of this question is to use the Division Algorithm and the definition of greatest common divisor (gcd) to show that $d_0 = \gcd(a,b)$.    Question:  Let $a,b$ be integers, not both zero, let $S$ be the set of integers defined by $$S = \{ ax + by | x,y \in \mathbb{Z}\}$$ and let $d_0$ be the smallest positive integer in the set $S$. Prove: a. If $s\in S$, then $d_0$ is a divisor of $s$. b. $d_0$ is a divisor of both $a$ and $b$. c. If $d$ is a divisor of both $a$ and $b$, then $d$ is a divisor of $d_0$. d. $d_0 =\gcd(a,b),$ and hence there exists integers $x,y$ such that $ax + by = \gcd(a,b)$.    Attempt:  Note I don't expect full (or any hints to the problem(s) as there are quite a bit, but I would just appreciate hints. a. Let $s \in S$. Then $s = d_0 q + r$ for some $q,r \in \mathbb{Z}$. By definition, $d_0 = ax_0 + by_0$ for some $x_0,y_0 \in \mathbb{Z}$. $s = ax_s + by_s$ for some $x_s,y_s \in \mathbb{Z}$. Hence, $$ax_s + by_s = q(ax_0 + by_0) + r\\ a(x_s - qx_0) + b(y_s - qy_0) = r.$$ Define $x_r:= x_s - qx_0 \in \mathbb{Z}$ and $y_r:= y_s - qy_0 \in \mathbb{Z}$. Then this shows that $r \in S$ which implies $d_0 | s$.


So, I have this music app that I want to enter, but I can't since it needs to be updated and is in another ID, but the musics that I have in the app can not be loaded somewhere else without entering the app, I searched on how to update a app that was purchased in a different ID, but I would have to delete it and lose all the music in it, is there anyway that I can enter the app without updating it or another way to update it without having to delete it?

At work we have one Mac laptop that everyone uses to compile and test our iOS app.  The employee who originally installed XCode used his personal Apple ID, and has since left the company.  When I log in to the App Store on this PC, I can download new apps (including the Mavericks update) but when I try to update an existing app, especially XCode, it always brings up the login prompt, with the user id field disabled and prefilled with his Apple ID.  Can I update XCode without his Apple ID password?


Apologies for a question that seems very basic/trivial but I don't understand the following behaviours:  >>> id_1 = id(256) >>> id_2 = id(256) >>> id_1 == id_2 True >>> id_1 = id(257) >>> id_2 = id(257) >>> id_1 == id_2 False  >>> id_1 = id("ab") >>> id_2 = id("ab") >>> id_1 == id_2 True >>> id_1 = id("aa") >>> id_2 = id("aa") >>> id_1 == id_2 False >>> id_1 = id('  ') >>> id_2 = id('  ') >>> id_1 == id_2 False  >>> id_1 = id(('A', 'Z')) >>> id_2 = id(('A', 'Z')) >>> id_1 == id_2 True >>> id_1 = id(('A', 'Z', 'AA')) >>> id_2 = id(('A', 'Z', 'AA')) >>> id_1 == id_2 False   What is the difference between the special cases which always give the same object reference/address given by the builtin function id (The once I saw are 0-256, both inclusive, 'a'-'z', 'A'-'Z')?

Why does the following behave unexpectedly in Python?  >>> a = 256 >>> b = 256 >>> a is b True           # This is an expected result >>> a = 257 >>> b = 257 >>> a is b False          # What happened here? Why is this False? >>> 257 is 257 True           # Yet the literal numbers compare properly   I am using Python 2.5.2. Trying some different versions of Python, it appears that Python 2.3.3 shows the above behaviour between 99 and 100.  Based on the above, I can hypothesize that Python is internally implemented such that "small" integers are stored in a different way than larger integers and the is operator can tell the difference. Why the leaky abstraction? What is a better way of comparing two arbitrary objects to see whether they are the same when I don't know in advance whether they are numbers or not?