$f: \mathbb{C} \rightarrow \mathbb{C}, \; z \mapsto f(z) := \frac{z^2}{1+|z|}$  How would I go about proving this is uniformly continuous? Currently I have only practically dealt with analyzing continuity of real functions. Here's my approach:  $\forall \epsilon > 0 \; \exists \delta > 0 \; \forall z,z_0 \in \mathbb{C}: |z-z_0| < \delta \implies |f(z) - f(z_0)| < \epsilon$  Let $\epsilon > 0$ and $|z-z_0| < \delta$. We don't know yet whether $\delta$ exists or its value. Looking at $|f(z) - f(z_0)|$ we get $|\frac{z^2}{1+|z|} - \frac{z_0^2}{1+|z_0|}|$. Now I know that I will need to estimate this term somehow to eliminate $z_0$ such that our $\delta$ is only dependent on $\epsilon$.  First thing I thought about was bringing both summands down to a common denominator such that we have $$\frac{|z^2(1+|z_0|) - z_0^2(1+|z|)|}{|(1+|z|) (1+|z_0|)|}$$  So now when we multiply this out we get $$ frac{z^2 - z_0^2 + z^2|z_0| - z_0^2|z|}{(1+|z|) (1+|z_0|)} < \frac{\delta + z^2|z_0| - z_0^2|z|}{(1+|z|) (1+|z_0|)} $$  My lectures have just introduced this topic and I don't really know yet how to go about these proofs. Thanks for any help!

I tried using the definition of the continuity to try and find a $\delta$ but I got stuck here $$ |f(w) - f(z)| = |\frac{w^2 \cdot (1+|z|) - z^2 \cdot (1+|w|)}{(1+|w|)\cdot(1+|z|)}|$$ What can I do to find a suitable $\delta$ that would end my proof?


We all know       , but it seems the problem is people not reviewing enough. Whenever I had time, I would go through all 40 that I was given, but by then I wanted to do more. Would raising that limit of 40 and not counting Close Votes queue votes towards your daily close vote allowance help?

Today, the size of the close-votes queue is 55k questions and growing. Is that a problem?   Which action could be taken to clean it up? It seems to be growing faster than Stack Overflow members are capable to handle it.


I have installed Ubuntu 20.04 on an external HDD, it's been a huge pain. I've followed a a guide on internet, where it was said that giving 40GB of space for the root partition would've been enough, now I'm seeing that with less than a quarter  of the program that I need it's already quite full.  I don't know if I should resize some partiton (and how) or maybe merging the two partition (/home and /). Please don't tell me to redo the installation with different partition because it was a huge pain.

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?


please see the scrnsht i new to this new it says using git add .a is for adding all files in CURRENT DIRECTORY and git add -A is for adding all files in CURRENT REPOSITORY. Is directory different from repository or ONE AND THE SAME?Thanks.

The command git add [--all|-A] appears to be identical to git add .. Is this correct? If not, how do they differ?


I want to ask, why didn't Stack Overflow register my visit on Saturday? I'm 100% certain I was logged in on that day. I'm asking because it broke my consecutive days logins.

Yesterday I visited Stack Overflow and had 13 consecutive days visited.  Today, I visited and had 1.  Is this a bug?  Why did it reset?


I am trying to get out of low priority and they said I needed to play 5 matchmade games without leaving and I would like to know if Tutorial or Practice tool counts as a matchmade game and I would like to know what does count in a matchmade game.

So recently (or maybe not recently, I just started playing again) Riot implemented a . I'm still really confused how it works, but I managed to obtain another box besides the one that they gave me as intro-freebee. Now I think I need a key, but i don't know how to earn one. The article i posted in that link above says:     Earn keys as rewards for winning any matchmade games or by purchasing them at the store for 125 RP. Keys unlock chests through Hextech Crafting.   But I don't know what a "matchmade" game is officially.  says:     anything that uses the matchmaking system, so custom games are out, and that's it   but that doesn't help because I still don't know what the matchmaking system is. Aren't all games made by matching? if so, why didn't i receive keys for winning a normal-draft game? And I have RP but whats the point of spending it on this if i can just win it somehow?


Suppose $p$ is an odd prime.  Show that $1^{p-1} +2^{p-1}+ \ldots +(p-1)^{p-1}\equiv -1\pmod p$.  I think I need to use Wilson's Theorem on this but I'm not sure how.  I believe I am suppose to factor it somehow too but also I'm lost at this point.

Show that    $$1^{p-1} + 2^{p-1} +\ldots + (p-1)^{p-1} \equiv -1 \mod p$$   So, I use Fermat's little theorem, that is if $p$ does not divide $a$, then $a^{p-1}$ is congruent to $1$ (mod $p$). But I'm still confused. If $1^{p-1}$ is congruent to $1$ (mod $p$), $2^{p-1}$ is congruent to $1$ (mod $p$), and $p$ does not divide $p-1$, so $(p-1)^{p-1}$ is congruent to $1$ (mod $p$). How does that equal $-1$ (mod $p$)?


There seems to be a lot of questions / answers about doing the reverse, but not as much info for USB -> DVD.  Problem  I created a bootable USB drive using YUMI.  The USB drive is working great, and contains the following:   Linux Mint 13  Linux Mint Debian  Debian 6   Ubuntu 12.04.1  Fedora 17    A bit of a mix of DVD and Live versions.  I have a spindle of DVD+R DL blank DVD's. I would like to create a bootable .iso from this USB drive so I can burn multiple copies of it to pass around to friends!  I've created an iso using Folder2ISO, but it coastered my DVD because it wasn't bootable. I don't really want to waste a whole spindle!   How would you go about doing such a thing?

I have an iso file of operating system's set up.  Now, I don't have dvd burner right now.  But the alternate - 4gb pen drive is available.  If I copy entire iso file to pen drive,  Can my system boot through pend drive?


Here on the Internet, we see many ads promoting software products which can enhance your Internet speed.  I wonder, how could this be?  Imagine that you are using a 1 Mbps Internet connection, and the highest speed speed you can get from it is nothing above the limit.  The Internet services are programmed to transmit certain-sized data packets at a certain rate.  So when we can't do anything physically (like manipulating the line and such), how come those software developers claim that their products could enhance the Internet speed?  Edit :   Thanks to all people.I have got my answer.

Are applications that claim to improve web speeds effective? If so, how? I would have guessed they were scammy, but I suppose if they can reroute traffic to a closer datacenter it might be possible?


I am looking for some help with Regex syntax. I tried many ways to make the syntax for this case, but nothing seems to work. Could someone help me with this?  So I have a case where I am trying to replace everything before the "." symbol in this string,   example_ so.myname   I successfully removed all the strings before the "." using this expression:  var removeStrBeforeDot = params.value.replace(/(\<b\>|\<nobr\>)[a-z]*\./g, "");     removeStrBeforeDot = removeStrBeforeDot.replace(/\(.*\)\<\/b\>/g, " ");   But the issue with this expression is, this works when there is only letters before the dot and doesn't work when there are symbols like , space, etc. Like for example, example so.myname has a space and a "_" which is not working in this case. What I like to do is keep it more generic and remove any string before the "."  to be removed. Any help could be greatly appreciable.  Thanks!

See code:   var file1 = "50.xsl"; var file2 = "30.doc"; getFileExtension(file1); //returns xsl getFileExtension(file2); //returns doc  function getFileExtension(filename) {     /*TODO*/ }


Suppose  $$A\neq\emptyset$$   Since, $$\emptyset\subseteq A * A$$  the set $$R=\emptyset$$ is a relation on A.  Is $R$ reflexive? symmetric? transitive?  I remember hearing something can be "vacuously" true. So the empty set would be reflexive, symmetric and transitive because it doesn't meet the definition?  So there is no $(x,x)$ that can exist in $R$ therefore vacuously reflexive.  There is no $(x,y)$ that can exist in $R$ therefore vacuously symmetric.  There is no $(x,y)$ that can exist in $R$ therefore vacuously transitive.  Is my reasoning correct here?

