When using this official guide (), windows reverts my changes once I reboot. I have also tried the following, which I have seen on multiple sites: Click the Start Button and type cmd Right-click the result and select Run as administrator Type this command and press ENTER: bcdedit /set {current} safeboot minimal (ALT: bcdedit /set safeboot minimal) Restart the computer and enter BIOS Setup Change the SATA Operation mode to AHCI from either IDE or RAID Save changes and exit Setup and Windows will automatically boot to Safe Mode. Right-click the Windows Start Menu once more. Choose Command Prompt (Admin). Type this command and press ENTER: bcdedit /deletevalue {current} safeboot (ALT: bcdedit /deletevalue safeboot) Reboot once more and Windows will automatically start with AHCI drivers enabled.  (source for this particular copypaste: ) However, when I reboot after turning off safe boot, win10 reverts to using RSI, taking the UEFI with it. I am using a new Medion Erazer P17613, secure boot/fast startup are turned off. I plan Ubuntu to be my primary os and to only have to boot into windows if I need it for uni work and can't get it to work in virtualbox, so a solution which involves me having to go into UEFI to switch os would be workable, although not optimal. edit: I don't know why askubuntu keeps telling me it's a duplicate, because the question it's referring to does NOT have it constantly revert, which I put in the title and the first paragraph... Anyway. Uni's started, so I don't have any more time. I'm nuking Windows and just running it in VM. this edit is mostly to explain why I won't be checking the thread any more. thanks anyway. Editing again, because, um - it wasn't actually Windows all along. I had some issues with the installation (the third-party software bug) and then RST turned itself back on (?!) so I was looking into secure boot again, found , went to try it and noticed another secure boot option in the security tab which wasn't the one I had found previously, tried it out of curiosity, and it worked. just for the record: I did not actually need to do the supervisor password thing. I don't know if it's only this one or also the other secure boot required to be turned off, but. I apologise for my assumption that it was Windows causing the issue, that probably didn't help anything. for anyone else with this problem, the wording may not be as obvious as you think it should be (I'm incredibly literal) so search everything even slightly security-related. edit again, trying to reinstall just to be sure, and RST is back on?! v apologies for the below being slightly lengthy. I don't want to be the 'found a solution but didn't post it' person, and I'm typing this as I go. edit for hopefully the final time: I got past the point where it would tell me RST is enabled by switching the boot order to boot from the USB before anything else, and also turned RST off again while I was in the bios at that point. this gave as little time as possible between disabling RST and installing from USB. I ended up in initramfs having the problem  because RST turned itself back on, but reboot -f, going to bios, and turning it off again let me boot. so that's what I'll be doing every time it boots I guess, but at least it works now.

I tried to install Ubuntu 20.04 in my Dell G5 which has 2 drives. One with Windows 10 on it (256 GB) and another one with 1 TB capacity.   I shrunk the volume of 1 TB by 150 GB and tried to install there.  But Ubuntu installer didn't allow me as I got a dialog after the Keyboard setting said "Turn Off RST" with the message      This computer uses Intel RST (Rapid Storage Technology). You need to   turn off RST before installing Ubuntu. For instructions, open this   page: help.ubuntu.com/rst   If I make any changes in the BIOS setting, like changing the Intel controller from RAID to AHCI, Windows won't boot and goes into System Recovery.   I didn't have this issue when installing 18.04. While creating the partitions, you need to create a EFI partition with 200 - 500 MB with the usual steps and the installation will be completed succesfully.   On restarting, you will not be getting the GRUB but instead Ubuntu will boot by default. If you need to boot Windows, you will have to go to the BIOS and choose from the UEFI boot option each time.   Once 18.04 installation is complete, you can upgrade it to 20.04.   After upgrading I installed the KDE desktop and at the login screen I chose the "Ubuntu on Wayland" option.    After doing these 2 things, I lost the new features of 20.04 like the Ubuntu boot screen with Dell logo and the power off/log out blur effect screen. Not sure how to get that back.


If $A_i$ is a sequence of sets, define$$\liminf_i A_i = \bigcup_{j = 1}^\infty \bigcap_{i = j}^\infty A_i, \quad \limsup_i A_i = \bigcap_{j = 1}^\infty \bigcup_{i = j} A_i.$$Given a set $D$ define the function $\chi_D$ by $\chi_D(x) = 1$ if $x \in D$ and $\chi_D(x) = 0$ if $x \notin D$. Does it follow that$$\chi_{(\liminf A_i)}(x) = \liminf_i \chi_{A_i}(x), \quad \chi_{(\limsup A_i)}(x) = \limsup_i \chi_{A_i}(x)$$for each $x$?

