Without Cauchy Integral Formula or Residues: $\int_{L}\frac{dz}{z^{2}+1}$

I am currently working on the following:  Prove that $\displaystyle \int_{L}\frac{dz}{z^{2}+1} = 0$ if $L$ is any closed rectifiable simple curve on the outside of the unit disc, i.e., $L$ is contained in the region $|z|>1$. Show that the equality is in general false for arbitrary closed rectifiable simple curves that miss zeros of $z^{2}+1$.  Partial fraction decomposition yields that our integrand is not analytic at $z = \pm i$ (surprise, surprise):  $\displaystyle \int_{L} \frac{dz}{z^{2}+1} = \int_{L} \left( \frac{i}{2(z+i)} - \frac{i}{2(z-i)}\right)dz$.  Now, FYI, I am not allowed to use Cauchy's Integral Formula or Residues to solve this problem. Please do not post answers using either of those two methods, as they are useless to me.  I'm thinking that for the first part, Cauchy's Theorem would work, although Cauchy's Theorem requires the function to be analytic in a simply connected domain. I think that a simply closed rectifiable curve on a region of $\mathbb{C}$ where the function is analytic would form a simply connected domain, but I'm not sure. Update: I am having the hardest time with this part of the problem. I asked my professor, he said the $|z|>1$ allows us to use Cauchy's Theorem for multiple contours. But, I'm not sure how that would work, since we can't draw circles around each of the singularities, because neither of them are in the region. This is the part I would most appreciate an answer for   For the second part, I'm not entirely sure what is being asked. When they say "miss zeros of $z^{2}+1$", do they mean curves around such zeros? Or do they mean curves that don't go anywhere near them? I'm a bit confused. Update: I now understand this part  Please help.


Do bullywugs take 1d6 damage and fall prone every time they high jump?

The PHB and basic rules state about :     At the end of a fall, a creature takes 1d6 bludgeoning damage for every 10 feet it fell, to a maximum of 20d6. The creature lands prone, unless it avoids taking damage from the fall.   The 's statblock (MM, p. 35) mentions:     Standing Leap. The bullywug’s long jump is up to 20 feet and its high jump is up to 10 feet, with or without a running start.   So if a bullywug high-jumps as high as it can, would it take 1d6 damage and fall prone?


Distinct digits in a combination of 6 digits

How many 6-digit numbers contain exactly 4 different digits?  My approach is: For any 3 digis same and the remaining 3 different(aaabcd)  4*9*8*7*6  For any 2 duplicate digits(aabb) and the remaining 2 different (aabbcd)  9*8*7*6*3  But I don't know how to add cases where there can be 0's can be as any digit but not the initial ones.  Can someone please help me if there is any simpler approach?


Prove the inequality involving multiple integrals

Please, help me to prove that:  $$ \int_Q  \int  \frac{dxdy}{x^{-1} + |\ln y| - 1} \leq 1,$$ where   $$ Q =  [0; 1]  \times  [0; 1] $$ Any ideas how to start. Thank you.


How to research what resources are leaked by which application (not a full ATOM table issue)

Some application on my system is leaking resources. But I don't know what it is leaking and which application.  The leak causes other applications to fail with error messages like this:     System Error. Code: 8. Not enough storage is available to process this command.   What tools and/or steps can I use to find out which application is leaking and what it is leaking?  note: I have   40% of memory free (of a total of 8 gigabytes) 15 gigabytes space free on the boot/system SSD drive all the rights I need (can be Admin when needed) a Windows 7 development workstation (with things like Visual Studio 2013, Delphi 2007, PL/SQL Developer 9, Office 2013, McAfee 8, IE 11, Chrome 44, Cisco Jabber) some developed applications and services running (but not many) Our Delphi services and applications run with FastMM in full debug mode and don't show memory leaks. about 200 string ATOMS in use (see dump at ) so it's not a full ATOM table issue. It was ATOMS, but while refactoring the code by  and  I accidentally killed very odd atoms in  which I will answer below. standard Windows 7 heaps with a large Desktop heap: SharedSection=1024,20480,768  it is not the RegisterWindowsMessages either: about 1000 of them in total:  it isn't a window handle count either, as Testlimit -u can happily allocate 10k USER handles:    Since it could just as well be one of our own developed applications, I ask it here instead of superuser/serverfault. We don't get this on our servers though.    Since I can't answer, here is the elaboration:  The tooling in the "non-duplicate" answer can't pinpoint the source for various reasons:   they call Windows API functions with wrong data they presume Thread IDs are the same as Process IDs they contain very limited source code (the most interesting UI application is lacking) the binaries of the incomplete source code don't function well using truckloads of CPU and not responding to the UI after initial clicks the source does not explain what they do and why they do it   I'm in the midst of combining those pieces of code and refactoring it to a useful console application that:   shows Atoms and Registered Windows messages indicates by which Application  shows percentage used can better estimate what ATOMS to free   That way, dumping the output over time and correlating the diffs it might be possible to zoom in to the offending problem.  The offending ATOM leaks look like this:  Atom 0xD8F8 with name "-%D4#!`````(W!```````@W#````````" Atom 0xD8F9 with name "-%D4#!`````HT!```````@W#````````" Atom 0xD8FA with name "-%D4#!`````+R!```````@W#````````" Atom 0xD8FB with name "-%D4#!`````3P!```````@W#````````" Atom 0xD8FC with name "-%D4#!`````*S!```````@W#````````" Atom 0xD8FD with name "-%D4#!`````KO!```````@W#````````" Atom 0xD8FE with name "-%D4#!`````,T!```````@W#````````"   Statistics look like this:  Total Global Atoms: 6405 Total is 39 percent of maximum 16384 Global Atoms. Total Registered WindowsMessages: 1940 Total is 11 percent of maximum 16384 Registered WindowsMessages.


Is there a common term to call a given Stack Exchange site?

I was going through  and could not find any term to describe a generic site apart from... site.  So if you are in, say, , how do you refer to the site itself? Is site commonly accepted enough to describe this Stack Exchange site?


For the past couple weeks, my PC has started having an issue where it randomly reboots. These reboots have happen 1-2 times a day, and have so far always been when I am away from it.  There isn't any discernible patterns I've seen from the reboot timestamps. I've thought it might be related to the power supply going bad, but it is fairly new. Also the fact that it is not rebooting under load, but rather while Idle, seems like it shouldn't be a PSU problem?  I also upgraded to Windows 10 the other day, expecting that to possibly affect/fix the issue, but it still happens regardless.  Here are the two events always generated by the reboot -        Is there any way to further debug/troubleshoot what exactly is causing the reboots?


Entire function $f$ such that $|f(z)| ≤ K |z|^3$ for $|z|\ge1$ and $f(z) = f(iz)$ for every $z∈C$

Let $f(z)$ be an entire function such that for some constant $K$ , $|f(z)| ≤ K$ $|z|^3<$ for $|z|\ge1$ and $f(z) = f(iz)$ $∀z∈C$ , then which of the following are correct ?  (A)$ f(z) = Kz^3$ $∀ z∈\Bbb{C}$ (B) $f(z)$ is a constant function (C) $f(z)$ is quadratic function (D) No such $f$ exists   My attempt : I can deduce that since $f(z) = f(iz)$ and since $i^4=1 \implies f$ must involve only fourth powers of $z$ . Hence $f(z)=a_1z^4+b_1z^8+c_1z^{16}+ \cdots $-------(1)  Also for $|z| \ge 1 $: let C.   Then $|g(z)| = |f(z)|/|z^3| \le k$ => By the Cauchy estimate theorem we can prove that :  $f(z)/z^3$ is a constant function $= c $   $\implies f(z)=cz^3$ for $|z| > 1$     ...........(2)  From (1) and (2) ; we get  there does not exist a function like this ?  My textbook answer says it's a constant function ?


What's the big deal with normalization constants in Bayesian inference?

I read this sentence in a book:     "... therefore this method is particularly useful for Bayesian inference since it doesn't require a normalization  constant"   The method is a computational algorithm that takes a density (possibly un-normalized) and does some stuff with it.  I've seen this sentiment elsewhere too, that in Bayesian stats, we need methods that don't require normalization constants ... but I don't understand what the big deal is??  If we have a density $f$ on $R$ but we don't know the normalization constant ... give me two seconds to type this in R:     integrate(f, -Inf, Inf)   and out pops the (inverse of the) normalization constant.   So what is the big deal? Why do we care whether or not a method needs normalization constants when it takes 2 seconds to calculate them in R?


matching multiple lines with regular expressions

I have the following regular expression: <!.*->  It matches text A but not text B. Why is that? The only difference to me is that text B is a block.  text A:  <!-- name of register file -->   text B:  <!--  codes         ''   - no level         SITE - site level          ACCT - acct level          PLCY - policy level  -->   I am using this website to test: .


How to add metabox for post of specific category

