I have been editing Stack Overflow posts for awhile, and the majority of my edits seem to get accepted, but I wanted to take a step back for a second and see how the community thinks questions should be edited.  Most of my edits fall under:   Fixing spelling/grammar Fixing syntax indentation And adding tags to posts   I think these can be broken into two categories:  No Duh Edits   Spelling and Grammar Improper capitalization Unhighlighted code A whole code block starting with unnecessary indentation   Risky Edits   Changing code indentation from tab/4 spaces to 2 spaces Combining sentences to make them more readable Adding tags   I am fine making no duh edits, but when it comes to more risky edits I try and avoid them, but an argument can be made for them. With tab/4 space indentation code blocks become long, and many do not fit into the web page without scrollbars. Fixing indentation seems like it could be a good thing, but you are also deviating from the original code, and the example no longer matches the real thing.  Adding tags also seems like it could be a good thing, but the person asking the question may have only intended it to have that one tag. For example, I was editing a MySQL question, and I noticed the code was written in PHP, so I added the PHP tag. While the issue itself is with MySQL, I figured PHP programmers might be familiar with the error since there is overlap.  Lastly, how full proof is the approval process. If there is an edit I am not sure about, can I expect the approval process to protect the question from being altered too much? Perhaps I am overthinking this, but I would love to know how other people edit. Cheers.

Tag editing appears to be fairly random. It seems to me that the point of tags is to help me find stuff.  For instance, I use the [c#] tag to find questions on C# - one of my specialities.  Why do people keep editing tags to say [subjective] or [off-topic]? Why would I ever want to search for subjective questions?  Is this just the (still unattainable) Librarian badge calling? I'm sure we'll all get it eventually.  I tend to edit tags in the following circumstances:   The tag might help the asker get a useful answer - for instance if they've missed a C# tag on a clearly C# question. The tag might help those answering - for instance if they've failed to specify .Net 3.5 but are asking about Linq (only added in 3.5) They've put one tag where another different one might be appropriate - for instance "sql" and "2005" instead of"sql2005".   I'm not sure of the point in:   "subjective", "off-topic", etc - why bother with a tag? "duplicate" - there's a close option for this. "coding", "programming", "software" - aren't they all? "meta-discussion", etc - surely the "stackoverflow" tag already states that?   There seems to be some fairly pointless tag editing going on - with no agreement on when we should edit them.  What rules do you follow? When would you re-tag? When wouldn't you? Am I missing something? Do some people find [subjective] a really useful tag?  I've split the debate on subjective out into a .


and I trying to clone an object with Object assing.   const defaults = {    a: [],    b: [],    c: [],    d: [],    e: [],    f: [],    g: [] };  this.rowSetSlug = Object.assign({},defaults); this.rowSetObject = Object.assign({},defaults); this.rowSetModified = Object.assign({},defaults);    But when I fill one object like    this.rowSetObject.push(object);    And do a console.log()  console.log(this.rowSetObject); console.log(this.rowSetModified); console.log(this.rowSetSlug);   All same have the rowSetObject items, and if i fill another they replicate.  Thanks

What is the most efficient way to clone a JavaScript object? I've seen obj = eval(uneval(o)); being used, but . I've done things like obj = JSON.parse(JSON.stringify(o)); but question the efficiency.  I've also seen recursive copying functions with various flaws.  I'm surprised no canonical solution exists.


I have to populate the Current User Time-Zone DateTime in a DateTime field. I am trying this : String str = datetime.now().format(); DateTime d = Datetime.valueOf(datetime.now().format()); DateTime dtm =  (DateTime) DateTime.parse(str); system.debug('datetime.now().format() = ' + str); system.debug('Datetime.valueOf(datetime.now().format()) = ' + d); system.debug('DateTime.parse(str) = ' + dtm);  But the problem is that after using format() it is giving the String format and converting it into DateTime using valueOf() & parse() giving the PST time which is the ORG Timezone, whereas I want the Current User time-zone DateTime. How can I get the CurrentUser Time-Zone DateTime in DateTime Data Type?

I need to get the current time but to be in type DateTime. I use:  DateTime now = System.now();   but it returns wrong time. I execute the code in 2017-08-04 00:38:46 AM but it returns     00:38:46:023 USER_DEBUG [138]|DEBUG|now 2017-08-03 21:38:46   How can I get my correct current local time 2017-08-04 00:38:46?  I had even tried with:  DateTime now = DateTime.parse(System.Now().format());   but I still get wrong time.     01:10:09:021 USER_DEBUG [139]|DEBUG|now 2017-08-03 22:10:00   How can I get the correct current local time?


My phone broke and I can not afford to purchase a replacement but I need to access my information backed up on my icloud,  How do I download my backed up iphone files from icloud directly from my windows based pc

I remember it used to be possible to download the full iCloud backup. However, after trying a bunch of tools (Dr Fone, syncios, easeUS, iPhone backup extractor) online that claims to download iCloud backup, none of them actually works. Is there any way to do this currently?


Before I go power hungry and start closing random questions, are there any guidelines I should follow to be considered responsible?

Questions can be closed or marked as duplicates.  What does it mean for a question to be "closed"? What does it mean for a question to be marked as a "duplicate"? Who can close a question? What are the reasons for closing a question ? Is closure the end of the road for a question? When are closed questions eligible for deletion?   Related        For more information, see "" in the .


Is it typical practice to download Bonjour on an HP laptop? I have an HP laptop and Bonjour was downloaded in the last day and I did not download it.    Is Bonjour only for Apple computers?

One of my least favorite things that Apple does to every Windows computer during an installation of iTunes is that it installs Bonjour. On almost every Windows machine I've installed iTunes on, Bonjour has caused an error of some sort.  As far as I can remember, I've removed Bonjour by deleting the folder it's in. Most of the time, this has not caused any major problems. However, I have a new installation of iTunes and I'm wondering if once again I should delete Bonjour.  Are there any issues caused by deleting Bonjour? Would I lose any functionality?


I need to select a specific layer in the layer tree before I run my python script. I have tried   with the code  registry = QgsProject.instance() layer = registry.mapLayersByName("name")[0]   but on the layer tree, there is no change of focus. The layer does not get selected. How can I accomplish that?

I want my script to perform actions on a particular layer.  Online advice I've found so far suggests using the iface method "setActiveLayer()".  Makes sense based on the name alone.    Scenario:  In the Layers window I have a layer named "Province" highlighted (active).  Then I run the following code:  >>> vl = QgsMapLayerRegistry.instance().mapLayer( 'na_roads_Prov' ) >>> iface.setActiveLayer(vl)   Console Output = False  As far as I understand executing this code in the console should move the highlighted "active layer" from "Province" to 'na_roads_Prov'.  Yes?  Instead the "Province" layer remains highlighted as active, and the console output says "False".  Any ideas?  Am I not referring to the layer correctly?


Each time when I type some non-existing domain name in Chrome bar address, I'm redirected to  .  For example when going to: , I'm getting the immediate redirect to: http://searchguide.level3.com/search/?q=http%3A//javauto.org/&r=&t=0 with some ads and meaningless results.  I don't know how this got installed. I don't have any Level3 extensions and I use DuckDuckGo as my default search engine.  How can I remove this Level3 search engine from Chrome? As this is very annoying.      To clarify, my default search engine is set to DuckDuckGo:    And Level3 doesn't exist on the main search settings list, either on Other search engines list.      Here is my DNS configuration:  $ cat /etc/resolv.conf  nameserver 4.2.2.1 nameserver 8.8.8.8 nameserver 8.4.4.2     I've checked the other , but it's not duplicate, because:   It talks only about Windows workarounds. DNSUnlocker and Malwarebytes are Windows apps. The first answer is actually one sentence question. To clarify, I don't have any fishy extensions or malwares. It also happens in incognito mode.   Yes, I'm using Google DNS, but I don't know how removing it would solve the issue.    This is also not duplicate of , because I don't have any malware on my macOS. Believe it or not, I really know when I have one (already checked with launchctl and ps). So this problem has nothing to do with viruses as linked Windows post says. In this post at  it's suggested that it's caused by using free DNS and that ISP is forcing the redirect (NXDOMAIN record). Please reopen, so I can share my solution once I find one.

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


I'd like to fully install Ubuntu 12.10 onto a 16GB USB 3.0 flash drive, not create a LiveUSB, but to treat the flash drive as an external hard drive.   I've read it's possible and I know my computer can boot from it. However, it doesn't work when I try. I've booted a LiveUSB from another flash drive and installed Ubuntu onto the 16GB one. It finished successfully, but when I try to boot from it and it takes me straight to Windows 8 instead. I feel I've done something when installing the boot loader.  It'd be great if I had some step-by-step instructions for:     how many partitions to make,  what kind,  how big, and  where to install the boot loader.

If you are hurrying to reply, System → Administration → StartUp Disk Creator -- no, that's not what I'm talking about.   I want to try Ubuntu 11.04's Unity without touching my existing Ubuntu install.  To do this, I need to install the nVidia drivers first (sigh).  To do this, I need changes to persist a reboot.  To do this, I need to really install Ubuntu on a USB key.  How do you do that?    What I tried   I tried to make a USB key from , then boot from it, then choose "Install Ubuntu." The installer refused to install to the installation media itself. I tried, from my installed copy of Ubuntu:  sudo kvm /dev/sdb --cdrom .cache/testdrive/iso/ubuntu_natty-desktop-i386.iso   ...but the installer didn't detect the disk properly.


I bought tickets to and from the US. And I wonder if they would cancel my tickets for the flight back if I miss my first flight.  PS It's just I accidentally bought tickets with a stopover in Toronto and it turns out (didn't see that coming) that I need a transit visa to Canada. And to me it looks like it would be cheaper to buy another ticket to the US (with no stopovers this time)  PPS My connection time in Toronto is 1 hr 40 min and I am required to have a transit visa. And I can get one sending my passport to London (nearest Canadian embassy where they have glue and paper to make visas). This is just ridiculous.

I was browsing flight price at Singapore Airlines website, and a one-way flight from SIN to SFO cost this much:    That's quite expensive. I tried browsing around and found that a return flight from SFO to SIN and back to SFO cost much cheaper:    It's really weird because the second ticket includes the exact same flight that cost 1900+, but it's almost half the price. The reason for this counter-intuitive situation is explained in the answers this question   If I am located in Singapore and my intention is to fly one-way to SFO, is it safe to book the flight in the second picture and only board SFO-SIN leg? Will they deny me because I miss the SIN-SFO flight?


