I want to make a simple IOT project for my home and I'm searching for a mcu to start with. I was raffling through the web site of a few popular distributors and I found that some Cortex-M4 are much more expensive than Cortex-M7 which are more powerful though. Also I saw that some Cortex-A5 are cheaper than some Cortex-M7.   I can understand the differences in terms of performance and architecture, but if someone wants to start developing a board based on some of the MCUs that mentioned above for building its own projects, what statements must be considered to match our demands?  To be exact, why not choosing a Cortex-A5 if it's more cheaper and powerful instead of a Cortex-M7?

When I'm asking this, I think on microcontrollers, whats the difference between A and M series of ARM processors. Many microcontrollers such as Beagle Bone now have A type of Cortex?


I used Gauss's test and found that we need $(p-1)\ln(n)+q>0$ for this sum to be convergent, which is correct for $p>1$. For $p=1$, I get that $q>0$ is sufficient, which I know is not true, since $\sum \frac{1}{n\ln(n)}$ diverges. Using the integral test, I see that I need $q>1$ when $p=1$ for this sum to be convergent. What's wrong with Gauss's test? I think the problem could be due to the approximation I used with Gauss's test.  And here is the work, typeset: $$\frac{a_n}{a_{n+1}} = \frac{(n+1)^p(\ln{(n+1)})^q}{n^p(\ln{n})^q} = \frac{n^p(1+\frac{1}{n})^p}{n^p}\frac{(\ln{n} + \ln{(1+\frac{1}{n})})^q}{(\ln{n})^q}$$ $$= \left(1+\frac{1}{n}\right)^p\frac{(\ln{n} + \frac{1}{n})^q}{(\ln{n})^q} = \left(1+\frac{p}{n}\right)\frac{(\ln{n})^q(1 + \frac{1}{n\ln{n}})^q}{(\ln{n})^q}= \left(1+\frac{p}{n}\right)\left(1 + \frac{1}{n\ln{n}}\right)^q$$ $$= 1 + \frac{p + \frac{q}{\ln{n}}}{n} + \cdots$$ $$p + \frac{q}{\ln{n}} > 1 \Leftrightarrow (p-1)\ln{n} + q > 0$$ Was my approximation invalid? Or does Gauss's test not apply to this series for some reason?

Study the convergence of $$\sum_{n=2}^{\infty}  \frac{1}{n^{\alpha}\ln^{\beta}(n)}$$ where $\alpha, \beta \in  \mathbb{R}$   I have proved that:   This series diverges when $\alpha \leq 0$. This series converges when $\alpha > 1, \beta > 0$ This series diverges when $0 < \alpha < 1, \beta > 0$ This series converges when $\alpha = 1, \beta > 1$      Question: What happens when $\alpha > 0$ and $ \beta < 0$?   There are other questions on MSE which ask about this series, but this question is distinct because   I would like an argument which does not rely on the integral test for series convergence, and this question considers all real $\alpha$ and $\beta$, while other questions ask only about $\alpha, \beta > 0$, where we can apply Cauchy condensation criterion


Prove $\mathbb{Z}^n$ is countable.  My attempt: We know $\mathbb{N}$ is a countable set (trivial)  Moreover, $\mathbb{Z}$ is a countable set because we can construct a bijective function in $\mathbb{N}\rightarrow \mathbb{Z}$ such that   I have stuck because i want prove $\mathbb{Z^n}$ is countable.  Can someone help me?