I want to add Metabox for the posts of category=18 and i am using the following code but unable to do so . So please help me out->   add_action('admin_init','my_meta_init');  function my_meta_init() {     $post_id = $_GET['post'] ? $_GET['post'] : $_POST['post_ID'] ;      // checks for post/page ID     if ($post_id->post_category[0] == 18)     {         add_meta_box('team_meta', 'My Custom Meta Box 1', 'team_meta_1', 'post', 'normal', 'high');       function team_meta_1(){     global $post;     // Noncename needed to verify where the data originated     echo '<input type="hidden" name="eventmeta_noncename" id="eventmeta_noncename" value="' .      wp_create_nonce( plugin_basename(__FILE__) ) . '" />';      // Get the location data if its already been entered     $designation = get_post_meta($post->ID, '_designation', true);      // Echo out the field     // echo '<input type="text" name="_description" value="' . $description  . '" />';     echo '<textarea name=_designation rows="6" cols="100">'.$designation.'</textarea>';      }      function my_meta_save($post_id, $post) {      // verify this came from the our screen and with proper authorization,     // because save_post can be triggered at other times     if ( !wp_verify_nonce( $_POST['eventmeta_noncename'], plugin_basename(__FILE__) )) {     return $post->ID;     }      // Is the user allowed to edit the post or page?     if ( !current_user_can( 'edit_post', $post->ID ))         return $post->ID;      // OK, we're authenticated: we need to find and save the data     // We'll put it into an array to make it easier to loop though.      $events_meta['_designation'] = $_POST['_designation'];       // Add values of $events_meta as custom fields      foreach ($events_meta as $key => $value) { // Cycle through the $events_meta array!         if( $post->post_type == 'revision' ) return; // Don't store custom data twice         $value = implode(',', (array)$value); // If $value is an array, make it a CSV (unlikely)         if(get_post_meta($post->ID, $key, FALSE)) { // If the custom field already has a value             update_post_meta($post->ID, $key, $value);         } else { // If the custom field doesn't have a value             add_post_meta($post->ID, $key, $value);         }         if(!$value) delete_post_meta($post->ID, $key); // Delete if blank     }  }   add_action('save_post','my_meta_save'); }   }


How do I increase the hard disk size of the virtual machine?

I have run out of space on my WinXP virtual machine, which I only gave 10 GB space for when I created it.  Is there an easy way to increase it to, say, 20 GB?  I can't see any obvious option in VirtualBox settings.    The suggestion below gives this error  wim@wim-ubuntu:/media/data/winxp_vm$ VBoxManage modifyhd wim.vdi --resize 20000 VBoxManage: error: Cannot register the hard disk '/media/data/winxp_vm/wim.vdi' {46284957-2c09-4e70-8a49-bfbe0f7f681d} because a hard disk '/home/wim/VirtualBox VMs/winxp_vm/wim.vdi' with UUID {46284957-2c09-4e70-8a49-bfbe0f7f681d} already exists VBoxManage: error: Details: code NS_ERROR_INVALID_ARG (0x80070057), component VirtualBox, interface IVirtualBox, callee nsISupports Context: "OpenMedium(Bstr(pszFilenameOrUuid).raw(), enmDevType, AccessMode_ReadWrite, fForceNewUuidOnOpen, pMedium.asOutParam())" at line 210 of file VBoxManageDisk.cpp     Removing the .vdi from VirtualBox before calling VBoxManage command, then adding it back in, was successful.  But now I can't boot the virtual machine, I get this worrying screen:    By the way, it says FATAL: Could not read from the boot medium!  System halted.    The vdi must be reattached to the VM after VBoxManage command.  Further, the partition will need to be resized from WITHIN windows, because you will have this empty space:    I was able to resize the partition easily using a bit of freeware called .


Firefox freezes too often, nothing useful in logs

Ubuntu totally freezes when using Firefox, can't access TTY and REISUB doesn't work.   Xubuntu 15.04 x86-64 (up to date/proposed not active) Firefox 38 Intel Celeron J1900 with Intel Graphics (Bay Trail) 4GB RAM   Difficult to target the problem because it may occur after 5 minutes or after 10 hours of Firefox usage. I tried a new profile with hardware acceleration off, smooth scroll off and uninstalled flash but same thing.  Here's syslog (2 hours before freeze, freeze/hard reboot at 23:30)  Jun  8 21:17:01 heaven CRON[4228]: (root) CMD (   cd / && run-parts --report /etc/cron.hourly) Jun  8 22:17:01 heaven CRON[4590]: (root) CMD (   cd / && run-parts --report /etc/cron.hourly) Jun  8 22:52:15 heaven kernel: [18841.243021] perf interrupt took too long (5003 > 5000), lowering kernel.perf_event_max_sample_rate to 25000 Jun  8 23:17:01 heaven CRON[5077]: (root) CMD (   cd / && run-parts --report /etc/cron.hourly) Jun  8 23:30:26 heaven rsyslogd: [origin software="rsyslogd" swVersion="7.4.4" x-pid="702" x-info="http://www.rsyslog.com"] start Jun  8 23:30:26 heaven rsyslogd: rsyslogd's groupid changed to 110 Jun  8 23:30:26 heaven rsyslogd: rsyslogd's userid changed to 104 Jun  8 23:30:26 heaven systemd-modules-load[201]: Inserted module 'lp' Jun  8 23:30:26 heaven systemd-modules-load[201]: Inserted module 'ppdev' Jun  8 23:30:26 heaven systemd-modules-load[201]: Inserted module 'parport_pc' Jun  8 23:30:26 heaven systemd-modules-load[201]: Module 'fuse' is builtin Jun  8 23:30:26 heaven systemd[1]: Started Apply Kernel Variables. Jun  8 23:30:26 heaven systemd[1]: Started Create Static Device Nodes in /dev. Jun  8 23:30:26 heaven systemd[1]: Starting udev Kernel Device Manager... Jun  8 23:30:26 heaven systemd-udevd[279]: starting version 219 Jun  8 23:30:26 heaven systemd[1]: Started Uncomplicated firewall. Jun  8 23:30:26 heaven systemd[1]: Started udev Kernel Device Manager. Jun  8 23:30:26 heaven systemd[1]: Starting Show Plymouth Boot Screen... Jun  8 23:30:26 heaven systemd[1]: Started Show Plymouth Boot Screen. Jun  8 23:30:26 heaven systemd[1]: Started Dispatch Password Requests to Console Directory Watch. Jun  8 23:30:26 heaven systemd[1]: Started Forward Password Requests to Plymouth Directory Watch. Jun  8 23:30:26 heaven systemd[1]: Starting Forward Password Requests to Plymouth Directory Watch. Jun  8 23:30:26 heaven systemd[1]: Created slice system-ifup.slice. Jun  8 23:30:26 heaven systemd[1]: Starting system-ifup.slice. Jun  8 23:30:26 heaven mtp-probe: checking bus 1, device 2: "/sys/devices/pci0000:00/0000:00:14.0/usb1/1-1" Jun  8 23:30:26 heaven mtp-probe: checking bus 1, device 6: "/sys/devices/pci0000:00/0000:00:14.0/usb1/1-3/1-3.4" Jun  8 23:30:26 heaven mtp-probe: checking bus 1, device 5: "/sys/devices/pci0000:00/0000:00:14.0/usb1/1-3/1-3.3" Jun  8 23:30:26 heaven mtp-probe: bus: 1, device: 6 was not an MTP device   I've recently added i915.enable_rc6=0 to grub to prevent video players to freeze the system with harware acceleration activated (due to ) so I've reverted the change to see if Firefox is affected but with RC6 activated i have both freezes for video players and Firefox so i don't think it's related but I want to be as specific as possible for those who can help me.  Edit 06/10 > After more research, it seems disable intel-pstate could help me, so i added intel_pstate=disable to boot parameters in GRUB. Since I started the computer, no crashes but I'll wait a little longer before classifying the case as solved.


I have a latex thesis template, written in english. I would like to use it in french but i didn't translate the defined layout like the word "chapter", " List of ...".   Have you any idea how to translate the layout.


What is the smallest viable reproducing population, such as in a human population. By viable I mean a population which keeps genetic defects low (enough).  A very strongly related question: what is the expected number of generations a given population can survive?


program works even when hexfile size is greater than flash memory

I am working with AT89S51 microcontroller and using keil to write program in C. It produced a hex file of size about 4875 bytes but flash memory on the microcontroller is only 4kbytes.  I programmed the flash successfully and the program is also working fine.  I am glad its working but I want to know why is it working since there is no enough space on flash to program my code on the microcontroller.  Let me know if you need any additional info.


Assume $P$ is a prime ideal s.t. $K \subset P$, show $f(P)$ is a prime ideal

I'm currently trying to solve this problem.      Let $f: R \rightarrow S$ be a surjective ring homomorphism. Let $K = \ker(f)$. Assume $P$ is a prime ideal s.t. $K \subset P$. Show $f(P)$ is a prime ideal in $S$.   I solved the ideal part.   Let $y \in f(P)$, by definition then $y = f(x)$ for some $x \in P$. Now let $s \in S$. Then since $f$ is surjective $\exists r \in R$ s.t. $f(r) = s$. So then since $f$ is a homomorphism we have $f(x)\cdot s = f(x) \cdot f(r) = f(x\cdot r)$. Then since $P$ is ideal and $x \in P$, $x\cdot r \in P$, so $f(x \cdot r) = f(x)\cdot s \in f(P)$ so $f(P)$ is closed under multiplication by an element in $S$.   Now let $y, y' \in f(P)$, again by definition we have $x, x' \in R$ s.t. $f(x) = y, f(x') = y'$. By $f$ homomorphism we have $y - y' = f(x) - f(x') = f(x-x')$. Then by $P$ ideal we have $x-x' \in P$, thus $y-y' \in f(P)$.   Therefore $f(P)$ is an ideal.   The part I'm having trouble with is showing that $P$ prime implies $f(P)$ prime.   I started off let $AB \subset f(P)$, by definition we know we have $C \subset P$ s.t. $f(C) = AB$. From here I need to arrive at showing that either $A \subset f(P)$ or $B \subset f(P)$. I'm not really sure how to move forward from here but I know I somehow need to involve the fact that $K \subset P$ since I haven't used that yet.  Any help would be appreciated.  Note: I'm not assuming that $R$ or $S$ is commutative, I already know how to solve it if they are using the commutative definition of prime.


Why is $M\frac{dv}{dt} = v_{rel} .\frac{dm}{dt}$ correct and $(M - dm)\frac{dv}{dt} = v_{rel} .\frac{dm}{dt}$ wrong?

Newton's 2nd law of motion can't be applied for mass-varying systems. Another force, known as Thrust must come to play. It can be measured using law of conservation of linear momentum. $$\text{Thrust} M.\dfrac{dv}{dt} = v_{rel} .\dfrac{dm}{dt}.$$   where $M$ is the mass of the system;   $\frac{dm}{dt}$ is the rate at which the mass changes;    &    $v_{rel}$ is the relative velocity of the exhausted mass w.r.t to the main system.    This is what my book writes. Now, the left hand side of the eqn. represents force on mass $M$ whereas the right hand side represents the force due to variable mass. How can they be equal? During the application of thrust, $M$ does change and the equation had to be $$ (M - dm). \dfrac{dv}{dt} = v_{rel} .\dfrac{dm}{dt}$$ But that is not the book's equation. Why is mine wrong? What is the intuition?


My nana is Fully Puerto Rican & my mom is half what does that make me?

Okay so my nana is fully Puerto Rican & all of my moms side of the family is Puerto Rican. My mom is half Puerto Rican & half black. What does that make me?


So, I've edited the question to hopefully give more clarity on the situation:  I've recently learned that my friend ( A ) assisted in plagiarism for another student ( B ) by completing the vast majority of a final-project in a class I also take with student B. I know B doesn't deserve the almost-perfect grade he will receive because of A's work. I feel terrible because I know how much effort I and others personally contributed to our own projects and it makes me feel like everyone else's work has just been invalidated.  I know, beyond any doubts, that this is what occurred:  B has struggled in this class. A is experienced with the class, the professor, and the subject matter. A has been helping B with other assignments, sometimes assisting more than he should, but otherwise not at any level I would deem "plagiarism."  B asked for help with the final project in this class. A, of course, obliged. After helping for a little bit, the due date was imminant and B's project was still in the beginning stages. At this point A realizes that he has basically been completing the project himself, but feels morally obligated to not "leave him stranded," so A fully completes B's project out of a personal, moral obligation to himself. Personally being friends with A, I know that this was a momentary lack of judgement, and I know he knows much better than to cheat.  A has done all of the work on the project and B is going to pass it off as his own work.  Looking at the College's plagiarism policy, the worst that will happen to the student B is:  Failure in the course in which plagiarism or dishonesty occurs.  For my friend ( A ) that knowingly plagiarized: Loss of all credit for that semester and suspension for the remainder of that semester.  My friend A has struggled this whole semester, academically and financially, to attend the College and it would be horrific if he had to leave and all of his work be for naught. I find it also unfair that, for what A found as a moral crossroads (helping his friend), and a momentary lack in judgement, will cost him so much more than the punishment B will receive.  I want to report it, but if I do (even anonymously), B will only tell the administration that my friend helped him. I can't be responsible for that.  What can I do in this situation? Report it? Keep it to myself and hope the professor knows? Meet with the professor and have an honest discussion about how I feel and how I know my friend knows the ethics of cheating but became morally confused in this instance?  I guess the overarching question here would be: what outcome provides the best result for A while simultaneously reporting B for plagiarism?


What is $\mathbb Z \oplus \mathbb Z / \langle (2,2) \rangle$ isomorphic to?

