As of now I use Windows 10 Pro, and it is "ok". Recently, I used Ubuntu, because I crosscompiled Kernel for my Raspberry Pi. And although it was installed on a SPINNING hard disk, it felt more responsive and snappier than my Windows 10 Pro installation on an SSD. So now I want to make my now exclusively Windows 10 SSD a Dual-Boot system. I have enough space, but what I want to know if there is anything that could go wrong, and if I should mirror my SSD just to have a backup, in case something fails. TL;DR: I want to convert a Windows 10 Pro installation into a Ubuntu/Windows Dual-Boot system. What could go wrong? How high is the risk of failure? Is mirroring the drive before installation recommend?


if I run the lm in R, after getting the results, can I find out the normality of the residual? or I need to run another test such as qqline? here is the example:  In other words, what does the last section tells me? Thanks,  Call: lm(formula = ydata ~ xdata)  Residuals:     Min      1Q  Median      3Q     Max  -4.5401 -1.3643  0.1956  1.8130  3.1046   Coefficients:             Estimate Std. Error t value Pr(>|t|)     (Intercept) 3.188580   1.015338   3.140  0.00632 **  xdata       0.048447   0.008045   6.022 1.78e-05 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  Residual standard error: 2.297 on 16 degrees of freedom   (17343 observations deleted due to missingness) Multiple R-squared:  0.6939,    Adjusted R-squared:  0.6748  F-statistic: 36.27 on 1 and 16 DF,  p-value: 1.776e-05


Deny full node access for anonymous users

I know it's possible to deny access for the whole node, but I need it only for the full view, so anonymous users can see the teaser; when they access the node, they will get a 403 error. Is it possible?  I've tried premium content modules, but this is not what I want.


VPN not connecting automatically in Ubuntu 18.04 LTS

This could be a bug, a feature request or the fact that this feature was moved and I can't find the option in the new GUI.  In Ubuntu 16.04 LTS, as in other versions, you can cause the VPN to connect automatically on bootup or login.    There is no such option that I can find in Ubuntu 18.04 LTS.  You can connect to wifi (or ethernet) automatically but there is no provision that I can see to also engage the VPN automatically (through the Network Manager).  Once I connect the VPN by moving the slider to "ON", the connection stays on even if I log off and another user logs on which is great.


SUID   The sticky bit applied to executable programs flagging the system to keep an image of the program in memory after the program finished running.  But I don't know that what it's stored in memory. And how I can see them, in this case.?


"&" character cannot be recognized in python re pattern

I tried to use Python re package to find pattern containing "&" character but failed. I googled about whether "&" is a metacharacter. It seemed that it isn't. Here is my code :  import re if re.match("&a", "adfefwfeadf&adfewf"):     print("find1 '&'") if re.match(r"&a", "adfefwfeadf&adfewf"):     print("find2 '&'") if re.match(r"\&a", "adfefwfeadf&adfewf"):     print("find3 '&'")   Nothing is printed.


403 Forbidden errors when trying to install tlp

I just installed ubuntu with dual-boot Everything seemed alright. But then I noticed that the computer battery was draining fast. After a few searches I found a tool called "tlp". But an error happened when I tried to install. I've tried all the ways on the internet but none have worked root@radjabov-Aspire-A315-55G:/home/radjabov# apt-get install tlp Reading package lists... Done Building dependency tree        Reading state information... Done The following additional packages will be installed:   ethtool tlp-rdw Suggested packages:   tp-smapi-dkms acpi-call-dkms smartmontools linux-tools-generic | linux-tools The following NEW packages will be installed:   ethtool tlp tlp-rdw 0 upgraded, 3 newly installed, 0 to remove and 0 not upgraded. Need to get 75,0 kB/209 kB of archives. After this operation, 852 kB of additional disk space will be used. Do you want to continue? [Y/n] y Ign:1 http://az.archive.ubuntu.com/ubuntu focal/universe amd64 tlp all 1.3.1-2 Ign:2 http://az.archive.ubuntu.com/ubuntu focal/universe amd64 tlp-rdw all 1.3.1-2 Err:1 http://az.archive.ubuntu.com/ubuntu focal/universe amd64 tlp all 1.3.1-2   403  Forbidden [IP: 94.20.20.125 80] Err:2 http://az.archive.ubuntu.com/ubuntu focal/universe amd64 tlp-rdw all 1.3.1-2   403  Forbidden [IP: 94.20.20.125 80] E: Failed to fetch http://az.archive.ubuntu.com/ubuntu/pool/universe/t/tlp/tlp_1.3.1-2_all.deb  403  Forbidden [IP: 94.20.20.125 80] E: Failed to fetch http://az.archive.ubuntu.com/ubuntu/pool/universe/t/tlp/tlp-rdw_1.3.1-2_all.deb  403  Forbidden [IP: 94.20.20.125 80] E: Unable to fetch some archives, maybe run apt-get update or try with --fix-missing?


Is it proper to use "the" before the name of a government organization?

Possible Duplicate:             When I listen to major news programs, often I notice that they seem to intentionally omit "the" before the name of the government organizations. For example:     We contacted E.P.A. for comment but they refused our requests.   or     Others consider the actions of treasury to be detrimental to the economy.   These just sound wrong to me. I think it should be "the E.P.A" or "the treasury". However I most often hear this on very credible news programs (The PBS News Hour and Frontline come to mind) so I am sure they know what they're doing...  Is it proper to use "the" before the name of a government organization, or is it optional?


