body1
stringlengths
20
4.1k
body2
stringlengths
23
4.09k
This might be a rookie question but if I'm currently on a 4:1 oversubscription of my CPU ressources does that mean that my processors performances are divided(splitted) into 4 lower perf. vCPU? Will a vm using 4 vCPU will just divide a pCPU into 4 to actually be as fast as the pCPU itself?
This is a about Related: I have a question regarding capacity planning. Can the Server Fault community please help with the following: What kind of server do I need to handle some number of users? How many users can a server with some specifications handle? Will some server configuration be fast enough for my use case? I'm building a social networking site: what kind of hardware do I need? How much bandwidth do I need for some project? How much bandwidth will some number of users use in some application?
I've installed Process Lasso and in All processes tab, set all affinities to 1-7, meaning that all the processes can be start on all my CPUs except the first one. Yet, there is a huge load on my first CPU. I personally have no clue what's happening here and really appreciate any help. My system is: Intel core i7 - 4720 HQ 2.6 GHz upto 3.6 Windows 10 (64 bit) NVidia GTX 950 M This screenshot, shows the software's interface. Those 8 green bars on upper right show my CPU usage. Also the column called Rules, indicates the affinities on the processes. PS: These are screenshots that show the more familiar Task Manager and Resource Monitor. I've sorted all with respect to their CPU usage. Note that the overall CPU usage is just fine (less than 30% most of the time), but in Resource Monitor, same as the Process Lasso, it's obvious that that most of the load is on CPU0 and the others are almost free. Also I found out that my total CPU usage, is actually more than all my processes altogether! The orange line in Resource Monitor picture, shows the amount of CPU usage of all my processes. (I did the same in safe mode. Orange line, exactly coincides the total usage in safe mode. So I'm suspecting that something is happening in my normal boot.)
I have noticed that from some time my system is freezing and its probably caused by the high CPU usage which is caused by the system process. All applications I'm running is the Skype, TeamSpeak and Chrome so it definitely shouldnt eat that amount of CPU. You can see the problem itself and running processes in the screenshot below: Sometimes CPU usage is reaching 90%, but the average usage is like 40-65%. My PC parameters: Windows 8 (customer preview) Intel Core i3 - 2350M 8 GB RAM I'd appreciate any help attempt! Regards. --UPDATE-- As the user below posted a great answer, I have noticed that the process that is eating the most CPU in the system is called Arthurx.sys, simple google tells that it's a TPLink driver (an wifi adapter, I have bought like 2 weeks ago!) drivers has been installed from the Windows MSDN, but also tried to install the drivers from the attached CD, but it doesn't help. From the system start, it is using like 5% of the CPU only, but after 2-4 hours of working it is growing up and reaching 40-60% of the CPU usage. Device name: TPLink WN722N
I am, along with two of my classmates, are planning to make a prototype of a scooter (as in slower, smaller version of a motorcycle) that is propelled by an infinitely turning magnet wheel. Not as a motor or something that converts the motion to electricity, but as an independently perpetual motion-machine that may lead to the movement of the wheels of the scooter. But we have no blueprint or any plan on how to make that happen. Other than this, we are completely clueless on how to make brakes for this type of thing, how to control the speed, and how will generally work as a whole. We're eighth grade students and are probably going to never have a proper research if this doesn't work.
There are many videos on youtube in which people arranged magnets in circle and rotated one placing in middle of that circle on a shaft, and the magnet (magnet motor) starts madly and continues its movement. Do they really rotate infinitely? If so, do they from where they get that extra energy to move so fast and infinitely? EDIT: This question is about real world scenario UPDATE: I am unable to find that particular video about which i talked about -- I added them to my favourites, but they are all now deleted :( -- there are hundreds of that that kind of videos. Some example videos links
Using pdflatex, I would like to set an A4 article. I believed (from answer) that it did not matter whether I use \documentclass[a4paper]{article} or \documentclass{article} \usepackage[a4paper]{geometry} But when I compile the two, I get different page margins. So I am now confused which is the "correct" way to use A4 paper. Is it maybe that one option only changes the paper format from letter to A4 but maintains the page margins, while the other adapts the margins to the new format? (Just a guess...) MWE: \documentclass{article} \usepackage[a4paper]{geometry} %\documentclass[a4paper]{article} as the alternative \begin{document} Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Aliquet risus feugiat in ante metus dictum. Auctor urna nunc id cursus metus aliquam. Malesuada proin libero nunc consequat interdum varius sit amet mattis. Quis ipsum suspendisse ultrices gravida dictum fusce ut placerat orci. Pellentesque habitant morbi tristique senectus et netus et. Quam viverra orci sagittis eu volutpat odio. Tellus id interdum velit laoreet id donec ultrices. Ut lectus arcu bibendum at. In aliquam sem fringilla ut. Tristique senectus et netus et malesuada. Semper eget duis at tellus at. Tincidunt lobortis feugiat vivamus at. Volutpat commodo sed egestas egestas fringilla. Lorem mollis aliquam ut porttitor. Vitae auctor eu augue ut lectus. \end{document}
I have seen a similar question at and the selected answer there implies that there is no difference in whether we use \documentclass[a4paper]{article} or if we use \usepackage[a4paper]{geometry}. But my observations contradict the selected answer there. Here is my code in file foo.tex: \documentclass[a4paper]{article} \begin{document} Lorem ipsum dolor sit amet, consectetur adipiscing elit. Maecenas nec lobortis justo. Praesent ut scelerisque risus, sit amet mollis erat. Fusce at lacus at libero consequat consectetur. Proin at vehicula ligula. Vivamus quis ligula id lacus aliquet ultricies. Vivamus tristique, velit vestibulum tincidunt fermentum, lacus sem euismod risus, ut volutpat augue dolor vitae est. Proin odio nunc, sollicitudin quis nisi a, sodales efficitur quam. Phasellus ex velit, porttitor vestibulum consectetur eu, maximus et nisi. Nulla pharetra augue ex, quis scelerisque sem iaculis id. Aliquam in tincidunt quam. Praesent ac laoreet elit. Aenean varius ullamcorper dolor ac finibus. Proin est sapien, tempor nec mollis ut, ultricies et ante. Maecenas hendrerit velit non augue rutrum, mollis pharetra nisl auctor. Ut nisl mauris, porta ut nisi ut, elementum tristique nibh. \end{document} Here is another one in file bar.tex. The only thing that is different here is the usage of \usepackage[a4paper]{geometry} instead of \documentclass[a4paper]{article}. \documentclass{article} \usepackage[a4paper]{geometry} \begin{document} Lorem ipsum dolor sit amet, consectetur adipiscing elit. Maecenas nec lobortis justo. Praesent ut scelerisque risus, sit amet mollis erat. Fusce at lacus at libero consequat consectetur. Proin at vehicula ligula. Vivamus quis ligula id lacus aliquet ultricies. Vivamus tristique, velit vestibulum tincidunt fermentum, lacus sem euismod risus, ut volutpat augue dolor vitae est. Proin odio nunc, sollicitudin quis nisi a, sodales efficitur quam. Phasellus ex velit, porttitor vestibulum consectetur eu, maximus et nisi. Nulla pharetra augue ex, quis scelerisque sem iaculis id. Aliquam in tincidunt quam. Praesent ac laoreet elit. Aenean varius ullamcorper dolor ac finibus. Proin est sapien, tempor nec mollis ut, ultricies et ante. Maecenas hendrerit velit non augue rutrum, mollis pharetra nisl auctor. Ut nisl mauris, porta ut nisi ut, elementum tristique nibh. \end{document} But the output from both files are different. Here is a side by side comparison with foo.pdf on left and bar.pdf on right. I have three questions: Why are the two outputs different? Looks like it is due to different margins. Am I right? Do these outputs contradict the selected answer at ? Is there a best practice regarding where a4paper should be declared?
I saw this on Reddit and it had the following comment √x²=|x| It's the principle square root solution. So the square root of 49 is 7. It's the definition of square root. However the equation x²=7² has two solutions +7 & -7 Only because x²=7² --> x²-7²=0 --> (x+7)(x-7)=0 -->x= ±7 That's the difference between the two. Here's an intuitive example to understand that: y²=x is not the same as y=√x On plotting the points the first equation will result in a complete parabola whereas, in the second equation it would make a half parabola because the function is defined in such a way. Is this reasoning right? Because as far as I can remember we always wrote the value of a square root in ± form
It is perhaps a bit embarrassing that while doing higher-level math, I have forgot some more fundamental concepts. I would like to ask whether the square root of a number includes both the positive and the negative square roots. I know that for an equation $x^2 = 9$, the solution is $x = \pm 3$. But if simply given $\sqrt{9}$, does one assume that to mean only the positive root? And when simply talking about the square root of a number in general, would one be referring to both roots or just the positive one, when neither is specified?
I used Eevee. I only changed the Border Collision and Vorticity (followed YouTube tutorial).
(new to blender) i am trying to create a fluid sim in blender 2.83 but in my physics tab under domain there is no 'bake data' button in the options. It's there in all the tutorials i've watched but i dont seem to have it.
I have the following class structure: class X { // ... }; class Y : public X { // ... }; class IA { public: virtual void Foo(X* x) = 0; }; class A : public IA { public: void Foo(Y* y) { Foo(static_cast<X*>(y)); } }; class B : public A { public: virtual void Foo(X* x) override { // ... } }; However, this code generates compiler errors: error C2664: 'void A::Foo(Y *)': cannot convert argument 1 from 'X *' to 'Y *' The way to fix it is to replace A::Foo(Y*) with this: void Foo(Y* y) { static_cast<IA*>(this)->Foo(static_cast<X*>(y)); } I have trouble understanding why this cast is necessary, and would appreciate some insight. I'm not quite sure if this is guaranteed to be a safe cast either. To my understanding during overload resolution, the compiler should select the function that requires the least amount of implicit casting for the parameters. But that doesn't seem to be the case here.
I have a function with the same name, but with different signature in a base and derived classes. When I am trying to use the base class's function in another class that inherits from the derived, I receive an error. See the following code: class A { public: void foo(string s){}; }; class B : public A { public: int foo(int i){}; }; class C : public B { public: void bar() { string s; foo(s); } }; I receive the following error from the gcc compiler: In member function `void C::bar()': no matching function for call to `C::foo(std::string&)' candidates are: int B::foo(int) If I remove int foo(int i){}; from class B, or if I rename it from foo1, everything works fine. What's the problem with this?
This is the sentence: Out of these two what is the correct grammatical order to express the sentence. 1.) Watching cartoons, movies, dramas develop the human brain 2.) Watching cartoons, movies, dramas develops the human brain What is it? Develop or Develops?
Making adult decisions are/is really not fun. What is the proper answer and why? My gut says "is" but I can't explain why.
The code below will produce 8 due to the fact the second declaration will override the first one. Yup! Makes total sense. EXAMPLE 1 function foo(){ function bar() { return 3; } return bar(); function bar() { return 8; } } console.log(foo()); // ---> 8 The following code produces 3 which means that it is the first expression that is invoked. EXAMPLE 2 function foo(){ var bar = function() { return 3; }; return bar(); var bar = function() { return 8; }; } console.log(foo()); // ---> 3 I tend to conclude that in JavaScript, only the first declared variable is used as shown above. However, the code below produces 7 (hmmm... scratching my head) EXAMPLE 3 var a = 4; var a = 7; console.log(a); //---> 7 Eventually, I will be using let or const (to prevent declaring the same variable many times) to declare variables and not var but I'm trying to understand why the results produced in example 2 and 3 are so unpredictable. Thanks.
I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent. The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not. The two ways are: var functionOne = function() { // Some code }; function functionTwo() { // Some code } What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?
I would like to recognize a good answer giving away some points to the guy who answered. In this case I did a dumb and incorrect question and the guy foreseen why my question was incorrect and corrected it (curious guys ), but I already did this before some times. Correct me if I'm wrong, but I think that this is a somewhat common practice. The thing is that waiting for the bounty time and then one extra day to reward the answer takes... time. I know that the bounty time is to avoid giving bounty hastily, but many times the answer for a well-defined question is correct or wrong, no middle way. Plus, when using bounty hunter the way I'm doing, I don't want my question to have any extra attention. I just want to reward a guy. What about open the possibility to give away some extra bounty instantly for the accepted answer? Or even better, add a "reward" option, since it is semantically different from a bounty? Note that it has it value to SO too - I'm actually telling, judging by that answer, that this guy is X * 2 points more reliable then myself.
I was impressed by the effort that Ankur put into his answer to my question "", so I created a bounty so that I could award extra reputation as a way of thanking him for his help. As the reason for my bounty, I specified, "One or more of the answers is exemplary and worthy of an additional bounty": When I went to award the bounty, however, I noticed that I still have to wait 24 hours: Is this really necessary, seeing as how I started the bounty specifically to award it to an existing answer?
None of the objects I'm working with have a stroke on them, however all of them display an outline that shows up through other objects in illustrator. It looks as though I'm in preview mode with colors turned on? I can't figure out how to turn this setting off, help!
I am trying to make a circle with dash but there's a black line that wont go away. How do I fix this? I have looked through the appearances tab. I have also tried deleting that object then redoing it but, nothing has worked. It is one single image that has three strokes on it. It might just be a glitch in my program.
I understand that as the distance between the planet and the body increases, the gravity decreases, but how can they still just 'float away'?
Well, this question has been puzzling me for kinda long time, many people believe that orbiting astronauts feel weightless because they are "beyond the pull of Earth's gravity"...How far from the Earth would a spacecraft have to travel to be truly beyond the Earth's gravitational influence? If a spacecraft were really unaffected by Earth's gravity would it remain n orbit? If so, what is the real reason for weightlessness in orbit?
In Ubuntu desktop file manager, we can change background color by editing and changing the basecolor value from gtk.css file from the location /usr/share/themes/Greybird/gtk-3.0/gtk.css. Is any option available so that I can set an background image in Ubuntu file manager?
I want to change the background image in the Nautilus file browser. My idea is to put my own style in the background. I'm using Ubuntu 11.10 and Nautilus is version 3. I know that I have to change the nautilus.css file of the theme, but the problem is that there is not a parameter for the background. I just want to apply an image but I can't find the file or parameter to change it. The CSS file is in the directory /home/UserName/.theme/MyTheme/gtk-3.0/apps. I've changed the nautilus.css file. I wrote two new lines using CSS style but I don't know where the correct place is to put it. The lines are: background-image: url("carbon.jpg"); background-repeat: repeat; Obviously I put the image called carbon.jpg in the same directory of nautilus.css, but this change doesn't work because I need to know whichs class displays the Nautilus file browsing frame. If I find this class I guess that this code will work. If someone knows how to do it, please tell me because I really want to make this change.
I'm trying to concatenate a link in a javascript function with a php variable. But whatever a try to write after ""+ doesn't get displayed and the whole program stops working. The variable is defined in a different page. I tried REQUEST to access to it, but it's not working. function popupEvent(){ $('#btnClose').unbind("click"); $('#btnClose').click(function(){ window.location = SITEURL+"cart/rollPdf/?POrderNo="+implode(',', $orderIDArr); window.open(ord,'winname','directories=no,titlebar=no,toolbar=no,location=no,status=no,menubar=no,scrollbars=no,resizable=no,width=400,height=350'); return false }); }
What is the easiest way to encode a PHP string for output to a JavaScript variable? I have a PHP string which includes quotes and newlines. I need the contents of this string to be put into a JavaScript variable. Normally, I would just construct my JavaScript in a PHP file, à la: <script> var myvar = "<?php echo $myVarValue;?>"; </script> However, this doesn't work when $myVarValue contains quotes or newlines.
I started working on a new project, and I tried to render the scene, and I haven't changed any thing that I normally would, yet this time, instead of the rendering and the little orange squares rendering the image, there's nothing, its just a standard blank image that appears as soon as clicking render??? this really confused me, any help would be awesome. Thanks
A scene I made is not rendering, at all. This grey screen stays the same and nothing changes. Here are my settings: [
Exercise 3.2.2 Use the axiom of regularity and the singleton set axiom to show that if $A$ is a set then $A \notin A$. Axiom of Regularity: If $A$ is a non-empty set, then there is at least one element x of A which is either not a set, or is disjoint from A. Singleton Set Axiom: If $a$ is an object, then there exists a set $\{a\}$ whose only element is $a$, we refer to $\{a\}$ as the singleton set whose element is $a$ Furthermore, if $a$ and $b$ are objects, then there exists a set $\{a,b\}$ whose only elements are $a$ and $b$ I think I can give the proof when A is the non-empty set which contains finite elements. However, can anyone give any hint for the general case? Suppose $A \in A$ Then eixsts $x$ such that either $x$ is not a set or $x \cap A$=$\emptyset$ Then it is clear thar $x \ne A$ (if $x = A$, then $x \cap A \ne \emptyset$) We observe that as an element, $A$ $\ne$ $x$, $A$ $\in$ $A$ Then $A$ $\in$ $A-x$ Define the new set $A-x$ as $A_1$ then exists $x_1$ such that $A \in A_1-x_1$ After finite steps we find that $A \in \emptyset $ which leads to contradiction.
I am trying to understand How can a set contain itself? Can you show example of set which is not a set of all sets and it contains itself.
I have looked all over the place, but I have not found an answer to my question. First of all, I know that the symbol for decimal is %d, the symbol for octal is %o, and the symbol for hexadecimal is %x. What I cannot find, however, is the symbol for binary. I would appreciate any help.
I can print with printf as a hex or octal number. Is there a format tag to print as binary, or arbitrary base? I am running gcc. printf("%d %x %o\n", 10, 10, 10); //prints "10 A 12\n" print("%b\n", 10); // prints "%b\n"
Let $A$ and $B$ be two invertible $n\times n$ real matrices. Assume that $A+B$ is invertible. Show that $A^{-1} + B^{-1}$ is also invertible.
If $A$ and $B$ be two invertible $n \times n$ real matrices and $A + B$ is invertible, how to prove that $A^{-1} + B^{-1}$ is also invertible?
File struct Base| Foo | | Foo.hpp & Foo.cpp Bar | | Bar.hpp & Bar.cpp main.cpp & CMakeLists.txt Bar.hpp template <typename Ty> class Bar { public: float Value() const; }; Bar.cpp #include "Bar.hpp" template<typename Ty> float Bar<Ty>::Value() const { return 1234.0; } Foo.hpp #include "../Bar/Bar.hpp" class Foo : public Bar<int> { public: float Get() const; }; Foo.cpp #include "Foo.hpp" float Foo::Get() const { return Value(); } the main part of CMakeLists.txt add_library(Bar_lib Bar/Bar.cpp Bar/Bar.hpp) add_library(Foo_lib Foo/Foo.cpp Foo/Foo.hpp) target_link_libraries(Foo_lib Bar_lib) add_executable(testing main.cpp) target_link_libraries(testing Foo_lib) The main.cpp file just calls foo.Get(), and when I run cmake&make it gives /usr/bin/ld: libFoo_lib.a(Foo.cpp.o): in function `Foo::Get() const': Foo/Foo.cpp: undefined reference to `Bar<int>::Value() const' But when I put everything into main.cpp file, it will successfully compile. So I know it has something to do with make. My question is how can I modify the CMakeLists.txt or even the cpp file to get this thing run? I'm a noob in cmake, so I'm sorry if I asked a dumb question. Big thanks to every suggestion
Quote from : The only portable way of using templates at the moment is to implement them in header files by using inline functions. Why is this? (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)
How it should be: You click the Join banner button button. You get a confirmation Are you sure you want to join this community? Upon clicking Create Account, your account gets created, and you get redirected to the page you were on All of the above are working, except for the bold line, i.e. I'm being redirected to the site's front page. Example: EDIT: In regard to , this question is different. That one seems to be about the join this community button in the black SE bar, however, mine is about the Join button in the community banner. Also, as an additional note, the black join this community button . (ie. It redirects correctly) EDIT 2: Turns out it's pretty much the same problem, just a different way to get there. I make showing that problem. NOTE: This happens on every SE site - I've noticed it quite a few times. NOTE2: I'm using FF 44.0 at the moment.
On a Stack Exchange site, if you are viewing a question, and click Log In to take some action on that question, and you log in with valid Stack Exchange credentials (but there's a step that creates an account on that particular site), you are not redirected back to the page on which you clicked the Log In button, that motivated the account creation in the first place. Instead, it goes to a list of questions on that site, causing the user to lose easy access to what it is they wanted to do. Even the browser Back button doesn't get the user there for at least a few clicks, going through Document Expired and login pages again. Here's an example:
i got a problem with hashset, I cannot remove a hashset, and here is the code //take stopword list from file public void stopWordList(){ openFile("D:/ThesisWork/Perlengkapan/stopword.txt"); while(x.hasNext()){ String a = x.nextLine(); a = a.toLowerCase(); stopWords.add(a); } } //the method to remove stopword public void stopWordRemoval(){ stopWordList(); //if the word in the streams set is equal to stopword, it should be removed for(String word:streams){ for(String sw:stopWords){ if(word.equals(sw)){ streams.remove(word); } } } But, it gives me an exception, it says like : Exception in thread "main" java.util.ConcurentModificationException, could anyone help me? thanks :)
I am using a Collection (a HashMap used indirectly by the JPA, it so happens), but apparently randomly the code throws a ConcurrentModificationException. What is causing it and how do I fix this problem? By using some synchronization, perhaps? Here is the full stack-trace: Exception in thread "pool-1-thread-1" java.util.ConcurrentModificationException at java.util.HashMap$HashIterator.nextEntry(Unknown Source) at java.util.HashMap$ValueIterator.next(Unknown Source) at org.hibernate.collection.AbstractPersistentCollection$IteratorProxy.next(AbstractPersistentCollection.java:555) at org.hibernate.engine.Cascade.cascadeCollectionElements(Cascade.java:296) at org.hibernate.engine.Cascade.cascadeCollection(Cascade.java:242) at org.hibernate.engine.Cascade.cascadeAssociation(Cascade.java:219) at org.hibernate.engine.Cascade.cascadeProperty(Cascade.java:169) at org.hibernate.engine.Cascade.cascade(Cascade.java:130)
The logo for the blog in the sidebar is the same as the logo for Meta.SE (here): Please could a new logo be used here? While it isn't a massive issue, it does momentarily confuse me, and the blog is certainly different to Meta... Feel free to post your suggestions for a logo as an answer - but by no means will it be used - if the logo is even changed!
is used to host global Stack Exchange blog posts and is using favicon of Stack Exchange itself. All good. However, when published in the bulletin, the Meta Stack Exchange icon is used for some reason: Can it be changed please to using the "full" icon?
I have many animated objects with keyframes. I want to hide/ make visible all objects with one click or one keyframe? How I can do this? In previous versions, I could easily add a keyframe in outliner with shortcut key I but now I can't.
I have seen tutorials on the older Blender version to hide and unhide an object using keyframes. I haven't been successful in 2.8. I thought you could use collections to control this, but no luck. I basically want to control the visibility of an object and various parts of the timeline. What's the trick in 2.83. Thanks
I have a string which is a path and is a variable in which I have to save in my database. But the path is C:\foldera\folderb\folder1\folder2 and obviously I need it to be C:\\foldera\\folderb\\folder1\\folder2 for the insertion in database of mysql. Please help me find the solution. I tried str_replace but it won't work. Thanks in advance.
If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example: $unsafe_variable = $_POST['user_input']; mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')"); That's because the user can input something like value'); DROP TABLE table;--, and the query becomes: INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--') What can be done to prevent this from happening?
I know that it is a very old question but still I don't find any satisfactory solution for Achilles Paradox. Please explain me the fundamentals of Achilles paradox in terms of stage wise distance covered. Note that it is easily solvable in terms of time, but if you start analysing this event in terms of time, then there is not at all any paradox. So please explain in terms of stage wise distances only.
I know that it is a very old question but still I don't find any satisfactory solution for . Please explain me the fundamentals of Achilles paradox in terms of stage wise distance covered. Note that it is easily solvable in terms of time, but if you start analysing this event in terms of time, then there is not at all any paradox. So please explain in terms of stage wise distances only.
Yandex (the main Russian search engine) has a form where you can submit text here: If the text does not exist already, then yandex will treat this text as if it belongs to you. Our website, which produces weekly original content regularly uses this service. How do you achieve the same thing in Yahoo and Bing? () P.S. It does not need to appear at the top of SERPs, as long as the system somehow knows the author.
Let's say I prepared an article I wish to publish on my not so popular blog. But I am afraid that this article is so good that much more popular site will steal it and publish it on its own. I am guessing that because of low popularity of my blog, the Google would show links to the bad site instead of my own. Is there a way to prevent such outcome? What if I would prepare an article, publish it on my blog and later decide it it so good that I'll put it on Wikipedia, is there a way that Google would consider me above Wikipedia?
I'm new to Ubuntu and have no idea how the terminal works. My main issue is Steam not loading and it keeps telling me to upgrade my system from 32-bit to 64-bit, but how?
As per title, I wish to know if I can, after a successful 32bit setup and consequent software installations, update to a 64bit version. I know how to partition (actually one of the solutions is to set /, /etc, /home, /var/www, and /opt as separate partitions) and I know that a clean install is way better than a dirty one, yet I would like to know if/how it's possible to do that.
I recently got a pack of different value resistors, but some of them were zero ohms. Is there any purpose in using 0 ohm resistors?
I am new to PCB design and I noticed that some schematics use 0Ω or 100mΩ resistors. What is their purpose and why do we need to use them in our PCB design? Normally if we wish to probe how much current the load is taking, we put a jumper pin across the PCB trace (then measure current across the pin using a multimeter). Adding resistors for this purpose seems like it would waste a lot of PCB real-estate. Is this the sole reason why 100mΩ resistors are being placed (since I = V/0.1Ω) instead of a jumper pin? If so, is there any consideration we should take when placing such a mΩ resistor on board so it doesn't affect the signal or behaviour of the circuit?
ubuntu 18,10 no wifi? been trying to figure this out. would someone help me $ lspci 00:00.0 Host bridge: Intel Corporation Xeon E3-1200 v6/7th Gen Core Processor Host Bridge/DRAM Registers (rev 08) 00:02.0 VGA compatible controller: Intel Corporation UHD Graphics 620 (rev 07) 00:04.0 Signal processing controller: Intel Corporation Xeon E3-1200 v5/E3-1500 v5/6th Gen Core Processor Thermal Subsystem (rev 08) 00:08.0 System peripheral: Intel Corporation Xeon E3-1200 v5/v6 / E3-1500 v5 / 6th/7th Gen Core Processor Gaussian Mixture Model 00:14.0 USB controller: Intel Corporation Sunrise Point-LP USB 3.0 xHCI Controller (rev 21) 00:14.2 Signal processing controller: Intel Corporation Sunrise Point-LP Thermal subsystem (rev 21) 00:16.0 Communication controller: Intel Corporation Sunrise Point-LP CSME HECI #1 (rev 21) 00:17.0 RAID bus controller: Intel Corporation 82801 Mobile SATA Controller [RAID mode] (rev 21) 00:1c.0 PCI bridge: Intel Corporation Sunrise Point-LP PCI Express Root Port #5 (rev f1) 00:1c.5 PCI bridge: Intel Corporation Sunrise Point-LP PCI Express Root Port #6 (rev f1) 00:1f.0 ISA bridge: Intel Corporation Intel(R) 100 Series Chipset Family LPC Controller/eSPI Controller - 9D4E (rev 21) 00:1f.2 Memory controller: Intel Corporation Sunrise Point-LP PMC (rev 21) 00:1f.3 Audio device: Intel Corporation Sunrise Point-LP HD Audio (rev 21) 00:1f.4 SMBus: Intel Corporation Sunrise Point-LP SMBus (rev 21) 01:00.0 Ethernet controller: Realtek Semiconductor Co., Ltd. RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller (rev 15) 02:00.0 Network controller: Realtek Semiconductor Co., Ltd. Device d723
How do I install Wi-Fi drivers for Realtek RTL8723DE device in Ubuntu 16.04? lspci -v | grep -i network 02:00.0 Network controller: Realtek Semiconductor Co., Ltd. Device d723
public static void insertLogicHandler(List<Task> listNewTasks, Map<Id, Task> mapNewTasks, String context){ List<Task> listTasks = mapNewTasks.values(); Map<Id, Task> mapFlowTasks = new Map<Id, Task>(); //business logic to create sub-Maps that are passed into specific methods for(Task t: listTasks){ System.debug('#### in TaskTrigger_Handler.insertLogicHandler for loop'); if(t.WhoId != null && t.Type != 'Campaign Email'){ mapFlowTasks.put(t.Id, t);//This line is not covering } } I have created the task dummy records ,while assigning who id as contact.id,I'm encountering flow exception.Could anyone help me with covering the Map?
This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, including more unit test resources, navigate to the tag. This canonical question is intended to address several classes of common questions by providing a quick summary and links to comprehensive resources: How is code coverage obtained and calculated? How do I increase my coverage? Why can't I cover these lines? Why isn't the body of my loop or conditional statement covered?
Let $\sigma\in S_n$ . Describe the centralizer of $\sigma$. Thought: If I conjugate $\sigma$, then $\tau^{-1}\sigma\tau=\sigma.$ This means that $\tau$ is a power of $\sigma,$ and $<\sigma>\subseteq C_{S_n}(\sigma).$ What should I do after? I guess I just want to know what are the elements that commute with $\sigma$.
It is known that any two disjoint cycles in $S_n$ commutes. Therefore, any $\pi\in S_n$ which is disjoint with $\sigma$ is in the centralizer of $\sigma$: $C_{S_n}(\sigma)$. Also $$ \sigma^i\pi\in C_{S_n}(\sigma), 0\leq i\leq|\sigma|. \tag{*} $$ Here are my questions: Are these all the elements in $C_{S_n}(\sigma)$? If the answer is no, is there an method to find all the elements in $C_{S_n}(\sigma)$ other than check the elements one by one? A quick search returns several relevant questions: The method ($*$) is what I learned so far from these questions and their answers. An immediate example in which ($*$) does not work that I can come up with is $\sigma=(12)(34)(56)$ in $S_6$. No disjoint $\pi$ can be found in this case and $$\langle(12),(34),(56)\rangle\subset C_{S_6}(\sigma).$$
I split this off from this question: at the recommendation of comments there because the Cleric's Ritual Caster class feature could have an effect on the answer. Say I have a Cleric that takes the Ritual Caster feat. Do the spells learned from the feat have to be prepared by the Cleric before being cast as a ritual or do they always have the spells available to cast as a ritual? My confusion stems from the fact that most of the mechanics from the Ritual Caster feat seems to mirror the way a Wizards casts spells. Wizards are the only class that are specifically allowed to cast spells as a ritual without preparation by default. However, nothing in the feat actually describes that it works the same as Wizard ritual casting or different from it. On top of that, the Cleric Ritual Caster class feature says that ritual spells do have to be prepared.
Say I have a Warlock that takes the Ritual Caster feat. Do the spells learned from the feat have to be prepared by the Warlock before being cast as a ritual or do they always have the spells available to cast as a ritual? My confusion stems from the fact that most of the mechanics from the Ritual Caster feat seems to mirror the way a Wizard casts spells. Wizards are the only class that are specifically allowed to cast spells as a ritual without preparation by default. However, nothing in the feat actually describes that it works the same as Wizard ritual casting or different from it.
In a first course on quantum mechanics, everybody learns some version of the following statement: Postulate: To every classical observable $A$ of a physical system, there corresponds a Hermitian operator $\hat{A}$ such that a measurement of $A$ performed on a system in state $|\psi\rangle$ is expected (in the probabilistic sense) to return $\langle \psi | A\psi \rangle$. Possible outcomes of the measurement correspond to eigenvalues of $A$... One then learns that $\hat{x} = x$ is the operator corresponding to position, $\hat{p} = -i\hbar\frac{\partial}{\partial x}$ is the operator corresponding to momentum, and from these, one can construct the operators for the kinetic and potential energies, angular momenta, etc. But what happens if we want to find the operator corresponding to some more complicated classical observable, say, $$ A = \frac{e^{\sin(x^2 p)}}{x+xp} + \cos\left(\frac{p}{x}\right)? $$ (Assume here that we've scaled $x$ and $p$ by some characteristic length and momentum, so that they become dimensionless.) Granted, this bizarre quantity might not have a compelling physical interpretation, but it is still in principle a classical observable, that can be computed with knowledge of $x$ and $p$. It seems to me that if we are to take this postulate seriously, there ought to be a well-defined procedure that associates to any function of $(x,p)$ a Hermitian operator acting on the appropriate Hilbert space. What is this procedure? More generally, if we have some classical system $S$ with configuration manifold $M$, it seems to me that any real-valued function $f: T^*\!M \to \mathbb{R}$ on the phase space of $S$ (i.e., cotangent bundle of $M$) defines (in principle) a classically observable quantity. (Or does $f$ need to be continuous/smooth?) Quantum mechanics ought to prescribe a mechanism that associates to any such $f$ some Hermitian operator $\hat{f}: L^2(M) \to L^2(M)$. What is this mechanism, and how does it work in general?
Okay, I know that in quantum mechanics the quantum observable is obtained from the classical observable by the prescription $$ X \rightarrow x,\quad P \rightarrow -i\hbar\frac{\partial}{\partial x} $$ in the position basis. Now my questions are: What if $x$ or $p$ appears in the denominator in a classical expression? How to promote this to a quantum expression? What would be the meaning of division by an operator? My expression likely contains a mixture of $x$ and $p$. For e.g., it could contain terms like $$\frac{p}{x^2}$$ or $$\frac{xp}{(x^2 + a^2)^{3/2}}.$$ How to resolve products of non-commuting operators like $x$, $p$ in a satisfactory way?
Output of lshw -C network: *-network UNCLAIMED description: Ethernet controller product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller vendor: Realtek Semiconductor Co., Ltd. physical id: 0 bus info: pci@0000:02:00.0 version: 15 width: 64 bits clock: 33MHz capabilities: pm msi pciexpress msix bus_master cap_list configuration: latency=0 resources: ioport:4000(size=256) memory:b1104000-b1104fff memory:b1100000-b1103fff *-network DISABLED description: Wireless interface product: Realtek Semiconductor Co., Ltd. vendor: Realtek Semiconductor Co., Ltd. physical id: 0 bus info: pci@0000:03:00.0 logical name: wlo1 version: 00 serial: f8:da:0c:00:cc:2b width: 64 bits clock: 33MHz capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless configuration: broadcast=yes driver=rtl8723de driverversion=4.15.0-38-generic firmware=N/A latency=0 link=no multicast=yes wireless=IEEE 802.11 resources: irq:131 ioport:3000(size=256) memory:b1000000-b100ffff *-network description: Ethernet interface physical id: 3 logical name: enp0s20f0u3 serial: ca:36:16:27:bf:5f capabilities: ethernet physical configuration: broadcast=yes driver=rndis_host driverversion=22-Aug-2005 firmware=RNDIS device ip=192.168.42.112 link=yes multicast=yes A link to WiFi details:
How do I install Wi-Fi drivers for Realtek RTL8723DE device in Ubuntu 16.04? lspci -v | grep -i network 02:00.0 Network controller: Realtek Semiconductor Co., Ltd. Device d723
I'm using latex template for asme conferences. The asmems4 style is used for references. The last reference gets misaligned as in figure. It does not matter what the last reference is. If I add another reference below it, the last one goes bad while the second last one, which was last previously, aligned itself. Please suggest what might be the problem.
I have added a reference in my latex template. The problem is shown in a picture below If you see the last reference, it goes a bit leftwards. I have found that it appears only for the last reference, whichever, reference comes last. I think it is a possible template issue. here is MWE \documentclass{fcs} \usepackage{bm} \volumn{ } \doi{ } \articletype{REVIEW~ARTICLE} \copynote{{\copyright} Higher Education Press and Springer-Verlag Berlin Heidelberg 2012} \ratime{Received month dd, yyyy; accepted month dd, yyyy} \email{$\times\times\times\times@\times\times\times.\times\times\times$} \title{$\bm{Frontiers~ of~ Computer~ Science}$\\[2mm] Instruction for authors} \author{Firstname LASTNAME \xff $^{1,2}$} \address{{1\quad Higher Education Press, Beijing 100029, China}\\ {2\quad Acadcmic Journal Division, Beijing 100029, China}} \markboth{Front. Comput. Sci.}{Firstname LASTNAME: please insert running head here} \begin{document} \maketitle \setcounter{page}{1} \setlength{\baselineskip}{14pt} \begin{abstract} A short abstract of up to 300 words written in one paragraph, clearly indicating the object and scope of the paper as well as the results achieved, should appear on the first page. It should be written using the abstract environment. \end{abstract} \Keywords{Up to 8 words separated by commas.} \section{Introduction} \noindent Frontiers of Computer Science is an international peer-reviewed academic journal sponsored by the Ministry of Education of China. The journal is jointly published by Higher Education Press of China and Springer on a bimonthly basis in English. Online versions are available through both http://www.springerlink.com/content/11704 and http://journal.hep.com.cn/fcs. In-text citations must agree with the references in either numbering or names and year. The references should be presented completely and without mistakes, and should be the original publication. We use the citation-sequence system, that is to number the citations according to sequence of their first appearance. Journal names should be spelled out in full. Examples are given in \cite{KargerD,Mastroianni,SchlessingerD,ZhugeH}. \Acknowledgements{The ``Acknowledgement section'' is the general term for the list of contributions etc} \begin{thebibliography}{99} \bibitem{Mastroianni} Verta O. Mastroianni C, Talia D. A super-peer model for resource discovery services in large-scale grids. Future Generation Computer Systems, 2005, 21(8): 1235--1248 \bibitem{ZhugeH} Zhuge H. The Knowledge Grid. Singapore: World Scientific Publishing Co., 2004 \bibitem{SchlessingerD} Schlessinger D. Schaechter M. Bacterial toxins. In: Schaechter M, Medoff G, Eisenstein BI, eds. Mechanisms of microbial disease. 2nd ed. Baltimore: Williams and Wilkins, 1993, 162--175 \bibitem{KargerD} Karger D. Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In: Proceedings of Sixteenth Annual ACM Symposium on Parallelism in Algorithm and Architectures. 2004, 36--40 \end{thebibliography} %% \Biography{#1}{#2} %% #1 is the file name of photo, %% #2 is author's biography \Biography{fcs-2}{Please provide each author's biography here with no more than 120 words. The photo can be informal. Our journal prefers to exhibit an encouraging atmosphere. Please use a one that best suits our journal.} \end{document} It also appears in following cases 1) if no biography 2) even if the bbibliograhy is added in this way \bibliographystyle{unsrt} \bibliography{oo} What I understand after lot of R & D is that perhaps its a templates issue. Any way to solve it. Here is the screenshot Whatever the end line is, either a biography or a reference, this problem appears. The FCS latex template could be downloaded at following URL:
I have had my bone weighting fail before however all the solutions I have do not work for this mesh I have removed doubles separated loose parts and recalculated the faces. I don't understand why it cannot be weighted it is a regular Female character I have the model here ( Can someone help me understand what the problem is so that I can deal with this if it happens again.
I have a model which have meshes that are not aligned at x axis. When I try to use automatic weight for connecting bones to meshes, I get "Bone heat weighting: failed to find solution for one or more bones" error. If I align bones to x axis, automatic heat weighting works but it is not suitable for my model. I deleted all double vertices. And there are no open surface. Do you have any suggestion?
I'm making a beamer template, and I have most of the things the CD requires done, but I can't seem to be able to influence how the TOC looks like. This is how it is supposed to look like: (But the LaTeX-Beamer version should have enumeration, rather than bullets.) I tried \setbeamercolor{section in toc} and its subsections but that changes the colour of both the text and the enumeration. Most importantly, I have no clue how to get the grey box done.
How can I create a fancy-looking table of contents for a Beamer presentation? \documentclass{beamer} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \begin{document} \frame{ \tableofcontents } \section{Foo bar} \frame{} \section{Foo bar} \frame{} \section{Foo bar} \frame{} \section{Foo bar} \frame{} \section{Foo bar} \frame{} \section{Foo bar} \frame{} \section{Foo bar} \frame{} \end{document}
when i was using windows 7 there is an application called "free make video downloader".We can download any video through this. I would like to know is there any video downloader like this. When i search through internet i found many application to download youtube video and all. But it is not supporting to other sites like videos in facebook and all guys pls help me to find a solution for this
I have read but please hear me out. I use Ubuntu 10.04 LTS (32-bit) and I didn't bother to install the Flash plugin for Firefox as I am using a netbook and sometimes Flash caused firefox to crash. What I would like to ask is if I had the link to the video, is there some way I can download it and watch it offline (via VLC) so that I don't need to install Flash plugin? Command line or GUI techniques is welcome. Based on what I have read, using the /tmp technique requires Flash plugin to be installed and the video to be loaded before I can go scavenge it in the said directory. Note that I also want to dload videos from site aside from youtube.
Would it be possible to add an option to the edit control (used to write questions/answers) to indent the line by 4 spaces. I find myself using 4-space indentation quite often to format the code and counting spaces all the time is a bit tedious. I would like this to work any number of times, ie. you would press the button twice to get 8 spaces, 3 times to get 12, etc. It would be also good to have the reverse option of moving the indentation to the left by 4 spaces. I know that any form of automated formatting was already discussed and is hard to do but that feature would at least allow some quicker editing. I hope this is not a duplicate, I tried to search for previous questions but couldn't find anything.
These should work by adding spaces or removing spaces from the beginning of the current line or every line between the start and end of a text selection (inclusive). (edited this question to supplement )
About 10 months ago, I submitted one little article to a journal and six months ago I received the acceptance. I uploaded the latex file and since then I didn't hear anything about it being published. Today it appeared a new issue of the journal so I must wait at least another 3 months. This will be my first published article and I started to become a little nervous about it. Can you tell me if something happened, like editor's changing his mind or delaying because they consider it less valuable than other submissions? Should I contact my editor about this?
What steps does a manuscript typically go through from submission to publication (or rejection) in a typical journal? How are these steps referred to, in particular by editorial systems, and how long do they each typically take? Note that this question is about the typical situation and hence not about: Journals with an atypical workflow, e.g. those that allow for an instantaneous reviewer–author interaction. Exceptional steps or rare occurrences such as withdrawal or . This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.
When inserting a link via the SE editor it happens a lot that a broken link is generated. This seems to happen because a link is selected as text and pasted into the box. The result is a generated http://%20https: Reason: If the selection contained a leading space, the editor assumes to insert http:// would be the right thing to do. It is often not. This space is very hard to make out in the box, and the generated link is inserted at the bottom of the editor window, often out of sight. Since the resulting construct is senseless and uniform, please add a logic that either strips out this leading space in hyperlinks or checks for the presence of http://%20https: and deals with it.
When you paste a link into the "Insert Hyperlink" box, it adds it automatically as a citation link: [Example 1][1] [1]: http://example.com But when you paste a link starting with a space , it tries to URL encode it, to change the space to %20, and then sticks a http:// on the front to make it a valid link: [Example 2][2] [2]: http://%20http://example.com This, however, means the link doesn't work. Please could leading whitespace be stripped from the URL?
Is the singular or plural form of a property required when describing an object which has a count of N for that property? For example, a two-mode or a two-modes analog filter?
Why are year, pound and mile in the singular form in the phrases below? five-year-old children 20 pound note 10 mile run Is that because they're acting as adjectives, which are always invariable in English? Is it incorrect to say... five-years-old children? 20 pounds note? 10 miles run?
Is there a way to hide questions in Hot Network Questions based on the community? I know I can do it by tag so I am hoping there is a way to do it by community such as a generic tag that represents everything in that community. For instance, I would like to hide anything from role playing games.
I was going to make a filter for the "" by excluding some sites from it. I noticed which talks about "negative filtering" but does not explain how one can do it or if it is possible. There does not seem to be a way to do this, though. On the filter page, my only options are: So how can I do "All sites except [list]"? It would also be nice if this could include similar functionality with the meta checkbox. Something like "All main & meta sites except..."
On Ubuntu 14.04: $ sudo apt-get install xsane Reading package lists... Done Building dependency tree Reading state information... Done The following extra packages will be installed: gimp gimp-data libamd2.3.1 libbabl-0.1-0 libcamd2.3.1 libccolamd2.8.0 libcholmod2.1.2 libgegl-0.2-0 libgimp2.0 liblcms1 libmng2 libumfpack5.6.2 xsane-common Suggested packages: gimp-help-en gimp-help gimp-data-extras liblcms-utils hylafax-client mgetty-fax gv gocr The following NEW packages will be installed: gimp gimp-data libamd2.3.1 libbabl-0.1-0 libcamd2.3.1 libccolamd2.8.0 libcholmod2.1.2 libgegl-0.2-0 libgimp2.0 liblcms1 libmng2 libumfpack5.6.2 xsane xsane-common 0 upgraded, 14 newly installed, 0 to remove and 3 not upgraded. Need to get 10.0 MB of archives. After this operation, 44.1 MB of additional disk space will be used. Why does it want to install gimp as a dependency? So far, I've always been able to use xsane standalone? I certainly doubt gimp is required for xsane to run - so how can I install xsane alone without gimp? EDIT: The weird thing is that here: , gimp is listed with blue as "suggests", and shouldn't "suggestions" be ignored by default?
I use Ubuntu 12.04 64-bit, I did the following: sudo gedit /etc/apt/apt.conf and added APT::Install-Recommends "false"; APT::Install-Suggests "false"; But it did not work. When I try to install a package, it still wants to install the suggested and recommended packages. How can I solve this?
I have a a form where a user can make a simple multiplication of two fields. The outcome of the equation is then placed in another input field using jquery. quantity = Number($('#quantity').val()); price = Number($('#price').val()); subtotal = quantity * price; and $("input#subtotal").val(subtotal); But...The numbers do not add up!! I'm getting very strange answers with long decimals behind the comma. When running my console: console.log(subtotal, price+ "x" + quantity + "=" + subtotal); it literally states: --> 1.07 x 1001 = 1071.0700000000002 What is the best solution here?
Consider the following code: 0.1 + 0.2 == 0.3 -> false 0.1 + 0.2 -> 0.30000000000000004 Why do these inaccuracies happen?
"But what about Sir Isaac Newton, who some contend was autistic?” I may not get this. I may get here and there complete sentences may not contain subject verb object. I think they got to contain subject (intransitive) verb? In But what about Sir Isaac Newton, who some contend was autistic? there seems no main clause, no subject (intransitive verb) bit. May this seem like a complete sentence maybe a complete interrogative(?) not containing a main clause or complete sentence bit(?) (subject intransitive verb[?])?
Amy: What day is it today? Tom: It's Monday. Hmm... I like Monday. Amy: What do you have today? Tom: We have math, science and art.What about you? Amy: We have English and P.E. What do you have tomorrow? Tom: We have art and P.E.tomorrow. Amy: Oh, great. I can understand that "What about you" means "What do you have today?" But I wonder whether "What about you" is an elliptical sentence. If it is, what is the full sentence? If it isn't, how to parse this structure?
I have seen on the site, but that was kind of different in its essence — it was aimed at asking the solution of a particular problem, while I am having trouble conceptualizing the idea of Work. Here's my understanding — If I push a wall, it doesn't move. There is no displacement; but I DO lose some energy — a force will be applied. The wall does not move because the force that is applied is not sufficient to overcome the 'adhesive' or 'structural' forces there are at the edges of the wall and keep the wall joined to the house. Had they (and friction) not been there, the wall would have moved (though slightly). Does it not then follow that I am indeed doing work on the wall, but it simply doesn't move because other forces are doing work on it too, and my work is not enough to overcome them? It would then be reasonable to say that no net work is being done on the wall, but I see everyone saying that I, for myself, will not be doing any work at all because I will not be displacing the wall, in such a scenario. What's wrong with my understanding?
I read the definition of as $$W ~=~ \vec{F} \cdot \vec{d}$$ $$\text{ Work = (Force) $\cdot$ (Distance)}.$$ If a book is there on the table, no work is done as no distance is covered. If I hold up a book in my hand and my arm is stretched, if no work is being done, where is my energy going?
I realized that speed of my CPU is not constant even if it compute massively. The speed wanders from ~4,2 to ~4,4GHz in task manager. Why? I have two theorem: This is an average speed, and even during massive CPU usage there are time slots, where we wait for memory/IO, and the speed jumps back to base speed for a while. The CPU main clock generated with error (jitter/wander), while the measurement using a high precise clock. Other...? I use Win10
I just got a new Intel CPU, and the specifications say 3.5GHz but with turbo boost to 3.9GHz. What does Intel Turbo Boost do? From the description it sounds like they are saying "The road's speed limit is 100 km/hr, but if you get to that speed then the new speed limit is 140 km/hr". Why not just set the clock speed to 3.9GHz to start with? So what is Intel Turbo Boost actually doing?
How do you get the size this object? I want to loop through each object within the parent object.
I have a JavaScript object. Is there a built-in or accepted best practice way to get the length of this object? const myObject = new Object(); myObject["firstname"] = "Gareth"; myObject["lastname"] = "Simpson"; myObject["age"] = 21;
Using ubuntu 18.04lts here and trying to hookup a HP 9015 printer but not getting any results using USB cable. have tried downloading HP 3.19.3 driver but it comes up with an error all the time. Am lost on what to try next? Gary
Let's assume that one has some HP printer and/or scanner and checked its support status on the corresponding page of HPLIP site - . So one have the following information: the device Model name, Min. HPLIP Version and Driver Plug-in need. What should one install to make Ubuntu fully support the HP printer and/or scanner?
Premiss I have just built my first desktop PC and it has been a lot of fun, but the instant I tried to use Windows for coding I noticed I needed a *nix system. I was on a Macbook before and it worked well for what I needed, now it's time to switch to Linux for the main coding system, I'll not abandon macOS entirely of course, but the aim is to limit its use as much as I can. So keep this in mind, I'm a noob and I'm starting now with Linux :D Where I would like to install Ubuntu on the 3rd SSD, my sistem is and I have Windows on the NVMe and a 2TB SATA for everything else. I found a 128GB SATA SSD laying around and so decided to use it for Linux and start this adventure! Anyway, I'm making this question to be sure I do everything right since I did not had a great experience while installing Windows, is basically spreaded boot files around in the 2 SSDs randomly even tho I specifically selected the NVMe, fortunately I did notice it fast enough and didn't do much work, I proceeded to disconnect the SATA and install Windows on the NVMe (only one connected). I think Linux is a bit cleaner but I wan to be sure. What I know I downlaoded the ISO for the LTS version on the official website, if it works like Windows I would be able to burn it with Rufus on a 4GB usb stick and just reboot my system to get the prompt to install Ubuntu where I like. I can use the SSD MBR or GPT, since I never really got advantage on one or the other. What did I get wrong and what should I do? Watching video and reading guides, there seems to be a lot of options to do this, and for a noob like me it started to be confusing. Should I just disconnect the other SSDs to be sure and boot the PC only with the USB and the 128GB SSD connected? The SATA is pretty easy to disconnect, a bit more work will be needed for me to disconnect the NVMe tho... Main questions GPT or MBR? Does it depend on my other SSDs? If so why? Will I have to pollute other SSDs in the process? (2.1) Can I make a clean install on just ONE single SSD? I am confused about the partitioning, how much and why, location, ... I am confused about the boot, why people select Windows Boot if I'm installing Linux on a separate SSD? What is your advice and which method should I use? Any tip is appreciated! :D Thanks!
I have 2 1tb hard drives on my computer with Windows 8 on the first hard drive and nothing on the other. I want to install Ubuntu 14 on the second hard drive. I've looked up some guides and they all say to install Ubuntu on the sdb partition when booting off a usb stick. I have also seen some say to unplug the Windows HDD and then install Ubuntu onto the second HDD, and Ubuntu will automatically detect Windows and ask what you want to boot into upon boot. I am really concerned about this - Will it ask me to choose what OS I want to boot into? Is there something like rEFInd(Mac) for Windows? Can anyone please give me a guide on how to do it without ruining my computer? Thanks
I am looking for an example of an injective ring homomorphism $\phi\colon A\to B$ such that the following holds: there exists a prime ideal $\frak q$ of $B$ such that $\phi^{-1}(\frak q) = \frak p$, and the induced map $A_{\frak p} \to B_{\frak q}$ is not injective. The algebro-geometric picture should be clear: if we put $X = \mathrm{Spec\, A}$ and $Y = \mathrm{Spec\, B}$, then $\phi$ induces a morphism $(\psi,\theta)\colon Y\to X$ of affine schemes with $\psi(\frak q) = \frak p$. The map $A_{\frak p} \to B_{\frak q}$ corresponds to the induced map on the level of stalks at $\frak q$ of the morphism of sheaves $\theta^\sharp \colon \psi^* \mathcal O_X \to \mathcal O_Y$ [I have used the notation from EGA I].
Let $R\subset T$ be two commutative rings, and $T$ is integral over $R$. Let $\mathfrak m\in \operatorname{Max} R,\mathfrak n\in\operatorname{Max}T$ such that $\mathfrak m=\mathfrak n\cap R$. Show that $R_\mathfrak m\subset T_\mathfrak n$, i.e. the canonical map $\{\frac ru\mid r\in R,u\in R\setminus\mathfrak m\}\to\{\frac tv\mid t\in T,v\in T\setminus\mathfrak n\}$ must be an injection. I feel confused because the exercise 4 from Chapter 5 in the book of Atiyah and Macdonald just assume that the localization is a ring extension. And I don't know if the condition "integral over" is necessary.
I was shocked to find that the area of parallelogram in two dimensions can be found by cross multiplying two adjacent vectors. I understand that in three dimensions the area of parallelogram is the cross product of two adjacent vectors $$|a \times b|$$ but no text books have explained why in two dimensions cross product of two adjacent vectors are the area of a parallogram. Could someone explain?
I tried looking it up but many websites just state it without proof and without intuition. I'm hoping to learn it a little bit better so that I don't forget how to compute the Jacobian when working with surface integrals where the divergence theorem is not applicable. If you have a good online reference instead, please feel free to provide it :-) Thanks,
This question is an additional question to the given posted here: Let $X, Y$ be independent $N(0,1)$ and let $M=Max(X,Y)$. In the previous problem, what was being asked was the covariance between $M$ and $m=Min(X,Y)$. My question is what if the only requirement is to find $E(M)$? Is it necessary to define $Min(X,Y)$ and use it to eventually solve for $E(M)$?
Let $X$ and $Y$ be iid $\sim Normal(0,1)$ Let $A=max(X,Y)$ and $B=min(X,Y)$ What are $Var(A)$ and $Var(B)$? From simulation, I get $Var(A)=Var(B)$ approximately 0.70. How do I get this analytically?
I have a dedicated server which hosts game servers, and is vulnerable to DDoS attacks. I want to get a DDoS-protected VPS to act as a reverse proxy for UDP. The dedicated server's IP address is 7.7.7.7 and the VPS's IP address is 9.9.9.9. The whole idea is to hide the 7.7.7.7 address, so that it's not visible to the public when connecting to my game servers. When players connect, they should be sending packets to 9.9.9.9 and receiving packets from 9.9.9.9. If 7.7.7.7 was visible, hackers could directly attack it and bypass my reverse proxy. I don't want to "route" the UDP packets. I don't care if all the players will come from the same IP address. Is there any way I can do this on Linux? If so, what commands?
I have a server running UDP server on port 50000. This server receives updates from clients, and pings back the clients every 5 seconds to the socket they were connected from. Now I want to redirect all the traffic to and from this UDP server via another server. Basically I want to setup a transparent proxy in front of this server. The reason is that I want to be able to easily control which server handles the UDP traffic, without the need to change DNS settings. At first I tried usingn socat to create this proxy: socat UDP-LISTEN:50000,fork UDP:myserver:50000 But this seems to work well for incoming traffic, but back traffic from my server to the clients doesn't reach its destination. Also it seems that socat forks another process for each connection, so I might end up with too many processes and also dead processes when clients disconnect/switch IP. I realized that I can use iptables NAT functionality for this, but it doesn't seem to work for me. The configuration I've tried is: sudo iptables -t nat -A PREROUTING -p udp --dport 50000 -j DNAT --to-destination myserver:50000 But it doesn't seem to work -- I don't even see the connections on my server. I'm not sure if it's due to wrong configuration or due to some other issues. Some questions: Do I need to somehow restart iptables once I add the nat configuration? Do I need to allow traffic to the incoming port or having the NAT setting is enough? UPDATE: The server that actually handles the traffic is on a different machine than the one that I'm trying to setup iptables on.
$(-1)^3 = (-1)^{6/2} = ((-1)^6)^{1/2} = 1^{1/2} = 1$ So it comes $(-1)^3 = 1$ can anybody explain where exactly the mistake in calculation?
I know there is something wrong with this but I don't know where. It's some kind of a math fallacy and it is driving me crazy. Here it is: $$-1= (-1)^3 = (-1)^{6/2} = \sqrt{(-1)^6}= 1?$$
I want two dates. 1) Current date in MM/dd/yy format 2) Modified date which will be the adition of five business days(Mon-Fri) to current date and it should be in MMM dd, yyyy format. So if my current is 9th june than currentDate should be 06/09/14 and modifiedDate should be Jun 13, 2014. How to do this?
I'm working with a date in this format: yyyy-mm-dd. How can I increment this date by one day?
I have the following markup: <div class="wrapper"> <div class="block new-block"></div> <div class="block used-block"></div> <div class="block service-block"></div> <div class="block certified-block"></div> <div class="block offer-type-block"></div> </div> And the following css with it: .wrapper { width : 800px; height : 100px; background : #393533; margin : auto; } .block { width : 19%; height : 80px; background : salmon; display : inline-block; } I want to center the inner 5 divs horizontally and vertically in the container wrapper container, how can I achieve this using css. Thanks ahead!
I want to center a div vertically with CSS. I don't want tables or JavaScript, but only pure CSS. I found some solutions, but all of them are missing Internet Explorer 6 support. <body> <div>Div to be aligned vertically</div> </body> How can I center a div vertically in all major browsers, including Internet Explorer 6?
e= appears to be defined as the sum of the series 1/n! as n goes from zero to infinity. But this implies that the first term is 1/0! which appears to violate the rule against division by zero
How can I prove from first principles that $0!$ is equal to $1$?
I would like to remove the title from rendering in the natural taxonomy page template so that I can add it in the teaser and reorder the fields. Currently, the title shows first, and then the other fields in the teaser display. When I view the "Manage Display" for the teaser view mode, the title field is "hidden" and if I show it, it ends up appearing twice. I would like to unhide it, define a specific class reorder the fields. Can this be done without an added module? I have already played around with taxonomy view but am asking for an alternative that doesn't require using the taxonomy view, which I have disabled for the time being. E.g. If I need to edit the template, which template would it be and what specific way does it need to be edited to remove the title? My site is complex with a bootstrap theme and a sub-theme that I purchased as well as my custom modifications. See screenshots below for a visual. Teaser with title hidden Shows title at the top without defined class Teaser with title shown and class defined Shows title twice I want to make the one at the top go away or show it where the other one is with the proper class. Bonus: I really want to add author and date information like in the screenshot below to the taxonomy template, which I pulled from my taxonomy view version before I disabled it.
I need to create only one tpl.php file for all taxonomy terms in my website. I know taxonomy_term_page.tpl.php will do the required function in Drupal6. For drupal 7 I had override the taxonomy-term.tpl.php. I see all the nodes associated to a term, is displayed at the last. How can I hide those nodes?
I am searching for a tight lower bound (or a condition) for the number of edges of a graph with $n$ vertices such that if $E>lower bound$ (or another condition) holds then the graph always contains a square ($C_4$). I would also appreciate a proof or a reference for the proof. Thanks a lot in advance!
Square free graph : Graphs with minimum cycle length greater than 4. Question : What is the maximum number of edges possible for a square free graph $G(V,E)$ given that $|V|$ = n. Is it of the order $O(n^2)$? How does the answer change if max_degree(G) = d ($>1$)? EDIT: Out of curiosity, what is the maximum number of edges with $n$ vertices, when we limit the of the graph to $l$. Thanks in advance!
This is a question, that came up whilst working on a scientific representation of a cell membrane. In the following image you can see the particle system applied to a plane: What I now want to do is to apply that particle system to a cylinder or circular object, which will show the cross-section of a vesicle. The particles should therefore all face outwards from the origin point of the circle. In the Rotation menu of the particle system there is no option for the particle to be orientated 90° away from the surface. Here is a bad sketch of how it should look. Q: How can I orient particles on a round object?
I want to replicate a protein structure around an icosahedron. Basically a vesicle of protein structure is what we want: When I am instancing the protein structure using each vertex of the icosahedron it looks like: However, the tails are supposed to be directed towards the center. How can I make that work?
It has been pointed out to me that a female wanting to visit a male friend in Canada has to have at least $3,600.00 Canadian funds for a maximum visit of 90 days, plus they have to get a visitors visa from the federal migration service and now the bank and bailiff department can stop a person from leaving or getting their visa if they have a mortgage. what is happening to our world. Could anyone knowing that could clarify this I would appreciate. Thanks , Ray.
On Travel.SE we often see questions about a person (usually a love interest) asking for money to pay for airfare, visas, permits and other expenses. For example What general advice can be given in such situations to the person asking the question? Is it all a scam or can there be legitimate situations in which an online friend could be asking for money?
Trying to continue iterating if (str1Number == str2Number), but the loop stops after incrementing the i variable String getOldestVersion (String str1, String str2) { String[] str1Arr = str1.split("\\."); String[] str2Arr = str2.split("\\."); String result = ""; int str1Number = 0; int str2Number = 0; for (int i = 0; i < str1Arr.length-1; i++) { str1Number = Integer.valueOf(str1Arr[i]); str2Number = Integer.valueOf(str2Arr[i]); if (str1Number > str2Number) { result = str1; break; } else if (str1Number == str2Number) { i++; continue; } else { result = str2; break; } } return (result); }
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?
$ \sigma _{H}\sigma _{Q}\geqslant \frac{h}{4\pi }\frac{d\left \langle Q \right \rangle}{dt}$ $\Delta E = \sigma _{H}$ $\Delta t = \frac{\sigma _{Q}}{d\left \langle Q \right \rangle / dt}$ $\Delta E \Delta t \geq \frac{h}{4\pi }$ Q is any observable I know that $\Delta E$ represents the standard deviation of energy distribution, but what does $\Delta t$ represent precisely? I read an answer saying "It is the average time of the expectation value to change by one standard deviation, but I don't understand this sentence, I need some clarification.
In non-relativistic QM, the $\Delta E$ in the time-energy uncertainty principle is the limiting standard deviation of the set of energy measurements of $n$ identically prepared systems as $n$ goes to infinity. What does the $\Delta t$ mean, since $t$ is not even an observable?
Let me explain my problem. On my site, currently my emojis are well displayed, however, on the future version I'm developing, there are the "?" problems when I use the same database (with utf8mb4_general_ci). Is there a PHP alternative to debug this? Thanks,
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.
Let $T:V\rightarrow W$ a linear transformation, $i_w:W\rightarrow W^{**}$ and $i_v:V\rightarrow V^{**}$ canonical morphism of biduality. Prove $i_w\circ T=T^{**}\circ i_v$ I' m very very confused with this exercise. Suppose i need to prove this: $i_w\circ T\subset T^{**}\circ i_v$ and $T^{**}\circ i_v\subset i_w\circ T $ but i don't have idea of how to prove this. Can somone give me a hint?
$\newcommand{\Hom}{\operatorname{Hom}}$Let $U,V$ be vector spaces. Denote the dual space of $U$ with $U^\intercal$ and the dual mapping of a linear map $\Phi$ be $\Phi^\intercal$. Define the double dual embedding on $U$ to be $\iota_U:U \to U^{\intercal\intercal}$. ($u \in U, f \in U^\intercal$) $$ \iota_U(u)(f) = f(u) $$ If $\Phi \in \Hom(V,U)$, then $\Phi^{\intercal\intercal} \circ \iota_V = \iota_U \circ \Phi:V \to U^{\intercal\intercal}$ Proof: Let $v \in V, f \in U^\intercal$. Then $$ \iota_U \circ \Phi(v)(f) = f(\Phi(v)) $$ but how do I show that $$ \Phi^{\intercal\intercal} \circ \iota_V(v)(f) = f(\Phi(v)) $$ ?
Bluetooth not working ubuntu 18.04 on lenovo laptop. When I run lspci -nnk | grep -iA3 net; lsusb; rfkill list; uname -r; dmesg | egrep -i 'blue|firm' . Below is what I get Ethernet controller [0200]: Qualcomm Atheros QCA8172 Fast Ethernet [1969:10a0] (rev 10) Subsystem: Lenovo QCA8172 Fast Ethernet [17aa:3802] Kernel driver in use: alx Kernel modules: alx 03:00.0 Network controller [0280]: Broadcom Inc. and subsidiaries BCM43142 802.11b/g/n [14e4:4365] (rev 01) Subsystem: Lenovo BCM43142 802.11b/g/n [17aa:0611] Kernel driver in use: wl Kernel modules: wl Bus 002 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub Bus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 001 Device 005: ID 0bda:0129 Realtek Semiconductor Corp. RTS5129 Card Reader Controller Bus 001 Device 006: ID 105b:e065 Foxconn International, Inc. BCM43142A0 Bluetooth module Bus 001 Device 003: ID 04ca:004b Lite-On Technology Corp. Bus 001 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 004 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 003 Device 004: ID 174f:148d Syntek Bus 003 Device 005: ID 0e8d:2005 MediaTek Inc. Bus 003 Device 002: ID 093a:2510 Pixart Imaging, Inc. Optical Mouse Bus 003 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub 0: ideapad_wlan: Wireless LAN Soft blocked: no Hard blocked: no 1: ideapad_bluetooth: Bluetooth Soft blocked: no Hard blocked: no 2: phy0: Wireless LAN Soft blocked: no Hard blocked: no 3: brcmwl-0: Wireless LAN Soft blocked: no Hard blocked: no 4: hci0: Bluetooth Soft blocked: no Hard blocked: no 5.3.0-26-generic [ 0.140199] Spectre V2 : Enabling Restricted Speculation for firmware calls [ 0.176078] ACPI: [Firmware Bug]: BIOS _OSI(Linux) query ignored [ 23.789800] [Firmware Bug]: ACPI(PEGP) defines _DOD but not _DOS [ 27.790136] Bluetooth: Core ver 2.22 [ 27.790156] Bluetooth: HCI device and connection manager initialized [ 27.790159] Bluetooth: HCI socket layer initialized [ 27.790161] Bluetooth: L2CAP socket layer initialized [ 27.790164] Bluetooth: SCO socket layer initialized [ 50.515945] Bluetooth: BNEP (Ethernet Emulation) ver 1.3 [ 50.515946] Bluetooth: BNEP filters: protocol multicast [ 50.515958] Bluetooth: BNEP socket layer initialized [ 364.510611] Bluetooth: hci0: BCM: chip id 70 [ 364.511611] Bluetooth: hci0: BCM: features 0x06 [ 364.527612] Bluetooth: hci0: BCM43142A [ 364.528623] Bluetooth: hci0: BCM43142A0 (001.001.011) build 0000 [ 364.545643] bluetooth hci0: Direct firmware load for brcm/BCM43142A0-105b-e065.hcd failed with error -2 [ 364.545649] Bluetooth: hci0: BCM: Patch brcm/BCM43142A0-105b-e065.hcd not found [ 364.674287] Bluetooth: RFCOMM TTY layer initialized [ 364.674299] Bluetooth: RFCOMM socket layer initialized [ 364.674315] Bluetooth: RFCOMM ver 1.11 What could be the issue here?
Bluetooth is on but can't find or be found by any other devices. Output of sudo service bluetooth status: ● bluetooth.service - Bluetooth service Loaded: loaded (/lib/systemd/system/bluetooth.service; enabled; vendor preset: enabled) Active: active (running) since ხუთ 2015-06-04 22:33:18 GET; 13min ago Main PID: 26678 (bluetoothd) CGroup: /system.slice/bluetooth.service └─26678 /usr/sbin/bluetoothd -n ივნ 04 22:39:14 Rangoo bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/HFPAG ივნ 04 22:39:14 Rangoo bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/HFPHS ივნ 04 22:39:14 Rangoo bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/A2DPSource ივნ 04 22:39:14 Rangoo bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/A2DPSink ივნ 04 22:39:14 Rangoo bluetoothd[26678]: bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/HFPAG ივნ 04 22:39:14 Rangoo bluetoothd[26678]: bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/HFPHS ივნ 04 22:39:14 Rangoo bluetoothd[26678]: bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/A2DPSource ივნ 04 22:39:14 Rangoo bluetoothd[26678]: bluetoothd[26678]: Endpoint registered: sender=:1.63 path=/MediaEndpoint/BlueZ4/A2DPSink ივნ 04 22:39:14 Rangoo bluetoothd[26678]: Adapter /org/bluez/26678/hci0 has been enabled ივნ 04 22:39:14 Rangoo bluetoothd[26678]: bluetoothd[26678]: Adapter /org/bluez/26678/hci0 has been enabled Output of lsusb: Bus 003 Device 005: ID 0a5c:21d7 Broadcom Corp. BCM43142 Bluetooth 4.0 How can I fix it?
Chrome has a feature that requests the desktop version of sites, but some websites don't oblige, and continue giving the mobile version. Is there any way to force them to give the desktop version? I'm open to using any Android version, any browser, root permissions and Xposed Framework.
Some webpages forces mobile version even I change user-agent. I changed user-agent in built-in browser and "Dolphin Browser HD", I am checking it on page www.user-agent-string.info Main problem is engadget.com, always in mobile version. I tried to clean cookies, restart browsers etc. This is my results: in built-in browser, user-agent - "desktop" () doesn't work, redirects to mobile version in "Dolphin Browser HD", user-agent - "desktop" (NSFW: redtube.com) doesn't work, redirects to mobile version (allegro.pl) works fine in "Dolphin Browser HD", user-agent - "IPad" () doesn't work, redirects to mobile version (allegro.pl) works fine (NSFW: redtube.com) works fine in "Dolphin Browser HD", user-agent - "custom": Mozilla/5.0 (Windows NT 6.0; rv:7.0.1) Gecko/20100101 Firefox/7.0.1 (engadget.com]) doesn't work, redirects to mobile version (NSFW: redtube.com) doesn't work, redirects to mobile version (allegro.pl) works fine Maybe this pages using "adobe flash" user-agent detection ? (I'am using Asus Transformer TF101, Android 3.2.1, Adobe Flash Player 11)
The lengths $a,b$ and $c$ are the side lengths of a triangle that satisfy $ab+bc+ca=3$. Prove that $3≤a+b+c≤2√3$ I was able to find the minimum bound through some simple algebra: $a+b+c=\sqrt{a^2+b^2+c^2+6}$ But, $a^2+b^2+c^2≥ab+bc+ca=3$ $\implies a+b+c≥\sqrt{3+6}$ $$3≤a+b+c$$ Alternatively we could use AM GM on $ab+bc+ca$ and then on $a^2+b^2+c^2$ After this I couldn't think of how to use the triangle inequality in conjunction with the given condition $ab+bc+ca=3$ to get an upper bound on the sum, any help would be appreciated, thanks
Let $a,b,$ and $c$ be the lengths of the sides of a triangle satisfying $ab+bc+ca = 3.$ Prove that $3 \le a+b+c \le 2\sqrt{3}$. The idea I had was $(a+b+c)^2 = a^2+b^2+c^2+2(ab+bc+ca) = a^2+b^2+c^2+6 \geq 9$ by rearrangement. That takes care of the first inequality. How do I show the other inequality?
Is it improper etiquette to, as long as you're certain, add a comment merely suggesting that they accept the answer? Do I sound like a reputation whore?
I've had a couple of answers today where the OP indicated via a comment that I solved their problem, but the question wasn't upvoted or accepted. In both cases the person probably wasn't able to upvote since they were new, but they could have accepted my answer. I felt a little guilty asking them to accept the answer, but since it solved their problem I felt that it would help others who stumbled on the question trying to solve their own problem to know that my solution really was the answer. Is asking the OP to accept your answer when they've said that it solved their problem a reasonable thing to do or does that feel like nagging for reputation?
Let $f\colon X\to Y$ be a finite $r$-to-one morphism between smooth projective varieties. How does one show that $f_\ast\mathcal{O}_X$ is a locally free sheaf of rank $r$ on $Y$ ? Any insights for $f_\ast\mathcal{O}_X$ would be very much appreciated. A local section over $U\subset Y$ for $f_\ast\mathcal{O}_X$ is just a regular function over $f^{-1}(U)$, so it seems as if one can write this uniquely as a sum of $r$ "pieces"...? An aside second question: is there a naturally defined map $f^{\ast}f_\ast\mathcal{O}_X(D)\to\mathcal{O}_X(D)$ where $D$ is a divisor on $X$ ?
Let $f: X \to Y$ be a covering (proper, surjective, finite regular map) of smooth projective varieties of degree $d$. How one can show that in this case $f_* \mathcal{O}_X$ is a locally free sheaf of rank $d$?
There are very rare magic items that increase your stat score by two, such as the Manual of Bodily Health. these items say once you use them they lose their magic until a century passes. I can't find anywhere stating that it cannot increase your score above a 20. Is it possible that if my character has the Manual of Bodily Health and lives 1000 years, he could have a Constitution score of 40 with a +15 Con modifier and a +15 to each level in HP?
Can I increase an ability score over 30 with an item such as a Manual of Bodily Health? [After reading] this book... your Constitution score increases by 2, as does your maximum for that score.
I have a DEM raster with pixel values between about 3000 and -0.0003. I need to set all pixel with a value of 0 and smaler (<=0) to "nodata" (for later raster calculations and to reduce the filesize). It seems for me that this is a task for the raster calculator (set value of pixels <=0 to "nodata") or a reclassification (set value of pixels <=0 to "nodata" and keep all other values) but I dont know how.
I have an image which I clipped with an AOI polygon. The contour area was set to pixel value = 0 and I have a nodata value of -32768. I want to redefine the nodata value into zero. I used to do this with ArcMap easily in the raster calculator, but in QGIS I don't see how I could do it. Any ideas?
What is $i^{1/i}$? Step by step walk through would be appreciated. Tried searching, but didn't find much about this.
How do I calculate the outcome of taking one complex number to the power of another, ie $\displaystyle {(a + bi)}^{(c + di)}$?
What is the difference between \hbox and \mbox? What are these commands intended to do? I cannot see what they do from my code alone without a word explanation...
I've seen hbox, vbox, mbox, parbox and others used in various code samples. What are the different kinds of box in (La)Tex? Which are suitable for use in LaTeX, as opposed to plain TeX?
I configured a regular task me@alpha:~$ crontab -l | grep '^\*' */5 * * * * (cd ~/Documents/OrgMode; git add .; git commit -m "defensively save") It works but I cannot find the log in mail.log me@alpha:~$ grep 'git' /var/log/mail.log me@alpha:~$ grep 'git' /var/log/mail.log Where could I find the log?
I want to verify that my cron job is executing and at what time. I believe there is a log for my sudo crontab -e jobs, but where? I searched google and found recommendations to look in /var/log (in which I do not see anything with 'cron' in the name) and to edit the file /etc/syslog.conf which I also do not have.
Here's a problem on differentiability at a point and continuity of the derivative function at the same point. I'm stating the problem and presenting my solution to it. I'm not entirely confident on my solution (especially about interchanging the limits). So I'd greatly appreciate if someone checks the solution and tell me if there's any gap in my arguments. Thank you. The Problem : Let $f:(a,b) \to \mathbb{R}$ is continuous on $(a,b)$ and is differentiable except possibly at $c \in (a,b)$. Assume that $\lim_{x \to c} f'(x)$ exists. Show that $f'(c)$ exists and $f'$ is continuous at $c$. My Approach : Given that $\lim_{x \to c}f'(x)$ exists, we can write \begin{align} \lim_{x \to c}f'(x)&=\lim_{x \to c} \lim_{h \to 0} \frac{f(x+h)-f(x)}{h}\\ &=\lim_{h \to 0} \lim_{x \to c} \frac{f(x+h)-f(x)}{h} ~~\text{[Since the double-limit exists]}\\ &=\lim_{h \to 0} \Big[\frac{1}{h} \cdot \lim_{x \to c}\big\{f(x+h)-f(x)\big\}\Big]\\ &=\lim_{h \to 0} \frac{f(c+h)-f(c)}{h} ~~\text{[Since $f$ is continuous]}\\ \end{align} Since $\lim_{x \to c}f'(x)$ exists, so does $\lim_{x \to c} \frac{f(c+h)-f(c)}{h},$ i.e. $f'(c)$. Clearly, $\lim_{x \to c}f'(x)=f'(c)$. Hence $f'$ is continuous at $c$. $~\blacksquare$ P.S. The problem is from an exercise consisting of Mean Value Theorem (MVT)-related problems. So it is highly likely that MVT should play a role here, which makes me suspect this is a comparatively simple, probably too-simple-to-be-correct solution.
Suppose that $\mathcal f$ is continuous on a closed interval and $\mathcal v$ is a point in its interior. $\mathcal f$ is differentiable when $\mathcal x\not=v$, and suppose that $\,\displaystyle{\lim_{x\rightarrow v}f'(x)}\,$ exists. Show that $\mathcal f$ is differentiable at $\mathcal v$. Attempt at a solution I want to show that $$ \lim_{h\rightarrow 0}\frac {f(v+h)-f(v)}{h}$$ exists. Based on the fact that $$ \lim_{x\rightarrow v}f'(x)=\lim_{x\rightarrow v}\ \lim_{h\rightarrow 0}\frac {f(x+h)-f(x)}{h}$$ exists. Using the fact that $\mathcal f$ is continuous, I think if somehow I could interchange the limits $$\mathcal {\lim_{x\rightarrow v}\ \lim_{h\rightarrow 0}\frac {f(x+h)-f(x)}{h}}={\lim_{h\rightarrow 0}\ \lim_{x\rightarrow v}\frac {f(x+h)-f(x)}{h}}=\lim_{h\rightarrow 0}\frac {f(v+h)-f(v)}{h}$$ then the result comes out. But I don't think that I could do that, based on continuity. Other than that, I am not sure how to approach this.
Let $A,B$ sets and $B$ infinite set , $\lvert A\rvert=a , \lvert B\rvert=b$ and $1<a\leq b$, and let $D=\{f \mid f:B \to A\} $. Prove that $\lvert D\rvert=2^b$. I know that $\lvert D\rvert=\lvert A\rvert^{\lvert B\rvert}$ and there is a subset of $B$ that has the same cardinality as $A$, but how to prove $\lvert D\rvert=2^b$?
Let $2\leq \kappa\leq \gamma$ where $\gamma$ is an infinite cardinal number and $\kappa$ is any cardinal. Prove that $2^\gamma = \kappa^\gamma$. One direction is obvious but I'm stuck with the other. i.e. showing $\kappa^\gamma\leq 2^\gamma$. Any hints or solutions will be appreciated.
Let's consider such polynomial: $$ W_n(z)=\sum_{k=1}^n kz^{k-1} $$ Tell whether this statement is true for any $n \in \mathbb{N}$: $$W_n(z)=0 \Rightarrow |z|<1$$ Here is what I have evaluated: It is obvious that $z$ can't be a real number bigger or equal to $0$. Also, if $n$ is even, then $z$ can't be a real number smaller than $-1$, because if it was, we would have: $$W_n(z)=\sum_{k=1}^n kz^{k-1}=\sum_{k=1}^{\frac{n}{2}}\Big((2k+1)z^{2k}+2kz^{2k-1}\Big)=\sum_{k=1}^{\frac{n}{2}}z^{2k-1}\Big(2kz+2k+z\Big)$$ Both $z^{2k-1}$ and $2kz+2k+z$ are smaller than $-1$ so each term of the last sum is bigger than $1$ so the final sum is bigger than $0$.
This is a homework problem that I wasn't able to solve, and I feel a little silly about it (the assignment has been submitted). The problem: Let $P(z) = 1 + 2z + 3z^2 + \cdots + nz^{n-1}$. By considering $(1-z)P(z)$, show that zeros of $P(z)$ are contained inside the unit disc. This is from Chapter 1 of Bak's Complex Analysis. A solution should only use algebraic manipulations of complex numbers (in other words, this problem is very easy to solve by employing the Gauss-Lucas theorem, but that's not "on the table" -- complex differentiation hasn't been defined in the scope of what's permissible). What I've done: $$\begin{align*} (1-z)P(z) &= 1+z+z^2+\cdots+z^{n-1}-nz^n \\ &= \frac{z^n-1}{z-1}-nz^n. \end{align*}$$ Let $z$ be a zero of $P(z)$; then it is a zero of $(1-z)P(z)$. Consequently, $$\begin{align*} nz^n &= \frac{z^n-1}{z-1} \\ nz^n(z-1) &= z^n-1 \\ nz^n(z-1)+1 &= z^n \end{align*} $$ Then $$|z^n| = |z|^n = |nz^n(z-1)+1|.$$ From the triangle inequality, $$ \begin{align*} |z|^n &\le |nz^n(z-1)| + |1| \\ |z|^n &\le n|z^n||z-1| + |1| \\ n|z|^n(|z-1|) &\le 1 \\ |z|^n &\le \frac{1}{n|z-1|} \end{align*} $$ At this point, I am stuck. I feel like I went down the wrong path, or maybe I just made an arithmetical error, but I can't find where.
I know there is plenty of info about regex available but I can’t figure it out somehow. I have an array1 = ['\n 1.979 \n, \n 1.799 \n'] which looks like this but the numbers vary but are always in this format so the regex = re.compile(r'\d.\d\d\d') which matches perfectly in notepad++ but doesn’t seems to work in python. import re regex = re.compile(r'\d.\d\d\d') filteredarray= [i for i in array1 if regex.match(i)] print(filteredarray) what am I missing? Thanks in Advance
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.
My computer doesn't have a disc drive and I am unsure how to continue installing without one.
I tried to use the usb-creator.exe from Ubuntu 10.10 desktop i386 ISO image and it does create an USB stick that doesn't boot. When I try to boot from it I get: Operating System not found. I try to do this from Windows 7 x64. I'm not looking to create a live Ubuntu media, only an installation USB disk. I repeated the process several times and I even tried to reformat the USB drive (FAT32), no success yet. The USB stick is a 8GB one.
I am attempting to perform image classification on some maps that I have in PNG format. This classification is failing due to there being too many many pixels in the training samples (I appear to be having the same problem as this user: ). As you can see in the picture, a relatively small training area contains a huge number of pixels as shown in the count column. The PNG image that I imported to GIS is ~4000 x ~4000 pixels. The number of pixels in this sample is larger than the number of pixels in the entire .png image! Is there a setting I need to change to get ArcGIS to recognize the resolution of the image for the sake of classification?
I've no clue how to solve this issue in the exercise that I'm trying to perform. The point where I'm stuck is 4. "Create signature file as LandsatCompS.sgs". I've done what it says in the exercise. I got a error message "Failed to create signature file. The aim of the exercise is to carry out a supervised image classification of the Northern half of Jutland. Start ArcMap and add the Landsat images from the B series (summer images). Create a composite image composite image for all bands except band 6 – the thermal band. Save the image as LandsatCompS (S for summer). Open the orthophotos for land (not urban). Add eventually more orthophotos from the Geodata library. Try to identify the necessary number of different land cover classes to cover all areas on the orthophotos. Not more than 15! Open the Image Classification window, and start digitising training areas. Two for each class. Create the signature file as LandsatCompS.gsg. Carry out maximum likelihood classification using LandsatCompS as input raster and LandsatCompS.gsg as signature file. Output is ML_class_NJ1. Use default values for the other inputs. Put the right colours on the new map and compare with the orthophoto and other maps available for Northern Jutland. Where are the problems? Try to make an improved classification by increase the number of classes and digitise new training areas. Carry out the classification and assess the result. Which one is best?
I have simple TextBox when the user can insert File path. Now I want to validate if this File path is valid for example: c:\blabla --> this valid c: \blabla --> this Not valid I have this function: public static bool ValidateFilePath(string path) { FileInfo fileInfo = null; try { fileInfo = new FileInfo(path); } catch (ArgumentException) { } catch (PathTooLongException) { } catch (NotSupportedException) { } if (fileInfo is null) return false; else return true; } But this return True all the time. Any suggestion or maybe ready c# method that can verify this ?
I want to include a batch file rename functionality in my application. A user can type a destination filename pattern and (after replacing some wildcards in the pattern) I need to check if it's going to be a legal filename under Windows. I've tried to use regular expression like [a-zA-Z0-9_]+ but it doesn't include many national-specific characters from various languages (e.g. umlauts and so on). What is the best way to do such a check?
I don't use C++ very often, so probably I'll post dummy question. I have base class class BaseObject { public: template <class T> T* addIntoAutoreleasePool(T*); }; Its implementation: template <class T> T* BaseObject::addIntoAutoreleasePool(T* argument) { return argument; } When I use this method in BaseClass with this code: BaseObject::BaseObject() { int a = 5; this->addIntoAutoreleasePool<int>(&a); } it works fine, but if I use this code in child class: class MazeGame : public BaseObject { public: Maze* createMaze(); }; Maze* MazeGame::createMaze() { int a = 5; this->addIntoAutoreleasePool<int>(&a); } compiller complains: Undefined symbols for architecture x86_64: "int* BaseObject::addIntoAutoreleasePool<int>(int*)", referenced from: MazeGame::createMaze() in MazeGame.o ld: symbol(s) not found for architecture x86_64 clang: error: linker command failed with exit code 1 (use -v to see invocation) My IDE is XCode 8. I Have some ideas why it happens: If I use addIntoAutoreleasePool method in both base and child classes it works fine. So... I have to force methods generation for needed type.(but I don't know how. I hoped that C++ must do it automatically.). And I need this method for "any type" in me future code, custom classes, ints etc. Probably it is just some XCode bug. But any way I have to solve this problem somehow. =( PS :Anyway, thanks for attention =)
Quote from : The only portable way of using templates at the moment is to implement them in header files by using inline functions. Why is this? (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)
Etcher used to be great for burning ISO to USB or microSD card. However, it still doesn't support DVDs. What is the alternative to make a bootable DVD from ISO? P.S tried a few suggestions and worked for me.
I have a Ubuntu image file (.iso) and I'd like to burn the image file into a DVD, is there any software for this purpose on Ubuntu?
Any clue regarding this: $$\int_0^\infty e^{-a^2x^2} \cos (bx) dx = \frac {\sqrt \pi}{2a}e^{\frac{-b^2}{4a^2}}$$
Prove that : $$ \frac{\sqrt{\pi}}{2} e^{-\frac{a^2}{4} } =\int_0^{\infty} e^{-x^2} \cos( a x) \ \mathrm{d}x$$ the only thing I can think of is differentiating the RHS and trying to get : $$ -2 f'(a) =a f(a) $$ But I couldn't do it. Can anyone show me how to do this ?
From Gauss's law we find that E in any point near an infinite charged metal plate is: $$E = \frac{\sigma\epsilon_0}{2}$$ which indicates that $E$ is same for any distance, but it seems weird and untrue from the concept of Coulomb's law. If distance from the plate is decreased a charged particle should feel more force on it. Can you please explain?
For an infinite line charge, $E$ falls off with $1/r$; for an infinite sheet of charge it's independent of r! The infinitesimal contributions to $E$ fall off with $1/r^2$, so why doesn't the total $E$ fall off the same way for the infinite line and sheet charges?
Recently, sources for mathematical infotainment, for example , have given some information on the interpretation of divergent series as real numbers, for example $\sum_{i=0}^\infty i = -{1 \over 12}$ This equation in particular is said to have some importance in modern physics, but, being infotainment, there is not much detail beyond that. As an IT Major, I am intrigued by the implications of this, and also the mathematical backgrounds, especially since this equality is also used in the expansion of the domain of the Riemann-Zeta function. But how does this work? Where does this equation come from, and how can we think of it in more intuitive terms?
$\displaystyle\sum_{n=1}^\infty \frac{1}{n^s}$ only converges to $\zeta(s)$ if $\text{Re}(s) > 1$. Why should analytically continuing to $\zeta(-1)$ give the right answer?
I am looking for a most minimum template/example for a LaTeX Ph.D. thesis. I am going to write a dissertation/Ph.D. thesis. I use Ubuntu with pdflatex (minimum installation of TeX Live). The goal is to keep it smallest as possible for a Ph.D. Thesis, using pdflatex. The use of no packages (usepackage) would be ideal, if it may be possible. thank you
Aside from CTAN, what are good resources/repositories for Latex templates? In particular, I'm looking for some pretty Thesis templates (I'm familiar with classicthesis)
I'm having issues with my hair emitter to show / render as cones. I'm using cycles and during "solid" mode in the viewport the hair looks like normal hair. but as soon as I switch to rendered view or even render the still, the hair turns into cones. Ive reset all options to default, reloaded the same .blend file and ive created new ones. Still does the same thing.
I am using a hair/particle system but all of the hairs look like spikes not hair: How can I set it so they all have a consistent thickness and how can I adjust the thickness?
I'm running Ubuntu 12.04 LTS 64-bit OS on my local machine. I want to setup/install Git GUI on this machine. Then I'm having one repository at GitLab that I need to make clone of on my machine, then I should be able to do normal git operations like pull, push, commit, etc. with Git GUI. Can someone please provide me step by step instructions from installing this Git GUI on my machine to execute normal Git operations? Thanks in advance.
I've installed git-gui tool via sudo apt-get install git-gui. But how do I start it? Trying with search or git-gui command did not find and UI tool for Git.
I am not understanding below program.Runnable is an interface and constructor will not be there in any interface.In this program, how new Runnable(){...} is working? public class Threads { public static void main (String[] args) { new Thread(new Runnable() { public void run() { System.out.print("bar"); }}).start(); } }
What is the use of anonymous classes in Java? Can we say that usage of anonymous class is one of the advantages of Java?
I'm running libtorrent/rtorrent master (13.7) on raspi 3b+ with raspbian. I can download torrents under 4GB in size without any problems (for example debian netinstall at around 290MB). However downloading anything roughly bigger than 4GB will result in a hashfail every time. To clarify, the download of even big files finishes but when hashing the finished download it detects a hash fail. Sometimes as early as 200MB into the file (out of say a 4.6GB file). The downloads are saved to an external 4TB hard drive connected via USB and formatted with exFAT. The drive itself is encrypted using veracrypt. At first I suspected it had something to do with the preallocate feature of rtorrent. I tried disabling it but the results are the same. I'm also not sure why the hash corruption is not caught mid download as every chunk should be checked separately. I don't think it's a hardware failure as the drive is new and has not shown problems otherwise. I have tried installing rtorrent from apt before which shows the same symptoms. I installed the self compiled version afterwards which is what I'm currently using. Running rtorrent from my desktop on the same torrents that fail on the raspberry works flawlessly.
I recently purchased a 32GB USB 3 stick that was formatted FAT32. I plugged it into my computer and attempted to copy a film onto it, the file was over 4GB however and it would not let me copy the file across because of the . After some googling I found that I could format my USB stick to have an format which would mean I could put files onto the stick greater than 4GB in size and the drive would work on both my Mac and my PC. The problem with this solution is that my PS3 cannot detect the USB stick when it is formatted with exFAT. I would like to know if there is a way I can have my USB stick formatted so it can have files greater than 4 GB and work on my PC, Mac and PS3.
There are 100 types of cards, each type with a number from 1 to 100 on it. Each minute I am given a random card. Random means that the number of my card has an equal chance of being 1,2,3,...,100. I stop when I have cards of each number, that is, I stop collecting once I have each number on at least one card. How many minutes is this process expected to take? That is, find the expected value of the number of minutes I have to wait. E.g. I could potentially get duplicates so this method will take a lot more than 100 minutes. Once I get 99 different cards, I will stop as soon as I get the other one which I haven't got yet. Thanks for helping everyone!
What is the average number of times it would it take to roll a fair 6-sided die and get all numbers on the die? The order in which the numbers appear does not matter. I had this questions explained to me by a professor (not math professor), but it was not clear in the explanation. We were given the answer $(1-(\frac56)^n)^6 = .5$ or $n = 12.152$ Can someone please explain this to me, possibly with a link to a general topic?
I am trying to count the amount of 'x' characters that are in a string, and print out the number. I end up just counting the number of characters in the string instead. Here is what I have tried: int count = 0; for (int j = 0; j < input1.length(); j++) { char character = input1.charAt(j); count++; } if (indexX != -1) { System.out.println("x count: "+count); } // indexX = input1.indexOf('x');
I have the string a.b.c.d I want to count the occurrences of '.' in an idiomatic way, preferably a one-liner. (Previously I had expressed this constraint as "without a loop", in case you're wondering why everyone's trying to answer without using a loop).
Hello i have an external HDD witch shows that the hdd is full and when i'm going on the hdd i have just 1 million of dir0000, dir0001 files and i would like to know if is possible to recover something from this hdd. thank you
Files disappeared from my computer. On running a system search, they were found in C:\found.001\disk0001.chk I want to go in there and have a look, if there are other files there too, but it gives me an access denied message. I ran chkdsk but it said no problems. Ideally I would want to run a recovery utility (not the ones for deleted files) that would restore them all to the respective locations. Though I am lucky, I still have them at this weird place. I am on windows 7.
I have a Dell Inspiron 910 and am receiving a running in low graphics mode error. I believe the error was caused by attempting to install a game I did not have the proper space for. I have tried a few of the fixes described in previous posts but have had no luck. I get messages that I have zero space remaining.
Note: This is an attempt to create a canonical question that covers all instances of "low-graphics mode" error that occurs to a user, including but not limited to installation of wrong drivers, incorrect or invalid lightdm greeters, low disk space, incorrect installation of graphics card like ATI and Nvidia, incorrect configuration of xorg.conf file while setting up multiple monitors among others. If you are experiencing the "low-graphics mode" error when trying to login but none of the following answers work for you, please do ask a new question and then update the answers of this canonical question as and when your new question gets answered. When I try to boot into my computer, I am getting this error: The system is running in low-graphics mode Your screen, graphics cards, and input device settings could not be detected correctly. You will need to configure these yourself. How do I fix the failsafe X mode and login into my computer? Answer index:
Currently, I setup my project eclipse into intelligent IDE.In my eclipse everything was fine.But in intelligent IDE.I am getting error java.lang.NullPointerException.I am not getting any Idea how to solve My current Code I run into IDE ChromeDriver wd; @BeforeMethod public void setUp() throws Exception { wd = new ChromeDriver(); wd.manage().timeouts().implicitlyWait(5, TimeUnit.SECONDS); } @Test(priority =31 ,retryAnalyzer = Retry.class) public void AirBNB_add_show_One_Time() throws InterruptedException { wd.manage().window().maximize(); wd.get("http://local.something.io/refine?amenity_keyword=internet&amenities=21&minimum_price=50&maximum_price=200&amount=50-200&order=2&changed_currency=USD&pax=4&date_end=2017-08-30&date_start=2017-08-28&view=grid&sqs=&location_id=&search=Paris%2C+France"); wd.findElement(By.xpath(".//*[@class='airbnb-wide-block-search-btn js-airbnb-search-btn']")).click(); Thread.sleep(10000); for (String windows : wd.getWindowHandles()) { wd.switchTo().window(windows); String CurrentURL = wd.getCurrentUrl(); if (CurrentURL.startsWith("http://local.alojamiento.io")) { wd.navigate().refresh(); Thread.sleep(7000); boolean imoverlayadd=wd.findElement(By.xpath("")).isDisplayed(); boolean airbnb=wd.findElement(By.xpath(".//*[@class='airbnb-wide-block-search-btn js-airbnb-search-btn']")).isDisplayed(); assertFalse(airbnb,"Airbnb Add will not show After clicking Add one times"); }} } @AfterMethod public void tearDown() { driver.quit(); } When i runthis code i am getting following error java.lang.NullPointerException at vrs.RentbyownerAutomationFinal.AnalyticsCode(RentbyownerAutomationFinal.java:40) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:498) at org.junit.runners.model.FrameworkMethod$1.runReflectiveCall(FrameworkMethod.java:50) at org.junit.internal.runners.model.ReflectiveCallable.run(ReflectiveCallable.java:12) at org.junit.runners.model.FrameworkMethod.invokeExplosively(FrameworkMethod.java:47) at org.junit.internal.runners.statements.InvokeMethod.evaluate(InvokeMethod.java:17) at org.junit.runners.ParentRunner.runLeaf(ParentRunner.java:325) at org.junit.runners.BlockJUnit4ClassRunner.runChild(BlockJUnit4ClassRunner.java:78) at org.junit.runners.BlockJUnit4ClassRunner.runChild(BlockJUnit4ClassRunner.java:57) at org.junit.runners.ParentRunner$3.run(ParentRunner.java:290) at org.junit.runners.ParentRunner$1.schedule(ParentRunner.java:71) at org.junit.runners.ParentRunner.runChildren(ParentRunner.java:288) at org.junit.runners.ParentRunner.access$000(ParentRunner.java:58) at org.junit.runners.ParentRunner$2.evaluate(ParentRunner.java:268) at org.junit.runners.ParentRunner.run(ParentRunner.java:363) at org.junit.runner.JUnitCore.run(JUnitCore.java:137) at com.intellij.junit4.JUnit4IdeaTestRunner.startRunnerWithArgs(JUnit4IdeaTestRunner.java:68) at com.intellij.rt.execution.junit.IdeaTestRunner$Repeater.startRunnerWithArgs(IdeaTestRunner.java:51) at com.intellij.rt.execution.junit.JUnitStarter.prepareStreamsAndStart(JUnitStarter.java:237) at com.intellij.rt.execution.junit.JUnitStarter.main(JUnitStarter.java:70)
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?
Prove that the trigonometric equation sin(cosx) = cos(sinx) has no solutions. I graphed the functions and I can see they are never equal to eachother, but how do I do a formal proof for this?
The following problem was on a math competition that I participated in at my school about a month ago: Prove that the equation $\cos(\sin x)=\sin(\cos x)$ has no real solutions. I will outline my proof below. I think it has some holes. My approach to the problem was to say that the following equations must have real solution(s) if the above equation has solution(s): $$ \cos^2(\sin x)=\sin^2(\cos x)\\ 1-\cos^2(\sin x)=1-\sin^2(\cos x)\\ \sin^2(\sin x)=\cos^2(\cos x)\\ \sin(\sin x)=\pm\cos(\cos x)\\ $$ I then proceeded to split into cases and use the identity $\cos t = \sin(\frac{\pi}{2} \pm t\pm y2\pi)$ to get $$ \sin x=\frac{\pi}{2} \pm \cos x\pm y2\pi\\ $$ and the identity $-\cos t = \sin(-\frac{\pi}{2}\pm t\pm y2\pi) $ to get $$ \sin x=- \frac{\pi}{2}\pm \cos x \pm y2\pi.\\ $$ where $y$ is any integer. I argued that $y=0$ was the only value of $y$ that made any sense (since the values of sine and cosine remain between $-1$ and $1$). Therefore, the above equations become $$ \sin x=\frac{\pi}{2} \pm \cos x\implies \sin x \pm \cos x=\frac{\pi}{2}\\ $$ and $$ \sin x=- \frac{\pi}{2}\pm \cos x\implies \cos x\pm\sin x= \frac{\pi}{2}.\\ $$ Then, by a short optimization argument, I showed that these last two equations have no real solutions. First, does this proof make sense? Second, if my proof makes sense, then I feel that it was not very elegant nor simple. Is my approach the best, or is there a better (i.e., more elegant, shorter, simpler) proof?