This question came up after I'd solved the following exercise:     Determine the order of $\mathbb Z \oplus \mathbb Z / \langle (2,2) \rangle$. Is the group cyclic?   I had no trouble solving the exercise: The answer is the group is infinite and non-cyclic.  But as a bonus exercise I tried to figure out what it is isomorphic to and now I'm stuck.   Here is what I have so far:  $[(1,0)]$ and $[(0,1)]$ generate infinite disjoint subgroups.   Also, every element in the odd diagonal $[(2k+1, 2k+1)]$ has order $2$. Let's call the odd diagonal $D$. Then $D \cong \oplus_{k \in \mathbb Z} \mathbb Z_2$.      Is this correct? And if so, is $\mathbb Z \oplus \mathbb Z / \langle  (2,2) \rangle \cong \oplus_{k \in \mathbb Z} \mathbb Z_2 \oplus  \mathbb Z \oplus \mathbb Z$?   And if not could someone help me by showing me what it is isomorphic to?


Why don't $\sqrt{a*b}=\sqrt{a}*\sqrt{b}$ holds true when one of $a$ & $b$ is imaginary number?

I know that $\sqrt{1}=\sqrt{(-1)*(-1)}$ and we can't expand $\sqrt{(-1)*(-1)}$ as $\sqrt{-1}*\sqrt{-1}$ since the later part becomes $\iota$*$\iota$ which becomes -1 which is not equals the original number we are given-$1$.  But I want to know why we can't take square root of two imaginary numbers in product to be equals the product of square roots of two imaginary numbers by distributing the square root function over the two numbers under the square root function?


Can every group be represented by a group of matrices?   Or are there any counterexamples? Is it possible to prove this from the group axioms?


Solving a Congruence - cannot understand a step in the solution

New to congruences & Number Theory Below is text from the book Joseph H. Silverman: A Friendly Introduction to Number Theory, 4th Edition, chapter 8, page 56.  To solve $4x\equiv 3 \pmod{19}$ we will multiply both sides by $5$. This gives $20x\equiv 15 \pmod{19}$ - Step 1 But $20\equiv 1\pmod{19}$, so $20x\equiv x\pmod{19}$ - Step 2 Thus the solution is $x\equiv 15\pmod{19}$  I understand up to step 2, I am unable to understand how one arrives at the solution from Step 2. How does $20x\equiv x \pmod{19}$ lead to $x\equiv 15 \pmod{19}$ Where did the $20$ on the LHS go? How did $x$ on the RHS get replaced by $15$?


Division and multiplication Accuracy in sql

have faced below problem while writing query, not sure why it is happening Please find the below example   SELECT 21000.000000/22000.000000 * 22000.000000   sql engine result is 20999.999999999999990000000  But if you do the same through calculator, we will be getting 21000. Why is it like this? and how to achieve the calculator result with out rounding off


I have an int and I want to display the associate letter. For example, if the int is "1", I want to display "a".   I have a variable "word" and I want to add this letter in it. This is my code :  word += (i+96).ToString(); Console.WriteLine(word);   But in the console, I have a list of number. I found Encoding.ASCII.GetChars but it wants a byte in parameter. How should I do please ?


hope you are all well during this difficult times. I just downloaded version 2.82a for Linux, and I was trying to follow a tutorial on how to make a photo realistic ring. Mind you I never used Blender before,so I'm a complete novice, but since I am stuck at home as my workplace is closed, I thought I'd give it a go.  I managed to do the first ring, but as I was trying to do the second one,the guy was saying to use alt+rightmouse to select the section to extrude. He was using an older version 2.76b, and I cannot find the same function on the newer version.  I have checked preference-keymap-select using right, saved it restart the software but is still not working.  Anyone know the right shortcut, or can point me in the right direction?  I have attached a screenshot of the point where I am stuck  Please bear with me if this is a silly question   Thanks


nginx support for .htaccess / rewrite rules? Differences from Apache?

I've been working with Apache http servers for quite some time, and finally making the move to static-content servers alongside the others dynamic-content machines.   I was wondering, does nginx support ".htaccess" files, and things like mod_rewrite?   As I'm very used to the syntax, I was wondering what the (syntax) differences were, and what the learning curve is like moving from Apache configs to nginx.


In Skyrim, Shadowmere has been lost for about 3 levels, how do I find her?

So, after the DBH quests, I went to the new Sanctuary, and did a lot of other quests, including the main story line, Dawnguard, Hearthfire, and just started the Dragonborn DLC. I've been wandering around with the Aura Whisper shout, and I've not found her. The last time I saw her was when I bought a horse from Whiterun, and rode it around until I reached Windhelm, and then it died due to a dragon. Shadowmere has not respawned (if dead), or turned up after fast-travelling. I tried reloading save files, but then I kept losing her. Is there a way to get her back?--  She wasn't at the black pool at EITHER Sanctuary and I still cannot find her. I've looked about everywhere and still she has not turned up and I've not found her.


I'm getting a java.lang.NullPointerException: null error and I don't know what is missing

public void FillArray() {     for (int i = 1; i < numEmp; i++)     {         employees[i] = true;     } }   I think this part may be the reason I'm getting the NullPointerException error, but I don't know what I'm missing. I have put my full code for the program below just in case there is something that is wrong with that that is giving me that error message.  //client class  public class Downsize {     public static void main (String [] args)     {         System.out.print("Do you want to downsize the company? (Y/N): ");         String dummy = APIO.getString().toUpperCase();                 while (dummy.equals("Y"))         {             Employee employee = new Employee();             System.out.print("Do you want to downsize the company? (Y/N):              dummy = APIO.getString().toUpperCase();         }     } }     //object class   public class Employee     {         int numEmp;         int sprayer;         int winner;         boolean [] employees;          public Employee()         {             System.out.print("How many employees? (0 to end): ");             int numEmp = APIO.getInt();             System.out.print("Who gets the spray can first?: ");             int sprayer = APIO.getInt();             FillArray();             Selection();             Winner();         }          public void FillArray()         {             for (int i = 1; i < numEmp; i++)             {                 employees[i] = true;             }         }          public void Selection()         {                     System.out.println("EM="); //debugging method             for (boolean em: employees)             {                 System.out.println(em);             }              int complete = numEmp;             while (complete > 1)             {                 System.out.print("spraycan passed to #" + sprayer);                 if ((sprayer + 1) > numEmp)                 {                     sprayer = 0;                 }                 while (employees[sprayer + 1] == false)                 {                     sprayer++;                     if (sprayer >= numEmp)                     {                         sprayer = 0;                     }                 }                 employees[sprayer + 1] = false;                 System.out.print("  -  sprays #" + (sprayer + 1) + "'s hair");                 complete--;                 sprayer++;                 while (employees[sprayer] == false)                 {                     sprayer++;                     if (sprayer > numEmp)                     {                         sprayer = 1;                     }                 }             }         }          public void Winner()         {             if (sprayer == 0)             {                 sprayer = 1;                 System.out.print("\nThe Winner is #" + sprayer);                 System.out.print("\n");             }         }     }   //stack trace for the error message  java.lang.NullPointerException     at Employee.FillArray(Employee.java:22)     at Employee.<init>(Employee.java:14)     at Downsize.main(Downsize.java:9)


I would like to do some stuff with the new particle nodes, indroduced in Blender 2.91alpha. Now Blender 2.91 is official released and I can't find it anywhere. Not in the experimental section in the properties and also not as an experimental branche. In the blender 2.92alpha there is an simulation window and you can find the Point Cloud-Object, but you can't add any nodes, and I wasn't able to find an old blender 2.91aplha. I thought it could be part of the Geometry-Nodes, but in the Geometry-Nodes branche I also couldn't find it. Has someone informations about the courent state and where to find the paticle nodes? Thank you very much!!!


I'm working my way through a tutorial and I have hit a snag.   I created this object and I'm trying to loop through and print the first names of the entries. I thought it was working, but then I noticed that when I change 'firstName' in my for loop to 'number' or 'lastName', it still writes the first names to the console.   Can anyone shed some light for me? Thanks!  var friends = {   bill:{     firstName:"Bill",     lastName:"Gates",     number:"617-333-3333",     address:["One Microsoft Way", "Redmond", "WA", "98052"]   },   steve:{     firstName:"Steve",     lastName:"Jobbs",     number:"617-222-2222",     address:["15 Idontknow Street", "No Idea", "NO", "33333"]   } };  var list = function(friends){   for (var firstName in friends) {     console.log(firstName);   } }


$$4\sin\theta +3\cos\theta  = 5$$   How would we solve this trigonometric equation using vectors? Since I'm not advanced, I do not truly know where to use vector product.   Regards!


What should you do in the event you are accused of plagiarism?

Context:  I was answering  on SO, and have run into a rather sticky situation.   The question was a pretty trivial one, but the asker introduced some edge case conditions after I had posted my answer, and it took me a while to figure out a solution that fulfilled that requirement. I finally got to an answer that worked, posted it, and all was well in the world.   Problem:  Except that another person had arrived at a similar, (although more thorough) solution while I had been fiddling with mine. This person then left a comment accusing me of ripping off his answer. I realize that I have nothing but my word to give, but please believe me when I say I did not even look at the other answer before posting mine. It was simply a logical progression of what I already had.   I have failed to convince this person that I did not copy the answer, and the simplest course of action would be to simply delete my answer and move on, reasoning that I don't need the trivial amount of rep I was getting from that answer anyway. But it just leaves a bad taste in my mouth that I should be guilty until proven innocent. What is the correct course of action in circumstances like this?  EDIT 1:   Evidently the other user has deleted their answer while I was typing this. I am not sure whether it is appropriate to name them.  EDIT 2:   To make this question more general than just me having hissy fit about being called names, here is what I would like to know, specifically:   If you are accused of plagiarism, should you just delete your answer and walk away? Are there any repercussions to such accusations that you should worry about (disciplinary bans or restrictions etc.)


Which is better -to save money or pay down debt?

Generally speaking, if you've come into a little bit of money (for example, the profit from the sale of real estate), is it better to use that money to pad your savings account or pay down your debt leaving behind very little in your savings account? What factors should be considered?


I'm Done button remain enabled even after the action is rolled back in First Posts Review