So first let me state my homework problem:  Let $X$ be a set, let $\{A_k\}$ be a sequence of subsets of $X$, let $B = \bigcup_{n=1}^{+\infty} \bigcap_{k=n}^{+\infty} A_k$, and let $C = \bigcap_{n=1}^{+\infty} \bigcup_{k=n}^{+\infty} A_k$. Show that (a) $\liminf_k\; {\xi_A}_{_k} = \xi_B$, and $(b)$ $\limsup_k \;{\chi_A}_{_k} = \chi_C.$  I know that, in the context I am familiar with, that $$\liminf_{k\rightarrow +\infty}\; X_k = \bigcup_{k=1}^{+\infty} \bigcap_{n=k}^{+\infty} X_n$$ and $$\limsup_{k\rightarrow +\infty}\;X_k = \bigcap_{k=1}^{+\infty} \bigcup_{n=k}^{+\infty} X_n.$$   I also know that the characteristics (indicator) function is defined as $\chi_A(x) = \begin{cases} 1, & x \in A \\ 0, & x \notin A .\end{cases} $  So I wrote out $B$ in some of its `glory': $B= (A_1 \cap A_2 \cap A_3 \cap \cdots) \cup (A_2 \cap A_3 \cap \cdots) \cup (A_3 \cap A_4 \cap \cdots) \cup \cdots$, and as the first argument is the smallest, with increasing size to the right, the last term in the expression for $B$ would be $B$, which would be the largest.  So if I replace the $X_k$'s above with $\chi$'s I still don't see how I can get the correct answer - though it looks pretty clear from the definition of $B$ and that of $\liminf$ being basically the same, except in this case for the $\chi$.  Any direction would be greatly appreciated. By the way, I have checked out  but I was somewhat confused by the topology, the meets/joins, etc.  Thanks much, Nate


Wasn't even sure how do I google this. I am using the laptop screen (1366x768) and an external screen (1920x1080). Is there some way/setting to change the screen height at which the cursor goes to the smaller screen, so that you can move the cursor between the screens at any height? Because right now you can only drag the cursor from the larger screen to the laptop one at the middle of the screen, if you try it any higher or lower it "hit's a wall".   I am already using Actual Multiple Monitors, but I don't think it has this feature.  Windows 7 x64

I'm not sure if I'll be to explain this right. I have a dual monitor display on Windows 7 and my left monitor (laptop) has a lower vertical resolution than the right monitor (regular LCD monitor). So obviously, if I stick these monitors together, there's a part in the upper-left corner of my LCD monitor where cursor cannot go to the other monitor. I remember there was a trick to make this gap disappear, and make it seem like the monitors are of equal height.  Any suggestions?  By the way, I am also using UltraMon.


Dynamically appended elements:  +'
'             +'<form action="" class="ckit-composer-form">'                 +'
'                     +'<textarea data-ckit-composer-textarea placeholder="Add your reply" autocomplete="off" name="message" class="form-control ckit-composer__textarea"></textarea>'                 +'
'             +'</form>'                +'
'    I'm unable to bind keypress event into the textarea above like this:  jQuery('[data-ckit-composer-textarea]').bind('keypress',function(){     alert('hi');//does not invoked });   So i'm doing using inline onkeypress event and this does work:  <textarea data-ckit-composer-textarea placeholder="Add your reply" autocomplete="off" onkeypress="enterMe()" name="message".....><textarea>   enterMe() function which registers key press multiple times  function enterMe(){  jQuery('[data-ckit-composer-textarea]').keypress(function(event){     var keycode = (event.keyCode ? event.keyCode : event.which);      if(keycode == '13'){     alert('hi);//invokes many times     } }); }   How do I make alert('hi) invoked only once per ENTER keypress? I'm nt holding on it continuously or pressed it twice fastly which would have caused it to run multiple times.. What else could be the reason for this and how to solve it, pllease?

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I know how to prove the result for $n=2$ by contradiction, but does anyone know a proof for general integers $n$ ?  Thank you for your answers.  Marcus

Possible Duplicate:          Will every $n^{th}$ root of $2$ be an irrational number? If yes, how can I prove that?


How can I label my equations as:  a = b+c (1(a)) d = f+g (1(b))   Please advice as I have used simple labeling structure \label but don't know how to handle the letters.

Sometimes it is convenient to refer to a group of equations by a letter and a number.  For example:   2+1   (A1) 2+4   (A2) x^4   (B3) x^e   (B4)   Placing  \tag{A\theequation}\label{eqn:thisone}\stepcounter{equation}} instead of just \label{eqn:thisone} works, but seems hacky (especially manually stepping the counter).   Is there a better way?


Basically I'm asking this question (which seems to have gone un-answered):   I'm using perspective projection and would like to scale up certain objects in the background (z < 0) such that they would render unscaled and in the same relative position. In other words, I want to reverse the perspective foreshortening for bg objects.  I've figured out how to unscale accurately: basically I project the top left and bottom right corners of the image to z = 0, then do the same at the current z value. I then compare the change in distance between the points in order to derive the scale factor.  The problem I have though is once I unscale the object, its position is incorrect. I've tried scaling around different anchor points, with no luck. I can't seem to derive a generic formula to position the images in the correct places after scaling.  Any ideas how to do this? Is this even mathematically possible?

Hello everyone I have this problem that I have tried everything I could think of. The problem: I am making a 2D game with parallax effect but I am using 3d space so am not simulating the parallax but letting the perspective projection take care of it for me. now the problem i have my own game editor where I design the levels, in this editor I use just images and I set a Z value for each layer. however I want the layers to show in the game engine exactly as I set them in the game editor, in short I want perspective projection to do parallax but without changing their scale or offset/position.  obvious solution is to scale them up and offset them but the problem how to calculate their offset? with scaling I tried object->Scale(object.Z/view.Z) and seems to return them to their real size but their positions are still wrong. I tried object->setPositionX(object->getPosition().x*(object.Z/view.Z)) and seems to be aligned except they all seems shifted.  I have tried unprojecting and tried to convert from world matrix to screen matrix and find some ratios and so on.  If anyone have any idea or anyway how this could be done in an elegant/mathematical way , I will be most grateful.  Thank you all in advance.


Consider this sentence:      There could be a chance.   What part of speech is the word there in this sentence?

What part of speech is there in the sentence “There is a book on the table?”  Also, while typing it out, another question pops up vis-à-vis punctuation. In my complete first sentence above, I ended it with a question mark since my main sentence is a question. The quote is not a question, but it looks like it because of the question mark. Is this the right way to punctuate?


I submitted a paper to a journal in mathematics. For the last three and a half months, the status of the article is with editor. I sent a mail to the editorial office to update the status. They replied me saying they will ask the handling editor to contact me. After one more month I asked to expedite the process. No reply. Now for the last three and half months, there is no change in the process.  Is it better to withdraw the article or wait for some more time?

I submitted a paper to a journal, and I suspect that it is handled too slowly.   How can I decide whether my suspicion is correct? What handling times should I expect? Given some expected handling times, when should I act? How much leeway should I give? How should I act? Whom should I contact and what should I (roughly) write?   Note that I am interested on how I should approach this situation in general, and do not seek specific numbers for my specific situation. I am therefore looking for general answers that are independent of such factors as the field or individual journal (but mention them if they are relevant factors).  This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.


I don't know what Linux version of Adobe Flash to install for Ubuntu 13.04; Also: once I get it, how do I install it?

I have had significant problems with watching flash video in 64-bit Ubuntu.  Does anyone know of a good way to get flash running on the platform?


If I have something like:  void SomeFunction(onCallBackDelegate) {      SomeClass.OnEvent += () => { onCallBackDelegate } }   Will there be issues with functions being loaded up on top of one another every time SomeFunctioni s called? Is tehre a way to mitigate it (i.e. when the declared function is called it is removed from SomeClass.OnEvent)?

I would like to ensure that I only subscribe once in a particular class for an event on an instance.  For example I would like to be able to do the following:  if (*not already subscribed*) {     member.Event += new MemeberClass.Delegate(handler); }   How would I go about implementing such a guard?


I have a package label with a background illustration that I'm trying to emboss so I decided UV unwrapping the label design into separate layers and onto the bottle "panel" would be the best option only problem is up until right now I only know how to uvwrap ONE image onto ONE surface at a time.  I've tried creating a new UV map in the data panel and adding the second image texture to it's material but that hasn't worked.    The top left image is the first image text and the bottom right is the one I'm trying to unwrap on top of it.

I'm trying to match Cycles to a Blender-Internal material setup and I didn't see a way for cycles to have an image reference more then one UV map.  Is it possible to have a node setup with 2 image textures, each using a different mesh UVLayer?


I have multiple objects in my blender project, but the origin is faulty for all of them.  I would like the origin for each object to be at the center (geometry, or mass), but even if I select that for each of them, one by one, it does not appear to work.  It appears that my XYZ axis are at the cursor, rather than at the origin of the object. How do I change that?  (Feel free to edit question if unclear, incorrectly worded, or addressing something other than the origin point. I'd like my XYZ axis to be at the center of mess/geometry for each object automatically. This was originally so, but I did something to mess it up.)  Blend file:    UPDATE: It appears that, in addition to the "origin point" issue, my 3D cursor was set to "Bounding Box" rather than "Median Point". Thank you all!

So, I'm working creating a lamp... yes, newbie here.  After modeling for a bit, I noticed that my point of origin was no longer the center of my object:    How to I reset an object origin point to the center of it's geometry?


I deleted my dual boot Windows part from GParted. Now this unallocated space of the windows, I want merge them into sda5. But I don't know how to do this. Have seen many post regarding this like drag to left to give the space but while trying to do this using Resize/move, that it's max size is already 600 GB so I can't merge that 300 GB into it. I think I'm doing it wrong. What is the right way to do this?

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


Asking because of curiosity. :)  When I type   sudo su   It asks for my user password. And when I type just   su   It asks for the root user password. But both the commands directs me to the root terminal. Then why is there such a difference?

I already read it from manual but I can't see difference..  su - change user ID or become superuser  sudo -s [command]   The -s (shell) option runs the shell specified by the SHELL environment variable if it is set or the shell as specified in passwd(5).  If a                    command is specified, it is passed to the shell for execution.  Otherwise, an interactive shell is executed.  sudo -i disappear description in manual


I am beginner in field extension theory. But I have not learnt Galois theory. I need to solve the following problem:  For which prime numbers $p$ is $$\cos\left(\frac{2 \pi}{p}\right)$$ irrational?  I have spent some time on this question. But I did not make much progress. If someone could provide a full solution, that would be great. But hints will be appreciated as well. Thanks so much.

Calculate the degree of the extension $[\mathbb{Q}(\cos(\frac{2\pi}{p})):\mathbb{Q}]$ where $p$ is a prime number.   My thoughts are:   I am lost My intuition says it has to be $ \frac{p-1}{2}$ and that the base vectors are probably $\{\cos(\frac{2n\pi}{p}) \mid 0 \le n \le p-1 \}$, notice  $\cos(\frac{2n\pi}{p})=\cos(\frac{2(p-n)\pi}{p})$.   I don't know how to prove/calculate it.


The scenario I have is: I am using Workstation 10 and my laptop, and running a virtual machine Ubuntu server 20.04 I have my terminal open, I am using Windows 10 pro as host and on my desktop I have the OneDrive folder, both are configured with brigde Network connection and they can ping each other, what I need is from the terminal of my Ubuntu server virtual machine to transfer that software that is in my Host's Desktop (Windows 10) and then install it using the terminal, what would be the commands that allow me run this task? As software you can give me an example and give me the steps how to do it.

I have a desktop (Ubuntu 13.04 & Win 7 Home Premium) and a Laptop (Ubuntu 12.04), both having WiFi adapters. I also have a WiFi router connected to internet which both my computers can access.  I want to share files between my desktop and my laptop using WiFi (similar to Homegroup on Windows 7 but without using Ethernet cables).  How do I set-up that?  I want to share files using both OSs, if anyone have have information about sharing files with any of the OS please answer!


I'm not sure if it exists or not, but does Stack Exchange have a site for asking psychology questions? And if not, is it possible to create one?

I am new to Stack Exchange. I know there is a lot of discussion sites for Stack Exchange. I would like to know about there were any Stack Exchange site available for discussing and solving personal psychological problems.


There is a question that's confused me for a long time.  Let's say I'm in Korea right now and I get asked  "How did you get the American accent" while talking to a stranger at a pub, can I say either:      "I lived in California for 2 years"   or   "I've lived in California for 2 years"?   I suppose the former one is only acceptable since the latter is implied that I still live in California and now I am in California.  Am I right here?

I've been reading . I have also been reading this . From these two sources it appears that there is no difference between Present-perfect-tense and Simple-past-tense.     I myself thought up two sentences:           The children played in the sandbox.      The children have played in the sandbox.        The only difference that I am able to recognize is that in the 2nd sentence we are putting some emphasis on the fact that children (have) finished the play. If I translate "have" into my language then it is giving the emphasis that children finished the job. On the other hand the 1st sentence is just telling that children played there some time ago. The 1st sentence is giving no emphasis on the fact that they have finished the play.     Please explain me what is the difference between Present-perfect-tense and Simple-past-tense.


I'm working on a variation of a problem noted in Problem 19 Chapter 12 of the textbook "Building Java Programs". Essentially, I'm doing a recursion problem using a Fibonacci sequence. Though the program I've made works, part of the problem I'm working on is I also need to measure the time to get 45th Fibonacci number by using the implementations by 1, 2 and the one given in problem, print out how many times your implementations are faster than the one given in the problem . While I've looked at this page (), I was wondering is there was a way implement this without a lot of code change. This is the original method used:  public static int fibonacci (int n) {       if(n <= 2){         return 1;       } else {          return fib (n - 1) + fib(n - 2);       } }   And this is what I've done I did the problem using two java files: one that serves as a test main class with and the other with the recursion algorithm :  PrintValues.java  import java.util.Scanner;  public class PrintValues {      public static void main(String[] args) {         Scanner scan = new Scanner(System.in);         System.out.print("Enter the number value: ");         int n = scan.nextInt();         HelperBinary.countBinary(n);         //fib(double nth);     } }   HelperBinary.Java:  public class HelperBinary {      public static void countBinary(int n) {         if (n < 0) {             throw new IllegalArgumentException();         }         countBinary(new char[n], n);     }      private static void countBinary(char[] preFx, int n) {         if (n == 0) {             /* This is the base case             */             System.out.println(preFx);         } else {             /* This is the "recursive" case.             */             final int i = preFx.length - n;              /* Assign a '0' preFx and recurse             */             preFx[i] = '0';             countBinary(preFx, n - 1);              /*Assign a '1' preFx  and recurse             */             preFx[i] = '1';             countBinary(preFx, n - 1);         }     } }   Any help would be seriously appreciated.

How do you write (and run) a correct micro-benchmark in Java?  I'm looking for some code samples and comments illustrating various things to think about.  Example: Should the benchmark measure time/iteration or iterations/time, and why?  Related:


So I’ve got a UK Visa with a start date of the 30th of April and I’ve booked a Flight which departs 23:55 on the 29th of April. That’s 5 minutes before my visa becomes active.  Will this pose a problem for me? I have to absolutely be in Manchester by 1st of May for an important meeting.  The flight is Turkish airlines Abuja to Manchester, so there’s a layover in Istanbul.

I have a question, I applied for the Schengen visa through Germany, on the form they ask me when I'd arriving (to Germany) and when I'd returning. they take this exact date as the visa period.  I wondering if they would let me get into the plane, even though my flight it a day before the arrival.  Let get the real deal; let say this:  My visa is valid from 02/12/2014 to 02/02/2015. But, my flight is scheduled to be departing on 01/12/2014, but entering Germany 02/12/2014. the flight duration is almost 9hours and there is 7hours difference between Germany and the departing flight country.


When space expands, light is said to be stretched or red-shifted. In fact, Penzias and Wilson discovered this in 1965 and were awarded the Nobel prize in Physics for this discovery.   Now, what I am confused with is whether the expansion of space into itself affects matter or in other words, how does expansion of space affect matter?   Does space expansion also mean time expansion?  Please enlighten me. Suggested readings will be highly valued.

I have looked at other questions on this site (e.g. "why does space expansion affect matter") but can't find the answer I am looking for.  So here is my question: One often hears talk of space expanding when we talk about the speed of galaxies relative to ours. Why, if space is expanding, does matter not also expand? If a circle is drawn on balloon (2d plane), and the balloon expands, then the circle also expands. If matter is an object with 3 spatial dimensions, then when those 3 dimensions expand, so should the object.  If that was the case, we wouldn't see the universe as expanding at all, because we would be expanding (spatially) with it.  I have a few potential answers for this, which raise their own problems:   Fundamental particles are 'point sized' objects. They cannot expand because they do not have spatial dimension to begin with. The problem with this is that while the particles would not expand, the space between them would, leading to a point where the 3 non-gravity forces would no longer hold matter together due to distance Fundamental particles are curled up in additional dimensions a la string theory. These dimensions are not expanding. Same problems as 1, with the added problem of being a bit unsatisfying. The answer seems to be (from Marek in the previous question) that the gravitational force is so much weaker than the other forces that large (macro) objects move apart, but small (micro) objects stay together. However, this simple explanation seems to imply that expansion of space is a 'force' that can be overcome by a greater one. That doesn't sound right to me.


Please explain to me this:  What is the physical mechanism of the field and atraction force; in which way a force (electro, magnetic or gravity) is transmited between two objects? I will try to explain that question with a few sub-questions (basicly the same ones): On the extreme basic level, the question is: how two particles (proton and electron) atract each other? I know they have opposite charges, but how that charges atract each other? How they "comunicate" that information? How they "produce" atraction force? On the other hand - is it the same mechanism with gravity force? How two bodies "comunicate" their masses? How they start to move toward each other despite their inertial masses? Where that energy come from? What is that force? I know it's a "bit" messy question, but what is the essence of that atraction?  Thanks a lot. Boris

When a permanent magnet attracts some object, lets say a steel ball, energy is converted into for instance kinetic energy and heat when attraction happens, and they eventually collide. Does this imply that energy is drawn from the magnetic field and the magnet is depleted, making it weaker and weaker for each magnetic attraction performed?  (if the answer requires Quantum Mechanical explanations, please elaborate :))


So, I'm Trying to find a way to select areas of images that have similar levels of contrast, but with variations of color.  Is there a way through scripting or otherwise in Photoshop to select something as wispy as clouds and extract most of them from the sky?  I've played with the lasso longer than any cowboy ever has and I don't believe in magic after I've failed so many times with the wand. I don't see a way to make PS perform as desired (consistent or fast).    Am I missing something or is this genuinely difficult?

I've had to use clouds in projects on more than one occasion, and I'd like to find a way to extract (select only) the clouds.  There are a lot of good brushes for this type of thing but often times they're too small, If I could figure out the process used to make something like this I would be able to make my own from stock images.  The brushes below are a good example of what I'm trying to achieve. They're cut very nicely and will look clean on any background    Any help is much appreciated.


This is the question I'm stumbling with:   When $|\alpha| < 1$ and $|\beta| < 1$, show that:  $$\left|\cfrac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < 1$$    The chapter that contains this question contains (among others) the triangle inequalities:   $$\left||z_1| - |z_2|\right| \le |z_1 + z_2| \le |z_1| + |z_2| $$  I've tried to use the triangle inequalities to increase the dividend and/or decrease the divisor:  $$\left|\cfrac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < \cfrac{|\alpha| +|\beta|}{\left|1-|\bar{\alpha}\beta|\right|}$$  But it's not clear if or why that would be smaller than one.  I've also tried to multiply the equation by the conjugated divisor $\cfrac{1-\alpha\bar{\beta}}{1-\alpha\bar{\beta}}$, which gives a real divisor, but the equation does not appear solvable.  Any hint would be much appreciated.


I've looked in a lot of places including the java website and oracle website but everyone is showing how to install the jdk and not the jre which I need.  Java 8 jre specifically.  And I'd like to do it in the gui if I don't have to use the terminal so there are less errors in getting it installed.  I've searched the software center but searching java yields a loading circle and shows no results. Ideally I would like proprietary and not open.

I want to install Oracle's JRE and to update to the latest version with the Software Updater when they released. Is there a Ubuntu package that is provided by Canonical or Oracle?  Before release Java 7, I followed  to install Java 6.  But it doesn't work for Java 7. There is no package sun-java7-xxx. How can you install Java 7?


A file Cat within a folder Dog owner  -rw- 1 rich v 12 15:40 Cat   What is the shell command to remove others' read access from file Dog?

I have a folder named Dog with these permissions:   dr--r-- 2 rich boys 4096    What is the shell command for it


I am not able to type symbol for Indian rupees using my 18.10. I have set Regional format as English ( India ) and in other areas where I can find English ( India ). But when I type ALT+4, I get 4 on gedit. Any fix available for this? Am I doing something wrong?

I want to type the Indian Rupee Symbol. So I went to System Settings >> Keyboard Layout and clicked on the Options button. Under the Adding Currency signs to keys sections, I checked the Rupee on 4 option.    Later when I opened the Layout Chart of the Keyboard there was Rupee sign in the 4 key but I do not know how to type the symbol. What combination of the keys will type the Rupee symbol on the screen?


In Mordenkainen's Tome of Foes one can gain Demonic Boons for joining specific cults, changing one's abilities, spells, resistances and even modify combat abilities. Various Demon-Lords (Juiblex, Yeenoghu and Zuggtmoy specifically) also offer an 'equal penalty' for intelligence, wisdom & charisma (though Yeenoghu leaves 'wisdom' untouched) - and this penalty can be quite severe. Given a loss of four to eight points many otherwise-enthusiastic cultists are left quite mindless, which is the point of the cult, story-wise. But what is the minimum? Inquiring minds want to know:  Cultists: Just how stupid can they get? Low-Ability History: Player Characters in 5e may have a minimum of three and maximum of twenty for any ability score. Note that previous editions even had negative ability scores, especially charisma (this gave fear-aura abilities) - but such a mechanic is not in 5e. Many automatons, oozes and slimes in the first edition of  had 'non-intelligent' or a zero-intelligence score - but with 5e even  have a surprisingly clever score of 3. Even 'utterly mindless' (i.e. 'actually devoid of all brain-matter') undead non-player  only have a penalty of -4 (DM's Guide p.282). So, just to specify &/or reiterate: Do cultist-creatures (humanoid or otherwise) have a minimum intelligence score, if any? Reason for asking: Many spells focus easily on targets with low ability scores, especially those with low wisdom - this would change game-play. Also, if any creature's lowest score was below that of a , the target may enter a non-ambulatory &/or . If this reduction were allowed to go below zero, one must assume instant death for any such gormless person joining such cults (this is a very possible and reasonable ruling - demonic cults are not known for their kindness nor protection of specific minorities). Thus, any rulings - even  ones - would be welcome.

D&D 5E does not seem to have rules for ability score damage (that I could find), although it does mention that if CON is decreased, your maximum HP is reduced. In addition, the Shadow monster in the Monster Manual has a Strength Drain attack that deals 2 Strength damage. The attack says that if a character's Strength reaches 0, the character dies. Are there any general rules for ability damage in 5th Edition?


For eg. set "var" "value"  This will always be in the same order. I am using "(.+?)" to get "var" and "value". But I only want to match this only when it starts with "set". base "as" "asd" - Should not match set "as" "asd" - Match and return ("as", "asd")

I have several strings in the rough form:  [some text] [some number] [some more text]   I want to extract the text in [some number] using the Java Regex classes.  I know roughly what regular expression I want to use (though all suggestions are welcome). What I'm really interested in are the Java calls to take the regex string and use it on the source data to produce the value of [some number].  EDIT: I should add that I'm only interested in a single [some number] (basically, the first instance). The source strings are short and I'm not going to be looking for multiple occurrences of [some number].


How to partition active memory in Ubuntu ?  These are the details :-      I want to make partition just like windows of this 465 GB harddisk. How can I make it ?

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


What is the principle of sorting is used in Python?  >>> dict = {'a':'paul', 'b':'max', 'c':'bill'} >>> dict {'a': 'paul', 'c': 'bill', 'b': 'max'}   Why not?  {'a': 'paul', 'b': 'max', 'c': 'bill'}

Here is the dictionary I have  propertyList = {     "id":           "int",     "name":         "char(40)",      "team":         "int",     "realOwner":    "int",      "x":            "int",     "y":            "int",      "description":  "char(255)",      "port":         "bool",     "secret":       "bool",     "dead":         "bool",     "nomadic":      "bool",      "population":   "int",     "slaves":       "int", }   But when I print it out with "\n".join(myDict) I get this  name nomadic dead port realOwner secret slaves team y x population id description   I know that a dictionary is unordered but it comes out the same every time and I've no idea why.


The all-aluminum frame bike will be cheaper.  The aluminum fork should be more robust and less prone to breakage.  The carbon fork will be more shock absorbing and comfortable.  That's kind of how I see the basic trade off.  Given that I like to ride a touring bike with wide tires (25 to 28 mm) and I use low pressure, I am wondering if I would feel any comfort benefit at all from the carbon fork.  And, should just go for the aluminum one.    Is that how you see it?

I have noticed many bikes for sale that are made of mostly one material, such as aluminum, except for the fork which is carbon. I know carbon is very expensive so the manufacturer must be trying to use a little bit in the best possible place. So, if for a certain price point they can choose only one part to be carbon, why the fork? What are the advantages of carbon forks?


Assume that $f(z)$ is analytic on the open unit disk and continuous on the boundary $|z|=1$ with $|f(z)|=1$ if $|z|=1$. Show that $f$ is a rational function.     My attempt:  Since $f$ maps the boundary of the unit disk to the boundary of the unit disk, we can compose $f$ with some conformal map $\varphi$, such that $F\colon=\varphi^{-1}\circ f\circ\varphi$ maps the upper half-plane to the upper half-plane and preserves the real axis. For example, we may set $$ \varphi(z)=\frac{z-i}{z+i} .$$ Therefore, we can extend $F$ to an entire function with $F(z)=\overline{F(\bar z)}$ if $z$ lies in the lower half-plane.   Now it suffices to show that $\infty$ is a pole then we invoke that every meromorphic function on $\overline{\mathbb{C}}$ is a rational function to conclude. But I am stuck... Any help?    Edit:  Can we claim that $$\lim_{z\to\infty}F(z)=\lim_{z\to x_0}z=x_0$$ where $x_0\in\mathbb R\cup\{\infty\}$ by tracing the images of the point which goes to infinity?

Let $A \subset \mathbb{C} $ be an open set containing the closed unit disc. Let $f$ be an analytic function from $A$ to $\mathbb{C}$ such that $|f(z)|=1$ if $|z|=1$.  Does it follow that $f(z) = a z^{n} \frac{cz^{m}-b}{1-cz^{m}\bar{b}} $ for some $a,b,c \in \mathbb{C}$ s.t. $|c|=1$ $|a|=1$, $|b|<1$ and some $n,m\ge 0 $?


We all know why there are 3-base codons, and why there aren't any 2-base codons. But why is there not a 4-base a 5-base codon?

Does someone know why DNA is composed of four nucleobases? In particular, is there an explanation for the number? Why four and not two, or eight?


What are the regulations for making a controlled and monitored fire made with the intent of cooking/heating while camping in Iceland?

I am currently traveling in Iceland and it seems that most campsites do not allow campfires. Are there any campsites in Iceland that allow campfires? If so, how can I find them? Any resource links would be greatly appreciated.


I received few thousands from glamour rewards, it's cash back when I buy some stuff in the internet. My question is do I need to pay tax for that money? I didn't received any 1099 form, I guest I don't need to pay tax for that, but I am not sure, thanks and I appreciate any help.

I have a Discover credit card that pays 1% cash back on and 5% on select categories. My question is: why isn't that cash back "bonus" taxed when stuff like canceled debt (1099-C), interest (1099-INT), etc, is?  I mean, I'm glad that it isn't taxed lol but it just kinda feels strange that it isn't.


Prove that for every set $A$, there exists and ordinal $\alpha$ which does not have surjective function from $A$ over $\alpha$: $$(\forall A)(\exists \alpha)[\lnot(\vert\alpha\vert\leq^*\vert A\vert)]$$ We say that  $\vert A\vert\leq^*\vert B\vert$ if there is surjection from $f:B\to A$. I am trying to solve this problem but I get completely lost in what I have to do. Set theory is a new thing for me and it is really hard how to begin. I would be very thankful is someone gives me a direction from where to start or any ideas on how to solve this problem. Thank you in advance!

Some observations.  The statement can easily be proven in $\mathsf{ZFC}$, but we do not assume that $\mathsf{AC}$ holds.  If one proves that $S=\{\beta \mid \text{there is a surjection $A\to    \beta$}\}$ is a set, the statement follows by taking $\alpha=\sup S$.  An obvious candidate would be $\alpha=h(A)$, the Hartogs number of $A$.   All my attempts to prove the statement required some form of $\mathsf{AC}$. I'm starting to wonder if the statement can be proven in $\mathsf{ZF}$.


My gamecard has been missing for quite some time, and from the announcement of splatoon 3 ive wanted to play it more than ever, but I cannot find this card. i've gotten very far in the game though - if I buy a replacement gamecard, will i be able to pick up where I left off using game data from the switch or is this not possible?

A friend lent me his copy of Mario + Rabbids to play on my own Switch. I ended up enjoying it a lot and I want to buy my own copy, but I don't want to lose my progress.  If I buy a separate physical or digital copy of a game, will I still be able to play with my save file?


In Rudin's Principles of Mathematical Analysis (3rd ed), he proves (at the very beginning: example 1.1) that the set $A$ of all positive rationals $p$ such that $p^2<2$ contains no largest number and the set $B$ of all positive rationals $p$ such that $p^2>2$ contains no smallest number.   To show this, he starts by associating with each rational $p>0$, the number $q=p-(p^2-2)/(p+2) = (2p+2)/(p+2)$. And thus $q^2-2=2(p^2-2)/(p+2)^2$.   My question is actually simple: from where does he get the expression for $q$ and how does one get the intuition to come up with the form of the number $q$?

First, my apologies if this has already been asked/answered.  I wasn't able to find this question via search.  My question comes from Rudin's "Principles of Mathematical Analysis," or "Baby Rudin," Ch 1, Example 1.1 on p. 2.  In the second version of the proof, showing that sets A and B do not have greatest or lowest elements respectively, he presents a seemingly arbitrary assignment of a number $q$ that satisfies equations (3) and (4), plus other conditions needed to show that $q$ is the right number for the proof.  As an exercise, I tried to derive his choice of $q$ so that I may learn more about the problem.  If we write equations (3) as $q = p - (p^2 - 2)x$, we can write (4) as   $$ q^2 - 2 = (p^2 - 2)[1 - 2px + (p^2 - 2)x^2]. $$  Here, we need a rational $x > 0$, chosen such that the expression in $[...]$ is positive.  Using the quadratic formula and the sign of $(p^2 - 2)$, it can be shown that we need   $$ x \in \left(0, \frac{1}{p + \sqrt{2}}\right) \mbox{ for } p \in A, $$  or, for $p \in B$, $x < 1/\left(p + \sqrt{2}\right)$ or $x > 1/\left(p - \sqrt{2}\right)$.  Notice that there are MANY solutions to these equations! The easiest to see, perhaps, is letting $x = 1/(p + n)$ for $n \geq 2$.  Notice that Rudin chooses $n = 2$ for his answer, but it checks out easily for other $n$.  The Question:  Why does Rudin choose $x = 1/(p + 2)$ specifically?  Is it just to make the expressions work out clearly algebraically?  Why doesn't he comment on his particular choice or the nature of the set of solutions that will work for the proof?  Is there a simpler derivation for the number $q$ that I am missing?


I am missing something small here, and cannot for the life of me figure it out. I am trying to overwrite a dictionary value at a specific index. So for example:  dict={} values1 = [5,10,20] values2 = [30,40,50] dict['key1'] = values1 dict['key2'] = values2 print(dict['key1']) print(dict['key2']) dict['key1'][1] = 15 print(dict['key1']) print(dict['key2'])   returns:  [5, 10, 20] [30, 40, 50] [5, 15, 20] [30, 40, 50]   Exactly as expected, it overwrote the first key, and index 1 with 15, perfect.  So why does this code below not work the same??  technicianOutput={} monthNumList = [2,3,4,5,6] zeroList = [] staffList = ['joe blow', 'john doe'] for x in range(len(monthNumList)):     zeroList.append(0) for tech in staffList:     technicianOutput[tech] = zeroList print(technicianOutput) technicianOutput['joe blow'][0] = 1 technicianOutput['john doe'][1] = 1 print(technicianOutput)   returns:  {'joe blow': [0, 0, 0, 0, 0], 'john doe': [0, 0, 0, 0, 0]} {'joe blow': [1, 1, 0, 0, 0], 'john doe': [1, 1, 0, 0, 0]}   I am expecting:  {'joe blow': [0, 0, 0, 0, 0], 'john doe': [0, 0, 0, 0, 0]} {'joe blow': [1, 0, 0, 0, 0], 'john doe': [0, 1, 0, 0, 0]}

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


I need to positionate every single digit of a number in some positions, (i.e. 1234,35 euros) in single cells of a module. How  I can refer to single digit? Thank you.  I wish to do something like this :

I want to create a   How can I create a formfield with N fields, each 5 mm wide with separations like in the picture?    At the moment I use a workaround with a for loop, but this renders the code hard to maintain. Finally I need a function \formline{N}{cellwidth}{label}{value} to create the complete formfield and fill it with an optional value:   The following code is available on .   \documentclass[a4paper,11pt]{article} \usepackage[utf8]{inputenc} \usepackage{tikz} \usetikzlibrary{shapes}  \thispagestyle{empty} % no pagenumber. The form should be a stand alone macro... later.  \definecolor{SEPAOrange}{RGB}{254,213,161} \definecolor{SEPADOrange}{RGB}{253,185,19} \definecolor{SEPABlindcolor}{RGB}{255,0,0} \begin{document} \begin{tikzpicture}[x=1 mm, y=-1mm] \pgfmathsetmacro{\yh}{4.2333} % y heigth step defined as 1/6 inch => 1/6 * 25.4 mm = 4.2333 mm \pgfmathsetmacro{\xs}{9} % x start (own definition) \pgfmathsetmacro{\xe}{141.5} % x end (own definition) \pgfmathsetmacro{\widefield}{4.9859} % def: 134.62 mm / 27 \pgfmathsetmacro{\narrowfiels}{3.9594} % def: 134.62 mm/ 34  \filldraw[draw=black,color=SEPAOrange] (7.62, 4.5*\yh) rectangle (149.86-7.62,105.83-1); %orange background  \filldraw[draw=black,color=white] (\xs, 5*\yh) rectangle (\xe, 6.5*\yh -1.5); %Recepient 27 Char \foreach \x in {1,...,26} {  \draw[color=SEPAOrange, line width=0.3mm] (7.62 + \x*\widefield, 5*\yh ) -- (7.62 + \x*\widefield, 6.5*\yh);  \draw[color=SEPAOrange, line width=0.7mm] (7.62 + \x*\widefield, 5.8*\yh ) -- (7.62 + \x*\widefield, 6.5*\yh); }  \filldraw[draw=black,color=white] (\xs, 7*\yh) rectangle (\xe, 8.5*\yh -1.5); %IBAN 34 Char \foreach \x in {1,...,33}  \draw[color=SEPAOrange, line width=0.3mm] (7.62 + \x*4, 7*\yh ) -- (7.62 + \x*4, 8.5*\yh);  \filldraw[draw=black,color=white] (\xs, 9*\yh) rectangle (\xe, 10.5*\yh -1.5); %BIC \filldraw[draw=black,color=white] (\xe-12*5, 11*\yh) rectangle (\xe, 12.5*\yh -1.5); %Value 12 Char  \filldraw[draw=black,color=white] (\xs, 13*\yh) rectangle (\xe, 14.5*\yh -1.5); %Subject1 \filldraw[draw=black,color=white] (\xs, 15*\yh) rectangle (\xe, 16.5*\yh -1.5); %Subject2 \filldraw[draw=black,color=white] (\xs, 17*\yh) rectangle (\xe, 18.5*\yh -1.5); %Subject3  \filldraw[draw=black,color=white] (\xs, 19*\yh) rectangle (\xs+22*5, 20.5*\yh -1.5); % IBAN 22 Char  \filldraw[draw=black,color=white] (149.86-17.59, 19* \yh) rectangle (\xe, 20.5*\yh -1.5); % counter \filldraw[draw=black,color=white] (\xs, 21* \yh) rectangle (42.52, 24.5*\yh); % date \filldraw[draw=black,color=white] (42.52+5, 21*\yh) rectangle (149.86-17.59, 24.5*\yh); % signature  \draw[color=SEPADOrange] (0, 4.5 *\yh) --(149.86, 4.5*\yh); upper dark orange line \draw[color=SEPADOrange] (0, 20.5 *\yh) --(149.86, 20.5*\yh); lower dark orange line \draw[draw=black,color=black, line width=0.3mm] (0,0) rectangle (149.86,105.83); % black border %\draw[align=left] at (\yh,\yh) {SEPA-Überweisung};  \end{tikzpicture} \end{document}


I am learning about electronics and micro controllers. I started with the basics and have came to the chapter in my book about currents etc. Now, I am a little confused with voltage and amperage. Am I correct in thinking the amount of amps is the amount of power, and the amount of voltage is the speed at which the power is sent? So if I have a 1A 1V charging port, and a 1A 2V charging port; the second will charge the device quicker? If so what happens if I put this up to 2A 2V?

A man asked me this question in suburban train when I told him that I am an electrical engineer. Of course I replied him that current is the flow of electrons and in order for the current to flow there should be a potential difference between them. But the man didn't know what electron or potential difference was either.


I have video.mp4 only file, and audio.m4a file. I need to merge them both, and I need the output to be the same video without creating new resolution or modifing caracteristics.  OS: windows 10  Thank you.

I want to merge an audio file (.wav or .au format) with a video file (.mp4 format).  Please suggest me how to achieve this. I want to merge these file to new .mp4 video file. An ffmpeg command would be very welcome.


I deleted 11 rows and I want the auto increment id values to reset to 6,7,8,9 … How can I achieve that without using the update statement each row one at a time. I want to find out if there is a way to avoid this sort of issue in the beginning when creating the database.

I have a table which contains an auto incremented primary key id. If I delete the last row (highest id, for exampe id = 6) and insert a new row, the new id starts at 7. Which paramater I have to change that the primary key starts at 6?  CREATE TABLE animals (  id MEDIUMINT NOT NULL AUTO_INCREMENT,  name CHAR(30) NOT NULL,  PRIMARY KEY (id) ) ENGINE=MyISAM;  INSERT INTO animals (name) VALUES ('dog'),('cat'),('penguin'), ('lax'),('whale'),('ostrich');   Result: id  name 1   dog 2   cat 3   penguin 4   lax 5   whale 6   ostrich    DELETE FROM animals WHERE id = 6; INSERT INTO animals (name) VALUES ('x');   Result: id  name 1   dog 2   cat 3   penguin 4   lax 5   whale 7   x    Thanks for advice.


As you can see, it starts bugging up, it's pretty hard to explain it, but look at the picture.  Demo:     Markdown:  **http://url.com/user?u=__username__**

In the answer , the parser breaks my URL link.  The URL was with __word__:      http://www.open-mpi.de/projects/hwloc/doc/v1.2/group__hwlocality__membinding.php#gade5e2c28ea8475a479bf2b1df36c6ccd   After parsing, it becomes (<a href is broken; no clickable link):  hwlocality_membinding.php#gade5e2c28ea8475a479bf2b1df36c6ccd">http://www.open-mpi.de/projects/hwloc/doc/v1.2/group_hwlocality_membinding.php#gade5e2c28ea8475a479bf2b1df36c6ccd   Short test:  http://example.com/_test_ -> test">http://example.com/test  Or if I put in a naked URL with _test_ just here:


I've installed Ubuntu on my laptop but didn't know that my windows OS would be removed (even tho it says so while doing this process!!!) <--Had to say this, sorry :/   ...Just a Drone after all...  Now I've been trying to reinstall windows with Ubuntu already installed.  I've tried a lot of way's but I couldn't fix it. (Go figure)  (Blame the other guy) That's it :) My problem is the same as this person (Check the link)   Again when I try this step /etc/apt/sources.list.d I can not see the file colingille-freshlight-.. as u can see on the photo

I'd like to create a Windows bootable USB stick, but I don't have a Windows machine with me at the moment to do so. How could I achieve the same using Ubuntu?


Why does logistic regression not converge for a linearly separable data set?   For linear separable data sets the model parameters go to infinity when mimizing the error function (according to Bishop2006, Pattern recognition and machine learning, section 4.3.2). I don't understand why. It must be connected to setting the score function, i.e. the derivative of the error function, to zero.  The error function is given by $E(\mathbf{w})$ as shown in the figure below. Where $\mathbf{t}$ is the target variable vector of the training set and $\mathbf{w}$ the parameter / coefficient vector. The posterior probabiltiy for class 1 is given by  $$y(n) = p(C_1|\mathbf{x}_n) = \sigma(\mathbf{w}'\mathbf{x}_n).$$ Where sigma is the logistic sigmoid function and $\mathbf{x}_n$ is the feature vector for instance $n$ including the predictors.     My second question to logistic regression is if the to posterior probabilities $p(C_1|\mathbf{x}_n)$ and $p(C_2|\mathbf{x}_n)$ sum to one?

If you have a variable which perfectly separates zeroes and ones in target variable, R will yield the following "perfect or quasi perfect separation" warning message:  Warning message: glm.fit: fitted probabilities numerically 0 or 1 occurred    We still get the model but the coefficient estimates are inflated.   How do you deal with this in practice?


My question is about sources for start the study of algebraic geometry. I know that it requieres so much algebra, but, is there any book which can be readed without many tolos of modules, Galois, etc?, or any source i can find in this área contains a lot of things that lies in the algebra field?  Thanks.

I tried to learn Algbraic Geometry through some texts, but by Commutative Algebra, I left the subject; many books give definitions and theorems in Commutative algebra, but do not explain why it is needed.  Can one suggest a good reference to learn this subject geometrically, which would also give ways to translate geometric ideas in algebraic manner, possibly through examples?  Particularly, I am interested in differentials on algebraic curves, Riemann-Roch theorem, various definitions of genus and their equivalences, and mainly groups related to complex algebraic curves such as group of automorphisms, monodromy group etc.


I know this question has been asked before, but these questions were asked back in 2011-12 and the answers may be outdated in 2019? I have just started using Ubuntu Desktop 18.04 LTS and have subscribed to Ubuntu One and I am not sure where to post feedback or feature requests to Ubuntu where they will be seen and considered by developers?

Where can I send feature requests? Both for Ubuntu as a whole and individual (supported) apps?


My Macbook Pro ran into a problem and reported Error: -50.  I cannot open applications such as Chrome, Word, and others.  I cannot download content or move content to the trash because it says the disk is full, even though it still shows 80Gb of free storage.  The Ram is free and I cannot run ClamXav to see if it is a virus.  Disk Utility verifies the disk but the permissions have all changed and cannot be repaired.  Some permissions errors include "user differs on private/var/at, should be 0 user is 1"as well as various others.  I cant even see/open external drives I connect.  Any idea how to solve this problem?

I'm using an old iBook G4 (PowerPC) running Tiger to serve iTunes to the house. For the past week or so, the mac boots fine, and then sometime during the day starts generating   An unexpected error occurred (error code -50).   errors when iTunes attempts to save its library file.  Checking reveals that the boot drive (main drive, in the laptop) behaves as if it is write-protected - I get the same error code when I attempt to create a folder on the desktop, for instance. If I attempt to create files via the terminal, e.g. via     ls > foo.txt I get an "invalid argument" error.   I've set the iBook to run in Target Disk Mode and run Disk Utility to repair the disk (from a Macbook running Snow Leopard) and get "The volume appears to be ok".   I don't have the option in Disk Utility to Repair Permissions in Target Disk Mode. When I ran Repair Permissions on the iBook itself, it came back with no errors, no permissions corrected, but did not in fact fix the problem.  Rebooting always solve the problem - for the next 5-10 hours or so.   Would Disk Warrior help, or some other software fix, or is it time to buy a new drive? (And, in any case, what's going wrong?)


I have read that the charges in a conductor at most can move to the outer surface (unless provided a conducting path) and cannot go to the outer insulating region. My question is which force stops electrons from flying out? (Say we talk about excess charge on the surface or polarised conductors)

Imagine a negatively charged conductor in a vacuum. The excess electrons will be spread out over the surface such that the net electric field inside the conductor is zero.  What keeps these extra electrons bound to the conductor?   For the case of a neutral conductor, I could intuitively understand some sort of Coulomb force being responsible. But for a negatively charged conductor, I don't understand what (net?) positive entity is exerting the attractive force.   Is there an explanation based only on classical electrodynamics (say, at the level of Jackson). If not, is the explanation purely quantum mechanical?   Basically, how does one model this phenomenon?


Does anyone know how to open Preview.app with the window maximised by default, in order to automatically fit the screen?  Right now, the Preview window opens almost half screen and I think it is quire annoying to enlarge it manually. Thanks.

Whenever I start an application like Terminal or Preview, they are always opened as a small window on the top left corner of the screen. Is there any way to set them to open in the center of the screen? Preferably maximized too?


Let $G={\rm \mathit Aut} _\mathbb{Q} (\mathbb{C})$ be the automorphism group.  $K \subset \mathbb{C}$ is defined as $K =\ \bigr\{ \alpha \in \mathbb{C} \  |\  \sigma(\alpha) = \alpha \ ( \forall \sigma \in G)\bigl\}$ .  Then $K= \mathbb{Q} \ $ is true??

Let $Aut(\mathbb{C}/\mathbb{Q})$ be the field automorphisms of $\mathbb{C}$, and $\mathbb{C}^{Aut(\mathbb{C}/\mathbb{Q})}$ the subfield of $\mathbb{C}$ fixed by this group. I supsect that it is equal to $\mathbb{Q}$ but I have difficulty proving it.  Here is what I do : let $x \notin \mathbb{Q}$. We have to find an automorphism not fixing $x$. It is easy to find an embeding $\mathbb{Q}(x) \rightarrow \mathbb{C}$ not sending $x$ on $x$, and use Zorn's lemma to extend it to a maximal subfield (of $\mathbb{C}$) $K \supset \mathbb{Q}(x)$. But it is not true that $K=\mathbb{C}$. So how to handle it ?


I got a question in my mind that: What the difference  1) List list = new ArrayList() 2) List list = new LinkedList() ? No matter I initialize list in the both way above, still it can only use method in List, but not either ArrayList or LinkedList, isn't it?  I read from a website (), stated that it is known as "programming to an interface", which easy for a developer to change from ArrayList to LinkedList or vice versa in future. But no way for me to use method of ArrayList/LinkedList if I initialized in the way shown above, even it is flexible to change the way of initialize. I believe there is a reason. Hope to find answer for it.

I've always been one to simply use:  List<String> names = new ArrayList<>();   I use the interface as the type name for portability, so that when I ask questions such as these I can rework my code.    When should  be used over  and vice-versa?


What is the difference between the following two class implementations  function Animal() {   this.feed = function () {   } }   function Animal () { }  Animal.prototype.feed = function () { };   I tried creating both the function but both worked in a similar way.

What's the difference between  var A = function () {     this.x = function () {         //do something     }; };   and  var A = function () { }; A.prototype.x = function () {     //do something };


I have a list with a lookup column in it. (name: colParent)  I can query the list with Eq, and get the correct results (2 results returned for 224).  <Eq>   <FieldRef Name='colParent' LookupId='TRUE' />   <Value Type='Lookup'>224</Value>  </Eq>   However, I do the same query with "In", and get no results.  <In>   <FieldRef Name='colParent' LookupId='TRUE' />   <Values>     <Value Type='Lookup'>224</Value>   </Values> </In>   (in the actual query, there will be multiple lookup Ids, so I need to use "In")  What's even weirder - this list is in a SP-hosted app that I developed. I installed the app in 2 sites.  The "In" query works in one, but not in the other. So the query should be correct, its just not working in one site.  Any ideas?  I'm going crazy over this one.

I want to build a CAML - Query using the IN - Tag. The queried Column is a lookup-field to a Title of another list. When I query using the text-property everything works fine:     <Where>       <In>          <FieldRef Name='page' />          <Values>             <Value Type='Lookup'>page1</Value>             <Value Type='Lookup'>page2</Value>             <Value Type='Lookup'>page3</Value>          </Values>       </In>    </Where>   This is giving me the wanted result: All rows with Lookups to page1, page2 oder page3 are returned.  When I try to achieve this using the IDs instead I get no results at all:  <Where>       <In>          <FieldRef Name='page' LookupId='True' />          <Values>             <Value Type='Lookup'>5</Value>             <Value Type='Lookup'>4</Value>             <Value Type='Lookup'>3</Value>          </Values>       </In>    </Where>   I rechecked the IDs a dozen times. They are correct. When I change the query to multiple OR-Operations it works fine.  Is this a known limitation of SharePoint 2010 or do I just have to insert a "magic" word somewhere?


I have been getting following error while running  sudo apt-get update  W: GPG error: https://download.01.org trusty InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY A902DDA375E52366 E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/security.ubuntu.com_ubuntu_dists_trusty-security_main_i18n_Translation-en E: The package lists or status file could not be parsed or opened.   What should I do to fix this problem?    Also sometimes I get a red icon in the Task Bar pane.

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


How to init constant integer array class member? I think that in same case classic array isn't best choice, what should I use instead of it? class GameInstance{     enum Signs{         NUM_SIGNS = 3;     };     const int gameRulesTable[NUM_SIGNS][NUM_SIGNS]; //  how to init it? public:     explicit GameInstance():gameRulesTable(){}; };

I have the following class in C++:  class a {     const int b[2];     // other stuff follows      // and here's the constructor     a(void); }   The question is, how do I initialize b in the initialization list, given that I can't initialize it inside the body of the function of the constructor, because b is const?  This doesn't work:  a::a(void) :      b([2,3]) {      // other initialization stuff }   Edit:  The case in point is when I can have different values for b for different instances, but the values are known to be constant for the lifetime of the instance.


There is defined     Z[i] = {a+bi|a,b $\in$ Z}  with standard operations of addition and multiplications complex number. Question is, if factor ring Z[i]/(1-i) is field. How could I prove it? Do you have any hint?

I'm trying to show that $\langle1-i\rangle$ is a maximal ideal of $\mathbb{Z}[i]$.  I started by assuming there is some ideal $A$ that properly contains $\langle1-i\rangle$, and then I want to show that $1 \in A$, and then I will have that $A= \mathbb{Z}[i] $, so $\langle1-i\rangle$ is maximal.  Is this the right approach?  Thanks  Second Attempt: Because $\forall a+bi \in \mathbb{Z}[i]$, we have $a+bi = (a+b) -b(1-i)$, then we have $a+bi - (a+b) = -b(1-i) \in \langle1-i\rangle$, which implies $a+bi +\langle1-i\rangle = a+b +\langle1-i\rangle$.  So every coset is of the form $c +\langle1-i\rangle$, where $c\in \mathbb{R}$.  Furthermore, $-i(1-i)^2=2 \in \langle1-i\rangle$. Write $c = 2q + r$, where $q,r\in \mathbb{R}$ and $r=0,1$.  Then because $2 \in \langle1-i\rangle$, we have $2q\in \langle1-i\rangle$ and therefore $2q= 2q+r-r = c-r\in \langle1-i\rangle$, so $c+\langle1-i\rangle = r+\langle1-i\rangle$, and every coset is of the form $0 + \langle1-i\rangle$ or $1 +\langle1-i\rangle$. Thus, $1 +\langle1-i\rangle$ is the only nonzero element, and is invertible with itself as its inverse.  Thus, $\mathbb{Z}[i]/\langle1-i\rangle$ is a field with two elements, and by a theorem, $\langle1-i\rangle$ must be maximal.  Is this correct?


In EveryCircuit, they have a component called a "Current Source". For example, here is a circuit I've created with a 2A current source:    Is there a such thing as a 'current source' in the real world, or is this an abstract component that helps one regulate current (for example, without having to do a voltage source + resistor).

What I understood from the definition of current sources is that it is a source which supplies a constant current across a load no matter how the other parameters (like resistances for example) in the circuit are changed. Am I right?  If I'm right, what is an example of a current source used in a practical circuit?   Wikipedia gave the example of a  as a constant current source. (I didn't read the article, because there was a note that the section appeared to contradict itself. I didn't want to get confused.)  I can think of voltage sources - for example a battery which has a constant potential difference across its ends irrespective of the changes in the circuit it is connected to, but I cannot think of a current source. Any example I can think of involves change in the current when the resistances are changed.


I need to alter the post_per_page value of the displayed products.  In your opinion is possible to achieve this using a param added to the url? Something like www.siteurl.com/shop/?post_per_page=xx  Thanks to everyone.

So I made some custom posts and taxonomies..  http://example.com/?product_category=mytaxonomyterm&lang=it  Till here, all fine: I get a 'mytaxonomyterm' taxonomy archive. Btw, lang is because I'm using polylang plugin.  If I try to add &posts_per_page=15 to url, it doesn't work: it won't change number of post.   Even worse, if I add paged=1, It will reload into  http://example.com/?product_category=mytaxonomyterm&lang=it (so stripping the page param).  Even worse, if I add paged=1, it will throw an error telling me that there's an error in post-template.php on line 279, 'Trying to get property of non-object'.  So what? What am I doing wrong?


I've come across this oddity while perusing the Physics stack. The linked question is , being that due to the dollar signs on both sides, MathJax was triggered. I'm not sure if this is intended behavior, hence the post.  Oddly enough, after trying several times (reloading the page, visiting other pages), I was unable to reproduce the issue.  Related:

Recently, the TeX.SE question  got onto the Hot Network Questions list.  Like many questions on TeX.SE, it contains some TeX markup in its title.  Unfortunately, on , this markup gets parsed and rendered as math:    I propose that either:   the entire Hot Network Questions sidebar should be excluded from MathJax parsing by styling it with the tex2jax_ignore class, or at least, any hot questions from TeX.SE should be so excluded from MathJax parsing.   Or I suppose we could always implement , which asks for all questions with TeX in the title to be excluded from Hot Network Questions entirely.  That might be throwing out the baby with the bathwater, though.    Ps. This issue is partially masked by , which causes MathJax not to be rendered in many elements that are hidden by default and revealed using jQuery .show(), such as all but the first five questions in the Hot Network Questions sidebar.  The  user script contains a generic fix for that bug, so users who have it installed will see this issue more frequently, but it occurs even without SOUP whenever a question with TeX markup in the title happens to show up among the top five hot questions that are always visible by default.


I am a programmer, i have a old laptop with the same configuration as below: cpu Core 2 duo Intel T5870 2GHz, Ram 1GB. Can i use Ubuntu version for my work ? Thanks for help!

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


Which pronoun best completes the sentence? Every woman received ____ prize. Is it her or their? Please explain

After the therapy, eight children (43%) became able to crawl/move on their back.   Or should I use "on their backs"?   Singular because each child only has one back, or plural because we're dealing with eight backs?


Today I noticed that the list of recent badges in the sidebar (visible when HNQ is de-activated, or on the  pages) lack spacing between the badges themselves. The spacing between the users who obtained the badges looks appropriate, but the spacing between the different badges is missing. Desired behaviour would resemble that of the tags that are listed in the upper half of below screenshot.

When the "Hide Hot Network Questions" preference is enabled (i.e. HNQ sidebar is hidden), we see "Recent Tags" and "Recent Badges" in the homepage instead of the HNQ. However, the "Recent Badges" list is displayed with no margins. ex.)   I think that the appropriate margins were set in the past. cf.)


In the Android App one can pin sites to the left tray menu. Unfortunately the view for selecting sites is mostly... empty space.

There is some unwanted extra spaces in between each site in the Your Sites section.  Steps to reproduce:   Touch the Nav Icon in the left top corner Touch the EDIT link in YOUR SITES Scroll the screen; there is unwanted spaces in between the each site   For reference I recorded the same:    Configurations:   App Version: 1.0.85 Device Manufacturer: Motorola Device Model: XT1033 OS Version: 5.1 (2)


I have mounted an NFS network share successfully using Webmin.  The share seems to be mounted correctly and working correctly.  If I login as root I can browse the share just fine.  However, I cannot seem to give another user access to read/write to this network share.  When I look at the permissions I can see that it is owned by root and the group crontab can use the share.    $ ls -las  4 drwxr-xr-x   3 root root    4096 Nov 11 23:35 . 4 drwxr-xr-x  23 root root    4096 Nov 11 23:35 .. 8 drwxrwx---+ 23 root crontab 4096 Feb 15  2013 private   So just to test thing out, I added crontab to my user scott.  $ groups  scott adm cdrom sudo dip plugdev crontab lpadmin sambashare   however I still can't access the share.  $ cd private/  -bash: cd: private/: Permission denied   Any ideas?

The situation: I simply want to be able to access a Synology NAS from an Ubuntu Server with a non-root user.  On the NAS I have this in the exports-file:  /Directory <client-ip>/255.255.255.0(rw,async,no_wdelay,no_root_squash,insecure_locks,sec=sys,anonuid=1003,anongid=1004)   On the Ubuntu-Server in fstab I got this:  <server-ip>:/Directory  /Mountpoint nfs noauto,user,rw 0 0   Now I want to allow UserA, which is used for some automatic processes to mount the share and write to it.  mount /Mountpoint   Mounting as UserA works fine, but I have no permission to even read what's in the directory. As user root I do. Listing the mountpoint folder shows these permissions:  drwxrwx--- 4 UserA root 4096 Sep 17 13:58 Mountpoint   I tried to set the anon-ids in the exports to the ids of UserA, but that didn't help. Making UserA the owner of the folder didn't help either. Is there a simple thing I am missing?  Also: This needs to be an nfs share as it will transfer large amounts of data.  Edit: I would prefer to avoid giving read and write permissions to "others" for security reasons.


I'm not sure if there's been a change to the tabu package, but in recompiling docs I've written before, vertical alignment of tabu cells no longer places content in the middle. For example,  \begin{tabu} to\textwidth {|X[c m]|X[m,c]|X[m,c]|}     Hello & World & Long sentence that wraps around... \end{tabu}   simply places all of the cell content at the very top. I've been able to hack around it by placing the cell content in a varwidth environment but it's incredibly taxing. I don't see any mention of a change to the package that would lead to this; have I always been doing this wrong?

After MIKTEX package updates vertical m-column alignment in tabu does not work anymore. See MWE below  \documentclass{article} \usepackage{tabu}  \begin{document}  \tabulinesep=3pt   Result using tabu:  \begin{tabu} to \linewidth {|X[p]| X[m]| X[b]|}     \hline     \centering header p &     \centering header m &        \centering header b \tabularnewline     \hline     text which is considerably longer than the width of the column  &      text which is considerably longer than the width of the column  &      text which is considerably longer than the width of the column      \tabularnewline     \hline \end{tabu}  \vspace*{1cm}  Result using tabular:  \begin{tabular}{|p{0.3\linewidth}|m{0.3\linewidth}|b{0.3\linewidth}|}     \hline     \centering header p &     \centering header m &        \centering header b \tabularnewline     \hline     text which is considerably longer than the width of the column  &      text which is considerably longer than the width of the column  &      text which is considerably longer than the width of the column      \tabularnewline     \hline \end{tabular}   \end{document}   The results is:   Both tables should be equal but m-column in tabu is broken.Does anyone know which package is responsible for that? Here is the list of packages that were updated:


I need to loop through an ArrayList of objects and add their ImageViews to my main Group which is root in the code below. This is what I came up so far but still not working. Any idea?  for (int i = 0; i < myList.size(); i++) {     ImageView ii =myList.get(i).imageView;     root.getChildren().remove(bGroup);     Group bGroup = new Group();     bGroup.getChildren().add(ii); //NullPointerException     root.getChildren().add(bGroup); }

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 that the volume of a sphere is given by the triple integral $ \int_0^{2\pi} \int_0^{\pi} \int_0^r \rho ^2 \sin \phi d\rho d\phi d\theta $.   I am having trouble on how the limits for the angles are derived. Why don't they both go up to $2\pi$. Please help.

How do we get limit such as $0\le\theta\le\pi$, $0\le\phi\le2\pi$ in spherical coordinate system where $$x=r \sin\theta\cos\phi, y=r \sin\theta\sin\phi, z=r \cos\theta$$  Why is the $\theta$-limit $[0,\pi]$ and not $2 \pi$?  I think that the angle of the foot of perpendicular from the point taken in spherical coordinate can lie within $[0,2 \pi]$


I am a newbie in ML, and I am learning how to fill missing data in a dataset using Imputer. These are the few lines of code that I came across  from sklearn.preprocessing import Imputer imputer = Imputer(missing_values = 'NaN', strategy = 'mean', axis = 0) imputer = imputer.fit(X[:, 1:3]) X[:, 1:3] = imputer.transform(X[:, 1:3])   Now I am not able to understand what is the role of the fit and the transform function. It will be great if someone can help. Thank you.

I'm a newbie to data science, and I do not understand the difference between the fit and fit_transform methods in scikit-learn. Can anybody explain simply why we might need to transform data? What does it mean, fitting a model on training data and transforming to test data? Does it mean, for example, converting categorical variables into numbers in training and transforming the new feature set onto test data?


I'm not able to mathematically prove that the equation $$x(k+1)=\sin(x(k))$$ converges asymptotically to zero. By a simple thought it can be concluded that for any $x(0) \in \mathbb{R}$ it applies $x(1)=\sin(x(0)) \qquad \qquad \quad x(1) \in [-1,1]$ $x(2)=\sin(\sin(x(0))) \qquad \, \, \, \, \, x(2) \in [-0.84,0.84]$ $x(3)=\sin(\sin(\sin(x(0)))) \, \, \, \, x(3) \in [-0.74,0.74]$ ... Which means that with every step the solution is closer and closer to zero, however I'm not able to prove it. Does anyone know how to solve this problem please?

I need your help with evaluating this limit:  $$ \lim_{n \to \infty }\underbrace{\sin \sin \dots\sin}_{\text{$n$ compositions}}\,n,$$  i.e. we apply the $\sin$ function $n$ times.  Thank you.


My husband and I with 2 kids have  Iranian Canadians  Passport and now my friend in Orlando invited us to visit her As now we are in iran and we are going to visit Usa with Canadian passport from Iran. Would it be possible to enter Usa?

I am an Iranian-Canadian dual citizen studying in the US with an F1 visa. My parents are both dual citizens as well. I understand that Canadians are not affected by the recent bill placing restrictions on the Visa Waiver Program for people who are dual citizens of, or have recently visited Iran and several other countries. I have heard, however, that a separate bill which does concern the visa provisions of NAFTA is in the works.   My parents often drive me over after my breaks, so I was wondering: will they be able to cross the border on arrival without having obtained visas beforehand?


The following code does not throw ConcurrentModificationException      public static void main(String[] args)     {         List<String> l1 = new ArrayList<>();         l1.add("v1");         Iterator<String> it =  l1.iterator();         l1.remove(0);         while(it.hasNext()) {             System.out.println(it.next());         }     }   Whereas this code throws ConcurrentModificationException      public static void main(String[] args)     {         List<String> l1 = new ArrayList<>();         l1.add("v1");         Iterator<String> it =  l1.iterator();         l1.add("v2");         while(it.hasNext()) {             System.out.println(it.next());         }     }   Both operations are structural modifications of list, but why exception is thrown only in case of addition?

I am using a Collection (a HashMap used indirectly by the JPA, it so happens), but apparently randomly the code throws a ConcurrentModificationException. What is causing it and how do I fix this problem? By using some synchronization, perhaps?  Here is the full stack-trace:  Exception in thread "pool-1-thread-1" java.util.ConcurrentModificationException         at java.util.HashMap$HashIterator.nextEntry(Unknown Source)         at java.util.HashMap$ValueIterator.next(Unknown Source)         at org.hibernate.collection.AbstractPersistentCollection$IteratorProxy.next(AbstractPersistentCollection.java:555)         at org.hibernate.engine.Cascade.cascadeCollectionElements(Cascade.java:296)         at org.hibernate.engine.Cascade.cascadeCollection(Cascade.java:242)         at org.hibernate.engine.Cascade.cascadeAssociation(Cascade.java:219)         at org.hibernate.engine.Cascade.cascadeProperty(Cascade.java:169)         at org.hibernate.engine.Cascade.cascade(Cascade.java:130)


A perfect estimator would be accurate (unbiased) and precise (good estimation even with small samples).  I never really thought of the question of precision but only the one of accuracy (as I did in  for example).  Are there cases where the unbiased estimator is less precise (and therefore eventually "less good") than a biased estimator? If yes, I would love a simple example proving mathematically that the less accurate estimator is so much more precise that it could be considered better.

It's obvious many times why one prefers an unbiased estimator. But, are there any circumstances under which we might actually prefer a biased estimator over an unbiased one?


Just a quick question:  Why is it that when I write $\mathcal{full}$ the word full is not desplayed at all, instead parenthesis, product and vertical arrows come out? And when I tryed to copy that pdf output and paste it in  this window, the paste result was the word "full"?  Thanks to everyone!

amsfonts doesn't have lowercase caligraphic letters, so when you do $\mathcal{Hello World}$ you get some odd results. (Likewise for \mathbb I believe)  Now, what surprises me is not that there aren't lowercase mathcal letters, but that given this, the document compiles at all! What is going on that means that \mathcal{lowercase} is interpreted as being a string of random symbols? It seems what letter gets turned in to what symbol is constant, so this isn't just random: there's a reason why this happens as it does.  What is going on? Can some explain the details of what's happening beneath the surface that means that LaTeX interprets lowercase letters inside \mathcal as a variety of mathematical symbols?  [I don't understand enough to work out what tags would be relevant here...]


I am interested in watching Star Trek and have a few questions about doing so. Firstly, I have never watched anything with an 'old' feel to it. For some reason I just can't get into them but I hope that's not the case with Star Trek.  I have seen the first 10 minutes of 'Star Trek: The Original Series' and it was too much to for me. Is it possible to skip this series?  This order has been recommended but not sure if it's good:   Star Trek Films 1 through 6 Star Trek: The Next Generation Star Trek Film 7 Star Trek: Voyager Star Trek Films 8 through 10 Star Trek: Deep Space Nine Star Trek: Enterprise   Also do the new movies have any significant relationship with any of these previous TV series/movies? So is it possible to watch them without watching any of the rest? It seems like a completely new canon so not sure.

I haven't seen any of the stuff in the Star Trek franchise, except for one of the movies, and now I want to remedy the situation. I am not interested in the movies, just the TV series. However, since the show has many seasons, I am not interested in watching the show start to finish. So, where (i.e what series/season) should I start with? Do I really need to see the series in real-world chronological order?   Note: I am somewhat familiar with Star Trek, that is I know the basic premise - ships in space, with war between different space-faring sentient species.


I have a Nintendo Switch Minecraft world with my friends and got Minecraft Pocket Edition to play on the go. I signed in to the same account but there is no sync old worlds button on the mobile app. I couldn't find how to do it anywhere online either. Does anyone know how to transfer Switch worlds to PE or tell me if it's even possible, please?

I have read that with the new "Better Together Update" (BTU) it is now possible to .  However, I am having trouble finding details of how this is supposed to work to determine if it would do what I am hoping it would and therefore whether it is worth my time/money.  I have some saved worlds on Minecraft for XBox One, all done in creative mode.  I am able to import them into what is now just called "Minecraft" which as of the BTU is what is being used to mean the cross-platform version.   Can I now play this same world on my Windows 10 PC?   If I go to the Minecraft web site it offers to sell me the "Java Edition" with the addendum "includes edition for Windows 10".   But from what I have read, anything that has the word "edition" in it isn't the cross platform version.   It's very unclear to me what I would actually be buying here.  If it is possible to open the same world on different platforms, exactly how would I go about doing this?  On the XBox I have to sign in with an outlook.com e-mail address to access my worlds, or my kids' sign-ins to access their worlds, is it the same from the PC? And where would my world be saved?   I have read that XBox saves will be in the cloud, but PC saves will be local, so how can I get a cloud save onto my PC?  And then how can I get it back to the cloud when I am done so I can play it on the console again?  Will there be two copies floating around, making it possible for me to make a backup on my PC?  How will this interact with world editors?  At some point will I be able to start a game on XBox, transfer it to the PC, open it in a world editor, make some changes, and then transfer it back to the XBox?


class Decoder    { public:     virtual void run() {}     //... }   Now, I have this derived class:  class NVDecoder : public Decoder { public:     void run();   which is defined as this in the NVDecoder.cpp file  void NVDecoder::run() { //... }   As the function void of Decoder is virtual, doing:  //Decoder decoder = new NVDecoder(); auto decoder = std::make_shared<NVDecoder>(NVDecoder::NALU,Decoder::H264); decoder->run();   should call the NVDecoder's run function, not the Decoder's one. However, when I start a thread for a generic Decoder object, I need to do like this:  auto decoderThread = std::make_shared<std::thread>(&Decoder::run, decoder);   This calls the Decoder's run function, not the NVDecoder's one. I guess it's because I pass &Decoder::run. How do I start a thread that uses the NVDecoder's run function without passing &NVDecoder::run?

Someone mentioned it in the IRC as the slicing problem.


Motivation:  I'm doing a text-mining project and I'd like to map all forms of an adjective to their "base-form".   Example:  bigger    -> big biggest   -> big stronger  -> strong strongest -> strong   The words on the left are the comparitive or superlative forms of the word on the right.   Question: What is the word on the right called?  Related: , but in this case I'm not looking for the opposite, simply the name of the form without the comparison.

Adjectives are found in different forms, among which comparative and superlative. However, is there a term to describe adjectives' "base form" (is "base form" the right term to coin them)?  Example:      Circle adjectives with different colors depending on whether they are   written in their comparative, superlative or base form.


I have a object like this.   var Obj = {     obj1 : {         val : 1,         id : 1     }     obj2 : {         val : 2,         id :2     }     obj3 : {         val : 3,         id :3     } }   I want to delete obj1, can anybody suggest how to achieve this.

Say I create an object as follows: let myObject = {   "ircEvent": "PRIVMSG",   "method": "newURI",   "regex": "^http://.*" };  How should I remove the property regex to end up with new myObject as follows? let myObject = {   "ircEvent": "PRIVMSG",   "method": "newURI" };


I tried to find a solution to $n_1^3 + n_2^3 + n_3^3 = 42$ using a computer program, but so far I haven't found a solution.

The following problem was posed to me but I could not do much about it:     Determine if there are any integer solutions to the equation   $a^3+b^3+c^3=30$   I made a computer search that shows that there are no integers $a,b,c$ such that $a^3+b^3+c^3=30$ and $|a|,|b|,|c|<51$  Thank you a lot.


The first part of this question is about how I should ask this question.  I am a bit confused about all the terms used to describe books written about English.  For example, "usage", "style", "reference", "reference grammars", etc.  So I don't know what the proper term is for the type of book I want to ask about.  So I've seen the thread on English reference grammars (english.stackexchange.com/questions/183/what-are-some-of-the-better-english-reference-grammars), and my question is similar.  That thread asks about texts that describe English grammar, but I'm wondering about more practical books.  For example, when I'm writing, I often come up with a myriad of questions like:   When should one use "that" vs. "which"? How do you deal with multiple descriptive clause modifiers, or whatever they're called, that both end with nouns, leading to ambiguity.  For example: "I looked at the bucket at the bottom of the barrel that contained my money."  Let's say that the bucket is the object that contains the money, not the barrel.  Well if you say "the bucket that contained my money at the bottom of the barrel" that could still be ambiguous, because now maybe "at the bottom of the barrel" could refer to the money.  This is a bad example, but you get the gist of it; how do you deal with these double-bind ambiguities? Is it grammatical to do a comma then a gerund phrase like I just did in that last bullet point?  For example: "This drug is fatal, causing death within seconds." Is that grammatical? When should one put hyphens between nouns? Is it grammatical to use nouns as adjectives?  E.g. "double-bind ambiguities".  There's probably a better way to say that, right?   And so on and so on.  Now, one could ask/search for every single question that pops into your head on this stack exchange, but that seems infeasible for a large volume.  So there must be some reference book that would give one the background to know the answer to these types of questions.  After all, the people on this stack exchange had to learn it somewhere, right?

What is your favorite English reference grammar, particularly in terms of accuracy and completeness? Please note: I am not asking for usage guides. What are the strengths and weaknesses of the best ones?


Im having trouble with an IF statement which is to check to see if there is a value in an array or not, and if not then +1 to be added to InvalidLine.  import java.io.File; import java.io.FileNotFoundException; import java.util.Scanner;  public class Assignment {  public static void main(String[] args) throws FileNotFoundException {      Scanner scan = new Scanner(new File("../Text.txt"));       String line;       while (scan.hasNext()) {          line = scan.nextLine();          String[] elements = line.split(":");          System.out.println("The line has " + elements.length                 + " elements.");          for (int i = 0; i < elements.length; i++) {              System.out.println("Element " + (i + 1) + " was : " + elements[i]);                int InvalidLine = 0;                if (elements[i] == "");{               Invalid++; }               System.out.println("Invalid Fields " + InvalidLine);          }      }  }  }   When the output generates, +1 is added to InvalidLine even though in some cases there is no data in the [1]array  The line had 4 elements.  Element 1 was :   1  Element 2 was :  biscuits  1  Element 3 was :  3   1  Element 4 was :  4  1  The line had 4 elements.  Element 1 was : Coffee   1  Element 2 was :  Cake  1  Element 3 was :  3   1  Element 4 was :  6  1

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


Summary of issues:   Can't retract close vote on mobile after a page refresh Voting to close on mobile shows close 1 and then when page refreshes it shows close (1) Retracting vote on mobile doesn't refresh tally -- continues to show close 1 instead of just close, until you refresh   I voted to close a question on my desktop. Later on my phone I decided to retract this vote, but I couldn't. I saw close (1) but it was grayed out. Switching to "full site" allowed me to retract my vote.  In trying to reproduce, I went to a post on phone and voted to close a question. The text changed to close 1. I could retract my vote at this time, and doing so, the text stayed the same as close 1 which seems to contradict .  Refreshing page showed correct close text grayed out.  Another attempt on phone, I voted to close a question. The text changed to close 1. I refreshed the page and could no longer retract my vote as the text said close (1) and was grayed out.  Visiting question with existing close votes showed close 2. I also voted to close and then it said close 3. Refreshing page showed closed (3) grayed out.

Related:    On the full site, you can still click a close link and check out the current vote counts, even if you've already vote to close yourself. This becomes useful at times.  However, on the mobile site, the close button is dimmed and cannot be tapped—no matter what you try.    Looking at the source, it may be . :/ Why so?


Should a question mark appear at the end of a question, and before the second quotation mark?  An example is:      "How are you feeling today," he asked.   I'm getting conflicting advice.

I recently learned that I have developed a consistent, but entirely wrong approach to punctuating direct speech in fiction. I am in the unenviable position of trying to relearn.  Previously I wrote such things as:     "I'm done." She said.   when the quoted speech was definitely, absolutely the end of a sentence. So now I know I need.     "I'm done," she said.   This follows the rule that a period is only allowed when the end of the spoken sentence is also the end of the sentence in the narrative. For example:     "I'm done." She slammed the door on the way out.   So, it now looks odd to me when there are multiple sentences in the speech:     "I can't take her. I'm done," she said.   Can you reassure me that is correct, or give the correct form? Please don't suggest rewriting the sentence to put 'she said' in the middle - I'm aware of that: I'm specifically asking about the punctuation rules.  The other odd case is speech ending with an ellipsis. Do sentence terminating ellipses (four periods normally) become:     "I can't take her. You know, ...," she said, nodding towards Jane.   If so, are non-terminating ellipses dealt with the same way?     "I can't take ...," she nodded towards Jane, "any more!"   or can non-terminating ellipses be used unadorned?     "I can't take ..." she nodded towards Jane, "any more!"   I'd be very grateful if you could point me at references as well as answers. For the record I am a British writer writing for both British and US publication, so any variation is also interesting to me!


I'm working on the following riddle that I found to be kind of interesting, but I can't figure it out. The problem is as follows:  A prince visits an island inhabited by two tribes. Members of one tribe always tell the truth, and members of the other tribe always lie. The prince comes to a fork in the road. He needs to know which road leads to the castle so as to avoid the fire-breathing dragon and rescue the princess from the wizard holding her captive in the castle. Standing at this fork in the road is a member of a tribe who has time to answer only one yes or no question, but the prince can't tell which tribe he belongs to. What question should he ask to find the road to the castle?  Is there a way to solve this problem without involving another member of a tribe. I believe there is an easy solution to this problem if you have more than one member of a tribe to ask, but can this be solved if you only have one member to ask?

So i was solving exercises in propositional logic lately and stumbled upon a puzzle, that goes like this:     Each inhabitant of a remote village always tells the truth or always lies. A villager will only give a "Yes" or a "No" response to a question a tourist asks. Suppose you are a tourist visiting this area and come to a fork in the road.    One branch leads to the ruins you want to visit; the other branch leads deep into the jungle. A villager is standing at the fork in the road. What one question can you ask the villager to determine which branch to take?    I intuitively guessed the answer is "If I asked you this path leads to the ruins, would you say yes?". So my questions are:   What is the name and/or source of this logical riddle? How can i corroborate my answer with mathematical rigor?


For some reasons, it seems that particular "handedness" are chosen by nature, because we have the prevalence of some , that have different optical properties respect to polarization. In nature L-amino acids are prevalent respect to D-amino acids and D-glucose are prevalent respect to L-glucose. Is this breaking of symmetry a poor accident, in both distinct cases, or could there be a deep physical reason that caused it to evolve?

In biology, the concept of parity emerges in the context of chiral molecules, where two molecules exist with the same structure but opposite parity. Interestingly, one enantiomer often strongly predominates over the other in natural biological systems (e.g. D-glucose is ubiquitous, L-glucose is rare in nature).  In physics, it has been established that weak interactions violate parity, which (if I understand correctly) implies a physical difference between left- and right-handed systems.  This suggests to me the following questions: Does parity violation in physics affect the physical or chemical properties of chiral molecules? And does this have any implications for our understanding of biological homochirality?