I would like to trigger a "touch" or "touches" to a smartphone screen electronically without actually touching the screen with my finger using a remote control somehow.  The idea would be that every time I would press the remote control, it would trigger a momentary "touch" to the screen.  Is there a way to do this? If so, can someone offer a basic schematic for how something like this would be wired along with a list of suggested components?  My question was flagged as a possible duplicate but I checked the other post and so far, a solid answer hasn’t reached quite yet.   Thanks!

I would like to generate computer controlled touches on a capacitive touch screen (e.g. iphone) using the following setup: I have a conductive patch (size of finger) that I place on the touchscreen which is connected to a wire. When I touch the other end of the wire, it generates a touch at the location of the capacitive patch. However, also when I do make contact with the wire, it also generates a touch. I think this is because the wire (25cm) acts as an antenna and the capacitive signal is influenced by noise. I do not encounter this problem when the wire is shorter (e.g. 5cm).   My idea now is to place an electronic component close to the patch, which I can control digitally to connect/disconnect the wire (switch). So when the "switch" is open the wire is very short and will not generate a touch. When the "switch" is closed a touch will be generated because it is connected to the longer wire which generates a touch because of noise in the environment or/and the user is touching the end of the long wire. From my basic knowledge of electronics and transistors, I though that a transistor might be suitable as this can be as a switch that is controlled digitally. However, I did not come that far as I encountered the following problem using a PNP BC327:  I directly soldered the collector to the conductive patch that makes contact with the screen. When touching the screen with this setup (leaving the base and emitter disconnected) does not generate any touches. However, when connecting a loose wire to the base or emitter, a touch is generated without even controlling the transistor. I do not measure any conductivity between the Collector, Base, or Emitter using a multi-meter so I am very surprised that connecting these wires causes a change in capacitance on the collector.  Any help to beter understand this problem would be useful as well as input on other techniques on how to make the desired system/setup.


I'm generating a QR code vCard using PHP QR Code (). It works, but not with Brazillian Portuguese characters. I can't find how to force UTF-8 to it.  The problem is that iOS will not recognize the characters, check the screenshots below (iOS and Android).  <?php   include('phpqrcode/qrlib.php');   // how to build raw content - QRCode with detailed Business Card (VCard)  $tempDir = "";   // here our data  $name         = 'João Carlos da Silva';  $sortName     = 'da Silva;João Carlos';  $phone        = '+55 (89) 2345-6789';  $phonePrivate = '+55 (94) 4521-3989';  $phoneCell    = '+55 (66) 1234-5678';  $orgName      = 'GH Construtora';   $email        = 'emaildousuario@dominio.com.br';   // if not used - leave blank!  $addressLabel     = 'Escritório';  $addressPobox     = '';  $addressExt       = '2º andar';  $addressStreet    = 'Av. das Nações, 200';  $addressTown      = 'Cidade';  $addressRegion    = 'SP'; $addressPostCode  = '18.902-100';  $addressCountry   = 'Brasil';  // we building raw data  $codeContents  = 'BEGIN:VCARD'."\n";  $codeContents .= 'VERSION:2.1'."\n";  $codeContents .= 'N:'.$sortName."\n";  $codeContents .= 'FN:'.$name."\n";  $codeContents .= 'ORG:'.$orgName."\n";   $codeContents .= 'TEL;WORK;VOICE:'.$phone."\n";  $codeContents .= 'TEL;HOME;VOICE:'.$phonePrivate."\n";  $codeContents .= 'TEL;TYPE=cell:'.$phoneCell."\n";   $codeContents .= 'ADR;TYPE=work;'.      'LABEL="'.$addressLabel.'":'      .$addressPobox.';'      .$addressExt.';'      .$addressStreet.';'      .$addressTown.';'      .$addressPostCode.';'      .$addressCountry  ."\n";   $codeContents .= 'EMAIL:'.$email."\n";   $codeContents .= 'END:VCARD';   // generating  QRcode::png($codeContents, $tempDir.'026.png', QR_ECLEVEL_L, 7);   // displaying  echo '<img src="026.png" />';

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.


In the sentence " What kind of flowers is/are Molly growing? Is the subject here flowers or Molly?

Over at stats.stackexchange we are having a minor kerfuffle over whether a title is using incorrect grammar. It has been edited and re-edited several times. It would be great to get some arbitration and a clear explanation.   The original title was "What questions is your data team hoping to answer?" which was edited to "What questions are your data team hoping to answer?", then edited back. See the question .


current FPM dashboard pool                    PS process manager         ondemand start time              25/Jul/2020:18:25:24 +0100 start since             332382 accepted conn           2981219 listen queue            0 max listen queue        0 listen queue len        0 idle processes          12 active processes        3 total processes         15 max active processes    576 max children reached    0 slow requests           0  Recently due to problem in our one of the backend-server, I had moved from dynamic to ondemand on my PHP-FPM. now the issue on the MySQL Server is settled down and I want to revert back to dynamic, Its 132GB RAM Dell-R620,  with 250 SSD for OS and 5TB SATA in RAID 10 for Storage with different partitions to hold data. MySQL is configured to use not more than 50GB ( for both INNODB and MyISAM indexes + OS caches ) Rest is used to Apache+PHPFPM 24 Cores running all the above mentioned setup. pm = dynamic pm.max_children = 3000 pm.start_servers = 200 pm.min_spare_servers = 100 pm.max_spare_servers = 200 pm.process_idle_timeout = 10s; pm.process_idle_timeout = 1s; pm.max_requests = 5000 pm.status_path = /FPM_st ping.path = /ping   but even with this php-fpm config parameters, I used to get WARNING: [pool PS] seems busy (you may need to increase pm.start_servers, or pm.min/max_spare_servers), spawning 8 children, there are 0 idle, and 107 total children'  Can anyone please suggest me the correct values  for a heavy loaded system. I know its a bit complicated to calculate the dynamic configs, any guidance will matter for me. Its a debian-9.11 system -- running apache2.4, php5.6 via FPM and system is serving very high traffic  web-services

This is a  about capacity planning for web sites. Related:      What are some recommended tools and methods of capacity planning for web sites and web-applications? Please feel free to describe different tools and techniques for different web-servers, frameworks, etc., as well as best-practices that apply to web servers in general.


I have a problem with the glossy shader. I'd like for it to be visible in renderer preview the same way that it's visible in material preview. How do I do that? Here is a picture of how it looks in material preview mode:   And here is how it looks in renderer preview mode:

I'm trying to make a test render of my model. But everytime I render it the render looks completely different from the viewport. The viewport is in render mode so it should look something like that, but this doesn't come even close.   I'm using cycles renderer. And my world note is just the standard one so nothing installed there.  There are 2 sun's in the scene both set to 0.5.  I've tried different hdris but they all have the exact same outcome. I've pressed alt+h to see if there was anything hiddden in my scene that blocked the background and nothing shows up so I don't think that's the problem. I've also copied it to a new Blend file to see if there was anything wrong with the file itself but it also happens there so it must be something in my settings I guess. But I just can't find out which one    this is how it looks in the viewport render.    And this is how it looks when I render it.  I really don't know how to fix this so I hope someone can help me here


I am unable to execute commands (shell_exec) with php, and read on stackoverflow / here that the solution was to run apache as root. Is this possible / is this a totally wrong solution? When I try to execute commands with php it does nothing. I am trying to run a python script with variables from a PHP script and it is not working, it does nothing. Doing this on a centos vps