i'm trying to create notification script but it doesnt work.  When i click for example "control+alt+m" it should pop notification which it does, but its like default and i cant change anything.   I tried to use some of commands for notify-send but its just not working.   And one more huge problem is its not working in full screen like i'm in-game and i want to click "control+alt+m" and its not showing up.   I cant do anything, i tried to write -critical still not working. need help with notifications.    here is my script:  #!/bin/bash notify-send "Dota2 Heroes" -t 10000   P.S default is 5sec time, -t 10000 = 10sec but its not working, notification disappears in 5sec

Maybe I'm doing something wrong, but shouldn't the commands (run separately) notify-send -t 1 "test" notify-send -t 1000 "test" notify-send -t 10000 "test"  have different timeouts? The first being nearly instantaneous, the second taking 1 sec and the third 10 seconds? In all cases it seems to take about six seconds for me. Is there a way around this behaviour? As the developers label this as a "feature" instead of a bug, I would like some alternatives.


Would you think that Stack Exchange and other related sites should remove downvote function from their default?  If someone gives the worse answer they can provide another function to remove the bad answer. Can you suggest some functions if you're asked by Stack Exchange admin?   Does downvote imply your personality?   Do you feel really negative when we receive some downvotes?

As far as I can tell downvoting is mostly useless.     For questions the only people who get downvoted are lower rep users, or incredibly stupid questions    most questions that are downvoted get closed anyway which should be sufficient downvoting doesn't have too much affect on your rep anyway a negative comment is more useful and more of a push too change or delete the question  For answers downvoting is often used incorrectly as well   people commonly competitively downvote (downvoting another answer to a question that you also answered) obviously not a good behavior downvoting (and upvoting) are contagious, meaning one downvote leads to a bunch of others even though downvotes don't effect rep that much they create a negative environment, no one wants their post downvoted, on the other hand criticizing comments, I think, are far more welcome      So basically in a nutshell a downvote serves no real purpose even if a post deserves it. Flagging, closing and commenting are much more useful to everyone including the poster than downvoting so why have it.    I now see from the answers and comments that downvotes do serve a purpose and would like to retract my request.


someone  with two distinct changes, one of which was good and one bad. (The first improved the markup of the answer, the second introduced a bug in the code)  Could the reviewers be given the option to approve(or rollback) separate hunks of an edit? ...Or even better: could the post author be given this option?  I reverted the bad change through a new edit, but it would have felt better to rollback the bad hunk with a comment to the editor.

Contradicting Instructions While going through the suggested edits review queue, one sometimes stumbles upon partially useful edits like . Trying to follow the instructions listed in the descriptions doesn't lead to a conclusive answer. Considering our example:   Approve edits that clearly improve the post ↳ No, not *clearly* Improve Edit when you can make additional improvements to the post ↳ I most definitively can Reject and Edit to replace an ineffective edit with your own substantive changes ↳ It is ineffective in the sense that it made the post worse overall (imho) Reject edits that fail to improve the post or that make it worse ↳ Like the last option: yes Skip if you are not sure and want to go to the next suggested edit ↳ Well, yes. But that is really why I am here, asking this question   Reasoning about the remaining Choices This leaves us with three choices: Improve Edit, Reject and Edit and Reject (the last one slightly modified):  Improve Edit  + Acknowledges that some things in the edit where correct - Learning effect for author might vanish, as the improvement might get overlooked - Can't leave a custom message for edit author (except in comments, which pollutes the thread) - Doesn't trigger the system which "punishes" users who repeatedly have their edits rejected - Rewards the edit author with reputation for a poor edit   Reject and Edit  + Clearly shows the author that there were problems with the edit - Still can't leave a custom message explaining the problems of the original post. - One has to partially redo parts of the edit that have just been rejected, which might feel unjust to the original editor   Reject with a custom note and come back immediately to make a good Edit  + Clearly shows the author that there were problems with the edit + Possibility to leave an explanation as to what was wrong with the edit - One still has to redo parts of the edit that has just been rejected - Seems to be a weird workaround for Reject and Edit   Something else?   Each of the three options come with their distinct advantages/disadvantages making it non trivial to decide which one to pick.  Or does the answer simply depend on the quality of the edit? Like:  Improve Edit for subjectively slightly positive edits Reject and Edit (Or Reject and Edit) for subjectively slightly negative edits


For my computing project, I am creating a projectile simulator but I cant seem to get my head round the air resistance. I tried by working out the horizontal and vertical velocity by solving it (vertically and horizontally giving me two equations):   $dv/dt = -cv^2$ (horizontal) $dv/dt = -cv^2 - g $ (vertical)   where c is 1/2 (drag co x density x cross sectional area).  But after doing the integrals and finding the equation it doesn't seem to be working as I want them to...  Sorry for the bad formatting.. (Ill try to excuse myself by saying Im new) and thanks for any help

I know (from Kinematics) that for an object moving linearly with an acceleration and without air resistance the following equations can be used to determine v(velocity) or x(position of the object) at any time:  $v=v_0+at$  $x=x_0+v_0t+\frac{1}{2}at^2$  Where $x_0$ is the position of the object at the start of accelerated movement, $v_0$ is the velocity at the start of the motion and a is the acceleration.  Now if I want to add air drag, say we take the formula for air drag as:  $D=0.5CA\rho v^2$  $C$ is a coefficent, $A$ is the reference Area, $\rho$ is the density and $v$ the velocity. Since $D$ is a force the air drag results in an acceleration, so in other words: The resulting acceleration is $a-D/m$, however $D$ depends on $v$, which depends on the acceleration. And that's where my problem is, I simply can't wrap my mind around that.  How would I go about getting the Equations for $x$ and $v$ including air drag (and don't forget there's acceleration too)?


I am a newbie in Tensorflow and Keras and for the first moment I ask me the same few questions while I am creating my Neural Network. Even searching for some explanation of how to estructure, train, etc. Layers While you are structuring your model in a Neural Network I cant understand how people reach to an optimal number of layers and neurons, is ther any logic behind that having an amount of inputs says wicht amount of hidden layers and beurons use on each one? Activatin Functions Also there are many activation functions such as:  ReLu , the common one. Softmax Sigmoid Linear  And more, I listed the ones that I see more, I know there are more and derivations of ReLu function. But my question for this section of building your Model is, Are there any relation between the type of input and the activation function while you are building? Compiling & Training Finally, in the training section I know there are diferent parts you can tune to have done repercussion on the model training and therefore on the result. Such as, the batch_size, the number of epochs, the loss function, the optimizer, etc. Also you can still modify (optimizer)some of those elements or even create your own ones and use it (loss function). But what about the number of epochs and the batch_size? What meaning does they have? I read that the learning rate have a relation with the batch_size used, I mean, low learning rate works better with more batch_size and vice versa. I know my questions are quite ambiguous and quite general, but even seraching I still have them. Thanks for reading me.

Is there a standard and accepted method for selecting the number of layers, and the number of nodes in each layer, in a feed-forward neural network? I'm interested in automated ways of building neural networks.


Is there a way to reset the style options within an mdframed environment so that nested mdframed environments use the default options automatically?  MWE  \documentclass[border=1cm]{standalone}  \usepackage{mdframed}  \begin{document}  \begin{minipage}{0.3\textwidth}     \begin{mdframed}[linecolor=red]          \centering Foo         \begin{mdframed}             \centering Bar         \end{mdframed}     \end{mdframed} \end{minipage}  \end{document}     I would like the inner mdframed environment to use the default options. I've tried:   Saving \mdfdefinestyle{default}{} in the preamble and then using [style=default] for the inner frame Using \mdfset{} after the beginning the first mdframed environment Of course, manually setting [linecolor=black] works, but for more complicated instances (i.e. more custom options), I'd rather have it done automatically

When nesting an mdframed environment in a mdframed environment that uses tikz, it seems that the nested mdframed environment takes on many of the properties of the environment isn't being nested in, replacing its own properties.  These include, well, pretty much everything, including nodes, background color, outer line width (and color), and the rounding of corners, except in the case where the nested mdframed environment also uses tikz, in which case only the node problem exists.  This is illustrated with several different examples below:  \documentclass{article} \usepackage{tikz} \usepackage[framemethod=tikz]{mdframed}  %%%%%%%%%%%%%%%%% mdframed style with node  \tikzset{tetregris/.style = {draw=gray, thick, fill=white, shading = exampletitle, % text=darkgray, rectangle, rounded corners, right,minimum height=.7cm}} \pgfdeclarehorizontalshading{examplebackground}{100bp} {color(0bp)=(black!2); color(100bp)=(teal!30)} \pgfdeclarehorizontalshading{exampletitle}{100bp} {color(0bp)=(black!2);color(100bp)=(purple!20)} \newcounter{example} \renewcommand*\theexample{Example~\arabic{example}} \makeatletter \mdfdefinestyle{examplestyle}{% outerlinewidth=1em,outerlinecolor=white,% leftmargin=-1em,rightmargin=-1em,% middlelinewidth=1.2pt,roundcorner=5pt,linecolor=gray, apptotikzsetting={\tikzset{mdfbackground/.append style ={% shading = examplebackground}}}, innertopmargin=1.2\baselineskip, skipabove={\dimexpr0.5\baselineskip+\topskip\relax}, skipbelow={-1em}, needspace=\baselineskip, frametitlefont=\sffamily\scshape, settings={\global\stepcounter{example}}, singleextra={% \node[tetregris,xshift=-3cm] at (P) % {~\mdf@frametitlefont{\theexample}\hbox{~}}; }, firstextra={% \node[tetregris,xshift=-3cm] at (P) % {~\mdf@frametitlefont{\theexample}\hbox{~}}; }, } \makeatother  %%%%%%%%%%%%%%%%%% simple mdframed style  \global\mdfdefinestyle{simplestyle}{% linecolor=red,linewidth=3pt,% leftmargin=1cm,rightmargin=1cm }  \begin{document}  \begin{mdframed}[style=examplestyle] blah \begin{mdframed}[style=simplestyle] blah \end{mdframed} blah \end{mdframed}  \begin{mdframed}[style=simplestyle] blah \end{mdframed}  \end{document}   The issue persists whether or not there are nodes (or what options they are given, i.e. \singleextra, \doubleextra, etc don't make a different).  The issue does not occur in the opposite scenario with a normal mdframed environment containing an mdframed environment using tikz.    Is there any way to stop the nested mdframed environment from taking the properties from the environment it is contained in?  In particular, is there any way to ensure that the nodes aren't repeated, since this also messes with the numbering?