Question:      Let $R$ be a relation on a set $A$. Prove that         if $A$ is non-empty, the empty relation is not reflexive on $A$.   the empty relation is symmetric and transitive for every set $A$.      My Solution:    For a relation to be reflexive: For all elements in A, they should be related to themselves. ($x$ $R$ $x$). Now in this case there are no elements in the Relation and as A is non-empty no element is related to itself hence the empty relation is not reflexive.  Now for a set to be symmetric and transitive: As these are conditional statements if the antecedent is false the statements would be true. And as the relation is empty in both cases the antecedent is false hence the empty relation is symmetric and transitive.   (I just want to know if my solutions are correct. - I've given brief solutions without using any notation here.)


I understand Current density $J =n e  v$ [$n=$ carrier concentration per unit volume, $e=$ charge on electron, $v=$ drift velocity] Which is independent of area of cross section of wire (and hence the diameter) However, the book practical electronics for beginners quotes that:  Current density within a copper wire increase as the diameter of the wire decrease.  Is the book mentioning about varying cross section in the same wire? If yes then can you please explain how does current density increase in a smaller diameter wire?

I am confused whether drift velocity depends upon area or not . I checked answers for this question but all of them were cancelling each other out . from the equation $$I = neAv$$ It is clear that drift velocity should depend upon area but at the same time don't you think that by increasing the area of cross section of a conductor should have resulted in increase in drift velocity please help me out with it in detailed answer of how should i go with all the possible cases and explanation ,thanks :)


(PHB 215) states:     If a creature hits you with a melee attack while you have these hit points, the creature takes 5 cold damage.   Since it doesn't specify that it has to be a weapon attack, does it also work for melee spell attacks?  Specifically, would it work against  (PHB 278)?

The  spell says:     The spell captures some of the incoming energy, lessening its effect on you and storing it for your next melee attack. You have resistance to the triggering damage type until the start of your next turn. Also, the fist time you hit with a melee attack on your next turn, the target takes an extra 1d6 damage of the triggering type, and the spell ends.   The  cantrip says:     Lightning springs from your hand to deliver a shock to a creature you try to touch. Make a melee spell attack against the target. You have advantage on the attack roll if the target is wearing armor made of metal. On a hit, the target takes 1d8 lightning damage, and it can’t take reactions until the start of its next turn.   If I absorb fire damage with absorb elements, would I be able to add an extra 1d6 fire damage to my next shocking grasp attack?


Recently in an episode of 'House of cards' they bring up the joke     "Two freshmen girls are moving into their dorm room together. One of them's from Georgia, one of them's from Connecticut. The girl from Connecticut's helping her mother put up curtains. Girl from Georgia turns to them and says, "Hi. Where y'all from?" Girl from Connecticut says, "We're from a place where we know not to end a sentence with a preposition." The girl from Georgia says, "Oh, beg my pardon. Where y'all from...cunt?"   Now, i suppose the punchline has something to do with the not-preposition, but what i don't get is why the Connecticut girl even considers that a sentence cannot end with a preposition? Is there any reason for stating that prepositions can't be on the end of a sentence? And if not, what is the punchline of this joke?  If this joke's punchline is not pertaining to English language or if this is not a grammatical joke, i'm sorry and will remove the question.

Like many others, I commonly find myself ending a sentence with a preposition.  Yes, it makes me cringe.  I usually rewrite the sentence, but sometimes (in emails) I just live with it.  To, with... you know who you are.  Should I keep fighting myself on this one, or is it okay in some circumstances?


Quite new to Blender. I'm using 2.75 and was working on this lamp (part of a Udemy course). I was using the Render Border tool (Ctrl+B) to constrain rendering to part of the model and somewhere in amongst cancelling/redrawing that and moving the camera around my file now only displays a minimal part of my model in both Object and Edit modes when using anything except Rendered Shading (see images).  I got to that point where I'd pressed a bunch of keys and couldn't remember quite what I'd done, couldn't undo it etc. It looks like a bug to me tbh, but if anyone knows which shortcut I may have pressed to limit the viewport like this I'd appreciate it!  If there is anyway to host the .blend file somewhere if anyone wanted to take a look, then please let me know.

When looking at my objects in 3d view I'm seeing a gray cone that seems to be hiding other objects.   Can anyone help me turn this off and explain what it is please.  Screenshots attached.


I want to connect two laptops with a crossover Ethernet cable, in order to synchronize them with ntp. One laptop runs Windows 7, the other one Ubuntu.   On Ubuntu, in order to assign a static IP address to an interface, I just do:  sudo ifconfig eth0 10.0.0.100 netmask 255.255.255.0   Is there a similar way for Windows, from the cmd?

I need fixed IP in three wireless networks I log in frequently.  It is a pain to set those IP and gateway everytime I change networks.  I am willing to write a script to change my IP and gateway between those 3 fixed IPs and a choice to make it get IP automatically (when I´m in another network).  A plus feature to my script would be if it could discover the wireless network I am logged in and decide the IP automatically.  Is it even possible?  Thanks.


I have a localhost webapp (development) that requires a login to use and I would want to implement Visual Testing which for me means having a tool taking screenshots when I want and, as a plus, do the image diff.   The tool must be free and a big plus is if it's very easy to implement: I don't mind coding the test cases if needed but any kind of GUI would be a major plus. I also don't mind the tool requires to be installed on a server or anything like that.  It's not important to test on different resolutions/browsers, this is more about keeping 'stability' and knowing which pages changing than making sure everything is working OK visually. Something that uses Chrome to render the page is also nice.

For testing the visual appearance of a website the use of tools like selenium (functional surface test) is not sufficient because it doesn´t check the visual appearance and/or the CSS-Code directly. Different approaches are possible   Defining style guides Syntax checking of CSS and HTML DOM comparison Screenshot comparison   How do you check the visual appearance of websites from a web-application?   I implemented a screenshot comparison tool in Java. Screenshots are generated by a framework based on selenium. I started with pixel by pixel comparison. Actually I split the screenshot into different parts (maybe 10x10 rectangles) and compare the histograms of corresponding parts. For the future I want to determine relevant parts (regions of interest) automatically. Maybe someone has ideas how to do that.


When starting Minecraft, it immediately crashes with this crash log:  [Launcher] Starting Minecraft 1.12.2... [Launcher] Launching in: C:\Users\Jaideep\AppData\Roaming\.minecraft [Launcher] Processing post-launch actions. Assist launch: true ==================================================================== > [19:32:19] [Client thread/INFO]: Setting user: Jaideepndhruv > [19:32:29] [Client thread/INFO]: LWJGL Version: 2.9.4 Here I am! [VersionManager] Refreshing versions locally... [VersionManager] Versions has been refreshed (94 ms) [TlauncherManager] before clearLibrary  [TlauncherManager] after clearLibrary  [Launcher] Launcher exited. [Launcher] Minecraft closed with exit code: -1073741571   What can I do to make Minecraft work?

Similar to  on the bugs in Minecraft, I would like a complete list of what error codes exist in Minecraft and how they occur, as well as how they can be resolved.


If I use an an align environment within the a beamer block, the \abovedisplayskip is ignored. How can I force that setting?   My MWE is   \documentclass[t]{beamer} \usecolortheme{rose} \usepackage{amsmath} \begin{document} \abovedisplayskip=0pt \begin{frame} \begin{block}{Some Block} \begin{align} %does not have 0pt abovedisplayskip     e^x &= \sum_{k=1}^\infty \frac{x^k}{k!} \end{align} \end{block} \begin{block}{Some other Block} text \begin{align} %abovedisplayskip works after text line     e &= \lim_{n\to\infty} \left(1+\frac1n\right)^n \end{align} \end{block} \end{frame} \end{document}

I want to reduce the white space (above and below) when I insert an equation environment in a beamer block.  \documentclass{beamer} \usetheme{Antibes} \usepackage{amsmath}  \begin{document}  \begin{frame}  \begin{block}{Separation of variables} \setlength\abovedisplayskip{0pt} \begin{equation} 1 + 2 = 3 \end{equation} \end{block}  \end{frame}  \end{document}     I searched the web of course but the solutions I found do not seem to work (like \setlength\abovedisplayskip{0pt}).  What I found and should have worked:


I am trying to delete this folder, C:\Windows\System32\catroot. I am using the application, LockHunter and it is telling me that it is being used by the system and the svchost.exe and it is preventing me from deleting it. How do I delete this folder?  Thank you for your help and support!

Sometimes when I'm working in Windows I'll get this prompt when I try to delete a directory:    Folder In Use The action can't be completed because the folder is open in another program Close the folder and try again.   However, the folder isn't "in use" at all, and I don't have it open. So how can I delete it short of rebooting?


my tex:  \documentclass[12pt,a4paper]{report} \usepackage{setspace} \onehalfspacing \usepackage[   left=3cm,   headheight=33pt,   top=3cm,   right=2cm,   bottom=2cm,   includehead,   includefoot,   bindingoffset=5mm ]{geometry} \usepackage[utf8]{inputenc} \usepackage[bahasai]{babel} % <---- main language last \usepackage{csquotes} \usepackage{biblatex} \addbibresource{sample.bib} \usepackage{lipsum}  \usepackage{titlesec}  \titleformat{\section}   {\normalfont\fontsize{14}{15}\bfseries}   {\thesection}   {1em}   {}  \usepackage{graphicx} %\usepackage[colorinlistoftodos]{todonotes} %\usepackage{showframe}  \usepackage[linktocpage]{hyperref} \hypersetup{     colorlinks,     citecolor=black,     filecolor=black,     linkcolor=black,     urlcolor=black }  \makeatletter \def\@makechapterhead#1{%   %%%%\vspace*{50\p@}% %%% removed!   {\parindent \z@ \centering \normalfont     \ifnum \c@secnumdepth >\m@ne         \Large\bfseries \MakeUppercase{\@chapapp}\space \thechapter % <--- uppercase         \par\nobreak         \vskip 0\p@     \fi     \interlinepenalty\@M     \LARGE \bfseries #1\par\nobreak     \vskip 30\p@   }} \def\@makeschapterhead#1{%   %%%%%\vspace*{50\p@}% %%% removed!   {\parindent \z@ \centering     \normalfont     \interlinepenalty\@M     \LARGE \bfseries  #1\par\nobreak     \vskip 30\p@   }} \makeatother   \usepackage{fancyhdr}  \pagestyle{fancy} \rhead{\includegraphics[height=1cm]{LOGO_PLN.png}} \lhead{\includegraphics[height=1cm]{LOGO_IP1.png}} \renewcommand{\headrulewidth}{1.5pt} \begin{document} \pagenumbering{Alph} \begin{titlepage}     \begin{center}         \includegraphics[width=5cm]{LOGO_IP2.PNG}\\[0.25cm]         \textbf{PT. INDONESIA POWER UJP ADIPALA}\\[1.75cm]         \textbf{PROJECT ASSIGNMENT \\[4cm]}         \textbf{RETROFIT PLC TWIDO KE PLC S7-200}\\[4cm]          \textbf{Diajukan Oleh:}\\         \textbf{Abdul Qoyyim}\\         \textbf{SIC-257}\\[3.5cm]         \textbf{PROGRAM ON THE JOB TRAINING}\\         \textbf{DIKLAT PRAJABATAN ANGKATAN 23}\\         \textbf{TAHUN 2017}     \end{center}  \end{titlepage}  \pagenumbering{roman}  \chapter*{LEMBAR PENGESAHAN} \thispagestyle{fancy} \lipsum[3]  \chapter*{ABSTRAK} \thispagestyle{fancy} \lipsum[5]  \chapter*{KATA PENGANTAR} \thispagestyle{fancy} \lipsum[6]   \tableofcontents \thispagestyle{fancy} \listoffigures \thispagestyle{fancy} \listoftables \thispagestyle{fancy} \pagebreak  \pagenumbering{arabic}  \chapter{PENDAHULUAN} \thispagestyle{fancy} \lipsum[1] \section{Latar Belakang} \lipsum[2-3] \section{Perumusan Masalah} \lipsum[3] \section{Maksud dan Tujuan Project Assignment} \lipsum[4] \section{Ruang Lingkup} \lipsum[5] \section{Metodologi} \lipsum[6]  \chapter{LANDASAN TEORI} \thispagestyle{fancy} \lipsum[7] \begin{figure}[h]     \centering     \includegraphics[width=0.25\textwidth]{LOGO_IP3.png}     \caption{a nice plot}     \label{fig:mesh1} \end{figure}  As you can see in the gambars \ref{fig:mesh1}, the  function grows near 0. Alsos, in the page \cite{einstein} \pageref{fig:mesh1}  is the same example. \lipsum[1-3]  \chapter{PEMBAHASAN PROJECT ASSIGNMENT} \thispagestyle{fancy} \lipsum[8]  \chapter{MANFAAT PROJECT ASSIGNMENT} \thispagestyle{fancy} \lipsum[9] \section{Manfaat Finansial} \lipsum[10] \section{Manfaat Non Finansial} \lipsum[11] \chapter{KESIMPULAN DAN SARAN} \thispagestyle{fancy} \lipsum[12]  \section{Kesimpulan} \lipsum[13-14] \section{Saran} \lipsum[14] \printbibliography[heading=bibintoc,title=Referensi] \end{document}

From time to time, I need to typeset Welsh. Sometimes, I need to typeset citations and bibliographies in Welsh. I think that last time I did this, I may still have been using BibTeX although I am honestly not sure. In any case, my entire work-flow now uses biber and biblatex...  I found  on changing the names of things, including the names of things used by biblatex. However, that cannot deal with the case of an unsupported language.  Suppose that I want to typeset a document in Welsh:  \documentclass[a4paper,welsh]{article}  \usepackage{babel} \usepackage[utf8]{inputenc}% welsh needs utf8x but biblatex doesn't like it \usepackage[T1]{fontenc}% not great for Welsh but the best pdfTeX can do \usepackage{csquotes}% doesn't like Welsh though biblatex likes csquotes on account of babel... \usepackage[backend=biber]{biblatex} \bibliography{biblatex-examples}  \title{Fy Nogfen} \author{Rhywun}  \begin{document}   \maketitle   \tableofcontents   \section{Cyntaf}   \autocite{westfahl:space}    \printbibliography  \end{document}   There are multiple problems in such a case. (One is that I need utf8x but can't use it on account of biblatex. Another is that I need utf8x at all. Another is that biblatex likes csquotes but csquotes doesn't do Welsh. But these are irrelevant to this question.)  The output is as follows:    Note that the use of the English citation is just so this is easy to reproduce. Obviously, the content of the reference might well be in Welsh. (Though it might be in English, too.)  As can be seen, while elements of the document controlled by babel are handled correctly, those under the control of biblatex are not. However, I cannot simply modify the solution offered by lockstep for changing strings to customised English variants. That is, I can't just use a Welsh version of  \DefineBibliographyStrings{english}{%   bibliography = {Works Cited},   references = {Works Cited}, }   because biblatex has never heard of it.  What is the most appropriate way to configure biblatex for use with an unsupported language?


Seeing as midichlorians are found in all life in varying levels, it's conceivable that a Sith Lord could harness their resources to discover a way to do this and subsequently add it to their bodies.  If midichlorian count is important as a ratio of power of the Force, then it stands to reason the higher the count the better and thus makes the perfect incentive for a Sith Lord to harvest and incorporate midichlorians into their own body.  But why haven't they?  Or why haven't we heard of this?

The more questions about the Force I read in here, the more Midi-chlorian count is used as a reference. As I understood, Midi-chlorians are the measurement for the Force power level of one user.  As I remember, they are microscopic life-forms in the red blood cells that talk spiritually to the user.  This then leads me to a question, if it is possible to give someone else an infuse of blood with Midi-chlorians. That then leads me to another questions. What happens if you use Force blood to rescue someone without it? Do already-infused get stronger? As I only know the films and very few other cannon material (games), I have to ask you:  Are Midi-chlorians able to be infused to another body and do they have an impact to that another being?


I have data in Sheet1 that I wish to import into Sheet2 with ImportRange. However, when the cell in Sheet1 is marked with a "strikeout" I want it to also import as a strike-out cell in Sheet2. Is this possible?

Is it possible to reference a cell in Google Sheets so that cell where it gets displayed also displays it using the same text and cell colour formatting?  =A1   Will only reference cell's value. But if that particular cell has red background and white text I'd like that to be copied as well.  I'm leaning toward existing formula solutions rather than scripts. If applicable of course.


I am trying to mimic the style of a certain Journal, where some figures can be formatted to be of 1.x column width (say x=0.25 or x=0.5). Here is an example:  Is there any package or way to do so? In my search, I have unfortunately not been able to find any tutorials on how to do so. Ideally, I would like a flexible method that lets me have 1.x column width figures, where I can specify x (although a baked-in static x choice would work too).

I need to insert a figure into a two column document such that the figure partially spans both columns, and the text wraps around it.  It seems wrapfig does not work for this in two column, pullquote does not seem to either be exactly what I need.  I've tried using minipage with no luck. I tried to post an example of what I need to accomplish but since I am new this forum I cannot.  I'd be happy to send an image if this helps.   Any suggestions would be fantastically helpful!


I've got a WD EasyStore 1TB external hard drive that won't show up in disk utility at all. I've tried multiple MacBooks and on my raspberry pi. The ONLY thing I can get to recognize the hard drive itself are the WD Drive Utilities (yuck), but when I try to erase it from there the application crashes. I have looked for a fsck_hfs or fsck_exfat process running to see if the machine is trying to repair the disk before it runs it at all. Nothing. When I try to reboot my MacBook with the drive connected to it, it stays stalled on the apple logo for as long as I'll let it. I can see that it is recognized as a USB connection in System Information, but it is not recognized as storage at all. Help, please!!!

I am on a MacBook Pro 13 running latest Sierra. I have an external Seagate solid state hard drive that was working and out of the blue stopped working. The only thing on it was my Adobe Lightroom images/videos. Not the LR DB files. I'm sure you have all heard this woe before, so I won't dwell on that. And yes, I back up to the cloud. AWS S3 specifically. Though I am traveling South East Asia for the last year, and staying in cheap hostels. So good internet is hard to come by sometimes. I can't back it up after every export. While most of it is backed up, there is some that is not.  Moving on. The symptoms seems to change every time I plug it in. The first sign was it ejected on it's own. I plugged it in again, and it wouldn't mount. Disk Utility recognized it, so did the command line diskutil list but it wouldn't mount. I rebooted and it worked for a second. Then I could only get to it from the command line. Then trying to frantically back up to my local what was not backed up to the cloud, it all failed. Basically just a cp -R [directory] [local-directory] command.  After some more frantic unplugging and re-plugging plus some command line manual mounts, I finally got it to where the Disk Utility would be able to run first aid on it. It failed. I don't recall the error. So I put it in a freezer. After a few hours I tried again. It is not any better. It still will not mount. Now Disk Utility sees it, but with no partition. I can't even give me information about how much space is used on it.  I have also tried it from a Windows machine. It did not mount. I have tried other cables. No success. As well as tried my other USB port. I also have another working external hard drive exactly like the one giving me issues. It works on all cables and USB ports.  I do have Docker running with a Ubuntu container, I'm trying to think of a way to see if I can try to get to the USB from there. I also have a USB that I have thought about running a live Ubuntu on there to see if I can mount and retrieve the data or fix the HDD that way. But if it will not mount, I doubt these will work.  Can anyone else think of any other tricks I can try myself to see if I can repair this or at least retrieve the data without paying for a service or software? If not, those suggestions are also welcome.  Update   I made the mistake in original post that it was a Solid State Drive. This is my mistake, it is actually a spinning disk hard drive. I bought them long ago and have been traveling with them for so long I just forgot. Question is updated to reflect this. Now diskutil list does not show it at all. The Disk Utility app also does not see it. Based on suggestion from @Allen I seeked out the USB to SATA cable. I did not quite find it, as my options are extremely limited where I am at. Though a local expat on a facebook group was able to help me with a empty 2.5 casing that I was able to extract the drive from original casing and put it in his blank case. It now mounts. Though it has the "click of death" sound to it. And data is not really reachable. While I can ls the directories and Adobe Lightroom does not have the exclamation mark when it can not reach the actual external files. Right clicking on the images and clicking on "Show in Finder" or any other variation of trying to get to the files through Finder or terminal, I have no success. It usually hangs and I get the spinning wheel. Since Adobe Lightroom imports these images into directories named by date, I am going to send the drive off to a data recovery service and ask to recover just unbacked up directories i.e. dates. Next time I will make harder efforts to backup and probably get an actual SSD.   I think this can be closed, due to my low reputation points I can not close this myself.


This is a bit of a strange issue for me and I wasn't sure how to properly title the question. I have the follow MWE which simply generates a list of coordinate points (x,t) and performs some check to see if they lie on a user-prescribed boundary. In particular, if x[i] == 1.0 and t[i] != 0.0 then the program should print a statement stating so. I can't seem to figure out why the if conditional is never entered here. I have printed out the pairs of values x[i] and t[i] to verify that there are indeed pairs satisfying the conditional...  #Load Modules import numpy as np import math, random from pylab import meshgrid  # Create the arrays x and t on an evenly spaced cartesian grid N = 10 xa = -1.0; xb = 1.0;  ta = 0.0; tb = 0.4;  xin = np.arange(xa, xb+0.00001, (xb-xa)/N).reshape((N+1,1)) tin = np.arange(ta, tb+0.00001, (tb-ta)/N).reshape((N+1,1))  X_tmp,T_tmp = meshgrid(xin,tin) x = np.reshape(X_tmp,((N+1)**2,1)) t = np.reshape(T_tmp,((N+1)**2,1))  # create boundary flags for i in range(0,(N+1)**2):     if (x[i] == xb and t[i] != ta):         print("We are on the right-side boundary")

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


My markup has the following structure:
Left Panel

Main Content
     Do not bother about . It is a React component that lies at the top of the page and has a certain height (not fixed). What I want is div one to take the entire height of the available viewport; that means 100vh minus the height of the header that we do not know. How is that possible?

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


Is there a way to not only protocol/log the console inputs (like the history), but also the console output by default (without the constant usage of pipes)?

I do not know if this is even possible or not, but in an attempt to keep track of many changes I am about to make to my system I want to track all input I type and all output from a terminal I'm working with to a file. I've been messing around trying to do this and here is what I have so far:  bash > /tmp/output.txt  This has some quasi success. I tested this with something simple: sudo apt-get update && sudo apt-get upgrade which dumped the normal output to the file, but not what I typed in.   Additionally I'd like to be able to see the output as well as have it stream to my output file, just for readability. (This can be worked around with a second terminal running tail -f, but it'd be nice to have it in one place).


