I am using my email address rather than profile name but it isn't working...I thought that maybe I was using the wrong password, so I changed it, but it still isn't working.  I don't know why.   My internet connection is great.  If there is anything I am doing wrong please let me know. I have had my account for less than a month and I am very irritated.  Is it possible there is an error on Mojang's side??
I am using a premium legit version of Minecraft that I purchased. I can log into minecraft.net as well as mojang.com but I am unable to login to Minecraft the game through the minecraft.exe or the Technic launcher. The Minecraft servers are up and running fine. My internet connection is also fine. I double checked my credentials and even tried changing my password. I tried using both my username and my email. I tried all of this on two separate accounts that I own. I tried deleting my login, launcher, launcher.pack.lzma, and launcher_profiles.json and then reopening Minecraft. I tried re-downloading minecraft.exe.   Nothing has worked and I seem to have run out of options. I sent a help request to Mojang but in the meantime I was hoping that maybe you guys could offer some advice.
Should I not answer my own questions? I am working on refactoring some old code and have found few structs containing zero length arrays (below). Warnings depressed by pragma, of course, but I've failed to create by "new" structures containing such structures (error 2233). Array 'byData' used as pointer, but why not to use pointer instead? or array of length 1? And of course, no comments were added to make me enjoy the process...  Any causes to use such thing? Any advice in refactoring those?  struct someData {    int nData;    BYTE byData[0]; }   NB It's C++, Windows XP, VS 2003 RSA, DES, AES, etc., all use (relatively) complicated mathematics to encrypt some message with some key. For each of these methods, there have been several documented vulnerabilities found over the years. Some even believe that there is a vulnerability in AES known only to the NSA.  On the other hand, the one-time pad is not only ridiculously simple, but also has been shown to be impossible to crack (if used appropriately).  Say you have some message to be encrypted with length n. Simply generate a random string with length m where m is at least as large as n, and perform modular addition of the random string onto the message.  As long as the random string is generated with a high-enough-quality random number generator, and as long as the same one-time pad isn't reused, it should be impossible to crack.  If this is true, all we would need to perfect are fast, cryptographically secure deterministic random number generators. Use the key as a starting seed for the RNG and you have a powerful uncrackable encryption scheme which is simple to understand and implement.  Blum-Blum-Shub is a fast, cryptographically secure PRNG, and there are others too.  I have written a C++ program which uses two 2048-bit primes (which match the necessary criteria) for Blum-Blum-Shub and uses a password which the user enters - converted into a starting seed - to run byte-wise modular addition. The process is fast, deterministic, and if the literature I have read is correct then it should be very secure.  So why is so much time and effort invested in coming up with convoluted encryption cyphers when mathematics shows that the simplest is often the best? Where does Minecraft for Windows 10 store its data? I'm looking for one word which describes what a student who missed classes needs to do Can't change mouse influence in proportional editing mode I press O and I see it change to Proportional Editing mode, but when I press G and mouse wheel down/up, or arrow keys down/up, it doesn't change the influence area.    And I am, I press G and then I tried to scroll to change influence, but it's not working.    Done this aswell and it's not working I have 12.10 ubuntu and when I try to remove / install programs I get notification :      Software can't be installed or removed because the authentication service is not available.    (org.freedesktop.PolicyKit.Error.Failed: ('system-bus-name', {'name':  ':1.104'}): org.debian.apt.install-or-remove-packages   When I log in as root user (instead of user account that I regulary use) i have no problems. Wrong (hyper-)references after resetting chapter counter The following MWE produces a PDF whose TOC has two entries: “Foo” and “Bar” with correct page numbers. So far, so good. However, upon clicking on the link to “Bar”, I am taken to the page for “Foo” instead.  \documentclass{report} \usepackage{hyperref} \newcommand*\backmatter{\setcounter{chapter}{0}}  \begin{document} \tableofcontents \chapter{Foo} \backmatter \chapter{Bar} \end{document}   (Produced with pdflatex, run twice.)  This MWE is whittled down from a (much!) more complex document but the above does seem to reproduce the error reliably.  Re-setting the chapter count seems to confuse hyperref, even though the page references are still accurate. Notice that in my real document, \backmatter does other things, including setting the numbering style to alphabetical so there’s no chance of confusion even though both chapters are ostensibly labelled as “Chapter 1”.  How do I fix this? Is this a bug? Are there workarounds? How to keep VLC player in minimized mode? I'm using VLC media player which can play almost all kinds of audio and video formats. While listening to audio, I keep VLC in minimized mode and can work on other windows. But when I select to listen video songs mixing with audio songs, VLC is maximizing itself to play every video song in the playing list, which is really annoying in the middle of work.  So how can I keep always VLC player in minimized mode while playing a list of songs mixed with audio and video songs? Sketch complex curve $z(t) = e^{-1t+it}$, $0 \le t \le b$ for some $b>0$ This may be a stupid or trivial question, but I am new to Ubuntu, and have two unsolved problems (flashplayer doesn't play, and scanner doesn't work - in virgin install 13.04), so I started to search in documentation. In the 13.04 specific web site I was browsing the hardware section, and came across something like this: "Open Dash, and select Disk Utilities".  So what is Dash, and where is Disk Utilities?  The application finder could not find any of those. In terminal the "dash" command seems to invoke some sort of a shell. I'm looking to implement a phase lock in an FPGA without using any external components (other than the ADC). For simplicity locking to a simple binary pulse is adequate. The frequency of the signals is ~0.1-1% of the clock. I can't use the onboard clock PLL's because they are typically:   Not configurable (set during synthesis). Jittery. Don't support the frequency I need.   I've been sorting through the literature and found a few binary phase locked loops. Most notable a "pulse steal" design that I can post a link to if desired. I have implemented and synthesized with some success, but its jitter and lock range was not as good as advertised. I've also had success using a external DVCO, but I would prefer if I can implement everything on chip.  A digital circuit design or even a hint in the right direction would be helpful (I've been banging my head against this for a while), a proven FPGA implementation would be wonderful but not expected.   ADDED 10-27-2010   The actual DPLL design that I used has a "Random Walk Filter" as the loop filter (not the "pulse steal" described earlier, going through my notes that didn't work to well), which then drives the clock pulses to the DCO. The lock-in range is set via divider in the DCO. The sensitivity of the loop is established by varying the length of the random walk.   The paper in which this is found is cited at the end of this post. After implementing parts of it myself, I found that it was actually already implemented on OpenCores, however it turns out that in the last few months the project was deleted but I have the Verilog files saved if anyone wants them.  Yamamoto, H.; Mori, S.; , "Performance of Binary Quantized All Digital Phase-Locked Loop with a New Class of Sequential Filter," Communications, IEEE Transactions on , vol.26, no.1, pp. 35- 45, Jan 1978  doi: 10.1109/TCOM.1978.1093972  URL: How can I adjust Cycles material displacement amount? Pivoting rows into columns dynamically in Oracle sql server linked server to oracle returns no data found when data exists Indentation shortcuts in Visual Studio Which prepositions are followed by accusative pronouns instead of reflexive pronouns? I have read answers to questions like  but I couldn't find a general rule for using "you" or "yourself", "him" or "himself" that could explain things I see in some examples.  For example, I think that one normally say (according to examples I see in ):   You bring something with you. You have something in you. You have something on you. You pressed her to you.   But on the other hand one would say:   You draw attention to yourself. He killed himself. You can try it out for yourself.   As a general rule, it seems that the reflexive pronoun is used when the object is the same as the subject of the verb. But for prepositional phrases, it seems more complicated. Do some prepositions (like "with", "in", "on") always come with the accusative form of the pronoun, and some other (like "for") don't? What about "to", that seems to be followed by both in different circumstances? How many days a year is a U.S. citizen allowed to stay in Morocco? I arrived in Morocco in October of 2014 and renewed my visa by traveling to Spain by ship for a day and getting my passport stamped again in January of 2015. My question is, am I allowed to leave the country and repeat this process this year by traveling again to another country, other than my own in order to return to Morocco for another 90 days? And if so, how many times a year is this allowed? I have read 180 days on some websites but there is not any clear answers anywhere about this that I can find. How do I determine whether or not two lines intersect, and if they do, at what x,y point? Let $\mathbf{FinVec}$ denote the category of finite-dimensional real vector spaces and linear maps, let $F\colon\mathbf{FinVec}\rightarrow\mathbf{FinVec}$ be a functor. For each pair of objects $V,W$, the Hom-set $\operatorname{Hom}(V,W)$ is itself a finite-dimensional vector space and we equip it with the unique structure of a topological space/of a smooth manifold that is compatible with its vector space structure. The composition maps are then continuous/smooth. In this way, we view $\mathbf{FinVec}$ as enriched over the category $\mathbf{Top}$/$\mathbf{Diff}$ respectively. It then makes sense to ask whether the functor $F$ is enriched over $\mathbf{Top}$/$\mathbf{Diff}$. That is just to ask whether the induced map $F\colon\operatorname{Hom}(V,W)\rightarrow\operatorname{Hom}(FV,FW)$ is continuous/smooth for all $V,W$. (Irrelevant to the rest of the question, but the reason this is a useful notion is that it is the natural hypothesis assuring that the functor induces another functor on the category of topological/smooth vector bundles, applying the original functor fiberwise.) In the case $V=W$, by functoriality, we can restrict $F$ to a group homomorphism $\operatorname{GL}(V)\rightarrow\operatorname{GL}(V)$. If the functor is continuous/smooth, so is this map. Note that $\operatorname{GL}(V)$ is a Lie group. It is a general result that a measurable group homomorphism between Lie groups is automatically smooth. This begs the following questions:  What's an argument for the existence of functors that aren't continuous? Can we construct one? Given the above, it either happens that the restrictions to $\operatorname{GL}(V)\rightarrow\operatorname{GL}(V)$ are continuous and continuity fails elsewhere, or the induced maps will be non-measurable, so that the construction will necessarily have to involve choice to some extent. Are there continuous functors that aren't smooth? Given the above, a continuous functor will have smooth restrictions to $\operatorname{GL}(V)\rightarrow\operatorname{GL}(V)$, but smoothness may fail elsewhere.