I'm trying to make a program in Python that takes in an input for how many times to repeat the Fibonacci sequence.   ... i=1 timeNum= input("How many times do you want to repeat the sequence?") while i <= timeNum:     ...     i += 1   How can I force that input to be an integer? I can't have people repeating the sequence 'apple' times? I know it involves int() but I don't know how to use it. Any and all help is appreciated.

In Python, how can I parse a numeric string like "545.2222" to its corresponding float value, 545.2222? Or parse the string "31" to an integer, 31?  I just want to know how to parse a float str to a float, and (separately) an int str to an int.


I'm a secondary school pupil, my physics textbook discussed  atomic physics without deep details because we are young boys, to explain electron motion we first learn about rotational motion. The main problem is that why the electron dose not fall on the nucleus, my textbook said that it doesn't because of centrifugal force, but amazingly I found out in this site that centrifugal force doesn't exist, I told my teacher about this, but he believe that centrifugal force exist, and I will not have any satisfying answer from him. I'm looking for a simple answer (without deep details) that could satisfy such a young asker

I'm having trouble understanding the simple "planetary" model of the atom that I'm being taught in my basic chemistry course.   In particular,    I can't see how a negatively charged electron can stay in "orbit" around a positively charged nucleus. Even if the electron actually orbits the nucleus, wouldn't that orbit eventually decay?  I can't reconcile the rapidly moving electrons required by the planetary model with the way atoms are described as forming bonds. If electrons are zooming around in orbits, how do they suddenly "stop" to form bonds.     I understand that certain aspects of quantum mechanics  to address these problems, and that there are  of atoms. My question here is whether the planetary model itself addresses these concerns in some way (that I'm missing) and whether I'm right to be uncomfortable with it.


I would have thought this is fairly classic, but I haven't found an answer.  I have a form which links to a MySQL (actually MariaDB) database table, contacts. Part of the jQuery.ready() function populates, by AJAX, a drop-down list (i.e. <select id="drop_box" /> for example) with options, which are all the surnames + first names in the contacts table, with value = ID field from the record. Just to clarify, the injected code contains <select> as well as all the options.  Then when the user clicks on/selects one of these names I want the value (ID field) of the option to be sent to a JS/jQuery function, perhaps defined in the <head> tags. The idea would then be another AJAX call to fill various other boxes and tables and things on the page with all the other details plucked from the contacts table.  But how to get either   an existing $("#drop_box").change() function to "see" and respond to events in the injected <select> objet or if injecting the change() functionality, how to get the latter to call an existing function on the page.   It strikes me as bad practice to inject all the response code as a return AJAX call, and anyway I'd just like to know how injected JS code can be made to interact with JS code already on the page.

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


When I've start my system, Ubuntu 14.04, my login screen got stuck, with mouse cursor in middle of the screen. However, sometimes system allow me to enter my credential but the results are same and nothing appeared. After reading , , I've tried to enter in terminal after pressing Ctrl + Alt + F2, but nothing happened and the same screen is appearing. I've attached the screen image below.   I'm using Lenovo Thinkpad E520.        I need your help for this problem. Thank you.

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


Is OS X Mountain Lion a pure UNIX-based OS?  Some tutorials say that it is a Unix-like OS, but after version 10.5, all Mac operating systems are based on pure UNIX.  Is this true?

From my limited knowledge: The Unix OS coder assumes the user knows what they're doing, etc. versus the Apple's you can only do it the way you are allowed to do it, etc.  Compared to other variations of Unix, what are Mac OS X's limitations, but also does it improve the user experience?  To try and clarify the question, it's more the user experience I'd like to read find out about. Although it's of interest that it's certified, that's not so relevant - Linux is not certified, but it's the closest I've come to using Unix up till now.