I would like to update my hosts file and restart dnsmasq from a web interface (php/apache2). I tried playing around with . I have both apache and dnsmasq running on an EC2 instance.  I understand that Linux ignores the setuid bit on text scripts, but works on binary files. (Have I got something wrong?). I added exec("whoami"); to the example C program in Wikipedia. Although the effective UID of the C program is 0, whoami does not return root :-(  I would thoroughly like to avoid      echo password | sudo service dnsmasq restart   or adding apache to the sudoers without password! Is there a way out? How does webmin do such things?


So I was watching the show Numb3rs, and the math genius was teaching, and something he did just stumped me.  He was asking his class (more specifically a student) on which of the three cards is the car. The other two cards have an animal on them. Now, the student picked the middle card to begin with. So the cards looks like this  +---+---+---+ | 1 | X | 3 | +---+---+---+   The X Representing The Picked Card  Then he flipped over the third card, and it turned out to be an animal. All that is left now is one more animal, and a car. He asks the student if the chances are higher of getting a car if they switch cards. The student responds no (That's what I thought too).  The student was wrong. What the teacher said is "Switching cards actually doubles your chances of getting the car".  So my question is, why does switching selected cards double your chances of getting the car when 1 of the 3 cards are already revealed. I thought it would just be a simple 50/50 still, please explain why the chances double!

I was watching the movie 21 yesterday, and in the first 15 minutes or so the main character is in a classroom, being asked a "trick" question (in the sense that the teacher believes that he'll get the wrong answer) which revolves around theoretical probability.  The question goes a little something like this (I'm paraphrasing, but the numbers are all exact):  You're on a game show, and you're given three doors. Behind one of the doors is a brand new car, behind the other two are donkeys. With each door you have a $1/3$ chance of winning. Which door would you pick?  The character picks A, as the odds are all equally in his favor.  The teacher then opens door C, revealing a donkey to be behind there, and asks him if he would like to change his choice. At this point he also explains that most people change their choices out of fear; paranoia; emotion and such.  The character does change his answer to B, but because (according to the movie), the odds are now in favor of door B with a $1/3$ chance of winning if door A is picked and $2/3$ if door B is picked.  What I don't understand is how removing the final door increases the odds of winning if door B is picked only. Surely the split should be 50/50 now, as removal of the final door tells you nothing about the first two?  I assume that I'm wrong; as I'd really like to think that they wouldn't make a movie that's so mathematically incorrect, but I just can't seem to understand why this is the case.  So, if anyone could tell me whether I'm right; or if not explain why, I would be extremely grateful.


I am trying to create a technical animation where i require a video to pause at specific intervals to include explanation texts. For example, in the image below i require a cut to be done exactly where the blue line is:  I am aware using keyboard shortcut "K" allows for me to split strips where i can split the video, followed by splitting the image apart from the video as such:  However, when i scrub to the portions where the portion is black no video will be playing. Tl;dr: How do i easily pause an animation such that i can add other edits in the other channels while keeping a still frame in the original video. (the only brute force method i can think of currently is duplicating that still frame that i cut [2nd image] for the whole duration of the blank space.)

I am using Blender 2.76b.  None of these suggestions have worked for me:   Doing a hard cut. I am doing this multiple times to leave a gap, which I want to fill in with the freeze frame RMB to grab the right arrow, which I want to extend Press g and drag it, which will create a freeze frame on the last frame if extended beyond the original size.   I've tried this selection and tried both g and e and neither work. It seems to want to let me either move it or make the clip smaller but not extend beyond its original size.  Any ideas?


I'm completely new to coding in Phython. Especially blender scripting. I was googling all the possible ways to copy a selected mesh. But none of the code seems to work as it was for 2.7 or 2.8 blender version. As well as I like to add the new copy of the mesh to selected place. Wether it's underneath the selected mesh, or above. I'd like to as well scale the copy down.

I know how to successfully duplicate an object by using  bpy.ops.object.add_named(name = 'TemplateObjectName')   If the template object named 'TemplateObjectName' has animations, particle systems and modifiers attached to it, the previous call will create a duplicate object that also has those components. However, if I duplicate an object using   template_object = bpy.data.objects['TemplateObjectName'] new_object = bpy.data.objects.new('NewObjectName', template_object.data) collection.objects.link(new_object)   how do I attach the template object's animation, modifiers, particle systems...?


I am creating a strategy game with many objects, in which the objects will be able to attack each other.  If an object is within attack range of another object, it will be attacked. But I only know one way is to loop through all objects to see if it is within the scope of this object's attack. Therefore the complexity of the algorithm is O (n ^ 2). Can someone give me a better algorithm or preferably a book about algorithms like this.  Thanks !

I'm relatively new to game development and have been trying to learn how collision detection is coded. I mostly work with Actionscript 3, but I'm learning C++ on the side.  I've been wondering how "bullet hell" and top-down shooters optimize their collision detection with so many objects.  Any information/theories would be great.


It happened this morning: Avast Antivirus Free just disappeared from tray icon ?!  I checked the installation directories, and everything is in there, but the antivirus didn't started.  I tried to repair/uninstall, through Control Panel, but it show me an error message.  I tried to use Avast Clear, from here , but it stuck in the first screen.  I tried to use it again, in Safe Mode, but it stuck again.  So, in safe mode, I removed "all" avast entryies in register, restarted the computer and installed Avira. (But I prefer Avast)  I am using: Windows 8.1 Pro 64bit.  The last Windows Update is: Windows Defender KB2267602, but it shows an error, and I'm think this messed up with Avast.  Does anyone know what could be happened ?

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


If a company uses an MDM system (like GOOD or MobileIron) to deploy apps to their iPads and iPhones does iOS provide the MDM system data about when the app is used, so it will show up in their usage reports?

I have an iPhone through my company. From my understanding, Apple does not allow any software onto their i* devices that does not come from the app store. I got into a discussion with a coworker about how IT can track the phone. Is there any keyboard loggers, or other spyware that could be installed which would allow a company to track employees actions outside of the traditional email client?  I know text messages show up on a monthly bill through the carrier. If texting through Google voice, I'm assuming that would be unreadable, since it is a third party app and uses a data connection?


Windows tool Handle.exe created by Mark Russinovich () can be used to get the list of files opened by a process.  In my app I need the same feature - I need to know list of files opened by a different process.  How to implement this in my app? Is it better to implement this in my app or launch Handle.exe as subprocess and parse output? I briefly searched WinAPI docs and didn't found how to implement this...  For me it's not a problem to have an additional .exe file in the app folder. Main goal - everything should work fine on all Windows version since WinXP.  P.S. Seems that this is very easy task in python  ))

How do I get the list of open file handles by process id in C#?   I'm interested in digging down and getting the file names as well.   Looking for the programmatic equivalent of what process explorer does.   Most likely this will require interop.   Considering adding a bounty on this, the implementation is nasty complicated.


I want to setup Firefox 7 to store my history for longer or shorter (setting period of time, just like in Options), but I can't seem to find an option to do that in dialog; all I can see is "Remember History".

I want to setup Firefox 4 to only store my history for 1 day (or some other set period of time), but I can't seem to find an option to do that in the options dialog, all I can see is "Remember History", "Never Remember History" and "Custom History Settings". "Custom History Settings" only lets me select what to keep, not for how long.  Is there anyway I can do this?


In trying to download the latest release, I see there are no alternate CDs available.  Previously I have needed them in order to install with a linux software raid root.  Does the lack of alternate CDs mean that all of those features are within the others? or have they not been finished yet?  I ideally wanted a kubuntu alternate CD but I see there is not an ubuntu one either.  Thanks

I would like to download the alternate installation ISO for the current release, Ubuntu 13.10 Saucy Salamander, but I can't find it on the releases.ubuntu.com website. Aren't alternate ISOs provided anymore?  I need the alternate ISO because Xorg crashes on recent versions of Ubuntu when using old SIS on board graphics.  In fact, I just patched Ubuntu sources and generated a custom package for the xserver-xorg-video-sis driver on my PPA to try fix this problem, after installing with the minimal ISO.


Consider a Bernoulli experiment of parameter $p$ that can be repeated independently for $N$ times, where $N \sim $ Poisson$(\lambda)$. Let $X$ be the number of successes and $Y$ the number of failures. How can I calculate the distribution of $X$ and $Y$? My attempt with $X$ was to consider it as a Binomial with parameters $N,p$ (and $Y$ can be considered as a Binomial with parameters $N,1-p$). The only thing that came out in my mind was to use the disintegration formula as it follows: $$P(X=k)=\sum_{n=k}^{\infty}P(X=k \mid N=n)P(N=n)=\sum_{n=k}^{\infty} \binom{n}{k}p^k(1-p)^{n-k}\dfrac{\lambda ^n}{n!}e^{-\lambda}=\\ =\dfrac{p^ke^{-\lambda}}{k!}\sum_{n=k}^{\infty}\dfrac{(1-p)^{n-k}}{(n-k)!}\lambda^n$$ Is this correct? And if it is, how do I evaluate the last series (Wolphram Alpha says $\lambda^ke^{\lambda-\lambda p}$)?

$$\sum_{n=0}^\infty \binom{n}{k}p^k(1-p)^{n-k}\frac{\lambda^ne^{-\lambda}}{n!} = \frac{(\lambda p)^ke^{-\lambda p}}{k!}$$  That is, given a random variable $X$ with Poisson distribution $X \sim \operatorname{Poisson}(\lambda)$, and, given $X = n$, random variable $Y$ is distributed by a binomial such that $Y \sim B(n,p): p \in [0,1]$. Given $n$, $P(Y = k|X = n) = \binom{n}{k}p^k(1-p)^{n-k}$. Given $\lambda$, $P(X=n) = \dfrac{\lambda^ne^{-\lambda}}{n!}$. Therefore, $P(Y = k|\lambda) = \sum_{n=0}^\infty P(Y = k | X = n)P(X = n | \lambda) = \sum_{n=0}^\infty \binom{n}{k}p^k(1-p)^{n-k}\dfrac{\lambda^ne^{-\lambda}}{n!}$. What properties and identities can be used to demonstrate the equality above?


I am confused as to why I have a non static method error. It says  "non-static method getGrade(double) cannot be referenced from a static context getGrade(myGPA);" I have been reading on what non static method. I get it I can't call something that doesn't exist. Since you haven't created an object, the non-static method doesn't exist yet. A static method (by definition) always exists. So this is my code below, and the error says "non-static method getGrade(double) cannot be referenced from a static context getGrade(myGPA);"  I created an object of that, but gave me a "cannot find symbol error." I know it is something minor, can someone please guide me as to what I can do? THANK YOU in advance!  The program is supposed to take the user's input (GPA, in decimal format, and covert that into percentile, and response to the user.    import java.util.Scanner;    public class GradeCalc {  public double myGPA;  public double numGrade;    public static void main (String[] args) {     Scanner myScanner = new Scanner (System.in);     System.out.println("Enter your GPA.");     double myGPA= myScanner.nextDouble();      getGrade(myGPA);     System.out.println(myGPA);     }      public double getGrade(double myGPA) {     if(myGPA==0.0 || myGPA==0.8 || myGPA==0.9 || myGPA==1.0 || myGPA==1.1 ||                  ||myGPA==1.8 || myGPA==1.9 || myGPA==2.0 || myGPA==2.1 || myGPA==2.2 || myGPA==2.3        || myGPA==2.4 || myGPA==2.5 || myGPA==2.6 || myGPA==2.7 || myGPA==2.8 || myGPA==2.9 || myGPA==3.0 || myGPA==3.1 || myGPA==3.2 || myGPA==3.3 || myGPA==3.4 || myGPA==3.5 || myGPA==3.6 || myGPA==3.7 || myGPA==3.8 || myGPA==3.9 || myGPA==4.0 ) {         double numGrade = (myGPA*10+55);     }         if (myGPA == numGrade)             System.out.println(numGrade);     else  {         System.out.println("Try again.");     }      return numGrade; } }

