I have a computer running Windows 8 and I would like to run a Linux VM on it. I would, preferably, like to create a partition which both Linux (Ubuntu) and Windows can access to hold my source code on it.  I would like to have the linux VM read a hardware partition instead of a virtual HD and have Windows also be able to read it (thus, being able to run the same code from both OSes).  If I do this, what is the best filesystem to use? Is there a FS which will run optimally for both Windows 8 and Linux?

Possible Duplicate:          I'm planning to install Ubuntu 10.04 with Windows 7. (I'm new to Linux, have to use at work so I'm planning to install it at home to learn more)  I plan to use a partition to my Windows system files (C:), another for my personal files that already exists (D:) and a new one for Linux.  I want to have a partition for my personal files that works across these systems - so, if I boot with Windows or Linux, there are the same "Videos", "Pictures", "Projects" folders.  Is it possible? Is there a hd filesystem capable of having writes from both systems without too much risk of corrupting or something? (Can't be FAT32, I need to store >4gb files). I've read some  of corruption, and would like to know from a other people's experiences some POV about all the risks involved in such scenario.


The Fibonacci sequence is defined as the sequence where $F_1 = 1,F_2= 1$ and $F_i=F_{i-1}+ F_{i-2}$.  Use induction to prove the  that for $n\ge 2$, $$F_1+F_2+ \ldots+F_{n-1}=F_{n+1}-1$$

I have a Fibonacci problem ... basically I have to show that:  $$F(n+2) = 1 + \sum_{i=0}^{n} F(i)$$  Using strong induction, I must now show that:  $$F(n+2) = F(n+1) + F(n)$$ $$F(n+2) = (1 + \sum_{i=0}^{n-1} F(i)) + (1 + \sum_{i=0}^{n-2} F(i))$$ $$F(n+2) = 2 + \sum_{i=0}^{n-1} F(i) +  \sum_{i=0}^{n-2} F(i)$$    How do I add these two summations to show that they equal the first equation (at the top)?  Please provide the steps with explanation as to what you are doing. Thanks


I've come across a few different sources on expectation-maximisation which I can't quite match up.  The CS229 lecture 8 [1] states that the function we must write down and maximise is:  $$ Q_1 = \sum_{i}\sum_{z_i}p(z_i|x_i, \theta)\log\frac{p(x_i, z_i| \theta)}{p(z_i|x_i, \theta)} $$  Which we can write as an expectation  $$ Q_1 = \sum_{i}\mathbb{E}_{p(z_i|x_i, \theta)}\left[\log\frac{p(x_i, z_i| \theta)}{p(z_i|x_i, \theta)}\right] $$  Other sources including Tanner's book [2], Bishop's book [3] and the Probabilistic Perspective book [4] state the $Q$ function as:  $$ Q_2 = \sum_{i}\mathbb{E}_{p(z_i|x_i, \theta)}\left[p(\theta| x_i, z_i)\right]. $$  Both sources agree that the expectation is taken over the $z$'s posterior distribution but the arguments in the log are different.  I've tried applying Baye's rule to the term in the log in $Q_2$ which gives  $$ p(\theta| x_i, z_i) = \frac{p(x_i, z_i | \theta)p(\theta)}{p(x_z, z_i)}. $$  This has the $p(x_i, z_i | \theta)$ term we want in the numerator but the rest doesn't work.  What am I missing, is it something to do with the expectation being conditional on $x_i$ and $\theta$?  [1]   [2]   [3]   [4]

