how to round off digit to 7 decimal place in java

I am making a java program in which i have to round off the double digit to seven place but I don't know how to do it.      like 6.6666667e-10 to 0.0000001


My URL can't be index in Google Search Result

I am not sure why my URL is not indexed on the Google SERP when I check it by site:. Here what I have done so far:   Submit the URL via "Fetch as Google" on Google Search Console  URL is on the Sitemap and Resubmitted on Google Search Console I submitted the URL via Crawl URL()   I also have this checklist:   The web page doesn't have noindex the URL is not blocked by robots.txt Not part of 404 Error/Server Error or any Crawl Error listed on the Console   I do wonder it is not been crawled and indexed. It has been a week that I monitor it but nothing is happening. Do anyone have a clue what may be the reason for it?


I've got a big problem with RTL8723be. My WiFi doesn't work, it never works. I've tried all the possible solutions written on internet and on AskUbuntu. The chip is installed on a HP p215nl , what can i do?  EDIT: I've tried Pilot's answer.  . Bluetooth works perfectly, Wireless Network is totally absent.  EDIT 2: rfkill list output:  0: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no 3: phy2: Wireless LAN     Soft blocked: no     Hard blocked: no   EDIT 3: Tried  And still not working  EDIT 4: Yep, sure. I forgot to say that one of them is an external wireless adapter. This is the output without it.  0: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: yes     Hard blocked: no   EDIT 5: I haven't that option in my BIOS settings. I've tried moksb command but it gave me an error.  EDIT 6: sudo modprobe -r rtl8723be sudo modprobe rtl8723be msi=1  After these commands i was able to connect through WiFi.


What is 'System and compressed memory' and why is it using so much memory?

On Windows 10, There is a process System and compressed memory.  What is it and why is it using so much memory?


A right circular cone has a depth of 103 mm and a top  diameter of 82.4 mm. The cone contains water to a depth of 30.0 mm. How many more  milliliters of liquid need to be added in order to fill the cone?   I understand how to find the volume, but I'm confused about the water depth. Do I just need to subtract 30 from 103 then calculate volume?


How to see all the questions I have 'view'ed earlier?

I wish to see all the questions I have 'view'ed so far. I remember seeing a good question on concurrency, but I am not able to google it again. I had neither voted on it or favorited it as well. Any help?


How to demystify the axioms of propositional logic?

How might I go about getting some intuition on the typical axiom schemes given for propositional logic? They seem rather mysterious at first glance.  For example, these are taken from:    $\phi \to \phi$ $\phi \to \left( \psi \to \phi \right)$ $\left ( \phi \to ( \psi \rightarrow \xi \right)) \to \left( \left( \phi \to \psi \right) \to  \left( \phi \to \xi \right) \right)$ $\left ( \lnot \phi \to \lnot \psi \right) \to \left( \psi \to \phi \right)$


I cannot get my insert function working. I have used this frame work.     The error i get is   Fatal error: Call to a member function insert() on a non-object in /home/hghdigib/public_html/backup/feed/classes/xml_upload.php on line 39  I have stripped lost out to make it easier to follow.   Any help would be much appreciated been scratching my head for a while.   My Global Class File   require_once("classes/database.php"); require_once("classes/xml_upload.php"); $db = new Mysqlidb('localhost', '', '', ''); $dataupload = new DataUpload($db); $dataupload->getAllProducts($db);   My xml_upload.php class  class DataUpload {      public $db;     public $xml_upload;      function __construct($db) {         $this->db = $db;     }         public function getAllProducts() {         foreach ($propertys as $results)         {             $insertData = array(                 'prop_id' => $results['prop_id'],                 'lastchanged' => $results['lastchanged'],                 'url' => $results['url']             );              if($db->insert('propertie_ids', $insertData)) echo 'success!';         }      }         }


What is the Euclidean inner product intuition?

The Euclidean inner product $<x,y>$ of the vectors $x , y \in \mathbb{R}^n$ is defined by:  $\langle x,y\rangle = x_1y_1 + x_2y_2 + x_3y_3 + ... + x_ny_n$  I am unable to find the intuition behind this? Why do we need this inner product? What happens to the vectors under equation and what does the scalar answer tell us?  P.S. I have already seareched it, most the articles take it into geometric terms and introduce $\cos\theta$. Can anybody help me visualize thing without angular stuff?  Edit: Question addressed  uses the angle to explain geometric dot product. I am wondering if there exist some explanation for dot product in Vector Space.


I have seen the word 'only' placed both before and after a noun. Where should the word 'only' go in this sentence? Is it the writer's choice?   If you have attended every lesson, only the songs need to be rehearsed at home. If you have attended every lesson, the songs only need to be rehearsed at home.


QGIS how to use the NNJoin Plugin algorithm within a Python script?

I have two layers: 1 point layer and 1 line layer. My goal is to calculate the nearest line to every point and I am doing this with the NNJoin Plugin. Now I want to do the same within a Python script, but I do not know how to access the NNJoin-Algorithm from here.  If this is not possible, are there any alternatives?   I have already read through the duplicate question but it doesn't quite answer my question.


Difference between least squares and minimum norm solution

Consider a linear system of equations $Ax = b$.   If the system is overdetermined, the least squares (approximate) solution minimizes $||b - Ax||^2$. Some source sources also mention $||b - Ax||$. If the system is underdetermined one can calculate the minimum norm solution. But it does also minimize  $||b - Ax||$, or am I wrong?   But if least squares is also a minimum norm, what is the difference, or the rationale of the different naming?


How to solve trigonometric equations without a calculator?

How does one solve for sine, cosine, or tangent (and inverse sine, cosine, tangent) without the use of a calculatour? For example: cosine of 131 degrees — how must one calculate this?


Morphing an object around another object

I'm trying to add an Aquila to the chest plate of a space marine I'm modelling. Is there a quick way to morph an object around another object as per the picture I attached?


Is gear worth more glimmer after being upgraded?

Given two identical pieces of gear (armour, weapons) with the same level requirement and base stats, is one that has gained "experience" or upgraded worth more glimmer/scrap when you dismantle it? I like to level my extra gear up before selling it but I haven't noticed any clear benefits so far.


How to prove there exists a linear transformation?

I've been given the following problem as homework:     Prove that there exists a linear transformation $T: \mathbb{R}^2 \to \mathbb{R}^3$ such that $T(1,1) = (1,0,2)$ and $T(2,3) = (1,-1,4)$.   Since it just says prove that one exists, I'm guessing I'm not supposed to actually identify the transformation.    One thing I tried is showing that it holds under addition/multiplication in the sense of:  1) $T(x + y) = T(x) + T(y)$  2) $T(cx) = cT(x)$  3) $T((1,1) + (2,3)) = T(1,1) + T(2,3)$? But that's not necessarily true.  I don't know how I'd accomplish this given my limited knowledge.  What's the approach to solving a problem like this?


Let $A$ be any uncountable set, and let $B$ be a countable subset of $A$. Prove that the cardinality of $A = A - B $

I am going over my professors answer to the following problem and to be honest I am quite confused :/ Help would be greatly appreciated!     Let $A$ be any uncountable set, and let $B$ be a countable subset of $A$. Prove that $|A| = |A - B|$    The answer key that I am reading right now follows this idea:  It says that $A-B$ is infinite and proceeds to define a new denumerable subset $A-B$ as $C$. Of course since $C$ is countably infinite then we can write $C$ as ${c1,c2,c3...}$   Once we have a set $C$, we know that the union of $C$ and $B$ must be denumerable (from another proof) since $B$ is countable and $C$ is denumerable.  This is where I start to have trouble. The rest of the solution goes like this...  Since the union of $C$ and $B$ is denumerable, there is a bijective function $f$ that maps the union of $C$ and $B$ to $C$ again. The solution then proceeds to define another function $h$ that maps $A$ to $A-B$.   I am just so lost. The thing is I don't even understand the point of constructing a new subset $C$ or defining functions like $f$ or $h$.  So I suppose my question is in general, how would one approach this problem? I am not mathematically inclined unfortunately, and a lot of the steps in almost all of these problems seems arbitrary and random. Help would be really appreciated on this problem and some general ideas on how to solve problems like these!!!  Thank you so very much!


Distinction between acquiring and obtaining

I can't decide between those two words.     You need to acquire handling instructions.   You need to obtain handling instructions.   Both mean roughly the same, describing an act of gaining possession of something. In my mind, there might be a distinction in how active/passive the recipient is expected to be. However, I can't tell which one, if any, would be more go-getty and which would lean towards bestowy-upony.


SFTP to local ubuntu server crashes network

I have an Ubuntu server (named vader) running in my house that I would like to set up SFTP connections with my Mac (named MacbookBro).   From vader, when I run:     sftp mourkeer@MacbookBro.local   It connects just fine. However, from MacbookBro (or any other machine), if I run:     sftp mourkeer@vader.local   My entire LAN crashes, and I have to reboot the router.  So my Ubuntu machine can send SFTP requests, but it can't receive them. FTP, SCP, and most importantly, SSH all work to/from either machine. What could be causing my network to crash? I'm assuming it's some sort of time out, and my router just sucks. But that doesn't explain why the issue is happening to begin with.  Vader is connected by ethernet to my Linksys E2500 router. MacbookBro is connected wirelessly. I was running Ubuntu 13.10 before, but I fruitlessly upgraded to 14.04 hoping that might fix the problem.


Search for a WYSIWYG, non-latex Online collaborative paper writing Tool