The very common beginner mistake is when you try to use a class property "statically" without making an instance of that class. It leaves you with the mentioned error message:     You can either make the non static method static or make an instance of that class to use its properties.   Why? I am not asking for solutions. I would be grateful to know what is the reason behind it. The very core reason!  private java.util.List<String> someMethod(){     /* Some Code */     return someList;             }  public static void main(String[] strArgs){                // The following statement causes the error. You know why..     java.util.List<String> someList = someMethod();          }


i want to place a script file on other machine root . here is my terminal command   scp /var/www/html/script.sh root@192.168.1.7:script.sh   it asks for root password. i enter correct root password but it says  Permission denied, please try again.   Can anybody help?

I just installed Ubuntu 14.04 and LAMP on that. Then, I wanted to configure my server, so tried out  tutorial.  When I give the command:  ssh root@localhost   I get : Permission denied, please try again. I have logged in as root user through the command :  sudo -i   I also tried the same, by logging in through:  sudo -s   I use the same password as that I used to log in as user, but still am getting the same error message.  Could someone help me out here?  PS: I looked into  but didn't seem to work for me.


Statistical inference using p-values results in accepting or rejecting a hypothesis given some p-value, say 0.05. So, if p = 0.05, we can conclude an effect is "significantly" different from zero with 95% confidence. However, I then test a second hypothesis with the same data set. Again, p = 0.05, and I can make the same claim. But wait, many statistical textbooks will preach that because its a second look at the data this p-value must be 'corrected' (read: penalized) to account for the fact that if you test enough hypotheses you will get positive results by random chance, even if nothing is truly happening. If you make 100 comparisons, 5 will erroneously detect an effect when none is present at a threshold of p = 0.05. To deal with this researchers perform a bonferroni correction, or apply the false discovery rate correction, or some other multiple-comparison correction method.  This does not make sense to me for two reasons:   The statement that an effect was detected at p=0.05 already communicates this information. Anyone who has been taught statistics should understand there is still some probability that the effect is spurrious, and the p-value communicates that probability.  The proposed correction methods guard against Type I errors (false positives), at the expense of artifically inflating the Type II error rate (false negatives). However, to my knowledge, there is no a priori reason why one error should be considered "worse" than the other. While some might argue that you want to be conservative in hypothesis testing and err on the side of caution, a far more effective strategy would be lowering your p-value threshold rather than ad hoc correcting your p-values.   All in all, a p-value is a pretty straightforward statistic. Its the probability a result may have been detected by chance. Its no more and no less than that. "Correcting" a p-value seems to do more harm than good in the context of interpretation.  Note: this is different than misunderstanding the  problem. I understand that if you run 20 tests, one will spuriously detect an effect (green jelly beans cause acne - though it should have been equally probable that some jelly bean color prevented acne...) What I do not understand is why multiple comparison corrections are an appropriate way to deal with this problem. The problem is always there.

I see that one time out of the twenty total tests they run, $p < 0.05$, so they wrongly assume that during one of the twenty tests, the result is significant ($0.05 = 1/20$).      Title: Significant Hover text: "'So, uh, we did the green study again and got no link. It was probably a--' 'RESEARCH CONFLICTED ON GREEN JELLY BEAN/ACNE LINK; MORE STUDY RECOMMENDED!'"


I have an crawler in python for get brands of vehicles.  My function return an array with all brands and search for models each brand.  But some brands do not have models and I would like that when the brands did not have models it would skip to the next brand and not finish running the script.  I try this:  all_brands = [u'Acura', u'Alfa Romeo', u'Asia', u'Aston Martin', u'Audi', u'Bentley', u'BMW', u'Buggy BRM', u'Buick', u'Cadillac', u'Carver Concept', u'Chamonix', u'Changan (Chana)', u'Chery', u'Chevrolet', u'Chrysler', u'Citroen', u'CN Auto', u'Crosslander', u'Daewoo', u'Daihatsu', u'Dodge', u'DS', u'Effa', u'Engesa', u'Envemo', u'Fargo', u'Ferrari', u'Fiat', u'Ford', u'Fyber Buggy', u'Geely', u'GMC', u'Great Wall', u'Gurgel', u'Hafei Towner', u'Haima', u'Honda', u'Hummer', u'Hyundai', u'Infiniti', u'Isuzu', u'Iveco', u'JAC', u'Jaguar', u'Jeep', u'JIN BEI', u'Jonway', u'JPX', u'Kia', u'Lada', u'Lamborghini', u'Land Rover', u'Landwind', u'Lexus', u'Lifan', u'Lincoln', u'Lobini', u'Lotus', u'Mahindra', u'Maserati', u'Matra', u'Mazda', u'McLaren', u'Mercedes Benz', u'MG', u'MG Spayc', u'MINI', u'Mitsubishi', u'Nissan', u'Oldsmobile', u'Pagani', u'Peugeot', u'Plymouth', u'Pontiac', u'Porsche', u'Rely', u'Renault', u'Rolls-Royce', u'Saab', u'Saturn', u'Seat', u'Shineray', u'Shuanghuan', u'Smart', u'Spyker', u'SsangYong', u'Subaru', u'Sunbeam', u'Suzuki', u'TAC', u'Tesla', u'Toyota', u'Troller', u'Volkswagen', u'Volvo']  for brand in all_brands:     soup_brand = get_html(link_base + str(brand_url))      if soup_brand is None:         return      print "Crawleando: "+str(count_url)+"/"+str(count_brands)     print "Marca atual: "+brand_url      first_vehicle = soup_brand.find(attrs={"class":"titulo_anuncio"})      if first_vehicle is None:         return #Here it was to jump to next tag but it to the script

I have a loop going, but there is the possibility for exceptions to be raised inside the loop. This of course would stop my program all together. To prevent that I catch the exceptions and handle them. But then the rest of the iteration runs even though an exception occurred. Is there a keyword to use in my except: clause to just skip the rest of the current iteration?


I got ubuntu 16.04 for my computer but without many of the drivers was useless so i went to ubuntu 14.04, now i have to move to windows 7 because of some studies that require windows, problem is if i try to install it with the USB linux blocks me, any can help me please?

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


I know this question has been asked quite a few times. However, please read ahead.   I have tried a lot of apps such as VeryAndroid SMS Backup, SMS Backup & Restore, WonderShare MobileTrans. I also used an android app called SMS Tools which took the .csv file created by Nokia OVI Suite. Most of them work. The SMS messages were threaded as per the contact name. However, they were not sorted as per date & time. In other words, what I would expect is to get the latest SMS (sent or received) at the top, followed by the next latest.   Is there any way we can transfer the SMS messages in such a way that latest appear at the top & the hierarchy is followed? I've already tried the solutions offered by , , , and  to no avail: They all restore the messages, but they are not ordered as per time. Even editing the .csv file accordingly did not have the desired effect.

What is the easiest way to move Nokia (Symbian E series) content, such as contacts, inbox, photos, etc. to an Android phone? I can extract a backup from the Nokia but it's in .nbu format


These are the warnings when I run dmesg.  ACPI: Deleted _OSI(Windows 2012) ACPI: Deleted _OSI(Windows 2013) ACPI: RSDP 00000000000f0410 00024 (v02 INTEL ) ACPI: XSDT 00000000bdfaad98 000B4 (v01 INTEL    ROMLEY 06222004 INTL 20090903) ACPI: FACP 00000000bdfaa918 000F4 (v04 INTEL    ROMLEY 06222004 INTL 20090903) **ACPI Warning: Invalid length for Pm1aControlBlock: 32,** using default 16 (20090903/tbfadt-615) ACPI: DSDT 00000000bdf8f018 19656 (v02 INTEL    ROMLEY 00000002 INTL 20100331)   And in bios there is no acpi setting to disable so I try acpi=off in grub.conf file but after that no acpi logs are coming. What should I do to remove the acpi warning?

I have this message in dmesg log with linux 3.11.6-1 (2013-10-27) (debian version).  I wonder how to fix/remove it?       [    5.098132] ACPI Warning: 0x0000000000000428-0x000000000000042f SystemIO conflicts with Region \PMIO 1 (20130517/utaddress-251)      [    5.098147] ACPI: If an ACPI driver is available for this device, you should use it instead of the native driver      [    5.098156] ACPI Warning: 0x0000000000000530-0x000000000000053f SystemIO conflicts with Region \GPIO 1 (20130517/utaddress-251)      [    5.098167] ACPI: If an ACPI driver is available for this device, you should use it instead of the native driver      [    5.098171] ACPI Warning: 0x0000000000000500-0x000000000000052f SystemIO conflicts with Region \GPIO 1 (20130517/utaddress-251)      [    5.098180] ACPI: If an ACPI driver is available for this device, you should use it instead of the native driver      [    5.098186] lpc_ich: Resource conflict(s) found affecting gpio_ich      [    5.099072] ACPI Warning: 0x000000000000f040-0x000000000000f05f  SystemIO conflicts with Region \_SB_.PCI0.SBUS.SMBI 1    (20130517/utaddress-251)      [    5.099085] ACPI: If an ACPI driver is available for this device,     you should use it instead of the native driver   lspci :   $ lspci 00:00.0 Host bridge: Intel Corporation 3rd Gen Core processor DRAM Controller (rev 09) 00:02.0 VGA compatible controller: Intel Corporation 3rd Gen Core processor Graphics Controller (rev 09) 00:14.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB xHCI Host Controller (rev 04) 00:16.0 Communication controller: Intel Corporation 7 Series/C210 Series Chipset Family MEI Controller #1 (rev 04) 00:19.0 Ethernet controller: Intel Corporation 82579LM Gigabit Network Connection (rev 04) 00:1a.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB Enhanced Host Controller #2 (rev 04) 00:1b.0 Audio device: Intel Corporation 7 Series/C210 Series Chipset Family High Definition Audio Controller (rev 04) 00:1c.0 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 1 (rev c4) 00:1c.1 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 2 (rev c4) 00:1c.5 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 6 (rev c4) 00:1d.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB Enhanced Host Controller #1 (rev 04) 00:1f.0 ISA bridge: Intel Corporation QM77 Express Chipset LPC Controller (rev 04) 00:1f.2 SATA controller: Intel Corporation 7 Series Chipset Family 6-port SATA Controller [AHCI mode] (rev 04) 00:1f.3 SMBus: Intel Corporation 7 Series/C210 Series Chipset Family SMBus Controller (rev 04) 02:00.0 Network controller: Intel Corporation Centrino Ultimate-N 6300 (rev 35) 03:00.0 SD Host controller: O2 Micro, Inc. Device 8221 (rev 05)


I am looking for a tutorial on writing a scope for simple search from a website.  is very complex.  If somebody can explain me the steps to write a scope in a simplest way, that would be very helpful.

I'd like to create a custom scope that searches and returns results from an online source for personal use.  Is this possible? And if so, how?


I see all the time, important character (i.e: bridge crew), might include the captain and first mate (case of ) are in boarding party. Dead crew result in missing slot at the bridge. Why don't starfleet have a (few) dedicate boarding team consist of marines to do boarding action. It might take only dozen of marines for boarding action that does not take much crew space. Marines are better at fighting, because they spend all the time training fighting, not how to man the station. And their dead don't have much impact on functioning of the ship.

Ever since the days of Kirk, Spock, and McCoy, bridge officers in Starfleet have always had a prominent role in away team missions.  However, it would seem more logical to me that such hazardous (and, generally, specialized) duties should fall to lower-ranking and/or more dedicated teams.  Of course, it wouldn't have made for great TV if every away team was comprised of a bunch of red-shirts.  And it would definitely increase the show's budget to have an extra group of main characters whose sole purpose was to handle the away missions.  Still, I'm curious to know if there's ever been a real in-universe explanation for this practice?  I know it's been brought up a few times, in a few series/movies, that the Captain should not be taking part in hazardous away team missions.  But nothing is ever said (that I'm aware of) of the rest of the still valuable bridge crew or other senior officers.


This seems to be argued back and forth by my Writing and Reading teachers. Here is the problem. For example I write this sentence:     And I went to bed to get some sleep.   Just a simple sentence with the conjunction And at the beginning. My teachers disagree whether this is correct or not. So is it correct to start a sentence with a coordinate conjunction?  This is not a duplicate because my question is about all the FANBOYS, not just the conjunction "and".

