Dataset Viewer
query
stringlengths 14
4.09k
| positive
stringlengths 15
4.04k
| negative
sequencelengths 5
5
| dataset_name
stringclasses 1
value | dataset_name_id
class label 1
class |
|---|---|---|---|---|
Exception in thread main java.lang.ArrayIndexOutOfBoundsException
|
What causes a java.lang.ArrayIndexOutOfBoundsException and how do I prevent it?
|
[
"I am trying to do the integration between Salesforce and Xero by using Named Credentials (Authentication Protocol is OAuth 2.0). I created an Auth provider - Then created Named credentials of OAuth 2.0 type and authenticated with required scopes mentioned in the Xero developer document. When I am trying to run the below code to get the Account details from Xero, I am getting \"AuthenticationUnsuccessful\". HttpRequest req = new HttpRequest(); req.setEndpoint('callout:XeroDev/api.xro/2.0/Accounts'); req.setMethod('GET'); Http http = new Http(); HTTPResponse res = http.send(req); System.debug(res.getBody()); This is the response - {\"title\":\"Forbidden\",\"status\":403,\"detail\":\"AuthenticationUnsuccessful\",\"instance\":\"707450d8-b455-47ec-a1b4-85bcb2cf80c9\"} Any suggestion on how to make it work by using Named Credential? Xero URL -",
"How to check if list item already exist when adding it with how to check Title( Country) if exists in the list. if exists it is necessary to do the update if not it is necessary to add it ? function AddListItem() { var listTitle = \"Test\"; //Get the current client context context = SP.ClientContext.get_current(); var airportList = context.get_web().get_lists().getByTitle(listTitle); //Create a new record var listItemCreationInformation = new SP.ListItemCreationInformation(); var listItem = airportList.addItem(listItemCreationInformation); //Set the values var country= $(\"#Country\").val(); var client= $(\"#Client\").val(); // var nb1 = $(\"#nb1\").val(); // var nb2 = $(\"#nb2\").val(); // var nb3 = $(\"#nb3\").val(); // var nb4 = $(\"#nb4\").val(); // // var nb5 = $(\"#nb5\").val(); listItem.set_item('Country', Country); listItem.set_item('Client', Client); listItem.update(); context.load(listItem); context.executeQueryAsync(AddListItemSucceeded, AddListItemFailed); } function AddListItemSucceeded() { } function AddListItemFailed(sender, args) { alert('Request failed. ' + args.get_message() + '\\n' + args.get_stackTrace()); }",
"where is `cd` located?",
"MacOS 10.14 Mojave public beta public Wi-Fi problem I can not connect to a single public Wi-Fi hotspot that does not require a password but instead shows a pop-up window pointed to captive.apple.com The pop-up opens blank with the error \"The web page couldn't be loaded\" Any idea on how to fix this?",
"How to remove RVM (Ruby Version Manager) from my system"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Regarding multiple comparisons, could someone please explain me why the power of false discovery rate (FDR) is greater than the power of family-wise error rate (FWER)?
|
I have read that controlling FDR is less stringent than controlling FWER, such as in : FDR controlling procedures exert a less stringent control over false discovery compared to familywise error rate (FWER) procedures (such as the Bonferroni correction). This increases power at the cost of increasing the rate of type I errors, i.e., rejecting the null hypothesis of no effect when it should be accepted. But I was wondering how it is shown to be true mathematically? Is there some relation between FDR and FWER?
|
[
"Can't install jdk on Fedora with yum nor with rpm",
"Sci-fi story where all 'citizens' had shares in a global company Not everyone was a citizen though, there was a significant underclass who had no shares. One character was a celebrity in some sort of combat game who was followed by camera drones & used drugs to suppress puberty so he waa an eternal 'child', I have the impression that medical science allowed virtual immortality short of accidents. One character (may have been the same one) had had a 'previous life' & had committed personality suicide by some form of mind wipe bequeathing his worldly possessions to the new personality that would eventually develop in his old body. I think the motive for this 'suicide' was essentially boredom, he'd lived a long time. The mind wipe in question was pretty extensive & all encompassing, he had to be cared for & educated from scratch as if a newborn baby in an adult body, nappies & all (but I'm pretty sure this was purely backstory in the book I read). He also had miniature nano organisms (or bots?) like miniature worms or millipedes that complimented his immune system & aided healing, they were self replicating, pretty sure they were some sort of bioengineered organism tailored to his DNA rather than bots but not 100% on that. There was an organism spanning a large area on the planet that absorbed (or consumed) anything that wandered into it but saved the DNA of anything it had previously absorbed & might randomly reproduce any animal plant or individual it had previously absorbed fully formed. One of the characters fell into this but got pulled out before the full effects took hold, as a result he grew leaves from his head & his immune system was then constantly battling with the 'infection'. When did I read this? probably some time in the 80's in the UK. When was it written? I haven't a clue, sorry. It was a paperback, probably something I had out of a library, because I never get rid of anything I've bought myself so I'd still have it & be able to dig it out if it wasn't a library loan. I have lots of fragments of world background & 'colour' that seem to have stuck in my mind there, but a complete lack of any story arc to go with them.",
"Why Didn't People Think That Voldemort Died After His Attack on Baby Harry? After the Avada Kedavra curse rebounded from Harry onto Voldemort, Voldemort disappeared. I'm curious as to why so many key players believed Voldemort was still \"alive\" somewhere, his powers decimated, but, under the right circumstances, able to return to full power. It seems the witches and wizards in chapter one of Philosopher's Stone, The Boy Who Lived, were happy to believe that Voldemort was gone forever. Why didn't everyone believe Voldemort had died, rather than just disappeared? Was it the lack of a body? Or were there other reasons? Here's a couple of quotes from Philosopher's Stone if anyone wants to review them. Otherwise, just disregard. ‘A fine thing it would be if, on the very day You- Know-Who seems to have disappeared at last, the Muggles found out about us all. I suppose he really has gone, Dumbledore?’ ‘It certainly seems so,’ said Dumbledore. ‘We have much to be thankful for.’ Philosopher's Stone - page 13 - Bloomsbury - chapter 1, The Boy Who Lived ‘But what happened to Vol– sorry – I mean, You-Know-Who?’ ‘Good question, Harry. Disappeared. Vanished. Same night he tried ter kill you. Makes yeh even more famous. That’s the biggest myst’ry, see ... he was gettin’ more an’ more powerful – why’d he go? ‘Some say he died. Codswallop, in my opinion. Dunno if he had enough human left in him to die. Some say he’s still out there, bidin’ his time, like, but I don’ believe it. People who was on his side came back ter ours. Some of ’em came outta kinda trances. Don’ reckon they could’ve done if he was comin’ back. ‘Most of us reckon he’s still out there somewhere but lost his powers. Too weak to carry on. ’Cause somethin’ about you finished him, Harry. There was somethin’ goin’ on that night he hadn’t counted on – I dunno what it was, no one does – but somethin’ about you stumped him, all right.’ Philosopher's Stone - pages 46-47 - Bloomsbury - chapter 4, The Keeper of the Keys",
"Why was William Cage sent to the base?",
"I have a beautiful inequality, but I can only prove part of cases. Given any positive real numbers $a,b,c$, we have $$(a^{2}+2)(b^{2}+2)(c^{2}+2)\\geq 9(ab+bc+ca)$$ How can we prove this statement?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Why is Brace expansion with variables not working as expected? I would like to set a variable (x=100) in the brackets such as x=100 for i in {0.."$x"..50} ;do echo $i done the desire output for i should be 0 50 100 although I get as an output {0..100..50}
|
Use variable inside bash brace expansion I have a program that generates a variable number of pictures, ordered like that: 1.jpg, 2.jpg [...] 10.jpg..etc I can't use *.jpg as input because the 10 will be processed before 2, 3, etc. so I want to use: convert page_{1..$N}.jpg out.pdf but does not work. How should the command be?
|
[
"I'm trying to remember the title of a book. The plot was a group of people are stranded on a comet or asteroid. They establish kind of a colony inside it, and rig up rockets on the surface to move it. Some of the people discover some sort of algae type life form inside it, which bonds with and mutates people helping them to survive. They set the asteroid to head for Earth but have to change the course when authorities on Earth threaten to blow the asteroid up because of the mutations.",
"Where can I find fantasy minis on the cheap? I'm looking to build a collection of fantasy miniatures, preferably pewter - but I don't want to buy them one at a time from my local hobby store... Much too expensive, and they don't often carry anything I'm interested in buying, which makes it a long term venture as well. So I'm looking for ideas on how to obtain many miniatures at once, preferably for cheap. D&D Miniatures aren't a good source for me as they're collectibles, and the prices on those are also prohibitive. By the way - they don't have to be pewter, that's just my preference. =)",
"The Fourier transform of a \"comb function\" is a comb function? Let $f(x) = \\sum_{n=-\\infty}^{\\infty} \\delta(x - n)$, where $\\delta$ is the Dirac delta function. This function $f$ (a \"comb function\") is important in signal processing because evenly sampling a function $g$ can be viewed as multiplying $g$ pointwise with $f$. This idea is the first step towards understanding how to approximate the Fourier transform of $g$, given evenly spaced samples of $g$. The next step is to note that $\\hat{gf} = \\hat{g}*\\hat{f}$, where $\\hat{f}$ is the Fourier transform of $f$ and $*$ denotes convolution. Is it true that $\\hat f$ is also a comb function? If that statement isn't quite right, what is the correct statement? I would like to see: 1) an informal, intuitive, nonrigorous but easy derivation of the Fourier transform of $f$ . 2) A rigorous version of the same calculation. (How would you even define $f$ rigorously, is it a distribution?) (I'd also be interested in recommendations of math textbooks that cover this topic, including the Nyquist sampling theorem, even if it's only an exercise or series of exercises in an analysis textbook.)",
"When adding image from Wikimedia Commons, automatically add author/license/link Many Stack Exchange questions and answers embed images from Wikimedia Commons. It is probably the most used image source here. Good news Thanks to their license, all images from Wikimedia Commons can be legally used inside Stack Exchange. Bad news The only requirement is to cite the author/license (), an easy task, but we are totally failing at it, only maybe 1% of Commons images used here are properly cited. That makes our use of these images illegal, and could expose Stack Exchange to various legal threats. Not my problem, you could say, but this is also important because , bringing Stack Exchange closer to closed-data sites like Yahoo! Answers or Experts-Exchange. Proposed solution When using the image addition widget, the widget should detect whether the image's URL has a *.wikimedia.org domain, and if yes: (optional) Transfer the image to imgur, for perennity reasons. Retrieve the author name and license name from Commons (there is a very reliable API that gives that). Concatenate into a proper citation, maybe something like "*Credit: [" + author + "](" + commonsPageURL + ") , [" + license + "](" + licenseURL + ")*" Insert the citation at the same time as the image's MarkDown. Benefits: Remove a large part of Stack Exchange's copyright violations. Makes us a good citizen in the open data world. Remember what happens to sites who disregard ethics (Experts Exchange). Consistent citations. Zero added burden for the users.",
"The actual question was to find the area bounded by the curve $y=\\int_{-1}^{1}(1-x^2)^ndx$ and coordinate axes. But I haven't came across these type of problems with power $n$."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
127 million bytes but 204MB on disk? Am I missing something basic or is this a bug ?
|
Size in bytes is significantly less ( half the size) then size in MB in get info window In the get info window it says 387,037,139 bytes which is 387 MB whereas the size on disk is 716.9MB which is 716,900,000 bytes. du -sh paramgen result (in MiB) 684M paramgen Why is there such a large difference?
|
[
"Overstayed my US visa for over 9 years, never got deported, can I return as a tourist?",
"Ubuntu 20.04 no sound out of Bluetooth headphones",
"When will my device get the Android 4.4 update (KitKat)? Android 4.4 (KitKat) was officially announced on October 31, 2013. (You can review at the official Android Developer's site or the .) Of course, not all devices will get this update right away and others won't get it at all. Each manufacturer and carrier often choose to add their custom modifications which tend to delay the official release. When will each device get Android 4.4, either officially or unofficially, if ever? See also:",
"Conditional Linq Queries We're working on a Log Viewer. The use will have the option to filter by user, severity, etc. In the Sql days I'd add to the query string, but I want to do it with Linq. How can I conditionally add where-clauses?",
"Getting JavaScript object key list"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Why 121.0 - 121.0 returns 2.84217094304e-14 in python? I have two variables: result = 121.0 # initialized in code, assigned in loop dd = -121.0 # value returned from result of function So, when I do result += dd result becomes 2.84217094304e-14 (name of this representation of numbers and algorithm of reading is welcome) But when I assign same values in python console - it returns proper result - 0.0 What is the problem?
|
Is floating point math broken? Consider the following code: 0.1 + 0.2 == 0.3 -> false 0.1 + 0.2 -> 0.30000000000000004 Why do these inaccuracies happen?
|
[
"Are you less likely to down-vote someone whose gravatar is a photograph of them? I know this is hard to answer since, to the extent that anyone does this, they likely don't do it consciously. In the spirit of Richard Wiseman and I just wondered what were people's thoughts on it. Please bear in mind that that's me in the picture, and if you down-vote this, that'll be a real person hurtin', not some abstract symbol.",
"Writing basic systemd service files",
"I just started blender and one of the main things you have to do is to render to make an animation, but I can't seem to do that. Whenever I click Render and then render image or render animation, at the top of the screen it says 'No camera found in Scene \"Scene\". I don't know why this is happening.",
"escaping double quotes and percent signs (%) in cron The following command works from prompt but not from crontab. grep abc /var/log/messages | grep \"`date '+%B %d'`\" | mail -s\"abc log of `hostname`\" shantanu.oak+`hostname`@gmail.com I need to add it to daily cron.",
"Favorites improvements - search, categorize, personal tags, add note, favorite answer I'm a big fan of the favorites feature. I usually mark questions with good answers of code snippets for later use. Most of the time I can't find the favorite I'm looking for so quickly as desired. I know I marked the question in Stack Overflow, but it takes time to find it again, because of the following reasons: lot of favorites lot of answers for a question (last time I was looking for an answer in the question ) the question title is not always what I'm looking for To make favorites more useful I suggest the following features to be added: Allow to mark an answer as favorite Allow to tag questions with own tags (those tags are personal and can not be seen by others) Search function over favorites Allow to add a personal note to a question"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Is this a curried function? I am studying for JS coding interviews and just wanted a simple example of JS currying. Does this example pass as currying? function curry(a){ return function(b){ return function(c){ console.log(a+b+c) } } } curry(2)(2)(2)
|
What is 'Currying'? I've seen references to curried functions in several articles and blogs but I can't find a good explanation (or at least one that makes sense!)
|
[
"Here are two examples of what I mean: I am sure you all too have experienced this frustration before. A dialog box opens that displays only part of a long string (e.g. a file path), but won't allow you to select the text so you can read the full string. Neither text container will resize upon window resizing. (By the way, you can force windows —specially dialog boxes— to resize with tools such as , but helps little in this case, since controls are fixed-width.) The text is hidden, period. Copying a very long drop-down list control contents to a text file. Do you know any way to solve these problems?",
"I have an input type=\"image\". This acts like the cell notes in Microsoft Excel. If someone enters a number into the text box that this input-image is paired with, I setup an event handler for the input-image. Then when the user clicks the image, they get a little popup to add some notes to the data. My problem is that when a user enters a zero into the text box, I need to disable the input-image's event handler. I have tried the following, but to no avail. $('#myimage').click(function { return false; });",
"Let me say first that I am fairly new here (about 3 weeks) and absolutely love Stack Overflow. At first I let some of the negative attitudes get to me a little, left a few snarky comments, but that phase has passed. I see the tremendous value for this site in the long run and sincerely do want to help make it a better place. I find myself going for the downvote very frequently -- currently about 35% of my votes are downvotes. I even make an extra effort to upvote good content to offset this a bit, so the number should probably be more like 60%. I always try to leave constructive comments and try to help out the confused ones who are really trying. I truly can't tell if it is just me, or if these folks deserve it. I don't know if you guys noticed, but there are a lot of really bad questions being posted, and a lot of people trying to pass off things like \"use jQuery\", \"use Firebug\", and \"use Google\" as good answers (and getting upvotes!). I even saw someone copy/paste my \"What does Firebug say?\" comment as an answer and get 3 votes within moments. Sometimes This answer is unclear or not useful just doesn't do it justice. I feel like some of the people just drive me nuts, but then again I feel this way IRL :) Am I being too harsh, or is it really that bad on SO? Has there recently been a surge of new users, and the quality of content is degrading, or was it like this in the \"good old days\"? Have I perhaps misunderstood the expected behavior on Stack Overflow -- should I just ignore these crappy questions and answers rather than downvote them?",
"I would like to set a maximum execution time for sql queries like set_time_limit() in php. How can I do ?",
"Proving that two systems of linear equations are equivalent if they have the same solutions I've just begun to work learn Linear Algebra on my own through Hoffman and Kunze's book and the first problem set already has a question that I can't solve: Prove that if two homogeneous systems of linear equations in two unknowns have the same solutions, then they are equivalent. I can't seem to figure out how to prove this without resorting to case work where you account for the cases where one of the coefficients are zero and when both are. Is there an elegant way to prove in general that when two systems of linear equations have the same solutions, they are equivalent? The converse is obvious enough though. Definition of equivalence from the text : Let us say that two systems of linear equations are equivalent if each equation in each system is a linear combination of the equations in the other system."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Untrusted connection when visiting per-site meta over SSL Steps to reproduce: In Firefox (with ), visit a non-trilogy Stack Exchange site (for example, ) Get redirected to the HTTPS version Click on meta link (for example, ) What should happen: Meta site opens What happens instead: "This Connection is Untrusted" message appears: meta.movies.stackexchange.com uses an invalid security certificate. The certificate is only valid for the following names: *.stackexchange.com, stackexchange.com, meta.stackexchange.com, *.meta.stackexchange.com, *.stackoverflow.com, stackoverflow.com, serverfault.com, stackauth.com, sstatic.net, meta.serverfault.com, superuser.com, meta.superuser.com, stackapps.com, openid.stackauth.com (Error code: ssl_error_bad_cert_domain) Notes: It also happens if you visit instead (you get redirected to HTTPS and the error occurs) Another random example, Trilogy metas work, works (but doesn't - I am not sure what gave me that link) Replacing URL with https://*.meta.stackexchange doesn't work Here is the screenshot:
|
Better HTTPS support for Stack Exchange sites So it looks like Stack Exchange now supports HTTPS (to some extent). Which is awesome! But there are a few problems, the main one being that some content is delivered over the CDN, which is plain HTTP. This causes browsers to complain about "unsecured content":
|
[
"What kind of mortar should I use to point a fieldstone foundation? The old mortar is crumbling, and sandy mortar is falling out onto the basement floor. I plan to remove the crumbling mortar (see ), then point the foundation with new mortar. But what kind of mortar should I use? I have had a hard time finding definite answers about fieldstone foundations on the Internet, but I'll include some of what I've found here. First, has this to say about fieldstone foundations: Most fieldstone foundations have, or had at some time, a thin mortar coating on the face of the stone. The purpose of this coating was to assist in holding the stones in place. This thin mortar coating will inevitably flake off from any moisture migration, revealing the surface of the stones. As this coating continues to erode, the mortar between the stones will begin to crumble and the soft, sandy mortar begins to slowly fall out onto the basement floor. It looks like a small pile of sand at the base of the foundation. When this occurs, tuck pointing is needed to refill the voids where the old mortar has fallen out. It's very important that you scrape away or chip away the crumbling mortar (in between the stones) in order to establish a small cavity or key way which can hold the new mortar that is being applied. Never apply new mortar over any old crumbling mortar, as this is a temporary fix and it will only last a couple years. All crumbling mortar must be removed in order for the newly applied surface to bond properly. While upgrading your field-stone foundation, only work on a section at a time. Do not remove the old mortar throughout the entire basement all at once. Complete all removal, tuck pointing and parging one section at a time. To avoid annual tuck pointing, you should finish the foundation with a complete top coating of mortar. Be sure it is lime based. This top coat does not have to look like a stone artisan's creation: It merely has to serve the purpose of keeping the newly installed mortar in place. It's sort of like applying a frosting to a cake. seems to suggest that I should be using not straight type-S hydrated lime, but type-S mortar, which consists of one part Portland cement, ¼ to ½ part lime, and an amount of sand equal to 2¼ to 3 times the total volume of cement and lime. Do I need to analyze the existing mortar to make sure that the new mortar has the same lime content, as ? Should I expect the new mortar to start crumbling and releasing dust soon, or should it stay solid and dust-free for many years?",
"How to install TP-LINK Archer T4U driver?",
"By just typing some commands, how can Ubuntu be uninstalled? I don't want to install Windows or anything, leaving my PC without an OS. Would this command work? sudo rm -rf /",
"A set of elements in a reduced unity ring Let $(A,+,\\cdot)$ be a unity ring with the property that if $x \\in A$ and $x^2=0$ then $x=0$. Consider the set $M=\\{a\\in A | a^3=a\\}$. Prove that: a) $2a\\in Z(A)$, $\\forall a\\in M$, where $Z(A)$ denotes the centre of the ring $A$; b) $ab=ba$, $\\forall a,b\\in M$. My attempts revolved around the fact that an idempotent element in a reduced ring is central. So, since for $a\\in M$ we have that $(a^2)^2=a^2$, it follows that $a^2\\in Z(A)$, $\\forall a\\in M$. The next thing I wanted to use in order to solve a) was that $Z(A)$ is a subring of $A$, so if I had proved that $(a+1)^2 \\in Z(A)$, $\\forall a\\in M$, then we would have reached the desired conclusion. However, I couldn't prove this and I honestly doubt that it is true. Another idea that I had was to prove that $M$ is a subring of $A$. Of course, this didn't work out because I cannot even prove that $M$ is closed under addition. Again, I don't know if this is true and it most likely isn't. As for b), I think that a) should be of use, but I don't know how. It is a well-known problem that a ring with $x^3=x$ for any $x$ in that ring is commutative, but since $(M,+,\\cdot)$ is almost definitely not a ring, this doesn't help. EDIT: Is there any chance that this question is simply wrong? I tended to believe this before asking it here too, but since nobody has made any progress on it until now I am even more inclined to think so.",
"How is every subset of the set of reals with the finite complement topology compact? While we know that every finite set is compact, how to prove that every infinite subset of $\\mathbf{R}$, the set of all real numbers, is also compact in the finite-complement topology (also called the co-finite topology)? What is the situation in the case of an arbitrary infinite set $X$ with the finite-complement topology?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Free 100 rep on every Stack Exchange account including the parent account?
|
Linked account +100 rep bonus also applied to account with 200
|
[
"How to return multiple objects from a Java method? I want to return two objects from a Java method and was wondering what could be a good way of doing so? The possible ways I can think of are: return a HashMap (since the two Objects are related) or return an ArrayList of Object objects. To be more precise, the two objects I want to return are (a) List of objects and (b) comma separated names of the same. I want to return these two Objects from one method because I dont want to iterate through the list of objects to get the comma separated names (which I can do in the same loop in this method). Somehow, returning a HashMap does not look a very elegant way of doing so.",
"How To Set Default Wallpaper As Login Screen Wallpaper [Automatically]?",
"How do I obtain the \"final\" standard deviation from a series of values containing individual (also null) SD values? I have a list of values, say: AVGprice SDprice count year 10 3 5 1999 20 2 3 2000 30 8 20 2001 40 undef 1 2002 where AVGprice is the average of a certain price and SD its respective standard deviation for that particular year. Count represents the number of occurrences. What's the best way to calculate the final AVGprice and SDprice for the whole period 1999-2002? For the former, I'd say a weighted average will do, but I am not sure about the final standard deviation - specially because of the undefined value.",
"How to find out which (not installed) Debian package a file belongs to? On Debian systems (and derivatives): $ dpkg --search /bin/ls coreutils: /bin/ls That is, the file /bin/ls belongs to the Debian package named coreutils. But this only works if the package is installed. What if it's not?",
"When is the graph of the divisor relation on $[n]$ planar?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
When a particle keeps "accelerating" near the speed of light, is the energy gained expressed in linearly gained impulse, or relativistic mass?
|
Some people say that mass increases with speed, some people say that the mass of an object is independent of its speed. I understand how some (though not many) things in physics are a matter of interpretation based on one's definitions. But I can't get my head around how both can be 'true' is any sense of the word. Either mass increases or it doesn't, right? Can't we just measure it, and find out which 'interpretation' is right? e.g.: (in some sophisticated way) heat up some particles in a box and measure their weight? ------------------------------ UPDATE Right, so I've got two identical containers, each with identical amounts of water, each on identical weighing scales, and each in the same g field. If one container has hotter water, will the reading on its scale be larger than the other? If the answer is yes, and g is constant, does this mean that the m in w=mg has got bigger?
|
[
"How to urlencode data for curl command? I am trying to write a bash script for testing that takes a parameter and sends it through curl to web site. I need to url encode the value to make sure that special characters are processed properly. What is the best way to do this? Here is my basic script so far: #!/bin/bash host=${1:?'bad host'} value=$2 shift shift curl -v -d \"param=${value}\" http://${host}/somepath $@",
"I'm working on exercises from Kunen and I'm stuck. I must proof that the following are equivalent: There exists a sequence $\\langle A_\\alpha:\\alpha<\\omega_1\\rangle$ such that $\\forall\\alpha(A_\\alpha\\subset\\alpha)$ and for all $A \\subset \\omega_1$ the set $\\{\\alpha \\in \\omega_1:A\\cap\\alpha=A_\\alpha\\}$ is stationary. ($\\diamondsuit$-principle) There exists a sequence $\\langle A_\\alpha:\\alpha<\\omega_1\\rangle$ such that $\\forall\\alpha(A_\\alpha\\subset\\alpha\\times\\alpha)$ and for all $A \\subset \\omega_1\\times\\omega_1$ the set $\\{\\alpha \\in \\omega_1:A\\cap\\alpha\\times\\alpha=A_\\alpha\\}$ is stationary. There exists a sequence $\\langle f_\\alpha:\\alpha<\\omega_1\\rangle$ such that $\\forall\\alpha(f_\\alpha:\\alpha\\rightarrow\\alpha)$ and for all $f : \\omega_1\\rightarrow\\omega_1$ $\\exists\\alpha(f|\\alpha=f_\\alpha\\wedge\\alpha>0)$ There exists a sequence $\\langle f_\\alpha:\\alpha<\\omega_1\\rangle$ such that $\\forall\\alpha(f_\\alpha:\\alpha\\rightarrow\\alpha)$ and for all $f : \\omega_1\\rightarrow\\omega_1$ the set $\\{\\alpha \\in \\omega_1:f|\\alpha=f_\\alpha\\}$ is stationary. I have proved that $1\\implies 2\\implies 4\\implies 3$ and that $4\\implies 1,$ but I'm having problems on proving that $3\\implies$ \"something\", because it only talks about one $\\alpha$. Can someone help me?",
"Stack Exchange app iPhone X optimization The Stack Exchange app doesn’t look very good on Apple’s brand new flagship phone yet. Also the app can’t identify the device model either. (Says Unknown (iPhone 10,3)) App Version: 1.6.6.2 Device: iPhone X (iPhone10,3) OS Version: Version 11.1 (Build 15B93)",
"Story about last 2 men on Earth. One very evil, and the other very ethical",
"If $G$ is cyclic, then $G/H$ is cyclic? The proof I got goes like this: $G$ is cyclic, so $G=<g>$ for some $g\\in G$. So any coset in $G/H$ would be of the form $Hg'=Hg^n$ for some $n$. So $Hg$ is an generator of $G/H$. Thus, $G/H$ is cyclic. I might just be confusing myself, but we have only shown that $Hg'$ is in form of $(Hg)^n$. But what if we are missing some $n\\in\\mathbb{N}$? That is, there is no quotient group of the form $Hg^2$, for example. To make myself a little bit clearer, I think what the above proof has done was showing that $\\forall Hg'\\in G/H, Hg'\\in <Hg>$, thus $G/H \\subset <Hg>$. I feel that this is not a complete proof."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
What are some good introductory books for self-studying topology? A friend of mine, who likes math and knows I do too, told me he thinks topology is really cool. So, I was wondering if someone could suggest to me some good introductory topology books. Thanks in advance!
|
Best book of topology for beginner? I am a graduate student of math right now but I was not able to get a topology subject in my undergrad... I just would like to know if you guys know the best one..
|
[
"Copy maintenance plans to a different server Is there a way to copy maintenance plans from one SQL Server 2012 to another? Both servers are not accessible via the same copy of Management Studio at the same time (on different networks).",
"In it says that flagged comments can be handled automatically if flagged repeatedly (3 + (score / 3) flags = deletion). Which is great; mods are busy people. In , the venerable Bill the Lizard says that if all comments on a post are obsolete, you can flag the post (or one of the comments) with a custom flag saying that they're all obsolete, and the mod can remove them with one fell swoop. Problem is, that requires a mod. What should I do when some of the obsolete comments are mine? I can't flag my own comments, and I don't like raising custom flags if I can avoid it. You're wondering why I don't just delete them. There are two scenarios where I don't, at least not immediately: Someone has commented with incorrect information. In that situation, I reply to the comment telling them how they've got it wrong. (Sometimes, of course, they quite correctly reply telling me how I got it wrong, which is neither here nor there — we still end up with obsolete comments. :-) ) Frequently, they reply saying \"you're right\" but (near universally) leave the comment lying around. I can (and do) then comment again saying \"Let's clean these up\" and flag their comments as obsolete. But I can't flag mine. Nor do I want to remove mine while the incorrect comment is still there; it leaves a confusing situation for anyone coming to the post later. Someone has commented with correct information. In that situation, if appropriate (e.g., the post author isn't busily editing at the same time and I know enough to do it properly), I'll edit the comment into the post and reply with \"You're right, edited that in.\" and flag their comment as obsolete. These are rarely removed by the commenter. And again I can't flag mine. The first scenario is the more problematic, since I can go back 10-20 minutes later and remove my \"edited that in\" comment and there's no harm if their comment is still there. I currently bookmark and check back periodically, but that's labor-intensive and I'd like a better way. Ideally, I'd want to tie my comment to one I've flagged so that it's deleted automatically if the other one is (by flagging, or by the commenter). That's a fair bit of development, though, I'm guessing. What should I do? Go with a custom flag saying \"The conversation between X and me is now obsolete,\" even though that means dumping it on a mod?",
"Is it possible to plot a graph of any shape? In school, I have learnt to plot simple graphs such as $y=x^2$ followed by $y=x^3$. A grade or two later, I learnt to plot other interesting graphs such as $y=1/x$, $y=\\ln x$, $y=e^x$. I have also recently learnt about trigonometric graphs and circle equations. In the internet, I have seen users posting graphs of different shapes like a heart-shaped graph and a Batman logo-shaped graph. I am sure there are numerous more graphs that I have yet to see. Seeing that the graphs can be shaped into shapes like the Batman logo and a heart brings me to my question: Is it possible to plot a graph of any shape regardless of its complexity? Perhaps, shaped into an outline of a person or a landmark? Why or why not?",
"ASP.NET Call Code Behind Function From Javascript",
"How can I replace Windows with Ubuntu? My laptop is filled with viruses and Windows XP is just becoming impossible to work with. I've been interested in Ubuntu for a while, so, would I be able to use something like Debian to clear my HDD and OS and then install Ubuntu and start fresh?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
I have a laptop that had Windows 7 previously installed but now has Windows 8.1. I want to dual boot with Ubuntu 13.10. But I was curious on how to do this properly and in the case that GRUB messes up my computer just delete it and restore it to the original Windows bootloader. Also DON'T recommend EasyBCD. I don't mind using GRUB but I want to be sure I can remove Ubuntu and GRUB.
|
I need my pre-installed version of Windows 7 (or any other version of Windows), how could I install Ubuntu without erasing it?
|
[
"Installing \"firmware-b43-installer\" offline",
"Why would I want to install a snap if I can install via apt instead?",
"This question, , seems to indicate $$\\nabla_a \\sqrt{g}=0.$$ Why is this the case? I've always learned that $$\\nabla_a f= \\partial_a f,$$ hence surely $$\\nabla_a \\sqrt{g}= \\partial_a\\sqrt{g} \\neq 0. $$ Where's the hole in my logic?",
"Probability of a player winning before another Given a 7 sided dice, 2 players roll it independantly simultaneously and when a player rolls a '6' he gets a prize. What is the probability of the first player getting a prize before the second? So my solution is to sum over all the turns j in which player 1 could win, and make the second player lose all these turns: $$P(A) = \\sum_{i=1}^{\\infty}(6/7)^{j-1}*(1/7)*(6/7)^j = 0.461$$ My question is if my solution is correct, and if so, why is the probability so low? It seems to me that either player 1 wins before the 2nd or the other way around, and the probability of them playing forever is 0, so it should be 0.5?",
"Mann-Whitney U test and K-S test with unequal sample sizes"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Is there any way to parenthesize a part of an expression which is already typed, by using a keyboard shortcut or something?
|
Parenthesize what I have highlighted
|
[
"What are the antonyms of \"append\" and \"prepend\"?",
"Analogue of the Cantor-Bernstein-Schroeder theorem for general algebraic structures The Cantor-Bernstein-Schroeder theorem states that if there are two sets $A$ and $B$ such that there exist injective (alternatively, surjective, assuming choice I think) maps $A \\to B$ and $B \\to A$, then $A$ and $B$ are in bijection. It then seems natural to try to strengthen the result to other structures. If $A$ and $B$ are, say, groups (or rings, modules, etc) such that there are injective homomorphisms from each to the other, then $A$ and $B$ are isomorphic. I'm wondering if there are any results on this, or if there are known counterexamples. The theorem for sets alone is nontrivial, so I feel like any results about how it holds for other structures would be quite interesting.",
"How to access Render Result pixels from python script? Render Result exists in bpy.data.images[\"Render Result\"] but it contains no data. Also bpy.data.images[\"Render Result\"].size[0] is 0, even if the render shows as an image in the UV/Image Editor with a width of 1366. Maybe the render result cannot be accessed as an image or I missing some update or refresh call somewhere but I can't find such a thing in the 2.68 API documentation. Any tip in the correct direction appreciated.",
"Idea behind proof that $\\frac{21n+4}{14n+3}$ is irreducible for all $n$ I have a proof of $\\frac{21n+4}{14n+3}$ being an irreducible fraction for any positive integer $n$. The proof starts with the following: Indeed, from the equality: $$2(21n+4)-3(14n+3)=-1$$ and so on..But how does this equality follow from the fraction?",
"I looked up a few grammar-teaching websites (in Chinese language). The website says many people do not use the phrase \"A xxx of\" correctly because they do not identify the subject of the phrase correctly. The website says phrases like \"A range of; A high percentage of\" is singular, while \"a number of; a group of; a couple of; a total of\" is plural. Therefore according to the website, the correct sentences should be as follows. A wide range of courses is available. (\"A wide range\" is the subject) A high percentage of peptides that are made of amino acids is present in the sample. (\"A high percentage\" is the subject) A number/ group/ couple of people were killed in the earthquake.(\"people\" is the subject ) A total of 230 employees were laid off. (\"employees\" is the subject) I don't get the pattern here. All of this looks (or should I use \"look\"?) arbitrary to me. In fact I thought this phrase is supposed to be arbitrary and whether the phrase is plural or singular should depend on the the person's own judgment. How do I identify the correct subject in the \"A xxx of\" phrase?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
This is question numebr 13 exercise 3.1 wayne patty topology. Let $p$ a cut point of a connected space $(X, \mathcal{T})$ and suppose $A$ and $B$ form a separation of $X-\{p\}$. Prove that $A \cup \{p\}$ is conected. Attempt: I proved A and B are connected using contradiction. Now , For A$\bigcup ${p} to be connected I need to only prove that $Closure (A) \bigcup ${p} $\neq \phi$. I assumed let p doesnot belongs to closure of A and trying to get some contradiction but I am unable to do so. Please help!
|
Let $p$ a cut point of a connected space $(X, \mathcal{T})$ and suppose $C$ and $D$ form a separation of $X-\{p\}$, i.e $$X-\{p\}=C \cup D$$ Prove that $C \cup \{p\}$ is conected. I have this idea: Since $p$ is a cut point then $X-\{ p \}$ is not connected, and since $C$ and $D$ form a separation of $X- \{p \}$ then $X-\{p \} = C \cup D$, and also $C \cup D$ is not connected. And also $$C \cap \overline{D}= \overline{C} \cap D= \emptyset$$ I need an idea to continue please
|
[
"Want \\section* to change the page header In a book, I have several numbered sections followed by an unnumbered section. I have placed an \\addcontentsline following the \\section* that introduces the unnumbered section, so that it will appear (unnumbered) in the ToC; that works fine. However, the page headers for the unnumbered section are continued from the last numbered section. I am using fancyhdr with the following setup: \\pagestyle{fancy} \\fancyheadoffset{0in} \\renewcommand{\\chaptermark}[1]{\\markboth{#1}{}} \\renewcommand{\\sectionmark}[1]{\\markright{\\thesection\\ #1}} \\fancyhf{} \\fancyhead[LE,RO]{\\thepage} \\fancyhead[C]{\\bfseries \\draftinfo} \\fancyhead[LO]{\\sf\\rightmark} \\fancyhead[RE]{\\sf\\leftmark} \\fancyfoot[C]{\\bfseries \\draftinfo} \\fancypagestyle{plain}{% \\fancyhead{} % get rid of headers \\renewcommand{\\headrulewidth}{0pt} % and the line }",
"How to compute the formula $\\sum \\limits_{r=1}^d r \\cdot 2^r$? Given $$1\\cdot 2^1 + 2\\cdot 2^2 + 3\\cdot 2^3 + 4\\cdot 2^4 + \\cdots + d \\cdot 2^d = \\sum_{r=1}^d r \\cdot 2^r,$$ how can we infer to the following solution? $$2 (d-1) \\cdot 2^d + 2. $$ Thank you",
"Is it possible to use the animals that are summoned using Conjure Animals as mounts? As an example: Summoning Giant Eagles to carry a group up the mountain or over a wall.",
"How to SEO a Single-Page website",
"Removing non numeric characters from a string"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Use Mathematical induction to prove that for all integers, $n$ is greater than or equal to $1$. I am confused on what to do after I do the the basis step that is using $n$ as $1$. $$\frac{1}{1 \cdot 2} + \frac{1}{2 \cdot 3} +...+\frac{1}{n(n+1)}=1-\frac{1}{n+1}$$
|
I am trying to prove the summation formula using induction: $$\sum_{k=1}^n \frac{1}{k(k+1)} = 1-\frac{1}{n+1}$$ So far I have... Base case: Let n=1 and test $\frac{1}{k(k+1)} = 1-\frac{1}{n+1}$ $\frac{1}{1(1+1)} = 1-\frac{1}{1+1}$ $\frac{1}{2} = \frac{1}{2}$ True for n=1 Induction Hypothesis: Assume the statement is true for the n-th case $\sum_{k=1}^n \frac{1}{k(k+1)} = 1-\frac{1}{n+1}$ Inductive Step: Prove, using the Inductive Hypothesis as a premise, that $$\sum_{k=1}^{n+1} \frac{1}{k(k+1)} = \sum_{k=1}^{n} \frac{1}{k(k+1)} + \frac{1}{(n+1)(n+2)} = 1-\frac1{n+1} + \frac{1}{(n+1)(n+2)} = \frac{(n+1)(n+2)}{(n+1)(n+2)}+\frac{-2-n}{(n+1)(n+2)}+\frac{1}{(n+1)(n+2)} = \frac{(n+1)(n+2)-2-n+1)}{(n+1)(n+2)} = \frac{(n+1)(n+2)-n-1}{(n+1)(n+2)} = \frac{n^2+2n+1}{(n+1)(n+2)} = \frac{(n+1)(n+1)}{(n+1)(n+2)} = \frac{n+1}{n+2}$$ To prove $$ 1-\frac{1}{n+2} = \frac{n+1}{n+2} $$ Multiply both sides by $n+2$ to get an equivalent expression. $$ (1-\frac{1}{n+2}) * (n+2) = (\frac{n+1}{n+2}) * (n+2) $$ $$ n+1=n+2−1 $$ Does this all make sense? How can this be improved upon?
|
[
"Just don't show UI for actions that can't be actioned Recently I just deleted one of my answer in stackoverflow where there was one comment. After deleting the answer it also show for sometime that we all know but in the comment it still allow us to up to make it useful but as I clicked it it just showed me the message: If we are not allowed to do then what was the meaning? Why don't it just be removed or make it disable if the answer is deleted. Just don't show UI for actions that can't be actioned",
"Why doesn't grep using pipe work here? I have the following command: find / -name libGL.so.1 Which returns lots of lines with \"Permission denied\". I want to exclude such lines, so I added the following: find / -name libGL.so.1 | grep -v 'denied' But the output is the same - my grep -v 'denied' is not filtering out the lines with Permission denied. I've tried many variations, looked over grep tutorials, but I cannot figure out the problem. Any suggestions?",
"Removing the password from a PDF file I have a couple of ebooks as PDFs with passwords, however my ebook reader (sony prs600) doesn't seem to support PDFs with passwords. What is the easiest of removing the password from a PDF (I know the password, which presumably helps a lot). It's a bit annoying buying a book and then only being able to read it in front of a computer.",
"I have been given the task to rewrite a function as a sum of an even and an odd function. But when I went to analyze the parts of the original function I noticed that one part was neither even nor odd. The original function was: $g(x) = (x + 1) / (x^2 - 3x + 4$) After analyzing I realized that when using f(-x) to determine symmetry it produced a 'neither' result. How would I go about writing a function that is neither even nor odd as an even function. (It would have to be an even function as the (x+1) part of the original function is odd and since I need to write it as a sum of even and odd, the denominator would need to be even.",
"Bash Brace Expansion & Variables I have a find command: find Directory/{Alpha,Bravo,Charlie} arg1 arg2 I want to replace Alpha,Bravo,Charlie with $find_dir find Directory/{$find_dir} arg1 arg2 however the latter expands to find Directory/{Alpha,Bravo,Charlie} arg1 arg2 rather then find Directory/Alpha Directory/Bravo Directory/Charlie arg1 arg2 Why? It's part of a fairly complex bash script that may have more or less directories, not all which are relevant (so globbing Upload/* would not work). So if I setup three now and add another, I'll have to manually add it in later. Plus I need it run from the root of directories to keep finds outputs perspective (./Upload/Dir/file as opposed to ./Dir/file). But using a variable would permit me to change that as needed and keep it relevant to other parts of the script."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
If $\sum a_n$ converges where $a_n \ge 0 \; \forall \; n \in \Bbb N$, then $\{n a_n\}$ converges or diverges?
|
Is it possible that $a_n>0$ and $\sum a_n$ converges then $na_n \to 0$? (without assuming $a_n$ is decreasing)
|
[
"I mean to ask that $7$ is an arithmetic expression but it can also be written as $7x^0$. which is a constant polynomial expression. Every polynomial expression is an algebraic expression so with this logic is $7$ an algebraic expression or an arithmetic expression. Further $7=5+2$, is it an arithmetic equation or algebraic equation because it can also be written in $7x^0 = 5x^0 + 2x^0$ form. please help. Thank you.",
"Where are executables for programs stored in Ubuntu? An application (Komodo Edit) is asking me to identify an application to be used as a web browser. I've become used to just entering the application name as a command for situations such as these, but this scenario got me thinking. I know in Windows it would just be the relevant application folder in the 'program files' folder, but I'm assuming things are a bit different on Linux? I thought somewhere like bin would be logical but this appears to standard Linux/Unix applications. Where would I find the binary executable for applications stored on my system?",
"freezing header in a table in html",
"Why does ( exit 1 ) not exit the script?",
"Why have on every line"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Let $\phi:G\rightarrow G$ be a group homomorphism. Prove that there exists $n$ such that $G\cong ker(\phi^n)\bigoplus \phi^n(G)$ Let $G$ be a finite abelian group. Let $\phi:G\rightarrow G$ be a group homomrphism. Prove that there exists $n$ such that $G\cong ker(\phi^n)\bigoplus \phi^n(G)$. Any ideas?
|
Show that there is a positive integer $n$ such that $G \cong \ker(\phi^{n}) \times \phi^{n}(G)$ Let $G$ be a finite abelian group and let $\phi: G \rightarrow G$ be a group homomorphism. I am trying to show that there is a positive integer $n$ such that $G \cong \ker(\phi^{n}) \times \phi^{n}(G)$. I know that since $G$ is abelian we have that $\ker(\phi^{k})$ and $\phi^{k}(G)$ are normal subgroups of $G$ for any $k$ I also suspect we have the following towers which stabilize at $m$ and $m'$ $$\phi(G) \unrhd \phi^{2}(G) \unrhd \cdots \unrhd \phi^{m}(G)=\phi^{m+1}(G)=\cdots$$ $$\ker(\phi) \unlhd \ker^{2}(\phi) \unlhd \cdots \unlhd \ker^{m'}(\phi)=\ker^{m'+1}(\phi)=\cdots$$ I know that if given a group of the form $HK$ where $H$ and $K$ are normal subgroups of $HK$ and $H\cap K=1$ then $H \times K \cong HK$. I want to apply this to this situation but I am unable to show how write $G$ as a product $HK$ Resolution One of the comments directed me to the following article: The last part of which answers the question. Below is what is says: Choose $n=\max(m,m')$, then we have for $x \in \ker^{n}(\phi) \cap \phi^{n}(x)$, this means that $x=\phi^{n}(y)$ for some $y \in G$. This gives: $0=\phi^{n}(x)=\phi^{2n}(y)$ which means that $y \in \ker^{2n}\phi=\ker^{n}{\phi}$. and then we have that $0=x=\phi^{n}(y)$. The answer below kindly points out that every element $x$ is contained in one of the cosets of $G/\ker^{n}(\phi)$, this means that $x=k+g$ for some $k \in \ker^{n}(\phi)$ and $g \in G$. We also have that $g=\phi^{n}(h)$ for some $h \in G$. Writing $x=k+\phi^{n}(h)$ essentially shows that $G=\ker(\phi^{n}) + \phi^{n}(G)$. Using the fact above, the claim follows.
|
[
"Why is the Java plugin (JRE) disabled in Chrome? Why is the Java plugin (JRE) is disabled in Chrome? It is some security concern? From official Java website: Chrome no longer supports NPAPI (technology required for Java applets) The Java plug-in for web browsers relies on the cross platform plugin architecture NPAPI, which has been supported by all major web browsers for over a decade. Google's Chrome version 45 (scheduled for release in September 2015) drops support for NPAPI, impacting plugins for Silverlight, Java, Facebook Video and other similar NPAPI based plugins. But anyone knows why? How it could be dangerous for Chrome user with latest version of Java JRE installed?",
"Not able to execute a .sh file: /bin/bash^M: bad interpreter I wanted to execute a shell script: -rwxr-x--x 1 root root 17234 Jun 6 18:31 create_mgw_3shelf_6xIPNI1P.sh I tried to do a standard procedure, but I got this error: ./create_mgw_3shelf_6xIPNI1P.sh localhost 389 -l /opt/fews/sessions/AMGWM19/log/2013-06-06-143637_CLA-0 DEBUG cd/etc/opt/ldapfiles/ldif_in ; ./create_mgw_3shelf_6xIPNI1P.sh localhost 389 -l /opt/fews/sessions/AMGWM19/log/2013-06-06-143637_CLA-0 **ERROR sh: ./create_mgw_3shelf_6xIPNI1P.sh: /bin/bash^M: bad interpreter: No such file or directory** What does it mean? I was doing this as the root user under the root group. Does it mean that the file does not have the correct permission for the root user?",
"No internet after upgrade to 17.10",
"Why doesn't the Related question list show that questions are closed? I saw a question on Meta that was obviously going to be a duplicate: And indeed, looking at the \"Related\" questions list for that question showed a number of duplicates: Being the good citizen I am, I tried to vote to close (technically Flag as duplicate as I've not got the rep here to vote to close) it as an Exact Duplicate only to find myself falling into a rabbit hole of Closed, Duplicate questions. Is there any way to flag a closed question as such in the Related list? Mostly because the first one I picked was closed as a duplicate of the second one, which was closed as a duplicate of the one that is now listed as the duplicate/linked answer. Edit to respond to comment: I take the point about \"not voting to close on title alone\", and normally wouldn't, however as the questions had identical titles, and it's pretty clear what they should be asking, I clicked the first one: which lead to: which leads to: - but I'd got bored following links and didn't check that one as the first two were identical, so assumed this was too and didn't want to see how deep the rabbit hole led. In the related list, there's only one other question in there that is an exact duplicate, but hasn't (currently) been closed as such which is: Reasoning for highlighting closed questions: The \"Questions with similar titles\" does display the closed titles when asking the question, so it should be fairly possible to include. If there are clearly duplicate titles, then as a reader/reviewer would be helpful to know which ones are already closed as duplicates so you can either: Use the remaining open questions to focus on which of those is the canonical answer to close this with. Use the closed questions to find the canonical answer (which failed for me with my route of clicks).",
"How to send a header using a HTTP request through a cURL call? I wish to send a header to my Apache server on a Linux box. How can I achieve this via a cURL call?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Are branch points always isolated? A thought just hit my mind that whatever branch points I have seen to make some functions holomorphic are always isolated i.e. there exists a neighbourhood around them which contains no branch points. So I thought whether they are always isolated? I looked up for a proof and even thought over it but couldn't find a suitable approach. So my question is whether branch points are always isolated?
|
Set of branch points isn't discrete, but branch points are isolated? I refer to , which I understand says that the branch points of a nonconstant holomorphic map $F: X \to Y$ between Riemann surfaces $X$ and $Y$, both of which are not necessarily compact, form a discrete subset of range $Y$ of the map $F$. (Not sure if 'connected' is part of the definition of Riemann surfaces in other textbooks, but it is here.) Question 1: Do I understand correctly, and is this indeed true? What else I understand: $A$ is a discrete subspace/subset (I just assume everything here is the usual subspace topology) of $B$ if and only if every singleton subset of $A$ is open in $A$ if and only if every point of $A$ is isolated. This overflow question () seems to suggest this is not true but is true if $F$ is proper. However, I'm not sure the definitions of Riemann surface are the same (maybe some answers use definitions where Riemann surfaces are not necessarily connected or something). 2.1. I know $F$ is 'discrete' (meaning that its fibres are discrete; here, i refer to a ): see definition before Lemma 3.1, on p. 7), by Proposition II.3.12, and open, by open mapping theorem, which is Proposition II.3.8, but I'm not sure these help show $F$ is proper or are otherwise helpful. Ostensibly 'discrete' maps don't map discrete subsets to discrete subsets. This stackexchange question () seems to suggest this is true. I think this is true if $F$ is injective or at least something like locally injective. (Please don't make me type up all the stuff I did for this part.) However based on the question in (3) and based on the , which I think uses the term 'branch points' to mean the same thing as what Miranda means by 'ramification points' (and thus is different from Miranda's 'branch points'), it seems that no neighbourhood $U$ of a ramification point $p \in U \subseteq X$ of $F$ is such that the restriction $F|_U$ is injective. Kinda related: This page () says Now, the ramification and branch points must form a discrete set I don't think the page assumes anything like $F$ is proper. The text in (2.1) actually seems to assume proper based on the '3.7. Proper holomorphic maps' part, but said part refers to 'Lemma 3.17', so I think proper can be replaced with closed. Maybe $F$ is closed or something. Kinda related (see Question 2 below): says If $F$ is proper then the image $\Delta = F(R)$ is discrete in $Y$. This seems to have all the same assumptions as with Miranda. Ostensibly, either Miranda is wrong or there's some higher level machinery that allows us to omit $F$ proper. Question 2: To possibly generalise this, what are the minimum requirements on $F, X$ and $Y$ to make $F$ map discrete subsets to discrete subsets? I mean, I'm not sure we really need 'holomorphic' here. I have a feeling this applies perhaps to maps that are just open/closed, continuous and discrete and spaces that are just Hausdorff and locally compact or something. (again) Kinda related:
|
[
"Javascript function to convert color names to hex codes",
"Enabling GPU rendering for Cycles? I want to enable GPU rendering, but there is no option in User Preferences > System: Why is this? How can I get cycles to render using my GPU?",
"What insect is this? (India) Can anyone tell me what kind of insect (if it is one) is this...!! Or is it the pupa of some insect? Well I don't think that the whole big thing is the insect itself, it appears to be just a kind of protection or shelter which moves along with the tiny little thing that keeps on popping out and going it so as to move. Location: India",
"How to Change the Origin when moving a Collection Instance I have created an Collection Instance, when I try to move it, the origin(to snap at vertices or edges) is far away from the object, I want to set it. In the image, the Collection Instance is selected, the cross is far away from the object and I can´t set it using \"Set Origin to 3D Cursor\" What Am I missing?",
"if 2 random variables have exactly same mean and variance If two continuous random variables have exactly the same expected value and variance, do they always have the same distribution?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Windows 10 licence integrity on hard drive swap I need to replace a user's laptop to a new one. The guy had to install a shit ton of customers' apps on it and I'd rather not reconfiguring a full windows instance and reinstalling each app. So I thought about swapping his current hard drive to the new laptop directly. My concern though is about the windows licence on the new computer. If I'm not wrong, windows 10 licences are tied to the BIOS but how will the swap be handled by the laptop ? Will it keep running flawlessly with the built-in licence or will there be some kind of conflict ? The windows 10 version on each computer are the same (pro). EDIT : Absolutely nothing in common with the proposed possible duplicate...
|
Can you help me with my software licensing issue? This is a about Licensing. Questions on licensing are off-topic on Server Fault. If your question has been closed as a duplicate of this question, then this is because we want to help you understand why licence questions are off topic rather than just telling you "it just is". In all likelihood, this question will not address your question directly, it was not meant to. I have a question regarding software licensing. Can the Server Fault community please help with the following: How many licenses do I need? Is this licensing configuration valid? What CALs do I need to be properly licensed? Can I run this product in a virtual environment? Can I downgrade this product to an earlier version? Am I entitled to feature X with license Y?
|
[
"Windows 7 File Explorer search not working",
"Why does lightning emit light? What exactly is causing the electric discharge coming from the clouds to emit light while traveling through the air. I've read and thought about it a little but with my current knowledge I cant really figure what is happening at a subatomic level. In other words, what causes the emission of photons during lightning. What I want to know is, is there some sort of collisions taking place that produces the photons we see, or is it some other interaction that is causing it?. I don't know too much about particle physics, I've only read a couple of pages in the Introduction to Elementary Particles by Griffihts. So if you could keep the answer simple then that would be great.",
"How can timelapse sequences be shot without having in-camera support for it? Which third-party tools are recommended?",
"What is the difference between a parameter passed by reference a parameter passed by value? Could you give me some examples, please?",
"Understanding shape and calculation of confidence bands in linear regression I am trying to understand the origin of the curved shaped of confidence bands associated with an OLS linear regression and how it relates to the confidence intervals of the regression parameters (slope and intercept), for example (using R): require(visreg) fit <- lm(Ozone ~ Solar.R,data=airquality) visreg(fit) It appears that the band is related to the limits of the lines calculated with the 2.5% intercept, and the 97.5% slope, as well as with the 97.5% intercept, and the 2.5% slope (although not quite): xnew <- seq(0,400) int <- confint(fit) lines(xnew, (int[1,2]+int[2,1]*xnew)) lines(xnew, (int[1,1]+int[2,2]*xnew)) What I don't understand are two things: What about the combination of 2.5% slope & 2.5% intercept as well as 97.5% slope and 97.5% intercept? These give lines that are clearly outside the band plotted above. Maybe I don't understand the meaning of a confidence interval, but if in 95% of the cases my estimates are within the confidence interval, these seem like a possible outcome? What determines the minimum distance between the upper and lower limit (i.e. close to the point where the two lines added above intercept)? I guess both questions arise because I don't know/understand how these bands are actually calculated. How can I calculate the upper and lower limits using the confidence intervals of the regression parameters (without relying on predict() or a similar function, i.e. by hand)? I tried to decipher the predict.lm function in R, but the coding is beyond me. I'd appreciate any pointers towards relevant literature or explanations suitable for stats beginners. Thanks."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Is the Axiom of Empty Set a canonical ZFC axiom? As in title. The is sometimes offered as a fundamental axiom in the ZFC framework (), but sometimes it is not (). Would you consider it a tenth canonical ZFC axiom? Am I misunderstanding things? In case the question is more nebulous at very advanced levels of mathematics: I am asking in the context of an introductory course on axiomatic set theory. Thank you for your time!
|
The existence of the empty set is an axiom of ZFC or not? I found in the Wolfram MathWorld page of the that this is one of the Zermelo-Fraenkel Axioms, however on the page about these I read that it is an axiom that can be deduced from the Axiom of Subsets and the Axiom of Foundation (or Axiom of Regularity), so, the existence of the Empty Set is an axiom of ZFC or not?
|
[
"Events triggered by dynamically generated element are not captured by event handler",
"Make a fake random distribution? Sometimes a \"real\" random event seems unfair and makes players frustrated. For instance a enemy has probability of 20% to cause double damage(\"critical hit\"). Thus he could make 4 critical hits in a row with 1/725 probability. It's not as small as it sounds. I hope the probability could be adjusted after each hit. If the player just got a critical hit, the probability decreases for the next hit. Otherwise it increases. Is there a mathematical model for this behaviour?",
"arccot limit: $\\sum_{r=1}^{\\infty}\\cot ^{-1}(r^2+\\frac{3}{4})$",
"Showing that ${\\rm E}[X]=\\sum_{k=0}^\\infty P(X>k)$ for a discrete random variable Let $X$ be a discrete random variable whose range is $0,1,2,3,\\ldots$. Prove that $$ {\\rm E}[X]=\\sum_{k=0}^\\infty P(X>k). $$ How to prove this? I tried a bit but unable to post due to formatting issue. Can anyone help?",
"Repeat String - Javascript"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
How to get Ubuntu download in folder format not iso
|
This is the third time I've tried to install Ubuntu Server 14.04.03 64-bit on the same laptop, and each time it caused different problems. Each time I wrote the same iso image to a USB flash drive by using a different application and OS. Universal USB Installer (pendrivelinux.com) from Windows WinImage writer from Windows built-in image writer from Linux Mint 17.2 The iso image is the same in all three cases, the USB flash drive is the same, and the laptop is the same. However each time the installation of Ubuntu gave me different installation options. For example, the last time I installed Ubuntu, it didn't show all the packages to choose while installing (Basic Ubuntu server, etc.).
|
[
"Text formatting now allowed in comments (List of proven and disproven abilities)",
"Code coverage for wrapper class is 0%",
"What Is Energy? Where did it come from? The simplistic undergrad explanation aside, I've never really understood what energy really is. I've been told that it's something when converted from one kind of something to another kind, or does some \"work\", as defined by us, but what is that something? Moreover, if the total amount of energy in the universe is finite and we cannot create energy. Then, where did it come from? I've learned from thermodynamics where it goes, but where does it come from? I know this sounds like something trivially simple, but there is so much going on in the physical universe and I just can't grasp what it is. Maybe it is because I lack the mathematical understanding that I can't grasp the subtle things the universe is doing. Still, I want to understand what it is doing. How do I get to the point of understanding what it's doing? (Note: What prompted me to ask this was . I'm afraid that it just puzzled me further and I sat there staring at the screen for a good 10 minutes.)",
"My colleague is using an application that consumes a lot of memory which makes the system too slow. Is it possible to share memory with other PCs over the Internet? The system has 8 GB of RAM, and the application consumes more than 6 GB.",
"Performing deep learning land cover classification using R? I am really new to Deep Learning and, unfortunately, I can't find example codes on land cover classification other than where the author wrote a script in R for a large dataset. The main reason that I am asking is because recently I found a few papers on Remote Sensing Image classification using Deep Learning and I was wondering if there were any R examples on that subject. So, is there a code example, preferably a step-by-step, which I can use? I found several git repos like that can do Deep Learning classification with R, BUTT, I am still looking for a simple multi-spectral image segmentation method. An example of that can be found at and I also found a similar question in for which the answer is \"use something else other than R if you can\". If I find anything that works today I will be posting a working answer."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Windows 10 Home - Who is starting a process at logon? Whenever I login into Windows 10 Home, a cmd screen starts with a batch file inside windows\system32. Antivirus shows nothing, SysInternals autoruns shows no call to cmd.exe or to the batch file. Using Process Explorer, the parent of cmd.exe is "Non-existent Process", but the cmd.exe is below winlogon.exe in the tree-view, which makes me suspicious of some entry under HKLM\SOFTWARE\Microsoft\Windows\CurrentVersion\Run. However, there are countless entries there and I'm afraid of breaking something if I disable everything. The batch itself is harmless - it only logs current date and time at a text file then pauses. I've used Process Monitor and never see any process accessing that file in my normal use. Since this happens at login time, it's too late for me using Process Monitor. Since this is Windows 10 Home, I can't enable process audit logs. Is there some tool I can download to find out who is starting that cmd.exe and/or batch file? Or how can I prepare Process Monitor to run before everything else at logon?
|
Get complete stats of process started/terminated during login of user account When I login, I notice many process quickly start and terminate in task manager. But it happens very fast and I cannot save details about them (like process name, command line, CPU usage,..) How can I collect stats about them so I can view them later
|
[
"I decided to make sure that I know this important difference between American and British English, so I wrote what I have found out so far and I would be grateful to anyone who reads this and tells me whether I am wrong, or not. In British English when people say to hospital or in hospital when talking about somebody being there as a patient they don't use the definite article : \"I had to go to hospital\", \"She spent two weeks in hospital\". And the meaning is that somebody was there as a patient. If then for some other reasons British English speakers will use the definite article which will change the meaning itself, I noticed that, in American English, native speakers often use the the and if they need to show that somebody is in church to pray, in school as a student, in hospital as a patient, in prison as a prisoner, they use 'in' and not 'at'. Do American English speakers use 'at' like British English speakers use 'the' to give the sentences a different meaning? Are my sentences correct? Do they show American English usage? He is in the school. (enrolled as a student) He is at the school. (for some different reasons) He is in the hospital. (as a patient) He is at the hospital. (visiting somebody) He is in the church. (to pray) He is at the church. (for some different reasons) He is in the university. (as a student) He is at the university. (not as a student) He is in the college. (as a student) He is at the college. (Not as a student) He is in the prison. (as a prisoner) He is at the prison. (not as a prisoner)",
"Excel INDIRECT function and conditional formatting - highlighting a row",
"Nikon d5100 producing extremely underexposed images",
"Evaluate $\\lim\\limits_{n\\to\\infty}\\frac{\\sum_{k=1}^n k^m}{n^{m+1}}$ By considering: $$\\lim_{n\\to\\infty}\\frac{\\sum_{k=1}^n k^1}{n^{2}} = \\frac 1 2$$ $$\\lim_{n\\to\\infty}\\frac{\\sum_{k=1}^n k^2}{n^{3}} = \\frac 1 3$$ $$\\lim_{n\\to\\infty}\\frac{\\sum_{k=1}^n k^3}{n^{4}} = \\frac 1 4$$ Determine if this is true: $$\\lim_{n\\to\\infty}\\frac{\\sum_{k=1}^n k^m}{n^{m+1}} = \\frac 1 {{m+1}}$$ If it is, prove it. If it is not, evaluate $\\lim\\limits_{n\\to\\infty}\\frac{\\sum_{k=1}^n k^m}{{m+1}}$.",
"How do I install the Nvidia drivers? I just ordered the Nvidia GTX card. I have a dilemma, though. Should I keep using the driver which is available in \"additional drivers\" in Ubuntu, or should I install the driver from the Nvidia site? So which driver is the best for me?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Unidentified NullPointerException when populating array from other class
|
What is a NullPointerException, and how do I fix it?
|
[
"This is my first time using a LaTeX editor. I installed allowing it to use the default directory on the C drive. Software Versions Windows: 7 Ultimate 64-bit Texmaker 3.4.1 for Windows I then did A Local guide for using Texmaker (There use to be a link to this but it is now dead) Basically create a simple Hello World document and save it. When I went to process the file Tools -> PDFLaTeX I received Error: Log file not found! What I checked I checked the configuration (Options -> configure Texmaker) and found no option for log files. I checked for a log file under the C:\\Program Files (x86)\\Texmaker and found none. I checked for a log path in the Windows registry using regedit and found none. I checked the Texmaker issues and found but it does not help. Any ideas? After reading answer I installed MiKTeX as an administrator (didn't work as user) and chose the default options. After MiKTeX installed I was able to create a PDF file using Texmaker. Also, correctly setting the PDF viewer options Options -> Configure Texmaker -> Commands -> PDF Viewer Built-in Viewer and Embed I was able to preview the pdf in Texmaker View -> PDF Viewer What I learned is a LaTeX editor which generates a file containing LaTeX markup. is a program that converts the LaTeX markup into an output format such as PDF.",
"What performance differences are there when installing with Wubi?",
"Performing Point Distance analysis using Basic level license of ArcGIS Desktop? I am using ArcView (ArcGIS Desktop Basic) 10.1 and I need to perform a point distance analysis. What are the steps to determine the distance from A to B-Z, B to A-Z, C to A-Z, etc?",
"Clicking on the rep league lines that read like "top 2% this quarter" returns a 404 page. Example in point: This report is split off as per request of Adam Lear from",
"I am writing a novel and fairly new to using LaTeX. Please bare with me if this is a silly question. I am working off of the novel demo LaTeX file using the TexWorks software. I have inserted my words into the file. When I run the LaTeX code, I get the error message saying \"! LaTeX Error: File `novel.cls' not found.\" Do I need to download this file from somewhere? If so, where can I get it?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Mouse flickering I've just done a fresh install of Ubuntu 13.10 on my Asus K53SV but I noticed that the cursor is flickering a lot and some times disappear. I never had this issue before with other Ubuntu release. What can I do?
|
Mouse cursor flickering and disappearing I installed Ubuntu today and since the first start up I have a problem with the mouse cursor. It starts randomly disappearing and flickering a lot. I have searched for a solution on Google and here but didn't find anything.
|
[
"I know how to CALCULATE dot product, but still don't understand MEANING of it. I mean, If I have to explain vector addition I would say that \"Sum of two vectors give you the third vector that has the same effect as other two combined\" But I don't know how to explain dot product. For example we have two vectors: v=(3,1) and w=(2,4). Dot product of these two is 3*2 + 1*4 = 10. What does this result (10) tell us?",
"I've got about a billion rows of data in a table with a name and an integer in the range 1-288. For a given name, every int is unique, and not every possible integer in the range is present--so there are gaps. This query generates an example case: --what I have: SELECT * FROM ( VALUES ('foo', 2), ('foo', 3), ('foo', 4), ('foo', 10), ('foo', 11), ('foo', 13), ('bar', 1), ('bar', 2), ('bar', 3) ) AS baz (\"name\", \"int\") I'd like to generate a lookup table with a row for each name and sequence of contiguous integers. Each such row would contain: name -- the value of the name column start -- the first integer in the contiguous sequence end -- the final value in the contiguous sequence span -- end - start + 1 This query generates example output for the above example: --what I need: SELECT * FROM ( VALUES ('foo', 2, 4, 3), ('foo', 10, 11, 2), ('foo', 13, 13, 1), ('bar', 1, 3, 3) ) AS contiguous_ranges (\"name\", \"start\", \"end\", span) Because I have so many rows, more efficient is better. That said, I only have to run this query once, so it isn't an absolute requirement. Thanks in advance! Edit: I should add that PL/pgSQL solutions are welcome (please explain any Fancy Tricks--I'm still new to PL/pgSQL).",
"Given a sphere of radius $r$ with two spherical caps on it defined by the radii ($a_1$ and $a_2$) of the bases of the spherical caps, given a separation of the two spherical caps by angle $\\theta$, how do you calculate the surface area of that intersection? To clarify, the area is that of the curved surface on the sphere defined by the intersection. At the extreme where both $a_1,a_2 = r$, we would be describing a spherical lune. Alternatively define the spherical caps by the angles $\\Phi_1 = \\arcsin(a_1/r)$ and $\\Phi_2 = \\arcsin(a_2/r)$.",
"I am building a drupal site using Views, search API module and user-points module. I created the \"database server\", and indexed many fields of nodes. I created a search page using views and the search API, that present content (image, title etc.) In addition, I want to add to every content in this search view the name of the author that wrote it, his author picture. I add the Indexed Content: Author relationship. Unfortunately, I can't find a way to add the author picture and the current total point to my view. Can somebody advice how to do that?",
"We're injecting records into a journey using a Salesforce data event. I also want to advance the people in the journey based on updates that happen in Salesforce (e.g., as an Opportunity record advances through the sales process), but I can't figure out how to do that. I've read all the documentation I can find, but there doesn't seem to be a Journey Builder widget that will wait to be prompted by an event in Salesforce before continuing someone on a journey. At the moment, I'm completely stuck. I'd greatly appreciate any advice or information on how I can make journeys event-driven in this way. Thanks very much!"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
SEO best practices for one page websites? I build many one page websites that dynamically load content through AJAX/jQuery. I keep reading how bad one pagers are for SEO. Regardless, how can you get the most SEO results out of a one page website, without splitting it up into multiple pages?
|
One page website - Effect on SEO I'm considering re-designing my personal website to promote my web services in my local area. My issue is whether to do a one page website with a scroll-to navigation system. What effect does this have on SEO. As i understand it, you set stuff like h1's and meta description on specific page content. How does this work when all of your different content is on one page?
|
[
"Solve for $x$ in the $80^\\circ$-$80^\\circ$-$20^\\circ$ triangle I've been solving this for days but I still I couldn't solve this. Can I know how to solve $x$ ?",
"Global inbox message not updated after comment edit At the moment, I have the latest notification in the global inbox, content of which does not correspond either to the comment itself or the copy of it on \"recent responses\" page. This seems like the comment was edited and the updated version was not copied to the global inbox. ETA: OK, now this looks more coherent.",
"How to show distance between boundary of an open set and a compact subset is positive? Let $n \\in \\mathbb N$ and $U\\subset \\mathbb R^n$ be an open set.Let $K\\subset U$ be a compact subset of $U$. Then How can we show that distance between $K$ and $\\partial U$ is positive? Please, someone, give some hints. to solve this. Thank you.",
"How to mitigate the Spectre and Meltdown vulnerabilities on Linux systems?",
"Legendre's formula counts the number of positive integers less than or equal to a number $x$ which are not divisible by any of the first $a$ primes: $$\\begin{align} &\\phi(x,a)=\\lfloor x \\rfloor-\\sum_{p_i\\le a}\\left\\lfloor \\dfrac{ x }{(p_i)}\\right\\rfloor+\\sum_{p_i<p_j\\le a}\\left\\lfloor\\dfrac{ x}{(p_ip_j)}\\right\\rfloor-\\sum_{p_i<p_j<p_k\\le a}\\left\\lfloor \\dfrac{x}{(p_ip_jp_k)}\\right\\rfloor+\\dots \\end{align}$$ then $\\pi(x)=\\phi\\bigl(x,\\pi (\\sqrt{x})\\bigr)+\\pi (\\sqrt{x})-1$ as given . My question is, why does $\\bigl\\lfloor\\phi(x,\\lfloor\\sqrt{x}\\rfloor)+\\sqrt{x}-1\\bigr\\rfloor$ also equal $\\pi(x)?$"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Let $G$ be a finite group and suppose that there an automorphism $f$ of $G$ satisfying: $f^2 =id_G$ and $f(x)=x \iff x =1$. Show that every element of $G$ can be written as $f(x)x^{-1}$ for some $x$ and that $G$ is abelian of odd order. The first part I know how to do. Define $s: G \to G$ by $s(g) = f(g)g^{-1}$. Then $s$ is one-one because $s(g)=s(g') \implies f(gg'^{-1}) = gg'^{-1} \implies gg'^{-1} = 1 \implies g = g'$. So since $G$ is finite $s$ is onto so every element can be written as $f(x)x^{-1}$. How to show that $G$ is abelian and has odd order? Thanks for help.
|
Let $G$ be a finite group and suppose there exists $f\in\text{Aut}(G)$ such that $f^2=\text{id}_G$, i.e., $f$ is its own inverse, and such that $f$ has no fixed points other than the identity $e$ of $G$, i.e., $f(x)=x\Rightarrow x=e$. Show that $G$ is necessarily abelian. While trying to do this exercise I noticed two facts. First, $g$ and $f(g)$ have the same order because $o(f(g))|o(g)$ and, applying $f$ again and using $f^2=\text{id}_G$, $o(f(f(g)))=o(g)|o(f(g))$ and, once the order of any element is $\geq 1$, it follows that $o(g)=o(f(g))$. Also, it's easy to see that $g$ and $f(g)$ commute. Second, there cannot exist such an automorphism if the order of $G$ is even, because $f(e)=e$ and we can form pairs like $\{g,f(g)\}$ with $f(g)\neq g$ that are invariant under $f$, i.e., $f(\{g,f(g)\})=\{g,f(g)\}$. But once the order of $G$ is even, proceeding with the construction of the pairs, we'll end up with just one element $\neq e$, so we must have some $\gamma\in G\setminus{e}$ with $f(\gamma)=\gamma$, contradicting the hypothesis. Let $n$ be the order of $G$ and let's fix an enumeration of the elements of $G$, say $G=\{g_1,\ldots,g_n\}$. My approach was the following. For each $\sigma\in S_n$, let $x_{\sigma}=\prod_{i=1}^ng_{\sigma(i)}$. Then we have that $f(x_{\sigma})=x_{\sigma^{\prime}}$. If it's shown that $f(x_{\sigma})=e\;\forall\;\sigma\in S_n$, then we'd have $x_{\sigma}=e\;\forall\;\sigma\in S_n$, which implies that $G$ is abelian. The problem is that $S_n$ has $n!$ elements while $G$ has $n$ elements, so there repetitions among the $x_{\sigma}$, and we cannot apply directly the reasoning of the last paragraph. Is this the right way, or is there an easier manner to solve this?
|
[
"Error: The processing instruction target matching \"[xX][mM][lL]\" is not allowed",
"Add folder to PATH How to add something to PATH ? I have added like PATH=$PATH:/home/example export PATH and it works until I restart , after that when I type env in PATH there is no /home/example.",
"can't read from SQlite database",
"I have never found experimental evidence that measuring one entangled particle causes the state of the other entangled particle to change, rather than just being revealed. Using the spin up spin down example we know that one of the particles will be spin up and the other spin down, so when we measure one and find it is spin up we know the other is spin down. Is there any situation after creation that the particle with spin up will change to spin down?",
"I've heard Google's algorithm is based on PageRank, and that it has something to do with the links to your site. Can someone explain it, and more importantly, how I can increase my site's PageRank?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Suppose that $Tr(A^n) = 0$ for all integer $n>0$. I have to prove that $A$ is nilpotent. I can see it's true for little $n$ but i do not know how to prove that for all integer $n$. Any idea please?
|
$\DeclareMathOperator{\tr}{tr}$Let's consider a $n \times n$ matrix and the sequence of traces $\tr(A)=\tr(A^{2})= \ldots = \tr(A^{n})=0$. How to prove that $A$ is a nilpotent matrix (a matrix so that $A^{k} \times u = 0$ for all $u \in V$ and for some $k$)? Maybe it would be reasonable to consider $A$'s Jordan form (we assume that the action occurs over an algebraically closed field, such as $\mathbb{C}$). For example, suppose that we have found it and $A'$ consists of $m$ blocks of sizes $r_{1}, \ldots r_{m}$ ($r_{1}+r_{2}+\ldots+r_{m}=m, r_{i} \in \mathbb{Z}_{+}$) with $\alpha_{1}, \ldots \alpha_{m}$ as corresponding eigenvalues to each of the blocks. Then, according to the problem will get the system $$\begin{align} r_{1}\alpha_{1}+&\ldots+r_{m}\alpha_{m}=0 \\ r_{1}{\alpha_{1}}^{2}+&\ldots+r_{m} {\alpha_{m}} ^{2}=0\\ &\ ~\,\vdots \\ r_{1}{\alpha_{1}}^{n}+&\ldots +r_{m}{\alpha_{m}}^{n}=0 \end{align}$$ But the system's analysis over $\mathbb{C}$ seems to be too much complicated. Actually, the problem must have more or less simple solution. Any piece of advice would be much appreciated.
|
[
"How to Send Byte array To Server",
"How to prove $\\sum_{k=1}^{n}F_k = F_{n+2}-1$ by induction when $F_n$ is the Fibonacci sequence Let $F_n$ be the Fibonacci sequence where $F_0$ = 0 , $F_1$ = 1 and $F_n$ = $F_{n-1}$ + $F_{n-2}$. I want to prove the following by induction. $$\\sum_{k=1}^{n}F_k = F_{n+2}-1$$ Here is what I have so far. Can anybody tell me if I am right? Base case = n=1 $F_k$ = 1 = LHS $F_{1+2}$ - 1 = 2 - 1 = 1 = RHS Statement is true for n=1. Assume statement is true for n=i. $$\\sum_{k=1}^{i}F_k = F_{i+2}-1$$ Prove statement is true for n=i+1. $$\\sum_{k=1}^{i+1}F_{k} = F_{((i+1)+2)}-1$$ $F_1$ + $F_2$ +...+ $F_i$ + $F_{i+1}$ = $F_{((i+1)+2)}-1$ $F_{i+2}$ - 1 + $F_{i+1}$ = $F_{((i+1)+2)}-1$ $F_{((i+1)+2)}-1$ = $F_{((i+1)+2)}-1$ Statement holds for n=i+1",
"Sending multiple messages through only one SocketChannel",
"/usr/bin vs /usr/local/bin on Linux",
"mysql database no space available"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
No definite article after “by”
|
Can the definite article be omitted when referring to a person qualified by a noun?
|
[
"List of all \"partitions\"/ \"cuttings\" of a list",
"How do I remove an alias? I want to remove gs alias from my PC. When I type gs it will open GhostScript. But I checked everywhere in the home directory .alias .bash_aliases .bashrc I also overwrite the gs with my custom alias. I can't remove it. And I also type alias in terminal, in the list I couldn't find it. Please I want to remove it...",
"How to animate text over a twisted mesh (or text flowing along an infinity loop)",
"I block everything Google, including Google APIs, as I don't like to to have Google tracking all of my usage on the Internet. Is there any way to use Stack Exchange without Google APIs? I usually am browsing with Windows 7 and Firefox, but of course not Firefox with StackExchange.",
"How to prove the following expression does not depend on x? I'm not sure how to approach this question, but I know it has something to do with taking the derivative of this. Can anyone please help me out? Let x > 0. Prove that the value of the following expression does not depend on x: $$\\int_{0}^{x}\\frac{1}{1+t^4} dt + \\frac{1}{3}\\int_{0}^\\frac{1}{x^3} \\frac{1}{1+t^\\frac{4}{3}} dt$$"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Look up property by name using a string variable
|
jQuery call function from a string
|
[
"Looking for a short story about an artist and a forger Back in the late 1970s to early 1980s, I read a short story about an artist and a forger. Between the two of them, they managed to start a revolution that brought down a corrupt dictatorship. It was science fiction: The dictatorship was interplanetary, maybe interstellar. The artist used some kind of advanced technology to make his art works. Plot: The artist is one of the best (if not the best) at what he does. The dictator wants the artist to make what amounts to a family portrait in whatever medium it is he works in. Think of it like painting - you create the image manually (not a photograph) but it is much more than just a flat image. The artist doesn't like the dictator - maybe on general principles, maybe because he knows the dictator personally - and refuses to make the \"portrait.\" The dictator has the artist arrested, and will only let the artist free again if he makes the portrait. The artists makes the portrait. He does the work while in the prison or jail. That's where the forger comes into things. The forger is also in jail for something or other. The forger makes copies of art works. He of course recognizes the artist, and knows what the artist works with. The forger can somehow see what the artist is working on. The artist finishes the portrait. At first the dictator is thrilled. It looks exactly the way he wanted it. As time goes by, though, the people looking at the picture see that it represents the vileness and corruption of the dictator. The more you look at it, the more of the evilness of the dictator you see in it. That is the genius of the artist, and whatever medium he is using. Once you notice the hidden levels of the portrait, you can't unsee them and you see more and more of it as you look. I think the effect carries over into reality as well. Once you've seen the dictator's corruption in the portrait you also begin to see it in the dictator and his works as well. This of course seriously pisses off the dictator, who has the artist killed and the portrait destroyed. While in prison, the forger watched as the artist created his masterpiece, and recognized it for the subversive thing it is. He also recognized it as the ultimate rebellion from the artist - the artist knows what will be seen, and that he will be killed for it. All of that inspires the forger to do something more meaningful with his life than make forgeries for the money. The forger is released from prison. He saw the completed portrait, and knows how it was made. He begins making forgeries of the portrait - like, hundreds if not thousands of them. These are distrubuted throughout the nation/empire. The people realize what evil is controlling them once they see it in the copies of the portrait, and eventually a revolution rises and brings down the dictatorship. It was probably older than the 1970s. I expect earlier than 1960. Any ideas?",
"Escape a string for a sed replace pattern",
"ISP blocking port 25 My ISP has started blocking port 25 so I can not send email through my dedicated server any more. I have several options: Send email through the SMTP server provided by my ISP. Any problems with this? Setup mu server so that it receives email on another port instead of port 25 No one else sends email through my server so it should be OK. How do I do this on a Linux server? Buy a static client IP - these are not being blocked so far. Which one is preferable?",
"Irrationality of sum of two logarithms: $\\log_2 5 +\\log_3 5$ I try to prove that the number $$\\log_2 5 +\\log_3 5$$ is irrational. But I have no idea how to do it. Any hints are welcome.",
"What is an intuitive explanation of the Expectation Maximization technique?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Evaluate $\int_{0}^{\infty} \cos(x^2)dx $ Prove that the above integral is equal to $\frac{\sqrt{2\pi}}{2}$ I have already tried expanding using $\cos$ identity and also taking Laplace for it. I am getting nowhere with this.
|
Evaluating $\int_0^\infty \sin x^2\, dx$ with real methods? I have seen the Fresnel integral $$\int_0^\infty \sin x^2\, dx = \sqrt{\frac{\pi}{8}}$$ evaluated by contour integration and other complex analysis methods, and I have found these methods to be the standard way to evaluate this integral. I was wondering, however, does anyone know a real analysis method to evaluate this integral?
|
[
"Define a mathematical set",
"I've searched for multiple forums for this questions and have seen different answers but so far, nothing have worked yet even from the ones I've seen here. I want to extract a single file from a tar to a different directory. I've tried this: tar xvf file.tar -C /home/dir/ filename or this: tar -x filename -f file.tar -C /home/dir But got these errors respectively: x filename, 14826 bytes, 29 media blocks. File -C not present in the archive. File /home/dir not present in the archive. and: tar: /dev/rmt0: A file or directory in the path name does not exist. The first extracted the file but in the same directory, not to the folder I wanted.",
"Text highlighting in revisions is wrong For example, when watching revision 2 in in the side-by-side mode, word \"answer\" marked as deleted on the left hand side and as added again on the right hand side: If we switch to the side-by-side markdown mode no \"answer\" word is highlighted at all (correctly):",
"I am not sure what caused this error, but here is what the whole error says, and also this is sitting as a notification, and preventing me from updating any software using Update Manager - Please provide some assistance or tell me how to figure out what to do to fix it. Could not calculate the upgrade An unresolvable problem occurred while calculating the upgrade. Please report this bug against the 'update-manager' package and include the following error message: 'E:Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages.'",
"syntax error in case 'remove' when decrementing"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Is an electron completely determined by its mass? What I mean is, could a chunk of matter be "whittled down" or broken off from a larger chunk of matter to the point where it has the mass either exactly of an electron or close to that and in the former case, would it have to be an electron and if somehow the charge of the original piece of matter was neutral or positive would the electron-sized piece suddenly become a negatively charged electron or I guess a positron perhaps. And in the latter case, would the chunk somehow "degenerate" into an electron, shedding the extra mass? I know particles can be created from like laser beams experimentally but it seems like nothing other than know particles are ever created -- never is there just a tiny piece of matter with no characteristics like charge and whatever else electrons/positrons have.
|
Fundamental particles identical or just differences very small? I have read that all electrons are identical and I assume the same for protons, etc. That is, all electrons are of the exact same mass and charge. But do we really know this? Could there be slightly heavier electrons with slightly higher charge or is there a reason why such particles could not exist or would be unstable?
|
[
"PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown: W: Failed to fetch http://ppa.launchpad.net/ 404 Not Found How do I fix these errors?",
"Find three Poisson-distributed random variables, pairwise independent but not mutually independent",
"Infinite metric space has open set $U$ which is infinite and its complement is infinite Let $(X,d)$ be a metric space where $X$ is an infinite set. Prove that the space has an open set $U$ such that both $U$ and its complement are infinite sets. I have considered if $d$ is the discrete metric, then one such $U$ exists. But if $d$ is not discrete, how do we find such $U$?",
"How to change background colour in texworks I am using texworks for the first time, I want to change the background of the editor from dark to white, as the code is not visible in dark background. I am using texworks in Manjaro Linux on GNOME desktop environment. Please help me.",
"Where is a good place to learn classical optics for high school competitions?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
How to enable "Other" or "Manual" user login in ubuntu 14.04.1? I found the other one with the lightdm thing but it doesnt work because its for 12.04! does anyone know how to enable the manual login like in XUbuntu where you can type in the user and the password? Thanks
|
How to configure lightdm to allow manual logins in Ubuntu 14.04 I used to modify /etc/lightdm/lightdm.conf, adding the line greeter-show-manual-login=true, in order to allow login for hidden users and root. Now I've just installed the new Ubuntu 14.04 and the file lightdm.conf is no longer located in /etc/lightdm. It's in /etc/init and has been totally modified. How can I force lightdm login screen to show a field to input a login name?
|
[
"Overstayed my US visa for over 9 years, never got deported, can I return as a tourist?",
"How to show distance between boundary of an open set and a compact subset is positive? Let $n \\in \\mathbb N$ and $U\\subset \\mathbb R^n$ be an open set.Let $K\\subset U$ be a compact subset of $U$. Then How can we show that distance between $K$ and $\\partial U$ is positive? Please, someone, give some hints. to solve this. Thank you.",
"show that $$\\lim_{n\\to \\infty}\\sin{(n^m)}$$ divergent,where $m\\in N^{+}$ I have kown $$\\lim_{n\\to\\infty}\\sin{n^2}$$ to be divergent and dense in $[-1,1]$. This is very famous problem,the problem is first is post $AMM$( The American Mathematical Monthly,1970-1975) problem,and after some years $AMM$ post $\\sin{(n^{14})}$ in $[-1,1]$ was dense? and this is open problem.so I Guess $$\\sin{(n^m)}$$ is dense in $[-1,1]$.",
"My PC has a build-in VT1828S chip. The connection between PC and monitor (which has built-in speakers) is through an HDMI cable. Audio preferences shows 2 devices for audio output: analog stereo and RS880 Audio Device [Radeon HD 4200] digital stereo (HDMI). When I plug a headphone in the rear jack and I choose the former device, everything works. When I choose the latter device, instead, no sound is heard, and video playback is too fast. It is as if video frames want to synchronise with the audio timing, but the audio timing information is wrong. HDMI audio worked perfectly with Ubuntu 11.04, but stopped after 11.10 upgrade.",
"I'm reading Linear Algebra by Hoffman, Kunze where the authors explained that a $n\\times n$ matrix $A$ being invertible is equivalent to the fact that $A$ is row-equivalent to $n\\times n$ matrix $R$ which is an identity matrix. In the proof of the theorem, they wrote: $$R= E_k\\ldots E_2E_1 A$$ where $E_1,\\ldots,E_k$ are elementary matrices. Each $E_j$ is invertible, and so $$A = E_1^{-1}\\ldots E_k^{-1}~R\\,. $$ ... Since, $R$ is a (square) row-reduced echelon matrix, $R$ is invertible if and only if $R=I\\,.$ [...] I couldn't get the conclusion, since any row of $R$ can't be zero, it has to be identity matrix $I\\,.$ Why is it so? Isn't there any other row-reduced echelon matrix other than the identity matrix having no zero row and invertible? Why is it so?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
if $u(x,y) $ satisfies $u_{xx} + u_{yy} = 0$ then $v=u(\frac{x}{x^2+y^2},\frac{y}{x^2+y^2})$ satisfies $v_{xx} + v_{yy} = 0$ if $u(x,y) $ satisfies $u_{xx} + u_{yy} = 0$ then $v=u(\frac{x}{x^2+y^2},\frac{y}{x^2+y^2})$ satisfies $v_{xx} + v_{yy} = 0$ I tried using the chain rule and it didn't work for me.. I think I might have missed something maybe.. Could anyone show how to properly write $v_{xx} $ and $v_{yy} $ ? Thanks. EDIT : my question is also about generally differentiating such function, like is that okay to do : let $t =\frac{x}{x^2+y^2}$ and $s=\frac{y}{x^2+y^2}$ $v_{x } = \frac{\partial u}{\partial t} \frac{\partial t}{\partial x} + \frac{\partial u}{\partial s} \frac{\partial s}{\partial x} $ or if $v$ is just substituting any $x$ in $u$ for $\frac{x}{x^2+y^2} $ and any $y$ in $u$ for $\frac{y}{x^2+y^2}$ then maybe $v_{x } = \frac{\partial u}{\partial x} \frac{\partial t}{\partial x} + \frac{\partial u}{\partial y} \frac{\partial s}{\partial x} $
|
Laplace equation of composite function Suppose we have $f(x,y)$, which satisfies Laplaces equation: $\frac{\delta^2f}{\delta x^2}+\frac{\delta^2f}{\delta y^2}=0$ Does $f(\frac{x}{x^2+y^2},\frac{y}{x^2+y^2})$ also satisfy Laplace equation?
|
[
"This problem is from Discrete Mathematics and its Applications My question is on 9b. I know that the sign represents an element is a member of. (from book) I know that the O with a slash across it is the empty set which "is a special set that has no elements". From , I got that the empty set is a subset of all sets, meaning that every member of the empty set(nothing) is also a member of any other set. Based on all of this, for 9b, would {0} contain the empty set because it fundamentally has the elements that consist of the empty set(nothing) or does it physically have to have the empty set?",
"What is the relation between linear purity and von Neumann entropy of a state?",
"How do I create a Java string from the contents of a file? I've been using the idiom below for some time now. And it seems to be the most wide-spread, at least on the sites I've visited. Is there a better/different way to read a file into a string in Java? private String readFile(String file) throws IOException { BufferedReader reader = new BufferedReader(new FileReader (file)); String line = null; StringBuilder stringBuilder = new StringBuilder(); String ls = System.getProperty(\"line.separator\"); try { while((line = reader.readLine()) != null) { stringBuilder.append(line); stringBuilder.append(ls); } return stringBuilder.toString(); } finally { reader.close(); } }",
"How to prevent US post code formats I have an issue with American and Canada postcodes in accounts and contacts. Some of the users are creating the salesforce records with postcodes like (MD 20904), when we sending post code from salesforce to SAP integration, SAP system is rejecting salesforce records as postcode is not in correct format. My question is: what are actual US and canada post code formats? If Users are creating the post codes with MD 20904, how would prevent through validation rule like only accept sepecific format?",
"Grep equivalent for Windows 7? Is there a command prompt equivalent for Windows 7? That is, I want to filter out the results of a command: Bash use: ls | grep root What would it be from a Windows command prompt?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Probability of two boys if one is a boy
|
In a family with two children, what are the chances, if one of the children is a girl, that both children are girls?
|
[
"Show that $x_{n+1}-\\dfrac{x_n}{2}$ converges to zero implies that $(x_n)_n$ also converges to zero. Let $(x_n)_n$ be a sequence of real numbers such that $$\\lim\\limits_{n\\rightarrow \\infty}\\left( x_{n+1} - \\dfrac{x_n}{2}\\right)=0.$$ Show that $(x_n)_n$ must also converge to zero. $\\textbf{My Attempt:}$ My original idea was to use the triangle inequality and the fact that $$\\lim\\limits_{n\\rightarrow \\infty}\\left( x_{n+1} - \\dfrac{x_n}{2}\\right)=0$$ to show that the sequence $(x_n)_n$ is Cauchy and hence converges to some real number $a$, which would give me $$\\lim\\limits_{n\\rightarrow \\infty}x_n=a=\\lim\\limits_{n\\rightarrow \\infty}x_{n+1}\\implies a-\\dfrac a 2= \\lim\\limits_{n\\rightarrow \\infty}\\left( x_{n+1} - \\dfrac{x_n}{2}\\right)=0\\implies a=0.$$ However, I'm having trouble showing that $(x_n)_n$ is Cauchy. Any suggestions/hints would be greatly appreciated. Thanks!",
"I need a shapefile for India which is up-to-date to display the regional borders. By up-to-date (in 2014), I mean that it includes Telangana as a state. Many shapefiles that I downloaded do not have Telangana as a state as it was partitioned a month ago, it is displayed as part of Andhrapradesh. So I need the latest shapefile.",
"How to check who owns the Slack's workspace? I'd like to check who owns (or at least some kind of public profile page) some workspace based on its subdomain (e.g. xyz.slack.com). Is it possible?",
"Remap Keys in Linux I'd like to switch my Ctrl and Alt keys under Linux (to make it more Mac-like). How do I do this? If it helps, I'm running Ubuntu 9.04.",
"Optimizing $(X_{n}+c)^{2}$ to show that $P(\\overline{X}_{n}\\geq \\lambda) \\leq E(X_{n}^{2})/(EX_{n}^{2}+ \\lambda^{2})$ Define $\\overline{X}_{n}:=\\max\\limits_{1\\leq m \\leq n} X_{m}$ and let $(X_{n})_{n}$ be a martingale where $X_{0}:=0$ and $EX_{n}^{2}< \\infty$ Show that $P(\\overline{X}_{n}\\geq \\lambda) \\leq E(X_{n}^{2})/(EX_{n}^{2}+ \\lambda^{2})$ As a hint: Consider $(X_{n}+c)^{2}$ and optimize over $c$. It is clear that $((X_{n}+c)^{2})_{n}$ is a submartingale and when I optimize over $c$, I get: $X_{n}^{2}+2X_{n}c +c^{2}\\Rightarrow 0=2X_{n}+2c=0\\Rightarrow -X_{n}=c$ It is also clear I need to use Doob's inequality but I am not sure how to go about this, and how the above optimization helps me."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Multiply arrays to make matrix gives unexpected result Suppose I have this code: dim = 3 eye = [[0] * dim] * dim and it is a list of list, I checked [[0, 0, 0], [0, 0, 0], [0, 0, 0]] Now, if I do this, I get: eye[1][2] = 1 eye [[0, 0, 1], [0, 0, 1], [0, 0, 1]] However, if I manually put in this expression, the above code works as expected: eye2=[[0, 0, 0], [0, 0, 0], [0, 0, 0]] eye2[1][2] = 1 eye2 [[0, 0, 0], [0, 0, 1], [0, 0, 0]] What is the difference between the two ? Update: Thanks for all the explanations, suppose I have this code: a = [0] type(a) b = a * 3 # or b = [[0] *3] So, b holds the 3 references to a. And I expect changing b[0] or b[1] or b[2] will change all 3 elements. But this code shows the normal behavior, why is that ? b[1] = 3 b [0, 3, 0]
|
List of lists changes reflected across sublists unexpectedly I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3 The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]] Then I changed one of the innermost values: my_list[0][0] = 5 Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]] which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?
|
[
"I got my dad a Logitech LS21 system for Christmas. It's a 2.1 system, but it's recognized in Windows 8 as a 2.0 system (it says there is no subwoofer connected). How would I go about getting the sub recognized? It plays some sound now, but it's so quiet you can't hear it without putting your ear right next to it.",
"I had created the xml document with xml version=\"1.0\". In that document I need to use the greater than symbol > and less than symbol <. How should I include those symbols? It's not working. &gt; and &lt; are not working for me. Is there any special encoder for this?",
"I have some files on my Unix machine that start with -- e.g. --testings.html If I try to remove it I get the following error: cb0$ rm --testings.html rm: illegal option -- - usage: rm [-f | -i] [-dPRrvW] file ... unlink file I tried rm \"--testings.html\" || rm '--testings.html' but nothing works. How can I remove such files on terminal?",
"Limit $\\frac{x^2y}{x^4+y^2}$ is found using polar coordinates but it is not supposed to exist.",
"How many times can I repeat a keyword without looking spammy to Google? I have an eCommerce based on Opencart, but I have some doubts about how many times I can repeat the same word. For example, the keyword is present in the title, description, h1, h2 and is repeated several times in the text: Page Title: Shop Iphone other keyword Page description: Shop Iphone other keyword (and they continue appearing below) H1: Shop Iphone other keyword H2: Shop Iphone other keyword 10 more times in the text: Shop iPhone I mean, if Googlebot sees the same WORD 30 times, can it be considered SPAM? Can I lose something or can I use keywords a lot? In WOORANK I saw my review and I noticed that I need to improve my keywords, and a lot. I have some keywords like: payment, description, promotion, sales... keywords really \"empty\" [ UPDATE ] Can repeating keywords make them lose importance?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Error when accessing the variable created in another thread
|
How to deal with cross-thread access exceptions?
|
[
"How to solve $y^2=3x^4+3x^2+1$ for integers. If $x,y \\in \\mathbb Z$ , then find all the solutions of $$y^2=3x^4+3x^2+1$$ I was asked this question by my friend who said that he encountered this while solving another problem. I have tried several things but am unable to solve this question. Moreover, this has to be done using elementary methods only. So far, I have tried to factorize and use Pell's equation. At the end, I'm getting $$2y_{n} + (2x^2_{n}+1)\\sqrt{3}=(2+\\sqrt{3})^{n}$$ where $n \\in \\mathbb Z^{+}$ But I'm not able to figure out how to show a contradiction from here. Can anyone please help me out? Thanks.",
"Apex PMD: Problem: Validate CRUD permission before SOQL/DML operation Background I am using the Apex PMD plugin for VS Code and it's giving me this problem: Validate CRUD permission before SOQL/DML operation For this line of code: insert contentVersion; Which is part of this method: private void attachReport(Id recordId) { ContentVersion contentVersion = new ContentVersion( versionData = Blob.valueOf(buffer.toStr()), title = 'Import Report', pathOnClient = StringUtils.format('/Import-Report-{0}.txt', DateTime.now().getTime()), FirstPublishLocationId = recordId); insert contentVersion; } Questions Why am I getting the problem? What should I do to not get the problem? Reference",
"Assume $$\\lim_{n\\to \\infty} (y_{2n} - y_n)=0$$ then $$\\lim_{n\\to \\infty} y_n$$ exists. I know it's not true, and I can see a sequence that disprove that $(1,1,2,1,3,2,4,1,5,3,...)$ but I want a sequence that has formula. hint/help? thanks",
"Where is the operator panel in Blender 2.8? The tutorial I read is based on 2.79. So I'm not sure if it's still the same name in 2.8. But I can't find anything providing similar functionalities.",
"How do you interpret a significant but weak correlation?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Why create clk and clk NOT with 2 inverters instead of 1? I see many circuits use this topology Why dont we use just only one inverter like this: Thanks very much!
|
Why two inverters cascaded in multiplexer control signal terminals? Why cascaded inverters are used in the multiplexer when it is possible to realize the circuit using a single inverter.
|
[
"Blocking comment spam without using captcha",
"At which embassy should I apply for a Schengen visa when staying a few days in several countries? I'm planning to go to Germany on Sept 6-8, then Netherlands on Sept 8-11 and exit Switzerland on Sept 11-14. My question is: Which embassy do I need to apply for the Schengen visa? The number of days are the same for Netherlands and Switzerland, but I'm planning to apply in Netherlands since it will be my second point of entry.",
"I want to build a personal portfolio so my questions related are as follows: What should I include in the portfolio apart from Home, About, Work, Contact? I have never worked on any real life examples so what to display in the work/portfolio page? What kind of design samples do I need to include? Ex: Website, Logo, Banner etc Any help is appreciated. Thanks!",
"In Ubuntu ISO MBR, why does a GPT partition overlap the boot partition, and make MBR uneditable?",
"Change System Language Solaris 8 I have Solaris 8 OS installed in French. Is it possible to switch from French to English without reinstalling the OS ? If yes how ? When locale -a i have this : POSIX common en_US.UTF-8 C iso_8859_1 en_CA en_CA.ISO8859-1 en_US en_US.ISO8859-1 en_US.ISO8859-15 en_US.ISO8859-15@euro fr_CA fr_CA.ISO8859-1 iso_8859_15 th th_TH th_TH.TIS620 Even when I try to edit /etc/default/init with : LANG=en_US.ISO8859-15 LC_COLLATE=en_US.ISO8859-15 LC_CTYPE=en_US.ISO8859-15 LC_MESSAGES=en_US.ISO8859-15 LC_MONETARY=en_US.ISO8859-15 LC_NUMERIC=en_US.ISO8859-15 LC_TIME=en_US.ISO8859-15 LC_ALL=en_US.ISO8859-15 and reboot : nothing happens. To verify the result i always use date and when i reboot : i also have the date in french. P.S : I have to do this configuration in a computer which isn't here in my office, so i have to this manipulation in a an another computer here in my office and if it works, i'll do it to the other computer. So the computer here is configured in English and i have to switch it to French. Here is the content of my ~./dt : C errorlog sessionlogs Desktop errorlog.old sessions Trash errorlog.older simulateur.dtwmrc appconfig help startlog appmanager icons startlog.old asr.dtwmrc outils.dtwmrc startlog.older bin palettes tmp bookmarks sdtfonts types dtwmrc sdtpcaction.conf wsmenu en_US.ISO8859-15 sdtpcaction.conf.bak Thanks"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Favourite tags must be highlighted I have just marked few tags as my favourite. As given below it highlights all the questions related to my Favourite tag. However, it does not highlight which is my favourite tag in that particular question. My suggestion is to highlight the user's favourite tag for those particular questions. Isn't it good to have some color surronding the favourite tag, so I know which is my favourite tag for such questions?
|
Highlight tags corresponding to our favorites Each of us have our list of favorite tags. When a question has tag(s) that match one or more of ours, the background gets highlighted, drawing our attention to the question. It would also be nice to highlight (perhaps using a bold font) the tags(s) that matched our own, so one could quickly do a further filtering of the question to see if it is of interest at the present time, like the following: e.g. arduino is in my list of favorites, but the other two in each question are not.
|
[
"C# Regular Expressions with \\Uxxxxxxxx characters in the pattern",
"An English book tells me that the following sentence is correct: This publication is made from paper from sustainable forests. Shouldn't it be of paper instead?",
"I have 2 monitors connected to a NVIDIA GeForce GTX 660: Left is 1920x1080 via DVI (Samsung SyncMaster 2443BW) Right is 2560x1440 via DisplayPort and is set to Primary (Samsung SyncMaster SA850) I often leave my computer running overnight (working on long render job, doing backups, etc) so I only power off my monitors manually. However, if I power off the primary monitor, it is disabled completely as if it were unplugged from the graphics card (i.e. icons are moved, open apps are moved and resized to fit on the new primary monitor). If I switch from DP to a DVI cable, this does not occur. It seems to be an issue when using DisplayPort. Is there a way to disable the monitor from being disabled completely in Windows when I power it off physically? I have found no relevant settings in either Windows Display settings, nor the NVIDIA control panel software. Edit #1: I'm using an . Edit #2: Here is a screenshot of my NVIDIA Control Panel v7.2.710.0: Edit #3: Here are screenshots of my Monitor configuration: Clicking on Advanced settings reveals a Generic PnP monitor running at 59 Hz? 60 Hz is the only other option available. Here is my secondary monitor which is connected via DVI: Edit #4: If I open the \"Screen Resolution\" configuration panel and power the monitor off (via the power switch), this is what is shown: It looks like I disconnected the monitor from the video card.",
"End of javascript sidebar workarounds? (Salesforce Classic / Aloha) Reading through this doc: We replaced the rich text editor in HTML Area home page components with a new version that supports more markup but doesn’t allow HTML to be manually entered. In Summer ’15 we will start removing unsupported code from HTML Area home page components. As a result, components that contain JavaScript, CSS, iframes, or other unsupported markup might stop working properly. To use JavaScript or other advanced HTML elements in your home page component, we recommend that you use a Visualforce Area component instead. With Visualforce homepage component the best we could do is design fancy home page components, which has not been the big use of sidebar amongst developers. How do we do the fancy hack we do today using html components since visualforce is hosted in a different domain will the sidebar hacks even work after summer 15? You can include JavaScript in your Visualforce page, but because the component is rendered in an iframe on the home page layout, the JavaScript can’t interact with the page that contains the component. Finally why this move :(?",
"$B^n/S^{n-1}$ is homeomorphic to $S^n$ Let $B^n$ be a n-dimensional disc (ball) with boundary $S^{n-1}$. Prove that $B^n/S^{n-1}$ is homeomorphic to $S^n$. Could someone check my proving, please? Let put the ball $B^n=\\{x\\in\\mathbb R^n\\mid |x|\\leq 1\\}$ into $\\mathbb R^{n+1}$ using $x\\mapsto (x,0)$. Then we can use homeomorphism $(x,0)\\mapsto (x,\\sqrt{1-|x|})$. We fall into the half of the sphere $S^n$. The boundary of the ball after this will turn just into points of the form $(*,0)$. If you pull it to the point then we will get suspension $S^{n-1}$ or $S^n$."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Can I post more than one answer to a question? I'm asking because of this . I have already provided an answer and I have another way to achieve the solution. I want to add both answers. Can I do that or are there any consequences for this?
|
Two Answers, One Question Sometimes, when I answer a question on Stack Overflow, I have two different answers that are equally valid. This happens most when answering architectural questions where there are many valid ways to solve a problem. Is it better to put each alternative into a single answer, or put each alternative in its own answer? Posted each alternative separately will allow the voting system to float the best answer to the top, but I don't want to be accused of rep whoring by "flooding" a question with answers. What's your opinion? One or two answers?
|
[
"Why normal acceleration doesn't bring a change in speed? Suppose There's a particle of mass m moving with speed $v_{0}$, at certain moment a force starts acting on it (centripetal force) and it start uniform circular motion Now every other reference states that centripetal force only brings about change only in direction But plugging-in things in the equations paint a different picture suppose normal/centripetal acceleration = $A$ then $|v| = \\sqrt{v_{0}^2+\\frac{(A t)^2}{1}}$ we can certainly see that factor of $t$ will bring change in magnitude of velocity Secondly, why the velocity is always tangential to the circle, but how can we mathematically show such? Intuitively for me if there's constant acceleration toward a certain then at some point of time, the body should 'slack' and fall toward the direction of acceleration Here' a picture for a reference:",
"I've been doing some practice questions in the textbook for an upcoming predicate calculus lecture and I think I've managed to get A and B (possibly C) correct but I am clueless on how I can manage D and E. For A I got: ∃x(R(x)∧¬B) For B I got: ∀x(¬R(x)∧B) For C I got: ∃x(R(x)∧(x=y)) - Not sure if this is even remotely correct R(X) : ”X is rich” X = Y : ”X equals Y” B : ”Bill Gates” a) Someone besides Bill Gates is rich. b) Bill Gates alone is rich. c) At least two people are rich. d) Exactly one person is rich. e) Exactly two persons are rich. The universe of discourse is the set of all people.",
"Good Afternoon all, I am trying to typeset a symbol that I have been using to represent the integral of a regulated function. This symbol is the standard integral symbol, with the letter \"R\" superimposed on it. I have tried using \\mathllap, \\mathclap and \\mathrlap (as suggested ), however none of these have managed to give the desired effect. When I tried doing it without the limits of integration, it got close to working, however then I was unable to have the limits to the right hand side of the symbol: \\mathop{\\mathrlap{\\int}R}_a^b f Any help would be greatly appreciated, thank you in advance! Minimal Example: \\documentclass{article} \\usepackage{amsmath,mathtools} \\begin{document} Take the regulated function $f$, we want to compare the Riemann integral, $\\int_a^b f$ to the regulated integral $\\mathop{\\mathrlap{\\int}R}_a^b f$ by taking sequences of step functions. We will prove that $$ \\mathop{\\mathrlap{\\int}R}_a^b f = \\int_a^b f $$ \\end{document}",
"How to convert a currency string to a double with jQuery or Javascript?",
"How to control RAM / swap usage Is there a way (application) to control RAM / swap usage policy at application level. I have some applications that I use all the time and I want them to stay in RAM all the time and there are also application that I use quite seldom and they might be thrown to swap at demand. I know that default configured windows should give me best performance but I want to check whether I can get more :). I use windows 7."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
I would like to know that to determine Fisher information from the Likelihood model, why do we take the log of the likelihood first instead of using normal likelihood ?
|
I'm trying to understand at a deeper level the ubiquity of log-likelihood (and perhaps more generally log-probability) in statistics and probability theory. Log-probabilities show up all over the place: we usually work with the log-likelihood for analysis (e.g. for maximization), the Fisher information is defined in terms of the second derivative of the log-likelihood, entropy is an expected log-probability, Kullback-Liebler divergence involves log-probabilities, the expected diviance is an expected log-likelihood, etc. Now I appreciate the many practical and convenient reasons. Many common and useful pdfs are from exponential families, which leads to elegantly simplified terms when log-transformed. Sums are easier to work with than products (esp for differentiating). Log-probs have a great floating point advantage over straight probs. Log-transforming a pdf often converts a non-concave function into a concave function. But what is the theoretical reason/justification/motivation for log-probs? As an example of my perplexity, consider the Fisher information (FI). The usual explanation for intuiting the FI is that the second derivative of the log-likelihood tells us how "peaked" the log-likehood is: a highly peaked log-likelihood means the MLE is well-specified and we are relatively sure of its value, while a nearly flat log-likehood (low curvature) means many different parameter values are nearly as good (in terms of the log-likelihood) as the MLE, so our MLE is more uncertain. This is all well-and-good, but isn't it more natural to just find the curvature of the likelihood function itself (NOT log-transformed)? At first glance the emphasis on the log-transform seems arbitrary and wrong. Surely we are more interested in the curvature of the actual likelihood function. What was Fisher's motivation for working with the score function and the Hessian of the log-likelihood instead? Is the answer simply that, in the end, we have nice results from the log-likelihood asymptotically? E.g., Cramer-Rao and normality of the MLE/posterior. Or is there a deeper reason?
|
[
"Is this intended behavior (with plain XeTeX): \\input tikz \\tikz\\draw[dashed] node {$3T\\over4$}; \\bye It renders as: !? The fraction line is dashed, too! Is this intentional? Is there something I can do to change that? I know I can separate the fraction into its own node, but other than that?",
"I got this $$ f=a(x-1)(x-2)...(x-101) $$ knowing a and that $1 ,2 \\ldots ,101$ are it's roots ... I need the roots of $f'$ , how should I do it ? More specifc how can I derivate a polynomial like that, is there a formula or something ?",
"Which site deals with career development questions for programmers? Is there any site in the network where career development questions about the programming profession can be asked ? I thought Programmer's was the site for it, but that doesn't appear to be the case.",
"These days, the standard way to present differential calculus is by introducing the Cauchy-Weierstrass definition of the limit. One then defines the derivative as a limit, proves results like the Leibniz and chain rules, and uses this machinery to differentiate some simple functions such as polynomials. The purpose of my question is to see what creative alternatives people can describe to this approach. The nature of the question is that there is not going to be a single best answer. I have several methods that I've collected which I'll put in as answers to my own question. It's not reasonable to expect answers to include an entire introductory textbook treatment of differentiation, nor would anyone want to read answers that were that lengthy. A sketch is fine. Lack of rigor is fine. Well known notation and terminology can be assumed. It would be nice to develop things to the point where one can differentiate a polynomial, since that would help to illustrate how your method works and demonstrate that it's usable. For this purpose, it suffices to prove that if $n>0$ is an integer, the derivative of $x^n$ equals $0$ at $0$ and equals $n$ at $1$; the result at other nonzero values of $x$ follows by scaling. Doing this for $n=2$ is fine if the generalization to $n>2$ is obvious.",
"I'm currently using but it sometimes falls over when the RSS or Atom feed isn't well formed. Are there any other options for parsing RSS and Atom feeds with PHP?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
A compact operator T such that $T^{2}=T$ is a finite rank operator Let $X$ be a normed linear space. Let $T: X \to X$ be compact linear operator and $T^{2}=T$. Show that T is a finite rank operator, that is, $Range(T)$ is finite dimensional in $X$. I have no idea how to show that this operator is of finite rank. Any hint or solution will really be appreciated. Thanks in advance!
|
An idempotent operator is compact if and only if it is of finite rank Would you help me to solve this problem. Show that an idempotent operator on hilbert space is compact if and only if it has finite rank.
|
[
"Adding HTML5 placeholder to all drupal forms I'm trying to add the placeholder attribute to all textfields across my website, but I'm having no luck. I've created a module that overrides hook_form_alter function mymodule_form_alter(&$form, &$form_state, $form_id) { foreach ($form as $key => $value) { if (\"textfield\" == $value[\"#type\"]){ $value['#attributes'][\"placeholder\"] = t($value[\"#title\"]); } } } I should tell you that I'm also using the webform module.",
"datetime conversion to CDT Can anyone please help me how to convert the given time into CST timezone. Input timezone will change dynamically, so i want to convert the given timzone into CST and then need to get the hour from that CST timezone in apex.",
"The function auto.arima in the forecast package of R is a powerful tool to identify the best ARIMA(p,d,q) model for a given data series. In the of the function, they report the following: auto.arima(y, d=NA, max.p=5, max.q=5, max.order=5, max.d=2, start.p=2, start.q=2, ...) According to the above function it seems that, by default, auto.arima tries to find the best model among all the combination having: p equal or lower than 5 q equal or lower than 5 d equal or lower than 2 order equal or lower to 5, i.e. p + q + d ≤ 5. However, why does the default code stops at these conditions? Is there any particular reason why p, q and d should be equal or lower than 5, 5 and 2 and their sum lower than 5?",
"How do you prevent oatmeal from overflowing? Whenever I cook oatmeal (whether steel cut oats in a rice cooker or pan, or rolled oats in the microwave), it always overflows. How do you prevent this? Do you just use a bigger container? Do you just take the pan off the heat or bowl off the microwave when it's about to overflow? I've also heard that if you put dried fruit or something like that along with the oatmeal while cooking, that helps prevent it from overflowing -- is this true?",
"How to transpose a dataset in a csv file?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Get profile properties from person/group field using rest api I have a list with a person field. I need users to fill in the field with their names but I need to get the following properties below from that field using rest API: Email Address Name(Full Name) Department Job Title Phone Number Is this possible? Thanks in Advance.
|
SharePoint online REST: Get users profile properties I'm looking for some help with a REST call I'm attempting to make in SharePoint Online. I'm doing an add-in that gives me the name, birhday and photo property of all user in user profiles I tried with this code var siteUrl = _spPageContextInfo.siteAbsoluteUrl; Console.log(siteUrl); $.ajax({ url: siteUrl + "/_api/SP.UserProfiles.PeopleManager/GetMyProperties", method: "GET", headers: { "Accept": "application/json; odata=verbose" }, success: function (data) { console.log(data); }, error: function(error) { console.log(error); } }); but I only get current user profile properties, what I need is all user profiles properties for all users, how can i achieve that? Thanks in advance!
|
[
"Are \"if\" and \"iff\" interchangeable in definitions? In some books the word \"if\" is used in definitions and it is not clear if they actually mean \"iff\" (i.e \"if and only if\"). I'd like to know if in mathematical literature in general \"if\" in definitions means \"iff\". For example I am reading \"Essential topology\" and the following definition is written: In a topological space $T$, a collection $B$ of open subsets of $T$ is said to form a basis for the topology on $T$ if every open subset of $T$ can be written as a union of sets in $B$. Should I assume the converse in such a case? Should I assume that given a basis $B$ for a topological space, every open set can be written as a union of sets in $B$? This is just an example, I am not asking specifically about this sentence.",
"Mathematical symbol for \"and\" I have found some pretty complete lists (I think) of mathematical symbols and , but I don't see a symbol for the word \"and\" on either list. A person could easily just write the word \"and\" or use an ampersand, but I was wondering if there was an actual mathematical symbol for the word \"and\". Also, if anyone knows any lists that are more complete than the ones I have linked to please provide a link.",
"Proper subspaces of $ R^n $ I'm trying to prove that proper subspaces of $ R^n $ are closed and have empty interiors. To prove that they are closed I'm trying to use the fact that inverse images of closed sets are closed sets by continuous functions. So I'm trying to find a linear map such that a proper subspace of $ R^n $ is its Kernel but I don't know how to express it so that it would work on all dimensions. Regarding the fact that they have empty interiors, I really don't know what to do. Thanks in advance.",
"Sentient Bomb in a city on the moon? I would like to know the title of the short story that I believe takes place on the moon. The setting is a mall or some other very public location and the main character is a police officer. She needs to talk a sentient bomb out of exploding. I know there was the John Carpenter film \"Dark Star\" with a similar plot line but I'm trying to identify the short story and the author.",
"How do I get a really wide tilde? I need to cover at least abcdefghijklmnopqrstuvwxyz The \\widetilde command does not work. Nor using \\stackrel with \\sim."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Functions which satisfy $f(m^2+n^2)=f(m)^2+f(n)^2$
|
If $f(1)=1$, then is it true that $f(n)=n$ for all $n \in \mathbb{N}\cup\{0\}$.
|
[
"Understanding the proof of infinitely many primes $\\equiv 3\\pmod{\\!4}$ Theorem: There are infinitely many primes congruent to $3 \\mod 4$. Proof: Assume that $p_1 = 3, . . . , p_n$ are primes of the form $p_j ≡ 3 \\mod 4$. We will construct a new one by looking at $N = 4p_1 · · · p_n − 1$ (putting $N = 4p_1 · · · p_n+3$ would also work). There is more to this proof but the rest of it I understand, what I don't get is where it says "$N = 4p_1 · · · p_n − 1$ (putting $N = 4p_1 · · · p_n+3$ would also work)". I do not understand why we are writing $4p_1 · · · p_n − 1$. Is there a more clear way to prove this theorem?",
"What are these stamps in my passport after I was advised to divert via the UK but didn't have a visa? I am from Myanmar. I was on my way to Venice from Brussels while holding Schengen visa (single entry). I bought a British Airways ticket to fly from Brussels to Venice. Unfortunately, on that day, all BA flights from Brussels were canceled. British Airway's customer service centre told me to go to from Brussels to London by train, where I could catch my flight to Venice. I took a taxi to Bruxelles-Midi train station and bought a ticket to London. A Brussels immigration officer inspected and approved my passport. Then I had to to through UK Border Immigration. There, they said I can't enter to get my flight. Although I explained the situation with the airline and made clear of my destination (I already reserved my hotels in Venice, Switzerland and France as described in my travel itinerary), they detained me for some hours and also took my fingerprints on paper and photo. They asked questions concerned about my finances and gave me a refusal letter for not having a transit visa. So I had to re-enter Brussels where the immigration officer put the below stamp in my passport. As I had a single entry Schengen visa, I had to buy another airline ticket to Venice and complete my Europe trip. What do the stamps below mean on my passport? Can they affect me and, if so, how and why, when I apply for another Schengen visa?",
"What's the starting wealth for higher levels? The PHB only gives starting wealth for Level 1 PCs. Based on my experience in other games, specifically Pathfinder, I would expect to get more at higher levels. Where can I find an appropriate table or calculation?",
"Large braces for specifying values of variables by condition",
"Let $a,b,c,d,p$, and $q$ be natural numbers such that $ad-bc = 1$ and $\\frac{a}{b} > \\frac{p}{q} > \\frac{c}{d}$. How prove that $q \\geq b+d$?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
How to get more information about generalized binomial series I am reading about generalized binomial series in Concrete Mathematics by Knuth,and FEW documents exist on the Internet(including wikipedia).What should I do to find more resources?If anyone could help,I would really appreciate it.
|
Any Info on Generalized Binomial and Exponential Series? I was reading Concrete Mathematics by Knuth et al. and on p. 200, it references the generalized binomial series $\mathcal B_t(z)$ and the generalized exponential series $\mathcal E_t(z)$, defined as $$\mathcal B_t(z)=\sum_{k\ge0}(tk)^{\underline{k-1}}\frac{z^k}{k!}\quad\text{and}\quad\mathcal E_t(z)=\sum_{k\ge0}(tk+1)^{k-1}\frac{z^k}{k!},$$ where $x^{\underline k}$ denotes the falling factorial. I was interested in the generalized binomial series because it satisfied the identity $$\frac{\mathcal B_t(z)^r}{1-t+t\mathcal B_t(z)^{-1}}=\sum_{k\ge0}\binom{tk+r}{k}z^k.$$ I've been trying to find a way to compute the sum $\sum_{n\le k\le m}\binom{tk+r}{k}$, so this seemed related. It seems that $\mathcal E_1(z)$ is also somewhat related to the Lambert $W$ function, though I might be wrong. Searching them up online didn't seem to get anywhere, and I just want to find more sources where I can learn about these functions. If anyone can find some resources, I'd appreciate it!
|
[
"How to Flatten a Multidimensional Array?",
"I know that the emergency services can be called FREE in the UK by dialing 999 and in the US by dialing 911. What I don't know is the number to call in other countries and if there is a cost involved. This is something I think most people should find out before travelling but many don't (including me). Hopefully this will help me and other people.",
"How come gas molecules don't settle down? If the earth's gravity exerts a net downward gravitational force on all air molecules, how come the molecules don't eventually lose their momentum and all settle down? How is the atmosphere is still miles thick after billions of years?",
"tar compression without directory structure",
"How to install Chromium without snap? I just discovered that chromium will only be released as a snap package. How can I continue to get chromium, without snap? Is this possible without building from source? Notes: Please let's keep to the question as stated - not \"what do you have against snap?\" I'm not asking how to remove snap (I realize that would break Ubuntu)... just how to use chromium as it is now, a deb. Update No, this is not a duplicate of that linked question. I don't need to know \"why it's a snap\". I want to know how to use it without snap. Right now there is building from source, and some random PPA mentioned below. I hope someone can advise us of trustworthy alternatives."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Sci fi novel about alien invaders to earth that can jump high like grasshoppers
|
Aliens like giant grasshoppers invade earth, give black people power over whites
|
[
"How to correctly install libpng12-0 on the Ubuntu 19.10?",
"Replacing NAs with latest non-NA value",
"Downgrading from Safari 12 (beta) to Safari 11 Installing Safari beta version is apparently only possible by replacing the builtin Safari version. In this case version 11.1.2 with 12. If beta version does not work, gives too much trouble or is just unpleasant: How do we downgrade to an official stable version, currently Safari 11.1.2 for 10.12.6 Sierra? I tried to restore everything relating to 11.1.2 from a backup (going by what is found that is in the installer package), I located and re-applied the 11.1.2_Sierra.pkg. Yet Safari now refuses to work entirely. Crashed Thread: 3 Dispatch queue: com.apple.SafariCore.RemotePlistController.internalQueue Exception Type: EXC_CRASH (SIGABRT) Exception Codes: 0x0000000000000000, 0x0000000000000000 Exception Note: EXC_CORPSE_NOTIFY Application Specific Information: *** Terminating app due to uncaught exception 'NSInvalidArgumentException', reason: '*** -[_NSPlaceholderData initWithContentsOfURL:options:error:]: nil URL argument' terminating with uncaught exception of type NSException abort() called Is there any way around re-installing the entire system?",
"After offering a bounty to , I realize that I cannot comment on the question because I no longer have the required reputation. Is it possible to change this behavior, so that the bounty owner can comment only on the post with the bounty irrespective of their reputation? While bounty owners are told that they'll lose privileges at the time they place a bounty, it makes sense to allow them to interact with potential answerers/commentators to help solve the problem, or at least provide additional information.",
"How to limit Docker total resources? I'm trying to limit the total resources accessible from docker (for example only 90% of the RAM and 1500% of the CPU). I cannot use CPU and RAM limit when I'm launching my containers, that's why I need to limit the total resources available for docker containers. I have around 20 containers which can consume the maximum CPU and memory but not at the same time, so I cannot set the CPU and RAM limit, that's why I need to limit the total resource used by docker First of all I've created a slice: I tried the instruction above, but impossible to limit both the RAM and the CPU usage # /etc/systemd/system/docker_limit.slice [Unit] Description=Slice that limits docker resources Before=slices.target [Slice] CPUAccounting=true CPUQuota=700% #Memory Management MemoryAccounting=true MemoryHigh=20G MemoryMax=25G MemoryMaxSwap=10G And my daemon.json { \"insecure-registries\" : [ \"url1\", \"url2\"], \"cgroup-parent\": \"docker_limit.slice\" } But when I try from a container: stress --vm-bytes $(awk '/MemAvailable/{printf \"%d\\n\", $2 * 0.9;}' < /proc/meminfo)k --vm-keep -m 1 I can see from docker stats it's using 111Go of Ram (full capacity of my server) stress --cpu 16 I can see from docker stats it's using near 1600 % (full capacity of my server) I think I've missed something but I don't know what"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
evaluate string expression in C# I have the following string expression which am trying to run ,But am getting error saying string format is not correct for (i = diffvol; i < result.count; i++) { B1Volume = Convert.ToDecimal(String.Format("result.Data[0].B{0}Volume", i)); B2Volume = Convert.ToDecimal(String.Format("result.Data[0].B{0}Volume", i)); }
|
How can I evaluate a C# expression dynamically? I would like to do the equivalent of: object result = Eval("1 + 3"); string now = Eval("System.DateTime.Now().ToString()") as string Following Biri s , I got this snippet (modified to remove obsolete method ICodeCompiler.CreateCompiler(): private object Eval(string sExpression) { CSharpCodeProvider c = new CSharpCodeProvider(); CompilerParameters cp = new CompilerParameters(); cp.ReferencedAssemblies.Add("system.dll"); cp.CompilerOptions = "/t:library"; cp.GenerateInMemory = true; StringBuilder sb = new StringBuilder(""); sb.Append("using System;\n"); sb.Append("namespace CSCodeEvaler{ \n"); sb.Append("public class CSCodeEvaler{ \n"); sb.Append("public object EvalCode(){\n"); sb.Append("return " + sExpression + "; \n"); sb.Append("} \n"); sb.Append("} \n"); sb.Append("}\n"); CompilerResults cr = c.CompileAssemblyFromSource(cp, sb.ToString()); if (cr.Errors.Count > 0) { throw new InvalidExpressionException( string.Format("Error ({0}) evaluating: {1}", cr.Errors[0].ErrorText, sExpression)); } System.Reflection.Assembly a = cr.CompiledAssembly; object o = a.CreateInstance("CSCodeEvaler.CSCodeEvaler"); Type t = o.GetType(); MethodInfo mi = t.GetMethod("EvalCode"); object s = mi.Invoke(o, null); return s; }
|
[
"Forgot which email I used, can't login I forgot what email I used for my other ploxtic id: how do you find out what my email was? The account is user:2078229.",
"\"Heard me [infinitive]\" vs. \"heard me [present participle]\" \"Heard me [infinitive]\" vs. \"heard me [present participle]\" At that time, you wouldn't have heard me talk about it. At that time, you wouldn't have heard me talking about it. At that time, you wouldn't have heard me condemn it. At that time, you wouldn't have heard me condemning it. Which one of the above sentences are incorrect and why?",
"Warning when battery is fully charged I would like to get an alert (with sound) when my laptop battery is fully charged. How can I do that?",
"What is the fastest way to create a list of directories specified in a file? I have a text file, \"foo.txt\", that specifies a directory in each line: data/bar/foo data/bar/foo/chum data/bar/chum/foo ... There could be millions of directories and subdirectories What is the quickest way to create all the directories in bulk, using a terminal command ? By quickest, I mean quickest to create all the directories. Since there are millions of directories there are many write operations. I am using ubuntu 12.04. EDIT: Keep in mind, the list may not fit in memory, since there are MILLIONS of lines, each representing a directory. EDIT: My file has 4.5 million lines, each representing a directory, composed of alphanumeric characters, the path separator \"/\" , and possibly \"../\" When I ran xargs -d '\\n' mkdir -p < foo.txt after a while it kept printing errors until i did ctrl + c: mkdir: cannot create directory `../myData/data/a/m/e/d': No space left on device But running df -h gives the following output: Filesystem Size Used Avail Use% Mounted on /dev/xvda 48G 20G 28G 42% / devtmpfs 2.0G 4.0K 2.0G 1% /dev none 401M 164K 401M 1% /run none 5.0M 0 5.0M 0% /run/lock none 2.0G 0 2.0G 0% /run/shm free -m total used free shared buffers cached Mem: 4002 3743 258 0 2870 13 -/+ buffers/cache: 859 3143 Swap: 255 26 229 EDIT: df -i Filesystem Inodes IUsed IFree IUse% Mounted on /dev/xvda 2872640 1878464 994176 66% / devtmpfs 512053 1388 510665 1% /dev none 512347 775 511572 1% /run none 512347 1 512346 1% /run/lock none 512347 1 512346 1% /run/shm df -T Filesystem Type 1K-blocks Used Available Use% Mounted on /dev/xvda ext4 49315312 11447636 37350680 24% / devtmpfs devtmpfs 2048212 4 2048208 1% /dev none tmpfs 409880 164 409716 1% /run none tmpfs 5120 0 5120 0% /run/lock none tmpfs 2049388 0 2049388 0% /run/shm EDIT: I increased the number of inodes, and reduced the depth of my directories, and it seemed to work. It took 2m16seconds this time round.",
"Removing unnecessary vertices? I have over sampled polygons that I need to simplify, without changing the shape. basically, I want to reduce the number of vertices, by eliminating the ones that are useless and have the polygons represented with the significant vertices only. I used to do that with ET GeoWizards Plug-in, but I don't have a license anymore. My table has 500.000 features, water polygons. Any ideas?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
If $z$ lies on the circle $|z-1|=1$ then$\frac {z-2} z$ is a purely imaginary number If $z$ lies on the circle $|z-1|=1$ then $\frac {z-2} z$ is a purely imaginary number. This is what by book states. Did'nt understand why. Can someone help? Actually I was thinking of a more geometrical approach to the problem, as pointed out by @did and the answer below. I also remembered the method that if $\bar z = -z$ then $z$ is purely imaginary. But can it also be done by visual geometry? Ok, I drew a circle centred at $1$ with radius $1$. The statement given implies $\frac {z-2} z$ equals any point on the semicircle. After that how do we prove its imaginary from there?
|
If $z$ lies on the circle $|z-1|=1,$ then the value of $\frac{z-2}{z}$ is If $z$ lies on the circle $|z-1|=1, $ then the what is the value of $\frac{z-2}{z}$ ($z\ne 0 \ \text{and} \ 2$ ) is? What I am aware of : the equation $|z-1|=1$ represent a circle with centre $(1,0)$ and radius $1$. Also $$|z-1|=1 \implies (z-1)^2=1 \\ \implies z^2-2z+1=1 \implies z(z-2) =0$$ $\implies z = 0; z =2 $ I think this is wrong.. please suggest thanks..
|
[
"Here $p$ and $q$ are co-prime integers. Is it necessarily an algebraic number?",
"My dconf/gsettings installation is broken. How can I fix it without Ubuntu reinstall? I run Ubuntu 12.04.1 LTS x64 in VirtualBox. After one very unfortunate misclick (reset saved state instead of load saved state) I got a very annoying problem. Almost all applications (unity, synaptic, gedit, etc.) print on start: Using the 'memory' GSettings backend. Your settings will not be saved or shared with other applications. And all GUI settings reset after reboot. Another symptom: $ GSETTINGS_BACKEND=dconf dconf-editor (dconf-editor:2353): GLib-GIO-WARNING **: Can't find module 'dconf' specified in GSETTINGS_BACKEND GLib-GIO-Message: Using the 'memory' GSettings backend. Your settings will not be saved or shared with other applications But /usr/lib/x86_64-linux-gnu/gio/modules/libdconfsettings.so is present. What I tried (and it didn't help): sudo apt-get install -f --reinstall dconf-tools libdconf0 libdconf-dbus-1-0 dconf-service Build dconf-0.5 from sources and make install it Create empty user profile and start programs there I have to keep current Ubuntu installation so a complete reinstall is not an option for me. How can I fix it?",
"Parsing date/time string with timezone abbreviated name in Python?",
"How do I put /home in a different partition? Yeah, so I have 2 hard drives, on with 2 partitions(backups and windows), and I have another that also has 2 partitions with only one used. I have Ubuntu on hard drive 2:partition one, but I have come to a point when the /home folder can't hold any more files, but the partition is only about 15% filled up. So I did some researching and figured out that you can put it on a separate partition, but most of the guides were vague on what I needed to do. Could someone give me step-by-step instructions on what I need to do, or even tell me a, easier or different way to fix this /home folder capacity problem?",
"How do I fill a shape with text, like a circle? How do I confine text within a shape such as a circle or triangle? I don't want text along the perimeter, I would like it to break appropriately at all the inner edges."
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
When I write a friend declaration like this template<typename T> struct Foo {}; struct Bar { friend class Foo<Bar>; }; everything is fine. However, when I use a typedef template<typename T> struct Foo {}; struct Bar { typedef Foo<Bar> FooBar; friend class FooBar; }; gcc (4.4.7) complains with error: using typedef-name ‘Bar::FooBar’ after ‘class’ error: ‘Bar::FooBar’ has a previous declaration here error: friend declaration does not name a class or function I always thought a typedef behaves exactly the same as if I typed the original type.... Is it not allowed to use a typedef here? or am I just using it wrong? PS: the template turned out to be a red herring, the following will cause the same error struct Foo{}; struct Bar{ typedef Foo FooBar; friend class FooBar; };
|
Does anyone know why typedefs of class names don't work like class names for the friend declaration? class A { public: }; class B : public A { public: typedef A SUPERCLASS; }; typedef A X; class C { public: friend class A; // OK friend class X; // fails friend class B::SUPERCLASS; // fails };
|
[
"Selecting all files in directory for merging in QGIS Processing? I'm writing a generic script which involves writing shapefiles to a directory which are then merged together. After writing the files out to the Output folder, I'm trying to get the saga:mergeshapeslayers algorithm to merge all the files in the Output folder. I have used the Model Builder and although it is helpful to an extent, I find that it is used for specific purposes whereas I am attempting to make a script for generic purposes. Code: ##Test=name ##Select_folder=folder ##Result=output vector import os import glob path_1 = Select_folder path = path_1 os.chdir(path) def function(): output = glob.glob(path_1 + './*.shp') x = 0 while output[x]: for fname in glob.glob(\"*.shp\"): outputs_1 = processing.runandload(\"qgis:fieldcalculator\", output[x], 'Number', 1, 10, 0, True, 1 , \"C:\\Users\\Me\\Desktop\\Output\\\\\" + fname) multiple_0 = glob.glob(\"*.shp\") x = x + 1 if x + 1 > len(output): processing.runalg(\"saga:mergeshapeslayers\", output[0], \";\".join(multiple_0) , Result) break else: continue if path_1: function() else: pass",
"I want to calculate the posterior distribution given a gamma-prior and a poisson likelihood. The task is from a textbook and I just have the solutions (without a walkthrough). Please find all given information in the following: Given information: $m$ countries each with a population of $n_i$; $y_i$ is the number of people having a disease; $y_i$ is a poisson random variable with mean $\\frac{n_i*\\lambda}{100}$ The prior distribution for $\\lambda$: $\\lambda \\sim Gamma(a_0,b_0)$ Task: Show that the posterior distribution is also a gamma distribution with $a_m = a_0 + \\sum_{i = 1}^{m}y_i$ and $b_m = b_0 + \\sum_{i = 1}^{m} \\frac{n_i}{100}$ My solution: $Posterior \\propto Likelihood \\times Prior$ $p(\\theta|y) \\propto \\prod_{i=1}^{m}(\\theta^{y_i}e^{-\\theta})\\times \\theta^{a_0-1}e^{-b_0\\theta}$ $p(\\theta|y) \\propto \\theta^{\\sum_{i = 1}^{m}y_i}e^{-m\\theta}\\times \\theta^{a_0-1}e^{-b_0\\theta}$ $p(\\theta|y) \\propto \\theta^{\\sum_{i = 1}^{m}y_i+a_0-1}e^{-\\theta(m+b_0)}$ $a_m = a_0 + \\sum_{i = 1}^{m}y_i$ $b_m = b_0 + m \\neq b_0 + \\sum_{i = 1}^{m} \\frac{n_i}{100}$ I think I am doing a mistake, because I don't know how to incorporate the information that the mean of $y_i$ is given as $\\frac{n_i*\\lambda}{100}$. Or do I just have to transform $b_m$ somehow? Can someone may give me a hint? Thank you already in advance! Edit 1: Considering first advices $Likelihood: p(y | \\theta) \\propto \\prod_{i=1}^{m}(\\frac{n_i\\lambda}{100})^{y_i}e^{-\\frac{n_i\\lambda}{100}}$ $\\propto \\prod_{i = 1}^{m} ((\\frac{n_i}{100})^{y_i})\\lambda^{\\sum_{i=1}^{m}y_i}e^{-\\lambda\\sum_{i=1}^{m}\\frac{n_i}{100}}$ $\\propto \\lambda^{\\sum_{i=1}^{m}y_i}e^{-\\lambda\\sum_{i=1}^{m}\\frac{n_i}{100}}$ Is the transformation of $\\prod_{i=1}^{m}$ I did from the first to the second step correct?",
"What kind of questions can I expect to see on a qualifying exam?",
"In theory, is it possible that the loss on the train set will increase together with the train set accuracy? (in the normal case the train set loss should go down) And vice versa, can the train loss decrease along with the accuracy? Note: This is obviously different than the classic underfit / overfit cases which are easier to grasp.",
"Change default code page of Windows console to UTF-8 Currently I'm running Windows 7 x64 and usually I want all console tools to work with UTF-8 rather than with default code page 850. Running chcp 65001 in the command prompt prior to use of any tools helps but is there any way to set is as default code page? Update: Changing HKEY_LOCAL_MACHINE\\SYSTEM\\CurrentControlSet\\Control\\Nls\\CodePage\\OEMCP value to 65001 appear to make the system unable to boot in my case. Proposed change of HKEY_LOCAL_MACHINE\\Software\\Microsoft\\Command Processor\\Autorun to @chcp 65001>nul served just well for my purpose. (thanks to )"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
How can I make my PHP script run at a certain time everyday?
|
PHP: running scheduled jobs (cron jobs)
|
[
"Symbolic coordinates for a hyperbolic grid? Rephrasing (one year later) (original question is below) Apparently the original question wasn't clear, or nobody knows an answer (or both). So I will try to rephrase it. Look at your favorite . This question asks for a labeling system for the points. Of course we could draw the grid on the Poincare disk, and use real numbers (the (x,y) coordinates of each point), but in practice that would raise all sorts of precision issues that could surely be avoided if one had a proper symbolic coordinate system. You shouldn't need real numbers if you're staying on grid points! Just like (2,3)+(0,1) is trivial to do by hand (or in your head) for the square grid, we'd like some form of symbolic coordinates (i.e. consisting of finite sequences of symbols) for a hyperbolic grid, in which simple operations on small grid vectors are similarly easy. If you take some sequence of left and right turns in a hyperbolic grid city, what should you keep track of in your head so you can take the optimal route back to your starting point? In a Euclidean square grid, it is {(int)X, (int)Y, (enum)direction you are facing}, and we all know how to use this. Is there any hyperbolic grid where this question has a nice answer? Original Question If we consider the Euclidean plane, then a square grid works well with using two integers (the coordinates) as a representation for vectors that lie on the grid. Does anybody know of a similarly nice representation for working in the hyperbolic plane? Desirable features of any such system: $-$ It should be easy to add two vectors. $-$ It should be easy to see if two vectors are the same. $-$ It should be easy to see if two vectors are close. $-$ It should be easy to rotate a vector by an angle that is a symmetry of the grid. $-$ Every point in the plane should be near some vector. (The grid shouldn't have large empty regions.) Note that \"addition\" using continuous coordinates would most naturally be defined in terms of parallel transport, and it is neither commutative nor associative. On a grid, however, the issue of orientation needs to be addressed differently, since parallel transport along arbitrary grid vectors will introduce rotations that are not a symmetry of the grid, so to remain on the grid, addition will need to be defined using something other than parallel transport. Since hyperbolic grids have an exponential number of points (as a function of distance from the origin), our symbolic coordinates will need to have a length proportional to the length of the vector. Don Hatch has a web page which gives some . (\"Easy\" means an efficient algorithm that is doable by hand, like how the algorithms for addition and subtraction using the standard digit-sequence representation of integers can be used for the Euclidean square grid. Using hyperbolic functions of real numbers, always keeping track of enough digits to identify the nearest grid point, does not count as easy!) Addendum: Many readers seem to be disturbed by a little voice saying \"But vectors don't make sense in the hyperbolic plane!\": What that voice is really saying is that the hyperbolic plane doesn't give you all the nice properties you are used to in Euclidean space or in vector spaces. So if you define vectors as objects having specific properties you are used to (such as having a direction that is unaffected by parallel transport), then that definition may not correspond to anything in the hyperbolic world. You could use the term isometry, but that is typically a fixed mapping from the space to itself, and in the hyperbolic plane the isometry corresponding to a vector would depend on the starting point. (However, isometries will be central to any solution, I assume.) And a geodesic is a fixed path within the space, no different from a hyperbolic line or segment. The paper offers one solution. offer another. I deliberately leave them undefined in this question, as I am looking for any workable system.",
"Why didn't mastery of the Elder Wand move on from Harry? There's a lot of emphasis on Harry becoming the master of the Elder Wand after he defeats Draco. But what constitutes a “defeat”? It seems that Harry wins a wrestling match with Draco, so now he’s the master of the Elder Wand. But lots of other stuff happens to Harry: Nagini almost kills him, and he escapes just in time, but his wand breaks. The Snatchers chase him through the forest. He and his friends practically surrender (and Hermione even tries to disguise Harry). Voldemort almost kills Harry in the Forbidden Forest (or actually does, depending on how you look at it). Why are none of these considered to be “defeats”?",
"Time-Stream Crossing and Forgetfulness In The Day of the Doctor, it's explained that the Doctor doesn't remember having interacted with himself, and if he interacts with a future version of himself, the younger version forgets. But in Time Crash, 10th solves the problem of the TARDISes occupying the same space because he remembers himself doing it from when he was 5th. If this is true, 5th wouldn't have wondered whether or not he was going to regenerate when he did. Does the TARDIS occupying the same space with itself re-instate those memories? Or is it just possible that I'm asking a ridiculous question that will never have an answer because Doctor Who. :D",
"what is a thyristor As part of my 2330 lv3 am required to know about thyristors. I just want to confirm my understanding is correct. A thyristor is basically similar to a transistor, only it stays switched on when it's trigged for as long as there isn't a break in the circuit it's switching. Am I correct?",
"Machine Learning - Where is the difference between one-class, binary-class and multinominal-class classification? Where is the difference between one-class, binary-class and multinominal-class classification? If I like to classify text in lets say four classes and also want the system to be able to tell me that none of these classes matches the unknown/untrained test-data. Couldn't I just use all the methods that I mentioned above to reach my goal? e.g. I could describe C1, C2, C3 and C4 as four different trainings-sets for binary-classification and use the trained models to label an unknow data-set ... Just by saying, Training-Set for C1 contains class 1 (all good samples for C1) and class 0 (mix of all C2, C3 and C4 as bad samples for C1). Is unlabeled-data C1 -> 1 or 0 Is unlabeled-data C2 -> 1 or 0 ... and so on ... For multinominal classification I could just define a training-set containing all good sample data for C1, C2, C3 and C4 in one training-set and then use the one resulting model for classification ... But where is the difference between this two methods? (except of that I have to use different algorithms) And how would I define a training-set for the described problem of categorizing data in those four classes using one-class classfication (is that even possible)? Excuse me if I'm completely wrong in my thinking. Would appreciate an answer that makes the methodology a little bit clearer to me =)"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Why does deflating baloon spurting through the air make circular motion?
|
Why does a balloon spiral in the air instead of moving in a straight line?
|
[
"Clarification for non-answers One of my flags for \"non-answer\" was declined and I was wondering if I misunderstood what \"non-answer\" means. I saw someone post an answer that was just a block of code, with nothing in it that was even the slightest related to the question, it was just a random block of code with no explanation. Should I have not used the \"not an answer\" tag even though the description explicitly says that it should be used when answers \"do not attempt to answer the question\"?",
"Evaluate the following limit of finite sum Evaluate the limit $$\\lim_{n\\to \\infty}\\frac{1}{n}\\sum_{k=0}^{[n/2]}\\cos \\left(\\frac{k\\pi}{n}\\right)$$ I tried through considering two cases : (i) When $n$ is even (ii) when $n$ is odd. When $n$ is even then the limiting value is $\\frac{1}{\\pi}$. But when $n$ is odd then ?? Case 1 : $n$ is even.. Then , take $n=2p$ where $p$ is positive integer. Then $$\\lim_{n\\to \\infty}\\frac{1}{n}\\sum_{k=0}^{[n/2]}\\cos \\left(\\frac{k\\pi}{n}\\right)$$ $$=\\lim_{p\\to \\infty}\\frac{1}{2p}\\sum_{k=0}^{p}\\cos\\left(\\frac{k\\pi}{2p}\\right)$$ $$=\\frac{1}{2}\\int_0^1\\cos(\\pi x/2)\\,dx$$ $$=\\frac{1}{\\pi}.$$ Case 2 : When $n$ is odd. Take, $n=2p+1$ , where $p$ is a positive integer. Then , $$\\lim_{n\\to \\infty}\\frac{1}{n}\\sum_{k=0}^{[n/2]}\\cos \\left(\\frac{k\\pi}{n}\\right)$$ $$=\\lim_{p\\to \\infty}\\frac{1}{2p+1}\\sum_{k=0}^p\\cos\\left(\\frac{k\\pi}{2p+1}\\right)$$ From here how I proceed ?",
"tabular input by columns (i.e. transpose a table) I would like to be able to transpose a tabular(x) table like in the following example. It is not necessary to be completely automated, but I don't want to change the data order, which is a painful and stupid. By \"not completely automated\" I mean that e.g. the headers can be done seperately etc. Let's see the MWE: \\documentclass{article} \\usepackage{booktabs} \\def\\Midrule{\\midrule[\\heavyrulewidth]} \\begin{document} \\centering \\begin{tabular}{*6c}\\toprule \\bfseries Name & Alice & Bob & Chuck & Dave & Eve\\\\\\Midrule \\bfseries Sex & Female & Male & Male & Male & Female\\\\\\midrule \\bfseries Age & 18 & 19 & 20 & 21 & 22\\\\\\bottomrule \\end{tabular} \\bigskip Which I want to look like \\bigskip \\begin{tabular}{*3c}\\toprule \\bfseries Name & \\bfseries Sex & \\bfseries Age\\\\\\Midrule Alice & Female & 18\\\\\\midrule Bob & Male & 19\\\\\\midrule Chuck & Male & 20\\\\\\midrule Dave & Male & 21\\\\\\midrule Eve & Female & 22\\\\\\bottomrule \\end{tabular} \\end{document} Note: I know that , but I would like to get it without expl3 (mostly because people would might use my code quite often have an old LaTeX installed and I cannot be convincing them to change this).",
"Here are some examples. \"Until the Son of God appear\" What I was taught: Subjunctive of indefinite future. \"It is required that the applicant be 18 years old and possess a valid driver's license.\" What I was taught: mandative subjunctive. \"Where be ye going,\" said the false knight on the road?\" What I was taught: subjunctive of direct discourse. \"If I were you, which we both are thankful I am not, I wouldn't do that. What I was taught: The subjunctive mood is used for supposition contrary to fact. \"I dreamed I were a fireman in my Maidenform bra.\" What I was taught: The subjunctive mood can be used with words like dream. \"God bless you.\" I don't remember, so obviously I wasn't taught. I can live with Pluto's not being a planet, but I must say it's irksome to find that so much of what I was told about English turns out to be nonsense.",
"In the biblatex doc, it says ( Version 1.7, p.11): thesis A thesis written for an educational institution to satisfy the requirements for a degree. Use the type field to specify the type of thesis. Required fields: author, title, type, institution, year/date Optional fields: subtitle, titleaddon, language, note, location, month, isbn, chapter, pages, pagetotal, addendum, pubstate, doi, eprint, eprintclass, eprinttype, url, urldate I would like to know if there is any \"canonical\" way to add the name of the supervisor(s) in a field of the .bib file (no .bbl manipulation please, I want my bibliography to be usable \"as it\" in several documents). The expect result could be something like : Meand Myself. “A brilliant result, explained”. PhD thesis**, under the joint supervision of Pr. Toto and Pr. Tata**. Université Paris 24, Nov. 2013. The \"under the (joint) supervision\" could be a string that would be declined in four ways: under the supervision of under the joint supervision of and the abridged forms"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
QGIS Processing Toolbox disappeared Suddenly the button for opening the toolbox is gone. I have searched really long already. Do you have any idea how to get it back?
|
Missing processing menu in QGIS? I'm sure there is a really simple explanation to this but haven't found any pointers on this forum or elsewhere. I seem to have lost the 'processing' menu from QGIS and can't figure out how/why!? Any ideas what I might have done to make this happen? I'm running QGIS 2.8 built against GDAL 1.10 on Ubuntu 14.04.
|
[
"Why use a certain measure of forecast error (e.g. MAD) as opposed to another (e.g. MSE)? MAD = Mean Absolute Deviation MSE = Mean Squared Error I've seen suggestions from various places that MSE is used despite some undesirable qualities (e.g. , which states on p8 \"It is commonly believed that MAD is a better criterion than MSE. However, mathematically MSE is more convenient than MAD.\") Is there more to it than that? Is there a paper that thoroughly analyzes the situations in which various methods of measuring forecast error are more/less appropriate? My google searches haven't revealed anything. A similar question to this was asked at , and the user was asked to post on stats.stackexchange.com, but I don't think they ever did.",
"How does the drift velocity of electrons in a conductor depend on the temperature? How does the drift velocity of electrons in a conductor depend on the temperature? I have two contradicting views for this. First, we can say that increasing the temperature of the conductor will increase the kinetic energy of the electrons. Hence, their drift velocity should increase with increase in temperature. Or, from the relation $v_d = \\frac{eE}{m}T$ ($T$ is the relaxation time) we can say that the drift velocity is directly proportional to the relaxation time. Increasing the temperature will obviously decrease the relaxation time - as collisions will become more frequent - and thus decrease the drift velocity. Hence, an increase in the temperature will cause a decrease in the drift velocity. So which view is correct?",
"Salesforce Account as Entry source in Journey Builder Does NOT work",
"What is a good package for displaying algorithms? I found this page with some examples: I'm wondering which one to use. Any suggestions? I'm using other packages too so whichever is less likely to interfere with them is better for me.",
"Let $V$ be spherically symmetric and $W$ i.i.d. Gaussian. Then $E[V|V+W=t]=g(\\|t\\|)$ A random vector $V \\in \\mathbb{R}^n$ is said to be spherically symmetric. If for every orthogonal matrix $A$ the distribution of $AV$ is the same as the distribution of $V$. My question: Let $W$ be i.i.d. zero mean Gaussian random variable. Can we show that for a spherically symmetric $V$ the conditional expectation \\begin{align} E[V|V+W=t]= g(\\|t\\|). \\end{align} That is the conditional expectation is only a function of the magnitude. My attempt: \\begin{align} E[V|V+W=t]= \\int V \\frac{f_W(t-v)}{f_{V+W}(t)} dP_V(v)= \\frac{\\int v f_W(t-v) dP_V(v)}{f_{V+W}(t)}= \\frac{E[ V f_W(t-V) ]}{f_{V+W}(t)} \\end{align} Therefore, we can show that the two functions in the above ratio only depend on $\\|t\\|$. Observe that we can write $t= \\|t\\| u_t$ where $u_t$ is a unit vector. Then, for any orthogonal matrix $A$ \\begin{align} f_{V+W}(t)=f_{V+W}(\\|t\\|, u_t)&= \\frac{1}{(2\\pi)^{n/2}} E[ e^{-\\frac{\\|t-V \\|^2}{2}} ]\\\\ &= \\frac{1}{(2\\pi)^{n/2}} E[ e^{-\\frac{\\|t-AV \\|^2}{2}} ]\\\\ &= \\frac{1}{(2\\pi)^{n/2}} E[ e^{-\\frac{\\|tA^{-1}-V \\|^2}{2}} ]\\\\ &= \\frac{1}{(2\\pi)^{n/2}} E[ e^{-\\frac{\\|t A^T-V \\|^2}{2}} ]\\\\ &= f_{V+W}(tA^T)\\\\ &= f_{V+W}(\\|t\\|, u_t A^T) \\end{align} Since, $A$ was arbitrary we have that $f_{V+W}(t)=h(\\|t\\|)$(i.e., only depends on the magnitute). Now I am not sure how to show that $E[ V f_W(t-V) ]$ only depends on $\\|t\\|$?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Sequence and derivative Let $f: I \rightarrow R$ differentiable and $a \in I$ such that's : $$ \forall (x_n),(y_n) \in I, x_n \neq y_n, x_n \rightarrow a, y_n \rightarrow a \rightarrow lim_{n\to \infty} \dfrac{f(y_n)-f(x_n)}{y_n-x_n} = f'(a) $$ Prove that $f'$ is continuous. I have taken $z_n \rightarrow a$ but I cant prove that $f '(z_n)$ converges for $f' (a)$. Thanks for read, exists another post but the solution I do not understand
|
proof that $f'$ is continuous at $a$ Let $f:I \rightarrow \mathbb{R}$ derivable in set I. if $\lim x_n = \lim y_n =a \in I$ with $x_n \neq y_n$ and $\lim \frac{f(y_n)-f(x_n)}{y_n - x_n} = f'(a)$ proof that $f'$ is continuous at $a$ my attempt $x_n \neq y_n$ so by MVT $\exists z_n \in I$ like $x_n \geq z_n \geq y_n$ with $\frac{f(y_n)-f(x_n)}{y_n - x_n}=f'(z_n)$ for each $x_n$ and $y_n$ then $f'(a) = \lim\frac{f(y_n)-f(x_n)}{y_n - x_n}= \lim f'(z_n)$ Using $\lim x_n = \lim y_n = a$ and $x_n \geq z_n \geq y_n \Rightarrow z_n \rightarrow a$ if $ \lim_{x\rightarrow a} f'(x) \neq f'(a)$ then $\exists \epsilon > 0$ such $\forall n\in \mathbb{N}$, $z_n \in [x_n,y_n]$ $0 < |z_n - a| < \frac{1}{n}$ and $|f'(z_n) - f'(a)| \geq \epsilon$. So $z_n \rightarrow a$ but will do not have $\lim f'(z_n) = f'(a)$ so $\lim f'(z_n) = f'(a) = \lim_{x\rightarrow a} f'(x)$ when $z_n \rightarrow a$ and thats implies $f'$ continuous at $a$ my question is, that's correct ? if not, can you help me? thanks
|
[
"\"Communicate over\" vs. \"communicate through\" Also schemas can communicate over database links to schemas in other remote databases. Could one replace the preposition over with through? Will it change the meaning, and if so, when should we use over instead of through?",
"Why do physicists think that the electron is an elementary particle?",
"Is there a dollar amount that, when adding Massachusetts Sales Tax, precisely equals $200?",
"Indefinite article in title of thesis",
"Object Positions Reset On Blender Load"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
How to switch from Linux Ubuntu to windows 8.1
|
How to remove Ubuntu and put Windows back on?
|
[
"How to check file types of uploaded files in PHP? On the PHP website, the only real checking they suggest is using is_uploaded_file() or move_uploaded_file(), . Of course you usually don't want user's uploading any type of file, for a variety of reasons. Because of this, I have often used some \"strict\" mime type checking. Of course this is very flawed because often mime types are wrong and users can't upload their file. It is also very easy to fake and/or change. And along with all of that, each browser and OS deals with them differently. Another method is to check the extension, which of course is even easier to change than mime type. If you only want images, using something like getimagesize() will work. What about other types of files? PDFs, Word documents or Excel files? Or even text only files? Edit: If you don't have or and system(\"file -bi $uploadedfile\") gives you the wrong file type, what other options are there?",
"How to resolve a Java Rounding Double issue Seems like the subtraction is triggering some kind of issue and the resulting value is wrong. double tempCommission = targetPremium.doubleValue()*rate.doubleValue()/100d; 78.75 = 787.5 * 10.0/100d double netToCompany = targetPremium.doubleValue() - tempCommission; 708.75 = 787.5 - 78.75 double dCommission = request.getPremium().doubleValue() - netToCompany; 877.8499999999999 = 1586.6 - 708.75 The resulting expected value would be 877.85. What should be done to ensure the correct calculation?",
"Indecomposable limit ordinals A limit ordinal $\\gamma>0$ is said to be indecomposable iff $\\nexists\\alpha,\\beta<\\gamma$ such that $\\alpha+\\beta=\\gamma$. In view of this definition, I’m trying to prove the equivalence of the following statements for limit ordinals $\\gamma$: (1) $\\gamma$ is indecomposable. (2) $\\alpha+\\gamma=\\gamma$ $\\forall\\alpha<\\gamma$. (3) $\\gamma=\\omega^\\alpha$ for some $\\alpha\\in\\mathrm{ON}$. I’ve been able to get $(1)\\implies(2)$ and $(3)\\implies(1)$, but I have nothing more than scratch work for $(2)\\implies(3)$. Any suggestions would be appreciated.",
"I know and I have proved more than once that the set of irrational numbers ($\\mathbb{I}$) is uncountable, but now I'm given to solve this problem: Show that $|\\mathbb{I}|=|\\mathbb{R}|$, How can I do that? Do I need to assume the Continuum Hypothesis in order to that statement to be true? Thanks",
"How can I unlock my phone? I locked it using Android Device Manager, but it claims I entered a wrong password I have an Samsung Galaxy S3 Neo. Bus 002 Device 042: ID 04e8:6860 Samsung Electronics Co., Ltd GT-I9100 Phone [Galaxy S II], GT-I9300 Phone [Galaxy S III], GT-P7500 [Galaxy Tab 10.1] The keyboard & language setting is português. I today installed Android Device Manager and to test it's functionality I locked the phone with the password: \"abcd\" (4 letters were required). After entering the password and confirming with the \"OK\" button of my keyboard, the phone showed me that the password is wrong. \"Senha incorreta\". I reset the password after some tries to \"123456\" and the phone reloaded the lock screen. Again the password showed up to be wrong. I also tried the alphabetic password: \"abcdefg\" - same error. I changed the language of my Google account from German to Portuguese and reset the password to \"123456\" again and I tried to really reboot my phone and unlock the SIM card again. But anyways I can not get through my lock of the Android Device Manager. I tried to enter the password 35 times wrong with hope to get a chance to authenticate with my Google Account login. I also tried to connect the phone with adb but it does not show up in this state with: adb devices So what can I do to get access to my phone again?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Vbox mouse cursor disappear only in text editor of a guest OS The problem is following: Suddenly the edit text mouse cursor disappear in guest OS text editors and text fields. Instead of Text Select cursor only few pixels are visible. Issue related to windows guests (I had this on Win7-64 and Win2016-64) and windows host (win10-64). Update of vbox, guest additions, extension packs - did not help. Any ideas how to fix? Vbox version so far: 5.2.20 r125813 (Qt5.6.2) GA and EP enabled.
|
Mouse disappear in VirtualBox I am using latest version of VirtualBox (VirtualBox 4.3.6 for Windows hosts) and after installing any OS and clicking inside of it mouse disappear. It is not visible until I press right CRTL. Anyone know what can cause this problem. I have also installed extension pack.
|
[
"Propose a privilege to sit in the 500 reputation mark As , the retag privilege serves a lot more confusion and a lot less of its benefit due to the suggested edit system. It must be done away with. It will be done away with. ♪ In light of this decided course of action, we're going to need a new snack for the road between \"Create Tags\" at 300 reputation and \"Established User\" at 1000 reputation. We'd like your help in thinking about some ideas on what would be a nice privilege to sit at this level. Since we're... a bit dry on our end. The primary guideline in deciding what kind of privilege to put here is acknowledging its position in the overall hierarchy of privileges. 500 reputation is an early-intermediate user, one who has started to really get the hang of the site and its function. It can be something that provides convenience in how they currently can act on the site, or it could be some new functionality that fits as an early ability (especially considering there's no new abilities until 2000 reputation's \"Edit Everywhat\" ability). I look forward to hearing what creative ideas y'all can provide.",
"Filter users by country This was talked about a few podcasts ago. And they referenced some other site that does this. Currently location is a string but adding a country dropdown (and for the usa a state drop down) could be a great addition to the site. Then allow for user filtering by country / state.",
"Alright, I think we all agree that what happens with the following code is undefined, depending on what is passed, void deleteForMe(int* pointer) { delete[] pointer; } The pointer could be all sorts of different things, and so performing an unconditional delete[] on it is undefined. However, let's assume that we are indeed passing an array pointer, int main() { int* arr = new int[5]; deleteForMe(arr); return 0; } My question is, in this case where the pointer is an array, who is it that knows this? I mean, from the language/compiler's point of view, it has no idea whether or not arr is an array pointer versus a pointer to a single int. Heck, it doesn't even know whether arr was dynamically created. Yet, if I do the following instead, int main() { int* num = new int(1); deleteForMe(num); return 0; } The OS is smart enough to only delete one int and not go on some type of 'killing spree' by deleting the rest of the memory beyond that point (contrast that with strlen and a non-\\0-terminated string -- it will keep going until it hits 0). So whose job is it to remember these things? Does the OS keep some type of record in the background? (I mean, I realise that I started this post by saying that what happens is undefined, but the fact is, the 'killing spree' scenario doesn't happen, so therefore in the practical world someone is remembering.)",
"Windows 10 - disable reopening programs after restart/startup Occasionally, a forced restart is happening on my Windows 10 computer. When the OS is restarted every program that I've had prior to the restart is reopened at startup. The programs are reopened like I would just double-click them. I usually hold 5-6 windows of Visual Studio and few more programs all together. When the above happens, I have to wait several minutes until I can start working, as everything takes ages to load. Is there a setting to disable these programs from automatically opening at startup?",
"This question led to a new package: I'm giving my students an old exam and barely remembered to change the date at the top. A colleague and I joked about how long we could reuse the same exam, and it made me wonder if I could use LaTeX to create an exam that looked like it was written in 1963 on a typewriter. Here's what I'd like to see: Typewriter font even in math mode. (Several ways to accomplish this; is there a \"best\" way?) Slight inconsistencies in the printing of each letter. I attempt this below adapting code taken from . Each word has a random vertical shift, though I'd like to see it reduced to each letter having its own vertical shift. Other typewriter-like irregularities would be great. It would be great if math-mode delimeters \\left(, \\right}, etc., can be created in a piece-meal fashion as they did in days of old. Fraction bars, tops of square-root symbols -- any horizontal line, really -- is made up of a series of en-dashes that don't quite match up. Here is what I've come up with so far: \\documentclass[10pt]{article}% This is a document class providing more font size options \\usepackage{graphicx} \\usepackage{ifthen} \\usepackage[textwidth=7.5in,textheight=9.5in]{geometry} \\pagestyle{empty} % thanks to Bruno Le Floch: https://tex.stackexchange.com/q/9331/4012 % and in his comments to https://tex.stackexchange.com/a/29458/4012 \\usepackage[first=-1,last=1]{lcg}% you can play around with these values \\makeatletter \\newcommand{\\globalrand}{\\rand\\global\\cr@nd\\cr@nd} \\makeatother \\newcommand{\\randomvshift}[1]{\\globalrand\\raisebox{\\value{rand}pt}{#1}} %%% thanks to Martin Scharrer: https://tex.stackexchange.com/q/11598/4012 \\makeatletter \\def\\typewriter#1{% \\@typewriter#1 \\@empty } \\def\\@typewriter#1 #2{% \\randomvshift{#1}\\space \\ifx #2\\@empty\\else \\expandafter\\@typewriter \\fi #2% } \\makeatother \\begin{document}\\tt \\typewriter{Math 101 Fall 1963} \\begin{enumerate} \\item \\typewriter{$\\frac{\\texttt{d}}{\\texttt{dx}}\\texttt{(x)}^2$} \\item \\typewriter{State the Fundamental Theorem of Calculus.} \\end{enumerate} \\end{document}"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
Double Column Validation in Excel I have a data table like this in excel: ColA ColB A 1 A 2 B 2 B 3 C 4 In a different sheet, I am trying to create two column for which the values will be drop down, using the validation. For each row of this sheet, the first column will need to be the unique values from ColA, i.e. {A, B, C}, and depending on what was selected there, I want the second column to be presented only with the acceptable choices, i.e. if A is selected, the drop down would show {1, 2}, if B is selected, the drop down would show {2, 3}, ... Any ideas? I feel I need a function in the validation selection that would return a subset of a list based on a selection criteria, like a SELECTIF ... All the functions I find are aggregate functions that have a nice if version (e.g. COUNTIF, ...) I prefer to do this without VBA. Thanks
|
Lookup list dependant on the contents of another cell hope someone can help to crack this one? I've got a table on my data entry tab (sheet 1) where each row includes two data validation drop down lists (source is on sheet2). I want the options in the second drop down list (k13) to be dependant on what is selected in the first drop down list (g13)... ie. if you select 'Diary' in the first drop down box then the second drop down only has 'Cheese', 'Milk' and 'Yogurt' - likewise, if you select 'Fruit' in the first box - I want the only options to be available specific to that categories column in the lookup table on sheet 2 (which are 'apple', 'pear' and 'banana' in this case)? Please help - i think this is a vlookup indirect formula??
|
[
"$n,a,b \\mathbb \\in \\mathbb Z^+$ , such that $n\\mid a^n-b^n$ ; to show $n\\mid \\frac {a^n-b^n}{a-b}$",
"Does it feel lately like all questions have already been asked and answered and there is nothing more to do? I think everybody with a history of participation can't help but notice the explosive growth of repeated duplicate questions. The work of looking for duplicates and then closing questions has overtaken the work of actually answering questions. It's become virtually impossible to ask something which hasn't been yet asked. Lately I feel boredom each time I see a new question and start answering it only to realize after the first written sentence that I have answered similar questions five times over or seen them answered some ten times or more. I know where it's going to be going and what answers with what votes it is going to receive before any answer is even written. It's obviously not the administration's fault, it is simply so. The questions is, what to do about it? Engaging more moderators to close and close duplicates won't work because it's already starting to repel users who get mad at their questions closed and become afraid of asking more or perhaps just go away. The original idea of Jeff stated the the site is for questions that can be answered. Meaning no open-ended discussions. When I first read this I had a casual thought - well, and what's gonna happen when they all are asked and answered? Will it become a museum, a monument of wisdom and knowledge or what? I'm not sure what to do about it. Perhaps deprecation/versioning of older questions so that their new versions can sparkle the tiresome evening... POSTSCRIPTUM. I recall Star Trek Voyager episode when another Q asked Captain Janeway for asylum. He was tired of immortality and wanted to die. They opened a hearing and went on to visit the continuum to evaluate the living conditions there which caused the suffering and the wish to escape it in death. A lifeless picture presented itself to the visitors... a house lone in an open space, two people going about their business, nobody talking. When asked why they were silent, the following was said. It's been so long, all has already been said, all stories told, all jokes are made... there is nothing left to do... Are we there as well? UPDATE: Just saw this answer in another question: Also, some of the core questions got asked early on in the life of the site. Great questions still come around from time to time, but many have already been asked. Doesn't that confirm my point?",
"Is there a difference between Cursor.Current and this.Cursor (where this is a WinForm) in .Net? I've always used this.Cursor and have had very good luck with it but I've recently started using CodeRush and just embedded some code in a \"Wait Cursor\" block and CodeRush used the Cursor.Current property. I've seen on the Internet and at work where other programmers have had some problems with the Cursor.Current property. It just got me to wondering if there is a difference in the two. Thanks in advance. I did a little test. I have two winforms. I click a button on form1, set the Cursor.Current property to Cursors.WaitCursor and then show form2. The cursor doesn't change on either form. It remains Cursors.Default (pointer) cursor. If I set this.Cursor to Cursors.WaitCursor in the button click event on form1 and show form2, the wait cursor only shows on form1 and the default cursor is on form2 which is expected. So, I still don't know what Cursor.Current does.",
"Why can't I do foreach (var Item in DataTable.Rows)?",
"Choice function for collection of arbitrary finite sets. AC required?"
] |
medi_sts_stackexchange_dupe
| 21medi_sts_stackexchange_dupe
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4