I have following two questions:  1) Why am I getting a NullPointerException at the line when I am calling t.i.hashCode()?   2) In what all scenarios is hashCode() method called and not called? (Does it gets calls only in cases where we are using objects of Hashing related classes?)  o/p  is null.   Exception in thread "main" java.lang.NullPointerException                     at Test.hashCode(EqualsHashcode.java:65)                     at java.util.Hashtable.put(Unknown Source)                     at EqualsHashcode.main(EqualsHashcode.java:20)   import java.util.*; public class EqualsHashcode  {      public static void main(String[] args)     {         //System.out.println("Main Method");         Test s = new Test("bharat",1);         Test p = new Test("bharat",1);         //System.out.println(s);         //System.out.println(p);         //System.out.println(s.equals(p));         Test q = new Test("bharat",2);         //System.out.println(q);         //System.out.println(s.equals(q));         Test r = new Test("bhara",1);         //System.out.println(r);         //System.out.println(s.equals(r));         Hashtable ht = new Hashtable();         ht.put(s,"1");         ht.put(p,"1");     }  }  class Test {   Test t;     String p;     int i;     Test(String s, int j)     {         p=s;         i=j;     }      public String toString()     {            System.out.println(p+".."+i);         return p+" Hashcode is"+p.hashCode();     }      public boolean equals(Object o)     {            if (this==o)         {             return true;         } else if ( o instanceof Test)         {                         t = (Test) o;             if (this.p.equals(t.p) && this.i==t.i)                             return true;             else                 return false;         } else          return false;      }      public int hashCode()     {             System.out.println(t);         System.out.println("Calling hashCode" + " "+ t.p.hashCode()+t.i);         return t.p.hashCode()+t.i;     } }


How to evaluate the integral $\int_0^{+\infty} \frac{\sin^4{x}}{x^4}dx$?

As we know that $\int_0^{+\infty} \frac{\sin{x}}{x}dx=\pi/2$,but how to evaluate the integral $\int_0^{+\infty} \frac{\sin^4{x}}{x^4}dx$?


Are "Always On Failover Cluster Instances" and "SQL Server Failover Clustering" the same thing?

I'm reading documentations of SQL Server. On this page at , it says:  Both Always On Availability Groups and Always On Failover Cluster Instances use WSFC as a platform technology, registering components as WSFC cluster resources.  I'm a little bit confused. In previous version of SQL Server (like SQL Server 2008) there is a technology called SQL Server Failover Clustering, is it the same thing as Always On Failover Cluster Instances? Hope someone can clarify on this. Thanks in advance.


Why can't my code find the module in the same directory?

It is very strange that I have some python code in the same directory:  project-root   dialog     tools        benchmark.py        populator.py        template.py        data.py   Then I can import "populator.py" and "template.py" as follows:  from dialog.tools.populator import populate from dialog.tools.template import temp   However, it reports an error when I do:  from dialog.tools.data import compute   The imported 'populate', 'temp' and 'compute' are all functions.   The error message is:  ModuleNotFoundError: No module named 'dialog.tools.data'   As a matter of fact, this worked before. It started to produce this error message after I put several independent projecgts into one git repository. This shouldn't affect this at all. This project alone doesn't change at all.   The question, why the module is reported as not found? Exactly the same as other two in the same directory.


How to install GDAL version 3.0 on Windows in order to generate GeoPDF with Qgis 3.10?

I am very enthusiastic to create some GeoPDFs using the new version of Qgis 3.10 on Windows. Unfortunately, using the OSGeo Installer, the newest gdal package version proposed is 2.4.1, which is annoying considering that the minimal required version to create GeoPDFs is the 3.0.  As described in the documentation here , I tried to install the latest gdal version through Anaconda client. Here again the latest package available is 2.3.3.  In googling on the web I also found that site =>  which gives some links to download gdal 3.0. Despite the fact that the installation is possible that way (I guess), I do not get it. Besides, how could we be sure that the gdal installation that way will be "clean" and correctly working in QGIS 3.10?  I really think that new feature of creation GeoPDFs is a real improvement. I guess I will not be an isolate case, and this is really too bad that it does not work "out-of-the-box". Maybe I am also too eager to use that function, and we have to wait a few dasy/weeks to have the new gdal 3.0 automatically suggested in the OSGeo Installer...  Could someone explain the way to install this gdal 3.0 on Windows in order to create GeoPDFs with Qgis 3.10?


Upgrading Python 3.6 to 3.7 in Ubuntu 18.04 LTS

Since Python 3.7 is already launched, I wanted to ask when will Ubuntu 18.04 will get an update to upgrade the Python3'sversion?


Unable to modify the volume with the keyboard

Sometimes, when I connect an external set of headphones/speakers, I am unable to change the volume. When I press one the volume keys, I see the image below.   Why does this happen? Interestingly, if I am playing music using software that has a volume control (e.g. Spotify or Youtube) I can still change the volume with the mouse using the application's volume bar. However, the system's volume bar is greyed out and can't change it either.


I have to find $\lim_{n\to\infty}\frac{\sqrt[n]{n!}}{n}$.  What I've got:  I express $n!$ as the product of the sequence $b_n=n$.  I know (from a previous problem) that $$\frac{1}{\sum_{i=1}^n\frac{1}{n}} \le \frac{\sqrt[n]{n!}}{n} \le \frac{\sum_{i=1}^n i}{n^2}=\frac{1}{2}$$  From this I know that the limit of the sequence is between $0$ and $\frac{1}{2}$ since $\sum_{i=1}^n\frac{1}{n}$ is divergent.  Second attempt:   I looked up the answer and I saw that the limit is $\frac{1}{e}$, so I tried expressing $\frac{\sqrt[n]{n!}}{n}$ as $$\sqrt[n]{\frac{(1-\frac{1}{n})(1-\frac{2}{n})...(1-1+\frac{1}{n})}{n^{n-1}}}$$ since I know that $(1-\frac{1}{n})^n$ converges to $\frac{1}{e}$, but this also didn't get me anywhere.  Thanks in advance!


How to install Microsoft Office 2013 on Ubuntu 14.04?

My system is running on Ubuntu 14.04 (64 bit) and I have already installed wine-1.6.2, and when I go and double click on setup.exe icon, I get the following Setup Error dialog:     Setup can't  find or validate an installation file. Please try   reinstall Office from your installation source, or if you install from   a downloaded package,please re-install. if you continue to have   problems,please contact Microsoft or your system adminstrator.   Is there any way to install Office 2013 ?  Thanks in advance.


Multi-page verbatim env changes catcode in footer

If a LaTeX2e environment verbatim spreads two pages, then in the footer of first page, catcode of symbols like $ and _ are changed to 12 (other), as if the whole footer is inside the verbatim env.  \documentclass{article}  \makeatletter \def\@oddfoot{footer: \showcatcode{\$}} \makeatother  \newcommand\showcatcode[1]{%   catcode of symbol #1\space is \the\catcode`#1\hfill }  \begin{document} \vspace*{.9\textheight} main body: \showcatcode{\$} \begin{verbatim} 0 1 2 3 \end{verbatim} \end{document}     In most cases, this won't cause any problems since the contents of footer is rather simple. But if footer contains something like tikzpicture, the error raises (see questions like  and ).  The same problem exists when using verbatim-like environments in packages verbatim and fancyhdr, but not listings. Guess listings uses another mechanism.  My question is:   Since the problem is reproducible in LaTeX2e, can we treat it as a bug? If it is a bug, how can we fix it, and fix it in the most general case? Since in the linked questions there have been solutions like 1) restore catcode by luatex only command \catcodetable@latex, and 2) save contents of footer in box.     A supplement question:   If I set \def\@oddfoot{footer: \showcatcode{\$} $a$ \showcatcode{\$}} in the above example, the output shows that the catcode of $ is always 12, but $a$ still acts like the catcode of $ is 3. How can this happen? (it seems the footer is treated differently than main body in output routine)


if white things reflect light and mirror reflect light why don't they look the same

We learned at school that white object reflects all the light that falls on it. We also learned that a mirror reflects all light as well. However, we cannot see ourselves in a white object while we can see ourselves in a mirror.   What makes a mirror different from a white surface?  If both white surface and mirror reflect all the light that fall on them, then why don't they look the same?


Is there a way to locate Strategic Resources on the map?

When you first research a technology that reveals a new resource on the map (eg.  reveals ), you can click the tip that comes up to center the map on deposits of that resource that are near your cities.   Is there a way to easily find those Strategic Resources again on later turns? So far I haven't found any method other than hovering my mouse over all of the tiles near where I thought it was to try to locate it.


How can I develop for iPhone using a Windows development machine?

Is there any way to tinker with the iPhone SDK on a Windows machine? Are there plans for an iPhone SDK version for Windows?  The only other way I can think of doing this is to run a Mac VM image on a VMWare server running on Windows, although I'm not too sure how legal this is.


Text of the same font and size is readable in English and not readable in Arabic. It is to small to recognize symbols.  some text here - بعض النص هنا  How are these situations usually handled?


The speed of light and it's variation through different media?

Does the speed of light vary?   Special Relativity says it's constant in all Inertial frames; but what if it was to travel through different media?


I'm stuck on a question in my homework:      Assume that $\Pr(A) = 1/2$ and $\Pr(B\mid ¬A) = 3/5$. Determine $\Pr(A \cup B)$.   I'm assuming $\Pr(A)$ is equal to $\Pr(¬A)$ because $1-1/2 = 1/2$. I'm confused to why this doesn't mean $\Pr (B\mid ¬A) = \Pr(B\mid A)$ (according to my friend).  Assuming the previous isn't true, I got this far:     $\Pr(¬A \cap B) =  3/5 \cdot 1/2$   Thanks for the help!


When does a new proposal/site get promoted?

From time to time we see sidebar advertisements promoting new Area51 proposals or new sites like    On what criteria are those ads chosen? Are those hand-picked, is there an algorithm? Can I do something to get a new site* in the sidebar?   * Like the new site  which has its own add now


Autohomeomorphism of the unit disk which is constant on the boundary, and which takes 0 to a prescribed point

Let $D^n$ be the closed unit disk in $\mathbb{R}^n$. I'm looking for a homeomorphism of $D^n$ to itself which is the identity on the boundary, and takes the origin to a given point $z$ in its interior. I can visualize such a function as "shifting around the mass" within $D^n$, but I can't seem to write one down.


Identify infinite sum: $\sum\limits_{n=0}^{+\infty}\frac{x^{4n}}{(4n)!}$

Find $f(x)$, the unknown function satisfying   $$f(x) = \sum\limits_{n=0}^{+\infty}\frac{x^{4n}}{(4n)!}$$   I'm looking for a direct solution which is different from mine, if possible.


Redirect to the correct URL without trailing slashes

My correct URL is http://mydomine.com/cars/register.php (without slash in the end).  But I send emails to our customers with wrong URL http://mydomine.com/cars/register.php/ (with slash in the end).  Customers cannot access the page correctly.  How to re direct them to the correct URL when they click on the wrong link?


I am trying to evaluate the effect of a certain policy on the achievement gains of students between two points in time. However, not all the students are exposed to this policy. I am supposed to use  the gain score as a dependent variable. After having read many critical articles about the use of gain scores as outcome variables, I would like to ask if somebody could tell me the advantages of this approach (compared to using the post-test score as an outcome variable while controlling for the pre-test score). Is it wrong to say that only when using the difference score as an outcome I can really answer the question of whether competences of students grow faster when they are exposed to this policy? I feel like using the post-test score as an outcome variable does not precisely give me an answer to this question. I would really appreciate if somebody could give me some advice on that


When do "when you cast this spell" effects resolve?

If I cast  and target my opponent's two  on the board, does the exile effect resolve before my opponent has a chance to tap one of the lands to play ?   My guess is that the cast effect would go on the stack & resolve prior to Ulamog being on the field and in play as a legal target for Path, but I'd like some confirmation to be certain.


Let $R$ be a ring with unity and let $G$ be a group. Then what is the center of the group ring $R(G)$? I feel that the center $Z(R(G))$ is $R(Z(G))$. I assumed if $x=\sum_{i=1}^{n} r_i g_i$, then it should commute with every element of $R(G)$. In particular it should commute with $g=1 \cdot g \in R(G)$ Thus we get $$\big(\sum_{i=1}^{n} r_i g_i\big)g=g\big(\sum_{i=1}^{n} r_i g_i\big)$$ Thus I get $$g_i \cdot g=g_i \cdot g \text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ } \forall g \in G$$ Hence $x \in Z(R(G)) $. Is this correct?


Correct notation for "slice" of Integers

Say I want to have the set of all integers between any two given integers $a$ and $b$. For example, if I want the set of all integers between $-3$ and $7$ I would get:  $$ \{-3,-2,-1,0,1,2,3,4,5,6,7\} $$  How would I go about writing this for any given $a,b$?  Note: If I wanted the real numbers between $a$ and $b$, I could use $[a,b]$, therefore since the Integers are a subset of the Reals, I could write $[a,b]\cap\mathbb Z$, but that just seems inelegant. Is there any other way?


How do you prove that $tr(B^{T} A )$ is a inner product?

Consider the vectorspace of all real $m \times n$ vectors and define an    inner product $\langle A,B\rangle = \operatorname{tr}(B^T   A)$.    "tr" stands for "trace"        which is the sum of the diagonal entries of a matrix.   How do you prove that $\operatorname{tr}(B^T   A)$ is indeed a inner product?  Kind regards


Nested Entities in Entity Component Systems (ECS)

Say I have an entity that has these components:  -Transformation  -Visual  Imagine that these components can nest:  If I have a parent transformation component, a child transformation relies on the parent transformation data.  Similarly, if I have a parent visual component, a child visual component may rely on the parent visual data.  Suppose we have two entities that both have a visual and transformation component. Say we have a concept of composing the entities themselves: which requires us to compose their respective Transformation and Visual components in some way.   Where would that logic go? Using pure ECS, these entities' components would be registered to their respective systems, but not amongst each other- Would I have to create a new system that houses the logic for composing entities that have certain sets of components?  One option would be to create a component along the lines of  VisualTransformation which gets added to an entity in addition to the visual and transformation components; This new component would have the transformation and visual components dependency injected into it:  The entity would then have  -Transformation  -Visual  -VisualTransformation  And then a system that operates on VisualTransformation components would have its own composition logic for entities that have both, and delegate some logic to the respective systems that compose them separately (TransformationSystem and VisualSystem).  This starts to exhibit a code smell reminiscent of extending deep inheritance hierarchies; clearly not an extendible solution.  My other idea is then to create a generic component-bag system that works on entities with certain component sets, and register those entities with the correct bag of components to a system. Is this the right approach? How would this be done?


Which sections of the webcomic/graphic novel are covered by "Agatha H. and the Clockwork Princess"

After spending some time reading  I was convinced to buy the  and I loved it!    The book spanned the time from the beginning to when Agatha escaped the Airship City.  She has not yet been in the wilderness, met the carnival or anything else.  What range of webcomic story does the next book, "" cover?  I'm hoping it starts from the end of the first book and goes on until she is close to castle Heterodyne.  I would like a confirmation whether or not this is the case.


Set up an Android Development Environment [ Eclipse and Android Studio ]

How can I setup an Android Development Environment?


"I'll have the Mesclun Salad, please." Note the capitals. This question concerns the definition of a proper noun and how context can subtly change this. Please refer to former question. It is a question dealing with grammar and nouns, which is Stack Exchange topic. My main question at this point is how could I find an answer to this question using the list of references as recommended: I'm still working on it.


Get All Revisions for a specific file in gitpython

I am using  library for performing git operations, retrieve git info from python code. I want to retrieve all revisions for a specific file. But couldn't find a specific reference for this on the .   Can anybody give some clue on which function will help in this regard? Thanks.


What I'd like to try and do is intersect some point buffers with census tracts, maintain their ID's and the tracts attributes.  I found a sample from  but can't exactly substitute the cascaded union for an intersect. I'm also having trouble getting the intersection function to import from shapely.ops.   from shapely.geometry import Point, mapping, shape from fiona import collection #from shapely.ops import intersection import shapely.ops  bufSHP = 'data/h1_buf.shp' intSHP = 'data/h1_buf_int_ct.shp' ctSHP  = 'data/nyct2010.shp' with collection(bufSHP, "r") as input:     schema = input.schema.copy()     with collection(intSHP, "w", "ESRI Shapefile", schema) as output:         shapes = []         for f in input:             shapes.append(shape(f['geometry']))         merged = shapes.intersection(ctSHP)         output.write({             'properties': {                 'uid': point['properties']['uid']                 },             'geometry': mapping(merged)             })   I've also got the code and sample shapefiles up here     UPDATE:  So for some reason using Shapely, the larger buffers (1 km) I lose some of the features (census tracts) in the intersect.   Also, since the Shapely responder said the OGR command is good to use I started looking for into that. Anyway, I was able to test cd'ing to the directory and it works great. However, I've been trying to experiment with it so I can loop through the many sized buffers and dif. census years. However, why is it that I cannot get the following script to work. Can I not substitute paths for the folder 'data' in the ogr2ogr response below?   import os wp = '/Volumes/Echo/GIS/projects/naas/tasks/201411_geoprocessing/data/processing/' folder = wp+'test' theGDALcmd = 'ogr2ogr -sql "SELECT ST_Intersection(A.geometry, B.geometry) AS geometry, A.*, B.* FROM nyct2010 A, hr1000m B WHERE ST_Intersects(A.geometry, B.geometry)" -dialect SQLITE '+folder+' '+folder+' -nln hr1000m_int_ct10_ogr_pytest' os.system(theGDALcmd)   The error I get is   sh: ogr2ogr: command not found   However, when I go to the terminal, I have access to ogr2ogr.     UPDATE2:  Mike T include some code so I can run this ogr2ogr command in python.


Manual focus in A mode can harm my lens?

I use 18-140 Nikkor . This lens have two A & M focus mode and this lens is AF-S that mean when auto focus is enable the focus ring dose't move. If i do manual focus when the lens is at A mode , does it harm the lens ? or its safe.


W.K.T, any user(with more than 2k rep) can review 20 suggested edits per day.  Today I saw the newly appointed moderator  reviewed more than 20.    Is it possible for moderators to review more than the daily limited count?  If yes, can any moderators can do it at any time?  I didn't see this before.


How should I install this program? Which package type is better?

I am concerned about something. I would like to install a Password manager called , it's a free and open source community maintained version of KeepassX. I am debating whether to use the .AppImage or the .snap package for the installation process found on their downloads page.       I've successfully downloaded and verified the .AppImage package. I thought I remember seeing an article that said that .snap packages are automatically verified when downloaded and installed on your system. Is this true? I understand that .AppImage packages do not require root access to run. Snap packages however do. I also heard that .snap packages are dying and are not very popular since Unity 8 died. Which one is more secure? Does Canonical maintain and review .snap packages? Which one is better in your opinion? I have barely used both of these. I've only downloaded and used a .AppImage and .snap package once so I'm not too familiar or an expert when it comes to these types of packages. I would like to know the difference and pros and cons of these two types of packages security wise. Thanks!


Mobile ARM processors for heavy 3d tasks?

I would like to know, why ARM processors, like Snapdragon 855 aren't being used for heavy tasks like blender, CAD, etc. Because if we look at them, their specs aren't so bad. 8 cores @ 2.84 GHz. Not every desktop CPU have 8 cores. If we assume, that CAD or blender could be ported to the ARM architecture, what results maybe, if we run that same task on Snapdragon 855, and downclocked i7-9700k to Snapdragon's stock 2.54 GHz(And yeah. Without hyperthreading :D). Who would win and why?


How does an almost complex structure on a manifold induce an orientation?

I have read that given a smooth even dimensional manifold $M$ with an almost complex structure $J$, then $M$ is orientable and there is a canonical choice of orientation.  Why is this the case? How does one construct the orientation?  Thanks!


How to back a generic data structure with an array in Java?

I have a good understanding of data structures and can happily implement them in C++ without issue; I get a little tripped up in Java though due to the generic implementation constraints.  Specifically, I get confused when I'm trying to create a data structure backed by an array.  I know, for example, that I cannot do this:  public class HashTable<T> {     private T[] table;         public HashTable() {         table = new T[10]; //Type param T cannot be instantiated directly.     } }   I also know that if I back my generic array list with an object array, I'm going to have to suppress a number of "unchecked cast" warnings which seems of ill form.  What is the best way to create an array-based data structure in Java?  Is there some trick that can be used to do it in a cleaner manner than just creating a straight object array and dealing with the messy casting?


Can I install PERGO Locking Hardwood Flooring in wet areas?


Package incompatibilites: etoolbox, hyperref, and bm, standalone?

I am trying to transition to using the etoolbox package, but seem to have run into some difficulties and they appear related to the hyperref and bm packages which to me seem totally unrelated.  The MWE example compiles since \RemoveEToolbox is defined and shows that there is no apparent problem before etoolbox was used.    Commenting out the \def\RemoveEToolbox{} line produces two problems:   With both the \renewcommand, and the usepackage{hyperref} commented, this results in "Runaway argument? Paragraph ended before \bm@test@token was complete". Including the usepackage{hyperref} (with \renewcommand commented) results in "Undefined control  sequence. \Call@AtVeryEndDocument ...cumentHook \@undefined"   But if uncomment the \renewcommand{\bm}{#1} line (effectively doing without any \bm), then this seems to compile.  I have been using this for a while now and things appeared to have been working fine, but now that I attempt to use etoolbox I seem to run into problems.  \documentclass{standalone} \def\RemoveEToolbox{}% Shows that this works fine without {etoolbox}  \usepackage{amsmath} \usepackage{xcolor} \usepackage{bm}  \ifdefined\RemoveEToolbox     \newcommand*{\iftoggle}[3]{#2}% Default to true value of "if" \else     \usepackage{etoolbox}     \newtoggle{paper}     \toggletrue{paper}      %\renewcommand{\bm}[1]{#1}% Why can't I have a normal \bm with {etoolbox}? \fi  % \usepackage{hyperref}  \begin{document}  This document is intended for  \iftoggle{paper}{paper}{electronic} distribution.  \bm{\textcolor{blue}{Solve $x^2-1=0$}}  \begin{align*}     a &= b\\     \iftoggle{paper}{         c &= d\\     }{}     e &= f\\ \end{align*} \end{document}


Firefox's spell check defaulting (and reverting) to the wrong language

I'm using Firefox (v. 26 for Ubuntu). I'm in the U.S., and I keep setting the spell check to U.S. English (right click on a word marked as incorrectly spelled, choose Languages, then the correct one). It briefly remembers, but after an hour or so (even within the same session) it reverts to Canadian English.  I'm a web developer and am fine with hacking about:config, but although I've set spellchecker.dictionary to en_US, it doesn't seem to stick around.  Is there any other setting I'm missing?


How find square brackets in SQL by LIKE expressions?

I need to find by sequence which contains symbols [] like !@#$%^&[]{}<>?/,.*(^ with a like expression in SQL Server 2014.   How I can escape brackets to find records which contains target string?  Example  SELECT *  FROM [TARGET_TABLE]  WHERE [TARGET COLUMN] LIKE '%"!@#$^&[]{}<>?/,.*(^"%';   [TARGET TABLE] has a row with [TARGET COLUMN] which value is   some text "!@#$^&[]{}<>?/,.*(^"   but result of expression is empty.  I know what [] is wildcard, but don't know how escape brackets to find strings with them.


What happens with effects that lasts until end of dead creature’s next turn?

If a spell has a duration that lasts until the end of the caster’s next turn, such as booming blade, and the caster dies before then, is the spell ended when they die or does it continue until when their turn would have occurred?


How can I generate 2 sets of variables from different distributions with a correlation between them in r?

I am working in R and would like to generate 40 numbers from $\mathrm{N}(0,1)$ and another 40 from $\mathrm{Uniform}(0,2)$ with a negative correlation (for example: $r = -0.45$) between them. The correlation does not have to be exact.   I've done something similar for 2 normally distributed variables by specifying a co-variance matrix - see R code below:  sigma <- matrix(c(.33,-.23,-.23,1), ncol=2, byrow=T)  mu <- c(1,0)  ab <- mvrnorm(n=40, mu, sigma)   One thing I considered was using the above code and then transforming one of the normal variables to a uniform but I am not sure how to go about doing that.


rectangles inside a matrix - dotted and continuous lines

I'm trying to implement the appendix image, making an script in LaTeX.  After consulting some forums I obtained the next script but the dotted lines don't appear.  PS. I'm new in Latex!  \documentclass{minimal}  \usepackage{amsmath}   \usepackage{arydshln}  \begin{equation} \label{eq10}   T_6^{0} = \left [   \begin{tabular}{cccc:cc}   \cdashline{1-4}   \multicolumn{2}{:l}{1}    & 0     & 0    & \multicolumn{2}{c:} {\(p_x__{req}\)}   \\   \multicolumn{2}{:l}{0}    & -1    & 0    & \multicolumn{2}{c:} {\(p_y__{req}\)}    \\   \multicolumn{2}{:l}{0}    & 0     & -1   & \multicolumn{2}{c:} {\(p_z__{req}\)}  \\ \cdashline{1-4}   \multicolumn{2}{c}{0}     & 0     & 0    & \multicolumn{2}{c:} {1}    \end{tabular}  \right ] \end{equation} \end{document}


How does static affect synchronized methods?

If a class has these two methods:  public static synchronized void m1() {}  public synchronized void m2() {}  Can two threads execute these two methods at the same time?


Why do I get an "unmet dependencies" error when trying to install WINE?

When trying to install WINE (sudo apt-get install wine) I get the following error:  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:  wine : Depends: wine1.5 but it is not going to be installed E: Unable to correct problems, you have held broken packages.   Google does tell me that apparently this has something to to with ia32-libs, but I cannot find out how to do to fix the dependencies or if I need to (manually?) install something else.  I have added ppa:ubuntu-wine/ppa to my repositories.  sudo apt-get install wine1.5gives me  The following packages have unmet dependencies:  wine1.5 : Depends: wine1.5-i386 (= 1.5.4-0ubuntu1~ppa1~precise1+pulse17)   sudo apt-get install wine1.5-i386gives me  The following packages have unmet dependencies:  wine1.5-i386:i386 : Depends: libgphoto2-2:i386 (>= 2.4.10.1) but it is not going to be installed                      Depends: libgphoto2-port0:i386 (>= 2.4.10.1) but it is not going to be installed                      Recommends: gettext:i386 but it is not going to be installed                      Recommends: libsane:i386 but it is not going to be installed   Any help would be appreciated. Thanks.


Uniform distribution on $\mathbb{Q} \cap [0, 1]$ (sort of)

Can you find a real-valued random variable $X$ that is almost surely rational but also such that, for any $a, b ∈ \mathbb{Q} \cap [0, 1]$ with $a < b$, $p(X ∈ [a, b]) = b - a$? If not, can you prove that no such $X$ exists?


How can I create a dual boot, keeping in mind my pc boots to Ubuntu?

So I got 2 new 500GB hard drives and I installed Windows 7 first on the first hard drive and on the second I installed 12.04 ubuntu.   Is there any software that I can use to make it easier to get a boot menu to choose the os that I want to boot into?


Since Pi or $\pi$ is an irrational number, its digits do not repeat. And there is no way to actually find out the digits of $\pi$ ($\frac{22}{7}$ is just a rough estimate but it's not accurate). I am talking about accurate digits by either multiplication or division or any other operation on numbers.  Then how are the first digits of $\pi$ found -     3.1415926535897932384626433832795028841971693993...   In fact, more than 100,000 digits of $\pi$ are found (sources - )  How is that possible? If these digits of $\pi$ are found, then it must be possible to compute $\pi$ with some operations. (I am aware of breaking of circle into infinite pieces method but that doesn't give accurate results.)  How are these digits of $\pi$ found accurately? Can it be possible for a square root of some number to be equal to $\pi$?


I am trying to submit the login on pressing the Enter key, earlier everything was under a form tag so it would work on pressing the Enter key. But now it won't, could someone please give me a fix for this.  HTML:

Please Sign In

                                                   <input type="text" name="user" id="user" placeholder="Username" class="form-control" required/>

                                                   <input type="password" name="pass" id="pass" placeholder="Password" class="form-control" required/>

         <input type="submit" value="Sign In" id="submit-login" onclick="save()" />


concatenate strings within list python to give different output

I have list of strings shown below. I want to combine each string with every other string to give unique combination.  listTags = [ "TOT" , "WBA", "BUR", "SOU", "HUL", "SUN", "STK", "SWA", "ARS", "CHE", "MUN", "WHU", "WAT", "MID"   "WHU", "CRY", "LEI", "EVE", "MCI", "LIV"].   So for above list it would be #TOTWBA, #TOTBUR, #TOTSOU...etc. How can I do this in python?


How Could Merlin Possibly Study in Slytherin House Centuries Before it Was Founded?

How Could Merlin Possibly study in Slytherin House Centuries Before it Was Founded?  This is not a duplicate of questions about Merlin's biography in Harry Potter  like : it is asking how Merlin could have possibly studied magic in Slytherin House.   To all of us Muggles, the most famous wizard of all was Merlin, the wizard at the court of King Arthur, a wizard who was active centuries before Hogwarts and Slytherin House were founded.   The character of Merlin in all medieval romances is based on the character of Merlin in Geoffrey of Monmouth's Historia Regum Britanniae,  circa 1135.  Geoffrey in turn based Merlin on at least two legendary and possibly historical men, Aurelius Ambrosius and Mryddin.  According to the Historia Brittonum, circa 832, Aurelius Ambrosius was a king of the Britons in the 5th Century AD.  Geoffrey includes Aurelius Ambrosius as a King of the Britons, but takes the story about Aurelius Ambrosius as a magical boy confronting King Vortigern and adds it to the biography of his wise man Merlin.  According to Welsh legend (and possibly history) Mryddin was a British warrior and seer in north Britain who went insane and live as a wild man in the woods after his lord was killed at the Battle of Arthuret about 574 AD.  Geoffrey took a few details from the legend of Mryddin and used them for his Merlin.  So Merlin is more or less based on two different men, who lived in different parts of the period from 400 to 600 AD.  Furthermore, Merlin is famous as being a wise man and/or wizard at the court of King Arthur.  The Annales Cambriae, circa 975, say that Arthur won the Battle of Baden in a year corresponding to 516, 517, or 518, and was killed at the Battle of Camlann in a year corresponding to 537, 538, or 539.  Geoffrey of Monmouth's Historia Regum Britanniae, circa 1135, dates the Battle of Camlann to 542 AD.   Arthur is also famous for leading the Britons against the invading Angles, and Saxons, and Jutes (oh my!) and so has to be dated before about 600 AD when they already ruled all of southern England.  So anyone who knows anything about British history, legend, and chronology associates Merlin the Wizard with the 6th century AD, when he did all his famous deeds.  Merlin could have used magic to live for centuries or millennia after that date, but he isn't famous for doing anything great after the 6th century so would have lived quietly and out of sight in later centuries.   But it is claimed that Merlin was a graduate of Hogwarts and Slytherin House, though Hogwarts wasn't founded until centuries after Merlin gained his fame.      In his answer here LCIII quotes Pottermore:     "Here’s a little-known fact that the other three houses don’t bring up much: Merlin was a Slytherin. Yes, Merlin himself, the most famous wizard in history! He learned all he knew in this very house! Do you want to follow in the footsteps of Merlin?"    Merlin's famous wizards cards say:     Medieval, dates unknown   Most famous wizard of all time. Sometimes known as the Prince of Enchanters. Part of the Court of King Arthur.   and:     Merlin is the most famous wizard of all time. He is sometimes known as the Prince of Enchanters and was part of the Court of King Arthur.[58]      But I don't know if this is canon, or what details about Merlin's biography in HP sources are canonical.  Is Merlin in Harry Potter supposed to have lived backwards in time like he did in The Once and Future King?


What is the physical significance of dot & cross product of vectors? Why is division not defined for vectors?

I get the physical significance of vector addition & subtraction. But I don't understand what do dot & cross products mean?   More specifically,    Why is it that dot product of vectors $\vec{A}$ and $\vec{B}$ is defined as $AB\cos\theta$? Why is it that cross product of vectors $\vec{A}$ and $\vec{B}$ is defined as $AB\sin\theta$, times a unit vector determined from the right-hand rule?   To me, both these formulae seem to be arbitrarily defined (although, I know that it definitely wouldn't be the case).   If the cross product could be defined arbitrarily, why can't we define division of vectors? What's wrong with that? Why can't vectors be divided?


I would like to prove the following equality: $$k^{\phi(l)} + l^{\phi(k)} \equiv1\pmod{lk}$$if $\gcd(l,k)=1$. What methods can I use? Thank you for your help.


I am a system administrator and i have been asked to setup a Cloud Lab where following will be covered.  What I would like to know is what is the minimum number of hardware for servers, storage and networking is recommended to run this lab.   The courses taught are Open Nebula/ Eucalyptus, Globus Toolkit and would be approximately 60 hours. Maximum student capacity is 30 at a time.  Few Topic which will be covered are   GRID COMPUTING LAB:  S/W used : Globus Toolkit  ()   Develop new OGSA-compliant Web Service. Using Apache Axis develop a Grid Service. Develop secured applications using basic security mechanisms available in Globus Toolkit. Develop a Grid portal, where user can submit a job and get the result. Implement it with and without GRAM concept.   CLOUD COMPUTING LAB:   S/W : Eucalyptus() or Open Nebula to achieve    Find procedure to run the virtual machine of different configuration. Check how many virtual machines can be utilized at particular time. Find procedure to attach virtual block to the virtual machine and check whether it holds the data even after the release of the virtual machine. Find procedure to install storage controller and interact with it. Find procedure to set up the one node Hadoop cluster. Mount the one node Hadoop cluster using FUSE.


Please give a proof for the given expression

$$\int ydx + xdy=\int d(xy)$$   This is a common equality used for solving various questions, but many solutions just write this without any explanations. How do we derive that equation? (Limits aren’t really necessary, they can be added depending on the question. I just want a sort of general proof for this)


Need to sort Files based on date created

I have seen other post but can't seem to put it well in my post. Could someone help me with this.i am able to view the files and open them but need them to list from the recent create to oldest. Below is my code.       private List<String> fileList = new ArrayList<String>();      @Override     public void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     String root = Environment.getExternalStoragePublicDirectory("/MyAppFolder").             getAbsolutePath();     // ListDir(root);      pdf = new File(root);     ListDir(pdf);    }      void ListDir(File f) {     File[] files = f.listFiles();     fileList.clear();      for (File file : files) {            fileList.add(file.getName());      }        ArrayAdapter<String> directoryList = new ArrayAdapter<String>(this,             android.R.layout.simple_list_item_1, fileList);      setListAdapter(directoryList);    }    public void onListItemClick(ListView parent, View v, int position, long id) {     //selection.setText(fileList.indexOf(simple_list_item_1));     OpenPdf(fileList.get(position).toString());   }      public void OpenPdf(String path)   {       File file = new File(path);       if (file.exists()) {           Uri p = Uri.fromFile(file);           Intent intent = new Intent(Intent.ACTION_VIEW);           intent.setDataAndType(p, "application/pdf");           intent.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);            try {               startActivity(intent);           }            catch (ActivityNotFoundException e){           }       }   } }


Pardon if this has been asked and answered already here, I couldn't find it by myself.   What is the difference between giving in and giving up? I know one means that you're giving up/in and letting someone else do it, other has no continuous actions.   Could someone explain this, please?


What preconditions exist so that a photon travels 299,792,458 m/s?

For example, A 9mm bullet travels 380 m/s. Preconditions: The spark from the primer ignites the gunpowder. Gas converted from the burning powder rapidly expands in the cartridge. The expanding gas forces the bullet out of the cartridge and down the barrel with great speed. A photon travels 299,792,458 m/s. Preconditions:  What are they? Why does it travel at exactly that speed? Why not faster/slower?  Thanks.


I am writing a report in Latex, I am using Latexila.  I wonder how can I display a section (defined by \chapter*{Introduction})  in my able of contents. In fact, the table of content doesn't show (Introduction) when I compile and I execute the PDF. Any Idea?


Sci-fi series: humans are immune to telepathy, become soldiers for an alien group fighting against invertebrate telepaths

The series involves two groups of aliens who have been fighting an interstellar war for many years before the first book.  The war is started by a race of jellyfish-like telepaths who have used their powers to control several species which they use as soldiers.  The jellyfish aliens have declared a holy war against all sapient vertebrates.  The only species on their side that aren't being actively controlled through their telepathy are invertebrate species who have joined the holy war.  In this series, humans are immune to telepathy--what's more, a completely unconscious reflex tends to destroy the mind of anything even attempting to affect their minds.  One of the central themes of the series is how well suited humanity is to warfare, and all the sacrifices forced on humanity as they become nothing but soldiers fighting against the jellyfish, losing almost all culture not in some way related to being soldiers, as the other races in their alliance take over the other roles.  Other species I recall include a bird race that is gifted at linguistics but can be sent into shock by even seeing a low quality recording of a human walking around a room.  They just cannot handle the hide or flee reflexes triggered by seeing such an obvious predator.  Another race is a crab like group that is so antisocial they all keep suicide buttons at hand when working with other races, and only work to help the human alliance's side because the jellyfish won't leave them alone.  There is a race that bears a faint resemblance to large rats who were previously the best soldiers on their side, and another renowned for their intellect.


What's the value of the “genocide” and similar questions on the US immigration form I-94?

It's been a while since I’ve been to the United States, so I’m not sure whether it’s still being used, but I remember having to always fill out  which asked some odd questions: such as whether you've ever been involved in genocide or espionage or whether you're seeking entry to engage in criminal or immoral activities.  I've always wondered what the value of these questions is. I assume US immigration officials are not naive enough to believe anyone would truthfully answer “yes.” But I assume these questions aren’t just there to “amuse” travelers either. The only thing I can think of is that lying there can be used against someone in court later? Is that correct, or is there some other value to asking these questions?


"I became good friend with the man I met yesterday." or "I became good friendS with the man I met yesterday."

I became good friend with the man I met yesterday.   I became good friend{s} with the man I met yesterday.  Should "friend" be in plural or singular? Which one is right: "friend" or "friends"?


I currently use Ubuntu 13.04 on LG X110 notebook After last updating (on 28th August 2013) software doesn't work. It suddenly stops while I'm using it. Hardware still runs: I know because of the noise, but noise it has during doing no operation. Software doesn't work at all: desktop is frozen, mouse is blocked, any keyboard command gives no result.  I already uninstalled Xubuntu, in case there was some bug with it, but it just doesn't matter.  Any suggestion?


Two body problem - Orthogonal trajectories

I am building a two body problem simulation in one dimension (plus time). Two masses m1, m2 at rest that start moving because of gravitation attraction and eventually meet.  I read that the problem has no closed form solution, so I opted for a numerical one (leapfrog). However, searching here I found several expressions for the velocity of the bodies (something that I need in order to depict the orthogonal curves to the (spacetime) trajectory of the bodies, which is the ultimate goal of the simulation, hence the title.) For instance:        I may have found one or two more that I can't locate now.  So my question is, is there a non numerical solution for this problem -- and I mean a solution that gives you algebraic equations for x1, x2, v1, v2 that I can use in the simulation (not integrals that may or may not be solvable). If so, what is it? Is any of the above expressions correct? (Please no polar coordinates if possible.)  Responding to the first comment below, the equations I am using are the usual equations for the two body problem:  $$F_1=G\frac{m_1m_2}{(x_1-x_2)^2}$$  therefore  $$\frac{d^2x_1}{dt^2}=G\frac{m2}{(x_1-x_2)^2}$$  As I have mentioned, I am using numerical leapfrog integration.


My friend has a Galaxy Nexus and I just got an HTC One X, and we both have the newest version of Minecraft Pocket Edition.   We want to play on a server together (we will be sitting right next to each other), but when I opened the game and made it visible (I was connected to the local WiFi network and he was connected to the same one), he couldn't access it, and vice-versa when he tried to host.   Am I missing a step or do we have to be over the data network? Does the game host phone have to be running as a mobile hotspot?


At what stage of research career one can write a 'review article'?   Obviously a graduate student in the beginning stages cannot/may not write one. But how experienced does one need to be before attempting to write reviews? Does authoring a number of papers in the relevant field equips one for that?   Can a graduate student publish a review article? Do acceptance of review article (for publication) depends on the reputation of the author or co-authors?  EDIT:  As @JeffE has pointed out anyone can write a review article; the question is about getting this write-up published.


How to show that $K\leq S_4$ is a normal subgroup?

Let $K=\{(1),(1,2),(3,4),(2,4),(1,4),(2,3)\}$ is a subgrope of $S_4$, we want to show that it is a normal subgroup.  I know that i have to examine the condition of normality in $S_4$ i.e. for all $g\in S_4, g^{-1}Kg=K$. I think this takes times or I am missing something near. Please give me the right hint. Thank you.  Edit: $K = \{(1),(12)(34),(13)(24),(14)(23)\}.$


unable to mount sd card from sony camera to ubuntu 16.04.1 system

I have a Sony CyberShot DSC-H70 camera, with a SanDisk 128 GB Extreme SD card. After taking 50 or so pictures, I decided to mount the card onto my Toshiba Satellite C655 running Ubuntu 16.04.1, but got the following error message. Is there anything that I can add to the system to make it able to mount? Thanks, in advance...  Error mounting /dev/sdb1 at /media/skline47/disk:  Command-line `mount -t "exfat" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,iocharset=utf8,namecase=0,errors=remount-ro,umask=0077" "/dev/sdb1" "/media/skline47/disk"'  exited with non-zero exit status 32: mount: unknown filesystem type 'exfat'


Mr. ABC has lived in California since 2010, and he resides with his wife and two children.  Please let me know if "has lived in" in the above sentence is correct? Should it be " has been living in ...." since he still resides in California.  .......................  Since graduating from the University in 2009, Mr. ABC has resided in Las Vegas.   Same question as above.  * Should it be " has been residing in ...." since he still resides in California.  Thanks & Regards


Which one is better Ubuntu 12.04.3 (32 bit) or (64 bit)?

i am going to Download Ubuntu 12.04.3 LTS, and i will Burn it to a DVD...  i try it with USB and it was 64 bit.. and gives error in middle.. so this time i am using a DVD maybe it might work...  But i dont know which bit to use 32 bit Or 64 bit... but i am thinkng maybe it gives the error again with 64 bit  i have 4GB Ram... and Windows 8 PRO 64 bit  and i Love Ubuntu alot.... its just Amazing and Fast... and i just Try (Try it Without Installation) and it was Awesome!


In 20 over game.... first team scored 152 all out in 16.2 Over and second team scored 153/6 in 17 over.what is the run rate?


Auxhook warning cannot patch document using AtBeginDocument instead

I'm using subfiles within my report (written on sharelatex), when I compile a subfile it produces a warning. Am I doing something wrong or is this normal?  Example  \documentclass[report.tex]{subfiles} % \usepackage{acronym} \begin{document}  some text  \end{document}   Error     /usr/local/texlive/2015/texmf-dist/tex/latex/oberdiek/auxhook.sty   Package auxhook Warning: Cannot patch \document, using \AtBeginDocument instead.   When I compile the main document it does not produce this warning.  The raw log file produces this warning     ......   Package: auxhook 2011/03/04 v1.3 Hooks for auxiliary files (HO)   Package auxhook Warning: Cannot patch \document,   (auxhook)                using \AtBeginDocument instead.   ) (/usr/local/texlive/2015/texmf-dist/tex/latex/oberdiek/kvoptions.sty   Package: kvoptions 2011/06/30 v3.11 Key value format for package options (HO)   ....    Packages  I'm using the following packages:    \documentclass[whitelogo]{tudelft-report}   % Used for referencing   \usepackage{natbib}   % For writing remarks in the text (is this going to be used?)   \usepackage{changes}   % used to write and render different subfiles   \usepackage{subfiles}   % used to draw boxed problems   \usepackage{mdframed}   % for subcaptions in combined figures   \usepackage{subcaption}    % used for Epigraphs of course   \usepackage{epigraph}   % Makes weblinks clickable   \usepackage{hyperref}   % used to display pictures   \usepackage{graphicx}   % used to add urls with strange symbols   \usepackage{grffile}   % used for H command in figures   \usepackage{float}   % used for tickz pictures (Causes a warning)   %\usepackage{pgfplots}   %used for the acronym page [printonlyused,withpage] are options   \usepackage{acronym}    % ######################### open section for code appendix #######################   \usepackage[utf8]{inputenc}   \usepackage{listings}   \usepackage{color}   \definecolor{codegreen}{rgb}{0,0.6,0}   \definecolor{codegray}{rgb}{0.5,0.5,0.5}   \definecolor{codepurple}{rgb}{0.58,0,0.82}   \definecolor{backcolour}{rgb}{0.95,0.95,0.92}


Why is it bad to name a variable id in Python?


Changing your bullet points in beamer block, maybe boadilla?

Can anyone give me a list of the different styles of bullets in beamer?  I am looking for the command that will give me the typical 3d looking blue ball in a block I know where to input it in my  \item [\...?....]  I think I'm looking for \usepackage{boadilla} but i don't know how to get this.   help a newbie out?


Does synchronized if apply to whole block

This is not a question about method synchronisation, only to statement synchronisation. Please do not incorrectly mark as duplicate.  Is this code:  synchronized (this) if (something) {     somecode();     somemorecode(); }   equivalent to this code:  if (something) {     synchronized (this)     {         somecode();         somemorecode();     } }


After pressing the log in button it would said updating minecraft and after that it said Failed to launch Fatal error occurred (4): null I have forced an update and updated Java but it still doesn't work. Not even the demo works.


In which location are Ubuntu packages installed?

There is an Ubuntu application called remote desktop viewer, I want its location to run in a script, how can I get the package details?


Ceiling Function Proof from First Principles?

My question is whether it is possible to prove that a ceiling function exists ie.  If $a\in\mathbb R$, then there exists $n\in\mathbb Z$ satisfying $a\le n< a+1$.  The only solutions to this that I have found are those which involve floor/ceiling functions within the proof itself.  Where would one start in solving a proof like this? Possibly proof by contradiction?


just to clarify.  If i wipe my ubuntu budgie hard disk, the bootloader will be removed and replaced, right?  thanks


Java Thread Synchronization Concept Static Function

Recently my friend was asked this question in an Interview.  Question: We have class A with 2 methods X1 and X2. X1 is static synchronized and X2 is synchronized.  class A {     public static synchronized X1() {     }     public synchronized X2() {     } }   Now we know that static synchronized attains the lock on CLASS and synchronized attains the lock on calling object.  Interviewer asked that "what do you mean by lock on CLASS?". The lock is always done on Object. Then what actually happen in case of static synchronized. It attains lock on WHICH OBJECT?   Can someone clear this concept for me as its getting a little confusing out here.


How to avoid Gimbal Lock on Rubik's Cube

I am making a Rubik's cube program. That will simulate a Rubik's cube. I am having problems with gimbal lock. I need to know how to avoid it. To my understanding I can either multiply the x, y, z rotation matrices in a specific order to acquire the rotation I am trying to get. Or I can use a quaternion which is like rotating around a single user defined axis instead of the axis x, y, or z. I can't really understand visually how I can get the resulting axis from two other axis. (x, y, z) How can I get the resulting axis for my quaternion from my Euler rotations? Will it just result in gimbal lock again?  One of the big problems is. I don't know what rotations are going to be made. I need to make it general purpose.  Edit: Little bit more documentation of my problem:  My Euler matrix multiplication looks like this      rotate = XMMatrixRotationX(content.mesh[meshToRotate[i]].rotation.x) * XMMatrixRotationY(content.mesh[meshToRotate[i]].rotation.y) * XMMatrixRotationZ(radians);     content.mesh[meshToRotate[i]].rotation.z = radians;   As a gimbal lock would suggest the last axis in the rotation gets the problem. When you attempt to rotate the front or back face you get problems.


I've seen many other questions on this subject but none seem to actually solve my problem. Like any other day, I connect to my LOCAL Raspberry Pi server from my client machine at 192.168.0.5 with ssh pi@192.168.0.4. I then have to wait around 4 to 5 seconds before getting a Password: prompt.  By reading other questions I have found various papered fixes such as setting UseDNS to No in Server SSHD_CONFIG file. This does work and fixes my problem, giving me the password prompt almost instantly but this does not fix my problem in the sense of fixing the actual DNS. I thought because this was on my local network that it did not require reverse lookup?


Simultaneous collision for MD5 and SHA1?

I know that both MD5 and SHA1 are considered cryptographically broken now that collisions can reasonably be computed. The question I have is: What is the likelihood that a collision could be found for data hat is hashed by each independently?  For instance, would it be reasonably be possible to do something such as …  [Hashed Doc] => [MD5] [Hashed Doc] => [SHA1]  [Fake Doc] + [Padding] => [MD5] [Fake Doc] + [Padding] => [SHA1]   where the adjusted padding for the fake document caused both signatures to remain the same?


How can I access my copy of Minecraft from a new Xbox account?

I have purchased and downloaded Minecraft on my old account, and I had to make a new account (on the same Xbox 360 console).   However, now it want let me play the full version of Minecraft, only the trial - it's trying to charge me $19.99 even though I have purchased it on the other account.   Is there any way I can get my copy of Minecraft to the new account and play the full game instead of having to buy it again?


I am trying to read xlsx do documents, find specific lane and print an area, but w/o printing None-lanes. Also break the cycle when "None" is in specific column.  def some():     for r in range(1, ws.max_row):         for c in range(1, ws.max_column):             db = ws.cell(row=r, column=c)             if db.value == 'this one':                 for rows in ws.iter_rows(min_row=r + 1, min_col=c - 1,                                          max_row=r + 30, max_col=c):                     for cell in rows:                         if cell.value is None:                             if column_index_from_string(db.column) == c:                                 return                         else:                             print(cell.value, end=" ")                     print()   This code returns the only 1 lane and then break the head cycle. Output:  1315 text. Format of document: . I cant resolve this issue. Please excuse for native errors. I am new python and just looking for the answer.


How is the zero flag set in terms of hardware?

I'm angling this as a general question on the assumption that it doesn't differ significantly with architecture - at least at the level I'm asking.  I'm curious how - in terms of hardware, not the obvious 'result is zero' - the zero flag/status bit is set (or cleared for that matter).  It never really occurred to me before, but it seems a fairly intensive task, at least relative to say, a carry or overflow flag. Am I correct in thinking there's no way to know the result is zero, other than to check each bit?  Unless I'm missing something obvious, it seems that it must take 'a lot' (if that's sensible to say in \$\text{ns}\$) longer than determining the overflow, and the carry status of course is 'already there' as a consequence of the operation.  My question, really, is just how is it 'usually' implemented?


Changing email address associated with account?

Is it possible to change the email address associated with all my stack exchange accounts, and can I do this from the Android app?   The Android app logs me in automatically but not my web browser at the moment and I even forgot the actual email address associated with my account.


I can't catch any pokemon or get items from PokeStops. How can I fix it?

I am at level 15 and have 200 Pokemon. I am not able to catch any Pokemon. They come out and run away just after they get in the Pokeball. I am not able to get anything from PokeStops either. How can I fix it?


How to prove that $\int_0^1 x^{-x}\text{d}x=\sum_{n=1}^{\infty} n^{-n}$

I've been trying to prove that $$ \int_0^1 x^{-x}\text{d}x=\sum_{n=1}^{\infty} n^{-n} $$ Mathematica told me that's true, but I don't know how to solve it. Is there any way to prove it?


Determining the angle degree of an arc in ellipse?

Is it possible to determine the angle in degree of an arc in ellipse by knowing the arc length, ellipse semi-major and semi-minor axis ? If I have an arc length at the first quarter of an ellipse and I want to know the angle of it, what is the data that I will need it to use it and what is the exact method to use it?  Please take a look at this picture:    Actually I know how to determine the arc length of a ellipse . but I want to do the obverse.


Autostart mobile hotspot when starting smartphone

Is there some way to autostart the mobile hotspot once turning on the smartphone?  We have an external device relying on a mobile hotspot. We need some way to always run mobile hotspot when the phone is alive.


I have a SQL Server 2008 R2 cluster on Win2008 R2.   I am unable to add a login for the service account.   Any other login I add to this instance works fine and I have been able to add the same service account login to numerous other SQL instances.   Moving the instance to other node does not resolve the issue.   when I run   CREATE LOGIN [DOMAIN\ServiceAccount] FROM windows;    I get the error  Msg 15401, Level 16, State 1, Line 1 Windows NT user or group 'DOMAIN\ServiceAccount' not found.      Check the name again.    When I run   exec xp_logininfo 'DOMAIN\ServiceAccount', 'all';    I get the error  Msg 15404, Level 16, State 11, Procedure xp_logininfo, Line 62 Could not obtain information about Windows NT group/user      'DOMAIN\ServiceAccount', error code 0xffff0002.    Any suggestions would be appreciated.


How was the sword of Gryffindor pulled from the hat a second time?

Spoilers follow, and this is from the books (not the movies)...  In The Chamber of Secrets:      Harry retrieves Goderic Gryffindor's sword from the sorting hat during the confrontation with the basilisk. After this Dumbledore keeps hold of the sword in a glass case in his office.    Then in The Deathly Hallows:      Harry and Ron do a deal with Griphook to return Gryffindor's sword to the goblins after they have retrieved Hufflepuff's cup, planning to partially double cross him by holding on to it until all the horcruxes have been destroyed. However Griphook double crosses them first, and keeps hold of the sword.   Then, in the battle at the end of the book:      Voldemort puts the sorting hat on Neville Longbottom's head and sets him on fire. Instead of burning Neville pulls Gryffindor's sword out of the sorting hat and beheads Nagini, destroying Voldemort's last horcrux.   However, if the sword could always be pulled out of the hat by someone sufficiently heroic then why the need to:      Create a copy of the sword to fool Bellatrix Lestrange into thinking she had the real one in Gringott's vault? Why forge a copy and risk Snape placing it in the lake if it could always have been pulled from the sorting hat, regardless of where it was or how it was protected?   How was Gryffindor's sword pulled from the hat the second time? Surely it was beyond the reach of accio or any other charms once returned to its goblin creators?


Does VB.Net have an equivealent for c#'s yield break?  Public Function Validate(validationContext As ValidationContext)                  As IEnumerable(Of ValidationResult)                  Implements IValidatableObject.Validate     '' what is equivalent to C#'s - yield break; End Function


How to make text margins follow a specific shape?

How can text be formatted as in this example from Alice in Wonderland, where the margins for the text seems to follow a specific shape (if that's what's actually happening..sorry if I'm clueless here), while also the text size decreases? I think I can find out how to manage the shrinking text (like ) but not the margin-shape.


So -  Black holes possess a gravitational force so great it can pull anything in. Including light. So placing these side by side, If I were to shoot a laser pointer out of a cannon at a black hole, and also be standing stationary pointing a laser at a black hole, conventional logic would tell me that the light from the cannon-shot laser would be traveling faster than light once captured in the gravitational field of the black hole, as opposed to the light from my stationary laser in the same gravitational field. Am I right? or am I confusing some part of the theory relativity in here?  Thanks!


Is there a way for me to simplify these echos?

I am still learning how to shell script and I have been given a challenge to make it easier for me to echo "Name1" "Name2"..."Name15" and I'm not too sure where to start, I've had ideas but I don't want to look silly if I mess it up. Any help?  I haven't actually tried anything just yet it's all just been mostly thought.  #This is what I wrote to start   #!/bin/bash  echo "Name1" echo "Name2" echo "Name3" echo "Name4" echo "Name5" echo "Name6" echo "Name7" echo "Name8" echo "Name9" echo "Name10" echo "Name11" echo "Name12" echo "Name13" echo "Name14" echo "Name15"   My expected results are obviously just for it to output "Name1" "Name2" etc. But I'm looking for a more creative way to do it. If possible throw in a few ways to do it so I can learn. Thank you.


Asymmetric keys (e.g. RSA) must be so much longer than symmetric keys (e.g. AES). Why?

I have been reading that RSA has to do with math (prime numbers), while symmetric key encryption deals with blocks of data and modifying the blocks with replacements and remappings, but I still don't understand why asymmetric encryption has to have longer keys because of that, or whether that's even the reason.


Exactly half of the elements of $\mathcal{P}(A)$ are odd-sized

Let $A$ be a non-empty set and $n$ be the number of elements in $A$, i.e. $n:=|A|$.  I know that the number of elements of the power set of $A$ is $2^n$, i.e.  $|\mathcal{P}(A)|=2^n$.  I came across the fact that exactly half of the elements of $\mathcal{P}(A)$ contain an odd number of elements, and half of them an even number of elements.  Can someone prove this? Or hint at a proof?


What are the default user accounts created by Ubuntu?

Knowing this would be very helpful for detecting suspicious user accounts as early as possible.


The square root of positive definite matrix

Let $M$ be the manifold of real positive definite $n \times n$ matrices, define a mapping $i:A \to \sqrt A$ (where $A\in M$ and $\sqrt A$ means the unique positive definite square root of $A$). Please show that $i$ is smooth.


Verbs with prepositions in subordinate clauses?

When I use verbs with prepositions like  in a subordinate clause like  Examples (the 1st is wrong [genitive construction], the 2nd doesn't make sense but it's about grammar):   "I wonder if I should go visit the people I left so suddenly in that one town the name I never knew of." "I wonder if I should go visit the people I left so suddenly in that one town I never knew of."   Is that correct English ? When can I know that I have to use them close together or separate them ?  (Sorry, I'm not sure about the technical terms. English is not my native language.)  Thanks!


Show $a\Bbb Z+b\Bbb Z = \gcd(a,b)\Bbb Z$

I have the following problem:  Let $a, b \in\mathbb{Z}$. Show that $\,\{ ax + by\ :\ x, y \in \mathbb{Z}\} = \{ n \gcd(a,b)\ :\ n\in \mathbb{Z} \}$   I understand that the Bezout's lemma says that $gcd(a,b) = ax +by$, so Im not really how you would go about proving the above, it doesn't really make sense to me. Any help is appreciated1


We have developed a Predictive Model to show certain elements increasing and decreasing in certain locations of country.   What is acceptable in a prediction model accuracy?


Tell TeXstudio to compile a particular document with LuaLaTeX

It is not hard to change the default compilation engine in TeXstudio from PDFLaTeX to LuaLaTeX (or any other engine for that matter). But if I only want to use LuaLaTeX for a single document, it gets tedious to go into the menus and find the LuaLaTeX option all the time. And the command line approach is also more time-consuming. Is there some clever way to tell TeXstudio to always compile this (and only this) document using LuaLaTeX?


Where was Eleven from Stranger Things going to track people (when she was going in the bathtub).   Was it the upside down?  If yes, wasn't she in danger as well?  If not then how did she even know so much about the upside down in the first place?


How to show $\text{rank}(p)=\text{trace}(p)$ for every projector $p$ defined on $\mathbb{R}^n$?

I know this is an old question and there are several answers for this using eigenvalues and matrix factorization but they have not taught in my matrix analysis course yet. Therefore, my question would be a different proof for the following:  $$\text{rank}(p)=\text{trace}(p)$$  where $p$ is an $n \times n$ matrix. The only thing that we are allowed to use is $p^2=p$ and the fact that $\text{trace}(AB)=\text{trace}(BA)=$ where $A,B$ are conformable matrices.  Please notice what I have asked before answering the question.


I have just drawn a set of bar charts over a layer in ArcGIS 10.2 for Desktop.   How can I manage rotate the charts keeping my dataframe with the same rotation?  The options offered in Symbology Display only lets you to display the chart as bar or column.   Any chance to set a rotation angle??


How can I improve my dribbling skills and my ball control for soccer?

Please tell me some good skills to improve my ball control, whether it be in air or on ground, and my dribbling skills, as I'm a huge fan of this game.


So still kinda new to blender, and decided to try out 2.8 because of eevee. But I seem to be doing something wrong. Was trying to figure out why the emission wasn't showing a shadow by itself on the two blocks like in the cycles preview.


How to enable Broadcom Wireless Driver by Terminal on 16.04 LTS?

I have just installed ubuntu 16.04 LTS. When I choose try before installing, wifi was not working. So I activated wifi driver by Software & Updates >> Additional Drivers and It was working while installing (and try before installing).   But after installing, I am not able to activate by same procedure. When I enable and input my password, it does nothing.  Output of lspci --vvnn | grep -A 9 Network  07:00.0 Network controller [0280]: Broadcom Corporation BCM43142 802.11b/g/n [14e4:4365] (rev 01)     Subsystem: Dell Wireless 1704 802.11n + BT 4.0 [1028:0016]     Control: I/O- Mem+ BusMaster+ SpecCycle- MemWINV- VGASnoop- ParErr- Stepping- SERR+ FastB2B- DisINTx-     Status: Cap+ 66MHz- UDF- FastB2B- ParErr- DEVSEL=fast >TAbort- <TAbort- <MAbort- >SERR- <PERR- INTx-     Latency: 0, Cache Line Size: 32 bytes     Interrupt: pin A routed to IRQ 19     Region 0: Memory at f7c00000 (64-bit, non-prefetchable) [size=32K]     Capabilities: <access denied>     Kernel driver in use: bcma-pci-bridge     Kernel modules: bcma   output of iwconfig  lo        no wireless extensions. enp9s0    no wireless extensions.   My problem is I just installed Ubuntu 16.04 and not able to enable wireless driver.  -- Software & Updates >> Additional Drivers  -- Select Using Broadcom 802.11 Linux STA Wireless driver source from ....  -- When I insert password, nothing happen, It still selected Do not use this device


How can I take a picture of code like this

I want to take a picture of programming code like this:    I have a Nikon D3000 with two lens, a AF-S DX NIKKOR 18-55mm f/3.5-5.6G and a AF-S DX VR Zoom-Nikkor 55-200mm f/4-5.6G IF-ED. Which one should I use and what should I do to get this effect? If this effect is not possible in-camera, how can I get it?  I must emphasize that I'm not a pro photographer (evidently).


Is the space of continuous bounded real valued functions on a Polish space separable?

Let $X$ be a complete and separable metric space. Define  \begin{equation} M := \{ f \, \mid \, f : X \rightarrow \mathbb{R}, \, f \text{ bounded and continuous } \} \end{equation}   Is M separable with respect to supremum norm?


Short story describing an alien invasion where humans are the invaders

I've been searching most of the morning, trying to identify a short story I read in an elementary school English textbook.    The story is the first-person account of a soldier fighting off an alien invasion.  The soldier describes how the aliens showed up, and everyone was excited, but then without warning, the aliens attacked; now the soldier and his comrades are fighting back.  At the end of the story, the soldier says he can see one of the aliens coming toward him, so he shoots the thing, cracking open its spacesuit and revealing the hideous creature within: a creature with soft pink flesh and no scales (or something similar).    This story began my lifelong love affair with sci fi, and I'd love to find it.  I've googled about every term I can think of and looked extensively through the archives here, but just can't find it.  Any assistance would be greatly appreciated!


Can newsletters take into account a user's ignored tags on that site?

I have seen several questions that discuss using your "Favorite" tags to construct a newsletter.   I'm looking for a similar request - but for ignored tags.  I figure it might make sense to split this request from the "favorite" requests because it has different implementation.  Can we exclude questions on the "ignore" tags lists in the newsletter?   For example, I subscribe to the Board and Card Games newsletter.   Currently (and frequently) 6 of the 7 questions are about magic-the-gathering, a tag I have in my ignored list.     I now get a newsletter where at best 1/7 questions is interesting and worth clicking on.  Related questions about using "Favorites":


If I have a USB external HD how can I format it so it is R/W from both Mac and Windows? Is that possible?


$(1 2)(3 4)$ does not commute with any nonidentity element of odd order in $A_5$.

On Dummit's Abstract Algebra on p. 128, it says:     "It is easy to see that $(1 2)(3 4)$ ... does not commute with any non-identity element of odd order in $A_5$."   But I don't find it easy.  Any help, please?


convergence of $u_n = 1+ \frac{1}{u_{n-1}+1}$ to $\sqrt2$.

I'm struggling to find a proof for: Convergence of $u_n = 1+ \frac{1}{u_{n-1}+1}$ to $\sqrt2$.  Can someone point me in the right direction please?   Thanks.   edit: Here's what i've tried so far:  $(U_{n} -1)(U_{n-1}+1) = 1$  $U_nU_{n-1}+U_n-U_{n-1} -1 = 1$  $U_n(U_{n-1}+1)-U_{n-1}= 2$  $U_n = \frac{2+U_{n-1}}{U_{n-1}+1}$  $U_n = \frac{2}{(U_{n-1}+1)} + \frac{U_{n-1}}{U_{n-1}+1}$  Now i'm not sure how to proceed from this step.


Render looks way different from viewport render mode. How can I fix this?

I'm trying to make a test render of my model. But everytime I render it the render looks completely different from the viewport. The viewport is in render mode so it should look something like that, but this doesn't come even close.   I'm using cycles renderer. And my world note is just the standard one so nothing installed there.  There are 2 sun's in the scene both set to 0.5.  I've tried different hdris but they all have the exact same outcome. I've pressed alt+h to see if there was anything hiddden in my scene that blocked the background and nothing shows up so I don't think that's the problem. I've also copied it to a new Blend file to see if there was anything wrong with the file itself but it also happens there so it must be something in my settings I guess. But I just can't find out which one    this is how it looks in the viewport render.    And this is how it looks when I render it.  I really don't know how to fix this so I hope someone can help me here


For $\sin 5θ\cos 3θ = \sin 6θ\cos 2θ$ find the solution and number of solutions $[0,2\pi]$.

I have tried to solve it but my answer is wrong. I did the following-  using $$2\cos b\sin a = \sin(a+b) + \sin (a-b)$$  $$2\sin5\theta\cos3\theta = 2\sin6\theta\cos2\theta$$  $$\sin 8\theta+ \sin 2\theta = \sin8\theta+\sin4\theta$$  $$\sin2\theta - \sin4\theta = 0$$  $$\sin2\theta - 2\sin2\theta\cos2\theta=0$$  Case $1-$ $$\sin2\theta=0$$  $$\sin2\theta=\sin0$$  $\therefore$ $\theta = \frac{m\pi}{2}$  Case $2-$  $$2\cos2\theta =1 $$ $$\cos2\theta=\frac{1}{2}$$  $\therefore$ $\theta = n\pi \pm \dfrac\pi{6}$  In the solution they have used the identity of sinA -SinB in step 4.Then Sin2θ-Sin4θ had changed to 2cos3θsin(-θ).  But I have used sin2θ = 2sinθcosθ and converted sin4θ to 2sin2θcosθ. This very step made my answer incorrect. Why did they did so??


Need help showing $\left(\frac{n^2 - 2n + 1}{n^2-4n+2}\right)^n \to e^2$

I'm trying to work out this limit: $$ \lim_{n \to \infty} \left(\frac{n^2 - 2n + 1}{n^2-4n+2}\right)^n = e^2 $$  I have managed to show that it is equal to: $$\lim_{n \to \infty}\left (1+\frac{2n-1}{n^2-4n+2}\right)^n$$ but I have no idea how to continue from here, help would be appreciated.


How close would you have to be to the merger of two black holes, for the effects of gravitational waves to be detected without instruments?

Assume two black holes in the most common size range, spiraling into each other until they merge. The event releases significant amounts of energy via gravitational waves, which warp the space-time.  If the distortion is powerful enough, it would get noticed in daily life, or perhaps even detected by the proprioceptors in the human body.  How close, as an order of magnitude estimate, would you have to be to the merger to perceive it like that, without any instrument?


please help solve 'oracle-java7-installer' missing; dpkg: error processing linux-image-extra-3.8.0-19-generic

system info   Linux -System-Product-Name 3.8.0-23-generic #34-Ubuntu SMP  i686 athlon i686 GNU/Linux


How to check for key in a Map irrespective of the case?

I want to know whether a particular key is present in a HashMap, so i am using containsKey(key) method. But it is case sensitive ie it does not returns true if there is a key with Name and i am searching for name. So is there any way i can know without bothering the case of the key?  thanks


I am able to access the directory listing of a web-site. I need to download all the files from a specific folder. Is there some application to help me do this?  is the site.  Edit: The application whose content I need is a web application like :      www.example.com/ab/cd   The application which gives me the list of files from the server can be anything - either a webapp or a desktop application.


I have a set of equations which are defined below  \begin{figure*}[h] \label{eq1} \begin{alignat}{2}    & E_{\mathrm{access}}    && = E_{\mathrm{read}} + E_{\mathrm{write}}                                 = E_{\mathrm{R\_L1}} + E_{\mathrm{R\_lower}} + E_{\mathrm{W\_L1}} + E_{\mathrm{W\_lower}} \label{equation1} \\    .... \end{alignat}    \end{figure*}   The output produced is logically correct. However, I want to use smaller fonts and reduce the distance between symbols. For example, the distance between T+D, N*E....    How can I do that?


Delete my Google master account without factory reset?

I have three Google accounts configured in my phone. I want to remove my master Google account without losing other important data of my phone.   When I am trying to delete it, it is not allowing me to remove it, as some of the dependent application are installed with that Google account. I tried with removing those application also but still not able to remove it.   Please suggest any solution other than factory reset?


$\lim _{n \rightarrow \infty}\left[(n+1) \int_{0}^{1} x^{n} \ln (1+x) d x\right]$ My work $$ \lim _{n \rightarrow \infty} \int_{0}^{1} x^{n} \ln (1+x) d x $$ can be simplified to: $$ \begin{array}{c} \ln (2)-\lim _{n \rightarrow \infty} \int_{0}^{1} \frac{x^{n+1}}{1+x} d x \\ \because\left|\int_{0}^{1} \frac{x^{n+1}}{1+x} d x\right| \leq \int_{0}^{1}\left|x^{n+1}\right| d x \end{array} $$ Now, here the bound $1+x$ is always greater than equal to 1 $$ \Rightarrow \frac{1}{1+x} \leq 1 $$ $$ \therefore \lim _{n \rightarrow \infty} \int_{0}^{1} x^{n} \ln (1+x) d x=\ln (2) $$ Any shorter approach would be highly appreciated! NB although I have tried to solve this using Dominated Convergence theorem,but couldn't make it


How long would a Matrix iteration cycle last? I mean the time frame from a reboot to the next.


Articles: When do I use "a", "the", or "__"?

How do I know whether to use the definite (the) or indefinite (a, an) article, and when to omit it altogether?


Dividing an equilateral triangle into equal parts

For which $n$ is it possible to divide an equilateral triangle into $n$ equal (i.e., obtainable from each other by a rigid motion) parts? It is easy to come up with a partition for $n \in \{1, 2, 3, 4, 6\}$. Also very easy to come up with a partition into $k^2$ equal equilateral triangles(you need to build a triangular grid). It follows that if we can build a partition into $n$ equal parts, then we can also build a partition into $nk^2$ for any $k \in \mathbb{N}$. It is also well known that Mikhail Patrakeev  the division into $5$ equal parts. So my question is, what is known about the remaining $n$ that are not represented as $ck^2$, where $c \in \{1, 2, 3, 5, 6\}$ (It is $7, 10, 11, 13, 14, 15, 17...$ parts)? Is there any other known division? Is it proved for some $n$ that there is no corresponding partition into $n$ equal parts?


Why is there a size_t defined in the global scope as well as in namespace std?

I've noticed that my C++ programs compile fine whether I use ::size_t or std::size_t.  I can use them interchangeably with no issues at all, so it seems like one of them is a typedef for the other.  As an example, consider the following code which uses the global size_t (this is the whole file, no usings and other stuff):  #include <iostream> int main() {     ::size_t x = 100;     std::cout << x << std::endl; }   The next code uses the size_t in std:  #include <iostream> int main() {     std::size_t x = 100;     std::cout << x << std::endl; }   Both compile fine and outputs 100 as expected.  I was under the impression that everything in the standard library is put in namespace std, but clearly this isn't the case.  Why is this so?  Note: the same goes for ptrdiff_t, intN_t and uintN_t too.


I want to extend my programs to different platforms, but I can't find any information on the internet about it. What kind of macro should I use for that? I'm using CLion on Linux.


Why Closing a File Stream in Java is so Important

With huge advancements in CUPs able to process mass amounts of information in fractions of seconds, why is it important that I close a file stream?


Suggested edit approved with 0 approvals and 1 rejection

I reviewed  some days ago. After I rejected it, something similar to  (documented in ) happened:     Approved Jun 17 at 11:07:      michaelb958 reviewed this Jun 17 at 11:06: Reject   This edit is incorrect or an attempt to reply to or comment on the existing post.   And that's all there was.  Viewing  indicates the edit was actually approved. The Meta question I linked to dates from 2012, and indicates that whatever bug was responsible was fixed. (Also, that was a question, whereas this is an answer.) What's going on here?    Edit:  provides a possible explanation - at time of writing, if the OP approves an edit after running out of suggested edit reviews, it doesn't show up on the edit's summary.


What is the error with this program ? It is not giving any output. Why?

import java.util.*;  public class HOA6 {     public static void main(String args[])     {         if(args[0] =="Male" && (Integer.parseInt(args[1])>=1 && Integer.parseInt(args[1])<=58))         {             System.out.println("The percentage of interest is: " + 8.4+"%");         }         else if(args[0] =="Male" && (Integer.parseInt(args[1])>=59 && Integer.parseInt(args[1])<=100))         {             System.out.println("The percentage of interest is: " + 10.5+"%");         }         else if(args[0] =="Female" && (Integer.parseInt(args[1])>=1 && Integer.parseInt(args[1])<=58))         {             System.out.println("The percentage of interest is: " + 8.2+"%");         }         else if(args[0] =="Female" && (Integer.parseInt(args[1])>=59 && Integer.parseInt(args[1])<=100))         {             System.out.println("The percentage of interest is: " + 9.2+"%");         }     } }   This is the code of the program. Why this is not giving any output ? I am using the Java language here. I am passing command line arguments as Male and 28 but instead of the logic written for this input , it is not giving any output. What is the problem ?


Change of logo half way through presentation?

I would like to ask the following question, please. I am using Beamer for a presentation. At the top right of each of my slides appears a logo. However, I am looking for a possibility to exchange this logo half way through my talk as the university/institution changed.  I used the code   \addtobeamertemplate{frametitle}{}{% %\begin{textblock*}{100mm}(-0.03\textwidth,0.76\textheight) \begin{textblock*}{100mm}(0.92\textwidth,-0.15\textheight) \hskip0.1cm\pgfuseimage{institute-logo}\hskip0.1cm \end{textblock*} }   In the meantime I managed to do:  I managed to do this (skipping the option to have the logo in the top right part of the frametitle)      \newif\ifplacelogo % create a new conditional     \placelogotrue % set it to true     \logo{\ifplacelogo   \pgfputat{\pgfxy(-6.25,-0.25)}{\pgfbox[center,base] {\includegraphics[height=15pt,keepaspectratio]{Logos/logo1.pdf}%     \hspace{\dimexpr\paperwidth-2cm-50pt}%      \includegraphics[height=15pt,keepaspectratio]{Logos/logo2.pdf}}}     \else  \pgfputat{\pgfxy(-0.4,-0.25)}{\pgfbox[center,base]{\includegraphics[height=30pt,keepaspectratio]{Logos/main-blue-CMYK.pdf}}}     \fi} % replace with your own command   But I encountered another challenge: What do I do, if I want a slide without a logo? Currently I only have two options, false, true. How do I incorporate a third, please? Okay, found it: local definition via \nologo \newcommand{\nologo}{\setbeamertemplate{logo}{}}  Thank you for your help and ideas.


Snap during transform can not snap to what I want

Why can't I snap the point I chose to the target point.  I tried for a long time to do this, but no use!  Could some help me? Thanks !


Set of points in $\mathbb{C}$ s.t. $z^{n-1} = \overline z$

I think I've reached a solution for the above question, I'd like to know if my answer makes sense, and my process follows the appropriate steps, I'm rather new to working in the complex space.   Let $z = r(\cos\theta + i\sin\theta)$. Then:  $z^{n-1} = \overline z$   $z^n = z\overline z$, where $\overline z = r(\cos\theta - i\sin\theta)$. Then for $z\overline z = r^2(\cos\theta + i\sin\theta)(\cos\theta - i\sin\theta) = r^2$, thus we get:  $z^n = r^2$  $r^n(\cos n \theta + i\sin n\theta)  = r^2 \implies r^{n-2}(\cos n \theta + i\sin n\theta) = 1$. This gives us the set:  $\{z = r(\cos\theta + i\sin\theta) : r^{n-2}(\cos n \theta + i\sin n\theta) = 1\}$  Continuing as mentioned in the comments we can solve for $r$ and $\theta$. Rewriting we get (from here let $cis\theta = \cos\theta + i\sin\theta$):  $r^{n-2}cisn\theta = 1cis0.$ Clearly, $r^{n-2} = 1$ and since $r \geq 0$ then $r = 1$ for $n \geq 3$. And then:  $n\theta = 0 + 2\pi k, k = 0, 1, 2, 3, \dots n-1$  So $\theta  = \frac{2\pi k}{n}, k = 0, 1, 2, \dots n -1 $. This gives us the set:  $\{z = cis\theta : \theta = \frac{2\pi k}{n}, k = 0, 1, 2, \dots n -1, n \geq 3\}$


How does the C++ compiler know which implementation of a virtual function to call?

Here is an example of polymorphism from  (edited for readability):  // abstract base class #include <iostream> using namespace std;  class Polygon {     protected:         int width;         int height;     public:         void set_values(int a, int b) { width = a; height = b; }         virtual int area(void) =0; };  class Rectangle: public Polygon {     public:         int area(void) { return width * height; } };  class Triangle: public Polygon {     public:         int area(void) { return width * height / 2; } };  int main () {     Rectangle rect;     Triangle trgl;     Polygon * ppoly1 = &rect;     Polygon * ppoly2 = &trgl;     ppoly1->set_values (4,5);     ppoly2->set_values (4,5);     cout << ppoly1->area() << endl; // outputs 20     cout << ppoly2->area() << endl; // outputs 10     return 0; }   My question is how does the compiler know that ppoly1 is a Rectangle and that ppoly2 is a Triangle, so that it can call the correct area() function? It could find that out by looking at the "Polygon * ppoly1 = ▭" line and knowing that rect is a Rectangle, but that wouldn't work in all cases, would it? What if you did something like this?  cout << ((Polygon *)0x12345678)->area() << endl;   Assuming that you're allowed to access that random area of memory.  I would test this out but I can't on the computer I'm on at the moment.  (I hope I'm not missing something obvious...)


How can a post have more votes than views?

It's not a time issue, I refreshed the page a couple of times.  1 person = 1 vote.


I have "Ubuntu 14.04.2 LTS" OS and trying to install PHP7 using command:   sudo apt-get install php-7.0   Getting error message:   Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package php-7.0 E: Couldn't find any package by regex 'php-7.0'  sudo apt-get install php7.0 Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package php7.0 E: Couldn't find any package by regex 'php7.0'   How it can be fix Please advise.


Product of two cyclic groups is cyclic iff their orders are co-prime

Say you have two groups $G = \langle g \rangle$ with order $n$ and $H = \langle h \rangle$ with order $m$. Then the product $G \times H$ is a cyclic group if and only if $\gcd(n,m)=1$.  I can't seem to figure out how to start proving this. I have tried with some examples, where I pick $(g,h)$ as a candidate generator of $G \times H$. I see that what we want is for the cycles of $g$ and $h$, as we take powers of $(g,h)$, to interleave such that we do not get $(1,1)$ until the $(mn)$-th power. However, I am having a hard time formalizing this and relating it to the greatest common divisor.  Any hints are much appreciated!


Have installed Ubuntu 11.10 on USB using Live CD. Followed the steps as provided in below link    After installation is complete in Refit menu, when i click on Linux icon I receive "Missing Operating System" message. I followed the steps provided in the below link from this forum, but am still receiving the same message.    Any assistance is highly appreciated.


What does the participation tab measure?

As suggested from:         It's not obvious what it's measuring eg: top listed user on WB.SE has a reputation of 101 (unable to down-vote), has never asked or answered, and over their three plus years has roughly similar flag and vote-count to myself (11.7k user) - yet I'm not listed in the first seven pages of results. Could we establish what it measures before requesting a tab?   There is a hidden tab on all sites, showing participation. It can be accessed by going to the SE site and adding this to the end: users?tab=Participation. This then sorts users into the amount they have participated on that site.  I am guessing this is calculated by:   reputation posts edits votes flags?   What exactly does this tab measure?


Showing that $\pi(M \# N) = \pi(M) \ast \pi(N)$ for $n$-dimensional manifolds $M$,$N$

Problem: Let $M$ and $N$ be $n$-dimensional manifolds, where $n > 2$.  Let $M \# N$ be their connected sum.  Show that $\pi(M \# N) = \pi(M) \ast \pi(N)$.        RE-EDITED Attempt:    Let $U_2$ and $V_2$ be two small open balls from $M$ and $N$ to be removed by the connected sum operation.  Let $p_m \in U_2$ and $p_n \in V_2$, and then let $U_1 = M - \{p_m\}$ and $U_2 = N - \{p_n\}$.   We can now view the connected sum $M\#N$ as the quotient of the disjoint union of $M$ and $N$ by an equivalence relation identifying $U_2 -\{p_m\}$ with $V_2-\{p_n\}$ defined by some homeomorphism between the two. Denote $W_1$ and $W_2$ as the respective images of $U_1$ and $V_1$ under the quotient map. We have that $U_2$ and $V_2$ are open by construction.  Furthermore, since $M$ and $N$ are open, we have that $U_1 = M - \{p_m\}$ and $V_1 = N - \{p_n\}$ are also open (since open sets with a point removed are still open). Then we have the following open covers of $M$ and $N$ respectively:  $$ M = U_1 \cup U_2 $$ $$ N = V_1 \cup V_2 $$ We can then express   $$ M \# N = \underbrace{W_1}_{\text{open}} \cup \underbrace{W_2}_{\text{open}} $$  as well since $M \cup N = V_1 \cup U_1$ and $W_1$ and $W_2$ are just the images of $U_1$ and $V_1$ under the natural quotient map used to define $M \# N$. Consider that $W_1 \cap W_2$ is path connected since $W_1 \cap W_2$ is homeomorphic to $U_2 - \{p_m\} \cong V_2 - \{p_n\}$, both of which are punctured disks which deformation retract onto $S^{n-1}$.  Since spheres of dimension greater than $2$ are simply connected (hence path connected), we have that $W_1 \cap W_2$ is path connected as well.  This will allow us to later apply Van Kampen to $M \# N = W_1 \cup W_2$. Now we have that   $$ U_1 \cap U_2 = U_2 - \{p_n\} \cong W_1 \cap W_2 \cong V_2 - \{p_m\} = V_1 \cap V_2 $$  so that from above we can say  $$ \pi_1(U_1 \cap U_2) \cong \pi(V_1 \cap V_2) \cong \pi(W_1 \cap W_2) \cong \{e\} $$ Now since $n > 2$, we have that   $$ \underbrace{\pi_1(U_1) = \pi_1(M - \{p_m\}) \cong \pi_1(M) \cong \pi_1(W_1)}_{\text{removing a point doesn't change fundamental group for $n > 2$}} $$   and similarly   $$ \pi_1(V_1) = \pi_1(N - \{p_n\})\cong\pi_1(N) \cong \pi_1(W_2) $$ Then applying Van Kampen on $M \# N = W_1 \cup W_2$ yields that  $$ \pi_1(W_1) \ast_{\pi_1(W_1 \cap W_2)} \pi_1(W_2) \cong \pi_1(M\#N) $$ But since (8) yields that  $$ \pi_1(W_1) \ast_{\pi_1(W_1 \cap W_2)} \pi_1(W_2) \cong \pi_1(W_1) \ast_{\{e\}} \pi_1(W_2) \cong \pi_1(W_1) \ast \pi_1(W_2) \cong \pi_1(M) \ast \pi_1(N) $$  we then have from (9) that  $$ \pi_1(M) \ast \pi_1(N) \cong \pi_1(M\#N) $$  as desired.