Is there a tool that is   WYSIWYG and not latex (in fact any coding) base online (for ease of collaboration) Can write math equation Does line numbering Does equation numbering   Google Doc is perfect for 1-3, but they don't support 4-5 (unless you work around by using tables, but that's not really a nice solution)  Authorea and Overleaf does 2-5, but is very latex/code based. (Despite Overleaf's rich text editing mode, which is a step closer to what I want, but still quite far from the goal)  (At the moment, I am just using Google Doc and do all the numbering post exporting to .doc)  ---------This is not the same question as ------------  Reasons:   The author of that question clearly wants to use latex for his part of the collaboration, but wants a non-latex front end for his no-latex using collaborators. Unlike him, apart from writing equations, I have absolutely no intention of using any latex code. In fact, I will be satisfied with MS word type equation editor (as long as it lets me put equation number on it) The accepted solution to that post includes solution like overleaf and Authorea, which I specifically said is not satisfactory to me because they are too latex based. Another population solution to that post was Lyx, which clearly fails the 'Online' part of my question.   At risk of repeating myself, let me say this. That post is after a masked latex service. Whereas I am after a Google Doc with line and equation numbering feature. If I insert a table, I want to insert a table, not a \begin{tabulate\table} environment, if I insert of picture, I want to be able to drag and adjust its position. I want a truly WYSIWYG editor.


How to activate Windows 10 Pro without installing previous version first?

Here's the situation: I own Windows 7 Ultimate, box version, with product key and all. But I DON'T HAVE IT INSTALLED.  I used my only system SSD to test Windows 10 Insider Preview.  I admit I used pirate KMS to activate it, since it refused to activate.  Now I installed official Windows 10 Pro, but it obviously doesn't activate. At least legally, because activating via pirate KMS still works, but it's not what I need. I'm entitled to free upgrade as legal, registered Windows 7 owner.  I've read I have to wipe my HD, install Windows 7, activate it, install ALL updates (which would take all day), then upgrade (and it would activate then).  Since I don't have whole day to waste for it - is there a shortcut? I'm looking for a way to use my Windows 7 product key to activate my Windows 10 upgrade. I'm positive it's possible, but it requires some magic. Any clues?  Here's my guess, when you do normal upgrade procedure you get new product key for Windows 10 based on the product key you had for previous Windows version. The old key has to be validated first. My question is: how to achieve it using only existing Windows 10 installation? Maybe I could install Windows 7 on virtual machine, activate it and somehow get the new product key from VM? Anyone tried that?


What is the difference between \eqref and \ref?

Is there any difference between \eqref and \ref? I used both of them in my document using the package classicthesis and saw no difference in the result. Is there any specific situation in which I should use \eqref or \ref?


Let $p \in \mathbb Z [x]$ be a monic quadratic polynomial. Show that for $n \in \mathbb Z$ there exists $k \in \mathbb Z$ such that $$p(n)p(n+1)=p(k)$$   I came across this problem in an olympiad book. I have tried this question by many different approaches like simply putting $n , (n+1)$ into the quadratic equation and and try to factorise or do something to get the result but it doesn't help. Secondly, I know that  $$p(x)-p(n)p(n+1)=0$$  has a root equal to $k$ and then there is only one thing left to do that is to prove k integer which we can prove by proving discriminant to be a perfect square and other coefficients as integer but the problem arises how to prove discriminant to be a perfect square. Please tell if either of these approaches will take us to the prove or if not please tell the correct steps of proving   I am very confused with problem (not a homework problem). Please help to prove it with proper steps and methods.


The following script does not return tty  Isn't sys.exit(0) enough from parent process? Do I have to redirect stdin/stdout inside a child process to return tty? If so, how do i do that?  [Partial code]  pid = os.fork() if pid > 0:     # parent     sys.exit(0)  #child PID = os.getpid() PID_DIR = '/var/pid/' PID_FILE = '%s,%s.pid' % (machine_name, PID)  with PidFile(pidname=PID_FILE, piddir=PID_DIR):     worker_handler = gevent.spawn(worker)     master_handler = gevent.spawn(master)     handlers = [worker_handler, master_handler]      try:         while True:             time.sleep(1)     except Exception, msg:         print msg         gevent.killall(handlers)      handlers.joinall()


A is similar to $A^k$, then each eigenvalue of $A$ is a root of unity

Let $A \in \mathbb{C}(n,n)$ and $k \geq 2$ be an integer such that $$A \sim A^k$$. Show that if $A$ is non-singular then each eigenvalue of $A$ is a root of unity.   Attempt: Since $A \sim A^k$, $$PA = A^kP$$ where $P$ is an invertible matrix. Since $A$ is invertible, $0$ cannot be an eigenvalue of $A$. Suppose $$Av = \lambda v \quad v \neq 0$$ then $$PAv = \lambda Pv$$ $$\therefore A^k(Pv) = \lambda (Pv) $$ but this implies that $Pv$ is an eigenvector of $A$. But the eigenvalues of $A^k$ are $\lambda^k$ $$\therefore \lambda^k=\lambda$$ which gives the conclusion required.   My questions is: Is the logic correct? If so, Am I missing any details? If not, then how could I approach this?   Thanks!


How to write name of the file's owner to the file using c#?

Below is the code how to get the name of the file's owner:  using System.Security.AccessControl; using System.Security.Principal; using System.IO;  //...  FileInfo fileInfo = new FileInfo(@"1.txt"); FileSecurity fileSecurity = fileInfo.GetAccessControl(); IdentityReference identityReference = fileSecurity.GetOwner(typeof(NTAccount)); MessageBox.Show(identityReference.Value);   Is it possible to write this data to the file using c#?


Sharing a common fragment among multiple Classic email templates

I have tons of classic HTML (with classic letter header) email templates in a classic org.   All of the emails share a common HTML disclosure that is text with some hyperlinks. To ensure consistency in the text content, I would like to consolidate this into a single reference-able component/static resource/something. See below where GroupSpecificSignature and EmailDisclosure are both HTML static resources that have the text and hyperlinks needed.   This doesn't appear to be possible with static resources, so it seems I may have to use Visualforce Email Templates.   A lightning implementation is planned sometime soon as well, so not sure if Visualforce Email Templates are advisable or not.    Hello {!Contact.Name},  This is a nice email.   Thanks,   {!$Resource.GroupSpecificSignature}  {!$Resource.EmailDisclosure}   NOTE: Custom labels are not an option as the disclosure is 1500 characters.


Linux/Ubuntu native (not Wine) alternative to DVD-Shrink, that can compress a DVD image to a smaller size to fit on a writeable DVD?

An alternative to DVDShrink would be a program able to shrink a DVD movie to a smaller dimension that would fit a standard 4.7 dvd while optionally keeping the dvd-movies structure, menus etc. (that would not only be intended to do this, but that would also succeed).    That was  but the answers are on Wine and others are old.  Any news on this?    Bound to be a duplicate - see .  So, consider posting also under the older question to get the bounty.


Prove  $f_{1} + f_{3} + f_{5} +...+f_{2n-1} = f_{2n}$ when $f_{n}$ is the $n$-th Fibonacci number.   Before I try to prove this, I am trying to understand this in English. What is happening in this equation? How can $2n-1 = 2n$? What is the English interpretation of this?


Incorrect Proof for $x^3 = x$ for every $x$ in a ring $R$ then R is commutative.

I am interested in why this proof is wrong since every proof I have seen uses much more knowledge than this and I can't figure out why it is incorrect.   Suppose $x^3 = x$ for every $x \in R$. Then $x = x^{-1}$ and similarly for every $y  \in R$, $y = y^{-1}$. So then $xy \in R$ and $xy = x^{-1}y^{-1}$. Since $yx(x^{-1}y^{-1}$) = $e$, $(yx)^{-1} = (x^{-1}y^{-1})$. Then $xy = (yx)^{-1}$. Since $R$ is closed under multiplication, $yx \in R$ and so by the discussion above, $yx = (yx)^{-1}$. Therefore, $xy = yx$ for all $x$,$y \in R$ which means that $R$ is commutative.


I'm writing a homework report in the environment article and I want to include a table in the result section, my code looks like this   \newpage \section*{Result} \begin{table} \begin{tabular}{m{1.5cm} m{3cm} m{3cm} m{3cm} m{3cm}} \hline t & Approx. Solution J=1 & Approx. Solution J=3 & Approx. Solution J=5 & Exact Solution\\ \hline 0.00 & 1.500 & 1.500 & 1.500 & 1.500\\ 0.02 & 1.314 & 1.347 & 1.338 & 1.341\\ 0.04 & 1.162    &1.199&1.191&1.194\\ 0.06& 1.037 &1.075 &1.067 &1.071\\ 0.08&0.935&0.973&0.965  &0.969\\ 0.10    &0.851  &0.889  &0.881  &0.885\\ 0.12    &0.782  &0.820  &0.812  &0.816\\ 0.14    &0.725  &0.764  &0.755  &0.759\\ 0.16    &0.679  &0.717  &0.709  &0.713\\ 0.18    &0.641  &0.679  &0.671  &0.675\\ 0.20    &0.610  &0.648  &0.640  &0.643\\ \hline \end{tabular} \caption{Result of Running the Code Attached} \end{table} Exactly the same as Table 5.13 in the textbook.    Clearly I wrote section* before \begin{table} but the output looks like this    any suggestion would be much appreciated!


How do I get the  hat. It mentioned edit a community wiki post, but I edited some post which is bumped on the main page like the screenshot below and have not yet received that hat. Do I understand it wrongly? If so, where can I find the community wiki post?


How to install 7zip to extract rar files

How do I install 7zip through Terminal to extract rar files?


Do I have to leave the country on my 180th day even though I haven't spent 90 days? (Let's say I spent 63 days.)  Once I hit the 180 days, how long do I have to wait to be able to re-enter the Schengen states?    Can I leave for a few days and re-enter?    Or do I have to wait three months to re-enter?


Solve recurrence relation $a(n)=2\cdot a(n-1)+5\cdot a(n-2)+6\cdot a(n-3)$ and the associated cubic

I am trying to solve following :  $$a(n)=2\cdot a(n-1)+5\cdot a(n-2)+6\cdot a(n-3)$$ with  the initial  conditions given by $a(0)=3,a(1)=2,a(2)=14$.  So first of all, I want to mark that there exists a theorem which states the following:  Let $P(x)=u_n\cdot x^n+u_{n-1}\cdot x^{n-1}+....+u_1\cdot x+u_0$ be a polynomial with real coefficients, and $u_n\neq 0$. If $P(x)$ has rational roots, they are of the form $\pm p/q$ where $p|u_0$ and $q|u_n$.  So first what I have tried is to construct characteristic equation or $$r^3-2\cdot r^2-5\cdot r-6=0$$ Now I have a problem to solve cubic equation also from the theorem I need a few help to understand it well.   Please help me. Thanks a lot.


A question related to discrete and subspace topology

I am unable to think how to prove this question.      Question is - Let A be a subgroup of Real Line under Addition. Show that either A is dense in Real Line Or else the subspace topology of A is discrete topology.    I tried by assuming A is not dense in Real Line but I am unable to prove that A intersection is discrete topology.   Any help will be really appreciated.


I'm a recent Computer Science graduate who prides himself on his knowledge of software development and problem solving, but has no idea how GIS systems work. (Read: I'm a programmer.)  I've been charged with developing (ie. coding) a new webmap from scratch.  I can program in any language that has bindings to COM (Microsoft Component Object Model), so I've been writing in PHP.


Is an expanding map on a compact metric space continuous?

I got inspired by this question  to think about the following problem: Suppose you have a compact metric space $(X,d)$ and an expanding map $T:X\rightarrow X$, i.e. $d(Tx,Ty)\geq d(x,y)$ for every $x,y\in X$. Is the map $T$ then continuous? Without assuming continuity we already know that $T^n(X)$ must be dense in $X$ for any $n\geq 1$, since given $z\in X$ the orbit of $z$ must accumulate upon $z$. But showing continuity has escaped me so far. If there are counter-examples using the Axiom of Choice that also interests me.


Q: $\lim_{n\to \infty}\left(1 + \frac{1}{n}\right)^{n} = e$

