why "thinking" jumped into the conclusion of "existence" as things can exist without thinking too. and what are all the other method except this that could prove our existence?

I've heard it postulated by some people that "we can't truly know anything".  While that does seem to apply to the vast majority of things, I can't see how 'cogito ergo sum' can possibly be false.   No matter what I am, no matter in what way I'm being tricked, no matter how I may be deluded, I must exist in order to - in some way - be considering this right now (or be being tricked right now).  Is 'cogito ergo sum' necessarily correct, or have I missed something?


Is QGIS (2.16) multi-threaded?   I do not see multiple processes on the console while running it on Ubuntu.    It only uses one CPU.   Is there anything to do to enable it?

After reading , I was wondering if QGIS 2.6 will include this when running various processes. I checked online and I could only find that multi-threaded rendering was introduced to QGIS 2.4 (I assume it will again be available in 2.6). Now maps can be redrawn very quickly especially when dealing with large datasets.  I read that it's fairly difficult to include multi-threading to core functionality and that users are advised to manipulate Python code in order to achieve this, such as in .  I also checked the  but it has been closed for 9 months now by Tim Sutton with the last comment being:     "I'm closing this out - Martin Dobias has an implementation in a branch which will be merged post QGIS 2.2"   Will some functions in QGIS 2.6 exploit multi-threading (or will it again be focused on rendering) and if not, will that change at QGIS 3.0?


Suppose I have an uncountable set $S$ that I obtained in a non-constructive way, like from the Axiom of Choice. In my particular example I'm thinking about a basis for $\mathbb R$ as a vector space over $\mathbb Q$.   I'd like to remove uncountably many elements into a set $T$ but in a way that leaves uncountably many elements behind. But because I don't know anything in particular about the specific elements of $S$ I don't know how to use the Axiom of Specification or some other method to be confident that I can correctly make a subset of the right size. For example, I could try $\{s \in S : s \geq 0\}$ but my basis doesn't have to have any negative elements, right? Or it could have all negative elements or a mix. If I just wanted $T$ to be countable or finite I could just draw a single element from $S$, say $s_1$, and then draw $s_2$ from $S \backslash \{s_1\}$, and so on (right?). But if I want $T$ to be uncountable this doesn't seem to help.  So can I simply say "Let $T$ be an uncountable subset of $S$ such that $S \backslash T$ is also uncountable"? Is that a thing I can just say that I can make? Or do I need to come up with a formula $\phi$ such that I can use Specification via $\{s\in S : \phi(s)\}$? For a set like $[0,2]$ I have no problem doing this because $\{s \in [0,2] : s \leq 1\}$ does the trick, and since I know it's possible in some way I'm not worried about not exhibiting a particular formula $\phi$. But with a set where I don't even know a single element of it, I'm not sure what to do.  Can I prove that $S$ must have such a subset $T$? If not, then I'd have an uncountable set where every subset is either countable or cocountable. Is there an issue with that?

Is it true that for any uncountable $S$, there exits two uncountable subsets $S_1,S_2 \subseteq S$ with $S_1 \cap S_2 = \emptyset$?   I can find no counter example, but no proof either.  I am aware of similar questions regarding the partition of uncountable subsets of the real line, and there are many examples of disjoints uncountable subsets of $\mathbb{R}$, say $R_1,R_2$.   It is not clear to me however whether this extends to any uncountable set. For uncountable sets $S$ with $S \succeq_{card} \mathbb{R}$, there exists an injection $f : \mathbb{R} \rightarrow S$ and choosing $S_1,S_2$ with $S_i = \{s\in S~|~ s = f(r_i) $ for some $ r_i \in R_i\}$, works.   But from what I understood of the continuum hypothesis, there might exist an uncountable sets $H$ with $\mathbb{R} \succeq_{card} H$. So using the above argument, one cannot infer that the property holds for every uncountable sets from observing that it holds for $\mathbb{R}$. Is this right? Are there other ways to prove or disprove the assertion?


This question has been asked before as . However, I have not been able to resolve the issue using the answer provided. Can someone clarify the correct procedure? I would like to restrict all segmentation and classification processes to take place within areas (polygons) covered by my thematic layer rather than the whole scene. I have successfully carried out a chessboard segmentation using my thematic layer so the polygons from my thematic layer are now image objects. I then used the 'assign class' algorithm to assign those image objects to one class. I then attempted to carry out an additional segmentation at the image object level using the class filter to select my new class. However, the segmentation was still carried out on the entire scene. The only instance where my steps have differed to those recommended at  is when I was unable to see how to assign a class based on the "number of overlaps". I assigned my image objects to a single class without using "number of overlaps".

I have a thematic layer, i want to perform segmentation and classification only within the thematic layer,not in a whole image. how can i do it? I tried to segment the image after viewing the thematic layer in view setting and the thematic layer usage was enabled, but it was segmenting the whole image.


I am trying to build a variable power supply to replace my batteries.  The power supply should have a constant DC voltage just like batteries maximum current will be 10mili Amps Max voltage should be 100V Should be able to change voltage between 0-100v  Input is 240v AC Please suggest some ways of doing that

I want to make a power DC supply with voltage rating 0-200V. I want it to be a variable power supply with voltage from 1V to 200v. What should be my approach?


I had a confirmation box that showed a confirmation alert when clicking on the delete button,  heres the function     it was working fine whenever i put a class for any html element, until i added it inside this function it stopped working  $(document).ready(function() {   $('#list').dataTable({     "ajax":{           url :"list.php",           type: "GET",           error: function(){             $("#post_list_processing").css("display","none");           }         },         "columns": [               { "data": "title" },               { "data": "description" },               {                 "data": function(item) {                   return 'delete';                 }               }           ]   }); });

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.


My question is short and concise. Here it goes -  In my book the definition of a set is given as a well defined collection of things and in mathematicse they are well defined collection of mathematical objects. Then why is $\emptyset$ which has nothing is even considered as a set. Is it merely a mathematica convention or is it that it has a special significance ?   Though it is pretty general, I want to know the reason behind it. Thanks for your help .

We define the term "Set" as,     A set is a collection of objects.   And an "Empty set" as,     An empty set is a set which contains nothing.    First problem I encountered:  How the definition of "Empty set" is consistent with the definition of "sets" if "Empty set" contains nothing and a "set" is a collection of objects.  Further we discovered in set theory that every set has a subset that is the Null set.  Such as,  If $A=\emptyset$ and $B=\{1,2,3\}$ then,  $$A \subset B$$  Second problem I encountered:   How and why "No element" is referred and considered as an element as we do in case of null set that is, when we say that every set has a subset that is the Null set?  Third and Last one:  How can a set possess "some thing" and "nothing" simultaneously that is when we say that every set (containing objects) has a subset which is Null set (contains nothing)?


JSON Body {   "60":{"name":"test_Z","provider":"21","status":"enabled"},   "61":{"name":"test_S","provider_id":"21","status":"enabled"},   "62":{"name":"test_G","provider":"21","status":"enabled"} }  Result Expected: I need to get result like test_Z = 60 and test_S = 61 , and test_G =62 this number will change based on API calls

How can I deserialize this json object:      {     "response": {         "count": 1,         "benchmark": 0.22567009925842,         "requests": [             {                 "request": {                     "id": 537481,                     "image_thumbnail": "",                     "title": "Request for new bin(s) - residential",                     "description": "Propmain ref  3234-1114",                     "status": "submitted",                     "address": "36 Pine Tree Close",                     "location": "Peterborough, England",                     "zipcode": "PE1 1EJ",                     "user": "",                     "date_created": 1417173208,                     "count_comments": 0,                     "count_followers": 0,                     "count_supporters": 0,                     "lat": 52.599967,                     "lon": -0.233482,                     "user_follows": 0,                     "user_comments": 0,                     "user_request": 1,                     "rank": "0"                 }             }         ],         "status": {             "type": "success",             "message": "Success",             "code": 200,             "code_message": "Ok"         }     } }   What i've tried:   Map<String,Object> rawObj = (Map<String,Object>) JSON.deserializeUntyped(jsonString);     Map<String,Object> responseObj = (Map<String,Object>)rawObj.get('response');     List<Object> reqs = (List<Object>) responseObj.get('requests');     System.debug('Map Size = ' + reqs.size());     Map<String, Object> i = new Map<String, Object> ();     for (Object x : reqs) {          i = (Map<String, Object>)x; }     Map<String,Object> requests = (Map<String,Object>)i.get('request');     System.debug('Map Size = ' + i.size());     for (String field : i.keySet()){          Object id = i.get(field);         Object title = i.get('title');         System.debug('Id : ' + id);         System.debug('title : ' + title);          //System.debug('Title : ' + title);       }


Was not allowed to post this in the place I posted it originally as "too general" and was redirected to this Forum I have read a lot of SO and other (also google) articles talking about hiding content and when it will be penalising and not the site. In some articles I read hiding (we are talking about visibility: hidden  in this case) is penalising your site when the content hidden is "keywords" but not if it is meaningful content for the user (lets say in a tab or such). On other articles again I read that google doesn't really care wether the content is hidden and just gives it less weight. In this specific case I have to visibility: hidden  a section of the page inside a div where content (that is already present on the page for the human reader) is laid out in a different structure ready for print() with JS that content to a PDF. I cannot use the exact same content and especially layout as already used on the page for human reader, it must instead be in laid out differently, and some of the page's content will not be used in the PDF. Will the site be penalised because some content is duplicated (the title, and some tables present on the page with product attributes), or is it OK to hide the content with visibility: hidden ? I cannot use display:none because Js print() will not be able to print that. It is however able to print visibility: hidden  content. I could see only one other possible solution which is to pull with AJAX once the user press the "print" button, so the "hidden" content is initially not even present on the page, however I would like to avoid this, if possible. Will search engines consider this keyword stuffing and penalise the site? Is there some HTML tag I can use to tell the robots "do not consider this chunk of HTML?" Perhaps a "Print Only" statement, or else?

This is a general, community wiki question regarding duplicate content.  If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on .     What does Google consider to be duplicate content? Will the way I am presenting my content result in a duplicate content penalty? How can I avoid having my site's content treated as duplicate content?


I have a directory with a bunch of log files. Something like this:  data170213.log data170214.log data170215.log data170216.log   I'm interested in looking at the last entries of the most recent file and following it. If I know the most recent file is data170216.log, I can do that with  tail -f data170216.log   The problem is, I don't know what the name of the most recent file in the directory is. I can identify it though with  ls -1r *.log | head -1   What I can't work out is how to send the result of the command ls -1r *.log | head -1 to the command tail -f [FILE]  I tried the following, unsuccessfully  tail -f < ls -1r *.log | head -1