I have a question that why this code is giving me an error while i am trying to call a static function defined within a class through a class reference and it makes possible to call a static function when i am creating an object of a reference.  public class Example { public static void main(String args[])   { Example t; t.method();//getting error Example t1=new Example t1(); t1.method();//it runs successfully } public static void method() { System.out.println("NullPointerException"); } }

Consider this:  public class TestClass {      private String a;     private String b;      public TestClass()     {     a = "initialized";     }      public void doSomething()     {     String c;          a.notify(); // This is fine     b.notify(); // This is fine - but will end in an exception     c.notify(); // "Local variable c may not have been initialised"     }  }   I don't get it. "b" is never initialized but will give the same run-time error as "c", which is a compile-time error. Why the difference between local variables and members?  Edit: making the members private was my initial intention, and the question still stands...


If the eggs are little bit old, and I used the egg whites to make Italian meringue, is it safe to it ?  Egg whites could contain salmonella, and especially in my country where eggs are sold locally from local farms without being tested. I have the eggs in the refrigerator since 2 weeks, and sometimes I make scrambled or boiled eggs with them, but could I eat meringue with them that is made by adding hot syrup (Italian meringue) ?   The syrup will cook the whites or there still a danger of eating it ?

If cooking meat kills bacteria, and bacteria are responsible for problems with eating meat which has been left out, then why is it dangerous to eat meat which has been left out at room temperature and then thoroughly cooked?   mentions that "Even if the bacteria is dead, toxins can remain if the food was out too long, causing problems".  However, there's no further detail given.  Are these toxins as dangerous as the bacteria themselves?  How long does meat have to be left out to accumulate a dangerous level of toxins and thus be dangerous even if thoroughly cooked?  Are these toxins the reason for the usual guideline of keeping meat unrefrigerated for a maximum of 2 hours?  update  The revelation, courtesy of Aaronut, that e. coli is actually dangerous because of its toxins — which cannot be denatured at temperatures which will leave meat in an edible state — has pretty much answered this question.  And also given me further incentive to stop eating meat altogether :)  Our discussion (see the comments on hobodave's answer) has progressed into the realm of microbiology.  Some highlights from my ongoing research:  .  These seem to be the reason for the importance of keeping meat at a high temperature for a period of time.  .  This also provides fascinating insight into how bacteria evolved immunity to antibiotics.  Fungi.


Regarding: Let $a_{1},a_{2},a_{3},b_{1},b_{2},b_{3} \in \mathbb{R}$, while $a_{1},a_{2},a_{3}>0$ and $b_{1}<b_{2}<b_{3}$. Prove that the equation $$\frac{a_{1}}{x-b_{1}}+\frac{a_{2}}{x-b_{2}}+\frac{a_{3}}{x-b_{3}}=0$$ has exactly two distinct solutions in $\mathbb{R}$. -- So I have tried defining a function $f$ which is equal to the left side of the equation, derivate it, and assume by contradiction that it has more than 2 solution. Unfortunately with no luck... If someone knows a way, please only give me a hint so I can solve it by myself. Thanks a lot!

Question:  Given $\lambda_1<\lambda_2<\lambda_3 \in \Bbb R, a_1,a_2,a_3>0 $  Show that this equation has exactly 2 solutions:  $\frac {a_1}{x-\lambda_1}+\frac {a_2}{x-\lambda_2}+\frac {a_3}{x-\lambda_3}=0$  What I did: Try 1: Since we are studying continuity, Weirstrass theorem and Mean value theorem at the moment, I think one of these theorems should somehow be involved in the proof... Assuming that x is not equal to any of the lambdas I multiplied by the denumerators and got a quadratic equation- From this I figure that there must be at most 2 solutions. I thought about using the discriminant to prove that that there are exactly 2, but the calculation is very long, and I don't think this is what the lecturer intended for us to do, considering what we are studying now.  Try 2: Thought of using the Intermediate value theorem. So I defined a function $f(x)=\frac {a_1}{x-\lambda_1}+\frac {a_2}{x-\lambda_2}+\frac {a_3}{x-\lambda_3}$ and I want to find when it equals 0.  but Intermediate value theorem only involves two lambdas, and also I don't know if the lambdas are negative or positive (some/all of them)- Should I divide to cases?  Hints are welcome at first :-)


A company manager bought a new safe and want out of his 11 employees only a group of 6 together to be able to open it, so he decided to put more than one lock on the safe and give each emplyee an amount of keys to part of the locks, what's the least amount of keys and locks possible to achieve the manager goal?

There are 8 crew members, The leading member wants that only a crew of 5 people or more could open a safe he bought, To each member he gave equal amount of keys, and locked the safe with several locks.  What's the minimal number of locks he should put:   at least 5 crew members would be required to open the safe? Any team of 5 crew members could open the safe, but none of the 4 team crew members.   1,2 stands individually of course.


I'm getting the following dialog from time to time when playing music from my external HD (Seagate Expansion+ 2TB):  Whenever that happens, my music player (cmus) skips to the next track.  This happens with any music player I use, it doesn't happen all the time though. If not solving the issue, I'd like to no longer get these dialog popups, as they come in groups of 3-4, and often cannot be closed at all. Update I'd like to also note that my Seagate Hard Drive is connected through an i-tec USB 3.0 Docking Station, in case it's relevant.

Problem statement: I have an external USB drive that won't mount.   Context:   I neither have nor desire access to MS Windows.  See 1.  External USB drive is NTFS formated. There is no RAID. I've been a Linux user for many years and am not afraid of the CLI.  I would rather not wipe it and start from scratch but it isn't critical if I can't avoid it.    Error looks like:  Error mounting /dev/sdc1 at /media/dude/External HD: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000" "/dev/sdc1" "/media/dude/External HD"' exited with non-zero exit status 13: $MFTMirr does not match $MFT (record 0). Failed to mount '/dev/sdc1': Input/output error NTFS is either inconsistent, or there is a hardware fault, or it's a SoftRAID/FakeRAID hardware. In the first case run chkdsk /f on Windows then reboot into Windows twice. The usage of the /f parameter is very important! If the device is a SoftRAID/FakeRAID then first activate it and mount a different device under the /dev/mapper/ directory, (e.g. /dev/mapper/nvidia_eahaabcc1). Please see the 'dmraid' documentation for more details.  (udisks-error-quark, 0)


Understanding when $$\lim_{n \to \infty} \frac{a_n}{b_n} = \lim_{n \to \infty} \frac{a_0 + a_1+ \cdots + a_n}{b_0+b_1+ \cdots + b_n}.$$  That is, supposing the first limit exists, what properties must be satisfied by the sequences $\{a_n\}_{n \ge 0}, \{b_n\}_{n \ge 0}$ such that we may conclude that the above equality holds? I tried using the inequality $\frac{a_n}{b_n} + \frac{a_{n-1}}{b_{n-1}} < \frac{a_n+a_{n-1}}{b_n + b_{n-1}}$, which holds when our sequences consist of positive real numbers, having in mind the notion of applying induction but didn't get anywhere with that idea. This isn't a homework assignment, I just want to know the answer.

I have to give a presentation on the theorem in Real Analysis with a fellow student. While I've looked over the  and verified that, yes, step B does indeed follow logically from step A, etc. and have internalized the proof to the extent that I can replicate it myself on paper, I still feel that I have made little progress as to why this theorem works the way it does, i.e. what is the intuition behind the theorem, such that it should make sense that it follows the way it does. Therefore I ask: what kind of intuition is there about this theorem? It would also be helpful to understand how the theorem can be used effectively in analysis.  I have seen it referred to as a sort of L'Hopital's rule for sequences, which certainly seems to make sense, but I similarly have little intuitive understanding of how that rule works, either.  I am asking this question not only for my personal understanding, but also for the sake of being able to present it in an illuminating manner, such that the rest of the class can also come away with the same sort of intuition of how the theorem works and how it is useful. Any help would be greatly appreciated.  EDIT: I should point out that the formulation of the theorem we are being tasked to prove is the following:  Let $\lbrace a_n \rbrace$, $\lbrace b_n \rbrace$ be sequences, ${b_n}$ strictly increasing and unbounded. Then if $\lim\limits_{n \to \infty} \frac {a_{n+1} - a_n}{b_{n+1} - b_n} = l$ for some $l \in \mathbb R$, then $\lim\limits_{n \to \infty} \frac{a_n}{b_n} = l$ also.


In trying to cook up a toy/reference implementation of a , I've run into the following puzzle: The author requires, to generate a signature, a one-way function $G:M\to \binom{\{1, \cdots, n'\}}{n''}$; that is, to map messages to $n''$-element subsets of the user's $n'$-element key.  The author himself only bothered to propose an awkward partial function based on iterative integer division with few usefulness guarantees  Other implementers have proposed functions that constrain $n'=2n''$ and use each bit of an $n:=n''$-bit digest of the message to select from each pair of elements $(k_{2i-1}, k_{2i})$ of the user's key   However, I'm wondering if there is a bijective function that exists for this (likely imposing a different constraint on the values of $n'$ and $n''$). The author himself "hope[s] that someone can find a more elegant method" for this mapping.  So if there are exactly $\binom{n'}{n''}$ possible signatures that might be produced—which are $n''$-element subsets of an $n'$-element Lamport key—and we assume that $G$ will be constructed from an existing $n$-bit cryptographic hash function $\phi_n$—which will have a range of $\left\{0,1\right\}^n$—I suppose the question of whether any bijective construction of $G$ from $\phi_n$ exists reduces to the question of whether any natural-number solutions to this exist: $$2^n=\binom{n'}{n''}$$ Wolfram Alpha  some trivial, small solutions (such as $(3,8,7)$) but I'm unclear whether solutions to this exist with the following criteria-  at the scale of cryptographic usefulness ($n\sim256$)  nontrivially ($n'-n''>1,n''>1$)   Do any such solutions exist? What are some examples, or a canonical example? (Have I even proposed the right equation?—If not, ditto the above, but for the appropriate equation for the case of constructing $G$ for a Lamport signature.)

I would like a proof that $$ {{n}\choose{k}} = \frac{n!}{k!(n-k)!} = 2^m $$ for $n,k,m\in \mathbb{N}$, only if $k=1$ or $k=n-1$.  It seems to me that this must be true since for other values of $k$ the numerator contains more factors that are not powers of 2 than the denominator. Furthermore, the numerator also contains larger factors than the denominator and thus can't all be cancelled. Nevertheless, I have been unable to form an elegant, watertight proof.


This integral is tabulated in Gradshetyn and Ryzhik. The  Mathematica gives nice results only for particular values of $a$ and $b$. Can one prove this result?

How to solve the following integral $$\int_{0}^{\infty} \frac{ \ln x}{(x+a)(x+b)} dx,$$ where $a,b>0$ and $a \neq b$. I was looking for some kind of substitution. However, I don't see an obvious one.  Thanks!


I have had this question since quite a while, not even some book i've read about relativity mention this issue. I suspect the concept is absorbed by four-angular momentum.

In classical mechanics with 3 space dimensions the orbital angular momentum is defined as  $$\mathbf{L} = \mathbf{r} \times \mathbf{p}.$$  In relativistic mechanics we have the 4-vectors $x^{\mu}$ and $p^{\mu}$, but the cross product in only defined for 3 dimensions. So how to define orbital angular momentum e.g. in special relativity in terms of 4-vectors? Or more generally in $d$ dimensions?


When referring to flash exposure, what does "max sync speed" mean?

What exactly is flash sync speed and should it be a factor in a buying decision?


Im quite new to blender and i was wondering why my glass jar becomes black in cycles render.Here is the photo  The first photo is on eevie render while the second photo is on cycles render

My model has a clear plastic (or glass) dome with objects inside.  The objects appear dark.  I've tried the glass shader with color 100% RGB, with very small IOR, and using just a refraction shader.    I know Cycles has problems with caustics, but I just want broad illumination to fall clean through the glass.  The light-to-column path can ignore refraction, but is blocked or tremendously attenuated. The camera-column path needs refraction, and seems to work fine anyway.  This demo image offers all optical paths of interest:   light upon object, seen directly light upon object, seen through glass (looks okay) light through glass onto object, seen directly. This is the shadow on the lit side of the column just below the glass tubing.  I expect full illumination, but there is shadow.  There is some light, but it's diffuse light from the floor. light through glass onto object, seen through glass. This     I did at one point try non-progressive rendering, and find extremely coarse light where there shouldn't be shadow, but this is not a practical way to make nice images. I've even tried cranking up certain sampling settings to many thousands, but still get bad noise though less, at the cost of long render times. I  would like to finish my creations sometime before "Star Trek, the Generation After the Next" becomes real life, if you know what I mean.  The next image is an example. I think Transmission in Sampling was 5000, but not sure.    I'm using Cycles in Blender 2.67 on a quad core Linux machine, 16GB RAM. Machine limits have never been a problem for 3D rendering.  Possibly, I screwed up some setting when I made my startup file, and just need to fix it. OTOH maybe this is just a limitation of path tracing, or of the way Cycles does it. If that's the case, what to real-world Blender artists do when they need to produce images on a budget and schedule?  What is the practical real-world fix?


I have been noticing over the last month (on Stack Overflow), that simpler (perhaps somewhat duplicate) questions seem to get a lot of attention, as compared to the more challenging long-ish questions.  As a result, the answers tend to receive a greater number of upvotes (simply due to greater views) even though the answer might be a copy of an already existing Q/A. Moderators do take care to mark most of these questions as [duplicate], but many slip through. What could be a possible solution to this?

In short, :     If you go before the Board of   Directors and ask for 1.5 billion   dollars to build a nuclear reactor, no   one will review or discuss the details   of the plant. They will assume that   experts have been over every inch of   the plans, and not want to look   foolish by asking a silly question.      However, if you ask the same group to   approve a 30 dollar expenditure for   lumber with which to build a bikeshed   (presumably a British term for the   smallest possible building) then be   prepared for a 45 minute discussion   about all aspects of the bikeshed,   including the color of the paint. The   explanation for this is that everyone   can grasp the scale of a bikeshed.   To transform this problem to Stack Overflow terms, questions that are trivial such as "How to convert a C string to a QString or "What is the difference between . and ->" get a lot more views, answers and votes than real questions of the form "How do I frob this widget" that bother real professionals. Fewer views mean less possible votes for good answers and hence less incentive for people to answer.  How can Stack Exchange solve this problem?


Say I wanna go Malaga to Rio and the search engine offers me several options with layover at Paris CDG ranging from one to five hours.  Is there any way to tweak the results to have at least 14 hours of layover or even have the connecting flight depart the next day, so one can see Paris?  More specific: How can I combine flights to and from the hub myself, but have the advantages of the through-ticket (e.g. being safe, if one of the flights is cancelled or extremely delayed)?  (cities named are just token examples and don't need to be met specifically)

I want to visit some countries my flights transit through. I live in Pakistan and flights to America often transit through the UK or Europe. Flights to Europe mostly transit from Middle East. I assume that I need to have a regular visit Visa for these countries.  Can I book some flight that allows me to exit the airport and stay about 2-3 days (48-72 hours) in the country I'm transiting through?


I used the term "poor man's ____" to talk about a less expensive but less useful alternative. One of my colleagues called me out that some people might find it offensive. Is there another term I could use instead?

I'm looking for a more politically correct substitute for the expression "poor man's", meaning an inferior improvised or makeshift substitute. Usage examples:   "Guncotton is the poor man's TNT" "Poor man's oyster" (mussels, or coughed up phlegm)    My hesitance is mainly because it is not as gender neutral as perhaps it once was. The closest I can think of is "pauper's", but I don't know many examples of usage.


I am trying to obtain a list of speed values from my table in my database. I was wondering if their was an SQL command/method which would allow me to pass a list of CharIDs in the WHERE function, so that I would not have to create a FOR loop and carry out the four searches separately.  party_ids= [4, 3, 1, 2]  def initializegame(party_ids):     #Get selected party members IDS     print(party_ids)     #Obtain Speeds     fetchspeed=("SELECT startspeed FROM characters WHERE CharID=%s")     print(fetchspeed)     mycursor.execute(fetchspeed,party_ids)     myspeeds=mycursor.fetchall()     print(myspeeds)     print("done")   I'm relatively new to SQL and I may be missing something major.  I did try:  Yet that was a little too hard to follow.  Thanks in advance

I know how to map a list to a string:  foostring = ",".join( map(str, list_of_ids) )   And I know that I can use the following to get that string into an IN clause:  cursor.execute("DELETE FROM foo.bar WHERE baz IN ('%s')" % (foostring))   What I need is to accomplish the same thing SAFELY (avoiding SQL injection) using MySQLDB. In the above example because foostring is not passed as an argument to execute, it is vulnerable. I also have to quote and escape outside of the mysql library.   (There is a , but the answers listed there either do not work for MySQLDB or are vulnerable to SQL injection.)


I am getting following error when trying to use external bibliography library:  Package biblatex Error: Patching 'babel' package failed. \begin{document}   From what I know, this is probably caused by a bug. However, I didn't find any suitable solutions. I am using TeXstudio (Windows) and installing packages is quite difficult. Whenever I find out I need a new package, I need to install it before the document can be compiled. Basically I am installing new packages on the fly. Could it be caused by incomplete libraries? Should I reinstall TeXstudio?  This is how TeXstudio looks like on Windows:   This is my preamble in lab01.tex (before \begin{document}):  \documentclass[12pt,twoside,a4paper]{article} \usepackage[czech]{babel} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{float} \usepackage{lmodern} \usepackage{graphicx} \usepackage{attachfile} \usepackage{subcaption} \usepackage{cleveref} \usepackage[document]{ragged2e} \usepackage{textcomp} \usepackage{gensymb}  \usepackage[ backend=biber, style=alphabetic, citestyle=authoryear ]{biblatex} \addbibresource{lab01.bib}  \usepackage{siunitx} \sisetup{     detect-mode,     detect-family,     detect-inline-family=math,     group-separator={.},     group-minimum-digits={3},     output-decimal-marker={,} }  \captionsetup[subfigure]{subrefformat=simple,labelformat=simple} \renewcommand\thesubfigure{(\alph{subfigure})}  \title{Výkonové polovodičové systémy~I \textemdash\ Laboratorní úloha č.~1\\ \large \emph{Řízený dvoupulzní usměrňovač}} \author{Marek Poláček (POL0423)\\ VŠB \textendash\ Technická univerzita Ostrava,\\ Fakulta elektrotechniky a~informatiky.} \date{\today}   This is content of lab01.bib:  @book{book:ZČU,     author = {VONDRÁŠEK, František},     title = {Výkonová elektronika},     date = {1998},     volume = {svazek~II},     publisher = {Západočeská univerzita},     location = {Plzeň},     isbn = {80-7082-485-9}, }  @book{book:ČVUT,     author = {PAVELKA, Jiří a~ÚČEŘOVSKÝ Zdeněk},     title = {Výkonová elektronika},     date = {2000},     edition = {Vydání~2.},     publisher = {ČVUT},     location = {Praha},     isbn = {80-01-02094-0}, }

I am trying to use babel and biblatex package together but I am getting following error:    ! Package biblatex Error: Patching 'babel' package failed.    This is my code example:  \documentclass[12pt,a4paper,twoside,openright]{book} \usepackage{cmap} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[slovak]{babel} \usepackage{xpatch} \usepackage{csquotes} \usepackage{biblatex} \begin{document} \enquote{quote} \end{document}   I would need the result look like this:    Well, it seems like I could get rid of the error when using xpatch package, but it works only when I delete 'slovak' option for babel package. That way the result look like this:    Please, is there any workaround for this problem? I am really stuck in this.


I just moved from Ubuntu to Mint. I installed TexMaker on the new system and now it won't produce a pdf for even a minimal document:  \documentclass{article} \begin{document} \end{document}   TexMaker does make the aux and log files and is not throwing any errors. Here is my log file   This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013/Debian) (format=pdflatex 2013.12.5) 6 DEC 2013 15:17 entering extended mode restricted \write18 enabled. %&-line parsing enabled. **Test.tex (./Test.tex LaTeX2e <2011/06/27> Babel <3.9f> and hyphenation patterns for 2 languages loaded. (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2007/10/19 v1.4h Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size10.clo File: size10.clo 2007/10/19 v1.4h Standard LaTeX file (size option) ) \c@part=\count79 \c@section=\count80 \c@subsection=\count81 \c@subsubsection=\count82 \c@paragraph=\count83 \c@subparagraph=\count84 \c@figure=\count85 \c@table=\count86 \abovecaptionskip=\skip41 \belowcaptionskip=\skip42 \bibindent=\dimen102 ) No file Test.aux. \openout1 = `Test.aux'. LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 2. LaTeX Font Info: ... okay on input line 2. LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 2. LaTeX Font Info: ... okay on input line 2. LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 2. LaTeX Font Info: ... okay on input line 2. LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 2. LaTeX Font Info: ... okay on input line 2. LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 2. LaTeX Font Info: ... okay on input line 2. LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 2. LaTeX Font Info: ... okay on input line 2. (./Test.aux) ) Here is how much of TeX's memory you used: 197 strings out of 495031 2091 string characters out of 6181531 46622 words of memory out of 5000000 3494 multiletter control sequences out of 15000+600000 3640 words of font info for 14 fonts, out of 8000000 for 9000 14 hyphenation exceptions out of 8191 23i,1n,17p,151b,36s stack positions out of 5000i,500n,10000p,200000b,80000s No pages of output. PDF statistics: 0 PDF objects out of 1000 (max. 8388607) 0 named destinations out of 1000 (max. 500000) 1 words of extra memory for PDF output out of 10000 (max. 10000000)   Unlike any other time I've installed TexMaker on a linux distro, TexLive was downloaded automatically. This time I had to install it myself. I'm wondering if maybe there is some other package that I'm missing that is necessary for creating the pdf? Otherwise I'm at a bit of a loss.

I'm using Pluma (basically gedit) with a plugin I found to help with tex documents and it does this very well, I just started a new one and activated the preview (because I'll want it at some point) and I have found that an empty document is an error!  \documentclass{report}  \begin{document}  \end{document}   This gives an error about the PDF file not existing, why?  Is it some bug, what could possibly require there to be text for it to work? Adding even a single letter fixes this.  The engine used was "rubber" by the way.


A selfie is a photograph a person takes of themself.  By this definition, the antonym of selfie must be a photograph of oneself taken by somebody else. In selfie the i can be taken to mean “taken by me (I)”. In that case, in selfue the u would mean “taken by you”.  Is it possible that this word could arise and be used?

I am looking for an antonym of selfie, meaning a photo/portrait of others.  The ancient Greek word for self is like auto, and what I am looking for is an English word for hetero (its opposite). Do you have any idea of that?


I am using visual studio community 2015. Now when I need some debug info I am using System.Diagnostics.Debug.WriteLine. I would like to know if there is a way to do the same with objects/classes like in javascript's console.dir() For example someObject = { x: 1, y: true, z: "some text"} console.dir(someObject);  give me  I like to get this info to check (for example) parameters that I send to event handlers functions. Thanks

So for viewing a current object's state at runtime, I really like what the Visual Studio Immediate window gives me.  Just doing a simple  ? objectname   Will give me a nicely formatted 'dump' of the object.    Is there an easy way to do this in code, so I can do something similar when logging?


.hi im super noob with Blender. I modelled a simple character and when I render this character the body mesh shows up all right, but the eyes are completely blacked out instead of white with small black pupils.___=====+++++ I did search around for a few days straight and feels like im just going in circles. I went through the outliner, im really pretty useless with the node window but I did open that as well and look around. tried some other parenting tricks I thought might help, no dice.however, to make the eyes appear I went through object view, went to the modifiers tab and closed the targets for the eyes, this would make the eyeballs appear in the render but they didnt really follow the armature at all, so thats not what I want.  any suggestions I would definitely appreciate it. heres the most recent version or .blend file *^&&&7&997^&&(^(^&^&&^^&(^(&(&&^^&9

This is meant to solve this problem once and for all. What is every reason an object isn't showing up in a render or viewport in when using the cycles render engine?


Please show me how can I prove this relation: $$P(A \cap B) = P(A) \cap P(B)$$ I have no idea how to prove these kind of relations that include power sets.

It would be great if someone could verify this proof.  Theorem:  $\mathcal{P}(A \cap B) = \mathcal{P}(A) \cap \mathcal{P}(B)$  Proof:  First I prove that $\mathcal{P}(A \cap B) \subseteq \mathcal{P}(A) \cap \mathcal{P}(B)$. Take any subset $X \subseteq A \cap B$. Then $X \in \mathcal{P}(A \cap B)$. Also, $X \subseteq A \wedge X \subseteq B$, meaning that $X \in \mathcal{P}(A) \wedge X \in \mathcal{P}(B)$. This, again, means that $X \in \mathcal{P}(A) \cap \mathcal{P}(B)$, and this proves the statement.  Then I prove that $\mathcal{P}(A) \cap \mathcal{P}(B) \subseteq \mathcal{P}(A \cap B)$. Again,  take any subset $X \subseteq A \cap B$. Using just the same arguments as above, this is also a truth.  The theorem follows.


For a smooth closed manifold $M$, and for any self homeomorphism $f:M\to M$, is there a self-diffeomorphism $g:M\to M$ homotopic to $f$? Actually I'm interested in the following special case of Dehn twist: For an embedded circle $C$ in an oriented surface $S$, the closed tubular neighborhood can be identified with $C\times [0,1]$. Define $f:S\to S$ by $f(\theta,t)=(\theta+2\pi t,t)$ on $C\times [0,1]$ and identity outside $C\times [0,1]$. This is a self-homeomorphism of $S$ and is called the (right-handed) Dehn twist along $C$. But I've seen that in some book this $f$ is a diffeomorphism, so it seems it is homotopic to a diffeomorphism $S\to S$.

Given a smooth manifold $M$, is every homeomorphism $M \to M$ homotopic to a diffeomorphism?   Hirsch's "Differential Topology" has a proof that every $C^1$ diffeomorphism of smooth manifolds is homotopic to a $C^\infty$ one, but as far as I can tell, says nothing about the case of $C^0$ automorphisms.  If false in general, is the above claim true in dimensions at most $3$? (If somehow false because of exotic smooth structures - is it true for topological manifolds supporting only one smooth structure?)


I cannot determine why this does not compile unless I remove amsthm which I normally include, though I don't exactly know why.  \documentclass{article} \usepackage{amsthm} \usepackage{mathtools, thmtools}  \usepackage[capitalize]{cleveref}   \declaretheorem[style=plain,numberwithin=section,name=Theorem]{theorem} \declaretheorem[style=plain,sibling=theorem,name=Lemma]{lemma} \usepackage{hyperref}  \begin{document}  \begin{theorem} This is a test. \end{theorem}  \begin{lemma} This is a test. \end{lemma}  \end{document}

The hyperref documentation says: "Make sure it comes last of your loaded packages". The reason is that it redefines many LaTeX commands. It's a rule of thumb that helps to avoid errors.  However, there are exceptions, for instance the amsrefs user's guide notes that amsrefs has to be loaded after hyperref.  To avoid problems when adding hypertext functionality: do you know further such exceptions?


How did the usage of silent letters came into being? For example : what is the use of 'k' in knife or 'p' in pneumonia ?

Why have a letter in a word when it’s silent in pronunciation, like the b in debt?  Can anyone please clarify my uncertainty here?


Suppose a program cook takes one argument: the pathname of a text file containing the recipe of the food to cook. Suppose I wish to call this program from within a bash script, also suppose I already have the recipe in a string variable:  #!/bin/bash  the_recipe="$(cat << EOF wash cucumbers wash knife slice cucumbers EOF )"  cook ...  # What should I do here? It expects a file, but I only have a string.   How can I pass the recipe to the command when it expects a filename argument?  I thought about creating a temporary file just for the purpose passing a file, but I wish to know if there are alternative ways to solve this problem.

Per man definition, this command gets the input from a file.  $ command -r FILENAME   Suppose that FILENAME is a file containing a list of filenames, as it was generated using ls > FILENAME.  How can I, instead, feed the command with the result of ls directly? In my head something like this should be possible:  $ ls | command -r  But it doesn't, the output of ls doesn't get hooked as an argument. Output:  Usage: command -r FILENAME error: -r option requires an argument   How could I obtain the desired effect?


Considering the following construct that controls strings:   if input_ == "Option1":     print "Option 1" elif input_ == "Option2":     print "Option 2" else:     print "Option x"   Is there any way to make Option1 and Option2 to accept any capitalized characters (such as "option1", "OpTion1", "OPTION1" etc...)?

How can I do case insensitive string comparison in Python?  I would like to encapsulate comparison of a regular strings to a repository string using in a very simple and Pythonic way. I also would like to have ability to look up values in a dict hashed by strings using regular python strings.


Question:  $$ f_1 (x) = \sqrt {1+\sqrt {x} } $$ $$ f_2 (x) = \sqrt{1+ \sqrt {1+2 \sqrt {x} } } $$ $$ f_3 (x) = \sqrt {1+ \sqrt {1+2 \sqrt {1+3 \sqrt {x} } } } $$ ... and so on to $$ f_n (x) = \sqrt {1+\sqrt{1+2 \sqrt {1+3 \sqrt {\ldots \sqrt {1+n \sqrt {x} } } } } } $$ Evaluate this function as n tends to infinity.  Or logically: Find $ \displaystyle{\lim_{n \to \infty}} f_n (x) $ .  MyProblem: Ramanujan discovered $$ x+n+a=\sqrt{ax + (n+a)^2 +x \sqrt{a(x+n)+(n+a)^2 +(x+n) \sqrt{\ldots}}} $$ which gives the special cases $$ x+1=\sqrt{1+x \sqrt{1 + (x+1) \sqrt{1 + (x+2) \sqrt{1 + (x+2) \sqrt{\ldots}}}}}$$ for x=2 , n=1 and a=0 $$3= \sqrt{1+2 \sqrt{1+3 \sqrt{1+ 4 \sqrt{1+\cdots}}}}$$  Is there any proof of this discovery?Without proof I don’t think that the problem should be solved in this way.And if there is a proof please share it and also tell your approach to solve it.

How does one prove the following limit? $$   \lim_{n \to \infty}   \sqrt{1 + 2 \sqrt{1 + 3 \sqrt{1 + \cdots \sqrt{1 + (n - 1) \sqrt{1 + n}}}}} = 3. $$


In C#, in a switch statement non constant values are not allowed in a case label. If you need to support non constant values then you have to use an if statement.  My question is rather simple: Is switch internally implemented in such a way that restricting to constant values allows some kind of optimization that otherwise couldn't be done? What I'm basically asking is if these two code snippets would perform exactly the same:  switch (myEnumVariable) {      case MyEnum.Value1:         ....         break;      case MyEnum.Value2:         .....       ....      default:         .... }  if (myEnumVariable == MyEnum.Type1) {     .... } else if (myEnumVariable == MyEnum.Type2) {     .... } ... else {     .... }   Or does the switch statement have an advantage due to it's restriction. If not, why have the restriction?

When writing a switch statement, there appears to be two limitations on what you can switch on in case statements.  For example (and yes, I know, if you're doing this sort of thing it probably means your  (OO) architecture is iffy - this is just a contrived example!),    Type t = typeof(int);    switch (t) {      case typeof(int):       Console.WriteLine("int!");       break;      case typeof(string):       Console.WriteLine("string!");       break;      default:       Console.WriteLine("unknown!");       break;   }   Here the switch() statement fails with 'A value of an integral type expected' and the case statements fail with 'A constant value is expected'.  Why are these restrictions in place, and what is the underlying justification? I don't see any reason why the switch statement has to succumb to static analysis only, and why the value being switched on has to be integral (that is,  primitive). What is the justification?


need to add new key/value pair in existing dictionary.  I beleive there should be the way of doing it with declarative style something like       new_data = [x['new_key']=1 for x in simplejson.loads(data)]   (gives syntax error)  how to do something similar ?   EDIT: I need not to merge, but edit existed dict or create or duplicate

I have two Python dictionaries, and I want to write a single expression that returns these two dictionaries, merged (i.e. taking the union).  The update() method would be what I need, if it returned its result instead of modifying a dictionary in-place. >>> x = {'a': 1, 'b': 2} >>> y = {'b': 10, 'c': 11} >>> z = x.update(y) >>> print(z) None >>> x {'a': 1, 'b': 10, 'c': 11}  How can I get that final merged dictionary in z, not x? (To be extra-clear, the last-one-wins conflict-handling of dict.update() is what I'm looking for as well.)


I just did a minor upgrade, and then I suddenly started having Java Problems.    The stack trace looks like:   java.awt.AWTError: Assistive Technology not found: org.GNOME.Accessibility.AtkWrapper     at java.desktop/java.awt.Toolkit.newAWTError(Toolkit.java:472)     at java.desktop/java.awt.Toolkit.fallbackToLoadClassForAT(Toolkit.java:488)     at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183)     at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177)     at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1608)     at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484)     at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474)     at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150)     at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173)     at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234)     at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497)     at java.desktop/java.awt.Toolkit.loadAssistiveTechnologies(Toolkit.java:532)     at java.desktop/java.awt.Toolkit.getDefaultToolkit(Toolkit.java:613)     at java.desktop/java.awt.Window.getToolkit(Window.java:1375)     at java.desktop/java.awt.Window.init(Window.java:518)     at java.desktop/java.awt.Window.(Window.java:549)     at java.desktop/java.awt.Frame.(Frame.java:423)     at java.desktop/java.awt.Frame.(Frame.java:388)     at java.desktop/javax.swing.JFrame.(JFrame.java:180)     at rga.hack.SlideShow.(SlideShow.java:293)     at rga.hack.SlideShow.main(SlideShow.java:674) Caused by: java.lang.ClassNotFoundException: org.GNOME.Accessibility.AtkWrapper     at java.base/jdk.internal.loader.BuiltinClassLoader.loadClass(BuiltinClassLoader.java:582)     at java.base/jdk.internal.loader.ClassLoaders$AppClassLoader.loadClass(ClassLoaders.java:190)     at java.base/java.lang.ClassLoader.loadClass(ClassLoader.java:499)     at java.base/java.lang.Class.forName0(Native Method)     at java.base/java.lang.Class.forName(Class.java:374)     at java.desktop/java.awt.Toolkit.fallbackToLoadClassForAT(Toolkit.java:485)     ... 19 more   I have both openjdk-11-jre and openjdk-11-jre-headless installed as well as libatk-wrapper-java and libatk-wrapper-java-jni installed.  The java code I'm using is an old program I wrote myself, but it was working fine until the last update.  I can make the problem go away by commenting out the line in /etc/java-11-openjdk/accessibility.properites, but I suspect that there is a broken dependency in one of the packages I recently installed.  The following packages were installed in the update:   Upgraded the following packages: accountsservice (0.6.45-1ubuntu1) to 0.6.45-1ubuntu1pop2 console-setup (1.178ubuntu2.3) to 1.178ubuntu2.6 console-setup-linux (1.178ubuntu2.3) to 1.178ubuntu2.6 gir1.2-accountsservice-1.0 (0.6.45-1ubuntu1) to 0.6.45-1ubuntu1pop2 gnome-initial-setup (3.28.0-2ubuntu6.16.04.1) to 3.28.0-2ubuntu6.16.04.2system76.1 keyboard-configuration (1.178ubuntu2.3) to 1.178ubuntu2.6 libaccountsservice0 (0.6.45-1ubuntu1) to 0.6.45-1ubuntu1pop2 palemoon (27.9.4~binaryrepack-1) to 28.0.0~repack-3   As the error is gnome related, I'm blaming the gnome-initial-setup package, but I'm wondering if anybody knows more about this than I do.