I am having difficulty with the proof $$\lim_{n\to \infty}\left(1 + \frac{1}{n}\right)^{n} = e$$ in Rudin's Principles of Mathematics.  In particular, the last few steps.  The proof is as follows:     Theorem. $\lim_{n\to\infty} \left(1 + \frac1n \right)^n = e.$      Proof. Let $$s_n = \sum_{k=0}^{n} \frac{1}{k!}, \qquad t_n = \left(1 + \frac1n \right)^n.$$      By the binomial theorem, $$t_n = 1 + 1 + \frac1{2!}\left( 1 - \frac1n \right) + \frac1{3!}\left(1 - \frac1n \right)\left(1 - \frac2n \right) + \dots \\ + \frac1{n!}\left(1 - \frac1n \right)\left(1 - \frac2n \right)\dots\left(1-\frac{n-1}{n}\right).$$      Hence $t_n \leq s_n$, so that $$\limsup_{n\to\infty} t_n \leq e,  \tag{14}$$ by Theorem 3.19. Next, if $n \geq m$, $$t_n \geq 1 + 1 + \frac1{2!}\left(1-\frac1n\right) + \dots + \frac1{m!}\left(1-\frac1n\right)\dots\left(1-\frac{m-1}{n}\right).$$      Let $n\to\infty$, keeping $m$ fixed. We get $$\liminf_{n\to\infty} t_n \geq 1 + 1 + \frac1{2!} + \dots + \frac1{m!},$$ so that $$s_m \leq \liminf_{n\to\infty} t_n.$$      Letting $m\to\infty$, we finally get $$e \leq \liminf_{n\to\infty} t_n. \tag{15}$$      The theorem follows from (14) and (15).     My question:     What allows us to say that $$\lim_{n\to \infty}\text{inf } t_{n} \geq s_{m}?$$   I see that $\lim_{n\to \infty}t_{n} \geq s_{m}$ (if it exists, I suppose otherwise it's vacuously true...), but why the $\liminf$?  The text does similar steps in other proofs without explanation, so I am not sure if I am misunderstanding something obvious...


Please allow non-Unicode named editors be pinged with autocomplete

Currently, you can @reply to any person with the auto complete. Normally, you type the first letter of their name then use Tab to finish it.  Unicode names work differently, you don't have to start the name (thankfully):    And just press tab to complete it.  Can the same behaviour be added to pinging editors? Currently there is no auto-complete for editors, so could there be an exception for Unicode named editors?


I am trying to get all the processes listening for a network connection on Mac OS X. netstat does not have the -p option and I am trying with lsof  lsof -i -sTCP:LISTEN   gives me a fair list of listening processes but not all. I can for example telnet to port 10080 where I have a process listening for a connection but this is not shown in the output of lsof. What am I missing?  $ telnet localhost 10080 Trying ::1... Connected to localhost. Escape character is '^]'. ^] telnet> Connection closed.   but  $ sudo lsof -n -i | grep 10080 $


Is it possible to model a microwave resonator in SPICE

I just wanted to know if it was possible to model a microwave resonator in spice software or somehow import it from somewhere to spice to carry out analysis.  Also if it is not possible to model the microwave resonator in spice, will using a series or parallel resonance circuit be able to 'replace' the microwave resonator/cavity. I would be grateful for any help.


installing ubuntu on win 10 :not working

I have a new laptop Asus GL552v (ITerabyte, 128GB SSD and core i7600hq with WIN 10 home) I would like to install ubuntu as what I do work mostly with Linux. I have read several blogs and comments on how to get this done but nothing seems to be working. I have disabled fast startup, enabled CLI in Bios, I have tried to install using both liveCd and liveUsb but nothing works. Really, I often get to the page where i'm asked whether to try ubuntu or install, whenever i choose install, it brings out ubuntu window with some dots showing the progress, then it hangs at the last dot and stays lke that for several minutes to hours without showing any other option neither does it get past that. I have followed all the instructions and methods i could read online. is this problem peculiar to asus GL552V or is it because i only have win 10 home basic? or is there any other thing that i should do that I haven't done? I would appreciate any help in getting this done. Thanks


Can ubuntu be installed in intel kabylake 7th gen processor?

I am using a 7th generation i5 processor(7200,2.50 ghz).The processor also have intel hd graphics 620 and nvidia geforce 940mx 2gb graphics card. I read previously that only windows 10 can be installed to this specific processor.  Is it true no version of ubuntu can be used with this processor?  If it's possible to install ubuntu using this processor, what additional steps other than the normal installation process should I undertake to get Ubuntu working?


Capitalization of the word "the" in "the Lord" / "The Lord"

Should I capitalize the word "the" when speaking of God as "the/The Lord"?     I praise the Lord.   or...     I praise The Lord.


Are both these sentences in different orders correct?

The original sentence is below.     When you are studying any matter, or considering any philosophy, ask yourself only what are the facts and what is the truth that the facts bear out.   I would like to know if the sentence below in a different order is correct as well.     When you are studying any matter, or considering any philosophy, ask yourself only what the facts are and what the truth that the facts bear out is.   I am not a native English speaker and there is so much basic stuff I am confused about like this. Any explanations will be greatly appreciated.


Can I use copyrighted images and music in my game?

I am working on my first ever project , and I have used some copyrighted images(images taken from some other well recognized games). Is it even possible that I edit the images a little bit and then use them as royalty free images?


Sum up the following series: $\sum^n_{k=1}\frac{k^2}{2^k}$

How to find an explicit formula for the term $$\sum^n_{k=1}\frac{k^2}{2^k}$$ Then I discovered that $$\sum^n_{k=1}\frac{k^2}{2^k}=1^22^n+2^22^{n-1}+3^22^{n-2}+\cdots+n^22^1-\frac{n(n+1)(2n+1)}{6}$$ But how to write $1^22^n+2^22^{n-1}+3^22^{n-2}+\cdots+n^22^1$ into explicit formula?? $$\\$$ A hint would be grateful.


On click, preselect items in a dropdown menu

I have multiple buttons which are Order 1  and a contact form below it with a  field with multiple options (Order 1, Order2, etc...)  When I click on the "Order 1" button , I want the  field to select Order 1. And if I click on the "Order 2" button, I want the  field to select Order 2 for example. Is there a way to do that with javascript?  I've seen this done in some websites but can't remember exactly where.


So my brother recently bought Rust and lets me use his Steam account to play it. Would there be a way for him to play CS:GO while I play Rust. Is there a way to do that with Steam Family Sharing?


What are the differences in the difficulties?

I'm a little curious to what actually changes in the different difficulties, and if there is any benefits of choosing a harder difficulty?


I am trying to make a roundish pipe for my project. I am not very experienced in Blender yet and this project is very ambitious for me. Basically, I am trying to make  from , and I am still at the head part. He has two pipes going around his eye (I will show the image below). To make a pipe, I followed this video tutorial:


displaying name and age in same label via JSON

I have been trying to fetch data from JSON to the label of collection view cell. I need to display name and age within a same label and city and distance within a same label just like this.  .   I have already done fetching data but by taking different labels for all the four of them. How can i do the same thing in two different labels.


I have a ROC curve like the figure below:   What can be inferred given this kind of curve in general?  What are the differences of states 1, 2 and 3 in the figure?  What causes the diagram to jump straight from state 1 to state 3? Most of the ROC curves on the internet look like the figure below:


In Python, how could I shell out and interact with an external program (say vi or nano) and return to python

My first question on stackoverflow!  I'm trying to figure out how I can start an external program that requires the user to interact with it, say vi, nano, ssh, telnet etc. and return to the Python script when the program exits.  I don't want to use send/expect or automate the external program at all, just start it, use it as normal and then return to the script.  I guess bash seems like a more natural way to do this, but I was hoping to get it done in Python.


Accessing underlying object of SWbemObject instance

I'm using vbscript to interact with the WMI classes. I am querying the Win32_GroupUser class which is defined here .  In the definition, it has the following components:  class Win32_GroupUser : CIM_Component {   Win32_Group   REF GroupComponent;   Win32_Account REF PartComponent; };   My vbscript is as follows:  dim objWMIService, o, obj, test, test1, strComputer strComputer = "."  Set objWMIService = GetObject("winmgmts:{impersonationLevel=impersonate}!\\"& strComputer & "\root\cimv2") set obj = objWMIService.ExecQuery("select partcomponent,groupcomponent from win32_groupuser")  for each o in obj     set test = objWMIService.ReferencesTo(o.groupcomponent)     wscript.echo o.groupcomponent     set test1 = test.itemindex(0)     wscript.echo "test is a "&typename(test)&", test1 is a "&typename(test1)     on error resume next     for each j in test1.methods_ 'list all methods         wscript.echo "Method: "&j.name     next     for each j in test1.properties_ 'list all properties         wscript.echo "Property: "&j.name     next     i = test1.properties_("GroupComponent")     wscript.echo "Groupcomponent is a " & typename(i)     wscript.echo "GroupComponent: "&i  next   The output is  \\COMPUTER\root\cimv2:Win32_Group.Domain="TESTDOMAIN",Name="Schema Admins" test is a SWbemObjectSet, test1 is a SWbemObjectEx Property: GroupComponent Property: PartComponent Groupcomponent is a String Groupcomponent: \\COMPUTER\root\cimv2:Win32_NTDomain.Name="Domain: TESTDOMAIN"   However I am having trouble trying to follow the reference to the GroupComponent; it keeps on coming out as a string and not as a win32_group object, hence I cannot access the properties such as SID etc.  How do I access the groupcomponent as a win32_group object and not as the string?


I have a 128GB SSD with Windows 10 installed on it and I also have a 1TB HDD on my computer. I want to dual boot Ubuntu along side with windows 10 but I don't know how much space I need to give to Ubuntu and if I should even install it on the same drive as windows, because I roughly have 60GB's on my SSD left but I thought it would be better to keep them like that since windows always has updates and that sort of stuff. I mainly use windows for gaming and pretty much everything, Ubuntu is for college programming purposes.  Sorry if I misnamed any term but I'm still a beginner to all this sort of stuff.


how to correctly compile java files with javac?