I am very new to proofs so please excuse any trivial errors.  In lecture we were told that:     A set $\mathbb S$ is called finite if there exists a one-to-one    mapping (bijective mapping) between $\mathbb S$ and the set $\mathbb  N_n=\{0,1,2,3,...,n-1\}$ for some natural number $n$. A set is called    countable infinite if there exists a bijective mapping between    $\mathbb S$ and the set $\mathbb N=\{0,1,2,...\} $ of all natural    numbers   I want to answer the following questions:  1. Show that the set $\mathbb S=\{a,b,c\}$ is countable  Does countable mean countable infinite? An attempt from another post on this site: For all triples $(a,b,c)$ there exists an according sum $S=a+b+c \implies ...$ But wouldn't the sum be a surjection between $\mathbb S$ and $\mathbb N$ and not a bijection?  2. Show that the set of integer numbers $\mathbb Z=\{0,\pm1,\pm 2,...\}$ is countable infinite  Before I continue with this proof I have a question about mapping. The definition says that "if there exists a bijective mapping...". In this context, can a function $f(x)$ be considered a mapping? If yes, then can't I just define myself some map $$f:\mathbb Z\to \mathbb N$$  and let $\space f$ be: $$x \mapsto \lvert x \rvert$$  which would then automatically imply that $\mathbb Z$ is countable infinite? (or wouldn't it)?  3. Show that $\mathbb S=\mathbb N \times \mathbb N=\{x |x=(p,q),p,q \in \mathbb N\}$ is countable infinite.   I am not sure about this one but if my "intuition" from 2) turns out to be correct I can maybe define some sort of norm and show that it is a bijection between $\mathbb S$ and $\mathbb N$


Let $F\subset E$ be a finite degree field extension. Then $E=F[\alpha]$ for some element $\alpha \in E$ iff there are only finitely many fields $K$ with $F \subset K \subset E$. In other words, a finite degree field extension is a simple extension if and only if there are only finitely many intermediate fields.  I don't know how should begin the proof. Is there any book you can suggest to read this proof of theorem?  Thanks a lot.

It is well-known that is $E$ is a simple finite extension over $F$, then it has finite many intermediate fields.   Actually Minle's notes says that if an finite extension has finite intermediate fields, then it is simple! I am curious about this fact, could someone give a proof? Thanks!


I would like to know that since objects on JavaScript work as references, how I still to get the properties values from a cloned object as shown below:    let user = {   name: 'Dan',   age: 26,   sayHi(){       console.log('Hi', this.name);   }      }  let user2 = user;  user.name = 'Suzan'; user = null;  console.log(user2.name); //return Suzan     If object user received null, user2 shouldn't be null as well? Since they are pointing to the same memory addresses?

What is the most efficient way to clone a JavaScript object? I've seen obj = eval(uneval(o)); being used, but . I've done things like obj = JSON.parse(JSON.stringify(o)); but question the efficiency.  I've also seen recursive copying functions with various flaws.  I'm surprised no canonical solution exists.


I stated the following:     Angela was reading to Frank and I.     Someone corrected me, stating      "Frank and me"    Which is right?

From some comments in the answers for  (now deleted, 10k only), there's confusion around the usage of I vs. me:  While the sentence, "the other attendees are myself and Steve," is agreed to be incorrect, there's confusion about whether the correct form is "the other attendees are me and Steve" or "the other attendees are Steve and I."  (I've always used the heuristic of removing the other people from the sentence, so I always thought "the other attendee is me" would be correct, instead of "the other attendee is I." Is this true, or am I using a flawed heuristic?)


I've tried a bunch of different approaches to this question (and would particularly appreciate some hints that don't give the whole thing away immediately). I've noticed that if $S$  contains some finite subsets, then for each $n \in \mathbb{N}$ there is at most one subset of size $n$ in the collection $S$ as $S$ can't contain duplicates (in order to satisfy the given condition). Certainly if $A_i$ is a finite subset contained in $S$ of size $i$, then $A_i \subset A_j$ if $i > j$. I've tried considering the possibilities where there are some finite subsets in the collection $S$, and then we can also add in infinite-size subsets that are each a superset of all of the finite subsets. However it seems rather difficult to visualise what happens when you consider infinite subsets of $\mathbb{N}$ that can't be obtained by removing finitely many elements from $\mathbb{N}$. What are good approaches to take to figure out whether such a set can be uncountable - is there an element of construction here?

Denote by $\mathbb{N}$ the set of natural numbers and by $2^{\mathbb N}$ the set of all subsets of $\mathbb N$. Let $E$ be some subset of $2^{\mathbb N}$ such that for  every pair of elements in $E$, one is a subset of the other. Clearly, $E$ could be countable by considering $E=\big\{\{1,\cdots, n\}, n\in\mathbb N\big\}$. My question is the following: could we find an example that $E$ is uncountable? Many thanks for the answer!


When I have the gems,I will tell you.      When I will have the gems,I will tell you.   The first one seems incorrect to a non-native speaker like me.But it is used by native speakers.How do the sentences differ?  An example:I will do when I have the rest.

I read something in the manga:     When this battle will finally be over... take me out to eat some tasty yakiniku.   "when...will be" seems strange to me, isn't it better saying "When this battle is finally over"? Since this is translated from Japanese, I am not sure whether its grammar is correct or not.


A check-box should be available to mods to allow them to do useful manual retagging (the type that is not possible to do automatically, like separate the volume tag into logical-drive and audio tags on SU) without flooding the front page.  The check-box should be associated with a text field or something that would hold the meta post that the mod is acting in accord with. This would generate a list on that post with all the posts that have been edited in accordance with the meta post.  This would accomplish three objectives:   Not flood the front page when doing these types of edits Create an easy way for the edits relating to a meta post to be tracked Allow for some review over the process should a user want to look it over for some reason (I.e. a mod cannot do anything they want, and not have it show up anywhere. I don't anticipate this being a problem, but it can't hurt either)   Thoughts?

CHAOS members have (had?) :     Because they are doing so many edits at once, CHAOS operates in a special mode where editing a title does not bump it to the home page.    I moderate at Writers.SE, and I can attest that this ability would be extremely beneficial to mods as well, and for the same reasons. On beta sites, wide-ranging changes are not infrequent. An established tag might be ruled problematic; a certain class of questions might need cleanup; etc. etc.. When this happens, the ensuing edits flood the front page with old content (frequently the somewhat problematic content the new change has come to address...). Furthermore, since beta sites are much less active than established ones, this flood can drown out recent activity, and then wallow around on the front page for some time.  I propose, then, the implementation of a moderator tool for editing without bumping. The value to beta sites is clear; the danger of abuse, as a mod tool, is nonexistent.


I am trying get a counter to work in PHP so it basically counts '5' then '4' and so on till 0. It will redirect to a different page. I was just wondering how this can be done in PHP? if possible, if not what it would be in javascript?

I have searched the web but all the ones readily available are where you specificy a date and it counts down to that date. What I need is something which will simply count down from "27 minutes and 43 seconds" (in that format) all the way down to 0 from whenever they land on the page, anyone got any snippets available?


The code below determines if c is a palindrome. I was just wondering how int(str(c)[::-1]) == c works, as I am new to Python and have not been able to find any information on this.  def is_pal(c):     return int(str(c)[::-1]) == c

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


On my website I have a form that is send to me by e-mail once filled out. The form mails with its own email address but has a Reply-to to the people who have filled out the form.  In Postfix I want to correct this to replace the From-address with the Reply-to address. I use this syntax in header_checks:  if !/^From:.*(form@domain1.com|form@domain2.com)/    /^Reply-To:(.*)/ REPLACE From:$1  endif   But it does not work. What do I do wrong?

I want to change the Message-ID header or better yet, discard it. I know everyone is going to ask "Why would you want to do that?" because I know it sounds weird to even write it.  Well I am developing a system that saves an incoming e-mail in EML format, changes it and sends it to the user, at some point the user can request to have the original EML sent to him/her. The issue is that when I re-send the EML it has the same Message-ID header which causes exchange servers to drop the re-send.  Of course I am hoping there is some option through postfix to do this, otherwise I will need to parse and change the EML but I rather not do that.  I tried to do this with "header_checks" and it works BUT I need to be able to do this conditionally, meaning only on a specific occasion, which I can identify by looking at the other headers, I want to remove the Message-ID.


I was writing my college essay, which is about how I discovered mathematics and how I developed it as a passion.  At one point I constructed the following sentence:     ...Math was my Narnia.   What I wanted to say is "Math was a beautiful subject, but I didn't discover that soon because it was hidden by some factors."(these some factors are discussed in the other parts of the essay).  I thought "Narnia" was a good word at first. But when I think more about it, I happened to not like it. Can anyone suggest a word that can meet this goal ?

I'm looking for a noun from English folklore.  It should describe a place where unusual, mysterious, possibly magical, occurrences happen.  The locals shun and avoid this place. Its influence might be beneficial sometimes, but it's unpredictable - only the desperate, mad, or naive would seek it.  I suppose archaisms and obscure words should be fine.  I need it for a translation of a fantasy game.  The Polish noun I'm looking to translate is "uroczysko" - in case some of the answerers know Polish.  The sites in question aren't one-of-a-kind so unique names starting with capital letters, like Shangri-La or Xanadu, won't do.


A spider in one edge of a cube (length of all side = $l$) wants to get to an insect on the other edge of the cube. obviously the spider cannot fly and must walk on the sides of the cube to get to the insects. Find the shortest path possible. (See the image below)    I know the differential approach to solve this question (optimization problem) and the path is drawn on the above picture. But I want a geometric proof without using derivative. Just using geometric theorems (like pythagoras) and using simple algebra.

I am stuck with the following problem that says:      Let $A,B$ be the ends of the longest diagonal of the unit cube . The length of    the shortest path from $A$ to $B$ along the surface is :     $\sqrt{3}\,\,$  2.$\,\,1+\sqrt{2}\,\,$  3.$\,\,\sqrt{5}\,\,$ 4.$\,\,3$    My Try:   So, the length of the longest diagonal $AB=\sqrt{3}$. If I reach from $A$ to $B$ along the surface line $AC+CD+BD$, then it gives $3$ units. But the answer is given to be option 3.   Can someone explain? Thanks in advance for your time.


I had Java 11, then decided to change to Java 8. I uninstalled 11 and installed 8. Then have added these lines into ~/.bashrc:  export JAVA_HOME="/usr/lib/jvm/java-1.8.0-openjdk-amd64"     export PATH=$PATH:$JAVA_HOME/bin   Executed source ~/.bashrc. javac -version gives 8, but java -version still shows 11. I tried to use sudo update-alternatives --config javac and set it to 8, but still...

Is there a way to quickly switch over all the Java related alternatives using update-alternatives?  For instance, if want to switch Java over to 7, I run sudo update-alternatives --config java and select the Java 7 OpenJdk. But if I run update-alternatives --get-selections | grep java I get the following,  appletviewer                   auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/appletviewer extcheck                       auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/extcheck idlj                           auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/idlj itweb-settings                 auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/itweb-settings jar                            auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jar jarsigner                      auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jarsigner java                           manual   /usr/lib/jvm/java-7-openjdk-amd64/jre/bin/java javac                          auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/javac javadoc                        auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/javadoc javah                          auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/javah javap                          auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/javap javaws                         auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/javaws jconsole                       auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jconsole jdb                            auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jdb jexec                          auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/lib/jexec jhat                           auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jhat jinfo                          auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jinfo jmap                           auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jmap jps                            auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jps jrunscript                     auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jrunscript jsadebugd                      auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jsadebugd jstack                         auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jstack jstat                          auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jstat jstatd                         auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/jstatd keytool                        auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/keytool native2ascii                   auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/native2ascii orbd                           auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/orbd pack200                        auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/pack200 policytool                     auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/policytool rmic                           auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/rmic rmid                           auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/rmid rmiregistry                    auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/rmiregistry schemagen                      auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/schemagen serialver                      auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/serialver servertool                     auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/servertool tnameserv                      auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/tnameserv unpack200                      auto     /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/unpack200 wsgen                          auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/wsgen wsimport                       auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/wsimport xjc                            auto     /usr/lib/jvm/java-6-openjdk-amd64/bin/xjc   As you can see, my Java alternative was switched over to 7, but every other alternative based on OpenJDK 6 was not switched over. Sure I could switch each one manually or write a script to do so, but I assume there is a better way to accomplish this.


I've got a study with 55 patients having undergone surgery. 80% were happy with the surgery while 20% weren't.  I'm looking at predictors that may be able to predict surgery satisfaction.  The problem is the N is low so I'm not sure if I can run a multiple regression model. I thought perhaps changing the study to an association study using ttest and chi2 and just reporting that? Maybe regularization models?  How would you approach such a study statistically?

I've got a study which is kinda messed up by the design...Turns out I ended up with about 50 patients of which 80% have the outcome and 20% don't (binary outcome).  I've been turning in my bed for the last month trying to figure out what to do with this. The only real answer is "don't" but I have to deliver something in the next days as it's part of a master's thesis.  I have about 10 predictors of interest for the outcome (various variable types) and the research question is whether any of these predictors can predict the outcome. Some already have an established correlation in the literature while some are original hypothesis. Several are significant with a univariate logistic regression, but it doesn't look good in any other way than the actual p-value.  Now obviously I'm not going to be able to answer this research question sufficiently but if you were in my shoes, what sort of statistical analysis would you perform to relay to your supervisors?  EDIT: Link to my (anonymized) data (CSV):


I'm a beginner with C# so maybe I don't really understand why I have this error.  System.InvalidOperationException: Cross-thread operation not valid: Control 'lstb_files_r' accessed from a thread other than the thread it was created on.  This is what I'm doing:  I drop X csv. I read the first one (lstb_files_r.SelectedIndex = i;) after finishing I would like to read the 2nd (i++). But I have this error...  Can someone explain to me how can I solve that please ?

I have a scenario. (Windows Forms, C#, .NET)   There is a main form which hosts some user control. The user control does some heavy data operation, such that if I directly call the UserControl_Load method the UI become nonresponsive for the duration for load method execution. To overcome this I load data on different thread (trying to change existing code as little as I can)   I used a background worker thread which will be loading the data and when done will notify the application that it has done its work.   Now came a real problem. All the UI (main form and its child usercontrols) was created on the primary main thread. In the LOAD method of the usercontrol I'm fetching data based on the values of some control (like textbox) on userControl.    The pseudocode would look like this:  CODE 1  UserContrl1_LoadDataMethod() {     if (textbox1.text == "MyName") // This gives exception     {         //Load data corresponding to "MyName".         //Populate a globale variable List<string> which will be binded to grid at some later stage.     } }   The Exception it gave was     Cross-thread operation not valid: Control accessed from a thread other than the thread it was created on.   To know more about this I did some googling and a suggestion came up like using the following code  CODE 2  UserContrl1_LoadDataMethod() {     if (InvokeRequired) // Line #1     {         this.Invoke(new MethodInvoker(UserContrl1_LoadDataMethod));         return;     }      if (textbox1.text == "MyName") // Now it wont give an exception     {     //Load data correspondin to "MyName"         //Populate a globale variable List<string> which will be binded to grid at some later stage     } }   BUT BUT BUT... it seems I'm back to square one. The Application again  become nonresponsive. It seems to be due to the execution of line #1 if condition. The loading task is again done by the parent thread and not the third that I spawned.  I don't know whether I perceived this right or wrong. I'm new to threading.  How do I resolve this and also what is the effect of execution of Line#1 if block?  The situation is this: I want to load data into a global variable based on the value of a control. I don't want to change the value of a control from the child thread. I'm not going to do it ever from a child thread.   So only accessing the value so that the corresponding data can be fetched from the database.


I am reading about difference between BeanFactory and ApplicationContext, but everywhere it is only mentioned that:   former doesn't support internationalization while later supports and another is ability to publish event to beans that are registered as listener   I couldn't find explanation using code example, could someone please through light on this using a code example.    UPDATE: Please note that I know that it is better to use "ApplicationContext" but I want this for my learning purpose.

I'm pretty new to the Spring Framework, I've been playing around with it and putting a few samples apps together for the purposes of evaluating Spring MVC for use in an upcoming company project. So far I really like what I see in Spring MVC, seems very easy to use and encourages you to write classes that are very unit test-friendly.  Just as an exercise, I'm writing a main method for one of my sample/test projects. One thing I'm unclear about is the exact differences between BeanFactory and ApplicationContext - which is appropriate to use in which conditions?  I understand that ApplicationContext extends BeanFactory, but if I'm just writing a simple main method, do I need the extra functionality that ApplicationContext provides? And just exactly what kind of extra functionality does ApplicationContext provide?  In addition to answering "which should I use in a main() method", are there any standards or guidelines as far as which implementation I should use in such a scenario? Should my main() method be written to depend on the bean/application configuration to be in XML format - is that a safe assumption, or am I locking the user into something specific?  And does this answer change in a web environment - if any of my classes needed to be aware of Spring, are they more likely to need ApplicationContext?  Thanks for any help. I know a lot of these questions are probably answered in the reference manual, but I'm having a hard time finding a clear breakdown of these two interfaces and the pros/cons of each without reading thru the manual with a fine-tooth comb.


I'd like to know if there's a way to put the menu bar in the bottom, instead of it being in the top.

I am coming from Windows 8 and want to test new Ubuntu 12.xx.  How can i change the position of the panel from top to bottom?


I don't think it's ever not happened.  I'll start an application that depends on the drive being mapped, and it will fail. I'll open windows explorer and see the drive there with the typical red X. It then is clever enough to load the free space on the share - but it still won't actually work until I go into the share in explorer. Then it is mapped correctly.  Is there a way I can either automate that process every startup, or even better, actually have my drives map properly?

This is related to this issue:   I'm needing to run a program (InstallShield) as an elevated user, but this program also needs to access files located on a network share. Due to max path length (and legibility) issues, I really want to access these files using a mapped drive (rather than the much longer UNC path). However, due to the issue referenced above, the drive I mapped (via Windows Explorer) is not recognized.  Unfortunately, the recommended EnableLinkedConnections registry hack doesn't appear to work at all for me. Instead, I can get things to (temporarily) work by mapping the drive via an elevated command prompt using the following command: net use Z: \\machine\path /persistent:yes  The problem is this mapped drive does not actually persist (despite the /persistent:yes parameter) after reboot. Granted I can just quickly remap it via a script I manually run, but I imagine there must be a better way.  I don't know how to automatically run login scripts as the elevated user, otherwise I would try that. I'm also wondering why the net use command isn't persisting as expected.  Since it may be relevant, this is a Windows 8.1 virtual machine. Also, the network share I'm trying to persistently map and access is provided by VMware Workstation (via its optional Shared Folders feature).  I'm wondering if this is maybe a timing issue? (see )    Update  I managed to find a workaround, although I still don't have an answer for why the mapping doesn't persist in the first place.  Anyway, I set up a simple scheduled task in Windows to run a batch file on login. This batch file maps the network share to the desired drive letter (via the same net use command). I also ensured the Run with highest privileges task setting was checked. Voila! Elevated processes can now see and access my mapped drive, even after rebooting.


This is Problem 3.1.5 in Cohn's Measure Theory, 2nd edition.  Let $\mu$ be a measure on $(X, \mathcal A)$, and let $f, f_1,f_2, \ldots$ and $g,g_1,g_2,\ldots$ be real-valued $\mathcal A$-measureable functions on $X$. (a) Show that if $\mu$ is finite, if $f_n \to f$ in measure, and $g_n \to g$ in measure, then $f_n g_n \to fg$ in measure.  With some effort, I was able to work out a direct proof, similar to the one outlined in . After re-reading the section, I came up with an alternative argument similar to the one used by Cohn to prove another theorem. It results in a much quicker proof, and almost seems like a magic trick. I want to make sure that my argument is correct. I use the following results, proved by Cohn in this section, for real-valued measurable functions:  Proposition 3.1.3: If $f_n \to f$ in measure, then there is a subsequence such that $f_{n_k} \to f$ almost everywhere. Proposition 3.1.2: If $\mu$ is finite and $f_n \to f$ almost everywhere, then $f_n \to f$ in measure.  Here is my proof: Let $\{n_k\}$ be any subsequence of $\mathbb N$. Then $f_{n_k} \to f$ and $g_{n_k} \to g$ in measure, so by Proposition 3.1.3 there is a subsequence $\{n_{k_j}\}\subset \{n_k\}$ such that $f_{n_{k_j}} \to f$ and $g_{n_{k_j}} \to g$ almost everywhere. (To see this, take a subsequence of $\{n_k\}$ that works for $f$. Then that subsequence has a subsequence which works for both $f$ and $g$.) Therefore $f_{n_{k_j}} g_{n_{k_j}} \to fg$ almost everywhere. As $\mu$ is finite, Proposition 3.1.2 implies that $f_{n_{k_j}} g_{n_{k_j}} \to fg$ in measure. Now here is the magic part: Suppose that $f_n g_n$ does not converge to $fg$ in measure. Then there is some $\epsilon > 0$ such that $\mu\{|f_n g_n - fg| > \epsilon\}$ does not converge to zero. Thus there is some $\delta > 0$ such that $\mu\{|f_n g_n - fg| > \epsilon\} > \delta$ for infinitely many $n$. In other words, there is a subsequence $\{n_k\} \subset \mathbb N$ such that $\mu\{|f_{n_k} g_{n_k} - fg| > \epsilon\} > \delta$ for all $n_k$. Clearly this subsequence cannot have any further subsequence $\{n_{k_j}\}$ for which $f_{n_{k_j}} g_{n_{k_j}} \to fg$ in measure, but this contradicts what we showed above. Consequently, $f_n g_n$ must converge to $fg$ in measure.  Is this argument legitimate? It almost seems too easy.

I'm trying to prove the following statements in Folland's book.  Let $(X,\mathcal{M},\mu)$ be a measure space. If $f_n\to f$ in measure and $g_n\to g$ in measure, then $f_n+g_n\to f+g$ in measure and $f_ng_n\to fg$ in measure (in this last case, assume $\mu(X)<\infty$).  The first one is already done, but the second one is giving me trouble.   My attempt: We can take subsequences $f_{n_k}$ and $g_{n_k}$ such that $f_{n_k}\to f$ a.e. and $g_{n_k}\to g$ a.e. In this case, we know that $f_{n_k}g_{n_k}\to fg$ a.e. Note that $\mu(X)<\infty$, so we can use Egoroff's theorem to conclude that $f_{n_k}g_{n_k}\to fg$ almost uniformly. Finally, almost uniform convergence implies convergence in measure, therefore $f_{n_k}g_{n_k}\to fg$ in measure.   The problem is that I just have convergence in measure for some subsequence of $f_ng_n$ and I need convergence in measure for the whole sequence. Also I don't know if using Egoroff's theorem is unnecessary, if this is the case, I would appreciate to see some more elementary prove.  Detail: We say that $f_n\to f$ almost uniformly if for every $\varepsilon > 0$ there is some $E\subset X$ measurable, such that $\mu(E) <\varepsilon$ and $f_n\to f$ uniformly on $E^c$.  Thank you!


I've built a house in a mushroom biome that I want my Dryad to move into from a different house, so that I can buy mushroom grass seeds. The banner appears in the mushroom biome house, but she won't go there.   How can I get her to move in?

I read on the wiki that people will move in under the following conditions:   You do something to please them An empty house is available with a light source, table, and chair (also with walls).   I have a house which is about 7x8, then a roof space above that; about half the area. I could put furniture up there too, but will anyone move in?


Let $R$ be a commutative ring with unity and $M$ be a free $R$-module. Let $S$ be a finite basis of $M$. If $T\subset M$ has cardinality greater than $S$, I am wondering whether $T$ is linear dependent over $R$.   I know that this is true when $R$ is field. But I am not sure if $R$ is not field.  If it is not true when $R$ is not field, could you suggest me an example such that $T$ is linear independent over $R$?

I'm trying to prove that if $A\neq 0$ is a commutative ring and there is an injective $A$-module homomorphism $A^m\hookrightarrow A^n$ then $m\leq n$ must necessarily hold.    This is exercise 2.11 from Atiyah and MacDonald's Introduction to Commutative Algebra, but unfortunately all the solutions available online are either very sparse with regard to this question or seem to use (to my surprise) a generalized version of Cramer's rule. Is there perhaps some other "cleaner" approach to solving this problem?


I use plainnat to cite online material as follows:  @misc{Group2009,   author = {Miniwatts Marketing},   title = {{Internet World Stats}},   howpublished = "\url{http://www.internetworldstats.com/stats.htm}",     year = {2013},     note = "[Online; accessed 19-July-2013]"  }   but it gives a lot of space between the words, as can be seen in the following screenshot:  !  How do I fix this?

I am trying to include long URLs in a bibliography, but those often overflow into the margin of the document.  I have seen a number of questions about breaking URLs in bibliography, but after trying every solution, I have not found anything that completely solves my problem. There are apparently a number of ways to allow LaTeX to break line at different places in URLs. But in my case, even though LaTeX breaks line at some places, I still get overflow for some URLs.  Here is the code I am using:  \usepackage[hyphens]{url} \usepackage{hyperref} \hypersetup{breaklinks=true}  \urlstyle{same} \usepackage{cite}   and with these bibliography entries:  @misc(webrtc,     organization={W3C WebRTC Working Group},     title={WebRTC 1.0: Real-time Communication Between Browsers},     howpublished={\url{http://www.w3.org/TR/2012/WD-webrtc-20120821/}} )  @misc(android_javascriptinterface,     organization={Android Open Source project},     title={Android WebView addJavascriptInterface reference},     howpublished={\url{http://developer.android.com/reference/android/webkit/WebView.html#addJavascriptInterface(java.lang.Object, java.lang.String)}} )   I'm getting this, for example:     The entry about Android overflows in the border: my column should end where you can read "browsers." on the first line or "http:" on the third line.  Edit: when trying to create a minimal example for my problem, I noticed that this only occurs when using the IEICE template file. You can find it here: , but if you do not want to have to extract the archive and locate the correct file, I have put it there also:   Here is my minimal example:  .tex file:  \documentclass[paper]{ieice}  \usepackage[hyphens]{url} \usepackage[hidelinks]{hyperref} \hypersetup{breaklinks=true} \urlstyle{same} \usepackage{cite}  \title{Test document} \begin{document}  this\cite{upnp_spec} is a test\cite{android_javascriptinterface}  \bibliographystyle{plain} \bibliography{refs_min}  \end{document}   and refs_min.bib file:  @misc(android_javascriptinterface,     organization={Android Open Source project},     title={Android WebView addJavascriptInterface reference},     howpublished={\url{http://developer.android.com/reference/android/webkit/WebView.html#addJavascriptInterface(java.lang.Object, java.lang.String)}} )  @misc(upnp_spec,     organization = {UPnP Forum},     title = {UPnP Device Architecture 1.1},     howpublished = {\url{http://upnp.org/specs/arch/UPnP-arch-DeviceArchitecture-v1.1.pdf}} )   Is there any way I can fix this ?


In the scene where Cooper is sending a signal back to his daughter back on Earth, him and the robot are inside the event horizon for a few hours. However after they exit the black hole, it appears that they haven't been subject to time dilation and Cooper is still the same age as Brand.  Why wasn't Cooper affected by spending so much time inside the black hole?

As we all know, going near a black hole (Gargantua in this case) slows down time, according to the theory of relativity.  So when Cooper comes out of the black hole, after spending a fair bit of time there, shouldn't he be much older than Brand who hasn't gone inside Gargantua?


Is there a way to grab a list of attributes that exist on instances of a class?  class new_class():     def __init__(self, number):         self.multi = int(number) * 2         self.str = str(number)  a = new_class(2) print(', '.join(a.SOMETHING))   The desired result is that "multi, str" will be output.  I want this to see the current attributes from various parts of a script.

So what I'm looking for here is something like PHP's  function.  This is so I can debug my scripts by seeing what's the state of the object in question.


I've been trying to figure out a surjective map from [0,1] to R but been unable to find one. I know that any such map cannot be continuous.

I'm looking for a bijection from the closed interval [0,1] to the real line. I have already thought of $\tan(x-\frac{\pi}{2})$ and $-\cot\pi x$, but these functions aren't defined on 0 and 1.   Does anyone know how to find such a function and/or if it even exists?   Thanks in advance!


Are The two concepts really two sides of the same coin ? The latter is often referred to simply as a regression, but surely this is just an unfortunate coincidence?   The former is about predicting values of a dependent variable from a weighted combination of values of independent variables , whereas the second is Simply the observation that, with time, the average of all so far observed values of a random variable will tend to approach its true mean.

Consider the  function     $$ r(x) = \mathbb{E}(Y \mid X = x) $$   This has been called the regression function in a textbook I'm using. I'm trying to figure out the relationship between this function and the classical linear regression model.  So, I know that it is a theorem* that we may write  $$ Y = r(X) + \epsilon $$  for some random variable $\epsilon$ s.t. $\mathbb{E}(\epsilon) = 0$.  Now suppose that we have     $$ Y = \beta_0 + \beta_1 X + \epsilon $$   This is the classical 1-dimensional regression function (assuming the $\beta_0$ and $\beta_1$ minimize the residual sum of squares).  Question: Is it then a mathematical theorem that if $Y$ is defined as above, that   $$ r(X) = \mathbb{E}(Y \mid X) = (\beta_0 + \beta_1 X)? $$  And is this why the function $\mathbb{E}(Y \mid X)$ is called the "regression function"?  EDIT: The theorem that I am making use of is as follows (from All of Statistics pg. 89):     Regression models are sometimes written as      $$ Y = r(X) + \epsilon $$      where $\mathbb{E}(\epsilon) = 0$. We can always rewrite a regression model this way. To see this, define $\epsilon = Y - r(X)$ and hence $Y = Y + r(X) - r(X) = r(X) + \epsilon$. Moreover, $\mathbb{E}(\epsilon) = \mathbb{E}\mathbb{E}(\epsilon \mid X) = \mathbb{E}(\mathbb{E}(Y - r(X)) \mid X) = \mathbb{E}(\mathbb{E} ( Y \mid X) - r(X)) = \mathbb{E}(r(X) - r(X)) = 0$.


Is a redirect from the non www version of the website to the www version still needed for seo reasons (duplicate content)? In the google search console i set the www version as my preferred version.

Do you know if I should use <link rel="canonical" tag, or 301 redirect from:  http://example.com to http://www.example.com  ...to avoid a duplicate content penalty in case other pages link to the domain without the www subdomain? Or is Google smart enough now to identify which is the canonical one?


What did I do wrong in the proof by mathematical induction of $f_{2n+1}=f^2_{n+1}+f^2_n$?

I am trying to solve the following exercise:     Let $f_1=1$, $f_2=1$, $f_{n+1}=f_n+f_{n-1}$, where $n\in\mathbb{N}$. Show that $f_{2n+1}=f_{n+1}^2+f_n^2$.   I have not had much progress, but this is what I have managed to observe:  $$\sum_{k=1}^nf_{2k}=f_{2n+1}-1.$$  However, this is not of much help when trying to show the above.  Also, $f_{n+1}^2=(f_n+f_{n-1})^2=f_n^2+2f_{n+1}+f_{n-1}^2$, and $f_n^2=(f_{n-1}+f_{n-2})^2=f_{n-1}^2+2f_n+f_{n-2}^2$. But when I add these, I do not get anything that resembles the LHS above.  Do you guys have any ideas?


The question is, "We might expect method3 to run faster than method2, why is that?" but I have no idea. It seems like both methods do the same amount of operations. Could someone please enlighten me?      ArrayList<Person> method2(Person x, ArrayList<Person> people){     ArrayList<Person> friends = new ArrayList<Person>();     for (Person y : people) if (x.knows(y)) friends.add(y);     return friends;   }   ArrayList<Person> method3(Person x, ArrayList<Person> people){       ArrayList<Person> friends = new ArrayList<Person>();       for (int=0; i<people.size(); i++){          Person y = people.get(i);         if (x.knows(y)) friends.add(y);     }     return friends; }

What, if any, is the performance difference between the following two loops?  for (Object o: objectArrayList) {     o.DoSomething(); }   and   for (int i=0; i<objectArrayList.size(); i++) {     objectArrayList.get(i).DoSomething(); }


I am the main author and have three co-authors on a paper that I have been working on for quite some time now. Two of them have given me constructive suggestions and do think that the paper is a publishable material.   However, the other one, who also happens to be my supervisor, has been nothing but pessimistic and rather critical in a negative way. Moreover, his suggestions are totally irrelevant to the paper. I am beginning to think that he is trying to deliberately block my paper. Believe me when I say that I am trying to give him the benefit of the doubt; I am trying as much as possible to fulfill his irrelevant and unreasonable demands.  On top of that, my contract with the university is about to end soon. I have found another position in the same field. If this paper was even submitted, which it should have been months ago, it would strengthen my CV a lot.   Can I put it on arXiv without informing my supervisor? If not, what is the best way to deal with the situation?

I joined a research group of a faculty member in 201x, and worked with her for three years. During that time, I collaborated with a large hospital to perform research in the domain of medical informatics. I spoke about my research at two conferences; one was a talk, and the other was a poster presentation. My advisor asked me to write up the research in a paper around the second year, which I did. Around the third year, I decided to switch research groups, because of the relationship between me and my advisor going sour, and not having funding from her (I used to work part-time to fund my PhD research).  Once this happened, she withdrew her support from me publishing my paper and ordered that I give up my work to a fellow grad student. I told her, that my manuscript is in its Nth revision, and that I would like to take it to completion as first author. She was dismissive and didn’t offer any comments on my work. I told her, that, should I pass on my work, I would like to discuss authorship issues in advance, which she wasn’t ready to discuss. She ganged up my new advisor against me, and together they forced me to give up my code, results, paper drafts. I had to then leave the university without a degree.  Fast forward couple of years, I receive an email from a student in her lab (the student whom I had to hand over my work to), saying that they are publishing a paper, and have decided I am the fourth author. I read the paper and found out that it uses my experimental setup and design, data collection, and one of the ideas I had presented (the idea wasn’t the main crux of my paper, but I believe it was novel).  I want to   Publish my original draft in ArXiv/BioArXiv, as first author. Request my advisor to cite my work in their publication.    Given how she behaved with me, I know that despite what I am asking for sounds fair, she is likely to object.  I am asking the community: Can I go ahead and ArXiv it without her permission? I could add her as an author, but not take her permission. Also, if you have any other ideas on how to deal with this situation please let me know.  (For the record, this was at a top-10 school in the US in an engineering department).


How could we make the same division rules for other number systems, like in our decimal system: a number is divisible with 2 if it's last digit is 0,2,4,6,8, by 3 if the sum of digits is divisible with 3, and so on.  Can we do the same rules for g-based number systems too, where g is not 10, and greater than 1?

I still remember the feeling, when I learned that a number is divisible by $3$, if the digit sum is divisible by $3$. The general way to get these rules for the regular decimal system is asked/answered here: . Now I wonder, what divisibility rules an alien with $12$ (or $42$) fingers would come up with?  So let $n=\sum_k c_k b^k$ be the representation with base $b$. Looking at some examples shows indicate that $n$ is divisible by $b-1$, if $\sum_k c_k$ is. This seems to be a poor man's extension to the decimal divisibility by $9$ rule.  The answer to the above mentioned question, says that "One needn't memorize motley exotic divisibility tests. ". Motley exotic divisibility tests are very welcome here!


Is there a syntax highlighting for Java stack traces. Any tips about people editing posts looking at that?

I noticed that sometimes my code gets highlighted in different colors when rendered.   What is syntax highlighting? How does it work? Why isn't my code being highlighted correctly? How do I report a bug or request a new language? How do I use syntax highlighting? What languages are currently available on Stack Exchange?


I would like to extract these phone number patterns using regex:  xxx.xxx.xxx, xxx-xxx-xxx, (xxx)xxx-xxxx, or (xxx) xxx-xxxx  I've done this:  preg_match_all('/\b[0-9]{3}\s*-\s*[0-9]{3}\s*-\s*[0-9]{4}\b/',$output,$matches);   But it only matches xxx-xxx-xxx your help would be appreciated. thanks!

I'm trying to put together a comprehensive regex to validate phone numbers. Ideally it would handle international formats, but it must handle US formats, including the following:   1-234-567-8901 1-234-567-8901 x1234 1-234-567-8901 ext1234 1 (234) 567-8901 1.234.567.8901 1/234/567/8901 12345678901   I'll answer with my current attempt, but I'm hoping somebody has something better and/or more elegant.


I am having Null Pointer Exception in Play Console and unable to find the issue in my code.  I have tried every possible way to find that exception. I have also tried it on several devices but all in vain.  This is my onPostCreate Code:   @Override protected void onPostCreate(@Nullable Bundle savedInstanceState) {     super.onPostCreate(savedInstanceState);      pageRange= (EditText)findViewById(R.id.pageRange);     pageRange.addTextChangedListener(new TextWatcher() {         @Override         public void beforeTextChanged(CharSequence charSequence, int i, int i1, int i2) {         }          @Override         public void onTextChanged(CharSequence charSequence, int i, int i1, int i2) {             String text = pageRange.getText().toString();             for (int x = 0; x < selected.size(); x++)                 selected.set(x, false);             textChanged(text);         }          @Override         public void afterTextChanged(Editable editable) {             String text = pageRange.getText().toString();             for (int x = 0; x < selected.size(); x++)                 selected.set(x, false);             textChanged(text);         }     });     img_recycler = (RecyclerView) findViewById(R.id.recycler);     recyclerAdapter = new RecyclerAdapter();     img_recycler.setLayoutManager(new GridLayoutManager(this,3));     img_recycler.setAdapter(recyclerAdapter);     Thread t = new Thread(){         public void run()         {             getImages();         }     };     t.start();     // fileName=getFileName(SplitFiles.path);     // fileName = SplitFiles.filePath.lastIndexOf("/");     String path=SplitFiles.filePath;     fileName=path.substring(path.lastIndexOf("/")+1);     AdView mAdView = findViewById(R.id.adView);     AdRequest adRequest = new AdRequest.Builder().addTestDevice("41B2730621B6EDDB8BF5E8148E0CC1CE").build();     mAdView.loadAd(adRequest); }   This is the log details in Google Play Console..  java.lang.RuntimeException:  at android.app.ActivityThread.performLaunchActivity  (ActivityThread.java:2974) at android.app.ActivityThread.handleLaunchActivity  (ActivityThread.java:3059) at android.app.ActivityThread.-wrap11 (Unknown Source) at android.app.ActivityThread$H.handleMessage (ActivityThread.java:1724) at android.os.Handler.dispatchMessage (Handler.java:106) at android.os.Looper.loop (Looper.java:164) at android.app.ActivityThread.main (ActivityThread.java:7000) at java.lang.reflect.Method.invoke (Native Method) at com.android.internal.os.RuntimeInit$MethodAndArgsCaller.run  (RuntimeInit.java:441) at com.android.internal.os.ZygoteInit.main (ZygoteInit.java:1408) Caused by: java.lang.NullPointerException:  at com.skytek.pdf.creator.SplitFiles2.onPostCreate (SplitFiles2.java:121) at android.app.Instrumentation.callActivityOnPostCreate  (Instrumentation.java:1292) at android.app.ActivityThread.performLaunchActivity  (ActivityThread.java:2956)

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 know this question might be duplicate. I am not able to getting the usage of have had from another answers which is exist in Stackexchange. So I asked this question again.  I have examples.   Ann had a red bike for two years.   Sue has had a red bike for two years.   I had a wonderful bicycle.   I've had many wonderful bicycles.   In his lifetime, Uncle Alex had several red bicycles.   In his lifetime, Grandpa has had several red bicycles.   Explain the difference between 1 and 2, 3 and 4, 5 and 6. It would be better if you will take time to explain my examples.

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


I want to know what the -fix--missing argument does in the command below For example: man apt-get update -fix--missing  Now if i type the command as it is above, it will be the same thing as typing man apt-get. Then i have to type /-fix--missing while I'm in the man page and hit enter to jump to -fix--missing Is there any faster way where i can just type one command and directly from the terminal and jump to the -fix--missing section of the man page? or is this not possible.

If I want to know the meaning of wget -b, I see the manual by man wget, then search the -b option.     -b    --background        Go to background immediately after startup.  If no output file is specified via the -o, output is redirected to wget-log.   I want to get the result by a command like man wget -b. (Of course this doesn't work.)  Is there a similar way to make it possible?


I have Mint Linux installed on my Computer at home, on my Laptop and on a bootable USB3 stick. I would like these three systems to be completely identical when I get home. For example:  I work on my Desktop at home. Before I leave to work I start some kind of script/application which pushes all changes to the USB stick and Laptop. When I get home from work (used the laptop all day) I would like to start the script/application but this time it pushes all changes from the Laptop to the Desktop and USB stick. And of course if I used the USB stick at a friends place for example I would like to sync everything from it to the two computers.  I actually I don't need a sync, I need more of a push because I won't be working on more than one of these simultaneously.  Is this possible?

At home I've got a pc tower running arch linux. Recently I also acquired laptop for on the road, but I'd like to be working on the pc tower when I'm at home.  Now I'm pretty sensitive as to how my machine is configured (that's why I need the laptop, I hate the windows 7 stations at my university). I was wondering if there is a way to synchronize these two machines? I would like these to be "exact" clones of each other, so I could seemlesly switch from one to the other (after the sync of course).  I was thinking about using rsync but I don't know if that's the best option. If so, what should I be careful of? Are there any good tutorials out there?  Also, if possible, I would also like the use the home pc as a website server, so there are some sections of the machine that need not be synced (namely the website's directories).  Just to be clear: both computers will be running Arch Linux.


i have changed new release with old release in order to update also unchecked ppa. please help me out.im getting a getting a error message: W: Failed to fetch   Unable to connect to in.old-releases.ubuntu.com:http:  and so on......

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


The expression $a^3+11a-6$ is always divisible by 6. I came across it while programming and ran it in a function in a calculator. Upon trying to solve it by myself, I found $a^3+11a-6$ is always even, as when $a^3$ is odd so is $11a$ and when $a^3$ is even so is $11a$, and odd+odd=even and even+even=even. Now, I tried to find if the number is divisible by $3$, but I couldn't. Can anyone help me out? Why should this expression always be divisible by $6$, we know it is but why? And is there a way to find if an expression is divisible by a certain number. Thanks for any help.

As part of a larger proof, I need to show why $a^3-a$ is always divisible by $6$. I'm having trouble getting started.


How show all the formulas with displaystyle,avoinding typing repeteadly \displaystyle?    \documentclass[10pt,a4paper]{article}   \begin{document} Without any \emph{displaystyle} $   \frac{5+\frac{2}{5+\frac{2}{5}}}{5-\frac{2}{5-\frac{2}{5}}} $  With any \emph{displaystyle} $   \frac{5+\displaystyle{\frac{2}{5+\frac{2}{5}}}}{\displaystyle{5-\frac{2}{5-\frac{2}{5}}}} $  With more \emph{displaystyle} $\displaystyle{   \frac{5+\displaystyle{\frac{2}{5+\frac{2}{5}}}}{\displaystyle{5-\frac{2}{5-\frac{2}{5}}}} }$  \textbf{How to use displaystyle in all the expresion withou typing displaystyle repeteadly in all the fractions/sqrt?}  \end{document}

I am curious to know if there is a display style package, or something that would produce the same effect. You see, I get tired of constantly having to type \displaystyle, and making sure that it is in every place that it should be.   Is there some package that will "automatically" display style all of math symbols?


I have latest Ubuntu as of 5/6/2020. I have created bootable copy on usb stick to first try on Hewlett-Packard PACKARD desk computer.  Runs well!  Computer has qty 2 hard drives internal. Primary drive has Windows 7. I want to install UBUBTU on 2nd hard drive (500gb). I have 6gb ram and 6 processors, 64 bit .  How do I select 2nd drive?  altonddavisjr@yahoo.com is direct email.  When I selected to “”INSTALL””, the screens never gave me option to select correct hard drive.

I'd like to see the full How-To on how to use manual partitioning during Ubuntu installation. The existing guides (at least those I found here) cover only automatic part and leave untouched the manual part (or extremely short and contain no pictures).  I'd like to cover such situations:     If your disk contains other systems:


I tried lshw -C network and my wireless interface says DISABLED.  How do I re-enable it and connect it to the available wireless network?  It's an Intel 3945ABG and it worked fine in the installer to download the updates etc.

With reference to this question (), is there a canon way of configuring a wireless connection using systemd, because there doesn't seem to be any up-to-date documentation on the Ubuntu wiki or elsewhere.  I have an Intel wireless 3945ABG and I'm trying to configure it but there is no clear advice on the correct way to do this with systemd. So should I use systemd or the 'old way'?


I want to have some nice linear algebra in my code with the help of operator overloading. E.g. a product with a vector and a scalar looks like vec * scalar and returns a vector. The problem is, i have 2D and 3D vectors and at compile time is is not know which one it will be.   My attempt was a empty base class and a derived class for 2D and 3D. However it seems like this is not working as expected because it is not calling the correct methods.  #include <cstdlib> #include <iostream>  class baseVector { public:     baseVector() {}     ~baseVector() {}     virtual void print() {         std::cout << "This is not the vector you are looking for" << std::endl;     }     virtual baseVector operator*(const double r) const {} };  class Vector2 : public baseVector { public:     Vector2() {}     Vector2(double x, double y) {         data_[0] = x;         data_[1] = y;     }      ~Vector2() {}      void print() {         std::cout << data_[0] << ", " << data_[1] << std::endl;     }      /** Product: Vector * Scalar */     baseVector operator*(const double r) const {         Vector2 result(data_[0]*r,                        data_[1]*r);         return result;     }  private:     double data_[2]; };   int main(int argc, char** argv) {     // Construct vector of derived type which is not known at compile time     baseVector * myVec = new Vector2(1, 2);     const double val = 5;      baseVector & tempVec = *myVec;     tempVec.print();      // Some nice linear algebra here, can't use datatype Vector 2 because it is know known at compile time     baseVector resVec = tempVec * val;      // This should print 5, 10     resVec.print();     return 0; }   I expect resVec to be a vector of type Vector2 with the values 5, 10. Instead it calls the print function of the base class. I understand somehow why this is happening but how do I achiev what I want?  Anyway, is this even the right way to go? Thanks in advance for every hint.  Edit: Slicing is not the answer but explains why it doesn't work. I've found a possible solution with the auto keyword. Skip the inheritance and use auto in the main instead of a specific type. Thanks everyone to make me thinking.

Someone mentioned it in the IRC as the slicing problem.


I'm specifically asking about the Anniversary skins as I heard somewhere sometime ago that the skins released just now will not be locked after the event is over, like all the Uprising, NY, X-mas, Halloween and Olympics skins.  I've seen the Olympics question, and as explained just two lines ago I am aware that all the previous skins are limited time only. Due to the uniqueness of the Anniversary event and the rumor I heard I'm not sure about the last batch of skins.  Is it true or was it just a rumor ?

There's brand new skins in overwatch, and they are event themed.  Will they be just gone after the event (those who have it keep it, those who don't are screwed...)  It should be one of 3 scenarios   Skin can still be got in boxes Skin cannot be got in boxes but can be bought with gold Skin is unavailable to any who dont have it, like with the founders skins


Where can I find a list of all the packages that get installed by default with Ubuntu 14.04?

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


How can an array value or an object be copied to another variable without copying its reference in Javascript so that the copied value and variable can be manipulated independently, without causing any change to the original one?

I want to do something like:  MyObject myObj = GetMyObj(); // Create and fill a new object MyObject newObj = myObj.Clone();   And then make changes to the new object that are not reflected in the original object.  I don't often need this functionality, so when it's been necessary, I've resorted to creating a new object and then copying each property individually, but it always leaves me with the feeling that there is a better or more elegant way of handling the situation.  How can I clone or deep copy an object so that the cloned object can be modified without any changes being reflected in the original object?


Is there any way to calculate memory consumption in C. I have checked other answers on Stackoverflow but they were not satisfactory.  Something similar to the one we have in Java:  // Get the Java runtime Runtime runtime = Runtime.getRuntime(); // Run the garbage collector runtime.gc(); // Calculate the used memory long memory = runtime.totalMemory() - runtime.freeMemory(); System.out.println("Used memory is bytes: " + memory + "bytes"); System.out.println("Used memory is kilobytes: " + bytesTokilobytes(memory) +"kb");

I once had the task of determining the following performance parameters from inside a running application:   Total virtual memory available Virtual memory currently used Virtual memory currently used by my process Total RAM available RAM currently used RAM currently used by my process % CPU currently used % CPU currently used by my process   The code had to run on Windows and Linux. Even though this seems to be a standard task, finding the necessary information in the manuals (WIN32 API, GNU docs) as well as on the Internet took me several days, because there's so much incomplete/incorrect/outdated information on this topic to be found out there.  In order to save others from going through the same trouble, I thought it would be a good idea to collect all the scattered information plus what I found by trial and error here in one place.


For example:     Making new friends is important to your happiness.    and     To make new friends is important to your happiness.    I know the second sentence sounds odd, but I'm not sure if it's grammatically wrong or just not used as much.   Thanks a lot.

I am wondering whether there is any difference between a gerund acting as subject and an infinitive acting as a subject.


There have been    (not to pick on the Bridge, just that these are the ones I found) occurrences where users abuse chat flags to cause drama. Random stuff gets flagged, and users from other rooms are needlessly summoned into the room. The issue is, while mods can tell the room to stop flagging random things, there's no way to enforce this. Spam/offensive flags in chat are anonymous, and can be abused with impunity without the mods finding out. I don't think there's anything stopping a user from letting out an endless stream of flags, annoying everyone. Can mods have the ability to see who flagged a message in chat?

This has been , but never got a response. I'm bringing it up again (rather than simply reusing the last post which is effectively dead now) for a number of reasons, including that lack of response and the fact that there have been a few recent occasions where seeing this data would have made a significant difference in effective chat moderation.  Currently, there are two types of chat flag: offensive flags, and mod flags. On mod flags, moderators can see all the data about them: what message they were cast against, what the flag says, and who cast the flag. On offensive flags, we see only what 10k users see - which is only which message the flag was cast against.  It's a pretty well accepted fact that chat moderation is... not all it could be, shall we say. Well, this would make an improvement: there have been a number of cases that I've seen in my tenure of spam-spam-flagging (i.e. spamming spam/offensive flags). These events disrupt rooms by bringing in a Mjolnir of mods, and a plethora of 10k chat users from all over the network, all trying to get at the flags and (sometimes) have a dig at the room where they're cast.  Allowing mods to see who cast the flag would enable us to stop these cases in their tracks - we've got the tools to do it, but we don't know who to use them on.


I know that linux is mostly safe from viruses, however: if you do download a windows virus (i.e., through a drive-by download), will it just sit there on your computer, and take up space? Is it unable to infect files because of the different operating system? If you transfer files between computers (by using a usb flash drive or through online file sharing), is there any risk that the virus could be transferred to windows and activate?

I have a Windows XP Pro dual booting with Ubuntu Jaunty Jackelope on a single hard drive. On Windows XP I have a Eset NOD 32 while on Ubuntu I have no antivirus installed.  While working on the internet via Ubuntu, if a virus gets into my PC, it might probably not do much damage to Ubuntu as most  of these virus' are designed for windows however I'm still worried that they may continue to reside on my Ubuntu partition...   and since I am working in dual boot mode ( not sharing any partitions at the moment) will the virus affect the windows partition? Alternatively since I am using a thumb drive to transfer data between Ubuntu and Win XP the virus might propogate through the flash drive?   Can I stop the virus from entering the system via Ubuntu and how?


How can I update BASH? I noticed that there are version 4.2.45  env x='() { :;}; echo vulnerable' bash -c "echo this is a test" this is a test  cat /etc/redhat-release CentOS release 5.11 (Final)  rpm -q bash bash-3.2-33.el5_11.4  yum update bash Setting up Update Process No Packages marked for Update

We have several Amazon servers. It has bash version 4.1.2.  that all bash versions up to 4.3 are unsafe. When I do this test...  env x='() { :;}; echo vulnerable' bash -c 'echo hello'   ... it returns: hello, and even though  that I should get an error back: bash: warning: x: ignoring function definition attempt bash....., I guess the simple "hello" is good enough. Still I'm in doubt.   Can you explain what info I can trust?


I have two date ranges, (start1,end1):::>>date1  && (start2,end2):::>>date2  . I want to check if the two dates isOverLaped. My flow chart I assume "<>=" operators is valid for comparing.  boolean isOverLaped(Date start1,Date end1,Date start2,Date end2) {     if (start1>=end2 && end2>=start2 && start2>=end2) {         return false;     } else {         return true;     } }  Any Suggestion will be appreciated.

Given two date ranges, what is the simplest or most efficient way to determine whether the two date ranges overlap?  As an example, suppose we have ranges denoted by DateTime variables StartDate1 to EndDate1 and StartDate2 to EndDate2.


I know that this type of question was asked many time, but I didn't find answers related to my specific questions anywhere. At  it is explained about disputed flags of types NAA, VLQ, offensive and spam, by there is no mention about off-topic flags.  I found explanation that after triage review flags may get disputed, but it says that close votes are not affected.  So here is my questions:   In which cases exactly off-topic flag gets disputed? Also I have disputed flags in my profile near the questions that are actually [on hold], why my flag not appears helpful? Recently I marked  as off-topic, and now my flag is disputed. Is that mean that flag was inappropriate and question should remain in the developers SO? Does flag counts as helpful if it describes the reason to close not very accurate? For example if I marked question as off-topic, but it was put on hold as too broad

In my flagging summary under the statistics, there is 1 flag listed as "disputed".  This is the first time I've ever seen a disputed flag in my summary, so I'm just curious, what is a disputed flag? How would you even dispute a flag? Is this the same as voting a flag as invalid?


Find the number of positive integers less than $1000$ of the form   $$\frac{(x+y+z)^2}{xyz}$$  where $x,y,z$ are positive integers.    Usually I have lots of ideas on how to solve a problem, and I include them in the post to show that I have thought a bit about the problem and so that others can build off my ideas if possible. But on this problem I must admit I am stuck. I can think of two possible approaches: (1) treat this as a Diophantine equation to characterize all triples $(x,y,z)$ such that $xyz|(x+y+z)^2$, or (2) to play around with the problem, try to find a class of numbers that are representable. I have made only trivial observations: If $n$ is representable, then scaling $x,y,z$ gives that all factors of $n$ are also representable. Also, if a prime $p|x$ and $p|y$ then $p|z$, so we may assume that $x,y,z$ are pairwise relatively prime. I believe bounding the numerator or denominator may be the way to solve this.

How many integers less than $1000$ can be expressed in the form $$\frac{(x + y + z)^2}{xyz}$$ where $x, y, z$ are positive integers?


My  for the tag wiki of the  tag on  seems to have been approved solely by the :    What gives? I'm not sure if this is a bug or not, so I've tagged it as [support].  Further info Based on , taking any action (except Skip) on a suggested edit review will definitely log that action. For instance,  is a tag wiki suggested edit that the moderator  reviewed around the same time by clicking on "Improve Edit" — it shows "Edit" next to Tsundoku and "Approve" next to Community.    From the same link, there is one case in which the Community User appears as the sole reviewer, namely when there is a clash of editing between a user with privileges and one without privileges. But, in that case the Community User will reject the edit, not approve. Furthermore, I suggested my edit on the [login] tag's info at 2020-07-30 14:19:10Z and the edit on the wiki was approved by the Community User at 2020-07-30 14:42:59Z, which is late enough. I'm also pretty sure that no other edit was going on at that time. This also does not seem to be a case of the Community User taking credit for a deleted user's review, as mentioned in . This is because  made by Tsundoku on the [login] tag's wiki has the same timestamp as the approval by the Community User. Definitely no other user, deleted or otherwise, was involved in this process. Could someone explain how it happened that the Community User was the sole approver on my suggested edit on a tag wiki? I took Tsundoku's help in  to try and play with the various options that are visible on a tag's info page for approving a suggested edit; however, we couldn't come to any fruitful conclusion.

Why does the Community user sometimes approve or reject edits? How does a machine know if my edit is valid? What does it mean if my edit was rejected by Community?     See also:


Prove whether the following series converge or diverge.  $$\sum \limits_{n=1}^{\infty} \frac{(2n)!}{(4^n)(n!)^2(n^2)}$$  I think this series converge and I tried to justify using the ratio test but I got $\lim \limits_{n\to\infty} \frac{a_{n+1}}{a_n}=1$ which means the ratio test cannot be applied.  Please give me some ideas or hints on how to solve this question, thanks to anybody who helps.

I have $\displaystyle\sum_{n=1}^{\infty}{\frac{(2n)!}{(4^n)(n!)^2(n^2)}}$ and need to show whether it diverges or converges.   I attempted to use the ratio test, but derived that the limit of $\dfrac{a_{n+1}}{a_n}=1$ and hence the test is inconclusive.   So I now must attempt to use the comparison test, but I am struggling to find bounds to compare it to to show either divergence or convergence.


For the past year or so, I've been designing a top-down zombie shooter game. However, after playing a , it's given me inspiration to build a similar game. The graphics would be very similar, though there would be new things like building.  I'm trying to decide if this concept is different enough; there's another , though it has different graphics and some other key differences.  I'm wondering at what point two games become too similar, and how to avoid taking too many ideas from one game (a common problem for me).

Most games build on other games' successes and many are downright clones. Where is the limit of imitation before legal issues come into play? Is it down to literary or graphic work like characters and storyline that cause legal problems, or can someone actually claim to own gameplay mechanics?  There are so many similar clone games out there that the rules are probably very slack or nonexistent, but I'd like to hear the views of more experienced developers / designers.


I know that AES 256 bit is far more than enough to secure a file. I just want to know if there are any vulnerabilities or known attacks which can make such this combination less secure "double encryption using AES using different key lengths (first 128 bit and then 256 bit)".   Say, for example, I have a program that can encrypt a file using AES 128 bit and another program which uses AES 256 bit. Also, I have assumed that either one of these encryption programs have a flaw.   Case 1: So, is it possible that if AES 256 bit program fails (because of the flaw in its implementation by the programmer), the attacker will only find the file encrypted by the strong AES 128 bit and won't be able to proceed forward?  Can Case 1 be true?  Please note that the keys are not related in any way. I'm not an expert in Cryptography and I'm trying to understand its basics. So, if you may please reply in simple terms, that would be much appreciated. Thank you. :)

When transfering data using TLS the browser and server agree the cipher suite to be used - so for example this could be chosen as AES-128 and is (probably) outside of my control. If I separately encrypt a file using AES-256 and then Alice downloads this via her browser (using AES 128) have I still effectively got AES-256 security?  My reasoning goes like this: even if the AES-128 encryption on the TLS link was broken by Eve then all she would get is the AES-256 encrypted file and she would then have to break that encryption to see the plaintext.  Of course the AES-256 key is sent to Alice over a separate channel.


Any way how to get    my all un-answered questions  from across all SE sites?

I've been asking quite a few questions on several Stack Exchange sites, and I'm finding it harder and harder to keep track of them all.    Is there any way/place to see a listing of all my questions with no answer accepted on all of the Stack Exchange (2.0) sites? Or even just per site? If not, are there any plans to implement such a feature?  Although Jeff offered an answer, I don't feel it's the answer to my question; as far I'm aware there still is no way to list only my unanswered questions.


I am trying to draw a speedometer with GIMP. Is there a easy way duplicate the line by rotating it about the center?

I made something like this:    I did this with the Ellipse Tool and the Line Tool.  Now the circle is accurate, but the lines inside are very inaccurate. Is there another tool that does the same thing but with a lot more accuracy?


How I can prove that if there were $x$ and $y$ are algebraic numbers then $x+y$ and $x \cdot y$ are also algebraic numbers given that $x,y \in \mathbb R$?

Suppose $E/F$ is a field extension and $\alpha, \beta \in E$ are algebraic over $F$. Then it is not too hard to see that when $\alpha$ is nonzero, $1/\alpha$ is also algebraic. If $a_0 + a_1\alpha + \cdots + a_n \alpha^n = 0$, then dividing by $\alpha^{n}$ gives $$a_0\frac{1}{\alpha^n} + a_1\frac{1}{\alpha^{n-1}} + \cdots + a_n = 0.$$     Is there a similar elementary way to show that $\alpha + \beta$ and $\alpha \beta$ are also algebraic (i.e. finding an explicit formula for a polynomial that has $\alpha + \beta$ or $\alpha\beta$ as its root)?    The only proof I know for this fact is the one where you show that $F(\alpha, \beta) / F$ is a finite field extension and thus an algebraic extension.


No, this is not a duplicate and the link above is specifically what I was referring to as not the correct answer.  That link, and my post here specifically ask about producing a Decimal list.  But the "answer" produces a float list.  The correct answer is to use Decimal parameters with np.arange as in  `x_values = np.arange(Decimal(-2.0), Decimal(2.0), Decimal(0.1))  Thanks   I believe this may be answered elsewhere, but the answers I've found seem wrong.  I want a list of decimals (precision = 1 decimal place) from -2 to 2. -2, -1.9, -1.8 ... 1.8, 1.9, 2.0  When I do:  import numpy as np x_values = np.arange(-2,2,0.1) x_values   I get:  array([ -2.00000000e+00,  -1.90000000e+00,  -1.80000000e+00, ...   I tried:  from decimal import getcontext, Decimal  getcontext().prec = 2 x_values = [x for x in np.around(np.arange(-2, 2, .1), 2)] x_values2 = [Decimal(x) for x in x_values] x_values2   I get:  [Decimal('-2'),  Decimal('-1.899999999999999911182158029987476766109466552734375'),  Decimal('-1.8000000000000000444089209850062616169452667236328125'), ...   I'm running 3.6.3 in jupyter notebook.  Update:  I changed the ranges from 2 to 2.0.  This improved the result, but I still get a rounding error:  import numpy as np x_values = np.arange(-2.0, 2.0, 0.1) x_values   Which produces:  -2.00000000e+00,  -1.90000000e+00,  -1.80000000e+00, ...  1.00000000e-01,   1.77635684e-15,   1.00000000e-01, ...  1.80000000e+00,   1.90000000e+00   Note 1.77635684e-15 may be an incredibly small number, but it's NOT zero.  A test for zero will fail.  Therefore the output is wrong.  My response to the duplicate assertion.  As you can see by my results the answer at  does not produce the same results I'm seeing with a different range. Specifically floats are still being returned and not rounded and 1.77635684e-15 is not equal to zero.

Is there a way to step between 0 and 1 by 0.1?   I thought I could do it like the following, but it failed:  for i in range(0, 1, 0.1):     print i   Instead, it says that the step argument cannot be zero, which I did not expect.


I've read posts mentioning that after selecting your model with the validation set you train with the full set (training + validation set) and test the model on the test set.  However, what if the validation set was used for early stopping during training?  The training part might early stop at 12 epochs but that doesn't mean that it is the optimal amount of epochs for any training set in order to achieve generalization in unseen data.  Even worse, in my case, I am training a neural network where the amount the learning rate decreases in each iteration depends on the maximum number of epochs.  So even if I find that the optimal amount of epochs during training was 12, setting the maximum amount of epochs at 12 in order to retrain will yield a different result than early stopping at 12 when the maximum amount of epochs is 30.  So my question is:   Do I have to somehow retrain the model and include the validation set in the training data? If yes, how?  Or do I just use the model trained with early stopping and test it on the test set without retraining the model using the validation set?

I am a little bit confused by early stopping and in particular by how it can be inserted inside a CV framework. As far as I understand, I can fix the optimal number of epochs (for NN, or number of trees for XGB) by early stopping, that is:   pick a validation set, train with increasing number of epochs until a predefined metric evaluated on the validation set starts worsening that is the optimal number of epochs to prevent overfitting   and that's fine. But then I would like to insert this early stopping framework inside a CV framework: Suppose I have a model with 10 hyperparameters I want to fix via CV. And suppose that there is an eleventh hyperparameter, the number of epochs. My feeling is that one can do like this:   create the K resampled folds, for each of which you have a training and validation set choose a suitable grid for your 10 hyperparameters for each point on the grid train your model in each fold with early stopping, that is use the validation set of the fold to keep track of the preferred metric and stop when it gets worse take the mean of the K validation metric choose the point of the grid (i.e. the set of hyperparameters) that gives the best metric   Questions:   What number of epochs should I choose as optimal? in each of the K folds I have, in general, a different number of stopping epochs.  seems to suggest they take the mean of the K stopping epochs. Is this right? Is it actually a "fair" practice to use the validation metric coming from the early stopping as a proxy of the out-of-sample metric? As  in section 3.4.5, maybe the best thing to do would be:     ...if you want to do early stopping, then in each fold you should take your training set and split it again, holding out a small early-stopping-set to guide the early stopping, and then evaluate the model on the validation set of that fold.   But this seems to me a really intricate process...   Unfortunately, I wasn't able to find references where this issue is presented in a clear and transparent form.


i add button to top of the bar but two buttons are added. how can i fix this problem d  class ExportAll(bpy.types.Menu):     bl_label = "ExportAll"     bl_idname = "OBJECT_MT_simple_custom_menu"      def draw(self, context):         layout = self.layout          obj = context.object          row = layout.row()         row.operator("mesh.primitive_cube_add")   def draw_btn(self, context):          layout = self.layout     row = layout.row(align=True)     row.operator('mesh.primitive_cube_add',text="CUP",icon="IPO_EXPO")  def register():     bpy.utils.register_class(ExportAll)     bpy.types.TOPBAR_HT_upper_bar.append(draw_btn)   def unregister():     bpy.utils.unregister_class(ExportAll)     bpy.types.TOPBAR_HT_upper_bar.remove(draw_btn)  if __name__ == "__main__":     register()

I try to add custom menus to the menus at the top bar in 2.80. The old INFO_HT_HEADER.append() doesn't work any more. I found TOPBAR_HT_upper_bar.append() to kind of do the trick but I get two menus, one after the workspace tabs (would preferably have it before but I guess that is a feature request separate from this) and one after the view layer menu. Am I using the wrong thing or is this a bug? Here's a super simple menu from an example which gives me the problem.  import bpy  class customMenu(bpy.types.Menu):     bl_label = "Custom Menu"     bl_idname = "view3D.custom_menu"  def draw(self, context):     layout = self.layout     layout.operator("mesh.primitive_cube_add")   def draw_item(self, context):     layout = self.layout     layout.menu(customMenu.bl_idname)  bpy.utils.register_class(customMenu) bpy.types.TOPBAR_HT_upper_bar.append(draw_item)


sudo apt-get install mesa results in:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package mesa     lspci -k | grep VGA -A2 01:00.0 VGA compatible controller: Advanced Micro Devices, Inc. [AMD/ATI] Tahiti PRO [Radeon HD 7950/8950 OEM / R9 280]     Subsystem: XFX Pine Group Inc. Device 3221     Kernel driver in use: fglrx_pci

When I try to install any package through the command line, I get an error.   $ sudo apt-get install <package> Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package <package>   Can anyone help me on this?


The text below has 3 blocks that start with /*+ and end with /*-. The regular expression (/[*][+]a[*]/)((?s).*)(/[*][-]a[*]/)\R matches all the text below. How can I match only the first block?  TEXT TEXT TEXT TEXT TEXT TEXT  /*+a*/ --TEXT 1 --TEXT 1 /*-a*/  TEXT TEXT TEXT  /*+x*/ --TEXT 2 --TEXT 2 /*-x*/  TEXT TEXT TEXT TEXT TEXT TEXT  /*+a*/ --TEXT 3 --TEXT 3 /*-a*/  TEXT TEXT TEXT TEXT TEXT TEXT

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


I had a question that could have been asked on either of these 3 websites - codereview, programmers, codereview with a little tweaking. I decided to post on codereview. So far I got only one answer even after placing a bounty. To get more answers I thought of  but it seems that isn't possible or desirable.  So what should be done in case I have such a question? Should I reword the question and request a migration? Should I cross-post? Should I make a feature-request that cross-SE bounties be allowed between these 3 websites? How about  of questions with some minimum upvotes?  Any suggestions?  This is .   This question isn't specifically about cross-posting. I am asking for alternatives present in this situation   cross-posting cross-SE bounty soft-migration complete migration

It is possible to migrate a question from one Stack Exchange site to another by closing, but if I have a question that I think is on-topic for multiple Stack Exchange sites, is it OK to post it on both (multipost)?   For example, I have a question that's earned me the tumbleweed badge on SO and I'm not sure what the best thing to do with it is. It's about a web server so it might be answerable on Server Fault but it's really more of a programming thing, hence the posting the question on Stack Overflow.    Is there any way to make the question visible on multiple sites (crosspost) and then accept the answer wherever it came from?


I'm having a hard time with the very-last proof I'm supposed to make:     Prove that the set of rational numbers is countable by setting up a function that assigns to a rational number $\textbf{p/q}$ with $\textbf{gcd(p,q)=1}$ the base $\textbf{11}$ number formed by the decimal representation of $\textbf{p}$ followed by the base $\textbf{11}$ digit $\textbf{A}$, which corresponds to the decimal number $\textbf{10}$, followed by the decimal representation of $\textbf{q}$.   Any help would be kindly appreciated.  Thanks.

I want to prove that $\mathbb{Q}$ is countable. So basically, I could find a bijection from $\mathbb{Q}$ to $\mathbb{N}$. But I have also recently proved that $\mathbb{Z}$ is countable, so is it equivalent to find a bijection from $\mathbb{Q}$ to $\mathbb{Z}$?


I am working on JSON format using <C++98> and for that reason, I have defined 3 classes : class Json { public:     string key; };  class JsonElement:public Json { public:     string value; }  class JsonObject: public Json { public:     std::vector<Json*> elements;  I neglected the JsonList for the moment. I overloaded the  operator[] so that if the operator finds another JsonObject, it will call the  operator[] once again until it finds JsonElement and here it returns the value and not a Json I don't know if I can use  enable_if to achieve that or maybe you have another solution. the idea is this : (this is not a code just the idea) Json || string operator[](const char* key){            if(this->getElementByKey(key) is JsonObject)          return Json;      else if(this->getElementByKey(key) is JsonElement))           return this->getElementByKey(key)->value; }   in that way we can use for example : JsonObject jObj;  string value = jObj["key1"]["key2"]

We all know that you can overload a function according to the parameters:  int mul(int i, int j) { return i*j; } std::string mul(char c, int n) { return std::string(n, c); }    Can you overload a function according to the return value? Define a function that returns different things according to how the return value is used:  int n = mul(6, 3); // n = 18 std::string s = mul(6, 3); // s = "666" // Note that both invocations take the exact same parameters (same types)   You can assume the first parameter is between 0-9, no need to verify the input or have any error handling.


its not first occurence. after a index i need to get the first   occurence. the question which you are pointing to is the first   occurence without index   i have a sql query which i am trying to modify using String.Replace but my code is replacing where ever it finds brands, how to avoid this  string tempString =    "Select t0.brandid,t0.cold,t0.colm, from brands t0 where brandid=@value";   I want to replace brands which is table name between from and before t0 to tempbrands      int tempindex1 = tempString.IndexOf("FROM "); string tempString1 = tempString.Replace("brands", "tempbrands ");   expected result is Select t0.brandid,t0.cold,t0.colm, from tempbrands t0 where brandid=@value

I want to replace the first occurrence in a given string.   How can I accomplish this in .NET?


I have the next layout of tables:  table COMPANY: - primary key pk_company  table USERS: - primary key pk_users,  - foreign key (fk_company) references COMPANY (pk_company)  table GROUPS: <br> - primary key pk_group, - foreign key (fk_company) references COMPANY (pk_company)  table ROLES: - primary key pk_role  table RELATIO_UGR: - foreign key (fk_user) references USERS (pk_user) - foreign key (fk_group) references GROUPS (pk_group) - foreign key (fk_role) references ROLES (pk_role) - Also: UNIQUE KEY [fk_user,fk_group]    This is:  USER ---(n:m)--- GROUP ---(m:1)--- COMPANY USER ------------(n:1)------------ COMPANY 1 company can have N users (workers) 1 company can have M groups M groups can have N users (each worker can be in more than one group) 1 user can have only 1 role (read / read-write / admin) in each group.   The thing is that all constraints seem to work in the individual tables, however, the RELATIO_UGR table fails to establish constraints.  Let's suppose we have:   USER1 from GROUP1 and COMPANY1  USER2 from GROUP2 and COMPANY2   The RELATIO_UGR shouldn't allow me to establish (for example) the relationship:   USER2-GROUP1-COMPANY2    Yet, I CAN insert it...   How do I restrict it?

I have an entity that cannot exist without being defined by another, and I want this entity to participate in a many-to-many relationship.  Example: An artist has an album (the album cannot exist without an artist), the album also has many tracks, but the same track can exist in many albums.  So we have a many-to-many relationship between the album and the tracks.  If the album is a weak entity, then its primary key is a foreign key referencing the artist, thus it cannot be a foreign key to another table representing a many-to-many relationship.  The question is: is it possible to have this kind of relationship in SQL, and if so, how do I express it?


There are two empty sepetated spaces left and the person going does not have a card to play but the next person does.   Does the first person lose because they are out of cards to play or does the second player lose because they still have a card to play afterwards that will move them off the board?

The rules in Tsuro are very vague about what happens once the players start to run out of tiles.  What's the best way to handle how titles are drawn in Tsuro when a player goes out, and other players are lacking tiles.  I know the dragon title is placed at the end of the deck, and signifies that a player who draws the dragon tile should received a card once one becomes available, but what happens if more then one player has less then three tiles?  It's conceivable for a player to go out to take out more then one player, possibly freeing multiple tiles.  Should all player lacking tiles go back up to three if they can?


Why is pseudorapidity defined as $\eta = -\ln[\tan(\frac{\theta}{2})]$ as opposed to just $\eta = \tan(\frac{\theta}{2})$?

Why the log? Is it there to make the growth of the function slower?  As this is a common experimental observable, it doesn't seem reasonable to take the range from $[0,\infty)$ to $(-\infty,\infty)$ (For a particle emitted along the beam axis after collision $\theta = 0$ wouldn't be better to have a number that says how close it is to zero rather than one that says how large a number it is. I hope that makes the question clear.)


Why is ray travelling through pole passes undeviated?( not changing any direction) ( this was asked in kvpy interview)

How can it be explained using the laws of refraction that a light through optical centre of a lens passes undeviated?  If we assume the portion of the lens in the middle to be made of even number of alternately place up and down prisms, then it's clear,  but why can the number of prisms not be odd?


If I'm wanting to sync my iMac and my MacBook Pro so that I don't have to connect it every time or back it up through time machine what would be the best way? I want a true sync. So If I save something on the iMac it populates on the MacBook Pro and vice versa.   Would that be through a cloud structured database? Or is there a better way?  Thanks in advance of course!

I actually have a Macbook Pro with Snow Leopard (I plan on upgrading to Lion).  I may have to buy an Mac mini in order to have a full dual screen (external identical screens) layout (see my ).  So I will work on a Mac Mini and a Macbook Pro, most of the time on the same LAN.  How to get everything completely synchronised, as fast as possible? (I don't know if iCloud can)  I am talking about every file/data on my computer:   applications application preferences mails calendar iPhoto/aperture libraries lots of small files (web development...) files out of my account (apache server files, php/libraries) ...   I don't want to manage 2 computers and do everything twice (installing something, configuring the system, etc...).


In many episodes of Star Trek: TNG, people on a planet (or somewhere away from the Enterprise) transport back to their ship by someone tapping his/her communicator and saying "3 to beam up" or similar.  Then, the 3 people intended by that person almost immediately begin beam-out.  How does this work?  It often happens that the "N" people intended for transport are a subset of all the people available.  I thought perhaps it has to do with the stances of those N people, but that seems unlikely.  It also occurred to me that the computer could sense the thoughts of the person to figure out which people he/she means, but this is even more far-fetched, and has never been supported by any technobabble on the show.  There was one time someone says something like "2 people and one piece of equipment to beam up" (I don't remember which episode).  That made somewhat more sense, as the transporter chief could probably see via targeting scanners exactly which thing was the "piece of equipment" but it still leaves the question of which people to beam up fuzzy.  Anyone have other ideas?  This has always bugged me much more than other seeming weirdnesses on TNG, which I am usually able to come up with headcanon theories for.

After watching (I'm sure quite too) many Star Trek episodes, I've noticed a number of occasions where the characters seem to step away or onto a more specific location to get transported, even if they are not anywhere near a transporter "pad."  Recently, I noticed this at the end of Deep Space Nine, Season 4, Episode 11, Paradise Lost - Part 2 where it's clear that Sisko steps slightly out of the way and closer to the group of other people to get transported, before he actually is ...   However, I've noticed this, to some extent in episodes of all 5 live-action TV series.  So, the question is ... is there there something inherent in transporter technology that requires people to be either:   Closer together in proximity or ... In a certain location before normal transportation is possible?   Note: I realize this is sci-fi and an easy answer is "well it's a bit of a plot device, it depends ..." That's kinda weak, I'm looking for a more well-rounded anwser.


in Canada, I don't remember specifics but what I remember was that the show had a boy that could summon a magical creature from a stone and I think I watched it before 2010. It was in English and I think it may have been 2008 or close to when I first saw it. Also I think the creature was some kind of tiger or elephant like thing, I don't entirely remember. Cant remember what the boy looked like though. The boy was young though. the stone also was about the size of his hand and had a symbol of some kind, he could also get more than 1. the style of the show was also a bit old. The only two things I remember is near the beginning he is in a jungle or forest and later in a snowy rock area.

What is the name of the anime TV show where a boy can summon beasts with crystals/gems. It was on SABC 2. There was also a boy that could summon a purple turtle . I think the gems were blue, green, and red.