It prints nothing.I think the problem is at the type char * but i dont know if and why.  int main() {     char *a = "0123456789" ;     char *b = "abcdefghij" ;     strcat (a,b) ;     printf( "%s", a ) ; }

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


The dependent variable of my problem is highly concentrated around zero. Here is a stemplot    The decimal point is 6 digit(s) to the right of the |    -2 | 511   -1 | 92221   -0 | 87777666666665555555555555555444444444444444444444444444444433333333+2428    0 | 00000000000000000000000000000000000000000000000000000000000000000000+2113    1 | 00000000000000000000000000000000000011111111111111111111111111111122+110    2 | 0000000000111111233333444444555666666677778889    3 | 00112457778889    4 | 11233456999    5 | 0000389    6 | 01477    7 | 259    8 | 033    9 | 002356   10 | 9   11 |    12 |    13 | 069   14 |    15 |    16 |    17 | 13   Normally when I have a dependent variable (DV) that looks like this I apply a logarithmic transformation for reasons both economical and mathematical. But obviously this will not work in this case as I have values below zero.  Is there another monotonically increasing transformation function that will reduce the peakedness of this distribution?

I have analysed my data as they are. Now I want to look at my analyses after taking the log of all variables. Many variables contain many zeros. Therefore I add a small quantity to avoid taking the log of zero.   So far I've added 10^-10, without any rationale really, just because I felt like adding a very small quantity would be advisable to minimize the effect of my arbitrarily chosen quantity. But some variables contain mostly zeros, and therefore when logged mostly -23.02. The range of the ranges of my variables is 1.33-8819.21, and the frequency of zeroes also varies dramatically. Therefore my personal choice of "small quantity" affects the variables very differently. It is clear now that 10^-10 is a completely unacceptable choice, as most of the variance in all the variables then comes from this arbitrary "small quantity".  I wonder what would be a more correct way of doing this.  Maybe it's better to derive the quantity from each variables individual distribution? Are there any guidelines about how big this "small quantity" should be?  My analyses are mostly simple cox models with each variable and age/sex as IVs. The variables are the concentrations of various blood lipids, with often considerable coefficients of variation.  Edit: Adding the smallest non-zero value of the variable seems practical for my data. But maybe there is a general solution?  Edit 2: As the zeros merely indicate concentrations below the detection limit, maybe setting them to (detection limit)/2 would be appropriate?


Let $(u_n)_{n \ge1}$ such as $u_1=\frac12$ and $(\forall n \ge2):u_n=(1-\frac3{2n})u_{n-1}$. Find the value of $\displaystyle \sum_{n=1}^{\infty}u_n$. This is my try : We can rewrite it as $\displaystyle u_n=(-1)\cdot\frac{\frac32-n}{n}\cdot u_{n-1}\Rightarrow\prod_{k=2}^nu_k=(-1)^{n-1}\cdot\prod_{n=2}^n\left(\frac{\frac32-n}n\right)\cdot\prod_{k=2}^nu_{k-1}$. It is clear that $(\forall n \ge 0): u_n \neq 0$, thus we have $ \displaystyle u_n=(-1)^{n-1}\prod_{k=1}^n\left(\frac{\frac32-k}k\right)$. Using the fact that $\displaystyle \binom{p}{q}=\prod_{k=1}^q \frac{p+1-k}k$ with $p=\frac12$, we now have $\displaystyle u_n=(-1)^{n-1}\binom{\frac12}{n}$. Thus $\displaystyle \sum^\infty_{n=1}u_n=-(-1)^{-1}\binom{\frac12}{0}+\sum^\infty_{n=0}(-1)^{n-1}\binom{\frac12}{n}=1+\sum^\infty_{n=0}(-1)^{n-1}\binom{\frac12}{n}$, but here I'm stuck because i wanted to use the Newton's generalized binomial theorem yet it is not possible here.... Any help please ?

I'm wondering about how to show compute this series: $$\sum_{n=0}^{\infty}(-1)^{n-1}\binom{1/2}{n}$$ My approach was to use the general formula of the binomial series, which is: $$(1+z)^r=\sum_{k=0}^{+\infty}z^{k}\binom{r}{k}$$ Yet this can't be used because in this case, we have $|z|=1$. Thus, is there any method that I can use for this?


I am very new to LaTeX and really only know how to use templates. I am making a LaTeX with the document class article that uses \include{} to put in the various sections in and it will start a new page after each section. I want to get rid of that. How do I do that?  This is my code  \documentclass[oneside]{article} % %% Based on a TeXnicCenter-Template by Gyorgy SZEIDL. \usepackage{amssymb} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{graphicx} \usepackage{mathrsfs} \usepackage{wrapfig} \usepackage{lipsum} \usepackage[margin=0.9in]{geometry} \usepackage[affil-it]{authblk}     \begin{document} \title{Awesome Title} \author{student} \affil{University} \author{studen} \affil{university} \author{PI} \affil{University} \maketitle \begin{abstract} words \end{abstract}  \include{intro} \include{model} \nopagebreak \include{vaccReg} \include{results} \include{conclusion} \appendix \include{AppendixModel} \include{methods}  \bibliography{MeaslesBibliography} \bibliographystyle{apalike}  \end{document}   I hope this is enough information

I like to print my drafts with big fonts and small margins (i do this in memoir style in a single chapter), but the \include comand creates a page break. Is there a way to avoid this and have section after section continuously?


I'm try to do something like this  public void method(Object obj, Class objClass) {     if(obj instanceof objClass) {         //do something     } }   I want to pass Class object or class name and test if that is and instanceof of that. This don't work, anyone know how to do this? Thanks

I remember reading in some Java book about any operator other than 'instanceof' for comparing the type hierarchy between two objects.  instanceof is the most used and common. I am not able to recall clearly whether there is indeed another way of doing that or not.


I have a level 5 champion mastery with Morgana, and recently received my second S rank champ token with her.  Upon going to the crafting menu, I select "Upgrade with 2 champ tokens and 1 champ permanent."  When I select that, however, it shows I have the tokens, but NOT the permanent.  I clearly own Morgana, but is that not a permanent? Is this a bug or am I missing something?

How do you earn free loot?  What's the deal with essences and why are they so important?  What do the different options mean when dealing with Redeeming Rerolling Disenchanting and Upgrading?  How does it all work?


I know that when it comes to search operation ArrayList is better. And when it comes to insertion and deletion operation LinkedList is better. But I have read that linked list will cause memory overhead. In that case is it still safe to use LinkedList. Is so in what situation we have to avoid using LinkedList even though our logic contains more of insertion and deletion operation

I've always been one to simply use:  List<String> names = new ArrayList<>();   I use the interface as the type name for portability, so that when I ask questions such as these I can rework my code.    When should  be used over  and vice-versa?


I've asked the same question here (I had not read the rules, sorry, I assumed this was more for general discussion.) and on the regular SO site, and both times the question was closed. "Don't ask about anything that is related to opinion" is pretty much what I've got from that.  The answer to this question:  doesn't answer the "where" portion of what I'm asking.  The answer to this question lists a lot of forums (or a link to the list anyway) but is not relevant to the question I have, and the answers are much slower coming in. One of my favorite things about SO is how quickly people answer.   I'm kind of at a loss here.

Can I ask questions about software application recommendations anywhere in the stackexchange system?  For example, I have a requirement, which will involve software and hardware.  I want to type this requirement up somewhere where possible readers will be able to recommend hardware and software solutions to my requirements?


Most people believe length contraction is a real spatial phenomenon and if so there's nothing to contract in empty space and since matter  contains mostly empty space then it is only the structure of matter that is physically contracting.  So now, if a mirror is mounted on a 45 degree plank coming out of the wall, only the plank and mirror will thin in the direction of motion when observed externally. The angle of the mirror won't change because there's nothing to contract irregularly behind the mirror. But if you mount the mirror on an L-bracket, the bottom of the bracket will contract more than the top and hence the angle of the mirror will now change solely because of the fact you've added matter to the bottom? Is this really how length contraction would work? Is this why pulses of light don't look contracted to us as they travel because they have no material structure to contract?

I was in argument with someone who claims that length contraction is not "real" but only "apparent", that the measurement of a solid rod in its rest reference frame is the "real length" of the rod and all other measurements are somehow just "artificial" and "apparent". Seemed to me like a bad conversation about poorly defined words and not really relevant to physics, but then some quotes were offered:  ...so that the back appears closer to the front. But of course nothing has happened to the rod itself.  (Rindler)  The effects are apparent (that is, caused by the motion) in the same sense that proper quantities have not changed.  (Resnick & Halliday) At the same time, the  insists that length contraction and time dilation are "real", with observable consequences:  Time and space dilation are often referred to as ‘perspective effects’ in discussions of STR. Objects and processes are said to ‘look’ shorter or longer when viewed in one inertial frame rather than in another. It is common to regard this effect as a purely ‘conventional’ feature, which merely reflects a conventional choice of reference frame. But this is rather misleading, because time and space dilation are very real physical effects, and they lead to completely different types of physical predictions than classical physics. [...] However, this does not mean that time and space dilation are not real effects. They are displayed in other situations where there is no ambiguity. One example is the twins' paradox, where proper time slows down in an absolute way for a moving twin. And there are equally real physical effects resulting from space dilation. It is just that these effects cannot be used to determine an absolute frame of rest.  I went through a lot of Einstein, Minkowski and Lorentz original material, and didn't find anything about what is "real" and what is not. Finally, I know about muons, where the effects of SR seem to be very real (from , but I had seen it in a physics class before):  When a cosmic ray proton impacts atomic nuclei in the upper atmosphere, pions are created. These decay within a relatively short distance (meters) into muons (their preferred decay product), and muon neutrinos. The muons from these high energy cosmic rays generally continue in about the same direction as the original proton, at a velocity near the speed of light. Although their lifetime without relativistic effects would allow a half-survival distance of only about 456 m (2,197 µs×ln(2) × 0,9997×c) at most (as seen from Earth) the time dilation effect of special relativity (from the viewpoint of the Earth) allows cosmic ray secondary muons to survive the flight to the Earth's surface, since in the Earth frame, the muons have a longer half life due to their velocity. From the viewpoint (inertial frame) of the muon, on the other hand, it is the length contraction effect of special relativity which allows this penetration, since in the muon frame, its lifetime is unaffected, but the length contraction causes distances through the atmosphere and Earth to be far shorter than these distances in the Earth rest-frame. Both effects are equally valid ways of explaining the fast muon's unusual survival over distances.  So which is which? Why do Rindler, Resnick & Halliday use the word "apparent"?


Consider the following complex power series  $$\sum_{n \geq 1} \frac{z^n}{n} \,\,\,\,\,\,\, z \in \mathbb{C}$$  It surely converges conditionally for $z=-1$ (for alternating series test) and for $z=1$ it diverges (it is the harmonic series).   My question is: how can one show that the power series converges conditionally for any $z \in \mathbb{C}$ such that $|z|=1$ (except for $z=1$)?