So, the way I've always played you can't add a draw 2 on a draw 4 but I've seen plenty of other people do it. So I'm wondering if you can or can't?

Is it within the UNO rules to put a Wild Draw 4 card on top of a Draw 2 card, as it is a 'higher' card?    We've ALWAYS played that you can, but my new friend is adamant you can't.


Let $A$ be an $n \times n$ matrix. If $A$ is invertible, then $|A| \neq 0$. How I can justifying the answer?

Whenever I needed to find the inverse of a matrix, I was told to check if its determinant is not zero. However, once I directly applied the Gauss-Jordan's method for finding the inverse of matrix whose determinant was zero. The inverse matrix that I got looked pretty normal like any other (if there wasn't a mistake).  I want to know how does the determinant of the matrix is related to inverse of matrix or why is that if determinant is zero then inverse doesn't exist? What exactly is inverse?


I (think I) know how to pluralize an indirect quote, e.g.,     Their survey answers were limited to yeses and nos.   But how do I pluralize a direct quote ending in a punctuation mark? Am I even allowed to retain the punctuation mark for emphasis?  In other words, would the correct form(s) be:        There was no shortage of "How do you do?"s and "Let's do lunch!"es at the networking event.   There was no shortage of "How do you do"s and "Let's do lunch"es at the networking event.   There was no shortage of how-do-you-dos and let's-do-lunches at the networking event.   [something else altogether]      Does the number of correct forms change when I elect to italicize quotes, rather than demarcate them with quotation marks?  A/N: I was trying to keep my example short, but I do realize that "how-do-you-do" is already an . Hyphenation seems unwieldy, however, if the quote were longer.