From the  instructions:     I'm Done is only available if you've done one of the following:         Vote up or down to rate the question's quality and usefulness   Edit to improve the question's appearance or clarity   Comment to leave constructive feedback for the author   Flag to notify the moderators of serious problems   Close questions that cannot or should not be answered here         When in doubt, upvote the question and leave a comment to help the   user out, or click Not Sure if you are unsure and want to skip   this question.   That means that you have to do one of the above actions to click on I'm Done button. And if we click on I'm Done, we get new post to review and our review count is increased by 1 (I think that's not important for anyone).  But I found (accidentally) a minor fault in First Post Review. What I did is: I got a question, where I commented. And I'm Done button got enabled. But deleted that comment as I found the comment was not useful. So I expected I'm Done button to be disabled. But it was not disabled. It remained enabled. (That means it was enabled without reviewing.).  So I suggest to disable the I'm Done button again when comment is deleted. (Same as when we vote the post then the I'm Done button is enable and when we rollback our vote(unvote) then I'm Done button get disabled.)


It is shown in a book (Essential grammar in used: unit 22)  "Football matches are often played at the weekend, but no matches are being played next weekend."  In my opinion it should be:  "Football matches are often played at the weekend, but no matches will be played next weekend."  Edit: Just to point out that my wonder is in the present form are being when referring to a future event next weekend. So in my opinion it should be will be instead of are being.


Difference between I'll be home 'by ten' and 'at ten'

I have a question. What does this phrase mean "I'll be home by ten", because it is confusing, especially when used with "at" instead of "by". When it comes to sentence stress which words should I stress more?


Lambda/Linq with Contains criteria for multiple keywords

I have to lists  Main list with Comments field List of keywords to search for.  I want to search the keywords in each Comment field of each record which in SQL would look like below select * from MainList where Comment like '%keyword1%' or Comment like '%keyword2%' ... so on until the last keyword.  So far I have seen examples but usually for single keyword at a time only e.g.  What I would like is to search each record in MainList for any instance of any of my keyowrds all at once. something like: var newList = MainList.Where(m => m.Comments.Contains(purposes))  I would prefer doing it in lambda syntax but if not possible, linq is also okay.


What happens if a flight gets diverted to an airport where I don't have rights to enter the country?


Multiple value same id into single line in sql

Here is my table i want to add value in one line format my code is   OrderDate OrderID ItemNo PaymentType        Cash    Nets    Visa    AMEX MasterCard Voucher Remarks ReciptNo  2018-01-27  809   40149  Mix Payment Type   NULL    NULL    NULL    NULL    NULL    55.00   NULL    NULL 2018-01-27  809   40149  Mix Payment Type   NULL    NULL    NULL    NULL    10.00   NULL    NULL    ABC123 2018-01-27  809   40149  Mix Payment Type   NULL    NULL    NULL    4.00    NULL    NULL    NULL    PQE789 2018-01-27  809   40149  Mix Payment Type   NULL    NULL    10.00   NULL    NULL    NULL    NULL    123456 2018-01-27  809   40149  Mix Payment Type   20.00   NULL    NULL    NULL    NULL    NULL    NULL    NULL   i want o/p like   OrderDate   OrderID     ItemNo       PaymentType        Cash    Nets    Visa    AMEX    MasterCard  Voucher Remarks    ReciptNo 2018-01-27  809         40149        Mix Payment Type   20.00   NULL    10.00   4.00    10.00       55.00   NULL    ABC123,PQR789,123456   what should i do for that in sql query


How to create disc that installs Ubuntu?

I just downloaded Ubuntu 13.10 desktop -amd64 but it is an ISO file. Do I have to create a disc (make Bootable CD) to install new OS (Ubuntu 13.10)? I haven't done this before.


How to start itemize on same line as text?

I've created a new environment called 'Example' like this:  \newenvironment{example}     {\textbf{Example:} \begin{itemize}}     {\end{itemize}}   The environment works fine, but the items are starting after the Example: text. Is it possible to start with the first item on the same line as the Example: text and vertically aline the rest of the items with the first item?


Proving definition of norms induced by vector norms

I know the title isn't very clear. The question is the following. Let $\|\cdot\|$ be a vector norm on $\mathbb{C}^n$. Define the induced norm on $\mathbb{C}^{n\times n}$ as: $$\|A\|_{op}=\max\limits_{x\in\mathbb{C}^n\smallsetminus\{0\}}\dfrac{\|Ax\|}{\|x\|}.$$ How do I prove that:   If $\|\cdot\|_{2}$ is the Euclidean norm, then: $$\|A\|_{2}=\rho^{\frac12}(A^{*}A),$$ with $\rho(A)$ the spectral radius of $A$ and $A^{*}$ the conjugate transpose of $A$? If $\|\cdot\|_{\infty}$ is the max norm ($\|x\|_{\infty}=\max|x_i|$, $x_i$ being the components of $x$) then: $$\|A\|_{\infty}=\max_{i=1,\dots,n}\left(\sum\limits_{j=1}^n|a_{ij}|\right)?$$ And that if $\|\cdot\|_{1}$ is the sum norm ($\|x\|_{1}=\sum_{i=1}^n|x_i|$, $x_i$ being, again, the components of $x$), then: $$\|A\|_{1}=\max\limits_{j=1,\dots,n}\left(\sum\limits_{i=1}^n|a_{ij}|\right)?$$


I try to reproduce the answer Photo Clipper of kiss my armpit to the question  but it is not succeeding. As I do not have any clue what might be the problem I would like to know if there is anything I have to take into account to get the desired result (such as picture size...):  \documentclass[border=12pt,pstricks]{standalone} \usepackage{graphicx} \newsavebox\IBox \savebox\IBox{\includegraphics{pretty}} \usepackage{pst-plot}  \def\x(#1){sin(#1)^3} \def\y(#1){(13*cos(#1)-5*cos(2*#1)-2*cos(3*#1)-cos(4*#1))/16}  \psset {     algebraic,     plotpoints=100,     xunit=.5\wd\IBox,     yunit=.5\ht\IBox, }  \usepackage{mathtools} \begin{document}  \begin{pspicture}[showgrid=false](-1,-1)(1,1.5) \begin{psclip}{\psparametricplot[origin={0,0.15}]{0}{\psPiTwo}{\x(t)|\y(t)}} \rput(0,0){\usebox\IBox} \end{psclip} \rput(0,1.25){%     \color{red}\large     $\displaystyle\!     \begin{aligned} %        x(t)&=\sin^3 t\\ %        y(t)&=(13\cos t -5\cos 2t -2\cos 3t -\cos 4t)/16     \end{aligned}$} \rput(0,1){ %HAPPY BIRTHDAY } \end{pspicture}  \end{document}   Edit 1. The resulting picture is this:


Problem with microtype's `\textls` and math mode

I have some issues with classicthesis' \spacedlowsmallcaps command that I could bring down to the following MWE:  \documentclass{scrartcl}  \usepackage{microtype}  \newcommand{\spacedword}[1]{\textls[150]{#1}}  \begin{document}     Hello! $abc = def + ghi$      \spacedword{Hello! $abc = def + ghi$}      Hello! $abc = def + ghi$ \end{document}   The first line is displayed as it should. The second line as well with larger spacings between the characters. However, in the third line, the text "Hello!" is shown as it should be (with normal spacing), but the formula in the math mode is still spaced.  As it was shown , this is a known bug. In the first answer, it was suggested to use the following command after \textls:  \makeatletter\let\glb@currsize\@empty\makeatother   However, is there a possibility to incorporate this workaround into the command spacedword such that I do not have to care about the bad spacing any more? This would be the preferred solution since I use \textls quite a lot. Simply adding it into the command definition does not work, likely due to makeatletter/makeatother parsing issues.  Update: Okay, next problem. Consider the following MWE:  \documentclass{scrreprt}  \usepackage{etoolbox} \usepackage{microtype} \usepackage{textcase}   % From classicthesis.sty: \DeclareRobustCommand{\spacedlowsmallcaps}[1]{\sffamily\textls[80]{\scshape\MakeTextLowercase{#1}}} % From arsclassica.sty: \renewcommand{\descriptionlabel}[1]{\hspace*{\labelsep}% \bfseries\spacedlowsmallcaps{#1}}   % New Workaround: \makeatletter \let\OldSpacedLowSmallCaps\spacedlowsmallcaps \renewrobustcmd{\spacedlowsmallcaps}[1]{\OldSpacedLowSmallCaps{#1}\let\glb@currsize\@empty} \makeatother   \begin{document}     Hello $abc = def + ghi$      \spacedlowsmallcaps{Hello $abc = def + ghi$}      Hello $abc = def + ghi$      \begin{description}         \item[$x$] y     \end{description}      Hello $abc = def + ghi$ \end{document}   Thanks to the solution suggested by Ulrike Fischer in the comments below, the first three lines look as they should. However, after the description environment, the rendering of the last line again breaks, i.e., the characters have too much space between them although the description x, which appears in spacedlowsmallcaps, is afterwards "repaired" by the wordaround.


Why isn't a non overridden overloaded function being inherited when I override one of its other overloads?

Say that six times fast... Why doesn't this compile in MSVC 2010?    class A { public:     void foo(int a, int b) { };     void foo(int a) { }; }; class B: public A { public:     void foo(int a, int b) { }; // <-- comment this out to compile };  int main(int argc, char* argv[]) {     B b;     b.foo(1); // <-- doesn't compile... shouldn't B just inherit this overload? }


On the turn after Haste ends, can you use a reaction?

The description of the Haste spell concludes with:     When the spell ends, the target can't move or take actions until after its next turn, as a wave of lethargy sweeps over it.   Could the target still use a reaction (to, say, throw up a Shield spell if needed) or is a reaction considered a type of action?  Since the spell depends on concentration, it could end unexpectedly if the caster loses concentration on it, leaving the target in a perilous situation.


As a StackExchange user on the Badges Tab I would like to see statistics on how far away a certain badge is compared to the goal. In this way it would be easyier to see how the effort progresses.     Edit:      This question is a duplicate of the question


I have corrupted indexes in my Exchange 2013 server and I have having trouble figuring out how to reset them.  I found information on how to do it here:    They tell me this: "If the mailbox database copy is the only copy, Exchange Search must create a new content index catalog. You can use the ResetSearchIndex.ps1 script to do this."  It is in fact the only copy and so I have to use this option, the problem is that they don't give any information on how to run it because it will not run in Powershell. Other articles about 2010 show that I need to go to the scripts directory and run it from there, however this script is not in my script directory on my Exchange 2013 server.  Thoughts?


How to find the determinant of this $3 \times 3$ Hankel matrix?

Today, at my linear algebra exam, there was this question that I couldn't solve.   Prove that $$\det \begin{bmatrix}  n^{2} & (n+1)^{2} &(n+2)^{2} \\  (n+1)^{2} &(n+2)^{2}  & (n+3)^{2}\\  (n+2)^{2} & (n+3)^{2} & (n+4)^{2} \end{bmatrix} = -8$$   Clearly, calculating the determinant, with the matrix as it is, wasn't the right way. The calculations went on and on. But I couldn't think of any other way to solve it. Is there any way to simplify $A$, so as to calculate the determinant?


Bootable USB drive won't run installation

I am having issues installing 12.10 on a laptop from bootable USB Drive 4GB FAT32. Also I changed order on BIOS to boot from USB.  But only I see is the black screen with  SYSLINUX 4.06 EDD 4.06-pre7 Copyright (C) 1994-2012 H. Peter Anvin et al _   I tried to install 12.10 into my older laptop using the same bootable USB drive just to be sure, and it's all works fine!   I have also trying different USB drives, but results were the same. So it looks like there is nothing wrong with my bootable USB drives. Something is wrong with my laptop, but I can't figure out what exactly, because it's very new and Windows7 boots and runs just great. I Googled but found nothing useful.   My laptop is really a small one:   Acer AOD270 Protcessor: Intel(R) Atom(TM) CPU N26OO 1.60 GHz RAM: 1 GB Windows 7 Starter 32 bit It has no CD drive   Any help would be really appreciated please.    Thank you guys for the help!   No, ekaj I am using Universal USB Installer-1.9.1.5 But I'll try your variant, maybe it works!  @ Arup Roy Chowdhury unfortunately it doesn't work. For a few seconds i saw the screen with some basic information about computer, and then it just stuck on this:  SYSLINUX 4.06 EDD 4.06-pre7 Copyright (C) 1994-2012 H. Peter Anvin et al


Determine the remainder when $f(x) = 3x^5 - 5x^2 + 4x + 1$ is divided by $(x-1)(x+2)$

This question arose while I was tutoring a student on the topic of the Remainder Theorem. Now, the Remainder Theorem tells us that when a polynomial $p(x)$ is divided by a linear factor $(x-a)$, the remainder is simply $p(a)$. However, in this case we have a product of linear factors.   Using the Remainder Theorem we can see that neither $(x-1)$ nor $(x+2)$ is a factor of $f(x)$. Also, if we try to find the remainder using long division, we get a relatively ugly remainder of  $$ 3(14x - 13) $$ I assume this is not the correct approach as all other questions in this topic used the Remainder Theorem. So perhaps there is a more elegant approach?


How do I vertically center the content in a table cell

This is what I want:    This is what I have:    Here is my code:  <!DOCTYPE HTML>   <meta charset="utf-8"> <title>Index</title> <meta name="viewport" content="width=device-width, initial-scale=1.0">

Content

                       CSS  .ul{ display: table; margin: 0 auto; list-style: none; }  .li{ font-weight: bold; font-size: 50px; }  img{ width: 200px; }   I've tried vertical align middle but it didn't do anything then I tried to center it with margins but it  didn't work out as I wanted and I also tried flex and absolute position.


memory space to implement 128-bit AES algorithm on 8 bit microcontroller

How to calculate(RAM and ROM) memory space needed to implement 128-bit AES algorithm on 8 bit microcontroller?  give some examples please...


OSGi/Felix Declarative Services: How to filter the services to be bound?

I am using Apache Felix and its Declarative Services (SCR) to wire the service dependencies between bundles.  For example, if I need access to a java.util.Dictionary I can say the following to have SCR provide one:  /** * @scr.reference name=properties interface=java.util.Dictionary */  protected void bindProperties(Dictionary d) { }  protected void unbindProperties(Dictionary d) { }   Now, I have more than one Dictionary service available, and I want to filter them using the "name" service property (I only want "name=myDictionary"). I can do that with code (using a ServiceTracker), but I'd rather specify the filter in the @scr annotation instead.


CSS can't select classes/id's with numbers in it?

Why can't you use numbers in CSS and is there another way of doing the job? I have the following code:

         Header

         Content

         Footer

   The CSS selects the class 400-width which means the container gets a width of 400px. And the background-color is for checking if it's true.  .400-width{     width:400px;     background-color:blue;     color:white; }   It doesn't happen right now as you can see   I solved the problem by replacing 400- by four. So it becomes fourwidth.


Just now I edited an answer and got four points instead of two.    I checked , but I already had a few other suggested edits approved, and it has always been two points...  Here is the question:    Is this a bug?  Update:  Checking the revisions, I can see two revisions, both at same time and the content is also the same. Links are also identical. Possibly this is the cause of the issue I feel:


Prove: If $|r| < 1$, then $\lim_{n\to \infty }r^n$ = 0.

Prove: If $|r| < 1$, then $\lim_{n\to \infty} r^n = 0$.  I know I am supposed to use the fact that $\lim_{n\to \infty} r^n = 0$ iff $\lim_{n\to \infty} |r^n| = 0$. I also know that $|r^n|$ is monotone and that I have to prove it by plugging in a value like 1/2 to show it's decreasing but that is as far as I have gotten. I just do not know how to use those ideas. I am stuck on how to prove that it is monotone and how the proof should look in general. Any help would be much appreciated.


trying to install nodejs with - apt install nodejs

Here is what it gives me:  root@tal-HP-Notebook:~# apt install nodejs Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies:  linux-image-generic : Depends: linux-image-4.4.0-176-generic but it is not going to be installed or                                 linux-image-unsigned-4.4.0-176-generic but it is not going to be installed  linux-modules-extra-4.4.0-176-generic : Depends: linux-image-4.4.0-176-generic but it is not going to be installed or                                                   linux-image-unsigned-4.4.0-176-generic but it is not going to be installed  nodejs : Depends: libuv1 (>= 1.6.1) but it is not going to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).   Do you know what to do?    When i try apt-get -f install, it gives me the following:  root@tal-HP-Notebook:~# apt-get -f install Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following additional packages will be installed:   linux-image-4.4.0-176-generic Suggested packages:   fdutils linux-doc-4.4.0 | linux-source-4.4.0 linux-tools The following NEW packages will be installed:   linux-image-4.4.0-176-generic 0 upgraded, 1 newly installed, 0 to remove and 252 not upgraded. 7 not fully installed or removed. Need to get 6,937 kB of archives. After this operation, 7,238 kB of additional disk space will be used. Do you want to continue? [Y/n] y Get:1 http://il.archive.ubuntu.com/ubuntu xenial-updates/main amd64 linux-image-4.4.0-176-generic amd64 4.4.0-176.206 [6,937 kB] Fetched 6,937 kB in 7s (892 kB/s)                                               (Reading database ... 590241 files and directories currently installed.) Preparing to unpack .../linux-image-4.4.0-176-generic_4.4.0-176.206_amd64.deb ... Unpacking linux-image-4.4.0-176-generic (4.4.0-176.206) ... dpkg: error processing archive /var/cache/apt/archives/linux-image-4.4.0-176-generic_4.4.0-176.206_amd64.deb (--unpack):  cannot copy extracted data for './boot/vmlinuz-4.4.0-176-generic' to '/boot/vmlinuz-4.4.0-176-generic.dpkg-new': failed to write (No space left on device) No apport report written because the error message indicates a disk full error                                                                               dpkg-deb: error: subprocess paste was killed by signal (Broken pipe) Errors were encountered while processing:  /var/cache/apt/archives/linux-image-4.4.0-176-generic_4.4.0-176.206_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)     I think the whole problem is that i don't have enough disk space on the boot partition (it only has 500mb and is currently full).  I tried a few things, including trying to purge/erase some older kernel versions, but to no avail.  For some reason when i start the computer i have to press del in order to boot the computer with some older kernel version, it got messed up (and i didn't touch the version which was active).  I hope you'll be able to help me..


A Messy Definite Integral $\int_0^1 (x\ln x)^n dx$ or a Trick?

$$\int_0^1 (x\ln x)^n dx$$   How should I proceed with the above integral? I'm actually supposed to solve it for n = 50, but I don't think reduction formulae would be a good idea (or would they?)   I couldn't establish a closed form for the above integral in terms of $n$. How do I do that? Could some please guide me in the right direction, or provide a solution for better understanding? Thanks!


I need help with following part of login php script:  $name = mysqli_real_escape_string($connection, $_POST["login"]); $password = mysqli_real_escape_string($connection, $_POST["password"]);  $sql = "SELECT FROM usersdata WHERE user_password = $password AND user_name = $name";   The server is giving me following error:      "You have an error in your SQL syntax; check the manual that   corresponds to your MariaDB server version for the right syntax to use   near 'FROM usersdata WHERE user_password = something AND user_name =   something' at line 1".   Obviously there is a error with writing php variables in query string such as they are, but I dont know exactly how i should contecate them. Its ridiciolous how SQL queries can be sometimes so frustrating when everything else is working perfectly.


Fixing some dependency issues in ubuntu 14.04LTS on a 64bit system

I have checked out the questions that seem to be related to this issue but none of the suggested fixes work. Here is the output from the following command:  sudo apt-get -f install  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following extra packages will be installed:   libc6-dev-i386   The following NEW packages will be installed:   libc6-dev-i386   0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded.   87 not fully installed or removed.   Need to get 0 B/1,148 kB of archives.   After this operation, 6,333 kB of additional disk space will be used.   Do you want to continue? [Y/n] y   (Reading database ... 484101 files and directories currently installed.)   Preparing to unpack .../libc6-dev-i386_2.19-0ubuntu6.6_amd64.deb ...   Unpacking libc6-dev-i386 (2.19-0ubuntu6.6) ...   dpkg: error processing archive /var/cache/apt/archives/libc6-dev-i386_2.19-0ubuntu6.6_amd64.deb (--unpack):   trying to overwrite '/usr/include/bits', which is also in package libc6-dev-amd64 2.19-0ubuntu6.6   Errors were encountered while processing:   /var/cache/apt/archives/libc6-dev-i386_2.19-0ubuntu6.6_amd64.deb   E: Sub-process /usr/bin/dpkg returned an error code (1)     I have tried to fix this with the following command:   sudo apt-get clean   It just returns and has no apparent effect on the problem.  Ultimately I would like to remove the i386 cross-compile libraries since I no longer use this machine for development except for occasional stuff in which the native 64bit environment is sufficient.    Any takers?  Cheers!!


Calculating the Distance Betwen two Points

Using the following routine would it be possible to find the ten nearest clincs I am using parse.com to store my info and I have long and latitude their I am using xamian.ios c#. I want to be able to just list the first ten ares that match one being passed in with just using long and lat ?   I am very basic at maths so if any formulas need using can an example be provided thanks.  public async void populateFromParseLocalDB() {         var query = ParseObject.GetQuery ("clinics");         IEnumerable<ParseObject> results = await query.FindAsync();          int i=0;          foreach (var record in results)         {             i++;             Console.WriteLine("in for each");             var name = record.Get<String>("Name");             var lat = record.Get<string>("lat");             var lng = record.Get<string>("lng");             Console.WriteLine(name);         }          int mycount = i;     }


$p(x)$ divided by $x-c$ has remainder $p(c)$? [Polynomial Remainder Theorem]

This is from Pinter, A Book of Abstract Algebra, p.265.   Given $p(x) \in F[x]$ where $F$ is a field, I would like to show that $p(x)$ divided by $x-c$ has remainder $p(c)$.  This is easy if $c$ is a root of $p$, but I don't see how to prove it if $c$ is not a root.


Login required moving to Super User on iPad

When moving around the sites on Stack Exchange using Safari on my iPad (not the Stack Exchange App), I am fine when moving to any site other than SuperUser.  When logged in, I can switch sites and stay logged in, but when I switch to Super User I need to log in again. If I choose not to log in and switch to another site, I am logged in there. Is there a problem with the login handling for Super User? If it helps, I log in with a Stack Exchange account, not through Facebook or Google. Update After getting fed up with the problem, I took the advice given in the answer below which was to use Chrome, and the problem still exists. The same goes for Firefox. Have I missed something?  As you can see from the screenshots below, there are no cookie settings to be found. Chrome for iOS settings page  Privacy settings page  Content settings page  Google app settings page


Feed page contains to much empty space:        Existing items in the feed could have more suitable width.   App Version: 1.0.89 Device Manufacturer: samsung Device Model: Nexus 10 OS Version: 5.1.1 (2640980)


Why do 'vote up' and 'vote down' buttons show up on one's own answers?

Right, every beginner answerer on this site has probably tried to upvote their own post, only to be greeted with a stern message saying that 'you can't vote for your own post'.   I was wondering, surely it would be much easier to not have the voting buttons show up on a user's own post? At the moment they are there, but when you click on them it just selects for a second and then undoes itself, showing the message. What is the rationale behind this?  In my opinion, it would just be easier to disable those buttons where applicable.


If $b_j>0$ for all $j$ and $\sum b_j$ diverges, let $s_j = \sum_{l=1}^j b_l$, what can we say about the convergence of $\sum \frac{b_j}{s_j}$

See the title. I have no clue how this can be done. Gut feeling tells me it probably diverges? But since this is math, unfortunately gut feelings don't count... Can someone give a hint? I want to try to work this out myself.


Is natural selection still at work in humans in the 21st century?

There has been some disussion on this site about some aspects (e.g. evolution of , or , or the , or evolution ). My question is really more general regarding evolution and more specific regarding the current age. I'm looking for answer with references to original research if possible.


what options are there to edit and view MS-Office documents (Excel, "doc", "Ppt") at Ubuntu phone?  There's really no information on the topic in reviews.


I already know how to add a filepath selection to my N-Panel UI thanks to this:  But how do I access the selected path? I would love to print out the selected path.


Trying to get title of a short story from the 40's or 50's where four people from a repressive earth society land on an alien planet, fall into a giant amoeba like alien, two of them fight the other two for freedom rather than return to earth. By Tenn? or Kuttner?


If $\sum a(n)$ and $\sum b(n)$ are convergent series with positive terms,can I say that $\sum a(n)b(n)$ is also convergent?


match particular url parameter and return its value

I have URL like  https://some-domain/auth/authenticate?auth=1c4cf948-0867-488d-8596&client_id=account&tab_id=0p-SoVza1Sw  I want to get the value of tab_id by using regex.  I have done it through JS but I want a regEx to return 0p-SoVza1Sw.  I tried this /tab_id=([^&]+)&*/g but it matches with tab word also  I know it would be easy but am not good at regex, Thank you


Is there hotkey to bring up the network connections popup on Windows 7 and 8?

My question is clear with an image:    Is there any hotkey to use instead of mouse clicking the network connection icon in the tray?   Without the hotkey, I have to press Win+B, right arrow several times, then Enter, very cumbersome.  That popup is impoooortant because when I want choose a Wifi SSID to connect, that seems to be the only GUI way.    Oh yes, as some veteran user points out, rundll32.exe van.dll,RunVAN is the right answer for me.


Let $X_1$ ,$X_2$ be two r.v.'s with joint and marginal ch.f.'s $\phi_{X_1,X_2}$, $\phi_{X_1}$ and $\phi_{X_2}$. By an example, show that  $\phi_{X_1,X_2} (t,t) = \phi_{X_1} (t) \phi_{X_2} (t)$   $\quad \forall t \in \Bbb R$ does not imply independence of $X_1$,$X_2$


Is the set of all bounded sequences complete?

Let $X$ be the set of all bounded sequences $x=(x_n)$ of real numbers and let $$d(x,y)=\sup{|x_n-y_n|}.$$ I need to show that $X$ is a complete metric space.  I need to show that all Cauchy sequences are convergent. I appreciate your help.


I think it would be useful to add an "Answer Later" tab that would be similar to the "Favorites" tab so you could mark questions to answer at a later time. There are so many times I see a question which I would like to answer but don't have time, then I have a hard time finding it again later. Right now I mark it as favorite, go back and answer it, then unmark it as favorite (unless I really like the question).  Do you think other people might find this useful? Do you do this some other way?


Boot Live CD into 'Try Ubuntu' by default

I am creating a custom live CD based on Ubuntu 15.10. When the user sees the first boot screen (and doesn't press a key), it will automatically boot into a GUI menu where the user can choose 'Try Ubuntu' or 'Install Ubuntu':    However, if the user presses a key, it gets a text menu. Selecting 'Try Ubuntu' boots directly into the desired live CD:    I can successfully remove the installer boot entries in the text menu (isolinux/txt.cfg), but this doesn't change the default boot option when the user does not press any key. Removing the installation package ubiquity is not an option, I just want to prevent the user from starting the installer directly.  How can I change the default boot option to boot into 'Try Ubuntu'?


What is the typographically correct way to typeset name initials?

Sometimes I found that writing just "J. Doe" may lead, in a justified line with few words, to a big space between the initial and the surname. Using J.\,Doe looks ok but I would like to know if there is a general rule for spacing between initials and surnames.


Gravitation: To find acceleration of a particle as a function of distance from centre of a tunnel dug along two points on Earth's surface

Suppose a smooth tunnel is dug along a straight line joining two points on the surface of the earth and a particle is dropped from rest at its one end. Assume that mass of earth is uniformly distributed over its volume. Prove that the acceleration of the particle will be proportional to its distance from midpoint of the tunnel.  I have tried to find velocity using  energy conservation and then differentiate to get acceleration.But I am not getting it right.  Any help is appreciated.


What is the blood status of a person born to a half-blood and pure-blood?

I see that people born to parents who are both magical are pure-bloods, if either of the parental sides is muggle they are half-bloods, and if both the parents are muggles, the child is muggle-born.  But what is the blood status of the child born to a half-blood and a pure-blood? Since there are muggles in the ancestral line is he/she still a half-blood, or considering that both the parents are magical, is he/she a pure-blood?


I've been trying to find png image files a certain height (over 500px).  I know that file will return image dimensions.  Example:    $ file TestImg1a.png  TestImg1a.png: PNG image data, 764 x 200, 4-bit colormap, non-interlaced      But I need to use this to find all files in a directory with a height over 500px.  I know how to print out all files regardless of height:  find . -name '*.png' | xargs file | awk '{print $7 " " $1}'   But how do I limit the $7 to those results greater than 500?


Sum of Independent, Mean Zero, Finite Variance Random Variables

Let $X_1, X_2, ... , X_n$ be a sequence of Random Variables:  Each has Mean Zero : $\mathbb{E}[X_i] = 0$ for all $1 \leq i \leq n$. All are independent. All have finite variance uniformly bounded: $\text{Var}(X_i) \leq \rho_{\max}$. They are all discrete. Each of their support set is a subset of $[-\rho_{\max}, + \rho_{\max}]$.  The last two points might be irrelevant. In any case, I want to analyze \begin{align} \mathbb{P}\left (\sum_{i=1}^n X_i \in [-\epsilon, 0] \right )   \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, (1) \end{align} where $0 < \epsilon < \rho_{\max}$. Here's some intuition about what the answer should be: The larger the $n$, the more spread out the variance of the sum. Therefore, $(1)$ should decay with $n$. Specifically, I am looking for $\frac{1}{\sqrt{n}}$ decay. Also, I want the answer to uniformly hold for all sequences of random variables fitting the description. In other words, if the answer is $\frac{c}{\sqrt{n}}$, I should be able to say that for sufficiently large $n$, \begin{align} \mathbb{P}\left (\sum_{i=1}^n X_i \in [-\epsilon, 0] \right )  = \frac{c}{\sqrt{n}} \end{align} holds for all $X_1, X_2, ..., X_n$ sequences of zero mean, independent and finite variance RVs. Are there any existing theorems to analyze such a sum? Edit: the random variables are not identically distributed.


X-Men : Days of Future Past - Kitty Role

I was thinking Kitty aka Shadow Cat, her only power was that she can move through objects or let objects pass through her or go through walls and ceilings. In the new X-Men movie Days of Future Past, i see her sending wolverine's mind to past. Is that her ability which she had orginally or it was just an ability that they have created for the movie ?


Suggested edit rejections for concurrent edits should not count for the suggested edit ban

Sometimes a suggested edit is  because of a concurrent direct edit that takes precedence.  Since this is no fault of the edit suggestor, such rejections should not count against the suggestor when counting .  Here are some examples where it happened:


$\{f \in C^1([0,1]): \|f\|_\infty + \|f'\|_\infty \leq \gamma\}$ is a compact subset of $C[0,1]$

A textbook I'm reading states the set $A = \{f \in C^1[0,1]: \|f\|_\infty + \|f'\|_\infty \leq \gamma\}$ is compact in $C[0,1]$ with the sup norm. Here, $\gamma$ is a positive constant. Well, by Arzela Ascoli, as this set is equicontinuous and uniformly bounded in $C[0,1]$, any sequence in this set has a subsequence which converges uniformly to a function in $C[0,1]$. What I'm having trouble proving is that this limit is in $A = \{f \in C^1[0,1]: \|f\|_\infty + \|f'\|_\infty \leq \gamma\}$. I don't see why this limit is necessarily differentiable in the first place. If $f_n \in A$ for all $n$ and $\|f_n - f\|_\infty \rightarrow 0$, then for $f$ to belong to $A$, it would be enough if $\{f_n'\}$ was a Cauchy sequence. (Then $f'$ must necessarily exist and be the limit of this sequence) - but again, I don't think this is true.


I made an account for Pokemon go and when i went to the loading screen today, it said it couldn't load and it gave me an option to sign out...so I did to see if I could reload the game and maybe it would let me on, but now every time I put my username and password in and I click the sign in button, it says "unable to authenticate. please try again" and I try and try but it never lets me in. PLEASE HELPPP!😁


When app is moved to SD card, where is the app data stored on SD card?

My phone (Sony E4g, running Android 4.4.4) offers the possibility of moving some of the installed apps partially onto the (removable) SD-card. I use this feature regularly, and -in theory- quite a big part of the apps are already moved on it. My problem is however that I can't find these anywhere on the SD-card, and there are no separate partitions on the card either. So my question is: where exactly are this moved apps stored on the external storage in KitKat ? Thanks.


I am programming an iPhone app, and I need to force it to exit due to certain user actions.  After cleaning up memory the app allocated, what's the appropriate method to call to terminate the application?


Identify book with different races that have only one sense each but must cooperate in competition

I'm trying to identify a book, where several different races (I think at least 3) who all have just one particular sense (seeing, hearing) must cooperate as a mixed group in some kind of competition or race that involved navigating a kind of obstacle course, building, or maze, that possibly involved challenges, where each of the senses and sometimes their combination was necessary to advance.  I think the races initially hated each other (prejudices), but the representatives of at least one group involved in this competition learned to respect each other during the events.  Must be older, before 80s. I read the novel in German, but it was translated from English, as most SF here was at this time. I've no idea if it was aimed at adults or young adults. I don't remember names. I don't remember the perspective. The race was at least a substantial part of the book. It might have been a small book. That's about all I can remember.


whats the best way to bottle home made condiments and spice rubs?

A jar of harissa made by me just exploded at a friends house, why would this happen?


Can this set of subsets of $\mathbb{N}$ be uncountable?

Let $S$ be a collection of subsets of $\mathbb{N}$ such that for every $A, B ∈ S$ we have $A ⊂ B$ or $B ⊂ A$. Can $S$ be uncountable?  I think we don't have to be concerned about elements of $S$ which are finite subsets of $\mathbb{N}$, as finite subsets can be listed by their size according to this property. But I am not sure how to treat infinite subsets.  It would be much appreciated if comments and answers come in the form of hints rather than complete solutions as I think I'd benefit more that way.


nginx is unable to open (and thus serve) files despite proper filesystem permissions

After a fresh installation of nginx 1.4.7 on Fedora 20 I added two additional locations to the the default location:  user  neradis; # I also tried the 'root' user here and commenting this directive out, to no avail worker_processes  1;  [...] http {  include       /etc/nginx/mime.types;     default_type  application/octet-stream;  log_format  main  '$remote_addr - $remote_user [$time_local] "$request" '                   '$status $body_bytes_sent "$http_referer" '                   '"$http_user_agent" "$http_x_forwarded_for"';  access_log  /var/log/nginx/access.log  main;  sendfile        on;  [...]  index   index.html index.htm;  server {     listen       80;     server_name  localhost;     root         /usr/share/nginx/html; autoindex    on;      location /music/ {         root    /home/neradis/audio;     autoindex    on;      }  location /nginx_test/ {         root /;       autoindex on; }       error_page  404              /404.html;     location = /40x.html {     }      error_page   500 502 503 504  /50x.html;     location = /50x.html {     } } }   nginx serves files from the default location /usr/share/nginx/html without problem, but yields errors denied permissions for filesystem operations (open(), opendir()) for the added locations. I am aware that every parent directory must the 'executable' for the user used by nginx, so I ensured that using namei -l:  f: /nginx_test/file.txt drwxr-xr-x root    root    / drwxrwxrwx neradis neradis nginx_test -rwxrwxrwx neradis neradis file.txt   Nonetheless, I still get a 403 response on a wget localhost/nginx_test/file.txt, finding this error in the logs:  [error] 6950#0: *1 open() "/nginx_test/file.txt" failed (13: Permission denied), client: 127.0.0.1, server: localhost, request: "GET /nginx_test/file.txt HTTP/1.1", host: "localhost"   I get the same errors for the /home/neradis/audio/music. I am puzzled what the crucial difference to the working functioning default root /usr/share/nginx/html is:  f: /usr/share/nginx/html/index.html drwxr-xr-x root root / drwxr-xr-x root root usr drwxr-xr-x root root share drwxr-xr-x root root nginx drwxr-xr-x root root html -rw-r-xr-x root root index.html   Any ideas what else might keep nginx from accessing the files?  edit (solution): The comments guided me in the right direction. The file permissions we're okay, but SELinux prevented reading the files in the new locations, as they had (SELinux) types of default_t and user_home_t, that we're forbidden for the httpd_t. I wrote my own selinux module to allow for default_t files and enabled access for the home files with setsebool -P http_read_user_content.


I don't even get what is happening with the lines how to i get rid of them?


Droid Explorer file manager not showing files

I am using Droid Explorer (WinXP 32bit) to access my 2013 Moto X - XT1053 (Anroid 4.4.4).  But the main file explorer doesn't seem to be working.  "/" is shown, but nothing else.  My device is bootloader unlocked and rooted.  Seems like adb commands are not getting through.  I have the SDK installed as well as the official Motorola usb drivers.


Mac Program to Get the Latex code of a PDF

I am writing a math paper that uses some long equations from PDFs. Are there any converters from Pdf to Latex?


How to get color of pixel in coordinates 123, 456 in screen?

My AppleScript app needs to get color of pixel in coordinates 123, 456 in screen.


Used this question to install LAMPP:    Several problems have cropped up and I want to start over. How can I remove everything?  Tried the suggestions in several other answers given on Ask Ubuntu, including:        But they did not work.  Any and all suggestions appreciated.


Event horizon is a region of space whereby nothing with information can escape, so I imagine that a photon falls into this region of space does it accelerates toward the singularity if it exists? Do photon inside event horizon exceeds speed of light? Case study: electron emits photon inside the event horizon, what is it frequency? I know this event can never be observed but what does the latest theory suggests?


I'm having hard time reading the output of ip a command. Normally it prints something like this:  3: enp0s25: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qdisc pfifo_fast master br0 state UP group default qlen 1000     link/ether aa:bb:cc:dd:ee:ff brd ff:ff:ff:ff:ff:ff   Which is fine.  But inside the LXC container (not always) I can see something like that:  11: eth0@if12: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qdisc noqueue state UP group default qlen 1000     link/ether XX:XX:XX:XX:XX:XX brd ff:ff:ff:ff:ff:ff link-netnsid 0     inet 10.10.44.44/16 brd 10.10.255.255 scope global eth0        valid_lft forever preferred_lft forever     inet6 fe80::24cb:a3ff:fefe:72cc/64 scope link        valid_lft forever preferred_lft forever 13: eth1@if14: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qdisc noqueue state UP group default qlen 1000     link/ether XX:XX:XX:XX:XX:XX brd ff:ff:ff:ff:ff:ff link-netnsid 0     inet 192.168.1.29/24 brd 192.168.1.255 scope global eth1        valid_lft forever preferred_lft forever     inet6 fe80::b471:7eff:fea7:a8bc/64 scope link        valid_lft forever preferred_lft forever   What is this @if1[2,4]? Moreover ifconfig always prints eth[0,1]


Suppose you have two measured (independent) physical quantities $x$ and $y$ with relative errors $r_x := \frac{\delta x}{x}$ and $r_y := \frac{\delta y}{y}$, where $\delta x$ and $\delta y$ are the corresponding absolute errors. Now you want to calculate $z = xy$ (or $z = \frac{x}{y}$).   Usually the relative error $r_z$ is calculated as   $$ r_z = \sqrt{r_x^2 + r_y^2} $$  Sometimes (usually in lower level or high school courses) it is said that you have to take just the sum of the relative errors, i.e.   $$ r_z = r_x + r_y $$  For example for the product this seems easy to derive:  $$ \begin{align} (x + \delta x)\cdot (y + \delta y) = xy + x \delta y + y \delta x + \delta x \delta y \\ (x - \delta x)\cdot (y - \delta y) = xy - x \delta y - y \delta x + \delta x \delta y \\ \end{align} $$  Subtracting both equations you get for the right side: $2(x\delta y + y \delta x)$ and half of it seems to be a good measure for the absolute value of $\delta z$. So you get for the relative error $r_z$  $$ r_z = \frac{\delta z}{z} = \frac{x\delta y + y \delta}{xy} = \frac{\delta y}{y} + \frac{\delta x}{x} = r_y + r_x $$  What's wrong with this reasoning?  What is the correct formula and why? Are there different domains of application of both formulas?


Err:10 ... precise Release 404 Not Found

I am facing this problem on Ubuntu 20.04:  Err:9 http://ppa.launchpad.net/faux/jailkit/ubuntu focal Release   404  Not Found [IP: 91.189.95.83 80] Ign:7 https://www.tolaris.com//apt precise InRelease Ign:8 https://www.tolaris.com//apt fossal InRelease Err:10 https://www.tolaris.com//apt precise Release   404  Not Found [IP: 35.246.229.84 443] Err:11 https://www.tolaris.com//apt fossal Release   404  Not Found [IP: 35.246.229.84 443]  And I don't know how much this affects the server. Because I install Webmin-Virtualmin and see that it uses apt, too in install modules and update. How can I solve that? I have not seen anything about it in web search and studies.


Writing a bash script to run a java program with command line arguments?

I have written a java program that maintains a database for bank accounts (This is a course assignment) and I want to create a bash script to run. Upon running the program, you have to input "i", "h", "t" or "?" to get it to perform a task. I would like to take those command line arguments and use them for when running this program in bash. For example, if the script were named accounts, I want to be able to type accounts -i and the script would launch the program with the i command already input and perform the task for that argument? How would I go about doing that?


Selenium Webdriver - Pagefactory - TestNG - NullPointerException

This is my code:    public class Init{     public static WebDriver driver;     @BeforeSuite     public static void init_method1(){         System.setProperty("webdriver.ie.driver", "//Provide IEDriverLocation//");         driver = new InternetExplorerDriver();       }  }  public class B{     @FindBy(xpath="XXXXxxxxxx")     WebElement b_obj;      public B(){         PageFactory.initElements(Init.driver, this);     }         public void b_method1(){         b_obj.sendkeys();     }  }  public class C{     B b =  new B();     @Test     public void c_method1(){         b.b_method1;         } }   In TestNG.xml,  <class name= "Package1.Init"></class> <class name= "Package1.C"></class>   Error:     java.lang.NullPointerException    at   org.openqa.selenium.support.pagefactory.DefaultElementLocator.findElement(DefaultElementLocator.java:69)     at   org.openqa.selenium.support.pagefactory.internal.LocatingElementHandler.invoke(LocatingElementHandler.java:38)     at com.sun.proxy.$Proxy9.isDisplayed(Unknown Source)    at   org.openqa.selenium.support.ui.ExpectedConditions.elementIfVisible(ExpectedConditions.java:302)     at   org.openqa.selenium.support.ui.ExpectedConditions.access$100(ExpectedConditions.java:41)     at   org.openqa.selenium.support.ui.ExpectedConditions$10.apply(ExpectedConditions.java:288)     at   org.openqa.selenium.support.ui.ExpectedConditions$10.apply(ExpectedConditions.java:285)     at   org.openqa.selenium.support.ui.FluentWait.until(FluentWait.java:238)     at Package1.B.b_method1(B.java:8)   at Package1.C.c_method1(C.java:3)     at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)  at   sun.reflect.NativeMethodAccessorImpl.invoke(Unknown Source)   at   sun.reflect.DelegatingMethodAccessorImpl.invoke(Unknown Source)   at   java.lang.reflect.Method.invoke(Unknown Source)   at   org.testng.internal.MethodInvocationHelper.invokeMethod(MethodInvocationHelper.java:104)     at org.testng.internal.Invoker.invokeMethod(Invoker.java:645)   at   org.testng.internal.Invoker.invokeTestMethod(Invoker.java:851)    at   org.testng.internal.Invoker.invokeTestMethods(Invoker.java:1177)  at   org.testng.internal.TestMethodWorker.invokeTestMethods(TestMethodWorker.java:129)     at   org.testng.internal.TestMethodWorker.run(TestMethodWorker.java:112)     at org.testng.TestRunner.privateRun(TestRunner.java:756)    at   org.testng.TestRunner.run(TestRunner.java:610)    at   org.testng.SuiteRunner.runTest(SuiteRunner.java:387)  at   org.testng.SuiteRunner.runSequentially(SuiteRunner.java:382)  at   org.testng.SuiteRunner.privateRun(SuiteRunner.java:340)   at   org.testng.SuiteRunner.run(SuiteRunner.java:289)  at   org.testng.SuiteRunnerWorker.runSuite(SuiteRunnerWorker.java:52)  at   org.testng.SuiteRunnerWorker.run(SuiteRunnerWorker.java:86)   at   org.testng.TestNG.runSuitesSequentially(TestNG.java:1293)     at   org.testng.TestNG.runSuitesLocally(TestNG.java:1218)  at   org.testng.TestNG.runSuites(TestNG.java:1133)     at   org.testng.TestNG.run(TestNG.java:1104)   at   org.testng.remote.AbstractRemoteTestNG.run(AbstractRemoteTestNG.java:132)     at org.testng.remote.RemoteTestNG.initAndRun(RemoteTestNG.java:236)     at org.testng.remote.RemoteTestNG.main(RemoteTestNG.java:81)


Basically I want to make a video with a moving picture that moves with a person in a video's head.


How do I export a variable to the `sh` shell?

Calling export MYVAR=/path/to/whatever from .bashrc obviously works for bash but not for the sh shell.  Unfortunately, the Matlab launcher seems hell-bent on using sh and not bash.  As such, the simplest way to export an environment variable such that it is accessible from Matlab would be to export said variable to sh.  How can I persistently export an environment variable to sh?


Is a function that maps every compact set to a compact set continuous?

A continuous function maps a compact set to a compact set. Is the converse of this true? That is, is a function that maps every compact set to a compact set necessarily continuous?


What's an easy way to compare case insensitively of strings?

Trying to compare strings using:  !(stringvector[i]).compare(vector[j][k])    only works for some entries of  vector[j][k]    -- namely ones that are a case sensitive string match.   How do I get case-insensitive matching from this functionality?  Here is a bit of code I was working on  #include <iostream> #include <vector> #include <string>  using namespace std; //poor form   vector<string> stringvector = {"Yo", "YO", "babbybabby"}; vector<string> vec1 = {"yo", "Yo" , "these"}; vector<string> vec2 = {"these", "checked" , "too" , "Yo", "babbybabby"}; vector<vector<string>> vvs = {vec1, vec2};  for (int v = 0; v < vvs.size(); v++) //first index of vector {     for(int s = 0; s < vvs[v].size(); s++) //second index of vector         {              for(int w = 0; w < stringvector.size(); w++)             {                 if (stringvector[w] == vvs[v][s])                 {cout << "******FOUND******";}             }      } }   This doesn't print out FOUND for the case-insensitive matches.  Stringvector[w] == vvs[v][s] does not make case-insensitive comparison, is there a way to add this functionality easily?  --Prof D


You know how when you look out into a field of grass you see waves of the gusts blowing along? How do you create that in Blender?


How to Display Shortcode in the correct location, currently displaying before content after Page Title?

I am having an issue displaying the shortcode in the correct location when using a display child pages query.   Can someone fix this for me? Thank you!        function show_product_pages() {  global $post; $child_pages_query_args = array(     'post_type'   => 'page',     'post_parent' => $post->ID,  ); $child_pages = new WP_Query( $child_pages_query_args );  if ( $child_pages->have_posts() ) : ?>
 <?php  while ( $child_pages->have_posts() ) : $child_pages->the_post();     ?>
             <a href="<?php the_permalink(); ?>">
<?php the_post_thumbnail(array(240, 240)); ?>

<?php the_title(); ?>

<?php the_content($post->ID); ?>
             <a class="cta-link" href="<?php the_permalink(); ?>">Learn More
 <?php endwhile; ?>
 <?php endif; wp_reset_postdata(); } add_shortcode('show_product_pages', 'show_product_pages');


When one writes a noun after a dependent clause, should that noun be preceded by an "a" or an "an". "That was an, to be quite clear, extremely clever idea." Or: "That was a, to be quite clear, extremely clever idea."


I've just run into  asked in 2008. It has an accepted answer, which was good until 2009 when namespaces were introduced into PHP 5.3. But since 2010 it is no more correct, see .  It may not be the best example, but the point is:  What to do with obsolete posts that are no more correct?  They are usually inactive for months or years. Due to the time, the obsolete posts usually have many upvotes and only archaeologists bother to dig in them, but they have many views and the better the Google index them. In ten years, SO might be flooded with outdated, no-more-valid posts.


How can I check if a string is a number in Python?

In python. If I have a string, how can I check if the string is a number or not? string1 = "1" (True) or string2 = "h" (False) string3 = "2g" (False). I tried to check if it is a letter but it doesn't work, the string also can be "," "." or " " and then it won't work.


Using try-finally block inside while loop

I am trying to understand the mechanism when i use finally inside a while loop.  In the below code. In finally line prints and than the while breaks. I was expecting the code not to reach the finally block. Or if it reaches the finally block, there is no break there so the while should continue.. Can anyone explain how this works ?           while(true){             System.out.println("in while");              try{                 break;             }finally{                 System.out.println("in finally");             }          }         System.out.println("after while");   Output is   in while in finally after while


"A myriad of emotions 'greet/greets' me"

Here, "myriad" is a noun, and I suppose "myriad of emotions" is a prepositional phrase, so presumably the verb must agree with "myriad"?


Trying to make file executable on USB, but the permission doesn't "stick"

Possible Duplicate:          I'm using  as my password manager, and I use  for multifactor authentication. On Windows this was no problem, but I alternate between Windows and Linux computers, so I need to have Sesame available for both cases.  On my laptop I'm running Ubuntu 10.10, and I downloaded the 32bit LastPass Sesame (Ubuntu 10.04 LTS) and moved the files (an executable and a .bin) to my USB device. As instructed, I tried to run chmod +x sesame on the executable (whose name is sesame).  I tried this from the terminal window, but when doing an ls -la afterwards I noticed that the permissions on the file hadn't changed a bit. I tried doing the same adding sudo at the start, but that didn't make any difference either (and I didn't get any kind of error message or anything). I also tried doing it the "graphical" way, by right-clicking on the executable in Nautilus > Properties > Permissions, and trying to check off the Allow executing file as program check box - the checked marked only disappeared again after a second.  If I moved the same executable to my hard drive, it worked very fine to make it executable (and execute it).  I'm not really experienced with Linux, so I suspect I'm missing something obvious. Might it have something to do with the USB being fat32 (but I thought files on a fat32 partition should be executable by default?), and if so - what are my options?  And just to have said it: it works very fine to run the Windows version of Sesame using Wine, but it's a bit of a hassle (at least if I need it somewhere Wine isn't already installed).


I have a trouble about structs. I have two structs and one of them includes a pointer member that points to other one and this situation is valid for both.  For example,  struct A{      B *x; }  struct B{      A *y;  }   Finally, I tried to put these two structs into a big struct because member of a struct can see another member of it ,but I cannot handle this problem.


How to inject HTML code into every delivered HTML page?

I've got an Apache web server that delivers static HTML pages. For some reason I can't change the files themselves, but I still want to inject some HTML into every page that is being served.  Is this possible with mod_proxy? If not, could anyone recommend a software  that provides such a feature?  EDIT:  I have to insert some kind of banner ad (e.g. a javascript) and a tracking pixel.


Are the eigenvectors in the bases for the eigenspaces of a matrix linearly independent?

Okay, so I know that a basis consists of linearly independent vectors. But when you're talking about multiple bases for multiple eigenspaces of a matrix, I want to know if all vectors in all these bases are linearly independent? For example, if a basis for an eigenspace of a matrix A is B = {v1, v2), and a basis for another eigenspace of A is B' = {w1}, are v1, v2, and w1 necessarily linearly independent?  I'm trying to understand a few concepts regarding eigenspaces in my book, and it seems like if this is true it would make a few things I'm confused on make sense. So I'm just wondering if this is, in fact, the case?


Can I upgrade RAM to 8GB in a Sony VGN Z620D notebook?

The marketing specs say 4GB max but the marketing specs also indicate Windows Vista 32bit (or Win XP) which might be the limiting factor.  Can I upgrade (or at least safely attempt without damage to laptop or new RAM)?  I was planning a new O/S install to overcome memory limitations on that end, then install 8GB instead of the 4GB max.  Ideally, I'd hope to hear from someone who has a Vaio and has done this.  If personal experience is not available, then I was hoping for an authoritative source on the safety of using more RAM than 'allowed'.  I've read lots of opinions on the internet (including here) but nothing that made me feel confident, including the other answers.  I realize the answer might be, "you'll never know until you try" but I was hoping someone else had tried first.  If no one has done this and can tell me, then that probably gives me my best answer even though, "it might work".


History of changes to a particular line of code in Subversion

Is it possible to see the history of changes to a particular line of code in a Subversion repository?  I'd like, for instance, to be able to see when a particular statement was added or when that statement was changed, even if its line number is not the same any more.


Light on object glitching when switched to Rendered

This weird glitch with the lighting occurs when i switch to rendered in the viewport, i'm a beginner at this so i'm not too sure why this is happening.  Glitch in Rendered  Solid


Can a caster use a readied spell to counterspell a lower (less potent) version of the same spell?

I have a scenario that will likely never happen, but I am curious in how it would work. First, the preliminary, :  The effects of different spells add together while the durations of those spells overlap. The effects of the same spell cast multiple times don't combine, however. Instead, the most potent effect — such as the highest bonus — from those castings applies while their durations overlap, or the most recent effect applies if the castings are equally potent and their durations overlap.  Now the setup: Bob the 3nd-level Generic Wizard and Doug the 3rd-level Earth Wizard face off. Bob knows Doug's favorite tactic and readies a spell. Doug casts  under Bob. The spell say, "You cause a tremor in the ground within range. Each creature other than you in that area must make a Dexterity saving throw." But Bob was ready and casts Earth Tremor as a 2nd-level spell for his reaction making it more potent (more damage) in the same area. So what happens? Doug's casting means Doug is not targeted by the tremor. But as a reaction Bob casts a more powerful version where Bob is not targeted by the spell. So does that overpower Doug's spell? And if so, does that mean Bob no longer has to make a Dexterity save and Doug does? There may be other spells that do this but Earth Tremor was the first I found with wording stating that regardless of the target point, the caster is not affected.


Using UNC pathname with Calculate Field tool in ArcPy?

This question is different to  which was asked previously because it is using the Python parser specifically, rather than VB.  Syntax calculates the field correctly within tool (see raw below).  Copy the python snippet directly from the results window to migrate into main script, and the syntax returns as invalid.  Not sure how to fix.  Raw (working):  "\\\\ftp\\raw\\" + "20160206" + "\\Win\\Charles\\" + !NAME! + ".shp"   Copied snippet verbatim (Invalid):  arcpy.CalculateField_management(outShp, "Link", """"////ftp//raw//" + "20160206" + "//Win//Charles//" + !NAME! + ".shp"""", "PYTHON_9.3","#")   Having trouble getting it to run properly, have tried adding 'r' and using different combinations of escapes and it just won't run.


How do i upgrade my Ipad to a specific software without a computer?

I have an Ipad that has ios 9.3.3 as the software version and i need your help because i want to update only to ios 11 and to update to ios 12, it says i need a computer so I need your help


Unable to boot into ubuntu after windows update

I used to have a dual boot option on my pc until the latest update of windows. The two boot options were: Windows 10 and ubuntu MATE. After the windows update No.1703 I am unable to boot into ubuntu.  Below you can find a link coming from boot-repair where it seems like the ubuntu partition(sda4) is not recognised.  Link to boot-repair:   Does anyone have the same problem and can provide a solution?  Regards.


Best way to empty browser cache when developing/testing LWC?

I am developing a LWC, using Visual Studio, so I am frequently deploying JS, HTML and CSS file to the org. As a browser I use Chrome (latest version) under Windows 10.  What I am seeing: not updated or even previous versions of JS/HTML/CSS being active instead of the most recent sources. As a standard procedure I press Ctrl-F5 everytime the deploy is completed, but that is not always enough. Sometimes I have to restart the browser and even then it does not always work.  What is a sure-fire way of making the browser use the latest sources?


How do I make a second window snap to the opposite side of the screen?

I'm coming from Windows 10, although I've started (and accepted) the way Ubuntu works, their are still a few things that I love about Windows 10, the feature in question here is the way If I snap one windows to the extreme right side of display it takes up the right half portion of the display (which is also similar in ubuntu) but another app in background takes the left half of display and doesn't need to manually do that.    In this picture, if I snap the Browser windows to the right, Nautilus window wouldn't affect by the action, But I want it (nautilus window) to snap to left  Details   Ubuntu 17.04 Gnome flavour    Update  result of the fillscreen.py script    in first try fillscreen notification came (I couldn't capture that) and it moved the 2nd window (window in the right) in a box, and 1st window wasn't affected at all.    in second try, this offset was present, but it did work (and it mostly works)


I was going through the Wikipedia page of multiple integrals () and noted that it states that antiderivative is only valid for single variable integrals. I was interested to know Why can't we apply concept of antiderivative to multiple integral? This Wikipedia page was where I first read about this topic and don't have sufficient knowledge regarding it so would request an explanation for naives.