Consider the following complex power series :$$\sum_{n=1}^\infty\frac{z^n}{n}$$ The radius of convergence of this series is $1$ and the series is divergent for $z=1$. I want to know what are the values of $z\in C:=\lbrace z\in\mathbb{C}: |z|=1\rbrace$, the circle of convergence, for which the given series converges.


I have a folder that gets filled with large files that I want Time Machine to remember while retaining the option of regularly forgetting these large files. For this and up until Catalina I would regularly enter Time machine, go to this folder and use the command Delete all backups of... (see for instance the screen capture of @Inder 's answer in ). As of my recent upgrade to Big Sur I no longer see this contextual menu option. Is it gone from MacOS for good? Is there an alternative that does not involve under-the-hood sudo-type terminal surgery? Thanks! PS. I had a look at  but the issue, as I understand it, is different. I am looking for a way to delete all backups of a given folder, not a single backup (snapshot) of the whole system. Answers that call for bypass look a bit too scary for my taste.

I'd like to delete a file from my Time Machine backups, but there seems to be no option to do so in the Big Sur version of Time Machine. I go to the Time Machine menu and select "Enter Time Machine". Then I see the view with the stack of windows. I browse to a file and select it. Now I want to delete it so it doesn't exist and take up space in backups. There is no option to delete it - either the action menu in the toolbar, or the control-click context menu. How do I delete a file from Time Machine backups? There used to be a way to do this. (I'd take a screenshot, but the key shortcuts for screenshots don't work in Time Machine. Not sure if this is just a Big Sur thing or if that's always the case.) Update: I should mention I'm using APFS for my Time Machine volume. That seems to be relevant. Also, I contacted Apple support about deleting entire snapshots (slightly different goal than the one here in this question). They said you can't do it anymore. It seems like there's some bugs here, because I have a "Move to Trash" option if I control-click one of my backups. It seems to work initially but then the backup comes back.  I don't like losing this much control over my files. I may look for another backup solution.


I need the exact functionality what jQuery light box does. In my project in a loop, I have a hidden element for every item. When a visitor will click on the element, he/she will see the hidden element. Then, when the visitor will click outside the element (new), the element will hide again. But, the element has an anchor tag. So, if the visitor will click on the element, he/she can go to the link. I have to find out how I can select the area which is outside of the element.  I am giving here a simple HTML.

                  WDZ
   Javascript:     Now I need the code by I can implement:  "When a visitor clicks outside of id="two", it will show div id="one" again and div id="two" will hide. But, if he/she clicks inside div id="two", it has another functions.

I have some HTML menus, which I show completely when a user clicks on the head of these menus. I would like to hide these elements when the user clicks outside the menus' area.  Is something like this possible with jQuery?  $("#menuscontainer").clickOutsideThisElement(function() {     // Hide the menus });


I have many files for that i want to rename them.  Current Name: 5b011351286e8a042b23ffff\5b011351286e8a042b23ffff_130225_145634.xml  Required Name: 5b011351286e8a042b23ffff_130225_145634.xml  I just want to delete the part before the backslash and the forward slash as well.  I have 500 files for which i want to do same.


I'm currently working in an eLearning platform, and I'm trying to add some PEP8 validation to the assignment solutions students are submitting to the system in order to give then some extra feedback about how good or bad the solution they proposed is.  I found that using the python pep8 package it's not that simple to check PEP8 errors just in a chunk of code (in my case, it would be the posted solution to the assignment), without specifying any path to a specific file in the filesystem.  Is it actually possible or the pep8 library doesn't allow it? Of course I could save the posted solution in a tmp file and run the validation from there, but I would like to avoid this extra step.  Did anyone have the same issue?

How do I create a file-like object (same duck type as File) with the contents of a string?


I want to draw the following pie chart. I just wonder if anyone could show me where to start.  (Just the pie chart and those description circles around them)

I want to create a pie chart in LaTeX. Do you know a package which manages that? I tried datatool which uses tikz as backend but seems to be unusable due to mysterious floating point errors.


I got unresolved external symbol error when trying to use a function from external dll! Here is the code from exported dll:  //MathFunc.h #pragma once  template <class T> class MyMathFuncs { public:     T Add(T a, T b); };  extern "C" {     MYAPI MyMathFuncs<int>* createInst(){         return new MyMathFuncs<int>;     } }  //MathFunc.cpp #include "MathFuncsDll.h" #include <stdexcept>  using namespace std;  template <class T> T MyMathFuncs<T>::Add(T a, T b) {     return a + b; }   After compiling this project, I got .dll and .lib files. After that, I created a new project and added .dll file to output directory and .lib file to linker->Input->Additional dependencies. Here is code in the new project:  //main.cpp #include <iostream> #include "MathFuncsDll.h"  using namespace std;  int main(){     MyMathFuncs<int> * pObj = createInst();     cout << pObj->Add(1, 1) << endl;      cin.get();     return 0; }   However, when I compile it causes an error:  Error   1   error LNK2001: unresolved external symbol "public: int __thiscall       MyMathFuncs<int>::Add(int,int)" (?Add@?$MyMathFuncs@H@@QAEHHH@Z)    N:\Play around Code\DllApplication\DllApplication\main.obj   Is it because I have imported the dll wrongly or what? I have checked all the project's settings in the new project which included additional includes and additional dependencies(for .lib).

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I'm trying to understand the proof by induction of: $$ (a+b)^n = \sum \limits_{k=0}^{n}\binom{n}{k}a^{n-k}b^{k} $$ I'm at the point of deriving the inductive step and am getting next: $$ (a+b)^{n+1} = (a+b)(a+b)^n=\dotsb = a^{n+1} + b^{n+1} + \sum_{k=1}^{n}\binom{n}{k}a^{n+1-k}b^{k} + \sum_{k=1}^{n}\binom{n}{k-1}a^{n-1-k}b^{k} $$  Now, I also have a solution to this problem, and in the solution the two summations are turned into exactly the middle elements of the series (since $a^{n+1}$ and $b^{n+1}$ are the first and the last elements of the series correspondingly) and we get a perfect proof. However, I don't understand how next was achieved:  $$ \sum_{k=1}^{n}\binom{n}{k}a^{n+1-k}b^{k} + \sum_{k=1}^{n}\binom{n}{k-1}a^{n-1-k}b^{k} = \sum_{k=1}^{n}\binom{n+1}{k}a^{n+1-k}b^{k} $$  Any advises and hints are welcome.

I have to do proof of $(a+b)^n$ and $(a+b)^{n+1}$ with mathematical induction.  I finished the first one $(a+b)^n = a^n + na^{n-1}b+\dots+b^n$.  I however have trouble with the second one, I don't know what to start exactly. Any help/hints?


I want to prove that if $X$ is a metric space and has a dense countable subset, then it has a countable basis. I know that every metric space is first countable, but I can't continue. Thanks for your help.

I'm working on this problem from Munkres:  Show that every metrizable space with a countable dense subset has a countable basis.   Here's my attempt at a proof.  Let $X$ be a metrizable space with metric $d$ and a countable dense subset $A$.   Claim: $\mathscr{B} = \{B_{(a,1/n)} = \{x : d(a,x) < \epsilon = 1/n\} \forall a\in A$} is a countable basis for $X$.   This set is countable since it is in bijection with $A\times \mathbb{N}$ which is countable as a countable product of countable sets.   Now I want to prove that $\mathscr{B}$ is indeed a basis.   $1)$ Let $y \in X$ then $y \in \overline A$ (by the definition of dense) which implies $\exists$ $B_{(y,1/n)}$ s.t. $\exists$ $y'\in A$ s.t. $y' \in B_{(y,1/n)}$. But then since $y$ is within $\epsilon = 1/n$ for some $n\in\mathbb{N}$ of $y'$, $\exists$ $B_{(y',1/n)}$ which is an element of $\mathscr{B}$. Therefore since $y$ was arbitrary we know that there is a basis element containing every element of $X$.   $2)$ Now I want to show that for an element $x$ of the intersection of two arbitrary basis elements that there is a third basis element which contains $x$ that is a subset of the intersection. This is where I get stuck, any help would be appreciated.


Many times per day I need to switch between different speakers, which I do using my mouse in these 3 clicks as shown here:    I would much prefer if I could press a certain key or combination of keys on the keyboard to toggle between my 2 main sets of speakers (each of the 2 shown highlighted here). Is there some built-in Windows feature that would allow this? Or would another program (such as AutoHotKey, which I have installed) allow this?

Windows 7, Logitech G110 keyboard  2 audio devices (headphones and speakers)  I am hoping to find a quick way to macro a key to switch to headphones, and a key to switch to speakers.  Anyone have a good program or anything of that nature?  EDIT:  Using AHK to try and get this task working as hoped is sadly not doing the trick.  I have included a screenshot of my audio set, as well as a screenshot of my script as it sits now.    I have also tried to uncheck "show disabled devices" and modified the script to be Down 1, and Up 1 respectively.  It will work for one device, but it refuses to switch to the secondary.


I need to find all strings that occur between the words "Close" and "Minor", for example, but the words "Close" and "Minor" occur many times in my string. How can I use regex to find all of the strings between each instance of "Close" and "Minor". Example:  In the text  $string = "Minor fall major fifth Close to home Minors cannot vote before 18 Polls Close at 8";   I want to match   fall major fifth   and   s cannot vote before 18 Polls  I have tried to use this:  my @matches = $string =~ /Minor(.*) Close/gi;   but this matches  Minor fall major fifth Close to home Minors cannot vote before 18 Polls Close   which matches the words themselves, and does not produce the desired match.  I'm so lost!

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


I just come across a very interesting question, which, due to , scarcely will get any attention at all, not to mention any upvotes. So - I wish to spend some of my reputation points to distinguish an excellent question, just for sake of great justice.  Why can't we award a bounty for a question?   A trick just came to my mind - to award a bounty and to persuade an author to answer. But I don't like such a dirty game. Can't we make it square?

Amongst the reasons for starting a bounty, one can select:     Reward existing answer      One or more of the answers is exemplary and worthy of an additional bounty.   Why not enable one to reward excellent questions in a similar manner?


I just learned that about 1/1000 of hydrogen is deuterium. Does that mean 1/1000 of water is D2O, which is heavier and sinks to the bottom in a glass of water? And consequently is there a layer of D2O at the bottom of the ocean? thanks!

