body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
Consider these two example sentences: I don't think Kelly will pass the exam. and Kelly will not pass the exam. Is it absolutely the same meaning or not if someone says these phrases? | An ELL post () says I don't think I understand what kind of buttonholes they're talking about. I found "I don't understand" is commonly used to express the unawareness of something. So, what is the difference between "I don't think I understand" and "I don't understand"? Is the latter more formal than the former, therefor no published book uses the former? Could someone please give a hint? Thanks in advance. On Google, "I'm not sure I understand" got 17,300,000 hits, "I don't think I understand" got 48,500,000 hits, "I don't understand" got 162,000,000 hits. |
I am looking for libraries which can read RSS / ATOM feeds in my J2EE application (based on JBoss Seam). Is the only application there for reading feeds? I am assuming the Seam RSS is only for generating RSS feeds and not for reading feeds. | I'm using Java, and need to generate a simple, standards-compliant RSS feed. How can I go about this? |
I'm part of a small study group at work that's trying to get a better grasp on what makes JavaScript tick. In our recent discussions about objects, we've learned that an object's public methods are recreated each time an object is instantiated, while methods assigned to the object's prototype are only created once and inherited by all instances. From what I understand, both public methods and those assigned to the prototype are publicly accessible. The question I have, then, is why bother creating public methods at all if adding to the prototype is apparently more efficient? What benefit does the public method provide that the prototype doesn't? | What's the difference between var A = function () { this.x = function () { //do something }; }; and var A = function () { }; A.prototype.x = function () { //do something }; |
I have the following function in a class named cache_level which extends the linked list class.: @SuppressWarnings("unchecked") public boolean addObject(Object O) { System.out.println(O); if(O != null) { boolean x = getObject(O); int I = 21; if(x == true && size() == cacheSize) //if object is found and size of list is full { remove(O); addFirst(I); cacheHit++; //increment to show we found the object } else if(x == true && size() != cacheSize)//found but not full { addFirst(I); cacheHit++; } else if(x != true && size() == cacheSize) //item not found but list full { removeLast(); addFirst(I); } else //item not found and list not full { addFirst(I); } return x; } else { System.out.println("NULL OBJECT WAS FOUND"); return false; } } and I have a function in main which uses a scanner to read a text file.: File file = new File(filename); Scanner fileScan = new Scanner(file); String line = ""; String token = "&"; while ((fileScan.hasNextLine())) { line = fileScan.nextLine(); Scanner lineScan = new Scanner(line); //System.out.println(token); while (lineScan.hasNext()) { token = lineScan.next(); //System.out.println(token); List.cacheAdd(token); //goes to cache class and initiallizes //System.out.println(token); } lineScan.close(); } //System.out.println("CACHE WAS CREATED"); fileScan.close(); and for some reason that is giving me a NullPointerException and so far everyone I have talked to has no idea why that is happening. I have a class named Cache, which initializes cache_level. Reading the text file seems to be okay as I can print out the contents being stored into token but whenever I try to add it into the list, it gives me an error. | What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely? |
I have question about if I could call a constructor in another constructor in abstract class. For example, public abstract class Sth{ protected Sth(){} protected Sth(int number){} protected Sth(String word){ int number = 0; this(number); } It seems that Java does not allow me to do this. I wondered if there is any way we could let this happen? Thanks -----------------------------------------------Explanation---------------------------------------------------------------------- The goal I want to do is to call the second constructor specifically. I got error with must calling the first constructor in Java. So I wondered if we can just skip first constructor without remove any code here. Sorry for the confusion. | Is it possible to call a constructor from another (within the same class, not from a subclass)? If yes how? And what could be the best way to call another constructor (if there are several ways to do it)? |
If we start from $ m\ddot{x} = -\frac{dV}{dx} $ How could one derive/construct principle of least action? i.e. find out that this quantity $ S = \int_{t_0}^{t_1}dt\left(\frac{m\dot{x}^2}{2} - V(x) \right)$ needs to be minimized. Assuming it's true and then proving it is is very easy and it's written in every textbook but that's not what I'm asking for. I want to go in other direction, not assuming I know the answer. All I know are Newton's laws and that $ F = -dV/dx$. I thought of simply inverting the steps of derivation of Euler-Lagrange equation but they seem unintuitive and the reasoning behind them is unclear except that I know the answer in advance (which I want to assume that I don't). I guess this is inverse of optimization problem? Given a solution finding out what does it optimize? | Is there a proof from the first principle that for the Lagrangian $L$, $$L = T\text{(kinetic energy)} - V\text{(potential energy)}$$ in classical mechanics? Assume that Cartesian coordinates are used. Among the combinations, $L = T - nV$, only $n=1$ works. Is there a fundamental reason for it? On the other hand, the variational principle used in deriving the equations of motion, Euler-Lagrange equation, is general enough (can be used to to find the optimum of any parametrized integral) and does not specify the form of Lagrangian. I appreciate for anyone who gives the answer, and if possible, the primary source (who published the answer first in the literature). Notes added on Sept 22: - Both answers are correct as far as I can find. Both answerers were not sure about what I meant by the term I used: 'first principle'. I like to elaborate what I was thinking, not meant to be condescending or anything near to that. Please have a little understanding if the words I use are not well-thought of. - We do science by collecting facts, forming empirical laws, building a theory which generalizes the laws, then we go back to the lab and find if the generalization part can stand up to the verification. Newton's laws are close to the end of empirical laws, meaning that they are easily verified in the lab. These laws are not limited to gravity, but are used mostly under the condition of gravity. When we generalize and express them in Lagrangian or Hamiltonian, they can be used where Newton's laws cannot, for example, on electromagnetism, or any other forces unknown to us. Lagrangian or Hamiltonian and the derived equations of motion are generalizations and more on the theory side, relatively speaking; at least those are a little more theoretical than Newton's laws. We still go to lab to verify these generalizations, but it's somewhat harder to do so, like we have to use Large Hadron Collider. - But here is a new problem, as @Jerry Schirmer pointed out in his comment and I agreed. Lagrangian is great tool if we know its expression. If we don't, then we are at lost. Lagrangian is almost as useless as Newton's laws for a new mysterious force. It's almost as useless but not quite, because we can try and error. We have much better luck to try and error on Lagrangian than on equations of motion. - Oh, variational principle is a 'first principle' in my mind and is used to derive Euler-Lagrange equation. But variational principle does not give a clue about the explicit expression of Lagrangian. This is the point I'm driving at. This is why I'm looking for help, say, in Physics SE. If someone knew the reason why n=1 in L=T-nV, then we could use this reasoning to find out about a mysterious force. It looks like that someone is in the future. |
For those who don't believe it: Though it is good for me that now I don't have to fulfill my commitment, but I'd like to do it so can you bring it back? | What does it mean for a site to have fulfilled next to its name in the ? The reason I ask is that I moderate Genealogy & Family History and noticed that it is the only site of about a hundred which is "tagged" in that way. |
I found a way how to add a context menu, when I right click in a Windows explorer, to open command line in a current directory. It is sufficient to create two Windows registry entries: HKEY_CLASSES_ROOT\Directory\shell\CommandPrompt e.g. with value "Open CMD here..." and HKEY_CLASSES_ROOT\Directory\shell\CommandPrompt\command with value "cmd.exe /k cd /d %1" or simple creating a file cmd.reg and executing it: Windows Registry Editor Version 5.00 [HKEY_CLASSES_ROOT\Directory\shell\CommandPrompt] @="Open CMD here..." [HKEY_CLASSES_ROOT\Directory\shell\CommandPrompt\command] @="cmd.exe /k cd /d %1" But how can I achieve the same thing, which will force cmd.exe to "Run as Administrator"? | I don't want to install PowerToys, I'd rather a simpler solution for this specific problem. I've tried . I've tried , but I get the following error: Cannot import D:\Admin\Reg\Open command window here (Administrator)\Open command window here (Administrator).reg: The specified file is not a registry script. You can only import binary registry files from within the registry editor. Any suggestions? Edit: Forgot to mention: I've tried the import facility in regedit to no avail |
How can I remove comma from theese ingrediens and let them float left? I am using chosen for my taxonomyes | I style my taxonomy terms as boxes, so I don't need comma between them. Could somebody give me any advice? |
Lately I've come up with an interesting math problem to work at. I've been trying to find "factorial triples", or triples of numbers that satisfy $$A!B!=C!$$ with $A,B \ne 1$. By playing around, I've noticed that the relationship is satisfied for all $A$, $B$, and $C$ in the form $$A=K$$ $$B=K!-1$$ $$C=K!$$ And I've also proven the following, under the assumption that some $A,B$ exist satisfying the relationship with $C$: If $C-1$ is prime, then $C$ is a perfect factorial. If $C-k$ is prime, then some number in the form $$\frac{C!}{(C-n)!}, 1\le n\le k$$ is a perfect factorial. C is not prime. I have also conjectured (but I have not been able to prove) that $C$ cannot be a perfect power of a prime. This is my first question - can anyone give me a hint or two to start this proof? The thing that bothers me is the triple $$10!=7!6!$$ Because it does not satisfy the form that I had come up with. This one works because $$6!=8\cdot9\cdot10$$ and so I can conclude that if I can find other numbers of the form $$H!=J\cdot(J+1)\cdot...\cdot(J+K)$$ then another possible form is $$A=J-1$$ $$B=H$$ $$C=J+K$$ This is the second question. How can I find such $H,J,K$? The third and final question is this: how to I prove that all factorial triples are in this form, or, if that is false, how do I find the other forms? Thanks! | I was playing around with hypergeometric probabilities when I wound myself calculating the binomial coefficient $\binom{10}{3}$. I used the definition, and calculating in my head, I simplified to this expression before actually calculating anything $$ \frac {8\cdot9\cdot10}{2\cdot3} = 120 $$ And then it hit me that $8\cdot9\cdot10 = 6!$ and I started thinking about something I feel like calling generalized factorials, which is just the product of a number of successive naturals, like this $$ a!b = \prod_{n=b}^an = \frac{a!}{(b-1)!},\quad a, b \in \mathbb{Z}^+, \quad a\ge b $$ so that $a! = a!1$ (the notation was invented just now, and inspired by the $nCr$-notation for binomial coefficients). Now, apart from the trivial examples $(n!)!(n!) = n!$ and $a!1 = a!2 = a!$, when is the generalized factorial a factorial number? When is it the product of two (non-trivial) factorial numbers? As seen above, $10!8$ is both. |
I think it would be useful/convenient if the current directory determined one's shell environment. This would mean that the command cd /my/projects/foo ..., for example, would not only set the current working directory (and update $PWD, $OLDPWD, $dirstack, etc.), but would also adjust a host of other environment elements (shell options, variables, functions, aliases, etc.) in a manner appropriate to the contents of the new PWD. At first blush this seems like a relatively simple thing to implement, especially with zsh, since it already supports a chpwd hook, and the $chpwd_functions array. But, as they say, the devil is in the details1. Therefore, before plunging into rolling my own, I thought I'd ask: is anyone aware of a mature implementation of this idea? Alternatively, besides chpwd et al., does zsh provide other tools that would be helpful towards implementing such a thing? In particular, does it provide any support for encapsulating/saving/restoring environments? (I'm thinking of something in the vein of R's environment objects, but encompassing not only variables, but also, e.g., aliases, options, etc.) FWIW, I am aware of Python's virtualenv, which shares some features with the idea described in this post, but of course, this is limited to Python-related settings, however. Furthermore, it creates a new "state variable", if you will, the "current virtual environment", orthogonal (rather subsumed under) the "current working directory" state variable. 1 Once one looks into the matter more carefully one quickly meets some non-trivial questions. For example: if cd'ing to /my/projects/foo activates a custom environment, what exactly happens after cd /my/projects/foo/modules/bar? Can we have nested custom environments, demarcated by the filesystem's tree structure? What about symlinks? E.g., what if /my/projects/foo/modules/bar is actually a symlink to /my/shared/modules/bar? Or, if I execute /my/projects/foo/some_program while $PWD is /tmp, say, what should be the environment of the resulting process? Etc., etc., etc. I don't find these questions necessarily intractable, but I do find them at least not-totally-trivial. | I have been working on several projects, and they require different environment variables (e.g., PATH for different versions of clang executables, PYTHONPATH for several external modules). Whenever I work on one project, I have to modify these environment variables myself (e.g., change .zshrc/.bashrc and source it); and I sometimes forget and make mistakes. Is there a way/project that helps do this automatically, similar to what does in Python? |
I received this message form the editor "Thanks for note. We have tried 11 potential reviewers to date and have one review at hand and another that is promised. We will be in touch once the second review is acquired". What this meant? May be he rejected the submission if can't find the second reviewer | I submitted to a journal a couple of months ago. The editorial flow is somehow quick and very transparent. I receive notifications for all events happening to the manuscript. Unfortunately, the managing editor contacted me three weeks ago. They informed me that the assigned editor could not commit to the job and left. Another editor was immediately assigned. However, I was contacted today by the new assigned editor. I was informed that all the contacted reviewers so far either refused to review the manuscript or did not respond to the invitation. They are now looking for other reviewers. Despite the bad luck surrounding the manuscript, all of this happened in a reasonable time and I am satisfied with how quickly they react. Nevertheless, these events made me reflect. Even if an editorial board possesses a fair network of reviewers, there is still a little risk that all the contacted reviewers either refuse or do not reply. What happens if no reviewers could be found for a submitted manuscript? Is the journal going to reject the manuscript because of a lack of reviewers? |
I'm currently creating a small device to operate on a CR2032 battery when it is disconnected and a USB power when it is connected. I want the device to be powered by USB when it is connected, without any interruption in the power feed. So my question is: how to switch from battery to USB one the device is connected? I thought to connect two diodes and a PNP transistor to turn the power based on the battery as soon as the USB is connected. But I wonder if this circuit consume many current when the USB is disconnected (consumption must be very low)? The circuit : If you have any solution which will consume less current please tell it to me ! | Following an earlier question , I would love to implement the as suggested by Russell McMahon. That way I could switch between 4AA batteries (1.2V*4 or 1.5V*4) and USB power. The battery voltage would nicely be regulated to 5V too. And the idea was to use the shutdown pin of the chip IF USB power is detected. The device also has to work when no batteries are present. I am not too experienced with this, but I thought to connect the 5V from the USB to the SHUTDOWN pin from the LDO chip. Pitywise, the pin function is inverted, if SHUTDOWN is low, Vout from the LDO chip is low. I am now considering using an XOR gate to make the thing work: – Schematic created using I would love to limit the amount of components, but the number of diodes is already high, and the whole thing feels a bit crafted My questions: Is there a better suitable chip (with an inverted shutdown pin) is there a better circuit (without voltage drop) to get this (I would prefer to get rid of D1, but then, the XOR has no desired operation) |
Which site can I go to for asking a suggestion about making an app or web application? Of course, not Stack Overflow, because I already asked there and I knew it was not the right place. | Is there a specific area for new users that are new to coding where they can go and ask questions without being blocked for asking a question they may not have the answer to or isn't sure how to correctly ask a question. I know that there is a section for FAQ to try to explain how to ask a good question but for people who are learning and want to get the opinions of experienced coders, it can be hard to come here and ask a question. So again, is there a community that is open to helping new coders that may not always know how to ask the question they are trying to get an answer to? |
If a cleric falls out of line from their Deity s/he becomes a ex-cleric and loses s/he powers but if said character started worshipping a Deity that is in their new allingment would s/he have to start over with a level one cleric or would s/he regain their powers. I ask because my caimpaign may require me to do what may be wrong in order to do what's right if that makes sense, I would end up doing evil to do good in the end, This is in 3.5 btw | There are rules for a Cleric who loses faith, and how to regain his standing through atonement. But what if he abandons one faith entirely for another? Presumably his new god/faith should be picking up where the other leaves off, so spells aren’t interrupted, and further he probably should be changing his Domains to ones used by his new faith, but does any official book actually describe this process? Does his new faith require atonement for his prior faith in another religion? Is there some kind of interruption time period, where he doesn’t get spells? Is the actual process of substituting Domains explained? Because the lack of rules that I’m looking at almost seems to imply that a Cleric cannot change faiths. I’m really looking for book citations here, because this is specifically for the sake of determining what the rules currently are to better judge how changes might affect them. I have plenty of my own ideas about how this sort of thing should be handled, most of which rely on eliminating as much of alignment’s mechanical impact as possible, but that’s not really relevant here. If your answer is that there are no such rules, I’d like an idea of how certain you are of this. For example, I could not find any such rules in Player’s Handbook or Complete Divine, the first two places I looked. Knowing where the rules aren’t is useful. |
I've noticed the following things while studying calculus, and would like experts to tell me if my conclusions are right. My Observations If I represent the area of a circle by $A$ and its perimeter by $C$, I can write $$C=\frac{dA}{dr}$$ Similarly, for a sphere, if I represent volume by $V$ and surface area by $S$, I can write $$S=\frac{dV}{dr}$$ I tried doing the same for other 2D and 3D figures, and saw that it worked only in case of the circle and the sphere. My questions My questions are: Why does this happen only in the case of the circle and the sphere? Can't I express the surface area of a solid in terms of its volume and the perimeter of a closed figure in terms of its area using calculus? Why or why not? I remember reading something of that kind in Jenny Olive's book "Mathematics: A Self-study Guide" | When differentiated with respect to $r$, the derivative of $\pi r^2$ is $2 \pi r$, which is the circumference of a circle. Similarly, when the formula for a sphere's volume $\frac{4}{3} \pi r^3$ is differentiated with respect to $r$, we get $4 \pi r^2$. Is this just a coincidence, or is there some deep explanation for why we should expect this? |
About an hour ago I posted under an unregistered account from my desktop. I then opened up the password email from my phone, logged in from that link, and was unable to access the question (didn't know that it would be using a cookie to keep track of everything). I panicked, figured merging with my main account could help, so I did so, and now I fear I'm forever cut off from properly editing/commenting on that question. It doesn't help that I only have 1 rep on that site. I tried following the advice in , but this only ended up in me logging into my main account (this one). What can I do to obtain ownership of this question? | I accidentally posted a question without being logged in. Is there a way to associate that question with my account? For more information, visit "" in the . a.k.a. How can you link a registered account to a cookie-based account? a.k.a. How do I merge an unregistered account with a registered account a.k.a. Merging users a.k.a. How do I associate anonymous questions I’ve asked with my registered account? a.k.a. Is there a way to claim an unregistered user? (in case anyone searches with those terms) |
I am trying to draw a filled triangle where one of the edges is curved. When I do the "obvious" thing, I find that the curved edge overshoots the vertices at either end. Here is a minimal working example. \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture} \coordinate [label=left:{$a$}] (a) at (5, -2); \coordinate [label=right:{$b$}] (b) at (9, -3); \coordinate [label=right:{$c$}] (c) at (9,0); \filldraw [line width=2pt, color=green!70!black, fill=green!15!white] (b) -- (a) to [out=20,in=250] (c) -- (b); \foreach \point in {a,b,c} \filldraw [color=green!70!black,fill=green!70!black] (\point) circle (1.5pt); \end{tikzpicture} \end{document} As you can see in the figure, the edge overshoots the vertices at (a) and (c). Thanks in advance! | While drawing a simple 3D (fake 3D in fact) cube, I realized that the corners end up with unwanted extensions of the line. I understand this is related to the width of the lines themselves, but how can I remove them? An alternative solution of drawing the desired figure is also welcomed. Example: \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture} \draw[draw=black,fill=gray!20] (0,0) --(4.8,0)-- (4.8,5)--(0, 5)--cycle; \draw[draw=black,fill=gray!20] (4.8,5) -- (4.9,4.8)--(4.9,-0.1)--(4.8,0)--cycle; \draw[draw=black,fill=gray!20] (0,0) -- (0.1,-0.1)--(4.9,-0.1)--(4.8,0)--cycle; \draw[dashed,draw=black] (4.8,5) -- (4.9,4.8)--(0.1,4.8)--(0.,5)--cycle; \draw[dashed,draw=black] (0.1,-0.1)--(0.1,4.8)--(0.,5)--(0,0)--cycle; \end{tikzpicture} \end{document} |
At the beginning of episode three we see a Padme who says she is pregnant but not showing, and at the end of the movie we see her delivering Luke and Leia. In other questions it is mentioned that the twins aren't premature, so is it ever explained what the actual timeline of events are in Revenge of the Sith? It feels like it goes one event after another with no breaks. | Inspired by this question: Currently, the only answer there addresses the fact that the "names you first know someone by are hard to shake". However, when thinking on this, I realized that another factor would be the amount of time during which Luke actually knew his mentor as Obi-Wan, in comparison to the length of their relationship beforehand. Luke came to know the true name of Obi-Wan Kenobi fairly early in Episode IV. At this time, he was about 19 years old and presumably had known (or known of) "Old Ben Kenobi" all his life. So, to get a rough comparison of this against how long he actually knew "Obi-Wan Kenobi", we just need to know how long (in in-universe time) Episode IV was. Starting from there, I'd like to expand the question to more generally encompass all six of the movies which are the primary canon of the Star Wars universe. So, over what duration (and, ideally, dates) did the events represented in each movie occur? |
If the public key $(e,n)$ and the private key $(d,n)$ are known, what is the easiest way to find the primes $p$ and $q$? When $n$ and $\phi(n)$ are given this is easy to solve. But I can't manage it given just $(e,d,n)$. Thanks for any help. | Given the RSA modulus $N$ the fastest method to factor it is of sub-exponent order. But, now if I know the private key $d$ of RSA, does that mean I can factor $N$ efficiently?. It intuitively seems true as I know the public/private key pair. Can someone help me to prove this? Please provide references so that I can read further into this subject. |
I have installed Ubuntu 16.04 in my whole laptop space. But right now , i have a requirement to install Windows in the same laptop. And since i am trying to install windows side by side with this Ubuntu version i tried to partition the hard drive space the current Ubuntu is installed in. However, i cannot partition the drive. So is there any way to do that? P.S. I already tried using g-parted and disk-utility but neither of them seems to work. | I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go for UEFI only! |
I am trying to match a string 'hello world' to a sentence. I think that means it searches the sentence for that string and returns a value that indicates a success. But when I try this code, all that prints out is 'None'. import re sentence = "why do we write hello world so often?" match1 = re.match('hello world', sentence) print match1 | What is the difference between the search() and match() functions in the ? I've read the (), but I never seem to remember it. I keep having to look it up and re-learn it. I'm hoping that someone will answer it clearly with examples so that (perhaps) it will stick in my head. Or at least I'll have a better place to return with my question and it will take less time to re-learn it. |
Maybe this is the sort of question I could find the answer myself if I just knew the right search terms. I've gotten a whole bunch of search results and quite a bit of sidetracks. In my handwritten notes, which are a little smudged and drawn from various books and journals, I have the definitions $$f(n) = \prod_{p \mid n} p$$ is the product of primes $p$ that divide $n$ and $$g(n) = \prod_{p \mid \mid n} p$$ is the product of primes $p$ that divide $n$ exactly I underlined "exactly." I think those are $f$ and $g$, or they could be Greek letters, I'm not sure. This is a bit of notation I thought I copied from a Fib. Quart. article by Jean Konincke, but when I got the librarian to fetch me the article, I saw that while it does mention divisibility, it doesn't seem to distinguish between "plain" divides and "exact" divides. Also, I had the wrong author's name, though the right title. Actually, I'm confused as to the meaning of those terms. Take $n = 28$. Wouldn't $f(n)$ be $14$ and $g(n)$ be $28$? But then what's the point of that? $f(n)$ is just the squarefree kernel of $n$, and $g(n)$ is just an identity function (presumably these are just applied to positive integers). I'm missing something here, I must have neglected to copy the important clarifying details. Help anyone? | I am currently reading the paper "PRIMES is in p" and have come across some notation that I don't quite understand in this following sentence Consider a prime $q$ that is a factor of $n$ and let $q^k || n$. Then... What does the notation $q^k || n$ mean here? The full paper can be found and the notation described above is used in the proof on page 2 |
Is the use of "not to mention getting a promotion" in the following sentence natual? If not, how to rewrite it? The main idea is: working hard is a must to have a job, getting a promotion needs to work even harder. It is a hard fact that only diligent employees who devote the majority of their time and energy on sharping professional skills can get themselves employed, not to mention getting a promotion | For brevity, I symbolise synonymity with ≈. So X ≈ Y means X and Y are synonyms. From : let alone ≈ not to mention From : let alone ≈ much less ≈ still less. Are these all synonyms? What are the similarities and differences between each? |
Google search has interesting mechanics once you enter a keyword it remembers the keyword. The question is how are you able remove the keyword which will appear after you start typing the first character? | Ok... so this is embarrassing. I typed in "boobs" on EncyclopediaDramatica's search because, well, it's a really funny page. But now I've got a problem... EVERY TIME I click a search field in Chrome now, it shows "boobs" as the first suggestion in the drop down! This is not really socially acceptable as this laptop goes with me everywhere and Chrome is my primary browser. Is there a way I can isolate and remove just that one entry? |
I saw this movie a while ago and I remember a lot of images of huge desert landscapes and a man/woman fighting over the control of a huge truck (or maybe they had a truck each and were fighting over something else, I can't remember straight). The truck was an armored vehicle roughly the size of a semi-truck without the trailer. The movie should have been relatively recent but seemed to be quite low-budget. I believe it should have been a post-apocalyptic movie but I can't really remember anything about the story, just those images. The footage of the movie had colour editing and it was saturated in tones of orange, it should be easy to identify by this colour treatment since it's something you don't see very often. | I am trying to identify a sci-fi movie from the 80's or 90's, with the following parameters: Setting: Scenes of a red desert planet Culture: Either people roam fairly solo and try to acquire resources to survive, or you live in a weird society where if a stranger is captured he needs to play in a game of fight to the death. Mobility: One foil character has a giant battle-bot-looking tank as his form of transportation through the desert. Protagonist has a car that has a plastic half bubble on top to look out from. Robot: The protagonist runs around in the beginning of the film with a female robot/android whose face is melted off after it has acid touch its face.(This scene happens next to the protagonist's rover) Love interest: Somehow protagonist comes across female protagonist in desert. She smells really bad and is hungry. They sleep outside, and he tells her to sleep away from him. He uses a thermal blanket(the first I ever saw in my life). She wakes up next to him, smelling horrible. He bathes her in some water hole they find(as if water were not scarce and they could just waste water.) Pupa monsters: Scene where they are in a building and they are trying to get out. They come across a room that is white, in which multiple giant, white, snot, pupa are hanging securely from the ceiling. Through curiosity, they disturb them, and now they have to get out of that room fast. Boss Antagonist: Pervert bionic man, that is actually attached to a giant robotic arm, as only form of movement. He is in black and has a pale bald head as his most human looking part. |
I was just wondering if you can have a swap partition that is too big. If yes, when is a swap partition too big? What are the downsides/ill-effects of having a swap partition that's too big (even if I have plenty of disk space)? If no, what are the benefits of having more than the recommended swap space? | I read many places that the rule of thumb for swap space is to double the amount of physical RAM. However, 32 GB does seem a LOT. Do I need that much? Do I need it at all with this high amount of physical RAM? |
The charge in electromagnetism seemingly plays the same role like mass in the Newtonian mechanics.But why we define the current unit (Ampere) in as the fundamental rather than charge unit? | I always thought of current as the time derivative of charge, $\frac{dq}{dt}$. However, I found out recently that it is the ampere that is the base unit and not the coulomb. Why is this? It seems to me that charge can exist without current, but current cannot exist without charge. So the logical choice for a base unit would be the coulomb. Right? |
Say $X_0, X_1$ and $X_2$ are independent Poisson random variables with means $\lambda_0, \lambda_1$ and $\lambda_2$, respectively. Define $Y_1 = X_0+X_1$ and $Y_2 = X_0 + X_2$. How would I find an expression for the joint probability of $Y_1$ and $Y_2$, that is, $P(Y_1=y_1, Y_2=y_2)$? Approaches I have attempted, unsuccessfully: 1) $P(Y_1=y_1, Y_2=y_2) = P(X_0+X_1=y_1)*P(X_0+X_2=y_2|X_0+X_1=y_1)$ but I am unable to solve the second probability. 2) Trying to set up a multivariate transformation with $Y_1 = X_0+X_1$ and $Y_2 = X_0 + X_2$, but I get stuck when trying to write $X_0, X_1$ and $X_2$ in terms of $Y_1$ and $Y_2$ to get the Jacobian. | I've recently encountered the bivariate Poisson distribution, but I'm a little confused as to how it can be derived. The distribution is given by: $P(X = x, Y = y) = e^{-(\theta_{1}+\theta_{2}+\theta_{0})} \displaystyle\frac{\theta_{1}^{x}}{x!}\frac{\theta_{2}^{y}}{y!} \sum_{i=0}^{min(x,y)}\binom{x}{i}\binom{y}{i}i!\left(\frac{\theta_{0}}{\theta_{1}\theta_{2}}\right)^{i}$ From what I can gather, the $\theta_{0}$ term is a measure of correlation between $X$ and $Y$; hence, when $X$ and $Y$ are independent, $\theta_{0} = 0$ and the distribution simply becomes the product of two univariate Poisson distributions. Bearing this in mind, my confusion is predicated on the summation term - I'm assuming this term explains the the correlation between $X$ and $Y$. It seems to me that the summand constitutes some sort of product of binomial cumulative distribution functions where the probability of "success" is given by $\left(\frac{\theta_{0}}{\theta_{1}\theta_{2}}\right)$ and the probability of "failure" is given by $i!^{\frac{1}{min(x,y)-i}}$, because $\left(i!^{\frac{1}{min(x,y)-i!}}\right)^{(min(x,y)-i)} = i!$, but I could be way off with this. Could somebody provide some assistance on how this distribution can be derived? Also, if it could be included in any answer how this model might be extended to a multivariate scenario (say three or more random variables), that would be great! (Finally, I have noted that there was a similar question posted before (), but the derivation wasn't actually explored.) |
I'm running multiple linear regression with 6 variables. For one of the variables D, the correlation coefficient between D and the response Y is - 0.34. But in the regression output, the coefficient for D is +8.9. What is the best way to interpret D's influence on Y? Is it safe to assume that there's some confounding going on so I can ignore the fact that the correlation coefficient is negative and thus say increasing D will result in increasing Y? | The coefficient of an explanatory variable in a multiple regression tells us the relationship of that explanatory variable with the dependent variable. All this, while 'controlling' for the other explanatory variables. How I have viewed it so far: While each coefficient is being calculated, the other variables are not taken into account, so I consider them to be ignored. So am I right when I think that the terms 'controlled' and 'ignored' can be used interchangeably? |
For example, which is correct: The robot can then compute it's coordinates. or The robot can then compute its coordinates. What's the rule here? It seems a little inconsistent. | I know that its is the possessive and it's is the contraction, and know when to use them. But why doesn't the possessive have an apostrophe? "The bear's eating a fish." [contraction] "The bear's coat is brown." [possessive] "It's eating a fish." [contraction] "Its coat is brown." [possessive] "One's eating a fish." [contraction] "One's coat is brown." [possessive] lists the etymology as "From + ", and says that this is actually the original form: Originally written it's, and still deliberately spelled thus by some writers until early 1800s. So what happened to the apostrophe? When did people stop using it, and why did they? It seems that it's as the possessive is more natural, as most people do this until they're taught that it is wrong (or even after). Update: Online Etymology Dictionary has been updated to include two potential explanations: The apostrophe came to be omitted, perhaps because it's already was established as a contraction of it is, or by general habit of omitting apostrophes in personal pronouns (hers, yours, theirs, etc.). Can anyone back up either of these arguments? The possessive one's still has the apostrophe, despite these. |
I am getting very strange compilation problems after using the \cal command in a very simple setup: \documentclass[12pt]{article} \usepackage{amsmath} \usepackage{amsfonts} \newcommand{\Pp}{\mathbb{P}} \newcommand{\Ee}{\mathbb{E}} \newcommand{\Prob}{\text{P}} \title{STAT 535 Homework 3} \author{Sheridan Grant} \date{\today} \begin{document} \maketitle \section{Theorem 2.2.8 and Proposition 2.2.9} Here is normal stuff: $n + b$ Now I'll try to do something with ``cal'': $\cal{R}_n$ What? $\cal{R}_n \sim \frac{n + b}{1}$ \end{document} The result (compiled with latexmk -pdf) is: The problem is fixed if I switch to {\cal R}_n or \mathcal{R}_n but I don't understand why; I've been able to use \cal in the \cal{R} manner in the past without problems. I figure it might be nice to have an explanation easily available on here... | Why does \cal{M}_n give “M>” in parts of my LaTeX file and works correctly in other parts? |
If I have a magnet and an iron object, then the object would move towards the magnet, and the energy required to do so is stored in the magnet itself, but there can't simply be an infinite amount of energy, so do magnets eventually "run out" of magnetism, and where does the magnet get the energy from in the first place? | When a permanent magnet attracts some object, lets say a steel ball, energy is converted into for instance kinetic energy and heat when attraction happens, and they eventually collide. Does this imply that energy is drawn from the magnetic field and the magnet is depleted, making it weaker and weaker for each magnetic attraction performed? (if the answer requires Quantum Mechanical explanations, please elaborate :)) |
In regards to give a solution for , I tried to simplify my code presented in the answer to use RTTI and the typeid() function to retrieve a class name: #include <iostream> #include <string> #include <typeinfo> struct IDriver { // Public virtual API: virtual void func1() = 0; // ... virtual ~IDriver() {} }; class SpecificDriver; template<typename Derived> class Driver : public IDriver { public: Driver() { std::cout << typeid(*this).name() << std::endl; std::cout << typeid(Derived).name() << std::endl; } virtual ~Driver() {} }; class SpecificDriver : public Driver<SpecificDriver> { public: // Public virtual API: virtual void func1(); virtual ~SpecificDriver() {} }; int main() { SpecificDriver sd; } results in a linker error: /tmp/ccXnTrfe.o: In function `main': main.cpp:(.text.startup+0x4f): undefined reference to `typeinfo for SpecificDriver' Why does this result in an undefined reference error for the typeinfo rather than the missing func1() definition (where it's not even used BTW)? Interestingly enough when I remove all the virtual stuff, it works just fine: #include <iostream> #include <string> #include <typeinfo> template<typename Derived> class Driver { public: Driver() { std::cout << typeid(*this).name() << std::endl; std::cout << typeid(Derived).name() << std::endl; } }; class SpecificDriver : public Driver<SpecificDriver> { }; int main() { SpecificDriver sd; } Output: 6DriverI14SpecificDriverE 14SpecificDriver So is this really related to ? | I just ran across the following error (and found the solution online, but it's not present in Stack Overflow): (.gnu.linkonce.[stuff]): undefined reference to [method] [object file]:(.gnu.linkonce.[stuff]): undefined reference to `typeinfo for [classname]' Why might one get one of these "undefined reference to typeinfo" linker errors? (Bonus points if you can explain what's going on behind the scenes.) |
I have already checked this post but it doesn't seem to fit to my issue. I want to merge multiple lists together to get a tuple for each multiplication. So let's say: listA = ['a', 'b', 'c', 'd'] listB = [ 1 , 2 , 3 , 4 , 5 ] listC = ['!', '?', '='] The lists do not have the same length. My desired result would be: result = [('a', 1, '!'), ('a', 1, '?'), ('a', 1, '='), ('a', 2, '!')... As far as I got it, the zip() functions only joins two elements to a list together with the same index which is not what I want. | How can I get the Cartesian product (every possible combination of values) from a group of lists? Input: somelists = [ [1, 2, 3], ['a', 'b'], [4, 5] ] Desired output: [(1, 'a', 4), (1, 'a', 5), (1, 'b', 4), (1, 'b', 5), (2, 'a', 4), (2, 'a', 5) ...] |
I'll not have access to my PC in a few days, and since I have a 270 consecutive streak going on over at SO I was wondering the following: Does the Android SE app qualify for consecutive access? And if so, what do I need to do to gain the consecutive access to a particular SE site? I can see an issue with that with the app you access the whole SE platform, but not your specific sites. I haven't been able to find any up to date FAQ, apart from meta questions of a year old, hence I'm requesting the current status. | This isn't directly related to the app, but probably more on the APIs it's using. The last seen on the profile page doesn't seem to reflect that I'm actively using the Android app, or taking actions. I was able to vote on items and the last seen property on the profile page said I was last seen 50 minutes ago, when I was using a computer. I'm assuming it won't count as a visit for the Enthusiast and Fantic badges either. I don't want someone angrily posting on Meta swearing they used the app for a day, yet they lost the consecutive days and has to prove it by showing they voted for something (we're probably far from this situation since it's alpha...) |
I am usign the baposter enviroment to create a scientific poster. My question is that I am attaching images of different sizes in \begin{center} \includegraphics[scale=0.18]{fig1.pdf} \includegraphics[scale=0.22]{fig1a.pdf} \includegraphics[scale=0.22]{fig2a.pdf} \includegraphics[scale=0.22]{fig2b.pdf} \includegraphics[scale=0.22]{fig2c.pdf} \captionof{figure}{\tiny{}} \end{center} and the issue is that I would like to put the figures fig2x.pdf a little bit higher compared to where they are (such that the space between the text and these set of figures is lesser compared to the other two figures). | I want to create a table with multiple rows of the following form: a cell that contains text and then multiple cells that contain images. The text should be vertically centered and the contents of every column should also be centered horizontally. I am aware of the m{} column type but somehow this seems to fail if an image is contained in the row and determines the row height. Any ideas? Minimal example: \documentclass{article} \usepackage{graphicx} \usepackage{array} \begin{document} \begin{figure} \begin{tabular}{m{3cm}c} (a) & \includegraphics{some_picture.pdf}\\ \end{tabular} \end{figure} \end{document} |
( has a different focus than this. That one explicitly asks solely for the rationale behind the current design. Arguing about the design, both in favor and possibly against it -- is thus prohibited there as off topic.) Noting that accepting and upvoting are intersecting functionalities -- both mark an answer as useful -- I wonder if accept marks should count towards tag scores as well. The purpose of a tag score is to measure a user's contribution to the tag, and they definitely both signify such contribution. Here's a litmus test for if an acceptance mark is fundamentally different from an upvote or not: "Would you think that a vote by the OP should be excluded from tag score if there was no separate acceptance mechanic?" One could argue that an OP would upvote a useful answer as well anyway, but this is by no means mandated by the system. Moreover, if an OP is a novice, they even can't upvote at all -- which thus unfairly disadvantages . AFAICS, the primary motivation for the current state of affairs is solely the implementation simplicity -- which is by no means a justification for perpetuating a flaw. Sure, if an OP both upvoted and accepted, it should probably still count as one point. This is fairly easily doable, e.g. by only counting the accept mark if the OP is not among the upvoters (or by subtracting one if they are). | For the 400 votes tag badge, does it take into consideration answers marked as the accepted answer? The description indicates it does not. I would think an accepted answer would be worth more, or at least the same amount, towards getting a tag badge than just a simple upvote? Lots of users mark answers as accepted and do not bother giving an upvote since the 15 points is like and upvote and a tip. So it's possible for a user to have 400 accepted answers with no upvotes and not get a badge where a user with 400 answers (which could be right or wrong) with a single upvote and no accepted answers ever would get the badge. Just seems a little odd or does accounting for accepted answers make the badge calculation too complicated / slow? Edit: Questions you ask and submit an answer to shouldn't be counted towards the total for accepted answers. Edit: It just seems to me that the most important thing in the system is an accepted answer yet there are no badges for achieving more than one accepted answer. If up votes were more important, and therefore far more worthy of a badge, then why do the top voted answers not appear above the accepted answer? When it come to badges, accepted answers are second class citizens as compared to a possibly random upvote. I have seen many upvotes on completely wrong answers but rarely do I see an accepted answer that was completely wrong. |
Is there any subset of the natural numbers that is definable but not recursively enumerable? | Can someone give me an example if a not recursively enumerable set $A \subseteq \mathbb{N}$ ? I came up with this question, when trying to show, that there exist partial functions $f: \mathbb{N} \rightsquigarrow \mathbb{N}$ that are constant for some value (when they halt), but not recursive: Since I know that a set is recursively enumerable iff it is the domain of a partial recursive function, to find an example of such a set, I would have to show that no matter which partial function whose domain is $A$ I would take, it wouldn't be recursive. I couldn't show the above, although it seems intuitively to be true to me. But since I could not show it and the existance of such a counterexample is even stronger (because I would have to show that a whole class of those partial functions aren't recursive) it made me wonder, wether such a set can exist. |
In Dummit and foote, for the proof for the simplicity of $A_5$, it claims that it is "easy" to see that $(12)(34)$ doesn't commute with any odd elements in $A_5$ and it commutes with $(13)(24)$, I have absolutely not idea why this is considered "easy", what method did the author use to quickly see this? It further claimed that "it follows that $|C_{A_5}((12)(34)| = 4$, which again, I don't see how it follows from the above statement without also checking other two cycles do not commute with $(12)(34)$. | On Dummit's Abstract Algebra on p. 128, it says: "It is easy to see that $(1 2)(3 4)$ ... does not commute with any non-identity element of odd order in $A_5$." But I don't find it easy. Any help, please? |
I'm trying to get a value that's between, next or before of a comma. For example, my string is: "value1,value2,value3,value4", sent to JS through PHP (ajax) How do I just get value2 and value4 inside the .js file? | I have this string 'john smith~123 Street~Apt 4~New York~NY~12345' Using JavaScript, what is the fastest way to parse this into var name = "john smith"; var street= "123 Street"; //etc... |
I've been looking through a tutorial and book but I can find no mention of a built in product function i.e. of the same type as sum(), but I could not find anything such as prod(). Is the only way I could find the product of items in a list by importing the mul() operator? | Python's function returns the sum of numbers in an iterable. sum([3,4,5]) == 3 + 4 + 5 == 12 I'm looking for the function that returns the product instead. somelib.somefunc([3,4,5]) == 3 * 4 * 5 == 60 I'm pretty sure such a function exists, but I can't find it. |
I'm from Tunisia and I got a Schengen visa from the Austrian Embassy for 28 days, the “duration of stay”, and the number of entries is 1 and the validity of the visa is from 02/08/2015 to 13/09/2015. So I have to stay only 28 days. I booked a fly ticket My plane is going to land in Vienna at 18h sunday the 9th of August and my departure will be at 18h30 Sunday the 6th of September. That's mean the arrival is on Sunday the 9th of August, and the departure is Sunday the 6th of September. It is looking like I'm going to spend 29 days that's mean one day more than “duration of stay” but I'm going to spend 28 days and 30 minutes. Is there any problem or I have to change my ticket? | Can anyone tell me if the 90 days is in fact 90 nights? Can you leave the Schengen area on the 91st day? Or are you only allowed 89 nights and you are required to leave on the 90th day? |
Is there any convention what to use as placeholder for contact forms? I came up with two possible options. One is using a fake name as placeholder, with a label on the side of the input. The other one is using the description of the input as placeholder. – Wireframes created with The version with the labels seems to be more clear, because you still have the description along with the field. But the placeholder fake name seems to be outdated. The other version is neat and fits in occasions where there is not much space. Are there some guidelines to follow? Or is this just a subjective decision? | I am familiar with research on label placement to the left or above. I tend to go with right justified with the label to the left of the field for my form designs. However, inline placeholder text is trending and it does further reduce page clutter. Is there any research out there supporting its use? Has anyone conducted usability studies on their forms that they can share? Research Links: |
Let $V$ be the vector space of all functions from $\mathbb{R}$ into $\mathbb{R}$ which are continuous, i.e, the space of continuous real-valued functions on the real line. Let $T$ be the linear operator on $V$ defined by $(Tf)(x)$ := $ \int^{x}_{0} f(t) \ dt $. Prove that, $T$ has no characteristic values. | I would like to solve the following exercise: Let $V$ be the space of continuous real-valued functions on the real line. Let $T$ be the linear map on $V$ defined by $$ (Tf)(x) = \int\limits_{0}^{x}f(t)dt.$$ Prove that $T$ has no eigen-values. Here is my attempt: Suppose on contrary, $T$ has an eigenvalue say $\lambda$. Then there is a non-zero $f\in V$ such that $$ Tf= \lambda f$$ i.e., for all $x\in \mathbb{R}$, $$ \int\limits_{0}^{x}f(t)dt= \lambda f(x) $$ i.e., for all $x\in \mathbb{R}$, $$ f(x)-f(0)= \lambda f'(x)$$ i.e., for all $x\in \mathbb{R}$,$$ (f(x)-f(0))^{\lambda}= e^{\mu x}$$ Take $x=0$, we get $$ 0=e^{0}=1.$$ Therefore $T$ has no eigenvalues. Is the above argument correct? |
I want the code to search for a word mid sentence and see if its first letter is lower case. If it is, than it makes it upper case. For example: John hates using c++ daily, and it would change the C in c++ to uppercase. Here is the code #include <iostream> #include <string> #include<cstdlib> #include<fstream> using namespace std; ifstream in_stream; ofstream out_stream; int main() { in_stream.open("in.dat"); out_stream.open("out.dat"); char s[256]; in_stream>>s; s[0] = tolower(s[0]); out_stream<<s; in_stream.close(); out_stream.close(); system("Pause"); return 0; } | I want to convert a std::string to lowercase. I am aware of the function tolower(). However, in the past I have had issues with this function and it is hardly ideal anyway as using it with a std::string would require iterating over each character. Is there an alternative which works 100% of the time? |
As far as I know, since the earth is spinning, centrifugal force should be throwing you off the earth. However, gravity counteracts that by being a stronger force. So if you stood an object with the exact mass and size of earth, but it wasn't spinning, would you perceive gravity to be stronger? If this is true, wouldn't an object outside of the atmosphere not in orbit of the earth have greater acceleration than an object in orbit? | Let us say a block of mass is placed on the surface of earth. Then while drawing the forces on that body, we say: Force $F = mg$ acting towards the center of Earth. Normal reaction $N$ offered by the surface of Earth. If no other forces are acting, we say $F=N$. But what about the centrifugal force $m\omega^2R$ . Why don't we ever bring that into picture? What am I missing? |
I’m attempting to run a regression and test whether the slope is equal to 1. Most statistical packages only test of it's equal to zero. Is there a way to bypass this ? I’ve SPSS and minitab and can run the typical regression. Will the regression coefficients and SE be the same irrespective of whether I’m testing (slope = 0 or 1)? Meaning are the t stats and p values the only things that depend on the hypothesis. | In R, when I have a (generalized) linear model (lm, glm, gls, glmm, ...), how can I test the coefficient (regression slope) against any other value than 0? In the summary of the model, t-test results of the coefficient are automatically reported, but only for comparison with 0. I want to compare it with another value. I know I can use a trick with reparametrizing y ~ x as y - T*x ~ x, where T is the tested value, and run this reparametrized model, but I seek simpler solution, that would possibly work on the original model. |
I would like to modify (as simply as possible) the frametitle color of my frames but without changing anything else : I currently use the theme CambridgeUS and basically I would like to modify my frametitle color as it is in the Warsaw theme. I join you my current code and images to show you what I exactly want. Wrong color but good theme : \documentclass{beamer} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage[francais]{babel} \definecolor{rougefonce}{RGB}{180,1,1} \definecolor{bleufonce}{RGB}{30,1,135} \definecolor{vertfonce}{RGB}{0,90,0} \definecolor{bleuleger}{RGB}{220,220,235} \definecolor{rougeleger}{RGB}{235,220,220} \definecolor{vertleger}{RGB}{220,235,220} \definecolor{bleutitre}{RGB}{0,0,80} \definecolor{bleuroi}{RGB}{0,0,180} \usetheme{CambridgeUS} \usecolortheme{whale} \setbeamercolor{frametitle}{fg=white, bg = bleutitre} \setbeamercolor{author in head/foot}{bg = black, fg = white} \setbeamercolor{title in head/foot}{bg = bleufonce, fg = white} \setbeamercolor{date in head/foot}{bg = bleuroi, fg = white} \setbeamercolor{section in head/foot}{bg = black, fg = white} \usefonttheme[onlymath]{serif} \title{Test with wrong color} \author{Bob} \date{\today} \institute{} \begin{document} \section{Test} \begin{frame}{Wrong color} \maketitle \end{frame} \end{document} Right color but wrong theme : \documentclass{beamer} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage[francais]{babel} \usetheme{Warsaw} \usefonttheme[onlymath]{serif} \title{Test with right color} \author{Bob} \date{} \institute{} \begin{document} \section{Test} \begin{frame}{Right color} \maketitle \end{frame} \end{document} | In Beamer, I used the theme Ann Arbor. I want to achieve this type of gradient color on my title frame. It seems that I have trouble changing the frame title background to a gradient color. I would like this part (encircled in red, with an arrow) to be changed to a cyan color going to black. [Please ignore the encircled block]. How do I do this? Thank you. \documentclass[pdf]{beamer} \mode<presentation>{\usetheme{AnnArbor}} \usecolortheme{whale} \setbeamercolor{section in toc}{fg=red} %%% \setbeamercolor{structure}{fg=cyan!80!black} \setbeamercolor*{block title example}{fg=blue!50,bg= blue!10} \setbeamercolor*{block body example}{fg= red,bg= blue!5} \usefonttheme{structuresmallcapsserif} \setbeamertemplate{footline}[page number]{} \setbeamercolor{headline}{fg=blue!90!black,bg=cyan!90!black} \setbeamercolor{palette primary}{fg=white,bg=cyan!90!black} \setbeamercolor{palette secondary}{fg=white,bg=cyan!90!black} \setbeamercolor{palette tertiary}{fg=white,bg=black} \setbeamercolor{frametitle}{fg=white,bg=cyan!50!black} %%%% \title{Some Random Stuff} \subtitle{First time to code xD} \begin{document} \begin{frame} \titlepage \end{frame} \begin{frame}{Testing} \frametitle{Test} Blah blah\\ \begin{block}{A block} Some text \end{block} \end{frame} \end{document} |
I am using TexLive 2015 with TexStudio. I am editing my bibliography with Jabref. I recently updated TexStudio and face bibliography compilation troubles since then. When I compile, the log file indicates: "empty bibliography" and "undefined references". I guess this is due to an error in the path between Jabref and texstudio or a wrong setting in TexStudio. I changed the default bibliography tool in Texstudio to put Biber rather than Bibtex but the compilation doesn't work whatsoever. My JabRef-generated literature file (thesegain2017.bib) is saved in the same folder than my tex-files. My knwledge stops right here. Would someone have any idea on how to work this out? Many thanks ! Below my minimal working example: \documentclass[french]{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{lmodern} \usepackage[backend=biber,style=verbose-trad1, ibidtracker=context]{biblatex} \renewcommand{\mkibid}[1]{\emph{#1}} \usepackage{csquotes} \usepackage[perpage]{footmisc} \addbibresource{thesegain2017.bib} \usepackage[a4paper]{geometry} \usepackage[english,francais]{babel} \begin{document} Blalalblla\autocite{Bourdieu1979} \printbibliography \end{document} Here is the .bib file: % This file was created with JabRef 2.10. % Encoding: UTF8 @Book{Bourdieu1979, Title = {La distinction, Critique sociale du jugement}, Author = {Bourdieu, Pierre}, Year = {1979}, Location = {Paris}, Pagetotal = {670}, Publisher = {Les éditions de Minuit}, Owner = {Mailys}, Timestamp = {2014.05.14} } In the .bbl file I found that: % $ biblatex auxiliary file $ % $ biblatex bbl format version 2.5 $ % Do not modify the above lines! % This is an auxiliary file used by the 'biblatex' package. % This file may safely be deleted. It will be recreated by % biber as required. \begingroup \makeatletter \@ifundefined{[email protected]} {\@latex@error {Missing 'biblatex' package} {The bibliography requires the 'biblatex' package.} \aftergroup\endinput} {} \endgroup But in the .blg file, I found that: [0] 05015a72.pm:324> INFO - This is Biber 2.1 [0] 05015a72.pm:327> INFO - Logfile is 'my file.blg' | I'm trying to use biblatex and when I compile my document I get an error like the following: Windows data source C:\Users\<username>\AppData\Local\Temp\par-5061756c\ cache-890efc00b3ca6b775c7d44a325c1349fb2a3a3bd\inc\lib/Biber/LaTeX/recode_data.xml not found in . Mac data source /var/folders/v2/rld0ls7d2935gkvqv5hfr1x00000gn/T/par-616c616e/ cache-cdd483146f82a9655ce063f848d5139480fbf872/inc/lib/Biber/LaTeX/recode_data.xml not found in . Linux data source /tmp/par-6963617269756d/cache-f37ab610b7d79b2720a8ee3732849c6821705520 /inc/lib/Biber/LaTeX/recode_data.xml not found in . |
Question How can I save "settings" so that they can be used again after the application has been closed? When I say settings I mean different properties of the controls on my form. What is the easiest and most appropriate method? I've read you can save to the system registry or a xml file? Background I have a form that creates a row in a Table that changes depending on what control is set or change. I would like to be able to save different configurations and display them in a combobox for repeated use. Example The end user fill in all textboxs and ticks checkboxes. They then click add to favourites They add a favourite name and save The save is then permanently visible in the favourites combobox. My form | What I want to achieve is very simple: I have a Windows Forms (.NET 3.5) application that uses a path for reading information. This path can be modified by the user, by using the options form I provide. Now, I want to save the path value to a file for later use. This would be one of the many settings saved to this file. This file would sit directly in the application folder. I understand three options are available: ConfigurationSettings file (appname.exe.config) Registry Custom XML file I read that the .NET configuration file is not foreseen for saving values back to it. As for the registry, I would like to get as far away from it as possible. Does this mean that I should use a custom XML file to save configuration settings? If so, I would like to see code example of that (C#). I have seen other discussions on this subject, but it is still not clear to me. |
On my iPad 2 (running iOS 9) there's a "Virus Detected" email popping up that I can neither delete or change. No matter what I do, the "Virus Detected" email keeps opening on my screen whenever I attempt to use Safari. I've attempted to delete the email, change the email and to close Safari but the email keeps returning and makes using the browser impossible. I have no intention to either call the provided phone number or sending this email as it directs me to do. The email is as follows: To: [email protected] Subject: Warning! Virus Detected! Immediately Call Apple Support +1-800-876-6855. Your credit card details and banking information. Your e-mail passwords and other account passwords.Your Facebook, Skype, AIM, ICQ and other.Call Apple Support +1-800-876-6855. Your private photos, family photos and other sensitive files.Your webcam could be accessed remotely by stalkers with a VPN virus. CC: [email protected] Message: Apple Tech Support How do I remove this email and regain access to my browser? | When I went to a website in Safari, it opened up another website with popups claiming my iPad has a virus. I deleted some of my apps to try and get rid of the virus, but the popup keeps showing up every time I open Safari. Can someone help me? |
I have a string with 100 characters and I want to make a code that separates and stores substrings every 10. def windows(srt): i = 0 n = 10 str1 = '' for x in range(i, n): str1 += srt[i:n] i += n n += n return str1 string = 'ashusdasddsasdsdaisdauihdsuaudhsuiahcnkjacnlskndjkasdhklahcjkchaljkchskjlchaksjchjkahcsjkchalkjhscjklhaskljchlaksjhckjalshcjkaschsjklchajklhcsjkhcakljchkacjs' x = windows(string) print(x) | I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive. I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators. I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though. Related question: |
I want to know how to review guides that were shown to me when I got a certain reputation. For example: how to use '@' sign how to flag in posts how to edit posts how to accept answers Some things are not shown in the FAQ sections. I don't want to search Meta for answers to questions, I want to review (or re-study.) Is there any way to get this guide again? Specifically, I don't remember how to reply messages multiple guys by one message. I want to review (re-study) the guide for using @. I know if I want to review badges I can use my Notifications. What about for my other privileges? UPDATE ( due to toolbar changes ) How can I view my privious privileges on meta site ? | on Ask Different. We've been working hard on ways to help improve the experience of new users, and one of the best ways to do that is to help teach them the basics about how our sites work before they run afoul of them. This will improve their odds of having a good first experience, speed up how quickly they can become contributing members of community, and head off the frustrations they sometimes have as a result of crashing into one of the many things that make us... different. So We've just rolled out the first version of our new "quick start" guide. It's designed to help teach new users the absolute minimum they need to know to get started and have a good experience. How we're different from discussion boards, the basics of rep, what you can do right off the bat, why some questions aren't allowed, etc. We spent a LOT of time on trying to get to the absolute minimum length that will still cover the key things new users need to know to be successful, but if you have feedback, please share it. |
I have problem with something on my website. I am not entirely sure what is causing problems anymore. Database collation: utf8_bin Table charset: utf8 Example of row in table: ID Name KeyID 5 Ajša 3312 <?php header('Content-Type: text/html; charset=utf-8'); ...connection to server... $sql = "select * from osebe where id=5;"; $result = $conn->query($sql); if ($result->num_rows > 0) { while($row = $result->fetch_assoc()) { echo "id: " . $row["ID"]. " - Name: " . $row["Name"]. " " . " - Key: ".$row["KeyID"]. "<br>"; } } else { echo "0 results"; } $conn->close(); ?> Output: id: Aj�a - Name: Aj�a - Key: 3312 Files have utf8 encoding as well, so i dont know what to do anymore. | I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1. Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur? This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2. |
$ su - Password: # echo $PATH /usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin # exit logout $ su Password: # echo $PATH /usr/local/bin:/usr/bin:/bin:/usr/local/games:/usr/games I have no idea why /bin and /sbin are not added to $PATH, if I do the plain su. This used to be the case. How can I fix this? I did notice that: -rw-r--r-- 1 root root 0 Jan 8 2018 /etc/environment But otherwise my system seems normal. EDIT: I forgot the obligatory uname -a Linux rpi3 4.17.0-1-arm64 #1 SMP Debian 4.17.8-1 (2018-07-20) aarch64 GNU/Linux EDIT2: $ cat /etc/issue Debian GNU/Linux buster/sid \n \l all of the packages are from the "testing" repo, since "stable" ones don't work very well on aarch64. | On my fedora VM, when running with my user account I have /usr/local/bin in my path: [justin@justin-fedora12 ~]$ env | grep PATH PATH=/usr/kerberos/sbin:/usr/kerberos/bin:/usr/local/bin:/usr/bin:/bin:/usr/local/sbin:/usr/sbin:/sbin:/home/justin/bin And likewise when running su: [justin@justin-fedora12 ~]$ su - Password: [root@justin-fedora12 justin]# env | grep PATH PATH=/usr/kerberos/sbin:/usr/kerberos/bin:/usr/local/bin:/usr/bin:/bin:/usr/local/sbin:/usr/sbin:/sbin:/home/justin/bin However, when running via sudo, this directory is not in the path: [root@justin-fedora12 justin]# exit [justin@justin-fedora12 ~]$ sudo bash [root@justin-fedora12 ~]# env | grep PATH PATH=/usr/kerberos/sbin:/usr/kerberos/bin:/sbin:/bin:/usr/sbin:/usr/bin Why would the path be different when running via sudo? |
I use the following code to send an email from my Gmail account. But the following error is occurred. Unable to connect to the remote server what's wrong with my code? string from = "[email protected]"; string to = TxtTo.Text; string cc = "[email protected]"; string subject = TxtSubject.Text; string body = EdtContext.Content; MailMessage EMail = new MailMessage(); MailAddress Sender = new MailAddress(from); EMail.From = Sender; EMail.To.Add(to); EMail.CC.Add(cc); EMail.Body = body; EMail.IsBodyHtml = true; EMail.Subject = subject; EMail.BodyEncoding = Encoding.UTF8; SmtpClient Local = new SmtpClient("smtp.gmail.com");//--- smtp Local.Port = 465; Local.EnableSsl = true; Local.UseDefaultCredentials = false; Local.Credentials = new System.Net.NetworkCredential("[email protected]", "*****");//------ email user and pass in sobhan mail Local.Send(EMail); *************** **Port 587 solved problem** | Instead of relying on my host to send an email, I was thinking of sending the email messages using my Gmail account. The emails are personalized emails to the bands I play on my show. Is it possible to do it? |
What is the probability that a random $\{0,1\}$, $n \times n$ matrix is invertible? Assume the 0 and 1 are each present in an entry with probability $\frac{1}{2}$. Is there an explicit formula as a function of $n$? Does it tend to 1 as $n$ grows large? I'm sure this is all known... Thanks! | Given a random square matrix of size $n\times n$ in the field $\mathbb F_2$, what is the probability that its determinant is $1$? (This is also the probability that the matrix is non-singular, since $\mathbb F_2$ only has the elements $0$ and $1$.) |
I am from Pakistan and applied for tourist visa to the Netherlands for just 15 days.The objection is that I do not have strong ties with my country. How can I satisfy the embassy and get visa? Reasons are that I have not strong ties with home country and chances of illegal immigration. | My husband is in Switzerland for 6 months with L permit. I applied for visitor visa. I submitted all documents with his entrance visa in which date of his coming back to India was not mentioned but later on after submission of visa documents to VFS office, I submitted his L-permit through mail. But my visa got rejected stating " your intention to leave the territory of the member state before the expiry of visa could not be ascertained". I also got confused on the answer of extension of my husbands visa permit during answering to the embassy council. I have only 7 days left to reapply for visa. I don't know what should I do? Will I able to get visa again within 7 working days?? |
I want to create a kbordermatrix with an underbrace and some text below. I tried it with \documentclass{scrartcl} \usepackage{kbordermatrix} \begin{document} \[ \underbrace{ \kbordermatrix{ & 1 & 2 \\ 1 & a & b \\ 2 & c & d }}_{test} \] \end{document} which gave me this output: As you can see the underbrace also goes below the rowlabels since they are treated as an extra column. Is there a way of using an underbrace which is only below the actual matrix? | How to put underbraces, inside the parenthesis of a matrix, to name both sides of the blocks? \documentclass[a4paper,12pt]{article} \usepackage{amsmath} \usepackage{array} \begin{document} . . . \[ \left ( \begin{array}{rrr|rrr} 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ \end{array} \right ) \] \end{document} I'm compiling the code in my university server, where I can't install new packages. |
Question: In what sense is "the kernel of a group homomorphism a universal"? Do we here mean that a group homomorphism is a universal arrow in some comma category? If so, what comma category? Attempt: If we let $K$ be a normal subgroup of $G$ and $i: K \rightarrow G$ being the inclusion homomorphism, then for any other normal subgroup $T$ of $K$ with $k : T \rightarrow K$ being another inclusion homomorphism and likewise with $j : T \rightarrow G$, then we have that $j = i \circ k$. Now let $C$ be the category of the subgroups of $G$ with inclusion homomorphisms as morphisms. Let $S: C \rightarrow C$ be the identity functor on $C$. Then do we not here have that $(K, i)$ is a universal arrow in $(C \downarrow G)$? And if so, is this the sense in which "the kernel of a group homomorphism is a universal"? EDIT: Answers in another thread on this site have confused me in the sense that they don't discuss explicitly about universal arrows and comma categories. | I'm reading Mac Lane's "Categories for the Working Mathematician". I found the following sentence in page 59 of it: Similarly, the kernel of a homomorphism (in $\mathbf{Ab}$, $\mathbf{Grp}$, $\mathbf{Rng}$, $R$-$\mathbf{Mod}$, . . .) is a universal, more exactly, a universal for a suitable contravariant functor. I know how to express a quotient by a universal property in a category. But I really have trouble understanding how to express the kernel of a homomorphism as having a universal property. |
Suppose I have called a function as, const data = await someFunction() I want to calculate execution time of this function. For this I tried as, let startTime = Date.now(); const data = await someFunction() let endTime = Date.now(); And I calculated difference between endTime-startTime and the result I get i think is in millisecond and converted it to second. I would like second opinion on this whether this is one of the option to calculate or is there some more better method which can give me execution time in second. | I need to get execution time in milliseconds. I originally asked this question back in 2008. The accepted answer then was to use However, we can all agree now that using the standard API is more appropriate. I am therefore changing the accepted answer to this one. |
Counterspell requires the following: [a reaction], which you take when you see a creature within 60 feet of you casting a spell The Flameskull's spellcasting block reads the following: [The Flameskull] requires no somatic or material components to cast its spells. If the Flameskull requires no visible components, can its spells be counterspelled? | Counterspell 1 reaction, which you take when you see a creature within 60 feet of you casting a spell. Can I Counterspell a creature that completely eliminates component requirement? Subtle Spell When you cast a spell, you can spend 1 sorcery point to cast it without any somatic or verbal components. If the spell is subtle then can I see it’s being cast in order to counterspell it? |
I want to do a statistical test to test the following business assumptions: 1. Higher duration is associated with a lower score 2. However, Hypothesis (1) may or may not be true for all Survey reasons What I am thinking of is to do a regression with interaction terms: score = duration + reason + duration * reason My questions: 1. Is it possible to do a categorical * continuous variable interaction? Most resources I saw online only shows instances where the categorical variable is binary. I have a multi-group categorical variable. 2. Is there a graphical way of showing this? | I have a continuous outcome variable. I understand that if I have a binary predictor, and a continuous predictor, and an interaction, then the model looks like this: $y_{i} = \beta_{0} + \beta_{1}x_{1} + \beta_{2}x_{2} + \beta_{3}x_{1}x_{2} + \varepsilon_{i}$ However, I'm thinking of making the binary predictor a categorical one instead, with three categories. What will the model equation look like once I make that change? I understand that I'll need to have two dummy variables, but I can't conceptualize what the interaction will look like under that circumstance. Does it make any difference whether I use 0,1 to code the binary predictor, or some other values like 1,2? This question also applies to the model with the categorical predictor, since in that case I'll have to decide how to code the dummy variables. Prior to the interaction term being in my model I was encouraged to center the continuous predictor. Is centering (still) a good idea now that I have this interaction term? |
I want to install absynth 5 on my computer. I found this code, here it is. #!/bin/bash # Date : (2013-02-01) # Last revision : (2013-02-01) # Distribution used to test : Kubuntu 12.04 LTS # Author : DJYoshaBYD # Licence : GPLv3 # PlayOnLinux: 4.1.9 # CHANGELOG # [SuperPlumus] (2013-06-17 19-35) # Update gettext message [ "$PLAYONLINUX" = "" ] && exit 0 source "$PLAYONLINUX/lib/sources" PREFIX="Absynth5" WINEVERSION="1.3.0" TITLE="Absynth 5" EDITOR="Native Instruments" GAME_URL="http://www.native-instruments.com" AUTHOR="DJYoshaBYD" #Initialization POL_GetSetupImages "http://files.playonlinux.com/resources/setups/$PREFIX/top.jpg" "http://files.playonlinux.com/resources/setups/$PREFIX/left.jpg" "$TITLE" POL_SetupWindow_Init POL_Debug_Init # Presentation POL_SetupWindow_presentation "$TITLE" "$EDITOR" "$GAME_URL" "$AUTHOR" "$PREFIX" # Create Prefix POL_SetupWindow_browse "$(eval_gettext 'Please select the setup file to run')" "$TITLE" POL_System_SetArch "x86" POL_Wine_SelectPrefix "$PREFIX" POL_Wine_PrefixCreate "$WINEVERSION" #Dependencies # Configuration Set_OS "winxp" Set_SoundDriver "alsa" # Installation POL_Wine_WaitBefore "$TITLE" GC_DONT_GC=1 POL_Wine "$APP_ANSWER" POL_Wine_WaitExit "$TITLE" # Create Shortcuts POL_Shortcut "Absynth\ 5.exe" "$TITLE" POL_SetupWindow_message "$(eval_gettext 'NOTICE: For low-latency audio, look into WineASIO.')" "$TITLE" POL_SetupWindow_Close exit 0 But I think it is supposed to go somewhere other than the Terminal because in the terminal after typing #!/bin/bash I still get a $ sign. Thank you in advance for all of your help. | Whenever I open a .sh file, it opens it in gedit instead of the terminal. I can't find any option similar to Right Click → Open With → Other Application... → Terminal. How do I open this file in the terminal? |
Suppose $A \ne \emptyset$ is bounded below. Let $-A$ denote the set of all $-x$ for $x$ in $A$. Prove that $-A \ne \emptyset$ that $-A$ is bounded above, and that $-\sup(-A)$ is the greatest lower bound of $A$. I have absolute no clue, what I thought was: Let $B = \inf A$ We assume $-A = \emptyset$ then we recognize that $A = x \in $R If elements of $-A = -($elements of A) then we reach a contradiction because $-x$ exists as $A \ne \emptyset$. I really cant prove anything else. This problem has me stumped. Anything is appreciated. | Let $A$ be a nonempty subset of real numbers which is bounded below. Let $-A$ be the set of of all numbers $-x$, where $x$ is in $A$. Prove that $\inf A = -\sup(-A)$ So far this is what I have Let $\alpha=\inf(A)$, which allows us to say that $\alpha \leq x$ for all $x \in A$. Therefore, we know that $-\alpha \geq -x$ for all $x \in -A$. Therefore we know that $-\alpha$ is an upper bound of $-A$. $\ \ \ \ $ Now let $b$ be the upper bound of $-A$. There exists $b \geq-x \implies-b \leq x$ for all $x \in A$. Hence, \begin{align} -b & \leq \alpha\\ -\alpha & \leq b\\ -\alpha & = - \inf(A) = \sup (-A) \end{align} By multiplying $-1$ on both sides, we get that $\inf(A) = -\sup (-A)$ Is my proof correct? |
I would like my pc to power on automatically every day at a specific time. I know how to do this in BIOS. The problem is that when the pc is booted, it requires a password to log in on windows. The question is: How do I get my pc to login with my password automatically? Thanks. Clarification: What I want is to keep my account locked with a password. I don't want to disable my password in order to login automatically. The automation that I want, is to have a password, but inserted and log in automatically when my pc boots up automatically through rtc boot from bios. Clarification 2: I don't want to disable my password universally. What I want is to still have my password active and inserted automatically when my pc boots automatically through rtc from bios. When I boot it up myself, I want it to ask me for the password. | It's tedious to type my password every time I start my Windows 10 VM, especially since you can't paste a password into the box. I want to set up automatic login. Following the instructions I tried to disable the "Users must enter a user name and password" option in netplwiz. But the option isn't there! It should be above the "users for this computer" list. Is there a setting I need to change to allow me to change the setting? |
I have a pandas Series: freq_features = num_occurrences/num_nodes print(type(freq_features)) print(freq_features) <class 'pandas.core.series.Series'> PAT 0.386667 NUR 0.360000 MED 0.146667 ADM 0.106667 I round each value to 2 decimal places: freq_features_rounded = freq_features.round(2) print type(freq_features_rounded) print freq_features_rounded <class 'pandas.core.series.Series'> PAT 0.39 NUR 0.36 MED 0.15 ADM 0.11 dtype: float64 But when I use the to_dict() command, I get the non-rounded values (except for the ADM key): freq_features_dict = freq_features_rounded.to_dict() print freq_features_dict {'NUR': 0.35999999999999999, 'ADM': 0.11, 'PAT': 0.39000000000000001, 'MED': 0.14999999999999999} Why is this happening, and how can I get my rounded values into the dict() object as values? | Consider the following code: 0.1 + 0.2 == 0.3 -> false 0.1 + 0.2 -> 0.30000000000000004 Why do these inaccuracies happen? |
The program is supposed to calculate your TDEE after taking in your gender, BMR, and activity level but it can't calculate it if the activity level won't go through and I feel like it's something to do with my if-statements but I really don't know how. The value types of gender and level used to be char but my teacher told me to change it to String but it still didn't work. import java.util.Scanner; public class TDEE_2 { public static void main(String [ ] args) { Scanner in = new Scanner(System.in); double activityFactor = 0.0; System.out.println("Please enter your name: "); String firstName = in.next(); String lastName = in.nextLine(); String name = firstName + lastName; System.out.println("Please enter your BMR: "); double bmr = in.nextDouble(); System.out.println("Please enter your gender (M/F): "); String gender = in.next(); System.out.println("Select Your Activity Level"); System.out.println("[A] Resting (Sleeping, Reclining)"); System.out.println("[B] Sedentary (Minimal Movement)"); System.out.println("[C] Light (Sitting, Stading)"); System.out.println("[D] Moderate (Light Manual Labor, Dacing, Riding Bike)"); System.out.println("[E] Very Active (Team Sports, Hard Manual Labor)\n"); System.out.println("Enter the letter corresponding to your activity level: "); String level = in.next(); if(gender == "M" && level == "A") activityFactor = 1.0; else if(gender == "M" && level == "B") activityFactor = 1.3; else if(gender == "M" && level == "C") activityFactor = 1.6; else if(gender == "M" && level == "D") activityFactor = 1.7; else if(gender == "M" && level == "E") activityFactor = 2.1; else if(gender == "M" && level == "F") activityFactor = 2.4; else if(gender == "F" && level == "A") activityFactor = 1.0; else if(gender == "F" && level == "B") activityFactor = 1.3; else if(gender == "F" && level == "C") activityFactor = 1.5; else if(gender == "F" && level == "D") activityFactor = 1.6; else if(gender == "F" && level == "E") activityFactor = 1.9; else if(gender == "F" && level == "F") activityFactor = 2.2; else System.out.println("Sorry, you entered an invalid letter."); double tdee = bmr * activityFactor; System.out.println("Your results:"); System.out.println("Name: " + name + "\t\t Gender: " + gender); System.out.println("BMR: " + bmr + " calories \t\t Activity Factor: " + activityFactor); System.out.print("TDEE: " + tdee + " calories"); } } When I run it, Activity level and TDEE appear empty but they're supposed to have values. I am new to java and don't know what to do sorry | I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference? |
For this equation I know the first step is to write $x^2-x=0 \pmod{ 111 5111}$ and then we know that we can write $111 5111=1051 \cdot 1061$ (product of prime numbers) so we have to solve the following: Find $x\:$ s.t. $1051 | x(x-1)$ ^ $1061 | x(x-1)$ What is the fastest way to solve this last step without a calculator? | I need the idempotent elements of $Z_{900}$ $2^2\cdot 3^2\cdot 5^2=900$ Of course there's $$0 \pmod 4 \\ 0 \pmod 9 \\ 0 \pmod {25} \\ $$ and $$ 1 \pmod 4 \\ 1 \pmod 9 \\ 1 \pmod {25} \\ $$ I found the answers by making a C++ program to test all numbers, but I don't know how to quick solve on paper. This is the output of the program $(0, 0, 0) \rightarrow 0 \\ (1, 1, 1) \rightarrow 1 \\ (0, 0, 1) \rightarrow 576 \\ (0, 1, 0) \rightarrow 100 \\ (1, 0, 0) \rightarrow 225 \\ (1, 1, 0) \rightarrow 325 \\ (0, 1, 1) \rightarrow 676 \\ (1, 0, 1) \rightarrow 801 \\$ |
System.out.printf(currForm.format(monthPay) + " "); I am trying to figure out how to format this code so that it aligns with the header which is outside this output. image of what the code appears as: Basically the user controls the all the inputs, so I am trying to do my best to accommodate 3 and 4 digit monthly payment amounts and their spacing. As you can see, the column allignment gets progressively more misaligned from the header as we get into the more right columns. I also did use "\t" but a difference between the 3 and 4 digit monthly payments makes major alignment issues. Thanks! | Is there some easy way to pad Strings in Java? Seems like something that should be in some StringUtil-like API, but I can't find anything that does this. |
A way to think about gravitational fields is that they spawn as a consequence of mass literally bending time and space. Is there an analog of this concerning charges and the electric field intensity? | After reading many questions, like and , I wonder: Is it possible to consider the other fundamental forces too, the electroweak interaction and the strong interaction or ultimately the unification of these, to be fictitious forces like gravity in the framework of general relativity? If we want a final unification of all fundamental forces, hasn't this feature of gravity to become a feature of the other forces as well? |
Using multiple branch/developers strategy for developing features causes some issues with built-in Drupal configuration management. Our scenario is the following: Create new feature and export config using drush Commit changes and configuration into git Move to another branch and start working in another feature Export config using drush (also exports config from the features added in the previous branch) Cannot move easily between branches as some content types are missing What is the best way to use feature branches in a multiple developer team without creating this overhead? | I wonder if somebody found a solution for the following issue related to Drupal 8 development with Git branches: You work on a new feature in a local feature branch for that you activate a contributed module or you write a custom module. This maybe delivers an own entity type and therefore creates a table after installing Meanwhile you need to fix a bug -> you change to a newly created bugfix branch which starts from the current dev branch After checking out the bugfix branch you import the current configurations to have the current active configuration of the branch -> the module you installed in feature branch is not activated anymore, the files of this module do not exist in the current bugfix branch You do your bugfixing and merge ths bugfix branch into develop branch. you change to your feature branch. To bring your local Drupal project to the status of this branch again you will import the configurations again And here it comes to an exception: the table already exists in your database. When doing a drush cim it stops every following processing and you need to restart drush cim to import any further configurations. Who does work with different feature branches and found a solution during development process to deal with this kind of situation? |
I'm considering building a new Windows-based work PC. Some of my work requires vast amounts of storage. Currently I'm serving that need by using a number of external USB drives. Given that I never need those external drives anywhere else, for the new machine, I'd prefer a solution where those drives are fixed inside the PC, next to the SSD that will contain the system partition and the most essential work data. However, because I live off the grid (and because HDDs can get loud!) I would like the storage hard disks to strictly remain turned off (ideally even when starting up!) until I need them - just like I would plug in a USB hard drive when I need it. From what I've gathered, this is not possible using Windows' built-in energy saving features itself: its "power saving" features will affect either all hard disks at once, or none. Is there a software, BIOS, or hardware solution that helps achieve this goal? | Obviously there are power management settings which Windows uses to determine when to power a hard drive off, and when to power it back on again. Powered down I assume doesn't mean absolute zero power, but it does mean the disk stops spinning. I have a second hard drive which is a tad noisy. In fact, having invested in a new case, CPU cooler, power supply and fan-speed controller, it's now the noisiest component left in my computer. And I've kinda run out of money. But... I don't need a second hard drive all the time. So - is there a quick-and-easy way to make Windows unmount all partitions from a particular internal hard drive and power that drive down on demand, and then make it power the drive back up and re-mount the partitions when I'm going to need it? Kinda the internal software-controlled equivalent of unplugging/reconnecting an external USB hard drive. I dual boot, so I really need the answer for both Windows XP and Windows 7. |
Please help me to fix this issue: Error: File "/media/woeusb_source_1544544327_15932/sources/install.wim" in source image has exceed the FAT32 Filesystem 4GiB Single File Size Limitation and cannot be installed. You must specify a different --target-filesystem. Refer: https://github.com/slacka/WoeUSB/wiki/Limitations#fat32-filesystem-4gib-single-file-size-limitation for more info. Unmounting and removing "/media/woeusb_source_1544544327_15932"... You may now safely detach the target device I also formatted the pendrive in NTFS and the error persists. | I tried to create a Windows 10 USB boot medium with WoeUSB. I formatted a USB drive with an NTFS partition, but WoeUSB complains with: Installation failed! Exit code: 256 Log: WoeUSB v@@WOEUSB_VERSION@@ ============================== Mounting source filesystem... Error: File "/media/woeusb_source_1543626298_6098/sources/install.wim" in source image has exceed the FAT32 Filesystem 4GiB Single File Size Limitation and cannot be installed. You must specify a different --target-filesystem. Refer: https://github.com/slacka/WoeUSB/wiki/Limitations#fat32-filesystem-4gib-single-file-size-limitation for more info. Unmounting and removing "/media/woeusb_source_1543626298_6098"... You may now safely detach the target device I've also tried to start WoeUSB via command line, did not work. sudo woeusb --partition Win10_1809Oct_English_x64.iso /dev/sdb My iso is located in: home/sawyer/Downloads/Win10_1809Oct_English_x64.iso Thanks in advance! I've been trying to get windows installed for three nights now, so any help towards that goal is greatly appreciated. |
It seems to me that when you scale a numeric variable you should do it separately in train and test set. For example, if you have a numeric variable X. Normalized X is : ( X - m(X) ) / s(X). When you have train and test sets, m(X) and s(X) should be calculated on each population. If not some information ( contained in global m and s ) pass from train to test set through globally normalized variables. Is it correct to think so? Thanks for your answer. | A common good practice in Machine Learning is to do feature normalization or data standardization of the predictor variables, that's it, center the data substracting the mean and normalize it dividing by the variance (or standard deviation too). For self containment and to my understanding we do this to achieve two main things: Avoid extra small model weights for the purpose of numerical stability. Ensure quick convergence of optimization algorithms like e.g. Conjugate Gradient so that the large magnitude of one predictor dimension w.r.t. the others doesn't lead to slow convergence. We usually split the data into training, validation and testing sets. In the literature we usually see that to do feature normalization they take the mean and variance (or standard deviation) over the whole set of predictor variables. The big flaw I see here is that if you do that, you are in fact introducing future information into the training predictor variables namely the future information contained in the mean and variance. Therefore, I do feature normalization over the training data and save the mean and variance. Then I apply feature normalization to the predictor variables of the validation and test data sets using the training mean and variances. Are there any fundamental flaws with this? can anyone recommend a better alternative? |
I am still confused with the classifications of such nouns as area, spot, compound (which refers to a type of area), and area itself. Are they abstract or concrete nouns? | The words that express the tangible and visible things of our experience, such as sand or sea, are all nouns, as are those expressing intangibles such as love or idealism. Also, some nouns, like field or grain, can be imagined both as tangible and intangible. People, generally, refer to these nouns with the terms concrete (tangible) and abstract (intangible). That being said, my question is, is there an English dictionary that—as well as identifying a word as a noun—additionally identifies the noun as either “abstract” or “concrete”? Are there any other resources that do this? |
By theorems, I mean the ones you can find in an undergraduate course of mathematics, not the ones you can find in a textbook of automated proofs. I mean by "proved by a computer" that an existing theorem was fully automatically proved by a computer(). I exclude verifications of existing theorems by a computer. This is . | The states: Despite these theoretical limits, in practice, theorem provers can solve many hard problems... However it is not clear whether these 'hard problems' are new. Do computer-generated proofs contribute anything to 'human-generated' mathematics? I am aware of the four-color theorem but as mentioned on the Wikipedia page, perhaps it is more an example of proof-verification than automated reasoning. But maybe this is still the best example? |
I start recording my screen for two hours by clicking cmd+shift+5, after that I stopped the recording, and immediately a popped up video appear with an option to share recorded video, I click the share button and choose telegram and I clicked done, my video doesn't shared to telegram neither saved on default saving location, i.e. desktop. I googled it but no solution work with me even Any solution will save my day, what I recorded very important to me. | I recorded a movie (File > New Movie Recording) using Quicktime Player and when I stopped I accidentally clicked "Don't Save" instead of "Save". Is that recorded content still on the hard drive somewhere, maybe in a temp or cache folder or something in a hidden directory? I'd like to recover it. Thanks. |
I was just reading and saw this under "Do": Get your passports stamped at the tourist information centre. This is an excellent souvenir as they stick a visa tax stamp and then an official ink stamp over the top, €5 First my question was if this is legit because of course there are no border controls inside EU and I have heard many places, including this site, that only border stamps and other official docs can go in a passport. Looking through I assume it's talking about this: Looks official. Then I came across but that is about EU citizens and I am not one. That question implies it is possible but I want to be clear. My question now is is it okay for a non EU person to ask for an official government stamp in the passport even when rules do not require passport stamping? If yes then where can you usually go to ask for that? Train stations? | It is known that passport stamps are a kind of collection for many people. But, inside European Union, we -EU citizens- are allowed to travel without passport, just with our national ID card (if we have in our countries). Is there any way to get passport stamps like non-EU citizens? You can identify yourself with the passport of course, but they don't stamp it. |
I'am trying to use the Python API to make a lot of different and randomized trees with the MTree add-on. But I'am struggling with an error telling me that the context is incorrect. RuntimeError: Operator bpy.ops.node.add_node.poll() failed, context is incorrect I've tried to use the bpy.context.active_node but that doesn't seem to exist even though it's in the . For now my code looks like this: import bpy bpy.ops.node.new_node_tree(type="mtree_node_tree", name="Tree1") bpy.context.area.add_node(type="MtreeParameters", use_transform=True) But it gives out an error which I listed before at the 3rd line. The code should just put a node into the node tree, but it probably doesn't know where to. So does anyone know how to make the node tree the context? | I have been trying to write my first addon for Blender over the last couple of days. One error I came across quite often is the context is incorrect error for an operation of bpy.ops. I learned that one can ask the poll function of an operator if the context is correct, but this does not tell why the context is correct/incorrect. What would be the best way to figure that out? Only way I could think of is to look into the code of the poll function. If that is the best way, what is the fastest way to find the appropriate piece of code? |
if [[ 6 > 50 ]]; then echo "true" fi $ bash script.sh I'm missing something very obvious here. Why is 6 greater than 50 ?? ** EDIT ** I'm also try to solve for if [[ 6.5 > 50 ]]; then echo "true" fi | Using echo "20+5" literally produces the text "20+5". What command can I use to get the numeric sum, 25 in this case? Also, what's the easiest way to do it just using bash for floating point? For example, echo $((3224/3807.0)) prints 0 :(. I am looking for answers using either the basic command shell ('command line') itself or through using languages that are available from the command line. |
I have the expression xy+xy'z+x'yz'. I have tried a number of ways to simplify it. What approach will ensure that this expression is reduced to its simplest form? | As stated in the title, I'm trying to simplify the following expression: $xy + xy'z + x'yz'$ I've only gotten as far as step 3: $xy + xy'z + x'yz'$ $=x(y+y’z) + x’(yz’)$ $=x(y+y’z)+x(y’+z)$ But I don't know where to go from this step, I'm not sure if I'm allowe to rewrite y'z as y+z' (I'm not even sure if that would help) |
"this code works for string id less than 20 but grater than 1000 it returns -1. " "---MySpinner.setSelection(adapter.getPosition(new CustomSpinnerList(String.valueOf(id), name)));// Sample id="1254",name="Aaaaa aaa" --------------------------------------------------------- private void setADivisions(int divisional_id) { DatabaseHelper myDb= new DatabaseHelper(this); ArrayList<CustomSpinnerList> MyArrList = new ArrayList<>(); Spinner MySpinner = (Spinner)findViewById (R.id.spinnerDivision); List<SysDivisionTable> MyList=myDb.get_all(Integer.valueOf(divisional_id)); int id=0; String name=""; myDb.closeDB(); for(SysDivisionTable MyTable:MyList) { if(MyTable.Get_col_A_division_id()==current_Adiv_id) { id=MyTable.Get_col_A_division_id();//="1245" name=MyTable.Get_col_A_division_name();="Aaaaa aaa" } MyArrList.add(new CustomSpinnerList(String.valueOf(MyTable.Get_col_A_division_id()), MyTable.Get_col_A_division_name())); } ArrayAdapter<CustomSpinnerList> adapter = new ArrayAdapter<CustomSpinnerList>(this, android.R.layout.simple_spinner_dropdown_item, MyArrList); Log.d("D01", "adapter.String.valueOf(id) "+ String.valueOf(id)+ " *** "+name); Log.d("D02", "adapter.getPosition"+ adapter.getPosition(new CustomSpinnerList(String.valueOf(id), name))); MySpinner.setAdapter(adapter); MySpinner.setSelection(adapter.getPosition(new CustomSpinnerList(String.valueOf(id), name)));// Sample id="1254",name="Aaaaa aaa" } public class CustomSpinnerList { private String id; private String name; public CustomSpinnerList(String id, String name) { this.id = id; this.name = name; } public String getId() { return id; } public void setId(String id) { this.id = id; } public String getName() { return name; } public void setName(String name) { this.name = name; } @Override public String toString() { return name; } @Override public boolean equals(Object obj) { if(obj instanceof CustomSpinnerList){ CustomSpinnerList c = (CustomSpinnerList)obj; if(c.getName().equals(name) && c.getId()==id ) return true; } return false; } } | I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference? |
I am not able to recover my files as I have accidentally deleted the files. Is there any application which will help me to recover the files. | Are there any tools, methods, incantations to recover recently deleted files on Ubuntu? If it makes any difference, I want to recover a 2.x database file. But would be better to have a method/tool that works on any kind of file. |
Show that for any prime numbers p, q, r , one has the sum of p^2 and q^2 is not equal to r^2 How do i go about doing this question? Do I use mathematical induction or is there any other way to go about doing it? if i use mathematical induction, how do i set the induction statement? because there are three variables p,q and r. Stuck here and hope to get some help. thank you :) | Not sure how to start. Prove by induction? Please help! |
I'm new to Blender and Cycles Render and I was setting up a basic test to produce a smooth polished bronze surface. My understanding is that the Rendered 3D View from the Camera should match the Single Image output however I simply cannot get any objects, lights or planes to render - merely a flat world colour. The Viewport: Rendered Result: I've tried various suggestions from other similar queeries (Ensuring I'm in Global View, ensure all objects are Visible to Render, Assign Each Object to a layer) and I can't quite get my head around what's not happening. Apologies if this is an obvious or stupid question as I am new to both Blender and 3D Modelling as a whole. The Blender File: | I made a scene where a grenade bounces in and rolls across the floor, except the issue is when I render it the location changes slightly. I am running blender 2.78 with supported features only. I have turned all modifiers off and restarted blender. The problem still persists. Can anyone help me out? Note: I made the animation by baking a physics simulation to key frames. The room was also made by archimesh. (I have tried disabling archimesh in the user preferences but it didn't change anything) In the viewport it looks like this: In the render it looks like this: Notice in the bottom right that the grenade has not changed locations. To my eye it looks like the grenade is in the same place, but the floor has changed locations. But either way, I do not know why this is happening. Thanks! |
i have xubuntu 14.04 LTS and i wan't to ask one question.I'am tried many pages ,but nowherewas this.Please help me i wan't to make my Xubuntu look like normal ubuntu(i have old laptop and the normal ubuntu is laging) and one thing is missing ,the overlay scrollbar please help me. | It looks like Ubuntu 11.04 will come with by default. I do like them, but I don't like the current mix of scrollbar types as many applications don't yet use those overlay scrollbars. Is there a way to disable overlay scrollbars (without removing the overlay-scrollbar package)? |
Which prepositions are correct? I am {on/at/in} the railway station. I am {on/at/in} square. | I am really confused. Which preposition is correct? She is in/at the park. They are in/at the park. I am in/at the park. Should I use in or at in these sentences? |
I have a CSV file with many address and I need to find the coordinates. I think to import the CSV into hoping that it find those points, then I would like to export a KMZ to import it in QGIS? Am I wrong in this thought? If this is the only way to solve it, how can I find info to create this CSV file? I imported the file into mymaps and I can see the points on the map. Then I exported it in KML/KMZ. When I go to layer/add layer, QGIS import only a table (with the orginal info from CSV file) not a point shape file. In the picture below you can see information from my imported addresses KMZ (this is not a geometry point shape file) and a correct test create into mymaps. I have to add that into mymaps app the dataset looks identical. | I have a CSV with an address field (no lat/long), so I went to Google My Maps, imported the csv and geocoded of the records. Now I export the layer as KML and added the KML to QGIS and Google Earth Pro, but in non of them I can see the markers. In fact in QGIS, the KML layer is added as datatable (no geometry). What's happening? How can I export a geometry layer from google My Maps? |
Many videos on YouTube while discussing black holes mention that it's born out of a heavy star when it collapses into a single point and that infinitely curves spacetime around it. When all the mass is getting confined to one point isn't it violating the uncertainty principle? | If black holes have mass but no size, does that imply zero uncertainty in position? If so, what does that imply for uncertainty in momentum? |
This seems to be a common problem, I read all the post here but can't fix the error This is BibTeX, Version 0.99d (MiKTeX 2.9.6350 64-bit) The top-level auxiliary file: revision6.aux I found no \citation commands---while reading file revision6.aux I found no \bibdata command---while reading file revision6.aux I found no \bibstyle command---while reading file revision6.aux (There were 3 error messages) Process exited with error(s) My code is super simple, just usepackage with backend and style for biblatex. Then I cited with the key generated by JabRef \documentclass[11pt]{article} \usepackage[letterpaper, margin=1in]{geometry} % page settings \usepackage{floatrow} \floatsetup[table]{capposition=top} \usepackage{authblk} \usepackage{amsmath} \usepackage[ruled]{algorithm2e} \usepackage{sectsty} \allsectionsfont{\normalsize} \usepackage{graphicx} \graphicspath{ {./figures/} } \usepackage[labelfont=bf]{caption} \setlength{\parindent}{7mm} \usepackage[backend=biber,style=numeric]{biblatex} \addbibresource{ABCbib.bib} \title{ABC} \begin{document} \maketitle \section{Introduction} proteins \cite{Zhang2013} \printbibliography \end{document} The bib file looks like @Article{Zhang2013, author = {Yaoyang Zhang and Bryan R. Fonslow and Bing Shan and Moon-Chang Baek and John R. Yates}, title = {Protein Analysis by Shotgun/Bottom-up Proteomics}, journal = {Chemical Reviews}, year = {2013}, volume = {113}, number = {4}, pages = {2343--2394}, month = {apr}, doi = {10.1021/cr3003533}, publisher = {American Chemical Society ({ACS})}, } EDIT: Then I tried both latex (or PdfLaTeX) -> Biber -> latex (or PdfLaTeX) -> latex (or PdfLaTeX) and got the error with warning Citation Zhang2013 on Page 1 undefined. May someone please guide me here? The configure is already changed to biber.exe and I input biber % for using as user command. But the error remains and ask me to rerun biber. | Running the minimal example \documentclass{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib} @ARTICLE{example, author = {Other, Anthony Norman}, title = {Some things I did}, year = {2014}, journal = {J.~Irrep. Res.}, volume = {1}, number = {1}, pages = {1-10} } \end{filecontents*} \usepackage[backend=biber]{biblatex} \addbibresource{\jobname.bib} \begin{document} Hello\cite{example}. \printbibliography \end{document} I get the warning There were undefined references. I have read and know that I need to run: LaTeX Biber LaTeX However, my editor is only set up to run BibTeX. How do I go about setting up my editor/IDE to be able to run Biber, and how do I run the LaTeX/Biber/LaTeX cycle? Answers (sorted alphabetically by editor name) Answer guidelines Each answer should be for one editor. If the editor is cross-platform, if possible give a single answer with notes covering the minor platform variations. Please edit the question to include new answers in the 'link list' Each answer should be 'stand alone', i.e. don't say 'It's almost the same as editor Y but ...' for the editor part Instructions for 'build tools' such as arara or latexmk are welcome but should explain how to set up the editor in question as not all editors allow simple addition of arbitrary tools |
Today I went through my desktop stations running Linux Mint 17.3 Cinnamon and did a file system check of root partitions with Ext4 file systems as follows: # fsck.ext4 -fn /dev/sdb2 The problem is that on all of the computers I see something similar to this one: e2fsck 1.42.9 (4-Feb-2014) Warning! /dev/sdb2 is mounted. Warning: skipping journal recovery because doing a read-only filesystem check. Pass 1: Checking inodes, blocks, and sizes Deleted inode 524292 has zero dtime. Fix? no Inodes that were part of a corrupted orphan linked list found. Fix? no Inode 524293 was part of the orphaned inode list. IGNORED. Inode 524294 was part of the orphaned inode list. IGNORED. Inode 524299 was part of the orphaned inode list. IGNORED. Inode 524300 was part of the orphaned inode list. IGNORED. Inode 524301 was part of the orphaned inode list. IGNORED. Inode 524302 was part of the orphaned inode list. IGNORED. Inode 524310 was part of the orphaned inode list. IGNORED. Inode 524321 was part of the orphaned inode list. IGNORED. Inode 524322 was part of the orphaned inode list. IGNORED. Inode 524325 was part of the orphaned inode list. IGNORED. Inode 2492565 was part of the orphaned inode list. IGNORED. Inode 2622677 was part of the orphaned inode list. IGNORED. Inode 2622678 was part of the orphaned inode list. IGNORED. Inode 2883748 was part of the orphaned inode list. IGNORED. Inode 2884069 was part of the orphaned inode list. IGNORED. Inode 2885175 was part of the orphaned inode list. IGNORED. Pass 2: Checking directory structure Entry 'Default_keyring.keyring' in /home/vlastimil/.local/share/keyrings (2495478) has deleted/unused inode 2498649. Clear? no Pass 3: Checking directory connectivity Pass 4: Checking reference counts Unattached inode 2491790 Connect to /lost+found? no Pass 5: Checking group summary information Block bitmap differences: -(34281--34303) -11650577 -(11650579--11650580) -11650591 -(11650594--11650595) -(13270059--13270073) -(13272582--13272583) -(20542474--20542475) +(26022912--26023347) -(26029568--26030003) Fix? no Free blocks count wrong (14476802, counted=14476694). Fix? no Inode bitmap differences: -(524292--524294) -(524299--524302) -524310 -(524321--524322) -524325 +2491790 -2492565 -2498649 -(2622677--2622678) -2883748 -2884069 -2885175 Fix? no Free inodes count wrong (7371936, counted=7371916). Fix? no /dev/sdb2: ********** WARNING: Filesystem still has errors ********** /dev/sdb2: 443232/7815168 files (0.1% non-contiguous), 16757502/31234304 blocks What I have tried: # touch /forcefsck This results in a 2-3 seconds lasting check on startup. Obviously not repairing anything. That is most probably because my root file system is somehow clean. # fsck.ext4 -n /dev/sdb2 e2fsck 1.42.9 (4-Feb-2014) Warning! /dev/sdb2 is mounted. Warning: skipping journal recovery because doing a read-only filesystem check. /dev/sdb2: clean, 443232/7815168 files, 16757502/31234304 blocks As I can't find almost anything for file system check on boot other than sudo touch /forcefsck, I tried these steps: echo u > /proc/sysrq-trigger umount /dev/sdb2 fsck -fy /dev/sdb2 This did show up that it had it repaired, to make sure I ran the fsck again without errors. BUT, they are back once I reboot. I am confused right now. Please don't instruct like "create a flash drive and boot from it and ...". I want a solution on reboot or before reboot without booting from some flash drives. Thank you. | Yesterday, one of our computers dropped to grub shell or honestly, I am unsure what shell it was when we turned on the machine. It showed that it can't mount the root filesystem or something in this sense, because of inconsistencies. I ran, I believe: fsck -fy /dev/sda2 Rebooted and the problem was gone. Here comes the question part: I already have in her root's crontab: @reboot /home/ruzena/Development/bash/fs-check.sh while the script contains: #!/bin/bash touch /forcefsck Thinking about it, I don't know, why I created script file for such a short command, but anyways... Further, in the file: /etc/default/rcS I have defined: FSCKFIX=yes So I don't get it. How could the situation even arise? What should I do to force the root filesystem check (and optionally a fix) at boot? Or are these two things the maximum, that I can do? OS: Linux Mint 18.x Cinnamon 64-bit. fstab: cat /etc/fstab | grep ext4 shows: UUID=a121371e-eb12-43a0-a5ae-11af58ad09f4 / ext4 errors=remount-ro 0 1 grub: fsck.mode=force was already added to the grub configuration. |
Water in my electric kettle makes the most noise sixty to ninety seconds before the water comes to a full boil. I have been fooled many times by the noisy kettle, only to discover that the water was not yet hot enough for tea. The kettle is only at a full boil after the noise has subsided. I have noticed the same phenomenon with many other kettles, including conventional kettles on kitchen ranges; it is not a peculiarity of this electric kettle. Why does the boiling become quieter as the water reaches full boil? | It always seemed to me that the noise from electric kettles follows a pattern: It starts low, then increases, and decreases again before the water starts to boil. To verify this, I performed a little experiment: I recorded the kettle using my cellphone at sampling frequency $44.1\ \mathrm{kHz}$. I used $1.2$ liters of water at room temperature (well, it's just normal tap water, I didn't actually perform a temperature measurement). I turned the kettle on at $t=0$, and it took $6$ minutes until the kettle switched itself off. Attached are the graph of the recording, a spectrogram (log scale) and an image of the kettle: (Due to the high sampling frequency, this graph shows mainly the envelope of the audio, but this is what I'm interested in. you can notice on the graph the sound of the initial and final "clicks" of the switch). Looking at the graph, the pattern is indeed very visible. The amplitude increases at a steady rate from $t=30\ \mathrm s$ to $t=90\ \mathrm s$, then it increases at a bigger rate and flattens at around $t=130\ \mathrm s$, it starts to decrease at $t=210\ \mathrm s$, and at $t=290\ \mathrm s$ (which is when it seemed to me that the water started to boil) increases again to a flat value until the end. What may be the reason for this pattern? (If needed, I can provide more info about the experimental setup and more data visualizations) EDIT$1$: Apparently . But I still wonder about the various phases in the boiling process, which are not mentioned in the other question. |
I'm trying to match this output from ansible ping module output: srv1 | SUCCESS => { "changed": false, "ping": "pong" } srv2 | SUCCESS => { "changed": false, "ping": "pong" } as well as this output from ansible setup module output: srv1 | SUCCESS => { "ansible_facts": { "ansible_all_ipv4_addresses": [ "192.168.50.100" ], "ansible_all_ipv6_addresses": [ "fe80::a00:27ff:fead:7504" ], "ansible_apparmor": { "status": "disabled" }, "ansible_architecture": "x86_64", ...a lot of lines } srv2 | SUCCESS => { "ansible_facts": { "ansible_all_ipv4_addresses": [ "192.168.51.101" ], "ansible_all_ipv6_addresses": [ "fe80::a00:27ff:fe98:b137" ], "ansible_apparmor": { "status": "disabled" }, "ansible_architecture": "x86_64", ...a lot of lines } I'd like to put everything between { .. } for specific host into matched variable, so later I can it using yaml.load. I tried: regex = r'(\w+)\s\|\s(\w+)\s=>\s(\{\n\s+"\w+":\s\w+,\n\s+"\w+":\s"\w+"\n\})' o = re.findall(regex,output,re.MULTILINE) for host in o: yml = yaml.load(host[2]) This works for first output, but not for second. So I tried to generalize it: regex = r'(\w+)\s\|\s(\w+)\s=>\s(\{.*\})' o = re.findall(regex,output,re.DOTALL) for host in o: yml = yaml.load(host[2]) But this will match everything between starting { and last }. What am I doing wrong? Thanx for help | I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}: The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}? |
I want my equation and align environments to center with respect to nested indents, but they only seem to center with respect to the full page width. Here is some example code: \documentclass[12pt]{amsart} \usepackage{geometry, amsthm} \geometry{letterpaper, margin=1in} \begin{document} \begin{enumerate} \item First level \begin{enumerate} \item Second Level \begin{enumerate} \item Third level\\ \begin{center} $x<y$ % Centered inside nested items \end{center} \begin{equation*} x < y % Centered in whole page \end{equation*} \end{enumerate} \end{enumerate} \end{enumerate} \end{document} This is the resulting document: Placing the equation/align inside a center doesn't work. How do I get the align and equation environments to center with respect to nested indents? | I have equations inside an environment which has a larger left-margin than the main text (analogous to an enumerate/itemize environment, implemented with the changepage package's adjustwidth environment). Just as equations in enumerate/itemize behave, the equations are centered with respect to the entire text, rather than just the width of the container environment. I want the latter behavior. I'm trying to accomplish this by wrapping all display-math in minipages. Namely, I'm modifying the mathdisplay environment in amsmath.sty as follows: \makeatletter \let\oldmd\mathdisplay \def\mathdisplay#1{% \newline \begin{minipage}{\textwidth-\@totalleftmargin}% \oldmd{#1}% } \let\oldendmd\endmathdisplay \def\endmathdisplay#1{% \oldendmd{#1}% \end{minipage} } \makeatother This is almost working, but there are some issues with spacing which I don't understand how to fix. Here's how the the normal \[ ... \] and numbered \begin{equation} ... \end{equation} look with the above modification: My main confusion is why the numbered version is behaving so differently from the unnumbered. But all in all I want to fix this so that the spacing above and below is even as it usually is. Any help is appreciated, thanks. Edit: Here's a compilable example: \documentclass{amsart} \usepackage{lipsum} \usepackage{calc} \usepackage{changepage} \makeatletter \let\oldmd\mathdisplay \def\mathdisplay#1{% \newline \begin{minipage}{\textwidth-\@totalleftmargin}% \oldmd{#1}% } \let\oldendmd\endmathdisplay \def\endmathdisplay#1{% \oldendmd{#1}% \end{minipage} } \makeatother \setlength{\parindent}{0pt} \begin{document} \lipsum[1] \begin{adjustwidth}{20pt}{} \lipsum[2] \[ x \mapsto \hom(-,x) \] \lipsum[3] \begin{equation} y \mapsto \hom(y,-) \end{equation} \lipsum[4] \end{adjustwidth} \lipsum[5] \end{document} |
The classification of finite simple group is a theorem describing all possible finite simple groups. The importance of simple groups is that they are, in a way, "irreducible" - they cannot be quotiented by any of their subgroup. They also come up in the composition series of a group, and hence it is sometimes said that every finite group is "made up" of finite simple groups. However, . I was therefore wondering whether some kind of classification of all finite groups is possible, which would give us means of constructing all groups? I know this is a rather vague question, but to give everyone some idea, here is the classification of finite abelian groups in the spirit of what I want: Definition: Call a finite abelian group $G$ irreducible if it's not isomorphic to a direct product of two nontrivial groups. Classification of finite irreducible groups: The finite irreducible groups are precisely the cyclic groups of prime power order. Classification of finite abelian groups: Every finite abelian group can be written (uniquely) as a direct product of irreducible groups. Long time ago I had a that every finite group can be written as a direct product of simple groups, and together with CFSG this would provide a dream classification of all finite groups, but sadly this isn't true. Replacing this with a semidirect products doesn't give us a true statement either, and at this point I am out of ideas. I realize that there might not be such a classification, and the difficulty in describing a groups of a given order (like $p^k$ with $p$ prime) only supports this. Nevertheless there still might be hope for a partial classification, like we have for simple groups or abelian groups, or maybe there is some description which is rather computationally infeasible. | I know a bit about simple groups. A finite Abelian group is a (direct) product of finite cyclic groups. The simple finite Abelian groups are exactly $\mathbb{Z}_p$ for $p$ a prime. And so, I understand how all finite Abelian groups are made up of finite simple groups. But, from what I understand, all finite groups are in some way made up of (finite) simple groups. My question is: how does that work? What does it (more precisely) mean that a finite group is made up of simple groups? Edit: Thanks to Stefan for directing me to questions that have basically already have the answer. I have done a bit more of research on this and I think I can narrow my question a bit. I would like to understand how simple groups are the building blocks of all finite groups. That is, I would like to understand how, given a finite group $G$, one can find (or show there exists) simple groups $G_1, \dots, G_n$ such that $G$ is [insert something] of $G_1,\dots G_n$. From , I understand now that it somehow has to do with composition series and Jordan-Holder's Theorem. I think I understand the definition of a short exact sequence. From that same question: Then $G$ is built from some uniquely determined (Jordan-Hölder) simple groups $H_i$ by taking extensions of these groups. I still don't get how this group $G$ is determined by the simple groups. I guess I am looking for more details basically putting together how one starts with a finite group $G$, "finds" simple groups $G_1, \dots G_n$ and then says that $G$ is isomorphic to something in terms of the simple groups. |
basically says that range must behave exactly as this implementation (for positive step): def range(start, stop, step): x = start while True: if x >= stop: return yield x x += step It also says that its arguments must be integers. Why is that? Isn't that definition also perfectly valid if step is a float? In my case, I am esp. needing a range function which accepts a float type as its step argument. Is there any in Python or do I need to implement my own? More specific: How would I translate this C code directly to Python in a nice way (i.e. not just doing it via a while-loop manually): for(float x = 0; x < 10; x += 0.5f) { /* ... */ } | Is there a way to step between 0 and 1 by 0.1? I thought I could do it like the following, but it failed: for i in range(0, 1, 0.1): print i Instead, it says that the step argument cannot be zero, which I did not expect. |
I'm curious. In the movie Avatar, how can machines fire the weapons and cause explosion? Clearly, Oxygen is required to cause Fire/Flames. How is this possible in Pandora? | It was observed again and again in the movie Avatar that humans could not breathe the air present in Pandora. So it can be assumed Oxygen was not present in Pandora. But again the human fires which erupted in the Hometree bombing, wouldn't be sustained if there was no Oxygen at all. So what were the components present in the air of Pandora? On the other hand if there was Oxygen, why could not the humans breathe there? So was the atmosphere in Pandora Oxygen filled or Oxygen free? |
Can someone, please, tell me what to do to fix this error? | I'm trying to install Lubuntu on my laptop (sorta old 2005). [Laptop stats: Intel® Celeron® CPU 410 @ 1.46 GHz 1.47GHz, 448 MB of RAM] I press Install and this message appears: This kernel requires an x86-64 CPU, but only detected an i686 CPU. Unable to boot - please use a kernel appropriate for your CPU. What can I do to install Lubuntu on my computer? |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.