Let $M$ be a compact Riemannian manifold, $*$ be the Hodge star operation, $d$ the exterior derivative, $\delta$ the codifferential $(\delta\omega=(-1)^{n(k+1)+1} *d*\omega$ where $n=\dim M$ and $k=\deg \omega$), and $\Delta=d\delta+\delta d $ the Laplacian operator. How can we show that $\Delta(\Omega^p M)=d(\Omega^{p-1}M)\oplus \delta(\Omega^{p+1}M)$? (Here $\Omega^pM$ denotes the space of $p$-forms on $M$.) To show this, we have to show the followings:  $d(\Omega^{p-1}M)\subset \Delta(\Omega^pM)$ and $\delta(\Omega^{p+1}M)\subset \Delta(\Omega^pM)$,  $d(\Omega^{p-1}M)\cap \delta(\Omega^{p+1}M)=0$, and  $d(\Omega^{p-1}M)+\delta(\Omega^{p+1}M)=\Delta(\Omega^pM)$.   The third one is obvious by definition of $\Delta$. The second one follows from the fact that they are orthogonal. But how can we show 1?

If $M$ is a closed manifold, it's well known that $\Delta\phi=\alpha$, where $\alpha$ is a $p$-form, has a solution if and only if $\alpha$ is orthogonal to the space of harmonic $p$-forms. This is proved on page 224 of Warner, but the proof depends heavily on his approach to Hodge theory. There are other methods that avoid his main technical lemma 6.6. So, can one prove this fact using only the "standard" facts of the theory?  For functions it is easy, for one has $$\alpha=\delta \psi+h.$$ But $(\alpha,h)=0$, so $\alpha=\delta\psi$. Then decompose $\psi$ to get $\alpha=\delta d\zeta$ for some function $\zeta$. But on functions, $\Delta=\delta d$. But for $p$-forms in general one has $$\alpha=d\xi+\delta \psi+h,$$ since $\Omega^{p-1}$ is nontrivial. Using the decompositions again, one has $$\alpha=d\delta \rho+\delta d\sigma,$$ where $\rho,\sigma$ are $p$-forms. I don't see how $\rho$ and $\sigma$ are related, but it looks close.


If I have a 20 sided die and I want to roll a 20, and I have failed 100 times, can the probability increase because of the failed attempts? I am pretty sure this is a no, but had to ask!

I would seem logical that the more times an event does not happen, the more likely it is to happen, for example: If a coin is flipped and it lands on tails 10 times in a row it would seam more likely that the next flip will result in heads.  The Infinite Monkey Theorem is one such idea that suggests this is true,   It states that if some number of monkeys are left in a room with typewriters for an infinite amount of time then they will eventually compose all written texts ever produced.  This seems to suggest that since the chance of the monkeys writing a work, say Shakespeare's Romeo and Juliet, is very low. The more times they do not write it, the more likely they are to write it, until the chance becomes significant and it, the writing of the play, happens.  However another idea, Gambler's Fallacy states quite the opposite.   It states that the chance of an event does not increase with the number of times it does not occur.  So what is the answer? Does the likelihood of an event go up the more times it does not happen, or does it stay the same? And if it does stay the same then how does one explain the Infinite Monkey Theorem?


