$\text{Ramification Lemma}:$   Let $A$ be a ring, $\alpha$ an ideal of $A$, and $M$ an $A$-module. Then prove $M/ \alpha M \cong (A/\alpha) \otimes_A M $.  Proof: We have the exact sequence: $$0 \to \alpha \to A \to A/\alpha \to 0.$$ (Why ?)  Tensoring with $M$ gives another exact sequence:  $$ 0 \to \alpha \otimes A \to A \otimes M \to A/ \alpha \otimes M \to 0.$$ i.e, $$0 \to \alpha \otimes A \to M \to A/ \alpha \otimes M \to 0,    $$ because $A \otimes M=M$.  The image of $\alpha \otimes_A M$ in $M$ are sums of elements of the form $a_i \cdot m_i$,   where $a_i \in \alpha$ and $m_i \in M$. This implies $M/ \alpha M \cong A / \alpha \otimes_A M$.     Please just explain how the sequence are exact?   what are the functions like $\alpha \to A$, $A \to A/\alpha$ etc?

Say we have a commutative ring $A$, an $A$-module $M$, and an ideal $\mathfrak{a}$ in $A$.  Then we have the short exact sequence:  $$ 0 \to \mathfrak{a} \hookrightarrow A \twoheadrightarrow A/\mathfrak{a} \to 0 $$  After tensoring with $M$ we're left with the exact sequence:  $\mathfrak{a} \otimes_A M \rightarrow A \otimes_A M \twoheadrightarrow A/\mathfrak{a} \otimes_A M \to 0$.  We know that $A \otimes_A M \simeq M$ and so $A \otimes_A M /\ker \pi \simeq A/\mathfrak{a} \otimes_A M$.  Where $\pi$ is the surjection in the last sequence.  $\ker \pi = \{ \sum a_i \otimes m_i : \sum \pi(a_i) \otimes m_i = 0 \}$, so how do I conclude that $\ker \pi \simeq \mathfrak{a}M$?


How can I check if it is dual boot os in my system or not.When I restart my system, it doesn't shows any option regarding windows OS. If there is no windows, how can I uninstall ubuntu from my system ? please help !!!

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


I am new to ubuntu. I connected ubuntu to my home network and it just stays at 0kBps or move around a little bit from 0 to 1kBps.  I tried at lot of solutions. None of them seems to work for me.  The weird part is whenever i try to open a webpage it takes 20-30 seconds before i could see a real development but speedtest.net open instantly and the speed test shows i have 2MBps connection.  I am using SYstem Monitor app from app store to check network speed. The time the test is running, speed jumps to 2MBps and then suddenly drops to 0 after the test is finished.  Please help guys.   sudo lshw -class network gives *-network                       description: Wireless interface        product: AR9285 Wireless Network Adapter (PCI-Express)        vendor: Qualcomm Atheros        physical id: 0        bus info: pci@0000:03:00.0        logical name: wlan0        version: 01        serial: 74:2f:68:b6:e4:5f        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless        configuration: broadcast=yes driver=ath9k driverversion=3.16.0-50-generic firmware=N/A ip=192.168.1.106 latency=0 link=yes multicast=yes wireless=IEEE 802.11bgn        resources: irq:17 memory:ddc00000-ddc0ffff   *-network        description: Ethernet interface        product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:05:00.0        logical name: eth0        version: 06        serial: 54:04:a6:12:e6:9a        size: 10Mbit/s        capacity: 1Gbit/s        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress msix vpd bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=half firmware=rtl_nic/rtl8168e-2.fw latency=0 link=no multicast=yes port=MII speed=10Mbit/s        resources: irq:46 ioport:9000(size=256) memory:d2104000-d2104fff memory:d2100000-d2103fff

Since I upgraded from Ubuntu 10.10 to 11.04, my internet connection is as slow as hell. I have tested my other 10.10 machine and it is just as quick as the first one was.  What has happened? Why is the maximum download speed now 30kb/s instead of the 2.5mb/s I used to have?


hi i already had a similar problem but unfortunately i can't figure it out how to solve it. I have a List<int> tmpList and a List<int> tmpSpeicherListe where i want to copy my tmpList so i can edit my tmpList and reset it when i need to. I want to edit tmpList multiple times in for loop and reset it everytime while loop repeats but if i remove one value of tmpList at position x it removes the value of tmpSpeicherListe at position x too. So where should i place the declaration of List<int> tmpSpeicherListe = tmpList; or where else is the mistake? ps: this is just a part of my code //...  List<int> tmpSpeicherListe = tmpList;            //copy tmpList int basisPosition = 2; int counter2 = 0;  while(counter2 + 2 < tmpList.Count - 1) {     basis = tmpList[basisPosition];     for (int m = 1; m < tmpList.Count - basisPosition; m++)     {         int speicher = tmpList[basisPosition + m];         bool vorhanden = false;         for (int n = 0; n < intKombinierbar[basis].Length; n++)         {             if (intKombinierbar[basis][n] == speicher)             {                 vorhanden = true;                 break;             }         }         if(vorhanden == false)         {             tmpList.RemoveAt(basisPosition + m);        //edit tmpList BUT tmpSpeicherListe changes too         }     }       if(tmpList.Count <= i)     {         tmpList = tmpSpeicherListe;            //reset tmpList         counter2++;         basisPosition = 2 + counter2;                                                      }     else if (basisPosition == tmpList.Count - 2)     {         großeKombinationen.Add(tmpList);         tmpList = tmpSpeicherListe;            //reset tmpList         counter2++;         basisPosition = 2 + counter2;                                                      }     else     {         basisPosition++;     } } //...

I have a generic list of objects in C#, and wish to clone the list. The items within the list are cloneable, but there doesn't seem to be an option to do list.Clone().  Is there an easy way around this?


I have an 8-year-old dual boot laptop, but it won't start Ubuntu or Windows. When selecting Ubuntu, I get a BusyBox, that mostly says:  failed command: READ FPDMA QUEUED blk_update_request: I/O error, dev sda, sector 552058008     Are there any software solutions or is this machine doomed?  I tried for example:  dd if=/dev/sda of=/dev/sda   but it didn't have any effect.  I don't care if I lose all my data, I just want it to be alive again.    I did the smart check via a live CD, and when I first visited the Disks, the /dev/sda was OK, with 57 bad sectors. After running a short and a conveyance, the test failed:    Does that mean that me disk is dead?   All the attributes have an OK assessment in the smart test, so there might be hope. Moreover, if I choose "Check disc for defects" from the live CD, it completes, with no errors found.

I've run across (personally or by proxy) a bunch of storage media that exhibited physical problems during their life. Hard disks, solid state drives and other flash storage media all fail after some time. The situation is worse with USB flash drives and flash cards because of the large amount of suppliers with inferior flash cell and flash controller quality.  How can I reliably detect if a storage drive suffers from physical damage?  Note that this question isn't about file system integrity (which can be checked with ).


hope you all fine. Can i make a symbolic link of a file from NTFS partition to ext4 partition? For example, i wanna make a link from /media/username/mydeviceName/DIRECTORYNAME (which is NTFS partition)  to ~/Desktop (ext4 partition).