I tried it and the errors are:  Exception in thread "main" java.awt.AWTError: Assistive Technology not found: org.GNOME.Accessibility.AtkWrapper at java.desktop/java.awt.Toolkit.newAWTError(Toolkit.java:472) at java.desktop/java.awt.Toolkit.fallbackToLoadClassForAT(Toolkit.java:488) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1608) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at java.desktop/java.awt.Toolkit.loadAssistiveTechnologies(Toolkit.java:532) at java.desktop/java.awt.Toolkit.getDefaultToolkit(Toolkit.java:613) at java.desktop/javax.swing.UIManager.getSystemLookAndFeelClassName(UIManager.java:660) at com.cburch.logisim.gui.start.Startup.parseArgs(Startup.java:250) at com.cburch.logisim.Main.main(Main.java:32)   The error seems to be...     Caused by: java.lang.ClassNotFoundException: org.GNOME.Accessibility.AtkWrapper       at  java.base/jdk.internal.loader.BuiltinClassLoader.loadClass(BuiltinClassLoader.java:582)       at   java.base/jdk.internal.loader.ClassLoaders$AppClassLoader.loadClass(ClassLoaders.java:190)       at java.base/java.lang.ClassLoader.loadClass(ClassLoader.java:499)       at java.base/java.lang.Class.forName0(Native Method)       at java.base/java.lang.Class.forName(Class.java:374)       at java.desktop/java.awt.Toolkit.fallbackToLoadClassForAT(Toolkit.java:485)       ... 14 more     OUTPUT for  apt-cache policy logicsim logisim  logisim:   Installed: 2.7.1~dfsg-1   Candidate: 2.7.1~dfsg-1   Version table:  *** 2.7.1~dfsg-1 500         500 http://in.archive.ubuntu.com/ubuntu bionic/universe amd64 Packages         500 http://in.archive.ubuntu.com/ubuntu bionic/universe i386 Packages         100 /var/lib/dpkg/status N: Unable to locate package logicsim   OUTPUT for update-java-alternatives -l  java-1.11.0-openjdk-amd64      1101       /usr/lib/jvm/java-1.11.0-openjdk-amd64 java-1.8.0-openjdk-amd64       1081       /usr/lib/jvm/java-1.8.0-openjdk-amd64