The function to be mocked is of class ContactsProductionService.java  @Override public ContactsProductionDto getContactsProduction(long id) {      Site       site    = siteDao.find(id);      ContactsProductionDto contactsProductionDto = new ContactsProductionDto();          List<Entite> entities = entiteDao.findEntitesByType(Type.CP);         for (Entite entite : entities) {             ProductionCenterDto productionCenter = new ProductionCenterDto();             productionCenter.setId(entite.getId());             productionCenter.setCode(entite.getCode());             productionCenter.setNumber(entite.getNumero());             productionCenter.setName(entite.getDescription());             contactsProductionDto.getProductionCenters().add(productionCenter);         }return contactsProductionDto;   And this is the test:  @Test public void testGetContactsProduction(){     Mockito.when(siteDao.find(id)).thenReturn(new Site());     List<Entite> entities = null;     Mockito.when(entiteDao.findEntitesByType(Type.CP)).thenReturn(entities);     ContactsProductionDto contact=contactsProductionService.getContactsProduction(id);     Assert.assertNotNull(contact); }   I'm getting NullPointerException on running this test. The cause is that inside the for loop value of Entite is null!! Any help please :(

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I wanted to retract a close vote. So I selected more/close    Result: the circle is spinning "forever", but no crash. Pressing ESC brought me back to the question.     Related but not a duplicate:

In the Android App, if I open the close dialog for a question that I've , the close options will simply be stuck loading forever.  This initially came up in version 1.0.26 on Android 4.4.2, and it's still present in version 1.0.49 on Android 4.4.3, both on a HTC One.  If I've already voted to close, I will never be presented with the close options, nor will I even be informed I've already cast a close vote previously, I'll just see the loading spinner indefinitely. When this happens, I have to wait for a while wondering if my 'net is being slow, or if I've already voted to close this question.  Here they are, loading:    And here they are, still loading, a few minutes later:


I'm trying to write a bibliography in which many authors of a book appears in this format:     Author1, Author2, Author3 and Author4   So, I'm using here biblatex this way:  \usepackage[backend=biber, style=alphabetic]{biblatex}   .bib file  @book{atl1,     label       = {Tavares et al.},     author      = {Cristopher Tavares and Kirk Fertitta and Brent Rector and Chris Sells},     title       = {ATL Internals},     subtitle    = {Working with ATL 8},     edition     = {2},     publisher   = {Addison-Wesley Professional},     date        = {2006-07-15},     totalpages  = {888}     }   But the output of this is      Cristopher Tavares and al.   .tex code:  \documentclass[12pt,english,french]{report} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{babel} \usepackage{csquotes}% recommended in output (biblatex)  \usepackage[backend=biber, style=alphabetic]{biblatex}  \addbibresource{bibli.bib}  \usepackage{titletoc}  \begin{document} \nocite{*} \printbibliography \addcontentsline{toc}{chapter}{Bibliographie} \end{document}   How do I to deal with this, please?

I'm using the  package to add citations and a bibliography to my LaTeX document. I've noticed that only the first author plus "et al." is displayed for works with more than three authors. That's fine with me for in-text-citations, but I'd rather have the complete author information in the bibliography. How can I do that?


I have a bash script I'm working on to help with an installer. why doesn't this work?  function fn_myFunc(){         local MYVAR=0         until ["$MYVAR" -ne 0]; do                 whiptail --yesno "Yes or No?" --no-button "No" --yes-button "Yes" 10 70                 MYVAR=$?                 echo $MYVAR         done }   This code loops infinitely, even though if Yes is selected, the echo $MYVAR prints out 0 and it prints 1 if no is selected.

I am using the below script to move two days back when script runs at starting two days of the year and also check first and second days of every month and move two days back. if [$month="01"] && [$day="01"]; then         date="$last_month/$yes_day/$last_year"         fulldate="$last_month/$yes_day/$last_year" else         if [$month="01"] && [$day="02"]; then                 date="$last_month/$yes_day/$last_year"                 fulldate="$last_month/$yes_day/$last_year"         else                 if [ $day = "01" ]; then                         date="$last_month/$yes_day/$year"                         fulldate="$year$last_month$yes_day"                 else                         if [ $day = "02" ]; then                                 date="$last_month/$yes_day/$year"                                 fulldate="$year$last_month$yes_day"                         else                                 date="$month/$yes_day/$year"                                 fulldate="$year$month$yes_day"                         fi                 fi         fi fi  But my bad am getting the below error message Etime_script.sh: line 19: [06=01]: command not found Etime_script.sh: line 24: [06=01]: command not found


I'm completely new to GDAL and I'm going to use it to work with satellite images, DEMs, etc.    I have some experience working with Visual C++ and the OpenCV library. And in fact my goal is to combine OpenCV, GDAL and OpenGL for developing software for remote-sensing purposes. The programming language will be Visual C++.  My problem is that in searching the net, I couldn't find a good book for learning GDAL and in fact most of the open source codes found in the Net are written in the Python language but I'm not familiar with this language and I don't want to get familiar.  Surely I know that the best language for programming with GDAL is Python but the rules of the company where I work force me to use Visual C++.   So with the conditions mentioned above, what do you suggest as the best way to study GDAL?    The first piece of program that I want to write would be:     Read a satellite image file with the help of the GDAL library.   Extract image's header information.   Write a program to  apply a Gaussian filter on the image that was read in step 1.   Convert the image read in step 1 to an image of the OpenCV family to do some other processing.

I quite often get stuck trying to solve particular problems, or getting syntaxes right.   Apart from the details provided in the links on , does anyone know of any 3rd party resources/manuals explaining it in a bit more user friendly way?


I wanto to write something like this  c dt = average probability that a particular 1-2        molecular pair will react according to R        in the next infinitesimal time interval dt.   I tried with \\ but it does not work.  How can I do such a thing?

There are a number of possibilities to have multiline equations, but I am looking for multiline \text{...} elements.  For example:  \documentclass{article} \usepackage{amsmath} \begin{document}  \begin{equation}   a^3 + b^3 \neq c^3 \text{ I have discovered a truly marvelous proof of this,\\which this margin is too narrow to contain.} \end{equation}  \end{document}   Is there a way to break that long text into two lines? The \\ does not work here.


Sets: sets and their elements, finite and infinite sets, operations on sets (unions, intersections and complements), relations between sets(inclusion, equivalence), non equivalent infinite sets, cardinal numbers.

I want to do a survey of textbooks in set theory. Amazon returns 3582 books for the keywords "set theory". A small somewhat random selection with number of references in Google scholar is the following.   Two questions:    What textbooks in set-theory are considered standard?  What is a good place to aggregate standard references (of textbooks)?    (I'm only interested in text-books, which as a format already provide a kind of standardization)  Textbooks on set theory (author: title (year) #Google Scholar citations )   Thomas J. Jech: Set Theory 3rd Edition (1978) #2441  Kenneth Kunen: Set Theory (1980) #1881  P. R. Halmos: Naive Set Theory (1974) #1079 AA Fraenkel, Y Bar-Hillel, A Levy: Foundations of set theory (1973) #696 K Kuratowski, A Mostowski, M Mączyński: Set theory (1976) #609 Suppes: Axiomatic set theory  (1972) #589 Quine: Set theory and its logic (1969) #442 A Levy: Basic set theory (1979) #442 Herbert B. Enderton: Elements of Set Theory (1977) #349 Karel Hrbacek, Thomas J. Jech: Introduction to set theory (1999) #284 RR Stoll: Set theory and logic (1979) #281  N. Bourbaki: theory of sets (1970) #211 K Devlin: The joy of sets: fundamentals of contemporary set theory (1994) #182 Ciesielski: Set theory for the working mathematician (1997) #156 YN Moschovakis: Notes on set theory (1994) #138 FW Lawvere: Sets for mathematics (2003) #118 G Takeuti, WM Zaring: Introduction to axiomatic set theory (1982) #106 Kaplansky: Set Theory and Metric Spaces (2001) #103 Potter: Set Theory and Its Philosophy: A Critical Introduction (2004) #91 PT Johnstone: Notes on logic and set theory (1987) #87 Judith Roitman: Introduction to Modern Set Theory (1990) #47 Derek Goldrei: Set Theory: For Guided Independent Study (1996) #31 Basic set theory: A Shen, NK Vereshchagin (2002) #14 Ralf Schindler: Set Theory (2014) #13 Foreman, Kanamori: Handbook of Set Theory (2009) #38   Note:  Please feel free to add textbooks to the list, as long as they are not just on a smaller subset of set theory. (Some of the dates might not be the first published edition.)


I've found a program named wipefs run by the postgres user. The server is a Ubuntu 12.04.  When I did ps ax|grep wipefs I've got:  10209 ?        Sl     1:04 /var/tmp/.ICE-unix/-l/.db/wipefs --library-path /var/tmp/.ICE-unix/-l/.db /var/tmp/.ICE-unix/-l/.db/x  Then I did this:  ls -lah /var/tmp/.ICE-unix/-l/.db/ total 14M drwxr-xr-x 2 postgres postgres 4.0K Jun 11 19:24 . drwxr-xr-x 3 postgres postgres 4.0K Jul 17 21:00 .. -rwxr-xr-x 1 postgres postgres 1.8M Nov 20  2017 libc.so.6 -rwxr-xr-x 1 postgres postgres 2.3M Nov 20  2017 libcrypto.so.1.0.0 -rwxr-xr-x 1 postgres postgres  15K Nov 20  2017 libdl.so.2 -rwxr-xr-x 1 postgres postgres  31K Nov 20  2017 libffi.so.6 -rwxr-xr-x 1 postgres postgres  88K Nov 20  2017 libgcc_s.so.1 -rwxr-xr-x 1 postgres postgres 898K Nov 20  2017 libgcrypt.so.20 -rwxr-xr-x 1 postgres postgres 511K Nov 20  2017 libgmp.so.10 -rwxr-xr-x 1 postgres postgres 1.2M Nov 20  2017 libgnutls.so.30 -rwxr-xr-x 1 postgres postgres  79K Nov 20  2017 libgpg-error.so.0 -rwxr-xr-x 1 postgres postgres 203K Nov 20  2017 libhogweed.so.4 -rwxr-xr-x 1 postgres postgres 232K Nov 20  2017 libhwloc.so.5 -rwxr-xr-x 1 postgres postgres 203K Nov 20  2017 libidn.so.11 -rwxr-xr-x 1 postgres postgres  39K Nov 20  2017 libltdl.so.7 -rwxr-xr-x 1 postgres postgres 1.1M Nov 20  2017 libm.so.6 -rwxr-xr-x 1 postgres postgres  95K Nov 20  2017 libmicrohttpd.so.10 -rwxr-xr-x 1 postgres postgres 215K Nov 20  2017 libnettle.so.6 -rwxr-xr-x 1 postgres postgres  43K Nov 20  2017 libnuma.so.1 -rwxr-xr-x 1 postgres postgres 399K Nov 20  2017 libp11-kit.so.0 -rwxr-xr-x 1 postgres postgres 136K Nov 20  2017 libpthread.so.0 -rwxr-xr-x 1 postgres postgres   77 Jun 11 19:21 libq.so.1 -rwxr-xr-x 1 postgres postgres  31K Nov 20  2017 librt.so.1 -rwxr-xr-x 1 postgres postgres  280 May 15 19:52 libs.so.1 -rwxr-xr-x 1 postgres postgres 419K Nov 20  2017 libssl.so.1.0.0 -rwxr-xr-x 1 postgres postgres 1.5M Nov 20  2017 libstdc++.so.6 -rwxr-xr-x 1 postgres postgres  75K Nov 20  2017 libtasn1.so.6 -rwxr-xr-x 1 postgres postgres 103K Nov 20  2017 libz.so.1 -rwxr-xr-x 1 postgres postgres 159K Nov 20  2017 wipefs -rwxr-xr-x 1 postgres postgres 2.1M Jun  3 15:04 x  In other systems running PostgreSql the directory /tmp/.ICE-unix is empty.  Is this a virus?.

This is a  about Server Security - Responding to Breach Events (Hacking)   See Also:                  Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism:   What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning?   Original Version       2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a    attack on our provider. The servers access to the Internet   has been shut down which means over 5-600 of our clients sites are now   down. Now this could be an FTP hack, or some weakness in code   somewhere. I'm not sure till I get there.      How can I track this down quickly? We're in for a whole lot of   litigation if I don't get the server back up ASAP. Any help is   appreciated. We are running Open SUSE 11.0.            2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed   to resolve this problem, although it may not apply to many others in a   different situation. I'll detail what we did.      We unplugged the server from the net. It was performing (attempting to   perform) a Denial Of Service attack on another server in Indonesia,   and the guilty party was also based there.      We firstly tried to identify where on the server this was coming from,   considering we have over 500 sites on the server, we expected to be   moonlighting for some time. However, with SSH access still, we ran a   command to find all files edited or created in the time the attacks   started. Luckily, the offending file was created over the winter   holidays which meant that not many other files were created on the   server at that time.      We were then able to identify the offending file which was inside the   uploaded images folder within a  website.      After a short cigarette break we concluded that, due to the files   location, it must have been uploaded via a file upload facility that   was inadequetly secured. After some googling, we found that there was   a security vulnerability that allowed files to be uploaded, within the   ZenCart admin panel, for a picture for a record company. (The section   that it never really even used), posting this form just uploaded any   file, it did not check the extension of the file, and didn't even   check to see if the user was logged in.      This meant that any files could be uploaded, including a PHP file for   the attack. We secured the vulnerability with ZenCart on the infected   site, and removed the offending files.      The job was done, and I was home for 2 a.m.            The Moral   - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole   world is made aware of the vulnerability.   - Always do backups, and backup your backups.   - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server   Fault.


I have a density matrix defined as  $$\rho(t) = \int_{-\infty}^{+\infty} \sigma(t,x) \otimes |x\rangle\langle x|$$  I want to show that  $$\hat{P} \rho(t) \hat{P} - \frac{1}{2} (\hat{P^2} \rho(t) - \rho(t) \hat{P^2}) = 2\frac{\partial^2 }{\partial x^2} \sigma(t,x)$$ where $\hat{P}$ is the momentum operator.   The question is similar to , but this doesn't help me in getting the answer. $\hat{P} = -i \frac{\partial}{\partial x}$ in the position  basis, but I am unable to get the final answer. Can someone help me?

I have been going through some problems in Sakurai's Modern QM and at one point have to calculate $\langle \alpha|\hat{p}|\alpha\rangle$ where all we know about the state $|\alpha\rangle$ is that $$\langle x|\alpha\rangle=f(x)$$ for some known function $f$. ($|\alpha\rangle$ is a Gaussian wave packet.) Sakurai says that this is given by:  $$\langle p\rangle = \int\limits_{-\infty}^{+\infty}\langle\alpha|x\rangle\left(-i\hbar\frac{\partial}{\partial x}\right)\langle x|\alpha\rangle dx.$$  I am wondering how we get to this expression. I know that we can express   $$|\alpha\rangle =\int dx|x\rangle\langle x|\alpha\rangle$$  and  $$\langle\alpha|=\int dx\langle\alpha|x\rangle\langle x|,$$   so my thinking is that we have:  $$\langle\alpha|\hat{p}|\alpha\rangle =\iint dx dx'\langle\alpha|x\rangle\langle x|\hat{p}|x'\rangle \langle x'|\alpha\rangle, $$  and if we can 'commute' $|x\rangle$ and $\hat{p}$ this would become: $$\iint dxdx'\langle\alpha |x\rangle\hat{p}\langle x|x'\rangle \langle x'|\alpha\rangle,$$  which is the desired result as $$\langle x|x'\rangle=\delta(x-x').$$ Is this approach valid?  I think my question boils down to: Does the operator $\hat{p}$ act on the basis kets $|x\rangle$ or on their coefficients? In the latter case, if we had some state $|\psi\rangle = |x_0\rangle$ for some position $x_0$, then would we say that for this state $$\langle p\rangle =\langle x_0|\left(-i\hbar\frac{\partial}{\partial x}\right)|x_0\rangle = 0$$ as the single coefficient is $1$ and the derivative of $1$ is $0$?


Local computer with Windows 7 Professional was connected to domain XXX.local. I switched it to local group YYY.   After reboot I have one account ZZZ with no admin rights. When I try to open UAC or other settings that require Administrator account it fails. Windows prompt window opens but I assume that it cannot find administrator account and it doesnt show password prompt and button Yes is disabled.   When I check users that are in this computer there is Administrator (disabled) and ZZZ. I cannot turn on Administrator account or change ZZZ group because I cannot run it because it requires Administrator rights :)  What can I do to grant user ZZZ administrator rights?

I accidentally disabled my admin account.  After I login to another account I found I can not get admin rights, because all admin accounts on my computer are disabled.  I clicked on 'run as administrator' but only see a smart card choice (all the admin accounts are disabled so no choice provided)    I don't want to re-install my OS, help!    Details:  I have account A on my computer.    I got a new computer so I want to give the old one to my mother.    Creating a new user account B for her and disable account A.    Logout and restart.    Successfully login B, now I found I could not get admin rights because no account choice is provided.    More informations about my machine:  OS is Windows 10 and my admin account is a Microsoft Account.  I have an arch-linux installed on my computer and dual-boot it using GRUB, so maybe I can not use safe mode.


I have got confused between these three: Training score, Validation score, Testing score   Is validation score and testing score the same thing? How is training score calculated?   For e.g., cross_validate returns test_score, train_score.  How and on what, the test_score and train_score is measured?

I found this confusing when I use the neural network toolbox in Matlab. It divided the raw data set into three parts:   training set validation set test set   I notice in many training or learning algorithm, the data is often divided into 2 parts, the training set and the test set.  My questions are:   what is the difference between validation set and test set?  Is the validation set really specific to neural network? Or it is optional. To go further, is there a difference between validation and testing in context of machine learning?


It's generally accepted that SSDs cannot be securely wiped by writing patterns to the drive, due to features such as wear leveling and over-provisioning, and that the most secure way to wipe a modern SSD is using the ATA Secure Erase firmware commands.   However, from my understanding this doesn't seem to apply to NVMe drives because they're not ATA-based - instead, they connect to and run via the PCIe bus. Looking at the  seems to confirm this, which has a secure erase option dedicated to NVMe drives:    This seems to confirm that NVMe drives have their own equivalent to the ATA Secure Erase command for SATA SSDs, but I haven't been able to find an NVMe equivalent for hdparm.   How exactly can I securely erase an NVMe SSD? I'm running Windows, but also have access to a Unix-like environment using Cygwin.

I know that when files are deleted they aren't really completely erased. The drive just says hey this space is free and you can overwrite it. With programs like Boot and Nuke and Eraser .etc. you can write over those sections with random bytes.  How does this process differ with SSDs? Does trimming the drive with disk optimizer remove the files completely?


I know how to prove that $A_n$ is a subgroup of $S_n$ but i do not know how to prove this using the index.

For an exercise, I need to prove that the alternating group $A_n$ is a normal subgroup of the symmetric group $S_n$.  As clue they say we can use a group homomorphism $\operatorname{sgn} : S_n \to \{-1,1\}$. I really don't see how i can use this.... can somebody help?


(Please read the whole question before flaming me)  Today I updated my iPhone 4S (Model A1387) to iOS 9.0.1 from 8.4. Since the Wifi doesn't work with either of these versions I decided to downgrade the software to iOS 7.1.2.   After I downloaded myself a  for the iPhone 4S and tried to [Shift]+Update my phone in iTunes I received the . After a quick web search I booted the iPhone into  and tried it again. After that I tried adapting my hosts file in Windows as showed on . This also didn't work. I also tried downloading the    -File from different providers and also tried to use a third party tool called . Then I found out, that recovery mode is not enough and I .  Since the  I was sure that it will work this time, since the DFU mode seems to be some kind of , but after hours of effort I'm still stuck with iOS 9 and nothing has worked out to bring me back to iOS 7.1.2.  So as the title states: How can I downgrade my iPhone 4S to iOS 7.1.2? (As I am going to jailbreak this device afterwards, you can also show a direct way to load a jailbreaked firmware)

I'm trying to downgrade my iPhone from the current iOS to an older one, as per .  But every time I try, I always receive this error:     The iPhone could not be restored. This device isn't eligible for the requested build.     I have tried many times with and without DFU mode. Any ideas regarding this?


I have been looking through the SO Careers site of late and because I am located in Australia there isn't as many opportunities as there would be for people in the US; especially in the city I live in.  Because of this I attempted to look for positions that allow remote work, but trouble is practically none of the positions that state they allow remote work indicate how remote they will consider.  Is it..   Remote is ok, but you must live in the same city Remote is ok, but you must live in the same country Remote is ok, but you must live in a similar timezone Remote is ok, anywhere in any timezone   Without any more details on what the employer will accept, searching for positions that will allow remote work is practically useless for people living outside of the US.

When a posting is marked "allows remote", does it mean work in the office some days, work from home some days?  Or does it mean you could actually live out of town and maybe fly in as needed?  The reason I ask is I'm really interested in public facing software rather than internal/enterprise stuff, and most of that seems to happen in a few very expensive cities.  Given it's so hard to hire in places like SV/NYC, it seems like it could be a good scenario for companies if a developer had a really solid list of accomplishments, but I don't know how many companies think this way.


For all $n\geq 1$, let $f_n: \mathbb{R}\rightarrow \mathbb{R}$ be defined by $f_n(x) = \frac{x}{1+nx^2}$. Show that the sequence of functions ${f_n}$ converges uniformly to some function $f:\mathbb{R}\rightarrow\mathbb{R}$.  My attempt: I think as $n\rightarrow\infty$, $f_n(x) = \frac{\frac{1}{n}x}{\frac{1}{n}+x^2}$ goes to $\frac{1}{nx}$, which goes to $0$ (is this true? I'm having trouble rigorously justifying it).  Then I want to show that for all x, $\sup_{x\in\mathbb{R}}|f_n(x)|\rightarrow 0$ as $n\rightarrow\infty$. This I'm having trouble with, as the reasoning seems similar to above, but I'm not positive.  Any help appreciated!

For $n=1,2,3,\dots,$ and $|x| < 1$ I need to prove that $\frac{x}{1+nx^2}$ converges uniformly to zero function. How ?. For $|x| > 1$ it is easy.


I'm trying to figure out what the default alternative hypothesis of this test means.    If my significance threshold is 0.05, is it incorrect to say only p-values < 0.05 are significant or are values > 0.95 also significant?  I just want to say the distribution of vector u is significantly different than vector v regardless of the direction (if this makes sense).

I am testing Mann-Whitney rank test with two vectors a and b. Vectors are almost similar so I expect a p-value near 0, but the returned p-value is near 1. What is the reason? I read  and also run the code with different parameters, but don't get anything near to what I expect.  from scipy.stats import mannwhitneyu import operator import numpy as np  a = [1000,100,10,1,10,100,1000,10000,1000,100,10,1] b = [999,100,10,1,10,100,1000,10000,1000,100,10,1]  print(mannwhitneyu(a, b))   The output of the code:  MannwhitneyuResult(statistic=73.5, pvalue=0.95291544831453867)   Edit:  Let's formalize the problem to eliminate any misunderstanding (please edit the question if something is wrong):  What I try to prove is that rank distribution of data are approximately equal,   Null hypothesis ($H_0$)= "ranked distribution of a and b are approximately equal"  Alternative hypothesis ($H_a$)= "ranked distribution of a and b are not equal"  significance level (alpha) = 0.05  p-value= 0.95  (p-value > alpha) so there is no sufficient evidence that $H_a$ is correct, but we cannot also conclude that ($H_0$) is true.   Instead if (p-value < alpha) was true, then we would have enough evidence against H0 and Ha can be accepted.  So what happened here is that I could not disprove the null hypothesis. However, it doesn't mean that null hypothesis is false. It is like an investigation to accuse MR X of being guilty:   $H_0$=" MR X guilty" $H_a$=" MR X not guilty"  We guess he is not guilty, but we don't have enough proof against him: (p-value > alpha), but that doesn't mean that ($H_0$) would not be true. If we could obtain enough evidence and state (p-value < alpha), then we disprove $H_0$ and we can conclude that Ha is true and he is not guilty.


I want my second user account to have root privileges in order to change udev rules.

I want to grant a newly created user sudo privileges in Ubuntu.  I tried  sudo adduser hduser admin   but it says no admin group exists. How can I do it?


After upgrading from 14.04 to 14.10 my computer cannot boot anymore, it is stuck at the logo screen (with animated dots). I'm using Windows to post this question.  By displaying the boot process, I see that it is stuck at "Stopping log initial device creation". When I press Ctrl+Alt+F2, only a flickering dash appears, and I can't even log in.    Thank you in advance for any suggestions.

After upgrading from 14.04 to 14.10 my computer cannot boot anymore, it is stuck at the logo screen (with animated dots).  By displaying the boot process, I see that it is stuck at "Stopping log initial device creation". When I press Ctrl+Alt+F2, only a flickering dash appears, and I can't even log in.    Thank you in advance for any suggestions.


C/C++ header files can be given in two forms: <foo> or "foo". For example:  #include <iostream> #include "myheader.hpp"   By default, listings does not recognize the first form, and regards the second form as a string. For example:  \documentclass{article}  \usepackage{listings} \usepackage{xcolor}  \lstset{     language = C++,     columns = flexible,     basicstyle = \ttfamily,     stringstyle = \color{red!80!black} }  \begin{document}  \begin{lstlisting} #include <iostream> #include "myheader.hpp" \end{lstlisting}  \end{document}     For differentiation, I set strings in red. As you can see, iostream was not recognized at all, and "myheader.hpp" was recognized as a string.  How can I highlight header names in a special way? Maybe like this:    Note that both forms of header files are highlighted in a different way than genuine strings.  (In C++, the only valid occurrence of such names is after #include, if that helps.)

I'd like to colorize the names of header files included in angle brackets (<>) in my C examples formatted by the listings package. In the MWE I'd like <brackets.h> to be orange too like "quotes.h". I don't want to do that manually with escapes in every listing but globally. I have tried various crude things including the use of keywordcommentsemicolon (which did not work at all because it is an undefined key although it is mentioned in the documentation... does it need to be enabled?). The most promising results were achieved by using morecomment=[s]{<}{>}. However, that would colorize everything following a <... which is not that uncommon in C ;) The solution should work independently from the documentclass, especially beamer should work, and preferably work with common listings options (i.e., not change the behavior of other formatting options such as identifierstyle.  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc}  \usepackage{xcolor} \definecolor{darkorange}{HTML}{C87B0F}  \usepackage{listings} \lstset{language=C,captionpos=b} \lstloadlanguages{C}  \lstset{%     stringstyle=\color{darkorange},     identifierstyle={\color{blue}}. }  \begin{document}  \begin{lstlisting}[gobble=4]     #include <stdlib.h>     #include "quotes.h"      int main(int argc, char **argv) {          if (argc <= 3)             return 0 > **argv;         return EXIT_SUCCESS;     } \end{lstlisting}  \end{document}


I can't change the URL of my website with .htaccess, because the query does not work anymore if I make it a pretty URL, so I am desparate to know what impact this will have on SEO. I mean, I have to use this one, because my community wants to see this page as the homepage, which I can understand, but I don't know what effect this will have on my pageranking.  The funny part is that this page has no canonical URL and it has noindex on it, so that is not good at all, but I am asking you for the URL in the address bar specifically. Can someone explain to me what will happen?

I want to know, is there a huge difference in terms of SEO between these URLs:  example.com/ontario/toronto/listings   or  example.com/listings.php?p=ontario&c=toronto   Will one URL rank higher than the other? Is there a huge difference here?


I am getting a logic error every time I run this program, I feel like the code below should do exactly what the question wants, but the output is definitely wrong. I dont see what I am doing wrong.  Write a Java program (name it RandomNumbers) that generates random numbers as follows. Make sure to properly label your output for each part below and print the outputs on separate lines. As in the previous program, use the tab escape character to line-up the outputs after the labels.  a) A random integer number between 30 and 50 (inclusive).  b) A random integer number between 20 and -20 (inclusive).  c) A random integer number between -20 and -60 (inclusive).  d) A random floating-point number between 0.0 and 15.9999 (inclusive).  This is what I have so far:  public class RandomNumbers{  public static void main(String[] args) {      // Part A) Generate a random integer number between 30 and 50 (inclusive)     System.out.println("a) Random integer between 30 and 50 (inclusive): " +             30 + (int)(Math.random() * ((50 - 30) + 1)));     // Part B) Generate a random integer number between 20 and -20 (inclusive)     System.out.println("a) Random integer between 30 and 50 (inclusive): " +             (-20) + (int)(Math.random() * ((20 - (-20)) + 1)));     // Part C) Generate a random integer number between -20 and -60 (inclusive)     System.out.println("a) Random integer between 30 and 50 (inclusive): " +             (-60) + (int)(Math.random() * (((-20) - (-60)) + 1)));     // Part d) Generate a random floating-point number between 0.0 and 15.9999 (inclusive)     System.out.println("a) Random integer between 30 and 50 (inclusive): " +            0.0 + (double)(Math.random() * ((15.9999 - 0.0) + 1))); }}   My output is: a) Random integer between 30 and 50 (inclusive): 3018 a) Random integer between 30 and 50 (inclusive): -207 a) Random integer between 30 and 50 (inclusive): -6014 a) Random integer between 30 and 50 (inclusive): 0.03.7171159220482286 which isnt right as you can see.

How do I generate a random int value in a specific range? I have tried the following, but those do not work: Attempt 1: randomNum = minimum + (int)(Math.random() * maximum);  Bug: randomNum can be bigger than maximum. Attempt 2: Random rn = new Random(); int n = maximum - minimum + 1; int i = rn.nextInt() % n; randomNum =  minimum + i;  Bug: randomNum can be smaller than minimum.


I'm a real beginner and I want to know if there's method where you can assign the keys and values from a dictionary to a list of tuples? If there's a method to do this, I also would like to know the full source code?  This is the given dictionary   dict_count = {'z': 4, 'b': 4, 'a': 6}   I expect the output to look like this  [(‘a’ 6), (‘b’ 4), (‘z’, 4)]

If I have a dictionary like:  { 'a': 1, 'b': 2, 'c': 3 }   How can I convert it to this?  [ ('a', 1), ('b', 2), ('c', 3) ]   And how can I convert it to this?  [ (1, 'a'), (2, 'b'), (3, 'c') ]


I'm using Ubuntu 12.04, 64 bit. I have tried commands and installing skype directly from the internet, it does not happen.  In laymen's term with detailed description can anyone please help me install Skype on my device?

I want to install Skype, but I can't locate it in Software Center or by using Synaptic Package Manager. Can anyone help me?


$3^4 = 3 \cdot 3 \cdot 3 \cdot 3$  $3^2 = 3 \cdot 3$  $3^1 = 3$  But my problem is for below 1:  Example:  $3^{0.7} = \ ?$  Can you please explain it to clear my doubt?

For writing a (german) article about the  I have the following question:  In school one defines the power with natural degree via  $$n^k = \underbrace{n\cdot n\cdot \ldots \cdot n}_{k \text{ times}}$$  In calculus normally recursion is used to introduce the power:  $$\begin{align} n^0 & := 1 \\ n^{k+1} & := n \cdot n^k \end{align}$$  Question: What are the disadvantages of the expression $\underbrace{n\cdot n\cdot \ldots \cdot n}_{k \text{ times}}$ and why it is not used to define the power in advanced mathematics (although it is intuitive)?  Note: I'm sorry, I had an ambiguous question before. I do not want to know, why we define the power. I want to know, why we use recursion and not the expression $\underbrace{n\cdot n\cdot \ldots \cdot n}_{k \text{ times}}$ to define the power in advanced mathematics...  My ideas so far:   $\underbrace{\ldots}_{k \text{ times}}$ is no operator, which was introduced before. definitions with recursion lead naturally to a scheme, how properties of these concepts can be proved via induction


I redirected traffic for port 80 to 8080 on my machine with  sudo iptables -A PREROUTING -t nat -p tcp --dport 80 -j REDIRECT --to-ports 8080   It works fine for all the world except my own machine. I am a developer and I need to redirect port 80 to 8080 for myself.  My IP is 192.168.0.111  My web server runs on port 8080  I wish to open website from http://192.168.0.111/ instead of http://192.168.0.111:8080/ from same machine where server runs.

I use amazon EC2 instance which works via ubuntu. By default according security restrictions I can't bin my application to port 80, so I just bind it port 8080 and then set routing redirect from port 80 to 8080 via the following command:  iptables -t nat -A PREROUTING -p tcp --dport 80 -j REDIRECT --to 8080   But I found that when I reboot the server this settings no longer active untill I invoke this command again.  So my question is how to enable port's redirect work even if system was rebooted?


I have create a brachiosaurus. Now i have to animate every bone in the neck and in the tail. Which takes a lot of time. I search for a solution, where i can grab the head an the whole neck follow the movement of the head, same for the tip of the tail. Like bending a hose in reallife. Does somebody know, what i have to change in the bones?

I was wondering if anyone knows how to set up a hose-like, cartoon-type limb like in this picture?    My current setup for my model's limbs uses Inverse Kinematics and actually works quite well for the moving whole arm around, although I do get some really nasty-looking deformations I get when I try to bend the limb, but this isn't my primary concern right now.    My main concern is that while I can manipulate the arm as a whole without trouble, trying to get the arm to bend like in the first picture is an extremely frustrating and finicky affair.  Basically, I need some method of being able to improve control over how the arm bends in order make more manageable for posing the model.    My first solution was to try and add a second IK controller to the arm that could be used as a bend point to create a curvature in the arm.  Unfortunately, trying to manipulate this second controller doesn't seem to do anything at all, and I'm not too sure whether or not I screwed something up in setting up the IK controller or if you simply cannot attach another IK controller to another IK chain (I assume the answer is the latter, although me screwing up in setting up something is also quite plausible).  Another potential solution I saw on various tutorial videos was using a Bezier Curve to control the overall curvature, but I'm not too sure whether or not I can attach a Bezier Curve to only part of a model rather the whole thing.  I tried looking for a solution by searching YouTube for a tutorial on how to rig cartoony hose limbs, but instead I was surprised by the dearth of materials on the subject, especially since its been a staple of animation since pretty much the very beginning of the medium.  I mean, I get that the standard skeleton armature is a lot easier to setup than the classic hose-style limb, but it is simply not the look that I want for this particular model.  One final thing to keep in mind is that I've been making this model for a game project that I've been working on, and thus any potential solutions for this problem must be compatible with game engines like Unreal Engine or Unity.  I hope that what I'm not asking for too much, and that I would greatly appreciate it if anyone could offer any potential help with this endeavor.    Sorry for not responding earlier, but thanks a lot for going to the effort of responding to my question, although it would appear that it wasn't needed to begin with.  After going back and playing with the armature some more, it turns out that Inverse Kinematic chains that I set up for the arms actually do work for posing, I guess I just didn't have a very good grasp of how to properly control them.  It's probably for the best that I use Inverse Kinematics anyway because I am trying to make a model that can be imported into Unreal Engine 4 and my understanding is that game engines like Unreal and Unity are incompatible with Bendy Bones.  At least that's what I have read in the past, I'm not sure if that has changed recently, but my recent attempts at trying to look into the matter has mostly come up with older information, so I have to assume that nothing has changed so far.  However, despite the fact that I won't be using your solution, I still think it was worth posting anyways because while I might not use it, there's always the possibility that it might help someone else out.  There is after all, a distinct lack of info out there on how to do cartoon-style hose limbs and having this information out there means that others can now find it and use it to help themselves out.  Its because of this I decided to go back and add some additional tags to my original post to make it easier for others to find this info.  Regardless of everything, thanks again for the help!


I have attempted manually rebooting which was unsuccessful

dev/sda1: clean, 552599/6111232 files, 7119295/24414464 blocks   After I turn on my laptop this message appears. The system never boots, the message just stays there.


I have a Samsung-SGH -I927 and would need to save on my SIM card or send to my email for back up several text SMS messaging threads. I know that I can do this with an individual SMS' by lightly tapping on them and choose the save to SIM option, but I do not know how to do it with a whole thread. How can I do it?

How do I backup and restore SMS Messages?


Is it possible to downgrade to iOS6 if the phone was never jailbroken, I'm happy to jailbreak it now to get it to work though.  Also happy to lose all data, apps, etc.

I'm trying to downgrade my iPhone from the current iOS to an older one, as per .  But every time I try, I always receive this error:     The iPhone could not be restored. This device isn't eligible for the requested build.     I have tried many times with and without DFU mode. Any ideas regarding this?


I Have step down transformer that transforms 240V to 9V.  However, I cannot find out, which terminals are for input and which are for output. The turn ratio size is very similar, because it is covered.  How can input and output side be identified?

Let's say I have a transformer with 3 coils. When primary coil is connected to 230V, two secondaries output 12V. Wires are color coded, but I don't know what colors stand for and there is no information about that on manufacturer's website.  Is there any relatively easy way to determine which wire is primary, which is secondary and which is start to the secondary and which is end of the secondary coil?


I have come across this a few times. I post a question and get at least a couple of up votes on the question but no answers. And then slowly the question disappears in the big ocean of questions that all the sites on Stack Exchange gets. The only option to bring it back to life is to assign bounty for it and that is possible only after 2 days.   What happens in the meantime? Is there any ways to attract more views? Generally SO is my fallback option when I have failed all possible attempts to solve a problem or gain enough information about something. I have seen the question die down and even not be viewed as much as I would like. Is it because the question is lacking quality ?   EDIT:  Should I put this question in different words? Assuming up votes meaning others are interested in the question too or that the question deserved credit for something, if the question has no answers, is it poorly framed ?  Especially in cases when the user (mostly me) is trying to get answers for some problem that I face trying to do something that is very common and by common I mean  everyone would at some point of time attempt to do it or have done it in their programming career.

I asked a question almost as soon as I got my account. I got a few decent answers, but none of them helped solve my problem. The question has long since become buried by newer questions, and there's still no accepted answer. Unfortunately, because there are quite a few answers with votes, to a casual observer it probably looks like the question was answered and I just neglected to mark an answer as accepted, and the system does not consider it "unanswered".  Or, I asked a question that was a bit more difficult to answer. After waiting for some time, I received no answers, little or no comments, and only a few views. The question does show up in the "unanswered" list, but no one has answered my question.  In either case, what's the protocol for me to try to get this question answered?  I see several options:   Post the question a second time, possibly linking to the original, to get attention for the original question. This is encouraged on sites like Reddit.  However, it's probably not appropriate here, since we're encouraged to check for duplicates and not submit a question that's already been asked by someone else, so this probably falls under that heading. Wait for some kind of wiki-like talk page to be implemented, then post a plea on the talk page for input and hope that activity on the talk page bumps up the question. Edit the question, but do nothing further on the Stack Exchange site. If I edit my post to say that I haven't accepted any of the current answers but am looking for more, then the question might get answered eventually by people browsing through old questions to find something they can answer. Post the question on other sites, but link to my original question on Stack Exchange. People will either answer here, or they'll answer on the other site and I can post the accepted answer here myself.  This might be considered spamming, so it might be better to do this without the link.      For more information, see the "" page in the .


I have set the datasource for TreeViewAdv and tried to use the context menu and checkbox for treeview items.   <TreeView>     <TreeViewItem Header="TestedApps"          ItemsSource="{Binding Scripts}">         <StackPanel Orientation="Horizontal">             <StackPanel.ContextMenu>                 <ContextMenu>                     <MenuItem Header="Play" Click="Play"/>                 </ContextMenu>             </StackPanel.ContextMenu>             <CheckBox Margin="0" VerticalAlignment="Center" IsChecked="{Binding IsEnabled, Mode=TwoWay}"/>             <Rectangle Margin="5 0" Width="12" Height="12" Fill="{Binding Result, Converter={StaticResource ResultConverter}}"/>             <TextBlock Margin="2 0" Text="{Binding Name}" VerticalAlignment="Center"/>         </StackPanel>     </TreeViewItem> </TreeView>   But it gives me an error "Items collection must be empty before using itemssource". I have visited some articles but could not find the reason for this.   Please anyone let me know how to solve this?  Thanks,

I'm trying to get images to display in a WPF ListView styled like a WrapPanel as described in this old ATC Avalon Team article: .    When I try to populate the ListView with a LINQ-to-Entities queried collection of ADO.NET Entity Framework objects I get the following exception:  Exception     Items collection must be empty before   using ItemsSource.   My code…  Visual Basic  Private Sub Window1_Loaded(...) Handles MyBase.Loaded     ListViewImages.ItemsSource = From g In db.Graphic _                                  Order By g.DateAdded Ascending _                                  Select g End Sub   XAML  <ListView Name="ListViewImages"           SelectionMode="Single"           ItemsSource="{Binding}">     <local:ImageView /> </ListView>   I put a breakpoint on that line.  ListViewImages.ItemsSource is Nothing just before the LINQ assignment.


Newbie here. I don't know what happened. I was was able to make one render and save it as an image. I moved the camera and added more lights, and the render hasn't worked since. I didn't change any settings or anything, it just stopped working. I even made a new camera and it didn't help. I also changed to F-stop and altered the distance settings. I'm still getting nothing.  Can anyone help?

A scene I made is not rendering, at all. This grey screen stays the same and nothing changes.  Here are my settings:  [


Can someone explain this in the most straightforward manner possible? I've looked at one other thread on here, but the mathematics was unfortunately too confusing for me. Is there some way I can understand why this is true without getting too much into mathematical bijections?

Show that the set of all finite subsets of $\mathbb{N}$ is countable.   I'm not sure how to do this problem. I keep trying to think of an explicit formula for 1-1 correspondence like adding all the elements in each subset and sending that sum to itself in the natural numbers, but that wouldn't be 1-1 because, for example, the set {1,2,3} would send to 6 and so would the set {2,4}.  Multiplying all the elements in each subset and sending that product to itself in the natural numbers wouldn't work either since, for example, {2,3} would send to 5 and so would the set {1,5}. Any ideas?


New Lyx user, not very good in page formatting. whenever i insert an image, the whole page formatting get messed up. like in the below figure. In my code the above paragraph was after the pic. but in the output the paragraph has gone above the picture.  And start of every page has so much gap. I want this if the start of the page has new section. In the below pic, you can see the picture has taken the whole page. That's because the start of the page has so much gap. i could easily fit in couple of paragrah below the picture.  How do I magange this properly, except for this i am loving Lyx.

Is there any package or a method to force LaTeX to keep floating environments like table and figure closer to where they are declared?


I have a report which returns number of doors sold in a month from 2 locations. The month is displayed as a value 1-12.... I would like to return 1-Jan, 2-Feb etc.    EDIT  I am using:  datepart(MONTH, DeFactoUser.F_ST_Transaction.STTR_DATE) to get the month number, I have tried:  datepart(MONTH, DeFactoUser.F_ST_Transaction.STTR_DATE) + '-' + datename(MONTH, DeFactoUser.F_ST_Transaction.STTR_DATE) to get the name appended to the number. I get an error Conversion failed when converting the nvarchar value 'September' to data type int.  Obviously doing something silly.... any clues would be good.

I have months stored in SQL Server as 1,2,3,4,...12. I would like to display them as January,February etc. Is there a function in SQL Server like MonthName(1) = January? I am trying to avoid a CASE statement, if possible.


OK I'm new to linux, and so there's a learning curve. But, although I worked for years with unix ksh production scripts and user support, at the moment I need to take another break.  I first installed 14.04 64-bit last week and just yesterday got past numerous stop/startovers to a system that seems(!) to work OK with one additional app installed. So now I'm encouraged. Breakthrough. Learned some things. Surely a popular package like TB won't be a problem. Not so, but far otherwise....   from Mozilla doesn't do much after a download. It points to another page for installing onto 10.10, but that page assumes that a version of TB is already installed.  For using a package manager, the page above simply refers you to the documentation of the Linux distribution you're using. I used a PPA for java yesterday for my other app.  Is that the same thing? Where is doc that explains them and how to use them on 14.04? Web search hits return all kinds of commentary, but there are 47 ways to do everything (a good thing, but...), not all of the doc is complete (assumes other knowledge), and some refers to older versions (10, 12, etc.). It makes sense to me that this function would work the same across versions, but what I assume/makes sense to me isn't always right.  For installing outside a package manager, it gives a link to a list of the libraries needed -- but no indication how to get them. Apparently I need those, because I downloaded TB per those instructions, ran ~/thunderbird/thunderbird, and nothing happened. I don't see an icon for it, either, which it seems is done by a package manager and which might be obtainable by other means -- but at this point I just want to get it working at all. The directory and files are there, but...nothing. Thought TB might be popular enough to be part of ubuntu. I'm not interested in any of the numerous apps in Launchpad, but I didn't see it there or in the Software Center.  Then this morning, looking for more info with yet more search strings, I see a comment that TB is "stock in 14.04" (not just "Lucid Lynx"?) and to wait a few days for a "push" from Canonical. That sounds promising, but what does that mean in practice? Is it available somewhere in the 14.04 (64-bit) that I just installed?   What do I need to do next? I only have the native 14.04 (64-bit) installed plus one other app. Not interested in Launchpad, if that matters.

Similar to , what's the best way to stay up to date with the latest stable releases of Thunderbird?


I'm really new to those kind of arguments so don't call me mad but I was wondering if there is a way to define an infinite set which cardinality is an Aleph-number like: $\aleph_{\frac 12}$. I have a sort of passion to generalization of math objects and I've been really astonished when I learned about fractals, whose dimensions are not an integer number so I was thinking if there is some way to build infinite sets (maybe with an unusual list of axioms) whose cardinality is not an Aleph-number with integer index  and how those numbers and sets would work. Any help or reference is appreciated :)

Is there any meaningful definition to afford for $\aleph_r$ (as in cardinality) where $r\in\mathbb{R}^+$? $r\in\mathbb{C}$? What about $\aleph_{\aleph_0}$? Can we iterate this? $\aleph_{\aleph_{\aleph_{\cdots}}}$  I may be throwing in bunch of rather naive/basic questions, for I haven't learnt much about infinite cardinalities. If I am referring to bunch of stuff abundantly dealt in established areas, please kindly point out.


My brother-in-law is sponsoring my trip. However, the company he is working at is not issuing any payslip. Will the Verification of Employment Letter and Bank Statements be enough to prove his employment and income?

The UK Visas and Immigration Directorate publishes  that provides helpful tips that can result in successful visa applications. Section 2 of this guidance opens is entitled "other documents you may want to provide" (emphasis mine).  Section 2: other documents you may want to provide – all visitors This section provides guidance on the types of documents that you may want to provide to help us consider your application against the Immigration Rules. Previous travel documents/passports, which show previous travel. Financial documents showing that you have sufficient funds available.  These must clearly show that you have access to the funds, such as:  bank statements building society book proof of earnings such as a letter from employer confirming employment details (start date of employment, salary, role, company contact details) where a third party (who is either in the UK or will be legally in the UK at the time of your visit) is providing financial support to you e.g. a business, a friend or a relative, documents to show that they have sufficient resources to support you in addition to themselves and any dependant family should be provided   The first item is "bank statements" and this ties in with the , which says...  evidence that you can support yourself during your trip, eg bank statements or payslips from the last 6 months  (Note 'eg' is a Latin abbreviation meaning "for example"; this appears to be optional rather than a fixed requirement.) Question: How should someone interpret this such that the chances of success are maximized? How many statements should I submit? What are they looking for and what do my bank statements tell about me?


I need explain on class. What is constructor and how write it and what is public namecllase(){ Here all the variable  } How this is call?   Thank you

I am trying to learn how to specify class constructors in Java. I am starting to understand that they specify the types of instance variables of objects made from that class. They also can be used to set the instance variable initial values. The follow example is from the Java tutorial on Sun's website:  public Bicycle(int startCadence, int startSpeed, int startGear) {     gear = startGear;     cadence = startCadence;     speed = startSpeed; }   Where in your classes source code should you put the constructor(s)?  Are these arguments the names of the variables?: (int startCadence, int startSpeed, int startGear) or are gear, cadence and speed the names of the variables?  What is the difference between (int startCadence, int startSpeed, int startGear) and gear, cadence and speed?  In the unlikely event that my instructor or any administrator from Salt Lake Community College ever comes across this question, let me make my intentions clear. This question is posted in the greatest spirit of academic honesty. I ask this question to seek general advice and help in understanding the proper way to use the Java programming language. I in no way use the work of others and represent it as my own work. I use the answers provided here as a general aid in my understanding. I do all my own work and do not copy work provided by people answering my question.


How to use border-radius in IE.(All Browsers)  because firefox,chrome support border-radius but how to use for IE?

Does anyone know if/when Internet Explorer will support the "border-radius" CSS attribute?


I'm getting this error when we select IE versions:  sha1sum mismatch! Rename /home/ascra/.cache/winetricks/ie7/winetest.cat and try again.

Please note, this is an informative QA post rather than a question specific, due to this issue popping up many a time.  QUESTION / ISSUE  How to solve the issue of installing IE8 (Internet Explorer) in wine (any version - to my knowledge).  Related Wine Errors:  Terminal install method  Installing IE8:  winetricks -q ie8   should give you a similar error:  Executing w_do_call ie8 Executing load_ie8 Executing wine iexplore -unregserver Executing w_do_call msls31 msls31 already installed, skipping Using native,builtin override for following DLLs: iexplore.exe itircl itss jscript msctf mshtml shdoclc shdocvw shlwapi urlmon wininet xmllite Executing winetricks_early_wine regedit /S C:\windows\Temp\_ie8\override-dll.reg Using builtin override for following DLLs: updspapi Executing winetricks_early_wine regedit /S C:\windows\Temp\_ie8\override-dll.reg Downloading http://winezeug.googlecode.com/svn/trunk/winetricks_files/winetest.cat to /home/user/.cache/winetricks/ie8 --2016-09-08 23:03:12--  http://winezeug.googlecode.com/svn/trunk/winetricks_files/winetest.cat Resolving winezeug.googlecode.com (winezeug.googlecode.com)... 66.102.1.82, 2a00:1450:400c:c06::52 Connecting to winezeug.googlecode.com (winezeug.googlecode.com)|66.102.1.82|:80... connected. HTTP request sent, awaiting response... 404 Not Found 2016-09-08 23:03:13 ERROR 404: Not Found.  ------------------------------------------------------ Downloading http://winezeug.googlecode.com/svn/trunk/winetricks_files/winetest.cat failed ------------------------------------------------------   GUI Install via Winetricks GUI method  or using the GUI method, you should see a error dialog similar to this:


How to calculate $\int \frac{1}{\sqrt{\sin x\cos^7x}}dx$? I found  a problem, but the link is not valid.

So it's given this indefinite integral $$\int \frac{1}{\sin ^{\frac{1}{2}}x \cos^{\frac{7}{2}}x}dx$$  Is there anyone could solve this integral? Thanks in advance.


I have found the inverse Laplace transform of $\log\frac{s+4}{s-4}$, but do not know how to proceed

I think I have found the final answer $\left(4 \left[\frac{2t \cosh(4t) - \sinh(4t)}{t^2}\right]\right)$ but need to verify it.


Some help regarding the following problem will be greatly appreciated. Let $n\in \mathbb{Z}^+$ with $n\geq5$, and suppose that $G$ is a simple subgroup of $S_{n+1}$ of index $k$. Prove that if $k\leq2n+2$, then ($k=2$ and $G=A_{n+1}$) or ($k=2n+2$ and $G\cong A_n$). Relevant information/What I have so far:  Theorem: Let $X$ be a subgroup of $S_n$. Then either $X \leq A_n$, or $X \cap A_n$ is a normal subgroup of $G$ of index 2.  $A_n$ is simple for $n\geq 5$   From the above information, we can deduce that $G$ is a subgroup of $A_{n+1}$. Otherwise, $G\cap A_{n+1}$ will be a non-trivial normal subgroup of $G$ which contradicts the fact that $G$ is a simple group. Another thing that I managed to deduce is that $[S_{n+1}:A_{n+1}][A_{n+1}:G]=[S_{n+1}:G]=k\leq2n+2$ $\implies2[A_{n+1}:G]=[S_{n+1}:G]=k\leq2n+2$ $\implies[A_{n+1}:G]=k/2\leq n+1$ This means that $G$ cannot be isomorphic to $A_i$, where $i=1,2,...,n-1$. This is where I got stucked at. It is clear from what I have worked out that ($k=2$ and $G=A_{n+1}$) or ($k=2n+2$ and $G\cong A_n$) would satisfy the given condition. But I do not know how to prove that either one of this two situations has to occur. Any hints/tips on how to progress would be greatly appreciated.

I have the following question:  Let $n\geq5$, and suppose that $G$ is a simple subgroup of $S_{n+1}$ of index $k$. Show that if $k\leq2n+2$, then $G=A_{n+1}$ or $G$ is isomorphic to $A_n$.  I have managed to show by using the simplicity of $G$ that $G$ must be a subgroup of $A_{n+1}$. From here, we see that if $G=A_{n+1}$ then we are done. Else, we would like to say something along the lines of $G$ being a subgroup of $A_n$. The problem is that there are $n+1$ subgroups of $A_{n+1}$ that are isomorphic to $A_n$, and as such it would be strange for me to write $G$ as a subgroup of $A_n$. Alternatively, I am trying to show that $G$ can be embedded into $A_n$, so that the statement would follow rather easily. However, I am unable to show why $G$ can be embedded into $A_n$.  Is there a way to show that there must exist some injective homomorphism from $G$ to $A_n$, or is there a way to show that all elements of $G$ must somehow fix an element of $\{1,2,\cdots,n+1\}$?


Is it okay to say      "a big news"   for example,     "I am telling you a big news"   or is it wrong? I heard a non-native English speaker say that.  The word "news" is mystery to me. It has a plural form, but it's singular non-countable. I have no idea how to use it properly.

This is a good news.    This is good news.    Which one is correct? Clarify the difference


I recently flag  as Low Quality since it is only a link. Later on, the flag went disputed without editing on the answer (I don't know why).  Then I cannot flag the question again, so I flagged it for "Other", like I readed is something I can do, in some posts here on meta.  The flag was declined:      flags should only be used to make moderators aware of content that requires their intervention   Maybe I should't flag on "Other"? I still think the question is low-quality. What is the way to proceed?

Related:  (not a dupe, that's a feature request and was closed as a dupe of another one)        (old) post does indeed say that Link-only answers can be flagged as NAA, but there are a lot of posts like  which define Not An Answer is a way that it doesn't apply to link-only answers.  Can we get some up-to-date consensus on this? That link only answers are not allowed is .


When I tried to assign a derived class object to a base class, the 'unique' part in the derived class will be sliced down. So what happen to those part that being sliced away?  Are they destroyed properly or they are just lost in memory? And if I alloc some memories on those derived part, when the object slicing happen, will the alloced memories be freed properly? I suppose it will lead to some undefined behavior, since we never declare an approach to destroyed those derived parts when object slicing.  And after all, what's a situation that we need to use object slicing? Or we should always avoid that ?

Someone mentioned it in the IRC as the slicing problem.


Thinking back to the original Star Wars trilogy, the Empire did not seem to have any high ranking female officers that I can recall, or who were intrinsic to the story line.  The Rebels had Mon Mothma and Leia Organa to name at least two, not counting pilots or other lower ranked officers or civilians.  I don't recall any female Star Destroyer captains or admirals.  In The Force Awakens, Captain Phasma is clearly fairly highly ranked within the First Order, which is a departure from the overwhelmingly male senior officers within the Empire.  I'm aware that in the extended universe, there are a number of Dark Jedi, and even the Emperor's Hands (such as Mara Jade in Timothy Zahn's Thrawn series), but they aren't necessarily within the direct chain of command.  So my question is, Is Captain Phasma the highest ranking military female officer in the First Order?

When First Order launched the Starkiller, it was General Hux's order, Ren was in his warship. I wonder which of those two has higher rank in the First Order?


It is well known that $i$ is unit imaginary part of any complex number, but many uses of $i$ show that has others mathematical properties, for example in integration area, if I want to compute integral of $ix$ I will get $i \frac{x²}{2} $ then here $i$ is considered a constant. Also if I want to check divisors of $i$ I got only  $1$ then here $i$ has divisors however it is not integer.  Really I would like to know more about the nature of "unit imaginary part" $i$, or what the Mathematical nature of $i$ is?    Thank you for any help.

At school, I really struggled to understand the concept of imaginary numbers.  My teacher told us that an imaginary number is a number that has something to do with the square root of $-1$.  When I tried to calculate the square root of $-1$ on my calculator, it gave me an error.  To this day I still do not understand imaginary numbers.  It makes no sense to me at all.  Is there someone here who totally gets it and can explain it?  Why is the concept even useful?


Before with the old client, the chats are stored in the .skype directory, but I am not sure how to find the chat history in the new skype for linux beta.

How can I search within skype chat history?  I tried CTRL+F but nothing happens.


Before I start, let me say I hope this question isn't marked as seeking personal medical advice because I'm not asking for medical advice, and even though I talk about my personal experiences, I just want to know if circumcision can lead to early childhood masturbation.  I was circumcised when I was about 3 or 4 and I can't remember at which age I started masturbating so my guess is that it started right after that (very early). For as long as I can remember, I've always had a sensetive penis and I think that led to early masturbation. I could always feel slight stimulation whenever I lied down towards the bed.  Also I wonder if this has anything to do with being "cut tight".

In my point of view, nowadays the male circumcision procedure is becoming unpopular. There may be substantial grounds for that.  There may be numerous subjective opinions about noticeable sensitivity reduction, but are there any objective medical studies that confirm the negative effect is really presented and sexual sensitivity is in fact damaged after male circumcision? For the moment, I am not interested in advantages of this procedure. Sensitivity reduction (provided that it really damages sexual health of men) is the one disadvantage that outweighs all the advantages of this controversial procedure.        Update:  Some information about the matter can also be found on Quora:


I understand that this command attempts to write to nowhere or a null device but what does 2>&1 mean here?  wget -q -O - http://yourwebsite.com/wp-cron.php?doing_wp_cron > /dev/null 2>&1

I know what    program > /dev/null 2>&1    does. It redirects the output to /dev/null and 2>&1 means to redirect the error output in the same place where the output is sent.  My problem is I always have to google it because I never remember it.  So, I try &2>1, 1>2&, 1>&2... I try every combination until I google it...  What's the trick to remember it easily?


I am running Ubuntu 16.04 LTS on an Intel Quad Q9450@ 2.66GHzx4, 64 bit. I am trying to install Ubuntu 16.04.3. Afte downloading the iso file and clickimg it, a series of folders is saved, and there is no executable file or the like. I have also tried burning a dvd within ubuntu of the new os files by right clicking on the iso and burning ot to dvd, however, the dvd contains the same series of files and no executable, and no expanation text. I am new to ubuntu and the cumputer was given to me. How do inStall/upgrade? Thanks

This is the third time I've tried to install Ubuntu Server 14.04.03 64-bit on the same laptop, and each time it caused different problems.  Each time I wrote the same iso image to a USB flash drive by using a different application and OS.   Universal USB Installer (pendrivelinux.com) from Windows WinImage writer from Windows built-in image writer from Linux Mint 17.2    The iso image is the same in all three cases, the USB flash drive is the same, and the laptop is the same. However each time the installation of Ubuntu gave me different installation options. For example, the last time I installed Ubuntu, it didn't show all the packages to choose while installing (Basic Ubuntu server, etc.).


We recently recoated our worktop with Danish Oil and noticed later that some oil had dripped down our silver effect washing machine. We have tried soapy water and white spirit but can't remove the stains. Does anyone have any suggestionsfor what we could use? Thanks in advance.

My worktops are treated with Danish oil, and I appear to have got some on the tiled splashbacks and not noticed until it's cured (it's not very obvious except in daylight, I oiled by artifical light).  Is there any way to get it off?  I don't want to use a blade until I've got an idea of how to get the residue off where the blade won't attack it.  It's not going sticky, so not a duplicate of .


I run a script like:  sleep 20 & PID=$! kill -9 $PID >/dev/null 2>&1   I dont want the script show the output like:  line 51: 22943 Killed  sleep   I have no idea why this happen, I have redirect the output to /dev/null

How can you suppress the Terminated message that comes up after you kill a process in a bash script?  I tried set +bm, but that doesn't work.  I know another solution involves calling exec 2> /dev/null, but is that reliable? How do I reset it back so that I can continue to see stderr?


I have a number of polygons (in the hundreds) that have been taken from a cadastral layer and I am trying to create another polygon layer based on that group of polygons (from a field ID) without digitizing if possible?  I have looked at the convex hull tool in QGIS but it only creates the minimum boundary I am looking for an exact replica of the exisitng polygons - essentially removing all the parcels and being left with a singlepart polygon of the area.  I have access to ArcGIS as well if there are any tools suitable ?    and what I want to achieve is:

I am looking for a tool in QGIS 2.40 that performs the function ArcGIS refers to as . Basically it takes a group of polygons within a specified distance and creates a concave hull around them.  Does anyone know if this functionality (or anything similar) exists within QGIS currently?


I need to fill a binary tree using only class Node with recursion. However when I try to use left and right children I get a NullPointerException. How should I fix it?  public class Node {      private Integer key;     public Node right;     public Node left;      public void addValue(Integer value) {         if (key == null) {             key = value;             right = null;             left = null;         } else {             if (key > value) {                 left.addValue(value);                 left.right = null;                 left.left = null;             } else {                 right.addValue(value);                 right.right = null;                 right.left = null;             }         }     } }  public class Main { public static void main(String[] args) {     Node node = new Node();     node.addValue(5);     node.addValue(4);     node.addValue(3);     node.addValue(2);     node.addValue(1); }   }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I have used phpMyAdmin to export a database from my remote server to WAMP via SQL file. All php code is the same on both sites but the local site gets charset errors when pulling data out of the database (black diamonds with ? where apostrophes should be). Database Collation (both): utf8mb4_general_ci Table Collation (both): utf8_general_ci Column Collation (both): utf8_general_ci When I run mysqli_character_set_name() on the remote site it returns uft8 but the local site defaults to latin1. If I set the local site to utf8 with mysqli_character_set_name() the black triangles turn to two white rectangles with black borders. What am I missing?

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


I'm looking for a closed expression (if it exists) of the following sum: $$\sum_{m=0}^{\infty} \frac{m^n}{m!}c^m$$ where $n \geq 1$ is a positive integer, and $c$ is a fixed constant. The series seems to be convergent for all positive integers $n$, but I can't see the pattern; first values are:  $$\sum_{m=0}^{\infty} \frac{m}{m!}c^m=ce^c$$ $$\sum_{m=0}^{\infty} \frac{m^2}{m!}c^m=c(c+1)e^c$$ $$\sum_{m=0}^{\infty} \frac{m^3}{m!}c^m=c(c^2+3c+1)e^c$$ But for an arbitrary $n$? I can't find any reference. Thanks!

I have come across a power series as follows, \begin{equation} f(x)=\sum_{n=0}^\infty\frac{n^p}{n!}x^n. \end{equation} It shows that for some small $p$ values, we can derive simple closed forms:  $p=1: f(x)=e^xx$;  $p=2: f(x)=e^x(x+x^2)$;  $p=3: f(x)=e^x(x+3x^2+x^3)$;  $p=4: f(x)=e^x(x+7x^2+6x^3+x^4)$;  ...  Is it possible to derive a closed-form for this power series for general $p$?


I got really confused about the graph of the relationship between wavelength and intensity of black body radiation. What does the peak stand for? And what does the graph tell us?How can we analyze it?

Why is it that thermal radiation of a black body usually described by a spectral distribution function rather than an intensity vs frequency curve?   I have a vague explanation for this: Any measured intensity of radiation will contain a spectrum of frequencies which are impossible to separate (even with a very good spectrometer, one can only measure the intensity of an interval). So it is practically impossible to assign a particular intensity to a particular frequency.  Is my reasoning correct?


The problem is to find the summary of this statement: $$\sin(x) + \sin(3x) + \sin(5x) + \dotsb + \sin(2n - 1)x =  $$  I've tried to rewrite all sinuses as complex numbers but it was in vain. I suppose there is much more complicated method to do this. I think it may be solved somehow using complex numbers or progressoins.   How it's solved using complex numbers or even without them if possible?  Thanks a lot.

How can we sum up $\sin$ and $\cos$ series when the angles are in arithmetic progression? For example here is the sum of $\cos$ series:  $$\sum_{k=0}^{n-1}\cos (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \cos \biggl( \frac{ 2 a + (n-1)\cdot d}{2}\biggr)$$  There is a slight difference in case of $\sin$, which is: $$\sum_{k=0}^{n-1}\sin (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \sin\biggl( \frac{2  a + (n-1)\cdot d}{2}\biggr)$$   How do we prove the above two identities?


Let $A$ a commutative ring with unity in which every element is idempotent ($x^n=x$ for some n>1 dependent on $x$), then every prime ideal is maximal.  I came across this question revisiting Atiyah's Intro to Commutative Algebra for my comp, and even though it seems very simple I'm stuck. From the theorems I have available, I can only think of the quotient ring route, somehow using idempotence to show that A/p is not only an integral domain, but also a field, so that p is maximal. But I got nowhere with that approach. Any ideas are appreciated.

Let R be a commutative ring with an identity such that for all $r\in$ R, there exists some $n>1$ such that $r^n = r$. Show that any prime ideal is  maximal. (Atiyah and MacDonald, Introduction to Commutative Algebra, Chapter 1, Exercise 7.)    Any hints?


I want to write a EF query which does order by ascending or descending based on condition. Following is the my pseudo code:    var result= q.OrderByDescending(x => x.StatusId == 3)                     then if( x.StatusId == 3)                            then order by x.ReserveDate                      else                           then order by descending x.LastUpdateDate   How can i do this?

I have a method which is given the parameter "bool sortAscending". Now I want to use LINQ to create sorted list depending on this parameter. I got then this:  var ascendingQuery = from data in dataList                       orderby data.Property ascending                       select data;  var descendingQuery = from data in dataList                       orderby data.Property descending                       select data;   As you can see, both queries differ only in "ascending" resp. "descending". I'd like to merge both queries, but I don't know how. Does anyone have the answer?


I am trying to make a cartographic map like this, I have the qgis software, base layers, and Dem available. What will be the workflow which I need to proceed to make maps like this?

I know nothing about Blender and I need to do a very simple 3D terrain with texture map.  I have a 1000 x 700 height map:   And I have a 1000 x 700 texture map:   And I want to combine them into a 3D model that I can view. I have done this before, about 8 years ago, in XNA but none of my old code will compile anymore under Visual Studio 2010.  I apologize that this is a very simple question. I'm not a CGI artist and I don't anything about Blender but I know that it can do this simple thing.  What are the steps to do this with Blender?  Thanks for posting the steps but I don't have Import -> images as planes. I just have this:   Am I in the wrong place? Thanks in advance!


What is the period of $\sin 2\theta  + \sin \frac{\theta}{2}$? The period of the first term is $\pi$ and that of the second is $4\pi$. Does that mean that the period of the whole is $4\pi$?

Find the principal period of $$\sin\frac{3x}{4}+\cos\frac{2x}{5}$$    It was easy to find principle when single trigonometric function is given, but i don't know how to find principal period of sum of trigonometric function.  I have tried using . It didn't helped because it seems complicated to find the period using graph of this type of function.  My book has given solution, they have taken out period of each function and then assuming something m and n, seems too complicated because i think we can directly find the period, without assuming.


There are a lot of factors with drop rates in Borderlands 2, I was wondering: Does the drop rate for legendary items (or any better colored item) increase when in TVHM or in UVHM?   And if it does increase, would say, all four players in a game have the Vault Hunter's Relic, would it it's 5% chance of dropping rare items stack? Increasing the already increased drop rates when in harder modes?

True Vault Hunter Mode I heard it gives better and more loot, so does that mean legendary? Vault Hunter's Relic Says it increases rare drop rates, legendaries are rare, too... (heh)


Why would Ubuntu as a generalized statement recommend its 64 bit “flavour”?   As far as I understand a 64-bit OS can only be installed on a 64-bit hardware (CPU), i.e. 32-bit and 64-bit OS can be installed on a 64-bit hardware, but only a 32-bit OS can be installed on a 32-bit hardware (regardless of the amount of RAM available).  You can see this on the :  .   EDIT I understand , and I see the pros and cons. For users with a 32-bit hardware this is not a question of choice. Recommending a 64-bit OS without taking into account the hardware is like recommending petrol over diesel and neglecting the engine. The download site does not check for 64 bit processor hardware, and if detected recommend a 64-bit OS, but recommends a 64-bit OS to all users (with more than 2 GB RAM).   It has been stated that ”manufacturers don’t really make 32-bit systems any more” (Dalton), and that “almost all chips in recent history are 64 bit” (oldfred). This is true at least for . So this recommendation simply reflects a trend in industrial production?

What is the difference between 32-bit and 64-bit Ubuntu? I've heard the 64-bit platform performs better and can detect more than 4GB of RAM. Also, while some apps haven't ported to 64-bit yet, ia32-libs lets a 64-bit machine run them.  If so, why not promote 64-bit over 32-bit?


one of the web site (in Drupal 7.43) I am looking after (apparently not that well, although updates have always been applied) has been hacked. There's now extra text in the footer pointing to an Italian escort web site.  The following code is the culprit:

incontri escort milano - ...

   (Note that I removed some of the code - that's the 3 dots. And I added dashes to the URL to avoid to point to it).  I don't know what to do to remove it ! :-( Any help would be appreciated.  Cheers, L@u

I just updated all my sites using the patch method of resolving the Drupal SA-CORE-2014-005 exploit. I just read reports that just yesterday there is someone from a Russian IP infiltrating drupal sites.     My main concerns are now:   How do I tell if my sites have been comprised? What should I search for in my apache access logs to detect if my site was a victim or not? So far what are these hackers doing to comprised sites?


So I have the following tag I want to find using Xpath:
This is the text
   Normally, I would write it like this:  //h1[@id='Label' and text() = "This is the text"]   Or, if I want to extract just partion of the text, I use the following:  //h1[text()[contains(.,'text')]]   Now, I tried to look for tutorials wether you can mix both statements: so I want to have an Xpath Expression that contains both @id and contains the text "Text". Is such a thing even possible?   I tried doing this:  //h1[@id='Label' and [contains(@text,"text"])]    But that doesn't give me a propper result.

I am trying to build a complex xpath expression which will answer the following condition.  From the XML data below, returns the User entity which:   His loginname is "user1" His name is "User 1" He has 2 different profiles values which are "operator" and "admin" (I don't know the exact order ahead)         <user>   <login>user1</login>   <name>User 1</name>   <profile>     <value>admin</value>     <id>2</id>     <description>admin users</description>   </profile>   <profile>     <value>operator</value>       <id>1</id>     <description>Operator</description>   </profile> </user>  <user>   <login>user2</login>   <name>User 2</name>   <profile>     <value>admin</value>     <id>4</id>     <description>admins users</description>   </profile>   <profile>     <value>poweruser</value>       <id>5</id>     <description>power users</description>   </profile> </user>  </root>    Can someone please supply an example for such a case?  EDIT: Added a complex profile entity


I have a formula to subtract several cells from 1 cell and I am getting a result of -2.27374E-13. The formula is D235-E235-F235-G235-H235-I235-J235, each column has a dollar value and no matter how I try to calculate it it still comes out (0.00).   D235 = 2386.16 E235 =    0.00 F235 = 1431.70 G235 =    0.00 H235 =    0.00 I235 =  954.46 J235 =    0.00

It's supposed to be zero but for some reason the result produces a peculiar series of digits at the end.  Also, here's the .xlsx of it: http://83.212.111.36/Book1.xlsx


recently i took a power supply fan which says 12 V and maybe 0.15 A to run.So which is the priority that i should follow to make it run should i go for 12 v supply or should i go for 0.15 A  secondly if i take 12v car battery to run it will the fan burn because it has a higher current as compared to the required current  previously i connected AA size batteries in series that made up 6 V . The motor started to rotate but it was too low?

Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.


I am a wood elf so I would like to be married to a wood elf so is there any wood elf wives out there?

In the vein of  - Pete Hines, Bethesda's VP of PR and Marketing, when asked if Skyrim would support gay marriage :     You can marry anyone...Not any NPC, just mean any male or female.   So obviously some NPCs are off the list.  I assume I can't marry Jarl Balgruuf, but what about Irileth?  What about the Graybeards?  What about already-married NPCs?  Is it any "important" NPC, or is it more or less than that?  Has the Skyrim Creation Kit shed any light on how to determine this?


I have   $string = "temp";   I want extract string value and make new variable (array) :  $temp = array();   is possible?

I want to store courseworks marks of n courseworks into n variables, such as cw1 and cw2 etc. Using variable variables how can I come with cw1, cw2 etc.   How can I dynamically create variables?


When I attempt to do any updates, I receive the following error message:  E:Encountered a section with no Package: header,  E:Problem with MergeList /var/lib/apt/lists/security.ubuntu.com_ubuntu_dists_precise-security_restricted_binary-i386_Packages,  E:The package lists or status file could not be parsed or opened.

The computer gave me this output in a window:  E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_natty_main_binary-i386_Packages E: The package lists or status file could not be parsed or opened.   How can I fix this?


Here's what I did   I have an SSD and regular hard drive I installed Ubuntu 13.10 on SSD and Windows on the regular hard drive everything is in harmony Then created another partition on the SSD and installed Windows on that partition (because Windows on the regular hard drive is giving me horrible performance) Now my Thinkpad T430 will boot directly into Windows   My questions are    How can I still boot into my Ubuntu? because I need to retrieve important files. If the above is not doable, then Can I still boot into the Windows on the regular hard drive? I made a backup of ubuntu there. I should still retrieve files from that backup.    Any help, feedback and suggestions are greatly appreciated  thanks so much Shawn

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


While I was learning introductory statical physics/ thermal physics, I have following doubt below Suppose that we have a system which is very very big, consisting of objects which are very very small (like point particles) comparable to the system but big enough. Now, according to second law of thermodynamics the entropy of the system will increase to achieve equilibrium but at the same time gravitational pulling will try to accumulate all the objects (since, objects are quite big enough so gravitational pull will also be strong enough), hence randomness (distribution of the microstates) will decrease, isn't it a contradiction?  Any answer/comments are welcome and thanks for that.

I'm a total physics n00b (i.e. I only know the physics as taught in IT grades, and don't remember much of it), and was talking about entropy (initially, not with the physical implications). My friend talked about entropy and gravity and was not sure about the fact that entropy decreases with gravitationally bound systems.  , but "apparently proving" that gravity decreases it. Finally, in the final link where he will show the prove that gravitational systems do not decrease entropy, it shows this text:     So, you're wondering why gravity doesn't violate the 2nd law of thermodynamics, even though the entropy of a gas cloud decreases as it shrinks under its own gravitational pull? The answer is simple, but I'll just give you a hint. We've already seen that as it shrinks, it loses energy. The energy has to go somewhere. Where does it go? If you figure that out, you'll see that the total entropy is not actually decreasing - it's just leaving the gas cloud and going somehere else!   My question is: No, actually I cannot figure if out. Can someone help me to figure it out? (yes, perhaps it's a very simple answer but no, still don't get it).


I want to change all lines in a file with zero or one space at the end to end with exactly two spaces (to force line breaks when the file is parsed with markdown).  I've done it in Sublime Text with the following find and replace regexes:  Find:    (\S)[ ]?\n Replace: \1  \n   But out of interest, I wanted to try and do the same substitution in vim.  I tried the above but it found no matches. So I tried  :%s/\(\S\)[ ]\?\n/\1  \n/g   and it places weird characters all through the file.  On its own, /\(\S\)[ ]\?\n finds all the correct line endings.

From question . You have to use \r when replacing text for a newline, like this  :%s/%/\r/g   But when replacing end of lines and newlines for a character, you can do it like:  :%s/\n/%/g    What section of the manual documents these behaviors, and what's the reasoning behind them?


My task at hand is to find a tight asymptotic upper bound for the recurrence $p(n)=\sqrt{n}p(\sqrt{n})+\sqrt{n}$. My initial idea has been to substitute $m=\lg n$ and define a new recurrence $s(m)=p(2^m)=m/2s(m/2)+m/2$.  This method was described in my book CLRS, and this is where i run into some trouble. I know how to use the substitution method on this recurrence, but i have no idea on how to place my intial guess. I then tried to analyse the recursion tree. We see that on the first layer we have $1$ node with cost $m/2$, on the second layer we have $m/2$ nodes with a cost of $m/2$ giving us a layer cost of $m^2/4$. in general it seems that the total cost of a layer is $m/2^l\cdot\frac{m}{2}\frac{m^2}{4}\cdot...\cdot\frac{m^l}{2^l}$. This seems incorrect, and even if it is correct i am not sure where to go from here. It looks like the cost peaks around some point, and then becomes extremely small. What i guess i need help to, is placing a good guess on an upper bound for $s(m)$

A former student of mine was TA-ing an algorithms class last quarter and asked students to solve this famous recurrence relation:  $$T(n) = \sqrt n T(\sqrt{n}) + n$$  There are  and this question has already been asked here.  I was talking to my student about this problem and mentioned that it's quite hard to solve and is pretty dependent on the particular choices being made. As an example, I suggested this variant of a recurrence relation that was less simple to solve:  $$T(n) = \sqrt n T(\sqrt{n}) + \sqrt{n}$$  The TA and I tried solving this recurrence for about an hour and a half without making any progress. Here are a few things we tried:   My approach to solving the initial recurrence relation was to draw out a recursion tree and notice that each level of the tree contributes $n$ to the total and that there are $O(\log \log n)$ layers, so the recurrence solves to $O(n \log \log n)$. When I tried doing this here, I noticed that the work per layer was no longer constant; instead, the top layer sums to $\sqrt{n}$, the second layer to $n^{3/4}$, the third to $n^{7/8}$, etc. We got stuck working with the summation $n^{1/2} + n^{3/4} + n^{7/8} + ...$. We tried using the iteration method to unroll the recurrence. With the original recurrence relation, this works out nicely; here, we got stuck at the same summation given above.   I'm completely stuck trying to figure out how to solve this recurrence relation. There's nothing riding on it per se - I don't need to solve it for any particular reason - but the fact that we arrived at it by a straightforward modification of a common algorithms problem set question makes it all the more enticing.  Any idea how to solve this recurrence?  Thanks!


I  recently purchased a laptop ,I have  get suggestions from so many people that we should start charging laptop when battery is about to drain and the reason I am getting is battery will last for years if i do that. Is it true.?

10 years ago when I was doing hardware support it was best practice to fully drain a laptop battery prior to recharging in order to maximize its life.  Is this still the case or can a battery now be recharged at any point without worrying about shortening the lifespan?


I have a question. So I have 2 folders, both of which have the same files in them, but some with different content, but the same names. What I want to do is clone all of the file permissions from one folder, into the permissions for another folder. Is this possible?

I have two files in a directory. One has correct permissions and the other has not. Is there a way I can "copy" the set of permissions from one file to another?


I've designed a mobile app design for couple of project, but still i couldn't understand the DPI concept.  I using photoshop for designing. Im doing design with the dimension of 1080*1920 - which is (3x - I guess i'm right) and with the density of 72. Is this right way of initializing a canvas size and density?  Could anybody guide me?

I am newbie at working with android.   I have read several uxexchange questions here, articles etc. but I am still struggling on which size of screen should I start for the android app we need to work?  I have read the guidelines also in android but I still don't understand. My head is a mess with all the dpi, dp, the formula they give...I don't know where to go/start...I'm lost.  The app we need to work has as target devices the followings: Motorola TC55 and Samsung Galaxy S4 mini  I know for mobile the best is to start designing with the smallest screen. So, in my case, which should be? I'm working with fireworks/photoshop...so I only have the option there to manage px...which size should the screen be? which dpi resolution?  and if you could let me know, how did you arrive to that resolution I would be entirely grateful. I would like to understand android screen way of thinking. =S  Could you help me please?