In a few spots I got this to work  ls -rt /path/to/log/file/ | tail -1 | xargs tail -f   But I can't figure out why it won't always work (This is quick fix until I get the log rolling fixed here)


How do I get 3 stars in Mario Kart 7? I have got 3 stars in the 50 and 100cc races, but I can't seem to get it on Mirror Mode and 150cc. I have also seen many other people ask about this, and the answers are always different. Does anyone have a legit answer?

I finished a couple of cups getting 1st place in every race and still got a 2-star rating, so the ranking isn't only based on your position (or total points).  Is there a defined formula or is it yet another Nintendo secret?


Update: I originally flagged this as a "Lock Screen" problem. But with the help from @Dennis, I came to understand that the problem I describe below could be much better defined as a "Screen Shield" issue. Many thanks to @Dennis because I was getting ready to gouge my eyes out.     Original problem description:   I feel like I have had this problem before and I can't remember how I ultimately solved it. No matter what I do, when i close my laptop lid, it locks the screen. Except that it's not a lock screen, I don't have to enter my password, I just have to hit escape. That's annoying enough, but sometimes hitting escape doesn't work and I have to ssh into my laptop and kill X.   I have edited my /etc/systemd/logind.conf, here are the relevant edits:   39 HandleLidSwitch=ignore  40 HandleLidSwitchDocked=ignore  41 IdleAction=ignore  42 LidSwitchIgnoreInhibited=no   (all other line items in the logind.conf are commented out and I ran sudo systemctl restart systemd-logind or rebooted after)  I have installed tweak and disabled suspend with laptop lid closed.   I have made the recommended changes in the power section in Settings.   I have even installed Caffeine and enabled it.   Nothing matters, it still puts up that pseudo "not really a lock screen" screen when I close my laptop. And again, 25% of the time I have to kill X because I can't get out of it.   To make matter worse, it only goes into the lock screen about half the time, and I am unable to discern a pattern.   Much anger, please help.    Update: I tried the tip listed at    Still didn't work.

I need to remove the annoying new "locking" screen that shows a giant clock: I can't remove it with just moving the mouse (as with any other desktop environment), the animation is slow, and it isn't asking me for a password!  I managed to disable it, just to discover that now I can't lock my screen on purpose, so I can't go away from the computer.  Just to clarify, I want to:   After some time the screen could go black, but if I move the mouse or press any key then I can use it directly (like a normal screensaver). If I press super-L then it is locked, and I must type the password to unlock (like a normal lock screen).   I found several "solutions", but none seems to work:


Add biography elements from stackoverflow application

It would be nice to update the profile page from within the app.  Perhaps not many people update their profiles more frequently, but when required to do so, I would prefer to do it from the app instead of the mobile browser.


How do I search for questions that only have certain tags. For example:  If I search [python] the search will come up with any questions that have python as one their tags. This search would show something tagged java,python  How do I search for questions that have only the tag python and no other tags?

I can search question with target using [target] but the result questions also include question tagged with other tags.   How to get the question with only one specific tag?


To use  as you would require when using the  with large numbers (100,000+), it calls for some very large calculations.  When I multiply two large numbers (eg: 62574 and 62574) PHP seems to cast the result to a float. Getting the modulus value of that returns strange values.  $x = 62574 * 62574; var_dump($x);          // float(3915505476) ... correct var_dump($x % 104659); // int(-72945)  ... wtf.   Is there any way to make PHP perform these calculations properly? Alternatively, is there another method for finding modulus values that would work for large numbers?


Possible Duplicate:          I came across  in the 10K tools, which was flagged as not an answer.  Since it's only a link, I re-flagged.  The flag was declined as      flags should not be used to indicate technical inaccuracies, or an altogether wrong answer   I can't stress strongly enough my lack of concern for the lost flag weight—as Shog has said, losing flag weight is like burning monopoly money.  But should link-only answers be flagged?  Part of the description for the "not an answer" flag is that the answer should be a comment.    Was this just a result of a mod being distracted on a Friday afternoon?

I think we can all agree, this sucks:  If you've been around a little while, you've probably encountered hundreds of answers like this in various forums, some of them even marked as "The Answer" by well-meaning1 forum admins looking to close a thread. We could try to enumerate the commonly-observed problems with it...  Link is probably broken If link isn't broken, it's spam If link isn't spam, it's to some broadly-related resource that the answerer found by pressing "I'm feeling lucky" when googling the question's title.  ...but the real issue here is that we don't know! Even if the link was originally pointing directly to the most awesomeest answer ever for exactly the question being asked, there's nothing in the answer itself to even hint at what direction we're being pointed in. Strip the markup, and this is what you're left with:  i think you should take The tutorial HERE! This will help you a lot  Is there even one tiny speck of information there? No. Even the title of the page being linked to would have provided something to go on, but that was entirely too much work. So let me be clear: this sort of response is not an answer. If you see this, flag it. Moderators, if you see it flagged, delete it. There's really only one valid exception to this rule, and that's when the question is:  Suggest me some tutorials where i can learn quick.  Don't get me wrong, it's still a bad answer - but when the question is kinda asking for bad answers this is to be expected. Close or flag the question and move on - this is much more efficient than hanging around to babysit it by deleting every crap answer that inevitably shows up. If you're still reading, you're probably getting really bored by now. "Gee, Shog - answers that contain ZERO information are terrible, horrible, very-bad things? What shocking revelations will you share next?" Yeah. It's really simple... Except, . See, the problem is that once you step away from black-and-white "answers / doesn't answer" decision-making, things get... Interesting. And all those other answers with links in them See, this is an answer:  And so is this:  Yes, they're both very short, and yes, they contain links. But strip the markup, and you still get at least a little bit of useful information. Does that mean these answers should forever hang around the site? No, not necessarily - if it turns out they're just not that useful, they should probably still be removed - or at very least, down-voted so that they rank below other answers. Just remember: if the text of the post contains an honest attempt at answering the question, then it is an answer - so don't flag it otherwise, and if you do, don't complain if your flag gets declined. Answers & Apples If you're still confused, forget about answers. Think about apples instead:  Answers are just like that, but less tasty in pies.  1 By which I mean to say, "criminally lazy"


The definition of $e$ is:  $$e = \lim_{n \to \infty} \left(1 + \frac{1}{n}\right)^n$$  If we use the Binomial Theorem on the function itself:  $$\left(1 + \frac{1}{n}\right)^n = \sum_{k=0}^{n} \binom{n}{k}\frac{1}{n^k} = \sum_{k=0}^{n} \frac{n!}{k!(n-k)! \cdot n^k}$$  At this point I am not sure where to go, how to both manipulate this expression and also have it be a valid input to the limit definition. Is there a simple approach that does not require Calc II knowledge, or is this one of those problems where there's really just one way to do it that everyone uses?

How do you prove that $e=\sum_{n=0}^{\infty}\frac{1}{n!}$? Here I am assuming $e:=\lim_{n\to\infty}(1+\frac{1}{n})^n$. Do you have any good PDF file or booklet available online on this? I do not like how my analysis text handles this...


Example:     "Your head of department called," she said. That was what I liked   about my mom: S/she never bothered with greetings. Straight to the   point. "You've been absent for two weeks. What's wrong? Are you sick?"   I'm unsure whether to use She or she.

Shall we capitalize the word after colon?  For example:     The question is: S/shall we capitalize "s" in "shall"?   Another example,      For example:          E/every marginal distribution of a multivariate normal distribution must be a univariate normal distribution.   S/so it is for the multinomial distribution (which is the multivariate generalization of binomial distribution).   S/so it is for Dirichlet distribution (which is the multivariate generalization of beta distribution)   N/not sure  for multivariate t distribution.      (In other words, should each of those individual bullets be capitalized, or not?)


I have a question regarding the red term below. This is the integration by parts during the derivation of the Euler-Lagrange equation for continuous systems. Why is this not the time derivative $d/dt$.... why do we use the partial? I have seen the equation expressed in both ways and wondered what the physicality's are.  \begin{equation} \int^{t_2}_{t_1}dt\frac{\partial \mathcal L}{\partial (\partial _t\phi)}\frac{\partial }{\partial t}\delta \phi =\frac{\partial \mathcal L}{\partial (\partial _t\phi)}\delta \phi \bigg|^{t_2}_{t_1}-\int^{t_2}_{t_1}\color{red}{\frac{\partial }{\partial t}}\bigg(\frac{\partial\mathcal L}{\partial (\partial _t\phi)}\bigg)\delta \phi dt \end{equation}  This particular Lagrange density is a function of $\mathcal L=\mathcal L(\phi,\dot \phi ,\partial _x\phi)$

The Euler-Lagrange equation for particles is given by   $$ \frac{d}{dt}\frac{\partial L}{\partial \dot{q}} = \frac{\partial L}{\partial q},\tag{1}$$  and for fields  it is   $$ \partial_{\mu} \frac{\partial \mathcal{L}}{\partial (\partial_{\mu}\phi)} = \frac{\partial \mathcal{L}}{\partial \phi}.\tag{2} $$  Comparing the two equations, the first one has a total time derivative $\frac{d}{dt}$ but the other one appears to have partial derivatives $\partial_{\mu}$. These derivatives come from integration by parts in the derivation of the EL equation. I was wondering why the field version has partial derivatives and the particle version has total derivatives?   I have also seen for the specific example (in Quantum Field Theory for the gifted amateur) of 1 dimensional waves on a string, the corresponding Euler-Lagrange equation is  $$ \frac{d}{dt} \frac{\partial \mathcal{L}}{\partial \left(\frac{d\phi}{dt}\right)} + \frac{d}{dx} \frac{\partial \mathcal{L}}{\partial \left(\frac{d\phi}{dx}\right)} = \frac{\partial \mathcal{L}}{\partial \phi}, \tag{3}$$  which uses total derivatives, so I am a bit confused.


I have the following code that is suppose to split a string and inserting it into an array :    char *t;   char *tmpLine = (char *)line.c_str();  t = strtok(tmpLine, "\t");   int counter = 0;  while(t != NULL) {       tempGrade[counter] = atoi(t);      counter++;      t = strtok(NULL, "\t");   }   but for some reason the last entry of line is ignored and not inserted. also line is :   string line = "1  90  74  84  48  76  76  80  85"; NOTE : the spaces are tabspaces (\t) in the original file.

