My Schengen visa starts on December 23, 2017 and is valid until January 17, 2018. The duration of stay (as per the visa) is 11 days.  Due to some communication problems, my travel agency booked the flight from December 24, 2017 and the return flight on Jan 5, 2018. That makes the duration of stay to be 13 days.  What can be done? Can anyone help? What are penalties that I may have to face?
I have a Schengen visa valid from 19/07/2016 to 10/08/2016. But the duration of stay is 7 days only.  I want to stay for 6 days more, for a total of 14 days. And my flight includes travel from a Schengen state to another.
Identify a story about a teen boy who learns to use magic with his lizard companion Some time ago I closed my front door (rather forcefully) while the deadbolt was sticking out partially.  This loosened the deadbolt, and the top screw no longer held. In addition, it cracked the door on the interior side. I've attached a picture showing the damage.   The door works mainly, though it can be difficult to lock sometimes, especially when the weather gets colder.  I'm currently renting, and will soon be moving out of this house, once I buy a house. I would like to repair this door myself, and I'm hoping I don't have to replace the entire door.  Is this something that can be repaired? If so, how? I realize that a new deadbolt is probably needed, but how can I repair the wood damage around it? I am trying to disable the touchscreen on my Asus S200E laptop.  In Ubuntu 16.04, I was able to do so with this:  Section "InputClass"     Identifier "evdev touchscreen catchall"     MatchIsTouchscreen "on"     MatchDevicePath "/dev/input/event*"     Driver "libinput" EndSection   How can this be done on Ubuntu 18.04? It seems pretty straightforward to dual boot those versions of Windows when the newest is installed after Windows XP. But the inverse isn't happening on my machine. I tried even editing the BOOT.INI file, but the boot just freezes or displays that a file is missing when I try to boot another partition.  Currently I'm stuck with Windows XP, and I need to boot my Windows 7 instead.  What is the solution? The "Info" bar on top disappeared and the mouse pointer is misaligned I have a problem with Blenders UI. The "Info" bar on top disappeared and the mouse pointer is misaligned. I reinstalled Blender 2 times, deleted every leftover files  but it still does the same thing. This is in v2.78c. The weird thing is that on the bottom everything works fine. Here are some images: Can some metadata about deleted posts be included in Data.SE? Solve $x^2+2=y^3$ using infinite descent? Lately, I've seen many search results in the form of https://stackoverflow.com/q/&lt;id&gt; and /a/&lt;id&gt; on Google. Why do I see these slug-less permalinks instead of the full URL?  For instance, a search for  gives  instead of :        For the record, it seems that Google has indexed  and . Error when using endfloat with unicode characters I have a problem with the endfloat package and unicode characters.  When I compile the following, everything works as expected:  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{graphicx}  \begin{document}  \begin{figure} \caption{Ö} \end{figure}  \end{document}   However, when I also load the endfloat package (\usepackage{endfloat}), I get the following error message:  ! Package inputenc Error: Unicode char \u8:ÖÖ not set up for use with LaTeX.   This could be a bug, but my suspicion is that I'm making a mistake somewhere.  I'm hardly the first person to use special characters with the endfloat package.  However, the above example is so simple, I don't see where I could have made a mistake.  Any advice is appreciated.  Edit: The file is of course encoded using utf-8. Spinor dotted and undotted indices Using Pigeonhole Principle to prove two numbers in a subset of $[2n]$ divide each other Let $n$ be greater or equal to $1$, and let $S$ be an $(n+1)$-subset of $[2n]$. Prove that there exist two numbers in $S$ such that one divides the other.   Any help is appreciated! What are some practices for getting a name change so that people can find me more easily? For a similar thing, , where Jay Wacker managed to get people to call him by the name Jay even though he didn't need to get a legal name change. I'm not sure how to go about this though.  The main problem with me is that I have such a frustratingly common name that a lot of people cannot find me when they google me. So many of them simply don't notice the middle initial that I always use in between my first and last names, and this could actually become a major issue in academia, since people have little time and are prone to giving up quickly if they want to look for me (or for my papers) and can't find me at all (I know this having seen how several academics use the Internet and how they look for people's names). This, in turn, could easily ruin my citation count in the future (it's not just that - it's helpful to others when I have a less common name so that they can more easily locate my stuff). I already know at least several people who specifically told me that they tried to find my email but that they couldn't find it (and this isn't limited to just them - there are many, many more - including long-lost friends who have wanted to talk to me for a long time, but who couldn't find me due to said ultra-common name). Of course, people can go through the respective university directories, but how many people really do that? From my observations (when I've seen people look for someone else), very very few do it. Hell, there are even several people at my OWN university who share the same exact first+last name as me.  In Academia, this is even a bigger problem because the vast majority of your connections will be people who only vaguely recognize/know you, so they may know most of the search clues. Even a "full name" + university won't solve all the problems, because I may switch universities and people may only remember the old university that I was in. I'm also very very interdisciplinary, so I want to be searchable to people outside my field as well.  And even if I fix the issue for Google with a massive SEO operation or whatever (that may even be impossible for my ridiculously common name), it's still not going to fix the problem for all of the other ways that people use search.  I'm currently transitioning between undergrad and grad school, so now may be the perfect time for a name change? But I don't know what to do. Is it better for me to change my first name or my last name? The problem is that a citation like "Chen 2011" is going to produce so many entries that no one will ever find them, even though they frequently do google things like that (and I simply cannot prevent people from googling something like that). Chen is so frustratingly common that even a "Chen and Name2 2011" paper could come from some random medical paper rather than from something I wrote.  As an additional complication, the % of Chinese people using the English Internet is exponentially rising, and I can only expect the problem to get worse in the future because of that (and not just for my first name, but even variants of my first name too). This is solely a reference request. I have heard a few versions of the following theorem:     If the joint moment generating function $\mathbb{E}[e^{uX+vY}] = \mathbb{E}[e^{uX}]\mathbb{E}[e^{vY}]$ whenever the expectations are finite, then $X,Y$ are independent.   And there is a similar version for characteristic functions. Could anyone provide me a serious reference which proves one or both of these theorems? Show that there are $ a,b \geq 0 $ so that $ |f(x)| \leq ax+b, \forall x \geq 0.$ How do I safely investigate a USB stick found in the parking lot at work? I work at an embedded software company. This morning I found a USB stick in the parking lot in front of the building. With all the stories of "dropped USB stick attacks" in mind, I'm obviously not going to just plug it into my laptop. OTOH, I'm curious to know whether this was actually an attempt to compromise our systems, or it's really just an innocent case of somebody accidentally losing a USB stick. How do I safely inspect the USB stick without risking exposure?  I'm worried not just about malware and crafted file system images; there's also stuff like power surge attacks:.  EDIT: Many of the answers seem to assume I want to keep the drive and use it afterwards. I have no interest in that at all, I know USB sticks are cheap, and that it wouldn't be mine to keep anyway. I only want to know whether this was indeed a semi-targeted attack, partly out of curiosity whether this actually happens in real life and not just in security papers, but also so that I could warn my coworkers.  I want to know how I would figure out whether the stick contains malware. And that's not just a matter of looking at the drive contents and seeing a suspicious autorun.inf or a carefully crafted corrupt file system - I very much also want a way to inspect the firmware. I sort-of expected that there were tools for extracting that and comparing to known-good or known-bad binaries. How to increase the width and height of the Rich Text area field in Visual force Page? What are the alternatives for storing client side encrypted data? I want to store client side encrypted data in Drupal 7, so that it is encrypted on the client end, and stored and transmitted in encrypted form. The password is never transmitted or stored on the server. The only modules I have found which do this are  and  but they are for Drupal 6. I need something that is user specific, so that different users can use different keys, rather than a single key or a set of keys used on the server end. Are there any similar modules for Drupal 7? In an exercise in Atiyah-Macdonald it asks to prove that the prime spectrum $\operatorname{Spec}(A)$ of a commutative ring $A$ as a topological space $X$ (with the Zariski Topology) is compact.   Now because the basic open sets $X_f = \{\mathfrak{p} \in \operatorname{Spec} (A) : \{f\} \not\subseteq \mathfrak{p} \}$ form a basis for the Zariski Topology it suffices to consider the case when   $$X = \bigcup_{i \in I} X_{f_i}$$   where $I$ is some index set. Then taking the complement on both sides we get that   $$\emptyset = \bigcap_{i \in I} X_{f_i}^c$$  so there is no prime ideal $\mathfrak{p}$ of $A$ such that all the $f_i$'s are in $\mathfrak{p}$. Now from here I am able to show that the ideal generated by the $f_i$'s is the whole ring as follows. Since there is no prime ideal $\mathfrak{p}$ such that all the $f_i \in \mathfrak{p}$, it is clear that there is no $\mathfrak{p}$ such that $(f_i) \subseteq \mathfrak{p}$ for all $i \in I.$ Taking a sum over all the $i$ then gives $$\sum_{i \in I} (f_i) = (1).$$  Now here's the problem:          How do I show from here that there is an equation of the form $1 = \sum_{i \in J} f_ig_i,$ where $g_i \in A$ and $J$ some finite subset of $I$?       This part has been giving me a headache. I am not sure if the finiteness bit has to do with algebra, topology or the fact that we are dealing with prime ideals.  This is not a homework problem but rather for self-study.  $\textbf{Edit:}$ I have posted my answer below after the discussion with Dylan and Pierre. Insert list of figures in the table of contents Is it possible to create a list of all the figures at the end of a document (this I can do) and make it appear in the table of contents?  So in the the table of content there will be a line saying List of figures ... 19 for example? This week we rolled out a series of changes to  of the question close workflow.  You can read more about the details of these changes .    For context, the overall effort to improve the question close experience will be optimized for Stack Overflow. Given Stack Overflow’s scale, many of the pain points we hear about with question closing and reopening are unique to Stack Overflow and won’t make sense for other network sites. However some  changes are general improvements that should improve usability and guidance overall. Wherever possible, we plan to roll these changes out network wide as well. Any time we roll out a change network wide, we’ll make sure to cross-post here. This first phase is being rolled out to the network and is why I’m posting today.  Let us know if you run into any issues or have questions regarding the network here.