If   $$f(x) = \frac{4^x}{4^x+2} $$   then find the value of   $$f\left(\frac{1}{1999}\right) + f\left(\frac{2}{1999}\right) + f\left(\frac{3}{1999}\right) +\cdots+f\left(\frac{1999}{1999}\right).$$    I tried it by changing expression to  $$f(x) =1 - \frac{2}{4^x+2}$$ but I am not able to cancel any term.  Is there is any other trick to do it? Thanks in advance.


Does an action to stand up from being knocked prone generate an attack of opportunity (like it does in some earlier editions), or is it only if the target leaves the attacker's reach?

What provokes an opportunity attack?  In 3.X moving out of a threatened square, standing up from prone, casting a spell (unless cast defensively), or making a ranged attack provoked, while in 4e moving out of a threatened square or making a ranged/area attack provoked.


I'm looking at this table that suggests a 0.5mm2 cable could withstand 720W at 3A.    At the same time I used a cable size calculator online to determine the size of cable I would need to use for a 12V60A which is also 720W and it gave me 8mm2 as the result.  And thinking about it, it does make sense as current is a measure of electrons per unit time, being physical objects (not quite but I come from a programming background so that also makes sense to me) the more they are the more space they would need to move through. But where is the voltage in the equation, if we imagine voltage being the strength with which the electrons are moving it would also make sense to need a stronger conductor the higher the voltage and it doesn't seem to be the case? Is conductor cross section determined solely by amperage? Could a 0.5mm2 cable carry 3A at any voltage?  Quite a bunch of questions I posed there but I hope you get where my curiosity is coming from.

