I'm just getting access to the Polymorph spell this level, and I'm curious about beasts with innate capabilities.  are probably the strongest example:     Innate Spellcasting (Psionics). The swarm’s innate spellcasting ability is Intelligence (spell save DC 13). As long as it has more   than half of its hit points, it can innately cast the following   spells, requiring no components:      At will: command, comprehend languages, detect thoughts      1/day each: confusion, dominate monster   Do you have access to a monster's innate capabilities while you are polymorphed into them? I'm interested in learning the answer for all monster traits in general, but I'm particularly focused on spellcasting.

One of the limitations of using Wild Shape is that, in most beast forms, a druid cannot talk, as per the PHB:     You can’t cast spells, and your ability to speak or take any action that requires hands is limited to the capabilities of your beast form. (my emphasis)   One of the key benefits of Wild Shape is scouting ahead for the party, and it turns out the Cranium Rat (from Volo's Guide to Monsters) is ideal for this:   Rats are commonplace creature in many towns or dungeons, and are therefore less prone to generate suspicions even if detected. Darkvision is a benefit in dark places. No extra Stealth bonus, but +2 from DEX is still a bonus. Telepathic Shroud makes it immune to emotion-sensing, mind-reading and divination spells.   Many animal shapes have great scouting abilities, but the Cranium Rat even has the ability to use Telepathy for up to 30ft, potentially allowing the druid to communicate secretly with the party, relaying information about what it sees.  I'm still baffled that the Cranium Rat is categorized as a beast, and not as a monster of some kind, but it's a beast per the RAW. Since the Telepathy ability of the Cranium Rat is a "capability of the beast form", does this mean that a druid can indeed use Telepathy when transformed into a Cranium Rat?


When I open Pokemon GO all I get is a black screen and then the app closes. I have a iPod 5th gen. I've been looking forward to this game for a long time so how can I fix this?

Long story short, I have an iPod 5, and I've been excited for this game for about a year now. I keep getting a GPS signal not found. Can I play under wifi or some sort of cellular data?


I'm opening firefox via the terminal using  firefox   but I can not type any other command after this one since I don't regain control of the terminal after having typed that.  The only way to do so (for me) is to press CTRL + Z but then firefox freezes.  I'm using Lubuntu and am not totally new to it but haven't used it as much as Windows.

How do I run a program in the background of a shell, with the ability to close the shell while leaving the program running? Lets say my UI is having problems or for some reason, I need to boot up a program from the terminal window, say, nm-applet:  nm-applet   When it's started, it occupies the foreground of the terminal window.  Is there any simple way to run the program in the background without needing to leave the terminal open or have it occupy the whole terminal?  On that note, I did find a way to run programs from the terminal and have it allow for other inputs, by appending an ampersand (&) to the command as such:  nm-applet &   But this isn't much use as any processes started in the terminal are killed once the terminal is closed.


In .NET Core C#, how do I parse this Date string: 'Jun 3, 2021 4:36:56 PM EDT' Tried this with Culture en-US, and it does not work: DateTime.ParseExact("Jun 3, 2021 4:36:56 PM EDT", "MMM dd, yyyy hh:mm:ss tt K", CultureInfo.CurrentCulture);  Thanks, Jim

I'm trying to parse an international datetime string similar to:  24-okt-08 21:09:06 CEST   So far I've got something like:  CultureInfo culture = CultureInfo.CreateSpecificCulture("nl-BE"); DateTime dt = DateTime.ParseExact("24-okt-08 21:09:06 CEST",     "dd-MMM-yy HH:mm:ss ...", culture);   The problem is what should I use for the '...' in the format string? Looking at the  MSDN page doesn't seem to list a format string for parsing timezones in PST/CEST/GMT/UTC form.


How does a clan start a clan war? And how do its members become eligible?  I had my own clan including 10 members but we could not start a war. I left the clan and joined another on a preparation day 'till war started but I was not able to be in the war. .

I am currently in a clan with three members. When we tried to initiate a clan war it said we had insufficient clan requirements. Does anyone know what the full requirements are? Is there a minimum clan member requirement?


I have this situation in which the same command/program (eg: myScript) is present in two locations, /usr/bin and /usr/local/bin. Both these locations are in the PATH.  When I run   $ myScript    How do I know from which location myScript will be picked up? Can I force the use of one of the locations (without having to delete myScript from one of the locations)?

I'm wondering if $PATH cascades entries. You'll all need to take a leap of faith with me here, but here it goes.  Let's say we have a Java executable at /usr/bin/java but this version is very old and outdated. Unfortunately, we don't have su access so we can't just replace it. We can, however, download the current version of the JRE/JDK locally and point to the updated version. My question is, how does bash handle the case where we have two or more executables with the same name but in two or more different locations? Does bash somehow choose which one to execute when we type java into the console? Assuming /usr/bin has many other executables that we need, how would the $PATH look for something like this to work correctly?  Ideally, when we type java -version we should see:  java version "1.8.0_45" Java(TM) SE Runtime Environment (build 1.8.0_45-b14) Java HotSpot(TM) 64-Bit Server VM (build 25.45-b02, mixed mode)   instead of  java version "1.7.0_45" Java(TM) SE Runtime Environment (build 1.7.0_45-b18) Java HotSpot(TM) Client VM(build 24.45-b08, mixed mode, sharing)   I'm sure this question has been asked before and has some type of jargon associated with it. I've poked around SE, SO, and some forums but didn't find anything conclusive.


I tried to solve it with Cauchy Riemann equations, let $f = u+iv,g=a+ib$ then we have $u_x = v_y,u_y=-v_x,a_x=b_y,a_y=-b_x$.  Consequently, since $f^{'}g$ is analytic also, we have Cauchy Riemann equation for this as well, $$(au+bv)_x=(bu-av)_y~~~~~~(au+bv)_y= -(bu-av)_x$$  After simplifying, we have $$au_x = bu_y ~~~~~~~bu_x = -au_y$$  Then i am kind of stuck here. The answer to this question is $f$ is a constant in $D$ or $g = 0$ in $D$.  Any help will be appreciated.

Show that if $\Omega$ is an open connected subset of $\mathbb C$, $f$ and $g$ are holomorphic on $\Omega$ and $\overline{f}g$ is holomorphic on $\Omega$, then $g=0$ or $f$ is constant.  If $f(x+iy)=u(x,y)+iv(x,y)$ and $g(x+iy)=u'(x,y)+iv'(x,y)$, we have $$u_x=v_y \space ; u_y=-v_x,$$ $$u'_x=v'_y \space ; u'_y=-v'_x$$  The product $\overline{f}g$ is $$\overline{f}g=(u-iv)(u'+iv')$$ $$=uu'+vv'+i(uv'-vu')$$  By hypothesis, $\overline{f}g$ is holomorphic on $\Omega$, so by the Cauchy-Riemann equations we obtain  $$(1)\space  u_xu'+uu'_x+v_xv'+vv'_x=u_yv'+uv'_y-(v_yu'+vu'_y),$$ $$(2) \space u_yu'+uu'_y+v_yv'+vv'_y=-(u_xv'+uv'_x)+v_xu'+vu'_x$$  Using the Cauchy-Riemann equations for $f$ and $g$, we have   $(1)$ reduces to $(1)' \space v_yu'=v'u_y$  $(2)$ reduces to $(2)' \space u_xv'=v_xu'$  I don't know how to arrive to the conclusion $g=0$ or $f$ is constant from here. I would appreciate any suggestions.


How can I add google drive in my finder menu so that I can directly share data to cloud like we do in Dropbox or iCloud ?

I can see Dropbox but I can't find Google Drive on my Finder. If I want to sync a file to GDrive, I have to open the folder GDrive by click on the symbol of Gdrive. It's very inconvenient.   I'm wondering if there is a way to display GDrive on the Finder, just like where Dropbox is?


System language is English. In app1 I need English, in app2 I type in Spanish. I often switch from app1 to app2. It's too depressive to switch languages when switching apps. Is it possible in some way make Windows 10 "remember" language which I use in different applications?

How can I have a different input method for each app window on windows 8. When I change input language to ENG all app window also uses this method and I don't want that. Like windows 7 that has a different input method for this purpose. thanks


I need the getter to return a double to .2 decimal spaces...  public double getPrice () {     double totalPrice = 0.00;    DecimalFormat deciFormat = new DecimalFormat("#.00");   ...  return Double.valueOf(deciFormat.format(totalPrice));   but when I check the result in my .jsp it's still only to 1 decimal space. Any and all insight would be greatly appreciated.

What I would like is a method to convert a double to a string which rounds using the half-up method - i.e. if the decimal to be rounded is 5, it always rounds up to the next number. This is the standard method of rounding most people expect in most situations.  I also would like only significant digits to be displayed - i.e. there should not be any trailing zeroes.  I know one method of doing this is to use the String.format method:  String.format("%.5g%n", 0.912385);   returns:  0.91239   which is great, however it always displays numbers with 5 decimal places even if they are not significant:   String.format("%.5g%n", 0.912300);   returns:  0.91230   Another method is to use the DecimalFormatter:  DecimalFormat df = new DecimalFormat("#.#####"); df.format(0.912385);   returns:  0.91238   However as you can see this uses half-even rounding. That is it will round down if the previous digit is even. What I'd like is this:  0.912385 -> 0.91239 0.912300 -> 0.9123   What is the best way to achieve this in Java?


I am running static content through a CDN, cdn1-cdn5 I am using such subdomains for that.  I am loading just images, CSS and JS files this way, but apparently Google has indexed some pages on subdomains and they now appear in the Google index and they are duplicates of my "normal" pages.  The thing is that CDN is set the way to have files appear on subdomains without any extra uploading of stuff, meaning subdomains are mirror copies of content that is on main site, I can't upload files to subdomains, I can upload to main site and change www to cdn1 in address bar to show the same content through the CDN as is on my site.  I have 2 questions:   how do I remove the subdomains from Google index in GWT if it only allows to write anything that goes after ` ? how do I prevent from bots indexing the pages on subdomains when I can't upload special robots.txt files or upload a google's verification files to them to prove my ownership in GWT?   Maybe there is something else that I need to know related to this matter?  UPDATE: text in bold is updated

I did a search and i found a link to my site... twice. They are exactly the same except one is www and the other is static. How do i tell google to ignore everything in my static domain?


I have about 12 lists [a, b, c, ... , z] with arbitrary elements and i´ve got a series of combinations through itertools.combinations(iterable, n) resulting in lists of combinations that match each of the original list.   The great deal now is to get a list with all the possible combinations, picking one element(combination) of each combinations list.  One simplified exemple would be:  A = [a,b,c] B = [d,e,f] C = [g,h,i]  my_iterable = [A, B, C]   And the output should be:  >>> foo(my_iterable) (a,d,g), (a,d,h), (a,d,i), (a,e,g), (a,e,h), ... , (c,f,i)   The input iterables, e.g. 'A, B & C', may have variable lengths and foo() may be a generator function.

How can I get the Cartesian product (every possible combination of values) from a group of lists?  Input:   somelists = [    [1, 2, 3],    ['a', 'b'],    [4, 5] ]   Desired output:  [(1, 'a', 4), (1, 'a', 5), (1, 'b', 4), (1, 'b', 5), (2, 'a', 4), (2, 'a', 5) ...]


In addition to showing the nominee's meta "rep" and flag weight, would it be possible to show their close/delete vote count?  It seems to me that is an important fact to know about a candidate, as presumably, it is indicative of how much "cleaning up" the user has done around the site.

This seems like a good statistic to have: it shows how much someone does several important moderation duties.  Also, the elections page shows how many flags that user made, but that's not the whole story.


How to recover/break password of Ubuntu 12.04 ?

I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution?


I am working on a module where I have to create complex nested JSON dynamically based upon configs stored in custom metadata, The metadata contains Object name, fields names as text fields.  Now the problem I am facing is I can't use Sobject get on relationship fields, it gives runtime error.  Minimum viable code to reproduce:  Opportunity opp = [Select id,Account.Name from Opportunity Limit 1][0]; opp.get('Account.Name');   Exception:      Error on line 2, column 1: System.SObjectException: Invalid field   Account.Name for Opportunity AnonymousBlock: line 2, column 1   How can I dynamically access relationship fields using Sobject get?

I have a lookup relationship.  If I just do the following query it works fine:  Sobject c = [select field__r.fieldchild__c from custom_obj where Id = :someId]; system.debug('c:' + c);   However with the following I get an error:  Sobject c = [select field__r.fieldchild__c from custom_obj where Id = :someId]; String c2 = (String) r.getSobject('field__r').get('fieldchild__c');   Error message:     FATAL_ERROR System.NullPointerException: Attempt to de-reference a   null object


My site has a lot of different content types, they all have the same fields, the only difference is the name of the content type. Is there any way to clone those content types other than create them one by one. Thanks.

I want to clone a node type and add a few fields in it. I think the simplest will be to duplicate it and start working on it.  It seems there is no official way to clone a content type in Drupal 7. Features may allow it but there is no written procedure as to how it could be done.  I've even tried  module.  What'll be best way to clone any content type in Drupal 7?


Do you die "from" or die "of" cancer? Which preposition do you use?

Why can't I say “She died from drinking 18 cans of Coca-Cola”? Instead, the correct sentence would be “She died of drinking 18 cans of Coca-Cola”. Why does that happen?


I'm trying to learn STR on my own. As I read through a few books and saw a few video lectures - I feel to really understand STR you need to really understand and appreciate precisely (and formally) how do you measure space-time coordinates (i.e. x,t say in the case of 1D)  So is a there a book or a reference which teaches/defines/explains how measurements for x and t are made in Physics and it's connection to STR a bit more rigorously.  [This is to answer why this Q is not duplicate] While there are many references already cited by people here regarding STR which I have seen - What I'm specifically looking at is a book which defines and treats the concepts & process for measuring distances and time more rigorously and how that ultimately results in development of logical basis of STR. As I trust based on my initial readings STR is ultimately closely linked to this and can't be looked in isolation. Many of the books already mentioned in previous answers might already cover this but as I have not surveyed all the books - hence asking anyone here who can guide me.   To try (as I do not understand these concepts yet) to put it more concretely - Mathematically, event = (x,t) is a particular point in the space-time continuum.  A physical event is like a "flash of a light". How do you assign a mathematical event (x,t) to a physical event?  What do you mean you have a clock at every point?  I would want to read up and understand such questions (and more) in a bit more detail and rigorously.  Thanks

I read Introduction to special relativity by Robert Resnick. It is a beautiful book as an introduction. I got insights and intuition in special relativity. I want to learn special relativity at a more deeper level. Please recommend some books/research papers for special relativity?


The  spell (PHB, p. 260)  grants you 3 duplicates.  (PHB, p. 205) says casting the same spell multiple times does not combine them.  Is there a low level way (under 10th level) through other class features to get more than just 3 mirror images or clone warriors?  I am aware that simulacrum can increase this but I am hoping for something lower level that I somehow missed.

(PHB, pg. 260) is a spell that has a casting time of 1 action, and a duration of 1 minute. My question is, can you cast Mirror image twice on successive turns, gaining 6 images by turn 2?  Sample Turns:  Turn 1: Mirror Image (3 images)  Turn 2: Mirror Image again (6 images, with 3 of them lasting 1 turn less)  Since Mirror Image doesn't require concentration, there should be no interference between the 2 casts in terms of concentration. I know that this could be up to DM Fiat, but I was wondering if there was a proper interpretation of the printed rules for this situation.


Q: Prove $f$ is a unit in $A[X]\implies a_0$ is a unit in A and $a_1, . . . , a_n$ are nilpotent. In a solution it says (): "Assume first that $f$ is a unit in $A[X]$, i.e. there exists g ∈ A[X] such that fg = 1. Equaling the zero-order coefficients of this two polynomials, we get that $a_0b_0$ = 1 in A where $g = b_0 + b_1X + ... + b_mX^m$, which means that $a_0$ is invertible in A. We claim that $a_n^{r+1}b_{m−r} = 0$ for all $0 \leq r \leq m$, and we prove this by induction on $r$. We already know that $a_nb_m = 0$, since $a_nb_m$ is the higherorder coefficient of the polynomial $fg$. Now assume that $a^{r'+1}_nb_{m−r '} = 0$ for all $r'<r$. Then $0 = a^r_n(\sum_{i+j=n+m-r}a_ib_j) = a^{r+1}_nb_{m-r}+(\sum_{i+j=n+m-r}a_ia^{n-i}_na^{m-j}_nb_j)$ where the last sum runs over all pairs $(i, j)$ such that $i+j=n+m-r$ and $j>m-r$." My question is how does this equation describe $fg$? The hightest order polynomial is $a_nb_mx^{m+n}$ and it has to equal 0 for $fg$ to be unit. The 2 largest polynomials is $(a_{n-1}b_{m} + a_n b_{m-1})x^{n+m-1} + a_nb_mx^{m+n}$ and it has to equal 0, and so on until $a_0b_0=1$ So I try to compare that with the first summation formula: When $r=0$ we get $ 0 = a^{0}_n(a_nb_m) = (1)(a_nb_m)$. That is ok. When $r=1$ there is 2 ways to sum $i+j=m+n-1$ so we get $ 0 = a^{1}_n(a_{n-1}b_m + a_nb_{m-1}) = a_n a_{n-1}b_m + a^{2}_nb_{m-1}$. But this doesnt look anything like the 2 largest polynomials of $fg$ so Im stuck. My question how is $fg$ eqaul the first sum formula?

I am trying to prove a result, for which I have got one part, but I am not able to get the converse part.  Theorem. Let $R$ be a commutative ring with $1$. Then $f(X)=a_{0}+a_{1}X+a_{2}X^{2} + \cdots + a_{n}X^{n}$ is a unit in $R[X]$ if and only if $a_{0}$ is a unit in $R$ and $a_{1},a_{2},\dots,a_{n}$ are all nilpotent in $R$.  Proof. Suppose $f(X)=a_{0}+a_{1}X+\cdots +a_{n}X^{n}$ is such that $a_{0}$ is a unit in $R$ and $a_{1},a_{2}, \dots,a_{r}$ are all nilpotent in $R$. Since $R$ is commutative, we get that $a_{1}X,a_{2}X^{2},\cdots,a_{n}X^{n}$ are all nilpotent and hence also their sum is nilpotent. Let $z = \sum a_{i}X^{i}$ then $a_{0}^{-1}z$ is nilpotent and so $1+a_{0}^{-1}z$ is a unit. Thus $f(X)=a_{0}+z=a_{0} \cdot (1+a_{0}^{-1}z)$ is a unit since product of two units in $R[X]$ is a unit.   I have not been able to get the converse part and would like to see the proof for the converse part.


Does all frequency of light travel with the same speed in a particular material like glass?  Since by cauchy's relation refractive index change with wavelength which implies the speed also changes.  But as derived from maxwells equation, the speed of light should only depent on medium through which it travel and not on its frequency or wavelength. V=1/sqrt(epsilon*mu)  Does different colours have different speed in a particular medium?

It is well known that a  can "split light" by separating different frequencies of light:    Many sources state that the reason this happens is that the  is different for different frequencies.  This is known as .  My question is about why dispersion exists.  Is frequency dependence for refraction a property fundamental to all waves?  Is the effect the result of some sort of non-linearity in response by the refracting material to electromagnetic fields?  Are there (theoretically) any materials that have an essentially constant, non-unity index of refraction (at least for the visible spectrum)?


I have a problem with VSFTPD on Kubuntu 14.04. I have the service installed, but I can't remove it from the boot system. I tried it many times with “update-rc.d -f foobar remove” but it remains booting with the system.  How do I remove VSFTPD from the boot system and starting the service manually? I searched a little, but I didn't found any solve, and I'm bored to try it.  I'm considering to switch to another FTP server if there is any easy to configure.

I read about how to enable and disable services in Ubuntu and it seems that there are different possibilities to manage them.  The first method I found is update-rc.d to add new services to startup, which aims on the /etc/init.d folder and its contents.  The other one I found is to edit .conf files in the /etc/init folder.  What's the recommended way to enable / disable / add services and why?  Could you please give a short bulletproof step by step example on how to add a service in Ubuntu and enable and disable it?


I want to implement a mechanism to compare similar / identical paths. For example, a person who makes the trip home - work every day, be able to detect these paths and create groups to compare different indicators (speed, altitude, ...).  For each trip taken by each driver is recorded with GPS coordinates along the path, so for every trip I have the coordinates along the route. Is there any algorithm to detect similarity between paths? I'm using a geospatial representation of MongoDB.  I am conducting a pre-processing on the gps data to eliminate error, consisting of round the coordinates to 3 decimal places approximately 111.32 m. Now I'm interested to know how I can consider that two paths are the same / similar to compare.  Thanks in advance.

I need to analyze data uploaded from vehicle GPS devices to detect travel patterns and then attempt to learn about the normal travel patterns for that vehicle so that predictions can be made about maintenance, refueling etc. Some vehicles are domestic (exhibiting normal home->work->home travel patterns) and some are commercial with scheduled routing. I have loaded the GPS lats and longs to a database, and then constructed an ST_LineString with the data points for each vehicle (approx 1k points per vehicle per day). Vehicles will never have identical travel patterns (GPS accuracy, irregular ping times etc) and the patterns will be visible as subsets of pings - for example a one hour commute between point A (home) and point B (work) between 8am and 9.30am each morning, mon-fri.  Now the difficult part - I am considering the options. I have to write this in a database procedural language using the usual toolbox of procedures, cursors, iteration etc. I could use Python if it is helpful - I'm a database guy trying to think laterally and spatially.  A travel pattern could be identified by  (i) a similar sequence of points that can differ by a tolerance (say +/- 300 meters)  (ii) parking locations - if a car is parked at the same location for 8 hours a day  (iii) temporal- the vehicle starts at trip at 0830 every day, +/- 10 minutes.  I am planning to write a procedure that checks for each of these patterns for each point (or set of n points) by comparing it with all other points (or set of points) by iterating through the pings for each day in sequence. The easiest use case is to find recurrences of a vehicle parked at the same place each day. Detecting similar movement patterns is more complex. Can anyone suggest a technique for this?  Thanks!


I created a  Sitemap Index (/sitemap-dec2019/sitemap_index.xml) for a site as follows:  <?xml version="1.0" encoding="UTF-8"?>     <sitemapindex xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"> <sitemap> <loc>https://www.example.com/sitemap-dec2019/sitemap1.txt</loc> <lastmod>2019-12-10T18:24:17+00:00</lastmod> </sitemap> <sitemap> <loc>https://www.example.com/sitemap-dec2019/sitemap2.txt</loc> <lastmod>2019-12-10T18:24:17+00:00</lastmod> </sitemap> <sitemap> <loc>https://www.example.com/sitemap-dec2019/sitemap3.txt</loc> <lastmod>2019-12-10T18:24:17+00:00</lastmod> </sitemap> . . . <sitemap> <loc>https://www.example.com/sitemap-dec2019/sitemap536.txt</loc> <lastmod>2019-12-10T18:24:17+00:00</lastmod> </sitemap> </sitemapindex>   Each Sitemap Child is a simple list of 49,999 URLs and they are all under 10MB in size.  I uploaded the Sitemap Index and all of the Sitemap Children to the server.  I double-checked to make sure the Sitemap Index and all the Sitemap Children are all accessible on the server, and they are.  However, when I submit the Sitemap Index to Google via the Google Search Console, I get a success message saying "Sitemap index processed successfully", no errors are reported anywhere, and yet it only lists 9 of the 106 Sitemap Children (and they all happen to start with 'sitemap1'):  Sitemap                         Status  Discovered URLs /sitemap-dec2019/sitemap1.txt   Success 49,999 /sitemap-dec2019/sitemap10.txt  Success 49,999 /sitemap-dec2019/sitemap100.txt Success 49,999 /sitemap-dec2019/sitemap101.txt Success 49,999 /sitemap-dec2019/sitemap102.txt Success 49,999 /sitemap-dec2019/sitemap103.txt Success 49,999 /sitemap-dec2019/sitemap104.txt Success 49,999 /sitemap-dec2019/sitemap105.txt Success 49,999 /sitemap-dec2019/sitemap106.txt Success 49,999 1-9 of 9   There is nothing different in the Sitemap Index that would make Google select only those 9 specific Sitemap Children.  Under total discovered URLs, it says 449,991 which happens to be 49,999 x 9.  When I remove the Sitemap and re-add the Sitemap Index, the same 9 Sitemap Children get listed, and none of the others appear anywhere.  Considering there are over 100 Sitemap Children, this means more than 90% are being completely ignored.  How can I fix this so that all 100% of the Sitemap Children (and their respective URLs) get discovered?

I submitted a new version of the sitemap index for my site in Google Search Console two days ago. Soon after submission, GSC started saying that the index was "processed successfully", and yet has continued to display zero as the number of discovered URLs.  Note that my sitemap index points to about 11000 sitemaps, which provide actual links to pages.  I'm pretty sure the format of both the sitemap index and the individual sitemaps is correct.  Screenshot:    Should I worry about this? What does it mean?  Edit on 2020-02-03:  Google finally started displaying the right number in Total discovered URLs. It must have happened sometime in January. Why so late - I have no idea...


Construct a Lebesgue measurable subset A of $\mathbb{R}$ so that for all reals $a<b$,   $$0<m(A\cap(a,b))<b-a $$ under the usual Lebesgue measure $m$.       And then show that if $m(A\cap(a,b))\leq\frac{b-a}{2}$ for any $a<b\in\mathbb{R}$, then $m(A)=0$.   The answer to the first part is a dublicate, but as far as the second bit I am feeling stumped. Any thoughts?  Thank you for the help.

This is from problem $8$, Chapter II of Rudin's Real and Complex Analysis.  The problem asks for a Borel set $M$ on $R$, such that for any interval $I$, $M \cap I$ has measure greater than $0$ and less than $m(I)$.  I was thinking of taking the Cantor approach: taking $R$ to be the union of $[a,b]$ with $a$ and $b$ rationals, and for each $[a,b]$ we construct Cantor sets inside it. During theconstruction of each Cantor set, in order to have positive measure on it, we need to take off smaller and smaller intervals from it, namely the proportion goes to $0$. As a result, these Cantor sets are extremely "dense" on their ends. If for an interval $I$ it intersects with the Cantor set on $[a,b]$ while $b-a>>m(I)$, we shall expect the measure of intersection to be rather close to $m(I)$ and then we lose control on these cases.  Is there any way to fix this or shall I consider other approaches?  Thank you


Let $R$ be a domain with $1$. Show that if $aR = bR$, then $au = b$ for some unit $u ∈ R$.  Any hint on how to start this proof?

Suppose we have a ring $R$ and $(a),(b)$ are both ideals of $R$. Is it always true that $(a)=(b)$ if and only if there exists a unit $c$ such that $a=bc$ (i.e., $a$ and $b$ are associate)?    I have already verified that the forwards direction is true. But I have no idea on the backward direction. If it is true, can someone provide a proof to me?  Backward direction: Suppose that there exists a unit $c \in R$ such that $a=bc$. This implies that $(a)\subset (b)$. By using the same thing, (i.e., $b$ and $a$ are associate), there exists a unit $d \in R$ such that $b=ad$. This implies that $(b) \subset (a)$. is this correct?


What is the property of the molecules of the material that causes it to behave differently when it interacts with light. Is it the frequency of the material?  I was thinking that the resonant frequency and the frequency of oscillation of the material has a role to play in it

Recently I was asked to explain the difference between reflection and total internal reflection from a purely conceptual standpoint (no math).    Let me explain what I already know.  Reflection and refraction at the quantum level are the same thing.  Light is a photon.  A photon is a discrete particle that has wave characteristics (a finite wave traveling like a bullet).  As the photon travels it collides with electrons in the matter of the medium it is traveling in.  Depending on the energy of the photon and the allowed energy bands of the medium the photon cause the electron to jump up a level.  If the photon is absorbed then the medium will increase its motion (at the macro scale increasing its temperature).  If the photon is not absorbed it will be re-emitted (really as a new photon). I have read and watched Feynman's QED lectures and book and have a pretty good understanding of his process for determining how all these paths come together to give the net path of the photon.  The general rule of thumb is that the photon wants to take the path which requires the least amount of time.  I understand how this principle goes to explain refraction and reflection.    What I don't seem to understand is why does one material seem to cause a higher percentage of refraction compared to another (metal vs. glass).  What about the electron configuration of a the medium changes the net effect of the absorption and re-emissions of the photons?  Is there a change in the probability of the photon being re-emitted in a reverse direction?  Is there a farther distance the photon can travel before being incident onto an electron?  This is the part where my understand breaks down.    When you have hit the critical angle in a medium that refracts and the light completely reflects, are the photons moving is the same manner as they would be in a material that always reflects? How does this connect to the question in the previous paragraph?  I know I have a bunch of mini questions embedded in answering this one larger question.  Any help on any of the parts would be greatly appreciated?


I am not sure how TOR browser works, and wanted to know if I get it at work - will the IT guys be able to see what I am surfing? What kinda of info can they see anyhow?

At my work, I have a network administrator that presumably sees everything I connect to on the internet (and has banned things like Facebook, Youtube, etc). However, tor seems to let me through those blocks. How does Tor prevent my network admin and local network from seeing what I'm doing. It seems to me that everything I request from my browser must go through my work's router/network first. Can't they see these initial requests? Does this anonymity also apply to downloading?


I have this code that logs a user out if they don't change pages for 10 minutes.  $inactive = 600;  if(isset($_SESSION['timeout']) ) {   $session_life = time() - $_SESSION['timeout'];   if($session_life > $inactive) {      header("Location: logout.php");    } }  $_SESSION['timeout'] = time();   As you can see it's pretty straightforward. I include this function at the top of all my protected pages and if the script isn't run for 10 minutes, the next time you refresh the page, the user is sent to my logout script.   However that's the problem. After $session_life > $inactive becomes true, the script needs to be run again for the user to be logged out. I need the person to be immediately logged out as soon as this becomes true.   Is there any way to do this without things getting too complicated? (i.e. not using AJAX)

I need to keep a session alive for 30 minutes and then destroy it.


I just got ubuntu from my uncle and it is a older version 9.04 and I know to upgrade ubuntu it has to be in stages and I can't upgrade to 9.10 I always get fetch to fail error message saying can't connect to server...are there any solutions?

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


i need a complicate regex for counting all occurrences of US Dollar amounts.  This must match:   1000$ 1000 $ $1000 $ 1000  1.000$ 1.000 $ $1.000 $ 1.000    1000 Dollar 1000 US-Dollar  1000 USD   1.000 Dollar 1.000 US-Dollar 1.000 USD    1000,50$ 1000,50 $ $1000,50 $ 1000,50  1.000,50$ 1.000,50 $ $1.000,50 $ 1.000,50    1000,50 Dollar 1000,50 US-Dollar    1.000,50 Dollar 1.000,50 US-Dollar   I only need amount between 1.000 and 20.000$ ! Not needed: 300 300$ $20 $21.000 etc I will do this later in PHP!  I would be very, very grateful for any help! Regards Markus

I don't really understand regular expressions.  Can you explain them to me in an easy-to-follow manner?  If there are any online tools or books, could you also link to them?


when I want to show that limit of the following function $$f_\epsilon(x)=\frac{1}{2\epsilon}e^{-\frac{|x|}{\epsilon}}~,$$ namely, $$\lim_{\epsilon\to 0} f_\epsilon(x)$$ is a presentation of $\delta$-distribution. And for that, I have to show that for each test function $g$ we have: $$\int_{-\infty}^{\infty}dx\lim_{\epsilon\to 0} f_\epsilon(x)g(x)=g(0)$$ We can assume to interchange integration and limits. How do I do that? Would be very thankful for help!

I'm currently studying the Dirac delta function using a textbook which unfortunately provides only partial solutions to its explanations. Why does $\lim\limits_{\epsilon\rightarrow 0}\int_{-\infty}^{\infty}f_\epsilon(x)g(x)dx=g(0)$ if $ f_\epsilon=\frac{1}{2\epsilon}e^{-\frac{|x|}{\epsilon}}$? Any help is very much appreciated.


I am trying to put a Countdown timer using a TextView inside my Android studio project. I have been looking at other posts but I haven't been getting any good information. I want the simplest way to make an easy Countdown timer. Thanks in advance!  Countdown Timer:  CountDownTimer Count = new CountDownTimer(5000, 1000) {                 @Override                 public void onTick(long millisUntilFinished) {                      timerText.setText("Seconds remaining: " + ((millisUntilFinished/ 1000) ));                 }                 @Override                 public void onFinish() {                     timerText.setText("Time Done...");                 }             };             Count.start();

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


I'm confused about why the Fermi level is located inside the band gap in semiconductors because it's defined to be the energy level where an electron has a 50% chance to be, but there can't be electrons in the band gap. I now think they mean it's the energy where the Fermi-Dirac distribution reaches 50% but now I'm wondering what this distribution even means when there is a band gap. It's a distribution that gives the occupation probability for a certain energy (given a certain temperature). But why isn't the occupation probability zero in the band gap? Or does it give the occupation in case there was no band gap?   In any case, I was wondering how to interpret the picture below. On the left, the valence band is completely occupied. In the middle, there are a lot of states with a lower occupation probability in the valence band compared to the left, but very few in the conduction band with a higher (but still very small) occupation probability. But it can't be the case that there are suddenly less states being occupied because there are still as many electrons as before. So what am I getting wrong? And how can I interpret the Fermi-Dirac distribution better?  Thanks in advance.

I have read and used the concept of  previously and this is simply an attempt on my side to better my understanding of it by asking myself various questions. I understand that the fermi distribution is defined as  $$f(E)=\frac{1}{1+e^{\frac{E-E_F}{kT}}},$$ hence the Fermi Energy is defined as $f(E_F)=0.5$.  However, this definition does not define the fermi level to be a constant value and I understand that it's a material property. For example in crystals, due to covalent or ionic bonds that constitute the monocrystalline material, the atomic wavefunctions which make up the atoms within the crystals, face degeneracy, and this leads to the formation of bands (very closely spaced states) within the crystal. Here the Fermi level is defined as the brim or the edge to which the electrons fill up these states at zero kelvin.   Obviously, since they are continuous bands (or a continuum of energy states with very little energy gaps between consecutive states), defining the Fermi level up to the last state within the band or the next unfilled state at zero kelvin would yield very little error, but what about semiconductors where the entire valence band is filled up until zero kelvin and then starts a considerable gap where the Fermi level resides, or individual atoms (for example an Si atom, where the difference between the 3p state and 4s states are considerable)?   How do we pin out a defined value of $E_F$ in those circumstances? Or even molecules like $C_{60}$ where we have discrete states. The difference between the HOMO and the LUMO levels is much more conspicuous in this case. How do we etch out a Fermi level value in these cases?


I'm trying to keep GA from setting cookies on static files like images. All the files concerned are loaded from cookie-free subdomains. Is there a way to exclude these subdomains from getting the cookie that is set by Google Analytics?

I have my web site at example.com, and i have also setup a sub domain for serving static content at static.example.com. On my web pages I'm using Google Analytics, so it will attach its cookies to all page request, even on static.example.com.     I went into the GA settings and added a filter to exclude static.example.com, but I still see cookies (with the __utma.. name) on all web requests to my static domain.  How can i prohibit GA to use cookies on my sub domain?


So I saw a youtube video of the following integral, which can be solved by letting u=tanx, then you get $\int \frac{1}{1+x^2} dx $ = ${tan}^{-1}x + C$ But it should also be solvable through partial fraction decomposition. $\int \frac{1}{1+x^2}dx$ = $\int {\frac{A}{x-i} + \frac{B}{x+i}dx}$ $\frac{1}{1+x^2}$ = $\frac{A}{x-i}$ + $\frac{B}{x+i}$ $1$ = $A(x+i)$ + $B(x-i)$ $x=i$:  $1$ = $2iA$ $A$=$\frac 1{2i}$ = -$\frac {i}{2}$ $x=-i$: $1 = -2iB$ $B$ = $\frac{i}2$ $\int \frac{1}{1+x^2}dx$ = $\int -\frac{i}{2(x-i)}$ + $ \frac{i}{2(x+i)}dx$ = $-\frac{i}2$ln$\lvert {x-i}\rvert$ + $\frac{i}2$$ln\lvert {x+i}\rvert$ + C = $\frac{i}2ln\lvert {x+i}\rvert - ln\lvert {x-i}\rvert$ + C This should be equal to ${tan}^{-1}x + C$ right? ${tan}^{-1}({1})$ =  $\frac\pi4$ $\frac{i}2(ln\lvert {1+i}\rvert - ln\lvert {1-i}\rvert)$ = $\frac{i}2(ln{\sqrt2}-ln{\sqrt2})$=O So these are obviously not equal, then I thought why must i have absolute value sign in the logarithmic expressions, that rule I know only applies for integarting with real constants. Thus, $\int \frac{1}{1+x^2} dx = $$\frac{i}2(ln({x+i}) - ln({x-i}))$ + C = $\frac{i}2ln(\frac{({x+i})^2}{x^2+1}) + C$ Evaluated at x=1 gives us $\frac{i}2ln(\frac{({1+i})^2}{1^2+1})$ = $\frac{i}2ln(i)$ = $\frac{i}2\cdot \frac{i\pi}{2}$ = $-\frac\pi4$ So, im quite close, but I must have missed something somewhere, and I cant find the mistake. But this triggers two other questions: How would I show that $\frac{i}2ln(\frac{({x+i})^2}{x^2+1})$ = $\tan^{-1}x$ (or some other logarithmic expression if that expression is where the error lies) and, why dont I need to take absolute value when integrating $\int \frac{1}{x+a}dx$ with complex constants? Is the explanation as easy that I can evaluate all logarithmic expressions using complex numbers?

Letting $x=\tan(u)$, $$\int\frac{1}{1+x^2} \, dx=\int\frac{1}{1+\tan(u)^2}\sec^2(u) \, du=u+k=\arctan(x)+k$$ Also,  $$\int\frac{1}{1+x^2} \, dx=\int\frac{1}{(x-i)(x+i)} \, dx=\frac{1}{2i}\int\frac{1}{(x-i)}-\frac{1}{(x+i)} \, dx$$ $$=\frac{1}{2i}\left(\ln(x-i)-\ln(x+i)\right)+c$$ $$=\frac{1}{2i}\ln \left(\frac{x-i}{x+i} \right)+c$$ Giving $$\arctan(x)=\frac{1}{2i}\ln \left(\frac{x-i}{x+i} \right)+q$$  Why is this correct? What is the nature of $q$ (is it 'flexible' so the equality doesn't really mean much)?  I think it probably has something to do with the relationship between $\log(z)$ and $\arg(z)$, but $\arg(z\pm i)$ is hard to calculate neatly.


I had a list 'result' in controller and I converted this list to json using below code.    JavaScriptSerializer jss = new JavaScriptSerializer();             string output = jss.Serialize(result);   .Now I need to parse the Json result in jQuery.for that I put var model = @Html.Raw(Json.Encode(Model)) in javascript and I got model as :  ContentEncoding: null ContentType: null Data: "[{"type":"Size","ID":16,"title":"10X20","value":null,"isDefault":true,"Rate":0,"Product_ID":42,"Parent_ID":0},{"type":"Size","ID":17,"title":"10X18","value":null,"isDefault":false,"Rate":0,"Product_ID":42,"Parent_ID":0},{"type":"Size","ID":18,"title":"10X15","value":null,"isDefault":false,"Rate":0,"Product_ID":42,"Parent_ID":0}]" JsonRequestBehavior: 1 MaxJsonLength: null RecursionLimit: null

Given a string of JSON data, how can I safely turn that string into a JavaScript object?  Obviously I can do this unsafely with something like:  var obj = eval("(" + json + ')');   but that leaves me vulnerable to the JSON string containing other code, which it seems very dangerous to simply eval.


This question is a variant on a previously asked     Many a time, I find myself wanting to slightly rename a file name in the shell, e.g.:  $ mv test_1.py _test_1.py   or  $ mv test_1.py test_1.py.org   I could use the suggestions in , but   is there any bash magic that will allow me to just reference the previously typed parameter?  e.g., if the magic is $M, then - for the above - I'd use:  $ mv test_1.py _$M.py $ mv test_1.py $M.org

I was just typing something along the lines of:  mv foo/bar/poit/zoid/narf.txt   and suddenly realized, damn, I have to type large parts of that parameter again  mv foo/bar/poit/zoid/narf.txt foo/bar/poit/zoid/troz.txt   Even with tabcompletion, quite a pain. I know I can copy paste the parameter by mouse-selecting the text and middleclick but that is not good enough. I want to remain on the keyboard.  So is there a way to copy paste the current parameter of the line using the keyboard?


This question is for simple data structure that involves one main effect only. I can definitely see ANOVA's usefulness in more complicated data containing multiple effects.  Aside from being a "convenient" omnibus test (which may give you some ideas whether something is worth further investigating), ANOVA added quite a few assumptions and so what you find would be more less an approximate indication (and to say the least, far too many people are too lazy to check the validity of assumptions for their data). And to my honest experience, it does not inform me anything more than I simply eyeballing the data graphically. By doing a Welch t-test multiple comparisons directly, we omitted some assumptions which also give you the ranks and differences directly (if I am not wrong, even student t-test has fewer assumptions than ANOVA). Any post-hoc multiple comparisons done following ANOVA also inherit its assumptions.   From a programming perspective, I honestly don't think a direct multiple comparisons done before ANOVA is any less easy to automate. So, why are we so fixated on ANOVA?

I often hear that post hoc tests after an ANOVA can only be used if the ANOVA itself was significant.    However, post hoc tests adjust $p$-values to keep the global type I error rate at 5%, don't they?  So why do we need the global test first?  If we don't need a global test is the terminology "post hoc" correct? Or are there multiple kinds of post hoc tests, some assuming a significant global test result and others without that assumption?


I'm trying to add an event listener to items that don't exit yet. I will be adding the items dynamically, but I would like them to have event listener when they are added to the DOM. I have used the .on() function but this only works for items that are on the page when it loads and not for items added dynamically. The following is my code:  $(document).ready(function () {     var $add_button = $('#add-item')     var newItem;     var $incompleteTasks = $('#incomplete-tasks');      $('button.check').on("click", function () {          alert('Helloww');     });      $add_button.click(function () {          newItem = $('#new-task').val();          //create li element and assign it to variable         var li = $('

');         var label = $('');         var button = $('<button class="check">Check</button>');          //Use input value as the text for li item         label.text(newItem);           //append new item to incomplete tasks ul          $incompleteTasks.append(li);         li.append(label);         li.append(button);      });  });   I'm not sure where I'm going wrong here.   Thank you for the help.

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


I got my Falkreath house, but it says I own no homes in my game stats. Also, I can't adopt a child. Do I need both child's beds and chest before I can adopt one? What's up with this?

I bought two pieces of land. One from Morthal, and one from Falkreath. Morthal was the first plot of land I purchased. I only finished half of it. I bought the plot of land in falkreath because I liked the nature better. I finished the house completely in Falkreath. Every time I try to adopt a child off the streets it keeps saying "I have a place but no room for you" Even though I have the bedrooms in my Falkreath house. Why can I not adopt a child and have him/her live at my house in Falkreath?


Accidentally unchecked "unity" in system settings. Now my Ubuntu 11 boots into a "desktop background only" screen. no panels, no icons. Although I was able somehow to invoke Nautilus.  any way I can launch the system settings process and change that? or am I doomed to format my machine and re-install everything?

When I login, nothing happens.   I am presented with my desktop wallpaper.    No Dash, no Launcher, nothing.


I'm not sure if this question belongs on StackOverflow or here (please let me know if the former, and i'll delete this and ask there), but I was wondering how the log or ln of a value is calculated computationally with accuracy? Is some series implemented that approximates a value?   I looked into the Taylor series for the natural logarithm, but that is apparently only accurate for 0 < x < 2, and I can't find anything else. I tried looking for source code for Java's Math#log function as well to see what algorithm they implemented, but couldn't find any since it's implemented in a native language rather than in Java.

I would like to know how logarithms are calculated by computers. The GNU C library, for example, uses a call to the fyl2x() assembler instruction, which means that logarithms are calculated directly from the hardware. So the question is: what algorithm is used by computers to calculate logarithms?


Now can anyone confirm that Battlefield 4 solution to cahnge the language by copying native GDFBinary_en_US(64).dll to installation (from beta etc) and changing registry keys asociated with origin from ru_RU to en_US? Until the game is not released ofitialy i can't confirm but internet sources confirm that the game perloader does include all the audio files for 11 languages and that is what packed into the 35gb of audio data. So i'm holding my fingers crossed and hoping that dll from beta will work ok. Hoping someone with english version of Titanfall can share RTM version of the DLL.

This question was initially about Russian PC version of Titanfall, available in Russian Origin store.  It appears that there exists a Worldwide PC version of Titanfall for which .  Tech support said that Russian users can only buy Russian version of Titanfall (both normal and Deluxe editions) and that they will not have any other in-game language available. They also offered me a refund, which I accepted.    I'm living in Russia and I recently pre-purchased Titanfall from here. My version doesn't have an option to select game language other than Russian.  Russian version has awful localization, many mistranslated technicalities and poorer game UI fonts than its English counterpart. Titan's on-board AI voice is pretty lame. The campaign briefing lines are cut off to fit the English files' length. Voice actors took liberty to change a few things to their liking. Audio effects like reverberation, echo and such are distinctively more basic. Overall audio quality is much lower, which greatly hinders immersion.  When I was playing open beta, it was all in English and considerably better. The game also doesn't support Russian characters so everyone is using transliteration in chat.  Switching Origin UI language to English didn't change the game's language. It's still all Russian.  How do I change Titanfall UI and audio to English?    Also: the support person didn't explicitly say tampering with localization files was against any rules or policy, so this may or may not be okay to do. Gotta find some hard info on that.  Although, adding launch parameters -language english, -language "english" in case of Russian version does not help. Players with other versions report that it does help.  As can be seen during game installation, the sound files alone take up about ~33 GB of disk space, and according to Origin's solution to Worldwide PC version, these files contain localization for every language available. It's just the rights to access them depend on version.    Note: it's important that the solution does not break any rules and is not outright illegal. Otherwise it may be removed from this site by a moderator, or, in worst case scenario, lead to some player's game and account being locked. So if you post something suspicious looking, be sure to include some links to official statements that allow such actions.


I have a dataset, for example, of success factors (columns) noted by several subjects (rows). Basically, when a subject notes a factor, its marked as a yes or no.   I want to do an analysis to find factors that seem to be related or appear together. correlation analysis. I'm thinking of giving the yes/no values either 1 or 0 respectively and performing covariance on that with excel. Is this a valid approach?  Will appreciate any comments on this

I have a dataframe with many observations and many variables. Some of them are categorical (unordered) and the others are numerical.  I'm looking for associations between these variables. I've been able to compute correlation for numerical variables (Spearman's correlation) but :   I don't know how to measure correlation between unordered categorical variables. I don't know how to measure correlation between unordered categorical variables and numerical variables.   Does anyone know how this could be done? If so, are there R functions implementing these methods?


Possible Duplicate:          I've got a custom HTTP server written in C# which gives me the raw HTTP request...   GET /ACTION=TEST HTTP/1.1 Host: localhost:8080 User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-GB; rv:1.9.0.10) Gecko/2009042316 Firefox/3.0.10 Accept: text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8 Accept-Language: en-gb,en;q=0.5 Accept-Encoding: gzip,deflate Accept-Charset: ISO-8859-1,utf-8;q=0.7,*;q=0.7 Keep-Alive: 300 Connection: keep-alive   Is there something in the .NET framework that I can use to parse it or do I have to do it by hand?   Cheers

In .NET is it possible to convert a raw HTTP request to HTTPWebRequest object?  I'm sure .NET internally doing it. Any idea which part of the .NET is actually handling this? Can I call it or is there any external library which allows raw HTTP connections?


I need to search our oracle database for a string in all tables and columns. I have the below query I found online but when I execute it I get the following error  Any help is appreciated  ORA-06550: line 6, column 31: PL/SQL: ORA-00904: "COLUMN_NAME": invalid identifier ORA-06550: line 6, column 12: PL/SQL: SQL Statement ignored ORA-06550: line 8, column 30: PLS-00364: loop index variable 'T' use is invalid ORA-06550: line 7, column 4: PL/SQL: Statement ignored ORA-06550: line 12, column 38: PLS-00364: loop index variable 'T' use is invalid ORA-06550: line 12, column 16: PL/SQL: Statement ignored  BEGIN     FOR t IN (SELECT table_name, column_name FROM all_tables) LOOP       EXECUTE IMMEDIATE         'SELECT COUNT(*) FROM '||t.table_name||' WHERE '||t.column_name||' = :1'         INTO match_count          USING v_search_string;            IF match_count > 0 THEN                 dbms_output.put_line( t.table_name ||' '||t.column_name||' '||match_count );            END IF;    END LOOP; END; /

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


I know that integers can be partitioned into the different ways to get that integer. For example:   $$4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1$$  can be written as   $$(4),(3, 1),(2, 2),(2, 1, 1),  (1, 1, 1, 1)$$  We can then define the size of a partition  $$λ = (λ_1, \ldots, λ_k)$$  to be  $$\sum λ_i$$ (so partitions of $n$ have size $n$)  How can I find a generating function for the set of all integer partitions?

I don't understand at all why:  \begin{equation} \sum\limits_{n=0}^\infty p_n x^n = \prod\limits_{k=1}^\infty (1-x^k)^{-1} \end{equation}  Where $p_n$ is the number of partitions of $n$. Specifically how can the sum of positive numbers ever be factored into a fraction or factors to the $-1$ power? Is this something purely notational or am I missing something big?  Thanks for all the help!


I am creating a schema for a website and I don't know what kind of schema is required.  At the moment, I only have schema for business information on homepage.  What other types of schema do I need to set. And does placing multiple schemas count as spam?  Thanks for any ideas

Is  structured data (in Microdata, JSON-LD, or RDFa) relevant for SEO?   I know that structured data can provide benefits in other areas, but here I’m only asking about its significance for general web search engines.


The horizontal ScrollBar on a one line code on any post is hiding the code for me.  I'm using Google Chrome 71.0.3578.98 on  (Mojave), but I think this bug is a general issue. And here are some examples:  1- First example: once you use the horizontal scrollbar, it will hide the line of code.  >>> code simple code lorum ipsum code simple code lorum ipsum code simple code lorum ipsum ; # just some code   2- Second Example, an image from another Stack Exchange site    I hope this simple bug will be fixed and thanks.

Something is so annoying when a code snippet contains only one line of code, the scroll bar hides the code.  It would be good if the scroll bar have a specific area for it in the snippet box. See the screenshot:      Note: I'm using Safari v10.1 on macOS Sierra v10.12.4


I am a graduate student in mathematics at a top school. Most of other students achieved gold medal in International mathematics olympiad for high school and/or other similar competitions. Most did their undergraduate in the very best school.  I came from a very modest educational background but worked really hard. I did not participate in IMO or other math competitions and if I did, I do not think I would have done well. I attended a not well-known small university in Australia.  Now that I am surrounded by all these gold medalists, I just feel that they are way beyond me and I am so dumb when I compare myself to them. How should I deal with this feeling?

According to Stanford's Computer Science graduate admissions department this year:     110 students were accepted. Nearly all accepted applicants were from Stanford (BS/MS), MIT, Berkeley, Princeton, Michigan, Texas, Washington, Tsinghua, and the other ivy leagues. About 10-20 were from non-top schools.   I am one of these 10-20. I go to a state college and our curriculum is imaginably not up to par with the elite schools.  I'm scared.  Did anyone experience the similar situation?  How would I prepare myself to hang with the smartest people in this Ph.D. process?  If you're a professor, how much does this affect you in choosing a Ph.D. student?


I cannot install Wine using Ubuntu 14.10. It tells me I have unmet dependencies: wine1.7 : depends: wine1.7-i386 (=1:1.7.30-Oubuntu1~ppa1) E:Unable to correct problems, you have held broken packages.

Occasionally, when I'm installing stuff, I get an error like the following:  Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  package1 : Depends: package2 (>= 1.8) but 1.7.5-1ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages.   How can I resolve this?


Forgive me my ignorance, I'm just an undergrad. That said, I have listened a couple of talks and lectures in the last years - given by experts in the field - about the future of fundamental theoretical research in physics, mainly concerning our best bets for a theory of everything, in particular string theory. For exemple, the five messenger lectures by Nima Arkani-Hamed where he talks why space-time is doomed others cutting edge topics ().  In the talks, always supersymmetry is mentioned, for instance how it is the best candidate of a theory of everything and the last(?) consistent hope for string theory, and more, that in this decade we would be able to reach the collision energy necessary and predicted within the theory to detect supersymmetry. Ultil now, from what I've been reading in last years, no good news for supersymmetry have been stated. Could someone experienced or with some familiarity in the subjec explain to me how is the case for supersymmetry in the present time? And what consequences to string theory - as a theory of everything - the no discovery of supersymmetry in the LHC will bring?

The LHCb has recently  the observation of $B_s \rightarrow \mu^+ \mu^-$ with a branching ratio that agrees with the Standard Model (SM). There are many blog posts about it (See: ).  The result initiated a debate over its implication on Supersymmetry in general, which I don't want to discuss here. But it certainly affects some Supersymmetric models that may have a different prediction than that of the SM.   My questions are,   Which models in particular are affected (or variants of models)? What is the MSSM status? The NMSSM? Does the result affect some of the parameter space of a particular model, or does it rule out an entire model/or variant of a model?


I am trying to find how can I detect with JavaScript if I am in a HTTP or HTTPS environment.  I am calling an Ajax request so if I am in HTTPS and call HTTP Ajax then I get a 302 Moved Temporarily.  I was thinking of getting the current window.location.href and do a string manipulation.  What is the best way of detecting HTTPS using JavaScript?

Is it possible to detect, on the client side, whether the user is using an encrypted page or not?  Put another way -- I want to know if the URL of the current page starts with http or https.


I want to karaoke but my mp3 files hold vocal music.  I want to make music instrument because I want to karaoke  How can I manipulate mp3 songs and remove the vocal and leave only the background music?  I'm using Ubuntu 16.04

How can I get the instrumentals only from a file and remove the vocals?   I understand this is called karaoke.


I wrote a guest blog post that's located here:    At the bottom I have my name linked to my G+ profile with the author relationship, as specified by Google to establish relationship:  J. Pablo Fernández   I assume the onclick and target is added by their CMS. Could that stop G+ authorship from being detected?  I'm testing whether G+ authorship is being detected or not here:   For other pages that I'm the author of, not only the authorship works but also a search result displays my picture and name, for example:

A few months back I set to the task of verifying my blog content for Google Authorship. I'm fairly confident I've ticked all the boxes and when I test my posts with the Google Structured Data tool it informs me that .   It has been like this for around 2 months but I am still not seeing my authorship profile in the search results. Do a search for "jQuery Parallax Scrolling Tutorial" and you will see my blog post near the top of the results but no authorship data.  Can anyone suggest why this is not appearing when Google itself tells me that everything is in order? Thanks


I got a single-entry Schengen visa from Italian embassy. Now I am planning to visit first Rome after that from Rome to Paris by plane. So can I travel to Paris by plane from Rome, will immigration ask me something? Or can I travel by train only?

I am visiting a friend in Switzerland for ten days. I have already got visitor's visa for the same on my Indian passport. Particulars mentioned on my visa are:  1. 'Etats Schengen' , 2. Single entry 3. Dates of visit. & 4. Type of visa : C.  I understand that having already got ‘Etats Schengen' visa, I can travel to all Schengen countries.  I am also planning to visit Paris for a day during my stay in Switzerland. However, I never mentioned this in my visa application. I am planning to take a train from Geneva to Paris and book a hotel in Paris for one night. Can I possibly plan my Paris trip this way as I have Schengen visa, or I am not allowed to travel out of Switzerland as I never mentioned this in my visa application?   Also what does Single entry on my Schengen visa means: does it mean that I can enter and leave Switzerland only once or it means that I can enter and leave the Schengen region only once.


Ubuntu 16.04.1 was released on 21st July 2016. According to      Today is also the day that users of Ubuntu 14.04 LTS (Trusty Tahr) are notified that a new Ubuntu release is ready.   I am still getting "No new release found" when trying to update my 14.04.4 desktop and a 14.04.4 server via the Software Updater and do-release-upgrade. Both have been set to notify me when new LTS versions are available. The 16.04.1 release is available from the mirror I am using. I switched to the default mirrors on the desktop but the message was the same.  Why is this the case and what can I do to fix it?

So, today is July 21st and . gives me an option to download 16.04.1 LTS. However, attempting to upgrade gets me this message -  $ sudo do-release-upgrade Checking for a new Ubuntu release No new release found   What is wrong? Does it matter that I am running apt-get update behind apt-cacher-ng?  Note: Commenting out the files in apt.conf.d that used apt-cacher-ng did not make a difference.  Edit: Explanation for possible duplicates:  deals with upgrade from 12.04LTS to 14.04LTS. My question is specific to 14.04 LTS to 16.04.1 LTS upgrade. Old answers, while good for archival purposes are less relevant in a fast changing package like ubuntu. Moreover none of the answers answer what is wrong. The link  pointed out is mentioned in one of the comments. This Q & A is more helpful for people upgrading today than the work around mentioned in "".


As exactly the title says:   Why a wave, traveling in a lighter medium, inverts upon reflection from an interface of a denser medium ?  What are the things that go on at the interface ?

Can anyone please provide an intuitive explanation of why phase shift of 180 degrees occurs in the Electric Field of a EM wave, when reflected from an optically denser medium?  I tried searching for it but everywhere the result is just used.The reason behind it is never specified.


If $X\geq0$ is a random variable then show that:$$\lim_{n\to\infty} \frac{1}{n} \cdot E\bigg(\dfrac{1}{X}I\bigg\{X>\dfrac{1}{n}\bigg\}\bigg)=0$$   A hint would be most appreciated. I have studied measure theory, but I presume this can be solved using simple analysis.

Suppose $X$ is a non-negative random variable satisfying  \begin{align*} P[0 \le X < \infty ]=1. \end{align*} Show   a)  \begin{align*} \lim_{n \to \infty} n E \left( \frac{1}{X}1_{[X>n]} \right) =0 \end{align*} b)  \begin{align*} \lim_{n \to \infty} n^{-1} E \left( \frac{1}{X}1_{[X>n^{-1}]} \right) =0 \end{align*}  What I did  I showed part a) already here is the proof:  \begin{align*} n E \left( \frac{1}{X}1_{[X>n]} \right) \le n E \left( \frac{1}{n}1_{[X>n]} \right)=n\cdot\frac{1}{n}P[X>n]=P[X>n] \end{align*} So $\lim_{n \to \infty} n E \left( \frac{1}{X}1_{[X>n]} \right) \le \lim_{n \to \infty} P[X>n]=0$.  What about part b)? The same techniques no longer works.  I was thinking that  \begin{align*} \lim_{n \to \infty} n E \left( \frac{1}{X}1_{[X>n]} \right) \le \lim_{n \to \infty} n E \left( \frac{1}{X} \right) \le 0 \end{align*} but I am not sure that $E \left( \frac{1}{X} \right) < \infty$


I need a little help with the following problem of abstract algebra:     Let $G$ an Abelian group. Clearly, any subgroup of $G$ is normal. Is the opposite true, that is if every subgroup of $G$ is normal, then $G$ is Abelian?

If $G$ is an abelian group, every subgroup $H$ of $G$ is normal.  I searched for non-abelian finite groups $G$ , such that every subgroup is normal and GAP showed only the groups $G'\times Q_8$ , where $Q_8$ is the quaternion-group of order $8$ and $G'$ is an abelian group with the additional property that $C_4$ is not a subgroup of $G'$. The largest group I found with GAP was $C_{15}\times Q_8$.     Is it true that every non-abelian finite group $G$ with the property that every subgroup of $G$ is normal, is isomorphic to $G'\times Q_8$ with an abelian    group $G'$ without $C_4$ as a subgroup ?


* {   margin: 0px; } .container {   background: #ccc;   line-height: 50px;   verticle-algn: middle;   clear: both; } .float {   overflow: hidden;   float: right; } <div class="container">   <button class="inside">inside</button>   <button class="float">float</button> </div>     Please check this example.I want the .float element to be vertically centered of the .container element as the .inside element.But no matter I trigger BFC or add a pseudo element, I can not clear the impact of the float element.I don't think margin is a best way to solve this.Can you tell me how to fix it, thanks for your help.

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...


I've just started a commutative algebra course and I'm stuck on the very first homework problem:     Let $A \not= \{0\}$ be a commutative ring. Let $\Phi : A \longrightarrow B$ be a ring homomorphism where $B$ has finitely many elements. Show that if $I$ is a maximal ideal of $B$, then $\Phi^{-1}(I)$ is a maximal ideal of $A$.   It's easy enough to prove that if $I$ is an ideal then $\Phi^{-1}(I)$ is also an ideal, but I'm stuck on the maximality. My idea was to assume, for a contradiction, that there exists some proper ideal $J \subset A$ that strictly contains $\Phi^{-1}(I)$; then its image would perhaps be a proper ideal in $B$ that strictly contains $I$, which would contradict the maximality of $I$. However, this doesn't seem to work, since I can't prove that the image of $J$ is a proper ideal. It is not given that $\Phi$ is surjective. I'm also not sure how to exploit the fact that $B$ has finitely many elements.  Any hints on this problem (no complete solutions please)?

Let $A,B$ be commutative rings, and let $\phi: A \to B$ be a ring homomorphism where $B$ has finitely many elements. Prove that if $I \subset B$ is a maximal ideal then $\phi^{-1}(I)$ is also a maximal ideal in $A$  I've tried to construct a proof by contradiction but with no success, im not looking for answers but rather hints.


In Oceancraft a new block is called quicksand which you slowly sink into until you start being dealt 1 heart of damage per second.  It kills quick - is there anyway I could maybe prevent myself from experiencing this horrible death?

I am playing Minecraft with the  mod installed.  Among other things, this adds quicksand, which if you step in you begin to sink and slowly suffocate.    Once you have stepped in quicksand - is there any way to avoid your untimely demise? I've tried walking out of it but when I get to the last block I can't jump over it.  I've also tried digging up the neighboring blocks and the offending quicksand itself but I still drown.    Is there any way to avoid drowning in quicksand if you haven't managed to avoid it?


Why does this shell script:  $ curl -d "asd" 0.0.0.0/abc & echo "abc";   results in me having to press enter before it enters the shell again. The curl is just a post request to a simple web server which returns abc.  However, this script does not require me to press enter before entering the shell again  $ echo "abc" & echo "abc"

abhigenie92@ubuntu:~$ (sleep 2; echo $BASH_SUBSHELL ;sleep 2) 1 abhigenie92@ubuntu:~$ (sleep 2; echo $BASH_SUBSHELL ;sleep 2)& [1] 3297 abhigenie92@ubuntu:~$ 1  [1]+  Done                    ( sleep 2; echo $BASH_SUBSHELL; sleep 2 )   What happens when launch it as a background process, why don't I get the prompt back and I have to press Enter? In both cases it launches a child shell.


I have encountered an odd vertical misalignment when using mathop to define some one-character macros. Specifically, I am (re)defining \i via  \renewcommand{\i}{\mathop{\mathbbl{i}}}   (for quaternions, if you're curious), but the problems starts with   \renewcommand{\i}{\mathop{i}}   and in equations, the symbol \i is pushed down a bit, enough to be noticeable, and ugly (see picture below, arrow is added)! This does not happen with a two-character macro (or more). Dropping the \mathop would solve the problem, but at the expense of bad spacing after the macro.  I am therefore looking for a fix either in the vertical spacing with \mathop or the horizontal spacing after the \newcommand. Thanks.

Here is a little example that illustrates this strange behaviour:  \documentclass{article} \usepackage{amsmath} \DeclareMathOperator\foo{\mathbf{l}} \begin{document} baseline$\mathbf{l}$baseline$\mathop{\mathbf{l}}$baseline$\mathop{l}$baseline$\foo$baseline \end{document}     Note that the explict call to \mathop shifts the baseline of the l. But if you use \DeclareMathOperator this doesn't happen. Is this a bug or a feature?  I personally think that the shifted baseline looks really weird if you're discussing an operator in text, so I'd like to shift it up again. Do I have an alternative to endless use of \DeclareMathOperator?


Im much confuse with the node editor to get the different material effects. Is there any website where i can download the material for free.

I'm wondering if there's any addons or online libraries of materials I can download. I've found one called , but then discovered it was from 2008 and thought by now something like that might already be integrated into Blender.


I have to learn ubuntu for a class and so I have to change it around and play with it on a virtualized machine.  Point is, how can I just remove having to use a password all the time, and just make it give me all the power when I startup the machine, not just in the terminal?  I am trying to move a theme folder into this:

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


I'm completely new to Ubuntu and I was warned that I should backup data. How do I do all of this?  I don't any about this dd, partitions or stuff so I need some help.

No, this is not a , nor is it a solicitation on  to backup or  and only a little bit about Where to backup and When to do it.  This is basically a strategy question: what, where and when all together. "How" is not really relevant: there are tons of back-up programs out there and they all do the same basic thing: make copies of data.  But the real question is: are these back-up programs making copies of the data important to you?  How should you install&run Ubuntu while safeguarding your data?  There is no "one size fits all" when it comes to computers, Ubuntu versions or a backup strategy, therefore I've split this up into 5 basic user types with each their own answer:       (or you're running in UEFI mode!)   And as the above does not fit everyone, one for the impatient:   !    So click one of the above links and go to your user type!  P.S. If you're running a server farm and you've read this question so far, I'm sorry: this is about a single PC, not a network, nor a server farm.


I only want an intuitive proof or idea that underlines the essence of this equality. I proved this already using the summation but it doesn't help me to actually see why they are equal. I hope you could help me. Thanks in advance!

The trace of a matrix product is "commutative" (i.e. cyclical): $$\operatorname{trace}(AB)=\operatorname{trace}(BA)$$  I know how to prove this. I was wondering, are there any intuitive ways to understand why this must be true? One reason why I don't see it intuitively is that I don't really understand intuitively what the trace represents (e.g. geometrically).


Prove that for $n\geq 2, \: \sum_{k = 1}^{n} \frac{1}{k^{2}} < 2 - \frac{1}{n} $  I used induction and I compared the LHS and the RHS but I'm getting an incorrect inequality

Question:     Let $P(n)$ be the statement that $1+\dfrac{1}{4}+\dfrac{1}{9}+\cdots +\dfrac{1}{n^2} <2- \dfrac{1}{n}$. Prove by mathematical induction. Use $P(2)$ for base case.   Attempt at solution:  So I plugged in $P(2)$ for the base case, providing me with $\dfrac{1}{4} < \dfrac{3}{2}$ , which is true.   I assume $P(n)$ is true, so I need to prove $P(k) \implies P(k+1)$.   So $\dfrac{1}{(k+1)^2} < 2 - \dfrac{1}{k+1}$.  I don't know where to go from here, do I assume that by the Inductive hypothesis that it's true?


A Room can be affected by the overall stat level of all the Dwellers that are currently assigned to a room. For example, the Water Treatment rooms are affected by Perception.  Now the max stat that a Dweller can have naturally is 10. However, you can give a Dweller an outfit that might boost a certain Stat.  For example, the Armoured Vault Suit grants a +3 to Perception. If a Dweller has 10 Perception already, will this contribute toward the overall "Room Level"? Or would it be better suited giving this to a Dweller who's Perception is below 10?

We know that the maximum level a dweller can train to on any SPECIAL skill is 10, however this does not consider bonuses given from their outfit.    Is there any additional benefit for going over 10? For example, a dweller with an Intelligence skill of 10 wearing a lab coat that boosts Intelligence by 3?   If it is a hard cap, would it be more useful to use outfits that raise a secondary characteristic instead?


I know that $ \displaystyle \lim_{n \rightarrow \infty} \left( 1 + \frac{1}{n} \right)^{n} = e $, but how do I show that $$ \lim_{n \rightarrow \infty} \left( 1 + \frac{r}{n} \right)^{n} = e^{r}? $$ Thanks!

I was wondering if it is possible to get a link to a rigorous proof that  $$\displaystyle \lim_{n\to\infty} \left(1+\frac {x}{n}\right)^n=\exp x$$


#!/bin/bash        $myval=/home ls $mval <- unexpected misspelling  Is there a way to stop the ls command from executing since $mval is not defined? NOTE that this can not be checked for existence because it was a typo. I am looking more for a property that can be set.

I have a script looks like:  c=0 for f in */*; do cp -v "$f" "/myhome/CE$(printf '%0*d' 2 $BATCHNUM)-new-stuctures_extracted/test-$(printf '%0*d' 5 $c)" c=$((c=c+1)) done   However, the user must provide a variable call BATCHNUM and otherwise I need to force this script stop running. It will be better if I could force the script that calls this script to stop too (or even the #1 script that calls #2 script which calls this script).


In this post:  they threat the case when every connected subspace is also closed and $X$ is compact.  Is there any related proof about general non compact and non closed connected subsets?  If not are there any counter examples available? I mean a nested sequence of nonempty connected subset such that the intersection is not connected. Thanks in advance.

Let $(B_i)_{i\in I}$ be an indexed family of closed, connected sets in a compact space X. Suppose $I$ is ordered, sucht that $i < j \implies B_i \supset B_j$.  Is $B = \bigcap_i B_i$ necessarily connected?  I can prove it, if I assume $X$ to be Hausdorff as well: If $B$ is not connected, then there are two disjoint, closed, nonempty sets $C$, $D$ in $B$, such that $C \cup D = B$. Now these sets are also closed in $X$, hence by normality there exist open disjoint neighborhoods $U$, $V$ of $C$ and $D$, respectively.  Then for all $i$: $B_i \cap U^c \cap V^c \ne \emptyset$, since $B$ is contained in $B_i$ and $B_i$ is connected. Thus we must also have  $$ B \cap U^c \cap V^c = \bigcap_i B_i \cap U^c \cap V^c \ne \emptyset $$  by compactness and the fact that the $B_i$ satisfy the finite intersection property. This is a contradiction to the choice of $U$ and $V$.  I can neither see a counterexample for the general case, nor a proof. Any hints would be greatly appreciated!  Thanks,  S. L.


I've got a numpy array and need to sum the values in the rows. Then use the Update Cursor to update a field with this value. However the update cursor is updating the field with the same values.  tbl = arcpy.da.FeatureClassToNumPyArray(dg, ave_fields)  with arcpy.da.UpdateCursor(dg, "Weekly_Ave") as ucursor:     for urow in ucursor:         for i in range(len(tbl)):             urow[0] = sum(tbl[i])             ucursor.updateRow(urow)

I have a large script in which I now need to sum the values of a specific list of fields. I have a list of fields:  ave_fields = arcpy.ListFields(dg, "*Ave_STG*")   This list of fields may vary, hence why im using a list, and not explicit field names.  Now, all I need to do is sum the values in these fields for each row and return this value into another field ("weekly_ave").  Ive tried using SearchCursor:  with arcpy.da.SearchCursor(dg, ave_fields) as ucursor:     total = 0     for urow in ucursor:         for i in range(0, len(ave_fields)):             total += urow[i]     print total   And ive also tried using NumpyArray to get this, but its not returning the right value:  tbl = [row[0] for row in arcpy.da.TableToNumPyArray(dg,ave_fields)]   This is my first attempt at using Numpy so I may not have got this right.  EDIT:  I have managed to get the numpy array to work properly, however i now need to return this value in the new field  tbl = arcpy.da.FeatureClassToNumPyArray(dg, ave_fields)  print sum(tbl[0]) # this allows me to sum a row within the array  #now i loop through each row and sum the values within the array, and return this value in the weekly_ave field for each row with arcpy.da.UpdateCursor(dg, "Weekly_Ave") as ucursor:     for urow in ucursor:         print sum(tbl[0]) # this successfully sums the row, but i need to do this for all rows   I get the following error:  TypeError: unsupported operand type(s) for +: 'int' and 'numpy.ndarray'


If the first party member uses inspiration to land a net, the rest of the party can throw their nets without disadvantage. Would a single strength check remove all nets?

Yesterday, our group was fighting a boss, and I had successfully thrown a net to restrain him (a condition which he could end by either using an Action to make a DC 10 Strength check, or by doing 5 slashing damage to the net by attacking it at disadvantage).  On a subsequent turn, as the boss was still netted, I decided to throw another net (which hit him too), with the objective to force him to use two Actions (or two successful attacks) to free itself.  The DM accepted the "stacking nets" effect, but I'm wondering if it was legitimate, considering that same-name game effects cannot stack at the same place and time, or something like that.  My question is : can you apply multiple net effects to a single target, thus forcing it to spend multiple actions (or attacks) to free itself from the restrained condition ?  An argument in favor of a "yes" would be to say that the different nets cover different parts of the target's body. An argument for a "no" would be to say that a net, by default, covers the entire body, and therefore, the anti-same-name-effect-stacking rule would apply there.


How do I integrate $$\displaystyle \int \sqrt{a^2 - x^2}dx $$  It can be solved using trig substitution, but don't know how to solve.  Thank you.

Is there a simple and nice way to solve $\int\sqrt{a^2-x^2}dx$:  PS:I am not looking for a substitution like $x=a\sin p$,


How to say it in a right way and why?  1. In your advertisement, you had mentioned that you wanted to know about...  2. In your advertisement, you mentioned that you want to know about...  Thank you in advance!

This is the subject that's been bugging me for quite some time now, even though I believe I've managed to grasp the entire reported speech pretty well.  If I want to repeat to someone what I previously said about my opinion on swimming, I could go either with #1:        I said I didn't like to swim.      if I didn't want to emphasize anything, or with #2,        I said I don't like to swim.      if I want to make it clear that my not liking to swim still holds true.     What I can't understand is why I have to switch tenses back if I'm talking about things like:        He didn't know California was on the West Coast.      It's obvious that California hasn't moved a single inch, so why can't I express it by saying:        He didn't know California is on the West Coast.        Similarly, is such shifting required in every utterance of such meaning? For example:        I told you it was impossible to fly.      It's obvious that no matter how hard I tried I still wouldn't be able to fly. So can't I say "is impossible" (#7) in this case?        I told you it is impossible to fly.


A simple scenario:  The DM wishes to break a cleric's concentration on their  spell, and a foe uses  to tell the cleric to cast  on an enemy spellcaster.  The rationale is that this would prevent enemy AoE spells from affecting frontliners.  The PC rejects this, saying "No, my PC thinks that's unreasonable and continues to concentrate on bless instead."      In such a case, who gets the say whether the suggestion is or is not reasonable? Or should it be determined by a Persuasion roll? How can the DM give a fair ruling that doesn't take away the player's agency, but at the same time does not allow the player to freely deny the effects of suggestion?  The rationale is assumed to be "50-50".  This question is different from , as this is specifically asking for guidance on how to give a fair ruling that the suggestion will fail/succeed when the spell is cast on a PC, which may result in agency being taken away from the player.

I have already asked some questions that concern the Suggestion spell ( and ). However, there are still some aspects of this spell that are not clear to me. In particular, the fact that the course of action must sound reasonable can be ambiguous. According to the manual, you cannot ask a target to stab himself, but you can ask him to give his horse to a random person. Now, consider for example the following situations:   A halfling is carrying a magical ring that could be extremely dangerous if it was in wrong hands. A wizard suggests him to give it to the first person he meets. A young seaman has just been given a giant vessel and he is going to set sail, the dream of his life. A wizard suggests him to sell him the vessel for a few money.   can the Suggestion spell be used in these situations? Can these courses of action be considered as reasonable? In general, how to quickly determine if the course of action is reasonable?


I (and my interlocutors) have often experienced confusion when communicating with others regarding "last [day-of-week]", "this [day-of-week]" and "next [day-of-week]"  In my mind, what is logical is that "last" means the last one (the one in the most recent past); "this" means the next one coming up; and "next" is the second one from now.  "This" to me denotes the future - it points forward in time.  For example, today is Tuesday, April 14th. If I say, "last Saturday" I mean April 11th; if I say, "this Saturday" I mean April 18th; and if I say "next Saturday" I mean April 25th - although I admit it gets a little ambiguous when "this" saturday is several days away. But I would definitely be speaking of the 22nd if I were to say, "next Wednesday" (not the 15th, for that is tomorrow, and to say "next" would sound/seem bizarre to me.  Note/Addendum: I would not say "last Monday" for yesterday, because in that case I simply say that ("yesterday"); similary, I would not call tomorrow "this Wednesday" for a similar reason - I refer to that simply as "tomorrow".  I find, though, that many people consider "this Monday" to have been yesterday (the 13th), not "this coming" Monday (which is how I see it).  I do recognize some logic in this alternate viewpoint provided everybody were to agree that the "this" refers to a current week, beginning on Sunday, or Monday, depending on which day is considered a week's beginning point (and so, the differing standard in regards to that question is a matter of contention/confusion in and of itself).  Another way of expressing it, I guess, would be to say that I always consider myself as being in a sliding scale of time, rather than in a particular calendar week, one which stays fixed for an entire week. In other words, today I am in a week that runs from Tuesday the 14th through Monday the 20th. Tomorrow I will be in a week that runs from Wednesday the 15th  through Tuesday 21st, etc. Others apparently always view themselves as being somewhere in a week that runs either from Sunday-Saturday, or Monday-Sunday.  Am I definitely wrong in my take on "last, this, and next" or is it just "different strokes for different folks"? I'm curious how many others (if any?) view time from "my" perspective?  The bottom line is, I always find it beneficial to mention specific dates. So, instead of saying just "this Monday" I say, "this Monday, the 20th"

At what point does next Tuesday mean      the next Tuesday that will come to pass     and no longer      the Tuesday after the Tuesday that will come to pass?   And, when does the meaning switch back?


Problem :  Evaluate : $\int \frac{x^2}{(x\sin x +\cos x)^2}dx$  My approach :   $$\int \frac{x^2}{(x\sin x +\cos x)^2} \, dx $$  $$= \int \frac{x^2}{\cos^2x(x\tan x +1)^2}\,dx$$ $$= \int \frac{\sec^2x x^2}{(x\tan x +1)^2}\,dx$$  Now if I put $\tan x =t$. it won't solve the problem  Please help on this will be of great help thanks

The question:      Compute$$ \int \frac {x^2 \, \operatorname{d}\!x} {(x\sin x+\cos x)^2} $$   Tried integration by parts. That didn't work.  How do I proceed?


If you call a British citizen a Briton, a French citizen a Frenchman and a citizen of Canada a Canadian...  and considering that someone from Asia is and Asian and someone from Africa is a African.  What do you call someone from the United States of America?  It can't be an American, as most Americans live outside the United States in the rest of North and South America.  If there is an official term, will people understand you when you use it?

Citizens of the USA naturally refer to themselves as Americans and refer to the country as America.  When speaking to a person from Canada, he argued that it was incorrect to call the country America. Instead, I should be saying the United States (of America).  Is it incorrect to refer to the country as America? And even if it is, won't people from around the world understand that the USA = America?


degenerated from disagreement of opinion into some discussion over capitalization and luckily didn't go any further. It highlights an issue which has cropped up in, among other places, the very evolved ecology of Wikipedia editors: who moderates the moderators? To what extent are moderators allowed to use the power they wield to enforce decisions about their own conduct?  I'm not affiliated with either 'side' of this one; just a passerby who saw the discussion devolve and would like to prevent it in the future.

One or more of the following things happened to me on a Stack Exchange site:   My post(s) were wrongly deleted or locked by a moderator A moderator posted a wrong comment on one of my posts I was suspended, but did not do anything wrong I asked a meta question, but the question was closed and/or deleted A moderator discredited me in public ...   I think a moderator has abused their power, but I feel powerless against them.  What recourse do I have now? What can I do when I feel that a moderator has abused their power, and has been repeatedly unfair in their dealings with me?


My site has heavy traffic because some bot. I checked access_log, some bot Baiduspider go to my site 10-20 times per minute. I do not need Chinese traffic. I have searched and read    I added rule into the robots.txt then restarted Aache, but it doesn't work. Baiduspider still crawls my site.  User-agent: Baiduspider Disallow: /  User-agent: * Disallow: /feed/ Disallow: /trackback/ Disallow: /wp-admin/ Disallow: /wp-includes/ Disallow: /xmlrpc.php   I found their feedback page  I can translate the page to my language, but I cannot translate and insert captcha.   Then I have searched and find some article:  But when I add it into .htaccess, I cannot access my site,(you do not have permission to access this site) Am i inserted in a wrong position? need a help.  # BEGIN WordPress <IfModule mod_rewrite.c> RewriteEngine On RewriteBase /  RewriteCond %{HTTP_USER_AGENT} ^Baiduspider.* [NC,OR] RewriteRule ^.* - [F,L]  #some custom rewrite rule RewriteRule ^article/([^/\.]+)/?$ /article/$1.php [L,QSA]  RewriteRule ^(.*)$ http://www.example.com/$1 [L,R=301] RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_FILENAME} !-d RewriteRule . /index.php [L] </IfModule>   BTW, my server is CentOS7 apache 2.4.6. I also tried "httpd.conf", but I never find any article about apache 2.4.6 <IfModule setenvif_module>, all the articles are <IfModule mod_setenvif_c>... apache 2.4.6 do cancel order allow,deny rule, I have no idea how  to modify and add into my httpd.conf.  Anyway, I just want to refuse Baiduspider Thanks.

Most of my visits are from baidu spiders. I don't think it helps search engines at all so I'm thinking of how to block them. Could this be done via iptables? I'm using nginx as my webserver.


I used Mobizen. However, only the screen shows up. The sound doesn't come from my PC. Also I do not think I can control my Android device from my PC.  Any way to do that?  I want to connect via Wi-fi. Mobizen seems to be web based which means information would go through Internet first before showing up on my PC.

I am looking for a solution/technology which allows remote screencast display and control from desktop. My goal is to provided remote mobile device display through a browser. I found some existing solutions:   AndroidScreenCast: Based on ADB interface. this is just screenshots using a simple primitive provided by ADB. low display. VNC client & server. works for both rooted android and jailbroken iphone. low display. iDemo + ScreenSplitR: Better, jailbroken iphone only. HDMI/TV output: No remote control.   I've heard about "direct-to-device" technology which is used by DeviceAnyWhere. Are there any other solutions?


i'm having the class name as string format "MyClass",i want to create a object for that class where i am referring this class namespace in     dll.   my requirement is:  MyClass myClassObj=new MyClass();   all i am having is string name= "MyClass";  so, by using the string name is there anyway to convert string as class object??  I had tried giving      "using NotCurrentProject.Entities"  string selectItem="myString"; Type elementType = Type.GetType("NotCurrentProject.Entities." + selectedEntity + "); object o = Activator.CreateInstance(elementType);

Is there a way to create an instance of a class based on the fact I know the name of the class at runtime. Basically I would have the name of the class in a string.


Is it more correct to say:      Your service expired last June 1, 2017   as opposed to      Your service expired on June 1, 2017   If yes, why?

Please enlighten me about the difference in using "last" and "on" when writing dates.  For example, which one would be correct: "I attended the meeting on December 14, 2014." Or, "I attended the meeting last December 14, 2014." I can't find any resource for answers. Thank you in advance.


I'm trying to get a click handler function in javascript to allow multiple parameters and also still be able to access the event object from the browser.  Digging around on stack, I found this     I tested it in a fiddle and it works. I don't understand why though.      My JS code in the fiddle:  div=document.querySelector('div'); data = "data";  let testFunction = function (data) {     return function (event){     console.log(event);    console.log(data);      };  }  div.addEventListener('click', testFunction(data));   I read this article on closures and it helped but still don't understand.     What I think I know is:  When a click happens, testFunction is executed and data is passed.     testFunction returns a function (which creates a closure that stores local variables in scope)  the 'data' variable is in the closure because it was a parameter passed in  But what about 'event'...how does the return function know that 'event' is the event object from the browser???

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


I have a single .png file that contains 4 figures (images) uniformly located on it. I would like to have a subfigure letter for each of them ( (a),(b),(c),(d) ), but I would like to avoid manually separating the figure in 4.  Is there a way to include a line below a single figure with (a),(b),(c),(d) between the figure  and the caption? Best possible case by choosing the location of these letters so I can adjust them as pleased.

I have a single image which contains two sub-images. I want the following subtitles (a) and (b) to be shown correctly.   In which, left sides is my current image which contains two rectangular. And right sides is my expected result. I found a solution is that we can use subfig package. However, it requires separating the original figure into two subfigure. In that question, I am regarding that we do not need split original figure, I want to write (a),(b) directly below figure. Thanks Current solution is  \begin{figure}[H] \captionsetup{labelfont={bf}}   \centering     \subfloat[]{\centering\includegraphics[scale=0.5]{Fig1a.png}} \\     \subfloat[]{\centering\includegraphics[scale=0.5]{Fig1b.png}}   \caption{This is main figure}   \label{fig:9} \end{figure}