body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
How can we prove that surface integral of the electric fieldfor a point charge that is outside a gaussian surface, $$\int\mathbf E\cdot\,\mathrm d\mathbf S,$$ without actually using the concept of flux?
|
On a similar note: when using Gauss' Law, do you even begin with Coulomb's law, or does one take it as given that flux is the surface integral of the Electric field in the direction of the normal to the surface at a point?
|
I import photos through Lightroom, and I'd like to tag them with GPS coordinates, can someone suggest a good workflow for this? Years ago, I used to get GPS tracks from my Google Location History, then run a tool to automatically apply tags to these photos, but those scripts are likely obsolete.
|
Google know where we are 24/7. If my camera does not have built-in GPS, but I would like to geotag my photos, is it possible to use the location history to automatically tag photos with my GPS coordinates at the time they were taken? If so, how? I am not asking with which to tag photos.
|
Going through solutions of IMO'09. Bumped into a without-loss-of-generality assumption that I can't comprehend. Here's the statement of the problem: Let $a,b,c$ be positive real numbers such that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=a+b+c$. Prove that $$ \frac{1}{(2a+b+c)^2}+\frac{1}{(2b+c+a)^2}+\frac{1}{(2c+a+b)^2}\leq\frac{3}{16}. $$ Here's how they start in the solution: We prove the homogenized inequality $$ \frac{(a+b+c)^2}{(2a+b+c)^2}+\frac{(a+b+c)^2}{(2b+c+a)^2}+\frac{(a+b+c)^2}{(2c+a+b)^2}\leq\frac{3}{16}(a+b+c)\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right) $$ for all positive real numbers $a,b,c$. Without loss of generality we choose $a+b+c=1$. Thus, the problem is equivalent to prove for all $a,b,c>0$, fulfilling this condition, the inequality $$ \frac{1}{(1+a)^2}+\frac{1}{(1+b)^2}+\frac{1}{(1+c)^2}\leq\frac{3}{16}\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right). $$ And so on... If someone's interested in the rest, it's problem A2, solution 2 in this pdf: Why is there no loss of generality in such a choice of $a,b,c$?
|
Refer to the problem below (IMO 2009 Shortlist) Let $a, b, c$ be positive real numbers such that $$\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = a + b+ c$$ Prove that $$\frac{1}{(2a+b+c)^2} + \frac{1}{(2a+b+c)^2} + \frac{1}{(2a+b+c)^2} \leqslant \frac{3}{16} $$ In the solution given by the (Pg 16), it states that Without loss of generality, we choose $$a +b+c = 1$$. Thus, the problem becomes $$ \frac{1}{(1 + a)^2} + \frac{1}{(1 + b)^2} +\frac{1}{(1 + b)^2} \leqslant \frac{3}{16}(\frac{1}{a} + \frac{1}{b} + \frac{1}{c})$$ Applying Jensen’s inequality to the function $$f(x) = \frac{x}{ (1+ x)^2}$$ ,which is concave for $0 ≤ x ≤ 2$ and increasing for $0 ≤ x ≤ 1$, we obtain $$α \frac{a}{(1 + a)^2} + β \frac{b}{(1 + b)^2} + γ \frac{c}{(1 + c)^2} \leqslant (α + β + γ) \frac{A}{(1 + A)^2}$$ , where $A =\frac{αa + βb + γc}{α + β + γ}.$ Choosing $α = \frac{1}{a} , β =\frac{1}{b},$ and $γ = \frac{1}{c}$ , we can apply the harmonic-arithmetic-mean inequality $$A =\frac{3}{\frac{1}{a} + \frac{1}{b} + \frac{1}{c}} ≤ \frac{a + b + c }{3} = \frac{1}{3} < 1$$ Finally we prove: $$ \frac{1}{(1 + a)^2} + \frac{1}{(1 + b)^2} +\frac{1}{(1 + b)^2} \leqslant ( \frac{1}{a} + \frac{1}{b} + \frac{1}{c}) \frac{A}{(1 + A)^2} \leqslant ( \frac{1}{a} + \frac{1}{b} + \frac{1}{c})\frac{A}{(1 + \frac{1}{3})^2} = \frac{3}{16}(\frac{1}{a} + \frac{1}{b} + \frac{1}{c}) $$ However, (Pg 4) differs by having $a +b+c=3$ and setting $f(x) = \frac{1}{16x} - \frac{1}{(x+3)^2}$ and allowing Jensen to resolve the rest. The questions are as follows; How do you choose before hand which $a + b+ c =$ to choose? Why particularly does the assumption differ between the 2 solutions? How does one know before hand the choosing of $α = \frac{1}{a} , β =\frac{1}{b},$ and $γ = \frac{1}{c}$? Where and how did $A =\frac{αa + βb + γc}{α + β + γ}$ come from? Any help would be much appreciated.
|
I have two different Data Extensions, one (let's call it A) has a primary key of Email Address, with an associated field of Preferred Store Number, and the second (B) has a primary key of Store Number, with fields of address, phone, hours associated with it. Is it possible for me to lookup the store number associated with an email address from DE A within an email, but then in the body of the email, populate info from DE B?
|
We have several data extensions that have data relationships with each other. How can I send an email using one data extension while pulling data from a second data extension to personalize my email with ampscript? I've tried Lookup in many different ways, but I've only managed to pull one specific row (the same row which is not personalized to each user) or all rows at once. I haven't been able to pull personalized data for each user. In practice, I want to pull data from a DE called "Survey". Each user has a specific ID and some users have an "AnswerID", which varies. I want to to create IF/THEN statements based on that AnswerID. Thanks, Sylvie
|
I was using ubuntu 13.10 alongside w-7. there was some broken packages on ubuntu so I decided to freshly install ubuntu. while installation I selected "erase ubuntu 13.10 and reinstall" . ubuntu reinstalled but my windows and whole partition got deleted annd entire disk is assigned to ubuntu only. there was some IMP data in that partition partition and I want to recover that data . so guys , can I recover that data and how . please help its urgent
|
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.
|
Over at the page, I saw the synonym "tag-merge --> retag-request": which was created by a deleted user - if their account wasn't deleted, it would have provided a hyperlink to their profile. But instead of showing their user ID under the "Creator" list, which is normally shown in place of their username for a deleted account, it just shows "anon". Why is this? My request: Can we show the user's ID number in place of "anon" under the "Creator" list, as is done everywhere else for a deleted account?
|
While browsing the I came across the synonym [vote-to-close] -> [closing] in which the creator is listed as "anon" — the username is not hyperlinked, just like how the user IDs of deleted users are listed in other places like in the list of close voters of a question, etc. If this really were a deleted user, then I would have expected their user ID to be shown, and not "anon". So, I checked using for data on the tag synonym. And sure enough, it shows that the deleted user with the ID 147263 created the synonym. To double-check, I looked up the and came across a bunch of synonyms created by "anon". Checking with , these were all created by the now deleted user with the ID 80. Similarly, in the there are several created by "anon", but says that these were created by the now deleted user with the ID 54262. Feature request: Show the user ID of the tag creator under the "Creator" column in the list of tag synonyms if the user is deleted, to be consistent with how posts and actions by deleted users are attributed everywhere else.
|
I am curious to know how exactly does the fiber optics works. I understand the basic concepts of the fiber optics communications but am curious to know if there is a way to send multiple signals in same core at the same time in the fiber optics? How is it possible? Is there a way you can send light of different wavelength and able to detect them at the rx end?
|
Can optical fibers transmit in both directions simultaneously? Both single mode fibers and multi mode? What about if they we choose non-interfering wavelengths?
|
Edit: Someone else recently posted about something similar, but there were no solutions. I posted this because I cannot yet comment or upvote that other thread, and want to give more context to the issue! I made a 2-column resume in Indesign, with different text frames for each different title/heading/collection of bullet points. When I highlight or select the text on the Adobe PDF I've exported (no changes in settings), it selects everything out of order. I blurred out the text bc it's not necessary, but in the picture below I clicked & dragged over just the red highlighted part, and it highlighted those other parts, too. That's the problem I'm having. Copy & pasting the whole document to a Google Doc causes everything to be out of order, as well. Currently, the PDF has the following: Text threading Putting each text layer in order of desired highlighting order (top to bottom, left to right) Grouping text by layer per column I found a couple other people with a similar problem, but no solution was found. Not sure if anyone knows how to fix this or has experienced this same thing. Thank you!
|
When highlighting text in a PDF exported from InDesign, the highlight doesn't select the text in the right order. How can I fix this?
|
The maildir has a specific format of the files laying underneath, e.g. 1549464014.9224_427.hostname:2,RS. In Debian environment copying this file over SSH without renaming is impossible or I don't know how. The question is how? NOTE: no renaming should be involved! The example output: [user@hostname ~]$ scp '1549464014.9224_427.hostname:2,RS' remote.server.com:/dest/dir/ 1549464014.9224_427.hostname:22: [Errno -2] Name or service not known The solution with quotation like in is not useful.
|
I am trying to copy a file that has colons and periods, e.g., with: scp "test.json-2014-08-07T11:17:58.662378" remote:tmp/ scp test.json-2014-08-07T11\:17\:58.662378 remote:tmp/ and combinations with file: scp "file:///home/.../test.json-2014-08-07T11:17:58.662378" remote:tmp/ My guess is that scp tries to interprete parts of the file as a server and/or port number. How do I avoid that? If I rename the file to test.json then scp test.json remote:tmp/ works ok, but not even scp test*62378 remote:tmp/works.
|
I need to work with 1394b equipment on a notebook, but 90% of the new notebook does not have 1394b port enough neither an Express Card 34 slot. That is why I need a USB 3.0 to 1394b device. I was able to find a USB 3.0 to GiGE only here: I wounder why it is so hard to find notebooks with Express Card 34! There should be a replacement to this slot!! :/ -- When I say adapter I mean an active convertor!!
|
I am in the process of buying a new laptop for video capture / editing, and it's proving difficult to find one at a decent price / spec that includes Expresscard for Firewire connectivity (which I really need). It does seem like Expresscard is on the way out based on what I've seen recently. Since the assumption seems to be that USB 3.0 is the heir apparent to Expresscard I was wondering what people's thoughts were on whether it should be possible to convert a Firewire input to USB 3.0. There don't seem to be any devices around at the moment that do this but is this because USB 3.0 is still in its infancy or because it's not practical / possible?
|
I just have a quick question. If I choose to factory reset my pc. (Lenovo Thinkpad Windows 10). Will Grub2 also be deleted, along with my Linux dual boot?
|
Currently, my computer is dual-booting Linux and Windows 7. A series of unfortunate events has led to me needing to restore Windows using a restore disc. I want to know if this can be done without formatting my entire hard drive, as I don't want to get rid of my Linux partition. That is, I want to reset Windows - which already has a partition on my hard drive - without affecting any of my other partitions on my drive.
|
By "pseudo ring homomorphism", I mean a map $f: R \to S$ satisfying all ring homomorphism axioms except for $f(1_R)=f(1_S)$. Even if we let this last condition drop, there are only two ring pseudo-homomorphisms from $\Bbb Z$ to $\Bbb Z[\omega]$ where $\omega$ is any root of unity, for example. They are the identity homomorphism and the "$0$ pseudo-homomorphism". I couldn't find a non-zero example. It is easy to conclude that $0=f(a)(1_S-f(1_R))$, so I know that the counterexample will have to be some $S$ with zero-divisors.
|
Let $R$ and $S$ be rings with unity $1_R$ and $1_S$ respectively. Let $\phi\colon R\to S$ be a ring homomorphism. Give an example of a non-zero $\phi$ such that $\phi(1_R)\neq 1_S$ In trying to find a non-zero $\phi$ I've done the following observation: Since for $\forall r\in R$ $\phi(r) = \phi(r\times1_R) = \phi(r)\times\phi(1_R)$ we must have that $\phi(1_R)$ is an identity of $\phi(R)$ but not an identity of $S$. We must therefor construct a $\phi$ that is not onto and which have this property. I can't come up with any explicit example though, please help me.
|
I have seen this many times. This time, I'm going to write it down and ask. Use the 10k tools, See an I may want to vote to delete. It shows has having 2 delete votes. Click the link. The answer shows no delete votes. Downvote the answer. It only shows the downvote. Refresh the page. Now I can see the 2 delete votes. Vote to delete it. Now it's deleted. So, what's up with that?
|
What circumstances can cause a question or answer to be deleted, and what does that actually mean? How can a post be deleted? When can't I delete my own post? Can I still see my post even after it's deleted? Can I see a list of my deleted posts? How can I undelete one of my posts? What does deletion mean for a post? How do votes to delete work? What are the criteria for deletion? What else should I know about deleted posts? If I flag my question with a request to delete it, what will happen? For more information, see the articles about and in the .
|
Under the tag I have seen many questions on earth-616. Are there any other versions of earth as well? How do they differ from each other?
|
I know that there are at least 3 Marvel Universes: Marvel Cinematic Universe - Has all of the main ongoing Marvel movies (1, 2) (1, 2, 3) (1, Age of Ultron) etc Marvel's Ultimate Universe - Has the other Marvel movies (1, 2, 3, Origins: Wolverine, First Class, The Wolverine, Days of Future Past) (1, 2) etc Main comic book continuity This is the big one, it contains etc Then there are apparently off-shoot Earths, continuities which deviate from the main continuity (Earth 616). How many Marvel Earths (Universes) are there? Further Reading:
|
Find the value of following function's integral with respect to x from 0 to 1 $$F(x)=\frac{\ln(1+x)}{1+x^2}$$
|
Possible Duplicate: $$\int_{0}^{1} dx\frac{\log(1+x)}{1 + x^2}$$ I am having a hard time deriving the answer, $\frac{\pi}{8} \log(2) $. I have tried Taylor expansion of both numerator and denominator, both seem too complicated and fruitless.
|
$ABCD$ is a parallelogram and $O$ is any point. The parallelogram $OAEB,OBFC,OCGD,ODHA$ are completed. show that $EFGH$ is a parallelogram.
|
In the following figure, $ABCD$ is a parallelogram, and $O$ is any point. Parallelograms $OAEB, OBFC, OCGD, ODHA$ are completed. Prove that $EFGH$ is a parallelogram. We can obtain a fairly trivial proof using affine geometry. As $OAEB, OBFC, OCGD, ODHA$ are parallelograms, $$\vec{A} + \vec{B} = \vec{O} + \vec{E} \implies \vec{A} + \vec{B} - \vec{O} = \vec{E} \tag1$$ $$\vec{C} + \vec{B} - \vec{O} = \vec{F}\tag2$$ $$\vec{D} + \vec{C} - \vec{O} = \vec{G} \tag3$$ $$\vec{D} + \vec{A} - \vec{O} = \vec{H}\tag4$$ Adding $(1)$ to $(3)$ and $(2)$ to $(4)$, we get, $$\vec{E} + \vec{G} = \vec{A} + \vec{B} + \vec{C} + \vec{D} - 2\vec{O} \tag5$$ $$\vec{F} + \vec{H} = \vec{A} + \vec{B} + \vec{C} + \vec{D} - 2\vec{O} \tag6$$ Clearly, $(5)$ and $(6)$ are equal, therefore, $$\vec{E} + \vec{G} = \vec{F} + \vec{H}$$ Therefore, $EFGH$ is a parallelogram. Can somebody give an elementary proof using Euclidean geometry? Also, I noticed that in my proof, nowhere did I use the fact that $ABCD$ is a parallelogram, but constructing an example, it was quickly clear that the result stated does not generalize to all quadrilaterals. How come? Is my proof incorrect?
|
The problem arises in the merge function at 'while(m.next!=null)'. It throws a "NullPointerException". public class Linked { node ptr1; node ptr2; void merge() { node m=ptr1; while(m.next!=null) m=m.next; m.next=ptr2; } void printmerged() { node m=ptr1; while(m.next!=null) System.out.print(m.data+", "); System.out.println(m); } }
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
I was able to solve $ \ln x = - x $ using Lambert's function. I was wondering how does one solve $ \ln x = x$ Does the solution even exist for this equation?
|
I am trying to find x values for points along the normal distribution curve, and I ended up with a problem that goes back to the method of solving $x = \ln x$. Right now, I have $\ln(a \mu) - \ln(10) = \frac {-1} {2a^2} $. This is not something I know how to solve. I tried Googling this type of problem and nothing came up. How does one solve for a variable both inside and outside of a natural logorithm, specifically in the example problem above? Could anyone explain how this could be done?
|
What will be the definite integration from 0 to inf of the cosine function $$\int_0^\infty\cos(r)\,\mathrm dr$$
|
What will be the formula for the following: $$\int_0^\infty \cos(x)dx.$$
|
I've got this same dang faucet, and it is leaky. There are some answers in the linked page, but there are some contradictory posts, so I thought I'd re-pose this query. There is nothing to unscrew or put a hex wrench into up top. Is the answer: pry with a screwdriver until handles are off? They're on there pretty good. Also, I'm not even sure what brand this guy is, so I'm fuzzy on exactly what cartridge to purchase to fix it.
|
My bathroom faucet is leaking around the base of my right handle. With previous faucets I've been able to use a set screw to loosen the handle and replace the washer. With these, though, I can't seem to pop off the faucet handle. Does anyone know how to remove this handle? Does anyone know the brand of this faucet? Update -- Nov 29th I've already tried to get those cap ends off. I tried to use some pliers and unscrew them, but couldn't remove it. I tried taking a small flat head and popping off the ends. Still nothing. It doesn't seem like the come off. I also tried unscrewing the handles, but they just don't see to turn for me. Also there is definitely no set screw on the handles. I've searched all around the faucet and found nothing indicating a set screw.
|
Question prompted by this comic:
|
I know that the Windows copy dialog (in Windows XP) stores the copy in memory first, and it is still copying after the dialog closes, so the time is off, but why is the estimation of the time it will take to make a copy so inaccurate, even when memory copying has been disabled (in Vista and Windows 7)? It seems so arbitrary! How does the whole copy procedure work, and why can't Windows estimate it correctly?
|
Some of my external drives (of various types, sizes, and age) can be ejected w/o any issue. Others refuse, saying they can't be ejected because "Finder is using it". I have to close the Finder window and open another window to eject these drives. Is there any reason--any settings that I can control--why this happens?
|
Sometimes, a volume refuses to eject because some program is using them. Sadly, Finder doesn't give the identity nor gives a way to solve the problem. So, how do you solve this problem in a clean way, without using a terminal ? Using the terminal, I may find a way to eject it, but it's not reliable. sudo lsof | grep volumeName certainly gives some information, but I don't feel like killing random processes in order to unmount a volume. Also, not everybody is willing to run command in a terminal. I also don't want to force eject the volume. I think we shouldn't have to force the ejection when we didn't initially run the program that locks the volume. Processes that are frequently involved are: mds and notifyd. Killing mds does not guarantee that the ejection of the volume will be possible. mds process is respawned after getting killed, and continues preventing the ejection of the drive. I also noticed that mds can be running and using files, and still not preventing the ejection of the volume, so I'm not even sure that it's mds fault.
|
private void button1_Click(object sender, EventArgs e) { DateTime dob = new DateTime(); textBox1.Text = dob.ToString(); int age; age = Convert.ToInt32(textbox2.Text); age = DateTime.Now.Year - dob.Year; if (DateTime.Now.DayOfYear < dob.DayOfYear) age = age - 1; } How to claculate the age from dob.This is my form1.cs.any ideas please
|
Given a DateTime representing a person's birthday, how do I calculate their age in years?
|
Whenever I am trying to fix the broken package it is throwing the following errors. Reading package lists... Done Building dependency tree Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required: libidl-2-0 libkeybinder0 liborbit2 libvte-common libvte9 linux-headers-4.13.0-32 linux-headers-4.13.0-32-generic linux-image-4.13.0-32-generic linux-image-extra-4.13.0-32-generic linux-signed-image-4.13.0-32-generic python-gconf python-gnome2 python-keybinder python-notify python-pyorbit python-vte Use 'sudo apt autoremove' to remove them. The following additional packages will be installed: kde-config-telepathy-accounts The following NEW packages will be installed: kde-config-telepathy-accounts 0 upgraded, 1 newly installed, 0 to remove and 45 not upgraded. 455 not fully installed or removed. Need to get 0 B/137 kB of archives. After this operation, 825 kB of additional disk space will be used. Do you want to continue? [Y/n] y (Reading database ... 408140 files and directories currently installed.) Preparing to unpack .../kde-config-telepathy-accounts_4%3a15.12.3-0ubuntu1_amd64.deb ... Unpacking kde-config-telepathy-accounts (4:15.12.3-0ubuntu1) ... dpkg: error processing archive /var/cache/apt/archives/kde-config-telepathy-accounts_4%3a15.12.3-0ubuntu1_amd64.deb (--unpack): trying to overwrite '/usr/share/accounts/services/google-im.service', which is also in package account-plugin-google 0.12+16.04.20160126-0ubuntu1 Processing triggers for libc-bin (2.23-0ubuntu10) ... Errors were encountered while processing: /var/cache/apt/archives/kde-config-telepathy-accounts_4%3a15.12.3-0ubuntu1_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)
|
For example: $ sudo apt-get install curl Reading package lists... Done Building dependency tree Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies: bsh : Depends: libjline-java but it is not going to be installed groovy : Depends: libjline-java but it is not going to be installed rhino : Depends: libjline-java but it is not going to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution). I get the same or similar errors when I attempt to install clojure1.3, leiningen, and several other packages. When I try the suggestion made in the error message, this is what happens: $ sudo apt-get -f install Reading package lists... Done Building dependency tree Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required: diffstat linux-headers-3.2.0-26-generic linux-headers-3.2.0-26 dh-apparmor dkms html2text libmail-sendmail-perl libsys-hostname-long-perl Use 'apt-get autoremove' to remove them. The following extra packages will be installed: libjline-java Suggested packages: libjline-java-doc The following NEW packages will be installed: libjline-java 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. 23 not fully installed or removed. Need to get 0 B/72.0 kB of archives. After this operation, 129 kB of additional disk space will be used. Do you want to continue [Y/n]? Y (Reading database ... 226243 files and directories currently installed.) Unpacking libjline-java (from .../libjline-java_1.0-1_all.deb) ... dpkg: error processing /var/cache/apt/archives/libjline-java_1.0-1_all.deb (--unpack): trying to overwrite '/usr/share/java/jline.jar', which is also in package scala 2.9.2-400 Errors were encountered while processing: /var/cache/apt/archives/libjline-java_1.0-1_all.deb E: Sub-process /usr/bin/dpkg returned an error code (1) $ sudo apt-get upgrade Reading package lists... Done Building dependency tree Reading state information... Done You might want to run 'apt-get -f install' to correct these. The following packages have unmet dependencies: bsh : Depends: libjline-java but it is not installed groovy : Depends: libjline-java but it is not installed rhino : Depends: libjline-java but it is not installed E: Unmet dependencies. Try using -f.
|
What is the difference between this: function Hero(options) { options = options || {} this.nickname = options.nickname || 'Default 1'; this.hp = options.hp || '50' } Hero.prototype.walk = function() { console.log('Hero walked'); } And this: function Hero(options) { options = options || {} this.nickname = options.nickname || 'Default 1'; this.hp = options.hp || '50' this.walk = function() { console.log('Hero walked') } } Are there any significative gains in using prototype?
|
What's the difference between var A = function () { this.x = function () { //do something }; }; and var A = function () { }; A.prototype.x = function () { //do something };
|
Is there any method to detect hotkey binding on Windows 7? AltGr+N should display a } sign on my localized keyboard, but it doesn't display anything or do anything. This behaviour is application independent, doesn't work system wide. Although if I login to a remote server with remote destop from the same computer, this keybinding works flawlessly on the remote machine. Any idea? Hubi
|
Given a hotkey, how can I find which program owns it?
|
We own 2 pairs of the same headsets and wish to pair them simultaneously to watch tv on the iPad. Only one at a time seems to work. They have the same name which may be the issue, but I can't find an answer online. Is it possible to send audio to two Bluetooth headsets simultaneously? If so, how?
|
I would like to pair two sticky dude Bluetooth speakers, at one time with my iPhone. With two of them at once it would be like stereo sound. Is there an app or something maybe?
|
the bottom has fallen from my world the world has fallen from my bottom These are examples of ?
|
What is the rhetorical device/argument called when one says: All surgeons are doctors, but not all doctors are surgeons.
|
I am learning about method overriding in Java. Below is an example of method overriding. class ABC{ public void myMethod(){ System.out.println("Overridden Method"); } } public class XYZ extends ABC{ public void myMethod(){ System.out.println("Overriding Method"); } public static void main(String args[]){ ABC obj = new XYZ(); obj.myMethod(); } } When an overridden method is called through a reference of parent class, then type of the object determines which method is to be executed. Now consider below : ABC obj = new ABC(); obj.myMethod(); // This would call the myMethod() of parent class ABC (1) XYZ obj = new XYZ(); obj.myMethod(); // This would call the myMethod() of child class XYZ (2) ABC obj = new XYZ(); obj.myMethod(); // This would call the myMethod() of child class XYZ (3) If (2) and (3) gives same output : Overriding Method, then why use (3)? We could just use (2) right? I am new to Java, so I will tend to ask many doubts! Please help! Thank you!
|
I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this? I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly. Is it just so if you were to do: IInterface classRef = new ObjectWhatever() You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that. Also, how could you write a method that takes in an object that implements an interface? Is that possible?
|
I have an account on Stack Overflow. The account is currently banned for a few days. I got a few upvotes to some of my previous answers. Will these upvotes get added to my reputation or will it just be ignored?
|
After the suspension of my account from Super User, I noticed that my reputation was gone. What are the side-effects of being 'boxed' or suspended?
|
Assume $x \in \mathbb{R}$ and $(x + \frac{1}{x}) \in \mathbb{Z}$. Use Induction to prove that for all $n \in \mathbb{N},~ (x^n + \frac{1}{x^n}) \in \mathbb{Z}$. I'm not sure how to use the information given to prove the induction step. What I have so far is. $P(n) : (x^n + \frac{1}{x^n}) \in \mathbb{Z}$ Base Case Then $(x^0 + \frac{1}{x^0}) = 2 \in \mathbb{Z}$ Induction Hypothesis: $x^k + \frac{1}{x^k}\in \mathbb{Z}$ Want to prove: $x^{k+1} + \frac{1}{x^{k+1}} \in \mathbb{Z}$ My first step was $x^{k+1} + \frac{1}{x^{k+1}} = x \cdot x^k + \frac{1}{x} \cdot \frac{1}{x^k}$
|
Assume that $x+\frac{1}{x} \in \mathbb{N}$. Prove by induction that $$x^2+\frac1{x^2}, x^3+\frac1{x^3}, \dots , x^n+\frac1{x^n}$$ is also a member of $\mathbb{N}$. I have my base, it is indeed true for $n=1$.. I can assume it is true for $x^k+x^{-k}$ and then proove it is true for $x^{k+1}+x^{-(k+1)}$ but I'm stuck there.
|
should a verb after the phrase "a series of" be singular or plural? A series of incidents has taken place since the accident. A series of incidents have taken place since the accident.
|
Formally, is it correct to write: A number of questions has been asked here. or: A number of questions have been asked here. As a non-native speaker of English, I would prefer the former: the subject seems to be "number", therefore the verb ought to be singular, I'd say. However, the latter seems more common, and therefore I believe that my gut feeling is just plain wrong — but I would really like to have a definite answer. Moreover, is it the same for "a myriad of", "a plethora of", and so on?
|
I'm trying to achieve something for a small personal bank account project that I'm practicing with. I want to make it so that if a user enters a space , or doesn't enter anything at all (meaning they pressed enter without entering a value) that the default name of the account switches to "Default". Like so: Scanner read = new Scanner(System.in); System.out.print("Enter your account's name: "); String input = read.next(); String name = ""; if (input == "" || input == null) { name = "Default"; } else { name = input; } Probably a stupid question, but this is one where I'm having a little trouble on. If I enter a space and then press enter, it doesn't continue to set the name. If I press enter when it prompts for an input, it doesn't continue to set the name. Is there a way to set it? Edit: I don't want to know whether or not a String equals another string via .equals() (thank you for pointing that out, by the way). The scanner still does not accept blank inputs.
|
I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference?
|
Palindromes are words, sentences, numbers that are the same forwards and backwards. Is there a term for words that are one word forwards but a different word backwards? For example, star backwards is rats, or god is dog.
|
I'm aware of what a palindrome is. What do you call words that, when reversed, form other words, such as ton (not) and part (trap)?
|
I am on a domain that has its own DNS server, my issue is as follows, In chrome, I have visited the url http://something/, which is a valid url on our domain... The issue that I find extremely aggravating is that I can no longer preform a search for something else, reason being, typing somethingspace - chome thinks that I want to search http://something/ when in reality, I never do. My question is, how can I disable Chrome from thinking that I want to search a specific site, instead of just treating it as a general search query.
|
I have noticed that certain websites (e.g. Stack Exchange sites, Dell, etc.) are automatically added to my list of search engines in Google Chrome. They even add a keyboard shortcut to their entry. Here are some examples: Dell: Keyboard -> Dell.com Stack Exchange Web masters: Keyboard -> webmasters.stackexchange.com Reuters: Keyboard -> reuters.com Q1: Is this the default behavior in Chrome? (to let websites add themselves to the list of search engines?) Q2: Is it possible to disable this behavior in Chrome? Note: I'm running the latest version of Chrome: 11.0.696.57 on Windows 7 64, and I only have one extension installed: Google URL shortener.
|
I recently upgraded to 16.10 and found most things that worked in 15.10 are working in 16.10 - - with one notable exception: gnome-schedule. Many of the suite of gnome utilities are in 16.10 but not gnome-schedule. Downloaded the source code for gnome-schedule v 2.3 and it says it needs autoconf v 1.7 - - 16.10 says that v 1.5 is the latest. errrrr! Any chance we can get gnome-schedule added to Ubuntu repositories anything soon?
|
I would like to install gnome-schedule in my recent Ubuntu 16.04 but I can't find the how. It is not in ubuntu software and if I type sudo apt-get install gnome-schedule, I get it's not found. I would like to use it because I find it quick and easy to use. I've been looking for alternatives but instead of "when" which I don't like, I can't find anything else, so help is welcome.
|
Let $d$ be the inverse of $e \bmod \phi(N)$. Therefore, $de \equiv 1 \pmod{\phi(N)} $ $d \equiv e^{-1} \pmod{\phi(N)} $ In RSA encryption, we can decrypt messages because $P^{ed} \bmod N = P^{1} \bmod N$ I don't understand why $P^{ed} \bmod N = P^{1} \bmod N$ if $e$ and $d$ are modular inverses of $\phi(N)$. What property is this?
|
As you know, in RSA encryption, we calculate an n value by multiplying two long primes. Then we calculate Φ(n), which is equal to (p-1)(q-1). After that, we choose an encryption key which satisfies gcd(e,Φ(n))=1. I know that it is necessary to calculate decryption key, which is the modular inverse of e. My question is: Why do we use Φ(n) in determination of encryption and decryption key processes? How can one prove it is working for RSA encryption?
|
I write a normal class public class TestAccess { } class T{ private int i=0; int j=0; protected int k=0; public int m=0; } class TT { public void m(){ T t= new T(); t.j=9; } } Then I access it in the same directory with another class public class TestProtected extends T { public void method(){ System.out.println(k); } public static void main(String[] args) { System.out.println("HW!"); } } But when I use package in the second class, there is something wrong to access class T; package m; public class TestProtected extends T { public void method(){ System.out.println(k); } public static void main(String[] args) { System.out.println("Hello World!"); } } Can you guys tell me how I can access class T in package m? The issue here is not related with public, I have tried, to be more general, what if you only have class T instead of its java code? The situation is you can access the T class without package, but you cannot access it with package.
|
I'm working now together with others in a grails project. I have to write some Java-classes. But I need access to an searchable object created with groovy. It seems, that this object has to be placed in the default-package. My question is: Is there a way to access this object in the default-package from a Java-class in a named package?
|
I am really new to Android Studio (and relatively new to Java too), and I am trying to create an app that will allow the user to input a time and have a timer start counting down when that time occurs. After looking into it, it seems like using an intent is the best way to go, but I am having some issues understanding how to use it. Right now, I have the following code in my main activity file (called Countdown): public class Countdown extends AppCompatActivity { EditText mHours; EditText mMinutes; TextView mDisplay; public static long finalTime = 0; private AlarmManager alarmMgr; private PendingIntent alarmIntent; Context context; @Override public void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.activity_countdown); mHours = (EditText) findViewById(R.id.text1); mMinutes = (EditText) findViewById(R.id.text2); mDisplay = (TextView) findViewById(R.id.display); Button button = (Button) findViewById(R.id.button1); button.setOnClickListener(new View.OnClickListener() { public void onClick(View v) { Calendar calendar = Calendar.getInstance(); calendar.setTimeInMillis(System.currentTimeMillis()); calendar.set(Calendar.HOUR_OF_DAY, 11); calendar.set(Calendar.MINUTE, 22); Intent intent = new Intent(context, Countdown.class); alarmMgr = (AlarmManager) context.getSystemService(Context.ALARM_SERVICE); alarmIntent = PendingIntent.getBroadcast(context, 0, intent, 0); alarmMgr.set(AlarmManager.RTC, calendar.getTimeInMillis(), alarmIntent); final long hourInput = Long.parseLong(mHours.getText().toString()); final long minuteInput = Long.parseLong(mMinutes.getText().toString()); finalTime = (hourInput * 3600000) + (minuteInput * 60000); } } );}} And in my receiver file I have: public class CountdownStarter { TextView mDisplay; public void onRecieve() { final CountDownTimer aCounter = new CountDownTimer(Countdown.finalTime, 1000) { public void onTick(long millisUntilFinished) { mDisplay.setText("Seconds remaining: " + millisUntilFinished / 1000); } public void onFinish() { mDisplay.setText("Finished"); } }; aCounter.start(); } } Right now, running the debugger I get this message: E/AndroidRuntime: FATAL EXCEPTION: main Process: com.example.android.timerexample, PID: 32276 java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.String android.content.Context.getPackageName()' on a null object reference at android.content.ComponentName.<init>(ComponentName.java:128) at android.content.Intent.<init>(Intent.java:5283) at com.example.android.timerexample.Countdown$1.onClick(Countdown.java:42) at android.view.View.performClick(View.java:5702) at android.widget.TextView.performClick(TextView.java:10888) at android.view.View$PerformClick.run(View.java:22533) at android.os.Handler.handleCallback(Handler.java:739) at android.os.Handler.dispatchMessage(Handler.java:95) at android.os.Looper.loop(Looper.java:158) at android.app.ActivityThread.main(ActivityThread.java:7229) at java.lang.reflect.Method.invoke(Native Method) at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:1230) at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:1120) I was trying to look into it but I just don't understand why I am getting the NullPointerException or how to fix it - I am definitely doing some stuff wrong here but I can't figure out what the next step is. Any assistance would be very helpful!
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
I was having trouble with my ubuntu dual boot so I ran the boot repair usb and was able to boot normally once. I tried to boot again and a screen with minimal grub bash 1.99 came up. I tried the boot repair again and the same screen came up. Here is info from the boot repair.
|
I have Ubuntu 12.04 installed through Wubi on my laptop. For some reason when i click on Ubuntu on start up (when you have to either select windows or Ubuntu) I get the following screen, the grub cursor keeps flashing. Gnu grub version 1.99-21 Ubuntu 3.4 Minimal bash-like line editing is supported. For the first word, tab lists possible command completions. Anywhere else tab lists possible device or file completions. grub> Could you tell me what I can do to fix this problem and to start Ubuntu normally?
|
My HDD is reaching a very high temperature, aprox. 50°, while using Ubuntu. On Windows it only gets as high as 40° and it causes the touchpad to get hot. What can I do to determine what is causing this behaviour and how can I cool off my drive? My notebook is a Toshiba A300-2D4 with an ATI Mobility Radeon HD 3470 graphics card.
|
I have 4 hard disk drives that have temperatures which go beyond the recommended 50 degrees (Celsius). (I have several Samsung Spinpoint F3 which are 1Tb each and they do have good temps, between 32 and 35 degrees. That's normal for me. But in this case, 50+ is not normal.) I have already read the question and answer provided , but none of the solutions helped. What tools can I use or what terminal commands should I execute to lower the temperature of these drives? And on a similar note, if I were to use a method similar to , how would I know which hard drive I am reading? Where can I check to see which HDD is related to, for example, /sys/class/scsi_host/host0/link_power_management_policy ? I have already tested powertop, hddtemp, disks and others to check and try to lower the temp with no luck.
|
Scanner na=new Scanner(System.in); String s; out.print("enter the value in s="); s=na.nextLine();//entering value at runtime out.println("value in s="+s);//check here the value in s if(s=="ERROR") out.println("error is received "); else if(s=="SUCCESS") out.println("success is executed "); char c[]; c=s.toCharArray(); out.println("length of string s="+c.length); in this case why if statement or else statement donot work but if we input the value in string at compile time it executes so why not at runtime we usually compare two values by '==' operator so why not we can compare two string by using this operator there are various other methods available for comparing two strings i mean that,s ok but why == operator is not suitable for comparing strings or why == operator fails to compare two strings
|
I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference?
|
There's an existing proposal to let moderators opt-out questions from HNQ: I would like to add: there is a category of heated questions that attract debate, often rude debate, lots of comments, a suspicious mix of upvote and downvote, and occasionally a meta question asking how to discuss the question better, that should not be picked up at all. This has definitely come up on Academia.SE (meta: ) and also tends to come up on workplace.SE. . Questions that are not only hot but very polemical - in the above case the presence of sexism was contentious - should not appear in the sidebar. It hurts communities when they do. The hot questions needs to be less blunt. You should not put the spotlight on something that is only "hot" because it is "heated". And this can happen upstream in the algorithm rather than relegating it to moderation. The algorithm should watch out for signals like downvotes in addition to upvotes or high comment volume to tell apart "hot" from "heated." Machine learning is not magic but I think isolating the signal here is a use case for offline ML analysis to write business logic against. Some communities have this problem worse than others; perhaps more aggressive HNQ-suppression logic should be deployed there, and softer logic elsewhere.
|
Sometimes a question that is not representative of a site makes the HNQ list. This can lead to a large bump in traffic on a question the community may not be well equipped to handle. I propose that moderators and gold badge holders in the tag be able to set the "hotness points" to zero (or vote to reduce the points). The idea is for the HNQ to represent questions that are both "popular" and a good (not just not bad) fit for the site.
|
Let $\mathbf{a}, \mathbf{b}, \mathbf{c}$ be vectors in the space $\mathbb{E}^3$. Then it’s easy to check by calculation that the following equation holds: $$\mathbf{a}\times (\mathbf{b}\times \mathbf{c})=(\mathbf{a}\cdot \mathbf{c}) \mathbf{b}-(\mathbf{a}\cdot \mathbf{b}) \mathbf{c}.$$ However, the textbook says the equation can be explained geometrically, and I wonder how. All that has come to me so far is that the vector $\mathbf{a}\times (\mathbf{b}\times \mathbf{c})$ lies on the plane spanned by $\mathbf{b},\mathbf{c}$ (given that they are not parallel), but what exactly can represent the double cross product geometrically? Please help.
|
As in the title, I was wondering if the formula: $$a\times (b\times c)=b(a\cdot c)-c(a \cdot b)$$ for $\mathbb R ^3$ cross product has some geometrical interpretation. I've recently seen a proof (from Vector Analysis - J.W. Gibbs) that's not at all difficult to understand, however I would hardly remember the steps of the proof (and I keep forgetting the correct order of A,B,C's), since it appears to me just as algebraic manipulation. So, why is this true? Or is it just an accident?
|
I've been trying to download Minecraft but it said "SmartScreen can't be reached." I've tried everything I know, I can't download anything at all.
|
I keep receiving the "Windows Smart Screen can't be reached right now" prompt when Installing software. I visited the for support, but it only provides troubleshooting steps for connecting to the Internet. My internet connection is working properly, so I don't know why the prompt is appearing.
|
I was talking with a friend about a design for a perpetual motion machine that used magnets, but he said that magnets eventually lose their magnetism. I don't want anyone to go into how Thermodynamics disproves perpetual motion, I just want someone to answer this question: Do magnets ever lose their magnetism, and if so how long does it take?
|
I have a bunch of magnets (one of those game-board thingies) given to me when I was a school-going lad over 20 years ago, and the magnets feel just as strong as it was the day it was given. As a corollary to this question , is there a way to determine how long a permanent magnet will remain a magnet? Addendum: Would two magnets remain a magnet for a shorter duration if they were glued in close proximity with like poles facing each other?
|
I have an application written in C++ and MFC which is multithreaded running on windows. Occasionally I do get some complaints such as deadlocks or an unhandled exception which is caused because of these threads. Normally I use visual studio (if the problem is reproducible) or else use the WinDbg to analyse the dump files generated. Is there any better way of doing this? Can I use some other tools to do this?
|
We have a codebase that is several years old, and all the original developers are long gone. It uses many, many threads, but with no apparent design or common architectural principles. Every developer had his own style of multithreaded programming, so some threads communicate with one another using queues, some lock data with mutexes, some lock with semaphores, some use operating-system IPC mechanisms for intra-process communications. There is no design documentation, and comments are sparse. It's a mess, and it seems that whenever we try to refactor the code or add new functionality, we introduce deadlocks or other problems. So, does anyone know of any tools or techniques that would help to analyze and document all the interactions between threads? FWIW, the codebase is C++ on Linux, but I'd be interested to hear about tools for other environments. Update I appreciate the responses received so far, but I was hoping for something more sophisticated or systematic than advice that is essentially "add log messages, figure out what's going on, and fix it." There are lots of tools out there for analyzing and documenting control-flow in single-threaded programs; is there nothing available for multi-threaded programs? See also
|
For some reason Ubuntu decided not to utilize the 100GB I cleared for it, and installed itself with only 28GB of space. I only discovered this now, after it started bugging me about running out of space. I've tried googling my issue, but it appears that it's a somewhat dangerous process that heavily depends on the exact situation, so I thought I'd be better off asking you guys for help. I have two physical drives, one for Windows only and another for storage/Ubuntu. The partitions on the second drive looks like this.
|
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?
|
In principals of mathematical analysis on page 32, Rudin defines (definition 2.18e-f): a point $p$ is an interior point of $E$ of there is a neighborhood $N$ of $p$ such that $N\subset E$, $E$ is open if every point of $E$ is an interior point of $E$ By this definition, shouldn't $\mathbb{Z}$ be open? Because $\forall n \in \mathbb{Z} \exists m \in \mathbb{Z}s.t. |n-m|>0$ and so $m$ is in a neighborhood of $n$ and in $\mathbb{Z}$
|
Baby Rudin gives the example of the set of all integers being not open if it is a subset of $\mathbb{R}^2$. If we consider the set of integers in $\mathbb{R}$, is this set also not open? I can find a neighbourhood which will contain any point, $p$, however is it a requirement that a neighbourhood contains more than one point? I'm trying to understand this fully and have searched through the various posts that have a slight relation and can not find out specifically how these take interior and isolated points into account and how these relate to openess.
|
In the case of forced, undamped oscillations, why is the amplitiude of the steady state oscillations bigger, when the frequency of the driving force gets closer to the natuaral frequency of the oscillating system. I know, that we can get this result by solving appropriate equation, but I am looking for an intuituive explanation. I know the "kid on a swing" explanationa, but it relates to driving in a form of short impulses, rather than a sinsuoidally changing force.
|
The steady-state motion of a driven oscillator is given by;$$x =\underset{\text{amplitude}} {\dfrac{F_0}{m({\omega_0}^2 - {\omega}^2)}} \cos\omega t.$$ As we see, the amplitude becomes maximum when $$\underset{\mbox{driven frequency}}{\omega} = \underset{\mbox{natural frequency}} {\omega_0}.$$ Coming now to the forced oscillator with damping, in order to maintain constant amplitude, the average power-input is given by $$\bar{P}(\omega) = \frac{F_0 ^2 \omega_0}{2kQ} \dfrac{1}{\left(\dfrac{\omega_0}{\omega} - \dfrac{\omega}{\omega_0}\right)^2 + \dfrac{1}{Q^2}}.$$ This also passes through maximum when $\omega = \omega_0$ i.e. at resonance. So, these formulae tell that during resonance i.e. when the driven frequency is equal to the natural frequency, the amplitude & the power consumed by the oscillator is maximum. What is actually happening physically that makes the amplitude & the power consumption maximum during resonance? What is the reason that the oscillator stores maximum energy only when driven at natural frequencies? I want to know what is happening actually that maximses the power absorbed & amplitude during resonance as is evident from the equations above.
|
Is there any way to dismiss JavaScript alert() programatically OR by pressing any key and not necessarily pressing the ENTER key?
|
I want to be able to close an alert box automatically using Javascript after a certain amount of time or on a specific event (i.e. onkeypress). From my research, it doesn't look like that's possible with the built-in alert() function. Is there a way to override it and have control over the dialog box that it opens? Also, I don't want an override that shows a hidden div as the alert. I need an actual dialog box.
|
It is often cited that humans share 99% (or 98%) of their DNA with chimpanzees. On the other hand it is stated that siblings share only half of their genes. What (if any) is the difference between DNA and genes; or, how can the above two claims be reconciled? (I am assuming of course that chimps and humans are more different from each other than two siblings are from each other.) (I am asking this question as a layperson, who had a little biology in school but not much more.) June 2015 Addendum: Here is a nice just released by MinuteEarth; I do not know how accurate this video is, but as a layperson I found it insightful.
|
I made an answer on the Scifi.SE that can be read . It is about how the characters in the story Jurassic Park might have gotten DNA for all the species shown. In my answer, I said this: Apes and Humans, for example, share over 99% of their genes. That means the difference between our species is less than 1% of our genes. In fact, all life on Earth shares about 50% of it's genes. but in the original posting (before someone edited it) I chose to use the word DNA instead of genes. He left this comment in the section to explain the edit: Sorry, I'm a biologist, I can't help it. Humans and apes share 99% similarity in the coding sequences of their DNA, the ~5% that codes for genes, not on all the DNA. I simplified this to genes for the answer. I have a basic high school understanding of DNA and genes, so I'm afraid I fail to see the difference between using "DNA" or using "genes" in my statement. I understand that genes are specific sequences of DNA that are used by the cell in some way. I understand that DNA is more generic, including all of the strands, whether they are used or not, whether they seem to code for something or not. So is it wrong then to say that apes and humans share 99% of their DNA or is it equally correct to say "genes"?
|
If a nonzero element $a$ of a ring $\mathbb{D}$ does not have a multiplicative inverse, then $a$ must be a zero divisor. If $\mathbb{D}$ has finitely many elements, then the statement is true. However, I don't see why, as for the infinite case, 7 isn't a zero divisor only because every element $a > 0$ when multiplied by a $b > 0$ gives you $ab > 0$ which has nothing to do with infinity or finite amounts of elements.
|
Let $R$ be a finite ring with unity. Prove that every nonzero element of $R$ is either a unit or a zero-divisor.
|
Does every even degree polynomial in the expansion of $\exp x$ have no real roots? I tried the first few values and it seems like it... Is this a known result?
|
Find the number of real roots of $1+x/1!+x^2/2!+x^3/3! + \ldots + x^6/6! =0$. Attempts so far: Used Descartes signs stuff so possible number of real roots is $6,4,2,0$ tried differentiating the equation $4$ times and got an equation with no roots hence proving that above polynomial has $4$ real roots. But using online calculators I get zero real roots. Where am I wrong?
|
I'm making a competitive 2-player 2D racing game for a school project. I'm struggling with the movements of my car: I made it a square for testing purposes and it can move left, right, up or down, but it can't make smooth turns around corners. How can I make my car (currently a square) make smooth movements? I've heard vectors might help, but I don't know how to use them. I'm writing this in C# with Visual Studio. My car control code looks like this right now: private void Form1_KeyDown(object sender, KeyEventArgs key) { // player1 controls if (key.KeyCode == Keys.Up) { Player1.Top -= 5; } if (key.KeyCode == Keys.Down) { Player1.Top += 5; } if (key.KeyCode == Keys.Left) { Player1.Left -= 5; } if (key.KeyCode == Keys.Right) { Player1.Left += 5; } // player2 controls if (key.KeyCode == Keys.W) { Player2.Top -= 5; } if (key.KeyCode == Keys.S) { Player2.Top += 5; } if (key.KeyCode == Keys.A) { Player2.Left -= 5; } if (key.KeyCode == Keys.D) { Player2.Left += 5; } }
|
I have goggled how to do this and found this I have had a go at it but most of the functions that were showed didn't work I just got errors because they didn't exist. I have looked at the cos and sin functions but don't understand how to use them or how to get the car movement working correctly using vectors. I have no code because I am not sure what to do sorry. Any help is appreciated. EDIT: I have restrictions that I must use the TL engine for my game, I am not allowed to add any sort of physics engine. It must be programmed in c++. Here is a sample of what i got from trying to follow what was done in the link I provided. if(myEngine->KeyHeld(Key_W)) { length += carSpeedIncrement; } if(myEngine->KeyHeld(Key_S)) { length -= carSpeedIncrement; } if(myEngine->KeyHeld(Key_A)) { angle -= carSpeedIncrement; } if(myEngine->KeyHeld(Key_D)) { angle += carSpeedIncrement; } carVolocityX = cos(angle); carVolocityZ = cos(angle); car->MoveX(carVolocityX * frameTime); car->MoveZ(carVolocityZ * frameTime);
|
I am new to Python. Trying to pick up Airflow. What is context or **context in Airflow that is used in methods? For example mentioned by the answer in this question Or like in def execute(self, context): def is_business_account(**context): Appreciate your help!
|
In the following method definitions, what does the * and ** do for param2? def foo(param1, *param2): def bar(param1, **param2):
|
Why does a new memory card or flash drive need to be formatted before using it? All of I get from internet is just a tip to format it before use. But they don't explain why we need to format it first.
|
What does the computer do when we format our hard disk or flash disk. If formatting clears all data on a disk, what is the difference between deleting all files in the disk and formatting the entire disk? Is it bad to format multiple times? How many times can a disk be formatted? Will formatting reduce the lifespan of my drive? What is the difference between quick formatting and standard formatting?
|
Let's look at these two sentences: People are always looking for a bargain. The people have made their choice. Here come my questions: How can I be sure if I should use "the" or not? Are there any rules to follow to make the choice easier? Is this related to context?
|
I can’t for the life of me figure out where to use a and where to use the — and where there is no article at all. Is there a simple rule of thumb to memorize? The standard rule you always hear: “If a person knows which item you are talking about then use "the" . . . doesn’t clear things up for me, as I have no idea whether or not they know.
|
What is single word or phrase/idiom for "someone speaks a lot but works very very slow" for example.... someone said/planned he would do 100 task but actually finished less than 10 task
|
I'm looking for an idiom or expression to describe a well-known person/ organization/ politician/ government whose achievements in a given situation are smaller than what they had claimed or promised to be. We Iranians have a proverb that literally means The (roaring) mountain just gave birth to a mouse! Its etymology is like this: Once a volcanic mountain started roaring, hissing, and bursting bubbles. The people were waiting to see what would happen after all those huge roarings and loud booms. Finally, the volcano activity stopped and the people saw just a tiny mouse came out of there! (rather than a monster that was expected to come). So they said mockingly: "Heh! After all those huge roarings, the (big) mountain just gave birth to a (tiny) mouse!" Notes: The (roaring) mountain -symbol for an apparently big(=important) and strong person-here is figured like a woman who is screaming and shouting while is delivering her baby. We use this proverb for mocking an important person/organization/ government, etc ironically when they have used broad advertisements or have spent much money or resources over doing something noticeable, but the result/ achievement is less noticeable than it was claimed or promised to be. Is there any equivalent for this Persian proverb? I just found ; would it convey the same connotation?
|
The time-independent Schrodinger equation for a particle moving along the x-axis is: $$H\psi (x) + V(x) \psi (x) = E \psi(x)$$ I know that the physically acceptable solutions to this equation can only be found for a specific value of E (so there are $n$ solutions for each $E_1$, $E_2$, ... , $E_n$). Why in general (I am aware that this is the case for the infinite square well for example), mathematically, is that the case?
|
Given some potential $V$, we have the eigenvalue problem $$ -\frac{\hbar^2}{2m}\Delta \psi + V\psi = E\psi $$ with the boundary condition $$ \lim_{|x|\rightarrow \infty} \psi(x) = 0 $$ If we wish to seek solutions for $$ E < \lim_{|x|\rightarrow \infty}V(x), $$ I find textbooks like Sakurai and others assert that (without proof) set of all such eigenvalues $E$ that admits nontivial solutions is discrete, which gives us liberty to index them with natural numbers (principal quantum numbers). Can anyone help me with a little elaboration of this mathematical fact ? As a student of mathematics, I know that compact operators have discrete spectrums, so for the operator $ T : L^2 \rightarrow L^2 $given as $$ T(\psi) = -\frac{\hbar^2}{2m}\Delta \psi + V\psi. $$ Are there methods to show that $T$ is compact? Or possibly other ways to establish discreteness of its eigenspectrum?
|
While typing , I became unsure of which form to use for a verb. That would be the first time a morph has disappeared (except for Sario Rips and allergies, neither of which apply here.) Should it be "neither of which applies"? Logic tells me it should be "apply", because it's plural (two objects, "Sario Rips" and "allergies".) But, instinctively, I feel that "applies" sounds better. Which one is correct? Would it matter what the verb was? So for example, if the answer is that it should be "applies", should then any verb be in single form in this sentence? (Like "Neither of which does", "Neither of which has", etc.)
|
With reference to None of the above sentences is strictly correct. Neither of the above sentence/sentences is/are strictly correct. The person has used are with none. This contradicts above notion of using singular with none. Which is more correct? The first sentence is perfectly fine, but I'm getting confused from the second sentence. In this sentence, how would we decide about antecedents? Can we use both sentence interchangeably?
|
tried "remove doubles" on the whole model with bigger threshold with no results, also tried to unmark all edges as sharp/crease. all faces are quads.
|
was following a tutorial where I stumbled into this weird line in my mirrored mesh (sorry for the feet lol) You can also download the blender file
|
In thinking about Sturm-Liouville theory a bit I see I have no actual idea what is going on. The first issue I have is that my book began with the statement that given $$L[y] = a(x)y'' + b(x)y' + c(x)y = f(x)$$ the problem $L[y] \ = \ f$ can be re-cast in the form $L[y] \ = \ \lambda y$. Now it could be a typo on their part but I see no justification for the way you can just do that! More importantly though is the motivation for Sturm-Liouville theory in the first place. The story as I know it is as follows: Given a linear second order ode $$F(x,y,y',y'') = L[y] = a(x)y'' + b(x)y' + c(x)y = f(x)$$ it is an exact equation if it is derivable from a differential equation of one order lower, i.e. $$F(x,y,y',y'') = \frac{d}{dx}g(x,y,y').$$ The equation is exact iff $$a''(x) - b'(x) + c(x) = 0. $$ If $F$ is not exact it can be made exact on multiplication by a suitable integrating factor $\alpha(x)$. This equation is exact iff $$(\alpha(x)a(x))'' - (\alpha(x)b(x))' + \alpha(x)c(x) = 0 $$ If you expand this out you get the Adjoint operator $$L^*[\alpha(x)] \ = \ (\alpha(x)a(x))'' \ - \ (\alpha(x)b(x))' \ + \ \alpha(x)c(x) \ = 0 $$ If you expand $L^*$ you see that we can satisfy $L \ = \ L^*$ if $a'(x) \ = \ b(x)$ & $a''(x) \ = \ b'(x)$ which then turns $L[y]$ into something of the form $$L[y] \ = \ \frac{d}{dx}[a(x)y'] \ + \ c(x)y \ = \ f(x).$$ Thus we seek an integratiing factor $\alpha(x)$ so that we can satisfy this & the condition this will hold is that $\alpha(x) \ = \ \frac{1}{a(x)}e^{\int\frac{b(x)}{a(x)}dx}$ Then we're dealing with: $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ \alpha(x)c(x)y \ = \ \alpha(x)f(x)$$ But again, by what my book said they magically re-cast this problem as $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ \alpha(x)c(x)y \ = \ \lambda \alpha(x) y(x)$$ Then calling $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ ( \alpha(x)c(x)y \ - \ \lambda \alpha(x) )y(x) \ = \ 0$$ a Sturm-Liouville problem. My question is, how can I make sense of everything I wrote above? How can I clean it up & interpret it, like at one stage I thought we were turning our 2nd order ode into something so that it reduces to the derivative of a first order ode so we can easily find first integrals then the next moment we're pulling out eigenvalues & finding full solutions - what's going on? I want to be able to look at $a(x)y'' \ + \ b(x)y' \ + \ c(x)y \ = \ f(x)$ & know how & why we're turning this into a Sturm-Liouville problem in a way that makes sense of exactness & integrating factors, thanks for reading!
|
In thinking about Sturm-Liouville theory a bit I see I have no actual idea what is going on. The first issue I have is that my book began with the statement that given $$L[y] = a(x)y'' + b(x)y' + c(x)y = f(x)$$ the problem $L[y] \ = \ f$ can be re-cast in the form $L[y] \ = \ \lambda y$. Now it could be a typo on their part but I see no justification for the way you can just do that! More importantly though is the motivation for Sturm-Liouville theory in the first place. The story as I know it is as follows: Given a linear second order ode $$F(x,y,y',y'') = L[y] = a(x)y'' + b(x)y' + c(x)y = f(x)$$ it is an exact equation if it is derivable from a differential equation of one order lower, i.e. $$F(x,y,y',y'') = \frac{d}{dx}g(x,y,y').$$ The equation is exact iff $$a''(x) - b'(x) + c(x) = 0. $$ If $F$ is not exact it can be made exact on multiplication by a suitable integrating factor $\alpha(x)$. This equation is exact iff $$(\alpha(x)a(x))'' - (\alpha(x)b(x))' + \alpha(x)c(x) = 0 $$ If you expand this out you get the Adjoint operator $$L^*[\alpha(x)] \ = \ (\alpha(x)a(x))'' \ - \ (\alpha(x)b(x))' \ + \ \alpha(x)c(x) \ = 0 $$ If you expand $L^*$ you see that we can satisfy $L \ = \ L^*$ if $a'(x) \ = \ b(x)$ & $a''(x) \ = \ b'(x)$ which then turns $L[y]$ into something of the form $$L[y] \ = \ \frac{d}{dx}[a(x)y'] \ + \ c(x)y \ = \ f(x).$$ Thus we seek an integratiing factor $\alpha(x)$ so that we can satisfy this & the condition this will hold is that $\alpha(x) \ = \ \frac{1}{a(x)}e^{\int\frac{b(x)}{a(x)}dx}$ Then we're dealing with: $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ \alpha(x)c(x)y \ = \ \alpha(x)f(x)$$ But again, by what my book said they magically re-cast this problem as $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ \alpha(x)c(x)y \ = \ \lambda \alpha(x) y(x)$$ Then calling $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ ( \alpha(x)c(x)y \ - \ \lambda \alpha(x) )y(x) \ = \ 0$$ a Sturm-Liouville problem. My question is, how can I make sense of everything I wrote above? How can I clean it up & interpret it, like at one stage I thought we were turning our 2nd order ode into something so that it reduces to the derivative of a first order ode so we can easily find first integrals then the next moment we're pulling out eigenvalues & finding full solutions - what's going on? I want to be able to look at $a(x)y'' \ + \ b(x)y' \ + \ c(x)y \ = \ f(x)$ & know how & why we're turning this into a Sturm-Liouville problem in a way that makes sense of exactness & integrating factors, thanks for reading!
|
Can anybody please help me to solve? Let $F$ be a field. We define $n$ linear functionals on $F^n$, for $n \geq 2 $, by: $f_k(x_1,\ldots,x_n) = \sum \limits_{j = 1}^n (k-j)x_j $. What is the dimension of the subspace annihilated by $f_1,f_2,\ldots,f_n$? I have tried to prove that the $n$ functionals are linear independent.
|
Let $F$ be a subfield of the complex numbers. We define $n$ linear functionals on $F^n$ ($n \geq 2$) by $f_k(x_1, \dotsc, x_n) = \sum_{j=1}^n (k-j) x_j$, $1 \leq k \leq n$. What is the dimension of the subspace annihilated by $f_1, \dotsc, f_n$? Approaches I've tried so far: Construct a matrix $A$ whose $k$th row's entries are the coefficients of $f_k$, i.e., $A_{ij} = i - j$, and compute the rank of the matrix. Empirically, the resulting matrix has rank 2 for $n = 2$ to $n = 6$, but I don't see a convenient pattern to follow for a row reduction type proof for the general case. Observe that $f_k$, $k \geq 2$ annihilates $x = (x_1,\dotsc, x_n)$ iff $$\sum_{j=1}^{k-1} (k-j)x_j + \sum_{j = k+1}^n (j-k)x_j = 0$$ iff $$k\left(\sum_{j=1}^{k-1} x_j - \sum_{j=k+1}^n x_j\right) = \sum_{j=1}^{k-1} jx_j - \sum_{j=k+1}^n jx_j,$$ and go from there, but I do not see how to proceed. Note: This is Exercise 10 in Section 3.5 ("Linear Functionals") in Linear Algebra by Hoffman and Kunze; eigenvalues and determinants have not yet been introduced and so I am looking for direction towards an elementary proof.
|
I have a bitmap object that is not a static resource. Normally, with image binding in WPF you can bind to a string path. However, I have a dynamically created bitmap object that I would like to bind to. Is it possible to do something like: <WrapPanel x:Name="imageWrapPanel" HorizontalAlignment="Center"> <Image Source="{Binding Material1}" Margin="10" /> <Image Source="/NightVision;component/Images/concrete_texture.tif" Margin="10" /> </WrapPanel> And in the code behind file I have a public accessor: public Bitmap Material1 { get { return new Bitmap(/* assume created somewhere else*/) } } The above is obviously not working however, is there a way to do something similar?
|
I'm trying to bind a list of custom objects to a WPF Image like this: <Image> <Image.Source> <BitmapImage UriSource="{Binding Path=ImagePath}" /> </Image.Source> </Image> But it doesn't work. This is the error I'm getting: "Property 'UriSource' or property 'StreamSource' must be set." What am I missing?
|
Explain briefly the function of the code below. About continue & break operations. I can't understand properly label1, label2.....Please describe code functions (The label is basically used in nested loops But note that they are used here to understand the labelling process) class example { public static void main(String args[]) { int i = 0; int j = 0; label1: while (i++ < 5) { label2: for (;;) { label3: do { System.out.print(i + " " + j + " "); switch (i + j++) { case 0: continue label3; case 1: continue label2; case 2: continue label1; case 3: break; case 4: break label3; case 5: break label2; case 6: break label1; default: break label1; } } while (++j < 5); } } } }
|
I saw this keyword for the first time and I was wondering if someone could explain to me what it does. What is the continue keyword? How does it work? When is it used?
|
So, I need to retrieve all properties of an instance which currently have a value that matches the default value of their respective type. Something along the lines of GetType().GetProperties().Where(x => x.GetValue(this).Equals(default(x.PropertyType))); This obviously doesn't work because it seems 'x' cannot be resolved anymore at this point. What could I do?
|
I'm using reflection to loop through a Type's properties and set certain types to their default. Now, I could do a switch on the type and set the default(Type) explicitly, but I'd rather do it in one line. Is there a programmatic equivalent of default?
|
I have a multilingual website with the following structure: example.com <--- Main english version example.com/fr <--- The french version Is it important for SEO reasons to put a trailing slash in example.com/fr and make it example.com/fr/ or is it not important?
|
Does it make any difference to SEO ratings what-so-ever if your url has a trailing slash: http://www.example.com/some/slug/paths/ as opposed to one that does not: http://www.example.com/some/slug/paths
|
NOTE PLEASE : for all of you who will mark this as a duplicate THE ISSUE WAS NOT SOLVED USING CODE FROM THAT TOPIC. PLEASE DON'T MARK THIS AS A DUPLICATE BUT TRY TO HELP ME OUT. I'D REALLY APPRECIATE IT :) Let me explain my issue. I got a WordPress with 10,000 posts and like +6k of them have tittles longer than 65 characters which affects SEO. I'm using this code to limit titles to 65 characters: function tokenTruncate($title, $your_desired_width) { $parts = preg_split('/([\s\n\r]+)/', $title, null, PREG_SPLIT_DELIM_CAPTURE); $parts_count = count($parts); $length = 0; $last_part = 0; for (; $last_part < $parts_count; ++$last_part) { $length += strlen($parts[$last_part]); if ($length > $your_desired_width) { break; } } return implode(array_slice($parts, 0, $last_part)); $your_desired_width = 65; if (strlen($title) > $your_desired_width) { $title = wordwrap($title, $your_desired_width); $title = substr($title, 0, strpos($title, "\n")).'...'; return $title; } add_filter('the_title','tokenTruncate');
|
I have a code snippet written in PHP that pulls a block of text from a database and sends it out to a widget on a webpage. The original block of text can be a lengthy article or a short sentence or two; but for this widget I can't display more than, say, 200 characters. I could use substr() to chop off the text at 200 chars, but the result would be cutting off in the middle of words-- what I really want is to chop the text at the end of the last word before 200 chars.
|
I'd like to ask you about the way of putting the listing next to the tikzpicture. Is there any way to place lstlisting as it is shown below? \documentclass[12pt]{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}[scale=3] \clip (-0.1,-0.2) rectangle (1.1,0.75); \draw[step=.5cm,gray,very thin] (-1.4,-1.4) grid (1.4,1.4); \draw (-1.5,0) -- (1.5,0); \draw (0,-1.5) -- (0,1.5); \draw (0,0) circle [radius=1cm]; \fill[green!20!white] (0,0) -- (3mm,0mm) arc [start angle=0, end angle=30, radius=3mm] -- (0,0); \end{tikzpicture} \end{document} My goal:
|
I like very much the 'side-by-side' code examples in the TikZ/PGF manual... ... and I would like to use the same thing in a manual I'm writing. I have found the source code for the codeexample environment that the TikZ/PGF manual uses for this purpose (specifically, it's located at /usr/local/texlive/2012/texmf-dist/doc/generic/pgf/macros/pgfmanual-en-macros.tex). My (probably rather basic) question is: how can I use the same codeexample environment in my own documents? I ask because I tried compiling the example in the related question below, but the file couldn't be found.
|
There is a big number of Stack Exchange sites, so much so that sometimes it's difficult to choose the more appropriate site for our questions. Sometimes there is more than a site that fits to our question. For example, when I have a question about a engineering problem governing by a differential equation and that I want to solve with a computer algebra system implemented in a library in python lenguage. That type of question covers several subjects and it's complicated to choose 1 site for that question. I was search about how I can find the Stack Exchange site which fit to my question, and I found the next question: After read that question, I consider that searching the site's tags and reading their tag wikis and to see the frequency of the use of the tag helps a lot to know if my question fits to the site. But search the tags through the all possible sites is a hard work, so I would like to know if exist a way to list all the tags used throught all the Stack Exchange sites. This will help us to find a specific tag that fits to my question and then to find which SE site this tag belong to. Is there a way to list all the used tags through all the Stack Exchange sites? or is there a webpage that contain that list of all tags of all Stack Exchange sites?
|
I want to find all questions tagged on the meta sites of . Is there a better way than searching manually on each individual site?
|
I want to comment out a line (add a # to the beginning). I used this command: sed -i '96s/^/#&/' file.txt on Linux to insert comment at line # 96. If the line number is a variable, then how can I use this command? I have tried these commands: (1) sed -i '${line_number}s|^|#&|' file.txt (2) sed -i '${line_number}s/^/#&/' file.txt But they don't work. How can I do this?
|
I want to do: cat update_via_sed.sh | sed 's/old_name/new_name/' > new_update_via_sed.sh in my program. But I want to use variables, e.g. old_run='old_name_952' new_run='old_name_953' I have tried using them but the substitution doesn't happen (no error). I have tried: cat update_via_sed.sh | sed 's/old_run/new_run/' cat update_via_sed.sh | sed 's/$old_run/$new_run/' cat update_via_sed.sh | sed 's/${old_run}/${new_run}/'
|
Many hormones use , such as cAMP and cGMP, and also act on the same cells. For example calcitonin and PTH both use cAMP and have opposite effects. How is it possible that the same second messenger molecule (cAMP) can have opposite effects on the same cells? Why are there more hormones compared to 2nd messengers - doesn't that reduce the uniqueness of each hormone? Shouldn't that make the function of any hormone using e.g. cAMP be the same as that of any other hormone using the same 2nd messenger on the same cell?
|
Glucagon stimulates glycogenolysis and gluconeogenesis, thus increasing the plasma glucose concentration — so that tissues get enough glucose in the fasting state. However glucagon also inhibits glycolysis. In this case, what is the point of having high blood glucose if it cannot be catabolized?
|
I want to install Ubuntu 12.04.03 onto my HP laptop along side Windows ( Dual Boot ) Under the "God Mode" for Windows 8, I have a partition utility - 500GB Free on the system drive, what is recommended for Ubuntu? Also, driver compatibility - AMD A8 - APU 1.9Ghz quad core, Radeon 7640G Video, AMD High Def Audio, with IDT High Def Codec. Qualcomm Atheros WiFi Realtek PCIe FE Family Controller Are there any know issues with any drivers or dual OS with Win 8.1?
|
I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS. Should I do it with Wubi, or through the Live USB/DVD? What steps do I need to take to correctly install Ubuntu?
|
Of course, this raises a hundred red flags, but I was wondering, assuming: I don't have Western Union account, and would need to make one for this transfer He does not personally ask me for my personal details/I do not give them on his request. (This does not include, for example, a website he sets up for the transfer asking me for my details) He does not personally ask me to send any money back/I do not attempt to send it back on his request. (This does not include, for example, him sending me an official looking email posing as the bank, asking for me to pay mystery fees) What are the ways this scam could still go wrong? (I talk in first person hypothetically, this is happening to a friend of mine) EDIT: This is a similar but different question to the duplicate proposed. That question asks: If one is sent money as part of a scam, then asked to send it back, how would a scam play out? I instead ask: If one is sent money as part of a scam, but is not asked for the money back (nor for any personal details) by the sender, how would a scam play out? Albeit, this isn't reflected heavily in the answers.
|
Possible Australianism - netbank = a website + app by which an Aussie can do their banking, including transferring money to other people. A while ago, I ended up with $1000 transferred into my account, which in the description looked like a netbank transfer, not like a cheque, cash deposit etc, and which looked like it had already cleared and landed in my account. Usually when something is still working through the bank's system it displays as 'pending', but did not in this case. I received a phone call from someone, saying that they had accidentally typed in the wrong account number, and wanting me to send them the same amount of money back via netbank. Surely bank account numbers have a checksum, which make it relatively difficult for a typo to result in a payment going to the wrong person? What are likely sources of them being able to find my phone number to call me? Obviously, the bank either being hacked, or giving it out in response to a query from this person (but surely the bank is unlikely to tell me my own mobile number if I claim to have forgotten it?). Presumably either my phone, or the phone of someone I have sent money to/received money from could be compromised. Has anyone heard of any instances of this happening? I then went to my bank, explained the situation and said that I did want to refund the money through the officially sanctioned methodology. After the laughter died down, the bank told me to ask the person to fill out a form, then they would get me to fill out a form that would authorize undoing that exact payment. I rang up the person to tell them this, and over the course of about a week received an increasingly elaborate story about how that wasn't working, they needed the money immediately, there was a fee to fill out that form and they couldn't afford to pay it etc. After that, I never heard back from them again. I check my netbank for several weeks after, expecting the money to magically disappear, but it did not. This was probably a year ago, and I'm pretty vague with money so may not have noticed if it disappeared more recently. How were they expecting to benefit? Were they hoping to get the transfer from me, and undo the transfer to me, to leave them $1k up? If so, how can an internet banking transfer be 'undone' once it has already shown as 'received'. Or was this to do with money laundering? The account they requested me to send money to was the same as the one that the money appeared to come from. This was a scam, right?
|
//CodeSample1 //declare class fileds but not initialize them. public class Cat { public int Age; public string Name; } Cat aCat = new Cat(); Check the result, aCat.Age is 0, aCat.Name is null. How the fields are initialized? The above code just declare fields and not initialize them. If you do not provide a constructor for your object, C# will create one by default that instantiates the object and sets member variables to the default values as listed in Default Values Table.(From ) So it's the compiler generated default constructor initialize fields. Is it right? Changed Code, initialize fields when declare them. //CodeSample2 //declare class fields and initialize them at same time. public class Cat { public int Age = 4; public string Name = "Black"; } Cat aCat = new Cat(); This time the Result is that aCat.Age is 4, and aCat.Name is "Black". I know the result is as expected. But do not understand how it works. Fields are initialized immediately before the constructor for the object instance is called. (From ) Combine and , CodeSample1 and CodeSample2 should have the same results (I know it strange). My understanding is, in CodeSample2, firstly Age field is initialize to 4, then the compiler generated default constructor is called and set the age to default value (0). Have I misunderstood the documents, or the documents are somewhat wrong? If there are more accurate documents, please show me.
|
I've been programming in C# and Java recently and I am curious where the best place is to initialize my class fields. Should I do it at declaration?: public class Dice { private int topFace = 1; private Random myRand = new Random(); public void Roll() { // ...... } } or in a constructor?: public class Dice { private int topFace; private Random myRand; public Dice() { topFace = 1; myRand = new Random(); } public void Roll() { // ..... } } I'm really curious what some of you veterans think is the best practice. I want to be consistent and stick to one approach.
|
Any ideas on how to go from Maine to Canada by bus without going south through Boston?
|
I'm considering going all the way across to Halifax, Nova Scotia, but am having trouble finding information on getting from there down to the USA (Boston in particular). I gather it's 22 hours by train back to Montreal, and then I could bus down, but the train is only every few days. I've tried Megabus and Greyhound but both sites won't show me how to connect to get to Boston in the USA, for example. Is there a Greyhound connection to the US, or another bus company? Or do you have to backtrack all the way to Quebec/Montreal and cross the border there?
|
My Hashtable in Java would benefit from a value having a tuple structure. What data structure can I use in Java to do that? Hashtable<Long, Tuple<Set<Long>,Set<Long>>> table = ...
|
I like how Java has a Map where you can define the types of each entry in the map, for example <String, Integer>. What I'm looking for is a type of collection where each element in the collection is a pair of values. Each value in the pair can have its own type (like the String and Integer example above), which is defined at declaration time. The collection will maintain its given order and will not treat one of the values as a unique key (as in a map). Essentially I want to be able to define an ARRAY of type <String,Integer> or any other 2 types. I realize that I can make a class with nothing but the 2 variables in it, but that seems overly verbose. I also realize that I could use a 2D array, but because of the different types I need to use, I'd have to make them arrays of OBJECT, and then I'd have to cast all the time. I only need to store pairs in the collection, so I only need two values per entry. Does something like this exist without going the class route? Thanks!
|
I am (just for fun) trying to calculate the velocity with which the moon would impact the earth if it stopped orbiting and simply headed towards earth. I know the force is $\frac{G m_1 m_2}{r^2}$. How do I calculate a final velocity resulting from a varying acceleration which in turn is dependant on a varying force which in turn is dependant on a varying distance.
|
The Problem For a small mass a distance $R_i$ away from the center of the Earth, how long would it take for the object to fall to the surface of the Earth, assuming that the only force acting upon the object is the Earth's gravitational force? Relevant Information The following discussion seems to have solved exactly the same problem: However, upon working out the mathematics, I'm not exactly sure how to evaluate the constant of integration. A Partial Solution $$ F=\frac {-GMm}{s^2} $$ $$ a=\frac {-GM}{s^2} $$ $$ \frac {dv}{dt} = \frac {-GM}{s^2} $$ Multiplying by $v$ and then integrating by $dt$ on both sides, we have $$\frac {1}{2} v^2=\frac {GM}{s} +c_1$$ where $c_1$ is a constant of integration. Substituting initial conditions of $v=0, s=R$, we have $$\frac {1}{2} v^2=GM(\frac {1}{s}-\frac{1}{R})$$ At this point of time, when I use Wolfram Alpha, I get $$c_2+\sqrt{\frac{2}{R}}t=\frac{\sqrt{s}(s-R)+R\sqrt{R-s}\times{\tan^{-1}(\sqrt{\frac{s}{R-s}})}}{\sqrt{GM(R-s)}}$$ where $c_2$ is a constant of integration. Substituting initial conditions of s=R, t=0, we find that the term $$\tan^{-1}(\sqrt{\frac{s}{R-s}})$$ is undefined. At this point, I'm stuck. Any ideas on where I've made the mistake here? (For those interested, this question was inspired by the Greek myth which states that a bronze hammer dropped from heaven would take 9 days to hit the Earth and would reach on the tenth).
|
Let $x=\displaystyle\prod_{n=1}^{180}\left(\cos{\left(\dfrac{n\pi}{180}\right)}+2\right)$ and $y=\displaystyle\sum_{n=0}^{89}\binom{180}{2n+1}\left(\dfrac{3}{4}\right)^n$. How to find $\frac{x}{y}$ ? I have no idea to find it. Thanks in advance.
|
Prove the following: $\displaystyle\prod_{n=1}^{180}\left(\cos{\left(\dfrac{n\pi}{180}\right)}+2\right)=\displaystyle\sum_{n=0}^{89}\binom{180}{2n+1}\left(\dfrac{3}{4}\right)^n$. We can state this as $\displaystyle \binom{180}{1}\left(\dfrac{3}{4}\right)^0+ \binom{180}{3}\left(\dfrac{3}{4}\right)^1+\cdots+\binom{180}{179}\left(\dfrac{3}{4}\right)^{89} = \left(\cos\left(\dfrac{\pi}{180}\right)+2\right)\left(\cos\left(\dfrac{2\pi}{180}\right)+2\right) \cdots \left(\cos\left(\dfrac{180\pi}{180}\right)+2\right)$ The problem I am encountering is that there is no general result we can prove about this for $n$ it seems. I tried using induction on $n$ to prove this but it fails for the base case. Also, combinations and cosines seem unrelated, so how could I prove the equation is true?
|
Is there a way to get the indexing status of Spotlight using Terminal commands? I know that I can just press command+space and type anything to get a progress bar, but I would like to be able to get the same information from a shell. PS: I'm aware of but the old question was asked for Yosemite and the existing answer regarding Terminal commands just says it wasn't possible then. Here's hoping that Apple improved this somehow in the meantime.
|
In previous versions of OS X, you could click the Spotlight icon in the menu bar to show the status of the Spotlight indexing, and it would show an estimate ("6 hours left"), along with a progress bar. I've updated to Yosemite yesterday, and I noticed that Spotlight is not showing some expected results, i.e. files I know to be there, but it just doesn't find them if I type in their name and file type ("kind:excel vacation"). When I start typing in the Yosemite Spotlight window, it shows a small progress bar under the search box, but there's no estimate. Is there another way to show the progress or an estimation on how long the indexing is going to take?
|
While installing Ubuntu phone I entered: sudo fastboot oem unlock It doesn't read the device and printed: < waiting for device > on the terminal. Note my device is genx GX Pad 370 G with android version 4.1.1
|
With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time. Note from foss & Oli: We are making this the master question for all future "Will this work on <insert random tablet/phone/device here>?!" questions
|
I'm trying to prove/disprove that the equation $2^x+2^y=2^z$ where $x$, $y$ and $z$ are positive integers, only have trivial solutions. The obvious case where this is true would be for $x=y$ but I'm not certain if any solutions exits for $x\ne y$ It feels like there are no other solutions but I'm not sure how one would formally prove it. Anyone have any tips on how to do this? Sorry if this is a trivial question / known problem.
|
If we are given $j,k \geq 0, j> k$ and $j,k$ are integers, can $2^j + 2^k$ be ever expressed as $2^n$ where $n \geq 0$ and is an integer? What I said: Suppose it can. Then for some $0 \leq n \in \mathbb{N}: 2^j + 2^k = 2^n$. We know that $j>k$ so $j=k+s$ for some $0 < s \in \mathbb{N}$. So: $2^j + 2^k = 2^{k+s} + 2^k = 2^k \cdot 2^s + 2^k = 2^k \cdot (2^s + 1)$. We see that $2^s + 1$ can be an even number only if $s=0$ but we know that $s > 0$, thus we have that $2^j + 2^k$ which is an even number is equal to an odd number (even * odd), thus it can't be. Is that correct?
|
I sold some fund shares with high turnover on my personal investment account with the intent of buying something similar later on my IRA account. However, after I sold (and within 30 days), I received dividends on the leftover shares which I have set to automatically invest into shares. Have I created a wash sale? I've seen questions asking with something similar, but I'm not sure if order matters between dividend and selling. Presuming I have caused a wash sale: if I sold 100 shares, then got a 2 share "dividend" via reinvestment of my other shares, can I still use the 98 shares as a loss or is the entire transaction considered a wash sale?
|
Let's say I buy some stock. Two weeks later it pays a dividend which is reinvested in fractional shares of the stock. The next day I sell all shares at a loss. Would this be considered a wash sale? suggests not, but I've found sources that say otherwise. If I had dividend reinvestment enabled but want to sell multiple positions soon, how can I avoid wash sale rules (other than not selling at a loss)?
|
I want to have an extra sectioning level under \part{}, say \subpart. It has no difference as for the location on the page or the size of the font with \part{} command. I tried titlesec but I couldn't get it to work. I've read the documentation but no luck. This is the example: \documentclass{book} \usepackage{titlesec} \titleclass{\subpart}{page}[\part] \titleformat{\subpart}[block]{\centering\huge\bfseries}{}{10pt}{}[] %\titlespacing*{\subpart}{}{}{}[] \newcounter{subpart} \renewcommand{\subpart}{\Alph{subpart}} \begin{document} \part*{History} \subpart*{Before} \chapter*{1} \chapter*{2} \chapter*{3} \subpart*{After} \part*{Evidence} \subpart*{Archeology} \end{document} Thanks.
|
I need a section which isn’t really a part, nor a chapter. So I was trying to define a new command, \subpart, based on the \part command, but with its own numbering and which would look like this, in the middle of a new blank page: SUBPART ONE Name of the subpart However, when I try to do so, there always are errors showing up… My approach, based on the code from I-dont-remember-where on the web: \makeatletter \def\@subpart[#1]{% \ifnum \c@secnumdepth >\m@ne \refstepcounter{subpart}% \addcontentsline{toc}{subpart}{\thepart\hspace{1em}#1}% \else \addcontentsline{toc}{subpart}{#1}% \fi {\parindent \z@ %\raggedright % Commented \raggedright \interlinepenalty \@M \normalfont \ifnum \c@secnumdepth >\m@ne \Large\bfseries\hfil\partname~\thepart\hfil % added \hfil … \hfil for centering \par\nobreak \fi \huge \bfseries % \markboth{}{}\par}% \nobreak \vskip 3ex \@afterheading} \makeatother I really should learn to use LaTeX correctly… Thank you for your help, Sebastian
|
I was reading about the power radiated by an oscillating electric dipole. It then said that monopoles don't radiate. But a monopole is just a charge, right? And an accelerated charge radiates EM waves. Can someone please explain.
|
I see this sort of statement in many materials, for example : The smallest radiating unit is a dipole, an electromagnetic point source. and : The simplest infinitesimal radiating element, called a Hertzian dipole… However, none of them includes a clear explanation. Why a dipole, which is consist of 2 charges? Isn't a single non-uniformly moving charge enough?
|
As an experiment in playing with the suid bit, I tried writing a script to run apt-get update from a bash script, and then set the suid bit on it, so I could just run ~/update or something. apt-get update could be anything here - some program that listens on a privileged socket, or writes to / or anything else that has to be run as root. Please don't latch on to apt-get update here. First try is this, which didn't work, failing with can't get lock, are you root?. The reason would seem to be . #!/bin/bash apt-get update So I thought I'd try to bypass the shell, but this didn't work either, for the same reason. #!/usr/bin/perl system("apt-get", "update"). I've got the permissions correct (afaik) - sudo chmod 4755 ~/update. Have I misunderstood setuid, or am I just missing something simple?
|
The setuid permission bit tells Linux to run a program with the effective user id of the owner instead of the executor: > cat setuid-test.c #include <stdio.h> #include <unistd.h> int main(int argc, char** argv) { printf("%d", geteuid()); return 0; } > gcc -o setuid-test setuid-test.c > ./setuid-test 1000 > sudo chown nobody ./setuid-test; sudo chmod +s ./setuid-test > ./setuid-test 65534 However, this only applies to executables; shell scripts ignore the setuid bit: > cat setuid-test2 #!/bin/bash id -u > ./setuid-test2 1000 > sudo chown nobody ./setuid-test2; sudo chmod +s ./setuid-test2 > ./setuid-test2 1000 Wikipedia : Due to the increased likelihood of security flaws, many operating systems ignore the setuid attribute when applied to executable shell scripts. Assuming I'm willing to accept those risks, is there any way to tell Linux to treat the setuid bit the same on shell scripts as it does on executables? If not, is there a common workaround for this problem? My current solution is to add a sudoers entry to allow ALL to run a given script as the user I want it run as, with NOPASSWD to avoid the password prompt. The main downsides to that is the need for a sudoers entry every time I want to do this, and the need for the caller to sudo some-script instead of just some-script
|
I have a table that looks like this in Google Big Query: custID InteractionDate Purchased? Sales 1 20150312 F 0 1 20150312 T 200 1 20150314 T 150 2 20150221 T 400 2 20150221 F 0 2 20150221 T 120 ..that I need to transform to the following structure: custID InteractionDate Success Sales 1 20150312 0.5 200 1 20150314 1 150 2 20150221 0.66 520 ..where in this second table the success column is defined as count(purchase=Yes)/(count(purchase=Yes) + count(purchase=No)), and sales is just the sum. I'm quite new to BQ and no-SQL languages. I simply don't know how to do this, I've searched and seen examples that suggest using partition over but I simply haven't seen any example that does just this. Thanks a lot in advance.
|
I have a table that looks like this in Google Big Query: custID InteractionDate Purchased? Sales 1 20150312 F 0 1 20150312 T 200 1 20150314 T 150 2 20150221 T 400 2 20150221 F 0 2 20150221 T 120 ..that I need to transform to the following structure: custID InteractionDate Success Sales 1 20150312 0.5 200 1 20150314 1 150 2 20150221 0.66 520 ..where in this second table the success column is defined as count(purchase=Yes)/(count(purchase=Yes) + count(purchase=No)), and sales is just the sum. I'm quite new to BQ and no-SQL languages. I simply don't know how to do this, I've searched and seen examples that suggest using partition over but I simply haven't seen any example that does just this. Thanks a lot in advance.
|
When running the Display settings (gnome-control-center display) under Gnome 3.6 on Ubuntu 13.04 I'm unable to apply any settings (even if nothing changes). The error I get is: Failed to apply configuration: %s GDBus.Error:org.freedesktop.DBus.Error.ServiceUnknown: The name org.gnome.SettingsDaemon was not provided by any .service files. Background: I've tried to use the newer 3.8 release from the PPA's but that didn't help, I've now reverted to the 3.6 release. I've also tried removing all my gnome related config files, but that didn't make a difference. The error message:
|
I connected an external screen to my laptop, but my desktop didn't automagically extend to it, as it used to do about a year ago (older version of Ubuntu). I went to the display settings. The screen was listed there (correct resolution, brand name, etc.). But when i put the switch on 'on' and click 'apply', i get this error: Failed to apply configuration: %s GDBus.Error:org.freedesktop.DBus.Error.UnknownMethod: No such interface `org.gnome.SettingsDaemon.XRANDR_2' on object at path /org/gnome/SettingsDaemon/XRANDR It's been like this for a few months now, but i'd really like to be able to use an external screen/beamer again. Any ideas? Thanks.
|
I am not DBA ,but I need to check on the size of database files . my database log files earlier was around 32 GB but from last few days it starts increasing and finally reached to 70 GB . first I thought it was natural , but soon I realized that I was wrong . For shrinking the size of log file ,firstly I used to determine the % of space occupied in log file by using . DBCC SQLPERF(logspace) Result was :- log size(MB) > 70 and Log Space Used > 94% with DBCC LOGINFO I found more than 700 transactions having Status = '2' After that I took "log as well as full backup" and run above query again but still got >700 transactions having Status = '2' detached and reattached , but still no difference in size . Then I went for Shrinking log files and for testing purpose I gave the size 60GB . Then run following query again DBCC SQLPERF(logspace) and result was :- log size(MB) > 66 and Log Space Used = 99.1258%. Question is : How can I bring the size of log files near to earlier size i.e. around 32 GB or near by and how to keep check on it so that its size does not change dramatically . ** Recovery Mode :- FULL Thanks in advance ....
|
This one seems to be a common question in most forums and all over the web, it is asked here in many formats that typically sound like this: In SQL Server - What are some reasons the transaction log grows so large? Why is my log file so big? What are some ways to prevent this problem from occurring? What do I do when I get myself on track with the underlying cause and want to put my transaction log file to a healthy size?
|
Let's say we are flipping a coin $n$ times. What is the probability of getting a sequence of at least $k$ heads? So far I've come up with this: If we assume $k=2$, and the number of events satisfying the conditions is $m$ for $N$ throws, then for $N+1$ throws the number of satisfying events is: $2m + \frac{2^N - m}{2}$. $2m$ comes from the situation when the sequence was already there so we can get either heads or tails.$\frac{2^N - m}{2}$ Is when there was no sequence but the last result was heads, so we have to get heads again. This can be made into an equation and solved, I guess. However, it's more difficult to do it for higher $k$. How to proceed further to get a result for higher $k$?
|
Tossing a fair coin for $N$ times and we get a result series as $HTHTHHTT\dots~$, Here '$H$' denotes 'head' and '$T$' denotes 'tail' for a specific tossing each time. What is the probability that the length of the longest streak of consecutive heads is greater than or equal to $k$? (that is we have a $HHHH\dots~$, which is the substring of our tossing result, and whose length is greater than or equal to $k$) I came up with a recursive solution (though not quite sure), but cannot find a closed form solution. Here is my solution. Denote $P(N,k)$ as the probability for tossing the coin $N$ times, and the longest continuous heads is greater or equal than $k$. Then (For $N>k$) $$ P(N,k)=P(N-1,k)+\Big(1-P(N-k-1,k)\Big)\left(\frac{1}{2}\right)^{k+1} $$
|
In a Youtube video on the channel @blackpenredpen, the number of derangements of the word "PURPLE" is calculated as $$\frac{!6 \,- \,!5\, -\, !5\, - \,!4}{2!}$$ I don't understand two things: Why is $!4$ being subtracted rather than being added, according to the Inclusion-Exclusion principle? Why is the answer being divided by $2!$ despite the fact that the two Ps are accounted for already?
|
I am wondering how to calculate the number of derangements for the word BOTTLE. I understand how to actually do the formula for derangements already. My issue is what do you do with repeated letters. Obviously, I will be over counting if I do the typical formula. Makes me think it is the number of derangements with the letter T in their original space, but I am not sure. Can anyone help, as I am wondering if I am supposed to use PIE to solve this. Thanks.
|
I am trying to implement custom action in lightning . The below controller code is to add two numbers and display using toast. It is however throwing the error : Action failed: c:CustomAction$controller$clickAdd [Cannot read property 'setParams' of undefined] The js controller code is: ({ clickAdd: function(component, event, helper) { // Get the values from the form var n1 = component.find("num1").get("v.value"); var n2 = component.find("num2").get("v.value"); // Display the total in a "toast" status message var resultsToast = $A.get("e.force:showToast"); resultsToast.setParams({ "title": "Quick Add: " + n1 + " + " + n2, "message": "The total is: " + (n1 + n2) + "." }); resultsToast.fire(); // Close the action panel var dismissActionPanel = $A.get("e.force:closeQuickAction"); dismissActionPanel.fire(); } }) The component code is : <!--quickAdd.cmp--> <aura:component implements="force:lightningQuickAction"> <!-- Very simple addition --> <lightning:input type="number" name="myNumber" aura:id="num1" label="Number 1"/> + <lightning:input type="number" name="myNumber" aura:id="num2" label="Number 2"/> <br/> <lightning:button label="Add" onclick="{!c.clickAdd}"/> </aura:component> I have copied this piece of code directly from the standard lightning guide.
|
I am dynamically creating a toast as shown below. This toast is created when response is received from server. I have created a component for toast and am dynamically creating it using $A.createComponent. The toast is getting fired when I am testing it in SF1 simulator or when I have added my component in app builder. However, it is not getting thrown on screen, thought it is generated as seen in console.log, in case when I test it using standalone app (adding parent component to .app file and then preview) OR when i render my component using ltng:out in a VF page. What may be the reason for this? controller from where dynamically toast is created: . . . if (component.isValid() && state === "SUCCESS") { console.log("Values updated successfully!"); //$A.get('e.force:refreshView').fire(); //this is also not working this.createToastComponent(component, 'success', 'Success!', 'Record Saved successfully!'); createToastComponent : function(component, type, title, message){ $A.createComponent( "c:ToastComponent", { "type" : type, "title" : title, "message": message }, function(newToast, status, errorMessage){ if(errorMessage === null){ //do nothing } else{ console.log('Toast errorMessage: '+ errorMessage); } } ); }, toastComponent UPDATED: <aura:component > <aura:attribute name="type" type="String" /> <aura:attribute name="title" type="String" /> <aura:attribute name="message" type="String" /> <!--<aura:handler name="init" action="{!c.handleInit}" value="{!this}" />--> <div class="slds"> <div class="slds-notify_container"> <div aura:id="successToast" class="slds-notify slds-notify--toast slds-theme--success" role="alert"> <span class="slds-assistive-text">Success</span> <button class="slds-button slds-notify__close slds-button--icon-inverse" title="Close"> <c:SVGIcon svgPath="/resource/SLDS214/assets/icons/action-sprite/svg/symbols.svg#close" class="slds-button__icon slds-button__icon--large" assistiveText="Close"/> <span class="slds-assistive-text">Close</span> </button> <div class="slds-notify__content slds-grid"> <div class="slds-col slds-align-middle"> <h2 class="slds-text-heading--small ">{!v.message}</h2> </div> </div> </div> </div> </div> toast component controller: ({ handleInit : function(component, event, helper) { var toastEvent = $A.get("e.force:showToast"); console.log('toastEvent: '+ toastEvent+ 'title: '+ component.get("v.title")+ 'message: '+ component.get("v.message")); toastEvent.setParams({ "title": component.get("v.title"), "message": component.get("v.message"), "type": component.get("v.type") }); toastEvent.fire(); } }) Output in console.log: toastEvent: SecureAuraEvent: [object Object]{ key: {"namespace":"c"} }title: SUCCESS!message: Record created Successfully
|
I am trying to prevent a table from showing up in the list of tables. I used long table to create the table. This is the first table in my document. I know the \caption*{} command should do the trick but something weird is happening. Although the table doesn't show up in the list of tables but when I insert the next table it has a caption of "Table 2: ****". I want the numbering to start with 1 rather than 2. Can someone help? \documentclass[12 pt]{article} \usepackage{fullpage} \usepackage{amsmath} \usepackage{float} \usepackage{longtable} \usepackage{caption} \begin{document} First table is inserted here (longtable). \begin{longtable}{l l} \hline A & A1 \\ B & B1 \\ \hline \caption*{}\label{TableNomen} \end{longtable} \newpage Second table inserted here. \begin{table} \centering \caption{Influence of X}\label{TableC} \begin{tabular}{c c c c} \hline $10^{-5}$ & $80\times40$ & 16 & 10 \\ $10^{-4}$ & $80\times40$ & 21 & 11 \\ \hline \end{tabular} \end{table} \newpage \listoftables \end{document} Page 1 Page 2 List of tables
|
For reasons both complex and confusing, I would like to caption a longtable without incrementing the table counter in the process. I want to have two consecutive longtable environments to be captioned with identical table numbers; i.e. one longtable captioned "Table x.y: Data Set (Part A)" and one captioned "Table x.y: Data Set (Part B)", with x.y being identical for both tables. Apparently however, even \caption*{} command bumps table. I am a bit at a loss here. Note: I know that the xtab package would enable me to have one long table with switches of headers and captions mid-table. However I got a (different) problem with that package, akin to but sadly not solved by egreg's answer there; so this question should be considered longtable-only as xtab, supertabular etc. don't float my boat right now. :-(
|
I want to install python-xml package on ubuntu. I see this command for installing it: sudo apt-get install python-xml but $ sudo apt-get install python-xmlReading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package python-xml Should I add repository to fix it?
|
I'd like to use etree, expat or similar, though I understood etree is easier to use. But how do I install that when I already have Python 2.7.2 installed on Ubuntu 11.10? All documentation I can find through Google suggests that xml parsing is available by default for Python. Or at least when I search for install xml parser python, or any combination of similar words, also including etree or expat I can't find what steps to take (a commandline install method).
|
I have uploaded my website in my IIS using static IP. whenever I access it from local or remote it was showing "not secure". How do I resolve this issue?
|
I've called GoDaddy a few different times and they said that it looks like it is a problem with my HTML file. Except, my HTML file is the basic outline of a webpage, nothing fancy at all. Chrome still says that the webpage is, "Not Secure" with the big red x over it. I'm not sure what to do to fix it, I don't have any personal information on the site nor am I collecting any information from visitors (it's sort of an information site). I shouldn't need an SSL certificate because I am not hosting anything privately.
|
On screen lock mac goes to sleep impacting the downloads & etc. Is there any way I can lock the screen with password protection and not loose the connections ? OS version: EL Captain Currently
|
I want to leave my Mac awake overnight so it syncs 4GB of data from Dropbox. I need to prevent the machine from going to sleep because that pauses the Dropbox sync I've been using to keep the computer awake, but it also keeps the computer unlocked which is insecure. I need a method to keep my Mac awake (so that Dropbox can sync overnight) but also locked (so no one can read my email). It'd be great if this method also turned off the screen (to preserve power), but honestly that's not even 100% necessary.
|
I'm looking for an alternative to a specific meaning of the verb "to rest". After a (very) quick search, the definition which I found the best was: Be placed or supported so as to stay in a specified position. I'm looking for an alternative to the word that implies that the position of the object (how it is resting and where it is resting) is uncomfortable. It's not the easiest to explain, so I'll give you the piece. The landline rests in the crook of her neck, and she speaks fast... The landline ____ in the crook of her neck, and she speaks fast... To set the scene, this is essentially a description of the narrator's mother, who is forced to hold the phone uncomfortably as her hands are occupied. Although I found lie (as in, "The landline lies in the crook of her neck...", and this may seem more "negative", it doesn't sound right to me. EDIT 1: A word which is better is wedged: The landline is wedged into the crook of her neck, and she speaks fast... Alternatives and answers are still greatly appreciated. EDIT 2: I'm also looking for something that isn't too much out of touch. EDIT 3: Just to clarify, the landline is the phone itself, not the cord or anything. I didn't realise that it would cause any confusion.
|
What are common phrases an English native speaker would use for the pose of speaking on the phone where you use your shoulder to keep the receiver against your ear (and mouth), so your hands are free? I have some ideas, but they all sound wooden, and I don't think I've ever heard anyone describe this pose in words. It's also pretty much impossible to google for a pose or look it up on leo.org or other dictionaries. OK, since people keep asking for what phrasings I found, I'll provide two, though I was hoping I could avoid influencing people who answer here by not providing them: "balance on one's shoulder", "held/nestled/sandwiched between shoulder and ear".
|
Let $A,B$ be two homeomorph topological space under homeomorphism $\varphi$ and let $\sim$ be an equivalence relation on $A$. Then Does $A\simeq_\varphi B$ imply $A/{\sim}\,\, \simeq B/\varphi(\sim)$? Where $\varphi(\sim)$ is defined as follow $$x,y\in A,\quad x\sim y \iff \varphi(x)\,\varphi(\sim)\,\varphi(y).$$
|
Let $f:X\to Y$ be a homeomorphism between topological spaces. Suppose we have an equivalence relation $\sim$ defined on $X$. Define an equivalence $\sim'$ on $Y$ by $y_1\sim'y_2$ iff $x_1\sim x_2$ where $y_i=f(x_i)$ Is $X/{\sim}$ homeomorphic to $Y/{\sim'}$? I have a well defined continuous map $F:X/{\sim}\to Y/{\sim'}$ given by $[x]\mapsto[f(x)]$. This can easily be seen to be bijective. I am having trouble proving that this is open. I know there is some diagram chasing involved but I am confused. We have the following commutative diagram - $\require{AMScd}$ \begin{CD} X @>f>> Y\\ @Vq_XVV\circlearrowright @VVq_YV\\ X/{\sim}@>>F> Y/{\sim'} \end{CD} If $U$ is open in $X/\sim$ then $q_X^{-1}(U)$ is open in $X$ and $f(q_X^{-1}(U))$ is open in $Y$. To prove that $F(U)$ is open in $Y/\sim'$ we need to show that $q_Y^{-1}(F(U))$ is open in $Y$. This will be true if $f(q_X^{-1}(U))=q_Y^{-1}(F(U))$. But I am having trouble proving this is equality. Any help will be appreciated. Thank you.
|
when I try using a command with sudo everything works fine, however, if I want to log in as the superuser using su it doesn't let me. Why?
|
I am having problems with the su command. I know my password and I am typing it correctly but su indicates authentication failure. So I checked on the internet and then went into recovery mode and changed my username's password to what I was entering before. Even now entering the same password on su gives me authentication failure. Please suggest what am I doing wrong??
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.