Since I first learned English, I have been holding this understanding that "and", as a conj. but unlike "but",  can only connect two clauses, not two sentences ended with periods.  But recently, I have seen so many prints, either in entertainment or in academia, where "And" is popularly used in the beginning of a sentence. It seems like the author is trying to connect the sentence just right before and the sentence following "And" in some intended meaning which I don't quite get.  I was wondering if I have been wrong all the time, or if there is a new trend that I fail to understand and accept? How to understand such usage of "and" in rigorous English grammar? If I am right, why it is used differently from "but" in terms of what I mentioned at the beginning of this post?


I have a questionnaire data that consist of composite Likert scale and discrete Likert items.  Likert scales or variables are the sum of few Likert items while the one-item variables are represented by one Likert questions.  Could I run normal distribution tests on both composite and individual Likert variables in order to determine if i have to use parametric or non parametric tests?  Thanks

I have data from a 5 point Likert scale item which approximately 1/4 of the responses only account for 1 through 4 of the 1 through 5 available.    Do I have to  standardize the min/max response categories that is reported in SPSS descriptives for output or will creating z-scores be sufficient?    The variables have differing degrees of distributions due to this and the transform functions (e.g., SQRT, LG10) have not solved my problem. My sample (N=162) is the first part of a test/retest for instrument reliability. I have run all the processes thinking that what looked normal and based on criterion (2 or 3 times the SD is sufficient to estimate skewness to identify 'normal distribution' regardless of visual).    I'm at the point of frustration and exhaustion...any expert advice?


I’m playing Catan and my brother-in-law has 9 points with the longest road. I was sitting at 7 points and another player had a pretty long road with only 5 points.   So I gave that other player brick and wood so they could take the longest road. I ended up winning the game, and that was probably the only way I could have won.   Would that be illegal if I didn’t accept anything for the brick and wood? Would it be illegal if I accepted one sheep for say, two brick and two wood? I only did the trades on my turn.

