True Type Font editing I have a .ttf file in which I need to add some missing characters. Maybe some of you have faced and overcame this earlier? I would relay appreciate your time spared ;)
Edit a truetype font I'm trying to find a free tool (on windows ) that would enable me to change some settings on a TrueType font. Specifically, I'm trying to fix the following errors:  E1311 The macStyle bold bit doesn't match the name table's font subfamily string macStyle bold bit is set, but subfamily is Regular  W2000 The subfamily string is inconsistent with the style of the font OS/2.fsSelection bold bit is set, but subfamily string = 'Regular'  I can do that with fontographer, but would prefer to use something free.  Fontforge doesn't seem to work with this font, when saved it corrupts the cyrillic letters in the font.
I want to reinstall Ubuntu, but I also want all information and settings to disappear. So everything looks like the first time I installed it. Is it possible to do so via Terminal? Or what are the steps I should follow? Prove that   $$\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$$   I can't find counting interpretations for either of the sides. A hint of "if $S$ is a subset of $\{1, . . . , n\}$ and $S^\prime$ is its complement then $|S| + |S^\prime| = n$" was also given, but I still don't know how to begin. What are the effects of exceptions on performance in Java? Question:  Is exception handling in Java actually slow?  Conventional wisdom, as well as a lot of Google results, says that exceptional logic shouldn't be used for normal program flow in Java.  Two reasons are usually given,   it is really slow - even an order of magnitude slower than regular code (the reasons given vary),     and    it is messy because people expect only errors to be handled in exceptional code.     This question is about #1.  As an example,  describes Java exception handling as "very slow" and relates the slowness to the creation of the exception message string - "this string is then used in creating the exception object that is thrown. This is not fast."  The article  says that "the reason for this is due to the object creation aspect of exception handling, which thereby makes throwing exceptions inherently slow".  Another reason out there is that the stack trace generation is what slows it down.  My testing (using Java 1.6.0_07, Java HotSpot 10.0, on 32 bit Linux), indicates that exception handling is no slower than regular code.  I tried running a method in a loop that executes some code.  At the end of the method, I use a boolean to indicate whether to return or throw.  This way the actual processing is the same. I tried running the methods in different orders and averaging my test times, thinking it may have been the JVM warming up.  In all my tests, the throw was at least as fast as the return, if not faster (up to 3.1% faster).  I am completely open to the possibility that my tests were wrong, but I haven't seen anything out there in the way of the code sample, test comparisons, or results in the last year or two that show exception handling in Java to actually be slow.  What leads me down this path was an API I needed to use that threw exceptions as part of normal control logic.  I wanted to correct them in their usage, but now I may not be able to.  Will I instead have to praise them on their forward thinking?  In the paper , the authors suggest that the presence of exception handlers alone, even if no exceptions are thrown, is enough to prevent the JIT compiler from optimizing the code properly, thus slowing it down.  I haven't tested this theory yet. Are orbiting planets an  example of perpetual motion? Normality of dependent variable = normality of residuals? This issue seems to rear its ugly head all the time, and I'm trying to decapitate it for my own understanding of statistics (and sanity!).   The assumptions of general linear models (t-test, ANOVA, regression etc.) include the "assumption of normality", but I have found this is rarely described clearly.   I often come across statistics textbooks / manuals / etc. simply stating that the "assumption of normality" applies to each group (i.e., categorical X variables), and we should we examining departures from normality for each group.   Questions:     does the assumption refer to the values of Y or the residuals of Y?  for a particular group, is it possible to have a strongly non-normal distribution of Y values (e.g., skewed) BUT an approximately (or at least more normal) distribution of residuals of Y?   Other sources describe that the assumption pertains to the residuals of the model (in cases where there are groups, e.g. t-tests / ANOVA), and we should be examining departures of normality of these residuals (i.e., only one Q-Q plot/test to run).  does normality of residuals for the model imply normality of residuals for the groups? In other words, should we just examine the model residuals (contrary to instructions in many texts)?  To put this in a context, consider this hypothetical example:   I want to compare tree height (Y) between two populations (X).   In one population the distribution of Y is strongly right-skewed (i.e., most trees short, very few tall), while the other is virtually normal  Height is higher overall in the normally distributed population (suggesting there may be a 'real' difference). Transformation of the data does not substantially improve the distribution of the first    population.  Firstly, is it valid to compare the groups given the radically different height distributions? How do I approach the "assumption of normality" here? Recall height in one population is not normally distributed. Do I examine residuals for both populations separately OR residuals for the model (t-test)?     Please refer to questions by number in replies, experience has shown me people get lost or sidetracked easily (especially me!). Keep in mind I am not a statistician; though I have a reasonably conceptual (i.e., not technical!) understanding of statistics.  P.S., I have searched the archives and read the following threads which have not cemented my understanding: I am studying English in Korea.   All my friends and I are studying about 'sentence patterns'  Sentence patterns, said in here, are S+V, S+V+C, S+V+O, S+V+I.O+D.O, S+V+O+O.C.  But my teacher said these 5-sentence patterns are not perfect in grammar. But  because we don't use English by mother language, they will be helpful for understanding English.  Then, I came up with something.   Is sentence patterns used everywhere? (like U.S.A, U.K, Australia, anyother country where people use english by their mother language?)  I really wonder. I have been playing around with Ubuntu installing new themes and and docks. Sometimes during the installation, whole screen just hangs. What is the best way in Ubuntu to Kill a process/application? Anything similar to Ctrl + Alt + Del of windows? Making yogurt at home is a fairly straight-forward process.  Heat milk to 180F (82C), cool that milk to at least 110F (43C), add live cultures, usually in the form of yogurt with said cultures, incubate, then chill.   There are several variables in the process, some of which are: The fat content of the milk (I typically use whole), how long to hold the milk during the initial heat step, how long it takes to cool the milk, the temperature of the incubation step, and the length of time for incubation, to name a few.  While length of time for incubation, and temperature at this stage, clearly contribute to sourness, I am trying to nail down the variable that contributes to a creamy texture.  I'm not referring to breaking or clumping, as described in .  My yogurt comes out smooth.    My initial hypothesis is that holding the milk for a length of time at the initial 180F(82C) (rather than immediately removing from heat and/or chilling) has an impact on final texture. Any thoughts or experience that might inform my hypothesis? What is the coefficient of the term $a^i b^j c^k$ in the expansion of $(a+b+c)^n$? What is the coefficient of the term $a^i b^j c^k$  in the expansion of   $(a+b+c)^n$ ?   Given solution:     Before collecting like terms, each term in the expansion is a product   of $n$ factors each  of which is $a, b,$ or $c$.  Those terms which   have exactly i a’s, j b’s and k c’s can be combined into   the single term $a^i b^j c^k$ and the number of such terms will be   equal to the number of n letter strings containing i a’s, j b’s and k   c’s, which by the Mississippi rule is $\frac{n!}{(i!\times j! \times  k!)}$.   I understand that this problem is actually about the derivation of the coefficient of the multinomial theorem,but I am not sure about the combinatoric reasoning,what I mean is that I understand the analogy problem but what I couldn't is how the analogy holds here,Could anybody explain this to me? What is the best way to save values (like strings) for later use? I'm fairly new to LaTeX and I'm struggling with something apparently simple, but for which I can't find a fair solution. The problem (simplified) is as follows (please take care terms used may not have the traditional meaning in LaTeX):  I need to references to files (many) throughout a text. As example, the files:  "C:/Work/this_file1.c", "C:/MoreWork/this_file1.c" and "D:/MoreWork/another_file2.h".  So, now I would like to create an "alias" to each directory and each name file so I can reference them. A "pseudocode" could be:  % Definition \alias \c_dir = C:/Work/ \alias \d_dir = D:/MoreWork/ \alias \file1 = this_file1.c \alias \file2 = another_file2.h  % Reference in text \c_dir\file1    % For referencing C:/Work/this_file1.c \d_dir\file1    % For referencing D:/MoreWork/this_file1.c \c_dir\file2    % For referencing C:/Work/another_file2.h   My first approach was using \newcommand, but that caused numerous problems due to naming limitations. (I also tried other methods like pgfkeys, but it always gets stuck somewhere!)  Can you suggest a method? Split Excel table over multiple PowerPoint slides I have a table in Excel which is too long for one PowerPoint slide. So I would like to split it over 2 or 3 slides, but have the header on each of the slides. What is the easiest way to accomplish that? I am using Excel and PowerPoint 2007. Does it just vanish into space leaving nothing behind or does it expel some material?    Also, talking more about black holes, as far as I understand the term "temperature", it is defined by the amount of kinetic energy of the particles of a body and from what I have read, there are no particles inside a black hole, I know that you can find the temperature of a black hole by analyzing its Hawking radiation but I cant really understand how the term "temperature" can be applied to a black hole. Does it mean that whatever is that it is inside a black hole has kinetic energy? Have physicist already experienced the death of any regular black hole (by regular I mean space-sized black holes not micro ones created in labs)? Also, where is the Hawking radiation form? Because if it is released by the black hole I bet it must have formed outside the event horizon, but how exactly? How soon until I can take my newborn to take a walk outside? I understand that newborn's immune system is still weak and crowds/strangers are to be avoided. Knowing this, how soon can I take my newborn outside, for example to take ~1 hours walk in a non-crowded park? Any particular things to pay attention to when doing this? What are some alternatives to "hover" on touch-based devices? Came up recently in a 37signals podcast:    The straightforward, "brute-force" solution is to just use the first touch on a UI object as the hover.    It works. But are there other, more elegant solutions? For instance, could the hardware ever be made to support actual finger hovering? After installing Ubuntu Studio 12.04, I have found that it uses a low latency kernel.   I searched for an explanation and how to change back it to a real-time or generic one. However, it looks like this part of Linux hasn't been covered to explain the details.   Q: Why choose a low latency kernel over a generic or real-time one?  PS: I have already read the answers from  question and  post. C# Lambda expressions: Why should I use them? I have quickly read over the  documentation.  This kind of example has helped me to understand better, though:   delegate int del(int i); del myDelegate = x =&gt; x * x; int j = myDelegate(5); //j = 25   Still, I don't understand why it's such an innovation. It's just a method that dies when the "method variable" ends, right? Why should I use this instead of a real method? This is what is supposedly his claim:     My noumenal self is an uncaused cause outside of time, which therefore   is not subject to the deterministic laws of nature in accordance with   which our understanding constructs experience.   How can he say that if a noumenal self has to exist in nature and be bound to body that exists in nature? Also, if his noumenal self is free then so does 7 billion other people's, which is not the case because they all live in a societal structure where everyone has freedom that comes with a bunch conditions as to what is forbidden. I have looked it up and the resources all talk about schengen visa, travelling with eu national family member etc. so I would like to get a more assuring answer about my situation:   I am a non-EU national with an Italian residence permit. My father is an Italian citizen. I will be travelling to Sofia and Bucharest next month with my girlfriend who is a British citizen. Do I need to get a visa to enter these two cities? How can author deal with late reviews? Another problem I personally struggle with in peer-review publication process is the situation when review takes really, really, really long. The precise definition of "long" is probably very area-specific: for example a paper in Maths will probably took longer to review than one in Physics. Many well-established journals and major publishers, sadly, prefer not to specify the "rules of the game" precisely, particularly how long the review process should normally take. Fortunately, I quite often serve as a referee with the very same journals and know the amount of time I am given to write a review. Unfortunately, when I am an author, I do not observe these deadlines to be always met. For example, a notable U.S. publisher would ask a reviewer to send a review in 2 months; but in practice a first review of my paper once took as long as 8 months.  As a rule of thumb, I usually start writing to editors with questions about "the status of my paper" in X+1 months time, when X is a deadline time for a reviewer to submit a review. This strategy is not particularly successful &mdash; what I usually get is a recommendation to be more patient. Since there is no "official" deadline time announced, there is no formal ground for complaints here.  Of course, such delays lead to a whole bunch of funny situations, particularly if a preprint is put online (e.g., on arXiv) and the results are presented in some conferences. Follow-ups with no official paper to cite, grant applications in which you can not justify by a solid publication, good research but bad bibliometrics or CV, to name just a few.   Could you recommend an efficient way to deal with this problem? How do I run two isolated instances of firefox? For testing purposes, I want to install two different instances of firefox on ubuntu - so that they don't share cookies. (I want to simultaneously login with both instances as different users to our website).  How do I do that? I do it with Firefox &amp; Opera, but I prefer Firefox (because of firebug).