I've heard that the EM algorithm ensures that the true likelihood is non-decreasing at each iteration of the algorithm, but I'm not sure why this is the case. I've provided a basic plot which I believe to illustrate the difficulty I have in understanding this.  To frame the question, let's first consider the EM algorithm decomposition, where $x$ is the observed data, $z$ is the missing data, $\theta$ represents the parameter set.  $$ L(\theta) \equiv \text{ln}P(x|\theta) = \text{ln}\left[\sum_{z}P(x|z,\theta)P(z|\theta)\right] $$  Multiplying by $\text{ln}\left[\frac{P(z|x,\theta\prime)}{P(z|x,\theta\prime)}\right]$ and adding and subtracting $L(\theta\prime) \equiv \text{ln}P(x|\theta\prime)$ yields  $$ \text{ln}\left[\sum_{z}P(x|z,\theta\prime)\frac{P(x|z,\theta)P(z|\theta)}{P(x|z,\theta\prime)}\right] - \text{ln}P(z|\theta\prime) + L(\theta\prime) \\ \geq \sum_{z}P(x|z,\theta\prime)\text{ln}\left[\frac{P(x|z,\theta)P(z|\theta)}{P(x|z,\theta\prime)P(z|\theta\prime)}\right] + L(\theta\prime)\ldots (\text{by Jensen's inequality}) \\ = \sum_{z}P(x|z,\theta\prime)\text{ln}\left[\frac{P(x,z|\theta)}{P(z,x|\theta\prime)}\right] + L(\theta\prime) \equiv B(\theta,\theta\prime) $$  This represents the expression we want to maximize in the EM process; from this, we can see that $L(\theta\prime)$ is a lower bound for $L(\theta)$ (this bound is realized when $\theta$ is equal to $\theta\prime$).  Now assume two possible entry points (theta$\prime$1 and theta$\prime$2) to the EM process exhibited in the plot below. In this plot, the true likelihood is given by the L(theta) (blue) line whilst the function to be maximised is given by the B(theta,theta$\prime$) (orange) line.  The local maximum corresponding theta$\prime$1 (which corresponds to the lower bound scenario mentioned above, L(theta) = L(theta$\prime)$) does indeed increase L(theta); however, the local maximum corresponding to theta$\prime$2 doesn't increase L(theta). What's to prevent the theta$\prime$2 scenario from happening?    Also, I've also heard that the role of the expectation step is to equate $P(x,z|\theta)$ and $P(z,x|\theta\prime)$ which would achieve the lower bound scenario above, but I'm not sure how this works. I suspect that this property is linked to the answer to the above question. Perhaps somebody could elaborate on this.


I have a quick question that I have seen a variation of before but nothing that is similar to my situation (from what I have seen). I was issued a Type D multi-entry visa from France my study abroad program this fall that is multi-entry. When I applied for the visa I told VFS global that I was going to be going to Spain before on vacation and then heading to France for my program. They never mentioned that I would need to exit Schengen before I go to France for my study abroad program, but then I came across this forum and I see some people saying that you have to exit before I go to my program and I am seeing some saying that I can just go straight to France from my program. Also I am a US citizen so I am allowed to be a tourist without a visa.I did contact the consulate in my country by email but all they responded with was a very obvious copy and paste from a website answer where they did not respond to my question at all but only said that after I travel as a tourist up to 90 days and then  "I can exit and re-enter on my french student visa"(which I am only going to be in Spain for a month)  So my main two questions are:   Do I need to exit Schengen before I fly to France for my program (I will be in Barcelona with my family and have no plans of going to france before the start of my program) If my program begins the 31st and my visa is issues starting August 10th, will it be an issue that I don't fly to France until the 31st?   !!UPDATE!!:  Okay, so I called VFS because the closest consulate to me told me to call them about my question. VFS stated that as long as I am not a tourist for more than 90 days (I am one for technically 6 days because my visa starts a few days after I arrive in Spain) and there isn't a gap between the dates I am a tourist (for 90 days) and the start date of my visa in France then I DO NOT need to leave the Schengen. He explained to me that my visa automatically starts on the start date of my visa. France will see that I am within the dates of my visa (I go 3 weeks after the start date of my visa because that's when my program starts) and stamp my passport.    So it seems like all the other advice given on similar questions about going from a tourist to a vias holder is correct!

I know that this question has been answered to some degree through other posts, but my question is this:  If my type-D visa to Portugal is valid as of April 16th, 2017, may I enter Portugal or any other Schengen country prior to this date under the terms of the 90-out-of-180 day tourist visa waiver granted to US citizens?  That answer seems to be a relatively straightforward "yes" - anyone disagree?  Specifically, if I were to enter Portugal or another Schengen country before my type-d visa was in effect (let's say March 15th, for example), and got my passport stamped at port of entry as a normal US tourist, how then, come April 16th, would I "activate" the visa?  Would I need to leave the country/Schengen zone and come back in order to have border control see and stamp/activate my visa or would it be assumed, if I was already in the country, that as of April 16th the visa becomes valid and I would have to do nothing?  If I was in a different Schengen country - Spain for example - how would I then register my presence in Portugal as of April 16th since there are no border checks between Schengen countries?    If anyone understands and can explain the mechanics of this, I would be very grateful.  I can understand the legality of coming in advance because I have that privilege anyways in the Schengen zone as a US citizen, but how to then migrate from tourist status to active visa status - do I need to do anything?  Thanks.


How long should I wait until the warning of new LTS release upgrade will appear on update-manager? After 5 days from the first point release (20.04.1) nothing appears... I enabled "notify me on new LTS"...

I've understood that when I run the Software Updater GUI program, or when I execute do-release-upgrade on the command line, it should offer to upgrade to the latest LTS release if (1) I've got the release update behaviour set to lts, and (2) if the first point release of a newer LTS release is available. I have a couple of machines running the Xubuntu LTS release 18.04. The contents of file etc/update-manager/release-upgrades on all these machines is [DEFAULT] Prompt=lts  That satisfies condition (1). Also, it seems that Xubuntu 20.04.1 is already released, satisfying condition (2). However, neither do-release-upgrade nor the Software Updater offers to upgrade to that release. Why? Edited to add: It seems this question is a duplicate of .


I've been playing on a Minecraft world (1.15.2 Java edition) for quite a while and one day I tried to open that world but just after the chunks loaded, my laptop crashed. I went back on to Minecraft and my world wasn't in the world list. I looked this up on Google and everyone said to check my saves folder. I did this but my world wasn't there. I haven't ever made a backup of the world because I didn't think a problem like this was likely. I've spent hours on this world. Can someone please help?

I was playing on my main world when my laptop ran out of power.  I found a charger and woke it up, but Minecraft had crashed.  Now, it doesn't appear in the world selection screen!  I have verified that it still exists in the Minecraft folder, and the directory contents look to be in order.  Does Minecraft save an internal flag somewhere when it crashes hard?  If so, how do I reset it?


I am reading Enderton's book  and I am having hard time understanding Infinite cartesian product section in which he define's product of $H(i)$'s.   Could you please explain in other simple words or by giving an example.  PS : I am a self learner  Thanks.

(1) If $X$ and $Y$ are two sets, we define the Cartesian product $X \times Y$ as the set of ordered pairs $(x,y)$, such that $x \in X$ and $y \in Y$.  (2) On the other hand [Folland, Real Analysis, page 4], if $\{X_\alpha\}_{\alpha \in A}$ is infinite indexed family of sets, their Cartesian product $$ \prod_{\alpha \in A}X_\alpha $$ is defined as the set of maps $f: A \to \bigcup\limits_{\alpha \in A} X_\alpha$ such that $f(\alpha) \in X_\alpha$ for every $\alpha \in A$.  After saying this, Folland remarks:     it should be noted, and promptly forgotten, that when $A = \{1,2\}$, the previous definition  of $X_1 \times X_2$ [that's (1) above] is set-theoretically different from the present definition of $\prod_1^2 X_j$ [that's (2) above]. Indeed, the latter concept depends on the mappings, which are defined in terms of the former one.   I am not grasping this remark. Specifically, here are my questions.  Question 1: How is (2) set-theoretically different from (1)? A simple illustrative example?  Question 2: If (1) is extended to infinite families, which definition would be stronger? A simple illustrative example?  Question 3: Why should this be "promptly forgotten"?  I'll probably have more questions depending on the type of answers I'll get to these.  Thanks!


I am trying to figure out if its possible to -- from within the command-line -- enable/disable the webcam, with a command that can be ran through a keybind? My laptop, a Thinkpad T450 doesn't have a hard switch to turn off the webcam, and it is a security feature I'd really like to have. Preferably something that can be done without a computer restart would be ideal! Thanks!

I have an integrated webcam in my laptop. I know that it works and that ubuntu recognized it because at installation it asked if I wanted a photo taken for some kind of image associated with my account. When I look in system settings, I do not see any webcam in the hardware section. I would like to disable the webcam like you can do in Windows, but as I can't find it in my hardware section, how can I disable it? I cannot even unplug it as it is integrated into the monitor. Am I looking in the wrong place?? I am using 12.04


When I try to join my brothers world, it will not show up for me and vice versa. This happens despite us being a few feet from each other. We currently have MCPE version 1.0.

My LAN server won't let my cousin join me or me join my cousin. It won't show up on the multiplayer screen - it keeps saying "scanning for LAN servers" but it never finds it. I am at his house and we use different computers but it won't connect. How can I fix this?


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.

Let's say $G$ is some additive subgroup of $\mathbb{R}$ that has at least two elements.   From what I understand, $G$ is then either dense in $\mathbb{R}$, or has some least positive element. What is the reason for this?


We are currently facing attacks (probably DDOS) on our server. The incoming network traffic goes from an average of 20Mbps to 1Gbps in just 2-3 minutes. The lines in our log files usually look like: 101.101.101.101 - - [23/Nov/2020:01:01:01 +0200] "GET /wp-content/uploads/image.png HTTP/1.0" 200 425 "https://mypage.com/" "Mozilla/5.0 (iPhone; CPU iPhone OS 14_2 like Mac OS X) AppleWebKit/604.1.15 (KHTML, like Gecko) GSA/100.00 Mobile/15E100 Safari/604.1"  However, in the time frame of the attacks the lines look like: 101.101.101.101 - - [23/Nov/2020:01:01:01 +0200] "GET / HTTP/1.0" 200 18710 "https://www.qq.com" "Mozilla/5.0 (iPhone; CPU iPhone OS 14_2 like Mac OS X) AppleWebKit/604.1.15 (KHTML, like Gecko) GSA/100.00 Mobile/15E100 Safari/604.1"  So instead of my page, some other websites are somehow called. Beside qq.com, the urls reddit.com, baido.com and some others are called thousands of times. So to my questions:  What does the second entry exactly mean and how does this produce traffic on our server? How can we prevent such requests (firewall, fail2ban etc are already set)?

This is a  about DoS and DDoS mitigation.   I found a massive traffic spike on a website that I host today; I am getting thousands of connections a second and I see I'm using all 100Mbps of my available bandwidth.  Nobody can access my site because all the requests time out, and I can't even log into the server because SSH times out too!  This has happened a couple times before, and each time it's lasted a couple hours and gone away on its own.  Occasionally, my website has another distinct but related problem: my server's load average (which is usually around .25) rockets up to 20 or more and nobody can access my site just the same as the other case.  It also goes away after a few hours.  Restarting my server doesn't help; what can I do to make my site accessible again, and what is happening?  Relatedly, I found once that for a day or two, every time I started my service, it got a connection from a particular IP address and then crashed.  As soon as I started it up again, this happened again and it crashed again.  How is that similar, and what can I do about it?


Maybe I'm just missing something obvious, but what's up with this syntax? Is it because people sign up with e-mail addresses and use those for logging in, but don't bother giving themselves custom names (or completing their profile in any way)?

I just saw a user named: .yahoo.co.jpaqwsykcj3aulh3h1k0cy6nzs3isj  Could new users be named according to their user-number, or something other than "Unknown"? Perhaps User1234567 instead? It would be less awkward to address them in answers and comments.   Additionally, I often times have to check profiles to make sure users aren't abusing the system, since I find many of the same questions from "unknown (google)" from time to time. That, or I'll mistakenly think I've helped the user on a similar issue in the past, and assume the user has knowledge that he or she does not have.


I have a local wifi "hotspot" with various devices on it. I have a second hotspot which provides internet access (android).  I have a Ubuntu PC with two wireless cards - one connected to the android hotspot for internet access and the other connected to the private hotspot.  How do I configure my linux PC and other linux devices on the private network to allow temporary access to the linux devices on the private network?

Can anyone assist with a linux routing question? Essentially I want to use an Ubuntu laptop to provide internet access to an attached network.  I have a Raspberry pi on a wifi network (192.168.42.0/24). Its ip address is 192.168.42.20.   Internet access is provided by a cell phone hotspot. (192.168.43.0/24). The internet gateway is 192.168.43.1  I have a linux laptop (Ubuntu) with two wifi cards - one on each of the above networks. (192.168.42.21 & 192.168.43.10)  I also have another network connected on the ethernet card which successfully shares the internet connection with clients. This network is 10.42.0.0/24.  The laptop is a DHCP server in this case and its ip is 10.42.0.1  I am trying to use the laptop to provide an internet access route for the Pi I have added the following iptable rules to the laptop. They are derived from the forwarding rules for the 10.42.0./24 network which as I say can connect to the internet.  -A FORWARD -d 192.168.42.0/24 -o wlx801f0281f02a -m state --state RELATED,ESTABLISHED -j ACCEPT -A FORWARD -s 192.168.42.0/24 -i wlx801f0281f02a -j ACCEPT -A FORWARD -i wlx801f0281f02a -o wlx801f0281f02a -j ACCEPT ip_forwarding is enabled   I have added a route on the Pi. The route table now reads:  Kernel IP routing table Destination     Gateway         Genmask         Flags Metric Ref    Use Iface 0.0.0.0         192.168.42.21   0.0.0.0         UG    0      0        0 wlan0 192.168.42.0    0.0.0.0         255.255.255.0   U     303    0        0 wlan0   The Pi can ping through to both the other networks and both other networks can ping through to the Pi.  BUT ... the Pi still doesn't have internet access, although a device on the 10.42.0.117 happily reaches the outside world.  The routing table on 10.42.0.117 is exactly "parallel" to the Pi's:  Kernel IP routing table Destination     Gateway         Genmask         Flags Metric Ref    Use Iface 0.0.0.0         10.42.0.1       0.0.0.0         UG    0      0        0 eth0 10.42.0.0       0.0.0.0         255.255.255.0   U     0      0        0 eth0 127.0.0.0       0.0.0.0         255.0.0.0       U     0      0        0 lo   What am I missing?


I would like to use \textcite to produce something like:     According to Stringer and Gamble (1993, p.159; contra Gargett 1989, 1999), the only clear example of an intentional Neanderthal burial is that of La Chapelle-aux-Saints 1 in Southwestern France.   I've looked around but couldn't find anything to that effect.   Here's a MWE:  \documentclass[10pt]{article}  \usepackage[american]{babel} \usepackage{csquotes} \usepackage[sorting=nyt, style=authoryear-comp, backend=biber, maxbibnames=10, maxcitenames=2, doi=false]{biblatex} \addbibresource{preset.bib} \DeclareLanguageMapping{american}{american-apa}   \begin{document} According to \textcites[159]{Stringer1993}[contra][]{Gargett1989, Gargett1999}, the only clear example of an intentional Neanderthal burial is that of La Chapelle-aux-Saints 1 in Southwestern France. \printbibliography \end{document}   Which does not produce what I want:     EDIT: Here's what worked for me (both lines are identical, but for me only the second worked)  \citeauthor{Stringer1993}~\mkbibparens{\cite*[159]{Stringer1993}; contra \cite{Gargett1989, Gargett1999}} \citeauthor{Stringer1993}~\mkbibparens{\cite*[159]{Stringer1993}; contra \cite{Gargett1989, Gargett1999}}

I'd like to type a citation within the text and another citation inside the parenthesis for the year, something like this:     The work of Author 1 (year; cited by Author 2, year)   For this, I've tried different options of the \textcite command but without results. Also I saw the solution posted , which works for multiple citations within parenthesis but not for in-text citations.  Any suggestion?


How many solutions does $$x_1 + x_2 + x_3 = 11$$ have, given that $x_1, x_2,$ and $x_3$ are nonnegative integers with $x_1 ≤ 3, x_2 ≤ 4,$ and $x_3 ≤ 6$?  I wasn't quite sure how to deal with the bounds given

I want to solve for:     Number of integers solutions to the equation $x_1+x_2+x_3=15$ with $x_1,x_2\leq 5$ and $x_3\leq 7$ for non negative integers $x_1,x_2,x_3$   How can this be done using the principle of inclusion/exclusion?


I was doing some exam practice when I almost surely went the wrong way in my method and ended up with the following equation: $$f'(x) = f(x) - f(x-1)$$ Although not what I was intended to find, I'm still curious to know if there are methods to solve this. We can spot the obvious solution $f(x) = Ax+B$ , but I could not find a way to prove this was the only solution, or find any other solutions. Any insight would be helpful. For context I am a first-year undergrad.

The question is:     When $f(x+1)-f(x)=f'(x)$, what are the solutions for $f(x)$?   The most obvious solution is a linear function of the form $f(x)=ax+b$. Is this the only solution?  Edit  I should add that $f:\mathbb R\to\mathbb R$ to the question.


I know there's a lot of post with that same problem. But I can't seems to find one that help my case, so here we go.  When I try to update via software updater I got the message « Failed to download repository ». My internet connection is fine. When I try by terminal does not work either, I think thoses lines illuminate the problem:  Hit:8 http://ppa.launchpad.net/ubuntuhandbook1/audacity/ubuntu artful InRelease Err:7 https://content.runescape.com/downloads/ubuntu trusty InRelease   The following signatures were invalid: AAC9264309E4D717441DB9527373B12CE03BEB4B W: GPG error: https://content.runescape.com/downloads/ubuntu trusty InRelease: The following signatures were invalid: AAC9264309E4D717441DB9527373B12CE03BEB4B E: The repository 'https://content.runescape.com/downloads/ubuntu trusty InRelease' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default.   Also I'm not able to change anything from the software & update menu, I cannot check or uncheck any item..  I am really new to all this, please forgive my lack of ressourcefulness and thanks in advance for your time!

Please help me: I added this repositories manually and i cant remove them  echo 'deb http://download.opensuse.org/repositories/home:/Horst3180/Debian_8.0/ /' > /etc/apt/sources.list.d/vertex-theme.list  wget http://download.opensuse.org/repositories/home:Horst3180/Debian_8.0/Release.key   I tried to use removing the key using apt-key list and then removing using the id, it successfully removed the key but when i use apt update i get this output:  W: GPG error: http://download.opensuse.org/repositories/home:/Horst3180/Debian_8.0  Release: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 5A7D1D38BEB6D886 E: The repository 'http://download.opensuse.org/repositories/home:/Horst3180/Debian_8.0  Release' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   I just want to be able to run apt update normally like when a fresh OS install was made


So I play a tiefling phoenix sorcerer (lvl 9) and we had an encounter with two half-dragons in a forest. At first there was only one and me being a sorcerer I stayed back and used ranged attacks but the other one sneaked up on me and because of his action surge he absolutely massacred me. I was on deathsaves and he finished me with his lightning breath-weapon while trying to hit my mates too. They finished him and took my body to the big city to see a high level cleric.   At the end I was revived, but now I'm missing one horn, my face is deformed and I have a huge scar on my torso. I'm working on a mask design and I'm always clothed so that's not a problem, but my character is very fond of his horns and now he's very depressed about it (he's depressed because he died but the horn thing makes it worse).   So then my question is: is there a way get my horn back, if not, any ideas on how to make a fake one (what material and how to wear/attach it)?

I recently had my nose bitten off by a berserker and smell is surprisingly hard to live without.   I have had some past trouble with wishes (from a ring of three wishes) so I'm reluctant to make another wish. Also I don't think this is worth wasting my last wish over anyway.  My DM is evil so I'll probably end up with a Mephit's nose or something if I wish for it back.   Can anyone tell me another way of regaining body parts?


Basically I have a package in oracle 11g processing a file and validating and inserting information in multiple tables,      to achiev this I create a stored procedure that reads the file and spread the information, then I call multiple stored procedures to     validate and insert the data in each table (one procedure per table), for errors each SP insert a record in a common error table, at the end,      I call one last stored procedure that identifies if there is errors in the common error table and generate a file with those errors.  Now... I'm trying to improve the code in order to minimize times of execution, then I realice that each SP that validates and insert info     into table does not depend from other SP information, so I'm asking if there is a way to call all this SP in parallel.  TODAY  STORED PROCEDURE charge_file STORED PROCEDURE insert_table1 STORED PROCEDURE insert_table2 STORED PROCEDURE insert_table3 ... STORED PROCEDURE return_file   What I am trying to do  STORED PROCEDURE charge_file STORED PROCEDURE insert_table1 - STORED PROCEDURE insert_table2 - STORED PROCEDURE insert_table3 ... STORED PROCEDURE return_file

Is there any feature of asynchronous calling in PL/SQL? Suppose I am in a block of code would like to call a procedure multiple times and wouldn't bother when and what the procedure returns?  BEGIN   myProc(1,100);   myProc(101,200);   myProc(201,300);   ...   ...  END;   In the above case, I don't want my code to wait for myProc(1,100) to finish processing before executing(101,200) Thanks.


I have a list of zip files containing themselves multiple files. Like this : | archive-1.zip     | file1.xml     | file2.xml     | file3.xml --> contains myStringToFind     | file4.xml | archive-2.zip     | file1b.xml     | file2b.xml | archive-3.zip     | file1c.xml     | file2c.xml  My goal is to find a string across the files within those zip archives. What I've achived so far is that : for i in archive*.zip;do unzip -c "$i" 2>/dev/null|grep -l myStringToFind; if test $? -eq 0; then echo $i;fi; done|grep archive  Output: archive-1.zip .With this I'm able to find the archive containing my string. The next step is to find the name of the file within the archive, but I'm unable to find a way to do this. My expected output would be archive-1.zip file3.xml Any help would be appreciated.

I am working on SunOS 5.10. I have a folder that contains about 200 zip files. Each zip file contains only one text file in it.  I would like to search for a specific string in all the text files in all the zip files.   I tried this (which searches for any text file in the zip file that contains the string "ORA-")  but it didn't work.   zipgrep ORA-1680 *.zip   What is the correct of doing it without uncompressing the zip files?


apt-get fail to resolve the mirror. I am using my server as a backup server to one of my website servers. So I had to initially set a static IP address... How can I do it?

I have configured network adapter of guest Ubuntu to work in a bridged mode so I could ssh to it from the host machine.   The problem is that the guest Ubuntu ip address keep changing.   Even though it changes  within a very short range 192.168.0.4-10 it is still takes time to configure Putty and other programs each time.  Is there a way to make the guest Ubuntu ip address to be static?  My guest OS has the full GUI.


I have Micromax canvas 2.2 a114. I am in strong network zone and use 2g internet all time and time without network is 0%. So why it is consuming more battery. I also never in weak signal.??

Looking up my battery statistics, I almost always find Cell standby amongst the top consumers:    I never thought that "idle" would use so much energy. I saw that other people encounter similar problems:       Answers on those questions just give some raw ideas. I would like to know what exactly stands behind this, an whether there are ways to keep this "standby" from eating my battery?


I'm running Ubuntu server through VMPlayer but I don't know, nor can find the login credentials.  Can some one let me know please?  Thanks.

Possible Duplicate:          I've just had someone install Ubuntu 12.04. I am not a techie - just a user. I am now asked for a password which I do not have and has never been set. Is there a default one? Otherwise I have to work as a guest all the time... Not so great. I appreciate any help.


I have a table with columns year and country.  +------+----------------- | year |      country      +------+----------------- | 1957 | The Netherlands  | 1957 | Belgium          | 1957 | Luxembourg       | 1954 | Hungary          | 1954 | Belgium          | 1932 | USA              +------+-----------------  I am trying to list the years when Luxembourg AND The Netherlands AND Belgium participated. I should get 1957 but I don't know how to do that in mysql.

This is a very basic query I can't figure out....  Let's say I have a two column table like this:  userid  |  roleid --------|--------    1    |    1    1    |    2    1    |    3    2    |    1   I want to get all distinct userids that have roleids 1, 2 AND 3.  Using the above example, the only result I want returned is userid 1.  How do I do this?


I'm having some trouble with ajax element, that when i add new element, i will inject new click function to that element, but he also add to the exist elements, so that some elements will call my function triple times or more.  So i wonder:  How to remove exist custom 'click function' and replace new one?  I know .off()but he remove all other functions of my elements so hover() still remove too.

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


I'm trying to remember a problem in classical mechanics involving a special surface that allows a ball to roll to the top and lose all it's momentum in finite time.   This leads to some interesting problems with time reversibility, as it implies the ball will spontaneously roll down the surface.  I'm not looking for an explanation, so much as a name and link to study it some more.

This question is in the spirit of , an example of an apparently non-deterministic system in Newtonian mechanics. Under certain restrictions, the  guarantees the existence and uniqueness of solutions to differential equations with initial conditions. However, Norton's dome does not satisfy these restrictions. The ball may sit on top of the dome for an arbitrary period of time before sliding down in a particular trajectory, without violating Newton's laws of motion.    Is there a plausible example of a system of interacting point-particles such that the equations of a point-particle are continuous but not , and therefore fail to have a unique solution?


Im trying to populate a listview in a Fragment, however im getting a NullPointerException.  I believe i may be implementing the ListAdapter incorrectly below:  ListAdapter adapter = new SimpleAdapter(                                        getActivity(), inboxList,                                         R.layout.women_list_item, new String[] { TAG_ID, TAG_FROM,TAG_DATE,TAG_EMAIL,TAG_SUBJECT},                                         new int[] { R.id.from, R.id.subject, R.id.date,R.id.mail,R.id.roundscore });                                 // updating listview                          list1.setAdapter(adapter);   View Full Fragment Code here:   Error:  09-22 07:11:33.723: E/AndroidRuntime(1707): FATAL EXCEPTION: main 09-22 07:11:33.723: E/AndroidRuntime(1707): java.lang.NullPointerException 09-22 07:11:33.723: E/AndroidRuntime(1707): at info.androidhive.slidingmenu.PagesFragment$LoadInbox$1.run(PagesFragment.java:291) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.app.Activity.runOnUiThread(Activity.java:4673) 09-22 07:11:33.723: E/AndroidRuntime(1707): at info.androidhive.slidingmenu.PagesFragment$LoadInbox.onPostExecute(PagesFragment.java:273) 09-22 07:11:33.723: E/AndroidRuntime(1707): at info.androidhive.slidingmenu.PagesFragment$LoadInbox.onPostExecute(PagesFragment.java:1) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.AsyncTask.finish(AsyncTask.java:631) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.AsyncTask.access$600(AsyncTask.java:177) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.AsyncTask$InternalHandler.handleMessage(AsyncTask.java:644) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.Handler.dispatchMessage(Handler.java:99) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.os.Looper.loop(Looper.java:137) 09-22 07:11:33.723: E/AndroidRuntime(1707): at android.app.ActivityThread.main(ActivityThread.java:5103) 09-22 07:11:33.723: E/AndroidRuntime(1707): at java.lang.reflect.Method.invokeNative(Native Method) 09-22 07:11:33.723: E/AndroidRuntime(1707): at java.lang.reflect.Method.invoke(Method.java:525) 09-22 07:11:33.723: E/AndroidRuntime(1707): at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:737) 09-22 07:11:33.723: E/AndroidRuntime(1707): at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:553) 09-22 07:11:33.723: E/AndroidRuntime(1707): at dalvik.system.NativeStart.main(Native Method)  View Code:

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


For (i) I did it by turning the integrand into infinite series, but  what is the method by applying binomial theorem?  For (iii) I'm unsure as to a good "trigonometric substitution".

I've read somewhere on this site that if you consider:  $$\int_0^1 \int_0^1 \frac{1}{1-xy} \,dy\,dx$$  Then using the power series, we have this is equal to $\sum_{n=1}^{\infty} \frac{1}{n^2}$ which I decided to try and was able to show.  Apparently we can show this is equal to $\frac{\pi^2}{6}$, and using what little I know about double integrals from a few khan academy videos (I haven't taken multivariable  calculus yet), I tried to evaluate this double integral by techniques of single variable calculus $u=xy$..and I got this:  $$-\int_{0}^{1} \frac{\ln (1-x)}{x}dx$$  The usual way I would evaluate this is with a Taylor series, but that just that just leads us in circles.  So I want to know how can I evaluate this, so we can prove $\sum_{n=1}^{\infty} \frac{1}{n^2}=\frac{\pi^2}{6}$.


I currently have a job offer, but I have had two other campus interviews.  The other search committees often mention that I should update them on my job search.  I am not sure what this means exactly.  Of course, if I know that if I take another offer, that I should let the others know. What I am unclear on is if I have an offer, but no offer yest from the other institutions, should I let them know about this?  Or do I wait until I have an offer from them to say anything?

I've interviewed for a few positions, one of which has made me an offer.  I'm very pleased with the offer, but I prefer some of the other positions.  I have the luxury of being able to take a lot of time to decide whether or not I accept this offer, so I'm certain I will hear back (either positively or negatively) from the other positions before a decision is required for the offer I've received.  I'm trying to decide between two courses of action, and I want to choose the one that will best help my candidacy with the positions I've yet to hear from.  Plan 1 is to do nothing and simply wait to hear back from the other positions for which I've already interviewed.  Plan 2 is to be in touch with the other positions to let them know I have an offer, and ask where I stand with them.  Would Plan 2 make me a more desirable candidate with the other positions, as they might see my offer as further validation of my credentials?  Or, might initiating with the interviewers in this way be detrimental to my candidacy, perhaps making me seem pushy or self-centered?  If so, I would rather just wait for them to run their course of action (Plan 1).  As I've said, I have plenty of time, so I don't want impatience to hurt me.  If there is a good chance that my meddling will be detrimental, then I'd rather be hands-off here.  However, if it's more likely that informing the other interviewers of my offer will give me a boost, then I'd want to do so.  Thanks for any clarity you can provide!  Edit: For a bit more information and context, the position I've been offered is a non-academic research position that my advisor has described as "prestigious."  The other positions for which I've interviewed (and which I prefer) are mostly academic teaching-centered positions (visiting assistant professors, tenure-track at smaller four year institutions).


I have a heavily positive distribution in my dataset of my x variable, the aim to put the variable into 4 categories of categorical variable. Although, my initial idea is to log the continuous data then split it into categories. However, lots of values of the dependent variable are 0 which then would require a constant in the log transformation. Is it appropriate to just split a positive skewed dataset into a categorical variable rather than transforming the data first. Regards, Otis


If we increase voltage, we are increasing energy per coulomb. How does it increase the number of coulombs per second (current)?

According to Ohm's law, $V=IR$ (voltage equals current times resistance).  So if the voltage increases, then the current increases provided that the resistance remains constant.  I know that Voltage or potential difference means work done per unit positive charge in bringing that charge from one point to another.  So according to Ohm's law, if the work done per unit charge increases then current will increase. How can this be true? Point out my mistakes.


I have this Hopf link  and when I try to calculate the HOMFLY polynomial I get the standard answer but with negative powers of l i.e. ml^{-1} + m^{-1}(l^{-1}+l^{-3}). Is this because of the specific orientation or have I made a mistake?  Thanks

I am trying to calculate the HOMFLY polynomial for the oriented Hopf link.  I have a left handed corkscrew with linking number $= -1$ (see drawing below).  Using the equation  $$lP_{H^{+}} + l^{-1}P_{H^{-}} + mP_{H_{0}} = 0$$  I understand what the diagrams of the positive and negative crossings will look like, and that $P_{H_{0}}$ will equal $P_o(\text{the unknot})$ and that $P(\text{unknot})= 1$ but I'm not sure how to turn my equation using diagrams into an equation of two variables.


Two of my web pages that were published last month are not indexed by Google, although both the webpages are on sitemap and the sitemap is recently updated successfully. Other web pages that are published this month are indexed but not the ones that are published before them.  I also conducted a live test and everything seems to be good. Can you please suggest some ways to force index a page?

This is a general, community wiki  question and answer pair intended to address any questions   concerning the reasons a site or specific site contents do not appear   in search engine results.      If your question was closed as a duplicate of this question and you   feel that the information provided here does not provide a sufficient   answer, please open a discussion on .   My site (or specific pages on my site) is not appearing in search engine results.  Why isn't my content indexed and what can I do about it?


I have a test application which could not be loaded a several times. It works fine.   private void App_OnStartup(object sender, StartupEventArgs e)         {     if (Process.GetProcessesByName(currentProcess.ProcessName).Length > 1)                     {                             MessageBox.Show("Instance already running", "Warning");                             Application.Current.Shutdown();                         }     } }   But what if a single user wants to create a shortcut of this application with another instance? For example "Test.exe" 2    This application should be loaded only once, when it was started like "Test.exe 2". I receive this number of instance in e.Args[0] and then I need to keep it for compare with another shortcuts of this application at this time.   So here's the question: how do I do it? How can I compare the already existing processes with a different instance's number. Any ideas appreciated!

In .NET, what's the best way to prevent multiple instances of an app from running at the same time? And if there's no "best" technique, what are some of the caveats to consider with each solution?


I know the textbook answer that the tangent to field line give the direction of electric field and intersection of two field lines would mean two directions of electric field which is not possible, but why not!?. Electric field at a point tells the direction of 'force' at that point. Well force! When force on a object is applied in more than 1 directions we take the vector sum of the forces. Similarly if forces(electrical) with different directions were acting on a charge kept in an electric field we could take the vector sum of the forces and we would get the directon of resultant force(or resultant field)   P. S. : I know, i  sound totally stupid but this thought is not letting me live in peace. I totally agree that I could be horribly wrong. Even if i am please be generous enough to explain in detail.  Thank you

The the title is self explanatory, I guess.  Why can two (or more) electric  never cross?


$\int \sqrt{\tan (x)}dx $ Let $\tan(x)=t^{2}$                                                     then $dx$ will become $\frac{2t}{1+t^{4}}$   Hence $\int \sqrt{\tan (x)}dx =\int\frac{2t}{1+t^4} dt $  But I cannot proceed from this step.

I have been having extreme difficulties with this integral. I would appreciate any and all help. $$ \int \sqrt{\tan x} ~ \mathrm{d}{x}. $$


What do you call someone who is hateful, discriminatory and bigoted against people with mental illness and further stigmatizes them by calling those with mental disabilities nutcases, psychos, freaks, mental, and all the rest?

I’m having an argument with someone else who keeps telling me that racism is hating any kind of person. He keeps telling me that racism is sexism, etc.   I just want to know what the term for a person that hates disabled people (like mentally or physically disabled people) would be so I can prove him wrong. I know that’s a little ridiculous, but whatever.


The code below works if the #client-result-0 id is set to a static element. But when I point it to a dynamically created element, it doesn't work. I am using jQuery 1.7.1.  $j('#client-result-0') .on('click','.myLi',function(){     console.log('haha');     $j('#client-search-0').val($(this).text()); });   Thanks

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


Why is rabies incurable after onset of symptoms? Although we administer HRIG (lyssa virus antibody) to the patient, why doesn't it work after onset of symptoms? And are there any other successful treatments for rabies like that of Milwaukee protocol which are under research? I also want to know how successful  is Milwaukee protocol so far?

I'm still not sure about the mechanics that lead to rabies being incurable. I know that it can be treated before any symptoms show up, but why is it that once symptoms show the person is a dead man walking?


The point is to get the users input but only by the string values like CA so I can print out california, but the problem is   if (name == "AL") when the program runs and I input "AL" the console does not print "The state is Alabama" but instead terminates the program. So how do I resolve converting this? Thanks

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


I am planning to travel to Vienna on 13th August from Vietnam with Qatar Airways and expect to arrive in Vienna at 20:25. However, my visa is only valid from 14th August. So will this prevent me from boarding and entering the country? I have tried contacting the airline regarding this issue but haven't been able to get in touch with them.  Thank you in advance!

I'll be traveling to Germany this May and my planes would arrive at 4 May 20.30 at Frankfurt Airport but the Schengen visa that I received is valid only at 5 May.  Is it possible to enter if it's only a few hours before the day change? Or do I have to wait until day change in the transit area?  Another thing, would the airline rejected me from boarding the plane?


iTunes reports my iPad has 4Gb of "other" storage (yellow). It was 6Gb before I did a sync.  What is this and what can I do about it?

When I sync my iPad, iTunes tells me that Video accounts for so many gigabytes of space, Photos another portion, etc. etc.  But iTunes also tells me that a whopping 5.5 GB is being used by "Other".  What could this possibly be?  If it's not video, audio, photos, apps, or books, what's left taking up that amount of space?  I don't have that many contacts...  Of course, you don't know specifically what is and isn't on my iPad.  But any thoughts as to what this could be?  I'd like to reclaim some of that space if I can.


I was invited to the private beta for the new Puzzling.SE site. I clicked the link in the email and created my account on one computer. But when I go to the site on another computer, there is no way to log in without going back to my email and clicking the link again.  Why can't I just log in to the site since I'm already there?

It's been a while since I've been invited to a private beta and here are some thoughts on my experience with accessing the Sustainability private beta.  On my laptop I wasn't logged into the SE network. When I clicked on the invitation link and  went through to the landing page I was only provided an option to sign up for an SE account. I then clicked on the login option on the top banner I was then allowed to choose to sign in with my Google OpenID.  Just now I tried to access the site with my mobile phone. I was already logged into the SE network on a few sites. When I went to the new Sustainability site I was not given any option to log in, although I am already signed in to the SE network and I already have an invitation. I do understand that I wasn't following the invite link, but to me it shouldn't be that hard to sign me in, check if I'm invited and then pass me through. I'm sure there is a reason it was done this way, but again, it feels kind of clunky for a user with an invite to not be able to log into the site without having to open my email.  I then opened the Area 51 Sustainability page (already signed in to A51 account) to see if I could log in from there to save me the hassle of having to experience Hotmail on my phone, but clicking the "Visit the site now!" link from Area 51 only took me to the same page.  After opening my Hotmail account I clicked on the link and went through to the site. However unlinke on my laptop the mobile version took me immediately to a page where I was given options to choose my Open ID provied e.g. Google. Not sure if this is because I was already signed into the SE network or not.  No major dramas, just a bit awkward on the usability side.


/summon Villager ~ ~2 ~ {Offers:{Recipes:[{buy:{id:371,Count:15},sell:{id:264,Count:4}}   I'm using this as a recycler villager, and I can't get the first trade to work. What's going on?

Often, when making a command block contraption, you need to set an entity's data tag. These tags can sometimes be very long, with many layers of nested curly and square brackets. For example, this is the command to summon a villager with a single custom trade:  /summon Villager ~ ~ ~ {Profession:3,Career:2,Offers:{Recipes:[{buy:{id:minecraft:diamond,Count:6b}},sell:{id:minecraft:diamond_hoe,tag:{ench:[{id:16s,lvl:10s}]}]}}   The single-line command block interface of Minecraft makes it incredibly difficult to find and fix errors, especially when it comes to mismatched brackets. In fact, for illustration purposes, I put an error in the above command.  What techniques can I use to find and fix unbalanced square or curly brackets when writing long and complicated data tags?


I have pycharm on my desktop and I would like to access it from my laptop over ssh without having to close pycharm on the desktop (since I frequently have long tasks running).   Currently, I am able to start pycharm on my remote computer after ssh'ing into the host computer only after exiting pycharm on the host. I have to start it from the ssh command line, in other words.  That means I have to stop whatever processes are running on my host, close pycharm, and start it up again on the remote computer.     So...  If the gui application is already running on the host/server computer, how do I redirect the gui's output to the remote computer after logging in to ssh?

Using ssh -X user@host I can start programs on the host and X11 forwarding allows me to see their windows on the remote machine. However, I'd like to be able to forward/redirect existing windows.  How would I do that (if it's possible at all)?  Note, VNC is not an option (no server installed on the host and my user has limited permissions).


How can I prove that if $f: X \to Y$ is locally constant and $X$ is connected then $f$ is constant?  Definition of locally constant: for all $x_0$ in $X$ there is a neighborhood $U$ of $x_0$ then for all $x\in{U}$ $f(x)=f(x_0)$.

I am trying to show that a function that is locally constant on a connected space is, in fact, constant. I have looked at this  but my approach is a little different than the suggested approach and I'm unsure about the final step and would appreciate a tip. Here is what I have so far:  Let $f$ be a locally constant function on the connected space $U$. Assume that $f$ is not constant. Then, there are distinct points $x$ and $y$ such that $f(x) \neq f(y)$. Now, since $f$ is locally constant there are neighborhoods $V_x$ of $x$ and $V_y$ of $y$ such that  $$ f(V_x) = k_x, \;\; f(V_y) = k_y $$ for some constants $k_x \neq k_y$ .It follows that $V_x \cap V_y =\emptyset$  Now, let $A = U-V_x \cup V_y$ and $B = V_x \cup V_y$ so that $U = A \cup B$. With this, we have expressed $U$ as a union of disjoint sets. Since $V_x$ and $V_y$ are open $B$ is open. Note that if $A$ is empty we are done because $V_x$ and $V_y$ would comprise a separation of $U$ wich would imply that the assumption about f being not constant was faulty. So, assume $A$ is nonempty.  At this point, I want to show that $A$ itself is open. If I can do this, I believe the proof will be complete. One way I've thought about doing this is to choose a neigborhood of some point $a \in A$ and if it is not already disjoint from $B$, shrink it until it is. This would then demonstrate that $A$ is open.   Am I on the right track here?


I have been given a project to complete, in the backend there are SQL statements doing various things, as you'd expect.  In the past I have used PDO to construct SQL queries that use parameterisation to avoid injection attacks.  Whilst reading through the code I noticed many queries in the form of:  $sql = "SELECT * FROM detail WHERE email ='$email'"; $query = mysqli_query($dbcon, $sql);   With no parameterisation or cleaning of input.  Is this type of query vulnerable, should there not be some form of parameterisation and more importantly should I explain the risks involved as it seems the developer was unaware of the risk.

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


I have a website I'm currently working with, I was wondering about the default behaviour of search. Currently, to show a subset of links related to the page under the same search result, I have to use the exact name of the site. Is there a way to always display these through SEO or is this just default google behaviour?  Notice that when the non-exact site name is used, the links still appear just without their descriptions. The below screenshots are taken from chrome without cache or cookies (incognito)

My website used to have sitelinks and now it doesn't. It's very possible that it's due to changing the website to a sidebar design instead of having an "interstitial" type landing page which limited the number of choices, but I'm not sure.  Here is how sitelinks might look for a site:    What are some things that I can do to improve my chances of getting sitelinks?


Recently I registered a .com address for a business. In the modern world (year 2018) why would I need to add and maintain the www. subdomain of my domain?  I'm mostly interested in benefits of the subdomain. Thinking if I should bother doing the www.EXAMPLE.com -> EXAMPLE.com redirection.  UPD: I am not asking about SEO, not asking personal opinions, not asking tech details. The linked "duplicate" question is very different to my question.

After having read various articles on this site about WWW or Non-WWW website setup, ,  and , and after having setup a correct redirection rule in .Htaccess to at least eliminate duplicate contents (currently the non-www solution (e.g. http://example.com) I have a feeling that my site rank less since I changed this.   My confusion was strengthened by these two opponents:     &     Could the change of www.example.com >> http://example.com have a factual impact on ranking?  say either is better or worse. Are they holding information back?  I am confused fellow folks...  As much as I would like to separate facts from fiction, I am aware that not all the good valid information is written. Not on google webmaster site and perhaps not elsewhere. If so it seems out of date!  Does or does not a WWW domain impact SEO/rank better than its NON-WWW version? (Given that you have setup a proper redirect to avoid duplicates and go with one)


I am new to Linux. Using ubuntu 20.04, want ubuntudde. Downloaded the rufus.exe to usb but get an error message from archive manager when trying to open? I have tried F2,4 6 8 12 and DEL but cannot boot from the usb. Now I am told I cant run exe-files from ubuntu so how to install ubuntudde? I have nothing windowsrelated left on this computer.

I have installed the Ubuntu 20.04, and want now I want to install Deepin Desktop Environment (dde)  My steps are:   add the ppa and install using apt  sudo add-apt-repository ppa:leaeasy/dde sudo apt-get update sudo apt install dde    But during the command sudo add-apt-repository ppa:leaeasy/dde I get the following error:  $ sudo add-apt-repository ppa:leaeasy/dde  You can install deepin desktop environment by run  sudo add-apt-repository ppa:leaeasy/dde sudo apt-get update apt-get install dde ------ Ubuntu Bionic: https://drive.google.com/file/d/1xkQPb4tWocknuYeY-t41W--kz-9SSL0V/view?usp=sharing ------ Important Issue: Q: Can dde on Ubuntu 16.04? A: Sorry, the dde depends on qt version above than 5.6.      If you want to install dde, please upgrade to 17.04 or above.  More info: https://launchpad.net/~leaeasy/+archive/ubuntu/dde Press [ENTER] to continue or Ctrl-c to cancel adding it.  Hit:1 http://in.archive.ubuntu.com/ubuntu focal InRelease Hit:2 http://in.archive.ubuntu.com/ubuntu focal-updates InRelease                                      Hit:3 http://in.archive.ubuntu.com/ubuntu focal-backports InRelease                                    Ign:4 http://ppa.launchpad.net/leaeasy/dde/ubuntu focal InRelease                                      Hit:5 http://security.ubuntu.com/ubuntu focal-security InRelease            Err:6 http://ppa.launchpad.net/leaeasy/dde/ubuntu focal Release             404  Not Found [IP: 91.189.95.83 80] Reading package lists... Done E: The repository 'http://ppa.launchpad.net/leaeasy/dde/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   I get the similar error with sudo apt-get update :  $ sudo apt-get update Hit:1 http://in.archive.ubuntu.com/ubuntu focal InRelease Hit:2 http://in.archive.ubuntu.com/ubuntu focal-updates InRelease                                       Hit:3 http://in.archive.ubuntu.com/ubuntu focal-backports InRelease                                     Ign:4 http://ppa.launchpad.net/leaeasy/dde/ubuntu focal InRelease            Hit:5 http://security.ubuntu.com/ubuntu focal-security InRelease Err:6 http://ppa.launchpad.net/leaeasy/dde/ubuntu focal Release   404  Not Found [IP: 91.189.95.83 80] Reading package lists... Done E: The repository 'http://ppa.launchpad.net/leaeasy/dde/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   How can I install dde ?


Is there an explanation anywhere of why the Borg have come to call themselves "the Borg", in-universe?  Note : I am not asking about the  of the Borg collective itself — only how they arrived at their name.

In the Star Trek franchise, do the letters in the title "Borg" represent anything other than an abbreviation of the term "Cyborg"? If it is an acronym, what does "Borg" stand for?


This is blender 2.90.1. I am not able to changes vertices count of the added mesh, might be due to changes of default settings. Pls help me solve the problem. I tried reinstalling ,but the problems remains the same.

When adding a UV Sphere mesh in Blender 2.8, the creation parameters menu on the bottom left of the attached image for this UV Sphere seems to be greyed out. Any idea why this might be? Thanks.


The Problem:  I'm pretty new to leaflet and I'm trying to add a outline of the states over my OSM layer via WMS. I've found several tutorials online, some directly from the leaflet website but haven't had any success.   My code:  var map; var feature;  function load_map() {     map = new L.Map('map', {zoomControl: true});      var osmUrl = 'http://<my_server>/osm_tiles/{z}/{x}/{y}.png',             osmAttribution = 'Map data &copy; 2012 OpenStreetMap contributors',             osm = new L.TileLayer(osmUrl, {maxZoom: 18, attribution: osmAttribution});      map.setView(new L.LatLng(0, 0), 3).addLayer(osm);       var states = L.tileLayer.wms('http://<my_server>:8080/geoserver/States/wms', {     format: 'img/png',     transparent: true,     layers: "null"     });      states.addTo(map); }  window.onload = load_map;   When I open the console in google chrome there are no reported errors with my java script or connecting to the server. When the map is displayed it has no problem displaying the OSM layer, but the WMS layer is missing.

I am very new to GIS.   I am trying to display a map on a website using leaflet.   The map I want to display is hosted from an arcGIS server here:    This page lists a number of different interfaces, including WMS. The link to WMS info on the site has an error in it, but can be retrieved here:    I have a web page set up on the model of the leaflet quickstart guide (leafletjs.com/examples/quick-start.html) And that was displaying the map of London as expected.   I then found documentation on the leaflet L.tileLayer.wms function which gave this example  var nexrad = L.tileLayer.wms("http://mesonet.agron.iastate.edu/cgi-bin/wms/nexrad/n0r.cgi", {     layers: 'nexrad-n0r-900913',     format: 'image/png',     transparent: true,     attribution: "Weather data © 2012 IEM Nexrad" });   based on this, I substituted information from the ags.gis.iastate.edu wms capabilities sheet (linked above) and added the addTo(map) as below  var andreas = L.tileLayer.wms("http://ags.gis.iastate.edu/arcgisserver/services/Ortho/andreas/ImageServer/WMSServer", {     layers: '0',     format: 'image/png',     transparent: true,     attribution: "Andreas atlas © Iowa DNR" }).addTo(map);   [note I also tried transparent: false]  Result: nothing.   Can anyone point out what is probably a very obvious error, or lack of understanding on my part?


When I open the feed view on the iOS app, I can't see any icon for chat replies:        It would be great to draw something here.   App Version: 1.6.1.2 Device: iPad Air 2 (Wi-Fi) OS Version: Version 10.1.1 (Build 14B100)

It'd be nice if the chat notifications in the feed used the default Stack Exchange icon like the ones in the inbox do*:     Since items in the feed are grouped so that multiple items from the same site , the site icon helps delimit grouped items a bit less subtlely than the grey divider lines, and chat replies' lack of one causes them to sort of blend in to the previous group.  *Ideally it'd use the icon of the site the room was associated with, but I don't think that information is readily available


As the title states, I want to be able to print 101 in the following code:  #include <iostream> #include <sstream> #include <string>  class A {     public:         virtual int num();  // Method I want to override         std::string str(); };  class B: public A {     public:         int num(); };  int A::num(){     return 0;  // default value }  std::string A::str(){     std::ostringstream s;     s << num();     return s.str(); }  int B::num(){     return 101;  // overriden value }  int main(){     B b;     A a = b;  // Upcast     std::cerr << a.str() << std::endl;  // Want to print 101, but print 0      return 0; }   In the general case, I have multiple subclasses of of a parent (A) that implement their own logic for calculating something (num()), and the parent performs the same stuff on the output of that something (str()) for all different implementations of num(). I couldn't figure out how to do this in c++.  I come from a python background and am still learning c++. Normally this would work in python, but if this isn't a good design or not the right OOP way of doing this, feel free to offer an alternative solution that doesn't involve inheritance.

Someone mentioned it in the IRC as the slicing problem.


Suppose we have $f:\mathbb{R^2}\rightarrow \mathbb{R}$. Vectors which $f$ act on are column vectors i.e a $2 \times 1$ matrix.  Is the gradiant $\nabla f$ then a row vector? And why is this logical?

Kaplan's Advanced Calculus defines the gradient of a function $f:\mathbb{R^n} \rightarrow \mathbb{R}$ as the $1 \times n$ row vector whose entries respectively contain the $n$ partial derivatives of $f$. By this definition then, the gradient is just the Jacobian matrix of the transformation.  We also know that using the Riesz representation theorem, assuming $f$ is differentiable at the point $x$, we can define the gradient as the unique vector $\nabla f$ such that   $$ df(x)(h) = \langle h, \nabla f(x) \rangle, \; h \in \mathbb{R}^n $$  Assuming we ignore the distinction between row vectors and column vectors, the former definition follows easily from the latter. But, row vectors and column vectors are not the same things. So, I have the following questions:   Is the distinction here between row/column vectors important? If (1) is true, then how can we know from the second defintion that the vector in question is a row vector and not a column vector?


I have been searching for an answer for a while so I am sorry if this has already been answered.   I am confused as to why inheriting empty method stubs from an interface is considered so useful in java? Is this something that is mainly used in bigger projects that i need to try to understand? Because although I know all the syntax and characteristics of interfaces, I cannot find uses for them when I am programming. I have tried to read as much as I can but this is a concept that I cannot get to 'click' in my head and I feel it is holding me back.  Or perhaps it is just case of good software design and I need to use them in certain scenarios whether I feel I need to or not?  If someone could point me in the direction of some code or preferably a project for me to do where interfaces are imperative that would be much appreciated.

I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this?   I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly.   Is it just so if you were to do:  IInterface classRef = new ObjectWhatever()   You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that.   Also, how could you write a method that takes in an object that implements an interface? Is that possible?


There is a critical CVE for Apache HTTP server versions 2.4.32 to 2.4.44 that allows info disclosure and possible remote code execution, so you can imagine how bad this could be on a web server if someone were to productize it into an exploit, however the most current version available for Ubuntu is 2.4.41. Does anyone know if there is a patch available or has anyone successfully built from source? The latest version from Apache for 20.04 is 2.4.46 but I've typically ran into issues whenever building from source whenever there isn't an official Ubuntu package available yet.

Today a couple of buffer overflows in NTP were announced , . It looks like updating my system to fix these issues is in order.   How can I find out if they have been fixed in the Ubuntu repositories, such that if I were to run:   sudo apt-get update sudo apt-get upgrade   then the fix would get installed and the vulnerability closed?   Edit: The selected answer specifically addresses the question of how to identify if a given CVE has been fixed or not, "Does Ubuntu generally post timely security updates?"  is certainly related but not identical


I know people have asked about the correlative comparative construction, but none of the previous posts concerns its specific analysis. How would you analyze the boldfaced part of #2 below?   The more you buy, the greater the discounts you receive.  The more you buy, the greater discounts you receive.    In #1, "greater" stands in a predicative relation to "the discounts you receive"; it's paraphrasable as "The discounts you receive are (the) greater the more you buy. The copular verb "are" can be treated as omitted in #1. Does the same predicative relation hold in #2? What about an alternative analysis whereby "greater discounts" stands in a verb-object relation to "receive"? In this connection, consider #3:   The longer you work, the more money you earn.   Which kind of relation holds in #3? A predicative or verb-object relation?

Is     The more, the merrier!   a sentence? It doesn't seem to have a main verb, so I'm inclined to say no, but it certainly functions as a sentence in everyday speech.  I can think of three ways of analysing it:   It's a sentence with no main verb. Is this even possible? It's a sentence with an implicit verb: something like The more we have, the better! It's not a sentence. But then, what is it?


Prove, when $n$ is a positive integer, if $2^n - 1$ is prime, then $n$ is prime.  I did read some sort of proving on the web, but I could not understand it...  Any help?  And if possible, could the explanations be very clear?  Thank you guys :)  So, I've found this from somewhere:  Theorem. If 2n−1 is prime then n is prime.  Proof. Suppose that 2n−1 is prime, and write n=st where s,t are positive integers. Since xs−1=(x−1)(xs−1+xs−2+⋯+1) , we can substitute x=2t to see that 2t−1 is a factor of 2n−1. Since 2n−1 is prime there are only two possibilities, 2t−1=1or2t−1=2n−1 . Therefore t=1 or t=n. We have shown that the only possible factorisations of n are n×1 and 1×n. Hence, n is prime.  However, I have a few questions: 1) how do you know  xs−1=(x−1)(xs−1+xs−2+⋯+1)  2) why is '2t−1' a factor of '2n−1' 3) how do you determine '2t−1=1or2t−1=2n−1' from 'Since 2n−1 is prime' 4) 'the only possible factorisations of n are n×1 and 1×n. '   how? 5) how did 'Hence, n is prime' come out as result?

I have been researching  so I can write a program that finds them. A Mersenne prime looks like $2^n-1$. When calculating them, I have noticed that the $n$ value always appears to be odd. Is there confirmation or proof of this being true?


Am I able to join XBox worlds, like cool mash up packs?

Can players on a PC and an Xbox play together in any way? I.e. can Xbox users connect to a (modfied?) PC server, or vice versa?


I'm trying to get records of custom object where MultiSelectPicklist__c have names of publicgroups.  List<String> groupIds = new List<String>(); List<String> groupNames = new List<String>();  for(GroupMember gm :[SELECT Id,GroupId,UserOrGroupId FROM GroupMember WHERE UserOrGroupId = '0051U000006AkQy']){ groupIds.add(gm.GroupId); }  for(Group g :[SELECT ID,Name FROM Group WHERE Id IN :groupIds]){ groupNames.add(g.Name); }  for(CustObj__c cust : [Select Id, Name, MultiSelectPicklist__c FROM CustObj__c WHERE MultiSelectPicklist__c INCLUDES (:groupNames)] ){ somelogic }   Why it says 'Invalid bind expression type of List<'String> for column of type String' in developer console?  Even after converting List to string I'm still not able to get any record  for(GroupMember gm :[SELECT Id,GroupId,UserOrGroupId FROM GroupMember WHERE UserOrGroupId = :userIds[0]]){             groupIds.add(gm.GroupId);         }         for(Group g :[SELECT ID,Name FROM Group WHERE Id IN :groupIds]){             groupNames.add('\'' + g.Name + '\'');             //groupNames.add(g.Name);         }          String listtostring = String.join(groupnames, ',');          List<program__c> newlist = [SELECT Id, Name, MultiSelectPicklist__c FROM Program__c where MultiSelectPicklist__c INCLUDES (:listtostring) ];         system.debug('List of records---'+newlist);    I tried both   for(Group g :[SELECT ID,Name FROM Group WHERE Id IN :groupIds]){             ///groupNames.add('\'' + g.Name + '\'');             groupNames.add(g.Name);         }

Hello I'm trying to use string in SOQL query where clause for multiselect picklist.  I need to get records of CustObj__c where Multipicklist__c fild have 'abc' or 'xyz' values.  String str = '\'abc\',\'xyz\''; for(CustObj__c cust : [Select Id, Name, Multipicklist__c FROM CustObj__c WHERE Multipicklist INCLUDES (:str)]{ somelogic }   However I get no records.  What is wrong in this query?  Ok I tried using list too, here I'm getting all record of all Public Groups where user is assign. and saving those Public Groups names in   List<String> groupIds = new List<String>(); List<String> groupNames = new List<String>();  for(GroupMember gm :[SELECT Id,GroupId,UserOrGroupId FROM GroupMember WHERE UserOrGroupId = :userIds[0]]){             groupIds.add(gm.GroupId);         }         for(Group g :[SELECT ID,Name FROM Group WHERE Id IN :groupIds]){             groupNames.add('\'' + g.Name + '\'');         }  for(CustObj__c cust : [Select Id, Name, Multipicklist__c FROM CustObj__c WHERE Multipicklist INCLUDES (:groupNames)]){ somelogic }   It still not working  I get error in Dev console : Invalid bind expression type of List for column of type String


I want to prove the following theorem     Let $\{a_{n}\}$ be a convergent sequence. Prove that $\lim\limits_{n\to \infty}a_{n+1}=\lim\limits_{n\to \infty}a_{n}$   Do I need to show that it is monotone increasing and then use the relation  $$0\leq \lim_{n\to \infty}a_{n+1}- \lim_{n\to \infty}a_{n}\leq 0 \;?$$  Please, I need help on this! Various proofs are welcome! Thank you very much for your time!

Assume that $\{a_n\}$ is a convergent sequence. How to use the definition of a limit of a sequence to prove that $\lim\limits_{n \to\infty}a_{n+1} = \lim\limits_{n\to\infty}a_n$?


The detect magic spell states (emphasis mine):  you sense the presence of magic within 30 feet of you. If you sense magic in this way, you can use your action to see a faint aura around any visible creature or object in the area that bears magic  And the definition of a cantrip in the PH is (emphasis mine):  A cantrip i s a spell that can be cast at will [...]. Repeated practice has fixed the spell in the caster's mind and infused the caster with the magic needed to produce the effect over and over.  Is a visible creature that knows and can cast at least one cantrip detected as "bearing magic" by the spell detect magic? I am aware that the spell cannot detect the ability to cast spells in creatures that prepare / learn spells of 1st level or higher. The description of cantrips is the only one that speaks about the caster being infused with magic.

Inspired by a recent question about discerning divine and arcane spellcasters, of like to hear the case for and against detecting spellcasters of either style with .  I think you can detect whether someone has prepared spells, based on this language:     For the duration, you sense the presence of magic within 30 feet of you. If you sense magic in this way, you can use your action to see a faint aura around any visible creature or object in the area that bears magic, and you learn its school of magic, if any. (emphasis mine)   Preparing spells is described as having the spell "fixed in mind" (). I'd argue that qualifies as bearing magic, and opens the door to using detect magic to identify spellcasters with currently prepared spells. What do you think?


I'm having an issue here. Why does the code below give out a wrong output?  test = '{:.{}f}'.format(35.72506789023292, 15) print(test)  >> 35.725067890232921   isnt it supposed to give me this?:  >> 35.725067890232920   i tried different numbers but they also fail. How can I make this work? I read regarding floats in Python and it is stated that it give accurate decimal digits for upto 16. This example only has 15 so it should be enough for float handling.

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I have this script in bash:  #!/bin/bash for (( i=1; i <= 5; i++ )) do     glxgears &> /tmp/log 2>&1 & done  killall glxgears   but always at the end of the script I get this:  ./script.sh: line 5:  2973 Terminated  glxgears &> /tmp/log 2>&1 ./script.sh: line 5:  3003 Terminated  glxgears &> /tmp/log 2>&1   I tried to suppress the messages in different ways, like:  killall glxgears 2> /dev/null killall glxgears &> /dev/null killall glxgears > /dev/null 2>&1 &   and always I get the messages.  I think that these messages come from job control, so i tried as well: jobs 2>&1 >/dev/null, but it does not work.  So, the question here is how can I remove these messages after my script finished?

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


Try to do a mock callout internally on custom button click and also added the instance in remote site setting.  @future(callout=true) webservice static void generatePDF(Id idList, String sessionId) {     System.debug('OK Its here: '+idList);     HttpRequest req = new HttpRequest();     req.setEndpoint('https://'+URL.getSalesforceBaseUrl().getHost()+'/services/apexrest/createstatusreport/');     req.setMethod('POST');     req.setBody('{"srList":'+JSON.serialize(idList)+'}');     System.debug(req.getBody());     req.setHeader('Authorization', 'Bearer '+ sessionId);     req.setHeader('Content-Type', 'application/json');     req.setTimeout(30000);     Http http = new Http();     HTTPResponse res;     if(!test.isRunningTest()){          res = http.send(req);     }

I am trying to get the access token over a controller that is connected to a Salesforce site. But I am having the below error message:  System.CalloutException: Unauthorized endpoint, please check Setup->Security->Remote site settings. endpoint = https://sandbox-goku.cs87.force.com/services/oauth2/token   My controller:   public class Mycontroller {         public String accessToken {             private set;             get {                 if (accessToken == null) {                     accessToken = RestUtil.getAccessToken();                 }                  return accessToken;             }         }   }   Utility to get the access token:  public class RestUtil {     private transient static String accessToken = '';      public static String getAccessToken() {         if (accessToken == '') {             accessToken = fetchAccessToken();         }          return accessToken;     }      private static String fetchAccessToken() {         HttpRequest authReq = buildAutHttpRequest();          Http http = new Http();          HttpResponse authRes = http.send(authReq);          String accessToken = extractAccessToken(authRes);          return accessToken;     }      private static String extractAccessToken(HttpResponse authRes) {         Map<String, Object> authResult = (Map<String, Object>) JSON.deserializeUntyped(authRes.getBody());          return (String) authResult.get('access_token');     }      private static HttpRequest buildAutHttpRequest() {         HttpRequest authReq = new HttpRequest();         authReq.setEndpoint('https://' + URL.getSalesforceBaseUrl().getHost() + '/services/oauth2/token');         authReq.setMethod('POST');         authReq.setBody(buildAuthRequestBody());          return authReq;     }      private static String buildAuthRequestBody() {         String template = 'grant_type=password&username={0}&password={1}&client_id={2}&client_secret={3}';         String[] arguments = new String[]{                 AdminAuthContants.USER_NAME,                 AdminAuthContants.PASSWORD,                 AdminAuthContants.CLIENT_ID,                 AdminAuthContants.CLIENT_SECRET         };          return String.format(template, arguments);     } }


The System process running on my Windows 7 installation uses almost 50% of CPU arbitrarily. I monitor the process with Process Explorer from .  Click the images to enlarge them...      What could be the problem?

I have noticed that from some time my system is freezing and its probably caused by the high CPU usage which is caused by the system process.  All applications I'm running is the Skype, TeamSpeak and Chrome so it definitely shouldnt eat that amount of CPU.  You can see the problem itself and running processes in the screenshot below:    Sometimes CPU usage is reaching 90%, but the average usage is like 40-65%.  My PC parameters:   Windows 8 (customer preview) Intel Core i3 - 2350M 8 GB RAM   I'd appreciate any help attempt! Regards.  --UPDATE--  As the user below posted a great answer, I have noticed that the process that is eating the most CPU in the system is called Arthurx.sys, simple google tells that it's a TPLink driver (an wifi adapter, I have bought like 2 weeks ago!) drivers has been installed from the Windows MSDN, but also tried to install the drivers from the attached CD, but it doesn't help. From the system start, it is using like 5% of the CPU only, but after 2-4 hours of working it is growing up and reaching 40-60% of the CPU usage.  Device name: TPLink WN722N


This question is not a duplicate. I followed the thread showing how to format usb but it didn't help (see below for details). Please also read the comments section  I tried to follow  thread to format my USB drive. However, sudo mkfs.vfat /dev/sdb1 still produces the following error.   mkfs.fat 4.1 (2017-01-24) mkfs.vfat: unable to discover size of /dev/sdb1   The size of USB pendrive seems to be incorrect:  $ lsblk NAME   MAJ:MIN RM   SIZE RO TYPE MOUNTPOINT --truncated-- sdb      8:16   1   7.2G  0 disk  └─sdb1   8:17   1   239M  0 part    As you can see, the USB has size of 7,2G but there is one partition of size 239M.  I also tried wipefs -a /dev/sdb to erase all the partitions in USB thumb. Still, no luck.  Neither sudo dd if=/dev/zero of=/dev/sdb bs=512 count=1  or sudo dd if=/dev/zero of=/dev/sdb bs=512 has worked as I'm still getting mkfs.vfat: unable to discover size of /dev/sdb1.

In Windows there is a straightforward "Format" option in a flash drive's right-click pop-up menu. Where's that in Ubuntu?


How is the wound field of a medium voltage synchronous motor protected from voltage surges? We do know that the stator is protected from surges by either one of the following: 1. RC Snubber Circuit 2. Surge Capacitor 3. A surge arrester in combition with point 1 or 2 above.

What types of transient voltage protection is applied on medium voltage motors and are these types of protection that are applied depended on the type of motor it is e.g Synchronous vs Induction motor?


I have Ubuntu 15.04 and an HP LaserJet 1018 connected by USB. Ubuntu has found drivers and shows that everything is OK. When I send test page to printer it shows that it was handled first and than operation completed but nothing actually happens.  Can somebody help me? I'm new in using Ubuntu. Maybe I do something wrong...

edit : already printed on windows-machine  Ubuntu 12.04, LJ 1018.  I've tried making foo2zjs from sourse.  I've downloaded firmware and placed it where necessarily manually from   I've also tried  - same as manual dowload but with some patches like stoping cups, etc..  I've fixed usbfs: process 11200 (usb) did not claim interface 0 before use  problems using sudo rmmod usblp as described .  And now I have   Aug 10 11:51:59 pav /usr/sbin/hplj1018: foo2zjs: usb://HP/LaserJet%201018?serial=KP07RLV... download failed. Aug 10 11:51:59 pav /usr/sbin/hplj1018: foo2zjs: loading HP LaserJet 1018 firmware /lib/firmware/hp/sihp1018.dl to CUPS USB device ...   error.  Before that prinet was stucking on "Sending data to printer". Now it's code is "Not connected".  Unless   ben@pav:~$ lsusb  ... Bus 001 Device 015: ID 03f0:4117 Hewlett-Packard LaserJet 1018   Thank you.


My exact MySQL version is 5.7.29-0ubuntu0.18.04.1. And I'm beginning to think that I'm getting crazy...  Just try these queries:  CREATE TABLE `float_bug` (   `v` FLOAT NOT NULL ) ENGINE=INNODB DEFAULT CHARSET=utf8;   INSERT INTO float_bug VALUES(92160596);   SELECT * FROM float_bug;   Returns 92160600.  Then I tried these:  SELECT * FROM float_bug WHERE v = 92160596; SELECT * FROM float_bug WHERE v BETWEEN 92160596 AND 92160600;   Both return nothing!  However this  SELECT * FROM float_bug WHERE v = 92160592;   Returns 92160600.  I'm ready to throw my computer into the wall, but unfortunately that won't help because I have exactly the same behaviour on my remote server and I can't throw it into the wall physically.  Any ideas what is going on here?

I am developing a PHP application in which I am in need to store values bigger than 1 million, but with the flexibility of having floating points. I know the traditional float and double. I am looking to store only up to two decimal points, and will only handle operations with numbers that have 2 decimals exclusively.  I have chosen my column type of double and unsigned, but whenever I store a row with a value bigger than one million, it gets truncated to 999999.99  Why is this? I am looking for the right datatype/solution. If you could point me in the right direction, I will appreciate it a lot!  Thank you for your time in advance!  Cheers.


I have this code which adds html element to a div element by clicking the "practice button". However, when I click the submit button on the form, it does not call the "Selected Practice Option". However, my other form on the website calls the "Selected Practice Option". The code does not invoke the jQuery event of "Selected Practice Option". There are no errors in the jQuery code and the html code. Is this an error with jQuery?    /* Pratice Button Clicked Event */     - 35     $("#ob-practice").click(function(){     2 36         $("#newComboDiv").css("display","none");     2 37         $("#practiceComboDiv").css("display","inline-block");     2 38         var data = JSON.parse(localStorage.getItem('c'));     2 39         var text = "<form id='comboselect' action='#'> <select name='option-name'>";     - 40         for (var i in data){     3 41             var m = data[i];     3 42             text += "<option> " + m.name + "</option>";     3 43         }     2 44         text += "</select>"     2 45         text += "<button type='submit' value='submit'> Submit </button> </form>"     2 46         $("#combo-menu").html(text);     2 47     });     | 48     /*Selected Practice Option */     - 49     $("form").on("submit",function(e){     2 50         e.preventDefault();     2 51         var data = $('#comboselect').serializeArray();     2 52         alert("test");     2 53      2 54     });

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


I am trying to solve this limit: $$\lim_{x\to\infty} \frac{2^x}{x^{200}}$$  The first result is an indetermination of the kind $\frac{\infty}{\infty}$ but here applying L'Hopital would be too long, I do not see any substitution by means of equivalent infinitesimals possible and simplifying the limit neither.  How can I solve it? The solution must be $\infty$. Thank you!

In other words, how to prove:  For all real constants $a$ and $b$ such that $a > 1$, $$\lim_{n\to\infty}\frac{n^b}{a^n} = 0$$  I know the definition of limit but I feel that it's not enough to prove this theorem.


In Not Enough Items mod, when I click on a item: with recipe it shows the recipe. If the item does not have a recipe it does nothing. When I try to drag items into my inventory nothing happens.   I have gone into notepad and set lockmode=1 and cheatmode=2 but it is already there. I am in the global setting on cheat mode. What else can I do? I just wanted to cheat in spanwers for a creative world. Is there a solution to this problem or a way to get vanilla/modded spawners?

EXTRA PROBLEM I have NEI on minecraft with some other mods and NEI is supposed to have a saves thing on the left, and items on the right. The only thing on the left is the options. I want to see the saves and time changing options too.  Cheat Mode When I click on a item to get it it keeps showing me the recipe. Though in the options menu from NEI it is on cheatmode. I saw another post saying I need to change something to this lockmode=-1 or cheatmode=2 but it is already that way. That didn't work how do i get it to give me the items and also recipe when I press R.


a=b=[1,2,3] print (a is b) #True   But  a=[1,2,3] print (a is [1,2,3]) #False     Why does the second part print False ?

My  has failed me.  In Python, are the following two tests for equality equivalent?  n = 5 # Test one. if n == 5:     print 'Yay!'  # Test two. if n is 5:     print 'Yay!'   Does this hold true for objects where you would be comparing instances (a list say)?  Okay, so this kind of answers my question:  L = [] L.append(1) if L == [1]:     print 'Yay!' # Holds true, but...  if L is [1]:     print 'Yay!' # Doesn't.   So == tests value where is tests to see if they are the same object?


I am using a textbook called foundations of mathematical analysis by johnsonbaugh and in it, he defines the ordered pair of elements $a$ and $b$, writen as $(a,b)$ as the set:  $(a,b)=\{\{a\},\{a,b\}\}$ where $a$ is called the first element of $(a,b)$ and $b$ is called the second element of $(a,b)$.   This definition is a bit strange, would anyone know how I can interpret it? Thank you!

I've been struggling understanding Kuratowski's definition of ordered pairs. I understand what it means but I don't see why I should accept it. I've seen  and , most importantly --- through reading the  I've realised one thing.  The only reason $(a,b)=\{\{a\},\{a,b\}\}$ is accepted is because it satisfies     $(a,b)=(c,d) \iff (a=c) \land (b=d)$   Am I not misunderstanding this? If I can come with my own exotic definition which satisfies the above iff statement, would it be accepted?


I logged into my world and fell through the world, like the blocks had no collision box. How can I fix this? And it happens every 5 min so I'm going around then it starts I'm trying to fix the block my replacing them it seems it's working but when I re log it  glitches  again

Okay, I try and connect to a server when I have full connection and a ping between 40-80. When I join I just fall through the world for a few seconds.  Sometimes I get the sound like you hit the floor and everything goes black but that is as far as I get. I have deleted and reinstalled Minecraft and have turned advanced OpenGl on. I'm not sure what else I can do that may help solve this problem. Also I do not get any connection issues on other games or on the internet. As far as I can tell the logs on the developer console don't give me any information either.


My Ubuntu version is 16.04 LTS. I have been getting "Low Disk Space" message. An example of the message I get: "The volume "boot" has only 3.1 MB disk space remaining"  Things I have tried when I get such a message: 1) Deleted old kernels using sudo apt-get purge linux-image--generic 2) Cleaned up various directories 3) sudo apt-get autoremove  None of these have helped. In fact, running 1), 3) made my system fail to boot. Every time my system fails to boot, I re-install an old working image of my system. After a few weeks, I once again get the Low disk space error.  What can I do to prevent /boot running into low disk space?  I'd appreciate your help.  P.S: I am not a sys admin so I'd appreciate more context in your answers. Thank you!  Edit 1: I had previously tried the solutions provided in the suggested links. Running 'sudo apt-get purge' made my system failed to boot.  Edit 2: I am running sudo apt-get autoremove preemptively. That seems to keep the problem under control. Are there any other ways to get rid of the boot low disk space issue instead of running sudo apt-get autoremove preemptively every few days/weeks?