So I am trying to compile some java codes from the the terminal without eclipse. I was following this tutorial   So I got the 3 java files downloaded and I compiled them with javac *.java no error and I got 3 .class file  but when I ran java ServerOperation  I got  Exception in thread "main" java.lang.NoClassDefFoundError: ServerOperation (wrong name: com/mkyong/rmiserver/ServerOperation)     at java.lang.ClassLoader.defineClass1(Native Method)     at java.lang.ClassLoader.defineClass(ClassLoader.java:803)     at java.security.SecureClassLoader.defineClass(SecureClassLoader.java:142     at java.net.URLClassLoader.defineClass(URLClassLoader.java:442)     at java.net.URLClassLoader.access$100(URLClassLoader.java:64)     at java.net.URLClassLoader$1.run(URLClassLoader.java:354)     at java.net.URLClassLoader$1.run(URLClassLoader.java:348)     at java.security.AccessController.doPrivileged(Native Method)     at java.net.URLClassLoader.findClass(URLClassLoader.java:347)     at java.lang.ClassLoader.loadClass(ClassLoader.java:425)     at sun.misc.Launcher$AppClassLoader.loadClass(Launcher.java:312)     at java.lang.ClassLoader.loadClass(ClassLoader.java:358)     at sun.launcher.LauncherHelper.checkAndLoadMain(LauncherHelper.java:482)   I think I did not compile the files correctly but I don't know how to do it.  what command should I use to compile?  update: Fixed after removing all the package declaration  How do I mark this as resolved  Special thanks to Tom for his useless comments


NullPointerException in RecyclerView Adapter

EDIT: The suggested duplicate question doesn't answer my question in any way, shape, or form.  I'm having trouble setting up my RecyclerView adapter. I get two errors:  09-19 20:01:38.601 22710-22710/com.yitter.android E/RecyclerView: No adapter attached; skipping layout   ... and:  java.lang.NullPointerException: Attempt to invoke virtual method 'void android.support.v7.widget.RecyclerView.setAdapter(android.support.v7.widget.RecyclerView$Adapter)' on a null object reference     at com.yitter.feed.FeedActivity.lambda$retrieveYeets$68(FeedActivity.java:402)     at com.yitter.feed.FeedActivity.access$lambda$3(FeedActivity.java:0)     at com.yitter.feed.FeedActivity$$Lambda$4.done(Unknown Source)     at com.parse.ParseTaskUtils$2$1.run(ParseTaskUtils.java:116)     at android.os.Handler.handleCallback(Handler.java:739)     at android.os.Handler.dispatchMessage(Handler.java:95)     at android.os.Looper.loop(Looper.java:148)     at android.app.ActivityThread.main(ActivityThread.java:5417)     at java.lang.reflect.Method.invoke(Native Method)     at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:726)     at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:616)   FeedActivity:  In my initialise() class (within onCreate()), I set up my RecyclerView and adapter:  RecyclerView recyclerView = (RecyclerView) findViewById(R.id.recyclerView);                 recyclerView.setHasFixedSize(true);                 adapter = new FeedAdapter(FeedActivity.this, retrieveYeets());                 recyclerView.setAdapter(adapter);                 recyclerView.setLayoutManager(new LinearLayoutManager(this));   I pass a List based on a query:  public List<ParseObject> retrieveYeets() {         String groupId = ParseUser.getCurrentUser().getString("groupId");         ParseQuery<ParseObject> query = new ParseQuery<>(ParseConstants.CLASS_YEET);         query.whereContains(ParseConstants.KEY_GROUP_ID, groupId);         query.orderByDescending("lastReplyUpdatedAt");         query.setLimit(1000);         query.findInBackground((yeets, e) -> {              if (mSwipeRefreshLayout.isRefreshing()) {                 mSwipeRefreshLayout.setRefreshing(false);             }              if (e == null) {                  // We found messages!                 mYeets = yeets;                  String[] usernames;                 usernames = new String[mYeets.size()];                 int i = 0;                 for(ParseObject yeet : mYeets) {                     usernames[i] = yeet.getString(ParseConstants.KEY_SENDER_NAME);                     i++;                 }                  // Add data to FeedAdapter                 FeedAdapter adapter = new FeedAdapter(                         FeedActivity.this,                         mYeets);                 recyclerView.setAdapter(adapter);              }         });          return mYeets;     }   Full Code:   FeedAdapter:  I have a feeling the problem is in my adapter, but I can't figure it out. What could be going wrong?  Full Code:     Answer:  I changed this in my MainActivity:  RecyclerView recyclerView = (RecyclerView) findViewById(R.id.recyclerView);                 recyclerView.setLayoutManager(new LinearLayoutManager(this));                 recyclerView.setHasFixedSize(true);                 adapter = new FeedAdapter(FeedActivity.this, retrieveYeets());                 recyclerView.setAdapter(adapter);   and in my retrieveYeets() method, removed the following lines:  // Add data to FeedAdapter                 FeedAdapter adapter = new FeedAdapter(                         FeedActivity.this,                         mYeets);                 recyclerView.setAdapter(adapter);


How does negative energy from Hawking Radiation cause a Black Hole to shrink?

Hello this is expanding upon a question that was previously asked on stack exchange that I linked below. From what I understand of Black Holes is that overtime Hawking Radiation results in the Black Hole shrinking. This being do to virtual particle pairs. The point I find confusing, and I may be misunderstanding it, but the black shrinks due to negative energy of the particle it absorbs when the other particle escapes but it does not matter whether or not it was the matter of the antimatter that was absorbed. Is the Black Hole losing mass if it absorbs only the normal matter half of a virtual particle and the antimatter half escapes?


I have a method that makes a JFrame visible, but i dont know why i cant run my program.  https://imgur.com/a/WcQ7SHw   these are the error lines:        // here im calling to the method VentanaAlta to fill a combobox //(errorline 21)   public VentanaAlta() {         initComponents();         Main.llenarCombobox(cbPuesto);     }    // here im trying to fill a combobox with Objetcs //(errorline 41)-  public static void llenarCombobox(JComboBox comboPuesto){        for(int x = 0; aPuestos.length > x; x++){               comboPuesto.addItem(aPuestos[x].getNombrePuesto());              comboPuesto.setSelectedItem(-1); }   //this is a method that is called in the first line on the Main class (maybe //the problem is here, and yes, vAltas is a global variable)  //(errorline 95)     public static void crearVentana(){         vAltas = new VentanaAlta();         vAltas.setVisible(true);                  }   //(errorline 32) llenarCombobox();   In the code you will see comments that shows the errorlines.  I have tried to be clear with the image and with the code comments, sorry for my englis i did my best.  Global Variables. aPersonas arrayList. cbPuesto is a combobox. llenarCombobox(cbPuesto); its the method to fill the combobox.


UK Standard Visitor visa eligibility criteria

I'm Syrian, I have an EU Student Residence Permit and soon I'll have an EU Working Residence Permit. I'm planning to visit London.   I need to have a . In applying, there are  criteria I need to prove, which are:   You’ll leave the UK at the end of your visit You’re able to support yourself and any dependents for the duration of your trip You’re able to pay for your return or onward journey and any other costs relating to your visit You have proof of any business or other activities you want to do in the UK, as allowed by the Visitor Rules   For the first point, I think it's enough to have the return ticket.  I don't think I need to do anything regarding the fourth point.  My questions are about the second and third points.   Regarding the second point: how can I show that I'm able to support myself and any dependents for the duration of your trip? Regarding the third point: it has two things, first pay for your return or onward journey, which I can handle by showing the returning ticket, but what about any other costs relating to your visit?    I see that they're focusing mainly on being able to handle myself financially, how can I prove that?  I have a job from an EU country, would that be enough?  Update  I understand now that even for the first point, having the return ticket is not enough.


How to put an ending sign within equation for theorem-alike environments?

Thanks to an answer to my question asked here, I used the following codes to generate for each theorem-alike environment exactly one square symbol as the ending sign:  \documentclass[12pt]{amsart} \usepackage{manfnt} \makeatletter \renewcommand\@endtheorem{\vvv@endmarker\endtrivlist\@endpefalse} \newcommand\vvv@endmarker{% {\unskip\nobreak\hfil\penalty50 \hskip2em\vadjust{}\nobreak\hfil\openbox \parfillskip=0pt \finalhyphendemerits=0 \par \penalty 10000 \parskip=0pt\noindent}\ignorespaces} \makeatother  \newtheorem{thm}{Theorem}  \begin{document} \title[]{Title} \author[]{Author}  \maketitle  \section{Proofs} ... The above argument proves the following theorem: \begin{thm} There are infinitely many integers $x, y, z > 0$ such that \[ x^{2} + y^{2} = z^{2}.\] \end{thm}   \end{document}   However, how do I make the square symbol, the ending sign, lie within the displayed equation? I tried \qedhere but nothing happened.


$y^2-7=x^3$ has no solutions in positive integers

Prove that there does not exist any positive integer solutions to the equation: $y^{2}-7=x^{3}$


What is needed to start playing D&D (minimal)

Me and my friends are looking into starting to play D&D. We try to get the minimal necessary books to start whit. I know that the easyest way is to get a red box but its currently out of our price range.   I was looking into the starter kit book ->   But i fell like i would need the player guid and monster guide to because they are offen bought in a bundle. Is there a way to get D&D book in digital, except the novels of course.   What is the minimal books we nead to start playing ? Of course we would get more stuff later on. And for the field we would use some home made tokens and re-drawable mat.   We would like to start whit 4.0. Thats the lattest right ?


Why the action of a relativistic point particle is considered to be negative?

The action of a relativistic point particle is its negative rest energy along its worldline, the parameter being its own proper time. $$ S = - mc^2 \int d\tau $$    Is there a particular reason why the action is considered to be negative?


I Have Question, How to bulk / batch rename in terminal ? i use ubuntu 16.04 64 bit example i have 5 file (GreatSoftware) AVG Anvitirus - 1.exe (GreatSoftware) Windows Media Payer - 2.exe (GreatSoftware) Winamp - 3.exe (GreatSoftware) CorelDraw - 4.exe (GreatSoftware) Chrome - 5.exe  rename to Joesoftware AVG Anvitirus - 1.exe Joesoftware Windows Media Payer - 2.exe Joesoftware Winamp - 3.exe Joesoftware CorelDraw - 4.exe Joesoftware Chrome - 5.exe  please help, I want a script that I understand enough of this problem thank you


Why does printing the same byte array result in two differing strings when printed to the console?

I've been implementing an Android app which communicates with a Java server, and they send byte arrays back and fourth. When I use Arrays.toString(byte[]) then everything works as expected, however this is not the case with printing to the console. Here I print a byte array to the console in Android:  Log.d("byte array test"" + new byte[]{109, 89, -47, 12, 80, -13, 27, -9, 1, 117, -128, -98, 31, 2, -79, -36, -38, 78, -88, 74, 78, 105, 8, -53, 63, -96, -126, 85, -63, -105, 96, 124});   Which produces the following output:  D/byte array test: [B@b4938b   On Java:  System.out.println( new byte[]{109, 89, -47, 12, 80, -13, 27, -9, 1, 117, -128, -98, 31, 2, -79, -36, -38, 78, -88, 74, 78, 105, 8, -53, 63, -96, -126, 85, -63, -105, 96, 124}  "");   Which produces the following output:  [B@43556938   Can anyone explain why? To the best of my understanding, they're both strings, so they both should produce the same output. Encoding is the only reason I could think of a difference, but I don't have much experience with that, so I'm not sure.


I’ve read on various posts on gamefaqs that you can’t grind on Hard/Classic because maps are tied to some “activity points” while on Normal there should be a map you can repeat again and again  I’ve been playing on Normal/Classic though, but I don’t see this map. All maps cost 1.  I am on the beginning  of august, just received the sword of the creator.  How can I grind in this mode? I’m not even actually looking to maximize my character level, I just want to get all Class Masteries.  Edit: I don’t see the infinite map mentioned in the linked possible answer...


$p = x^2 + xy + y^2$ if and only if $p \equiv 1 \text{ mod }3$?

For a prime number $p \neq 3$, do we have that$$p = x^2 + xy + y^2$$for some $x$, $y \in \mathbb{Z}$ if and only if$$p \equiv 1 \text{ mod }3?$$I suspect this is true from looking at the example$$7 = 2^2  + 2 \times 1 + 1^2.$$Here is a thought I have so far that might be helpful towards solving this: I know that $$\mathbb{Z}[(1 + \sqrt{-3})/2]$$is a PID. But I am not sure what do from here. Could anybody help?


How to locate most important literature in an unfamiliar area

I'm a pre-doctoral researcher (does it exist?) figuring out my true interests and learning the craft. When I start exploring a new (that is, unfamiliar) area, I try to find the most influential literature and scholars in that area through a haphazard and unsystematic process (such as starting with some highly-cited papers, consulting their list of references etc.). And because this is an unsystematic process, I'm never sure that I've not left unexplored some really important work.   I wonder if there's a more efficient process. How do you all go about this?  Also, (and this is a more specific question) what are some online forums where I can ask for more experienced researchers' opinion about what they consider to be the most important literature in a particular area?  Edit: To add some context, I work as a researcher in a US business school. My main area of work is entrepreneurship. Since this is an interdisciplinary subject, I have to consult literature in a wide variety of fields (some recent examples: psychology, complexity science, economics; of course, I access a very small part, the part that is the most relevant to my question). Entrepreneurship itself is in the process of defining its own scope and boundary.


Too big addon list, what should I do? How expand names and keep it all?

There are many addons. Do you know how show it in two cloumns?


Select in union of sorted arrays: Already known?

I am looking for bibliographic references for the following algorithm/problem: I named it "BiSelect" or "t-ary Select" or "Select in Union of Sorted Arrays", but I guess it was introduced before under another name?  Problem  Consider the following problem:     Given $k$ disjoint sorted arrays $A_1,\ldots, A_k$, of respective sizes $n_1,\ldots,n_k$, and an integer $t\in[1..\sum n_i]$, what is   the $t$-th value of their sorted union $\cup_i A_i$?   Solutions  There is a very simple and elegant algorithm running in time $O(\lg\min\{n_1,n_2,t\})$ if $k=2$: if $k=2$, just compare $A_1[t/2]$ with $A_2[t/2]$ and recurse on $A_1[t/2..t]$ and $A_2[1..t/2]$ or $A_1[1..t/2]$ and $A_2[t/2..t]$ accordingly, in both cases with parameter $t/2$ (and some minor optimizations when $n_1$ or $n_2$ are smaller than $t$).  This generalizes to a slightly more sophisticated algorithm running in time $O(k\lg t)$ for larger values of $k$, based on computing the median of the values $A_i[t/k]$ for $i\in[1..k]$: the $t/k$  smallest elements can be further ignored in the $k/2$ arrays where $A_i[t/k]$ is smaller than the median, and the elements of ranks in $[t-t/k..]$ can be further ignored in the $k/2$ other arrays, resulting in a halving of $t$ in each recurrence (and a cost of $O(k)$ for the median).  References?  I am happy with my solution(s), but I suppose that the problem (and its solution) was already known. It is related to the linear time algorithm for computing the median (by sorting groups of size $5$, and recurse on the median of their middles), but is slightly more general. I asked several colleges at Madalgo in Aarhus (Denmark), and then some others at the workshop Stringology (Rouen), without success:  I am hoping that someone more knowledgeable might help on Stack Exchange...   Motivations  Solutions to this problem have applications to Deferred Data Structure on arrays (indeed, it can be seen as an operator in a deferred data structure for the union of sorted arrays); and in a more convoluted way, to the adaptive computation of optimal prefix free codes.


Why doesn't the command "ls | file" work?

I've been studying about the command line and learned that | (pipeline) is meant to redirect the output from a command to the input of another one. So why does the command ls | file doesn't work?  file input is one of more filenames, like file filename1 filename2  ls output is a list of directories and files on a folder, so I thought ls | file was supposed to show the file type of every file on a folder.  When I use it however, the output is:      Usage: file [-bcEhikLlNnprsvz0] [--apple] [--mime-encoding] [--mime-type]         [-e testname] [-F separator] [-f namefile] [-m magicfiles] file ...     file -C [-m magicfiles]     file [--help]   As there was some error with the usage of the file command


Does Lucio's aura look like a sphere or a cylinder?


I am practising interview for Jane Street's trader internship and I found the following question.     Question: Calculate $2^{5104} \bmod  10$ using mental arithmetic.    I know that $2^5 \bmod 10 \equiv 2 \bmod 10.$ So,  \begin{align*} 2^{5104} & = (2^5)^{1020} 2^4 \\ & \equiv 2^{1020}2^4 \\ & = (2^5)^{204}2^4 \\ & \equiv(2^5)^{40}2^8 \\ & \equiv (2^5)^8 2^8 \\ & \equiv (2^5)^3 2 \\ & \equiv 6 \bmod 10. \end{align*}  However, I find the calculations above very taxing if I use mental arithmetic. I believe there should be a faster way to answer the question but I am not able to find one.


I have downloaded  and successfully installed on my Windows machine. But, I didn't find Scott schema in it. During installation, I didn't get any option where it asked to create sample schema. Could anyone suggest how to get scott schema in Oracle XE 11.2 ?  List of users :


How to equip a bike to avoid parts being stolen

I'm looking for a bike (road bike) in Paris, to move around and avoid train and subways. The only thing that I don't want, is to see my bike stolen a week after I bought it.   What are the good ideas to keep it's bike when riding in town ? What equipments can be put to avoid parts to be stolen (like the seat, the wheels etc.) ?   EDIT   Are there any cheep brands that sell bikes with equipment that cannot be taken from the bike ?


How to automaticaly enter sudo's grace period upon login

Knowing that giving a user a sudo's grace period right from the point when he/she login might be a security issue, I still think it will be a beneficial trade-off between security and usability in my setup.  The question is: how to do that? As far as I know, the sudo doesn't provide CLI for it.  I might somehow divert the gdm's typed password to something like sudo false, but again: how to get hold of the provided by the user password in the plain text? Should I write a custom pam module for it?  Or maybe it is better to immerse into implementation details of the sudo and as a root directly manipulate the timestamp database?


I've often come across posts on forums or other websites where you see people joking in such a manner about running/logging in as root as if it's something awful and everyone ought to know about it. However, there isn't much that a search reveals on the matter.   It may be widely known to Linux experts, but I really don't know why. I remember always running as root when I first tried Linux years ago (Redhat and Mandrake) and don't remember running into any problems because of that.   There are actually some distros that have a bright red background with alert signs all over it as wallpaper for the root user (SuSe?). I still use the "Administrator" account for regular use on my Windows installation and haven't ever run into any problems there either.


Javascript delete object items leaves null traces

I have a object from a Youtube api call, let's call it myObj I do a for loop and delete items I don't like with: delete myObj.items[i]  the problem is it leaves "null" traces of items deleted this way, when i then log myObj again using JSON.stringify it looks like this: myObj now is: {"kind":"youtube#SubscriptionListResponse","etag":"xxxxxxxxxxxxx","pageInfo": {"totalResults":14,"resultsPerPage":30},"items": [{"kind":"youtube#subscription","etag":"xxxxxx","id":"xxxxxxxxxx","snippet":{"publishedAt":"2020-12- 17T18:01:20.892352Z","title":"A Channel","description":"","resourceId": {"kind":"youtube#channel","channelId":"xxxxx"},"channelId":"xxxxxx","thumbnails":{"default": {"url":"xxxxxxxxxxxxxxxxxx"},"medium":{"url":"xxxxxxxxxxxxxxxxx"},"high": {"url":"xxxxxxxxxxxxxxx"}}},"contentDetails":{"totalItemCount":17,"newItemCount":0,"activityType":"all"}} ,null,null,null,null,null,null,null,null,null,null,null,null,null]}  it works since it only keeps the "A Channel" item which is correct, but all the other items turn into null, and it's a problem for something like myObj.length later on. I've read other threads about the issue, but they either reccomends using delete, which clearly doesn't work for my case, or splice (which doesn't work on my object from my understanding)


If you know ahead of time that you're going to be missing a player, do you reschedule? Or just play them as an NPC or as a group puppet?


Is it possible for a series of conductors carry massive currents(100 kA) at voltages over 100V? Assuming there is massive cooling. How can power plants carry MegaWatts of power?


installing QGIS plugin not listed in plugin manager

I'd like to install rasmover.py which I've been able to find in github  ... I'm working with rasters that cannot be georeferenced precisely ... rasmover may allow me to adjust rasters to a best fit ... any advice on how to install plugins not listed in plugin manager?


Proper usage of "is" and "are" when specifying multiple nouns

This is one thing I never really bothered looking into, but have always been unsure of.     punching, kicking, slapping or slashing [is/are] strictly prohibited   That's what I'm trying to determine. Let's say multiple of these specified actions can occur simultaneously. Is it proper to use "is" or "are"?  This is going to be used in a short legal notice.


Do you win a game of Catan even if you don't realize you have won?

If someone "wins" the game and then all players count points and a different player realizes that if they had played their victory point, they would have won, who wins? The person who declared the win or the person who had enough points but didn't realize it, but figures it out when or after another person has declared victory. In other words, do you have to declare victory 'on your turn' to win? If your turn has ended, can you declare victory on someone else's turn?


Not able to upgrade ubuntu 19.10 to 20.04. I am getting following error

Traceback (most recent call last):   File "/usr/bin/do-release-upgrade", line 130, in <module>     useProposed=options.proposed_release)   File "/usr/lib/python3/dist-packages/UpdateManager/Core/MetaRelease.py", line 100, in __init__     cache = apt.Cache()   File "/usr/lib/python3/dist-packages/apt/cache.py", line 170, in __init__     self.open(progress)   File "/usr/lib/python3/dist-packages/apt/cache.py", line 230, in open     self._cache = apt_pkg.Cache(progress) apt_pkg.Error: E:Malformed line 1 in source list /etc/apt/sources.list.d/additional-repositories.list (type), E:The list of sources could not be read.


I need to create new item to list..  $.ajax({         url: appWebUrl + "/_api/SP.AppContextSite(@target)" + "/web/lists/getbytitle('NewList')/items?" + "@target='" + hostWebUrl + "'",         method: "POST",         data:  JSON.stringify({ '__metadata': { 'type': 'SP.Data.NewListListItem' },         'Title': "TitleVal", 'Name':"Vikash"}),                headers: {              "Accept": "application/json;odata=verbose",             "X-RequestDigest": $("#__REQUESTDIGEST").val(),             "content-Type": "application/json;odata=verbose"             },         success: function (data) {               success(data);         },         error: function (xhr, status, error) {              console.log( " xhr.responseText: " + xhr.responseText + " //status: " + status + " //Error: "+error );             alert("error");         }     });   It shows error:-     Microsoft.SharePoint.SPException","message":{"lang":"en-US","value":"The   security validation for this page is invalid and might be corrupted.   Please use your web browser's Back button to try your operation   again."}}}   How to solve this error?


Is it possible to use HTML spellcheck to return a boolean value?

I'm trying to make a spellchecker feature in an web application. I know that html spellchecker is currently functional for input and textareas. I'm trying to spellcheck elements such as paragraphs, spans, etc.   What I have in mind currently retrieving the text in a container, splitting it so that I have all of the words in an array, checking if the words are grammatically correct, using js to create a input node, append each word in the array one at a time, and enable html spellchecker. But that would only work if it returns something.   Is it possible to return something like a boolean using HTML spellcheck?


Getting into a MA or PhD (psych) program with a weak gpa due to recently resolved medical issues? Does work experience replace a weak gpa?

I have been attending a university in my home state for 6 years. My gpa at the end of this semester is on track to be 2.6 overall. My first four years of courses are not representative of my capabilities, this is due to a major medical issue that involved multiple surgeries each semester and even more during summer breaks.  I have decided that psychological research is the career I wish to strive for, more specifically reseach in Autism Sectrum disorders and related Intellectual/developmental disabilities. Statistics is something I'm very passionate about. The grades I've receive in these type of courses are excellent and my over all gpa has been on a steady upward trend because of them.  Since my medical issues have been resolved I have been conducting solo research projects, participating research groups, have been working as a research assistant for professors (working on data analyses and the article for submission), presenting at regional conferences, acted as a teaching assistant for research oriented courses, and even tutored students struggling in stats(unofficially). I'm on track to receive As or Bs in the toughest courses the program has to offer. I have extensive experience in the specific field I wish to work in, 6 years work (5 providing direct to those who experience disabilities and 1 developing plans of care and assisting families attempting to receive funding for implementation of these plans) and a brother who experiences a similar disability.   I could go on about what I've have achieved despite my low gpa, but ultimately I feel the responses I've been getting when speaking to programs locally and abroad is that my gpa is to low and most reviewers simply pass over those not meeting the requirements (both MA and PhD). The program I'm currently most interested in does not utilize GRE scores in their admissions process.  Due to financial strain I may be forced to just graduate now and dive into the workforce. The jobs I have found are research related and I am a good candidate for the positions, only if I have a BA. If I choose to graduate and enter the workforce rather than retake classes until my gpa recovers, what are the chances of being accepted into program with a weak gpa and good work experience?   Thanks for your time!  Preston


Fresh install of Mac OS Sierra, fresh install of MacTeX. If I run with the terminal pdflatex I get   -bash: pdflatex: command not found    Any idea?  Thank you for help and answers.


Why can't we produce visible light from a radio transmitter?

Producing visible light from a radio wave transmitter: why is it not possible? If it is, what are the limitations?


How to make octave configure detect Qt in Ubuntu 14.04


Ubuntu(LTS 14.4.3) won't boot after installation

I installed Ubuntu 14.4.3 LTS in my home PC(gigabyte motherboard, AMD phenon X2 Processor and 4GB ram) but when i try to start in the next morning it won't start, stuck with "initramfs" prompt.


How to achieve speeds faster than light?

So, I heard that all speed is relative. And that nothing can travel faster than light. Then I guess it is OK for a spaceship to leave Earth at 0.6c constant speed. And what if an other spaceship were to leave Earth at 0.6c in the opposite spacial direction. Then the relative speed between the two ships would be 1.2c, which is greater than c. How would that work out? Maybe something with time dilation?


Couldn't find the exact scenario I'm trying to produce in other questions.  What I'm trying to do is:   BaseApplication     * App.xaml     * App.xaml.cs   SpecificApplication     * App.xaml : BaseApplication.App.xaml     * App.xaml.cs : BaseApplication.App.xaml.cs   But I get this:     'BaseApplication.App' cannot be the root of a XAML file because it was defined using XAML.   Does this mean BaseApplication's App class cannot have XAML?


I had a question in my school exam.  Will the average surface temperature of the Earth be lower or higher, if there was no atmosphere?  Now, the answer expected is "The avg temp will be lower, because of no greenhouse effect."  Isn't this an extremely myopic view of the whole situation? Places where it's night, the temperature will be sub-zero, and places where it's daytime, the temperature will be unbearably high, somewhat like on the moon, right? So the thing is, what's the correct answer? I know my education board is not something to be trusted, so please don't worry about their answer.


Please help me. How can I draw this using tikzpicture. Thank you.


How to create an array of unique elements from a string/array in bash?

If I have a string "1 2 3 2 1" - or an array [1,2,3,2,1] - how can I select the unique values, i.e.  "1 2 3 2 1" produces "1 2 3"    or  [1,2,3,2,1] produces [1,2,3]   Similar to uniq but uniq seems to work on whole lines, not patterns within a line...


How to install themes with GNOME tweak tool?

I have been using the default Ubuntu 11.10 with Unity for some time now and decided to start customizing it.  I have already been able to make some changes with the gnome-tweak-tool. However, there are many themes that I get from gnome-look.org that don't appear in the gnome-tweak-tool even after putting them in the /usr/share/themes folder.  Any idea why this is happening? Thanks.


Is there a way to remove or block external backlinks? There was a drop in the Google results from page 1-2 to page > 8.  I am now looking at the external backlinks and I see now multiple domains that I don't want them to be linked to our website ( sex sites, spi directories, ... ).  Also I have a domain with >1300 links on 1 page ( I see this in Google webmaster tools ). Can this also be the reason of the drop?


Is necessary to do a free(string) before end a program?

Suppose that I set a pointer in order to have a string, eg:   char *string = NULL; size_t size = 0; getline(&string, &size, stdin);   Is necessary to do a free(string) before end the program? As I could see in man, getline calls to malloc() and I have supposed it.


I saw a video where an ant lost its head and was still walking for some time.  If this is possible for an arthropod, what keeps it from working with a vertebrate? (Humans, especially)


In  when something acts on one particle the other one reacts also, just in reverse (more or less). From what I've read though, anything acting on either particle will collapse the entanglement, right? So how do we know they were ever linked? Or is it just measurements that collapse it?  The reason I ask is because given the public impression of the topic it would suggest on of two things. That the information causing the reaction is superluminal or that the particles are occupying the same space since they are in different states. If the second were true then distance must be a human construct and somehow they must still be in the same place regardless of the virtual distance between them.   To clarify, I don't mean information in regards to communication such as QC. Just particle information.


Best way to find and return a String of next day's date?

I used a basic technique to implement a method that finds the date of the next day based on the given parameter in the format YYYY-MM-DD and returns the next day in the same format.   Can you please take a look at the code and tell me if it is inefficient or not? It works perfectly fine, but I would prefer to implement a method with more efficiency and fewer lines of code if possible. Keep in mind that any values of the month or day that are single digits numbers have to be formatted with a 0 in the tens place.   public String nextDate(String date){ //ex: 2016-01-31 -returns-> 2016-02-01     int MMrange = 30;      String result = "";      String daystr = date.substring(8,10);     String monthstr = date.substring(5,7);      int day = Integer.parseInt(daystr);     int month = Integer.parseInt(monthstr);     int year = Integer.parseInt(date.substring(0,4));     if(month==1||month==3||month==5||month==7||month==8||month==10||month==12) MMrange = 31;     else if(month==2) MMrange = 28;     if(year%4==0&&month==2) MMrange = 29;     if(day==MMrange){         day =1;         month++;     }else if(month==12&&day==31){         year++;         month = 1;         day = 1;     }else{         day++;     }     result = Integer.toString(year)+"-"+Integer.toString(month)+"-"+Integer.toString(day);     if(month <=9&&day<=9) result = Integer.toString(year)+"-0"+Integer.toString(month)+"-0"+Integer.toString(day);     else if(month <= 9) result = Integer.toString(year)+"-0"+Integer.toString(month)+"-"+Integer.toString(day);     else if(day <= 9) result = Integer.toString(year)+"-"+Integer.toString(month)+"-0"+Integer.toString(day);     return result; }


In the equation: $$\sin(x) =  x\prod_{n=1}^\infty \left(1-\frac{x^2}{n^2\pi^2}\right),$$  I know that if I set  $$0 = x\prod_{n=1}^\infty \left(1-\frac{x^2}{n^2\pi^2}\right),$$ all of the roots are really going to be the roots of $\sin(x)$. But why is this generally equal to $\sin(x)$? How can I know that $\sin(2.285672364)$ will be $\prod_{n=1}^\infty \left(1-\frac{(2.285672364)^2}{n^2\pi^2}\right)$, for example? (I mean, how do I know that the graphs of both functions will be the same?). How can I assume that the coefficients of $\frac{\sin(x)}{x}$ in the product expansion are going to be the same of the sum expansion, i.e. in the Taylor series? $\left(\frac{\sin x}{x} = 1 - \frac{x^2}{3!} + \frac{x^4}{5!} - \frac{x^6}{7!} + \cdots\right)$ like Euler showed in the 'Basel problem', by saying: $$\frac{x^2}{3!} = \frac{x^2}{\pi^2}\left(\frac{1}{1^2} + \frac{1}{2^2} + \frac{1}{3^2} + \cdots\right)$$ So: $$\zeta(2) = \frac{1}{1^2} + \frac{1}{2^2} + \frac{1}{3^2} + ... = \frac{\pi^2}{6}$$


Assume that $1a_1+2a_2+\cdots+na_n=1$, where the $a_j$ are real numbers...

Assume that $$ 1a_1+2a_2+\cdots+na_n=1, $$ where the $a_j$ are real numbers. As a function of $n$, what is the minimum value of $$1a_1^2+2a_2^2+\cdots+na_n^2$$  There is a similar question on Math StackExchange, but nobody gave a solid and conclusive answer, so I felt the need to repeat it here. I also think this question should be solved using Cauchy-Schwarz, Mean Inequality Chain, or Trivial Inequality, but I would appreciate any answer. Thanks!


The Naboo Queen is elected, uses a decoy, and still uses her real name when in discise.   The fact that she's elected means that the people of Naboo and others that might follow the election know who is elected to be queen.  In order to protect herself, the queen has a number of handmaidens that will occasionally pretend to be the queen as she pretends to be one of them. This helps to protect her against assassination attempts.  However, while pretending to be one of the handmaidens, Padmé uses her real name. Would this not be the name she was elected under? If so, doesn't this make using a disguise useless? If not, how does the election process on Naboo work?


How many points/tangents do you need to define a unique circle?

Suppose I pick one random point in a plane, then there are many circles passing through it, then say I pick another point, there are a lesser number of circles passing through the two points. Now suppose I keep repeating this procedure, how many points should be taken at minimum such that they determine a unique circle passes through all of them? The answer is often said to be three, but why? Note: I want the points taken to be the ones on boundary of the circle which is drawn finally


Is AES (or DES) provably secure? What is the hardness assumption underlying these cryptosystems?

I have taken a course in applied Cryptography. I do not understand the hardness problem underlying AES (or DES).   As in RSA is based on the RSA assumption. ElGamal is based on the hardness of descrete logarithm problem. Most of the lattice crypto is based on the LWE assumption which itself is based on the hardness of BDD problem. What is the hardness problem that guaranties the security of AES? (Or DES)   In other words if there is an oracle R that can break AES. Can I use this oracle as a subroutine to solve some really hard problem? If yes, what is the reduction?


Browse an UNC path using Windows CMD without mapping it to a network drive

C:\> cd \\somewhere '\\somewhere' CMD does not support UNC paths as current directories.   What I usually do to get around this is to map that directory to a network drive and then I could easily access it from the command prompt.  But is there an easier way on how to get around this?


Can we say that the class of sets forms a monoid under set union?

I know that if for any set $U$, the power set of $U$ forms a monoid(a commutative one) under set union, because it is closed under the operation, is associative and it has an identity element $\emptyset$.  Following the argument that this is true for any set, it seems reasonable to think about the class of sets forming a monoid with $\emptyset$ as its identity, but, is it correct to say so? Or it must be a set even though there is a monoid for any set?


In Kotlin, why do each of my Floats occupy 128 bits instead of 16 bits?

I am trying to reduce the amount of memory footprint a huge data table (array) occupies during execution.  For that I am using JCMD to print the histogram.  However I found something funny here:   num     #instances         #bytes  class name ----------------------------------------------    1:      28409956      454559296  java.lang.Float    2:       3156662      227280584  [Ljava.lang.Integer;    3:       3156660      227279520  [Ljava.io.Serializable;    4:        526110       21044400  [[Ljava.io.Serializable;    5:        233936       17436808  [C    6:        241719        5801256  java.lang.String    7:         54517        3684696  [Ljava.util.HashMap$Node;    8:         93867        3003744  java.util.HashMap$Node    9:         74535        2981400  java.util.LinkedHashMap$Entry   10:         38269        2143064  java.util.LinkedHashMap   11:           190        2108240  [[[Ljava.io.Serializable;   12:         29416        1411968  java.util.HashMap   13:          5345        1400312  [B   You see that I have 28409956 instances of Float, and that the total RAM it takes is 454559296 bytes. If it divide the bytes / instances, I will get 16 bytes per Float...! This means each Float occupies 128bits!?  What am I missing?  How can I further reduce the memory these Floats (and the Integers -- I can't use Short) take?  Or better, how can I force Kotlin to use primitives (I only found out how to do it in arrays with IntArray, FloatArray, etc)?  Thanks!


Why is Long value not printed correctly in java?

i have declared Long checkRandom=0101010101l; but when I am printing checkRandom it printed checkRandom==17043521 what was the reason its taking checkRandom=17043521 not checkRandom=0101010101


Wrapping up my Genji Ult project! I have the materials, the animations, and the particles down! The only thing I need to do now is to add the smoke like substance that comes off of the dragon! It definitely moves like smoke but it also is green and glows. I know how to make the smoke green, but how do I make it glow? I have tried an emission shader on both the surface and volume parts of the smoke domain's material output node! It winds up just showing the surface of the cube.  The smoke looking material coming off the dragon. I'm using blender cycles to render a smoke simulation and can color the smoke with the volume material settings but cannot make it this as an emission shader is used for surface not volume so it will just show the box as well.


Why can't arrays be resized by reference in Java?

I was playing with arrays and manipulating them in different ways, and I stumbled across some very strange behavior! My initial concern was replacing an array with another one that might or might not be a different size, since it would be reading from a file of an arbitrary length. I decided to play with different things to see what all would happen. My first attempt was this:  public class RewriteArray {     public static void main(String[] args) {         String[] arr = { "1", "2", "3"};          System.out.print("Before rewrite: ");         for (String str : arr)             System.out.print(str + " ");         System.out.println();          changeArr(arr);          System.out.print("After rewrite:  ");         for (String str : arr)             System.out.print(str + " ");         System.out.println();     }      private static void changeArr(String[] arr) {         arr[0] = "3";         arr[1] = "2";         arr[2] = "1";     } }   This did what I expected, proving the change by referenced object, and gave the output:  Before rewrite: 1 2 3 After rewrite:  3 2 1   I then tried resizing the array within the changeArr method, and that's when things got weird.  public class RewriteArray {     public static void main(String[] args) {         String[] arr = { "1", "2", "3"};          System.out.print("Before rewrite: ");         for (String str : arr)             System.out.print(str + " ");         System.out.println();          changeArr(arr);          System.out.print("After rewrite:  ");         for (String str : arr)             System.out.print(str + " ");         System.out.println();     }      private static void changeArr(String[] arr) {         arr = new String[4];         arr[0] = "3";         arr[1] = "2";         arr[2] = "1";         arr[3] = "0";     } }   I would have expected arr to be replaced by a new object of the new size and then rewritten. Instead, I got:   Before rewrite: 1 2 3 After rewrite:  1 2 3   No errors or anything, but no changes in the array whatsoever! I then tried to resize the initial array by making a temporary one and re-assigning the pointer.  private static void changeArr(String[] arr) {     String[] tempArr = new String[4];     tempArr[0] = "3";     tempArr[1] = "2";     tempArr[2] = "1";     tempArr[3] = "0";     arr = tempArr; }   Again, the output was identical to the previous version! No errors, but no changes either. Just to be completely sure it was at least POSSIBLE to resize an array, I tried creating a temporary array in a separate method and returning the array.  public class RewriteArray {     public static void main(String[] args) {         String[] arr = { "1", "2", "3"};          System.out.print("Before rewrite: ");         for (String str : arr)             System.out.print(str + " ");         System.out.println();          arr = loadArr();          System.out.print("After rewrite:  ");         for (String str : arr)             System.out.print(str + " ");         System.out.println();     }      private static String[] loadArr() {         String[] tempArr = new String[4];         tempArr[0] = "3";         tempArr[1] = "2";         tempArr[2] = "1";         tempArr[3] = "0";          return tempArr;   } }   This time it finally worked! I got the following output:  Before rewrite: 1 2 3 After rewrite:  3 2 1 0   It certainly seems at this point that it's best to have to create the new temporary array in the separate method and return that array, then assign the returned array to the original one. I just don't understand why it's not working with the changeArr method internally. Isn't this passing references internally? If it wasn't, why would my first attempt work while the others didn't?


Are used Schengen/UK visas acceptable for Turkish e-visa

I got a UK visa for one month (restricted validity). It expires on November 4. Pakistani citizens are eligible to apply for a Turkish e visa if they have a valid UK visa. I want to visit Istanbul for a couple of days - from October 31 to November 2. Would I be eligible to still apply for an e visa?   My visa is for single entry. It's valid from October 4 to November 4.


Facebook, myspace, MSN, craigslist; all detect timezone and show times and dates correctly without ever submitting a form or reloading a page.  How do they do it? I have a pretty large site and have people publishing articles which need to display correct times (uploaded 3pm or 6pm depending on timezone).   Preloaders? Javascript? Loading the page and reloading it? My site currently has the person enter the site and upon first entry it reloads the page with updated information of their timezone through javascript. This is however a pretty annoying thing and am looking for another alternative. I know that upon loading I can send out an ajax request and then have it update everything throughout the site with the correct timezone for the user BUT if I have to click back, or reload it asks if I'd like to send the information again which is also bad. So how do they do it?  I was playing around with Facebook, changing my location on my local machine and it seemed to update the timezone every 5 minutes or so.   I am php, zend-framework based.


Using "random" module inside a loop outputs the same result

I'm trying to create a random map, with lists inside the main list representing the lines. The "createBlankMap" function works perfectly fine, for creating a placeholder map, and the "displayMap" function also works fine, for printing the map and changing the 0s or 1s to "." or "#". But when i try to update the blank map, using the "generateMap" function, all the nested lists get the same random generated value, instead of all of them generating random generated values.  # -*- coding: utf-8 -*- import random  def displayMap(canvas):     for i in range(len(canvas)): #LINE         for j in range(len(canvas[i])):             if canvas[i][j] == 0:                 print(".", end='')             elif canvas[i][j] == 1:                 print("#", end='')             else:                 break         print()  def createBlankMap(x,y):     MAP = []     LINE = []     for j in range(y): #COLUMN         LINE.append(0)     for i in range(x): #LINE         MAP.append(LINE)     return MAP  def generateMap(canvas):     for i in range(len(canvas)): #LINE         for j in range(len(canvas[i])): #COLUMN             choice = random.uniform(0,1)             if choice < 0.5:                 canvas[i][j] = 1             else:                 canvas[i][j] = 0     return canvas  displayMap(generateMap(createBlankMap(5, 10)))   The output is always like this: (remembering those values are randomly generated, so they're different every time i run the program).  ###.##.#.# ###.##.#.# ###.##.#.# ###.##.#.# ###.##.#.#   So basically, i want all the lines to have random generated values, instead of them repeating the first one.


Can we falsify photons having a tiny mass, experiencing subjective time, and traveling slightly slower than $c$ (like neutrinos)?

The measured speed of neutrinos can't be separated from $c$ within experimental limits.  The standard model includes no mechanism to grant neutrinos mass.  The mass of neutrinos can't be detected.  Nevertheless, if you were to conclude that neutrinos are massless you would be wrong (as they experience subjective time and so can't travel at $c$).  Can we falsify the hypothesis that photons have a tiny mass and travel just a little bit slower than $c$?  What's the largest mass photons could have?


How can I change the Game Mode of specific players? (in Minecraft 1.12)

I'm creating a Death Race map and I want to make sure only "OP's" can stay in Game Mode 1 and all the rest of the players stay in Game Mode 2 (in Minecraft 1.12)  I tried to leave a Command Block causing specific people to stay in Game Mode 1, but it is a map with a lot of players and I want to make it possible in the future to easily change who is in Game Mode 1 and Game Mode 2.


Given a finite measure space $(X,\Sigma,\mu)$, for $1<p<\infty$,  if $f \in L^p(X)$, then $f \in L^1(X)$.    Can anyone show me how to start the proof?  Thanks.


Implementing a one-time pad without binary?

I found a program which takes a purely alphabetical message, converts the letters to their ASCII values and combines them with the ASCII values of an alphabetical key (wrapping around when it gets to Z).  (The key being used is fully random and is required to be at least a long as the message.)  But from what I usually read about one-time pads, the message and the key are in binary, and the bits in the message is XORed with the key to produce the ciphertext. Combining the ASCII values sounds like a similar but obviously very different process.  Is this a valid way to implement a one-time pad? Or does the process merely resemble the binary XOR and doesn't have the same cryptographic properties as a one-time pad?


On Lubuntu 18.04, I though I am using Java 10, because  $ javac -version javac 10.0.2  $ java -version openjdk version "10.0.2" 2018-07-17 OpenJDK Runtime Environment (build 10.0.2+13-Ubuntu-1ubuntu0.18.04.4) OpenJDK 64-Bit Server VM (build 10.0.2+13-Ubuntu-1ubuntu0.18.04.4, mixed mode)   But I am not sure, because I seem to use Java 11. I am confused. Thanks.  $ sudo update-alternatives --config java There are 2 choices for the alternative java (providing /usr/bin/java).    Selection    Path                                            Priority   Status ------------------------------------------------------------ * 0            /usr/lib/jvm/java-11-openjdk-amd64/bin/java      1101      auto mode   1            /usr/lib/jvm/java-11-openjdk-amd64/bin/java      1101      manual mode   2            /usr/lib/jvm/java-8-openjdk-amd64/jre/bin/java   1081      manual mode  Press <enter> to keep the current choice[*], or type selection number:   $ sudo update-alternatives --config javac There are 2 choices for the alternative javac (providing /usr/bin/javac).    Selection    Path                                          Priority   Status ------------------------------------------------------------ * 0            /usr/lib/jvm/java-11-openjdk-amd64/bin/javac   1101      auto mode   1            /usr/lib/jvm/java-11-openjdk-amd64/bin/javac   1101      manual mode   2            /usr/lib/jvm/java-8-openjdk-amd64/bin/javac    1081      manual mode  Press <enter> to keep the current choice[*], or type selection number:         $ realpath /usr/bin/java /usr/lib/jvm/java-11-openjdk-amd64/bin/java  $ realpath /usr/bin/javac /usr/lib/jvm/java-11-openjdk-amd64/bin/javac


Wirtinger Inequality: $\int_0^1 f'^2 \geq \pi^2 \int_0^1 f^2 $

I have a  basic question  Let $f$ be a $\mathcal{C}^1$  map  from  $[0,1]$ into $\mathbb{R}$ vanishing in $0$ and $1$. I want to prove that   $$\int_0^1 f'^2 \geq \pi^2 \int_0^1 f^2 $$  and to see when we have equality.


Can WPF and WinForms be mixed within an application?

Can both WPF and Windows forms controls be used within one application? How difficult or practical an idea is this?


Can I modify the behavior of any dunder method of any class? For example, can I modify the behavior of the __add__ method of the str class? (Totally illogical, but I just want to know if the language is protected from accidental overrides or not.)


Isomorphism of product of local ring of variety

This is a proposition given in Fulton - Algebraic curves, section 2.9 Let $I$ be an ideal in $k[x_1,\cdots,x_n]$ ($k$ : Alg. closed field) and suppose corresponding variety $V(I)$ is finite. Then there exists an isomorphism $$k[x_1,\cdots,x_n ]/I \cong \prod_{p\in V}\mathcal{O}_p(V) $$ where $\mathcal{O}_p(V)$ is a local ring of $V$ at $p$. Since this book doesn't require the commutative-algebraic theorem, the proof is more or less elementary. However I already know the theorem, If $M$ is finite length $R$-module with $0=M_0 \subset M_1 \subset \cdots \subset M_n =M$ a composition series such that $M_i/M_{i-1} \cong R/P_i$ (so $P_i$ is maximal in $R$) then there exists an isomorphism $M \cong \prod_iM_{P_i}$.  I really think the above theorem comes from this theorem, but I can't show this directly when the case $I$ is not radical ideal. If $I$ is radical ideal, $k[x_1,\cdots,x_n]/I=\Gamma(V)$ is just a coordinate ring with finitely many maximal ideal $\mathfrak{m}_1,\cdots,\mathfrak{m}_n$ (since there is one to one correspondence between points and maximal ideal). Then we can find the composition series $$0=\mathfrak{m}_1\cdots \mathfrak{m}_n \subset \cdots \subset \mathfrak{m}_1 \subset \Gamma(V) $$. And in this case $0=\mathfrak{m}_1\cdots \mathfrak{m}_n$ is because $\Gamma(V)$ is nilpotent-free ($\because$ $I$ is radical) and by the CRT, the product of maximal ideals is just  set of nilpotent. Can this argument extended to non-radical ideal $I$?


Javascript difference between "=" and "==="

I am completely new to Javascript and im following a tutorial on ""  Had some struggles with functions so when i got some time to fool around i didn't know why my script wasn't working untill i changed = with ===, But why does === work and = not?  var testTest = function(answer) {     if (answer === "doggies") {        return "My favorite animal!";        } else {        return "Tested";     } }; testTest("doggies")   So when i type doggies it shows me My favorite animal! And when anything else Tested like it should.  But when i had = the else part wouldn't work.  var testTest = function(answer) {     if (answer = "doggies") {        return "My favorite animal!";        } else {        return "Tested";     } }; testTest("elephant")   I hope this makes sense to you.  ~Simon


How to know the number of subjects and events required for statistical significance?

Say I conduct a study where i measure physiological signal of a set of N subjects, to record a particular event. I am interested of the duration and the amplitude of that event. The study ends when I recorded M events per subject. I need M events per subject to analyse the intra-subject variability. I need N subjects to analyse the subject population variability. So, how can i know the minimum number of N subject and M event I need to record to get a statistically significant study ? from  i understand that it depends on several factors, but I would like to be able to compute those number for that particular exemple. The distributions will likely be Normal or a bit skewed. EDIT: may be this is not clear. I need to compare events in one individuals and events among individuals. But here, i have a sample of individuals that are them selfs composed of a sample of events. How i am supposed to sum up individuals to compare them ? do i even need to sum them up (i could just put all events i the same bag) ? And thus i wonder how N and M may influance each orther ?


This question is similar to  but is different enough I felt I should ask it separately.  I am wondering how long it will take a given institution to receive my General GRE scores from ETS.  Note: I am not asking how long it will take after I take a test for the scores to be sent.  These are scores from a test I took almost two years ago; I am asking how long it will take for scores already available to be sent and available.  If it matters, I am putting my score submission request into ETS on Jan. 2.  I don't know if some times of the year are busier for them than others and thus processing and sending times may vary.


I took an English assessment test online and this was my answer:     Someone suggested to go for a walk.   My answer was wrong and this was the correct sentence:     Someone suggested going for a walk.   Can someone please explain why my answer was wrong?


Regular Expression (match integer at specific line) json

HTTP/1.1 200  X-Application-Context: fss-proxy Date: Tue, 03 Apr 2018 11:38:13 GMT X-Content-Type-Options: nosniff X-XSS-Protection: 1; mode=block Cache-Control: no-cache, no-store, max-age=0, must-revalidate Pragma: no-cache Expires: 0 X-Frame-Options: DENY Access-Control-Allow-Credentials: true Access-Control-Allow-Methods: GET, POST, OPTIONS, PUT, DELETE, PATCH Access-Control-Allow-Headers: Authorization,Content-Type,If-Modified-Since,headers,If-Modified-Since Content-Type: application/json;charset=UTF-8 Transfer-Encoding: chunked Connection: close  18  activeSessionsCount=1  0   I have JSON here. And I want to grab only integer that may vary from 0 to like 200 or even more using regex in the current string "activeSessionsCount=1". Is it possible? I'm completely stuck here.


Why does this function have different answers, doesn't the function execute in where it was defined?

Why does ss() have different answers, doesn't the function execute in where it was defined?  var scope="global";    function t(){       console.log(scope);        function ss()     {         console.log(scope);       }       var scope="local";     ss(); }  t();  ss();   It logs:  undefined local undefined


Is referring to a specific definite person of KNOWN gender as "they" acceptable?

Egalitarianism and anti-sexism seem to be strict norms in English-speaking societies. I think a majority of people advocate the use of they when referring to a specific definite person whose gender is unknown to the speaker--as shown, for example, in the comments to the following youtube video:     For example, such people think the sentence Leslie did their best is acceptable, where Leslie is the name of a person whose gender is unknown by the speaker.  When gender is irrelevant or unimportant, referring to a specific definite person as he(she) when the person's gender is known by the speaker may be considered as sexist by those advocates of egalitarianism and anti-sexism.  So my question to ELL is this:      Is referring to a specific definite person whose gender is known by the speaker as they acceptable?   For example, is the sentence      The police officer John Smith did their best.    acceptable when the officer's gender is known to the speaker?  Remark Since this question has several downvotes, I would like to make it clear that my question is ABSOLUTELY NEUTRAL. It's just a question. No more or no less.


Regex to pick characters outside of pair of quotes

I would like to find a regex that will pick out all commas that fall outside quote sets.   For example:  'foo' => 'bar', 'foofoo' => 'bar,bar'   This would pick out the single comma on line 1, after 'bar',  I don't really care about single vs double quotes.  Has anyone got any thoughts? I feel like this should be possible with readaheads, but my regex fu is too weak.


Interplanetary conflict, some disease destroys the ability to understand or appreciate music

There is some kind of interplanetary conflict going on between different human factions (aliens may or may not be involved). As a relatively minor plot point a group of or all humans have lost the ability to appreciate or comprehend music through a virus or other disease. I believe it changed their DNA so the (loss) trait was inherited.


Blacklist.conf "Ignoring Bad Line Boot Prompt"

Alright Ubuntu wizards, I jacked up my system a bit unnecessarily, which is now giving me the chance to learn more about how to fix it...a vicious cycle. Anyway, I have it mostly up and running again to my liking, though I am receiving this (photo attached) prompt when my system boots:  libkmod: ERROR ../libkmod/libkmod-config.c:686 kmod_config_parse: /etc/modprobe.d/blacklist.conf line 56: ignoring bad line starting with 'rt2800usb'   Other users had success with just deleting the bad line from their blacklist.conf file, which I have done. Line 56 no longer exists, but I'm still receiving the same error. So am I missing something? Is there some follow-up command I need to give Ubuntu after saving the conf file?


I know that the Mass Effect 2 ending varies depending on the choices you make. I have a few questions about a specific aspect of the ending:      The survival of your crew depends on whom you choose for certain parts of the suicide mission.         1. Only the doctor was saved from the Collector base. Was it possible to save the rest of the crew if I had reached there earlier? Like, not trying to complete the squad and heading there the moment the Omega 4 relay was open?         2. At the last bit of the suicide mission, where you go in to blow up the place, you can choose only two members to accompany you (as usual). The rest stay back to keep the bad guys out. For me, at the end of the game, Miranda and Thane kicks the bucket. But who dies is different for different people. But what affects that? We dont get to choose who stays behind to provide cover. So why is it different for different people?


Proof there is a 1-1 correspondence between an uncountable set and itself minus a countable part of it

Problem statement:  Let A be an uncountable set, B a countable subset of A, and C the complement of B in A.  Prove that there exists a one-to-one correspondence between A and C.  My thoughts:  There's a bijection between A and A (the identity function).  There's a bijection between C and C (the identity function).  There's a bijection between B and $\mathbb{N}$.  That's all I know.


Knowing that $9a^2+8ab+7b^2 \le 6$, prove that $7a+5b+12ab \le 9$. I have found the same question , but the answer looks wrong. You can't just add two inequalities like him. It's like you would multiply the second one with $-1$, which changes its sign, and then add them.  Here is my try: $$9a^2 + 9b^2 + 18ab - 2b^2 - 10ab - 6 \le 0 \Longleftrightarrow\\ (3a+3b)^2 - 2(b^2+5ab+3) \le 0 \Longleftrightarrow\\ b^2+5ab+3 \ge 0 \Longleftrightarrow\\ 25a^2 - 12 \le 0 \Longleftrightarrow\\ a \in \left[-\frac{2\sqrt{3}}{5}, \frac{2\sqrt{3}}{5} \right]$$


User being downvoted for personal reasons

A couple days ago I asked this  concerning posting religious text in posts and refusing to edit them. Now because of the publicity of this user, I believe they are being  for no other reason than people disagreeing with their posts (or being frustrated, or whatever; basically they are being downvoted for an abnormal reason). The questions and answers that are being downvoted aren't bad by standards at all; as a matter of fact, several had  (+3) before being downvoted (4 times). So my question is, is this alright that the user is being "attacked" like this? I'm sure many other users have religious text and/or refuse to edit posts, and aren't downvoted.  Please note, I am asking this as a specific question because, for one thing, I feel a little responsible for the downvotes.  EDIT: I just noticed now the user's getting a recieving a flurry of upvotes...I understand why, but should votes be used just to cancel downvotes? Couldn't the downvotes be removed by a moderator or something?


I tried to change permission but it cannot.it says permission denied and operation denied how can i change the mode.. i tried every thing..    I have tried using sudo, but it gave this error  sudo chown bin ns-allinone-3.21 sudo: error in /etc/sudo.conf, line 0 while loading plugin sudoers_policy' sudo: /usr/libexec/sudo/sudoers.so must be only be writable by owner sudo: fatal error, unable to load plugins)