body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
Is there an easy way to let a specific command (only terminable through Ctrl-C) run for 5 minutes automatically? For example: minute-command 5-minutes ping www.google.com or any other command that does not terminate itself. I'd like to be able to specify a time limit, not only 5 minutes.
|
I want to limit the time a grep process command is allowed to run or be alive. For example. I want to perform the following: grep -qsRw -m1 "parameter" /var But before running the grep command I want to limit how long the grep process is to live, say no longer than 30 seconds. How do I do this? And if it can, how do I return or reset to have no time limit afterwards.
|
I have already proved $ x < y => x^n < y^n $ I am currently trying to prove the converse statement, but I am getting nowhere. The textbook suggests trying to set up a contradiction, but I can't seem to succeed with this.
|
Here, we suppose that $x,y\in\mathbb{R}$ and that $x^n=y^n$, where $n$ is odd. I want to prove that $x=y$. Maybe we can use that $x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+...+xy^{n-2}+y^{n-1})$ So, it suffices to show that if $x^n=y^n$ then $x^{n-1}+x^{n-2}y+...+xy^{n-2}+y^{n-1}\neq 0$ Any hint?
|
Suppose xand y are real numbers and that $x^2 +9y^2 -4x +6y+4=0$ then we have to find the maximum vale of 4x-9y I found that the equation given is that of ellipse . I can consider a line $4x-9y=0$ which cut the ellipe . bt by doing this its getting very comlicated .
|
Let $x$ and $y$ be real numbers such that $x^2 + 9 y^2-4 x+6 y+4=0$. Find the maximum value of $\displaystyle \frac{4x-9y}{2}$. My solution: the given function represents an ellipse. Rewriting it, we get $\displaystyle (x-2)^2 + 9(y+\frac{1}{3})^2=1$. To find the maximum of $\displaystyle \frac{4x-9y}{2}$, $x$ should be at its maximum and $y$ at its minimum. Solving the equations, I get that $x = 3$ and $\displaystyle y = -\frac{2}{3}$, but the answer i get is wrong. What am I doing wrong?
|
I want to create oval buffers 450 by 350 m tilted by 45° using the v.buffer-tool from the GUI. When I enter everything necessary and click run, in return I get the following error message (same pops up for other Grass-algorithms): 2019-01-29T11:56:21 CRITICAL Traceback (most recent call last): File "C:/PROGRA~1/QGIS3~1.4/apps/qgis/./python/plugins\processing\algs\grass7\Grass7Algorithm.py", line 415, in processAlgorithm Grass7Utils.executeGrass(self.commands, feedback, self.outputCommands) File "C:/PROGRA~1/QGIS3~1.4/apps/qgis/./python/plugins\processing\algs\grass7\Grass7Utils.py", line 372, in executeGrass for line in iter(proc.stdout.readline, ''): File "C:\PROGRA~1\QGIS3~1.4\apps\Python37\lib\codecs.py", line 322, in decode (result, consumed) = self._buffer_decode(data, self.errors, final) UnicodeDecodeError: 'utf-8' codec can't decode byte 0xf6 in position 81: invalid start byte A possible reason could be the following warning I get upon startup of QGis (it doesn't pop up, but it is written in the protocol): 2019-01-29T11:43:18 WARNING Konnte C:/PROGRA~1/QGIS3~1.4/apps/qgis/plugins/grassplugin7.dll nicht laden (Grund: Die Bibliothek C:\PROGRA~1\QGIS3~1.4\apps\qgis\plugins\grassplugin7.dll kann nicht geladen werden: Das angegebene Modul wurde nicht gefunden.) 2019-01-29T11:43:18 WARNING Konnte C:/PROGRA~1/QGIS3~1.4/apps/qgis/plugins/grassprovider7.dll nicht laden (Grund: Die Bibliothek C:\PROGRA~1\QGIS3~1.4\apps\qgis\plugins\grassprovider7.dll kann nicht geladen werden: Das angegebene Modul wurde nicht gefunden.) 2019-01-29T11:43:18 WARNING Konnte C:/PROGRA~1/QGIS3~1.4/apps/qgis/plugins/grassrasterprovider7.dll nicht laden (Grund: Die Bibliothek C:\PROGRA~1\QGIS3~1.4\apps\qgis\plugins\grassrasterprovider7.dll kann nicht geladen werden: Das angegebene Modul wurde nicht gefunden.) Basically it says "GRASS wasn't installed". So, how do I solve this? Just reinstall QGis?
|
I try running the v.clean tool using QGIS 3.4. As input I use a vector line layer (I checked the validity and everything is fine), but running the algorithm I get the following error: Traceback (most recent call last): File "D:/Programme/OSGeo4W/apps/qgis/./python/plugins\processing\algs\grass7\Grass7Algorithm.py", line 415, in processAlgorithm Grass7Utils.executeGrass(self.commands, feedback, self.outputCommands) File "D:/Programme/OSGeo4W/apps/qgis/./python/plugins\processing\algs\grass7\Grass7Utils.py", line 372, in executeGrass for line in iter(proc.stdout.readline, ''): File "D:\Programme\OSGeo4W\apps\Python37\lib\codecs.py", line 322, in decode (result, consumed) = self._buffer_decode(data, self.errors, final) UnicodeDecodeError: 'utf-8' codec can't decode byte 0xf6 in position 81: invalid start byte Execution failed after 0.50 seconds Since it is says it is a decoding error I checked the encoding and it is encoded in UTF-8. Does anybody know how to solve the error?
|
I'm reading David R. Finston and Patrick J. Morandi's book and in section 7.2 page 109 it mentions It’s true that every finite field has a primitive element. However, the proof of this fact involves more complicated ideas that we will consider, so we do not give the proof. I understand some proof might be hard, based on more complex concepts, but leaving this dangling it’s a bit itchy .. May I ask where can I find a relative simple proof?
|
Why is the multiplicative group $(K\smallsetminus\{0\},\cdot)$ of a finite field $(K,+,\cdot)$ always cyclic?
|
union test { int x; char arr[4]; int y; }; #include<stdio.h> int main() { union test t; t.x = 0; t.arr[1] = 'G'; printf("%s", t.arr); return 0; } Predict the output of the above program. Assume that the size of an integer is 4 bytes and size of a character is 1 byte. Why shouldn't the answer be Garbage character followed by 'G', followed by more garbage characters?
|
Is there any good example to give the difference between a struct and a union? Basically I know that struct uses all the memory of its member and union uses the largest members memory space. Is there any other OS level difference?
|
var bark = function() { var animals = "Dogs"; var sound = "Bark" console.log(animals + " go " + sound); }; console.log(animals); console.log(sound); When I log the variables to console, no cigar... ReferenceError: animals is not defined ReferenceError: sound is not defined
|
What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?
|
There's a lot of good advice around about avoiding connecting to unsecured wireless networks, and using a VPN (for all traffic) if you absolutely must use one. What seems to be missing from this advice is the gap between when you connect to the unsecured wireless, and when you've got your VPN connection up and running. This can be a pretty short period, but a lot of software will detect the new network (via some OS event, I guess) and immediately start attempting to reload/reconnect/etc. So the very first thing that happens is various login details and connections occur before you have time to connect to the VPN (since this requires the unsecured wireless first). Likewise, if the VPN connection goes down for some reason, the default route will return to the unsecured wireless. So is there any way to avoid this unsafe gap? For example, blocking all data that's not going to the VPN server by default. I'm hoping for a built-in solution rather than 3rd party firewall software, but keen to hear about any options that truly close this gap in security.
|
As most experienced users will have heard, using a Mac in a public untrusted Wi-Fi can be potentially harmful. A tool like Firesheep has made it very easy to intercept unencrypted communication. Using a full tunnel VPN to encrypt all communication is as often mentioned as a magical solution to eavesdropping, but of course it's not that easy: Depending on the protocol and configuration of the VPN connection, the connection may drop easier. (e.g. TLS vs UDP) The VPN connection is not established instantly when you connect to a public network. I think that the last two points matter a lot because whenever your network settings change the various applications immediately talk to their servers - I assume it's configd that informs them, right? i.e. Before the VPN tunnel is established, most (running) processes that require internet will communicate. I see two components to being a good VPN user: Making sure things don't get sent in the clear before it's established. . How can I use VPN on a Mac in a public network to restrict unencrypted traffic before the VPN starts up?
|
I want to call a function ONLY when the file name ends with .request but somehow it calls the function if request is sub-string. I the imported parts, on the right it's the output for file in ${filesOrDir[*]}; do if [[ -f "$file" ]]; then if [[ "$file"=*[".request"] ]]; then # Enters here when .request is a substring. fi fi if [[ -d "$file" ]]; then # ... some logics fi done
|
I am writing a nightly build script in bash. Everything is fine and dandy except for one little snag: #!/bin/bash for file in "$PATH_TO_SOMEWHERE"; do if [ -d $file ] then # do something directory-ish else if [ "$file" == "*.txt" ] # this is the snag then # do something txt-ish fi fi done; My problem is determining the file extension and then acting accordingly. I know the issue is in the if-statement, testing for a txt file. How can I determine if a file has a .txt suffix?
|
This is the son of Godzilla () as seen in the 1967 movie . So, Godzilla’s son is “born” after hatching from an egg a trio of giant praying mantises dig up on . Godzilla takes on the role of father to this kid, but it’s not clear who the mother of this bundle of joy is or how the egg ended up on the island to begin with. Is there any canonical reference in the Godzilla universe that clearly states who the mother of Minya/Minilla is? FWIW, the film was never officially released in theaters in outside of Japan until streaming services started to carry the original Japanese film with translated subtitles.
|
Godzilla is always referred to as male and referenced with "he" or "him." Do we know, for sure, if Godzilla is a male? Has beast gender ever been a factor within any kaiju movies?
|
I have this code: int[][] stuGrades = {{97, 64, 75, 100, 21}}; //extract from data file String[][] HWdata; // original data file for (int g = 0; g < stuGrades.length; g++) { for (int p = 0; p < stuGrades[0].length; p++) { int tempScores = stuGrades[g][p]; if (tempScores <= 100 && tempScores > 98.1) { stuGpa[g][p] = 4.0; } else if (tempScores <= 98 && tempScores > 96.1) { stuGpa[g][p] = 3.9; } } } My goal is to convert the grades array {97, 64, 75, 100, 21} to a new GPA array, which will convert the score to 4.0, 3.9 or something else. I got this error: Exception in thread "main" java.lang.NullPointerException at homework7.main. How can I resolve this issue?
|
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?
|
The Synaptic Package Manager shows an error message whose details contain: E: gnome-control-center-data: package is in a very bad inconsistent state; you should reinstall it before attempting configuration E: gnome-control-center: dependency problems - leaving unconfigured Please explain what happen in my Ubuntu and how to fix that, thank you
|
I can't update my system because it freezes while installing a third-party update (zramswap-enabler)! Sometimes I get the following message in Update manager: Could not initialize the package information An unresolvable problem occurred while initializing the package information. Please report this bug against the 'update-manager' package and include the following error message: E:The package zramswap-enabler needs to be reinstalled, but I can't find an archive for it. I tried to remove the zramswap-enabler, but it's impossible because I get the following message: dpkg: error processing zramswap-enabler (--remove): Package is in a very bad inconsistent state - you should reinstall it before attempting a removal. Errors were encountered while processing: zramswap-enabler E: Sub-process /usr/bin/dpkg returned an error code (1) Actually I would really reinstall that package, but it is unable to do it! If I remove this third-party PPA then the system is warning me about a very very serious problem. So why can I not install/reinstall/remove/update this package and why freezes the updater if I try to update?
|
I got a secret hat "Chameleon hat". I wonder what it is for. I am confused between two possibilities: Multiple Stack accounts Change in Display picture What is it for exactly?
|
So far, I've unlocked one of the secret hats. I'm wondering what other secret hats are out there and how to earn them?
|
In the line I have commented below, does the value of the array that has "element" as a value get overridden by array? let c = [1, 2]; console.log(`c = ${c}`); add(c, 3); console.log(`c = ${c}`); function add(array, element) { array = [element]; // Is this Array that has "element" as a value overridden by array }
|
The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself). Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?
|
Sequence: select site in drawer, select "tags", select one tag, select question. So I read question. Than I press Back. I'm expecting return to messages list, but I get list of tags. App Version: 1.0.89 Device Manufacturer: LGE Device Model: Nexus 5X OS Version: 7.1.1 (3425388)
|
This looks a little bit like a variation on but specific to the tags view. Reproduction (app version 1.0.71): Select any site (say Meta) from the sidebar Switch to the tags view using the top bar Choose a tag, any tag ( is nice) optionaly refine your search with more terms Go to any question found, go back you end on the unfiltered tags view Go back again lucky you, your search is here
|
I've downloaded an installation package of weblogic server and in the README, there's this command to execute: Linux/Mac $ . ./configure.sh It's not the first time I see this. Why is there an extra dot at the start of the command? When I do only ./configure.sh, the result is the same
|
What's the difference between executing a script like this: ./test.sh and executing a script like this: . test.sh? I tried a simple, two-line script to see if I could find if there was a difference: #!/bin/bash ls But both . test.sh and ./test.sh returned the same information.
|
my visa B2 is valid until 2022 but is on an expired passport, which I still have, so I would like to know if I can entry in usa without problems and stay longer than 90 days? Will i have to apply for an esta? thanks
|
I have a valid B1/B2 US visa expiring about a year from now. The passport it's in expired a few years ago, and I recently got a new one. The passport number does not match, but the national ID number, mentioned in both, does (it used to be the same as your national ID, but not anymore) Can I travel to the US carrying both passports? Or is it asking for trouble? (I read a few years ago that it was possible, but that might have changed) Should I just get a new visa to avoid potential complications?
|
One of the primary advices I've been reading about SEO is to put out great content. But how exactly does Google measure that? What specific metrics does it use? I understand how it identifies bad content (poor spelling, bad grammar, poorly structured article, keyword spamming, etc.). But I have yet to find a clear criteria for how Google determines great content.
|
What are the best ways to improve a site's position in the Google search results?
|
Let $ (X,d)$ be a metric space and $A \subset X$. How can I show that $(A^\circ)^\circ = A^\circ $? $A^\circ$ denotes the set of all interior points of $A$. I know that $x \in A$ is interior if there exists an $ r>0$ such that $B_r(x) \subset A$ . So i think to try to prove that $(A ^\circ)^\circ \subset A^\circ$ and $A^\circ \subset (A^\circ)^\circ$ , but I cannot think how to start.
|
Say we want to show that the interior of a set $A$ is open. If $x \in Int(A)$, then there exists an open ball $B_r(x) \subseteq A$. Since $B_r(x)$ is open, $y \in B_r(x)$ also has an open ball $B_s(y) \subseteq B_r(x) \subseteq A$, so $y \in Int(A)$. Now, somehow we have to show that the ball $B_r(x) \subseteq Int(A)$, and that would complete the proof. All of the proofs I read say this is obvious, but I don't see how $B_r(x) \subseteq Int(A)$ immediately follows here.
|
Recently, I read an article that said a human lifespan does not have any limit and when a man turns 105 he has a 50/50 chance to survive another year. Some scientists say that a man who will reach the age of 140 has already been born. Is it possible that the length of a human's life will be prolonged over time? I know that we don't know what the limit is and if it exists at all, but it is possible to one day expect it to be completely normal for a human being to live 300 years or so? I mean, without the intervention of any "elixirs of youth", development of technology, medicines etc.? I ask because in 2016 there was an article published in that says we know what the limit is (115 years) and they believe that Jeanne Calment (who died at age 122) was lucky to live that long. On the other hand, another article published in this year says that we don't know what the limit is.
|
It's probably just misconstrued pop science, but I thought a read an article recently that said there's no known limit on how long humans can live. I could have sworn though that there were a few automatic processes that took place though, like that the chromosomes all shorten in length every time they're copied (is there any limit to that? Also, why does that matter?), the retinas in the eyes harden, the metabolism slows down, the heart muscles wears out, etc. So, how could it be true?
|
I bought this computer one year ago and it came with Ubuntu 14.04 LTS. I used the computer as it came and I didn't have problems until now when I can't even download photos because the storage is full. In settings it says I only have 7,7GB s available even though on the computer specs it is 1TB. I ran lsblk in the terminal and it does show that I have 1TB of space but I can only use 7,7GB for some reason. How can I fix this? sda 8:0 0 931,5G 0 disk ├─sda1 8:1 0 3,8G 0 part [SWAP] └─sda2 8:2 0 7,5G 0 part / sr0 11:0 1 1024M 0 rom
|
Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers. Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions). Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space. How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?
|
I am using a 555 IC to produce a sound in a small 8 ohm speaker. It works just fine, but the square wave sounds rather harsh. I am wondering if there is a simple way to round out the corners to make it sound better. All the circuits I have found online are rather complex. It seems to me that a simple RC circuit should do the trick, but I have not been able to figure out how to position it. Any help would be greatly appreciated.
|
I have square waves of different frequencies (1KHz to 20KHz), and I need to convert them to a sine wave of the corresponding fundamental frequency. A RC ladder Low-pass filter was the first thing which I tried, It gave good results but the output peak-to-peak voltage (Vpp) varied a lot with the frequency. The square wave has a Vpp of 3.6V. But after filtering, the output Vpp of the sine wave varies from 3V to 2V as the frequency increases. Is there any other better way to get a pure sine wave from square wave of same frequency without this voltage drop? Thank you
|
The sample variance of $m$ samples from a gaussian is $$ \hat{\sigma}^2_m=\frac{1}{m}\sum_{i=1}^m(x^{(i)}-\hat{\mu}_m)^2$$ How do i show that the sample variance $\hat{\sigma}_m^2$ is biased ? I.e $$E[\hat{\sigma}_m^2] = E[\frac{1}{m}\sum_{i=1}^m(x^{(i)} - \hat{\mu}_m)^2] = \frac{m-1}{m}\sigma^2$$
|
Let $\{ X_i | i = 1, 2, . . . ,n \}$ be a sequence of independent and identically distributed (IID) random variables from a population and define $\mu \equiv \mathbb{E}(X)$ and $\sigma^2 \equiv \mathbb{V}(X)$. Suppose we think that the mean is $\mu = \mu_0$ for some number $\mu_0$ (but we may be wrong). Find the bias in the estimator: $$\tilde{\sigma}^2 \equiv \frac{1}{n} \sum_{i=1}^n (X_i - \mu_0)^2,$$ as a function of $\mu$. When is this estimator unbiased for $\sigma^2$? I know that when we find this estimator using $\bar{X}$, it is biased and we must divide it by $n-1$ instead of $n$ to get an unbiased estimator. But how does one do it for a number such as $\mu_0$?
|
In a follow up to one of the business problem i have discussed here, for one of the logistic regression model, i have 19 predictor variables of which around 8 are categorical with multiple categories. Instead of including all in the model where one could correlate to another, i am thinking of using a chi square test of independence at a given p value. With this i would come to realization if there is any correlation among the categorical predictors. If so i would include the correlated variables one by one in the model and would used the significant one. I have researched on this on SE where they have suggested to use chi- square but unsure if my approach to drop these correlated var is justified.
|
I have a dataframe with many observations and many variables. Some of them are categorical (unordered) and the others are numerical. I'm looking for associations between these variables. I've been able to compute correlation for numerical variables (Spearman's correlation) but : I don't know how to measure correlation between unordered categorical variables. I don't know how to measure correlation between unordered categorical variables and numerical variables. Does anyone know how this could be done? If so, are there R functions implementing these methods?
|
The other day, something reminded me of the start of a juvenile science fiction book I checked out from a public library sometime in the early 1980s (say, between 1980 and 1984, I estimate). I know I found it in the kid's section, but it was mostly text instead of being, say, a storybook with colorful illustrations on each page. (If it helps, I think it was in the same section as the "Three Investigators" books, written by Robert Arthur, which I was reading around that time.) English language. Hardcover. I remember nothing about the author (not even whether I'd previously read anything else by the same person). The problem is that at this moment I only remember the plot of the first chapter or two. I'm hoping someone else will recognize this from the description. Plot Points The story is written in the third person, and the protagonist is a boy (pre-teen, I'm thinking). As the story opens up, I believe he somehow finds himself stranded on the surface of an asteroid or uninhabited planet. I have the idea that he'd been separated from his parents, and somehow had landed alone on this ball of rock, but I don't think his parents were dead. (I don't remember the story being that depressing.) I think the boy is wearing a space suit, but I could be wrong. Possibly the air on the surface of this astronomical body is breathable. At any rate, the boy somehow finds what is obviously a man-made structure; I believe in the shape of a large dome. He enters through the door or airlock (depending on the atmospheric conditions). Once inside, the boy is startled when a voice speaks to him. It turns out to be the Artificial Intelligence (probably not called by that exact phrase within the text) which is basically the permanent caretaker of this place. Either the place had been set up as an aid station for exactly such emergencies as a human being somehow getting stranded in this neighborhood, or else it had been built for some other purpose which may have already been served. (I don't remember getting the feeling that the AI was directing an active mining operation, for instance.) The AI introduces itself as "Ego." One reason that name sticks with me is that I was so young at the time that, while I may have seen the word before, I was not entirely clear on its precise meaning. I think the AI briefly defines the term to explain why this is a suitable name for it. Ego is quite willing to help a human in distress, but has very limited resources available. (For instance, I don't think it had a fully functional spaceship parked in a hangar nearby, nor could it instantly establish a radio conversation in realtime with any humans located elsewhere.) The kid does not spend the rest of the story just sitting in the dome waiting to be rescued. I'm sure he visits other places and has other adventures before an obligatory happy ending is provided, but I can't remember details of those adventures. (I don't even remember if "Ego" got to do anything in the plot after the first couple of chapters.) Does anyone remember a piece of juvenile science fiction which started out along these lines? Note: This particular "Ego" did not have anything to do with the Marvel Comics character known as "Ego the Living Planet." And thus it has no connection with the MCU version of that concept which was recently featured in Guardians of the Galaxy Vol. 2 (with Ego played by Kurt Russell).
|
This was the first science fiction novel I completed reading on my own some 36 years ago. Unfortunately the details are very sketchy indeed, but here's what I think I remember: It was a hard back library book The book was 100 pages long (perhaps exactly or just over) I read it some time pre-1980, possibly in 1979 but it may not have been new then It would've been classified as a "Children's Book" back then, but would be YA or Middle Grade now The POV character was a young boy of about 10-12 years of age It was set on the Moon The boy is rescued by some space gypsies He is befriended by a young space gypsy girl with dark hair When he is returned to his family, his parents are very prejudiced against the gypsies. A scene fragment of transferring from a lunar rover to the entrance tunnel to a lunar base A scene fragment of the boy looking at a computer screen and seeing someone who reminds him of the girl Like so many here, this is a long term unscratchable itch that I'd love to soothe. Many thanks in advance for any clues or pointers.
|
I was wondering how to reset Ubuntu's theme to default because I installed a new theme and now everything is broken despite already resetting the theme. When I logout it goes to a blank screen and says low graphics mode and I can't do anything else so I have to reboot. I am unable to show you the login screen and in gnome session nothing loads it is blank. Ubuntu 13.10
|
I've been messing around with Unity and broke something, how do I "start over"?
|
I have two Gmail accounts, one personal and one given by my university. I have set email forwarding so that all mails that come to my university address are forwarded to my personal account. I wish to create a filter so that all messages forwarded from my university address are moved to a separate folder. How do I do this?
|
I have a Google Apps email ([email protected]) set to auto-forward all mail to my personal Gmail ([email protected]). I have added the [email protected] address to my personal Gmail so I can send mail as [email protected] from within my personal email account. It's a fairly common way to consolidate email accounts. Here's my problem. I want [email protected] to filter all emails being forwarded from [email protected] and apply the Business label. So I tried it two different ways: A) Use an Alias: [email protected] forward to [email protected] Create filter "To:[email protected]" in me@gmail account Have filter apply Business label B) Use Googlemail.com address: [email protected] forward to [email protected] Create filter "To:[email protected]" in me@gmail account Have filter apply Business label However, neither of these filters work. I've tested it using a third email address, [email protected]. Whenever I send an email from [email protected] to [email protected], the email is properly forwarded to [email protected], and I can reply to [email protected] using the [email protected] address. But Gmail does NOT apply the Business label. This is case using either filtering method A or B. But if I send an email from [email protected] DIRECTLY to [email protected] or [email protected], the filter works properly and applies the label. So there must be something going on with the forwarding of [email protected] to [email protected]. Does anyone know how to get this working?
|
Consider the sentence "What is the probability of Bob winning?" What is the function of "Bob winning"? It's certainly acting as the object of the preposition, but I don't recognize this type of construction from any of my English courses. Is it even correct usage?
|
I have a problem analysing this sentence from the point of finite/nonfinite clauses, clause elements and their functions: He does not want to destroy his parents' dream of him achieving a Cambridge degree. I am especially interested in the: dream of him achieving a Cambridge degree. I know that 'achieving a Cambridge degree' is a non-finite -ing participle clause. However what is its function? And what is the function of 'of him'? Is it a postmodification?
|
On the Wikibooks page , the author included $0 \neq 1$ as the axiom that relates addition, and multiplication. But, what I see the most is just the distributive law. What does $0 \neq 1$ mean? And how it is related to addition and multiplication? Why is it included in this list of axioms?
|
The title pretty much says it all. Of course, one answer (IMO unsatisfactory) to such questions goes something like "a definition is a definition, period." In my experience, mathematical definitions are rarely completely arbitrary. Therefore I figure there must be a good reason for insisting that a field be a non-trivial ring (among other things), but it's not obvious to me. I realize that a trivial ring would make for a very boring field, but it is also a rather boring ring, and yet it is not disallowed as such. EDIT: I found a hint of a rationale in the statement that "the zero ring ... does not behave like a finite field," but I could not find in the for this assertion exactly how the zero ring fails to behave like a finite field.
|
Is there any way to find out what script applies to certain HTML elements? With inspect element you can see the styles applied to elements and I'd like to check what javascript is applied also. Example(this is what actually made me ask the question): When you hover an item, a few things are happening and I'd like to know witch script(there are many scripts included in the html page) is responsible for the effects, and if all the scripts were merged into one .js file, would be nice to know the code responsible for the effect. There are a lot of scripts and would be nice to know witch does certain things to the html elements.
|
I have a page where some event listeners are attached to input boxes and select boxes. Is there a way to find out which event listeners are observing a particular DOM node and for what event? Events are attached using: Event.observe; DOM's addEventListener; As element attribute element.onclick.
|
I need a certain URL to be always opened in a browser that's not systems default browser. Problem is, that this should happen even if the URL is called automatically from within a hardcoded 3rd party app. Answer on one hand is focussing on .webloc and .url files or is using "Open with …" menu item. On the other hand it is mentioning ; same does this answer: . How can this be accomplished with on-board resources like a script?
|
I've created a URL link in my dock, however, the link only opens with the default browser. I have safari, Firefox, and chrome (latest being the default) installed in my machine. I'm wondering if someone knows how to default the link to open with Firefox instead of Chrome but still keeping chrome as the default browser. Note: I'm running Mavericks in my MacBook Pro.
|
$|Z_1| = | \frac{v(1+\alpha) + \sqrt{v^2(1+\alpha)^2-4\alpha}}{2}|$ Triangle inequality |x+y|=|x|+|y| Where x= $\frac{v(1+\alpha)}{2}$ and $y= \frac{\sqrt{v^2(1+\alpha)^2-4\alpha}}{2}$ I've been stuck on this problem now for a couple of days and I'm having a difficult time proving this case. I'm trying to prove that $|Z_1| \leq 1$ while using triangle inequality. Where in Case I: $−1\leq \alpha \leq 0$ and $0<v<1$ I was wondering if anybody can assistance me on this problem. I want to thank you ahead of time for your cooperation.
|
$|Z_1| = | \frac{v(1+\alpha)+ \sqrt{v^2(1+\alpha)^2-4\alpha}}{2}|$ I know that using triangle inequality method $|Z_1|$ is: $|Z_1|= |\frac{v(1+\alpha)}{2}| + |\frac{\sqrt{v^2(1+\alpha)^2-4\alpha}}{2}|$ Case I: $-1 \leq \alpha \leq 0$ and $0 < v <1$ Prove that $|Z_1| \leq 1$ Triangle inequality |x+y|=|x|+|y| I've been stuck on this problem now for a couple of days and I'm having a difficult time proving this case. I was wondering if anybody can assistance me on this problem. I want to thank you ahead of time for your cooperation.
|
I am trying to understand inverse limits and so I decided to try and compute one of such limits. We are going to work in the category of rings. Let $R$ be a ring. First, I set up an inverse system. Let $A_i:=R[x_1,\dots,x_i]$ denote a ring of polynomials over $R$ in $i$ indeterminates and let $f_{ij}:A_j \rightarrow A_i$ be morphism sending $x_j,\dots,x_{i+1}$ to $0$ and $x_1,\dots,x_i$ to themselves. Then $((A_i)_{i \in \mathbb{N}},(f_{ij})_{i \leq j \in \mathbb{N}}$) is my inverse system. Then, according to , the inverse limit $A$ of our inverse system is \begin{equation*}A=\underleftarrow{\text{lim}}A_i=\Bigg\{\overrightarrow{a}\in\prod_\limits{i \in \mathbb{N}}A_i|a_i=f_{ij}(a_j) \; \forall \; i\leq j \in \mathbb{N} \Bigg\}. \end{equation*} So if we look at some elements of $A$ (take $R=\mathbb{Z})$ we have, for example: \begin{equation*} (\dots,3x_{3}^4-5x_3x_2x_{1}^2+5,5,5) \; \text{or} \; (\dots,x_{3}+x_2+x_1+4,x_2+x_1+4,x_1+4) \end{equation*}. My suspicion is that $A \cong R[x_1,x_2,\dots]$ and so the inverse limit would be just that with nutaral projections. Is that correct? Is this the right way of looking at these sort of constructions?
|
Define an inverse system of polynomial rings over a commutative ring $k$ by the canonical projection $k[x_1,...,x_n] \to k[x_1,...,x_m]\;(m< n)$. Question: What is the projective limit $\varprojlim_n k[x_1,...,x_n]$ ?
|
I have been stuck on this problem for awhile. How would i go about solving it, an explanation would be helpful as well. Show that if $n$ is an integer then $n^2 \equiv 0$ or $1 \pmod 4$?
|
This is a question from the free Harvard online abstract algebra . I'm posting my solutions here to get some feedback on them. For a fuller explanation, see post. This problem is from assignment 6. The notes from this lecture can be found . a) Prove that the square $a^2$ of an integer $a$ is congruent to 0 or 1 modulo 4. b) What are the possible values of $a^2$ modulo 8? a) Let $a$ be an integer. Then $a=4q+r, 0\leq r<4$ with $\bar{a}=\bar{r}$. Then we have $a^2=a\cdot a=(4q+r)^2=16q^2+8qr+r^2=4(4q^2+2qr)+r^2, 0\leq r^2<4$ with $\bar{a^2}=\bar{r^2}$. So then the possible values for $r$ with $r^2<4$ are 0,1. Then $\bar{a^2}=\bar{0}$ or $\bar{1}$. b) Let $a$ be an integer. Then $a=8q+r, 0\leq r<8$ with $\bar{a}=\bar{r}$. Then we have $a^2=a\cdot a=(8q+r)^2=64q^2+16qr+r^2=8(8q^2+2qr)+r^2, 0\leq r^2<8$ with $\bar{a^2}=\bar{r^2}$. So then the possible values for $r$ with $r^2<8$ are 0,1,and 2. Then $\bar{a^2}=\bar{0}$, $\bar{1}$ or $\bar{4}$. Again, I welcome any critique of my reasoning and/or my style as well as alternative solutions to the problem. Thanks.
|
I'm using the appendix package and the following lines in LaTeX: \begin{appendix} \section{Supplementary Figures and Tables} \section{Selected Derivations and Proofs} \end{appendix} This yields to the following entry in the tables of content: Supplementary Figures and Tables XI Selected Derivations and Proofs XII However, it would be nice to have something of the following form in the tables of content: Appendix Supplementary Figures and Tables XI Selected Derivations and Proofs XII So basically, I would like to have the title Appendix to show up in the tables of content but without a page number.
|
I am failing to add a heading for the appendix to the ToC with the correct page number: \documentclass{scrbook} \begin{document} \tableofcontents \chapter{test} \appendix \addcontentsline{toc}{part}{\appendixname} \chapter{First Appendix} \end{document} I also tried to use the \addappheadtotoc command from the package, but that changes nothing (expect that it writes 'Appendices' instead). I assume that the appendix package provides the solution, but I could not figure out how to use it.
|
THIS IS NOT A DUPLICATE! I have a piece of JavaScript with what I call a "nested" setInterval; one setInterval that calls a function with another setInterval. What i want is when the "outer" setInterval calls the function when the "inner" setInterval is already running, I want the "inner" setInterval to stop it's original interval and start again fresh. So: Outer setInterval fires. Outer setInterval calls function with inner setInterval. Inner setInterval fires. ... inner runs for a while Outer setInterval fires ... again. Outer setInterval calls inner setInterval ... again Inner setInterval stops it's original run. Inner setInterval starts a fresh, new run. See my example below: <!DOCTYPE html> <html> <head> <title></title> <style type="text/css"> div { margin: 100px 100px; } </style> <script type="text/javascript"> let alphabet = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"]; function start(){ var the_button = document.getElementById('the_button'); the_button.addEventListener('click', testFunction); } function testFunction(){ console.log("Starting ..."); if(myIntervalVal) clearInterval(myIntervalVal); var myIntervalVal = setInterval(printAlphabet, 10000); } function printAlphabet(){ var i = 0; console.log(alphabet[i]); if(mySubInterval) clearInterval(mySubInterval); var mySubInterval = setInterval(function(){ i++; if(i === alphabet.length) i = 0; console.log(alphabet[i]); }, 1000); } </script> </head> <body onload="start();"><div><button type="button" id="the_button">click me</button></div></body> </html> The way I feel this should work is: outer fires inner prints A B C D E F outer is fired again inner stops printing inner prints A B C D E F ... Is this not possible?
|
What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?
|
I have recently discovered reviewing posts and am working towards the respective badges. However, the majority of the time (even now) I use the mobile app, rather than the desktop. Therefore I was very disappointed when I couldn't find a way of reviewing posts while on the app. Feature request: add in a way for people to review posts while on the app, for both iOS and Android. Personally, I think that having a button to access this would be best placed in the iOS app, but that's just my opinion. What do you think? Is this a plausible idea?
|
I enjoy reviewing on SO, is it currently possible to review on the iOS app? If not, is it planned to be implemented?
|
Suppose we're looking at an $SU(N)$ symmetry in the adjoint representation. The kinetic part of the Lagrangian yields a term $$ \Delta \mathcal{L} = -g^2 Tr\left[[T^a, \Phi][T^b, \Phi]\right]A^a_{\mu}A^{b\mu} $$ When $\Phi$ acquires a VEV (call it $\Phi_0$) the broken generators are those whose associated gauge bosons acquire mass, via the above term of the Lagrangian. This amounts to saying that the unbroken generators are those whose commutator with the VEV vanishes: $$ [T^a, \Phi_0] = 0 $$ Let's say generically the VEV has the form $$ \Phi_0 = diag(a, a, ..., a, b, b, ... b) $$ where there are $n_a$ of $a$, $n_b$ of b, and $Tr[\Phi_0] = 0$. My understanding is that there are effectively three cases for generators that will commute with the VEV: 1) $$ T^a = \begin {bmatrix} A & 0 \\ 0 & 0 \\ \end {bmatrix} $$ where A is an $n_a \times n_a$ block 2) $$ T^a = \begin {bmatrix} 0 & 0 \\ 0 & B \\ \end {bmatrix} $$ where B is an $n_b \times n_b$ block 3) $T^a$ is a diagonal matrix. I understand why generators from case 1) would produce generators of SU($n_a$), and why generators from case 2) would produce generators of SU($n_b$). What I can't figure out is why diagonal generators (often proportional to the VEV) are generators of U(1). My understanding was that the only generator of U(1) was the identity. Why is it that any traceless diagonal matrix can produce U(1)?
|
In GUTs one starts with some larger group, like $SU(5)$, which is then broken into smaller groups, for example $$SU(5) ~\longrightarrow~ SU(3) \times SU(2) \times U(1)$$ This can be seen, for example, by looking at the Dynkin diagram for $SU(5)$: Removing one node leaves us with the Dynkin diagrams for $SU(3)$ and $SU(2)$. My problem is understanding where $U(1)$ comes from. I've read several statements about that, but couldn't fit the puzzle pieces together. Dynkin diagrams are one the level of Lie algebras. Removing one node means we remove one generator. For example, in from the the course Symmetries in Physics by Michael Flohr: By removing a node, the rank of the subalgebra is reduced by one, and the simple roots are a subset of the original simple roots. On the level of the groups, we thus find, $$G=G_1\times G_2 \times U(1),$$ where the additional $U(1)$ factor comes from the left out Cartan generator. For example, $SU(n+m)$ can be reduced in this way into $$SU(n)\times SU(m)\times U(1).$$ This is the classical ansatz for a GUT: $SU(5)$ gets broken into $$SU(3)\times SU(2)\times U(1).$$ In by John Baez it is claimed that $SU(3) \times SU(2) \times U(1)$ is no subgroup of $SU(5)$ and some homomorphism is used the justify why $U(1)$ appears. EDIT: In Lie Algebras In Particle Physics: from Isospin To Unified Theories Georgi writes: "The Cartan generator that have been left out generate $U(1)$ factors" and my problem is understanding why this is the case. Any ideas to clarify this would be awesome!
|
How to force Fedora command-line to give me proposals for installation of package when a missing command is typed? Now when I type git the command-line tells me : -bash: git: command not found Before it gave me proposal (something like this): Command not found. Install package 'git' to provide command 'git'? [N/y] I made a clean installation of Fedora 24 and obviously this feature is missing. I tried to dnf install command-not-found but it couldn't find the package. What should I do to bring this feature back?
|
I have noticed that while on Ubuntu, if I type the following: mc and it isn't installed, I get the message below: The program 'mc' is currently not installed. You can install it by typing: sudo apt-get install mc However in Debian, that is not available. It just gives a "-bash: /usr/bin/mc: No such file or directory" message. How can I implement the same functionality in bash command line on Debian? Yes, I know that if it is package suggestion that I want, I can simply do a regex search using apt-cache search. However I was hoping for the simpler suggestion immediately on typing the name of the program. As per discussions, the functionality is provided by the package command-not-found. However even after installing it, and also installing bash-completion package, this isn't available on the Debian bash shell.
|
suppose we will delete the records from recycle bin means where those records being(i mean which place those items saved). Is there any limit to get back those records(I mean Maximum how many days we can get those records).I used this query for get deleted records. SELECT Id, Name FROM Account WHERE isdeleted = true ALL ROWS
|
Hi i want to get the deleted records (records deleted from recycle bin of sales force).can any one help on this i tried this soql query retrive deleted records but its result showing error: "SELECT Id, Name,ISDeleted FROM lead WHERE ISDeleted = true"
|
I want to do a regression to figure out the relationship between $y$ and $x$ given some sample data. My problem is that within the sample data, while $x_i$ is always observed, I do not directly observe $y_i$. Instead, I observe if $y_i>z_i$, where $z_i$ is some observed number. For example, I will have to train the model $y=\hat{f}(x)$ on the below sample data: $$(x_1=2, y_1>1)$$ $$(x_2=3, y_2<4)$$ $$(x_3=10, y_3>2)$$ ... Then I can use the trained $\hat{f}(x)$ to make predictions of $y$ on any new $x$, $y^*=\hat{f}(x^*)$ How do you think I can approach this problem?
|
Is there a branch of statistics that deals with data for which exact values are not known, but for each individual, we know either a maximum or minimum bound to the value? I suspect that my problem stems largely from the fact that I am struggling to articulate it in statistical terms, but hopefully an example will help to clarify: Say there are two connected populations $A$ and $B$ such that, at some point, members of $A$ may "transition" into $B$, but the reverse is not possible. The timing of the transition is variable, but non-random. For example, $A$ could be "individuals without offspring" and $B$ "individuals with at least one offspring". I am interested in the age this progression occurs but I only have cross-sectional data. For any given individual, I can find out if they belong to $A$ or $B$. I also know the age of these individuals. For each individual in population $A$, I know that the age at transition will be GREATER THAN their current age. Likewise, for members of $B$, I know that the age at transition was LESS THAN their current age. But I don't know the exact values. Say I have some other factor that I want to compare with the age of transition. For example, I want to know whether an individual's subspecies or body size affects the age of first offspring. I definitely have some useful information that should inform those questions: on average, of the individuals in $A$, older individuals will have a later transition. But the information is imperfect, particularly for younger individuals. And vice versa for population $B$. Are there established methods to deal with this sort of data? I do not necessarily need a full method of how to carry out such an analysis, just some search terms or useful resources to start me off in the right place! Caveats: I am making the simplifying assumption that transition from $A$ to $B$ is instantaneous. I am also prepared to assume that most individuals will at some point progress to $B$, assuming they live long enough. And I realise that longitutinal data would be very helpful, but assume that it is not available in this case. Apologies if this is a duplicate, as I said, part of my problem is that I don't know what I should be searching for. For the same reason, please add other tags if appropriate. Sample dataset: Ssp indicates one of two subspecies, $X$ or $Y$. Offspring indicates either no offspring ($A$) or at least one offspring ($B$) age ssp offsp 21 Y A 20 Y B 26 X B 33 X B 33 X A 24 X B 34 Y B 22 Y B 10 Y B 20 Y A 44 X B 18 Y A 11 Y B 27 X A 31 X B 14 Y B 41 X B 15 Y A 33 X B 24 X B 11 Y A 28 X A 22 X B 16 Y A 16 Y B 24 Y B 20 Y B 18 X B 21 Y B 16 Y B 24 Y A 39 X B 13 Y A 10 Y B 18 Y A 16 Y A 21 X A 26 X B 11 Y A 40 X B 8 Y A 41 X B 29 X B 53 X B 34 X B 34 X B 15 Y A 40 X B 30 X A 40 X B Edit: example dataset changed as it wasn't very representative
|
I'm trying to cross-compile on Linux (i686-w64-mingw32-gcc) a small 32-bit Windows program that requires (libz, libpng and) libgd. I have them all installed correctly, as far as I can tell, though the linker keeps on complaining it can't locate the libgd functions I'm using. $ i686-w64-mingw32-gcc -lgd -lpng -lz -lm -o demo demo.o smssc.o demo.o:demo.c:(.text+0x2d): undefined reference to `_imp__gdImageCreateFromPng@4' demo.o:demo.c:(.text+0x1f7): undefined reference to `_imp__gdImageGetPixel@12' demo.o:demo.c:(.text+0x316): undefined reference to `_imp__gdImageCreate@8' demo.o:demo.c:(.text+0x368): undefined reference to `_imp__gdImagePaletteCopy@8' demo.o:demo.c:(.text+0x3b0): undefined reference to `_imp__gdImageGetPixel@12' demo.o:demo.c:(.text+0x3ec): undefined reference to `_imp__gdImageSetPixel@16' demo.o:demo.c:(.text+0x430): undefined reference to `_imp__gdImageDestroy@4' demo.o:demo.c:(.text+0x465): undefined reference to `_imp__gdImageSetPixel@16' demo.o:demo.c:(.text+0x4a9): undefined reference to `_imp__gdImageSetPixel@16' demo.o:demo.c:(.text+0x4e0): undefined reference to `_imp__gdImageColorAllocate@16' demo.o:demo.c:(.text+0x569): undefined reference to `_imp__gdImageLine@24' demo.o:demo.c:(.text+0x5e9): undefined reference to `_imp__gdImageLine@24' demo.o:demo.c:(.text+0x669): undefined reference to `_imp__gdImageLine@24' demo.o:demo.c:(.text+0x6e3): undefined reference to `_imp__gdImageLine@24' demo.o:demo.c:(.text+0x70f): undefined reference to `_imp__gdImagePng@8' demo.o:demo.c:(.text+0x71f): undefined reference to `_imp__gdImageDestroy@4' this is how I had configured libgd ./configure --host=i686-w64-mingw32 --prefix=/usr/i686-w64-mingw32 CPPFLAGS="-I/usr/i686-w64-mingw32/include" LDFLAGS="-L/usr/i686-w64-mingw32/lib" of course libgd.a, libpng.a and libz.a are found into my /usr/i686-w64-mingw32/lib also, objdump output seems correct: $ objdump -tT /usr/i686-w64-mingw32/lib/libgd.a In archive /usr/i686-w64-mingw32/lib/libgd.a: gd.o: file format pe-i386 [snip]
|
Why does the order in which libraries are linked sometimes cause errors in GCC?
|
I want to set my input source to ibus-unikey(i installed it and set my input to ibus) but can't find it anywhere in setting. In 14.10 there are a input source tab in Region and Language but now it isn't. I opened the language section but there is nothing in it. Is there any way to open ibus please help me.
|
I installed both Korean and Japanese using the Language Support window, and expected Korean (Hangul) and Japanese (Anthy) to show up in the input sources for Text Entry Settings (having both packages installed). However, neither shows up.
|
This is clearly a bug. Somewhere. Somehow.
|
I took this screenshot just now, and about the new . I refreshed the page, went back, and nothing changed. And, here's what I find odd: It clearly isn't almost 2014 years old. That's more likely when it was started. How can there be 8.7 questions a day, while there are 0 visits a day? That's kind of impossible. I'm hoping here that it's not just me. I know very limited Japanese, not even enough to hold a conversation with a toddler. I'm merely observing.
|
I have already installed Ubuntu 20.04 and made it first boot priority on my computer (asus 2019 zenbook) but my computer keeps jumping into the second boot option which is Windows 10.
|
I installed Ubuntu on a Dell XPS 13 laptop that had Windows 10 preinstalled on it. I installed it from a USB flash drive on a partition. When I boot my computer I can only boot into Windows 10 and Ubuntu is nowhere to be seen. If I boot into my USB then I can see that Ubuntu is installed, but I can't get to it from the BIOS boot menu.
|
Question: Let $f$ be an entire function that satisfies $|f(z)| \leq 1 + |z|$ for all $z \in \mathbb{C}$. Show that $f(z) = az + b$ for fixed complex numbers $a$ and $b$. My attempts: I realise that I need to apply the generalised Cauchy Integral Formula $\displaystyle f^{(n)}(z_0)=\frac{n!}{2\pi i} \int_{\Gamma}\frac{f(z)}{(z-z_0)^{n+1}}\,dz$ on an arbitrarily large circle to show that $f^{(n)}(0)=0$ for all $n \geq 2$. While I know what to after this is proven, I'm unsure how to actually prove this. Any help or guidance would be greatly appreciated!
|
Let $f$ be an entire function that satisfies $|f(z)| \leq 1 + |z|$ for all $z\in \mathbb{C}$. Show that $f(z) = az +b$ for fixed complex numbers $a,b$. The hint tells us to try and use Cauchy's Integral Formula on an arbitrary circle. This is my attempt: Consider an arbitrary large circle with centre $0$ and let $\Upsilon$ be the contour around this circle. Then $$\int_{\Upsilon} \frac{f(z)}{z^{n+1}} \mathrm{d}z = \frac{2\pi i}{n!}f^{(n)}(0).$$ Note that $$\int_{\Upsilon}\frac{f(z)}{z^{n+1}} \leq \int_{\Upsilon}\left|\frac{f(z)}{z^{n+1}} \right|\leq \int_{\Upsilon} \frac{1}{|z^{n+1}|} + \frac{1}{|z|^n}$$ and the right hand side is $0$ by Cauchy's Integral Formula. I'm not sure if the first equality is valid, and not sure where to go from here.
|
We look after multiple Office 365 tenants for hosted Exchange email. One tenant in particular has an issue where a lot of inbound and outbound emails are marked as phishing. The domain passes all DNS checks under the Admin console, and I can't find the domain on any blacklist checks. SPF: v=spf1 include:spf.protection.outlook.com -all I investigated enabling DKIM, however unfortunately the domain registrar does not accept underscores in CNAME records. Can someone please help? The issue is very frustrating for our client. Thanks!
|
This is a about avoiding outgoing mail being classified as spam. Also related: I'm wondering how to prevent my emails from my site being marked as spam? I'm using sendmail. I'm trying to send emails through my ruby-on-rails application. The mails are all written in swedish (if that does make a difference?). I don't know why they keep getting marked as spam. Are there any things that I can do to minimize the risk?
|
Creating a program where a random number is generated using math.random which i have put into a function and called this function in the program to make things tidier but the random number that gets outputted is always what the integer secret_number is set to, and i am not sure how to fix this to create a random number. I would like to keep the math.random in the function and use parameters package guessinggame3; import java.util.Scanner; //imports scanner to read from keyboard import java.util.ArrayList; public class GuessingGame3 { //start of public class static Scanner kboard = new Scanner(System.in); //calls scanner public static void main(String args[]) //start of main { System.out.println("Welcome to the guessing game, the computer will generate a random number that you have to guess, good luck!"); //opening message explaining how to play int secret_number = 0; int number_of_guesses = 0; int user_guess ; ArrayList<Integer> entered_numbers = new ArrayList<Integer>(); generate_random_number(secret_number); //calls he function generate_random_number to say the random number has been generated for(int i=0; i<20;i++) { // start of for loop sets user attempts to 20 System.out.println("Please make your guess"); //asks user to enter make their guess user_guess = kboard.nextInt(); number_of_guesses++; // adds on to the counter after each user guess if(entered_numbers.contains(user_guess)) //checks if entered number = number stored in array { System.out.println("You have already entered this number"); //displays error message if user enters same number again continue; } else { entered_numbers.add(user_guess); if (user_guess == secret_number) System.out.println("Your guess is corret you win!"); } if (user_guess < secret_number) { System.out.println("Guess is too low"); } if (user_guess > secret_number) { System.out.println("Your guess is too high"); } System.out.println (20 - number_of_guesses + " Guesses remaining"); //Tells the user how many guesses they have remaining } //end of for loop } //end of main static void generate_random_number(int secret_number) //start of function generate_random_number function passing secret_number as a parameter { secret_number = (int)(Math.random()*100) + 1; //generates random number between 0 and 100 System.out.println("The computer has generated it's number"); //lets the user know that the random number has been generated } //end of function generate_random_number } //end of public class
|
I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?
|
For numerical stability, I thought it might be a good idea to scale my data before feeding them into an ARMA GARCH model. I have gone through a few older posts and understand the affect scaling innovations/residuals have on GARCH, but what effect does it have on the ARMA coefficients? Thanks!
|
When developing a general purpose time-series software, is it a good idea to make it scale invariant? How would one do that? I took a time series of around 40 points, and then multiplied by factors ranging from 10E-9 to 10E3 and then ran through the ARIMA functions of Forecast Pro and Minitab. In Forecast Pro, all resulted in the same answer (automatic modeling), whereas in Minitab, they were not. Not sure what Forecast Pro does, but they might just scale up or down all the numbers to a certain scale (let's say 100s) before running the model. Is this good idea in general?
|
I have two Binomial distributed random variables. $$X_1\sim\text{Bi}\left(50,\theta_1\right)$$ $$X_2\sim\text{Bi}\left(50,\theta_2\right)$$ I sample from each distribution. $$X_1=x_1=15$$ $$X_2=x_2=26$$ Question formulate the joint likelihood function using the given information I am curious to know what a joint likelihood function is? Attempt 1 In this attempt I calculated the likelihood for each observation separately and multiplied them together. I am curious to know if I am on the right track? First likelihood $$L\left(X_1=x_1|\theta_1,n\right)= {n\choose x_1}\theta_{1}^{x_1}(1-\theta_1)^{n-x_1} $$ $$n=50,x_1=15$$ $$L\left(X_1=15|\theta_1,n\right)= {50\choose 15}\theta_{1}^{15}(1-\theta_1)^{50-15} $$ $$L\left(X_1=15|\theta_1,n\right)= (2250829575120) \theta_{1}^{15}(1-\theta_1)^{35} $$ similarly, the second likelihood is: $$L\left(X_2=26|\theta_2,n\right)= {50\choose 26}\theta_{2}^{26}(1-\theta_2)^{50-26} $$ Is the joint likelihood their product? $$L_{\text{joint}}=L\left(X_1=15|\theta_1,n\right)\times L\left(X_2=26|\theta_2,n\right)$$ Further context This is from a question in a 2nd year undergraduate statistics course which I am struggling with.
|
In Likelihood and All That Ben Bolker states " the joint likelihood of the whole data set is the product of the likelihoods of each individual observation". Is there a way that someone could explain to me, in simple terms, how we obtain the likelihood of an individual observation?
|
I'm sorry for asking such a simple question but I'm having a hard time thinking about all possible ideals of $M_2(Z)$. So let's consider an arbitrary matrix $\begin{pmatrix} a & b \\ c & d\end{pmatrix}$ where $a,b,c,d \in Z$. How can I start constructing ideals?
|
What are the left and right ideals of matrix ring? How about the two sided ideals?
|
This question has been asked and . I have a dual boot system with Windows 8.1 and Ubuntu 14.04 but I am not able to open New Volume from Ubuntu. It gives the following error: I disabled the hibernate option using powercfg /h off but it did not work although it was able to disable the hibernate and fast boot option. How can I fix this error?
|
Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount. When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens. Here's my partition table, if any more data is needed please let me know. Device Boot Start End Blocks Id System /dev/sda1 2048 20000767 9999360 83 Linux /dev/sda2 20002814 478001151 228999169 5 Extended /dev/sda3 * 478001152 622532607 72265728 7 HPFS/NTFS/exFAT /dev/sda4 622532608 625141759 1304576 82 Linux swap / Solaris /dev/sda5 20002816 478001151 228999168 83 Linux
|
This is a clean stable 20.04 install of the Raspberry PI image. $ sudo apt update [sudo] password for admn: Ign:1 http://ppa.launchpad.net/certbot/certbot/ubuntu focal InRelease Hit:2 http://ports.ubuntu.com/ubuntu-ports focal InRelease Get:3 http://ports.ubuntu.com/ubuntu-ports focal-updates InRelease [106 kB] Err:4 http://ppa.launchpad.net/certbot/certbot/ubuntu focal Release 404 Not Found [IP: 2001:67c:1560:8008::15 80] Hit:5 http://ports.ubuntu.com/ubuntu-ports focal-backports InRelease Get:6 http://ports.ubuntu.com/ubuntu-ports focal-security InRelease [107 kB] Reading package lists... Done E: The repository 'http://ppa.launchpad.net/certbot/certbot/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. I would expect that this PPA should either not be included in the default image, or that the Release file should be there. I suspect that this is a stripped-down Ubuntu server image, and that the PPA should not be included in the image. But which, or another option?
|
When updating, I get the following error message: W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file. Here, I find another statement on this error: This recommends removing certain PPAs; and, I'm not sure if I should do that since it might mean not getting the updates that I need. Is this what I should do?
|
In C#, you can declare a class as static, which requires all members to also be static. Is there any advantage (e.g. performance) to be gained by doing so? Or is it only a matter of making sure you don't accidentally declare instance members in your class?
|
Here's what : static class CompanyInfo { public static string GetCompanyName() { return "CompanyName"; } public static string GetCompanyAddress() { return "CompanyAddress"; } //... } Use a static class as a unit of organization for methods not associated with particular objects. Also, a static class can make your implementation simpler and faster because you do not have to create an object in order to call its methods. It is useful to organize the methods inside the class in a meaningful way, such as the methods of the Math class in the System namespace. To me, that example doesn't seem to cover very many possible usage scenarios for static classes. In the past I've used static classes for stateless suites of related functions, but that's about it. So, under what circumstances should (and shouldn't) a class be declared static?
|
req.getParameter("doit").equal("good"); Is it impossible to write this line in the method? Without it, the program runs correctly. However whenever I write that line, it shows the error messages.. java.lang.NullPointerException at adhoc.FinePrint.doFilter(FinePrint.java:50) Is there any way that I can check whether "doit" parameter is equal to "good"??
|
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?
|
Yesterday I had two NTFS partitions on my drive. One on which Windows 7 was installed (C Drive) and the other contained my data (D Drive). During Ubuntu installation I choose to install Ubuntu and erase my existing OS. When Ubuntu installed, I was shocked to see no partition. All my data was gone. I must have done something wrong in selecting my option during installation. Is there any way I can recover my D Drive?
|
I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions (C:) Vista (D:) Entertainment (E:) Work (F:) Sources and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB. I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse? I need these data badly as I don't have a backup for them.
|
I'm quite new to Blender and have been trying to get into camera tracking for my movies for a while now. I have gone on lots of forums and watched many tutorials but can't fix this problem. Whenever I track a scene and simply test it with a cube, the cube starts moving around and spinning about and things like that. I simply don't understand as I'm very new to this. I have got a movie clip off of a YouTube tutorial and tried to add a cube to test it and the same thing happened. I'm not quite sure how else to explain it, but the cube just keeps moving around. Please help, Thanks. EDIT: Here's the file: NFT
|
Whenever I do camera tracking in Blender the reconstruction is always zooming out or not on the axis. I have a great quality camera, but the end results of the camera tracking always has the model sliding. If you have a solution please tell me.
|
The topic itself has been and it seems that has been broached . I'm not sure what is the current prevailing opinion, though. Let's rehash a possible scenario. I downvoted an answer that seems to be wrong and posted my own one. Later, after my downvote was already locked, I realized that I read that question wrong and it didn't deserve a downvote. At such time I can either leave unjust downvote there or do an unneeded edit just to allow myself to undo my downvote. My initial actions could be construed as and, from what I understand, the lock is specifically preventing such behavior by not allowing downvoters to reclaim their lost reputation points. The bottom line here is that a person (for whatever reason) regrets his/her downvote and wants to do something about it. So, what about a suggestion to allow late downvote removals without crediting back the rep. This logic is similar to bounty handling. Is it worth a consideration or are we better off with a trivial edit just to circumvent the lock?
|
Background and History Presently, trying to change your vote on a question or answer more than a few minutes after casting it results in this message appearing: You last voted on this answer xx minutes ago. Your vote is now locked in unless this answer is edited. (click on this box to dismiss) This has been a source of some contention and many posts on meta. You can see these by looking at the . The justification that I have seen posted for the current behaviour is as follows: by initially downvoting rival answers to a question you have answered and then removing the downvote once your answer is accepted. However, a problem remains: The workaround is ugly and undesirable. If you don't yet have enough rep to edit someone's post yourself, then you need to leave a comment asking them to edit it for you, which is useless clutter to any future reader. On the other hand, if you edit the post yourself, then you'll show up as the last editor in the post's edit history, giving the potentially false impression that the post has changed in some significant way since it was originally posted, especially if the edit comes long after the date of the original post. There is an entirely legitimate use case for undoing your past votes: correcting mistakes, which even the most careful voter may sometimes make. Example: earlier today I was frustrated after I stupidly downvoted to a question, believing it to be wrong due to a basic mistake in my own understanding of some SQL syntax. I commented explaining my mistaken reasoning, and my error was quickly pointed out by other commenters. I was simply and objectively wrong, and my downvote was, consequently, without merit. However, by then my vote was locked. It took several further comments (which remain on the page) and several further minutes to inform my innocent victim that he needed to make a token edit to his post in order to let me retract my erroneous downvote. Surely this is not the system working as it should? With this in mind, I wondered if there exists a way to change the vote locking behaviour that: Is simple, Allows users to undo votes they regret, and Does not in any way make gaming the system easier. Such a solution would allow those who want to be able to undo votes to get what they want without any downside. I believe such a solution exists. Proposed Solution Allow undoing of votes, but: Have it cost 1 rep, Don't simply remove all record of the original vote having been cast; instead, have the owner of the affected post see two rep changes in their profile: one for the original vote, and one for the retraction. In other words, record both the original vote and the retraction as separate rep-affecting events. When a downvote is rescinded, don't refund the user a downvote. Why this would work: Since removing downvotes would offer a further penalty instead of a refund, it would be impossible to recoup the costs of voting down competitors' answers in bad faith. Any tactical voting (by downvoting rival answers and then retracting the downvote) would leave the same 'paper trail' as it does now, since the record of the original downvote is being kept. Users who are victim of such downvoting would still be able to notice it, and the would still have access to the data it needs to function. An honourable user who chooses - mistakenly but with good intentions - to pay a point of rep to downvote an answer, would be able to pay the same price to retract that vote. If they were willing to pay the point to downvote, they will presumably also be willing to pay the price of undoing their mistake. Hasty or frivolous votes would be penalised when the user chooses to undo them, so fact-checking and thinking carefully before casting your vote would still be encouraged.
|
Can anybody inform me how to switch language in Lubuntu? I went to "Keyboard and Mouse Settings" as well as "Language Support" but couldn't find any solutions.
|
I have recently upgraded my PC from Lubuntu 14.10 to 15.10. Before the upgrade my keyboard layout matched my Danish keyboard. But after the upgrade I probably have a standard English/US layout. Preferences/Language Support, doesn't let me configure the keyboard layout. Preferences/Keyboard and Mouse, only let me configure stroking delay and similar. I don't know about iBus and fcitx, as far as the tooltip infomation tells me, its for more complex languages such as Chinese. I don't have a US icon in the taskbar, no keyboard and/or language icon at all. Things I have tried: Running the following in a terminal works, but only until the next reboot: setxkbmap -layout dk I got the following parameter in the file /etc/default/keyboard: XKBLAYOUT="dk" Installing and running the app Lxkeymap changes the keyboard to Danish when I run it, but rebooting will change the layout back to US. I don't want anything fancy, I just want to set my keyboard layout to Danish. How can I do that?
|
The flag seems to put in a close vote as well, but the close vote doesn't flag it necessarily? If that's the case, what's the point of the close button?
|
When I encounter a duplicate, I have two choices: Vote closing because it is a duplicate, or flag it as a duplicate. What is the difference and should I do both?
|
I have question I am sure this is valid question - I am not new on SO. It was closed no comments on the question. Given that the SO is here for a while - there are lot more users who can close questions (lot more than it was a year ago). Some users might not even understand the question but have power to close it. I think to prevent blatant actions - SO should implement a mandatory comment post if a user votes to close a question.
|
I recently had a which attracted 1 close vote. I don't know why this vote was cast. If I have not conformed to the site's protocol in any way I am left 'none the wiser'. Should it be made mandatory for a user to comment on why they are voting to close a question? If this site is to remain 'clean', part of this will be achieved incorporating processes that educate users.
|
How many closed polygons will $n$ coplanar lines, all intersecting each other (no three concurrent), form on the plane? Can we find a recursion formula for this?? Is there a way out?
|
Show that $n$ lines separate the plane into $\frac{n^2+n+2}{2}$ regions if no two of these lines are parallel and no three pass through a common point. I know we start with the base case, where, if we call the above equation P(n), P(0), for 0 lines would be 0. But I really have no idea how to begin the inductive step. How do we know what k+1 we're supposed to arrive at? Thanks!
|
I had a dual boot machine with Windows 8 and Deepin linux on it. Last week I removed WIndows 8 and installed windows 8.1. After installing Windows 8.1 grub was removed. I followed to restore grub. After repairing the machine restarted but for some reason after restarting in the middle of booting it shutdown. Now the machine is not booting into any of the OS installed - it shows error message like "no boot device found please insert boot device and press any key". I tried booting a live CD and it appears I have lost all my partitions and data. I think it got formatted. Is there any way to recover the lost partion data. If yes, how? What all the requisites for that? is it possible to recover data into the same harddrive or do I need an external harddrive to store recover the data? I Googled and got many tools which are available, but none have proper documentation on how to recover. My problem is I am not able to access any of the OS, so how can I to use the mentioned tool? There are some bootable data recovery tools, but I dont know how to use them.
|
I have a dell laptop that recently "died" (It would get the blue screen of death upon starting) and the hard drive would make a weird cyclic clicking noises. I wanted to see if I could use some tools on my linux machine to recover the data, so I plugged it into there. If I run "fdisk" I get: Disk /dev/sdb: 20.0 GB, 20003880960 bytes 64 heads, 32 sectors/track, 19077 cylinders Units = cylinders of 2048 * 512 = 1048576 bytes Disk identifier: 0x64651a0a Disk /dev/sdb doesn't contain a valid partition table Fine, the partition table is messed up. However if I run "testdisk" in attempt to fix the table, it freezes at this point, making the same cyclical clicking noises: Disk /dev/sdb - 20 GB / 18 GiB - CHS 19078 64 32 Analyse cylinder 158/19077: 00% I don't really care about the hard drive working again, and just the data, so I ran "gpart" to figure out where the partitions used to be. I got this: dev(/dev/sdb) mss(512) chs(19077/64/32)(LBA) #s(39069696) size(19077mb) * Warning: strange partition table magic 0x2A55. Primary partition(1) type: 222(0xDE)(UNKNOWN) size: 15mb #s(31429) s(63-31491) chs: (0/1/1)-(3/126/63)d (0/1/32)-(15/24/4)r hex: 00 01 01 00 DE 7E 3F 03 3F 00 00 00 C5 7A 00 00 Primary partition(2) type: 007(0x07)(OS/2 HPFS, NTFS, QNX or Advanced UNIX) (BOOT) size: 19021mb #s(38956987) s(31492-38988478) chs: (4/0/1)-(895/126/63)d (15/24/5)-(19037/21/31)r hex: 80 00 01 04 07 7E FF 7F 04 7B 00 00 BB 6F 52 02 So I tried to mount just to the old NTFS partition, but got an error: sudo mount -o loop,ro,offset=16123904 -t ntfs /dev/sdb /mnt/usb NTFS signature is missing. Ugh. Okay. But then I tried to get a raw data dump by running dd if=/dev/sdb of=/home/erik/brokenhd skip=31492 count=38956987 But the file got up to 59885568 bytes, and made the same cyclical clicking noises. Obviously there is a bad sector, but I don't know what to do about it! The data is still there... if I view that 57MB file in textpad... I can see raw data from files. How can I get my data back? Thanks for any suggestions, Solution: I was able to recover about 90% of my data: Froze harddrive in freezer Used Ddrescue to make a copy of the drive Since Ddrescue wasn't able to get enough of my drive to use testdisk to recover my partitions/file system, I ended up using photorec to recover most of my files
|
I need to solve the following problem: Can $\sqrt[3]{2}$ be expressed as a linear combination of roots of unity (with coefficients in $\Bbb Q$)? I am completely lost because I have no idea of how to start this problem. Can someone help me, please?
|
Is $\sqrt[3]{2}$ contained in $\mathbb{Q}(\zeta_n)$ for some $n$, where $\zeta_n=e^{2\pi i/n}$? I think the answer is no, but I can't give a full proof. Assume the contrary, we then have $\mathbb{Q}(\sqrt[3]{2}) \subset \mathbb{Q}(\zeta_n)$, can I say $\mathbb{Q}(\zeta_n)/ \mathbb{Q}$ is a cyclic extension but $\mathbb{Q}(\sqrt[3]{2}) / \mathbb{Q}$ is not, so this is a contradiction?
|
How would one change TeX's pagination numbering system from decimal to one that would number pages in binary, hexadecimal, octal, or any other number system (e.g., the , with specialized characters for the numerals)?
|
In a document, is it possible to change the base in which the numeration is written? The default numeration is decimal, but I would like to use an octal or hexadecimal numeration for instance. Also, when I use a document class 'book' or 'report', how can I set a negative numeration before the main text? What I mean by this is that instead of small latin numeration (i, ii, iii, iv, ...) I would like the pages to decrease with a negative sign in front. Is there a way to do so?
|
I'm new to Ubuntu. I have tried to install Ubuntu 13.10 in VirtualBox with Base OS Windows 7. The Installation was fine and I did Tick on Download updates and Third Party App. After this it completed installation and Rebooted , Ubuntu load up to Just wallpaper and cursor on the screen. After some time It showed error : “Sorry, Ubuntu 13.10 has experienced an internal error.” /usr/bin/compiz. What to do now please.
|
I installed 13.04 as a virtual machine using VirtualBox from Oracle. When it was done doing the install, it says that it needs a reboot. After the reboot, I got this message: Sorry Ubuntu 13.04 has experienced an internal error /usr/bin/compiz I'm not sure what it means and how to resolve it.
|
I have been trying to dual-boot my Sony Vaio for a few weeks now. I am able to get to get to the installation menu, however, I am not given the option of running Ubuntu alongside Windows 7. So, I chose "Something else" and see this: I seem to have four primary partitions already. Does this mean that I would have to delete a partition and then free up space from another? If so, how would I go about this? Which partition would I be able to delete without messing up my hard drive and losing everything? Regardless, I don't understand why Ubuntu is not recognizing my Windows 7 partition. I have done quite a bit of research and have noticed that a lot of people have had a hard time dual-booting with their Vaio's, but I have not seen a solution that pertains to my situation. I have also included an image of my partitions in Windows: Any help would be much appreciated. Thank you!
|
I would like to install Ubuntu alongside Windows 7 on a HP G62 Notebook. Although I have installed Ubuntu in a dual-boot many times before, I found out that this model has already four partitions. Partitions: SYSTEM (NTFS, 199MB, used 66.59MB) Partition without any tag: NTFS (579GM, used 129GB) RECOVERY (NTFS 16.74 GB, used 2.42GB) HP_TOOLS (FAT32, 103.34 MB, used 13.23MB) Since I am not an expert with partitions I would like to get advice on how to do this. My first idea is this one: Free some space from /dev/sda2 (I don't know if could also free some other space) delete the HP_Tools partition (I have already created a backup) create an extended partition with the free space in #1 containing three parititions: swap (1gb); / (EXT4, 30GB); /home (EXT4, 120GB) Another option is to use wubi instead. What do you think? Is there any other way to achieve this? PS: I really think this HP policy of using 4 partitions is not a coincidence PS: I tried using gparted from the live CD and I got a warning message saying that if I freed some space from /dev/sda2 I could create serious issues in the system
|
My HTML is using a lot of js files (10 js files) including jquery js . There are 4 js files which are not needed instantly ,but later that is when clicked on some button . Could you please let meknow if is it possible to load js file at required time only ?? My html looks this way <html> <head> <script type="text/javascript" src="js/accordian/jquery-1.9.1.js"></script> <script type="text/javascript" src="js/accordian/jquery-ui.js"></script> <script src="js/bootstrap.min.js"></script> <script type="text/javascript" src="js/customerscreen_sub.js"></script> <script type="text/javascript" src="js/toppings.js"></script> <script type="text/javascript" src="js/crusts.js"></script> <script type="text/javascript" src="js/customerorders.js"></script> <script type="text/javascript" src="js/common.js"></script> <script type="text/javascript" src="js/url.js"></script> <script type="text/javascript">
|
How can you reliably and dynamically load a JavaScript file? This will can be used to implement a module or component that when 'initialized' the component will dynamically load all needed JavaScript library scripts on demand. The client that uses the component isn't required to load all the library script files (and manually insert <script> tags into their web page) that implement this component - just the 'main' component script file. How do mainstream JavaScript libraries accomplish this (Prototype, jQuery, etc)? Do these tools merge multiple JavaScript files into a single redistributable 'build' version of a script file? Or do they do any dynamic loading of ancillary 'library' scripts? An addition to this question: is there a way to handle the event after a dynamically included JavaScript file is loaded? Prototype has document.observe for document-wide events. Example: document.observe("dom:loaded", function() { // initially hide all containers for tab content $$('div.tabcontent').invoke('hide'); }); What are the available events for a script element?
|
A cashier’s till has a large number of pennies, nickels, dimes, and quarters. In how many ways can 10 coins be chosen from the till?
|
I have a problem that I am unable to solve. I spent too much time on this one and I think I miss something. An ice-cream-shop has 11 flavors of ice-cream. In how many ways can one person choose 6 cornets with flavors not necessarily different?
|
If $x=a^2+b^2$ and $y=c^2+d^2$ how can i prove that xy is also the sum of two rational squares? My teacher told me there are various methods to attack this problem but an easy way is to use the norms of guassian integers but I can't see how it would help.
|
Given $a,b,c,d \in \mathbb{Z}$, there is $x,y$ such that $$(a^2 + b^2)(c^2 + d^2) = x^2 + y^2$$ One can show this by considering the complex number $a + bi$ and $c+ di$, using complex properties to deduce that $x = ac - bd, y = ad + bc$ is a solution. However, given that either $a^2, b^2$ are distinct or $c^2,d^2$ are distinct, then how can one can find nonzero solutions $x,y$? Sorry, I am assuming $a,b,c,d$ are nonzero.
|
I'm reading now "Inherit the Stars". In the book there is a expression like this: "Make it round about eleven thirty hours," Gray advised. Normally the "hours" is skipped, right? Is this expression right English? Or is it just kind of SF language?
|
I was reading a book and this sentence seemed a little odd to me: At approximately 19.45 hours the two men rose, stretched and yawned. They picked up their gear and stood at the door, ... What does the first part mean? If it's the exact time, shouldn't it be 19:45? And if it's duration, shouldn't it be "After 19.45 hours"? (The story here happens at an airbase, if it's of any relevance) Edit: The book I've quoted is this: by John Creed. The author is Irish and the text is set in northern England/Ireland.
|
I am on the Andriod SE app on the Galaxy S2 when the problem appeared. I was on this question and upvoted the current posts at that time. For some weird reason, it doesn't show that I upvoted the question but does show that I upvoted the answer as shown: As you can see, the upvote button will turn red when clicked, signifying that I did upvote the post. I thought that I might have undone the upvote, causing the red to disappear, so I tried upvoting it again. But at the top, it says "You have already voted on this question". Unknown vote now? Upvote button not red as normal now? Weird... So my question is, why isn't the upvote button red when I upvoted the question? EDIT: It is not a duplicate because I posted my question 4 months before the duplicate arrived.
|
Related: I am using 1.0.71 on KitKat. Immediately after voting, the arrow is displayed in red and the vote count is correct. However, when I scroll to read answers and then back to the top, the arrow is grey again and the vote count is reset to the previous value. A reload of the question (pulling the finger down) is needed to show the correct situation, which is kept from then on. This case was on security.stackexchange.com but I observed the same behavior on other sites too. Screenshots original state: upvoted: scrolled down and back up after a reload
|
Say I am renting an apartment for ~$1000 a month and I have a friend that needs a place to say. I let him stay on my couch and he pays me ~$999 a month. So I'm at a loss of $1 each month. Do I need to report this as income? He has stayed for more than 14 days (closer to 90), so from my understanding it's not a Tax Free rental. It's also my personal residence, and I'm operating at a net loss because my expense are higher than the revenue it's generating. Is it considered taxable income because I would be living in the apartment regardless of him needing a place to stay? I'm a bit unclear on how it works if there is not a lease in place. He's just giving me some money each month. And I'm also technically losing money, but I don't want to owe a bunch in taxes later because of a mistake.
|
I'm currently renting a 2/2 apartment in the US that is managed by a REIT (NYSE:MAA). I set it up in which I am the sole responsible lease holder and have added a roommate to the lease as an occupant (not responsible for the rent). However, I am collecting rent from this roommate to make the rent payments. The office staff here is aware of it as they made note that if they don't make the rent, I am solely liable. I'm aware of this and comfortable with it. I don't expect any problems from the management company. The question I have is, what (if any) are the tax implications of my receiving money in the form of monthly rent transferred to my checking account to then be paid to the apartment management company in the form of EFT? If this money needs be declared as some form of income, what would be the best way to do so, and through what means should I be keeping records? Thank you for any insight.
|
I have Win 10 running on a VM on Hyper-V, on my server (Windows 10). I disable the Windows update from the services on the virtual machine. The server where the virtual machine is installed must restart itself every 2 days. After restart, the windows update settings on the virtual server has automatically changing as Manual. I couldn't figure why is doing this. How can I completely disable to windows update on virtual server ?
|
We've upgraded some machines to Windows 10 and realized there were some updates which updated as required. However, I realized there was no option available to stop the download similar to that on Windows 7 and 8.1. The only way I could stop the download was to stop the Windows Update service. My question is does anyone know of a way to stop auto updates or is stopping the service is the only solution?
|
I am using the RSA crytposytem. I have $p$, $q$ and hence $n$ and $\phi$ however I don't understand how to get $e$ such that $gcd(e,\phi)=1$ Many thanks
|
I'm learning RSA in one of my classes and we were given a problem: $p = 5$, $q = 11$ I have done the following steps: $n = 5 \cdot 11 = 55$ $\phi = (5-1)\cdot(11-1) = 40$ I know that to find $e$ we have to find an integer co-prime with $\phi$, where $\phi$ is $40$ and $\gcd(e,40) = 1$. Is there an algorithm I can use by hand that can give me $e$? I know there can be numerous values. The method the professor has shown is to just enumerate each prime and find the first divisible into the totient $\phi$. I assume he will give us small numbers in the exam but still, doing it by trial and error can be time consuming. I understand one can use extended Euclids algorithm to find the inverse of $e$, which I can do provided I know what $e$ is. I just struggle with finding $e$.
|
I have tried simplifying in every way I can think of, but I just can't seem to figure this out. I am asked to find the following limit: $$\lim_{n\to \infty} \sqrt[3]{n^3+n^2}-\sqrt[3]{n^3+1}$$
|
$$\lim_{n\rightarrow\infty}\sqrt[3]{n^3+n^2}-\sqrt[3]{n^3+1}\rightarrow\frac{1}{3}$$ I tried to say we can erase the $1$ from the equation, as it's a constant. But I don't know how to do the rest without running into this mistake: $$\lim_{n\rightarrow\infty}\sqrt[3]{n^3+n^2}-n=\frac{\sqrt[3]{\frac{n^3}{n^3}+\frac{n^2}{n^3}}-\frac{n}{n}}{\frac{1}{n}}=\frac{1-1}{0}$$
|
I recently bought a HP-BW088AX Laptop from Amazon. I initially installed Kali Linux on it because I wanted to learn penetration testing and hacking, but as I was new to Linux I decided to go for a more user-friendly distro. So I dual booted my laptop with Ubuntu. After I installed Ubuntu I had to face some issues with the inbuilt wireless card. I had faced similar issues with Kali Linux but I got them solved. The problem was that the OS wasn't detecting the inbuilt wireless card which is a Realtek RTL8723DE chipset. I installed the drivers for it from here , consequently the wireless card was detected but the signal was very weak. So I started finding a solution on the internet and I found this : Output of lspci: 03:00.0 Network controller: Realtek Semiconductor Co., Ltd. Device d723 This solution worked for Kali Linux which is also a debian based distro but the same is not working for Ubuntu. But it is not working in Ubuntu. Everything works fine until I run this command : sudo modprobe -rv rtl8723de ant_sel=2 I get the following output : modprobe: FATAL: Module ant_sel=2 not found. I didn't face this issue in Kali Linux. I have Ubuntu 18.04.02 LTS. Processor : AMD® A9-9420 radeon r5, 5 compute cores 2c+3g × 2 Graphics : AMD® Stoney GNOME : 3.28.2 Any help would be appreciated a lot. Thanks in advance.
|
How do I install Wi-Fi drivers for Realtek RTL8723DE device in Ubuntu 16.04? lspci -v | grep -i network 02:00.0 Network controller: Realtek Semiconductor Co., Ltd. Device d723
|
I am trying to troubleshoot a network connection. The connection is through an Ethernet cable, that goes all the way from my computer to my modem/router combo. What happens is that, with increasing frequency over time, my internet becomes unbearable: the ping jumps into the 300s, both download and upload speed fall dramatically. Initially I thought it'd be a router problem, since my old one was outdated to say the least. A man from my ISP came and switched it for a newer model and everything seemed fine for a couple of days, but then the problem came back and it hit harder. I decided to ping a reliable server, ping google.com -t during one of these phases using this same computer, and this was the result. I'm at a loss for what can be done. Should I be complaining? What should I do? When I ping my home router from the computer the response is instant all the times. Imgur album with all the details:
|
In our home network, with continuous network IO happening latencies get ridiculous. It's fine with light loads but quickly becomes unusable if I'm, say, rsyncing a large number of small files, --other transfers essentially stop. Pings get through just barely. Simple topology -- a broadband modem / WIFI router in a single box, with some wireless and some wired clients. I've tried setting ifconfig wlan0/eth0 txqueuelen 1 on all clients, this seems to help a bit but not by much. Tips welcome: how should I go about diagnosing and eliminating latency problems? Are there more configuration settings I can set on clients, or maybe a better WIFI routers could help?
|
I am working out of Calculus by Spivak (4th ed.) and have come across a question which I would like some further insight on. If $a$ and $b$ are both irrational, is $a+b$ necessarily irrational? I have already proved that if $a$ is rational and $b$ is irrational then $a+b$ is irrational. Thanks in advance!
|
If $x$ and $y$ are irrational, is $x + y$ irrational? Is $x - y$ irrational?
|
has a loyalty ability which says: Place three 1/1 white soldier creature tokens onto the battlefield. When this ability is activated, do these soldiers have summoning sickness? I ask because Elspeth herself does not have summoning sickness when placed onto the battlefield.
|
Note: this is intended to be a canonical question about summoning sickness. "Summoning sickness", broadly, is the rule that stops you from attacking or paying {T} costs with a creature that you just played. But how exactly does it work? How does it interact with other rules and effects? For example, if I'm trying to figure out how a creature is affected: Does the status matter (tapped/untapped, face down/face up, etc.)? What if it came into play, but I didn't cast it? What if it's a token? What if it was on the battlefield when my turn started, but it wasn't a creature? What if it stops being a creature? What if it's a creature and also another card type? What if it's a double-faced card that just transformed? What if it changes control? What if it's a copy of another creature? Which of the creature's activated abilities can I use? Are any of its other abilities affected? Can I tap the creature to pay a cost that is not a {T} cost? (These examples are primarily taken from questions about summoning sickness that have already been asked on the site)
|
Let $(P_t)_{t \geq 0}$ be a Poisson process with $\lambda > 0$. I want to show that $\mathbb{E}(P_s|P_s) = P_s$. I compute $$\mathbb{E}(P_s|P_s) = \sum_{x \in \text{Img}(P_s)} x \cdot \mathbb{P}(P_s = n|P_s = k) = \sum_{n=0}^{\infty} n \cdot \frac{\mathbb{P}(P_s = n \cap P_s = k)}{\mathbb{P}(P_s = k)}$$ Here I am stuck, since I don't basically don't know how to compute $$\mathbb{P}(P_s = n|P_s = k) = \frac{\mathbb{P}(P_s = n \cap P_s = k)}{\mathbb{P}(P_s = k)}$$
|
My intuition told me E(X|X) is X. However,I get stuck when when I try to evaluate it from the definition. How do I define f(X|X) ? would it be constant? Thanks for your help.
|
I have been reading some Boku no Hero Academia and in some chapters (only very few) there have been panels, which looked like sketches and not like the rest of the manga. Since it were only single panels, I didn't think much of it. But while reading chapter 182, there have been whole pages like that (s. picture below). Did the artists run out of time and so, they weren't able to complete all pages? Or is there a different reason for this? )
|
First of all, I have to say I read this on some scanlated site. But there are quite a few page that look unfinished. Here are some of the rough page I found. Top pictures, From Historie 80 and 94. Bottom Pictures, Historie 82, 96, and 97. (Click to enlarge pictures) Noticed that . If they want a shadow building they can do it better. At first all panel are finished but later, probably after chapter 80, they begin having unfinished drawing. Hitoshi Iwaaki other manga series doesn't have this kind of drawing style.
|
Why do many Star Trek fans insist that Trelane could have been from the Q Continuum, when he needed a device to enhance his powers?
|
Few characters in Star Trek are known by their name only, with zero knowledge of the species to which they belong. Some examples are Trelane, Nagilum, and the Edo god. "The Squire of Gothos" gives us Trelane, a powerful being that many have considered to be a Q. I personally don't believe that this is the case---Q-Squared is not canon---and the TOS episode shows that Trelane has weaknesses that members of the Q do not have. Undoubtedly Trelane does not belong to any of the other species in the Star Trek canon. Based on the evidence, though, what species could Trelane belong to? A) Trelane states that his people have found a way to perfect the converting of matter into other forms (words to that effect). B) Trelane is not omniscient. C) Trelane has respect for Captain Kirk's crew, and humanity in general (another reason why Trelane is not a good candidate for the Q). D) Trelane enjoys "playing" with the crew of the Enterprise, and has no problem judging Captain Kirk, and scheduling his execution. E) Trelane's creations are not illusions, but they are not perfect, either (the fire has no heat, for example). F) Trelane apparently required the use of a machine to help him with his effects, though this may have been for show.
|
How can I pass an optional parameter to a PHP function. For example function test($required, $optional){..} So that i should be able to call the function by passing either one parameter or both. For example: test($required, $optional) test($required); Thanks.
|
In the PHP manual, to show the syntax for functions with optional parameters, they use brackets around each set of dependent optional parameter. For example, for the function, the manual reads: string date ( string $format [, int $timestamp = time() ] ) Where $timestamp is an optional parameter, and when left blank it defaults to the function's return value. How do you go about creating optional parameters like this when defining a custom function in PHP?
|
Why does the following Query in SQL return true?? I expected it to be false as it cannot be converted into an int or numeric value select ISNUMERIC(',') return 1??? select ISNUMERIC('0,1,2') select ISNUMERIC(',,,') also returns 1 What could I do for strict numeric checking in SQL?
|
Why would the following query return "Error converting data type varchar to bigint"? Doesn't IsNumeric make the CAST safe? I've tried every numeric datatype in the cast and get the same "Error converting..." error. I don't believe the size of the resulting number is a problem because overflow is a different error. The interesting thing is, in management studio, the results actually show up in the results pane for a split second before the error comes back. SELECT CAST(myVarcharColumn AS bigint) FROM myTable WHERE IsNumeric(myVarcharColumn) = 1 AND myVarcharColumn IS NOT NULL GROUP BY myVarcharColumn Any thoughts?
|
I have come across two different terms regarding Area Under Curve (AUC): ROC AUC: The Area Under an ROC(Receiver operating characteristic) Curve AUPRC: The Area Under Precision-Recall Curve Are they talking about the same things? If not, do they share similar values for all possible datasets? If still not, an example of dataset where ROC AUC and AUPRC strongly disagrees would be great.
|
I have two methods/classifiers (completely different models) that I need to decide which one is better. The dataset is imbalanced. I trained both classifiers on the same dataset and then I computed the ROC-AUC and the Precision-Recall-AUC (PR-AUC). Then the surprise came! Method 1 is better than method 2 when I compare them using ROC-AUC. Method 2 is better than method 1 when I compare them using PR-AUC. Now I'm so confused! How to say which method is better? As far as I know from that if the ROC-AUC is high, then PR-AUC is also high. So if the ROC curve of method-1 dominates, so should method-1's PR curve. Is my understanding incorrect? Or am I missing something? Because I'm really going crazy!
|
I was wondering if there was a way to pass arguments to first class functions in javascript. For example, I am trying to pass the function as a parameter to a higher order function, but the first class function takes an argument: document.addEventListener("keydown", myFunc); But I want to do this without calling the first class function: document.addEventListener("keydown", myFunc(arg1));
|
The situation is somewhat like- var someVar = some_other_function(); someObj.addEventListener("click", function(){ some_function(someVar); }, false); The problem is that the value of someVar is not visible inside the listener function of the addEventListener, where it is probably being treated as a new variable.
|
When I run grep like this, I can see the matches as expected: $> echo -ne 'foo\nfoo\n' > file_a $> grep -Hn foo file_a file_a:1:foo file_a:2:foo But when I create a file with carriage returns in it, grep gives me unexpected output: $> echo -ne '\x0dfoo\x0dfoo\nfoo\n' > file_b $> grep -Hn foo file_b fooe_b:1: file_b:2:foo Can anyone explain why it gives this output?
|
I am using grep to recursively look through files and pull out all strings matching a pattern. I want to print the file path: matched string. -H should print the file path for each entry -o should print just the matched string, omitting everything else on the line I don't want -r recursive search. I run: grep -Hro [pattern] . Most of the matches print with the filename, however a few just print the matched string. Are -H and -o mutually exclusive in that -o is trimming the filename? Sample Output: ./path/foo.txt: foo ./path/bar.txt: foo ./path/baz.txt: foo foo ./path/baz.txt: foo The 4th foo match should also have a file associated with it, but it is not being printed. I am getting behavior similar to this , however I am using the -H flag, and the "/dev/null" solution does not work either. $ grep --version grep (BSD grep) 2.5.1-FreeBSD EDIT: After further exploring each match where the regex was not getting the file name, they all occur when two strings are matched on the same line. For example this text file foo foo sometext foo foo Outputs ./path/foo.txt: foo ./path/foo.txt: foo foo ./path/foo.txt: foo Anyone know a solution to get both matches to print a filename?
|
I'm scraping news articles from various sites, using GAE and Python. The code where I scrape one article url at a time leads to the following error: UnicodeDecodeError: 'ascii' codec can't decode byte 0xe2 in position 8858: ordinal not in range(128) Here's my code in its simplest form: from google.appengine.api import urlfetch def fetch(url): headers = {'User-Agent' : "Chrome/11.0.696.16"} result = urlfetch.fetch(url,headers) if result.status_code == 200: return result.content Here is another variant I have tried, with the same result: def fetch(url): headers = {'User-Agent' : "Chrome/11.0.696.16"} result = urlfetch.fetch(url,headers) if result.status_code == 200: s = result.content s = s.decode('utf-8') s = s.encode('utf-8') s = unicode(s,'utf-8') return s Here's the ugly, brittle one, which also doesn't work: def fetch(url): headers = {'User-Agent' : "Chrome/11.0.696.16"} result = urlfetch.fetch(url,headers) if result.status_code == 200: s = result.content try: s = s.decode('iso-8859-1') except: pass try: s = s.decode('ascii') except: pass try: s = s.decode('GB2312') except: pass try: s = s.decode('Windows-1251') except: pass try: s = s.decode('Windows-1252') except: s = "did not work" s = s.encode('utf-8') s = unicode(s,'utf-8') return s The last variant returns s as the string "did not work" from the last except. So, am I going to have to expand my clumsy try/except construction to encompass all possible encodings (will that even work?), or is there an easier way? Why have I decided to scrape the entire html, not just the BeautifulSoup? Because I want to do the soupifying later, to avoid DeadlineExceedError in GAE. Have I read all the excellent articles about Unicode, and how it should be done? Yes. However, I have failed to find a solution that does not assume I know the incoming encoding, which I don't, since I'm scraping different sites every day.
|
I received some text that is encoded, but I don't know what charset was used. Is there a way to determine the encoding of a text file using Python? deals with C#.
|
I am getting this error although I have added all the the libraries and dependencies as jar files. Error shows like this : Exception in thread "main" java.lang.NoClassDefFoundError: com/google/common/base/Function at chrome_browsertest.main(chrome_browsertest.java:10) Caused by: java.lang.ClassNotFoundException: com.google.common.base.Function at java.net.URLClassLoader.findClass(URLClassLoader.java:381) at java.lang.ClassLoader.loadClass(ClassLoader.java:424) at sun.misc.Launcher$AppClassLoader.loadClass(Launcher.java:331) at java.lang.ClassLoader.loadClass(ClassLoader.java:357) ... 1 more
|
I am trying to do this: Below is the screenshot taken from eclipse package com.stack.tests; import org.openqa.selenium.WebDriver; import org.openqa.selenium.firefox.FirefoxDriver; import org.openqa.selenium.firefox.FirefoxProfile; public class PerformanceTesting { public static void main(String[] args) { FirefoxProfile profile = new FirefoxProfile(); WebDriver driver = new FirefoxDriver(profile); driver.quit(); } } Below is the error code taken while running: E:\stackoverflow\src\test\java\com\stack\tests>javac -cp selenium-serv er-standalone-2.52.0.jar PerformanceTesting.java E:\stackoverflow\src\test\java\com\stack\tests>set classpath=%classpat h%;.; E:\stackoverflow\src\test\java\com\stack\tests>java -cp .;selenium-ser ver-standalone-2.52.0.jar PerformanceTesting Exception in thread "main" java.lang.NoClassDefFoundError: PerformanceTesting (w rong name: com/stack/tests/PerformanceTesting) at java.lang.ClassLoader.defineClass1(Native Method) at java.lang.ClassLoader.defineClass(Unknown Source) at java.security.SecureClassLoader.defineClass(Unknown Source) at java.net.URLClassLoader.defineClass(Unknown Source) at java.net.URLClassLoader.access$100(Unknown Source) at java.net.URLClassLoader$1.run(Unknown Source) at java.net.URLClassLoader$1.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at java.net.URLClassLoader.findClass(Unknown Source) at java.lang.ClassLoader.loadClass(Unknown Source) at sun.misc.Launcher$AppClassLoader.loadClass(Unknown Source) at java.lang.ClassLoader.loadClass(Unknown Source) at sun.launcher.LauncherHelper.checkAndLoadMain(Unknown Source) Does somebody know how to fix it?
|
I conducted binary logistic regression analysis (DV is measured in yes, no). Among my IVs, One IV is about partnership measured in dichotomous (yes, no) and another IV is population density and measured as (Low=1, average =2, high (reference group) =3). The output shows that: For partnership: $\beta$ value of partnership(1) is .795 while it is significant. For population density: $\beta$ values are: low(1) = -.976, average = -.641 I need your help on how to interpret beta values especially the negative signs
|
I am currently reading a concerning voting location and voting preference in the 2000 and 2004 election. In it, there is a chart which displays logistic regression coefficients. From courses years back and a little , I understand logistic regression to be a way of describing the relationship between multiple independent variables and a binary response variable. What I'm confused about is, given the table below, because the South has a logistic regression coefficient of .903, does that mean that 90.3% of Southerners vote republican? Because of the logistical nature of the metric, that this direct correlation does not exist. Instead, I assume that you can only say that the south, with .903, votes Republican more than the Mountains/plains, with the regression of .506. Given the latter to be the case, how do I know what is significant and what is not and is it possible to extrapolate a percentage of republican votes given this logistic regression coefficient. As a side note, please edit my post if anything is stated incorrectly
|
I'm reading through Introduction to and I got stuck on the following recurrence (exercise 4.4-5): $$T(n) = T(n - 1) + T(n/2) + n$$ The exercise asks you to find the upper bound using the recurrence-tree method. I tried drawing one. It would have $2^n$ leafs if it was a complete binary tree (the height is $n$), but it is not. Furthermore, I cannot find a formula that expresses the complexity of each level like they do in the book. After writing some code to calculate $T(n)$ and comparing it with different functions, I end up thinking that the complexity is exponential. Using $c2^n$ with the substitution method works out, but I'm not certain that this is a tight bound. I'm not certain that the tight bound is exponential either. Can somebody help me out through the reasoning? P.S.: If it matters, I'm not in school/university and this is not homework. I'm a (let's say) Ruby programmer who is self-studying to fill in his gaps in Computer Science.
|
Using the recursion tree i tried solving this: $T(n)=T(n-1)+T(\frac{n}{2})+n$; the tree has two parts (branches) one that of $T(n-1)$ and other branch is of $T(\frac{n}{2})$. But as the term T(n-1) reach higher depth, I solved that part of the tree. Finally it resulted in O$(2^n)$ is it correct or is it $O(n^2)$? How can we solve it by substitution method?
|
Let θ be the orientation (angle) of a body (such as a cat), and let ω be its angular velocity. It is well-known that θ can change even when the body is not rotating, using the conservation of angular momentum; that is, even when ω = dθ/dt = 0. That's how cats land on their feet so well. But how can θ possibly ever change, when its derivative is zero?! What's wrong with the math?
|
To explain why a falling cat can turn by 180 degree without external torque and without violation of the conservation of angular momentum, one usually models the cat as two cylinders as in This may explain the turn. However I often heard contrary to this that she can rotate her body simply because she rotates her tail very fast into the opposite direction (and essentially keeps the rest of the body rigid). So, what effect does the tail have in reality? Is there any detailed model, which takes the tail rotation into account and calculates how large its effect is?
|
So basically I bought a new tower for my computer from eBay and it already had Ubuntu installed on it. I'm not a huge fan so I went out and bought Windows 8.1. When I tried to install it, it said "Where would you like to install Windows?" I had 2 partitions to choose from and when I tried both of them, it said they needed to be in the format of NTFS. When I try to format my hard drive from ext4 to NTFS it comes up with this message: Error unmounting filesystem Error unmounting /dev/sda1: Command-line `umount "/dev/sda1"' exited with non-zero exit status 1: umount: /: device is busy. (In some cases useful info about processes that use the device is found by lsof(8) or fuser(1)) (udisks-error-quark, 14 How do I stop this and successfully format my hard drive? Please help.
|
I'm trying to install Windows 7 with a 4GB flash drive, but my error that comes up is that my hard drive I'm trying to install on is in ext4. I need to format it to read NTFS. I can't seem to find any topics on how to format an active hard drive. I found a topic that explains how to move Ubuntu to a new drive, but it's a bit confusing to me.
|
Let $$f(x)=\frac{1}{16}(e^{\arctan(\frac{x}{7})} + \frac{x}{7})$$ You are given that $f$ is a one-to-one function and its inverse function $f^{-1}$ is a differentiable function on $\mathbb{R}$. Also $f(0)=\frac{1}{16}$. What is the value of $(f^{-1})'(1/16)$?
|
Let $f\left(x\right)=x^{13}+3x^{9}+2x^{5}+x^{2}+x+2$ find $\left(f^{-1}\right)'\left(1\right)$. Can somebody show me the method? I am a little confused.
|
prove the following identity: $\displaystyle\sum_{k=0}^{n}\frac{1}{k+1}\binom{2k}{k}\binom{2n-2k}{n-k} = \binom{2n+1}{n}$ what I tried: I figured that: $\displaystyle\binom{2n+1}{n} = (2n+1) C_n$ and $\displaystyle\sum_{k=0}^{n}\frac{1}{k+1}\binom{2k}{k}\binom{2n-2k}{n-k}= \sum_{k=0}^{n}C_k\binom{2n-2k}{n-k}$ from here i tried simplifying:$\displaystyle\binom{2n-2k}{n-k}$ to something i could work with but did not succeed I also know that $\displaystyle C_n = \sum_{k=0}^{n-1}C_k C_{n-k-1}$ so I tried to prove : $\displaystyle\sum_{k=0}^{n}C_k\binom{2n-2k}{n-k}= C_n + \sum_{k=0}^{n-1}C_k\binom{2n-2k}{n-k} = C_n + 2n\sum_{k=0}^{n-1}C_kC_{n-k-1}$ but that approach also failed (couldn't prove the last equality) any suggestions?
|
I need to prove this identity: $\sum_{k=0}^n \frac{1}{k+1}{2k \choose k}{2n-2k \choose n-k}={2n+1 \choose n}$ without using the identity: $C_{n+1}=\sum_{k=0}^n C_kC_{n-k}$. Can't figure out how to.
|
How does the really work conceptually? Very often I hear something like: When a decision is made, there is this splitting of the Universes. Each outcome happens but each in a different Universe. So let's take the old Schrodinger's cat experiment. Suppose I decide to make this kind of experiment. Is there an exact version of me in another Universe that is preparing to perform exactly the same experiment, in exactly the same location, with the same conditions etc? Is looking inside the box what causes the splitting? Or this Universe does not exist before my measurement? But if it does not exist, how is it created? Is every measurement creating a new Universe?
|
When I read descriptions of the many-worlds interpretation of quantum mechanics, they say things like "every possible outcome of every event defines or exists in its own history or world", but is this really accurate? This seems to imply that the universe only split at particular moments when "events" happen. This also seems to imply that the universe only splits into a finite number of "every possible outcome". I imagine things differently. Rather than splitting into a finite number of universes at discrete times, I imagine that at every moment the universe splits into an uncountably infinite number of universes, perhaps as described by the Schrödinger equation. Which interpretation is right? (Or otherwise, what is the right interpretation?) If I'm right, how does one describe such a vast space mathematically? Is this a Hilbert space? If so, is it a particular subset of Hilbert space?
|
At some moment I asked this question: It's still near and dear to my heart and based on reasonable amount of upvotes, there are people who think along the same lines with me. However, this question only got two answers which were both downvoted. What should I do with questions like that? Should I try to bump them (by editing them) or should I let me go (taking into account that they won't super highly up voted). BTW. I understand that there will be here. As soon as I mentioned that post, there will be some influx of comments, answers. However, I want to understand broader picture here - what people do with such type of questions/suggestions.
|
I asked a question almost as soon as I got my account. I got a few decent answers, but none of them helped solve my problem. The question has long since become buried by newer questions, and there's still no accepted answer. Unfortunately, because there are quite a few answers with votes, to a casual observer it probably looks like the question was answered and I just neglected to mark an answer as accepted, and the system does not consider it "unanswered". Or, I asked a question that was a bit more difficult to answer. After waiting for some time, I received no answers, little or no comments, and only a few views. The question does show up in the "unanswered" list, but no one has answered my question. In either case, what's the protocol for me to try to get this question answered? I see several options: Post the question a second time, possibly linking to the original, to get attention for the original question. This is encouraged on sites like Reddit. However, it's probably not appropriate here, since we're encouraged to check for duplicates and not submit a question that's already been asked by someone else, so this probably falls under that heading. Wait for some kind of wiki-like talk page to be implemented, then post a plea on the talk page for input and hope that activity on the talk page bumps up the question. Edit the question, but do nothing further on the Stack Exchange site. If I edit my post to say that I haven't accepted any of the current answers but am looking for more, then the question might get answered eventually by people browsing through old questions to find something they can answer. Post the question on other sites, but link to my original question on Stack Exchange. People will either answer here, or they'll answer on the other site and I can post the accepted answer here myself. This might be considered spamming, so it might be better to do this without the link. For more information, see the "" page in the .
|
I am using filter criteria in views for displaying data based on the input selected by the user. Actually the drop down values in filters are node values of two content types.When I add content to those respective content types the drop down values are updating but in filter criteria configuration the newly added node values are not being checked as shown below diagram Even though the above node value is not being checked, the same value is being added to particular drop down as shown below. If I check all values individually and manually and check the option Limit list to selected items the error not displaying but the problem is when I am adding another node value (for example LOS3) the drop down values are not updating. I have googled it for this error and I have applied some patches which worked for some of them but no result. How to overcome this issue?
|
I am having a very odd problem with an exposed filter in one of my Views. The page I am talking about is here: When I select one of the last 2 options in the menu (EPS Packaging Recyclers or Loose Fill Recycling Drop-off) I get an error that says An illegal choice has been detected. Please contact the site administrator. This is really weird to me because it only happens with these 2 options. I don't believe they are set up any differently than the other taxonomy terms. There's nothing all that special about them, its just a term that the admin selects when creating a location for the map. Any ideas as to why this is happening or how to fix it?
|
Let $f$ be a continuous mapping of a metrizable space $(X,\tau)$ onto a topological space $(Y,\tau_1)$ . Is $(Y,\tau_1)$ necessarily metrizable ?
|
I noticed this problem on a previous exam that I completely missed, and I was wondering if anyone could help me out. Suppose $f: Y \rightarrow X$ is a continuous mapping of a separable metric space $Y$ onto a compact Hausdorff space $X$. Show that $X$ is metrizable. Furthermore, give an example of a continuous mapping of a separable metric space onto a mon-metrizable Tychonoff space. Any help would be greatly appreciated!
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.