My /boot partition is nearly full and I get a warning every time I reboot my system. I already deleted old kernel packages (linux-headers...), actually I did that to install a newer kernel version that came with the automatic updates.  After installing that new version, the partition is nearly full again. So what else can I delete? Are there some other files associated to the old kernel images?  Here is a list of files that are on my /boot partition:  :~$ ls /boot/ abi-2.6.31-21-generic         lost+found abi-2.6.32-25-generic         memtest86+.bin abi-2.6.38-10-generic         memtest86+_multiboot.bin abi-2.6.38-11-generic         System.map-2.6.31-21-generic abi-2.6.38-12-generic         System.map-2.6.32-25-generic abi-2.6.38-8-generic          System.map-2.6.38-10-generic abi-3.0.0-12-generic          System.map-2.6.38-11-generic abi-3.0.0-13-generic          System.map-2.6.38-12-generic abi-3.0.0-14-generic          System.map-2.6.38-8-generic boot                          System.map-3.0.0-12-generic config-2.6.31-21-generic      System.map-3.0.0-13-generic config-2.6.32-25-generic      System.map-3.0.0-14-generic config-2.6.38-10-generic      vmcoreinfo-2.6.31-21-generic config-2.6.38-11-generic      vmcoreinfo-2.6.32-25-generic config-2.6.38-12-generic      vmcoreinfo-2.6.38-10-generic config-2.6.38-8-generic       vmcoreinfo-2.6.38-11-generic config-3.0.0-12-generic       vmcoreinfo-2.6.38-12-generic config-3.0.0-13-generic       vmcoreinfo-2.6.38-8-generic config-3.0.0-14-generic       vmcoreinfo-3.0.0-12-generic extlinux                      vmcoreinfo-3.0.0-13-generic grub                          vmcoreinfo-3.0.0-14-generic initrd.img-2.6.31-21-generic  vmlinuz-2.6.31-21-generic initrd.img-2.6.32-25-generic  vmlinuz-2.6.32-25-generic initrd.img-2.6.38-10-generic  vmlinuz-2.6.38-10-generic initrd.img-2.6.38-11-generic  vmlinuz-2.6.38-11-generic initrd.img-2.6.38-12-generic  vmlinuz-2.6.38-12-generic initrd.img-2.6.38-8-generic   vmlinuz-2.6.38-8-generic initrd.img-3.0.0-12-generic   vmlinuz-3.0.0-12-generic initrd.img-3.0.0-13-generic   vmlinuz-3.0.0-13-generic initrd.img-3.0.0-14-generic   vmlinuz-3.0.0-14-generic   Currently, I'm using the 3.0.0-14-generic kernel.