I am trying to put together the requirements for a cable and I was wondering what would be the most suitable wire size to load the DUT with 25Amps @ 9VDC. I will have few other high current lines 13Amps @ 5VDC. There will also be 2 DC lines 160V @5Amps each.  I was wondering if all of this can be bundled (or what would be the key things to keep in mind) with some other wires carrying RF signals without causing any signal integrity issues.  I plan to use shielded Coax cables (at least 20) and bundle all of it along with some other signal lines (like DIO, SPI, CAN bus, etc) in one cable. The RF signals are not going to have a frequency higher than 15MHz but I will need to sample it quite fast to detect a time difference between 2 signals in 5 nanosecond range.  Would anyone suggest:   The right wire size for this application Would there be any issue in regards to RF measurements?   The overall cable length is going to be about 15ft.


I have a Windows 7 32 bit (Home Premium) on my HP Laptop. I decided to take the easy way to install Ubuntu and that is by using Wubi.    Having gone over a few tutorials on Wubi, I decided to let it do its task. I let it install. I saw the Ubuntu option during boot and hence I selected it and pressed enter.    I saw the Ubuntu purple screen and then my screen went black. All the other lights in the laptop were on. The volume rocker, the wifi, power and so on. I let it sit for about 15 mins but since I did not get any response whatsoever, I had to forcefully shut it down.    Dismissing it as a fluke, I restarted the laptop and repeated the same procedure. I got the same result.  Well, what made it go wrong ? For now,  I have uninstalled it with the hope of reinstalling it once I know what went wrong.

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


When I try to run a new bash instance [egg@localhost ~]$ bash  I receive id: cannot find name for group ID 999  In /etc/group there is no group with that Id #. Where is this ID being referenced from?

BACKGROUND  Trevor logs into his account on ssh://foobar.university.edu as one of the developers on the box, and he gets the message:   id: cannot find name for group ID 131   Trevor then checks this out using    vim /etc/group   PROBLEM  Trevor discovers that there is no 131 anywhere in the /etc/group file.  Trevor then runs id ...   > id trevor  uid=4460(trevor) gid=131 groups=48(foobar),51(doobar),131   To discover his primary group apparently does not have a name attached to it.  QUESTIONS   What likely happened to cause this circumstance on the foobar.university.edu box ? Suppose trevor wants to fix this (e.g., by just creating a "trevor" group that maps to GID 131) what is the best way to do this without potentially breaking anything else on the server ?


I've just moved in a house with an older electric oven. It only has a top heating element and doesn't have a fan. Every time I try to bake something it turns out burnt on the outside and under-cooked on the inside. I always put my cakes on the lowest rack and put a sheet of foil paper on a rack higher up to prevent the direct heat onto the cake, but I'm still having issues. Should I bake cakes at a lower temperature for longer? Should I wrap the cake in foil? Should I put a pizza stone at the bottom of the oven to try to generate heat from there? I'm not sure what to do, please help!

My mom wants to do baking but her oven doesn't have bottom heating element. It only has an element on top, with a fan at the back.  She told me that she can't make me a good pizza or cake without it.  Is there any way around?


I am newbie in JavaScripts and I can say bash script easier than this. I want get json file from url then parse to get id list. I use mobile firefox on android. In bash script you write curl "your url" | jq '.id' . Then you get id from json file. Here is my code  // ==UserScript== // @name qwerty // @namespace http://use.i.E.your.homepage/ // @version 0.1 // @description enter something useful // @match http*://* // @grant        GM_xmlhttpRequest // @require http://code.jquery.com/jquery-3.4.1.min.js // @copyright 2012+, You // ==/UserScript==  //Test if script not work var b = "asdf" alert(b) alert(11);  //Script gets file from json url GM_xmlhttpRequest({   method: "GET",   url: "your url to json",    onload: processJSON_Response });   //Site response test function processJSON_Response(rspObj) {   if (rspObj.status != 200 && rspObj.status != 304) {     reportAJAX_Error(rspObj);     return;   }   //Alert to check response is correct or no   alert(rspObj.response)   var a = rspObj.response   //This code not work. It's json parsing   var id = a.id   //Alert id list of json   alert(id) }   Test json file  {"updated_at":"2020-04-27T18:52:13.107-04:00","id":[637,677,5765,202]}

Given a string of JSON data, how can I safely turn that string into a JavaScript object?  Obviously I can do this unsafely with something like:  var obj = eval("(" + json + ')');   but that leaves me vulnerable to the JSON string containing other code, which it seems very dangerous to simply eval.


I tried all the things I found on here and nothing worked, is it because I have windows 7 on my PC too?

I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution?


If Hogwarts admits children from 11, who takes care of primary education?  I would imagine lots of anti-social, semi-literate people if parents are left to their devices in educating their children. But then the government does taxpayer-funded universal education with Hogwarts and depends on a society of educated people. So where are the primary schools?

Most of the wand-carriers that come from a non-Muggle family seem fairly uneducated when it comes to interacting with Muggles.  This implies that they don't go to any type of Muggle school before entering into their education at Hogwarts (or whichever Wizarding school they go to), or else they would at least understand some Muggle culture.  What do children from magical families do before going to Hogwarts if they don't go to a traditional school?  Is there any evidence that they're homeschooled?


Is there a way to pass a sObject with RemoteAction from JavaScript to Apex?  I want to create a bunch of sObjects. What is the right way to pass their information from JS to Apex with RemoteAction?  What I tried is populating a JS object. And then pass its value to the apex controller. Here's how I populate the js object:  stockObject.Location__c = $j('.select-store-div option:selected').val(); stockObject.Product__c = productsArray[key]['Name']; stockObject.LocationRetailPrice__c = productsArray[key]['newPrice'];   However it says it's unable to convert the types(expecting sObject, got arraylist). Is there a way to pass a sObject as a whole to the controller rather than a list of strings?

This question appears to have been answered several times on here, but none of the solutions are working for me.  I have an Apex function defined like so:  @RemoteAction global static ActivityWrapper createActivity(Activity__c activity)   And when I call this Javascript function:  Controller.createActivity(     {ForWeek__c: "2014-04-21T08:00:00.000Z",      Notes__c: "sdfsdf",      Type__c: "Referral",      Id: null,      sObjectType: "Activity__c"}, callback);   I always get back this error message:  Visualforce Remoting Exception: Unexpected type for Controller.createActivity(Activity__c)   As far as I know this is all that is required, but I can't get past this.


Determine all monic irreducible polynomials of degree $4$ in $\mathbb{Z_2[x]}$  Well these polynomials will be of the form -  $a_0 + a_1x + a_2x^2 + a_3x^3 + x^4$  So we have four coefficients that can each have values of either $0$ or $1$. So we have $2^4 = 16$ monic polynomials of degree $4$ in $\mathbb{Z_2[x]}$.  Now to determine the irreducible polynomicals is it necessary to write them all out and manually check if they are irreducible? Or is there some lemma I can apply here?

Find all irreducible monic polynomials in $\mathbb{Z}/(2)[x]$ with degree equal or less than $5$.   This is what I tried:  It's evident that $x,x+1$ are irreducible. Then, use these to find all reducible polynomials of degree 2. There ones that can't be made are irreducible. Then use these to make polynomials of degree 3, the ones that can't be made are irreducible. Repeat until degree 5.  Doing this way takes way too long and I just gave up during when I was about to reach degree 4 polynomials.  My question is: is there any easier way to find these polynomials?  P.S.: this is not exactly homework, but a question which I came across while studying for an exam.


I'm using elsarticle documentclass and would like to add doi to bibliography.  \documentclass[preprint,12pt]{elsarticle} \usepackage{lineno,hyperref} \bibliographystyle{elsarticle-num}  \begin{document}  Palm oil is mainly composed of triglycerides \cite{Mba2015}.  \section*{References} \bibliography{SFC}  \end{document}   Reference example  @article{Mba2015, title = "Palm oil: Processing, characterization and utilization in the food industry – A review", author = "Ogan I. Mba and Marie-Josée Dumont and Michael Ngadi", journal = "Food Bioscience", year = "2015", volume = "10", pages = "26--41", doi = "https://doi.org/10.1016/j.fbio.2015.01.003", }