I heard today that deuterium for nuclear fusion could be extracted from the Oceans, in which it is present in "heavy water." I heard this claim:     "Deuterium is distributed uniformly with Ocean depth."   This contradicted my naive expectation that deuterium density would increase with depth, on account of it being in "heavy water." For example, salinity increases with depth. I asked, and received two contradictory explanations.   The first was that because powerful waves and Ocean currents mix Ocean water, gravity is negligible. This surprised me; I thought that Ocean's were stratified, with predominantly tangential, rather than vertical, currents.   The second explanation was that my view of seawater is naive - that I should think of seawater not as heavy and regular water molecules, but as a soup of weakly interacting deuterium, the normal hydrogen isotope and oxygen, forming and breaking water and heavy water molecules with a short time-scale. If so, apparently, deuterium density and the normal hydrogen isotope would be distributed evenly with depth. This did not help me, because, I then naturally wondered why deuterium's density doesn't increase with depth, since it is heavier than hydrogen-1?  Is the claim correct? and if so, what is really going on? I have the feeling that Ocean behaviour with depth might be non-trivial...


I'm using Texmaker on Linux Mint 15. I previously used Texmaker on Windows, with the MiKTeX package manager to automatically download required packages for me. Is there a similar tool I can use on Mint?

I use MiKTeX on Windows and quite satisfied with it. Recently I started switching all my tasks toward open-source alternatives, and in the course I would love to use Linux. In Linux TeXLive is available as alternative to MiKTeX. The thing I really like about MiKTeX, is its ability to install packages automatically. Can I do the same in TeXLive too? Is there a way I can enable such or install some plugins for it?  I am using Fedora 18, if that's needed.


I'm looking for a trick, or a quick way to evaluate the sum $\displaystyle{\sum_{n=1}^{99}\sin(n)}$. I was thinking of applying a sum to product formula, but that doesn't seem to help the situation. Any help would be appreciated.

