verbatim environment does not work with beamer

I want my Java code to be typeset in a monospaced font, so I am using the verbatim environment. LaTeX commands are highlighted in Eclipse, but as soon as I use the verbatim environment everything inside and the color of the environment itself becomes gray.  \begin{verbatim}   public class main {  public static void main (string[] args){      for(int i = 0; i < arg.length; i ++){          System.out.println(args[i]);      }    }  };  \end{verbatim}   I'm using the verbatim and alltt packages.  Update 1.  MWE.  \documentclass[xcolor=dvipsnames]{beamer}  \mode<presentation> { \usetheme{CambridgeUS} \setbeamercovered{transparent} }  % Поддержка русского языка \RequirePackage[utf8]{inputenc} \RequirePackage[T2A]{fontenc} \RequirePackage[russian]{babel}  \RequirePackage{amsfonts}  \usepackage{algorithmic} \usepackage{mathptmx} \usepackage[scaled=.90]{helvet} \usepackage{courier} \usepackage{pst-node} \usepackage{pst-tree} \usepackage{auto-pst-pdf} \usepackage{color} \usepackage{colortbl} \usepackage{pstricks} \usepackage{verbatim} \usepackage{alltt} \usepackage{listings} \usepackage{animate} \usepackage{multimedia}  \title{Title}  \author{Name}  \institute{}  \date{\today}  \begin{document}  \begin{frame} \titlepage \end{frame}  \begin{frame} \frametitle{Outline} \tableofcontents \end{frame}  \section{Introduction}  \begin{frame}{Классификация по поколениям}  \begin{itemize}  \item Третьего поколения (высокоуровневые языки) - последовательность высокоуровневых конструкций (циклы, условные выражения, классы, интерфейсы, методы, процедуры, \ldots) \pause  \begin{exampleblock}{Пример}  \begin{centering}  Fortran, C, C++, C\#, Java, Lisp.  \begin{verbatim}  public class main { public statiс void main (string[] args){ for(int i = 0; i < arg.length; i ++){ System.out.println(args[i]); } } };  \end{verbatim}  \end{centering}  \end{exampleblock}\pause  \item Четвертого поколения (для конкретного применения) - последовательность инструкций конкретной предметной области \pause  \begin{exampleblock}{Пример} SQL, Postscript, XML, Mathlab. \end{exampleblock} \pause  \end{itemize}  \end{frame}  \end{document}


Tell MySQL to start using utf-8 encoding without `convert to`ing it