For some background, I'm on Windows 10 however with the files I'm going to talk about I've used them in shared folders with Ubuntu VMs before.  In a folder on my machine, there is a file named '...' I really don't know where this file came from. It was inside a directory which contained one of my programming projects, in which I was using git. However, I cannot delete this file in any means I've tried so far. When attempting a simple right-click + delete, I get the message: "Error 0x80070091 The directory is not empty."   When I attempt to delete from powershell using del or rm, I get the message: "When attempting to del : An object at the specified path C:\Users\mdmil\Concurrency\... does not exist."  I cannot rename the file by any means. When I try to rename from powershell, I get the same aforementioned error. When I try to rename from file explorer, I get a "this file is open in another program" error.  I even got desparate enough to try to share the folder with a Linux VM, and attempt to delete the file via the inode number to no avail.  When I attempt to open the file in notepad++, no file opens. I presume it is because it is trying to interpret it as a directory due to the ... naming.  I'm currently at a loss as to how to fix this. Any help would be appreciated!

I have a folder on my desktop which is named ".." (which itself contains subfolders with an empty name). The folder can't be deleted the usual ways, even not when using the CLI. Does anyone know how I can remove this folder on Windows Vista 64-bit?  Renaming does not work, either (obviously).  This is what "dir /x" echoes:  09.10.2009  15:04    <DIR>                       . 09.10.2009  15:04    <DIR>                       .. 08.03.2007  11:18    <DIR>                       cgi-bin                0 Datei(en),              0 Bytes                3 Verzeichnis(se), 45.866.037.248 Bytes frei


I've read historically that pre-increment is faster/better for a variety of reasons (and also that it should be moot on modern compilers). But isn't there additional processing required for the copy process when objects come into play?  For example:  iterator iterator::operator++(    int) {    iterator copy(*this);    _index++;     return copy; }  iterator& iterator::operator++() {    _index++;     return *this; }   The pre-increment operator needs a copy operation. So simply doing this should be slower:  loop { --object }   Does the philosophy of "pre vs post" only apply to primitives?

We have the question   What's the answer for C++?


I have a table and want to group the contents using curly brackets as shown in the figure using latex tabular environment. Can someone help me this?   \begin{table}[!h] \begin{tabular}{ll} \hline  Score& Description\\ \hline  +4 &Playing\\ +3& Walking\\ +2& Crawling\\ +1 &Restless\\ +0& Calm\\ -1 &Sleep1\\ -2 &sleep2\\ -3 &sleep3\\ -4 &dream1\\ -5 &dream2\\ \hline \end{tabular}   \end{table}

I try to make a table for language manual. Could anybody help me to manage curly brackets in the cells of a table?  Like this:    I tried to do it like  but I could't manage it.