Is there a way to pluralize a quotation? E.g.,     He was greeted with a chorus of “Hello”s.   or     Her daring earned “Ooh”s & “Ahh”s from around the room.   With actual dictionary words (“Hello” in the first example), simple plurals might do, without quotes: “He was greeted with a chorus of hellos.”  With ad hoc onomatopoeic words like “ooh” & “ahh”, though, can I pluralize them without confusing the reader? Is italicizing part of the word acceptable: “Her daring earned oohs & ahhs from around the room”?


I have object which is moving and i want to include its path in render. Is there a way? I trired "Motion path" option, but this doesnt show in render. Is there a way to for example plot trajectory if i have all the points or is there some ad on?

Once you have an animated object using typical key-framing (other methods such as physics, driver or NLA apply too).  It could be useful to apply the motion to a path:   to adjust the evaluation time edit curve points points may be easier have many objects move along the same path. ability to follow the path.   Is there a way to do this?    Note that rotation and scale won't be taken into account.


I hope someone here can help me out. So, I'm switching from zbrush to blender because of licensing issues and I'm having a bit of a problem with simple sculpting work. I already increased the resolution of my model with the multi res modifier and tried different types of dynamic topology modes but I always get weird artifacts with most brushes ( see image below) Does anyone know what the problem is and what I can do to fix it? Thanks in advance!

When I try to sculpt with dyntopo on a sword it creates really weird results while it works just fine on other meshes. Any idea what causes this?


I'm writing a program in C to add random numbers to an array. The size of the array is given (say n = 250) and using rand(), I'm generating these numbers (range is 1 to 100).  int main() {     int n = 250;     int array[n];     for (int i = 0; i < n; i++)     {         srand(time(NULL));         int r = rand()%100 + 1;         array[i] = r;     }     printf("Output Size: %lu\n", sizeof(array));      return 0; }   When I run the code, the result is- Output Size: 1000  Expected result is 250. What am I doing wrong?

How do I determine the size of my array in C?   That is, the number of elements the array can hold?


Every time I steal something the guards say:      "You have committed murder and conspiracy against the city of Markarth".     How do I fix this?

Is it possible to kill all of the guards in a town?  Ideally, I'd like to do this secretly so the entire town doesn't see my deeds and put a bounty on my head.  Edit: I was questing in Markarth and was told by a guard to back off and stop being nosy. I didn't and when I went to the Shrine of Talos I was set upon by a bunch of guards.  Now I have a huge bounty and I had to sneak/kill my way out of the city.  Every time I killed a group of guards the bounty was reduced by $1000, but I still have a $30,000 bounty.  I haven't even been through 1/3 of the city yet and know there has to be a lot of quests, so what do I do?  The only solution seems to kill every single guard (and inhabitant).


I am experimenting with specialized destructors. This code is perfectly valid and compiles just fine:  #include <iostream>  using namespace std;  template <typename T> class Cat { public:     ~Cat(); };  template <typename T> Cat<T>::~Cat() {     std::cout << "T" << std::endl; }  template <> Cat<int>::~Cat() {     std::cout << "int" << std::endl; }   int main() {     Cat<int> c1;     Cat<float> c2;     return 0; }   However if I put the class and the destructors in a separate file "Cat.h" and do #include "Cat.h" in Main.cpp, I'm getting a linker error: LNK2005   "public: __thiscall Cat<int>::~Cat<int>(void)" (??1?$Cat@H@@QAE@XZ) already defined in Cat.obj. Why?