In a fairly unique situation, my team has ended up with UTF-8 bytes in a database that thinks the data is encoded as latin1.  At least, I'm 85% certain that this is the situation at hand.  For example, a  was handed to the database by  and just treated the data as raw bytes (0xE2 0x80 0x99). This data, as far as I can tell (how to verify?), was stored as those actual bytes. So now when the data is read out by a more intelligent programming language (Ruby 1.9), the database helpfully says , and so instead of "Mike’s", we end up with "Mikeâ€™s". This is also what I get in the mysql prompt when SELECTing that value.  So, essentially, we have a bunch of utf-8 encoded data stored in a database that thinks the data is encoded as latin1.  This makes me to somehow tell the database "No, no matter what you think, this stuff is actually utf-8". CONVERT TO doesn't seem like the right tool, because then I'll end up with permanent "Mikeâ€™s".    Failed/moronic attempt #1  I noticed this:  > SHOW VARIABLES WHERE Variable_name LIKE 'character\_set\_%' OR Variable_name LIKE 'collation%'; +--------------------------+-------------------+ | Variable_name            | Value             | +--------------------------+-------------------+ | character_set_client     | utf8              | | character_set_connection | utf8              | | character_set_database   | utf8              | | character_set_filesystem | binary            | | character_set_results    | utf8              | | character_set_server     | latin1            | | character_set_system     | utf8              | | collation_connection     | utf8_general_ci   | | collation_database       | utf8_unicode_ci   | | collation_server         | latin1_swedish_ci | +--------------------------+-------------------+   And thought that maybe changing character_set_results to latin1 would trick it into not doing any conversion of the bytes, resulting in the proper display of data on my utf8 OS.  Sure enough, SET character_set_results=latin1; results in ’ instead of â€™. Cool!  So I added this to my ~/.my.cnf (which is the only my.cnf, I checked):  [mysqld] ... character-set-results=latin1   and when I go back to the MySQL prompt & check the character_set_% variables, it's still utf8.  Yes, it just occurred to me that mysqld is a deamon, which means I probably need to restart the whole mysql process for this to take effect. But whoever installed MySQL on this machine used the dmg instead of the brew (wasn't me!) and the MySQL pref pane is currently telling me that MySQL isn't running even though it clearly is, and anyhow before I go down that rabbit hole, I want to check with an actual DBA and see how ridiculous this is, or if there's just a better, cleaner way to do it.


Taking more than 2.1A from a two-port "2X 5V / 2.1 A" USB powerbank?

I just bought a powerbank for intending of using it to power a Rasberry Pi4b But, it seems i did not do enough research regarding the requirements of the Pi model i have. The powerbank is listed as "2X 5V / 2.1 A" (it's got two usb outputs). (while the Pi in question appears to need recommended ~3A)    So, i'm thinking, rather than try to return it; I could either fashion a custom USB cable, out of- or similar to, the  powering certain (older) external harddrives, having the Pi plugged into both of the USB outlets. Or, mod the powerbanks output, in the same way (removing one of the outputs) But, i am a bit puzzled if i'm even reading "2X 5V / 2.1 A" correctly, as to mean those are two ports able of 2.1A each ? ..Or, if that is commonly the total given in such spec. listings ? below is the powerbank specs from (Norwegian) manual if anyone's curious.


Where is the evidence that the electron is pointlike?

I'm writing a piece about the electron, and I'm having trouble finding evidence to back up the claim that the evidence is pointlike.   People  the observation of a single electron in a Penning trap shows the upper limit of the particle's radius to be 10-22 meters. But when you look at Hans Demelt’s  you read about an extrapolation from the measured g value, which relies upon "a plausible relation given by Brodsky and Drell (1980) for the simplest composite theoretical model of the electron". This extroplation yields an electron radius of R ≈ 10-20 cm, but it isn't a measurement. Especially when "the electron forms a 1 μm long wave packet, 30 nm in diameter".    It's similar when you look at  by Brodsky and Drell. You can read things like this: "If the electron or muon is in fact a composite system, it is very different from the familiar picture of a bound state formed of elementary constituents since it must be simultaneously light in mass and small in spatial extension". The conclusion effectively says if an electron is composite it must be small. But there's no actual evidence for a pointlike electron.   Can anybody point me at some evidence that the electron is pointlike?


For pashupatinath darshan kathmandu by flight return

I m a citizen of india..I want to go pashupatinath darshan kathmandu by flight with my family and return from there by flight I don't have a passport ..I have a driving licence (maharashtra) And pan card ,adhaar card also have..my wife's have aadhar card and pan card ..my child's aadhar card and school id..4 years old My father's age 74 they have voter ID card and aadhar card pan card..my mother 55 also have voter ID and aadhar card pan card Can I travel to pashupatinath mandir.kathmandu by flight in April..


I'm having a hard time to parse this PHP to JSON kan someone help me with this how can I convert this PHP into JSON  $query = "SELECT SUM(total)  FROM account"; $result = mysql_query($query);  while($row = mysql_fetch_assoc($result)) { echo $row['SUM(total)']; }


Our ability to store data on or in physical media continues to grow, with the maximum amount a data you can store in a given volume increasing exponentially from year to year. Storage devices continue to get smaller and their capacity gets bigger.   This can't continue forever, though, I would imagine. "Things" can only get so small; but what about information? How small can a single bit of information be?  Put another way: given a limited physical space -- say 1 cubic centimeter -- and without assuming more dimensions than we currently have access to, what is the maximum amount of information that can be stored in that space? At what point does the exponential growth of storage density come to such a conclusive and final halt that we have no reason to even attempt to increase it further?


First of all, there's no firmware password or anything fancy. I'm trying to diagnose a late-2011 MacBook Pro 15", and I'm trying to get into the single user mode. I press and hold Cmd+S (the left Cmd, if it changes anything) but I'm not getting into the mode. I've tried pressing (and holding) it before pressing the power button, at the same time, a little after etc. I've tried all the combinations. It just won't enter. It will keep booting or let's say (try booting) into the OS where it gets stuck. When I press Cmd+S, however, I can see a very brief terminal in the middle for a very short/split second, and it disappears as I haven't pressed it all. What am I doing wrong?  UPDATE: I've tried Cmd+S on another 15" MacBook Pro from 2011, and it behaves the same: It just won't let me into recovery mode. They are both Yosemite, one is 10.10.3, and I can't tell the other one's minor version since I can't boot into the system in any way (and it's owner doesn't know the version either).  UPDATE 2: As Buscar웃 asked me about the verbose mode process, I took a video of booting into verbose mode:   UPDATE 3: Here's a GIF version of the video. I had to reduce quality and size a lot, but you'd get the general idea:


I have a rectangular box where I want to add bevels to the four edges of the sides only.  I always get bevels on all edges. How do I restrice bevels to selected edges?  I'm just learning so need details. Thanks.


Two possible directions of the B field in relation to the E field in radio waves. How induce the left-handed direction?

In vacuum the two field components of a radio wave are directed perpendicular on each over. $\mathbf{E}$, $\mathbf{B}$ and $\mathbf{k}$ form a right hand system ($\mathbf{k}$ is the direction of propagation).      This matches the right hand rule for a current carrying wire and the induces magnetic field around the wire.  Now, for the reasons of symmetry, a radio wave also could be drawn with $\mathbf{E}$, $\mathbf{-B}$ and $\mathbf{k}$. Aplicated to the image above, the green fieldlines (which showing the direction of the magnetic field) simply would show in the opposite direction. How induce a left hand radio wave?


Var(XY), if X and Y are independent random variables

if X and Y are independent Random variable then what is the variance of XY?


haw to optimize structure mapping on the memory

i have a structure declared like th following :  struct myStruct {     char c;     int i;     float f[2]; };   the sizeof gives 16, where the sizes of types are 4, 4, 1. my question is why the sizeof does not give 13?.. should I modify somthing to have the right size?


Doubly linked list removing first element

I'm pretty new to java, and my doubly linked list addFront method and addRear method works fine, but only dequeue method doesn't works. In the main method, I making a test to remove front element using dequeueFront ()method, when I  remove front element it works, but If I continued  removing front element,   Exception in thread "main" java.lang.NullPointerException     at DoublyLinkedDeque.dequeueFront(DoublyLinkedDeque.java:97)   comes out,  Line97 is the frontNode.previous=null  I just wondering how to remove front element form the double linked list properly.  public E dequeueFront() throws NoSuchElementException  {     if(frontNode!=null)     {         E frontElement=frontNode.element;         frontNode=frontNode.next;         frontNode.previous=null;         frontNode.next=null;         numElement--;         if(numElement==0)             rearNode=null;         return frontElement;     }     else         throw new NoSuchElementException(); }


How to prove that $\sum_{i<j}(X_i-X_j)^2=n\sum_{i=1}^{n}(X_i-\bar{X})^2$

In a example about U-statistics, $h(x_1,x_2)=\frac 12(x_1-x_2)^2$, then $$U_n=\frac{2}{n(n-1)}\sum_{i<j}\frac{(X_i-X_j)^2}{2}=\frac{1}{n-1}\sum_{i=1}^{n}(X_i-\bar{X})^2$$ I don't know how to prove it completely.


Can a ratio of random variables be normal?

For a pair of random variables $Y$ and $Z$, is it possible that their ratio $X:=\frac{Y}{Z}$ is (exactly, not asymptotically) normally distributed? If so, could you offer an example of the distributions of $Y$ and $Z$ and the relationship between them (besides the obvious case where $Y$ is normal and $Z$ is a constant, as suggested by @gunes)?  P.S. A special case of my question has been answered here: . My question is more general than that.


How do I call a vba function within the same module?

I wrote 3 functions CellAbove takes a cell and returns the cell above CellAboveValueV1 takes a cell and returns the string value of the above cell using .offset(-1,0) CellAboveValueV2 uses CellAbove to return the string value of the above cell Here's what my code looks like: Function CellAbove(r As Range) As Range     CellAbove = r.Offset(-1, 0) End Function  Function CellAboveValueV1(r As Range) As String     CellAboveValueV1 = r.Offset(-1, 0).Value End Function  Function CellAboveValueV2(r As Range) As String     CellAboveValueV2 = CellAbove(r).Value End Function  But when I test this functions with the excel data below, v1 function works, but the v2 function doesn't. What am I missing? data  | V1(data) | v2(data) ---------------------------- row 1 | data     | #VALUE! row 2 | row 1    | #VALUE! row 3 | row 2    | #VALUE!


I have a dataset with categorical features. I want to segment the data using clustering techniques. What could be the possible choices for this scenariogiven the fact that data has categorical features. Is there any variation of k-means which can be used here.


How to sort possibly alphanumeric array in Java?

A sample dataset would be:  ArrayList<String> a = new ArrayList<String>();     a.add("5");     a.add("10.5a");     a.add("4");     a.add("4c");     a.add("4a");     a.add("10.6a");     a.add("3");   I'm looking for the output to be in the format of [3, 4, 4a, 4c, 5, 10.5a, 10.6a].  Java's sorting function (Collections.sort(a);) sorts the data set to [10.5a, 10.6a, 3, 4, 4a, 4c, 5].  So, I need a way to split the value of the number from the letter, and sort first by number(4 before 10) then by letter with a number coming before a number-letter (4 before 4a).  The main way this is different from other questions on stackoverflow is that there is no separator between the numeric and alphabetic characters- the strings cannot be split at a specific character.  The  returns [3, 4, 4a, 4c, 5, 10.6a, 10a, 10b]- the 10.6a should come after 10a.  Solved  In the first few lines, change the first int from 48 to 46, which accepts the "-" and "." characters as digits when separating the numbers from letters. It also makes it so numbers can now have decimals and be negative with the caveat that if your data uses .'s or -'s as non-numerical characters it will mess up the results.  public class AlphanumComparator implements Comparator<String> {     private final boolean isDigit(char ch)     {         return ch >= 46 && ch <= 57;


prove that $\frac{a^3}{bc}+\frac{b^3}{ca}+\frac{c^3}{ab}\geq a+b+c$

If $a,b,c>0$, Then prove that $$\frac{a^3}{bc}+\frac{b^3}{ca}+\frac{c^3}{ab}\geq a+b+c$$   $\bf{My\; Try::}$ Using Cauchy- Schwarz Inequality  $$\frac{a^4}{abc}+\frac{b^4}{abc}+\frac{c^4}{abc}\geq \frac{a^2+b^2+c^2}{3abc}$$  Now How can i solve after that , Help required, Thanks


Why are First Order Stormtroopers not clones anymore?

In Episode II, they showed that stormtroopers were a request from Sifo-Dyas to create the clone army based on Jango Fett.  Why are the clones not being used in the First Order?


We all know that $0.99999...=1$  So does that imply $[0.99999...]=1?$  Or do we consider it as $0?$  My doubt is: any gif of the form $[0.xyz...]=0$. If $[0.99999...]=1$ won't that be contradicting?   There isn't much clear explanation in the previous post.  Here $[.]$ is the greatest integer function. I couldn't find a post containing this query on MSE. Please help :)


I have Ubuntu desktop installed and trying to set up Plex I want to put the media on a separate drive this is where I'm having trouble

I have ubuntu installed, I originally only had an SSD to install the OS on, now I want to add 1 and later 2-3 more regular HDDs. I am not sure if I did the first try right, I connected it and formatted it EXt4 and it shows that it is "mounted" and is a "device" the area I think I want it to be in is called places. how can I move it. my goal is to use this 2TB HDD and 1 or 2 others for media and keep the SSD for the OS and essential programs. When I go to the folder my media is in, it doesn't show but if I move it to videos under the place home it does show. What if anything can I do?


I am trying to install libsystemd-dev using apt-get on Ubuntu 14.04. While executing this, I get the following error:   **Installing pre-install packages .... Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package libsystemd-dev**   I have already tried using apt-get update, but no luck.   I searched for libsystemd-dev , and it's available for , but I am using trusty. Is there a way to get a package installed from another distribution?


Permanent magnet's magnetic field arises due to the magnetic dipole moment of the electrons inside the magnet?

THIS QUESTION IS NOT A DUPLICATE OF THIS:   Because that question asks about the cause of the magnetic dipole moment of an electron.  This question is asking about what causes the permanent magnet's fields to arise.  The two might be related (however even that is not trivial) but the cause of the two is different at the QM level and any answer to the other question will not answer this one.  I have read these questions:  Now here is a question where on of the answers state that the magnetic fields arise because of spin.    Where Pieter's answer says:     The magnetization of for example an iron magnet is almost completely due to the spin moment of the electrons. I have not checked OP's expression, but the field outside a magnet should be the integral over all those electrons.    And there is another question where the answer says that it is caused by the magnetic dipole moment of the electrons.    where DavidZ's answer says:     As with the electric dipole, a magnetic dipole of any sort will generate a magnetic field.   So one question says the magnetic field of a permanent magnet arises because of the intrinsic spin of the electrons inside the magnet.   The other one says the magnetic field of a permanent magnet arises because of the magnetic dipole moment of the electrons in the magnet.  I understand that the magnetic dipole moment and the spin of the electron are related.  But the two answers say different things, because the electron's spin is (though related) not the same as it's magnetic dipole moment.  My question is at the QM level and I am trying to find out whether the permanent magnet's fields arise because of    the electron's spin  the electron's magnetic dipole moment   Question:   Which one is right, does the magnetic field of the permanent magnet arise because of the electrons' spin or because of the electrons' magnetic dipole moment?


Show that $S=\mathbb R^2\setminus\{(a,b):a,b\in\mathbb Q\}$ is path connected.   By definition of path connected, there should exist continuous mapping $f:[0,1]\rightarrow \mathbb R^2$ s.t. $f(0)=a,f(1)=b$ for all $a,b\in\mathbb R^2$. I have utterly no idea how to find such map. Please help.


I am making a profile card and I made div(.pic) in div(.profile-card) to let user show their profile photo. and i found weird margin at the right of the .pic Do you know why?   body {   height: 100vh;   background-color: #40407a;   padding: 0;   margin: 0;   display: flex;   flex-direction: row;   justify-content: center;   align-items: center; }  .profile-card {   background-color: #2c2c54;   display: inline-block;   padding: 30px 40px;   text-align: center; }  .pic {   width: 50px;   height: 50px;   border: 1px solid #33d9b2;   border-radius: 50%; } <!DOCTYPE html>      <meta charset="UTF-8">   <meta name="viewport" content="width=device-width, initial-scale=1.0">   <title>Document</title>   <link rel="stylesheet" href="style.css">

       Name here


What happens if my armor/weapon proficiencies from my race and class overlap?

I'm a new D&D 5e player and I'm making a character using both the players handbook and the new Mordenkainen’s Tome of Foes book. I was wanting to create a Githyanki Fighter.  I noticed that the fighter class give proficiency to all simple and martial weapons and all armor, while the githyanki race feature "Martial Prodigy" has proficient with light and medium armor and with shortswords, longswords, and greatswords.  Do I double the proficiency of these weapons and armors or what exactly would happen in this case? Do they stack somehow or are they redundant?


Proving a distance between molecules defines a metric space.

A DNA molecule can be represented as a string of symbols $A$, $C$, $G$ and $T$, such as  $$GGATAATTCTAG. . .GACCGTACCC$$ For the purposes of this question, we will assume that all DNA molecules contain the same (large!) number $N$ of symbols. Thus, a DNA molecule is an $N$-tuple $x = (x_1, . . . , x_N)$ where $x_i  ∈ \{A,C,G,T\}$ for each $i$.  Define the distance between two DNA molecules $x$, $y$ as the number of elements $i ∈ {1, . . . ,N}$ such that $x_i \neq y_i$. Prove that this defines a metric on the set of DNA molecules.


Stochastic Processes Book Recommendations

I'm studying electronic communications engineering, specifically, signal processing, and I always find difficulty when studying stochastic processes subject.   Could you recommend me a student-friendly stochastic processes book that covers fundamentals of stochastic processes for electronic engineering studies?     I've approximately one semester to study for this then I'll take Stochastic Signal Processing lecture which is built on this fundamentals and continue with estimation theory.   I have Probability, Random Variables, and Stochastic Processes, Papoulis 3rd edition book but I didn't find it very helpful. Is newer versions are better?  I'll do a self-study so I'm looking for the book which explains topics clearly. Also, if you have, related video lecture recommendations may be very helpful.  This lecture is very fundamental for my studies so I want to grab a well understanding on this subject.  Thanks


How to getSdk Directory in android Studio through code ? i

I am using this approach but it is giving null pointer Exception is there any other way to do that ? private BaseExtension android; StringBuilder str=new StringBuilder();          File file = this.android.getSdkDirectory();         Intrinsics.checkExpressionValueIsNotNull(file, "android.sdkDirectory");         String androidJar = str.append(file.getAbsolutePath()).append("/platforms/")                 .append(this.android.getCompileSdkVersion())                 .append("/android.jar").toString();


How to remove a folder that starts with “$”?

I created a directory named "$pattern" and now when ever i try to remove it, it says      pattern: Undefined variable.   I have tried:  $ rm -r $pattern $ rm -rf $pattern $ rm "$ option[value='2016']"


Why I can't do a let with decimals in a shell? What is a BC?

I'm trying to do this in Ubuntu virtualbox with a shell text:  #!/bin/bash  n1=3.5 n2=3.6 n3=3.7 n=3 let promedio=n1+n2+n3/3 echo $promedio   is about the Average student grade. But then the terminal shows the error:   line 7: let: 3.5: syntax error: invalid arithmetic operator (error token is ".5")   Why? I can't do the + with numbers. What can I do?  I was reading about BC command but I don't know where it goes.  EDIT: I tried adding | BC at the end but is the same error. Also I tried looking at a post about this but they use something different I really don't understand because I'm really new with Ubuntu. They use the $echo or something like that but the code I'm using is different.


Python: The opposite of `datetime.date.isocalendar()`

The datetime module provides a method date.isocalendar that, given a date, returns it in the format ([year], [week], [weekday]). How do I go backwards? Given a ([year], [week], [weekday]) tuple, how can I get a date object?


Show that $a^n \mid b^n$ implies $a \mid b$

I would like to show that $a^n \mid b^n$ implies $a \mid b$  I thought I could convert it to congruences and work backwards, but as far as I remember, $a \equiv b \pmod{m}$ implies $a^n \equiv b^n \pmod{m}$, not the opposite, unless $m$ is prime. Is that right?  So I am not sure how to approach this one. Any ideas?  Thanks!


How to tell what the super() MRO next-in-line order is?

how do I know which path exactly super() is going to take in the MRO?


Casting to Int returns different value than FloorToInt for positive number in c#

[Edit] I rewrote the whole example as told by the comments.     float value = 0.52631580f;      float sum = 0;     for (int i = 0; i < 10; i++)     {         float division = sum / value;         int result = (int)division;          Console.WriteLine(division.ToString("0.00000") + " - " + result.ToString("0.00000"));         sum += value;     }  The results are not the ones expected: 0,00000 - 0,00000 1,00000 - 1,00000 2,00000 - 2,00000 3,00000 - 3,00000 4,00000 - 4,00000 5,00000 - 5,00000 6,00000 - 5,00000 <---- It should be 6 7,00000 - 7,00000  If I do it manually,  (int)6.00000000000f  <-- Returns 6, of course. How is that possible?


NodeJS write or delete cookies on a specific route

I have to do an app for the university ( and I'm not allowed to use express or other similar modules ) and I was wondering how do you specify the route on which you write a cookie. Why ?  So far I've noticed that cookies are stored mainly on domains, but if u set a cookie on localhost:3000/ the cookie will be on the subroutes too, however if you set a cookie on localhost:3000/someroute, then that cookie won't be on "/" .      So how do you set a cookie on "/" when you are on "/someRoute" and as   well how can you delete a cookie ?   This is how I've been writing on cookies so far  res.writeHead(302, { 'Set-Cookie': 'session='+sessionID });         Please Note that I ask how you edit those cookies on specific routes, and not how they work


DMG & Errata conflicting ruling clarification / What is defined as Use an Object?

If the DMG states you cannot use Fast Hands with any item that requires an action to activate, but this Errata states you can use Healers Kit with fast hands WHICH requires an action, who am I supposed to listen to?  Also, What is defined as Use an Object?     Activating some magic items requires a   user to do something special, such as holding the item and uttering a   command word. The description of each item category or individual item   details how an item is activated. Certain items use one or more of the   following rules for their activation.       If an item requires an action to activate, that action isn't a   function of the Use an Item action, so a feature such as the rogue's   Fast Hands can't be used to activate the item. (DMG PG 141 "ACTIVATING AN ITEM")        Can a thief use the Fast Hands feature to activate a magic item? No.   One of the benefits of Fast Hands is being able to take the Use an   Object action as a bonus action, but using a magic item doesn’t fall   under Use an Object, as explained in the Dungeon Master’s Guide (p.   141). In contrast, using a nonmagical item, such as a healer’s kit, is   in the domain of Use an Object. ()


I don't think this is quite the same questions as  but if you disagree feel free to close this :)  With SteamOS being announced yesterday I can see that it's entirely possible that opengl will get a big boost in usage in the near future. Now I already know direct3d11 quite well but I think maybe it's time to learn opengl too.  Are there any good resource for learning modern opengl that are aimed at programmers who already know direct3d11 pretty well. So don't need any education on the concepts and math, just on how to use the API and any important differences?


Why autocorrelation of data lead to the lower estimation of standard error for coefficient?

The problem is from [ISLR][1] Problem 5.R.R2. The data is .     Consider the linear regression model of $y$ on $X_1$ and $X_2$. Next, plot the data using matplot(Xy,type="l"). Which of the following do you think is most likely given what you see?   The answer is:       Our estimate of $s.e.(\beta^1$) is too low.   The explanation is:     There is very strong autocorrelation between consecutive rows of the data matrix. Roughly speaking, we have about 10-20 repeats of every data point, so the sample size is in effect much smaller than the number of rows (1000 in this case).   But I could not understand it... According to my opinion, , the denominator of this equation (that used to calculate the estimation of standard error for coefficient) indicates no difference whether xi sequence is autocorrelated or not.


I voted to close a question as unclear but then I realized that the question was too broad instead.   Is there a way to change my close reason because if I retract the close vote, I won't be able to vote to close again?


How are "might" and "may" used in the past?

OK, we all know that epistemic modals such as may and might can be interchanged to express possibility in present & future   For example: he might be late, and he may be late are almost the same.   But might is also the past form of may in indirect speech:  For example: He said he might be late = He said "I may be late"  I had some feeling that people lived 100 or 200 or 300 years ago may have used may and might differently from what we are using nowadays.  I would guess, in the past, ‘he might be late’ means ‘it was possible that he is late’ and  ‘he may be late’ means ‘it is possible that he is late’ The word might expresses it was possible and may expresses it is possible, but I may be wrong.    I found this information in     The book says:  "something might happen" in the past (maybe 1000 or 200 or longer time ago) (might + inf) is equivalent to "something might / may have happened" (might / may + have +PP) in Modern English.  Q: So, how were might and may used in the past?


A better class to update property files?

Though java.util.properties allows reading and writing properties file, the writing does not preserve the formatting. Not surprising, because it is not tied to the property file.  Is there a PropertyFile class out there -- or some such -- that preserves comments and blank lines and updates property values in place?


How to start deb package after install automatically

I can install deb package via my repository as follow   $ sudo apt install my_app   then the package manager will fetch my_app and installed. But I have to start it manually.   My aim is when I installed an app that should run without any further action like any native deb packages  i.e   $sudo apt install syslog-ng   installed.   $ sudo service --status-all  [+] syslog-ng   PS: Sure I can manually create service, but this is what I try to automate.


Is the axiom of choice necessary for "a set is open iff it is a neighborhood of all its points"?

Note: by neighborhood of $x$ we mean a set $N$ s.t. there exists open $U$ s.t. $x \in U \subseteq N$.   We only care about the "if" as the "only if" is trivial. The usual proof goes as follows. Suppose $U$ if a neighborhood of all its points, i.e. $\forall x\in U \exists V_x$ open s.t. $x \in V_x \subseteq U$. Then $\bigcup_{x \in U} V_x = U$ (as is easy to check) and hence $U$ is open as the union of open sets. The point that I think we need choice is in taking the union $\bigcup_{x \in U} V_x$ as we are effectively doing an arbitrary amount of existential instantiation to construct a function $x \mapsto V_x$ where $V_x$ is some such set (where we proved there exists at least one such) s.t. $x \in V_x \subseteq U$ and it is open.  As I am writing this, I feel like there is a way to eliminate choice from the proof. Here's my attempt. Suppose $U$ is a neighborhood of all its points. Denote the topology (i.e. the set of open sets) by $T$. Let $W = \{V \in T \mid V \subseteq U\}$. Let $A = \cup W$. Then as a union of open sets, $A$ is open. Claim: $A = U$. Well clearly $A \subseteq U$. Let $x \in U$. Then by assumption there exists an open set $B$ s.t. $x\in B \subseteq U$. Then $B \in W$ so $B \subseteq A$. Hence $x \in A$. Thus $U \subseteq A$ and hence $U = A$.  Am I correct that the usual proof implicitly uses choice but my proof doesn't? In my classes, every so often someone will make a big deal that a certain theorem relies on choice (e.g. Tychonoff or Hahn-Banach) yet it seems that people are throwing around choice all the time implicitly.


I'm trying to store a Set of enums into database using hibernate.  The enum is something like  public enum SomeEnum {      ITEM,     ITEM2, }   And I have a Hibernate model entity like this  @Entity public class TableObject implements BaseObject {  private Long id; private Set<SomeEnum> someEnumSet;  @Column(name = "TABLE_COLUMN", nullable = true, insertable = true, updatable = true) @ElementCollection public Set<SomeEnum> getSectionSet() {     return sectionSet; }  public void setSectionSet(Set<SomeEnum> sectionSet) {     this.sectionSet = sectionSet; } }   And I don't think @ElementCollection annotation is correct. 'TABLE_COLUMN' column is of type CLOB in the DB. (Oracle).  Thanks, Alex.


LinqToSql .Contains and nvarchar vs varchar parameters -> index conversion plan

I have a just one table mapped in a datacontext.  Here's the property and attribute on the column of interest:  [Column(Storage="_CustomerNumber", DbType="VarChar(25)")] public string CustomerNumber {   This column is, in fact, a varchar(25) and has an index.  I've got some simple code:  DataClasses1DataContext myDC = new DataClasses1DataContext(); myDC.Log = Console.Out;  List<string> myList = new List<string>() { "111", "222", "333" }; myDC.Customers     .Where(c => myList.Contains(c.CustomerNumber))     .ToList();   Which generates this SQL text:  SELECT [t0].[CustomerNumber], [t0].[CustomerName] FROM [dbo].[Customers] AS [t0] WHERE [t0].[CustomerNumber] IN (@p0, @p1, @p2) -- @p0: Input NVarChar (Size = 3; Prec = 0; Scale = 0) [111] -- @p1: Input NVarChar (Size = 3; Prec = 0; Scale = 0) [222] -- @p2: Input NVarChar (Size = 3; Prec = 0; Scale = 0) [333] -- Context: SqlProvider(Sql2005) Model: AttributedMetaModel Build: 3.5.21022.8   Notice that the paramaters are nvarchar!  When this query hits the database, it generates a horrible plan which involves converting the multi-million row index on CustomerNumber to nvarchar before seeking within it.  I'm not allowed to change the table, but I can change the query and the dbml.  What can I do to get the data out without getting this index conversion?


Is a php file with SGID bit and read-only & execute a security problem?

I find php files with SGID bit and read-only & execute. The group is root. Is this a problem?  Because a user will need to run the php interpreter with their our account, could it led to privilege escalation?   Like, the user www-data runing php as www-data and call the file with SGID bit, could he became root?  php path/to/file.php


Formal language: Proving the reverse operation on a word through induction

I'm practicing proofs and given the following statement:  Let $\Sigma$ be an alphabet, $\epsilon$ the empty word and $\sigma:\Sigma^{*}\rightarrow\Sigma^{*}$ an operation which for $a\in\Sigma$ and $w\in\Sigma^{*}$ is defined as $$\sigma(\epsilon)=\epsilon,\\\sigma(wa)=a\sigma(w).$$  I would like to prove through induction that $\sigma$ is equal to the word reversal operation $rev$ meaning that $\sigma(w)=rev(w)=w_{n}...w_{1}$ for every $w=w_{1}...w_{n}\in\Sigma^{*}$.  My suggestion is as follows:  For $w=\epsilon$ we have $$\sigma(w)=\sigma(\epsilon)=\epsilon=rev(\epsilon)=rev(w).$$  Let $w=xa$ with $x\in\Sigma^{*}$ and $a\in\Sigma$, then $$\sigma(x)=x_{n}...x_{1}=rev(x).$$  Thus we also have $$\sigma(w)=\sigma(xa)=\sigma(x_{1}...x_{n}a)=a\sigma(x_{1}...x_{n})=ax_{n}\sigma(x_{1}...x_{n-1})=...=ax_n...x_{1}=rev(x_{1}...x_{n}a)=rev(xa)=rev(w).$$  Does that constitute a correct and sufficient proof? If not, I would very much appreciate your feedback.


Determining sample size when given Confidence Interval and margin of error in a finite population

I'm trying to determine n, the sample size.  We have $N=580$ and we want to estimate population proportion, $p$, at a 95%-CI and a margin of error of $0.10$, then I get   $$n=Npq / (N-1)D + pq$$  where $D= B^2 / 4$ to be about $n=86$.  But what if instead we keep that same margin of error at $0.10$ and now only want a 90%-CI, if we use the same formula don't we get the same $n$?   Am I using the formula wrong here?


Will I get back my IAPs after reinstaling a purchased app from the Google Play?

So I was wondering if I will get back my IAPs after reinstalling an app from the Google Play Store. It's because I have an app where I've made a lot of IAPs and I've uninstalled it due to insufficient storage.  Any help would be appreciated.


Why use a static method when you can just use a class/instance method in Python?

Since a class or instance method in Python doesn't require you to use cls or self in the method, why can't you just create a class/instance method in place of a static method? Is there an advantage of using a static method as opposed to a class/instance method without referencing the cls/self in the method code?  For example: This class method  @classmethod def add(cls, num1,num2)     return num1 + num2   As opposed to this static method  @staticmethod def add(num1, num2)     return num1 + num2


can you give me a website that has a list of prices for old mtg cards?

I have a lot of magic cards from year 2009-2000 and i want to sell them but i dont know which one of my cards have value but i dont know if there is a website that has a list of old mtg cards that still has monetary value or can be sold.


Regular expression to stop at first match

My regex pattern looks something like  <xxxx location="file path/level1/level2" xxxx some="xxx">   I am only interested in the part in quotes assigned to location. Shouldn't it be as easy as below without the greedy switch?   /.*location="(.*)".*/   Does not seem to work.


Why is MAC encrypted in TLS data transmission?

Referring the slide 16 from this :  I want to ask why is MAC encrypted along with the data to be transmitted. Why isn't MAC just appended at the end of encrypted data ?


How to construct a field with 25 elements of a given polynomial?

Let us say that the polynomial is $x^2 + 5$ and the field is $\mathbb F_{25}$. Hereby $ax+b$ denotes any element of $\mathbb F_{25}$ with both $a$ and $b$ in the field $\mathbb F_5$.


The equation $8x^3+4x^2-4x-1=0$ has $3$ roots $\displaystyle \cos\left(\frac{2\pi}{7}\right), \cos\left(\frac{4\pi}{7}\right)$ and $\cos\left(\frac{6\pi}{7}\right)$. Using Cardano's method and Euler's formula, I can go so far as to show that the solutions are $\displaystyle\frac{\sqrt[3]{7\sqrt{7}}}{3}\cos\left(\frac{\tan^{-1}(3\sqrt{3} )}{3}\right)-\frac{1}{6}, \displaystyle\frac{\sqrt[3]{7\sqrt{7}}}{3}\cos\left(\frac{\tan^{-1}(3\sqrt{3} )+2\pi}{3}\right)-\frac{1}{6}$ and $\displaystyle\frac{\sqrt[3]{7\sqrt{7}}}{3}\cos\left(\frac{\tan^{-1}(3\sqrt{3} )+4\pi}{3}\right)-\frac{1}{6}$. But I have no clue about how to arrive at the aforementioned solutions.  Edit: @lab_bhattacharjee, Thanks a lot. Is there a way to tell if an equation has such simplified solutions?


Prove that for $ f(x+2\cdot\pi)=f(x), x \in \mathbb{R} $, there exists $ x_0 $ so $ f(x_0+\pi)=f(x_0) $.  This is supposed to be question about continuity, but I’m not sure exactly what they mean, perhaps I misunderstood some concept along the way.


Double click with the keyboard instead of the mouse?

I tried    and it doesn't seem to work  pressing + simulates a right click


I got +1 reputation for removed post, Is this normal or bug ? see my .  AFAIK for removed post I will get -2 rep, It because of I made suggested edit to that post.        Also with notification


When flagging a question or answer on stackoverflow.com or even meta.stackexchange.com and some other sites (didn't test more of them), each time the Flagging modal has to be re-rendered completely, it appears 59 pixels lower than the past one, causing it to slowly go away to the bottom of the page while navigating through its links.  Here's an image that explains it :   The easier way to reproduce it is by simply clicking successively between "Should be closed" and the "Flagging" breadcrumb link.


Could not diferentiate the date using the javascript

I am facing one problem. I am unable to differentiate the date difference using the javascript. I am explaining my code below.  var startdate_val = document.getElementById("stdate").value; var enddate_val = document.getElementById("enddate").value; var one_day=1000*60*60*24;  var x=startdate_val.split("-");      var y=enddate_val.split("-"); var date1=new Date(x[2],(x[1]-1),x[0]); var date2=new Date(y[2],(y[1]-1),y[0]) var month1=x[1]-1; var month2=y[1]-1; var date_diff = Math.ceil((date2.getTime()-date1.getTime())/(one_day)); console.log('date',date_diff <= 0);   Here I need enddate  always should be greater than the start date. Here I am attaching my datetime code.

 Start Date <input id="stdate" type="text" class="form-control datetime" value="" placeholder="17-06-2017"/>

 End Date <input id="enddate" type="text" class="form-control datetime" value="" placeholder="17-06-2017"/>

     Here I am getting the date field value like this i.e-03-01-2018 02:46. I need always the end date time should be greater than the start date time but in my case in console message always I am getting the result false.


calculate modular algorithm with large exponents

I don't know how to calculate the following modulo: $$321^{654} \mod 1013$$  Are there some easy way to do this?


Using code I found at  I can access the  the layers in my legend fine. However, I have layers that are styled by category and I can't figure out how to change the category labels. I just want to replace the underscores in the category labels with a space.   After looking through the API I think I may be able to use the rendererV2 class. The code below is giving strange results. the first set of print commands return 'foo', but the second set return the original labels and these are also printed on the output pdf.  Is there something I'm missing with the renderer? or, is there a better way to achieve this task?  I'm using QGIS 2.18.7 on windows 8      for legendLyr in iface.mapCanvas().layers():         if legendLyr.name() != "os1250_line" and legendLyr.name() != "os1250_text":             renderer = legendLyr.rendererV2()             if renderer.type() == "categorizedSymbol":                 myRenderer = renderer.clone()                 for cat in myRenderer.categories():                     cat.setLabel("foo")                     print(cat.label())                 legendLyr.setRendererV2(myRenderer)                 for cat in legendLyr.rendererV2().categories():                     print (cat.label())                 legendLyr.triggerRepaint()


Why didn't Kenobi tell Anakin that he had snuck aboard Padme's ship?

I think that Anakin had some dark thoughts circulating in his head when he saw Kenobi aboard Padme's ship. If Kenobi had just told Anakin that Padme had nothing to do with him being on her ship, then I feel like things would have turned out differently.


I have a huge data in my table so I want to fetch it in parts. So I am trying to run select top 1000 from table_name  It's giving me the top 1000 data but what will be the query if I want the next 1000 data. It's just returning me the first 1000 data.


How do I modify a script via HTML in a Content Editor Web Part in SharePoint Designer?

I can add a script or CSS in a webpart via the broswer CEWP > HTML  But how do I do the same , what more modify a CEWP with script in it when I am in SPD 2010? I can't seem to figure it out nor can see the script in the CEWP because there id not HTML ribbon button.


how can validate phone number with regex

I'm trying to validate the following phone number with regex: 1) +415XXXXXXXX 2) 00415XXXXXXXX 3) 41 5XXXXXXXX 4) 41 05XXXXXXXX 5) 05XXXXXXXX 6) 5XXXXXXXX  I tries this expression ^\+?41?\s?0?5\d{8}$  and was able to validate situations (1,3,4), could any one help me to adjust the above one to be able to cover the rest scenarios?


I am trying to get an orthographic render out of Blender with precise accuracy. The scale that I would like is 1"=1'. To prepare my scene, I have changed units to Imperial with separate values. I then changed the output dimensions to 7200x5400 - so that I can get an 24"x18" output at 300ppi. My problem now is setting the orthographic scale. I have tried 12 (for 12 inches in a foot), but the resulting render is too small. After fiddling with the scale manually, I figure that I'd need something less than 7.4, but I don't know how to get a precise scale for my use case.


Physical meaning and significance of third derivative of a function

Given a physical quantity represented by a function $f(t,x)$ what is (if there is any) the actual meaning of the third derivative of $f$, $\frac{\partial^3 f}{\partial t^3}$ or $\frac{\partial^3 f}{\partial x^3}$


How do I list the default installed packages?

I am developing an offline installer for all versions of Ubuntu, and I need Ubuntu's default installed packages list. Is there a way to get this information from any server (web server)? Any script to fetch any Ubuntu version's default installed packages list.  I will give the Ubuntu version, and the script will fetch the packages list.  Note: I need at least a server address. I can write a script for this.


An interesting identity involving powers of $\pi$ and values of $\eta(s)$

It happens that, for any $m\geq 1$, $$\sum_{n=0}^{+\infty}\frac{(-1)^n}{(2n+1)^{2m+1}}=\frac{E_{2m}}{2\cdot(2m)!}\left(\frac{\pi}{2}\right)^{2m+1}\tag{1}$$ where $E_{2m}$ is an integer number.     My proof works through the following lines: the LHS is: $$\frac{1}{(2m)!}\int_{0}^{1}\frac{(\log x)^{2m}}{1+x^2}dx = \frac{1}{2\cdot(2m)!}\int_{0}^{+\infty}\frac{(\log x)^{2m}}{1+x^2}dx,$$ so we just need to compute: $$\left.\frac{d^{2m}}{dk^{2m}}\int_{0}^{+\infty}\frac{x^k}{1+x^2}\right|_{k=0},\tag{2}$$ but: $$ \int_{0}^{+\infty}\frac{x^{1/r}}{1+x^2}\,dx = r\int_{0}^{+\infty}\frac{y^r}{1+y^{2r}}\,dy = \frac{\pi/2}{\cos(\pi/(2r))}$$ by the residue theorem, so $E_{2m}$ is just the absolute value of an Euler number, that belongs to $\mathbb{N}$.    Can someone provide a real-analytic proof of $(1)$?


How to add memory or delete files to \boot volume?

I have only 6 free Mb on "boot volume".  How can I find for not-used files to remove?  Or is it possible to add memory to this unit?


Everytime I download something, my bad sectors go up

Everytime I download something, I get more bad sectors, but as long as I don't download anything bad sectors do not increase and my hdd is perfectly fine, is this a sign of a failing hdd?


Why can’t we accelerate photons, and is it possible for a photon to have mass?

So I’m doing a science project and I’m trying to understand why the photon is massless. I’ve learned that neutrinos were thought to be massless at first, but then physicists found 3 types of neutrinos and established that they have mass. So what if the photon has mass and there’s 3 different types of photons regarding their type of wave. And can we accelerate the photon.


Prove that set of all non principal ideals of an integral domain has a maximal element

In an integral domain $R$ the prime ideals are principal ideals. (given)   So my attempt was using the Zorn lemma. We assume that there exists a chain of non principal ideals so by set inclusion the chain will be partially ordered by set inclusion.   Now the chain will have a maximal element. My reason is like this that let $I_1$ be the ideal generated by $(a, b) $ , then this ideal will be contained in the ideal $I_2=(a, b, c) $ so I think that it will have a upper bound which will be the whole ring itself. Now by Zorn lemma there will be a maximal element.  Is this OK?


Getting indices of list based on a second list

I have a list a which contains all the possible values in list b  a = ['foo', 'bar', 'baz']   and   b = ['baz', 'baz', 'foo', 'foo', 'foo', 'bar', 'foo', 'baz']   I'd like to return a list c which has the number of elements found in b where each element is the index of a in for which the value of b can be found.  Example  c = [2, 2, 0, 0, 0, 1, 0, 2]


Unable to open Windows Disk partitions in solaris 11

I have recently installed solaris 11, but I am an absolute beginner in unix systems. The only unix like environment I have got myself into before is ubuntu which was quite a bit different from solaris in my opinion. The main problem I am facing at the moment is that the NTFS windows HD partitions are not appearing in solaris file system, which was not the case when I used ubuntu. Every single file on my HD was exposed to me when I was in ubuntu.  I have already tried to find the solution in the internet. Tried to solve it with the help of  But had no success. The download links given for both FSWpart and FSWfsmisc is not working(giving a 404). I installed something called ntfs -g drive but I think I am not using it correctly as most of the time I am copying and pasting commands because I do not have sufficient knowledge to write them myself.  Please any assistance in this matter is greatly appreciated. Thanks in advance.


I installed Drupal 8.1.2, but I can't install modules of the category "core (experimental)". No problem with other modules or themes for example. I get no logs and no error message. Hitting the install button just redirects me to the extend page.  I have been able to install Migrate by installing Migrate Plus, which requires Migrate, but this does not solve the issue, in particular not for the other modules in "core (experimental)". Is there anything I have to do to be able to install experimental modules?


I am using my Ubuntu to do some programming assignments at college and it keeps hanging.  For example,    If I have an infinite loop in my C code by mistake, Ubuntu freezes. If my C program allocates memory at runtime and I give it a large dataset by mistake, it freezes. If I switch on RStudio and run a very memory intensive function - it freezes.   By "freeze" I mean that the GUI stops changing, mouse stops moving, keyboard doesn't work. Cannot even go into other ttys using Ctrl+Alt+F1  This never used to happen on the windows computer I was using before (and that was 32bit while my current laptop is 64bit)  It seems as though the process I'm running takes up 100% memory/cpu and hence nothing else works. How do I limit the amount of memory and cpu that each process can take ?  I checked a little on limits.conf but I was unable to find what exactly to do in the limits.conf file nor could I find what limits are considered "safe"


Is there a reason to plot residuals vs observed values rather than residuals vs fitted values?

first question so I apologize in advance if my formatting is rough. I'm currently working on a project with a professor I'll be starting a MSc in statistics with soon. One curious thing I've been asked to do when making residual plots is to have our predictor variables on the x axis instead of the fitted values from the model. Heres an example using the iris dataset library(tidyverse) library(broom)  fit <- lm(Sepal.Length ~ Petal.Length, data = iris)  d <- fit %>%    augment()  ##Residuals vs fitted ggplot(data = d, aes(x = .fitted, y = .resid)) +   geom_point() +    geom_smooth(se = FALSE, col = "red") + #Adds the line of fit   geom_hline(yintercept = 0, linetype = 2) + #Adds the horizontal dashed line   labs(x ="Fitted Values", y ="Residuals", title = "Residual vs Fitted") +   theme_bw()  ##Residuals vs Petal.Length (what my prof wants) ggplot(data = d, aes(x = Petal.Length, y = .resid)) +   geom_point() +    geom_smooth(se = FALSE, col = "red") + #Adds the line of fit   geom_hline(yintercept = 0, linetype = 2) + #Adds the horizontal dashed line   labs(x ="Petal.Length Values", y ="Residuals", title = "Residual vs Petal.Length") +   theme_bw()  Which lead to these (mostly) identical graphs   While I understand that theoretically that fitted values and observed values should be equivalent, and we can clearly see this example is the same, everything i've been taught, seen, or read plots residuals against fitted values. Is there any benefit or statistical reason to do otherwise?


How to ask to review for a specific conference or journal?

I have been invited to review technical content in the past. However, if I want to be part of review process for specific conference/journal – how do I go about and suggest my availability?


How to make bootable El Capitan installer in Mojave?

One of my friends who don't have a fast Internet connection asked me if I could install El Capitan (which is the highest version of OS X that his iMac supports) and I said sure.  Today I went to App Store to install El Capitan, just for it to download so that I can make a bootable USB for him, and couldn't find it in App Store.  Then after a bit of searching I've found  and it opened in App Store:    However, when I click the get button, it redirects me to Software Update in my System Preferences and says that it's not available:    Previously, clicking Get button just downloaded an installer into my Applications folder where I could easily create a bootable USB.  How can I make bootable El Capitan installer USB in Mojave?


Use of this positive semi-definite matrix in optimization?

We know that any matrix of the form $A^TA$ is positive semi-definite where $A^T$ is the transpose of $A$. Now how can we use this result in optimization?  Edit: The importance of positive semi-definite matrices is almost clear, but my question is specific to $A^TA$. I have no idea of how we can use this matrix.


Just to prevent I do my project on vuejs but that does not change the way of placing a div normally (html-css is still the same thing) x)  Well I made a small diagram to facilitate the explanation:    I need the div to go paste this at the bottom of the screen, the problem is that I cannot apply a% or a vh to it because the navbar at a fixed height (and therefore will push my div towards the down on the small screens).  usually I place my div below my navbar, I apply height: 100vh and a padding-top the size of the div, but this time I prefer not to place it under the navbar.  So how i can do something like : height: 100vh - height of navbar   I also specify that I would like (if possible) not to use js, because my navbar and my div are different components from vueJS and therefore it would be quite tedious just for a height I think  I don't know if my explanation is clear but thanks for taking the time to read :)


Was the protection afforded to Harry via Lily's sacrifice universal or just anti-Voldemort?

It was posited in answers/comments to "  " that somehow, Harry is being protected from harm in general (post-GoF) by the fact that - as per HP7 - Voldemort took Harry's blood and thus with his blood took inside him the protection that Lily's sacrifice bestowed on Harry.  However, I think that this protection (both Lily's original protection in Harry's blood, and the part of it that got transferred to Voldemort) is VERY VERY specific and is only against harm done directly by Voldemort. This means that Harry is still subject to non-Voldemort harm, for example he could have been easily killed by Basilisk fang's bite in HP2 or by FiendFyre started by Crabbe in HP7 in Room of Hidden Things.  Is there good in-Universe or JKR information  to support or reject my theory that the protection is only against harm directly done by Voldemort?


What is the term for the colour scheme/effect in e.g. Supernatural

In the TV series Supernatural, almost all episodes have a darkish colour scheme. The only exception is for episodes partly set in another universe, e.g. S05E08 "Changing Channels" where they brothers were put through a number of TV shows, or S06E15 "The French Mistake" where they are thrown into this world. The effect on the viewer is that the Supernatural universe is darker and "grittier" than our own (and other series).  Is there a technical or colloquial term for this effect?


Echoing a string in bash with brackets surrounding it returns 'b'

$ a='"apple","ball","cat"' $ a='['$a $ echo $a ["apple","ball","cat" $ a=$a']' $ echo $a b   I'm stumped hard by the result b while I expect to see ["apple,"ball","cat"]. What am I missing here?  This is from bash shell on Mac. Also see it on CentOS 7, while not on Fedora. Can someone please explain?


Why is the xor operator used in computing hash code?

In this MSDN article   it discusses the Class Equalitycomparer and has an example.In this example about comparing boxes it has this class -   class BoxSameDimensions : EqualityComparer<Box> {     public override bool Equals(Box b1, Box b2)     {         if (b1.Height == b2.Height & b1.Length == b2.Length             & b1.Width == b2.Width)         {             return true;         }         else         {             return false;         }     }      public override int GetHashCode(Box bx)     {         int hCode = bx.Height ^ bx.Length ^ bx.Width;         return hCode.GetHashCode();     } }   I don't understand the line int hCode = bx.Height ^ bx.Length ^ bx.Width;  Could someone explain please? Why the xor?


Regular expression for parsing CSV in PHP

I already managed to split the CSV file using this regex: "/,(?=(?:[^\"]\"[^\"]\")(?![^\"]\"))/"  But I ended up with an array of strings that contain the opening and ending double quotes. Now I need a regex that would strip those strings of the delimiter double quotes.  As far as I know the CSV format can encapsulate strings in double quotes, and all the double quotes that are already a part of the string are doubled. For example:  My "other" cat     becomes  "My ""other"" cat"  What I basically need is a regex that will replace all sequences of N doublequotes with a sequence of (N/2 - rounded down) double quotes.  Or is there a better way ? Thanks in advance.


Cascading ADC's to get higher resolution

Suppose I have a pair of 12-bit ADC's, I can imagine that they can be cascaded to get <= 24-bit output.  I can think of simply using one for the positive range and the other for the negative range, though there probably will be some distortion in the cross-over region. (suppose we can ignore are a few error bits or, perhaps, place a 3rd ADC to measure the value around 0 volts).  Another option I had been thinking of is using a single hi-speed ADC and switching the reference voltages to get a higher resolution at lower speed. Also there should be a way of getting a real-valued result with using one fixed-ref ADC and then switching the aref's of the secondary converter to get more precise value in between.  Any comments and suggestions are welcome.  I am presuming that a quad 8-bit (or dual 12-bit) chip is less expensive then a single 24-bit chip.


Simplify $\frac{\prod\limits_{n=1}^{45} \cos(2n-1)}{\prod\limits_{n=1}^{45} \sin(4n-2)}$, measured in degrees

Absolutely clueless, any help would be appreciated, especially if it can be understood by a grade $12$ student (me).  The answer is in the form $2^x$, and we are supposed to find value of $x$.


Remove space below enumitem inside tabularx

I'm using a list from enumitem-package inside table from tabularx-package. Between the table-row, which contains the list, and and the next table-row there is a space I would like to avoid. How do I do that? This is some basic example code:  \documentclass{article}  \usepackage{tabularx} % featured tables  \usepackage{enumitem} % control layout of itemize, enumerate, description \setlist{nosep} \setlist[itemize,1]{leftmargin=\dimexpr 1em}  \renewcommand{\arraystretch}{1.3} % table spacing  \begin{document}  \begin{tabularx}{\textwidth}{p{4cm}X}   lorem ipsum a & lorem ipsum b   \begin{itemize}[label=--]     \item lorem ipsum c     \item lorem ipsum d   \end{itemize}\\   lorem ipsum e & lorem ipsum f\\ \end{tabularx}  \end{document}   It looks like this:


How to install ClipGrab in Ubuntu 16.10 (Yakkety Yak)

The output which I get while installing ClipGrab using ppa is :-  Reading package lists... Done W: The repository 'http://ppa.launchpad.net/clipgrab-team/ppa/ubuntu yakkety Release' does not have a Release file. N: Data from such a repository can't be authenticated and is therefore potentially dangerous to use. N: See apt-secure(8) manpage for repository creation and user configuration details. E: Failed to fetch http://ppa.launchpad.net/clipgrab-team/ppa/ubuntu/dists/yakkety/main/binary-amd64/Packages  404  Not Found E: Some index files failed to download. They have been ignored, or old ones used instead. jaggu@jaggu-Lenovo-G50-80:~$ sudo apt-get install clipgrab Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  clipgrab : Depends: libavcodec-extra-53 (>= 4:0.8.6) but it is not installable E: Unable to correct problems, you have held broken packages. jaggu@jaggu-Lenovo-G50-80:~$    How do I solve this problem and install ClipGrab ?


In the episode , at the start of the episode when Voyager is in the process of a major maintenance overhaul there are at least 3 shuttles that can be seen. I have lost track of the number of times a shuttle has been destroyed. How many shuttles does Voyager have, not including The Delta Flyer?


I'm currently running on dual boot (win 7 and ubuntu). I'd like to know how to delete my Windows 7 OS using ubuntu


If you increase the h (=height), potential energy will be increased given by U=mgh.  Where does the energy go, into atoms?


Integrable function whose Fourier transform is not integrable

I am looking for an example of a function $f: \mathbb R \rightarrow \mathbb R$ such that $f \in L^1$ in the sense that $\int_{\mathbb R} |f| < \infty$ but its Fourier transform $\hat f$ is not in $L^1$. Does anyone have one?  Thanks.


Force times Displacement conserves itself

Was it decided empirically (in order to respect the already found Conservation of Energy's law) that force x displacement is the quantity that corresponds to the energy ?  It's a deeper question than it looks, at least for me :)


Unity prefab script "GameObjects" can't be ones on the scene?

Currently, I have an object on the scene, and one in prefab. I want the prefab's script to reference to the object on the scene through the   public GameObject obj;   code. However, when I tried to add the object in the editor, I cant seem to be able to select any objects from the scene, only ones in prefabs.  I am quite new at unity, so am I missing something really basic here?   Thanks for any help!


Ubuntu switching between monitor settings while booting

I have connected my laptop to an external monitor via a VGA cable and set up the system to use only the external one (Single Display setting) but I have some problems at the boot. When I boot the PC it switches from one monitor setting to another:   At first, while the BIOS loads, the native screen is the only one to be used (Single Display on native monitor) The screen asking for the cryptsetup is shown on both the monitors (Mirror) The boot is shown on both the monitors (Mirror) The login screen appears only on the native monitor while the external one shows a violet background (Join Displays) When I log in the native screen is switched off and the external one is the only used (Single Display on the external monitor)   I suppose that until I have not logged in Ubuntu ignores my personal settings and uses some default ones, which is good for safety but causes me some trouble. Is there a way to change those default settings to be able to log in from the external monitor?  I have no idea about what information could be useful to solve the problem, please ask in the comments what is needed.


Invalid characters for XML parsing in posthistory.xml from Stack Overflow

We got the April 2011 data dump from Stack Overflow and, while trying to put everything into a database, we got      SyntaxError: reference to invalid character number: line 1105549, column 5445   in the middle of the posthistory.xml file. It seems that there are sets of characters (&#xC I believe) within a few posthistory entries which break our XML parser.  Is there a solution besides manually changing all the C's?


I understand a proton is made up of quarks/gluons. I want to know if a proton has an actual core? Also whether protons have a core/surface temperature.


According to : in CERN they have announced the have found anomaly in decay products.A heavy quark doesn't decay to electron , muon and tau with equal probabilities but it prefers to decay to an electron more than a muon and to a muon more than a tau.What could this mean?


Dynamically adjust height of first child div based on height of second child div

I have a parent div and two child divs. The second child div is variable height, but is absolutely positioned at the bottom of the parent div.  I want the first div to have a dynamic height based on the second div. I thought margin-bottom: 10px would specify the height of the first div to go up until 10px of the second div, but apparently this is not true.  Is there any workaround to get what I want?  HTML:

      Hello

   CSS:   .parent {   height: 500px;   min-width: 500px;   position: relative;   background-color: red; }  .first {   background-color: green;   margin-bottom: 10px; }  .second {   height: 100px;   background-color: grey;   bottom: 0px;   box-sizing: border-box;   position: absolute;   width: 100%; }   JSFiddle:


Does the n'th derivative of a smooth transition have to have more than n+1 roots for some n?

I'm wondering if the space $$S=\left\{f\in C^{\infty}([0,1])\ \ :\ \ f(0)=0\bigwedge f(1)=1\bigwedge\forall n\in\mathbb{N},\ f^{(n)}(0)=f^{(n)}(1)=0\right\}$$ contains an element $f_0$ such that $f_0^{(n)}$ has at most $n+1$ roots for all $n\in\mathbb{N}_0$.  Intuitively I'm somewhat inclined to think it's false. Do anyone know if this holds, or how I should go on about finding out?  If $f_0^{(n)}$ has $n+1$ roots, then by the mean value theorem $f_0^{(n+1)}$ has $n$ distinct roots in the interior of the support in addition to the boundary points being roots. Hence by induction $f_0^{(n)}$ must have $n+1$ roots for all $n\in\mathbb{N}$.  As to whether the lower bound is non-strict, I think maybe the way to go is to assume that $(a_i)_{i\in\mathbb{N}}$ is a sequence with $a_i \in S$ and $a_i^{(i)}$ having at most $i+1$ roots. Because if those properties imply that not all derivatives of $a_i$ remain bounded as $i\to\infty$, then no such sequence can have an element of $S$ as limit, and so the lower bound must be strict.   I made some numerically experiments with linear programs which indicated the existence of such a sequence where also $\sup_x a_i^{(1)}(x)<2$. So several derivatives must be considered simultaneously.


I have method:  public ReportBuilder addDiffs(List<String> diffs) {     if (this.diffs == null) {         this.diffs = new ArrayList<>();     }     this.diffs.addAll(diffs);     return this; }   And I want to make unit-test. As I khow it should be like:  @Test public void ReportBuilderTest() {     ReportBuilder builder = new ReportBuilder();     List<String> list = new ArrayList<>();     list.add("some string");      builder.addDiffs(list);      assertEquals(builder.getDiffs(), list)); }   It is example, but my class is inner service and i can't create getter for it. And diffs are private. How to make proper unit-test for this method? Maybe there is a problem with architecture?


Remainder when $5^{5555}$ is divided by $10000$.

Find the remainder when $5^{5555}$ is divided by $10000$.  A step by step guide with explanation for a beginner student in modular arithmetic is needed.


If $a\equiv b\pmod m$ and $c+d\equiv 0\pmod m$ then $ac+bd\equiv 0\pmod m$.   The response, posted below is correct??


Prove that the derivative of an even differentiable function is odd, and the derivative of an odd is even.

Prove that the derivative of an even differentiable function is odd, and the derivative of an odd differentiable function is even. Here are my workings so far.  Lets prove the derivative of an odd differentiable function is even first. Let the odd function be $f(x)$. We have $f(-x)=-f(x)$ and $\lim_{x\to a^-} f(x)=\lim_{x\to a^+}f(x)=\lim_{x\to a}f(x)$ $$f'(-x)= \lim_{h\to 0} \frac {f(-x+h)-f(-x)}{h}= \lim_{h\to 0} \frac {-f(x-h)+f(x)}{h}$$  And so, I am stuck. Thanks in advance. Hints are appreciated. Solutions are even more welcome!


Problem regarding comunities display list

I am part of four communities here on Stack Exchange. But in my "Your Communities" list it only shows one. Why is this?


Finding the probability density function of $X+Y$

Question: Let $X$ and $Y$ be two independent and identically distributed exponential random variables with parameter $\lambda>0$. Compute the probability density function of $X+Y$.   My Answer: I have found the joint probability density function of $X$ and $Y$ to be $f_{X,Y}(x,y)=\lambda^2e^{-\lambda x - \lambda y}$. I then let $Z=X+Y$ and calculated $F_Z(z)=\lambda^2e^{-\lambda z}$.  I know I need to integrate $F_Z(z)$ to calculate the density function but am unsure on what the limits should be or if I found $F_Z(z)$ correctly. I was also wondering if there is a quicker way to tackle such questions or if this method is okay.


In a Banach space X, if $\forall f \in C(M)$, $f$ is bounded, show M is compact

Let $M$ be a set in Banach space $X$ such that $\forall f \in C(M)$, function $f$ is bounded on $M$.  Prove that $M$ is compact.  My idea originally was to use Ascoli-Arzela Theorem and then show its closed, but I realize X is not compact, so this makes no sense. Now I'm stuck though and don't even know where to start.  We haven't really talked about Banach spaces so the only thing I know is that X being a Banach spaces implies every Cauchy sequence converges to a point in X.


CPU max utilization limited to 1/N CPU’s for MOST multi-threaded Apps on any Win OS : WHY?

I understand multi-threading and tasking to some extent but know that outside of the OS, most Windows Apps are limited to using only 1/N CPU’s for averaged max. utilization. That is 50% for a dual core, 25% of 4 CPU and 12.5% of all 8 CPU’s.  This does not change the result if using Procexp.exe to deallocate CPUs or choose even or odd numbered CPUs. My question Is there any way to increase the utilization beyond this OS restricted limit. I understand if one imposed 100% to one App. The OS could blue screen from a non-responding hardware I/O within the expected or required timeout period, but even 50% or 75% would improve my results. Yet explorer.exe etc in the OS can perform at 50% or more(?) at times when doing large tasks.  normally the CPU is 98~99.5% idle with just a browser open and 10 tabs ( Brave)  I am using Win7 i7-4770S Haswell 3.1GHz with 16GB RAM on LibreOffice SCALC.exe with a spreadsheet with 1.5 million cells of CV19 US data and did a search/replace the ‘ text prefix to attempt to convert text to a cell number for daily dates (with some options from text to values) and it is still running (yes) and obvious I used the wrong method. If not possible to change OS utilization ratios, then should I rewrite this question on converting 400 text entries to a value of dates ‘1\20\2020 to a value for reformatting to my preference.  this text file was downloaded from the GitHub repository for JHU CV19 US county daily mortality cumulative totals and imported into SCALC using text to column conversion.  SCALC is still running !” ,  at 12.5% according to PERFMON using 11 threads. The problem started with a search and replace of 1 character in a 1.5 million cell spreadsheet. I chose "similarity-option" which was a mistake but the problem is not Excel or Open Office Apps , many apps are multi-threaded but limited to 1/N CPUs on average with no way to change this. I can prove this with images but some of you will know this to be true. Others do not understand the question.  yes it is possible to write or for Windows to do this but not canned apps. EXAMPLE 1  simple startup recovery of a large file process only took seconds and peaked above 20% .  It can peak well over 12.5% avearge for a second but not sustained I supposed when there is a memory thruput limitation.  (SO I guess it nothing can improve this ?)  Here a search a replace 0 with 0 on 1.5 million cells Averaged exactly 12.5% just before I captured the screenshot.  Here almost EXACTLY 1/N or 12.5% of all CPU workload dedicated to 1 Application with many threads. I can duplicate this test on MANY OTHER APPLICATIONS under Windows with this architecture. So is it architecture - Memory cache bus limited and any fix? As others have written on this forum, 1/N CPU's limited or 12.50 % This is the proof.  More proof on multi-thread MS App i=only using 1/N CPU % average MAX  Update Installed WordPerfect 2020 with QUattro Pro and ran the exact same multi-threaded process and got exactly THE SAME RESULT MAX CPU USE on all 8 CPUs = 1/8 = 12.5%  Example #4  of a multi-threaded process again utilized all CPu's but in total only 1/N CPUs or 12.5% is Mark Russinovich's  Process Explorer ,aka PROCMON.exe. which was independent of all other processes using few resources.  I doubt it was Mark's ability to program multi-threading here. :) (MS Fellow)   My CPU Latency is on top


Prevent Windows 7 from booting in Safe Mode

I've found myself in quite the unusual situation, through my own thoughtlessness. Using a computer of which I do not have an (or the) administrative account on, went to msconfig, to 'boot' and selected the option to force the computer to launch in safe-mode.  Now, as of restarting the computer, it launches in safe-mode though I am then requested to log in, before I can return to the dialogue and deselect the safe-mode option. However, as I explained, this is not quite possible.  Are there any buttons I can press when the computer is launching that will give me an option to return to standard booting? I am not to use any methods such as using a restore point, restoring to factory default, deleting the administrator's account, create a new administrator account, change the password, etc. etc. - I am simply wondering if there is a method to achieve a standard boot-up, probably using an F1-12 key, and what it would be.  Many features on my environment have been disabled, so even if an answer is proposed there is a chance I will be unable to use it. Therefore, the more alternatives the better, granted they do not violate the above examples.  Using - Windows 7, Acer Travelmate B113.


Can a multiclass Wizard/Fighter (Eldritch Knight) add EK known spells to the wizard spellbook?

When intending to play a Fighter (Eldritch Knight) I was dissatisfied with the spell restrictions so I devised a plan to increase my spell versatility:   Start with 1 wizard level to have a spellbook with 6 wizard lvl 1 spells Take all the other levels as fighter, picking eldritch knight at fighter 3 (total character lvl 4) and adding all spells learned at this time to the wizard spellbook. Each subsequent fighter level, replace the "any school" spell learned (this has been clarified to be possible, see ) and keep adding it to the wizard spellbook. This effectively allows 1 extra spell to be added to the book per fighter level after 3.   The only dubious part of this plan is the possibility to add EK known spells to the wizard spellbook. So can this be done by RAW?


How can I position my div at the bottom of its container?

Given the following HTML:

     Copyright Foo web designs

    I would like #copyright to stick to the bottom of #container. Can I achieve this without using absolute positioning?


Restrict write access while batch is running (Win CMD)

I have a simple batch process running once per day to manage a disk quota (simply deletes all folders in excess of quota, oldest first).  Works fine for what it's designed to do.  Among other tasks, it appends a list of the deleted folders to a log file (a simple text file). To prevent inadvertent changes to the log file, I have the read-only flag set (not attempting any real security, just protecting against a reflexive "save changes" if viewed in Notepad, for example).  It's simple to use ATTRIB to turn the "R" off at the start & back on again at the end of the process. I notice, however, that Windows doesn't appear to provide write access control to text files:  I find that multiple instances of Notepad (or Notepad and another text editor; or a text editor and a CMD window) can each "save" to the text file (if read-only is off)--meaning those inadvertent changes (or wholesale deletion) could happen while the file is "vulnerable" because the process is running & it has the read-only turned off. OK, it's not that big a deal for this specific application (the process typically takes ~30 seconds to run, and I'm the only user with access and "theoretically" know better)--but, I'd like to understand how to deal with this. How can I save (append) to a read-only log file without opening it up to any other writes?  I'd like something along the lines of: take exclusive write control of log file turn off read-only perform rest of script turn on read-only release exclusive write control  It's those first & last steps I can't figure out....


biblatex: change name of author according to language?

Usually a name stays the same in whatever language. So, whenever I quote a work by Knuth -- be it in an English article or a German one -- I will quote him as Donald E. Knuth.  This is not always the case with ancient or medieval names. They are spelled differently in different languages. Two examples in English | German | French:   Aristotle | Aristoteles | Aristote Thomas Aquinas | Thomas von Aquin | Thomas d'Aquin   This means that when I write an English article, I need a bib-file that contains the English names, but when I want to write a German article, I need to go through my bib file and change the names accordingly. Depending on how often I in fact publish in English or German this could keep me busy and is prone to error.  So, I though, maybe I could have the different names already included in one single bib-file and let biblatex choose the correct name according to the primary language used in the document. Any ideas?  NB: I do not want to use in one single document both spellings Aristotle and Aristoteles (as the following MWE might make you think). Of course, if the article's primary language is English, then all the references to Aristotle will use the English spelling of his name. However, I want to be able to write articles in different languages, without (a) having to edit my bib-files each time or (b) generally maintaing not one single bib-file but two different ones, one for each language, or (c) having two distinct entries in one bib-file  MWE  % !TEX TS-program = lualatexmk \documentclass{scrartcl}  \usepackage{fontspec}         \setmainfont[Ligatures=TeX]{Times New Roman}  \usepackage[ngerman, british]{babel} \usepackage[babel]{csquotes} \usepackage[style=verbose,abbreviate=false,backend=biber]{biblatex}  \usepackage{filecontents}  \begin{filecontents}{\jobname.bib} @book{aristotle:ross:1924,     Author = {Aristotle},    % It is here, I think, that something could be done, e.g., ...     Title = {Metaphysics},     % ... british=Aristotle,ngerman=Aristoteles,french=Aristote     Editor = {William David Ross},     Commentator = {William David Ross},     Introduction = {William David Ross},     Hyphenation = {british},     Location = {Oxford},     Publisher = {Clarendon Press},     Volumes = {2},     Year = {1924}} \end{filecontents}  \addbibresource{\jobname.bib}  \begin{document}  \selectlanguage{british} Some English text.\footcite{aristotle:ross:1924}  \selectlanguage{ngerman} Etwas Text auf Deutsch.\footcite{aristotle:ross:1924}  \end{document}


Consider $x''+a(t)x=0$ that $a(t)$ is continuous an differentiable , if $a(t)$ is monotonic such that $a(t)\to \infty$ then all solution is bounded!


What would happen if I take my hard drive out of my current PC and put it in a new PC?

Basically, I want to get a new PC, but I have so many software/games installed on my current hard drive, that I don't want to waste the time to re-install/re-configure. Would it work if I just take out my current hard drive, and stick it into a new PC? the motherboard/video card etc are all different, would the new PC boot up and work flawlessly?  The operating system is Windows 7.


In Avengers: Endgame, Captain America      lifts Mjølnir and uses lightning to attack Thanos. However, Thor's hammer doesn't have the power to bring lightning, Thor does. I mean, he is the God of Thunder, not Steve or anybody who just becomes worthy of lift the hammer!    How can this be explained?


What is the relationship between cubic B-splines and cubic splines?


Why would an international applicant with a perfect GPA and an undergraduate thesis get rejected from 16 grad schools?

I applied to 16 graduate schools for this coming fall. I am a transfer student at a Top 10 Public US school. I had GPA 4.00 at the time I applied (Not yet took graduate course yet, but I wrote that I would have taken 8 graduate courses at the time I applied). I didn't have the REU (but I was proceeded algebraic geometry research thesis), and a few experience of presentations. I am an international male applicant. The person who wrote my letter of recommendation is famous/reputable (one Fields medallist and one very famous mathematician of algebraic geometry). But, I couldn't hit any of the graduate schools (including the Top 50-60 US math department schools). I am not sure what was the reason I can't get into any of the graduate schools to which other students in my school were admitted. What can I do to improve my prospect of getting into any graduate schools?


Why the zero morphism is independent of the zero object?

I want to know, Why the zero morphism is independent of the zero object. I have $0 \in \mathcal{C}$ the zero object and $0_{X,Y}: X \to 0 \to Y$ the zero morphism. I am very confused to prove that the zero morphism is independent of the zero object. Can anybody give me an idea?


Which is the application that i can open torrent files?

when i'm trying to download the torrent file to download some video,it was asking me select the application to open that torrent file.  Could you pelase help me on that


Isomorphic extensions of $\mathbb Z_3$ by $\mathbb Z_3 \times \mathbb Z_3$ which are not equivalent

The following exercise from  confuses me:     Find two isomorphic extensions of $\mathbb Z_3$ by $\mathbb Z_3 \times \mathbb Z_3$ which are not equivalent.   For two  $N, E, G$ and $\overline N, \overline E, \overline G$ with injections $\mu : N \to E, \overline\mu : \overline N \to \overline E$ and projections $\varepsilon : E \to G, \overline\varepsilon : \overline E \to \overline G$ a homomorphism of extensions is a triple of homomorphism $(\alpha, \beta, \gamma)$ from $N$ to $\overline N$, $E\to\overline E$ and $G \to \overline G$ such that the resulting diagram commutes, see  from the book.  An equivalence between extensions $N, E, G$ and $N, \overline E, G$ is a triple of morphisms $(1_N, \beta, 1_G)$, an isomorphism between extension $N, E, G$ and $\overline N , \overline E, G$ is a triple of morphisms $(\alpha, \beta, 1)$ where $\alpha$ (and hence $\beta$) are isomorphisms. Note that in an isomorphism in general $N \ne \overline N$ , where they are equal for the notion of equivalence.  Coming back to the exercise, first as $\mathbb Z_3$ is a field, the only isomorphism from $\mathbb Z_3$ to $\mathbb Z_3$ is the identity map. So, as I see it, there is no way to give an isomorphism $\alpha \ne 1_{\mathbb Z_3}$, hence not possible to give an isomorphism which is not also an equivalence?  Or do I misunderstand something? Could you please clarify what this exercise asks for?


In Game of Thrones, does wearing someone's face change the wearer's body as well?

For example, if Arya were to wear the face of someone considerably larger than her, would she look convincing or ridiculously ill-proportioned?


I am designing a prototyping platform called . It is a learning cum prototyping platform for students and makers. Since many times we requires debugging of our circuits, so I thought to include some testing points in PCB. I came across this image: It is used in Dr.Duino (debugging shield). Can anybody explain what it is? Or any other idea about how to give test points in PCB for users, such that user can easily attach the alligator (crocodile) clips or Banana multimeter cable tips.


Does Canon EF 50mm f/1.8 II work with Canon 200D?

I want to buy a Canon EF 50 mm f/1.8 II.  Does the Canon lens EF 50 mm f/1.8 II work Canon EOS 200D?


Lets see this example:  char var1[100] = "test    "; char* var2;   If I do this:  var2 = &var1;   I'll get it with spaces.  I want var2 to be the trim of var1.


Problem: If   $$C_0+\frac{C_1}{2}+\cdots + \frac{C_{n-1}}{n}+\frac{C_n}{n+1} =0,$$  where $C_0,...,C_n$ are real constants, prove that the equation  $$C_0+C_1x+\cdots +C_{n-1}x^{n-1}+C_nx^n=0$$  has at least one real root between $0$ and $1$.  Source: W. Rudin, Principles of Mathematical Analysis, Chapter 5, exercise 4.


Why Command Substitiution Works And Pipeline Not

I am practing | pipeline to pass output. Firstly, I tried basename as $ basename -a $(ls test_directory/*)   This line works as expected and showed only file's name without directory's. But when I try to pipe the output of ls to basename $ ls test_directory/* | basename -a  Error message is here: basename: missing operand Try 'basename --help' for more information.  I found  on  on which  mentioned:   Passing input by stdin: ls | wc -l   This will count the lines in the output of ls  Passing input by command line arguments: wc -l $(ls)  This will count lines in the list of files printed by ls    I can't understand the difference between "the output of ls" and "files printed by ls". Aren't they same thing? I want to understand the difference. And  I want to understand why ls td/* | basename -a didn't work.


Why didn't Voldemort curse the headmaster's position (if he was able to curse the DADA teacher position)?

If Voldemort was able to curse the DADA teaching position, why didn't he (or wasn't able to) curse the headmaster position? that could have helped him get Dumbledore out of his way for applying for position once again next year.


I was thinking if it is possible to quickly send your hero back to the fountain by pressing a hotkey or something. This would be really useful when playing micro heavy heroes like Meepo or Chen.


How are the "on pace for" metrics on Area 51 generated and are they being done so correctly?

Taking Biology as an example, :     Every site needs a solid group of core users to assist in moderating   the site. We recommend:         150 users with 200+ rep (on pace for 83 users  at 90 days)   10 users with 2,000+ rep (on pace for 2 users at 90 days)   5 users with 3,000+ rep (on pace for 0 users at 90 days)      At the current time, there are   70 users with 200 rep or more 2 users with 2000 rep or more   See  (36 per page)  So assuming that the projected extra thirteen 200 rep users are the next thirteen closest, the Area 51 projections say that the thirteenth user is expected get 44 reputation points, that is, 22% more than they have currently in the next 17 days.  Yet this doesn't seem to be the same logic as applied to the next category. Four users are within 170 reputation points (8.5% more) and some are only 22 reputation points (1.1%) away from crossing the threshold. Surely they are more likely to do this in the next seventeen days than the 200 reputation points users (I am sure their reputation per day is higher too) so why don't these users show up in the on pace stats?  Could the projections be broken for the middle category?  Similarly for the third category, a user is 66 reputation points (2.2%) away from the 3000 mark yet doesn't show up in that bracket. Surely they should be doing at this point?  I also think it's unlikely to be a caching problem as some of the 2k users haven't gained reputation points over the last couple of days but are still within striking distance.


ListAdapter throws error: null object reference

I'm getting the following error:  java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.String com.sebastian.codivatemanager.User.getName()' on a null object reference at com.sebastian.codivatemanager.FriendAdapter.getView(FriendAdapter.java:57)   on this class:  public class FriendAdapter extends BaseAdapter {  private Context mContext; private User[] mUsers;  public FriendAdapter(Context context, User[] users) {     mContext = context;     mUsers = users; }  @Override public int getCount() {     return mUsers.length; }  @Override public Object getItem(int position) {     return mUsers[position]; }  @Override public long getItemId(int position) {     return 0; }  @Override public View getView(int position, View convertView, ViewGroup parent) {     ViewHolder holder;      if(convertView == null) {         //brand new         convertView = LayoutInflater.from(mContext).inflate(R.layout.user_overview, null);         holder = new ViewHolder();         holder.nameLabel = (TextView) convertView.findViewById(R.id.textViewName);         holder.levelLabel = (TextView) convertView.findViewById(R.id.textViewLevel);          convertView.setTag(holder);     }     else {         holder = (ViewHolder) convertView.getTag();     }      User user = mUsers[position];      holder.nameLabel.setText(user.getName());     holder.levelLabel.setText(user.getLevel() + "");      return convertView; }  private static class ViewHolder {     TextView nameLabel;     TextView levelLabel; } }   The line pointed out is:  holder.nameLabel.setText(user.getName());   I'm trying to display a list using the list adapter "FriendAdapter". This list comes from an array called "mUsers" which is carried over from the class it's included in:              User[] mUsers = new User[array.length() + 1];          for(int n = 0; n < array.length(); n++) {             JSONObject obj = array.getJSONObject(n);             Log.i("Friends", obj.toString());             mUsers[n] = new User();             mUsers[n].setName(obj.getString("name"));             mUsers[n].setLevel(obj.getDouble("level"));         }          FriendAdapter adapter = new FriendAdapter(this, mUsers);         setListAdapter(adapter);


When is the completion of a ring a local ring ?

Let $R$ be a commutative ring with unit and let $m$ be a maximal ideal of $R$. Are there known conditions on $R$ or $m$ such that the $m$-adic completion $\hat{R}$ of $R$ is a local ring.   Since the completion of a Noetherian local ring is again local, I'm primarily interested in cases where $R$ itself is not local.   An example is the polynomial ring $R=k[X_1,...,X_n]$ ($k$ a field) with $m=(X_1,...,X_n)$ where the power series ring $\hat{R}=k[[X_1,...,X_n]]$ is local with maximal ideal $(X_1,...,X_n)$.


Can blender use the Alpha channel of an image as transparency on a plane?

I was wondering if I used Photoshop to make a portion of my picture transparent, Would Blender be able to use those transparencies while importing the photo using the Import images as a plane Add-on


How can I use linq distinct operator here to remove remove duplicate courses.Cours.Name,  var coursesList = from courses in not_subsribe   select new SelectListItem   {       Text = courses.Cours.Name,       Value = courses.Cours.ID       .ToString()   };


Which is the correct sentence? (is, is called, called as)

Which is the correct sentence?   The young cow is calf. The young cow is called calf. The young cow called as calf.


As a UX Designer, how can I contribute as to the development process on GitHub?

Does anyone know how can I contribute (as User Experience Designer) to the development process on GitHub?  I want to know how someone could include UX Research, Usability Testing, Contextual Inquiries and other planning and/or strategical activities from UX or AI point-of-view in the common process of projects being developed using GitHub.  Example:  All the work in GitHub is based in code production, branches, pull requests, etc. I trying to find examples of projects where a UX Designer has contributed in environment like this, how the deliverables have worked, common approaches to user testing, better ways to communicate with developers etc.


I've no clue how to solve this issue in the exercise that I'm trying to perform.  The point where I'm stuck is 4. "Create signature file as LandsatCompS.sgs". I've done what it says in the exercise. I got a error message "Failed to create signature file.  The aim of the exercise is to carry out a supervised image classification of the Northern half of Jutland.   Start ArcMap and add the Landsat images from the B series (summer images). Create a composite image composite image for all bands except band 6 – the thermal band. Save the image as LandsatCompS (S for summer). Open the orthophotos for land (not urban). Add eventually more orthophotos from the Geodata library. Try to identify the necessary number of different land cover classes to cover all areas on the orthophotos. Not more than 15! Open the Image Classification window, and start digitising training areas. Two for each class. Create the signature file as LandsatCompS.gsg. Carry out maximum likelihood classification using LandsatCompS as input raster and LandsatCompS.gsg as signature file. Output is ML_class_NJ1. Use default values for the other inputs. Put the right colours on the new map and compare with the orthophoto and other maps available for Northern Jutland. Where are the problems? Try to make an improved classification by increase the number of classes and digitise new training areas. Carry out the classification and assess the result. Which one is best?


The moon affects the motion of the oceans, but can the motion of the oceans affect the moon?

Obviously the earth's oceans have mass and therefore they have an attractive force upon the moon.  However, let's say that we were to cover most of earth with tidal power generators that extract some of this energy from the ocean. Could this affect the moon?  How about if we were to otherwise freeze the earth's oceans, or lock them in with a layer of cement to prevent them from being tidal?


We are facing problems related to transaction logs becoming full.      The transaction log for database is full due to 'ACTIVE_TRANSACTION'   My database logs are becoming full after every 4-5 days & after that  for sometime all queries start failing. This state remains for sometime(2-3 min max). After that log space gets freed up & everything comes back to normal again. This has become a recurring issue which happens randomly. Initially we thought that's its a temporary issue occurred because of some temporary SQL job & did SHRINKDATABASE for 1-2 times. It worked for that time. But nowadays we are facing this issue again & again & its so random that we are not able to identify what query is causing this issue.   We tried looking for expensive queries which might have caused this issue & tried to rerun again to reproduce the same issue but it didn't worked. I tried searching for this problem but every answer is about shrinking log files. I know that doing SHRINKDATABASE every time is not the correct solution. I want to find the exact cause of this issue.  How can I find the exact query which is causing the issue? Or what approach I should adopt to get solution for this problem?  Server details :   Microsoft SQL Server 2014 - 12.0.2000.8 (X64)  Recovery Model : Simple OS : Windows Server 2012 R2 Running on Intel Xenon CPU E5-2630 v3 @2.40GHz, 16 cores Installed memory - 128 GB


What is the highest amount of Fortify Archery I can receive on a single item?

I know that I can use larger soul stones to increase the amount, but it only goes so far. How do I get more? I do not have any DLC other than Hearthfire.


if $L \geq 2$ has the property that whenever $n\equiv m\mod L$, we have $n^n \equiv m^m\mod p$, then $p(p - 1) \leq L.$

Question: Let $p$ be a prime. Consider the sequence  $1^1, 2^2, 3^3, 4^4, 5^5,\cdots $  modulo $p$. Prove that the resulting sequence is periodic with the smallest period $p(p-1)$.  This means that $p(p - 1)$ is the least among all positive integers $L$ with the property that whenever$ n ≡ m\mod L$, we have $n^n ≡ m^m \mod p$. So, you have to prove that  (i) $n ≡ m \mod p(p - 1)$ implies that $n^n ≡ m^m \mod p$ and,  (ii) if $L \geq 2$ has the property that whenever $n ≡ m \mod L$, we have $n^n ≡ m^m \mod p$, then $p(p - 1) \leq L$.


Complexity of algorithms in Big O notation

What is Big O notation and why do we measure complexity of any algorithm in Big O notation? An example will do the good.