I'm trying to iterate over the words of a string.  The string can be assumed to be composed of words separated by whitespace.  Note that I'm not interested in C string functions or that kind of character manipulation/access. Also, please give precedence to elegance over efficiency in your answer.  The best solution I have right now is:  #include <iostream> #include <sstream> #include <string>  using namespace std;  int main() {     string s = "Somewhere down the road";     istringstream iss(s);      do     {         string subs;         iss >> subs;         cout << "Substring: " << subs << endl;     } while (iss); }   Is there a more elegant way to do this?


Suppose $\sqrt{2} + \sqrt{n}$ is rational,  so it can be represented like so: $\sqrt{2} + \sqrt{n} = {x \over y}$  then  $\sqrt{2} = {{x \over y} - \sqrt{n}}$  so $\sqrt{2} = {x - y\sqrt{n}\over y}$  but $\sqrt{2}$ is irrational, which leads to a contradiction.  Does this proof make sense?  edit: fixed some mistakes

Can the expression $\sqrt{n} + \sqrt{m}$ be rational if neither $n,m \in \mathbb{N}$ are perfect squares? It doesn't seem likely, the only way that could happen is if for example $\sqrt{m} = a-\sqrt{n}, \ \ a \in \mathbb{Q}$, which I don't think is possible, but how to show it?


Apologies in advance if this is a duplicate.  For instance, when I say, "I need a Kleenex" and by that I mean "I need a tissue regardless of the brand", is there a term for words like Kleenex in this context?  I could've sworn this word exists, and probably ends in -nym. For the life of me, I can neither recall it nor find it anywhere, including this forum where I did a search for things like synonym, hypernym, brand and trademark.  Other words like this include Band-Aid, Jacuzzi and Chapstick.  Here are some sample sentences:     In the UK, Biro is a _____ that can refer to any ballpoint pen.   or     The _____ windbreaker can mean a lightweight jacket of any brand.   or     (InE) "Bring me some Maggi from the store."      "Do you want Maggi noodles specifically, or did you use Maggi as   a _______?"   For the record, I would settle for any word or compound word that fits; it doesn't have to end in -nym. I would prefer a single-word answer.  This  by Business Insider lists more words like this, and says the process is called genericization, but doesn't state a term for such words.  PS - I do not care about the part of speech. For example, I think that the noun Google, when used as a verb, falls under this umbrella. But even if it doesn't, is there a term that covers the other examples I mentioned?  Read more at:

Example: A character owns a pair of Sophia Loren sunglasses. Before going out for the afternoon, "She drew on her Sophia Loren’s, flipped her long mane back, and tossed him a cheeky grin."  If I'm not mistaken, this is an example of a "proprietary eponym". Is the apostrophe correct here, or should it be "Sophia Lorens"—i.e. since the thing referred to is a plurale tantum, should the proprietary eponym also take the form of a plurale tantum?


I'm doing a thesis and I need to include another document I created into the document.  I tried using  \includepdf[pages=-]{usermanual.pdf}  And that works well, except that it shows only the usermanual.pdf page numberings, and what I need is to shrink each page and show both that page numbering and continue the numbers of the main document.  Is there a way to make \includepdf shrink the pages?  edit: OK, I have figured out how to scale it (by adding the scale= option) - but the page numbering is still gone. How do I get it back?

Can you recommend an easy way to place the page number on an imported PDF? For instance, when using:  \includepdf[fitpaper=true]{last_site/last_site.pdf}   \includepdf was used twice because the code (of the imported TeX / PDF) would affect (a little bit) the TeX code of the main document. I do not want to rewrite some stuff within the main document nor change the imported TeX code cause it looks fine now. Therefore, the \includepdf option was used.  The page number of the main document should be used on the last pages. Any advice?


On older Ubuntus I remember that I always used to have a hidden ".fonts" folder in my Home folder. Now, in Ubuntu 16.10, there is none and I can't find my fonts anywhere. How can I find them? I'm trying to add a custom Unicode symbol to one of my fonts, but to do that I need to open a font file in FontForge.  I've tried to search my computer (for example by typing font's name "Linux Libertine") and absolutely no results...

Ubuntu desktop with 12.04 is about to crash.  Installed 13.04 on a new machine, want to transfer Book Antiqua font from old machine to the new one.  How do I find it on the old machine?  My /usr directory is empty. My fonts.conf file has these lines: <!-- Font directory list --> <dir>/usr/share/fonts</dir> <dir>/usr/x11R6/lib/X11/fonts</dir>  <dir>/usr/local/share/fonts</dir> <dir>~/.fonts</dir>  Don't know what this means, but my /usr directory has nothing in it.


Why not have the icons to the left of each of the 'Hot Network Questions' go to that community's front page? Seems logical.

I would like to see the icons in the 'Hot Network Questions' right panel clickable, leading to the homepage of the site where the question comes from.  It would make it more comfortable to switch to the site when you want rather to visit it than to see that specific "hot" question.


Let $p$ be a prime, and $a$ and $b$ two integers, such that $p\not|$ $a$ and $p\not|$ $b$.   It can be possible that $p$ $|$ $ab$ ?

If a prime number $p$ is a divisor of a product $ab$, $p$ has to be a divisor of $b$ or $a$. How can I demonstrate this theorem? I demonstrated this theorem on one way using Bezout's theorem in an  but are there other proofs??


I have a school assignment on immutable generic Binary Search Trees in java. I have implemented all of the basic BST functions but we are also asked to create a saveInOrder function that takes a generic array of type Entry that should be modified in the function to contain all of the Entries in order of the value of their key.  We are given an interface to implement, and in that interface there is a method signature   public void saveInOrder(Entry<Key,Value> a[]);   I'm confused as to why the [] brackets are after the 'a'? Shouldn't it be  Entry<Key,Value>[] a?   Also, will the array passed to this function have a size defined already? I googled generic arrays and have realised they're a tricky topic. Any explanations would be great thanks! Sorry if it's a little ambiguous

Due to the implementation of Java generics, you can't have code like this:   public class GenSet<E> {     private E a[];      public GenSet() {         a = new E[INITIAL_ARRAY_LENGTH]; // error: generic array creation     } }   How can I implement this while maintaining type safety?  I saw a solution on the Java forums that goes like this:  import java.lang.reflect.Array;  class Stack<T> {     public Stack(Class<T> clazz, int capacity) {         array = (T[])Array.newInstance(clazz, capacity);     }      private final T[] array; }   But I really don't get what's going on.


This is a general question about how Blender processes renders. I use Blender to create animations of logos on transparent backgrounds for compositing. I am wondering why, even when my geometry is small in the center of the frame with nothing around it, Cycles still takes time to process all of the blank frame area. It seems as though rendering blank areas of the frame should be near instantaneous. Is there a way to have Blender detect areas of the frame that do not need to be processed in order to speed up render time? Apologies if I haven't explained this well or if this question has already been asked and answered. Thanks for any help : )

This is a bit of a trick question. We know that HOLDOUT will subtract objects from renders. My question is slightly more elaborate. I had a render that I spent a fair amount of money on (render farm), only to find out that a material was set to the wrong settings. So I'm re-rendering the animation with every other object BUT the one I need using the HOLDOUT feature. However, Blender is crawling all over the rendering even though 80% of the frame is 100% transparent. I'd love a way to have Blender only render the area where the object exists. I know about setting a render area method, but the problem arises where I need the object to be in the EXACT location that its predecessor was that had the material problem, so rendering the entire 4k frame is very helpful for a clean overlay.


At the end of Interstellar, when Cooper is trapped inside the Tesseract, he figures out a way to convey the quantum data recorded inside the singularity to his daughter Murph.  He does so by embedding the quantum data, translated in morse code, in the second hand of the wristwatch. This is the same wristwatch he gifted her while leaving planet earth.  My Question:  If Cooper has recorded the data in the second hand during a particular time period in his daughter's life, how come the lengthy pattern is running on a loop for Murph to find out about it later in her life?  Because any change made by him at T time inside the room cannot be expected to repeat infinitely otherwise the books that he pushed to say "STAY" will always be falling off the shelf.  I hope I made the question clear. If not please comment.

In Interstellar, after young Murph places the watch on the bookshelf in her bedroom, her father - in the same bedroom but from another dimension - moved the second hand and recorded data in a Morse-signal message on it. Many years later, the second hand still signals the message, grown-up Murph finds the watch and takes it with her to NASA and there she translates the message back into the data needed.  If we assume the watch had a long lasting battery, then I still see some problems with this plot:   From what we know from the explanation in the movie itself is that the only thing capable to travel from them in the 4th or 5th dimension to present Earth is gravity. Gravity is a vertical force on Earth. It pulled dust from the air to the floor in a barcode-like pattern. So how can it adjust the horizontal position of the second hand of the watch? Like a magnet? And how is a multiple of those movements of the second hand recorded on the watch? How does it play the message for all these years, again and again. Not only in Murph's bedroom, but still at NASA too?   Normally I would answer this myself by saying that it is film, it is science fiction, everything is possible, and there is no need to question things we cannot explain. But this movie certainly has the intention of being truthful to science, to explain what is going on and this particular director has a reputation of telling stories that in one way or another always has plausible explanations for plot-hole-like aspects.


So this is a part of my coursework A452 which states I need to research and ask forums if I don't know the question. I've tried to research this for hours on end and all I find is what the /bin directory does. I know what it does, it's very simple; it's a subdirectory of the root which contains executable files and commands. But how do I use an example to prove this using the terminal? Is there a command I could use to prove it? The full question listed in the coursework is below:  10C) What is the purpose of the bin directory? Use examples to explain this.   Can it please be detailed because the whole thing is worth 30% of my grade however this is the only question I'm stuck on. :((

What is the purpose of the bin directory? What are some examples?


Edited since my last question was a duplicate, but I'm struggling with this as well. I'm currently working with a matrix and can easily find the largest element with  M[M != 1].max()   However, I'm interested in getting the N largest elements and can't find an easy way to do this with matrices. Is there an efficient solution?

I know there is a method for a Python list to return the first index of something:  >>> l = [1, 2, 3] >>> l.index(2) 1   Is there something like that for NumPy arrays?


I know Euclid's clever way of proving that there are infinitely many primes but while I was studying, I also saw a sentence on the book: "Euler-phi function can also be used to show that there are infinitely many primes." but could not figure out how. Could you please help me to understand it?  Regards

