Port of entry far from the university
Arriving at a different port of entry in the same state in USA?
Bounding box is larger than expected when drawing a curved path I have been working on logo for my department and I have the following code. The problem is that whenever I compile the diagram seems to be larger than the actual logo. I do not know what is the problem. I know the numbers I have selected are not the best but any insights into the matter will be highly appreciated.   \documentclass[letterpaper]{article}  \usepackage[top=2cm,bottom=2cm,left=2cm,right=2cm]{geometry}  %\usepackage{amsmath,amssymb,units}  %\usepackage{enumitem,multicol}  \usepackage{tikz}  %\usetikzlibrary{arrows}  \usepackage{lipsum}   \begin{document}   \lipsum[1-2]  \begin{tikzpicture}[y=0.80pt, x=0.8pt,yscale=-1]  \path[draw=black,fill=white]    (258.9527,290.5199) .. controls (173.9885,538.4766) and (568.5860,261.2969) ..    (306.5098,257.1141) .. controls (44.4337,252.9312) and (429.9845,542.5624) ..    (352.9767,292.0206) .. controls (275.9689,41.4788) and (119.6549,497.6604) ..    (334.1376,346.9999) .. controls (548.6203,196.3394) and (66.4622,188.6439) ..    (276.0276,346.0724) .. controls (485.5930,503.5010) and (343.9169,42.5633) ..    (258.9527,290.5199) -- cycle;  \end{tikzpicture}  \lipsum[1-2]  \end{document}    See image below: Revision history suggests that I edited the post body, whereas I didn't I was doing some re-tagging and I noticed that the automatically generated revision comment says that I edited the post body where I only edited the tags. In my lecture, the lecturer said:      Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.    My question is: When I want to implement the cryptosystem, how should I represent this $1^k$?  When I implement the key generation procedure, do I literally require callers to pass me a string of $k$ one-bits that the procedure will never use?  And, if so, why is it there in the first place? How do I enable Scroll Lock? Let $D$ be the region bounded by $x+y = 1$, $x= 0$, $y = 0$. Use the result of  to show that $$\iint_D\cos\bigg(\frac{x-y}{x+y}\bigg)~dx~dy = \frac{\sin 1}{2} $$   and graph $D$ on an $xy$ plane and a $uv$ plane, with $u = x-y$ and $v = x+y$.   I got the Jacobian determinant is $\dfrac{1}{2}$, but how do I get the limits of integration for $u$ and $v$? The Bash Manual says   { list; }        Placing a list of commands between curly braces causes the list to be executed in the current shell context. No subshell is   created. The semicolon (or newline) following list is required.      The braces are reserved words, so they must be separated from the list   by blanks or other shell metacharacters.       The parentheses are operators, and are recognized as separate tokens   by the shell even if they are not separated from the list by   whitespace.   If I remove the semicolon, like this:  $ { date } &gt;    Why does it expect stdin input? A metacharacter is a character that separates words.  The semicolon and whitespace are both "shell metacharacters". Why can't whitespace separate words date and }? Why do we need a semicolon instead of a whitespace for separating the words? I want to use $var in a shell brace expansion with a range, in bash. Simply putting {$var1..$var2} doesn't work, so I went "lateral"...   The following works, but it's a bit kludgey.    # remove the split files echo rm foo.{$ext0..$extN} rm-segments &gt; rm-segments source rm-segments   Is there a more "normal" way? How to find the smallest $n$ such that $n^a\equiv 1 \pmod p$ Given a prime $p$ and number $a$, how do I find the smallest $n$ such that $n^a\equiv 1 \pmod p$? Is there a non trial-and-error method?  Edit: obviously removing $n=1$! Lazy Eye in Infants, Preparations for Seeing a Specialist My youngest (14 months) has started showing signs of either strabismus or ambylopia (both commonly referred to as "lazy eye", where one eye seems to track differently than the other when the child is tired or isn't focusing).  We're going to see an ophthalmologist once the pediatrician weighs in and recommends one, and I'm interested in suggestions for what I should look for in an ophthalmologist, and in what we should do to prepare for the visit.  Particularly, how important is it that we find one that specifically mentions these conditions as things they specialize in?  They're fairly common conditions (affecting over 4% of children), so I would expect most pediatric ophthalmologists to have as one of their main purposes helping to diagnose and treat lazy eyes; but many do not mention them in their list of specializations.    And, in terms of preparation, do we need to keep track of time or length of lazy eye bouts?  Should we take any videos?  Our pediatrician hasn't noticed this in her periodic checks, but I suspect that he's more focused during these visits (a person he's not that used to, who is talking a lot to him).  I worry the ophthalmologist will have the same problem - not be able to diagnose because of lack of presentation during the visit. Adding 3 electron spins I've learned how to add two 1/2-spins, which you can do with C-G-coefficients. There are 4 states (one singlet, three triplet states). States are symmetric or antisymmetric and the quantum numbers needed are total spin and total z-component.  But how do you add three 1/2-spins? It should yield 8 different eigenstates. Which quantum numbers do you need to characterise the 8 states?  It is not as easy as using C-G-coefficients and the usual quantum numbers as for the total momentum the doubly degenerate 1/2 state and quadruple degenerate 3/2 state can describe only 6 or the 8 states. You will need an additional quantum number for the degeneracy.  So how do you get the result?  (I actually tried out myself with a large 8x8 matrix. The total spin 1/2 is each doubly degenerate. For the additional quantum number I chose the cyclic permutation. Spin 1/2 states are neither symmetric nor antisymmetric. But what is the usual way to derive this?)  EDIT: For reference I'm adding my results for up to 4 spins from some time ago:   If you recall the basics of quantum mechanics with matrices it is actually a straightforward matrix diagonalization and requires no specialized knowledge. However, you still need to find an additional operator which breaks degeneracy. I chose the cyclic permutation, which seems to do the job. Please refer to the below answer, since I haven't checked all details. If $E[X|Y]=Y$ almost surely and $E[Y|X]=X$ almost surely then $X=Y$ almost surely Can I preemptively pay my credit card bill before a charge is posted? I was recently granted German refugee status with a travel document and, in my interview, I told them I would never go back to my home country, Iraq. Now, someone I loved died in my country.  Is it possible for me to leave and return to the Schengen area, using my Iraqi passport? Would German Immigration notice and would it revoke my refugee status?  Would I be able to use both my Iraqi passport and my German travel documents? Would the German authorities know if I did this? HTTP GET request in JavaScript? I need to do an  request in JavaScript. What's the best way to do that?  I need to do this in a Mac OS X dashcode widget. Intuitively it's easy, but hard to prove by the epsilon-delta method:  $$ \lim_{n \to \infty} n x^{n} = 0$$ How to tell if a certain item is in a player inventory? I am trying to create a challenge world where a certain item (e.g. a Netherite Sword) must be collected. How can I check automatically if a player has it (using commands), and then congratulate the winner? This question is specific to Bedrock Edition 1.16. I have tried other solutions so many times and they don't seem to work. See also: Why was Sirius ever convicted? Sirius himself says at some point in Goblet of Fire that Crouch pushed through legislation to have him convicted and thrown in Azkaban without a trial.  There seems to be a general consensus, specifically voiced by Fudge but also implicit in Crouch pushing through this legislation, that Sirius was considered one of Voldemort’s innermost, most dangerous, and most trusted right hands. Easily as inner-circle as the Lestranges, for example.  It seems quite unlikely to me that someone so close to Voldemort should not be a Death Eater—apart from Fenrir Greyback (who I would think is much less inner-circle), I do not recall hearing of any of Voldemort’s important servants not being Death Eaters.  As far as canon describes, all Death Eaters have the Dark Mark magic-tattooed on their arm, to be used as a way for Voldemort to summon them to him. Considering that Karkaroff, who had definitely burnt all his Death Eater bridges, still had the Dark Mark, I am assuming that getting rid of the Mark is not possible: once it’s on, it stays on.  Yet, as Hermione points out in Order of the Phoenix (ch. 16, “In the Hog’s Head”), Sirius does not have the Dark Mark.  So why was he so swiftly convicted and locked up? I mean, I know they were eager to be seen to be doing something (as Fudge keeps pointing out is his excuse for most of the miscarriages of justice he commits)… but seriously, did no one think to check if Sirius actually had a Dark Mark on his arm or not? Did the Ministry of Magic not even know at the time that all Death Eaters had the Mark? Or were they just happy to accept—without the scrutiny of a full trial—that a non-Death Eater would commit mass murder for a Voldemort who was presumed defeated? Why are the two versions of Chromium and VLC available in Ubuntu software of different sizes? What is the difference between a[bc]d and a{b,c}d? Why do people use a{b,c}d when there is already a[bc]d? How Do I Compute the Eigenvalues of a Small Matrix?