I prepared my article with elsarticle, using \citep & \citet throughout. I originally used apalike bibliographystyle but now need to change it to elsarticle-num-names for citation formatting requirements (see point #2 below).  Now, I am attempting to make 2 changes:     add DOIs to the bibliography change reference style to [1] for \citep and Author et al. [1] for \citet.   I want to keep hyperref and do not want explicit URLs (only DOIs) but cannot make this work!  Thank you for any help you might have!  MWE:  \documentclass[preprint,12pt]{elsarticle} %\usepackage{hyperref}  \journal{Test Journal} \begin{document} \begin{frontmatter} \title{The Title} \author{Prof. Big Ol' Wanker} \address{123 Happy Lane} \begin{abstract} TEXT \end{abstract} \begin{keyword} keyword 1 \sep keyword 2 \sep keyword 3 \end{keyword} \end{frontmatter}  \section{SECTION1TEST} \noindent cite: \cite{Richards1931} \\ citep: \citep{Richards1931} \\ citet: \citet{Richards1931} \\  \bibliography{library} \bibliographystyle{elsarticle-num-names}  \end{document}   Here is the reference for Richards1931 from my library.bib file:    @article{Richards1931, author = {Richards, LA}, doi = {10.1063/1.1745010}, file = {:D$\backslash$:/Papers/Richards - 1931 - Capillary Conduction of Liquids Through Porous Mediums - Journal of Applied Physics.pdf:pdf}, issn = {01486349}, journal = {Journal of Applied Physics}, pages = {318}, title = {{Capillary Conduction of Liquids Through Porous Mediums}}, url = {http://scitation.aip.org/content/aip/journal/jap/1/5/10.1063/1.1745010}, volume = {1}, year = {1931} }   without hyperref (wanted hyperlinks present, DOI displays correctly, but unwanted URL is present):    with hyperref (hyperlinks not present, DOI displays incorrectly, and unwanted URL is present):


I have an issue with the Lightning Datatable which dispatches an event when a column header is clicked. That event holds among other things the sorting order, 'asc' or 'desc'.  The problem is that the given order is always 'asc'. Despite the docs specifying otherwise :      Clicking a column header sorts rows by ascending order unless the defaultSortDirection is changed, and clicking it subsequently reverses the order   Here is a playground link that shows the error (click on a column to sort and observe the given sorting order in the console) :     Am I missing a parameter or something ?  Thank you in advance !

I'm trying to implement the sorting functionality on a lightning:datatable. Sorting works one way (descending, clicking the column header again and nothing happens). I have followed the documentation and here's my code below:  <aura:attribute name="selectedAccountId" type="Id" access="public" /> <aura:attribute name="accounts" type="Object"/> <aura:attribute name="mycolumns" type="List"/> <aura:handler name="init" value="{! this }" action="{! c.doInit }"/>  <aura:registerEvent name="AccountFilterChange" type="c:AccountFilterChange" />   <lightning:datatable aura:id="lightningTable"                      data="{! v.accounts }"                      columns="{! v.mycolumns }"                      keyField="Id"                      onrowaction="{! c.handleRowAction }"                      onsort="{!c.updateColumnSorting}"                      hideCheckboxColumn="true" />   Controller:  doInit: function(component, event, helper) {    helper.callServer(component, "c.getAccounts", function(response) {        component.set("v.accounts", response);        })     component.set('v.mycolumns', [         {type: "button", typeAttributes: {             label: '',             iconName: 'utility:add',             name: 'selectRecord',             title: 'selectRecord',             disabled: false,             value: 'edit',             variant: {fieldName: 'variantValue'},         }},         {label: 'Name', fieldName: 'Name', type: 'text', sortable: true},             ]);         },  handleRowAction: function(component, event, helper) {     var account = event.getParam("row")     var action = event.getParam("action");     if (action.name == "selectRecord") {         var event = component.getEvent("AccountFilterChange");          event.setParams({             accountId: account.Id,         });     }  event.fire();  helper.addRow(component, account); },  updateColumnSorting: function(component, event, helper) {     var fieldName = event.getParam('fieldName');     var sortDirection = event.getParam('sortDirection');     // assign the latest attribute with the sorted column fieldName and sorted direction     component.set("v.sortedBy", fieldName);     component.set("v.sortedDirection", sortDirection);     helper.sortData(component, fieldName, sortDirection);     }   Helper:  sortData: function (component, fieldName, sortDirection) {      var data = component.get("v.accounts");      var reverse = sortDirection !== 'asc';      //sorts the rows based on the column header that's clicked      data.sort(this.sortBy(fieldName, reverse))      component.set("v.accounts", data);      },  sortBy: function (field, reverse, primer) {      var key = primer ? function(x) {return primer(x[field])} : function(x) {return x[field]};      //checks if the two rows should switch places      reverse = !reverse ? 1 : -1;      return function (a, b) {          return a = key(a), b = key(b), reverse * ((a > b) - (b > a));      }  }   How would I make this work so both desc/asc will work when clicking the column header?


This is a subsection in my statistics homework. It goes back to calculus II and summations, and it's been a long time since I've studied it so I'm rusty.  I'm looking to solve the summation of $c\left(\frac{2}{3}\right)^x$ where $c$ is a constant to where I can solve for $c$.  I understand that we say that this summation is: $$c\left[\frac{2}{3}+\left(\frac{2}{3}\right)^2 +\left(\frac{2}{3}\right)^3 +\cdots\right]$$ But the book then says that this then equals to:  $$c\dfrac{\dfrac{2}{3}}{1-\dfrac{2}{3}}$$  Any help?  Also I know my coding ability is little to none so if you'd like to edit my question to make it look more presentable feel free to.  Thanks all.

Why does the following hold:  \begin{equation*} \displaystyle \sum\limits_{n=0}^{\infty} 0.7^n=\frac{1}{1-0.7} = 10/3\quad ? \end{equation*}  Can we generalize the above to      $\displaystyle \sum_{n=0}^{\infty} x^n = \frac{1}{1-x}$ ?   Are there some values of $x$ for which the above formula is invalid?  What about if we take only a finite number of terms? Is there a simpler formula?     $\displaystyle \sum_{n=0}^{N} x^n$   Is there a name for such a sequence?    This is being repurposed in an effort to cut down on duplicates, see here: Coping with  duplicate questions.  and here: .


Apparently my hard drive was wiped so I lost everything. I don't know if this is possible, but would the system restore points I had saved be in some other partition that I would be able to boot into? I am trying to get as much data back as possible. So if this is possible how would I restore my hard drive using the system restore points?

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


I have the Nikon D5300 and it comes with a kit 18-55mm. I've been looking to get a 50 prime, and my friend has two (1.4 and 1.8) which she let me try out yesterday.  So, my camera is not full frame, and has a crop factor of 1.5. Every single resource I've seen has told me that the focal length a full frame (non DX) lens would be multiplied by the crop factor, meaning that a standard 50mm lens should look like 75mm on my camera.  My friend has a full frame camera, and her lenses are not DX lenses, however when I took photos with her lenses and compared with mine set to 50mm, the object I photographed (coffee cup) took up the exact same amount of space out of the frame. My lens is a DX.  Why is this? Do lenses adapt to the camera's crop factor? Is the camera adapting? How come every resource I've ever read said that her lenses on my camera should look like 75mm?

I have a Canon 7D, which has a crop factor of 1.6x.  When using a Canon EF-S lens I get the focal length stated on the lens, when using a Canon EF lens I get the focal length times 1.6 when used on the APS-C body. At least that's what I thought.  I just compared two lenses:   Canon EF-S 15-85mm f3.5-5.6 Canon EF 70-200mm f4   .  The top photo is shot with the 15-85, the bottom photo with the 70-200 - both lenses are set to 70mm. Now why do they look the same?  I thought I would get 112-320mm (70mm*1.6 crop factor). What did I misunderstand about the crop factor calculation? Lightroom also displays the photos as having "70mm" and not 112mm.


I've been playing Pokémon GO for a few days now, and have noticed that the in game tracker appears to not work. All the Pokémon on the tracker are shown to be 3 footsteps away, even if they are visible on the map. Why is this happening, and what can I do to fix it?

I was told in pokemon go, the pawprints near the pokemon represent the distance away from me, but as I move around I run into pokemon and all of the distance markers stay at 3 paw prints, never lowering to 2 or 1. What's going on?


I am working on android activity life-cycle. But i have a problem with connections.  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.activity_main);      speedValue = (TextView) findViewById(R.id.speed_value);     rpmValue = (TextView) findViewById(R.id.rpm_value); }  @Override public void onResume(){     Intent intent = getIntent();     Bundle input = intent.getExtras();      displayOperations(input);     super.onResume(); }  public void displayOperations(Bundle input){      boolean flag = input.getBoolean("flag");     if(flag){         for (int i = 0; i < input.getStringArrayList("second").size(); i++) {             rpmValue.setText(input.getStringArrayList("rpm").get(i));             speedValue.setText(input.getStringArrayList("speed").get(i));         }     } }  //Menünün içeriği burada ayarlanır. @Override public boolean onOptionsItemSelected(MenuItem item) {     Intent intent;     switch (item.getItemId()) {         case R.id.action_settings:             intent = new Intent(this, Settings.class);             startActivity(intent);             return true;          case R.id.load_button:             intent = new Intent(this, Operations.class);             startActivity(intent);             onStop();             return true;         default:             return super.onOptionsItemSelected(item);     } }   In this code im tying to get information from other activity. have to go that class and do some operations then come to our main class to be success. Our bundle comes from other activity as you see. There problem occurs right here. My bundle comes null because i couldnt go to second activity.   When i try onResume, application crushes because of null pointer. How can i solve this issue  LOGCAT   Attempt to invoke virtual method 'boolean android.os.Bundle.getBoolean(java.lang.String)'      on a null object reference          at com.akaydin.berkin.carmonitor.MainActivity.displayOperations(MainActivity.java:42)         at com.akaydin.berkin.carmonitor.MainActivity.onResume(MainActivity.java:36)

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?


Why is $\cos(\arctan(3x)) = \frac{1}{\sqrt{1 + 9x^2}}$? I've tried messing around with identities but still I'm not sure what's going on here.  Thanks.

How do I show this?  $$\cos^2(\arctan(x))=\frac{1}{1+x^2}$$  I have absolutely no idea. Thank you.