I have some template code that I would prefer to have stored in a CPP file instead of inline in the header.  I know this can be done as long as you know which template types will be used.  For example:  .h file  class foo { public:     template <typename T>     void do(const T& t); };   .cpp file  template <typename T> void foo::do(const T& t) {     // Do something with t }  template void foo::do<int>(const int&); template void foo::do<std::string>(const std::string&);   Note the last two lines - the foo::do template function is only used with ints and std::strings, so those definitions mean the app will link.  My question is - is this a nasty hack or will this work with other compilers/linkers? I am only using this code with VS2008 at the moment but will be wanting to port to other environments.


Suppose I know a result that the set of finite sets in $\mathbb{N}$ is countable.   Is there a very quick way to show that the set of finite sets in any $X$ countable is countable?  Idea...two sets have same cardinality if there is a bijection, we biject set of finite sets, bijection preserves cardinality. End of proof.

I am looking for a beautiful way of showing the following basic result in elementary set theory:     If $A$ is a countable set then the set of finite subsets of $A$ is   countable.   I proved it as follows but my proof is somewhat fugly so I was wondering if there is a neat way of showing it:  Let $|A| \le \aleph_0$. If $A$ is finite then $P(A)$ is finite and hence countable. If $|A| = \aleph_0$ then there is a bijection $A \to \omega$ so that we may assume that we are talking about finite subsets of $\omega$ from now on. Define a map $\varphi: [A]^{<\aleph_0} \to (0,1) \cap \mathbb Q$ as $B \mapsto \sum_{n \in \omega} \frac{\chi_B (n)}{2^n}$. Then $\varphi$ is injective hence the claim follows. (The proof of which is what is the core-fugly part of the proof and I omit it.).


I don't understand the reasoning behind it. I was trying to figure it out with the chain rule in the case of $e^x$, but the I would get $(X(e)^x-1)(e^x)$ and I can't find the reasoning by my own

$$\frac{d}{dx} e^x=e^x$$ Please explain simply as I haven't studied the first principle of differentiation yet, but I know the basics of differentiation.


We say that $f:\mathbb{R}\to\mathbb{R}$ has a local minimum at every point, if for any point $x_0$ we can find an open interval containing $x_0$ such that $f(x)\ge f(x_0)$ for every point in the interval. Suppose $f$ is any function $\mathbb{R}\to\mathbb{R}$ satisfying this condition (so, in particular, it is not necessarily continuous). It does not follow that $f$ is constant. For example, take $f$ to be 0 on the integers and 1 elsewhere. So the question is prove that $f$ is constant except at (at most) countably many points, or find a counter-example.

What are the functions $f:\mathbb R\to\mathbb R$ such that every point is a local maximum?  Certainly, $f(x)=c$ works for every constant. So does $\lfloor x\rfloor$, as does $I_{\{0\}}(x)=\begin{cases}1&x=0\\0&x\ne0\end{cases}$. Another example is the oddly beautiful $e^{-\lfloor1/\lvert x\rvert\rfloor^{-2}}$. Question is, are step functions such as these the only ones? Are there any examples where every point is a strict local maximum?  (Thomae's function is a near-miss, since the condition doesn't hold on irrational points. Although, most points are irrational, so I guess the term "near-miss" doesn't quite fit.)  EDIT: My definition of step-function is the sum of countably many indicator functions of intervals, $\sum_{n=0}^\infty a_nI_{A_n}(x)$. If it were uncountable, any function would be step, as $\{\alpha\}$ is an interval ($[\alpha,\alpha]$).     This arose when I was thinking about the topological space with basis $\{(-\infty,a]:a\in\mathbb R\}$. If you call that space $X$, then the continuous functions $f:\mathbb R\to X$ are precisely these. I don't have a formal proof but I'm pretty sure (and this would belong in a different question anyway).   Contrast with:


I have a variable named title which is having the value "Javascript,XML,XHTML,CSS,Ajax". I need to compare in an if statement if the title equals to the above value some code needs to be run.  I have used   if (title == "Javascript,XML,XHTML,CSS,Ajax"){  } else if (title == " ") {  } else {  }   When the title is null, the code goes to the second else part and gets the correct result. But when the title is equal to Javascript,XML,XHTML,CSS,Ajax the code goes to the last else part instead of going to the if part.  What mistake have I done here? I have checked the upper lower case and also spelling along with the delimiter comma the string is same just as in the variable title. Then why do I not get the correct answer.

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


Please proof that $A\cap B=A\setminus(A\setminus B)$ this really gave me sleepless night. I tried using the set intersection properties but I still got confused.

How does one show that $A\cap B = A\setminus (A\setminus B)$?  My thinking is that if $x\in A\setminus (A\setminus B)$ then this means that $x\in A$ and $x\notin A\setminus B$, which means that $x\in A$ and ($x\notin A$ and $x\in B$), but I don't see why the expression in parentheses should simplify to just $x\in B$. Any insight would be helpful.  Maybe $(x\in A^c$ and $x\in B)$, i.e, $x\in A^c\cap B$ is a possible simplification of the expression in parentheses, but still don't see why this simplifies to just $x\in B$.


Ok, so this is a weird question as it makes my mouse next to useless while this is active.  I want to be able to click my mouse and it in turn think will I'm pressing a key on my keyboard instead of clicking the mouse. Is this even possible?   I want to use it so I can play a game called Rogue Legacy (a platformer). Because currently there is no way to bind your mouse to attack, which is really annoying to me.  This is not a duplicate, this is why: I'm trying to bind my left click on my mouse to press the F key on my keyboard instead of registering it as a left click from the mouse.

I'm trying to map/bind my mouse button 4 and button 5 to behave as kayboard num pad 1 and 2, does exist some way to do that? Maybe with some specific software?


The title says it all, really. I'm confronted with this problem from my topology course, and I have made no progress. I'm not sure if I'm supposed to solve it with the "standard" topology on R or something else, but I think its true even with the "standard" topology- I just can't find such a function.  I would add that this is an introductory course in topology and I don't know most advanced notions.

What is an example of an open map $(0,1) \to \mathbb{R}$ which is not continuous? Is it even possible for one to exist? What about in higher dimensions? The simplest example I've been able to think of is the map $e^{1/z}$ from $\mathbb{C}$ to $\mathbb{C}$ (filled in to be $0$ at $0$). There must be a simpler example, using the usual Euclidean topology, right?


If we have two real numbers $u,v\ge 0$ with the continued fractions $$u=[0,a_1,a_2,a_3,\cdots]$$ and $$v=[0,b_1,b_2,b_3,\cdots]$$ can we calculate the continued fractions of $u+v,u-v,uv,\frac{u}{v}$ only using the continued fraction representations of $u$ and $v$ ?

I'm interested in the arithmmetic of continued fractions and specially in multiplication. Consider  $$ f(x)=\cfrac{f_{0}(x)}{1-\cfrac{f_{1}(x)}{1+f_{1}(x)-\cfrac{f_{2}(x)}{1+f_{2}(x)-\cfrac{f_{3}(x)}{1+f_{3}(x)-\cdots}}}} $$   and   $$ g(x)=\cfrac{g_{0}(x)}{1-\cfrac{g_{1}(x)}{1+g_{1}(x)-\cfrac{g_{2}(x)}{1+g_{2}(x)-\cfrac{g_{3}(x)}{1+g_{3}(x)-\cdots}}}} $$   Are there arithmetic rules (algorithms) for the multiplication of continued fractions? Specifically, is it possible to obtain a continued fraction $h(x)=f(x)\cdot g(x)$ where   $$ h(x)=\cfrac{h_{0}(x)}{1-\cfrac{h_{1}(x)}{1+h_{1}(x)-\cfrac{h_{2}(x)}{1+h_{2}(x)-\cfrac{h_{3}(x)}{1+h_{3}(x)-\cdots}}}} $$   I've found , but I'd like more. Does anyone here knows of papers, algorithms, etc?  Thanks.    Update 1: Another .


I was wondering What the command ./ exactly does   example:./ts3client_runscript.sh start  Thanks for help.

I've been told to run this:  ./yiic message ./app/messages/config.php   But I don't understand the ./ meaning, can anyone clarify please.  Note: Believe me, we can't google that. I've tried:  ./ meaning ./ ubuntu  It was the same as nothing. :(


I'm supposed to make a function that returns a new String that looks like base appended with suffix, but if the base already end s with the suffix it returns the base. For example: if base is lightning and suffix is bug, then it returns lightening bug But if base is lightning bug and suffix is bug it also returns lightning bug. I'm actually not sure how to start this, so I just need help with the first step, then I'll try to build off of it. Also I cannot use arrays, so >it's supposed to be really basic. so far I have:      public static String appendIfMissing(String base, String suffix) {         if(base != suffix)         {             return base + suffix;         }                  return base;     }


I'm coming from Canada and will be riding in the London-Edinburgh-London randonneuring ride which finishes in Loughton. The London Underground info. shows that I can take my bike on the Central line and shows it until Leyton. Does this mean I have to get off at Leyton or can I continue on to Bank station? Do the allowable stations mean that's where I'm allowed to board or can I continue? Thanks - Terry

Can I take a bike on the Tube (underground) in London, if so how much does it cost?


I'd like to prove this statement:  Let $X$ a normed space. If $X$ has a linearly independent subset of cardinal $n$, then so does $X'$.  I know that I have to use the Hahn-Banach theorem to prove the existence of functionals in $X'$ that hold the above mentioned property but I'm not sure how. Any suggestions are welcome. Thanks in advance.

Given an arbitrary infinite dimensional Banach space $X$, can we deduce that it's dimension $\dim(X)$ (the cardinality of one of its Hamel bases) is less or equal of the dimension  $\dim(X^{\ast})$ of its dual space (the space of all continuous linear functionals $f:X\to\mathbb{R}$)?


I've got a rather unusual question. I've seen two variants of passing arguments to malloc. Let's say we've got:  int *arr = (int *) malloc(sizex * sizeof(*arr));  Some people say that using sizeof(*arr) is bad and you should use sizeof(int) (in this example) instead. Could you explain what's the difference and what's better to use?

Recently saw someone commending another user on their use of sizeof var instead of sizeof(type). I always thought that was just a style choice. Is there any significant difference? As an example, the lines with f and ff were considered better than the lines with g and gg:   typedef struct _foo {} foo;   foo *f = malloc(count * sizeof f);  foo *g = malloc(sizeof(foo) * count);   foo **ff = malloc(count * sizeof *ff);  foo **gg = malloc(sizeof(foo*) * count);   In my opinion, the first set is just a matter of style. But in the second pair of lines, the extra second * can easily be confused for a multiplication.


In Inception, why didn't Cobb just spin the totem in the real world to show Mal that she is finally back to reality so she wouldn't have killed herself?

In Inception, it was told that the totem's concept was invented by Mal.  Then why didn't Mal use her spinning top to find out if she is in a dream or not before jumping off the window?  Is it the case that she didn't remember that she has a totem?


$$\int_0^1\frac{1+x^4}{1+x^6}\,dx$$  Can anyone help me solve the question? I am struggling with this.

I'm trying to compute: $$\int_{0}^{1}\frac{x^4+1}{x^6+1}dx.$$  I tried to change $x^4$ into $t^2$ or $t$, but it didn't work for me.  Any suggestions?  Thanks!


I have a following problem: when I plug-in my USB flash drive, it isn't shown in Windows Explorer or recognized by system at all. In device properties, it is shown as:     USB MEMORY BAR     There's no partitions on the drive, so I can't format it:    DISKPART:     Virtual Disk Service error:   There is no media in the device.   HP USB format tool:     There is no media in the specified device.   Any help will be greatly appreciated! Thank You!

I have a 32 GB USB stick. I was in Mac (VMWare) putting some stuff on. Then accidentally removed the drive. I put it back in, and wanted to format it. Using disk utility, I chose 1 partition, it automatically filled in 312 GB and I just clicked format or whatever. It didn't take long, then I could see the progress bar hanging at "Waiting for device to reconnect". Nothing happened for a while so I ejected it. Now comes the problem:  In Disk Utility (Mac): No sign of the USB drive.  In Paragon Partition Manager (Windows): No sign of the USB drive.  In Disk Manager (Windows): I can see that it's there. But it says: Disk 1 Removable (D:) No Media. When I right click it, I can only assign drive letters to it. No way to format.  In diskpart (Windows): diskpart list will show me the following: Disk 1, Status: No Media, Total Size: 0 B. When I eject the drive, the disk 1 will disappear. So I know that it's this drive. If I type clean, it will say that "There is no media in the device".  In HDD Low Level Format Tool 4.25 (Windows): Doesn't detect it at all.  In Device Manager (Windows): It is detected as USB Mass Storage Device.  In Gparted (Linux): Doesn't detect it.  In HP USB Disk Storage Format Tool 2.1.8 (Windows): It detects device as: "GENERIC USB Mass Storage 1.00 (0 MB) (D:)". When I press Start it gives me this error: "There is no media in the specified device"  In BIOS: Detected  In Spinrite (Live Boot): Doesn't detect it  Any help is appreciated.


I found the following statement in  youtube lecture:     Let $A\subset \mathbb{R}^n$ be open and convex and let   $f:A\to\mathbb{R}^n$ be continuously differentiable vector field.      Then $f$ is conservative iff the Jacobian of $f$ is symmetric on $A$.   I couldn't find a citable reference for this (for $n\ne3$).  Does someone have one?  Update: I'm still looking for a citable reference.

I want to determine whether a certain n-dimensional, simply-connected vector field is conservative. I can very easily calculate its Jacobian in numerical form.  In 3 dimensions, the problem is easy: the Jacobian is a 3x3 matrix, and the curl can be obtained from its elements:  [jacobian[2,1] - jacobian[1,2],  jacobian[0,2] - jacobian[2,0],  jacobian[1,0] - jacobian[0,1]]  A curl of zero would mean that the vector field is conservative.  But what if my Jacobian has 100 elements? The curl is only defined for 3 dimensions, but is there a formula for some high-dimensional generalization?


A classmate sent me this question:  A high school student had the option to attend 5 AP classes. If we assume the probability of signing up for each class is constant, then the amount of AP courses a student would take is a random variable distributed as:  X ~ Binomial(n=5, p).  If we have a sample of 120 high school students denoted $X_1, ..., X_{120}$, what would be the maximum likelihood estimate of $p$?  We have this formula from our notes:  $L(p)=∏^n_{i=1}p^{x_i}(1−p)^{1−x_i}$.  However, he suggested maximizing the function $p^{x}(1−p)^{n−x}$ [here $x = \sum \limits_{i=1}^n x_i$], with $n=5$. Then we simply obtain that the maximum likelihood estimate as $p=\frac{x}{5}$. I feel that either I or the problem is missing some key information. Is this correct?

Assuming I need to find the ML estimator for p, p being the chance of success in a Binomial experiment $Bin(N,p)$, I would expect my density function to be:  $$ f(y) = {{N}\choose{y}} p^y(1-p)^{N-y} $$  And so my likelihood function should be:  $$L(p) = \prod_i^n(f(y_i)) =  \prod_i^n({{N}\choose{y_i}})p^{\sum_i^n y_i} (1-p)^{nN-\sum_i^n yi}$$  However, the last exponent, $nN-\sum yi$ seems to be wrong because when I derive the log likelihood and isolate $p$, I get $p = \frac{\sum_i^ny_i}{nN}$, while it should be $p = \frac{\sum_i^ny_i}{N}$. Indeed, when checking online, I find different exponents:   they have $N-\sum yi$, for no obvious reason to me (last time I checked, $\sum_i^n(N-y_i) = nN-\sum y_i$ !)   as well, but there they start from the likelihood function of a Bernoulli experiment. It makes sense that $\sum_i^n(1-y_i) = n-\sum y_i$, but what is more obscure to me is why they take the likelihood function of a Bernoulli while the problem is clearly about a Binomial. I am aware of the link between the two, but not enough to see why their likelihood functions seem to be substitutable to estimate p, especially since it doesn't give me the same result.


Is there a way to definitively tell what application is attempting to open a file on startup (if it is not in the Startup folder)?  For example, when I boot my PC, I see the following message:    My first step was of course to check the Startup folder. Nothing there (checked hidden files, too).  I've looked through MSCONFIG startup services and none of them are related to the filetype. I've run in Safe Mode and the file does not open, but that still doesn't tell me what is calling the file on startup.  I can open up task manager while the "Windows can't open this file" window is open, but that still doesn't tell me which of the running programs has called it.  I've even tried searching for the file in hopes of deleting it, but every search I've ran for it has turned up nothing.

I know that under Windows there are multiple ways to get an app to autostart but I can never remember what all of those ways are.  Is there a single unified way to bring up a list of all programs which are set to run themselves at startup and let me disable those I don't want?  I'd prefer something built into Windows. I have Windows 7 Starter. But a free / open source / shareware tool would also be acceptable.    (This time the software I want to prevent from autostarting is: MSN Messenger, Y! Messenger, and Vodaphone Mobile Broadband, which starts whether the dongle is inserted or not. None of these three are in Windows's "Startup" folder.)


If adding is the sum of two numbers, Subtraction is the removal of a number from another.   Multiplication is $x$ lots of $y$.   Division is splitting $x$ between $y$.   Powers are multiplying a value by itself.  What is a square root?  To be clear, I'm asking what function a square root actually performs?  I can't seem to come up with an answer without the concept of powers to refer to.  For example; how would you go about solving the square root of $121$ without prior knowledge that $11^2$ is $121$?  Is it as blind as testing every value up to or past an answer until we find a solution then doing bisection until we get a result?  Edit: I think my question was still unclear, how could I perform a square root on a value without reverse engineering the question into a powers question.  E.g. square root $123456$, you do not know if the root is whole or decimal.

Okay, I know this is very basic question. I learned 2 methods in school. But now, I forget one.   Here is a simple method that I know.   Find the prime divisors of the number Omit the half of numbers that have been appeared even times multiply the rest   For example you want to find square root of 36. You find the divisors. They are 2x2x3x3. In step 2 they appeared as 2x3. That is 6. Problem is this method works when the square root is an integer number. It doesn't work for numbers that doesn't have integer square root. Like 38.  So my question is how can I find the square root of any arbitrary number using pen and paper?


To my understanding, a model in Model Theory is an interpretation (in a form of a set or other algebraic structures) for a certain sentence S which makes S true.  In everyday language, and also in other branches of science (physics, computer science, biology, ...), model means a formal language used to give an abstract description of phenomena, highlighting only the details we care about for the current analysis.  So, how do these two concepts relate to each other? Since we use the same word, I figured that there may be a connection which could make my understanding of these concepts deeper. In particular, I wonder why we use the world "model" in the "common sense" instead of language, abstract language, formalism, etc.

A $\vDash $B can be read in words as:    A entails B B is a semantic consequence of A A models B   The first two are fine. But the third one seems a bit counter-intuitive to me. Somehow, I can't reconcile the term 'model' (used colloquially) with the notion of entailment or consequence.  Why do mathematicians and logicians use the term 'model' in such contexts? How is the term associated with the idea of entailment? And even more bizarre to me is the use of the $\vDash$ symbol in different contexts. For example, let A be an assignment, and F is an atomic formula. So that A $\vDash$ F (again, read as A 'models' F) means that A assigns a truth value of 1 to F. Again, this is counter-intuitive, and often had me wondering: "what is the underlying concept or idea behind it?"


Following on from the title, can someone suggest how to proceed with this one.  $$A=\begin{bmatrix}1&1\\4&1\end{bmatrix}$$  and  $$v = [4 \; 4]^T?$$

Let $A= \pmatrix{1&4\\ 3&2}$. Find $A^{1000}$.  Does this problem have to do with eigenvalues or is there another formula that is specific to 2x2 matrices?


I'm trying to mount this light on the exterior of a house, but it doesn't cover the hole like the existing lights do.  In some places there's an existing light that's mounted directly to a junction box, and in others, I'm installing a light for the first time.  How should a light like this be mounted in a way that's up to code and prevents water from entering the house?

I'm considering replacing an outdoor lighting fixture with an LED motion-sensitive fixture, but I'm not sure how to safely do the wiring.  The location is protected (under a porch) but still needs to be weatherproof. Here's the existing fixture and mount:    The obvious replacement would be another lamp that included its own box cover, so that its wiring would be covered and protected. But, the fixture I like doesn't include such a cover:    You can see it's meant to be screwed into the wall, but doesn't cover anything. The power cable ends with bare wires which are meant to be wire-nutted to the supply wiring, probably inside a junction box. But, how do I get the wire safely into the junction box while keeping things weatherproof?  One option would be to replace the lamp's power cable with one ending in a grounded plug, and install a weatherproof outlet box. But that's ugly and complex.  Are there weatherproof junction box covers that include provisions for sealed entry of cables?


I am trying to figure out why my Remove method is returning a NullPointerException. I have tested it against numerous scenarios and it seems to be working fine for the most part, but when I tested it against my professors code, I get a NullPointerException:  Against my Driver (this is the output):  List: Hamadi, Salisu, Galo, Ballo,  4 Replacing Galo with Abdullahi List: Hamadi, Salisu, Abdullahi, Ballo,  Removing Salisu from the list List: Hamadi, Abdullahi, Ballo,  List: 65, 21, 42,  Removing 65 from the list List: 21, 42,  List: 1, 3,  Removing 1 from the list List: 3,  List: 25, 3,    All works well until I test the code for my remove method (see below for the method) against my mentors code:  /** Remove a node at the specified index and return its data element.      * @param index The index of the element to remove      * @return The data element removed      * @throws IndexOutOfBoundsException If index is outside the bounds of the list      *       */     public E remove(int index)      {         // TODO: Implement this method         if (index < 0 || index >= size() || size() == 0) {              throw new IndexOutOfBoundsException("Nodes are not within the array");         }         int i = 0;         LLNode<E> currentNode = head.next;          while (i < size) {             if (i == index) {                      System.out.println("Removing " + currentNode.data + " from the list");                     currentNode.next.prev = currentNode.prev;                     currentNode.prev.next = currentNode.next;                      size--;                     return currentNode.data;              }             currentNode = currentNode.next;             i++;         }           return null;     }   Currently, the way I have implemented the removal of a node is to have the node that is being removedfor it's next node to point to the previous node of the removed node and vice versa.  Any input would be greatly appreciated on what I can do to further improve my remove method to prevent (and circumvent) any possible NullExceptionErrors. Thanks!

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?


Unfortunately, my passport had suffered water damage during my stay in the US because of which I had to apply and get a new one.   Since my old passport contains a valid US visa, the indian embassy stamped "Passport CANCELLED. Valid visa within this passport NOT CANCELLED" on the biographical information pages and sent back both the passports to my address. I'm supposed to carry both the old and new passport along with me whenever I travel in and out of the US.  Is there anything I should be worried about while re-entry? Please help with your suggestions.

I got my US B1 visa last month on my Indian passport. Someone in my family wrote a phone number on one of the blank page of my passport. As my passport is damaged now, can I travel with my current passport to US or I should apply for new passport? Also, will B1 visa be valid on old damaged passport if I get new passport?


Please do not mark this as a duplicate because I could not find any answers on the other pages   I dismissed him and told him to go to sanctuary while on the mission to destroy the institute i did this because I had Nick after i did this I could not find him anywhere and I'm on console so I cant use the moveto Command

I recently dismissed Dogmeat in favor of Codsworth, and I'm fairly sure I sent him to Sanctuary Hills. However, I've had a fairly detailed look around the place and I haven't found him yet. Does anyone know where he is?


Please, help! By pressing the button, parameter 0 is always transmitted.  MainActivity.class  this.listResult.setOnItemClickListener(new AdapterView.OnItemClickListener() {         @Override         public void onItemClick(AdapterView<?> parent, View view, int position, long id) {             dbResult.read(RssActivity.this);             RssData rssData = dbResult.select(id);             Toast.makeText(getBaseContext(), valueOf(id), Toast.LENGTH_SHORT).show();   DataBase  public class DBResult { ... SQLiteDatabase database;  public DBResult(Context context){     DBResult.ResultOpenHelper openHelper = new DBResult.ResultOpenHelper(context);     database = openHelper.getWritableDatabase(); } public long insert(RssData rssData) {     ContentValues cv = new ContentValues();     cv.put(RSS_NAME, rssData.getRssName());     cv.put(RSS_TITLE, rssData.getTitle());     cv.put(RSS_LINK, rssData.getLink());     cv.put(RSS_DESCRIPTION, rssData.getDescription());     return database.insert(TABLE_NAME, null, cv); } public int update(RssData rssData){     ... } public RssData select(long id){     Cursor cursor = database.query(TABLE_NAME,null, RSS_ID + " = ?", new String[]{String.valueOf(id)}, null, null, RSS_ID);     if (cursor.moveToFirst()){     String rssName = cursor.getString(NUM_RSS_NAME);     String title = cursor.getString(NUM_RSS_TITLE);     String link = cursor.getString(NUM_RSS_LINK);     String description = cursor.getString(NUM_RSS_DESCRIPTION);     new RssData (id, rssName, title, link, description);}     while (cursor.moveToNext());     return null; } ... private class ResultOpenHelper extends SQLiteOpenHelper {     public ResultOpenHelper(Context context) {         super(context, DATABASE_NAME, null, DATABASE_VERSION);     }     @Override     public void onCreate(SQLiteDatabase db) {         database=db;         String sql = "CREATE TABLE IF NOT EXISTS " + TABLE_NAME + " (" +                 RSS_ID + " INTEGER PRIMARY KEY AUTOINCREMENT, " +                 RSS_NAME + " TEXT, " +                 RSS_TITLE + " TEXT, " +                 RSS_DESCRIPTION + " TEXT, " +                 RSS_LINK + " TEXT ); ";         db.execSQL(sql);     }     ... }   What am I doing wrong? I need to get a link to open it in WebView.  ERROR: "on a null object reference"  I will be very grateful for any help!  Thank you in advance!


I've just downloaded Pokemon GO on my iPod 5 and it keeps telling me in the app "GPS signal not found." Does this mean that I can't play the game without the wi-fi at my house? Also I'm pretty sure that my iPod 5 doesn't have a GPS system built into it so does that mean I can't play Pokemon GO?  Because my iPod doesn't have mobile data does that mean I can't play it outside like I am supposed to?

Long story short, I have an iPod 5, and I've been excited for this game for about a year now. I keep getting a GPS signal not found. Can I play under wifi or some sort of cellular data?


Why "" not "two-elements Boolean algebra"? The number of elements (two) is plural, but the word "element" is singular. This looks like a discrepancy for me.

Why are year, pound and mile in the singular form in the phrases below?   five-year-old children  20 pound note 10 mile run   Is that because they're acting as adjectives, which are always invariable in English?  Is it incorrect to say...   five-years-old children? 20 pounds note? 10 miles run?


SE intentionally set up the whole account system so that each site is treated separately. Joining a specific SE site doesn't create an account on any other site. If you want to use multiple SE sites, you have to explicitly create accounts on each one.  This fragmentation has quite a few drawbacks, the main ones I encountered are the following:   Visting a site where you're not logged in means that you lose your personalized top bar, the most useful navigation mechanism and your notifications. You also see the big banner for new users, and a different frontpage there. Anyone using multiple SE sites, especially from multiple computers or devices will see the annoying "you've been automatically logged in" banner very often. That is just an annoying experience   The main reason that accounts are per site, and not SE-wide is that users might not want to be associated with a specific site they never participated in. That is a valid concern, but I don't think it is necessary to fragment the actual login system as far as currently implemented to meet this requirement. Being logged into SE, and being shown as having an account on a specific SE site should be entirely separated concepts.  The way I'd like the login system to work would be the following:   logging into any SE site would log me into all my SE sites at once. No more "you've been automatically logged in" banners visiting an SE site where I don't have an account would still appear to me as if I was logged in, with my personalized top bar (but "sign up" instead of my user name and avatar), and the frontpage for non-anonymous users.   These changes would hide the more annoying consequences of the fragmented account and login system, but still preserve the benefits. The system encourages me to visit other sites via the hot questions sidebar, eliminating some more friction in using multiple sites would be a good thing in my opinion.

I am wondering why a user who has SE accounts in several sites has to login to each site separately?   I understand the logic behind not creating a SE account on all SE sites and having separate sign-up procedure for each site.  But why am I required to login separately (or as is the case, I get logged in after I open a site and then asked to refresh page) into each page?  I also understand that one person may have different accounts across the SE sites.  What I am asking is why not login one account of a person into all the sites in which (s)he is a member of using that account?  This is not about 1. Signing up (at all) 2. Feature-request (maybe changed depending on answer)


My parents took me as five month old baby to the U.S. illegally. I lived there until I was 15 years old. It's been been 14 years since I left the U.S. What are they possibility of me getting a tourist visa??

I was born in Brazil and came to the United States at the age of 7, in 2007. I no longer need to live in the United States because I have found success in investing and no longer depend on having a job. I am going to buy property in my home country soon, but I have just turned 18.   Will I ever be able to return to the United States to see my friends and other family members? Even if it is a 30-day visa? And, if so, in the future, am I still eligible for the EB-5 visa? Will I be barred from entry?


On Meta, a lot of duplicate targets  are unanswered, so, while it's a duplicate it doesn't actually solve my problem.  Please could the text on meta be changed to "Yep, it's a duplicate" or "Oops, I made a boo boo".

This request was sparked . The vote to close as a duplicate on meta, in contrast to the main site, does not require for the duplicate to have an answer. Yet, the closure message still says:     This question has been asked before and already has an answer.    ...even when this is not the case. Perhaps we should either only show this particular sentence if there is indeed an answer, or remove this altogether for meta.   Note: I fear this might be a duplicate request, but I was unable to find one. (Not even one without an answer :) )


Prove If $S \subset R$ is a nonempty set, bounded from above, then for every $\epsilon >0$ there exists $ x\in S$ such that $(\sup S) - \epsilon < x \le \sup S$  How can I prove for this.. ?   I always use this proposition, but I dont know how to prove.

I'm suppose to prove the following...  Let $A$ be a nonempty subset of $\mathbb{R}$. If $\alpha = \sup A $ is finite show that for each $ \epsilon > 0 $ there is an $a \in A $ such that $\alpha - \epsilon < a\leq \alpha $.  This is what I have so far...  Proof: We claim that $\alpha = \sup A $   Then by definition of a supremum $\alpha $ is the least upper bound of set A  Thus $\forall a \in A$,  $a \leq \alpha$   Suppose $\epsilon > 0$   Then $\alpha - \epsilon < \alpha $.   Thus $\alpha - \epsilon < a\leq \alpha$.   I feel like I'm missing some step between my last and second to last step so what am I forgetting? Also is the rest of my proof right?


In my Google Webmaster Tools account, there is warnings about my site:      Some URLs listed in this sitemap have a high response time. This may indicate a problem with your server or with the content of the page.   They are particularly talking about the location.html page.  This page address has maps that are available. What do I need to do to fix this?

In my Google Webmaster Tools account, there are warnings about my site.     Some URLs listed in this sitemap have a high response time. This may indicate a problem with your server or with the content of the page.   What is the solution?


How can I (in R) test whether the given data set is normally distributed? I read s suggesting shapiro.test. Unfortunately, according to , the null-hypothesis is "data are normal".  I expect my data to be normal, hence I need a test whose null-hypothesis states "data are not normal" and with some level of certainty (e.g. 0.05) states that null-hypothesis doesn't hold.  What test should I use?

After taking a statistics course and then trying to help fellow students, I noticed one subject that inspires much head-desk banging is interpreting the results of statistical hypothesis tests.  It seems that students easily learn how to perform the calculations required by a given test but get hung up on interpreting the results.  Many computerized tools report test results in terms of "p values" or "t values".  How would you explain the following points to college students taking their first course in statistics:   What does a "p-value" mean in relation to the hypothesis being tested?  Are there cases when one should be looking for a high p-value or a low p-value? What is the relationship between a p-value and a t-value?


A function $f$ is said to satisfy Lipscitz condition on $D$ if there exists $M>0$ such that for every $x_1,x_2$ belonging to $D$ we have $$|f(x_1)-f(x_2)|\leq M|x_1-x_2|.$$ Now, what is the geometric interpretation of this thing? Does this mean that slope of chord joining any $2$ points on the curve $y=f(x)$ is bounded. Does this imply that derived function $f'$ of $f$ is bounded on $D$ (provided derivative exists on $D$)? Can it be understood with the help of diagram geometrically? I had heard some concept of double cone for this thing. Can someone explain that, too?

I'm trying to understand intuitively the notion of Lipschitz function.   I can't understand why bounded function doesn't imply Lipschitz function.   I need a counterexample or an intuitive idea to clarify my notion of Lipschitz function.  I need help  Thanks a lot


I sometimes hear British people say "We've got ~" just like "We've got an apple", instead of " We have an apple." And I wonder if British people use "We have ~" or not. Is this phrase used in conversations in daily life?

When do I use have and have got?  Are "I have the answer" and "I've got the answer" both correct?


How can one calculate the standard scores of the coefficient estimates given $(X'X)^{-1}, X'y$ and $\widehat{u'}\widehat{u}$. Where $(X'X)^{-1}$ is a $n \times n$ matrix, $X'y$  is a $n \times 1$ matrix, and $\widehat{u'}\widehat{u}$ is a scalar.

For my own understanding, I am interested in manually replicating the calculation of the standard errors of estimated coefficients as, for example, come with the output of the lm() function in R, but haven't been able to pin it down. What is the formula / implementation used?


My goal is to instead of buying 4 separate basic PCs (plus the obvious peripherals), buy just one fast PC and the peripherals.  I'm wondering if I can use a more powerful computer, say, one with core i7 and plenty of RAM, with 2 video cards (total of 4 monitor outputs) to run 4 or more virtual machines (WinXPs) so instead of having 4 individual machines, I'll be having just one. However, the catch is, is it possible to have a pair of mouse and keyboard + input/output audio for each of these virtual machines?

Let's say I have a PC with two monitors atached. I'm running e.g. Windows Vista natively, and start up a virtual Ubuntu PC. I change to fullscreen mode so that on one Monitor, I see my Windows Desktop, and on the other one, the Ubuntu Desktop. I can now use my mouse and Keybord for both of them.  This works fine, but I'd really like to connect a second mouse and a second keyboard to my physical PC, and do some configuration so that one set of input devices is used for Windows, and another set for the virtual Ubuntu. Then two persons could work at the same time, as if they were using two separate computers, although there is only one physical machine.  I'm currently using Sun VirtualBox and it has a feature to assign specific USB devices to the virtual machine. While this sometimes works for e.g. external disk drives, it never worked for mice and keyboards for me (yes, of course my input devices are attached via USB!).  I'd like to know a solution that works with VirtualBox, but any answer is appreciated, even if another virtualization software or some additional hardware was needed.


I am retrieving articles from my blog to my webiste from the mysqlDb. The articles are displayed just fine on the blog but on the website some characters such as ţ,ş,ă etc are replaced with a black square with a question mark inside . I have "UTF-8" set on my document the same as on the blog.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I'm currently practicing on a purposely flawed login page, where I have to change the value of a cookie to enter. The cookie is an encrypted and encoded form of a simple JSON string with fields "admin", "username", "password". The admin field is set to 0, and the user/pass fields accepts anything. To login, I have to change this ciphertext such that the admin field is set to 1 when decrypted.  The encryption function works like this:   A raw string is padded, then encrypted with AES-CBC and a random IV. Then, this cipher text appends the IV (concatenation; IV+cipher).  Then, this is Base64 encoded, and returned.   So, to decrypt, we simply decode it with Base64, and split the result so that the 16 first characters are the IV, and the remaining is the ciphertext.   Now, I want to know the ciphertext when one character of the plaintext is changed.   Specifically, in my example:  The following string is encrypted, appended to the IV, and encoded:  {"admin": 0, "username": "admin", "password": "admin"}  This apparently results in the encoded text (found in cookie):  yMqlNejXMclgcU5+wbL40RY/mvIMW+AvguoMvCv0NemhRYzWzs7EQ2DXpvwsGmFynGpNWNyotYBea+P3Z3XZIvMBoMzdMVb/FtWQ+GV/MmA=  I'd like to know what this encoded text / cookie looks like if the plaintext is changed to {"admin": 1, "username": "admin", "password": "admin"} (note, the 0 changed to 1). The username and password can be anything, only the "admin": 1 part is important.  It appears the key is fixed, but the IV is generated at random every time I try to logout and login again.  Is this possible? If so, how?  Thanks!

To perform a bit flipping attack, the previous block is modified by using XOR. This results in an altered plaintext. However, now the ciphertext of the previous block is altered, hence it will result in an invalid format. Am I correct or am I missing something?   For example, suppose I have the following plaintext name=jcconvenant;photo=picture.jpg;admin=false;colour=red;  and the correspoding ciphertext c26a5697689463d662f540e55e2a1ecef9c5df20133dfe49d6d3c369679a95ff4f4c5a490f530b2a2f25db40da64f1e9302724ce61b9a435e23f4d600252a143  Suppose we perform a bit flipping attack and get the following ciphertext c26a5697689463d662f540e55e2a1ecef9c5df20133dfe49d6c1d07071c495ff4f4c5a490f530b2a2f25db40da64f1e9302724ce61b9a435e23f4d600252a143  Then the resulting plaintext will still look corrupted.   ¶ä╚°  h8ì│►Nƒz│Ioé¤ßkü2KÀQiý4I@pg;admin=true;;colour=red;  Is there a way to perform bit flipping while still obtaining a valid plaintext?


I'm asking myself a question about how to warm my house up, and the efficiency of such a thing :  I live in a theater, and we got plenty of 1000W lighting fixture, mostly Tungsten incandescence things, like . According to my research on the web, the energy efficiency of those thing is  So, if I assume that the rest 95%+ is wasted on heating, that might means they are not far away from typical heaters. Bonus point is, it gives me some light.  But I'm not sure it really works that way.  So the question is : where is really all the wasted energy of a tungsten incandescence fixture really spend on ?

Everyone always talks about the efficiency of their appliances. I was wondering if everything was 100% efficient at heating its surroundings ?


I have used a Taiwan passport to go to my home country, Malaysia, for the past recent years and I am thinking of using my Malaysian passport to go to Malaysia again. Does it work?

I am a citizen of two different countries, and have two passports.  How should I use my passports when traveling?


I am very new to codding and am trying to make a game I can call my own. I don't undertand what the error means but here is my code:  import pgzrun import math import random  WIDTH = 800                       #5 HEIGHT = 600 CENTER_X = WIDTH/2 CENTER_Y = HEIGHT/2 CENTER = (CENTER_X, CENTER_Y) FONT_COLOR = (221, 160, 221)      #10 ozol = 0  game_over = False  ozolith = Actor("ozolith")        #15  def draw():     screen.clear()     ozolith.draw()     draw_counters(ozol)           #20  def place_ozolith():     ozolith.x = CENTER_X     ozolith.y = CENTER_Y                                   #25 def draw_counters(ozol):     screen.draw.text(str(ozol), fontsize=40, center=CENTER, color=FONT_COLOR)  def on_mouse_down(pos):     if ozolith.collidepoint(pos): #30         ozol += 1         place_ozolith     else:         quit()                                   #35 place_ozolith  pgzrun.go()   Here is the error message   Traceback (most recent call last):   File "C:\Program Files\Python38\python-games\GameCraft\GameCraft.py", line 38, in <module>     pgzrun.go()   File "C:\Program Files\Python38\lib\site-packages\pgzrun.py", line 31, in go     run_mod(mod)   File "C:\Program Files\Python38\lib\site-packages\pgzero\runner.py", line 113, in run_mod     PGZeroGame(mod).run()   File "C:\Program Files\Python38\lib\site-packages\pgzero\game.py", line 217, in run     self.mainloop()   File "C:\Program Files\Python38\lib\site-packages\pgzero\game.py", line 247, in mainloop     self.dispatch_event(event)   File "C:\Program Files\Python38\lib\site-packages\pgzero\game.py", line 172, in dispatch_event     handler(event)   File "C:\Program Files\Python38\lib\site-packages\pgzero\game.py", line 164, in new_handler     return handler(**prepped)   File "C:\Program Files\Python38\python-games\GameCraft\GameCraft.py", line 31, in on_mouse_down     ozol += 1 UnboundLocalError: local variable 'ozol' referenced before assignment   It happens once I click on the image which is stuck on the top left corner.

The following code works as expected in both Python 2.5 and 3.0:  a, b, c = (1, 2, 3)  print(a, b, c)  def test():     print(a)     print(b)     print(c)    # (A)     #c+=1       # (B) test()   However, when I uncomment line (B), I get an UnboundLocalError: 'c' not assigned at line (A). The values of a and b are printed correctly. This has me completely baffled for two reasons:   Why is there a runtime error thrown at line (A) because of a later statement on line (B)? Why are variables a and b printed as expected, while c raises an error?   The only explanation I can come up with is that a local variable c is created by the assignment c+=1, which takes precedent over the "global" variable c even before the local variable is created. Of course, it doesn't make sense for a variable to "steal" scope before it exists.  Could someone please explain this behavior?


What are the differences between new and +new in javascript something like this?  var myVar = new function()   and   var myVar = +new function()

I've seen this in a few   function fn() {     return +new Date; }   And I can see that it is returning a timestamp rather than a date object, but I can't find any documentation on what the plus sign is doing.  Can anyone explain?


I need some help with this because it is quite confusing for me please: Previous research has shown or Previous research has showed which one is correct?

In the summey of my physics paper, for a scientific journal, in the start of a new paragraph in the discussion, what is more correct to write?   "We have showed that" the system obeys this and that rules,   or:   "We have shown that"...   or simply:    "We showed that"...?   Thanks!


There is a theorem that states that every continuous function from a compact metric space to R is bounded however, the converse is not true, but I am not sure how to construct such a function. My idea is to start with a countable subcover that has no finite subcover. Since we can enumerate each subcover U1, U2, U3..., I was thinking of mapping each element in the subcover equal to its index, but I'm not sure if this function is continuous.

Suppose $(M,d)$ a metric space. I want to show that      If every continuous real-valued function on $M$ attains a maximum, then $(M, d)$ is compact.   I was trying to do this by assuming $M$ non-compact and showing explicitly a function which does not attain a maximum. If $M$ is not bounded it's enough to take the distance from a fixed point as we can always find a sequence which "exits" every compact and pushes the distance at infinity. But what if $M$ is bounded?


ex:subject type means g.k,english,maths etc... like that. my question is for preparing questionpapers by randomly selecting the questions of different questions  Can you please guide regarding this query....?

How can I request a random row (or as close to truly random as is possible) in pure SQL?


I have the following two analogous references  @article{ref1,   author = {Martí, R. and Laguna, M. and Glover, F. and Campos, V.},   journal = {European Journal},   number = 2,   pages = {450-459},   title = {yyyyyyyyyyyyyyyyyyyyyyyyyyyy},   volume = 135,   year = 2001 } @article{ref2,   author = {Lim, A. and Lin, J. and Rodrigues, B. and Xiao, F.},   journal = {Journal},   number = 2,   pages = {180-188},   title = {xxxxxxxxxxxxxxxxxx},   volume = 6,   year = {2006} }   When I make an in-text-citation, I get a different output style for them:  (Martí et al. 2001) (Lim; J. Lin; B. Rodrigues, et al. 2006)   I'd like to get the same citation style as produced with reference ref1.   I'm using biblatex package with some parameters  \usepackage[style=authoryear,backend=biber,maxbibnames=99]{biblatex}   The following are additional configurations of the template I'm using  \setlength{\bibitemsep}{\baselineskip} \addbibresource{thesis.bib} \AtBeginBibliography{\renewcommand*{\mkbibnamelast}[1]{\MakeUppercase{#1}}} \DeclareNameAlias{sortname}{last-first} \DeclareNameAlias{default}{last-first} \renewcommand*{\multinamedelim}{\addsemicolon\space} \renewcommand*{\finalnamedelim}{\addsemicolon\space}   Another reference of another work of "Lim, A." is  @article{ref3,     author="Lim, A. and Lin, J. and Xiao, F.",     title="zzzzzzzzzzzzzzzzzzzzz",     journal="Applied Intelligence",     year="2007",     volume="26",     number="3",     pages="175--182" }

I had been using bibtex and then biblatex for quite some time. For the newest edition of my book I moved to biber. I happened t notice that firstnames are sometimes generated and sometimes not. Has this been observed by others?   I have tried to make a minimal example but without success. Using the following code, which shows all the commands related to biblatex I have in my preamble I could not get the firstnames to be shown. Even with the stylefile I made for this book (second line) the error did not occur.  I have a dropbox with the latex files for the book available. I can give access to these.   What do you propose?  \documentclass[fontsize=10pt,twoside]{scrbook} \usepackage{hormonbuch} \usepackage[%   style=authoryear%   ,natbib=true%   ,sorting=nyt,backend=biber,doi=false,isbn=false,url=false]{biblatex} \addbibresource{../Literatur/EndokrinologieKundeNourl.bib}  \renewcommand*{\bibpagespunct}{\addcolon} \DeclareFieldFormat{pages}{#1}  \renewrobustcmd*{\enquote}{}  \renewbibmacro{in:}{%       Herbert Voss auf http://tex.stackexchange.com/questions/10682/suppress-in-biblatex   \ifentrytype{article}{}{%   \printtext{\bibstring{in}\intitlepunct}}}  \renewbibmacro*{journal+issuetitle}{%   \usebibmacro{journal}%   \setunit*{\addspace}%   \iffieldundef{series}     {}     {\newunit      \printfield{series}%      \setunit{\addspace}}%   \usebibmacro{volume+number+eid}% %  \setunit{\addspace}%   \newunit}  \renewbibmacro*{volume+number+eid}{%   \printfield{volume}% %  \setunit{\addcolon\space}%   }% % \renewbibmacro*{note+pages}{%   \printfield{pages}%   \newunit} % \begin{document}  \citet{CRT+88,FDe+85} \citep{CRT+88,FDe+85} \cite{CRT+88,FDe+85}  \printbibliography  \end{document}


On quote whenever user specifies Start Date and End Date we need to calculate Subscription Term which should be exact months, here it should say 12 months but its showing 11.96.      Can anyone please advise correction in formula or anyone having solution around it, so that I can calculate exact months between two dates(considering scenario of leap year in between) e.g if start date = 1 Jan 2000 and End Date = 15 Mar 2000 then it should show something like 2.5 months instead of 3.  Formula we are using right now is following :  IF(  IF( SBQQ__SubscriptionTerm__c > 0 , SBQQ__SubscriptionTerm__c , (( SBQQ__EndDate__c - SBQQ__StartDate__c) / 30.4375) )  = 0, 12, ( IF( SBQQ__SubscriptionTerm__c > 0 , SBQQ__SubscriptionTerm__c , (( SBQQ__EndDate__c - SBQQ__StartDate__c) / 30.4375) ) ))   The reason we need exact term because the price which is applicable to products is based on term and we can't round of term as it will then lead to incorrect pricing calculation.  If anyone having solution using APex too , then it is much appreciated.

My client wants me to write a formula field to return the duration(in months and days) between two date fields.  For ex:    If start date is "January 1st 2016" and end date as "December 31st 2016" then it should return value as "12". If start date is "January 1st 2016" and end date as "November 20th 2016" then it should return value as "11.67".   From the sample formulas given on the salesforce , I see that there is a formula date_1 — date_2 to calculate number of days between two dates.  But should I update the formula to (date_1 — date_2)/30 or (date_1 — date_2)/31 to get what I need?  Is this something really doable using formula or am I better off solving this using Apex?


Find all generators for the cyclic group $\bbmath Z_9 \times \bbmath Z_4?    I know I can use o(9,4)= 36 and all divisors of 36 are 1,2,3,4,6,9,12,18,36. This tells me that I will have subgroups of these orders.

A cyclic group is a group that is generated by a single element.  That means that there exists an element $g$, say, such that every other element of the group can be written as a power of $g$.  This element $g$ is the generator of the group.  Is that a correct explanation for what a cyclic group and a generator are? How can we find the generator of a cyclic group and how can we say how many generators should there be?


I know the proof that If A is compact and B closed then A+B is closed but would like to have an example where both are closed but not A+B.I am not able to figure out.

Is there a counterexample for the claim in the question subject, that a sum of two closed sets in $\mathbb R$ is closed? If not, how can we prove it?  (By sum of sets $X+Y$ I mean the set of all sums $x+y$ where $x$ is in $X$ and $y$ is in $Y$)  Thanks!


I am trying to install Ubuntu 16.04 on my laptop (Dell Inspiron 3180). I tried a live 18.04 USB first of all but it kept freezing after a few seconds, keypad or touch pad wouldn't work both when trying the installer and running live. Windows 10 was pre installed on the laptop  I made a 16.04.4 USB, when I tried this live, the touchpad wouldn't work, but I was able to navigate and use the keypad. I figured if I could complete the installation it would free up the USB slot for me to try a wired mouse which might work. I began the installation and everything worked until I received the error:     'grub-efi-amd64-signed' package failed to install into/ target/. without the grub boot loader....   I couldn't read the rest as the installation was trying to move on and the screen faded and powered down. When I restarted the PC it was running a hardware diagnostic.   Any ideas on what to try would be appreciated?   showing how I tried the installation step by step

When I'm  trying to install Ubuntu 18.04 on my desktop, it shows the following error:         The 'grub-efi-amd64-signed' package failed to install into /target/. Without the GRUB bootloader, the installed system will not boot.   How to fix this error?


I am using vim editor on Linux mint. I want to know if there is any way to compile c program without leaving the editor.

New to vim and and I want to be able to compile code from within vim without running a new terminal and calling the compiler.  How do I go about doing this? Note that this requirement is not restricted to gcc only, I sometimes need to call python also on the current script I am working on, so you get the idea...