I need something explained or corrected:  In my number theory class we proved that there are an infinite number of primes using Euler's Phi Totient. It went something like this:  Let $M = p_1 p_2 \dots p_n$ be the product of all primes. Consider $1 < A \le M$:  Some prime must divide $A$, call it $q$. Since $q$ must be one of the primes, $q$ must divide $M.$  So the $gcd(A,M) > 1.$ Thus $\phi(M) = 1$ ...?   Which is not even and contradicts the theorem that $\phi(N)$ is even for $N>2.$ Therefore there exists an infinite number of primes.  I get confused by the statement "Thus $\phi(M) = 1$"....  Did i possibly copy this proof down wrong? or am I missing something? Thank you in advance.   Edit: by consider a such that...i meant consider an integer '$a$' I replaced it with $A$ to hopefully make it more clear.   Edit2: I'm sorry I am not familiar with using the equation editor. This is not a homework assignment, just studying for my exam. I just want to be able to understand this or clearify it.


The Question For any fixed $k'\in\mathbb{N}$, for any $a\in\mathbb{R}^+$ and for any $n\in\mathbb{N}$, define the function $f:\mathbb{N}\to\mathbb{R}$ given by \begin{equation*}  x_n=f(n)=\frac{n^{k'}}{(1+a)^n}.   \end{equation*} I want to show that $(x_n)$ converges to $0$. For clarification, I don't include $0$ in $\mathbb{N}$. Attempts at Solution For any $\varepsilon>0$, I need to find a $N\in\mathbb{N}$ such that for any integer $n \geq \mathbb{N}$, the following holds: \begin{equation*}  \left | \,\frac{n^{k'}}{(1+a)^n}-0 \, \right | <\varepsilon.   \end{equation*} Since $x_m>0$ for any $m\in\mathbb{N}$, I can drop the absolute value signs and we get \begin{equation*}  \frac{n^{k'}}{(1+a)^n}<\varepsilon.   \end{equation*} So, I considered $x^{k'}=\varepsilon(1+a)^x$ for any $x\in\mathbb{R}^+$. That equation does not have a closed form solution I think, so I will denote the bigger root of that as $x^*$. Now $N=\lceil x^* \rceil$ should be a candidate for the convergence definition. This is where I get stuck: how do I put that $N$ back to the convergence definition and show that $N$ really is a good candidate? I wonder if there are any elegant proofs for this; mine is too ugly. Also, I have a simple inequality that should play a role in this but I do not see how it fits. (My "proof" did not use the inequality) For any fixed $k'\in\mathbb{N}$ and for any $n\geq k'$, consider $(1+a)^n$. \begin{align*}  (1+a)^n&=\sum_{k=0}^{n}\binom{n}{k}a^k1^{n-k}\\  &=\sum_{k=0}^{k'-1}\binom{n}{k}a^k+\binom{n}{k'}a^{k'}+\sum_{k=k'+1}^{n}\binom{n}{k}a^k\\  &>\sum_{k=0}^{k'-1}\binom{n}{k}0^k +\binom{n}{k'}a^{k'}+ \sum_{k=k'+1}^{n}\binom{n}{k}0^k\\  &=\binom{n}{k'}a^{k'}.   \end{align*} Thanks in advance!!

Let $x>0$. Find $$\lim_{n\to\infty}\frac{n^{x}}{(1 + x)^{n}}.$$   What I was thinking involved an inequality, by reason of considering the fact that  $$(1 + x)^{n} > C(n, k) x^{k}$$ for some $k$ such that $n>k$. Expanding the binomial coefficient and taking the $n$ common from each bracket, we have something like $$(1 + x)^{n} > C(n, k) x^{n} > \frac {x^{k}n^{k}}{k! 2^{k}}.$$ But now, I am totally clueless. By intuition, I know that the limit has to be zero, so I just want to prove using the concept of inequalities that what I thought was the right approach (being the sandwich theorem). Any help would be appreciated!


I have a luks setup with encrypted partition. And I don't want everyone on my computer to see that I have such partition. Unfortunately it shows up in the nautilus "devices" panel as "Encrypted partition".   Is there a way to prevent it from showing there? I plan to setup authentication with a keyfile on usb, but for now I can live without the gnome authentication dialog, and open and mount the partition from command line.

I have a luks setup with encrypted partition. And I don't want everyone on my computer to see that I have such partition. Unfortunately it shows up in the nautilus "devices" panel as "Encrypted partition".  Is there a way to prevent it from showing there? I managed to setup authentication with usb key and I don't want the encrypted partition show in the panel.


I have a (Oracle) sequence that I use to assign an order number to new orders being inserted into a database table. It started at 1, and increments by 1 for each new order.  I have a new requirement saying that order numbers should start at 10000000 (ten million), so I want to update all existing records (by adding 10000000; order 1 will then be 10000001, order 7002 will be 10007002, etc), and also increment the Oracle sequence so that the next value will be correct.  I was going to simply run this script:  DECLARE   l_temp NUMBER; BEGIN   FOR idx IN 1..10000000 LOOP     SELECT MY_ORDER_SEQ.nextval       INTO l_temp       FROM dual     ;   END LOOP; END; /   but I don't really know how long that would take to run.  Is there a better way to do this?

In , I can do something like this:  ALTER SEQUENCE serial RESTART WITH 0;   Is there an Oracle equivalent?


Are there any academic articles that deal directly with the psychology / sociology of Stack Overflow / Stack Exchange?  I was trying to google this to see if there's any academic talk, but I didn't really see anything. This could certainly be due to my googling skills. I'm looking specifically for Stack Overflow / Stack Exchange and not general social networking or Q & A. I've seen , but I'm not really looking for a software engineering perspective (and I don't think they've published anything).  EDIT - just to be clear, I don't want software engineering / business articles  (which is what all the articles I have seen are) but psychology / sociology type.

As a result of  myself, the need arose to track other Stack Overflow-based research. The following is an attempt to list the academic papers mentioning Stack Overflow/Exchange or using Stack Exchange data. This also includes the works mentioned in  that started the trend, as well as two other questions on meta, , and . If you know of papers that are not listed, please edit the answer directly. I realised it might be useful to have all the BibTeX entries in a single file, so I started .


I am trying to create two new macros:   braces: compiles some text between curly brackets squakets:  compiles text between two square brackets   I defined as follows.  \documentclass{article}  \newcommand{\braces}[2]{$\left\{\begin{tabular}{@{}c@{}}     #1\\     #2\\     \end{tabular}\right\}$}       \newcommand{\squakets}[1]{$\Big[ #1 \Big]$}  \begin{document}  \squakets{\squakets{\braces{$\sqrt{}$}{$\alpha$} \braces{$x$}{$\beta$}} \braces{$y$}{$\gamma$}} $\rightarrow$ \braces{$\sqrt{}$}{$\alpha$} -- \braces{$x$}{$\beta$} -- \braces{$y$}{$\gamma$}  \end{document}   Console still compiles, even though it warns me that:     Missing $ inserted.   I was curious of understanding how to fix this. I guess it is something related to the fact I am embedding multiple squakets command in one another, but can someone help figure that out?

I have a macro which appears throughout my document in various places:  \newcommand{\placefraction}[2]{     $\frac{#1}{#2}$ }   Sometimes it is placed with regular text. Sometimes it is placed within other math modes. However, the document won't compile if it is placed inside another math mode.  None of my math ever appears in displayed formulas, it is always part of the paragraph.   How can I have a macro which sometimes appears inside math mode, sometimes outside, but itself contains math mode?


<provider         android:name="android.support.v4.content.FileProvider"         android:authorities="${applicationId}.provider"         android:exported="false"         android:grantUriPermissions="true">         <meta-data             android:name="android.support.FILE_PROVIDER_PATHS"             android:resource="@xml/filepaths"/>     </provider>   filepaths.xml  <?xml version="1.0" encoding="utf-8"?> <paths xmlns:android="http://schemas.android.com/apk/res/android"> <files-path     name="my_images"     path="files/images" /> <external-path     name="my_images"     path="files/images" /> <external-files-path     name="myexternalimages"     path="files/images" /> <external-cache-path     name="name"     path="files/images" /> <cache-path     name="name"     path="files/images" /> </paths>   I've added all possible paths.  Code :   if (file != null)   if (file.exists()) {             String str = context.getPackageName() + ".fileprovider";             Uri uri =  FileProvider.getUriForFile(context, str, file);             return uri;         }   Created file path is like this  /data/user/0/com.sample1.sample2/files/images/UReview9.jpg   I'm trying to call TwitterShare where i need to put file uri. Could anyonetell me what could be the problem ?  TIA

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I don't quite understand the output from the free -h command. I have tried searching but am still not quite sure.  Should I be worried my free memory is only 46M or is the -/+ buffers/cache row value that says 351M free also available for whatever?               total       used       free     shared    buffers     cached          Mem:          594M       548M        46M        76M        28M  277M -/+ buffers/cache:       242M       351M Swap:           0B         0B         0B   If it matters, this is a web server that hosts a few websites that don't get more than 30 visits per day each.

if I understand correctly, in the following output produced by free, 3535m is the actual free memory available to applications, only 413m is used, is this correct?  need some clarification on the difference between Mem and -/+ buffers/cache row.   free -m              total       used       free     shared    buffers     cached Mem:          3949       3854         95          0          9       3431 -/+ buffers/cache:        413       3535 Swap:         2047       1322        725


I need to delete all sub directories and their contents in a given folder, whilst leaving a particular sub directory. Is there a way to do this using bash or a shell script? The file structure is shown below.  container_dir │ ├── delete_this_dir │   ├── file1.txt │   └── file2.txt │ ├── delete_this_dir │   ├── l1.txt │   └── l2.txt │ └── keep_this_dir     ├── file1.txt     ├── file2.txt     └── file3.txt

I have ubuntu file system directories in the root directory and I accidentally copied hundreds of files into root directory.  I intuitively tried to remove copied files by excluding file system like  rm -rf !{bin,sbin,usr,opt,lib,var,etc,srv,libx32,lib64,run,boot,proc,sys,dev} ./.   bu it doesn't work. What's the proper way to exclude some directories while deleting the whole?  EDIT: Never try any of the commands here without knowing what to do!


I have a 15*15 farm. Its 64 to 46. full of water. It took so much time to do it. Your help will be appreciated.

Are there any effective AFK squid farming techniques?  I'm running out of squid ink trading with villagers.  From what I can tell in reading the forums, is that one needs to either:  eliminate all water in a region, and build an aquarium and harvest squid that way.    Or go to the bottom of the ocean, and drop holes in the ocean, and collect the squid there (because squid swim down, but not up, and thus always end at the bottom of the ocean.)  I'm looking for a minimal amount of effort (I get about 2 hours of minecraft time a week! :(  )  approach to getting a reasonable farm for acquiring ink sacs.  I very much prefer AFK farms (due to the small at keyboard time I have).  I have yet to find a decent AFK farm for squid.


I'm trying to extrude a new face and shrink it by a fixed number of units, rather than a percentage.  Starting from something like this:   I want to end up with this:   Note the distance between the original face and the new one is equal all round. I did this one by extruding the face, moving it a fixed numeric distance, then moving the 2 incorrect edges back double that distance. Obviously this only works for 90 degree edges, so less than ideal.  Using the normal scale method (E, S) I get a percentage based result, like this:   I've seen two possible method of doing this, mianly from :   Shrink / Fatten: I've tried (E, Esc, Alt+S) for this, but the face just travels straight up and down - I assume the vertex normals are not correct for this approach. Push / Pull: This is just apply percentage scaling for me at the moment.   If I actually extrude the face out a bit, then use Shrink / Fatten it works as expected, but I don't want to have to keep manually resetting heights.  Is there a quick way of scaling a face within it's normal, but by fixed units instead of axis percents?    Edit: @zeffii has pointed me in the direction of the  (W, I).

I am trying to set up a Minecraft rig mouth that will have more controls and will be rounded, but I am having issues trying to figure out what this guy did here. First, he did what looked like a loop cut and slide, but instead of drawing a line it selected all the edges it passed through. He then cut to a new clip where the mouth was already set up like this.    The video is in 3 times speed but if you download a youtube plugin you can slow it down to 0.25 speed of the video and then if you do the spacebar trick you can slow it down so it shows 1 frame at a time and it is really slow.  if you want or need to see the video.  All I am asking is how can I create those 8 basic segments.


So the .NET framework provides the  class for storing strings in a secure fashion.  But to read the information and work with it you have to return it to a standard string.  See .  As you can see from the example using the pointer we return an unencrypted string.  How to do we now manage that "insecure" instance of the string?  What is the most secure way to work with the value once it has been set?  Edit  The purpose of this question was to discuss methods to REDUCE the surface area of potential attack when using SecureStrings and then working with the values.  Not the "why" as to the "duplicate" link.

I'm trying to grok the purpose of .NET's SecureString.  From MSDN:  An instance of the System.String class is both immutable and, when no longer needed, cannot be programmatically scheduled for garbage collection; that is, the instance is read-only after it is created and it is not possible to predict when the instance will be deleted from computer memory. Consequently, if a String object contains sensitive information such as a password, credit card number, or personal data, there is a risk the information could be revealed after it is used because your application cannot delete the data from computer memory. A SecureString object is similar to a String object in that it has a text value. However, the value of a SecureString object is automatically encrypted, can be modified until your application marks it as read-only, and can be deleted from computer memory by either your application or the .NET Framework garbage collector. The value of an instance of SecureString is automatically encrypted when the instance is initialized or when the value is modified. Your application can render the instance immutable and prevent further modification by invoking the MakeReadOnly method.  Is the automatic encryption the big payoff? And why can't I just say: SecureString password = new SecureString("password");  instead of SecureString pass = new SecureString(); foreach (char c in "password".ToCharArray())     pass.AppendChar(c);  What aspect of SecureString am I missing?


I am in the process of trying to delete a folder from C:\Users but when I try and delete it, it tells me the folder cannot be deleted because there is a file name that is too long to go in the recycle bin. The catch is, it doesnt appear like there is anything in the folder. So since I have no idea where the file in question is, I cannot try and shorten the name. The box that pops up says destination path too long and shows a long file name with a bunch of weird symbols mixed in. I have tried opening a command window in this directory and used the DIR /X command but it does not show anything. I am running Windows 10. This has become extremely frustrating! Someone please help!

I was working with some computer vision source code I found and didn't realize that it creates a cache file that has a VERY LONG name and now I can't delete the 2 of them. I tried to rename it to a shorter name but I can't do anything to the file, I also tried to restart my computer and see if it would just go away. The error message says:  Destination Path Too Long. The file name(s) would be too long for the destination folder. You can shorten file name and try again, or try a location that has a shorter path.   How can I delete the files in this case?


I am trying to make a meta function which tells me if a type T has a member type typename T::X.  My luck so far was inspired by :  #include <utility> #include <type_traits>  struct A {using X = double;}; struct B {};  template <typename T, typename = int> struct hasX : std::false_type {};  template <typename T> struct hasX<T, decltype(T::X{}, 0)> : std::true_type {};   int main()  {    static_assert(hasX<A>::value,"Should have has X");    static_assert(!hasX<B>::value,"Should NOT have X"); }   However it does not compile, and I am wondering what the problem is? Why is the comma operator in decltype(...) not working like I want [returning 0 if T::X succeeds (sfinae) -> making it a int -> true]

In templates, where and why do I have to put typename and template on dependent names? What exactly are dependent names anyway?    I have the following code:  template <typename T, typename Tail> // Tail will be a UnionNode too. struct UnionNode : public Tail {     // ...     template<typename U> struct inUnion {         // Q: where to add typename/template here?         typedef Tail::inUnion<U> dummy;      };     template< > struct inUnion<T> {     }; }; template <typename T> // For the last node Tn. struct UnionNode<T, void> {     // ...     template<typename U> struct inUnion {         char fail[ -2 + (sizeof(U)%2) ]; // Cannot be instantiated for any U     };     template< > struct inUnion<T> {     }; };   The problem I have is in the typedef Tail::inUnion<U> dummy line. I'm fairly certain that inUnion is a dependent name, and VC++ is quite right in choking on it. I also know that I should be able to add template somewhere to tell the compiler that inUnion is a template-id. But where exactly? And should it then assume that inUnion is a class template, i.e. inUnion<U> names a type and not a function?


For some reason my GTA V still keeps crashing even after the update which should "fix" the problem with 2 graphics cards.  Also when I try to run only with my Intel/AMD graphics card it ends up giving an error that DirectX 9 wasn't found on my device? Which I get for my Intel but not my AMD. It has to be installed on at least one of them cause it doesn't give this error with both enabled.  Specs: i7 4700MQ AMD HD8970m 8GB of ram Windows 7 64 bit  My GTA is installed on a hdd and there is over 400gb of space left. I also tried repairing my files with the uninstaller you can also repair your game there instead of uninstalling.

I recently ordered the GTA V PC from Steam and when I finished installing and launch the game. It gave me "Grand Theft Auto V has exited unexpectedly". I tried "safe mod" and every option available, but none of them work. I checked some forums and found a lot of people having the same problems. What could be the possible cause? I'm using a laptop with these specs:  CPU: i7 4700m GPU: AMD HD8970M RAM: 8GB  I'm pretty sure my laptop is way beyond the minimum specs. Does someone know how can I enter the game?


I am currently writing my thesis using the arsclassica. I have minor problem where the long chapter title will overlap with the content of the chapter.   This is part in classicthesis.sty which I think responsible for the design of the chapter title.       \newcommand\formatchapter[1]{%  \vbox to \ht\strutbox{  \setbox0=\hbox{\chapterNumber\thechapter\hspace{10pt}\vline\ }  \advance\hsize-\wd0 \advance\hsize-10pt\raggedright  \spacedallcaps{#1}\vss}}  \titleformat{\chapter}[hang]     {\normalfont\LARGE\bfseries\sffamily}     {\textcolor{halfgray}{\chapterNumber\thechapter} %change the color for main title    \hspace{10pt}\vline\ }{10pt}  {\formatchapter}

I have a problem with arscalssica style in combination with classicthesis.  The text under the chapter title starts always at the same position, independently on how long is the chapter title, which produce this ugly behaviour:   The code I used to generete this output is really basic:  \documentclass[10pt,a4paper,twoside,openright,titlepage,fleqn,headinclude,footinclude,BCOR5mm,numbers=noenddot,cleardoublepage=empty,tablecaptionabove]{scrreprt} \usepackage{subfig} \usepackage[eulerchapternumbers,subfig,beramono,eulermath,pdfspacing]{classicthesis}  \usepackage{arsclassica}  \usepackage{blindtext}  \begin{document}     \chapter{\blindtext}     \blindtext \end{document}   The compilation raises the following warnings:  C:\Program Files (x86)\MiKTeX 2.9\tex\latex\koma-script\scrreprt.cls: Class scrreprt Warning: You've used obsolete option `tablecaptionabove'. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\classicthesis\classicthesis.sty: Class scrreprt Warning: Usage of package `titlesec' together(scrreprt)              with a KOMA-Script class is not recommended. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\titlesec\titlesec.sty: Package titlesec Warning: Non standard sectioning command detected(titlesec)                Using default spacing and no format. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\titlesec\titlesec.sty: Package titlesec Warning: Non standard sectioning command detected(titlesec)                Using default spacing and no format. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\titlesec\titlesec.sty: Package titlesec Warning: Non standard sectioning command detected(titlesec)                Using default spacing and no format. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\titlesec\titlesec.sty: Package titlesec Warning: Non standard sectioning command detected(titlesec)                Using default spacing and no format. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\titlesec\titlesec.sty: Package titlesec Warning: Non standard sectioning command detected(titlesec)                Using default spacing and no format. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\classicthesis\classicthesis.sty:373: Package scrreprt Warning: Activating an ugly workaround for a missing(scrreprt)                feature of package `titlesec` on input line 373. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\arsclassica\arsclassica.sty:192: Package hyperref Warning: Option `hyperfootnotes' has already been used,(hyperref)                setting the option has no effect on input line 192. C:\Program Files (x86)\MiKTeX 2.9\tex\latex\arsclassica\arsclassica.sty:192: Package hyperref Warning: Option `pdfpagelabels' has already been used,(hyperref)                setting the option has no effect on input line 192   The behaviour is ok if I do not use arsclassica but only classicthesis:


Currently I'm self studying functional analysis, namely compact operators. In the text, the author gives the following example:  Example 1: Let $C_1$ and $C_2$ be positive constants and let $$ M:=\left\{x(t)\in C[a,b]:|x(t)|<C_1\text{ and }|x'(t)|<C_2\right\}.\tag{1} $$ Then $M$ is relatively compact.  I completely understand Example 1, it makes use of Arzela's theorem. Then the author gives the following example:  Example 2: The operator $$ Ax:=\int_0^tx(\tau)d\tau.\tag{2} $$ on $C[0,1]$ is a compact operator (use the previous example).  My question is fairly straightforward: using Example 1, how is this operator compact on $C[0,1]$? As of now I have the following two definitions of compact operators:  Definition 1: A linear operator $A\colon X\to Y$ is called a compact operator if and only if for every bounded sequence $x_n\in X$ the sequence $Ax_n$ has a Cauchy subsequence.   Definition 2: An linear operator $A\colon X\to Y$ is compact if and only if the image of the unit ball of $X$ is a relatively compact set in $Y$.  Just going off terminology, I would guess that Definition 2 should be used to solve Exercise 2, but I'm not seeing it through all the way. Any help is appreciated!

This is an old preliminary exam problem: Let $T:C([0,1])\rightarrow C([0,1])$ be defined by $Tf(x)=\int_0^x f(t)dt$. Prove that $T$ is a compact operator, i.e. the image of the unit ball is pre compact.   So, if I understand correctly, I need to show that the image of $B:=\{f\in C([0,1]) | \sup_{x\in[0,1]}|f(x)|<1\}$ has compact closure. Here is my attempt:   Note that $TB=\{f\in C[0,1]| \sup_{x\in[0,1]} \int_0^x f(t)dt<1\}$   My first thought is to rewrite this as $TB=\{F'(x) | \sup_{x\in[0,1]} F(x)<1\}$   I think this is justified because if $F(x)=\int_0^x f(t)dt$ then $F'(x)=f(x)$ (since w.l.o.g. $F(0)=0$) for almost all $x$.   So the next step is to figure out what the closure of $TB$ looks like, but this is where I'm stuck. Any help would be appreciated. Thanks!  Update: I understand, from the answer given by user251257 that $TB$ is uniformly bounded and equicontinuous, so that, by Arzela Ascoli, any sequence in $TB$ has a uniformly convergent subsequence. But I still don't understand why this shows that the closure of $TB$ is compact. In order for $\overline{TB}$ to be compact, don't we need for any sequence in $\overline{TB}$ to have a convergent subsequence? What if we take a sequence in $\overline{TB}\backslash TB$?


I want to check for records that have the same data as other records in case a mistake was made during data upload.  I want something like a self-join in SQL:  SELECT Id FROM My_Object__c a, My_Object__c WHERE a.Start_Date = b.Start_Date AND a.Student_Number = b.Student_Number AND a.Id != b.Id   Or  SELECT Id FROM My_Object__c WHERE Start_Date IN (SELECT Start_Date FROM Enrolment_c)   However, these give errors.  SELECT COUNT(Id), Student_Number__c, Study_start__c FROM Enrolment__c GROUP BY Study_Start__c, Student_Number__c ORDER BY COUNT(Id) DESC LIMIT 10   Gives Line: 1, Column: 1 System.UnexpectedException: field 'Student_Number__c' can not be grouped in a query call  Note that I cannot use GROUP BY as some of my fields such as Student_Number are not groupable.

I have a large amount of duplicate records (25.000) in an even larger table (250.000 records). I've done the detection using the reporting function. The criteria I used to detect the duplicates were 3 fields (unique account identifier, unique user identifier and date). Based on a list of criteria, I would like to either merge or delete these records. I've got a handle on the logic associated with the merging and the deleting but what I'm having trouble with is defining the duplicate detection process.   I'm looking at either creating a custom object to take care of the detection or dumping the records into an SQL database and taking care of it offline. Any thoughts on which one of the two is the best approach?  Edit:  After reading the first comment, I think the more appropriate question would be "How do I approach the problem in SOQL".  The object I'm working with is the Event object and I'm really only looking at the standard fields, AccountId, OwnerId and ActivityDate. From what I've found online, there's no easy way to find records that have the same value for these three fields. I think it could be accomplished by nesting SOQL queries but I'd like to use a different approach if at all possible.


I am a newbie in programming. Please explain so that a beginner can understand.  I'm trying to build a lottery. First I fill the array with the desired number of numbers. Then draw a number. The number is removed from the lottery and returned to main where it is printed on the console. This is repeated until all the numbers are drawn.  This is what I want. But I get the error "java.lang.NullPointerException".  Is my array empty? And if so, why?  import java.util.*;  public class Tombola {    private ArrayList<Integer> lottery;   private int numbers;    public Tombola(int n){      this.numbers = n;        ArrayList<Integer> lottery = new ArrayList<Integer>();     for(int i = 0; i < this.numbers; i++){         this.lottery.add(i+1);       }   }    public int draw(){     int drawnNumber = this.lottery.get((int) (Math.random() * numbers));     for(int i = 0; i < numbers; i++){         if(this.lottery.get(i) == drawnNumber){             this.lottery.remove(i);             break;         }        }     this.numbers--;     return drawnNumber;   }    public static void main(String[] args) {      int x = 10;     Tombola jackpot = new Tombola(x);     for(int i = 0; i < x; i++){     System.out.println(jackpot.draw());     }   } }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I have two machines: client and server (a database server). I want to connect from client to server and manipulate data from database (insert, update, delete, select) using dblink.  I would like to ask what is more secure:   Encrypting data on client side, send them to the server from client as ciphertext and then store in PostgreSQL database Send data from client to server and do the encryption/decryption on server side with pgcrytpto?   Is that secure that server obtains the encryption key temporarily (for the time of one of possible operations only) from client / other server? Im wondering if there's a possibility that no matter if server obtains a key only temporarily, is there still posibility that the key will be available in PostgreSQL server's logs (or any other database server) somehow?

I tried aes-encryption by using following statement:  SELECT encrypt('test', 'key', 'aes');   which worked, but I am not able to decrypt the value. I inserted it in a field of datatype bytea but I'm not sure if that was the right way.   SELECT decrypt(pw, 'key', 'aes') FROM table WHERE ID = 1;   gives me the error     ERROR:  function decrypt(bytea, unknown, unknown) does not exist   LINE 1: SELECT decrypt(pw, 'key', 'aes') FROM tabelle WHERE ID = 7;                  ^   HINT:  No function matches the given name and argument types. You might need to add explicit type casts.   Does that really mean that encrypt() is an existing function, but not decrypt()? How else could I retreive aes-encrypted values?


If I travel at relativistic speed from planet A to planet B which are at rest relative to one another, I will be younger than people on A or B when I arrive. However how does this mesh with the fact that the change in proper time should be symmetrical, i.e. I should observe events on A as well as B as moving at a slower rate while they observe events for me to be moving at a slower rate, so when I arrive at B why would I be younger? I understand this is similar to the twin paradox and other questions I have asked but I still don't understand how you can resolve the discrepancy since you remain in one inertial frame for the entire journey. Is it because I have to de-accelerate and thus change reference frames to arrive at B, and if so would the effect be the same if I never accelerated or de-accelerated from A to B I just merely flew past them with some velocity set for me at lets say the big bang?

I read a lot about the classical twin paradox recently. What confuses me is that some authors claim that it can be resolved within , others say that you need . Now, what is true (and why)?


I made a booklet in InDesign with a couple of illustrator images. When I do Print Booklet and use Press Quality I get odd borders around the images:   I think it has to do with transparency flattening but how do I get rid of it?

I designed a christmas card and I normally print it on vista print.  When I ask for a print proof the outlines show. They don’t show when I print it at home.  Why are there unwanted white lines appearing in this PDF print proof and how can I solve this problem?


I know there is a general answer to this question , but my question is a little more specific, how to remove the "Turn on Bitlocker.. " entry from it(when I right click on a partition), sometimes I might click it accidentally and it is very annoying. I tried to locate the entry for this item in registry but I couldn't. Would anyone help me?  UPDATE: Some(Moab) told me to disable BitLocker, but I do not want to disable the service because I may use it sometimes. And the recommendation Psycogeek to use Autoruns doesn't because there is no entry for BitLocker.

The  is minimal and clean on a fresh installation of Windows. Install a bunch of applications and soon the context menu is loaded with all kinds of opening options from various applications.  How do I remove items from the right click (context) menu?  I find that there are different types of right click menu items:   Global items that appear in all context menus. Items that appear only on folders. Items that appear only on files. Items that appear only on special folders (Ex: Right clicking a folder of MP3s shows up a context menu with items like Play with Windows Media Player.) Items that appear only on certain file types (Ex: Right clicking a MP3 file shows up a context menu with items from Windows Media Player/Foobar2000/VLC/your-favorite-media-player begging to open this file.)   I want to be able to delete all these kinds items from the right click (context) menu.


i forgot my old one. can't access GRUB because the piece of Ubuntu i use is the terminal, i don't have any interface.

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?


I'm trying to compile the template of a resume, but I get the following errors: "Use of \@ doesn't match its definition." "Leaders not followed by proper glue" "Undefined control sequence." "Missing number, treated as zero." "Illegal unit of measure (pt inserted)."  Isolating the line that gives me the error, I could write a minimal example that still gives me all the errors, except the first one: \documentclass[a4papers,11pt]{article}  \def\vhrulefill#1{\leavevmode\leaders\hrule\@height #1 \hfill \kern\z@}  \begin{document}  \vhrulefill{0.9pt}  \end{document}  Although this example doesn't result in the first error, I get the  Use of @ doesn't match its definition.  all over the place in the original file. What's going on? I use an old computer with an old version of TeX Live (2014), could this be related?

Many LaTeX “hacks” begin with \makeatletter and end with \makeatother. What do these commands do?


Browsers chrome and chromium let more than one user sign in using their google accounts. How can one set a particular account as the default one?

I use the new built-in "Users" feature of Chrome to switch between Home/Work accounts easily. However, Chrome remembers the "last" user profile you had selected when launching new windows. This is a problem if I close down my "Home" profile last, because when I then click the Email shortcut on my taskbar, because it goes to mail.mycompany.com using my Home profile, and I'm not logged in.  I'd like to change the shortcut to the company webmail to pass a switch that tells Chrome to always start as the "Default" user, regardless of the last one used.  Note: I have tried the command-line parameter --user-data-dir=…, and this seems to do something very different, completely isolated from the Users functionality built in to Chrome. It's possible I'm using it wrong, but please test this before assuming it does the same thing and posting an answer ;-)


Let $𝑎,𝑏,𝑚$ and $𝑛$ be natural numbers, $𝑎>1$ and suppose that $𝑎,𝑏$ have no common factor.  Prove that:  If $(𝑎^𝑛+𝑏^𝑛)|(𝑎^𝑚+𝑏^𝑚)$ then $𝑛|𝑚$

Let $a,b,m,n$ be positive integers such that g.c.d.$(a,b)=1$ and $a^m+b^m|a^n+b^n$ , then is it true that $m$ divides $n$ ?


My task is to prove: $$ |\prod_{i=0}^n(x-x_i)|\leq\frac{n!}{4}(\frac{b-a}{n})^{n+1} $$ where $x_i=a+i\frac{b-a}{n}$ for $i=0,...,n$ and $x\in [a;b]$  I managed to prove that: $$ |(x-x_0)(x-x_1)|\leq \frac {1}{4}(x_1-x_0)^2 $$ so it's for $n=1$, using a.m.-g.m., but I don't know in which direction to go in order to prove it for all $n$

Interpolating a function, to estimate the error, knowledge of the function $$\omega(x)=\prod_{i=0}^k (x-x_i)$$ with $x_i$ being the sampling points, is required. In the equidistant case, this would be: $$x_i=a+\frac{b-a}{k}\cdot i$$  Now I want to calculate/estimate $$E_\omega=\max_{x\in[a,b]}|\omega(x)|.$$ It is easy to see, that $E_\omega\leq(b-a)^{k+1}$ but this is in general very imprecise.  Can one calculate $E_\omega$ in general or at least give a better estimate?


As title say, I need to find remainder of these to numbers. I know that here is plenty of similar questions, but non of these gives me right explanation. I always get stuck at some point (mostly right at the beginning) and don't have idea how to start.   Thanks in advance.

How do I efficiently compute $a^b\bmod c$:  When $b$ is huge, for instance $5^{844325}\bmod 21$? When $b$ is less than $c$ but it would still be a lot of work to multiply $a$ by itself $b$ times, for instance $5^{69}\bmod 101$? When $(a,c)\ne1$, for instance $6^{103}\bmod 14$?  Are there any other tricks for evaluating exponents in modular arithmetic?  This is being asked in an effort to cut down on duplicates, see  and .


I just got my Canada Visa with my current passport which expires on 12/25/2018. I'm planning to travel to Canada on 05/19/2018 and I'm thinking of renewing my passport now, is it okay to renew now and travel with Valid Visa on a Valid Passport along with Renewed Passport? or do I have to renew my Passport after my Canada Visit?

I recently renewed my passport. I also have an expired passport which has my Canada visa (visitor's) valid for another three years. I have already used my Canadian visa which is multiple entry. I am planning to visit Canada this summer.  Since my valid Canadian visa is in my old/expired passport, do I need to renew/transfer my Canada visa or can I simply travel with valid visa in old passport?


I tried to print the escape sequence characters or the ASCII representation of numbers in Python in a for loop.  Like:  for i in range(100, 150):     b = "\%d" %i     print(b)   I expected the output like,  A B C   Or something.  But I got like,  \100 \101   How to print ASCII representation of the numbers?

How do I get the  value of a character as an int in ?


From  page 48 of Law: A Very Short Introduction, by Raymond Wacks:     In other words, you owe a duty to persons whom it is foreseeable are likely to be harmed by your conduct.   To try to parse this, temporarily overlook 'it is foreseeable'. Then persons is the subject of the verb phrase are likely to be harmed. So , should the relative pronoun for persons be who instead? Is my parse wrong?   Are the (deleted) comments right: that this style predominates in law texts? If this is correct grammar, what is the general rule? Is it commonly used in other contexts?

I can never figure out whether I should use who and whom. Most people use who for both colloquially, but some people say this is not correct.  What’s the rule for using who and whom correctly?


I'm trying to center all figures, but renewcommand does not work the way I expected.  \renewcommand{\begin{figure}}{\begin{figure}\centering}    This code has an error. Why doesn't it work and how can I make it work?

I use:  \documentclss{mwrep} ... \begin{figure}   \includegraphics{a.jpg} \caption[Long caption]{Caption} \label{pic-a} \end{figure}   How can I make images to be always visible on the center of page? (To be more specific: the center of the image should be between the left and right margin - I use different left and right margins). I don't want to put anything after every \begin{figure} in my document.  Important: I don't want to waste an entire page on a single image at the very center of the page. I want only horizontal alignment. (left <-> right)


Let's say you are playing a telephone game Everyone is in a circle. First turn you come up with a secret sentence then you tell it to your left neighbour and listen to the secret from your right neighbour. Next turns are basically the same but you don't come up with a new secret, you just pass on the last one you heard. It ends when you hear back your first secret coming back to you (and it has gone full circle). (Fun lays in the fact that there usually is something that deforms the message when it is passed, like loud noise or whatnot and you end up with nonsensical sentences) Now let's imagine that I want secrets be passed on from person to person just as much as in a circle like previously defined without anyone hearing a same one twice, but I want to have as many different person to person interaction. eg: For a group of 4 I could go that  turn 1 : you tell your secret to your left neighbour turn 2 : you tell the secret you heard last turn to your left neighbour's left neighbour turn 3 : you tell the secret you heard last turn to your left neighbour's left neighbour's left neighbour And everyone has been in contact with every secret once and once only and you never told a secret twice to the same person.  But for 5 ... Assuming that you are numbered 1, your left neighbour 2 his left neighbour 3 and so on  turn 1 : (next neighbour) you know secrets 1 and 5 turn 2 : (nextnext neighbour) you know secrets 1 and 5 and 3 turn 3 : (nextnextnext neighbour) you know secrets 1 and 5 and 3 and hear again from 5 before hearing about secret 4 or 2  So my question is : is there a simple method for N participants to find the interaction patterns that ensure non repetition before everyone has heard every secret and minimal interaction duplication (and that does not require the generation of every possibility and checking those one by one)?

Say 4 or more people are sitting around a table. Each has a sheet of paper. Devise an algorithm to pass these papers between these people that guarantees:  Each person passes and signs every piece of paper exactly once, no more, no less Every time the papers are passed, each person receives a paper from a person they have not received it from before The papers must all be passed the exact same number of times as there are people (i think this follows from 1, just making sure) People can only have one paper at a time; in other words, no person can be signing two papers at the same time.  Questions:  Is there a mathematical name for this problem? Or can anyone find internet pages where this problem has been discussed before? Is this possible for every number of players? If so, is there an algorithm to generate this? If not, is there an algorithm that can at least minimize the number of times people receive a paper from someone they have received it from before?  This has real world implications!!! I would like to use this theoretical algorithm in my game Drawphone, more info  about how it fits in. Thanks! :)


(i) Assuming that $(x_n)_n$ converges, investigate whether $(a_n)_n$ converges. (ii)Assuming that $(a_n)_n$ converges, investigate whether $(x_n)_n$ converges.  For (ii): If we choose $x_n=(-1)^n$, then $(a_n)_n$ converges as $(x_n)_n$ doesn't converge. And if we choose $x_n=1$, then $(a_n)_n$ converges as $(x_n)_n$ converges. So for part (ii), $(x_n)_n$ can both converge or not converge assuming that $(a_n)_n$ converges. For (i): I believe $(a_n)_n$ should be always converging, but I couldn't prove it, any help? Thanks for your effort and time in advance. Edit: I think the following question says that $(x_n)_n$ always converges when $(a_n)_n$ converges. Is my reasoning in part (ii) wrong?

I have this problem I'm working on. Hints are much appreciated (I don't want complete proof):  In a normed vector space, if $ x_n \longrightarrow x $ then  $ z_n = \frac{x_1 + \dots +x_n}{n} \longrightarrow x $   I've been trying adding and subtracting inside the norm... but I don't seem to get anywhere.  Thanks!


I really got the idea from  I live closer to Denver, is there much of an office there? What about your London offices?    Can we have a sneak peak at the other offices as well?

To make this question less localized: "If one is in New York City, is it possible to tour the Stack Exchange Headquarters?"      Original Question (7/14/2012):  I live in Los Angeles (Orange County actually) and this is my first time in New York City!  My girlfriend and I are staying in a friends apartment on the upper east side of Manhattan; we have 7 day unlimited subway passes and are doing all the touristy stuff.  I thought it would be fun one afternoon to come say hi to the people that run my favorite network of sites.  My girlfriend knows Stack Overflow as "that site I am always on" and when I mentioned the idea to her she also thought it would be fun to visit the SE HQ.    So, can my girlfriend and I come tour the Stack Exchange office(s) sometime in the next few days while we are here in NYC? (We are here until Wednesday (7/18) morning, so Monday or Tuesday would be perfect [assuming the offices are closed on weekends])


Many a times when manually grepping through a file, there are so many comments that your eyes glaze over and you start to wish there was a way in which you just could show it to display only those lines which have no comments.  Is there a way to skip comments with cat or another tool? I am guessing there is a way and it involves a regular-expression. I want it just to display and not actually remove any lines or such.   Comments are in the form of # and I'm using zsh as my xterm.

I'd like to know if there is a way that I could cat file like php.ini and remove all lines starting with ;  For example, if the file contained this:  ;   - Show all errors, except for notices ; ;error_reporting = E_ALL & ~E_NOTICE ; ;   - Show only errors ; ;error_reporting = E_COMPILE_ERROR|E_ERROR|E_CORE_ERROR ; ;   - Show all errors except for notices ; error_reporting  =  E_ALL & ~E_NOTICE   and I ran the correct command cat | {remove comments command}, then I would end up with:  error_reporting  =  E_ALL & ~E_NOTICE   Note - I assumed that cat would be the best way to do this but I'm actually fine with the answer using another utility like awk, sed, egrep, etc.


Let $(X,d)$ be a compact metric space and $Y \subsetneq X$. Prove there does not exist an isometry $f:X \to Y$.  I will try to prove this by contradiction. As $ Y \subsetneq X$ we can take some $x_{0} \in X$ such $x_{0} \notin Y$, but $f:X \to Y$ is an isometry so  for every $a,b \in X$  we have $$d(a,b)=d(f(a),f(b)).$$  So $f(x_{0}) \in Y$ and $x_{0} \neq f(x_{0})$, implying $d(x_{0},f(x_{0}))= \epsilon$ such $\epsilon >0$ but Im not able to show a contradiction from here. Can anyone help me how to end the proof by constructing a contradiction from supposing there is an isometry $f:X \to Y$? Thanks

A prelim problem asked to prove that if $X$ is a compact metric space, and $f:X \to X$ is an isometry (distance-preserving map) then $f$ is surjective. The official proof given used sequences/convergent subsequences and didn't appeal to my intuition. When I saw the problem, my immediate instinct was that an isometry should be "volume-preserving" as well, so the volume of $f(X)$ should be equal to the volume of $X$, which should mean surjectivity if $X$ is compact. The notion of "volume" I came up with was the minimum number of $\epsilon$-balls needed to cover $X$ for given $\epsilon > 0$. If $f$ were not surjective, then because $f$ is continuous this means there must be a point $y \in X$ and $\delta > 0$ so that the ball $B_\delta(y)$ is disjoint from $f(X)$. I wanted to choose $\epsilon$ in terms of $\delta$ and use the fact that an isometry carries $\epsilon$-balls to $\epsilon$-balls, and show that given a minimum-size cover of $X$ with $\epsilon$ balls, that a cover of $X$ with $\epsilon$-balls could be found with one fewer ball if $f(X) \cap B_\delta(y) = \emptyset$, giving a contradiction. Can someone see a way to make this intuition work?


is it possible to use the shell or generate a shell script to find out the browsing history from the browsers installed on the system? thank you

Is it possible to view Google Chrome bookmarks and history by using command line?


I need to support  Python code, which was written by another person and it contains imports, that are placed not at the top of the module. And I'm a bit afraid to break something, as project is quite complex. So when it can be good to use imports not on the top of the file?

states:  Imports are always put at the top of the file, just after any module comments and docstrings, and before module globals and constants.  However if the class/method/function that I am importing is only used in rare cases, surely it is more efficient to do the import when it is needed? Isn't this: class SomeClass(object):      def not_often_called(self)         from datetime import datetime         self.datetime = datetime.now()  more efficient than this? from datetime import datetime  class SomeClass(object):      def not_often_called(self)         self.datetime = datetime.now()


I want to convert a bunch of mkvs to mp4s with the following command:  for i in $(ls *mkv); do ffmpeg -i $i -vcodec copy -acodec copy $i.mp4; done;   However, the filenames have whitespaces and hyphens in them, so the command does not work properly. (When I manually replace The File - 01.mkv with The\ File\ \-\ 01.mkv, the same command works).  What's the best way to get this to work?

Or, an introductory guide to robust filename handling and other string passing in shell scripts.  I wrote a shell script which works well most of the time. But it chokes on some inputs (e.g. on some file names).  I encountered a problem such as the following:   I have a file name containing a space hello world, and it was treated as two separate files hello and world. I have an input line with two consecutive spaces and they shrank to one in the input. Leading and trailing whitespace disappears from input lines. Sometimes, when the input contains one of the characters \[*?, they are replaced by some text which is is actually the name of files. There is an apostrophe ' (or a double quote ") in the input and things got weird after that point. There is a backslash in the input (or: I am using Cygwin and some of my file names have Windows-style \ separators).   What is going on and how do I fix it?


<apex:outputText value="{0, number, ###,###,###,##0}" rendered="{!IF(attr.Name == 'Rate Card Item Price' || attr.Name == 'Sold Unit Price' || attr.Name == 'Price', true, false)}"> <apex:param value="{!attr.value}" /> </apex:outputText>   I want currency formatting and I am using above code but I am getting this error on vf page :     The value attribute on  is not in a valid format. It   must be a positive number, and of type Number, Date, Time, or Choice   Please help on this.

is there a way to pass a string to the <apex:outputText> so that it can be formatted as a currency or percent value?  Here's what I have inside a column of my visual force table:  <apex:outputText value="{0, number, currecny}"> <apex:param value="{!row.values[1]}" /> </apex:outputText   this gives me an error at runtime (when the visual force page loads), which I think may be some kind of type mismatch, where <apex:outputText> is expecting a Decimal or number but I am passing a string.  This is the error at runtime:     The value attribute on  is not in a valid format. It must be a positive number, and of type Number, Date, Time, or Choice.   Thanks


I'm rather glad of the upgrade from 16.04 to 18.04 (desktop). However there are a few things I find annoying,   Among them is indicator-multiload  indicator-multiload is an invaluable app, graphically showing activity for  CPU, memory, network, disk...  Looking like that (top bar) in 16.04   Unfortunately it doesn't work (well) in 18.04.  How can I get indicator-multiload to work in 18.04?

I have 4GB RAM. When I open Firefox, IntelliJ IDEA or VS Code and some other application my memory is about used up thus my machine hangs and I can't do anything. I can't even close any applications.    Date and time are shown in the top bar so that I can view it any time without any thing typing.   If I would view memory status in this way without typing anything then I can make a decision whether to open an application or whether this application may put my machine in hanging state or not.    Is it possible in Ubuntu 18.04 LTS?


I want to select all objects in a collection (collection names are known). pseudo: selectedObjs1 = allObjectsInCollectionName; <--- How? for all objects in selectedObjs1:     process...  Thanks.

I have a scene with 2 collections of 4 objects each. I am trying to get all collection names and their objects' names. Unfortunately, info panel nor python hints have not been helpful to find the command. How do I get a list of all collections' names? How do I get a list of all objects' names in a given collection?


I saw multiple add-ons that are using alternative operator action when pressing Shift, Alt or Ctrl within the operator interface (I think it's only one of the 3).  I created an operator and draw it in in properties>Object and it'd like to batch use this operator with my selection while pressing Alt as it is a default blender behavior when changing properties.   I was hoping that this feature could do the trick? maybe? Are any templates available?

Is it possible to get if Ctrl key is pressed when I click on my python button?  I would like make different behaviors for my button operator.  Example: LMB - Select some objects CtrlLMB - Deselect some objects  I don't use a modal operator / the modal() method. I've been making a simple script.


Find the last two digits of the number $9^{9^9}$ .    [Hint: $9^9 \equiv 9 \pmod {10} $; hence, $9^{9^9}$ = $9^9+10k$ ;now use the fact that $9^9 \equiv 89 \pmod {100}$]

I have to find the last two decimal digits of the number $9^{{9}^{9}}$.  That's what I did:  $$m=100 , \phi(m)=40, a=9$$ $$(100,9)=1, \text{ so from Euler's theorem,we have :} 9^{40} \equiv 1 \pmod{100}$$  $$9^{{9}^{9}} \equiv 9^{9^{2+2+2+2+1}} \equiv 9^{9^2 \cdot 9^2 \cdot 9^2 \cdot 9^2 \cdot 9} \equiv 9^{81 \cdot 81 \cdot 81 \cdot 81 \cdot 9} \equiv 9^{(40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot 9} \equiv (9^{(40+40+1)})^{(40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot 9} \equiv 9^9 \equiv 9^4 \cdot 9^4 \cdot 9 \equiv 6561 \cdot 6561 \cdot 9 \equiv 3721 \cdot 9 \\ \equiv 21 \cdot 9 \equiv 89 \pmod{100}$$  So,the last two digits are $8 \text{ and } 9$. $$$$But,is there also an other way two calculate the last two digits of $9^{{9}^{9}}$ or is the above the only one?


Physicists often deal with equations like $dW = dq(V_a - V_b)$ and say "Don't tell this your math teacher" when they do $\frac {dW}{dt} = \frac {dq}{dt}(V_a - V_b)$. But why is it so dangerous to differentiate against time?

In the book Thomas's Calculus (11th edition) it is mentioned (Section 3.8 pg 225) that the derivative $dy/dx$ is not a ratio. Couldn't it be interpreted as a ratio, because according to the formula $dy = f'(x)dx$ we are able to plug in values for $dx$ and calculate a $dy$ (differential). Then if we rearrange we get $dy/dx$ which could be seen as a ratio.   I wonder if the author says this because $dx$ is an independent variable, and $dy$ is a dependent variable, for $dy/dx$ to be a ratio both variables need to be independent.. maybe?


I am using Ubuntu 12.10 and i was wondering if there is way to not send my hostname when connecting to a router? For example when I connect to my router I can see my laptop hostname when I log on the router, under "DHCP Leases".   I dont want to change my hostname, I would just like to not send anything so that under "Hostname" in my router my laptop mac address appears with no name. Is that possible? I have noticed sometimes that blank hostnames do appear for some connected devices.  Edit: I am aware of this  however it does not seem to work under ubuntu 12.10.

Ubuntu sends my computer's configured hostname to any DHCP server it tries to use. How do I stop it from sending a hostname?


This is really controversial in a lot of countries where English is not a native language. I will be there in 5 minutes. Identity A: I will be there after 5 minutes. Identity B: I will be there within 5 minutes. or "in" is different from A or B and has its own something (like nuance difference) ?

I know that both can mean "inside" but what I don't have clear is whether both mean the same when talking about time. For example:   The party is in two days = The party is within two days ??   According to this link  within means a limit that can be exceeded, so I'm wondering too if say "the party is within two days max" is correct or redundant.


function add (x) {   return function (y) {     return x + y;     };   } var add5 = add(5); var no8 = add5(3); alert(no8); // Returns 8   Can someone please explain me what happens whit y? How does first call of the function add returns 5? Does it ignore y or what?

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


I'm on 64-bit Lubuntu 14.04 LTS. I keep the system fully updated by running apt-get update and apt-get dist-upgrade twice daily.  However, I notice that apt-get update "gets" both i386 and amd64 packages for nearly everything. For example:  Get:47 http://archive.ubuntu.com trusty/universe amd64 Packages [5,859 kB]   and  Get:51 http://archive.ubuntu.com trusty/universe i386 Packages [5,866 kB]   I've run dpkg -l | grep ":i386" but I just get back the prompt, indicating, I think, that I have no i386 packages installed.  My reason for asking is that if I could prevent the "getting" of i386 packages during apt-get update, I save my bandwidth and lessen the load, however marginally, on Canonical's servers.

I don't want to install any i386 package. Is there any way to disable functionality?


I'm trying to prove that if all vertices of a finite undirected graph are of odd degree, then each edge is contained within an even number of Hamiltonian cycles. (or none).   I know a Hamiltonian cycle in a graph is every cycle that contains each vertex in the graph exactly once. I tried to prove the problem by using geometrical figures with some extra edges added but it didn't work out. I would be really thankful if someone could explain their solution to this problem!

Let $G$ be a graph in which every vertex has odd degree. Show that every edge of $G$ lies on an even number of Hamilton cycles.


I had submitted a manuscript to an ESCI journal. It has been over 1 month since I submitted but the status shows "with editor".  I mailed the editor to check the status of my manuscript. The editor informed me that he had sent the manuscript to some referees but he has not received any reply from the reviewers. He/She further said that if I want, I may consider submitting my paper elsewhere.  How long should I wait for the reviewers to give a decision whether they will review my manuscript or not?  Also my deadlines for submission are due in 2-3 months, i.e. I need to get my first submission within 2-3 months.  What time can be considered enough to withdraw my submission?

What steps does a manuscript typically go through from submission to publication (or rejection) in a typical journal? How are these steps referred to, in particular by editorial systems, and how long do they each typically take?  Note that this question is about the typical situation and hence not about:   Journals with an atypical workflow, e.g. those that allow for an instantaneous reviewer–author interaction. Exceptional steps or rare occurrences such as withdrawal or .   This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.