Motivation: I once had one surplus card on my hand, and knew the robbers would come soon. So I gave it to someone for free, to avoid losing more cards when they hit. I was surprised by how badly this was received. Two of the three other players (the hosts of the game) acted upset, like I had tried to cheat. I had to take the card back, get robbed the next turn and 'giving cards away for free' was banned immediately. (Oh, how I hate mid-game additions to the rules. But that's beside the point.)  So now the question: Is this really illegal in Settlers of Catan? Is it generally considered underhanded in any way? If so, why?   My reasoning was like this:        Consider players A and B.   A wants to give B a sheep.   A trades a sheep and one rock to B, in exchange for wheat.   A trades the received wheat for the (formerly his) rock.   A and B now both have the same resources they had in the beginning, only the sheep has moved from A to B.


How can I learn if an algorithm runs in O(n) time, or O(nlogn)?

Most people with a degree in CS will certainly know what . It helps us to measure how well an algorithm scales.   But I'm curious, how do you calculate or approximate the complexity of your algorithms?


I have a simple question, but I can't find the answer I am looking for the principal angle of a minimum_rotated_rectangle polygon in relation to a latitude or a longitude. df4.minimum_rotated_rectangle  Does anyone have this in stock?

Is there a simple way / ready-to-go function to calculate the azimuth of 2D-polygons in a GeoPandas DataFrame? My goal is to eventually compute azimuth angles of building footprints. Most of the functions I have found explicitly calculate the azimuth for a line, which is not what I am looking for. I have been thinking along the following lines to calculate the azimuth of a polygon using its normal vector (2 dimensions). Is my approach going into the right directions? I am a bit unsure how to adjust for the quadrants, also my results seem a bit odd. azimuth = 90 - math.degrees(math.atan2(normal[1], normal[0])) if azimuth >= 360.0:     azimuth -= 360.0 elif azimuth < 0.0:     azimuth += 360.0


I hope this hasn't been asked exactly like this before. I tried to do a search.   I am referring to my MacBook (but I think the same is at least partially true for other devices as well).  I checked "optimise storage" so that it will leave some space on my Mac.   I need more storage on my Mac because some apps like Xcode cannot be updated with just 25GB left on the SSD.   So - please let me know if this is true: ONLY desktop and "document" and their subdirectories are reflected back to my MacBook. Is this true. If so this implies that if I make another folder on iCloud like "Documents2" and push a lot of stuff that I don't daily need or want into that folder - this will NOT be copied over to my Mac, even if there is enough space?   Is this correct?  Thanks, Jeff

I am using the latest macOS Mojave, and I have a Mac which only has 250 GB of storage space. Due to the nature of my work, I need as much of this space available at all times.  I will sporadically need 100+ GB for a short duration of time for example. The problem with iCloud is that it optimises so to store as much as possible on the Mac at anytime and this causes me problems. Yes it will delete some local content when I am short on space but it takes too long.  I want iCloud switched on and accessible from my Mac, I just want it to keep everything on iCloud. Why does this not seem to be a feature or am I missing something?  It seems to leave me with 25 GB, which is 10% available so maybe this is a setting?


This is a result I haven't been able to find. An answer for finite groups or general groups would be great. A simple proof would be appreciated if possible.

Let $G$ be a group. When is there a group $H$ such that $G$ is isomorphic to its derived subgroup $H'$?  I only know that there is not always such a $H$; for instance, no group has its derived subgroup isomorphic to $\mathfrak{S}_n$ for $n \geq 4$ and $n \neq 6$.


I am just looking for a broad answer to this question. I am more curious about the general information rather than the specific. Also, I tried to search for this, but I think it's hard to word it so you get the right question. Anyway:  One common thing I see in a lot of games is multiple animations on the same model.  i.e.  A character runs, but also raises his arms an shoots.  A character has a walking animation, but can also be carrying resources as he walks.  I am curious if the first model has a "run" animation and a "run while shooting" animation. Or if they have a "run" animation and a "shoot" animation and run them at the same time. Obviously the first is possible, but I am wondering how the second one is done.  Do they use two models for upper and lower body or is there a way to ignore certain parts of a model when animating?  I know this depends a lot on the model, the programmer, language and the way the animation is done.   But broadly, if you were making a model with the intent of it doing multiple animations at once, what would be the best way to go about it?  Again, not after detailed specifics, just an overview :)  Thanks!

Say I have a framework with characters that can run and walk and of course, stand still.  Am I right in thinking that animation blending is the process of smoothly transitioning between these by generating dynamic animations at runtime?  If so, what is the basic theory of how this works, and how would I implement it?


As in this example  I want to have a synonym for an existing environment. So I created bigSystEquation being an align* environment. (In order to don't have to know that I use align*)  But the code below gives me an error : the error   ! LaTeX Error: \begin{align*} on input line 10 ended by \end{bigSystEquation}.  See the LaTeX manual or LaTeX Companion for explanation. Type  H <return>  for immediate help.  ...                                                l.13    \end{bigSystEquation}   And if I change the line 13 by \end{align*} (just curiosity, it has no sense to do so)  ! LaTeX Error: \begin{bigSystEquation} on input line 10 ended by \end{document} .  See the LaTeX manual or LaTeX Companion for explanation. Type  H <return>  for immediate help.  ...                                                l.14 \end{document}   Here is the code  \documentclass[a4paper]{article} \usepackage{amssymb} \usepackage{amsmath} \allowdisplaybreaks \newenvironment{bigSystEquation}{\begin{align*}}{\end{align*}}  \begin{document}     \begin{bigSystEquation}         a &= b\\         c &= d \\     \end{bigSystEquation} \end{document}

In the example below, an error is caused by \begin{align} and \end{align} but I do not see why:  \documentclass{book} \usepackage{amsmath} \newenvironment{subalign}{\begin{subequations}\begin{align}}{\end{align}\end{subequations}} \begin{document} \begin{subalign}      a&=b\\     &=b \end{subalign} \end{document}


Is it by gravity? How could gravity produce a repulsive force?

How can one show from General Relativity that gravity is attractive force, and under which conditions it becomes repulsive, also why positive energy vacuum drives repulsive gravity?


I'm currently writing a paper about numerical analysis and at one point I needed to calculate  $$\lim\limits_{x \to \infty}{\frac{a^x}{x!}}\quad \text{with} \quad a \in \mathbb{R}^+$$  Based on the fact that $x!$ goes faster to infinity than $a^x,$ I thought that it would approach zero, but this isn't really a proof, only a thought. So I'd appreciate it if you'd be able to help me with proving this.

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


I want to create an extension method with generics. But when using this method I get the error Compiler Error CS0311. How can I solve this? Here's an example.  using Compare; using System.Collections.ObjectModel;  static class Program {     static void Main()     {         var OldItemListe = new LoadListe();         var NewItemListe = new LoadListe();         bool ReturnValue = new Import().Compare(OldItemListe, NewItemListe);  //Here I got the Error CS0311     } }  namespace Compare {     /// <summary>Baseclass for all Elements </summary>     public class BaseClass     {         /// <summary> Elementname </summary>         public string Name { get; set; }         /// <summary> Beschreibung </summary>         public string Description { get; set; }     }     public abstract class BaseListe<T> : Collection<T> where T : BaseClass, new() { }     public class Load : BaseClass{}     public sealed class LoadListe : BaseListe<Load> {}       public class Import     {         public bool Compare<U>(U OldItemListe, U NewItemListe) where U : BaseListe<BaseClass>         {             // do something             if (OldItemListe[1].Name == NewItemListe[1].Name) return true; // only Example             return false;         }     } }

It seems that a List object cannot be stored in a List variable in C#, and can't even be explicitly cast that way.  List<string> sl = new List<string>(); List<object> ol; ol = sl;   results in Cannot implicitly convert type System.Collections.Generic.List<string> to System.Collections.Generic.List<object>  And then...  List<string> sl = new List<string>(); List<object> ol; ol = (List<object>)sl;   results in Cannot convert type System.Collections.Generic.List<string> to System.Collections.Generic.List<object>  Of course, you can do it by pulling everything out of the string list and putting it back in one at a time, but it is a rather convoluted solution.


Let $a,b,c$ be the sides for given triangle $ABC$ , then the following inequality true :   $$\prod_{cyc}(2a^2+2b^2-c^2)\prod_{cyc}(a+b-c)\leq a^2b^2c^2(a+b+c)^3$$  Actually Michael Rozenberg gave a nice solution but I am looking for a different approach like using some known inequality if possible     solution of Michael Rozenberg   let $a+b+c=3u$, $ab+ac+bc=3v^2$ and $abc=w^3$.  Thus, $$\prod_{cyc}(2a^2+2b^2-c^2)=\prod_{cyc}(2(a^2+b^2+c^2)-3c^2)=$$ $$=8(9u^2-6v^2)^3-12(9u^2-6v^2)^3+18(9u^2-6v^2)(9v^4-6uw^3)-27w^6=$$ $$=27(-w^6+2(3u^2-2v^2)(9v^4-6uw^3)-4(3u^2-2v^2)^3).$$ Also, $$\prod_{cyc}(a+b-c)=\prod_{cyc}(3u-2c)=27u^3-54u^3+36uv^2-8w^3=$$ $$=-8w^3-27u^3+36uv^2.$$ Thus, we need to prove that $f(w^3)\geq0,$ where  $$f(w^3)=u^3w^6-(-w^6+2(3u^2-2v^2)(9v^4-6uw^3)-4(3u^2-2v^2)^3)(-8w^3-27u^3+36uv^2).$$ But $$f''(w^3)=2u^3-2(-2w^3+2(3u^2-2v^2)(-6u))(-8)+$$ $$-(-8w^3-27u^3+36uv^2)(-2)=-4(157u^3-114uv^2+12w^3)<0,$$ which says that $f$ is a concave function.  Thus, it's enough to prove our inequality for an extreme value of $w^3$, which happens in the following cases.   $w^3\rightarrow0^+$. in this case the inequality is obvious; $\prod\limits_{cyc}(a+b-c)\rightarrow0^+$.   It's obvious again;   Two variables are equal.   Since our inequality is symmetric and homogeneous, it's enough to assume $b=c=1$.  Thus, $0<a<2$ and we need to prove that $$a^2(a+2)^3\geq(2a^2+1)^2(4-a^2)a^2(2-a)$$ or $$(a+2)^2\geq(2a^2+1)^2(2-a)^2$$ or $$a+2\geq(2a^2+1)(2-a)$$ or $$a(a-1)^2\geq0$$ and we are done!    thanks

Let $m_{a},m_{b},m_{c}$ be the lengths of the medians and $a,b,c$ be the lengths of the sides of a given triangle , Prove the inequality :   $$m_{a}m_{b}m_{c}\leq\frac{Rs^{2}}{2}$$  Where :   $s : \operatorname{Semiperimeter}$  $R : \operatorname{circumradius}$   I know the relation :   $$m_{a}^{2}=\frac{2(b^{2}+c^{2})-a^{2}}{4}$$  But when I multiple together I dont get simple formulas!  So, I need help finding a solution. Thanks!


The problem's quite clear. Prove that $$\gcd(a^2, b^2) = \gcd(a, b)^2$$  This is easy to understand intuitively and using the Fundamental Theorem of Arithmetic would be easy but I want to prove it by using the Divisibility axioms and the GCD. I have attempted it and am mentioning my results.  Here $d = \gcd(a, b)$.   $$d | ax + by \implies d^2 | a^2x^2 + 2axby + b^2y^2 \implies d^2 | a^2x^2 + b^2y^2 \implies \gcd(a^2, b^2) | d^2$$  I feel that this is not necessary. Please help.  Also, the proof can be generalized to $$\gcd(a^n, b^n) = \gcd(a, b)^n$$  Any help would be appreciated.

Let $a$ and $b$ be two integers. Show that $\gcd(a^2, b^2) = \gcd(a,b)^2$.   This is what I have done so far:  Let $d = \gcd(a,b)$. Then $d=ax+by$ for some $x,y$. Then $d^2 =(ax+by)^2 = a^2x^2 + 2axby+b^2y^2$.  I am trying to create a linear combination of $a^2$ and $b^2$ but do not know what to do with the middle term.  EDIT: I would be interested in seeing a proof using the Fundamental Theorem of Arithmetic as well. I simply thought it would be easiest to use Bezout's Identity.


I want to start generating additional income streams and what I've heard of most is "passive income"! I googled a lot, but I am not quite sure what option fits a beginner best... Any advice?

I am young, just started my career, and looking to begin investing so I can make my money work for me. I'm still living like I did in college (occasional purchase on myself, but most of it goes into savings) and I would like to take the extra money and invest it.   What would you suggest are the best options for me to begin? I was considering getting a personal investor [a financial advisor] for perhaps a year or so, but I've heard that they really are not worth the money. I wanted to get the input of the great minds here.


I want to show that $$ \dim \ker(AB) \le \dim \ker A + \dim \ker B. $$ My problem I thought that I can do that in this way:  Let consider $x \in\ker B$ $$Bx  = 0$$ Let multiplicate this from left side by A and we get: $$ABx = 0$$ so $$ker B \subset\ker AB $$ so  $$\dim \ker(B) \le \dim\ker AB$$ We can do the same thing with $\ker A$ let consider $ \vec{y} \in \operatorname{im}(AB) $ so $$ y = (AB)x $$ what is equivalent to $$ \vec{y} = A(B\vec{x}) = A\vec{w} $$ So $$ \vec{y} \in \operatorname{im}(AB) \rightarrow \vec{y} \in \operatorname{im}(A)$$ so $$ \operatorname{rank} AB \le  \operatorname{rank} A \leftrightarrow  \dim \ker A \le \dim \ker AB $$ But I am not sure what I should do later... edited I have seen this post  but I haven't got nothing like $\operatorname{im}(A|_{\operatorname{im}(B)})$ on my algebra lecture and I can't use that so I search for another proof (or similar without this trick)

$A, B$ are linear map from $\mathbb{R}^{12} \to \mathbb{R}^{12}$ and dim$null(A) = 3$, dim$null(B) = 5$ what value could dim$null(AB)$ be?  I think it could be greater than or equal to 5 because $$  Ker(B) \subset \{x\in \mathbb{R}^{12} : Bx \in Ker A\} = Ker(AB) $$ but is there are better result we can get?


Reading scripture in front of a donkey.  The country of origin of this proverb is Afghanistan (as far as I know) but we also have exactly the same idiom, identical in meaning, in our native language - the gospel was being read in front of (above the head of) a wolf but he was howling - let me go, the sheep are fleeing!   We use this expression when we want to emphasize that talking to a person (getting through his/her thick skull) is a futile endeavor; it's useless. I had been talking about the dangers of tobacco to him for an hour or so, when he took out a pack of cigarettes and started smoking.   I would like to know whether there is an equivalent expression in English, germane to the above-mentioned one?

North wind tells the arrival of spring season in Japan. And incidentally, we  have an idiom, “馬耳東風,” of which literal translation is ‘the east wind to the ears of horse,’ meaning a person who doesn’t listen to, or respect other’s opinion, advice, and suggestion like a horse is insensitive to the meaning and tastefulness of east wind.  For example, we say “His boss’s admonition was just an east wind to Taro. And he was fired.”   I don’t know why it should be east wind, not west, south or north wind, but Chines have the same saying, “东风吹马耳.”  The structure of “East wind to a horse” resembles “Pearls to a swine,” but is pretty different in meaning.   Are there similar figurative expressions to describe a person who has deaf ears to others' advice and opinion, like an obstinate or insensitive horse?


I was recently awarded the . I tried searching for more information on this badge, but I still do not understand why I have been awarded this badge? Can someone explain how I received this badge?  On the badge page, it says this for the Explainer badge:     Edited and answered 1 question (both actions within 12 hours, answer   score > 0).

The difference between a poor or meh question and a stellar question can often simply be someone understanding it and providing it a great answer. I can't begin to count the number of times I've justified re-opening a question as a moderator by saying:     Look at the answer it got, though. This isn't something we want deleted, this is something we want fixed, because it's obviously valuable. Someone with domain knowledge can easily edit that question based on the answer it received.   This doesn't only apply to borderline-poor or poor questions – sometimes a good edit means the difference between 100 and 10,000 people finding something through typing things into Google. Good titles are hard.   We think we've come up with a way to provide incentive for good, opportunistic edits to happen more often, ideally without questions needing to go through closure or collecting a centimeter of dust before they do. What if we simply rewarded folks that answered and edited questions with a special, relatively difficult to earn badge?  Let's say that you answer something, and:   You edit the question 12 hours before or after answering it. This allows you to edit now, answer later — or answer now and edit later, when you have the time. Your edit isn't rolled back, or outright rejected if it was a suggested edit The question is not closed for any reason, even simply being a duplicate Your answer has a score of 1 or higher   … then you've done something that we probably want to recognize. You understood something, you provided the knowledge that you have, and then you provided an edit to make sure that more people in need of this knowledge can find it, while raising the overall quality of the site.  Here's the proposed tiers for the badge (within the above stated criteria):   Explainer (Bronze): Answered & edited 10  questions Refiner (Silver): Answered & edited 50 questions Illuminator (Gold): Answered & edited 500 questions   We think this is going to be pretty hard to game. You can't go leaving streaks of terse snark all over the place on questions you know are going to be closed anyway, and junk edits aren't going to fly.  We're talking about rewarding folks that take a tiny bit more time out of their day just to write a more descriptive title so that folks can find the awesome answer that they wrote. Just doing that alone can make a big difference. Sure, it's a tad hard to get at the gold level, but it's supposed to be. If you routinely edit questions that you answer and have done so for some time, you'd probably get it the day we roll it out.  While this is technically something that we came up with on the quality initiative ( | ) — this badge could be earned on all of our sites.  What do you think? What did we miss? What could be better about the idea?


I receive the follwing error:      java.lang.NullPointerException: Attempt to invoke interface method    android.os.Bundle com.android.vending.billing.IInAppBillingService.getSkuDetails(int, java.lang.String, java.lang.String, android.os.Bundle) on a null object reference   when I'm clicking my button:   skuDetails = billingService.getSkuDetails(3, "com.android.vending.billing", "inapp", querySkus);   All parameters have not null values, but in the same time i got such error.  And full code is below:  connection = new ServiceConnection() {     @Override     public void onServiceDisconnected(ComponentName name) {         billingService = null;         }          @Override         public void onServiceConnected(ComponentName name, IBinder service) {             billingService = IInAppBillingService.Stub.asInterface(service);          }     };      Intent intent = new Intent("com.android.vending.billing.IInAppBillingService.BIND");     intent.setPackage("com.android.vending.billing");     getBaseContext().bindService(intent, connection, Context.BIND_AUTO_CREATE);  buyButton.setOnClickListener(new View.OnClickListener() {          @Override         public void onClick(View v) {             ArrayList<String> skuList = new ArrayList<String>();             skuList.add(ITEM_SKU);             Bundle querySkus = new Bundle();             querySkus.putStringArrayList("ITEM_ID_LIST", skuList);              Log.e(TAG, "onClick: " + querySkus.getStringArrayList("ITEM_ID_LIST"));                Bundle skuDetails = null;             try {                 skuDetails = billingService.getSkuDetails(3,                         "com.android.vending.billing",                         "inapp", querySkus);                             int response = skuDetails.getInt("RESPONSE_CODE");                 if (response == 0) {                      ArrayList<String> responseList = skuDetails                             .getStringArrayList("DETAILS_LIST");                      for (String thisResponse : responseList) {                         JSONObject object = new JSONObject(thisResponse);                         String sku = object.getString("productId");                         String price = object.getString("price");                         if (sku.equals(ITEM_SKU)) {                             System.out.println("price " + price);                             Bundle buyIntentBundle = billingService                                     .getBuyIntent(3, getPackageName(), sku,                                             "inapp",                                             base64EncodedPublicKey);                             PendingIntent pendingIntent = buyIntentBundle                                     .getParcelable("BUY_INTENT");                             startIntentSenderForResult(                                     pendingIntent.getIntentSender(), 1001,                                     new Intent(), Integer.valueOf(0),                                     Integer.valueOf(0), Integer.valueOf(0));                         }                     }                 }             } catch (RemoteException e) {                 // TODO Auto-generated catch block                 e.printStackTrace();             } catch (JSONException e) {                 // TODO Auto-generated catch block                 e.printStackTrace();             } catch (IntentSender.SendIntentException e) {                 // TODO Auto-generated catch block                 e.printStackTrace();             }          }     });

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


I've been trying to prove that if I have $A=[a_{ij}]_{n \times n}$ therefore, if;    Then the matrix is invertible.  Can anyone help me and give me some vocabulary (If I'm not wrong, there is a name for this type of matrix, isn't there?)

I try to find a good proof for invertibility of strictly diagonally dominant matrices (defined by $|m_{ii}|>\sum_{j\ne i}|m_{ij}|$).  There is a proof of this in  but I'm wondering whether there are are better proof such as using determinant, etc to show that the matrix is non singular.


I sometime wants to copy paste a list to a StackExchange question or answer:  Connect to the remote computer with IP address and password. Once connected, press function key F8 and click "Options" Click "Load / Save" Click "Save As" Choose a name which suits you and click "Save" At the VNC Viewer : Warning about storing the password, click "Yes".   and I need to add the - at the beginning of each item of the list:  - Connect to the remote computer with IP address and password. - Once connected, press function key F8 and click "Options" - Click "Load / Save" - Click "Save As" - Choose a name which suits you and click "Save" - At the VNC Viewer : Warning about storing the password, click "Yes".   Is there any way (button/shortcut/etc.) to do this at once?

Let's say I write up a bunch of rows and decide I want to make it a list:  Item 1 Another Item Something Else   When I mark each line and click the "List" button (doesn't matter which one), the Editor takes all three rows and makes one list item out of them, ignoring the line-breaks.  The output will simply be:  - Item 1 Another Item Something Else   It would be far more useful and less buggy if it would instead create one list item for each line:  - Item 1 - Another Item - Something Else


I am on a Mac running Yosemite 10.10.4 and every time I start terminal or open a new terminal tab I am inside of an actively running php process.  I must Ctrl+C before I can do anything else.  I don’t see any Mac terminal options that is automatically starting this process.  I have Homebrew installed and I’m using a LEMP stack, so I’m not sure if there is some misconfiguration there? I’ve searched everywhere, tried running brew doctor and brew update, but everything is ready to brew and up to date.     Here is my terminal output when starting a new session:   Last login: Thu Aug 20 13:31:52 on ttys000  ^C  MacBook-Pro:~ adam2k$   And my php version:   MacBook-Pro:~ adam2k$ php -v  PHP 5.6.6 (cli) (built: Mar  5 2015 19:48:00) (DEBUG)  Copyright (c) 1997-2015 The PHP Group  Zend Engine v2.6.0, Copyright (c) 1998-2015 Zend Technologies  MacBook-Pro:~ adam2k$

When open terminal, it always shows -bash: Searching: command not found. It does not affect other functions, just each time, even though  open a new terminal window, it still pops up at the top of the window: -bash: Searching: command not found.   How to not display the -bash: Searching: command not found or stop it keep searching?   Screen as below:   Last login: Mon Feb 23 14:11:40 on ttys001  -bash: Searching: command not found -bash: Searching: command not found  Caroline-MacBook-Air:~ Caroline$ echo $PATH /usr/local/heroku/bin:/Users/Caroline/.rbenv/shims:/Users/Caroline/.rbenv/shims:/usr/local/bin:/usr/bin:/bin:/usr/sbin:/sbin


I'm working through , trying to set up a django app on an ubuntu 16.04 VPS. I've followed the directions on setting up an nginx config file. Following the directions I have set up a basic nginx config file and put in in /etc/nginx/sites-available/tester. Now I'm trying to symlink it to /etc/nginx/sites-available/  deploy@server:/etc/nginx/sites-available$ sudo ln -s tester /etc/nginx/sites-enabled/tester   But I'm suspecting that Something is wrong because the link looks different than the default link.  Also after reloading Nginx with:  sudo systemctl reload nginx   The site did not work. I checked :  sudo nginx -T   but don't see the config file. What am I doing wrong. What do the colours mean?

What do the different colours in Ubuntu's ls command mean? For example, when I type the ls command in one of my folders, I get one of the files in light green, the other (which is a folder) in blue with green highlighting.   What do those colours mean, and there is any manual about all the colours?


I am using Ubuntu 15.10 and I had a file name __app.zip and I was wanting to move that inside the folder name testing  To move the file i used the following command after which I cant find the file anymore, from searching online I understand now that i did not need to put / before the folder name.  sudo mv __apps.zip /testing   Is there anyway to get the lost file back?

I had a directory with a file and another empty directory in it like this:  . .. file.ext folder   I did:  mv file.ext /folder   The file disappeared now, not in folder too not where it was before!   Anyway to find it back?   Thanks


I have an option to refresh this DIV after click a button inside that DIV

Edit Language

         <?php         DoThisFunction($link);         ?>

   I've also created a simple function to refresh the div:     Everything inside that DIV is PHP generated. The function works very well and refresh that DIV with the updated function.  I have 2 problems:   After the first refresh, any buttons inside that div doesn't work. Basically, I click a button that does a task (for example activate ID X). It processes everything fine and refresh that div and show as active. If I click the button again (to disable), it doesn't do anything. (Please note those actions are made with sweetalert and jquery calls). How can I make an universal function so I can call it everytime I need to refresh a div (like using updateDIV("#DIVNAMEHERE"))?   Thanks in advance.  Edit: My code that get the buttons click is:  $("button").click(function() { let button = $(this); // the button you clicked let id = button.data("id"); // the data-id attribute of the button let func = button.data("function"); if(func == "publish"){     Publish(id); } });

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I am on a XP Professional PC, I only have a administrator account for which I forgot the password. How can I fix this login issue?  I cannot format because I have important data on the system. Steps I tried after googling is from safe mode, logging in with a blank password with administrator account. Let me remind I only have a administrator account, no guest account nor a child account.

I have forgotten the Administrator password of my Windows XP installation and locked out. Is there a way to reset it? I do have physical access to the PC.


I've a time series, 100 observations. I'm following the the Box-Jenkins method in order to find a model that fit the data. My questions (I'm a bit confused):   if I plot in a graph time vs observation how can I say if the series is stationary just looking the graph? I can use an AR, MA or ARMA model only if the series is stationary. Why? If the ACF and the PACF "say" that the process is an AR or MA this implies that the series is stationary? If yes, why? Can I tell if a series is stationary looking at the ACF and the PACF? Which are the methods to check if a series is stationary?

I am using R, I searched on Google and learnt that kpss.test(), PP.test(), and adf.test() are used to know about stationarity of time series.  But I am not a statistician, who can interpret their results  > PP.test(x)       Phillips-Perron Unit Root Test data:  x  Dickey-Fuller = -30.649, Truncation lag parameter = 7, p-value = 0.01  > kpss.test(b$V1)    KPSS Test for Level Stationarity   data:  b$V1    KPSS Level = 0.0333, Truncation lag parameter = 3, p-value = 0.1  Warning message: In kpss.test(b$V1) : p-value greater than printed p-value > adf.test(x)      Augmented Dickey-Fuller Test  data:  x  Dickey-Fuller = -9.6825, Lag order = 9, p-value = 0.01 alternative hypothesis: stationary  Warning message: In adf.test(x) : p-value smaller than printed p-value   I am dealing with thousands of time series, kindly me tell how to check quantitatively about stationarity of time series.


I am re-opening  question as i have the following question. I was going through the  which was mentioned in an answer in that post. Initially i beleived that the follwoing problem is NP-Complete.  Suppose there is a graph $G=(V,E)$. I want to test if V can be partitioned into two disjoint sets $V_1$ and $V_2$ such that the subgraphs induced by $V_1$ and $V_2$ are unit interval graphs.  But in the paper,there is a theorem which says      Let $A$ and $B$ be additive induced-hereditary properties. Then there   is a polynomial-time transformation from the $A$-recognition problem   to the $(A◦B)$-recognition problem.   So, my question is that :- is it possible that because of the above theorem the problem might be solvable in polynomial time ??

Suppose there is a graph $G=(V,E)$. I want to test if $V$ can be partitioned into two disjoint sets $V_1$ and $V_2$ such that the subgraphs induced by $V_1$ and $V_2$ are unit interval graphs.  I know about the NP-completeness of determining interval numbers but the above problem is different. Now, in the literature I found  work by A. Gyárfás and D. West on multitrack interval graphs but I'm not sure if it is relevant to above problem.  Any citation to existing literature on the above or similar problem would be helpful. Also please let me know if there is a formal name for the above problem.


I've read an article recently which has the title "Intel To Release Most Powerful Mainstream Processor Ever To Beat AMD" (). I feel something is missed between "Intel" & "To". So the question what does "Intel To Release" mean and what's the name of this kind of construction.

As we all know "to be continued" refers to the future. However for some reason (I don't know why) we do not use "to be going to + verb" for this.     Sarah to take to the stage tonight   What does this usage mean? Why we don't use "is going to" ?


As I stated above I am wondering if I can claim my school expenses on my taxes for this year's taxes. If it is possible how would I do so and will I get a better return because of it? I am in the United States.

I work as a Computer Programmer for a Healthcare Company. I am in the process of applying for Part Time - Master's Graduation Program in Healthcare.  I wonder whether i would be able to get Tax Deduction for the expenses incurred in Master's Graduation.  I live and work in NJ, Most likely, I would be admitted for the program in NYC.


The setting:  Imagine the scenario where I am searching for something and once I find it I identify it, then afterwards when I no longer need it I discard it. If at some point I need to identify it again I perform the search again and will succeed since it's still there.  The problem:  The noun for the process of identifying something would most likely be "identification".  I'm pretty sure the word "discardation" is not an actual word, and "discard" or "discardure" just leaves me wanting for something less overlapping and more commonly used.  The Question:  What would be a nice noun to describe the process of "discarding" something temporarily.  Looking at the thesaurus words like: remove, reject, cancel, reject, relinquish and the like come into play but I feel like those words have a more dramatic impact imposed behind them than I would like to portray. Something similar to dislocate perhaps, with an intention to remove. Disconnect seems like a good option yet I feel like I would have to change identify to connect if I choose to do so.

"To delete" is to "deletion" as "to discard" is to what?


I'm new to Java and is trying to learn the concept of Maps.   I have came up with the code below. However, I want to print out the "key String" and "value String" at the same time.   ProcessBuilder pb1 = new ProcessBuilder(); Map<String, String> mss1 = pb1.environment(); System.out.println(mss1.size());  for (String key: mss1.keySet()){     System.out.println(key); }   I could only find method that print only the "key String".

If I have an object implementing the Map interface in Java and I wish to iterate over every pair contained within it,  what is the most efficient way of going through the map?  Will the ordering of elements depend on the specific map implementation that I have for the interface?


Why would the put option price go down when the stock goes down?  3/19 $20 strike down 30% when gme stock down $50. Can someone explain why the put isn’t gaining value?

Earlier today, I purchased 2 put options on GME. The opening price was around $295. The price dropped $30 in 45 minutes to below $265. Why am I not making any money? I looked at all of the put option contract prices and all of them say a loss of 10% today. Please explain.


How can I turn std::string str = "My String\nhas multiple\nlines in it.";  into a std::vector<std::string> that looks like {"My String", "has multiple", "lines in it."};  This post here  only seems to work for spaces, not new lines.

Java has a convenient split method:  String str = "The quick brown fox"; String[] results = str.split(" ");   Is there an easy way to do this in C++?


I sometimes need to run a script for hours at a time, during which some commands need sudo. However, if I don't check and reenter the sudo password periodically, I get the sudo: timed out reading password error which sometimes breaks the whole thing. I don't want to use sudo myscript.sh since some of the commands should be run without sudo. I'd like the sudo cached password to persist for the script for the whole duration of the script without changing the rest of the system (sudo persistence only for this 1 script). Is there a way to make sudo last for the whole duration of the script and only for the 1 script?

Let's say, I have the following bash script:  #!/bin/bash sudo command1 command2 sudo command3   I don't want to run command2 as root, so I won't run the script itself with sudo. Therefore, as soon as I execute the script, sudo command1 asks for my password. Unfortunately, command2 takes about 2 hours to complete. So the sudo credentials timestamp timed out and when the script reaches sudo command3, I'm prompted for the password again.  I don't want to permanently disable the sudo credentials timestamp timeout altogether as described in  for example. I just want to disable the timeout temporarily, effectively keep the credentials for this one bash session until it ends.


I'm working on a code which prints an array of locations, either in ascending or descending order. However, the formatting is all wrong for two out of 12 locations.   Code:  import java.util.*; import static java.lang.System.*; import java.net.URL; import java.net.MalformedURLException; import java.io.*; class airwaysReservation {     static Scanner sc = new Scanner(System.in);     static String src[] = {"Mumbai", "London", "Hiroshima", "Lagos", "Minsk", "Baghdad", "Istanbul", "Delhi", "Fez", "Beijing", "Taipei", "Havana"};     static String dest[] = {"Hyderabad", "Paris", "Athens", "Alexandria", "Seoul", "Hamburg", "Bengaluru", "Rome", "Montreal", "Saitama", "Philadelphia", "Pune"};     public static void sortAsc(String arr[]) {         Arrays.sort(arr);     }     public static void sortDesc(String arr[]) {         //using libraries java.util.Arrays, and java.util.Collections, sorts arrays         Arrays.sort(arr, Collections.reverseOrder());     }     public static void list() {         out.println("Sources \t Destinations");         for (int i = 0; i< 12; i++) {             out.println(src[i] + "\t \t  " + dest[i]);         }     }     public static void main(String[] args) {         out.println("Welcome \n Would you like to see the sources in ascending, or descending order?");         // stores ascending or descending for later         char schoice = sc.next().charAt(0);         out.println("Would you like to view the destinations in ascending, or descending order?");         // stores ascending or descending for later         char dchoice = sc.next().charAt(0);         switch (schoice) {             case 'a' :              sortAsc(src);             break;             case 'd' :             sortDesc(src);             break;             default:             out.println("Invalid choice");         }         switch (dchoice) {             case 'a' :             sortAsc(dest);             break;             case 'd' :             sortDesc(dest);             break;             default:             out.println("Invalid choice");         }         list();     } }   The output for this, choosing ascending and then descending comes out to be:  Sources      Destinations Baghdad       Seoul Beijing       Saitama Delhi         Rome Fez       Pune Havana        Philadelphia Hiroshima         Paris Istanbul          Montreal Lagos         Hyderabad London        Hamburg Minsk         Bengaluru Mumbai        Athens Taipei        Alexandria   I have a feeling this issue is because of different word lengths, however, that doesn't seem to affect the last few lines (eg Minsk and Bengaluru). How would I go about making all the destinations start from the same vertical line? Any help will be appreciated, thanks!

Is there some easy way to pad Strings in Java?  Seems like something that should be in some StringUtil-like API, but I can't find anything that does this.


As of July 2019, how many Indian players have been inducted in the ICC hall of fame?    In this sentence, is the month of July included or not?

I'd appreciate your assistance in helping me particularly understand how to use the phrase "as of" properly.   What is the proper interpretation of the following sentence?  "I need you to get me all transactions as of January 23rd"   That I need all transactions from the beginning of time (so to speak) till January 23rd, or That I need all transactions from January 23rd to now?   Would "as at" be more appropriate to express (1)?  Would "as from" be more appropriate to express (2)?


What happens if I have  but I use 's ability. Would Paradox Engine’s ability activate?

If I have  copy an artifact but I have , would Paradox Engine’s abilities activate every time I copy?


I am an Iranian and traveling to Oslo (Norway) from Tehran (Iran) by British Airways via London Heathrow Airport. Do I need a Transit Visa?

Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.


when I was first introduced to entanglement I was told that "it is a phenomena that allows information to be transmitted faster than light", however, as I kept reading up on it, this seemed to be an oversimplified model to the extent of inaccuracy. I now find that there is a rule that says information cannot be transmitted this way... why? I understand that transmitting information via entanglement breaks relativity (in the sense that it means information can be transmitted then light). But surely things like the information loss paradox etc. have counter intuitive names if no information can actual be gained from these mechanisms. So, is there an intuitive way of explaining why no information can be transmitted this way (or if it can), other than it breaks down other theories.?

It is often stated, particularly in popular physics articles and videos, that if one measures a particle A that is entangled with some other particle B, then this measurement will immediately affect the state of the entangled partner.  For example, if Alice and Bob share an entangled pair of electrons and Alice measures her spin in the $x$ direction, then Bob's spin will also end up spinning in that direction, and similarly if she measures in the $z$ direction. Moreover, the effect will be instantaneous, regardless of the spatial distance between the two particles, which seems at odds with special relativity.  Can I use a scheme like this to communicate faster than light?


Is there any way to compile ASP.NET Web Site and make it impossible to decompile (reverse engeenering)?  I wrote my own big project in Visual Studio, I want to compile it and sell to the buyer. But I don't want buyer to see/modify the source code in any way. I'm worried because even though I published (compiled) it with "allow this pre-compilled web site to be updatable" unchecked, I heard about something like Reflector and ways to get the source from binaries.  Is there any way to make it impossible? It's all about piracy prevention - I added fixed line of code that makes the website working only on ONE particular domain like XXXXXXX.XXX (typed in the code). But I'm worried that it can be decompiled and this line can be removed.  Thanks

Obfuscation is one way, but it can't protect from breaking the piracy protection security of the application. How do I make sure that the application is not tampered with, and how do I make sure that the registration mechanism can't be reverse engineered?  Also it is possible to convert a C# application to native code, and  is too costly.  C# provides lot of features, and is the ideal language for my code, so writing the whole codebase again in C++ is out of the question.  Secure certificates can be easily removed from the signed assemblies in .NET.


so I as a Blender newbie is trying to model a hollow building. I was wondering if there's any easy way to turn this flat plain surface into an actual wall with thickness. The challenge is that it has window gaps, the wall is slanted outwards and that the walls are part of an octogon. How do I model an evenly thick wall from this here?

I'm using blender to make a basic model of my house and I want to hollow out the inside of the house so that the walls are slightly thicker and there are normals facing both ways, I'm not really sure how to can achieve this. I think it's called shelling?    Also, has anyone got any tips on working on the interior of buildings, because I find it nearly impossible to do so :/


So again i'm used to Crypto Currencies, and since im stupid i learn most things from threads from /biz/ (fortunately i still take decisions based on myself), i've seen plenty on lingo like a bull means a person who bought shares and is intending to sell them at a higher price or someone who has a long option(or a call), a bear is someone who borrowed someones shares sold them immediately and is intending to buy them back again for a lower price receiving the difference meaning a short(or a put). But how does one make money from the market not fluctuating a lot, or ending up in the same value as bought assuming this is what they refer by "crab market". Is it buying at a certain low point and then selling at a high point and repeating it multiple times and if so how can this be done automatically without constantly setting new lines? what if the stock literally doesn't fluctuate: ie there's no offers on the stock and theres no transactions or trading

If I believe a stock will go up, I buy the stock. If I believe a stock will go down, I short the stock. If I believe a stock will neither go up nor down, what do I do? How do I profit from a non-movement in stock price? I think I might be able to profit by selling a naked put and a naked call option with a strike price equal to the current stock price. Is this a valid method? Are there other methods?


Juvenile Sci-Fi novel, at least 30 years old, trying to resurrect based on a fond memory.  An Earthman, hitman I believe, is captured by an alien. The hitman sneaks "tapes" for machine based learning (card playing, martial arts, operation of alien machines eg Mark V hovercar?), outsmarting the unsuspecting alien while becoming incredibly intelligent.  He then goes to the stars and some mayhem ensues. Ending involves him determining that his "helper" is a previously kindapped (Neanderthal) Earthling, finding out that he had unknowingly split his intelligence into two halves, and reuniting both halves of his intellect.   Any ideas? Google was not helpful despite numerous attempts. Thanks!

I am trying to remember a novel I half read as a teen (1984-1986), I borrowed it from the library but had to take it back before finishing.  I believe it was in an omnibus/ compilation edition book with two or three SciFi stories by different authors.  The plot was an alien studying the mental capacity and ESP of the human race.  The alien abducts a low level criminal/ wise guy from America and takes him to a base in the Arctic (perhaps) for study.  He is subjected to a number of physical and mental tests to find out how dangerous or powerful the human race could become.  I got as far as the criminal overpowering the alien and escaping in his spaceship to explore the galaxy.  Unique things I remember;   The human is put in an exo-skeleton to test and improve his flexibility. The human manages to fool the alien ESP testing/ training equipment.   Escapes his cell at night to use it unsupervised to increase his ESP powers in order to gain the upperhand.  In his travel through the galaxy he meets a insectoid race, (butterfly like? or maybe bat)   The insectoid is amazed humans still dream, when he gets telepathically pulled into a dream the main character is having.  ESP powers the main character gains includes matter translation, like turning wood into a steak or hamburger. The main character doesn't understand the risks of overuse of ESP powers.


In the salesforce there is a function Crypto.sign() that computes a unique digital signature for the input string, using the specified algorithm and the supplied private key.  What I want to do is the reverse , I mean that I want to check if the signature is authentic. So if I have a public key and the signed data , how can I do to check the authenticity ?

The apex crypto class is great but it appears to only be able to sign content. Is there any way to verify a signature in apex? I would expect a Crypto.verify() method but it doesn't appear to exist. I have some device which will be shipping me back a configuration file containing a signature and public key and I'm at a loss on how to successfully verify this. Was planning on using the SHA1 algorithm.   Has anyone dealt with this before?


I have polje[i]=rand()%30+1; for random between 1-30, but how can I make it so it's between 10 and 30?

I need to generate random numbers within a specified interval, [max;min].  Also, the random numbers should be uniformly distributed over the interval, not located to a particular point.  Currenly I am generating as:  for(int i=0; i<6; i++) {     DWORD random = rand()%(max-min+1) + min; }   From my tests, random numbers are generated around one point only.  Example min = 3604607; max = 7654607;   Random numbers generated:  3631594 3609293 3630000 3628441 3636376 3621404   From answers below: OK, RAND_MAX is 32767. I am on C++ Windows platform. Is there any other method to generate random numbers with a uniform distribution?


I am trying to bind a jquery function using a loop. The problem is that the function that gets bound always takes the value of the last item of the list.  Here is a simplified version of the code:  var obj = {     '.a':'1',     '.b':'2',     '#c':'3' }; for (var prop in obj) {     if (obj.hasOwnProperty(prop))     {         alert(prop + '=' + obj[prop]);         $(prop).on('click', function () {             alert(prop + '=' + obj[prop]);             ga('send', 'event', 'link', 'click', obj[prop]);         });     } }   The ga() function is simulated as follows:  function ga(one, two, three, four, five) {     alert('simulated GA(): one=' + one + ' two=' + two + ' three=' + three + ' four=' + four + ' five=' + five); }   The outer alert fires when the javascript is initialized and shows the values of all of the object properties as expected. But when the DOM element is clicked on, the inner alert and the ga() function shows the value of the last property #c, no matter which DOM element is clicked.  The purpose of this code is to assign various calls to ga() to different DOM objects identified by the properties which are selectors.  I am thinking there is something simple and stupid that I am missing here.

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


I am using VirtualBox. I installed a ubuntu system on it. At the beginning, I set default 8GB disk space. But it's not big enough so I want to add more space on it.  I used this way(add to 20GB):  VBoxManage modifyhd my_ubuntu.vdi --resize 20000   After I restart my ubuntu, I run these commands in the terminal:  $ df -h Filesystem      Size  Used Avail Use% Mounted on udev            1.3G     0  1.3G   0% /dev tmpfs           256M  4.4M  251M   2% /run /dev/sda1       5.3G  5.0G     0 100% / tmpfs           1.3G  224K  1.3G   1% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           1.3G     0  1.3G   0% /sys/fs/cgroup tmpfs           256M   48K  256M   1% /run/user/1000  $ lsblk NAME   MAJ:MIN RM  SIZE RO TYPE MOUNTPOINT sda      8:0    0 19.5G  0 disk  ├─sda1   8:1    0  5.5G  0 part / ├─sda2   8:2    0    1K  0 part  └─sda5   8:5    0  2.6G  0 part [SWAP] sr0     11:0    1 55.5M  0 rom   Why can't I see the addition space under df -h command? But can see it by using lsblk? And, is it really that my system is 20GB available and useful now?

I have a VMware Player virtual machine setup, running Ubuntu 10.04 as the a guest OS.  The VM was created on a 20GB virtual drive, with a single partition for working space. Finally I got to the point where I need to expand the size of the virtual drive. Resizing the drive itself, adding some 10GB, was easy via the VMware Player menus. I now need to resize the main partition itself (I prefer this over creating a separate partition and mounting it).  According to GParted, I now have the following partitions:    My question is, how can I increase the size of the Filesystem partition to include the free 10GB?  From information I found online, it looks like one limitation is the fact that he swap partition is immediately adjacent to the filesystem, so my understanding is that first thing would be to move that partition to the end of the volume. How can this be done?  Also, some sources suggest that the system should be booted from a LiveCD, so the filesystem is not the boot partition, and thus make it easier to resize. As mentioned above, I run a VM, so I am not sure how to boot it from a LiveCD. Any ideas?


First of all let me point out that I am aware of all the theory behind asymmetric encryption and signing, and other related areas like signcryption, etc. It seems that mathematically it is possible to do what title suggests, however there is not a single working example of how to do it in practice, if possible at all.  I want to ENCRYPT the message/data with a private RSA key (signing it won't suffice) and save it to a file.  An application will open that file and decrypt the message with a public RSA key. To point out, anyone can have the public key. This is not a concern in this case.  I want to make it impossible to SEE the message content that is not created by the holder of private key. Signing the message with RSA private key is not acceptable (or signing with a symmetric key and then encrypting the key) because the message content is READABLE but only a subject to validation. Circumventing the authentication validation could be as trivial as a single call patching.  Is there a single working example (that is potentially not ruining the algorithm) of encrypting the message with a private and decrypting the message with a public key. As a side note: it would be great if this would be doable in dotnet.  Thank you very much in advance.

When using the RSA cryptosystem, does it still work if you instead encrypt with the private key and decrypt with the public key? What about in the case of using RSA for sender authentication?


Right after running  to rebuild all indexes and statistics, I cleared the data and plan cache and ran a very complex ugly query to get a baseline of it's performance. The query actual plan shows ReasonForEarlyTermination=Timeout and skews for Est Rows and Actual Rows (actual rows factor 10,000 compared to est.).   I wonder if this imbalance of the number of rows maybe a result of the Timeout - I thought it should be appropriate after the index & statistics rebuilding?  Does optimizing queries that end with ReasonForEarlyTermination=Timeout make any sense at all, if it's impossible to change the query itself? Since I planned to do some index tuning and re-running the query, isn't it impossible to be sure about the results of the possible improvements, because the next query plan creation will certainly timeout again and so might be different, with different results?  Tec. Details: Sql Server 2008 R2 Dev. Ed. 10.50.6000.34 DB Comp. Lvl 80.

I have a SQL Server 2012 database. I noticed value of Reason for early termination of statement optimization for some queries and all gave Good Enough Plan Found. Now my questions are:   What are all the possible types of  “Reason for early termination of statement optimization”. I did searching for this in msdn but didn’t get a complete list of values. Is there a DMV or extended event to list all queries for which optimization was terminated due to reasons other than Good Enough Plan Found? I referred following two articles which does not list the complete list of possibilities. [Also, they give me different result in my database].


I would like to use the endnotes package, hyperref and biblatex together to have links to my endnotes. Here is a MWE that shows how the links don't show up:  \begin{filecontents}{testbib.bib} @Book{jones00,   author =   {Douglas Jones},   title =    {A book},   publisher =    {The metasyntactic variable publishing company},   year =     2000} \end{filecontents}  \documentclass{article} \usepackage{endnotes} \usepackage[autocite=footnote,notetype=endonly,style=verbose-trad1]{biblatex} \bibliography{testbib} \let\footnote\endnote \usepackage{hyperref} \begin{document} Something\autocite[p.12]{jones00} something else\footnote{another endnote?}  \theendnotes \end{document}   I'm open to other end-note producing options that work better with hyperref, but I'd rather stick with article document class.

I'm using endnotes package to create endnotes, and since my existing body of text already contains lots of footnotes, I use \let\footnote=\endnote to convert footnotes into endnotes.       \documentclass{article}     \usepackage{endnotes}     \usepackage{hyperref}     \let\footnote=\endnote     \begin{document}     Sample text.\footnote{Sample footnote}.     \theendnotes     \end{document}   But while the original footnotes were nicely cross-referenced, the conversion doesn't preserve that. Is there a way to make a conversion while preserving the cross-referencing?


It says:  /dev/sda1: UNEXPECTED INCONSISTENCY; RUN fsck MANUALLY. (i.e., without -a or -p options) _  Then it only stays like that, I can't even type something to FIX it. What can I do because it doesn't show any prompt so that I can solve the problem. How can get the prompt.

I dual boot Ubuntu and Windows 7. I was browsing on FireFox in Ubuntu and all of a sudden I get some error message, so I rebooted.  Now when I try to boot into Ubuntu I get this message:  fsck from util-linux 2.26.2 /dev/sda6 contains a file system with errors, check forced. /dev/sda6: Inodes that were part of a corrupted orphan linked list found.  /dev/sda6: UNEXPECTED INCONSISTENCY; RUN fsck MANUALLY.         (i.e., without -a or -p options) fsck exited with status code 4 The root filesystem on /dev/sda6 requires a manual fsck  Busybox v1.22.1 (Ubuntu 1:1.22.0-15ubuntu1) built in shell (ash) Enter 'help' for a list of built-in commands.  (initramfs) _   How can I fix this?