How can we sum up $\sin$ and $\cos$ series when the angles are in arithmetic progression? For example here is the sum of $\cos$ series:  $$\sum_{k=0}^{n-1}\cos (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \cos \biggl( \frac{ 2 a + (n-1)\cdot d}{2}\biggr)$$  There is a slight difference in case of $\sin$, which is: $$\sum_{k=0}^{n-1}\sin (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \sin\biggl( \frac{2  a + (n-1)\cdot d}{2}\biggr)$$   How do we prove the above two identities?


My computer becomes extremely slow and I see the hard disk accessing as if someone was taking backup. How can I see what instruction my computer is executing? I am using Ubuntu 20.04 LTS 64-bit on an HP Intel i3 computer, 1.5 TB hard drive, 4 GB RAM.

I am looking for system monitoring tools which are GUI and CLI or web-based which include basic functions such as:   CPU Usage Ram Usage Swap Usage Disk Usage ( Space / I/O ) Heat Monitoring   I know there are many tools I can use, but I am looking for a single tool that has these basic functions.


If we run a workflow,Process Builder and a Trigger run simultaneously,Which one work first?

-> I have a field say Amount in Opportunity Object.   -> I have created a Validation Rule that If Amount is empty/null throw an error.  -> I have a workflow which will fire on creation of Opportunity, to empty the   Amount field.  Now when I create an Opportunity, It creates a record with Amount field as empty.  -> Now I have created a trigger  After Update Trigger, which will update another field in Opportunity, say a checkbox Revised Opportunity.  Now whenever I try to create an Opportunity there is an error caused due to trigger and after that validation rule.  I checked the debug log, I am able to see an Opportunity ID related to my newly created Opportunity and error message it displays in debug log is "Record is Read Only". I want to know how does this works? Does my record gets deleted(which I don't see in the log as being deleted) Or does the Process is not committed/rollback happens?  Because I tried creating an auto number(created two records with trigger as inactive and activated trigger and after two fails, I again inactivated the trigger and tried to save and found autonumber being incremented by 2) thinking that it won't get incremented in failing record save but auto number does get incremented. So, does it mean that my record is getting deleted in the Order of Execution?


I am trying to create an administrator account to be used only as a UAC credential prompt when launching specific command (such as user account creation). I also want to prevent from login with this account on the WinLogon interface.  Is it possible ?  Thx in advance for your answers

So I have a Windows 7 home machine with 2 user accounts.  One is a standard user account and one is an administrator account.  Now this is going to be put in the hands of a very low-tech user so I don't want them to be able to see the administrator account on logon, but they want to have a password to prevent someone else from using the machine.  My goal is that when the user turns on the computer, they are presented with their login.  After logging in to their non-administrator account, if something needs to be installed then the administrator account can be used through UAC.  I have tried creating the reg key HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows NT\CurrentVersion\Winlogon\SpecialAccounts\UserList and adding a dword of the account name and set it to 0.  It succeeded in hiding the account from th login screen.  As well as hiding it from UAC.  So it fails the second requirement, of being able to run things as administrator through UAC.  Also since I didn't set an administrator password (left it blank) it seems that I have completely locked myself out of the machine since runas doesn't accept blank passwords.  So I also cannot undo it, and have quite effectively bricked the install, prompting an OS reinstall.  This is Windows 7 Home, so there is no Users management console.


I've managed to prove this:  $$0 = (-1+1)z = -1\cdot z + z \rightarrow $$  $$-1\cdot z = -z$$  but how to prove that $-(-z) = z$?

I need to prove for all real numbers $a$, $-(-a) = a$ using only the following axioms:     Thanks to many members of the Mathematics Stackexchange Community, I have the following proof worked out:  Theorem: The Additive Inverse Identity is Unique  $ ( \forall a,b,c \in \mathbb{R} )(a+b=0) \land (a+c=0) \\ ( \forall a,b,c \in \mathbb{R} )(a+b=a+c) \\ ( \forall a,b,c \in \mathbb{R} )(b=c) \\ \text{QED} \\ $  Theorem $\textbf{a} \cdot \textbf{0 = 0}$  $ \begin{align} a \cdot 0 &= a \cdot 0 \\ a \cdot (0 + 0) &= a \cdot 0 \\ a \cdot 0 + a \cdot 0 &= a \cdot 0 \\ a \cdot 0 + a \cdot 0 + (-a) \cdot 0 &= a \cdot 0 + (-a) \cdot 0 \\ a \cdot 0 &= 0 \\ &\text{QED} \\ \end{align} $  Theorem: $-\textbf{1} \cdot \textbf{(a) = (}-\textbf{a)}$  $ \begin{align} a \cdot 0 &= 0 \\ a \cdot \left[ 1 + (-1) \right] &= a + (-a) \\ 1 \cdot a + (-1) \cdot a &= a + (-a) \\ -1 \cdot (a) &= (-a) \\ &\text{QED} \\ \end{align} $  Theorem: $-\textbf{(}-\textbf{a) = a}$  $ \begin{align} 0 &= 0 \\ -a \cdot 0 &= 0 \\ -a \cdot \left[ 1 + (-1) \right] &= 0 \\ -a \cdot 1 + -a \cdot (-1) &= 0 \\ -a + \left[ -(-a) \right] &= 0 \\ -(-a) &= a \\ \text{QED} \\ \end{align} $  Does everything look alright? Have I missed anything?  Also--why is it necessary to show that the additive inverse is unique?  Many thanks in advance.


Launching apps from Xcode 5 to the iOS simulator (multiple OS versions) fails with SpringBoard failed to launch application with error: -3. I can get around the problem by 'turning it off and back on again' (quitting the simulator and relaunching, uninstalling and redeploying the app, etc.), but it seems to come back again later and in other projects.  Can someone help me understand what the real problem here is and if there is a permanent fix?

Building an iPhone project results in:      Failed to launch simulated application: SpringBoard failed to launch application with error: 7   And the app doesn't install on the simulator. What's this all about? What's SpringBoard and what is error 7?


I have watched so many solution and applied all but still getting null pointer exception in my code. Here is my code kindly have a look and reply as fast as anyone can. Thanks in advance.  DBHandler.java Class code  public class DBHandler extends SQLiteOpenHelper { //Database Version private static final int DATABASE_VERSION=1; // Database Name private static final String DATABASE_NAME="Patient.db"; //Table Name private static final String TABLE_NAME="patientDetail";  //Table Columns Names private static final String ID="id"; private static final String NAME="name"; private static final String ADDRESS="address"; private static final String PHONE_NUMBER="phone_number";  //Constructor  public DBHandler(Context context) {     super(context,DATABASE_NAME,null,DATABASE_VERSION); }  //Creating Tables  @Override public void onCreate(SQLiteDatabase db) {      String CREATE_PATIENT_DETAIL_TABLE="CREATE TABLE "+TABLE_NAME+"("             + ID+" INTEGER PRIMARY KEY AUTOINCREMENT,"             +NAME+" TEXT,"             +ADDRESS  +" TEXT,"             +PHONE_NUMBER + " TEXT )" ;      db.execSQL(CREATE_PATIENT_DETAIL_TABLE); }  @Override public void onUpgrade(SQLiteDatabase db, int oldVersion, int newVersion) {     //Drop older tables if exist      db.execSQL("DROP TABLE IF EXIST "+TABLE_NAME);      /// Create Table again     onCreate(db); } public boolean insertData(String name,String address, String ph_no) {     SQLiteDatabase db = this.getWritableDatabase();     ContentValues values= new ContentValues();     values.put(NAME,name);     values.put(ADDRESS,address);     values.put(PHONE_NUMBER,ph_no);     long result = db.insert(TABLE_NAME,null,values);     if(result == -1)         return  false;     else         return true;  } }   //insertPatient.java Class Code  public class insertPatient extends Fragment {  DBHandler mydb=null;  EditText editname,editaddress,editph_no;  Button btn_adddata;  @Override public View onCreateView(LayoutInflater inflater, ViewGroup container,                          Bundle savedInstanceState) {     View rootView = inflater.inflate(R.layout.insert_patient, container, false);      mydb = new DBHandler(getActivity());      editname=(EditText) rootView.findViewById(R.id.insert_name);     editname=(EditText) rootView.findViewById(R.id.insert_address);     editname=(EditText) rootView.findViewById(R.id.insert_ph_no);     btn_adddata=(Button) rootView.findViewById(R.id.insert_button);     btn_adddata.setOnClickListener(new View.OnClickListener() {         @Override         public void onClick(View v) {             adddata();         }     });     return rootView; }  @Override public void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     mydb = new DBHandler(getActivity()); } public void adddata() {     mydb = new DBHandler(getActivity());     Toast.makeText(getActivity(), "working button", Toast.LENGTH_LONG).show();    try {         boolean isinserted = mydb.insertData(editname.getText().toString(), editaddress.getText().toString(), editph_no.getText().toString());         if (isinserted) {            Toast.makeText(getActivity(), "data saved", Toast.LENGTH_LONG).show();        } else {            Toast.makeText(getActivity(), "data Not saved", Toast.LENGTH_LONG).show();        }    }    catch (Exception e) {        Toast.makeText(getActivity(), String.valueOf(e), Toast.LENGTH_LONG).show();    } } }   I have appllied so many solutions like either button is initialized or not, getactivity(), getcontext() and getbasecontext() for initializtion of dbhandler object, also made many changes in my db handler with different solutions but still got the same error. I did not checked my solution for activity only as i am using fragment classes so i tried it only in it.

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?


The State Police Have Busted the thief or The state police has busted the thief?  According to me, It is Have because police is a group of people. So police is plural noun.

Which of the following is correct?        Devon Police is recording incidents       or        Devon Police are recording incidents


I dual booted windows 10 and ubuntu  my hard drive is 1 tb  first part of hard disk about 700 gb is windows  then second part was another windows drive with 200 gb space  that I recently deleted it  and last part is 100 gb for whole ubuntu without separating home and root and ...  now I want to extend ubuntu with 200gb unallocated space and I can't  what should I do   thank you

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


I'm developing a voxel game with OpenGL and want to optimize the number of rendered faces. How can I estimate how many faces at most a modern graphics card of a certain brand is able to compute, while still managing to render at 60fps?

With me going it alone in development I only have limited resources at my disposal i.e one pc with which I develop and test the game. so I only know for certain my game works with that setup.  What options have I got in testing the game on the many different hardware/operating system combinations? Its a windows desktop game.


Is it possible to use ready boost on a partition of my HDD(I have only one) instead of a USB drive. I want to so this because sata write speed is faster than USB. Thanks

I have two SATA HDDs in my desktop PC (one for daily activity, one for storage and backup). I can finely use ReadyBoost with pendrives, but I wonder, Is there a way I could use my underutilized second HDD to participate in the cacheing mechanism (same concept as having two CPU cores crunch things in parallel: have two HDDs fetch data in parallel)? Clearly speaking: I want to enable ReadyBoost on my separate D: drive.


Of the major configuration management tools such as puppet, chef, salt, ansible, etc... which package has the best support for Windows server operating system?

I help manage environments for an application that uses cloud-based Windows server VMs. The application stack consists of Windows Server 2008 and Windows Server 2012, SQL Server 2008, IIS, and SharePoint 2010. I have several environments Dev/Test/Stage/Prod. I am looking for a way to do configuration management of those environments to make sure any environmental changes are applied in a consisent way and there is a way to verify that no changes have been made to one environment that have not been made to other environments.  I have been reading up on Puppet, Chef, etc and I like the idea of doing delcarative configuration management. What is a good method or tool to use to help manage the configuration of these environments. I know a little  about SCCM but it is too expensive for this particular situation although I would still be interested in knowing if it has the capabiltiy to do those things.


Let  $a_1$ and $a_2$ be positive numbers and suppose that the sequence {$a_n$} is defined recursively by $a_{n+2} = √a_n + √a_{n+1}$. Show that this sequence is convergent.    So, I have been able to show the convergence taking three different cases namely,   Case 1:  Both $a_1$ , $a_2$ <4, then I proved that the sequence will be monotonically increasing as well as bounded and so converging  Case 2:  Both $a_1$, $a_2$ >4, in this case the sequence is monotonically decreasing and bounded and hence convergent.   Case 3: One of $a_1$ and $a_2$ is <4 & other >4, lets say, $a_1$<4<$a_2$ in this case sequence will alternatively increase and decrease i.e. $a_{2n-1}$ will be increasing and $a_{2n}$ will be decreasing and $a_{2n}-a_{2n-1}$ will converge to Zero.   My question is that is there any general method through which we don't have to take all these cases and can prove the convergence of series in more generality?

Question: Consider a sequence $\{a_{n}\}$ such that $a_{1},a_{2}>0$, and for all $n \in \mathbb{N}$ we have:  $$a_{n+2}=\sqrt{a_{n+1}}+\sqrt{a_{n}}$$  Prove that :  $\displaystyle\lim_{n\to\infty}a_{n}$ exists and find this limit.  My work: If this limit exists, let $\displaystyle\lim_{n\to\infty}a_{n}=x>0$; then we have $$x=\sqrt{x}+\sqrt{x}\Longrightarrow x=4$$ But I can't see how to prove the limit of $\{a_{n}\}$ exists. Thank you for you help!


The king said that the/a person who shows kindness to people whenever they can will wear a crown of gold.  Our sergeant said that the/a student who works hard to improve will rise through the ranks.  The poor boy asked the king on behalf of the/a person who was devoted to the king … At the award ceremony, it will be said to the/a person who received an award, “Stand up and sing.”   Questions    Which article is correct to use in these sentences?    Does the meaning change if I use either?  What’s the difference?

Example sentence:     I had a little time before the train came.   Would you please explain to me why it is correct to use "the" before "train"? My teacher told me that "the" is used before objects well-known to both speakers and that if a noun is used for the first time we shoud use "a".   But in this example the speaker uses "train" for the first time. Moreover we don't know about this train, so we must use "a train", not "the train". But it was a native speaker who said it; what exactly did he mean to say?


My disk space is rapidly getting eaten up and I don't know why.  I was using localhost and it was taking a long time to load so I checked the properties in the folder and I had 2GB left out of 125GB on my SSD.  What is causing this error and how do I fix it?

I have only one disk in my computer, a 80 GB SSD. It is formatted as a single ext4 partition (no swap), and all the usual folders are installed on it (I keep lots of data on external media, but /home and all the rest is on the SSD).   Today I booted it and I got a message that the drive is full. I opened Disk Usage Analyzer to look at what takes up space. It insists that 67.8 GB of the disk are used, and that / is taking up 36.4 GB. Which leads to the question, where are the missing 30 GB, if not on the file system?!    Just to have a comparison, I added up all the sizes of all readable folders listed in Nautilus as subfolders of / (including the hidden ones). I got 20.9 GB. Trash was unreadable, but I know it has 16.2 GB, so the sum is 36.1 GB, around the same as what Disk Usage Analyzer is reporting. There were some system folders which were unreadable, like proc, but I doubt that they add up to 30 GB - else it wouldn't be possible to install Ubuntu on small disks, and I've seen it run on 2.5 GB. I think they must be the 0.3 GB difference between my calculation and the Disk Usage Analyzer's report.   So I'd like to know, what is eating up these 30 GB and how do I get it to free them?     Edit with answers to CYREX's questions   Booted from Ubuntu 10.10 64-bit live CD (same as my system).  fsck result:   root@ubuntu:~# fsck /dev/sda1 fsck from util-linux-ng 2.17.2 e2fsck 1.41.12 (17-May-2010) /dev/sda1: clean, 265956/4890624 files, 18073343/19537408 blocks  Booted from the SSD. Emptied the trash, and the 16 GB from there are now free. The 30 GB are still missing.    I'm not experienced enough to know what counts as weird in a log. Here are my messages log and my syslog since last boot. Maybe you can find something in them:       Here it got really strange. I plugged in an external 500 GB HDD. Disk Usage Analyzer overreported the available space, then showed space missing (76 GB used, but only 24 in folders).      Booted again from the LiveCD, started the Disk Usage Analyzer from it and got the same results as from the installed Ubuntu, within 1-2 GB.   Edit with answer to CodeMonk:  That would have been a nice solution, but the partition is really 80 GB - I mean 74 GB + marketing "error", anyway the whole disk is formatted. It also shows that over 50 GB are used, so where are the 30 GB if not in files and folders?    GParted also reports the correct size of the external HDD.


I am working on a simulation and I get an error every time! I tried evreything but i cant find an answer. This is the code: Person.java:  package School;  import java.util.Random;  public class Person {     private Random rng;     private String Name;     private String[] Friends;     private int Hobby;     private boolean IsDitch;     public Person(String Name, String[] Friends, int Hobby, boolean IsDitch){         int aof = rng.nextInt(20);         this.Name = Name;         this.Friends = Friends;         Friends = new String[aof];         this.Hobby = Hobby;         if(rng.nextInt(10) == 0){             IsDitch = true;         }else{             IsDitch = false;         }         this.IsDitch = IsDitch;     }      public boolean getIsDitch(){         return IsDitch;     }      public int getMaxFriends(){         return Friends.length;     }      public String getName(){         return Name;     } }   Interaction.java:  package School;  public class Interaction {     public static void main(String[] args){         String[] g;         g = new String[2];         g[0] = "Natasha";         g[1] = "Fill";         Person mrt = new Person("Adam",g,2,false);         System.out.println(mrt.getName());     } }   The error I am getting:  Exception in thread "main" java.lang.NullPointerException     at School.Person.<init>(Person.java:12)     at School.Interaction.main(Interaction.java:9)

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'm making a game that generates four buttons with different hidden values. When my code runs the first time it works exactly as it should until I try to reset for a new game. After I empty the "crystals" div containing my four buttons, I generate four new ones but now they no longer work! How can I empty and repopulate a div with buttons that have click handlers that keep working? I'm new to coding so it's probably something dumb and easy.  I've tried substituting $('#crystals').empty with $('#crystals).html(""), per other articles on stack overflow, but I haven't found any resources specifically dealing with click handlers and the empty() function. I've also moved my functions around so they're inside the document.ready function as suggested by a classmate. I get the distinct impression that I'm asking the wrong questions.       var growCrystals = function() {       for (i = 0; i < 4; i++) {         var crystalButton = $("<button>");         scoreValue = Math.floor(Math.random() * 12) + 1;         console.log(scoreValue);         crystalButton.attr('class' , 'crystal-button');         crystalButton.attr('score-value' , scoreValue);         crystalButton.text('button');         console.log(crystalButton);         $('#crystals').append(crystalButton);       }     }      var newGame = function() {       targetNumber = pickTargetNumber();       totalScore = 0;       gameOver = false;       console.log($('#crystals'))       $('#results').empty();       $('#crystals').empty();       console.log($('#crystals'))       growCrystals();       console.log($('#crystals'))       updateGameboard();       console.log(gameOver);     }      // Game     $('document').ready(function() {     newGame();      $('.crystal-button').click(function() {         totalScore += parseInt($(this).attr('score-value'));         console.log("pushed ", $(this).attr('score-value'));         if (gameOver) {           newGame();         } else if (totalScore === targetNumber) {           // You win           wins++;           console.log("win ", wins);           updateGameboard();           $('#results').text('Player wins! Click any crystal to start a new game!')           gameOver = true;         } else if (totalScore > targetNumber) {           // You lose           losses++;           console.log("loss ", losses);           updateGameboard();           $('#results').text('Player loses! Click any crystal to start a new game!')           gameOver = true;         } else {           console.log("test loop occured")           updateGameboard();         }       })      });
             ...
                 ...

                 ...
                               ...
             ...

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.


Is there any difference in meaning? Or are they pretty much always interchangeable? ESL students are having trouble understanding when to use which expression. Thank you.

Are both try to save the file and try saving the file grammatically correct? If so, is there any difference in meaning?


I have Visa which i got from German Embassy in India. it says  Valid for : Deutschland, Type of Visa: D, Number of entries: MULT, Valid for Stay: 90, 6 months Visa.  I have not traveled on this Visa before. mean I never stayed in Germany on this visa, my concern is, do I need to stay there for some time before travelling to other countries. Or is it OK to travel?  Now I need to visit 2-3 Schengen countries for tourism purpose. So in my expected travel, transit is from Munich.  Can I travel on this Visa to Paris, Belgium and Vienna?

I’m going to Germany for a semester exchange and I have a long-stay visa from Germany. Can I travel to the other Schengen states during this period with this visa or do I have to apply for a separate short stay Schengen visa?  My visa is German national visa type D. It is for a duration of 4 months, i.e., longer than 90 days. It says on the visa that the long stay visa is valid in Deutschland, which is different from my earlier visa, which I had when I visited Germany earlier; that one was a short stay visa and said it was valid in Schengen Staten.  Perhaps my current visa means that I can stay in Germany for a period of longer that 90 days can visit the other Schengen states if I don’t exceed the 90 day period.


First of all: I am a beginner, and have only basic knowledge about linux and servers. Also, this question is kind of vague, but i hope you can help. I would be very thankful for all kinds of feedback and guidance!   I'm running Ubuntu server 14.04 LTS on a very old PC. I want to be able to host a webpage. I am hosting the same page locally using my 2010 mac mini with MAMP, and that works very well. I needed to update my mysql login details when i transferred the project to the PC, and  also imported the database. The problem is that when i try to view the page, it gets stuck at the point where it needs to access the db to find out wether or not the client is logged on. I've tried sudo /etc/init.d/mysql reload, sudo /etc/init.d/mysql restart and more, but it never seems to make much of a difference...

The php mcrypt extension on ubuntu 14.04 shows that it is installed properly, but phpmyadmin says:   The mcrypt extension is missing. Please check your PHP configuration.   My current php config is . If you need anymore information, please contact me through the comments.  $ sudo apt-get install php5-mcrypt     Reading package lists... Done     Building dependency tree            Reading state information... Done     php5-mcrypt is already the newest version.     0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


I have already tried java applet it gets MAC address but now i want do it using javascript I have an web app in which i want store user's MAC address using javascript. How i can find MAC address of user using any browser.

I know that we can get the MAC address of a user via IE (ActiveX objects).  Is there a way to obtain a user's MAC address using JavaScript?


I am updating record on the base of sub query but it giving me error      you can't specify target table for update in from clause   my query is   UPDATE paymentinfo set customer_id =  (    SELECT transation.transactionid     FROM paymenttransaction AS transation     LEFT JOIN paymentinfo as payment     ON (transation.paymentinfoid=payment.paymentinfoid)     where payment.hash="0b576d33c57484692131471a847eab7c" )  WHERE hash="0b576d33c57484692131471a847eab7c"   where am i wrong and what will be perfect solution for that problem

I have a table story_category in my database with corrupt entries. The next query returns the corrupt entries:  SELECT *  FROM  story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category INNER JOIN         story_category ON category_id=category.id);   I tried to delete them executing:  DELETE FROM story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category        INNER JOIN story_category ON category_id=category.id);   But I get the next error:      #1093 - You can't specify target table 'story_category' for update in FROM clause    How can I overcome this?


What are the differences between different types of symbolic link in Windows?  The Microsoft website tells me;  /d Creates a directory symbolic link. By default, mklink creates a file symbolic link.  /h Creates a hard link instead of a symbolic link. /j Creates a Directory Junction.   I'm still none the wiser as to what the differences are between a directory symbolic link, a hard link and a directory junction.

In the context of NTFS:  MKLINK [[/D] | [/H] | [/J]] Link Target /D      Creates a directory symbolic link.  Default is a file symbolic link. /H      Creates a hard link instead of a symbolic link. /J      Creates a Directory Junction. Link    specifies the new symbolic link name. Target  specifies the path (relative or absolute) that the new link refers to.   Isn't a directory junction the exact same thing as a directory symbolic link? What's the difference between mklink /D f1 f2 and mklink /J f1 f2 ?  Since a "directory" is actually just a file, what would be the difference between a directory symbolic link and a file symbolic link?


I worked in the US this summer and I received a paper check from tax returns on my address in the US. But I live in Europe now, and I don't have an American debit card.  Can a friend of mine who has the check cash it out for me on his bank account? Or is there another way to get the money to me?

I'll receive a USD cheque shortly. I prefered payment by money transfer, but all attempts to do so - i.e. SWIFT/IBAN, Payoneer, transferwise - failed. Now I will receive a cheque by mail.  I contacted my bank and they say that they can cash a cheque for me, given a (prob hefty) fee. The bank employee was so kind to warn me, that in case of a cheque the funds are cashed, but reserved until the legal reimbursement period ends, which apparently is between 3 and 6 months.   Is there really no quicker way to receive payments by cheque and have access to the funds quickly?


I want to backup my full ubuntu (18.04) as an iso , so that I can install from that iso later in my system , and get back all the applications installed with their settings . All the browsers with all settings logins and all addons installed . I want full clone of my system as a bootable iso image . Is that possible ? thanks in advance .

This is the third time I have installed Ubuntu on my pc along with Windows 7, but every time I install, I have to upgrade all packages. (Almost 300 - 400 Mb). Is it possible to make a bootable DVD of my current installation so that I don't have to upgrade all the packages next time?


Since java.util.Date is mostly deprecated, what's the right way to get a timestamp for a given date, UTC time? The one that could be compared against System.currentTimeMillis().

When I create a new Date object, it is initialized to the current time but in the local timezone. How can I get the current date and time in GMT?


I am new on unix systems, I want to ask about the hosts file that is in /etc/hosts what does used for ??  also  I want to ask that when connect using ssh=> I wrote on hosts file the following x.x.x.x (server IP) server.hostname  and when use ssh root@server.hostname it says that  Unable to resolve host 'server.hostname': Connection failed.

I'm very new to Ubuntu and I want to know: what is the exact use of /etc/hosts?   Lets say I'm adding this into it :  127.0.x.x mydomain   What does that mean?


I am using jquery to pull in JSON and loop through the results to create a collection of items.  Namely, Anchors with a few data attributes.  I then am watching those items so that on click I can pull the relevant data attributes and... do things with that data.  When I hard code in the anchors with the data, everything works great.  When I create them dynamically through the JSON I get nothing, and the page refreshes.  jQuery( document ).ready(function() {      $.getJSON("http://glacier.creativefilterdev.com/wp-json/wp/v2/chocolate?categories=42&per_page=100&order=asc", function(result) {     $.each(result, function(i, item) {          if(item.better_featured_image == null){          } else {             $(".white").append("
" + item.title.rendered + "");         }     });     });      jQuery("a[data-text]").click(function(){         if(howMany < countVar) {             howMany += 1;             var imgurl = jQuery(".single").val();             var structure = jQuery('
-
');             jQuery('.buildbox').append(structure);             jQuery("#alert").css('display', 'none');        } else {              jQuery("#alert").css('display', 'block');        }        return false;     }); });   I apologize as there is code in there that I haven't explained as that is the "stuff" I'm doing with the data from the anchors.

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.


I have a \longtable that splits over two pages and currently shows the label and caption at the top of each page. Can I change this so that the caption and label to only appear on the first page and still keep the headers on each page?  \begin{longtable}{|p{3cm}||p{7cm}|p{5cm}|}     \caption{Some text}     \label{tab:1}     \hline     \textbf{Parameter} & \textbf{Value}  & \textbf{Definition}  \endhead     \hline     ...                                                   \hline \end{longtable}

I am trying to set up a longtable where the header is repeated on every new page but the caption only appears once at the top of the page.  The table is defined as follows:  \begin{longtable}{|l|l|l|} \caption{the table caption} \label{tab:11swpkg}\\ \hline \rowcolor{gray} HeaderCol1 & HeaderCol2 & HeaderCol3\endhead     \hline\hline Item11 & Item12 & Item13 \\ \hline Item21 & Item22 & Item23 \\ \hline Item31 & Item32 & Item33 \\ \hline \end{longtable}   This nearly works because the header is indeed repeated after a page break but so is the caption. How can I get rid of the caption after a page break?


It is possible to share a tampermonkey script to someone but to hide the code from it and somehow to secure it. I just don't want not to be possible for anyone to copy/paste the script from there.

I want to make a JavaScript application that's not open source, and thus I wish to learn how to can obfuscate my JS code? Is this possible?


Prove that for any positive integer n,$$ 2\sqrt{n+1} - 2 \le 1 + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + \dots  + \frac{1}{\sqrt{n}} \le 2\sqrt{n} - 1 $$  Could anyone give me a hint on this question? Does it have something to do with Riemann Sums?

Prove that for any positive integer $n$, $$2\sqrt{n + 1} − 2 \le 1 +\frac 1 {\sqrt 2}+\frac 1 {\sqrt 3}+ \dots +\frac 1 {\sqrt n} \le 2\sqrt n − 1$$ Progress I think Riemann sum should be used for the middle term. I got the limit as $n\to \infty$ of the function inside using Riemann sum but what I cannot get are the lower and upper bound.


These are the options that I have available:    And this is what I've got if I try "Something Else":    What can I do to reinstall it without losing my files?  UPDATE: Is this how I should select the options?

Recently I installed Ubuntu 12.10 x64 Server Edition on my PC. Unfortunately, I attempted to install a lightweight desktop but due to the fact that I have an old graphics card, the PC does not perform so well. I am thinking of re-installing an Ubuntu version but I do not want to lose the contents in my home folder. Is there any way to do that with a Live CD?


Given natural numbers $a,b,c,d$, let $a,b$ be coprime with $b>a$ and let $c,d$ be coprime with $d>c$. Define a function $f:\mathbb{Q}^2 \to \mathbb{Q}$ as $$f\left(\frac xy, \frac zw\right)= \frac{x+z}{y+w}$$ Where $x,y$ are coprime integers, as are $y,w$. I have two questions:   Is $f$ in literature? I would like some references for further study. Is it ever the case that  $$f\left(\frac ab , \frac cd\right) = \frac ab + \frac cd$$ ? I have tried lots of numerical examples but can’t find any such $a,b,c,d$.

I am writing a short discussion of Farey numbers and was wondering if there are any examples of when the mediant function is ever actually equal to the sum of the two fractions in the usual sense? (Not to produce Farey numbers, I just thought it might be an amusing way to introduce Farey addition).   Explicitly: Are there any examples of fractions $\frac{a}{b}$ and $\frac{c}{d}$ where  $$\frac{a}{b}+\frac{c}{d}=\frac{a+c}{b+d}$$ for positive integers?   Currently I have found the example  $$\frac{1}{1}+\frac{1}{i} =\frac{1+1}{1+i}$$ if we remove the integers requirement but it would be nice to find a case that didn't involve complex numbers though!


My Android phone comes installed w/ an app that graphs out power usage of various components over time, so it's clear that the screen is the biggest user, followed by the phone, followed by Facebook etc.   Is there a similar app for the MacBook?  I'm following best practices yet only getting a couple of hours of time out of a new (reconditioned) 2013 Macbook Pro (Mt Lion) with a battery showing only 10 cycles and near max health on it.    Thanks

The Android OS monitors the power consumption of running apps and hardware (display). As you may guess, this is a useful feature as it allows to track down energy greedy apps.  Is there an application that would do such monitoring on Mac OS?  It should calculate the percentages of the charge that an application/process/hardware has used.  I use plenty of little software that runs in the background permanently. It would be nice to know if such little helpers drain the battery significantly.


I downloaded the ISO for Ubuntu 16.04.3 but I want to have it use at least kernel 4.8 because I'm trying to install this on a Microsoft Surface 3 (non-pro), which the 4.8 kernel supposedly adds support for. All the tutorials I see online for kernel upgrade is when Ubuntu is already installed. I need directions for updating it before installation.  Right now when I try to boot from the 16.04.3 live disk I got the Ubuntu logo and then it freezes at a black screen. The same thing happens with the Ubuntu 17.04 live disk as well.

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


Say I have a GIF such as this:    How could I create something like , where the user added this video into a still shot of an iPhone?  Better yet, if I could put it in a mockup like  where it has a smart layer that I would normally just drop my still image into, but in this case I'd love a GIF. I have Adobe Photoshop CS6.

I'm sure you've seen Dribbblers upload animated mockups of their designs.   Here's an example:     I can create mockups on Photoshop and even apply simple Tween Animations to them but I can never get my GIFs to look like the example here.   What are Dribbblers using to create these animations?   Notice that the animations also include touch points and perfect motion. I would like to convert my Photoshop mockups to do the same.  How can I create an animated example of my mockups, similar to the ones created by Dribbblers?


I have declared a template function in .h file and defined in a .cpp file and calling the function from another .cpp file.  i am getting the following error  /tmp/ccJg5vwy.o: In function main': main.cpp:(.text+0x8f): undefined reference toshort temp < int, std::allocator < int > >(std::__cxx11::list > const&)'   collect2: error: ld returned 1 exit status  my files are:  //main.cpp  #include"a.h" #include<iostream> #include<list> using namespace std;  int main(){     list<int> arr(5);     for (int i=0;i<5;i++)         arr.push_back(i);     fun1();     fun2();     temp(arr);     return 0; }   //a.h  #include <list> using namespace std; void fun1(); void fun2(); template <class L ,class A>     short temp(const list<L,A>& val);   //fun2.cpp  #include"a.h" #include<iostream> using namespace std; void fun2(){     cout<<"I am in function2\n"; }   //a.cpp  #include "a.h" #include<iostream> using namespace std; void fun1() {         cout<<"I am in function1\n"; } template <class L,class A>     short temp(const list<L,A>& val){         cout<<"inside the template function\n";         typename list<L,A>::const_iterator iter=val.begin();          while (iter != val.end())                 {                        cout<< *iter << endl;                        ++iter;                 }          cout<<"leaving the template function\n";             return 0;     }   and i am compiling the files in the following format  g++ a.cpp fun2.cpp main.cpp  I am not getting why there is a linking problem.  I have also tried by changing a.cpp and a.h to the following format but still i am getting the error  //a.cpp  #include "a.h" #include<iostream> using namespace std; void fun1() {     cout<<"I am in function1\n"; } template <class L>     short temp(const list<L>& val){         cout<<"inside the template function\n";         typename list<L>::const_iterator iter=val.begin();         while (iter != val.end())                 {                        cout<< *iter << endl;                        ++iter;                 }          cout<<"leaving the template function\n";             return 0;     }      //a.h  #include <list> using namespace std; void fun1(); void fun2(); template <class L> short temp(const list<L>& val);   in this case error is  /tmp/cce0eJj9.o: In function main': main.cpp:(.text+0x8f): undefined reference toshort temp< int >(std::__cxx11::list > const&)' collect2: error: ld returned 1 exit status

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


Let $(X,d)$ be a metric space and fix some $y \in X.$ Show that the function $f: X \to \Bbb R $ defined by $f(x) = d(x,y)$ is Lipschitz continuous.  Let $x, z \in X$. Using the triangle inequality one has $$f(x) = d(x,y) \leqslant d(x,z)+d(z,y ) =d(x,z) +f(z)$$ and $$f(z) = d(z,y) \leqslant d(z,x)+d(x,y) = d(x,z)+f(x).$$ Now I was trying to combining these to bound $|f(x)-f(z)|$ somehow, but this doesn't seem to work like I thought. I get that $|f(x)-f(z)| \leqslant |d(x,z)+f(z)-(d(x,z)+f(x))| =d(x,z) +f(z) +d(x,z)+f(x) = 2(d(x,z)) + f(x)+f(z)$, which doesn't help at all. What am I missing here?

Let $(X,d)$ be a metric space and $ a \in X $ Show that $f(x) = d(x,a)$ is a Lipschitz function from X to $\Re$ Use this fact to show $S$ is an open subset of $X$: Let $(X,d)$ be a metric space and $a \in X, r > 0.$ Let $S$={$x \in X : d(a,x) > r$}  >Lipschitz Defn:  Let $f$ be a function from $(X,d)$ to $(Y,\rho)$ $f$ is said to be Lipschitz if: $\exists$ K $\geq$ 0 s.t. $\rho( f(x_1) , f(x_2) ) \leq$ Kd($x_1$,$x_2$) $\forall$ $x_1 x_2 \in X$  >Continuity Defn:  Let $(X,d)$ and $(Y,\rho)$ be metric spaces, and $f: X \to Y$ Then $f$ is continuous $iff$ f$^{-1}$($B$) = { $x \in X : f(x) \in B $} is an open subset of $X$, whenever $B$ is an open subset of $Y$  >Triangle Inequality for a Metric:  $d(x,z) \leq d(x,y) + d(y,z)$   My first question is, am I thinking about this correctly? If $f(x)$ is a Lipschitz function, it is uniformly continuous If $f(x)$ is uniformly continuous, it is continuous at every point If $f(x)$ is continuous at every point $\Rightarrow$ the inverse images of open sets are open Hence $S$ is an open subset of $X$.  Secondly, how would you formally construct this? We know $f(x) = d(x,a)$ s.t. $f:X \to \Re$ By definition of Lipschitz we have $\exists  K \geq 0$  s.t. $\rho(f(x_1),f(x_2)) \leq Kd(x_1,x_2) \forall x_1,x_2 \in X$ & since our codomain is $\Re$ $\rho(f(x_1),f(x_2)) = | d(x_1,a) - d(x_2,a) | \leq Kd(x_1,x_2)$ Taking $K=1$ $\ldots$ Help in finishing this off would be appreciated. Thanks.


Just a beginner question here about dimensions. As an exercise I wanted to create a house and started with a block. The block was supposed to be 20m long, 3m high and 6m deep. I entered these values in object mode:  Then I wanted to continue changing the shape in edit mode to progress with the house design but I saw that the displayed dimensions of the edges were completely different than in object mode:  ...however, if I switch to "global" in the side menu under "transform" the dimensions become correct again...:  Can anybody tell me what's going on here? Why are the values different? Thanks in advance for helping me out.

I just found out about the Mesh Display : Length feature in the "N" panel (thanks to ) that allows one to measure the length of a face or vertice.  But my first encounter with this tool gives me complex feelings of love and hate, see how, as I was trying to measure the aspect ratio of this TV screen, I am getting WIDTH = 20.33 and HEIGHT = 37.57.  These values seem awfully wrong, since my betrusted eyes tell me the height should be shorter than the width.    I have tried measuring the single vertices as well, to identical results.


At some point in history I made some settings change somewhere to save screenshots to the clipboard instead of the default Desktop location. However, I did this somewhere else than this place:    I still most often want to use the clipboard, for instance when posting this question :)  My problem is that both with or without control modifier, they're always saved to clipboard. I think this is because I didn't use this setting here but something else that interferes/overrides. I currently have no way to store a screenshot without going through the hassle of creating a new file in preview to paste into… Any tips highly appreciated!  ---- Update to clarify:  I have tried all the normal screencapture settings and currently have:  defaults read com.apple.screencapture {     location = "/Users/viktor/screenshots";     type = png; }   However, there is still no way OSX ever produces any files, just clipboard. This is due to the fact that I made some more obscure change some time back that was not as simple as changing the shortcut like above or these plist settings that seem to be common now. What I need help with is finding out what that was to be able to restore. It was probably 5 years or so and my guess is that the shortcut settings for this didn't even exist at the time, therefore leaving me to use something else that now overrides this…

Recieved the error:  'Your screenshot could not be saved. You don't have permission to save files in the location where screenshots are stored.' with OS X Yosemite.  I opened terminal and tried directing the screenshots to save on my desktop:  Brigittes-Air:~ eggsalad$ defaults read com.apple.screencapture location 2017-01-06 03:04:47.765 defaults[17729:1947540]  The domain/default pair of (com.apple.screencapture, location) does not exist  So I tried writing and:  Brigittes-Air:~ eggsalad$ defaults write com.apple.screencapture location ~/Desktop 2017-01-06 03:05:08.652 defaults[17742:1948451] Could not write domain com.apple.screencapture; exiting  I'm not sure where the screenshots are being stored if the location does not exist. Ideas?  EDIT  I ran something else and got a different response, but defaults are still unchanged.   Brigittes-Air:~ eggsalad$ defaults write com.apple.screencapture location/Users/eggsalad/Desktop killall SystemUIServer  2017-01-06 03:22:35.444 defaults[18265:2001767] Unexpected argument SystemUIServer; leaving defaults unchanged.  2nd EDIT  Result of:  ls -l ~/Library/Preferences/com.apple.screencapture.plist  was:   ls: /Users/eggsalad/Library/Preferences/com.apple.screencapture.plist: No such file or directory


I want to write characters in latex with indexes in every corner. For example to write a transformationmatrix from the basis B to the basis B' i need smth like this:   how can i do that with latex?

I am trying to put two subscripts at the left and right of a character. For example, something like:  _{t} p_{x}  where p is in the middle. How do you do this?


I haven't used this system for a while, so when I went to update it I started getting error messages such as this:  E:Line 1 too long in source list /etc/apt/sources.list.d/medibuntu.list. E:The list of sources could not be read. E:The package lists or status file could not be parsed or opened.   I'm way out of my depth here, please help.  Edit: The result of head -n 1 /etc/apt/sources.list.d/medibuntu.list  <!DOCTYPE html><html lang=en data-adblockkey=MFwwDQYJKoZIhvcNAQEBBQADSwAwSAJBANnylWw2vLY4hUn9w06zQKbhKBfvjFUCsdFlb6TdQhxb9RXWXuI4t31c+o8fYOv/s8q1LGPga3DE1L/tHU4LENMCAwEAAQ==_MaYS1KVPt2+/yDcH97o943cwuSBXaOPOGTouhf+8hyKGWccg8Zq9mVqKE6OV/PIsUTzrudXE+o5hzXbLvX+2HA==><head><meta charset=utf-8><title>medibuntu.org&nbsp;-&nbspThis website is for sale!&nbsp;-&nbspmedibuntu Resources and Information.</title><noscript><meta http-equiv="refresh" content="0; url=http://www.medibuntu.org/sources.list.d/trusty.list/?gtnjs=1"></noscript><meta name=GOOGLEBOT content="index, follow, all"><meta name=robots content="index, follow, all"><meta name=viewport content="width=device-width,initial-scale=1,maximum-scale=1,user-scalable=0"><meta name=description content=This website is for sale! medibuntu.org is your first and best source for all of the information you’re looking for. From general topics to more of what you would expect to find here, medibuntu.org has it all. We hope you find what you are searching for!><link href="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABAAAAAQCAMAAAAoLQ9TAAAAGXRFWHRTb2Z0d2FyZQBBZG9iZSBJbWFnZVJlYWR5ccllPAAAAyJpVFh0WE1MOmNvbS5hZG9iZS54bXAAAAAAADw/eHBhY2tldCBiZWdpbj0i77u/IiBpZD0iVzVNME1wQ2VoaUh6cmVTek5UY3prYzlkIj8+IDx4OnhtcG1ldGEgeG1sbnM6eD0iYWRvYmU6bnM6bWV0YS8iIHg6eG1wdGs9IkFkb2JlIFhNUCBDb3JlIDUuMC1jMDYxIDY0LjE0MDk0OSwgMjAxMC8xMi8wNy0xMDo1NzowMSAgICAgICAgIj4gPHJkZjpSREYgeG1sbnM6cmRmPSJodHRwOi8vd3d3LnczLm9yZy8xOTk5LzAyLzIyLXJkZi1zeW50YXgtbnMjIj4gPHJkZjpEZXNjcmlwdGlvbiByZGY6YWJvdXQ9IiIgeG1sbnM6eG1wPSJodHRwOi8vbnMuYWRvYmUuY29tL3hhcC8xLjAvIiB4bWxuczp4bXBNTT0iaHR0cDovL25zLmFkb2JlLmNvbS94YXAvMS4wL21tLyIgeG1sbnM6c3RSZWY9Imh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC9zVHlwZS9SZXNvdXJjZVJlZiMiIHhtcDpDcmVhdG9yVG9vbD0iQWRvYmUgUGhvdG9zaG9wIENTNS4xIFdpbmRvd3MiIHhtcE1NOkluc3RhbmNlSUQ9InhtcC5paWQ6MzRFNEQ3NkJEMjRGMTFFMTk4RjA4NDhFNTEwRTcyMkIiIHhtcE1NOkRvY3VtZW50SUQ9InhtcC5kaWQ6MzRFNEQ3NkNEMjRGMTFFMTk4RjA4NDhFNTEwRTcyMkIiPiA8eG1wTU06RGVyaXZlZEZyb20gc3RSZWY6aW5zdGFuY2VJRD0ieG1wLmlpZDozNEU0RDc2OUQyNEYxMUUxOThGMDg0OEU1MTBFNzIyQiIgc3RSZWY6ZG9jdW1lbnRJRD0ieG1wLmRpZDozNEU0RDc2QUQyNEYxMUUxOThGMDg0OEU1MTBFNzIyQiIvPiA8L3JkZjpEZXNjcmlwdGlvbj4gPC9yZGY6UkRGPiA8L3g6eG1wbWV0YT4gPD94cGFja2V0IGVuZD0iciI/PukMAkAAAAEsUExURcbf8uXx+vb6/eXx+Q5FtN/t+Ofz+rbX7uTr9+Tq9y5fvlh+y7rY7+n0+lJ6yS1evt7l9Sxdvr/b8L3a8BRLtpev31mAy+v0+k13yLLD59Hm9PT5/c3Z8LXG6Oby+pXG5aG54vX3/Git2LvZ79bg8vr8/vP4/Mjh8+Pw+Ofy+sPd8cfj9G2P0cDc783k9Ex2x6DK5xlOuCBUumWJztDm9DZkwLTF6Ojt92yP0s7a8OPq9m6Y1d3l9cHP7OLp9kNvxNPo9Wes2DNhwJSv3uDt+Ovw+cDP6yNVuurv+Nbf8pjI5aDL56G44rTL6h1RuWaJz9bp9tDo9u31+oWi2TZlwMfg8E16yd7t99Hc8Vl+ysri897l9JCq3FB5yPL1++/2/MLQ7HGb1j9sw////2AvJ1QAAADsSURBVHjaRM9ZMwNREAXgnpvLZKOENsQSJrTlIjHEEhQZS2JJxljHmoT+//9B37w4j19Xna4DzKzGDbHKLN+MdZlB4GNJ8fV9AbH1W7ew7g6zn9ORt/uM8wJkBOs7eHai/P05Bnp0S8ynBQz2qk9v0jEbTyjpKWZRI0Z9hqlV29u9ynQmR6PAY7g0NYH+efvzYDHAQ4bExBY0Bi3E7BHDkGkI+MXN7+ncV1pKU1AhIiYbudgvx957c+t2YW2k1ugJUKmqdXs7DGdiN5+yW+hV4K4cVhI37wzGdX4u0skL9FYcRw2ANh74P38CDABMCjqJfzUcfQAAAABJRU5ErkJggg==" type=image/png rel="shortcut icon"><script src=http://img.sedoparking.com/js/jquery-1.11.3.custom.min.js></script><!--[if lt IE 9]><script src="https://oss.maxcdn.com/html5shiv/3.7.2/html5shiv.min.js"></script>   so I guess that's a problem!!

I followed directions to add medibuntu but it has messed up some codecs and dependencies so I can no longer watch videos  I have run this command, originated by a forum post:  sean@sean-P55-USB3:~$ sudo -E wget --output-document=/etc/apt/sources.list.d/medibuntu.list http://www.medibuntu.org/sources.list.d/$(lsb_release -cs).list && sudo apt-get --quiet update && sudo apt-get --yes --quiet --allow-unauthenticated install medibuntu-keyring && sudo apt-get --quiet update   How do I reverse this?


Compare these two images:   My comments appear to be exactly the same as far as the text body goes. However the first image shows that I have 584 characters left to put in my comment, and yet refuses to post. The second image shows that I have 9 more characters to go before being able to post this comment. The sorcery that comes into play here is the famous ZWSP (Zero-Width Space) character. On the first image I inserted enough of them to trick the character count into thinking that there was actually enough text there, so it started counting down the remaining characters. It however wont let me post this as a comment (for obvious reasons).  This is not a duplicate of . That is a bug report that was  by The Great Jeff Atwood himself; this is a feature request to reconsider that decision. You could say that is the end of it all. But...           . And probably there are a lot more deleted posts as well. Obviously it has people fooled every now and then, as it just fooled me today. I find it very confusing to see a character count, which is later contradicted with an error message. Can we make both character counts, the number of characters remaining/to go and the one for the error message, correspond? As  on the canonical question points out adding .trim() in the code would most likely suffice. This would still leave one error remaining, that of stripped @replies, but that is a whole different regex I'm not demanding to be slain.

In the comment field on StackOverflow (and other StackExchange sites as well, I presume) you're required to write 15 characters for the server to accept your post. If a shorter post is submitted, an information message states that the comment is too short. That is all good.  However, below the comment field is a counter, which counts up to 15 and then down from however many characters you're allowed to type minus fifteen. This counter doesn't always act the same as the actual validation: if I pad my message with whitespace, the validation notices and still says the message is too short, but the counter does not notice, and counts as usual.  Suggested fix: make the character counter trim the message before it counts, so the two messages say the same thing.


I have two dates :  date1 = "2013-07-08 12:30:00"  date2 = "2013-07-08 13:30:00"  Now in javascript i want to match these two dates and its they dont match than i want to delete the appointment and if they match than nothing to do.  I tried this code but its not working :    if(date1 == date2)// Event already exists   {       // do nothing   }   else   {       // delete the record.   }   I tried to compare with "new Date(date1) == new Date(date2)" also but its not working either.  There is some problem in my code or date format. can anyone know how to do this and where i am wrong in this code ?  Thanks in advance.

Can someone suggest a way to compare the values of two dates greater than, less than, and not in the past using JavaScript? The values will be coming from text boxes.


I am trying to check a Dictionary whether or not a certain Object is contained as a key:    Dictionary<Order, int> occurence = new Dictionary<Order, int>();   if (occurence.ContainsKey(order)) {       occurence[order] += 1;   } else {       occurence.Add(order,1);   }   The Order class consists of a simple Dictionary in which I map the properties to their values:  private Dictionary<String, String> properties = new Dictionary<string, string>();   I implemented the HashCode function for the Order class, since the Dictionary lookup depends on it for comparison:    public override int GetHashCode() {        return properties.GetHashCode();   }   Problem is that no matter what the order is not found in the Dictionary. Any idea how to fix this?

Given the following class  public class Foo {     public int FooId { get; set; }     public string FooName { get; set; }      public override bool Equals(object obj)     {         Foo fooItem = obj as Foo;          if (fooItem == null)          {            return false;         }          return fooItem.FooId == this.FooId;     }      public override int GetHashCode()     {         // Which is preferred?          return base.GetHashCode();          //return this.FooId.GetHashCode();     } }   I have overridden the Equals method because Foo represent a row for the Foos table.  Which is the preferred method for overriding the GetHashCode?  Why is it important to override GetHashCode?


I'm doing this password picker just for fun and I thought it would look better if the color of the password could change password = adjective + noun + str(number) + special_char print('your new password is: %s' %password)  does anyone know how i can make the program run but when it runs it would be something like: your new password is (password) but the password is in another color.

How can I output colored text to the terminal in Python?


I am using mkdir function in php and I use sudo chown -R www-data:www-data /var/www/html/ than I am able to mkdir folder. But than I am not able to edit any file in /var/www/html/ . So I tried both below method :   sudo chown -R www-data:username /var/www/html/ and   sudo chown -R username:www-data /var/www/html/  But In that mkdir stops working giving permission denied error.  How to give permission to both www-data and myself both.

I want to stop having to use sudo everytime I work in /var/www. How can I do that? I simply want to put all of my sites into this directory and work with them without too much pain.


How can I add a parallax effect into my side-scrolling game? I read a lot about parallax scrolling so I know what the logic is and what parallax is but I can't create a dynamic parallax effect.  I have draw and update functions like this:  void UpdateBackground(Background &back) {     back.x += back.velX * back.dirX;     if(back.x + back.width <= 0)         back.x = 0; } void DrawBackground(Background &back) {     draw_bitmap(back.image, back.x, back.y, 0);      if(back.x + back.width < WIDTH)         draw_bitmap(back.image, back.x + back.width, back.y, 0); }   So this draws a parallax effect with two background objects but it draws it statically. I'm creating a 2D side-scrolling game and I'm translating my character and my camera position along x axis. So I have to translate my parallax effect with my camera but when I add to background position.x it doesn't work. How can I solve this?

Suppose I have three layers: a foreground, an intermediate-ground and a background.  What is involved in using these three layers to create ?


There's  a limit which confuses me:  $$ \lim_{x \to +\infty} \dfrac{(\int^x_0e^{x^2}dx)^2}{\int_0^xe^{2x^2}dx}$$  Is it possible to use L'Hôpital's rule here?

I've tried to apply L'hopitals rule on this one, as this get's $\frac{\infty}{\infty}$  $$\lim_{x \rightarrow +\infty} \frac{[\int^x_0 e^{y^2}\mathrm{d}y]^2}{\int^x_0 e^{2y^2}\mathrm{d}y}$$  $\frac{\mathrm{d} }{\mathrm{d} x}[\int^x_0 e^{y^2}\mathrm{d}y]^2 = 2[\int^x_0 e^{y^2}\mathrm{d}y] * [\frac{\mathrm{d} }{\mathrm{d} x}\int^x_0 e^{y^2}\mathrm{d}y]=2(e^{x^2}-1)(e^{x^2})$ and $\frac{\mathrm{d} }{\mathrm{d} x}[\int^x_0 e^{2y^2}\mathrm{d}y]=e^{2x^2}$ so $\lim_{x \rightarrow +\infty} \frac{[\int^x_0 e^{y^2}\mathrm{d}y]^2}{\int^x_0 e^{2y^2}\mathrm{d}y} = \lim_{x \rightarrow +\infty} \frac{2(e^{x^2}-1)(e^{x^2})}{e^{2x^2}} = 2\lim_{x \rightarrow +\infty} \frac{(e^{x^2}-1)}{e^{x^2}}=2\lim_{x \rightarrow +\infty} (1-\frac{1}{e^{x^2}})=2$  But the answer is $0$, so I think I've done a mistake somewhere I can't figure out where.


I installed some applications, using Wine. They appeared in the start menu I wanted to remove the application, so I removed the folder    it didn't work so I tried by removing the wine folder but it stayed there, every time i launched it. I then went to usr/share/applications but that didn't work either, as it wasn't there.  Is there another way to remove Wine-installed applications?

How do I remove an application shortcut from the Unity Dash (not from the Unity Launcher)?  My specific issue is I tried to install a game using Wine a while ago. I then uninstalled the game, then uninstalled Wine. Today I found that shortcuts to the game (and other related content that came with it) remain when I push Super and type the game name. (Wine is not visible though.)


I recently installed the 3.2.2 version of QGIS but the interface seems to be weird     How can  make the map canevas occupy the rest of the window?

In this screenshot of QGIS, you can see that the map is not filling the window. I have tried resizing the window in various ways.   Am I missing something obvious, or is this a bug?  Versions:   MacBook Pro MacOS High Sierra 10.13.5 QGIS version 3.2.1-Bonn QGIS code branch Release 3.2 Compiled against Qt 5.9.6 Running against Qt 5.9.6 Compiled against GDAL/OGR 2.2.4 Running against GDAL/OGR 2.2.4 Compiled against GEOS 3.6.2-CAPI-1.10.2 Running against GEOS 3.6.2-CAPI-1.10.2 4d2925d6 PostgreSQL Client Version 9.6.6 SpatiaLite Version 4.4.0-RC0 QWT Version 6.1.3 QScintilla2 Version 2.10.7 PROJ.4 Version 493 Python 3.6.6


I'm planning to buy a new SSD for my laptop and playing ahead. Is there a way to move my current installation of Ubuntu (on regular HD) to the SSD without reinstalling from scratch?

My current situation is:   One hard disk Dual boot Ubuntu 11.04 and Windows 7. Partitions:  100MB Windows System thingy 144GB Main Windows 160GB Ubuntu 4GB Swap 12GB System Restore stuff    Now I want to install an 80GB SSD and move Ubuntu to it. AFAIK I need to:   Shrink the 160GB Ubuntu partition to 80GB Copy it over to the SSD Change fstab to mount the SSD as /   How do I do the second? And what do I need to do about Grub?


We have a Ranger and a Battlemaster in the party, and the Ranger thinks that he can benefit from the Colossus Slayer bonus to damage both during his Action and again later in that same round if the Battlemaster gives him an extra attack using Commander's Strike (which uses the Ranger's Reaction)...because Colossus Slayer only states "You can deal this extra damage only once per turn" and doesn't specify it has to be only on the Ranger's turn.   Since the Reaction is happening on the Battlemaster's turn, he reasons that Colossus Slayer is still only "once per turn" (it just happens to be on two different people's turns).

PHB says 'once per turn,' so, it would seem that a Rogue with Sentinel, for example, could "consistently" deal Sneak attack twice per round (whether the enemy triggers an OA or the melee weapon attack provided by the Feat).  So, can rogues deal sneak attack damage with any weapon attack outside their turn? (obv. one that meets the standard requirements--finesse, adv or adj ally)


#include <iostream> using namespace std; int main() {     string a = "";     a += '0' + 1; // got compiled     a = a + ('0' + 1); // compile error     return 0; }   why the second one got a compile error but the first one not?  prog.cc: In function 'int main()': prog.cc:6:11: error: no match for 'operator+' (operand types are 'std::string' {aka 'std::__cxx11::basic_string<char>'} and 'int')     6 |     a = a + ('0' + 1); // compile error       |         ~ ^ ~~~~~~~~~       |         |        |       |         |        int       |         std::string {aka std::__cxx11::basic_string<char>}   I think first '0' + 1 will get integer promotion and turn to type int, then compiler will try to find overloading operator function, trying to implicitly convert int to char.  please help explain in detail what conversion happened, which overload function called, what the compiler does.  thx very much!

I thought this would be really simple, but it's presenting some difficulties. If I have std::string name = "John"; int age = 21;  How do I combine them to get a single string "John21"?


How do I make python copy a jpeg to the desktop?  import shutil src = ('1.3.jpg') dst = ('tEST/nicholas') count = 1 while count < 10000000000:     shutil.copyfile(src, dst + str(count) + ".jpg")     count += 1   This is what I have so far but I want to change the dst folder into the desktop I'm using windows 7

How do I copy a file in Python?  I couldn't find anything under .


\documentclass[10pt, a4paper]{article}  \usepackage{graphicx} ... \begin{figure} \includegraphics{logicarch.pdf} \caption{system architecture} \label{fig:logiarch} \end{figure} ...   I wish the figure and its caption, could be horizontal placed in a single page, unlike the rest which is vertical. Besides, I also noticed the pdf exported from visio have a large blank at its bottom, is there a way to 'cut' it a little or 'autofit' according to the content?

How can I change some pages into document into landscape mode, while leaving the others in portrait mode (or vice versa)?


After updating from version of Ubuntu 18.04 to 19.04, facing different issues as follows please give solution for given.  1) Python 3.6 is not working and default version is become python 3.7  This question is not to asking how to install py 3.6 after installing 3.7

I've tried the normal way, sudo apt-get install python3.6, but... well... that didn't work.   So, how would I go about it? (I'd preferably not build it on my own)  I'm using Ubuntu 16.04.


Simple question: how do you unzip or extract .zip archives/files in Ubuntu 12.04 Unity?

Just downloaded a .zip file from the internet. I want to use the terminal to unzip the file. What is the correct way to do this?


this probably has a super-easy solution, but I cannot get it right.  I have a list of 400 integers. Now. I want to divide this list so that the first 20 go in one list, the second 20 in another, etc. In the end I want to have a 20x20 nested list.  Any ideas? Thanks!

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


I need to know when the "Caps Lock " key is turned on.   Does Ubuntu has a visual indicator to show me when the key "Caps Lock" is on?

I own a notebook running Ubuntu 16.04 with Unity DE that does not have any keyboard LEDs to indicate NUM-Lock or CAPS-Lock states.  It would be useful for me to see them anyway, ideally through an indicator in Unity's panel.   Please note that I only want to see the states of NUM-Lock, CAPS-Lock and optionally Scroll-Lock. I do not want to see whether any other modifier keys like Shift, Ctrl, Alt, Super etc. are currently pressed. I only want a replacement for my missing LEDs.  Are there any working indicators available?    I already have read , but it does not suit my needs. indicator-xkbmod only displays a wrong icon but does not react on keyboard NUM-/CAPS-Lock status changes, kbstate is for KDE only and key-mon does not show the NUM-/CAPS-Lock states but indicates key presses to modifier keys.


I want to start doing some functional testing.  I tried some time ago in Java and Selenium, but seemed to run into a number of problems with configuration. Previously I have made simple tests with Robot Framework and Python.  Now I am considering both Python or Ruby. Do you recommend some tools and language with detailed tutorials.  Are there low cost books or tutorials available?  I'd like to start with a framework that required a minimum of configuration to get started  Would Python and the Robot Framework is good? Would sikuli be suitable?

I'm looking for a programming language to recommend to a friend considering teaching herself software testing.  I have a friend who is interested in learning software testing, and I believe strongly that today's testers absolutely have to have automation skills if they don't want to hit a glass ceiling after a few years (or become super-star exploratory testers . . . but not everyone wants the stress of having to be a super-star).  I can't look to my own experiences, because I did a 4-year CSE degree that was geared toward developers, and my education isn't light-weight enough.  I want something relatively easy to learn that will give the tester the greatest bang for their buck in developing good, maintainable automation.  I know Ruby is used for a couple of test tools - Watir and Cucumber - and something that works with Selenium, WatiN, or Watir would be good.  The two favorite languages locally for developers seem to be Java and C#, and she will be working locally.  Whatever she learns needs to have good resources for novices at programming to self-teach, whether those be books, online tutorials, or online communities.  Something that isn't too expensive to learn would probably be preferred ('free IDEs are available and there are good free tutorials and information to learn from' is ideal).  Also, something that is harder to write bad code in would be good, since I want her to be able to avoid brittle, unmaintainable tests.  She is highly motivated to learn, so a very useful language that will take 6 months of hard work to get a usable level of skill is preferable to a slightly useful language that she could use in a single month.  At the same time, any time she spends learning to program is time she could be spending practicing exploratory testing or learning other great test skills - so ease of learning does matter.     Also - I do realize that programming is one very small piece of being a good tester.  I just have a better handle on self-teaching the rest of the testing skills, since I self-taught myself those areas and can pass on what worked for me or what I wish I'd known.  I don't want anyone to think I believe you can learn to be a good tester by just learning to program; rather, I just don't have a good handle on the easiest way to start programming as a tester since I started testing as a programmer.


If I understand the basics of the big bang correctly it starts with a very small dense point. At the moment of the big bang, less then microseconds after, the universe is already the size of our solar system. That would mean the particles traveled faster than light. How can these particles travel faster than light? My understanding is nothing should be able to faster.  I am just hoping on finding a glitch in the system so we will have warp speed soon to visit all those distant planets.

Conceivably it expands with the speed of light. I do not know, but curious, if there is an answer. At what velocity, does our universe expand?