I'm facing difficulty in creating a symbolic link to /media/my-username/storage/folder in ~/Desktop by using:  cd ~/Desktop ln -s '/media/username/Storage/My-Files/semester-5' .   It creates a broken link instead of the symbolic link. I've checked the ownership of Storage; it has root permissions, and it is an NTFS partition (because I've dual booted the with windows). I think it is read/write permission problem.  Any idea what should I do for that?


I am having a problem using biber/biblatex, that I just can't seem to solve. The first problem was Biber complaining about finding the wrong version of biblatex control file (2.6 instead of 2.5), which I tried to fix by installing the latest biber (1.9) .  Now however, the following error occurs:       read_file 'C:\Users\username\AppData\Local\Temp\par-7363686d6964746b\cache-c38a9b05b97a81d339b4947ba00f0aacefe00497\inc\lib/Biber/LaTeX/recode_data.xml'     - sysopen: No such file or directory at  C:\Users\usermane\AppData\Local\Temp\par-7363686d6964746b\cache-c38a9b05b97a81d339b4947ba00f0aacefe00497\inc\lib/Biber/LaTeX/Recode.pm line 112.  INFO - This is Biber 1.9 INFO - Logfile is 'test.blg'   What to do?? Is it the same problem as ??

I'm trying to use biblatex and when I compile my document I get an error like the following:  Windows  data source C:\Users\<username>\AppData\Local\Temp\par-5061756c\ cache-890efc00b3ca6b775c7d44a325c1349fb2a3a3bd\inc\lib/Biber/LaTeX/recode_data.xml not found in .   Mac  data source /var/folders/v2/rld0ls7d2935gkvqv5hfr1x00000gn/T/par-616c616e/ cache-cdd483146f82a9655ce063f848d5139480fbf872/inc/lib/Biber/LaTeX/recode_data.xml not found in .   Linux  data source /tmp/par-6963617269756d/cache-f37ab610b7d79b2720a8ee3732849c6821705520 /inc/lib/Biber/LaTeX/recode_data.xml not found in .


I have an old Excel file in the USB drive, unfortunately, i accidentally copied it into a folder that contains a newer version with the same name and overwrote the new version. I want to get my old excel back and can anybody help me?

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


I'm having trouble downloading steam to Ubuntu, his is my first time trying this I have a Google Chromebook and i tried to YouTube how to download steam and i pretty much have it, but it says that i'm missing some files steam needs in order to download. I've tried everything i don't know what to do or what i'm doing honestly. I need some help


Well is adverb and known is adjective. As far as I know, it should not be hyphenated. For example: clearly impossible task, extremely powerful processor.

Possible Duplicate:          What is the proper way to spell "side dish"? Is it: "side dish" or "side-dish"?  Also, Is it "ham-fried" or "ham fried"?  Basically, when do you use hyphens?


For instance, let's posit a character, sorc 1 wiz 1, that can cast Ice Knife through Sorcerer, and Burning Hands through wizard.  But their INT is 16, and their CHA is 18.  What would their save DC base off of, for Burning Hands?

Can a multiclass character use either of its spellcasting modifiers for spells?  When character multiclasses into multiple classes that can cast spells, which modifier do you use for casting the spell? Or do you use whichever you prefer?   Say, for an example, someone multiclasses Wizard into Warlock. Does the combination of classes even matter?  Is it the same for exclusive spells too? Like using Eldritch Blast, can you use your intelligence modifier instead of charisma?


The following was marked as duplicate of the question , but I disagree:  the answers to that question all involve modifying the geometry or making derived geometries, and they deal with shading and transparency rather than fill patterns.  The question below clearly says those options have already been explored and do not do the trick.  I'm looking for a way that does not involve modifying the geometry or making derived geometries - let's face it, we're talking about a style here, not about ways to modify geometry - and is generic to any fill type or transparency level.  If this is still deemed a duplicate question, then the answer must be "no you can't do that as a style".  I'm new to arcgis but have been using qgis for a while.  Question on polygon styles in arcgis:  is there a way to make an 'inside buffer' outline or border style?  I know you can use the buffer tool to make an actual feature that is buffered by a number of geographical distance units, but for this case it would be much better to have a style that has a buffer (or halo) of a certain number of pixels regardless of zoom level, something like this quick hackjob in gimp:     solid line for the boundary of the polygon inside buffer or halo of a crosshatch pattern >>that does not rotate as a function of polygon outline angle at that point<< (I tried a marker line inside halo (offset by a negative number) and it looks fairly dorky due to rotation along the line) the rest is transparent   Can it be done?  Seems like this isn't that unusual of a thing to do.  Boundaries of all sorts are drawn this way on paper maps and they look quite nice.  Thanks in advance

The attached screenshot of a National Geographic map shows some beautiful directional shading of boundaries.  I'm trying to reproduce this sort of shading for a burn perimeter map, as I want to highlight features within the burn perimeter and not overshadow them with a transparent polygon or crosshatch.  Is there a way to accomplish this sort of boundary shading using ArcGIS 10?  Link to  titled: "1946 Political Subdivisions Of India By National Geographic.jpg"


When I type in sin(45) into a calculator I get the value 0.707. When I type in sin(135) into a calculator I also get 0.707. What is the procedure that creates the same value in both cases? Is it some if, then function? ie if x>90 minus 90 sort of thing?? I hope I am clear with what I am asking.  Any insight would be greatly appreciated. Many thanks.

Sine $\theta$ = opposite/hypotenuse   Cosine $\theta$  = adjacent/hypotenuse   Tangent $\theta$  = opposite/adjacent      In order to calculate the sine or the cosine or the tangent I need to know $3$ sides of a right triangle. $2$ for each corresponding trigonometric function. How does a calculator calculate the sine, cosine, tangent of a number (that is actually an angle ?) without knowing any sides?


Show that there are infinitely many positive integers $N$ that cannot be written in the form $a^n+b^n+c^n$ where $a,b,c$ are positive integers and $n \geq 2$.   I thought about considering solutions such that $$a^n+b^n+c^n < N^n.$$ Thus $a,b,c < N$. Thus there are less than $N^3$ positive integers expressible in the required form that satisfy the above inequality. Therefore, there are at least $N^n-N^3$ that aren't for a given $n$. I didn't see how to continue from here since the exponent $n$ can vary.

Show that there are infinitely many positive integers $N$ that cannot be written in the form $a^n+b^n+c^n$ where $a,b,c$ are positive integers and $n \geq 2$.   Note that in the question above, $n$ can vary and is not fixed.  I thought about using a modular arithmetic argument by finding a set of values which are not expressible when the exponent is $3n,3n+2,$ or $3n+4$ and then use the Chinese Remainder Theorem.  Note that for all expressions of the form $$a^{3n}+b^{3n}+c^{3n},$$ the numbers which are $4,5,6$ modulo $9$ are not expressible in these forms since each of the terms is $-1,0,1 \pmod{9}$. For expressions of the form $$a^{3n+2}+b^{3n+2}+c^{3n+2} = a^{3n} \cdot a^2+b^{3n} \cdot b^2+c^{3n} \cdot c^2,$$ note that $x^2 \equiv -1,0,1,4 \pmod{9}$ and that $x^3 \equiv -1,0,1 \pmod{9}$. But I couldn't find a set of numbers modulo $9$ which weren't expressible in this form.   For expressions of the form $$a^{3n+4}+b^{3n+4}+c^{3n+4},$$ note that $x^4 \equiv 0,1,3,9 \pmod{13}$ and $x^{3n} \equiv -1,0,1,8 \pmod{13}$. Therefore, $x^{3n+4} \equiv 0,1,3,7,8,9,10,11,12$, but I couldn't find a set of numbers modulo $13$ which weren't expressible in this form.  Can we use a modular arithmetic argument similar to this to solve the cases for $3n+2$ and $3n+4$ one or do we need to use a higher exponent such as $6n$ instead of $3n$?


Evaluate   $$\frac{1}{1^2}+\frac{1}{3^2}+\frac{1}{6^2}+\frac{1}{10^2}+\cdots+\frac{1}{\left[\frac{k(k+1)}{2}\right]^2}+\cdots$$    to $\infty$, where $k$ is the $k$th term of the series.   Using Microsoft Excel, I found that the sum of the first $100$ terms $=1.15947\dots$.  Does the convergence value have an exact form? If yes, what is it?

Evaluate $\sum_{k=1}^{\infty} \frac{1}{k^2(k+1)^2}$.   I've tried to use a telescoping approach, but it doesn't seem to work. It doesn't also seem to converge to a "pretty" value as well.


I have a restful API on my node js server that pulls down into from my SQL DB. When I launch the js code it works and prints to my console log...   How do I get a button on my HTML page to execute this API call? So when the user clicks the button it launches that code and pulls down the info from the DB  here is my code in my js file that grabs the info from my DB  app.get('/getcount/apples', function (req, res) {         sql.connect(config, function (err) {             if (err) console.log(err);         var resultapples = new sql.Request();         result.query("SELECT count FROM table12 WHERE fruit = 'apples'", function (err, result, fields) {         var arrayLength = result.length;         for (var i = 0; i < arrayLength; i++) {         console.log(result[i]["count"]);         }; }); }); });   So how do i get that to launch / execute from my html page

I need to do an  request in JavaScript. What's the best way to do that?  I need to do this in a Mac OS X dashcode widget.


When referring the more than one alpha, is the correct spelling αs or α-s?

When writing (a blog post, script, etc..) what is the proper way to indicate two or more instances of a single letter? For instance, in Monty Python's Bookshop Sketch:     C: I wonder if you might have a copy of "Rarnaby Budge"?      P: No, as I say, we're right out of Edmund Wells!      C: No, not Edmund Wells - Charles Dikkens.      P: (pause - eagerly) Charles Dickens??      C: Yes.      P: (excitedly) You mean "Barnaby Rudge"!      C: No, "Rarnaby Budge" by Charles Dikkens.  That's Dikkens with two Ks, the      well-known Dutch author.      P: (slight pause) No, well we don't have "Rarnaby Budge" by Charles Dikkens      with two Ks, the well-known Dutch author, and perhaps to save time I      should add that we don't have "Karnaby Fudge" by Darles Chickens, or      "Farmer of Sludge" by Marles Pickens, or even "Stickwick Stapers" by Farles      Wickens with four M's and a silent Q!!!!!  Why don't you try W. H. Smith's?      C: Ah did, They sent me here.   I had always believed that plural never uses an apostrophe before the 's' (it's only used for possession), but I have rarely seen in written material the format "four Ms". (On a side note, whoever wrote  also used "two Ks".)  On a side note, and perhaps this should be a separate question, if a Compact Disc is a CD, then two Compact Discs would be two CDs right? (I see "CD's" written everywhere)


How to prove that the following matrix has an inverse with integer entries? Also find out the inverse.  \begin{bmatrix}     1 & \frac{1}{2} & \frac{1}{3} & \cdots &\  \frac{1}{n-1} & \frac{1}{n} \\ \frac{1}{2} & \frac{1}{3} & \frac{1}{4} & \cdots &\  \frac{1}{n} & \frac{1}{n+1} \\  \frac{1}{3} & \frac{1}{4} & \frac{1}{5} & \cdots &\  \frac{1}{n+1} & \frac{1}{n+2} \\ \frac{1}{3} & \frac{1}{4} & \frac{1}{5} & \cdots &\  \frac{1}{n+1} & \frac{1}{n+2} \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots\\ \frac{1}{n} & \frac{1}{n+1} & \frac{1}{n+2} & \cdots &\  \frac{1}{2n-2} & \frac{1}{2n-1} \\   \end{bmatrix}

Let $A$ be the $n\times n$ matrix given by $$A_{ij}=\frac{1}{i + j - 1}$$ Show that $A$ is invertible and that the inverse has integer entries.  I was able to show that $A$ is invertible. How do I show that $A^{-1}$ has integer entries? This matrix is called the Hilbert matrix. The problem appears as exercise 12 in section 1.6 of Hoffman and Kunze's Linear Algebra (2nd edition).


I'm using vanilla Ajax. I've just loaded the second html page via the first one. In the second one, there are two rows of "script src". No one of it has been loaded. Is there any reason for that?  function loadPage(url)  {     let Request = new XMLHttpRequest();     let content = document.getElementsByTagName('main')[0];      Request.onreadystatechange = () => {         if (Request.readyState == 4 && Request.status == 200) {             content.innerHTML = Request.responseText;         }         else if (!Request) {             alert('Lalala');         }     }      Request.open('GET', url);     Request.send(); }   P.S. Please, advise me resolve without JQuery. THANKS!

I have a system where I send an Ajax command, which returns a script block with a function in it. After this data is correctly inserted in the DIV, I want to be able to call this function to perform the required actions.  Is this possible?


I would like to sort my comments by votes.  My hope is to find my old obsolete comments and delete them when they don't add value to the posts.  I assume that if they have an up vote at all, they are valuable.  It may also be useful to get feedback on which comments are helpful to others.  Related: , , etc.

It would be helpful to show vote counts on the activity > comments page, and also allow sorting by votes.  This would make it easy to see what comments other people thought were valuable or at least amusing.


in the following program, I want to derive a class from a base class. In my code everything seems to be OK. However, I am getting error shown in the below program. Please explain the reason for the error, and how to correct it.   #include <iostream> using namespace std;  struct Base {     int x;     Base(int x_)     {         x=x_;         cout<<"x="<<x<<endl;     } };  struct Derived: public Base {     int y;     Derived(int y_)     {         y=y_;         cout<<"y="<<y<<endl;     } };  int main() {     Base B(1);     Derived D(2); }   This is the error:  Output:   error: no matching function for call to 'Base::Base()  Note: candidate expects 1 argument, 0 provided

What are the C++ rules for calling the base class constructor from a derived class? For example, I know in Java, you must do it as the first line of the subclass constructor (and if you don't, an implicit call to a no-arg super constructor is assumed - giving you a compile error if that's missing).


What are the fundamental basics that i need to study quantum field theory? basics of Mathematics and physics??

I am curious about which areas of mathematics one should be comfortable with before learning QFT.  I am familiar with the "learn-it-as-you-go" approach often advocated in physics, but would like to know how to avoid that in learning QFT.  Naming of specific textbooks is appreciated.  (For the sake of this discussion, "learning QFT" can be taken to mean "learning at the level of/from Peskin and Schroeder's text.")  In particular, I would like to know what, in addition to the material in Rudin's Real and Complex Analysis, one should know.  Would this be sufficient?  How about Folland's Real Analysis?


I wrote a code using two type of Object styles. Both are working properly. I just want to know what is the difference between these both types.  PatientsTabData ob[] = {new PatientsTabData().SetPatientId(                 Integer.parseInt(String.valueOf(jsonObject.get("PatientId")))) .SetRxId(Integer.parseInt(String.valueOf(jsonObject.get("TrackingNumber"))))};  PatientsTabData[] ob = {new PatientsTabData().SetPatientId(                 Integer.parseInt(String.valueOf(jsonObject.get("PatientId")))) .SetRxId(Integer.parseInt(String.valueOf(jsonObject.get("TrackingNumber"))))};   Both types are working.

I have recently been thinking about the difference between the two ways of defining an array:   int[] array int array[]   Is there a difference?


In Python:  s = "Gwen Stefani" a = s[:0] b = s[0]  print type(a) # str print type(b) # str print len(a)  # 0 print len(b)  # 1   I understand that s[:0] is empty, but it also means from the start of the string so I would have thought that:   s[:0] is the same as s[0]

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


I am assuming that $\lambda\neq0$ and $B$ is an $n \times n$ matrix such that $$B^3-2B^2-6B+\lambda I_n=O_{n,n}$$ Show that $B$ is invertible.  I know  that for B to be invertible then $\det(B)\neq0$. But I do not know where to go from here.

If matrix $A$ is an $n\times n$ matrix such that $A^2 -A -2I=0$.  How can I show that $A$ is invertible and that $A^{-1} = \frac12(A-I)$? Also, how do I show that one of the eigenvalues of $A$ is $2$ or $ -1$? I appreciate any help on this question.


Im not sure where to start. I first assume $|G|<{\infty}$ and $|G|=2k$ with $k\ge{1}$. Then take some element $g\in{G}$, but I can't see what I can show from the assumptions.

I am working on the following problem from group theory:     If $G$ is a group of order $2n$, show that the number of elements of $G$ of order $2$ is odd.   That is, for some integer $k$, there are $2k+1$ elements $a$ such that $a \in G,\;\; a*a = e$, where $e$ is the identity element of $G$.


How to show $\sqrt{p_1}$ is not in $Q[\sqrt{p_2},...,\sqrt{p_n}]$ if $p_1,...,p_n$ are distinct primes? Intuitively, this is pretty clear, but it makes me very uncomfortable to just believe. Any idea to prove this rigorously? I want this result because I am trying to compute the Galois group of $(X^2-p_1)...(X^2-p_n)$. If I know the statement is true, then the Galois group of this polynomial will be direct product of separate Galois group.

I need to find a way of proving that the square roots of a finite set    of different primes are linearly independent over the field of    rationals.    I've tried to solve the problem using elementary algebra  and also using the theory of field extensions, without success. To  prove linear independence of two primes is easy but then my problems  arise. I would be very thankful for an answer to this question.


I've just completed a fresh install of 18.04. An install of NVDIA drivers failed and now my resolution is 1024x768. I've attempted to go to a tty so I can install the drivers without the console running. However using CTl-ALT-F3 or F4 just bings me to a black screen with no prompt. I can get back to the GUI by using CTL-ALT-F2.   What can I do to get to a tty?

I want to know if there is a way to switch to console mode from the boot menu.  I have an NVIDIA 1070 and every time there is an update, the GUI stops working. All I need to do is re-install the drivers; however, to do that I need to be in console mode. EDIT: I should have added more information to this question but I'll comment on all answers. In short: I've tried text instead of quiet splash I do see booting activity in text mode; however, I don't get a login screen and ctrl + Alt + F1 doesn't help because GDM keeps trying to restart. Previously I managed to kill GDM through multiple tries but is not working since the latest update. EDIT: After searching for runlevel, I've found  but I think it required me to have a running system to make changes -- please correct me if I'm wrong.


If $f, g\in \mathcal{C}([a,b],\mathbb{R})$ and $$\int^b_af(x)\,x^k \, dx=\int^b_ag(x)\,x^k \, dx, \text{ for all } k \in \mathbb{N}$$ Prove that $f=g$.   I'm trying to prove this but I don't know how to proceed. Any suggestions?

Let $f:([a,b],\vert\vert)\to (\mathbb{R},\vert\vert)$ a continuous function. Show that, if $$\int_{a}^{b}{f(x)x^{n}dx}=0$$ for all $n\in\mathbb{N},n\geq 0$, then f is identically zero.   My attempt: Let $A=\{p\in C[0,1]\vert p(x)=a_{0}+a_{1}x+...+a_{n}x^{n}\}$, then $A$ is a algebra of constant functions and separates points. By Stone-Weierstrass theorem, given $\epsilon>0$, exist $p\in A$ such that $\lVert f-p\rVert<\epsilon$ and as $[0,1]$ is compact and $f$ is continuous, exist $M>0$ such that $\vert f(x)\vert\leq M$. So, $$\vert\int_{a}^{b}{f^{2}(x)dx}\vert=\vert\int_{a}^{b}{f(x)(f(x)-p(x))dx}+\int_{a}^{b}{f(x)p(x)dx}\vert$$ $$\leq \int_{a}^{b}{\vert f(x)\vert \vert f(x)-p(x)\vert dx}\leq M\lVert f-p\rVert<\epsilon M$$ $\therefore\int_{a}^{b}{f^{2}(x)dx}=0$, then $f\equiv 0$. So, for what reason if $\int_{a}^{b}{f^{2}(x)dx}=0$, this implies my problem? Thanks


The O/S of Desktop in question was UBUNTU 14.04. Few days back this was formatted and UBUNTU 16.04 was installed. However after upgrading when it was found that the printer is not working, I downloaded HPLIP from . Notwithstanding, the position is same. How to resolve the issue?   The issue could be resolved yesterday with the procedure described in the link.   Therefore, now it stands SOLVED.

Let's assume that one has some modern HP printer and/or scanner which is  supported by HPLIP package from official repository. Or supported by newer version of HPLIP package (see  about installation).  From official documentation () it is known that device needs proprietary/binary driver or plugin.  How should one install such plugin?


I want to add a launcher icon to execute a shell script. The script has execute permissions for all users. I've created a file called wake.desktop in ~/.local/share/applications/:  [Desktop Entry] Exec=gksudo /home/myuser/enablewake.sh Icon=/home/myuser/icon1.png Encoding=UTF-8 Terminal=true Name=EnableWake Type=Application   This is the script:  #!/bin/bash # Enable Wake on IR for USB bus 3 port 1 (MCE Remote)  echo enabled > /sys/bus/usb/devices/3-1/power/wakeup   Unfortunately there's no entry in my launcher. How can I get a shortcut to this shell script on my launcher?

Will Unity allow making custom launcher icons from .desktop files or via menu editing system? (Right now the launcher doesn't give the option to "keep in launcher" on all programs.  For some programs I use, I have to make custom launchers or .desktop files.  For instance, daily blender builds are generally just folders with an executable.  In basic Gnome or KDE, I can make a new menu entry with the menu editing system. Then, I can also add it to Docky either from the menu or by dragging a .desktop file to it. Unity launcher doesn't support drag and drop, so thats not a bug or anything, but when I open a .desktop file, it has unpredictable results. Most time it will not have "keep in launcher". Sometime it will have a pinnable item without the .desktop's icon, and if I pin the item to the launcher, it will not call upon the program again after closing it. I've also gotten it to just work with a .desktop file for celtx.


I have a webform and would like to run a method to return a list of all of the control ID's from within the form so I can export the list into somewhere like Excel (copy and paste from another object is fine).  Heres an example of what I want to return:  lblName lblAddress txtEmail ddlSelection   How can I go about doing this?

I am having a number of panels in my page in which I am collecting user information and saving the page details. The page panel has textbox, dropdown list, listbox.  When I need to come to this page. I need to show the Page if these controls have any values. How to do this?


I had a Logitech G9 and my mouse kept disconnecting/reconnecting after a few seconds randomly. So I changed back to my MX518 and didn't have the problem for at least a month. Then it started again. Right now I just had a disconnection/reconnection every 5 seconds for an entire minute.  I've looked into Device Manager and everytime the disconnection was happening it was refreshing. I tried turning off the power management off all the USB Root Hub. I don't know what to do anymore.  Here's a screenshot of my device manager :    EDIT: And I've also tried the mouses on other computers and they work fine. I'm on windows 7 64 bits.

My mouse will reconnect/disconnect (will even hear the sounds from Windows), and the light on the bottom of the mouse will turn off/turn on as it starts working again.  It really sucks to be playing a game (and happens on desktop as well) for the mouse to just die out for a few seconds and come back. Sometimes it will not happen for days and other times it will do it two or more times within 15 seconds.  I tried two different wired mice, tried multiple USB ports (on the front of the computer, back of the computer, used a USB hub and plugged in a card that connects to the USB connectors on the motherboard and adds a few USB ports to the back of the computer, and I also bought a USB 2.0 PCI card and that did not help).  Nothing else seems to reconnect like this, my USB keyboard has never once cut out like the mouse does and neither have any of the other devices I have connected (webcam, USB hub, various devices sometimes connected through USB cables, and IR receiver for windows Media Center remote). I have disconnected all USB devices except for my keyboard and mouse and the problem still occurs.  I guess it could be something wrong with my motherboard but since no other devices behave similarly I'm just hoping that it is some kind of driver conflict. Installing Logitech's drivers has had no effect. It seemed at first that if I go to  and uninstall  mouse (that and Logitech mx518 are listed) that would fix it, but it doesn't seem to work anymore or at least not every time (it keeps re-installing).  I have googled "USB mouse disconnects and reconnects", and it seems to be fairly common but none of those were resolved.  To stick some easy steps:   It happens with or without the drivers installed It has happened with multiple mice on the same computer The BIOS is the latest version (P08) Motherboard drivers are the latest version Device Manager isn't listing any problems on any USB devices Happens with every USB port, even addon USB cards Happens when all USB devices aside from mouse and keyboard are unplugged   I read that maybe it is an IRQ conflict, and I tried to look into that but did not really know what was going on, but didn't see anything obviously wrong.  Specifications:     CPU EVGA 780I SLI motherboard 4 GB RAM  mouse Windows 7 64-bit  screen card 650 W power supply (single rail).


I want to find duplicated values on a String . I know there are other solutions to find that but i want to use HashMap. here is my solution.!! what i am missing on the last part ? i want to get just the duplicate letters public static void doublicatess(String str) {                            HashMap <String , Integer> hashmap = new HashMap<>();              String[] array = str.split("");              for( String string : array) {                  if(hashmap.get(string) == null) {                      hashmap.put(string, 1);                  }else {                      hashmap.put(string, hashmap.get(string) + 1);                  }              }                            for(int i = 0 ; i < hashmap.size() ; i++) {                  int target = hashmap.get(array[i]);                  if(target > 1) {                      System.out.print(hashmap.get(target));                  }              }          }  public static void main(String[] args) {         doublicatess("alaaass");     }  the output is null while it should be [a,s]

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


Complex $z$ is given as $\frac{1}{2} + yi$    What is $y$ if    $$ 2^{\frac{1}{2} + yi} = -2 $$   What is $y$ if   $$ 3^{\frac{1}{2} + yi} = -3 $$  How to calculate it for other values?

Actually that is, I would like to use a complex exponent to turn a number x into an -x just by applying some complex exponent to x. I think I would have to use some ln, π and so one, but I am actually stack and cannot find the correct path to solving it.  For example, let's say for 2 we choose the real part to be equal 1, what would be the solution for y in this special case.  $$ 2^{1 + iy}=-2 $$  What would be the solution for the imaginary part of z if the real part must be 0.5?  $$ x^{0.5 + iy} = -x $$  $$ x^{0.5} * x^{iy} = \sqrt{x} * -\sqrt{x} = -x $$  What is y in this case?  Is there maybe a general solution for  $$ x^{z}=-x $$


Do you have any plans on productizing this forum for third parties? I'm currently working for a telco provider here in Sweden and we'd like to use your solution on our supportpages, preferably thru an API so we can control the look and feel of the site/pages.  If not, are there any other players out there that offer similar products? We've looked at zendesk, desk.com and a few others but they're all lacking in features such as great tagging, votes on answers, merging of questions and a few other key features for us.

Is the Stack Exchange engine that powers Stack Overflow available to download or install internally for an enterprise or company?  I think Stack Exchange's engine is very great and could be very cool to use for internal enterprise patterns and practices, like the engine of Wikipedia.


Let $(X, d)$ be a metric space. Let $A, B ⊆ X$ be nonempty disjoint subsets and suppose $A$ is compact and $B$ is closed. Show that the sets $A$ and $B$ have a positive distance, i.e. show $d(A, B) := inf\{(a, b): a ∈ A, b ∈ B\} > 0$

Claim: Let $X$ be a metric space. If $A,B\in X$ are disjoint, if A is compact, and if B is closed, then $\exists \delta>0: |\alpha-\beta|\geq\delta\;\;\;\forall\alpha\in A,\beta\in B$.  Proof. Assume the contrary. Let $\alpha_n\in A,\beta_n\in B$ be chosen such that $|\alpha_n-\beta_n|\rightarrow0$ as $n\rightarrow \infty$.  Since A is compact, there exists a convergent subsequence of $\alpha_n\;(n\in\mathbb{N})$, $\alpha_{n_m}\;(m\in\mathbb{N})$, which converges to $\alpha\in A$.  We have   $$|\alpha-\beta_{n_m}|\leq|\alpha-\alpha_{n_m}|+|\alpha_{n_m}-\beta_{n_m}|\rightarrow0 \;\;\;as\;\;m\rightarrow\infty.$$ Hence $\alpha$ is a limit point of B and since B is closed $\alpha\in B$, contradiction.  Is my proof correct? I feel as though I am missing something simple which would trivialize the proof.


Often, when I connect my iPhone 7 to my MacBook Pro 2018 (using a new Apple Store-supplied USB cable), the iPhone prompts "Trust this computer?". I tap "Yes", and then have to enter my six digit pass code on the iPhone.  It's happening more than 50% of the time, probably 60-80% from eyeballing.  i.e. Not every time. It's not 100% repeatable.  But I've just tried disconnecting and reconnecting 10 times and 7 times I got this prompt.  This is beginning to infuriate me.  Is there any step I can take towards diagnosing?  EDIT: It is worth noting that the cable does work. I am able to transfer data between the computer and phone. So it appears the issue is not related to the cable.  EDIT: I've noticed this only occurs when I have hotspot enabled!

(I am on macOS 10.14.6 and iOS 12.4)   I am certain that I have trusted my Mac before. Without the latter trust, I can also access the phone in iTunes.   I have tried reset "Location and Privacy" on my phone. Then   When connecting the iPhone with iTunes running, it asks for the trust and I trust it.  Reboot my Mac and the phone asks for another trust.   Is there some known malware mimics system behavior and steal data from an iPhone?  (I do have installed some pir*ted software recently. That's my fault.)


I have these tables:     |-------------tblSchool -------------|    |               + ID                 |    |               + Name               |    |                                    |    |                                    | tblSchoolYear                        tblTerm  | + SchoolID                        | + SchoolID  | + Name                            | + Name  |                                   |  |                                   |  |---------- tblSchoolTerm ----------|                + SchoolYearID                + TermID                + StartDate                + EndDate   As you can see, I have 2 tables tblSchoolYear and tblTerm that both have SchoolIDs. These 2 tables then makesup a SchoolTerm. My problem is I want the to prevent the combination of tblSchoolYear and tblTerm in tblSchoolTerm withe different SchoolIDs.  For example, if I have 2 schools with IDs 100 and 101, I don't want to have a SchoolYear and Term in SchoolTerm in which SchoolYear has a SchoolID of 100 and the Term a SchoolID of 101.  What I can think of is using a trigger to enforce this, but I wanted to ask if maybe there is a better design to solve this problem without resorting to triggers.  Using SQL Server 2012 by the way.  ADDITIONAL INFO:  For those asking why I can't just have 2 tables, tblSchool and tblSchoolTerm, I have other columns in tblSchoolYear and tblTerm that contains data that I don't wnat duplicated. Sorry, I'll add some sample columns more to make it clearer.

I have the following design. Each user has it's own contacts, it's own hosts and assign those to a domain which belongs only to him.   I want to insure that the host you assign to the domain belongs to the user that domain is assigned to.  Is it something that I have to insure in my application logic?  If I set domains.user_id foreign key to reference host.user_id and user_id.id does it eliminate my issue?    By the way can anyone suggest me a better design for my schema?


I have upgraded my PC to Windows 10, I have a  connected to it, and now every time I click into an editable control or app using my tablet, a very annoying window pops up, related to hand-writing recognition.    How can I disable this thing in Windows 10? I have tried several tutorials that I found online, designed for previous versions of Windows, and in all cases I could not find in Windows 10 some of the options they refer to.

I have Windows 8 (final, MSDN) on my Macbook Pro Retina.  Windows 8's ongoing, continuous tantrum of insisting that it's on a tablet device is causing it to always have a touch keyboard 'icon' on  the taskbar.  The 'icon' is actually a toolbar and I can temporarily disable it by right clicking the taskbar and DE-selecting it. However, upon rebooting the system, it always insists on coming back and activating itself.    How can I permanently disable the touch keyboard toolbar in the taskbar?


I flagged this answer as "not an answer":    For the users who cannot see the content of the linked answer:  "Sorry for the late answer , I've found another way for this . as you said , using DataSource but What I would like to know now , is how to Load in it from SQL Server Database"  Surely this is a comment to the other answer, but my flag was rejected, and I don't know why?  Sure at least one of moderators believes that it's not an answer to the question, because they deleted this answer (). Surely this kind of rejection (which happens sometimes) disappoints users. And a next time someone like me is not going to flag such things (as "not an answer").   Maybe some moderators are accepting and rejecting flags in a bulk manner, but when someone flags as "not an answer", they should read the question and answer carefully, and if they cannot understand they should leave it to other moderators, instead of bulk accepting or rejecting. (This particular answer is very clearly a comment to the other answer and the user couldn't leave a comment  because of low reputation, and provided it as an answer, in this case a moderator checked it in blind manner).  My previous  was about not an answer, answers and moderator rejection, which means this pattern is usual.

I flagged  as Not An Answer and just saw it declined, which I hadn't seen coming. For posterity, here is the answer, which is by the OP of the question:     Sorry for the late answer , I've found another way for this . as you said , using DataSource but What I would like to know now , is how to Load in it from SQL Server Database    I accept that there could be an answer, albeit well-hidden, in there - using DataSource - but it looks more like a comment to the  on the question, where it says:     You then assign this to the GridControl.DataSource property   But even if it is not a comment, then there is still:      but What I would like to know now   As I read it, the only way to make this a real answer would be to edit it to:     : The solution is to use DataSource   Am I wrong here?


by trying to install any application on Ubuntu 16.04  it gives me this message on the terminal  I understand that I made a mistake by stalling python 2.6.8 by mistake  so I try to setup python 2.7.12 but give me the same message  how to solve this problem?   Reading package lists... Done Building dependency tree        Reading state information... Done build-essential is already the newest version (12.1ubuntu2). checkinstall is already the newest version (1.6.2-4ubuntu1). You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies:  playonlinux : Depends: python:any (>= 2.7.5-5~)  python-apt : Depends: python (>= 2.7~) but 2.6.8-1 is to be installed               Depends: python:any (>= 2.7.5-5~)  python-minimal : Breaks: python (<= 2.7.3-1~) but 2.6.8-1 is to be installed  python-pycurl : Depends: python (>= 2.7~) but 2.6.8-1 is to be installed                  Depends: python:any (>= 2.7.5-5~)  python-software-properties : Depends: python (>= 2.7) but 2.6.8-1 is to be installed  python-talloc : Depends: python (>= 2.7~) but 2.6.8-1 is to be installed  python-wxgtk3.0 : Depends: python (>= 2.7~) but 2.6.8-1 is to be installed                    Depends: python:any (>= 2.7.5-5~)  python-wxversion : Depends: python:any (< 2.8)                     Depends: python:any (>= 2.7.5-5~) E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).

running Ubuntu 12.04, I had the usual python 2.7 in place .  I needed python 2.6 , so I downloaded the source and did   ./configure make sudo make install   A mistake, as I did not want to replace my system-wide python .  Now some programs stopped working , e.g. update-manager with   ImportError: No module named gi.repository   I used update-alternatives to make python 2.7 default again, but many python applications still won't start up because of some missing modules .  Can someone give a hint what happened and what the best way to fix it would be?   Thanks in advance.  Edit :   I could get some functionality of apt-get to work by setting my own hard link from /etc/python to /etc/python2.7 . ( So I guess using update-alternatives really did not do much good eithe. ) I did a dist-upgrade , which basically worked, but a lot of the package managing via apt-get is still broken. In particular, a problem with python-minimal prevents many other installations of packages I wanted to do .  Setting up python-minimal (2.7.3-0ubuntu7) ... Traceback (most recent call last):   File "/usr/local/lib/python2.7/runpy.py", line 162, in _run_module_as_main     "__main__", fname, loader, pkg_name)   File "/usr/local/lib/python2.7/runpy.py", line 72, in _run_code     exec code in run_globals   File "/usr/local/lib/python2.7/compileall.py", line 16, in <module>     import struct   File "/usr/local/lib/python2.7/struct.py", line 1, in <module>     from _struct import * ImportError: No module named _struct dpkg: error processing python-minimal (--configure):  subprocess installed post-installation script returned error exit status 255   PS: Building 2.7 from source always did exit (also before dist-ugprade or update-alternatives) with   make: *** [libinstall] Error 1   Currently, on make , there are more issues (" Python build finished, but the necessary bits to build these modules were not found: _bsddb             bsddb185           bz2 dl                 imageop            sunaudiodev To find the necessary bits, look in setup.py in detect_modules() for the module's name. ")   As this is a little over my head , I guess I am just better off with a fresh install from scratch .


Is there a word for someone who is a genius, or intelligent, but ignorant of obvious things, in a none intention sense? A character flaw.  I think of Orwell's "doublethink", according to Wiktionary, the power of holding two contradictory beliefs in one's mind simultaneously, and accepting both of them, but that doesn't quiet do it. It is as if one does not ever discover their own ignorance, which would be required to pressure it!  I'm still searching.

There was the following paragraph in the article that came under the title, “GOP and the rise of Anti-knowledge” written by  (October 29, 2015):     “English unfortunately doesn’t have a precise word for the German   “Fachidiot,” a narrowly specialized person accomplished in his own   field but a blithering idiot outside it. In any case, a surgeon is   basically a skilled auto mechanic who is not bothered by the sight of   blood and palpitating organs. We need the surgeon’s skills on pain of   agonizing death, and reward him commensurately but that does not make   him a Voltaire.”    In Japanese we have a word, 専門バカ, of which literal translation is “specialist idiot” meaning exactly same as defined the above - a narrowly specialized person accomplished in his own field but a blithering idiot outside it.  I’m really curious about the absence of short descriptions of the specialist who knows nothing more than his specialty area in English like German “Fachidiot,” and Japanese "専門バカ."  Isn’t there really any short word counterpart to “Fachidiot,” specialist’s ignorance, for instance, in English?  P.S.  I found "narrow-minded specialisit" as a German-to-English translation of "fachidiot" in the web site, Interglot translation dictionary.


I recently saw a social media post from Libre Office about them phasing out Libre office 6.28 and moving to Libre office 6.3. But when I checked my fully updated 18.04, I see that I am having Libre office 6.0.7. Why my version of Libre Office is so old ? What can I do to get it updated to 6.28 and then automatically to 6.3 when Libre Office pushes it?

Why are packages in the official Ubuntu repositories older than the latest (upstream) versions from Debian Sid, PPAs, the authors, etc.?


I have to add taxonomy by php code. Taxonomy has to got 2 fields. I added new function to test_taxonomy.install, and it seems to work: function taxonomy_update_8805() {      $config_path = 'modules/feature/test_taxonomy/config/update/';     $source = new FileStorage($config_path);      \Drupal::entityManager()->getStorage('taxonomy_vocabulary')         ->create($source->read('taxonomy.vocabulary.regulation'))         ->save(); }  Added new vocabulary to taxonomy. Content of file: langcode: pl status: true dependencies:   module:     - test_remote_vocabulary third_party_settings:   test_remote_vocabulary:     is_remote: 0 name: 'Test' vid: regulation description: 'Test desc' hierarchy: 0 weight: 0    The problematic part is when i try to add fields to the vocabulary. I created 2 files field.storage.taxonomy_term.field_regulation_test.yml langcode: pl status: true dependencies:   module:     - taxonomy     - text id: taxonomy_term.regulation.test field_name: test_field entity_type: taxonomy_term type: text_long settings: {  } module: text locked: false cardinality: 1 translatable: true indexes: {  } persist_with_no_fields: false custom_storage: false  field.field.taxonomy_term.field_regulation_test.yml langcode: pl status: true dependencies:   config:     - field.storage.taxonomy_term.field_regulation_test     - taxonomy.vocabulary.regulation id: taxonomy_term.regulation.test field_name: test_content entity_type: taxonomy_term bundle: regulation label: TEST description: 'Tekst test' required: true translatable: false default_value: {  } default_value_callback: '' settings: {  } field_type: text_long  But i am not sure how can i load them in update_xxx function. EDIT: I tried     \Drupal::entityManager()->getStorage('taxonomy_term')         ->create($source->read('field.storage.taxonomy_term.field_regulation_abo'))         ->save();              \Drupal::entityManager()->getStorage('taxonomy_term')         ->create($source->read('field.field.taxonomy_term.field_regulation_abo'))         ->save();  but i'm getting Missing bundle for entity type taxonomy_term while trying to update module

I created a vocabulary using the following code. $vocab = entity_create('taxonomy_vocabulary', array(   'name' => 'vocab_name',   'vid' => 'vocab_id',   'description' => 'description' )); $vocab->save();  I need to attach a custom field to it. I created the field with BaseFieldDefinition::create('string'), bu I couldn't figure out how to attach the created field to $vocab. How can I achieve it?


I would like to automatically determine the number of clusters for K-means. I have read that elbow method could be used for that.  The thing that confuses me is - I have to rerun algorithm while increasing number of clusters.  How can I know how much does the random initialization influence the decrease of function? Maybe the decrease is greater because of better initialization?  I have tried doing something like this, but I'm getting different number of clusters when I run this multiple times.  Am I missing something, what should I do?  Thanks

We find the cluster centers and assign points to k different cluster bins in  which is a very well known algorithm and is found almost in every machine learning package on the net. But the missing and most important part in my opinion is the choice of a correct k. What is the best value for it? And, what is meant by best?  I use MATLAB for scientific computing where looking at silhouette plots is given as a way to decide on k . However, I would be more interested in Bayesian approaches. Any suggestions are appreciated.


How to connect to sftp server and read the contents of the file using java?I have tried wring the code but I was not able to get the output,I did research a lot of things as to how to connect to sftp server by giving username,host and password.but didnt help

I'm trying to retrieve a file from a server using SFTP (as opposed to FTPS) using Java. How can I do this?


Today I was awarded the Electorate badge on Ask Different:   Vote on 600 questions and 25% or more of total votes are on questions   After doing so I was presented with the screen saying I earned it and to track the next one.  On my profile it isn't there though:    Yet going into the which badge to track screen it says I have been awarded it:    It has been around 10 minutes and still not appearing on my profile or Achievement page.

I've just earned the Electorate badge on , but  doesn't display it. For proof that I've actually earned the badge, here's a screenshot:    Why is the badge not showing up in my profile?


Why is there a difference between named timezone and numeric timezone offset, both of which yield different UTC timestamps for TIMESTAMPTZ?  Assume Europe/Prague timezone, which is currently +02:00 (DST); time of writing is 2018-08-25.  As you can check e.g. :    Also, in my postgres installation I can query it:  SELECT utc_offset FROM pg_timezone_names where name = 'Europe/Prague';   Which also yields 02:00:00.  Then, why on earth, do I get two different UTC timestamps when running following two queries?  The following yields 2018-08-25T20:00:00.000Z (2018-08-25 18:00:00-02):  SET TIME ZONE '+02:00'; -- with or without the plus SELECT '2018-08-25 18:00:00'::TIMESTAMPTZ;   The following yields 2018-08-25T16:00:00.000Z (2018-08-25 18:00:00+02), which is correct:  SET TIME ZONE 'Europe/Prague'; SELECT '2018-08-25 18:00:00'::TIMESTAMPTZ;   Why does postgres differentiate those two notations?

I don't understand the difference between these two columns. America/Chicago timezone is UTC-6, so I expect both to return the same result:  select timezone('America/Chicago', '2017-01-01 12:00:00'::TIMESTAMP AT TIME ZONE 'UTC'),        timezone('UTC-6'          , '2017-01-01 12:00:00'::TIMESTAMP AT TIME ZONE 'UTC');   However, the result is:  2017-01-01 06:00:00 | 2017-01-01 18:00:00   Also, this behavior is highly awkward,  SELECT '1:00 -1'::time with time zone AT TIME ZONE '-1';    timezone    -------------  03:00:00+01   Can anyone explain this?


Let's take Aviation and Stack Overflow for example. Aviation has custom icons for badges while Stack Overflow doesn't. Today I received a badge on Stack Overflow, but if accessing "Recent Achievements" when on Aviation then its custom icon is used even though the site's logo on the left shows the correct logo.  On Stack Overflow:    On Aviation:

It's so cool that the notification reminds you of the colour of badge you've earned. But I am a little puzzled by the symbols:      Is it feasible to use the symbol from the earned site? At the moment it uses the symbol from the site I happen to be on (as you can see by looking to the left of the dropdown in each case.)


I am trying to escape the * character when running this calculator script, but when I run it, it does not output an error, but simply exits the script.  ./calculator 3 * 4 should print Usage-./calculator.sh .... , but instead it just exits. I am not allowed to use \* between the numbers. Tried everything possible according to me but I can't seem to  make it work. Any help would be appreciated.  Also, I'm ssh'ing to my school server from my Macbook, would that be an issue?  #!/bin/bash -f if [ "$#" == "0" ] || [ "$2" == '*' ] then     echo Usage-./calculator.sh value1 operator value2     echo where,     echo value1: numeric value     echo value2: numeric value     echo operator: one of +,-,/,x elif [ "$2" == "+" ] then     echo $(( $1 + $3 )) elif [ "$2" == "-" ] then     echo $(( $1 - $3 )) elif [ "$2" == "x" ] then     echo $(( $1 * $3 ))

For example:  me$ FOO="BAR * BAR" me$ echo $FOO BAR file1 file2 file3 file4 BAR   and using the \ escape character:  me$ FOO="BAR \* BAR" me$ echo $FOO BAR \* BAR   I'm obviously doing something stupid.  How do I get the output BAR * BAR?


Hello I was able to install by adding boot options video=1024X576-24@60 as I know that to be my screens resolution and I was previously getting a black screen.  Now that I went through the install the computer is not able to boot and shows black screen again after booting.  Please help, 14 LTS, hp mini 1030nr  thanks!

I read on  that the netbook edition of Ubuntu was discontinued and that it is now integrated into the main distribution (as of 11.04).  I tried 11.04 on my new Samsung NC110-A06AU with 10.1" 1024x600 display. Most things worked out of the box, but some (like backlight power control) needed some  before they began to co-operate.  One thing that seems to be an ongoing problem is the resolution.  At 1024x600, most of the dialogue boxes run off the bottom of the screen, including the update manager. I have tried 11.10 beta 1 and it has the same problem.  Is there any way to fix this, or at least make it more usable? (I suspect not). Given the recent rise in popularity of netbooks, do you think Ubuntu will include a low-resolution-friendly version in the near future?  How well does KDE deal with these low resolutions? I noticed KDE Plasma has a netbook interface. Is it worth switching for that?


I've been asked to recreate some vector artwork based on an image supplied by my client "from the internet". I told them I cannot copy it exactly but can create something of a similar nature.  "Oh if we just change it 10% it's fine", was the response. Mmmhmm.   I've investigated further and found the image was created by an artist craftsman who does some amazing work, so obviously I'm not prepared to recreate it but what are my options here?  She's hell bent on the supplied design. Do I suggest something completely different?  Do I leave it completely alone?     Any suggestions welcome. Thanks

I know Google image search is not a free-for-all to grab any image needed. However, many, many, many clients don't grasp this concept and often request or send images they'd like to use in a design or product which are clearly a violation of copyrights.   I recently had a client send an image to me which, frankly, seemed too well done and too specific for the client to be sending. My thought was, based on the clients business, it was doubtful they paid someone to create the illustration depicted in the image the sent.  So, I did a little reverse Google image searching and found the original, which actually won an award for illustration a few years ago. I immediately knew the image was a violation of copyrights and threw it away. I expressed the violation to the client only to be met with "Do a Google image search for 'XXX XXX XXX' and you'll see everyone is using it. Please use the image."  When designing a piece and a client requests the use of an image they "found", and it is clear it's a violation of copyrights, what should a designer do?  I realize this is a legal question but... Can the designer include a clause in a contract to protect themselves from liability due to these requests? Is this effective?  In some cases, clients are fully aware that they may be infringing. However, in their words... "The worse that can happen is we get a 'cease and desist' letter. We'll remove it then." My ethics cringe at this. How should this be approached?


I went to see this question:     I was surprised to see that the UI is mixed up. Generally the closed should come first and the deleted would be in the next. In this case, it is the opposite. While it is not even deleted by the OP. It has been closed first.  How is this possible?

On  the delete notice is above, instead of below the close notice. Why is this happening? I understand this was made on purpose, but would like to know the reasoning.


I am a USA citizen and will be flying from Athens, Greece to Munich, Germany with a layover in Munich for only about an hour before my connecting flight to San Francisco, USA.  Both flights will be with Lufthansa.  Will I have sufficient time to make my connecting flight?

I'm heading to India next week and have a connection in Munich, Germany. I made the mistake of booking a flight with only an hour and a half layover (freaking out!) and I'm wondering if I'll have to go through customs in Munich or if I can pass right on through.


In Chapter 7 of Jackson's book on Classical Electrodynamics, there's the following statement:  Introducing the complex orthogonal unit vectors:  $$\epsilon_{\pm}=\frac{1}{\sqrt{2}}(\epsilon_1\pm\epsilon_2)$$  we can represent an EM traveling in the $\epsilon_3$ direction with arbitrary polarization as:  $$\vec{E}(\vec{r},t)=(E_+\epsilon_++E_-\epsilon_-)e^{i(\vec{k}\cdot\vec{r}-\omega t)}$$  If the amplitudes have the ratio,  $$\frac{E_-}{E_+}=re^{i\alpha}$$  then it can be easily shown that the ratio of semimajor to the semiminor axis is:  $$|\frac{1+r}{1-r}|$$  and that the ellipse is rotated by an angle $(\alpha/2)$.   I tried checking this by myself, by starting with the general field $\vec{E}$ expression, passing to the basis with $(\epsilon_1,\epsilon_2)$ and expressing $E_\pm=A_\pm e^{i\beta_\pm}$, However, so far what I've found is that the $\vec{E}$ in such basis can be expressed as (taking the real components):  $$\vec{E_{1,R}}=\frac{1}{\sqrt{2}}[A_+\cos(\beta_++\vec{k}\cdot\vec{r}-\omega t)+A_-\cos(\beta_-+\vec{k}\cdot\vec{r}-\omega t)]$$  $$\vec{E_{2,R}}=\frac{1}{\sqrt{2}}[-A_+\sin(\beta_++\vec{k}\cdot\vec{r}-\omega t)+A_-\sin(\beta_-+\vec{k}\cdot\vec{r}-\omega t)]$$  which shows that we indeed have an ellipse. Nevertheless, since I can't seem to find the ratio and inclination from Jackson, and I couldn't find online a detailed derivation.  Edit: I had already checked the following post () which tried to find something similar in terms of the Jones vectors, where all the answers provided are in terms of finding eigenvalues for the circular and linear polarizations only. However, in my case I want to get an explicit derivation of the formulas provided by Jackson, as not only they avoid using Jones vectors, but I think provide a more geometrical aspect of polarization states (hence why I don't consider it duplicate).

I am analyzing the polarization state of a monochromatic, coherent light source, for which I know the  of the polarization, $$ \mathbf E =\begin{pmatrix}E_x\\E_y\end{pmatrix} =\begin{pmatrix}|E_x|e^{i\varphi_x}\\|E_y|e^{i\varphi_y}\end{pmatrix}, $$ and I would like to expand it in terms of a major and a minor axis of ellipticity, i.e. in the form $$ \mathbf E= e^{i\varphi}\left( A \hat{\mathbf u} + i B\hat{\mathbf v} \right) = e^{i\varphi}\left( A \begin{pmatrix}\cos(\theta)\\ \sin(\theta)\end{pmatrix} + i B \begin{pmatrix}-\sin(\theta)\\ \cos(\theta)\end{pmatrix} \right), $$ or as shown graphically as follows:      Wikipedia provides a multi-step procedure going through the , but I'm thinking there is surely a cleaner and more direct way to get $A$, $B$, $\hat{\mathbf u}$, $\hat{\mathbf v}$, $\theta$, and the components $A \hat{\mathbf u}$ and $B\hat{\mathbf v}$, from $E_x$ and $E_y$, and it's not particularly obvious from the search results I can find. What's the cleanest way to do this?    To be clear: what I think is lacking from the existing resources, and what the question is directly asking for, is an explicit set of connections, as simple as possible, for the named parameters (all of $A$, $B$, $\hat{\mathbf u}$, $\hat{\mathbf v}$, $\theta$, and the components $A \hat{\mathbf u}$ and $B\hat{\mathbf v}$), in terms of the Cartesian components $E_x$ and $E_y$. Schemes that simply send to some other set of complex manipulations are already available from Wikipedia and are not what the question is asking for.


So I've read many answers on the internet and have not yet come to understand the origin of the normal force. What I've to come to understand about the normal force, is that it is the electromagnetic repulsion between the electrons of the two surfaces which come into contact with one another(is this right?) Secondly, I've read about asperities and the formation of cold welds between the asperities I understand the cold welds are due to bonds formed between the atoms in contact at the surface.  So here there are two forces, one is the repulsion and the other is the attraction forming bonds between surfaces. Which one of them is the normal force? How exactly do any of these forces cause friction?  f1 is the force trying to move the body, but f2 is the force trying to restore the body In the picture above, suppose I am trying to move one surface over another. Bonds have already been formed between the two surfaces, so when I try to move the objects relative to one another, the bonds oppose the motion, and try to restore it back to the original position. Do I think of friction this way? Please bear in mind I'm a student still in high school so kindly explain it as if you were explaining it at a fairly non advanced level.

It is a general concept that horizontal forces can only influence physical quantities along horizontal direction; similarly vertical force can produce acceleration etc. only along vertical direction. This is the same concept that helps us study projectile motion as a combination of two independent motions. If this relation is universally true, how come, then friction depend on a force which normal to it?


How can I show that $\sqrt x$ is uniformly continuous on the intervals: $(0,1)$ and $(1,\infty)?$

We are given this function: $f:R^+\rightarrow R,x\rightarrow \sqrt{x}$.  We  need to prove that this function is uniformly continuous. My proof is this one but i'm not sure is it complete and right.  Let pick up $\epsilon>0$  and $\gamma>\epsilon^2$. We need to find $|f(x)-f(y)|<\epsilon$ for all $x,y\in R^+$ with $|x-y|<\gamma$  Without loss of generality we can assume that $x<y$.  We see that $|\sqrt{x}-\sqrt{y}|\leq|\sqrt{x}-\sqrt{y}|\rightarrow|x-y|<\gamma$  $|\sqrt{x}-\sqrt{y}|^2\leq|\sqrt{x}-\sqrt{y}||\sqrt{x}-\sqrt{y}|=|x-y|<\epsilon^2\rightarrow||\sqrt{x}-\sqrt{y}|<\epsilon$  Since $|\sqrt{x}-\sqrt{y}|<\epsilon^2$ This show that $f(x)=\sqrt{x}$ is uniformly continuous on $f:\mathbb R^+\rightarrow \mathbb R$


The Probability of a particular outcome is always zero, but Scipy's norm.pdf() function returns the probability value of a particular event. For example onlinestatbook.com/2/calculators/normal_dist.html in this link, we are not allowed to check the probability of a certain value or certain outcome it allows only range of values. because it's always 0 as per the definition. But why scipy norm.pdf function returns the probability. st.norm.pdf(10,12, 5) = 0.07365402806066466. How come it didn't return 0, did I make any logical error? Could anyone help me?

On the , there is this line:      $p(\mathrm{height}|\mathrm{male}) = 1.5789$ (A probability distribution over 1 is OK. It is the area under the bell curve that is equal to 1.)    How can a value $>1$ be OK? I thought all probability values were expressed in the range $0 \leq p \leq 1$. Furthermore, given that it is possible to have such a value, how is that value obtained in the example shown on the page?


I am using Faker class to create random values in Selenium Webdriver automation. Below is the class for your reference.  public class NewUserFormAction {      Faker faker = new Faker();     public  String name = faker.name().firstName();     public  String Surname = faker.name().lastName();      public static void Execute(WebDriver driver,List<HashMap<String,String>> map) throws Exception{          WebDriverWait wait = new WebDriverWait(driver,10);         wait.until(ExpectedConditions.elementToBeClickable(NewUserFormPage.gender));         NewUserFormPage.gender.click();         NewUserFormPage.customer_firstname.sendKeys(name);         NewUserFormPage.customer_lastname.sendKeys(Surname);      } }   when I am executing this code I am getting exception at compilation at below steps with error can not make static method reference to non static data member.  NewUserFormPage.customer_firstname.sendKeys(name); NewUserFormPage.customer_lastname.sendKeys(Surname);   Here I understand the faker instance is create on public class which is non static and it is being called in Execute method which is static. Can you please help me how to solve this issue ?

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


I am using ieee.cls and its LaTeX template but I see a problem right away in the citation: I use \cite{ref1,ref2} in my text, and  I expect to get the following output: [1,2].  But I get  this [1], [2].   Please explain why is this happening.

I have been trying to display the in-text citations in the following format:  [1-3], or [1, 6-8]  which looks like it is the default one inside the cite package, but what I get is:  [1]-[3]  Specifically, I'm using the IEEEtran template (bare_jrnl to be more precise) and the bibliography is built in the following way:  \bibliographystyle{IEEEtran} \bibliography{IEEEabrv,mybib}   The cite package is obviously loaded. I have looked the documentation of both IEEEtran and cite, but I have not been able to find a solution.


I have the following lambdas generated by reflection and need to know how to condense these into a single expression:  Current:  {((txliferequest.OLifE.Party.Any(party => party.Address.Any(address => address.Line1.Contains("Address 1"))) AndAlso     txliferequest.OLifE.Party.Any(party => party.Address.Any(address => address.Line2.Contains("Address 2")))) AndAlso     txliferequest.OLifE.Party.Any(party => party.Address.Any(address => address.City.Contains("City"))))}   Needed:     {((txliferequest.OLifE.Party.Any(party => party.Address.Any(address => {         address.Line1.Contains("Address 1") AndAlso         address.Line2.Contains("Address 2") AndAlso         address.City.Contains("City")         })     )}   Is there a way to do this using the Expression API?  It says the final expression is not able to be reduced.

I have two expressions of type Expression<Func<T, bool>> and I want to take to OR, AND or NOT of these and get a new expression of the same type  Expression<Func<T, bool>> expr1; Expression<Func<T, bool>> expr2;  ...  //how to do this (the code below will obviously not work) Expression<Func<T, bool>> andExpression = expr AND expr2


I have to find out which Linux distribution is running on a server. From uname -a I have the following output:  $ uname -a Linux lvmfacelifttap2b 3.10.0-514.6.1.el7.x86_64 #1 SMP SUn Dec 11 12:25:18 EST 2016 x86_64 x86_64 x86_64 GNU/Linux   I've tried googling but I couldn't find a match. Any help how to find out the distribution ? Thanks

Say I am logged into a remote system, how can I know what it's running? On most modern Linuxes (Linuces?), you have the lsb_release command:  $ lsb_release -ic     Distributor ID: LinuxMint Codename:       debian   Which as far as I can tell just gives the same info as /etc/lsb-release. What if that file is not present? I seem to recall that the lsb_release command is relatively new so what if I have to get the OS of an older system?  In any case, lsb stands for Linux Standard Base so I am assuming it won't work on non-Linux Unices. As far as I know, there is no way of getting this information from uname so how can I get this on systems that do not use lsb_release?


If I have a basic program to compare a null string, why does the location of the null string potentially blow up and give a NullPointerException?  The first 3 prints will print, false, null: null, and then null... but the last one, which should be just like the first print statement, throws an exception.  Why is this?  String teststring = null;  System.out.println("".equals(teststring)); System.out.println("null: "+null); System.out.println(teststring); System.out.println(teststring.equals(""));

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 need to display a YesNo messagebox, in case of a server side code execution failure. As far as I can tell, you can't show a messagebox from the server side. Is a walk around of sorts, where I fire a hidden button's OnClientClick Event programmatically in order to display a messagebox is possible? If so, how do I trigger it? If not, Is there any other way to display a YesNo messagebox from the server side?  As far as I can tell, unless I misunderstood, the solutions I was given or was refered to, handled cases where client side script fires the second button's event, but that's not what I'm looking for. I need the server side script to trigger the client side script/event.

I'd like to make a click event fire on an <input type="file"> tag programmatically.  Just calling click() doesn't seem to do anything or at least it doesn't pop up a file selection dialog.  I've been experimenting with capturing events using listeners and redirecting the event, but I haven't been able to get that to actually perform the event like someone clicked on it.


I am working with printing in WPF. I implement a class which inherit from DocumentPaginator class  public class ReportPaginator : DocumentPaginator {     private double pageUpperLimit;      private double pageDownLimit;      private Model.Report printedReport;      private int pageCount;      public override IDocumentPaginatorSource Source     {         get         {             return null;         }     }      public override bool IsPageCountValid     {         get { return true; }     }      public override int PageCount     {         get { return pageCount; }     }      public override Size PageSize     {         get         {             return new Size(printedReport.PageSize.Width, printedReport.PageSize.Height);         }         set         {             // validate the value.             if (value != null)             {                 throw new ArgumentException("page size can not be null");             }              // TODO: here we have to validate if the page is A3, A4, A5. this is to set the SizeName.             // if you did not set the sizeName here we will get an exception.             printedReport.PageSize = new Model.PageSize { Height = value.Height, Width = value.Width };             CalculatesPage();             // if we have to set the PageSize (I do not think so), do not forget to call the PaginateData method.         }     }      public ReportPaginator( Model.Report report)     {         printedReport = report;         CalculatesPage();     }      public override DocumentPage GetPage(int pageNumber)     {         // validate the argument.         if (pageNumber < 0)         {             throw new ArgumentException("pageNumber parameter could not be negative number", "pageNumber");         }          // if the argument is outside of the available pages, return          if (pageNumber > pageCount - 1)         {             return DocumentPage.Missing;         }          // specify the start pixel and end pixel of the page according to the height of the report.         pageUpperLimit = pageNumber * PageSize.Height;         pageDownLimit = (pageNumber + 1) * PageSize.Height;          // create DrawingVisual for this DocumentPage         DrawingVisual visual = new DrawingVisual();          // get the DrawingContext for this DrawingVisual for this page.         using (DrawingContext pageContext = visual.RenderOpen())         {             // drawing operations for elements and sections go here.              // we will use the for loop instead of the foreach loop to enumerate the sections             // because we will need the know in which section we draw.             for (int sectionIndex = 0; sectionIndex < printedReport.Sections.Count; sectionIndex++)             {                 PrintSection(pageContext, sectionIndex);                  foreach (Model.BaseReportControl control in printedReport.Sections[sectionIndex].Controls)                 {                     PrintControl(pageContext, sectionIndex, control);                 }             }         }  // close the DrawingContext.          return new DocumentPage(visual);     } }   there is more helper methods to do the jobs.  I want to create FixedDocument object to return it from the Source property using DocumentPage object that returned from GetPage Method.  I need a FixedDocument to be returned from the source Property Because I want to make a preview to the File before printing  ReportPreviewerWindow window = new ReportPreviewerWindow(); window.previewer.Document = new ReportPaginator(printedSurface.ModelReport).Source; window.ShowDialog();   the previewer is DocumentViewer Object exists in the ReportPreviewerWindow  <Window x:Class="TanmiaGrp.Report.Designer.ReportPreviewerWindow"     xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation"     xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"     Title="Report Previewer" >    <Grid>       <DocumentViewer x:Name="previewer"/>    </Grid> </Window>

I'm using a class I've derived from DocumentPaginator (see below) to print simple (text only) reports from a WPF application. I've got it so that everything prints correctly, But how do I get it to do a print preview before printing? I have a feeling I need to use a DocumentViewer but I can't figure out how.  Here's my Paginator Class:  public class RowPaginator : DocumentPaginator {     private int rows;     private Size pageSize;     private int rowsPerPage;      public RowPaginator(int rows)     {         this.rows = rows;     }      public override DocumentPage GetPage(int pageNumber)     {         int currentRow = rowsPerPage * pageNumber;         int rowsToPrint = Math.Min(rowsPerPage, rows - (rowsPerPage * pageNumber - 1));         var page = new PageElementRenderer(pageNumber + 1, PageCount, currentRow, rowsToPrint)                        {                            Width = PageSize.Width,                            Height = PageSize.Height                        };         page.Measure(PageSize);         page.Arrange(new Rect(new Point(0, 0), PageSize));         return new DocumentPage(page);     }      public override bool IsPageCountValid { get { return true; } }      public override int PageCount { get { return (int)Math.Ceiling(this.rows / (double)this.rowsPerPage); } }      public override Size PageSize     {         get { return this.pageSize; }         set         {             this.pageSize = value;             this.rowsPerPage = PageElementRenderer.RowsPerPage(this.pageSize.Height);             if (rowsPerPage <= 0)                 throw new InvalidOperationException("Page can't fit any rows!");         }     }      public override IDocumentPaginatorSource Source { get { return null; } } }   The PageElementRenderer is just a simple UserControl that displays the data (at the moment just a list of rows).  Here's how I use my Row Paginator  PrintDialog dialog = new PrintDialog(); if (dialog.ShowDialog() == true) {     var paginator = new RowPaginator(rowsToPrint) { PageSize = new Size(dialog.PrintableAreaWidth, dialog.PrintableAreaHeight) };      dialog.PrintDocument(paginator, "Rows Document"); }   Sorry for the code dump, but I didn't want to miss something relevant.


I often find myself manually changing cells in a Google sheet to be a particular color. Is it possible to create a keyboard shortcut for changing the color of a cell?

This question specifically applies to Google Documents, not Google Spreadsheets (but if the answer applies to both, all the better).  Google Documents has built-in . I would like to define my own key binding or shortcut so that I can run a user-defined script on the document directly without using the mouse. For scripts that I want to run often, having a key binding or shortcut I can press saves me wasted motion from having to use the mouse to pull down a menu and run the script.  I have scoured the  and found no mention of allowing this level of customization.    Do I conclude that Google did not include this feature?  I have not investigated possibilities of using Firefox-specific extensions but that would be my next approach (e.g., ).  Note that this is not the same question as asked in  .


My posts have meta keys _vote_user . user_id() and value of (int) 1, 2 or 3.   I would like to return all posts with a meta KEY containing the string '_vote_user', i.e.: return all posts with meta vote for the current round but by any user.  $meta_query = [     [         'key'       => '_vote_user_',         'value'     => $atts['round'],         'compare'   => 'LIKE'     ] ];   As I understand it though, with the above code I'm querying the value for a LIKE value, not the key. How can I query the key? Maybe this illustrates better what I'm trying to achieve:  $meta_query = [     [         'key'       => '_vote_user_%', // where '%' is any integer         'value'     => $atts['round'],         'compare'   => 'EXISTS'     ] ];   EDIT  What if I were to first identify the IDs of the judges and query just those possible keys? So if my judges IDs were 2, 3 and 5 would the only way to query that be:   $meta_query = [          'relation' => 'OR',              [             'key'       => '_vote_user_2',             'value'     => $atts['round'],         ],[             'key'       => '_vote_user_3',             'value'     => $atts['round'],         ],[             'key'       => '_vote_user_5',             'value'     => $atts['round'],         ]     ];   It doesn't seem to be possible to submit an array of keys like you can for values.

I have a function that stores the "like" status for a post as post meta. I want to associate that "like" with the user that liked it, so I setup a custom field called "like_status_{user_id}" (where {user_id} is the id of the currently logged in user) which I store as a 0 or 1. So for a post with several "likes" there would be several meta values in the db that are setup like this:  'meta_key' = 'like_status_0' 'meta_value' = 1 'meta_key' = 'like_status_2' 'meta_value' = 1 'meta_key' = 'like_status_34' 'meta_value' = 1   ....and so on.  There are potentially thousands of likes on a specific post. How would I run a query that showed if someone else also liked that post?  I was thinking something like this:  $query = new WP_Query(array(     'meta_key' => 'like_status_{user_id}',     'meta_value' => 1, ));   I'm trying to push a notification to everyone who has liked a post when someone else likes that post...something like, "Hey, someone else liked that post you liked. You should go check it out!" But I need a way to find out if anyone else has liked that post and if so, who they would be so I could notify them.  If it's not possible, could you suggest a better way of storing this data as post_meta while still keeping the efficiency of quickly updating a single user's like status on a post?


I have an old Steam account with a really old email address. Steam wants to send me an account verification code due to my PC being replaced and upgraded since I created the account. My PC changes have also made my old Outlook email inaccessible. Outlook needs to know the emails I sent and what content they contained, but I never sent any emails via that email address. Thus, I cannot recover my old account. I tried clicking the Settings option on my Steam browser, but nothing happened. Is there any possible way I could access my old Steam account and regain access to the games I have?

I am unable to log into my Steam account as I do not have access to my email account for the Steam Guard verification process.   I have raised a ticket but have not received a reply from Steam Support yet, and it has been over two days so far.  I am really desperate because I just put $20 on there and that's really rare for me. There is no way to activate my email account which the verification code has been sent.   What can I do to resolve this issue and regain access to my Steam account?


Context : find a counter example to the statement $$∀x∈C(∃y∈C(y∈A)⇒¬(x∈B))$$    Suppose I know that there is some x such that : x belongs to set C but NOT to set B.   Am I allowed to derive from this that :   for all y (y does not belong to C OR y does not belong to A OR x does not belong to B)  It seems to me that " x does not belong to B" being true, that makes the whole disjunction true for any variable ( even if I have no information on this variable coming from elsewhere).   Is there an official rule that makes this derivation legal in predicate logic natural deduction?

This is an excerpt from Discrete Mathematics.     Universal generalization is the rule of inference that states that ∀xP(x) is true, given the premise that P(c) is true for all elements c in the domain. Universal generalization is used when we show that ∀xP(x) is true by taking an arbitrary element c from the domain and showing that P(c) is true. The element c that we select must be an arbitrary, and not a specific, element of the domain.       That is, when we assert from ∀xP(x) the existence of an element c in   the domain, we have no control over c and cannot make any other   assumptions about c other than it comes from the domain. Universal   generalization is used implicitly in many proofs in mathematics and is   seldom mentioned explicitly. However, the error of adding unwarranted   assumptions about the arbitrary element c when universal   generalization is used is all too common in incorrect reasoning.   I have two questions:  1. What is meant by the second paragraph ?  2. How come just by taking arbitrary c in domain, we can conclude that if P(c) is true then so is ∀xP(x). (There may exist some counterexamples).


I have read that given a smooth even dimensional manifold $M$ with an almost complex structure $J$, then $M$ is orientable and there is a canonical choice of orientation.  Why is this the case? How does one construct the orientation?  Thanks!

I want to verify the fact that      every almost complex manifold is orientable.    By definition, an almost complex manifold is an even-dimensional smooth manifold $M^{2n}$ with a complex structure, i.e., a bundle isomorphism $J\colon TM\to TM$ such that $J^2=-I$, where $I$ is the identity.  For every tangent space $T_pM$, there exists tangent vectors $v_1,\cdots, v_n$ such that $(v_1,\cdots, v_n,Jv_1,\cdots,Jv_n)$ is a real ordered basis for $T_pM$. I've checked that any two such bases are related by a matrix with positive determinant.  So for each tangent space $T_pM$ I fix such a basis. Hence, I've obtained a possibly discontinuous global frame $X_1,\cdots,X_n,JX_1,\cdots,JX_n$. To show this frame determine an orientation on $M$, I've been trying to construct for each $p\in M$ a coordinate neighborhood $(U,x^1,\cdots,x^{2n})$ such that  $$(dx^1\wedge\cdots dx^{2n})(X_1,\cdots,X_n,JX_1,\cdots JX_n)>0$$ for every point in $U$.  How do I show that? Thanks!


A. "The BMW is better than the Ford because with the BMW you get 'German quality' engineering."  B. "Chocolate is more delicious than celery because it is tastier."  In the former, the premise takes for granted that German engineering is better than non-German engineering.  In the latter a synonym of the conclusion has been straightforwardly included as a premise.  I get that the latter one assumes the thing that's being argued for, but the former one seems to assume not the thing it's arguing for but rather something that itself requires evidence (i.e. that German engineering is better than non-German engineering). Only the latter fits with my preconception about begging the question, but the former is adapted from an authoritative source.   I adapted the former quote from Pinker (2014), which on p270 gives as an example of begging the question:     "When I asked the dealer why I should pay more for the German car, he   said I would be getting 'German quality,' but that just begs the   question."   Pinker, S. (2014). The Sense of Style: The Thinking Person's Guide to Writing in the 21st Century. Penguin.

What does the phrase "begging the question" really mean? And does it even matter if I use it correctly? Almost everyone just uses it as a synonym for "posing the question" these days.


I'm travelling from Saudi Arabia to London through Amsterdam. Do I need a visa for a 2-hour layover in the Amsterdam airport?  Do I need a Schengen visa?  I travelled to USA many times through Amsterdam airport and never needed to get a visa, but things may have changed.

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


I've , which throws a ConcurrentModificationException  ArrayList<String> list = new ArrayList<String>(Arrays.asList("a", "b", "c", "d"));  for (String s : list) {     if (s.equals("a"))         list.remove(s); }   If you add an Iterator and use a while-loop, the code works fine:  ArrayList<String> list = new ArrayList<String>(Arrays.asList("a", "b", "c", "d")); Iterator<String> iter = list.iterator(); while (iter.hasNext()) {     String s = iter.next();      if (s.equals("a")) {         iter.remove();     } }   I dont understand, why it is necessary, to use Iterator<String> in this case.  Is it because of the ArrayList not having some sort of ability to get iterated, altough it is a ?  Is it necessary to use the while-loop, or could you produce a version with a for-loop?

We all know you can't do the following because of ConcurrentModificationException:  for (Object i : l) {     if (condition(i)) {         l.remove(i);     } }   But this apparently works sometimes, but not always. Here's some specific code:  public static void main(String[] args) {     Collection<Integer> l = new ArrayList<>();      for (int i = 0; i < 10; ++i) {         l.add(4);         l.add(5);         l.add(6);     }      for (int i : l) {         if (i == 5) {             l.remove(i);         }     }      System.out.println(l); }   This, of course, results in:  Exception in thread "main" java.util.ConcurrentModificationException   Even though multiple threads aren't doing it. Anyway.  What's the best solution to this problem? How can I remove an item from the collection in a loop without throwing this exception?  I'm also using an arbitrary Collection here, not necessarily an ArrayList, so you can't rely on get.


I have an http module on a sharepoint site and this module instantiates a custom class and add it to the session and does other initial things for my site. However, I'm noticing that the http module is being called for all request types (.aspx, .js, .png, .jpg).  Is there any way to have an http module only be called for .net specific page types?

Is there a good way to exclude certain pages from using a HTTP module?  I have an application that uses a custom HTTP module to validate a session. The HTTPModule is set up like this in web config:  <system.web>   <!-- ... -->   <httpModules>     <add name="SessionValidationModule"        type="SessionValidationModule, SomeNamespace" />   </httpModules> </system.web>   To exclude the module from the page, I tried doing this (without success):  <location path="ToBeExcluded">   <system.web>     <!-- ... -->     <httpModules>       <remove name="SessionValidationModule" />     </httpModules>   </system.web> </location>   Any thoughts?


Let $f:\mathbb R \to \mathbb R$ be a function such that $ f(x +f(y) + yf(x)) = y +f(x) + xf(y) ,\forall x,y \in \mathbb R$ , then is it true that $f(x)=x,\forall x \in \mathbb R$ ? If not true in general , then what if we also assume $f$ is bijective , or say continuous ?   Over $\mathbb C$ , $f(z)=\bar z$ is a bijective continuous , non-identity solution . Over $\mathbb R$ I can show that under the further assumption $\{f(x)/x : x\ne 0\}$ is countable, we must have $f$ is identity . With only the given functional equation , I can show that if $f(x_0)=0$ for some $x_0 $  then $x_0=0$ , and then $f(f(x))=x,\forall x \in \mathbb R$ i.e. $f$ is bijective . But I can't figure out anything else   Please help . Thanks in advance

find  all functions $f:\Bbb R\to \Bbb R$ and such for any $x,y\in\Bbb R$,and such $$f(x+f(y)+yf(x))=y+f(x)+xf(y)$$     I have proven that $$f(f(x))=x$$   proof:Let $y=0$,we have $$f(x+f(0))=f(x)+xf(0)$$ let $x=0,y\to x$,we have $$f(f(x)+xf(0))=x+f(0)$$ so we have $$f(f(x+f(0))=x+f(0)$$ then $$f(f(x))=x$$  and $f(x)=x$ is one solution but I can't argue this to be the only solution. It doesn't seem easy.Thank for you help!