I'm an Indonesian citizen who is planning to apply for a UK visa and a Schengen visa. I have also lived in the United States since 2012 so I'm a legal US permanent resident with valid green card and state ID. I'm currently a full-time college student but planning on taking a semester off to travel to the UK and some countries in Europe.  Because I'm going to school full-time, I only work part-time. My dad who still lives in Indonesia has been supporting me and will also be doing so for my planned trip so I have some questions:  1) I will submit my bank statement but will it be okay if I also submit my dad's bank statement, even though he lives in another country?   Along with his bank statement, I will also have him go to a notary and sign an affidavit of support and I will also give them his contacts in Indonesia to proof that he is indeed my father. I definitely want to do this to avoid 'funds parking'.   2) The UK requires people from Indonesia to have a TB test but I have been a legal residence of the United States for six years, will I be required to get one as well?  I will apply for the Schengen visa at the Italian Consulate General in Houston and the UK visa by mailing all of my documents to the UK embassy in D.C.

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


Given $f(t)$ satisfies $\dfrac{d^2f(t)}{dt^2}-(2-3i)f(t)=0,\,f(0)=1,\,\lim_{t \rightarrow \infty}f(t)=0$. What is $f(\pi)$ ?

If $\frac{dy(x)}{dx}=(2-3i)y(x)$ where $i=\sqrt{-1}$, what is the value of $y(\pi)$?


I have the following question :  Proof if $I+AB$ invertible then $I+BA$ invertible and $(I+BA)^{-1}=I-B(I+AB)^{-1}A$  I managed to proof that $I+BA$ invertible  My proof :  We know that $AB$ and $BA$ has the same eigenvalues, and Since $I+AB$ invertible $-1$ is not an eigenvalue for $I+AB$ since if $-1$ is an eigenvalue then $I+AB$ is singular which is a contradiction. and since $AB$ and $BA$ has the same eigenvalues then $-1$ is also not an eigenvalue for $I+BA$ therefore $I+BA$ is also invertible.  But how do I show that $(I+BA)^{-1}=I-B(I+AB)^{-1}A$  I tried to "play" with the equations to reach one end to other end meaning that $(I+BA)^{-1}=...=...=...=I-B(I+AB)^{-1}A$  Or to show that $ I=(I+BA)^{-1}(I-B(I+AB)^{-1}A)$  But wasn't successful.  Any ideas?  Thank you!

The problem is from  Algebra by Artin, Chapter 1, Miscellaneous Problems, Exercise 8. I have been trying for a long time now to solve it but I am unsuccessful.      Let $A,B$ be $m \times n$ and $n \times m$ matrices. Prove that $I_m - AB$ is invertible if and only if $I_n - BA$ is invertible.    Please provide with only a hint.


I made USB bootable using Universal USB Installer on another windows 10 PC. Installed using the "Ubuntu (Safe Graphics)" option because the "Ubuntu" option freezes the wizard before installation. Opted for third party software and proprietary drivers. Opted "Required Password for login" Installed successfully  On reboot and selecting "Ubuntu" on GRUB menu, it simply restarts, shows bios logo (dell), and again displays GRUB menu.   I tried to get into recovery mode but it simply reboots after printing "Loading initial ramdisk..."  I also tried following but nothing worked:   Added modprobe.blacklist=nouveau at the end of the line that starts with 'linux' after pressing 'e' at grub menu Added nouveau.modeset=0 at the end of the line that starts with 'linux' after pressing 'e' at grub menu   My BIOS Settings and Specs:   Secure Boot = Disabled Laptop: Dell Inspiron 7567 Memory: 8GB GPU: NVIDIA GTX 1050 Ti 4GB CPU: Intel i7   Any help is appreciated.

My Ubuntu stalled while running Android's VirtualBox version, so I powered off the system. But after reset it stopped during this line:     Stopping User Manager for UID 121... _ So i googled it and have read  question and tried these steps:  Boot into Recovery Mode, drop to a root shell, and follow the steps below:   Run mount -o rw,remount / to mount the drive in Read-Write mode.Run sudo apt-get purge nvidia-* to purge the NVIDIA driver.You may also need to purge xserver-xorg and reinstall it, which will  require you to enable networking in Recovery.Reboot. You may have to add the nouveau.modeset=0 flag in GRUB to boot properly (Check my Q&A for specifics).   You should be past the screen flicker and be at your desktop.  But in doing this step:  Now reinstall the NVIDIA drivers the proper way:sudo apt-get install  nvidia-367 (or 340, 352, 364, 370, whichever works).Reboot again.  I found i have not internet, and my WiFi is not in ifconfig list!!! By running :     Iw wlp2s0 scan   I get :  N180211 not found I also search for it and not understand why WiFi gone off. Now i thinking to use live USB of ubuntu to download NVIDIA and xserver-xorg and the install the by dpkg command during tty2. Update : in Ubuntu live i have this settings :  ubuntu@ubuntu:~$ sudo lshw -c video   *-display                         description: VGA compatible controller        product: HD Graphics 620        vendor: Intel Corporation        physical id: 2        bus info: pci@0000:00:02.0        version: 02        width: 64 bits        clock: 33MHz        capabilities: pciexpress msi pm vga_controller bus_master cap_list rom        configuration: driver=i915 latency=0        resources: irq:129 memory:a2000000-a2ffffff memory:b0000000-bfffffff ioport:6000(size=64) memory:c0000-dffff   *-display        description: 3D controller        product: GM108M [GeForce 920MX]        vendor: NVIDIA Corporation        physical id: 0        bus info: pci@0000:03:00.0        version: a2        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress bus_master cap_list        configuration: driver=nouveau latency=0        resources: irq:128 memory:a3000000-a3ffffff memory:90000000-9fffffff memory:a0000000-a1ffffff ioport:3000(size=128)  and ubuntu@ubuntu:~$ sudo lshw -c display   *-display                         description: VGA compatible controller        product: HD Graphics 620        vendor: Intel Corporation        physical id: 2        bus info: pci@0000:00:02.0        version: 02        width: 64 bits        clock: 33MHz        capabilities: pciexpress msi pm vga_controller bus_master cap_list rom        configuration: driver=i915 latency=0        resources: irq:129 memory:a2000000-a2ffffff memory:b0000000-bfffffff ioport:6000(size=64) memory:c0000-dffff   *-display        description: 3D controller        product: GM108M [GeForce 920MX]        vendor: NVIDIA Corporation        physical id: 0        bus info: pci@0000:03:00.0        version: a2        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress bus_master cap_list        configuration: driver=nouveau latency=0        resources: irq:128 memory:a3000000-a3ffffff memory:90000000-9fffffff memory:a0000000-a1ffffff ioport:3000(size=128)  and : ubuntu@ubuntu:~$  cat /etc/os-release NAME="Ubuntu" VERSION="18.04.3 LTS (Bionic Beaver)" ID=ubuntu ID_LIKE=debian PRETTY_NAME="Ubuntu 18.04.3 LTS" VERSION_ID="18.04" HOME_URL="https://www.ubuntu.com/" SUPPORT_URL="https://help.ubuntu.com/" BUG_REPORT_URL="https://bugs.launchpad.net/ubuntu/" PRIVACY_POLICY_URL="https://www.ubuntu.com/legal/terms-and-policies/privacy-policy" VERSION_CODENAME=bionic UBUNTU_CODENAME=bionic  please consider the above three output has token form Ubuntu live flash system. What do you suggest and what do you think about reason of this failure? Also do you think it must be reported by me in ubuntu site, or it will be done automatically? Thanks.


Today first time in my life I saw tar.xz download. I searched the internet and found Wikipedia articles ( and )  Interesting quote about the users of xz     xz has gained notability for compressing packages in the GNU coreutils   project,[7] Debian family of systems deb (file format), openSUSE,[8]   Fedora,[9] Arch Linux,[10] Slackware,[11] FreeBSD,[12] Gentoo,[13]   GNOME,[14] and TeX Live,[15] as well as being an option to compress a   compiled Linux kernel.[16] In March 2013, kernel.org announced the use   of xz as the default compressed file format for distributing kernel   archive files.[17]   I always use tar.gz. When and why should I use tar.xz? What's the use case?  I found out after first comment that a  already posted. I often compress mongodump/mongoexport (BSON/JSON) and mysqldump (SQL text). Is there an advantage to use tar.xz for those backups?

More and more  archives use the  format based on LZMA2 for compression instead of the traditional  compression. In fact kernel.org made a late "Good-bye bzip2" , indicating kernel sources would from this point on be released in both tar.gz and tar.xz format - and on the main page of the  what's directly offered is in tar.xz.  Are there any specific reasons explaining why this is happening and what is the relevance of  in this context?


I'm currently working on a project where my model is a GLM with a beta distribution. The dependent variable is bimodal. I've done this before, in Stata, but I'm having some difficulty interpreting what R has put out. I ran the model using the VGLM command from the VGAM package. For some reason, it has produced two coefficient for each variable. This is the part that confuses me--I'm not sure how to interpret this, and I haven't been able to find any help so far. My key variable of interest is logoil_gas_valuePOP_1. Any help here would be extremely appreciated--consulting my stats teacher produced nothing.  Pearson Residuals:                                    Min       1Q   Median      3Q     Max elogit(mu, min = 0, max = 12)  -6.4754 -0.34561 0.048202 0.42250 6.32340 log(phi)                      -23.6802  0.32592 0.592333 0.68735 0.73015  Coefficients:                           Estimate      Std. Error    z value (Intercept):1            -0.2731986  /  0.0513944  /  -5.315728 (Intercept):2             0.9116027  /  0.1266222  /   7.199393 polity_5:1                0.1267469  /  0.0016007  /  79.180001 polity_5:2                0.0481726  /  0.0037464  /  12.858440 logGDP_cap2000_sup_1:1    0.0945281  /  0.0067247  /  14.056858 logGDP_cap2000_sup_1:2    0.3542733  /  0.0170221  /  20.812500 logoil_gas_valuePOP_1:1  -0.0330833  /  0.0035020  /  -9.447096 logoil_gas_valuePOP_1:2  -0.0082593  /  0.0094502  /  -0.873979  Number of linear predictors:  2  Names of linear predictors: elogit(mu, min = 0, max = 12), log(phi) Dispersion Parameter for betaff family:   1 Log-likelihood: -8592.995 on 10366 degrees of freedom Number of iterations: 25   Here is the code:  library("foreign") rossdatahw <- read.dta("c:/Users/Amanda/Desktop/PS 531/Ross Replication/rossdata1.dta") library(mosaic) library("VGAM") rossdatahw$polity01 <- with(rossdatahw,polity/10) cor(rossdatahw[,c("polity","polity01")], use="complete.obs") rossdatahw$polity1to11 <- rossdatahw$polity+1  bootrossyears <- resample(rossdatahw, within=rossdatahw$year, size=1000, replace=TRUE)  bdata <- bootrossyears  fit1 <- vglm(polity1to11~polity_5 + logGDP_cap2000_sup_1 +                          logoil_gas_valuePOP_1 + latin + latin_logoil_1 + latin +                          dem_prior_update + gdpgrowth_alt_new_1 + mus_pct_sup +                          YEAR1960_64 + YEAR1965_69 + YEAR1970_74 + YEAR1975_79 +                          YEAR1980_84 + YEAR1985_89 + YEAR1990_94 + YEAR1995_99,              data=rossdatahw[!is.na(rossdatahw$polity01),],              na.action=na.omit,              family=betaff(A=0,B=12,lmu = elogit(min = 0, max = 12)),              ##family=beta.ab(A=0, B=12),              trace=TRUE)  coef(fit1, matrix=TRUE) coef(fit1) summary(fit1)

I have a data that where the outcome is the proportion of a species observed in an area by a machine on 2 separate days. Since the outcome is a proportion and does not include 0 or 1 I used a beta regression to fit the model. Temperature is used as  an independent variable. Here is some toy R code:  set.seed(1234) library(betareg) d <- data.frame(   DAY = c(1,1,1,1,2,2,2,2),   Proportion = c(.4,.1,.25, .25, .5,.3,.1,.1),   MACHINE = c("A","B","C","D","H","G","K","L"),   TEMPERATURE = c(rnorm(8)*100) ) b <- betareg(Proportion ~ TEMPERATURE,   data= d, link = "logit", link.phi = NULL, type = "ML") summary(b) ## Call: ## betareg(formula = Proportion ~ TEMPERATURE, data = d, link = "logit", link.phi = NULL, type = "ML") ##  ## Standardized weighted residuals 2: ##     Min      1Q  Median      3Q     Max  ## -1.2803 -1.2012  0.3034  0.6819  1.6494  ##  ## Coefficients (mean model with logit link): ##               Estimate Std. Error z value Pr(>|z|)     ## (Intercept) -1.0881982  0.2620518  -4.153 3.29e-05 *** ## TEMPERATURE  0.0003469  0.0023677   0.147    0.884     ##  ## Phi coefficients (precision model with identity link): ##       Estimate Std. Error z value Pr(>|z|)   ## (phi)    9.305      4.505   2.066   0.0389 * ## --- ## Signif. codes:  0 '***' 0.001 '**' 0.01 '*' 0.05 '.' 0.1 ' ' 1    Above you can see the TEMPERATURE coefficient is .0003469. Exponentiating, exp(.0003469) = 1.000347  Update incorporating replies and comments:  You can see here how increasing temperature by 1 unit from -10 to 10 increase the proportion  nd <- data.frame(TEMPERATURE = seq(-10, 10, by = 1)) nd$Proportion <- predict(b, newdata = nd) nd$proportion_ratio <- nd$Proportion/(1 - nd$Proportion) plot(Proportion ~ TEMPERATURE, data = nd, type = "b")   The interpretation is: A 1-unit change in TEMPERATURE leads to a relative change of 1.000347 ≈0.04%  in the Proportion: $$\frac{\mathrm{E}(\mathtt{Proportion})}{1-\mathrm{E}(\mathtt{Proportion})}$$   The key word there is relative change so when you compare exp(coef(b))[2] to nd$proportion_ratio[2] / nd$proportion_ratio[1]  you'll see they are the same  ## ratio of proportion nd$proportion_ratio[2] / nd$proportion_ratio[1]  exp(coef(b))[2] nd$proportion_ratio[-1] / nd$proportion_ratio[-20]


Let $C$ be a closed non-empty set, but not necessarily convex. The support function of $C$ is given by   $$S(z) = \sup_{c \in C} \langle z,c\rangle. $$   Prove that this is a convex function.   Attempt  Let $a \in [0,1]$. Then   $$S_C(ax + (1 - a)y) = \sup_{c \in C} \langle ax + (1- a)y,c\rangle \leq \sup_{c \in C } \langle a,c\rangle + \sup_{c \in C} \langle (1-a)y,c\rangle$$  Can I actually break up the sum as $\sup_{c \in C } \langle a,c\rangle + \sup_{c \in C} \langle (1-a)y,c\rangle$? If it is not bounded?

Given an arbitrary set $A ⊂ \mathbb{R}^n$ , the support function associated with the set $A$  $ σ_A : \mathbb{R}^n \to \mathbb{R} ∪ \{+\infty\}$ is defined as  $\sigma_A(x):= \sup_{z \in A} \langle x,z \rangle$  Prove that $\sigma_A$ is convex.  Can I confirm that the inner product $\langle x, z \rangle$ is just a line orthogonal to $x$  I am confused by the meaning of "support function" and also what $\sigma_A(x)$ is. If it's the supremum of the inner product of $x$ and $z$ (which tells us what exactly?) isn't it just going to be a single point/value?   How can I prove this, and where has my interpretation failed me?


For the symmetry group $S_n$ ($n\geq1$), how many permutations $\sigma$ exist with the property that $\sigma$ doesn't map any element of $\{1,\ldots,n\}$ to itself? I know I can try to do a counting argument for small $n$ (the first numbers of $n$ ($1,2,3,4$), calculated by hand, are $0,1,2,9$) but I would like to find a general method.

I understand the whole concept of Rencontres numbers but I can't understand how to prove this equation  $$D_{n,0}=\left[\frac{n!}{e}\right]$$  where $[\cdot]$ denotes the rounding function (i.e., $[x]$ is the integer nearest to $x$). This equation that I wrote comes from solving the following recursion, but I don't understand how exactly the author calculated this recursion.  $$\begin {align*}  D_{n+2,0} & =(n+1)(D_{n+1,0}+D_{n,0}) \\ D_{0,0} & = 1 \\ D_{1,0} & = 0  \end {align*} $$


I have a weird problem. While working on a pretty large scene, I keep seeing a "triangle" shape area which I am not able to get rid of. It's as if the view is limited or something alike. I have tried render regions and disabled that several times, but that doesn't seem to be the issue. Rendering is OK. Thanks a lot for your time and much appreciate your feedback. Best regards.

When looking at my objects in 3d view I'm seeing a gray cone that seems to be hiding other objects.   Can anyone help me turn this off and explain what it is please.  Screenshots attached.


This was the starred problem in our linear algebra class.  So I understand that if a $k$-by-$k$ matrix has rank $1$, it means that all rows are linearly dependant on lets say the first one. So if I have a matrix, I can write it as:  $$ \begin{pmatrix} a_1 & c_1*a_1 & c_2*a_1 & \cdots& c_k*a_1 \\ a_2 & c_1*a_2 & c_2*a_2 & \cdots & c_k*a_2 \\ a_3 & c_1*a_3 & c_2*a_3 & \cdots & c_k*a_3 \\ \vdots& \vdots& \vdots& \ddots  & \vdots\\ a_k & c_1*a_k & c_2*a_k & \cdots& c_k*a_k \\ \end{pmatrix} $$  So if I write A+I:  $$ \begin{pmatrix} a_1+1 & c_1*a_1 & c_2*a_1 & \cdots& c_k*a_1 \\ a_2 & c_1*a_2+1 & c_2*a_2 & \cdots & c_k*a_2 \\ a_3 & c_1*a_3 & c_2*a_3+1 & \cdots & c_k*a_3 \\ \vdots& \vdots& \vdots& \ddots  & \vdots\\ a_k & c_1*a_k & c_2*a_k & \cdots& c_k*a_k+1 \\ \end{pmatrix} $$  And $\det(A+I)=a_1+1$, since I can subtract $c_n$ ($n=1,2,3,\dots k$) times the first column from all the other columns and I am left with a upper triangular matrix.  So I would get $a_1+1=1+\text{tr}(A)$ and $a_1=\text{tr}(A)$, but this can't be right? I can't figure out where I am going wrong. Any help?  Of course I read the other one, but fine, no help from here.

This problem comes from exercise from my lecturer  Let $A$ be a square matrix such that $\mbox{rank}(A)=1$. Prove that $\det(A+I)=\mbox{trace}(A)+1$.  ($I$ is the identy matrix)  I usually haven't any idea in solving linear algebra problem.


I'm running into roadblocks everywhere with this particular task. My goal is simply to have a trigger do a GET request on an external REST API service, get some data, and update the lead currently being worked on with said data during before insert/before update.   Here are some of the challenges I've run into so far:    I can't call the external web service synchronously from a trigger because it's not allowed. Fine, I tried breaking up the logic into a new asynchronous trigger that works on after insert/after update.   I can't run the update logic on after insert/after update because the lead object is read-only at that point.    My goal, at least to me, is very simple. I feel like there should be a simple solution to this. Is there something I'm missing?  Here's a simplified version of the trigger that already existed:   trigger ExistingTrigger on Lead (before insert, before update)  {   for (Lead lead : System.Trigger.new)   {     //here we do a bunch of updates to the lead based on data that already exists in salesforce. For example:      if (lead.Special_Field__c != NULL && lead.Special_Field__c != '' && System.Trigger.isInsert)     {         if (lead.Special_Field__c .contains('A Cat') && lead.Cat_Color__c == 'Orange')         {             lead.Cat_Toy__c = 'Mouse';             lead.Ginger__c = 'Y';         }     }   } }   This is the new trigger I've created to handle the call to the third party API:  trigger AssignVet on Lead (after insert, after update)  {         VetHelper vetHelper = new VetHelper();      for (Lead lead : System.Trigger.new)     {         try         {             VetHelper.UpdateVet(lead.id);         }     } }   Finally, this is the class that has the async method that is supposed to update lead with data from the third party API:   public with sharing class VetHelper {     @future (callout=true)     public static void UpdateVet(string leadId)     {        string url = 'http://192.168.0.1/lookup/' + leadId;        HttpRequest reqData = new httpRequest();        Http http = new Http();        reqData.setHeader('Content-Type','application/json');        reqData.setTimeout(20000);         reqData.setEndpoint(url);        reqData.setMethod('GET');         HTTPResponse res = http.send(reqData);        string response = res.getBody();         dbLead = [select VetName from  Lead where Id =: leadId LIMIT 1];         //let's pretend we can simply grab the values needed from the response object       dbLead.VetName = response.vetName;       Database.update(dbLead, false);     } }   The code as it stands does not work because Database.update causes both triggers to fire indefinitely.

I have been trying to integrate Google Shortener API into my salesforce org. I wrote a class to make the call out, but am having difficulty bringing the value back into the record. I have a custom object called "referral_advocate__c" with a field called "Short_URL__c". Anytime the field "unique_ID__c" has a value, I am wanting to send this value with a static URL to google shortener and then save the response value to "referral_advocate__c.short_URL__c" on the record. This is the class to make the call out:  public class URLshort {  final string urls = 'https://www.myurl.com'; referral_advocate__c adv = new referral_advocate__c();  @future(callout = true) public static void URLshortner() {      HttpRequest req = new HttpRequest();     HttpResponse res = new HttpResponse();     Http http = new Http();      req.setEndpoint('https://www.googleapis.com/urlshortener/v1/url?key=myapikey');     req.setMethod('POST');     req.setHeader('Content-Type','application/json');            req.setBody('{"longUrl":+urls + adv.unique_reference_number_c}');       try {         res = http.send(req);         System.debug(res.getBody());     } catch(System.CalloutException e) {         System.debug('Callout error: '+ e);         System.debug(res.toString());     }   }  }   The after insert trigger on "referral_advocate__c" I wrote is not firing correctly. How do I return the results from this class and update the field "short_URL__C" with the returned value from a trigger?


1-the words tumbled out so fast that I could barely hear them’  2-don't look so worried’  3-I'm not so foolish as to say that  How would you refer to the sub-modifiers/adverbs (so) in sentence 1,2,3.    a) so in sentences 1,2 and 3  b) so's in sentences 1,2 and 3  c) the so's in sentence 1,2 and 3  d) the so in sentence 1,2 and 3  e)...... type your answer

Possible Duplicate:          In the rosary, a Catholic sacramental composed of prayer beads, there is a short prayer concluding each decade called "Glory Be" ("Glory be to the Father, Son and Holy Spirit...").  Would the plural be Glory Bes or Glory Be's?  Likewise, do you say 10 Hail Marys?


The computer originally had windows 7 on it then I installed ubuntu. Once the setup was complete I tried to connect to the internet and it will not connect to my home network.

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


When I first made a .py file I told it to open in notepad, and now it wont run in cmd, it only opens the notepad, does anybody have a fix for that?. I thought that i was supossed to run it by dobble clicking it to run in cmd (i know its stupid but i did it) and then i pressed open in notepad (and of course i pressed open this with notepad or something like that) and now i cant get it back System is windows 10,  My first language is not english so please say so if you dont understand everything Sorry for such a noobish question, all answers are apreciated, and thank you in advanced.

On my system (Windows Vista Home Premium 64bit) Python files are associated with Python interpreter:  C:\Users\Piotr>assoc .py .py=Python.File C:\Users\Piotr>ftype Python.File Python.File=c:\python\2.7\python.exe "%1" %*   Nevertheless when I run any Python script from command line a window titled Open With pops up asking me to Choose the program you want to use to open this file.


Since $h$ seems to relate to a fundamental unit of quantization, it only seems right that we should have an idea of why it has the value it has. What do we know?  I understand that to some extent the precise values of universal constants are arbitrary, but when I look at the Bohr model, I see that the angular momentum of electrons comes in discrete levels that appear to be directly proportional to Planck's constant. Which suggests to me that there is something special about this number.

This is meant to be a generic question of the type that we get repeatedly on this site, in different versions:        Why do universal constants have the values they do? Can we predict their values theoretically? Do they change over time? How would the world be different if a particular constant had a different value?


Basically this question is pertraining to a . The function shouldn't be returning True mathematically. But -7 as mentioned in the comment's return's True surprisingly. Can anyone explain why -7 specifically?  I'm using python 3.7.   def check(x):     if 1+x is x+1:         return False     if 2+x is not x+2:         return False     return True  check(-7) True

Why does the following behave unexpectedly in Python?  >>> a = 256 >>> b = 256 >>> a is b True           # This is an expected result >>> a = 257 >>> b = 257 >>> a is b False          # What happened here? Why is this False? >>> 257 is 257 True           # Yet the literal numbers compare properly   I am using Python 2.5.2. Trying some different versions of Python, it appears that Python 2.3.3 shows the above behaviour between 99 and 100.  Based on the above, I can hypothesize that Python is internally implemented such that "small" integers are stored in a different way than larger integers and the is operator can tell the difference. Why the leaky abstraction? What is a better way of comparing two arbitrary objects to see whether they are the same when I don't know in advance whether they are numbers or not?


I have a workstation provided by my (about to become former) employer. Windows 10 was purchased and installed by myself on this machine. I know I can remove the Windows license with the slmgr command but is it possible to reset the OS install to "factory" somehow at the same time? As in, a blank Windows 10 install with no users and no app data just waiting for someone to log in and activate it? My plan right now is to boot into Ubuntu and just wipe the partition, but I would rather leave the machine installed and all setup. Thanks!

If I get a new Win10 computer, filled with bloatware, can I reset the factory installed Windows and create the equivalent of a clean install, getting rid of all the flotsam and jetsam?


What's the expected value of $Y= \Phi(X)$ where $X$ is a normal random variable with mean $\mu$ and variance $\sigma^2$ and $\Phi$ being the cdf of a standard normal distribution?

Suppose $\phi(\cdot)$ and $\Phi(\cdot)$ are density function and distribution function of the standard normal distribution.  How can one calculate the integral:  $$\int^{\infty}_{-\infty}\Phi\left(\frac{w-a}{b}\right)\phi(w)\,\mathrm dw$$


I am currenlty making a forum website for my uni assignment and trying to insert topics into a subcategory. It keeps bring me to a blank page after pressing submit. the url is  for the blank page, it also doesnt end up importing the data into my database     <?php             if (isset($_SESSION['username']))             {                 echo "<form action='/addnewtopic.php?cid=".$_GET['cid']."&scid=".$_GET['scid']."' method='POST'>
Title:
                 <input type='text' id='topic' name='topic' size='100' />
Content:
                 <textarea id='content' name='content'></textarea>
                 <input type='submit' value='add new post' /><form>";             }             else             {                 echo "
Please login first or click here to register.
";             }         ?>       <?php     session_start();     include('db_connection.php');      $topic = addslashes($_POST['topic']);     $content = nl2br(addslashes($_POST['content']));     $cid = $_GET['cid'];     $scid = $_GET['scid'];      $insert = mysqli_query($conn, "INSERT INTO topics (category_id, subcategory_id, author, title, content, date_posted)                    VALUES ('".$cid."', '".$scid."', '".$_SESSION['username']."', '".$topic."', '".$content."', NOW());");      if ($insert)     {         header("Location: topics.php?cid=".$cid."&scid=".$scid."");     } ?>

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?


let $n$ be a positive integer. Prove that the following expression:  $$\left\lfloor(\sqrt[3]{28}-3)^{-n}\right\rfloor$$  is not divisible by 6.  $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$.

Prove that: $$6 \not\left|\ \left\lfloor\frac 1 {(\sqrt[3]{28} - 3)^{n}}\right\rfloor \ (n \in Z^+)\right.$$ ($\lfloor x\rfloor$ = largest integer not exceeding $x$)  I am very bad as English and number theory, please help me


This might be a possible duplicate( I couldn't find a similar question though).  While travelling through trains/cars, we often pass through non-luminous  patches,as in tunnels or even at night. What I noticed, was that in such cases, the glass tends to act more like a mirror. I can partially see outside, and partly see my own reflection.   To generalise this observation: A transmitting medium like glass or plastic sheets, tend to behave like mirrors, whenever there is an imbalance in illumination on its opposing transmission surfaces, the light being reflected on whichever side there is a higher illumination. Is this statement correct by and large? And what could be the reason to it? Thanks!

In day, when you look in the room through the window out, you can clearly see what happens outside. At night when it's dark outside but there's light inside you can look in the window but it becomes a mirror.  Why?


I have uploaded Object Owner records and Object Contractor records. Also I have a Junction Object OwnerContractorAssociation. I have already established many to many relationship using junction object. But to populate records in Junction Object, I am unable to figure out the way to achieve it. Please guide on how to do it.   Thank you.

I have created two custom objects (A and B)and a junction object(AB). i.e. Both A and B have Many to Many relationship. Now I need to insert 5000 records. How can I automatically populate the relation in Junction object. DO I have to write any trigger or Do I have to do Manually mapping the records?


To update packages, I do  sudo apt-get update sudo apt-get uprgade   but it never finds security update automatically and I get this notification:   How do I install security update using apt?

I have seen and used all of these commands to upgrade packages on my system, but why are there different commands for this? Do they all not do the same thing? And if not, then in which situations would it be better to use a specific one of them?  These are the commands I mean:   sudo apt-get upgrade sudo apt-get dist-upgrade sudo apt full-upgrade   I have already looked at this, but it does not answer my question about the command sudo apt full-upgrade:


Windows Defender identified and removed a threat on my Win10Pro PC called "Trojan:Script/Cloxer.A!cl". But there is no information on the web on this trojan, searching for this yields little/nothing. The Windows Defender info on this is only that they consider it severe and: This program is dangerous and executes commands from an attacker and the .   How can I get more details on what this virus does/did? What are the commands it may have run? Does is try to obtain user names and passwords? Does it find and upload files someplace? Is it a crypto miner? Spyware? DoS zombie? How was my system impacted? Should I totally wipe and re-install?  I'd just like to know what this Trojan does/could do so I can gauge the impact of it and I'd like to know the vectors it uses as to how it got on my system.  I do keep my system up to date (on Win10 Pro V 1709 Build 16299.248) and my Defender is up to date and I run it often, but I have no other protection.  UPDATE: On the point that this post may be a duplicate - I disagree and feel this is NOT a dupe. Mainly I am looking for specific details on the Cloxer virus, not how to remove it (but that referenced post is good and a logical next read for viewers of this post).

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


How many distict arrangements of the word $\text{MATHEMATICS}$ are there that contain no $A$'s in the first 7 spaces? I'm not quite sure how I would go about answering this. At first I thought I would calculate the number of arrangements in which $A$'s are in the first 7 spaces, and subtract it from the total number of distinct arrangements, but I have no idea what to do.

How many arrangements are there of MATHEMATICS with both T's before both A's or both A's before both M's or both M's before the E ?  Can someone also point to some online resource that has such practice questions ?  Thanks.  Edit:  I have some initial thought, please tell me if I am in the right direction :  For the case both T's before both A's :  We can picture the permutation as follows :  (7) T (7) T (7) A (7) A (7)  (Remaining letters: M H E M I C S - total 7)  Each of the brackets are empty spaces for now. We need to pick 7 out of the total 7 X 5 = 35 spaces; that will ensure both T's being before both A's.  So number of ways = C(35,7) X 7!/2! (because two M's are same - we need to divide by 2!)


I'm creating a program to solve problems that are in one-dimension kinematics. I initially started with solving for only one variable--solving for final position--but decided to play around and solve for final velocity. Now, I want to give the user an option. After they input the necessary known variables, prompt them to ask "Would you like to calculate final position or final velocity? " . Based on the user input I want to branch the calculations, however I don't know how to get that done.    This is what I have so far...      Scanner reader = new Scanner(System.in);      System.out.print("Enter time in seconds: ");     double time = reader.nextDouble();     System.out.print("Enter the initial position in meters: ");     double initialPosition = reader.nextDouble();     System.out.print("Enter intial velocity: ");     double initialVelocity = reader.nextDouble();     System.out.print("Enter acceleration: ");     double acceleration = reader.nextDouble();      System.out.println("What would you like to calculate? ");     System.out.print("Final position or final velocity?");     String userInput = reader.nextLine();      if (userInput == "final position") {         double finalPosition = ((0.5) * (acceleration * (time * time)) + (initialVelocity * time) + initialPosition);         System.out.print("The final position is: " + finalPosition);     } else {         double finalVelcoity = (initialVelocity + (acceleration * time));         System.out.print("The final velocity is: ");     }   I understand that the condition I set in the if-statement is not allowed, but what can I replace that with?

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 recently had a user on a particular StackExchange site direct me to a Meta answer in a case that was not specifically addressed elsewhere in the site guidelines.   It turned out that the answer linked was from the same person directing me to it.  The answer had 4 votes and was the only answer to the question relating to the issue I raised. This particular user stated that his answer represented "the consensus on Meta".    This occurred on the Christianity SE and the Meta was the Christianity Meta.  The answer that contained the comment with a link was deleted by a moderator and I haven't been able to locate the Meta question and answer since.  But it related to what sort of answers would be and would not be acceptable for questions asking about the "Biblical basis" for something.  I disagree with the singleton Meta answer and am trying to determine to what extent that particular answer is or is not binding on Christianity SE users.  But I am also keenly interested in the general case as well.   My questions:   Can Meta answers be considered binding on users? If so, what constitutes a binding vs. a non-binding answer?   For example, is only the most highly voted answer considered binding?  Would a solo answer with just one vote be considered binding? 2 votes? 4 votes?   Does it make any difference if the Meta answer is accepted?

On our main sites "the best answer" is  as the superposition of the highest voted answer and the accepted answer.  Truth be told, the system is rather insistent on allowing multiple "right answers" and that's one of its strengths: you can be the judge of who you believe. But that doesn't always translate well on the per-site metas, which serve as a sort of policy-creation body.  People who are active on meta help decide how policies are enforced on the main site.  Moderators who have ♦-powers tend to take mandates on meta very seriously.  , accepted answers to meta-questions are no different than any other answer.  Does that leave just votes to determine consensus? Closely related: Not everyone participates on meta-sites.  It can be hard to tell if enough people have looked and voted on questions for real consensus to be declared.  Size of the site determines how many people could be voting on questions.  What counts as a quorum? Finally, sometimes people change their minds about a meta-question, but, , it's not really possible to change one's mind without a pointless edit to someone else's answer.  When should meta-questions be revisited?  On graduated sites, ♦ moderators are elected, which makes them representatives of the active participants, but on beta sites, we are appointed.  It's doubly pressing for beta sites to determine "the will of the people" since part of the point of a beta is to get a working policy framework in place before electing permanent moderators. I'm interested in figuring out how sites already answer these questions and what might be done network-wide to make discovering consensus a little bit easier.  N.B.: Obviously this assumes that consensus matters.  It does to me when I'm making my decisions and I suspect it matters to others.  But that isn't to say that it always makes a difference.  I'm really not interested in answers that hope to use this question as a grindstone for all the axes stored up against certain people who have made unpopular decisions and have the power to make those decisions stick.  Feel free to ask your own question(s).  (Thank you.)


$$\int_0^\infty e^{-\frac{1}{2}(x^2+a^2/x^2)}\,dx$$  I even know the answer but indefinite integral is much more complicated than answer. The answer, according to Wolfram is $\sqrt{\pi/2}\,e^{-a}$.

Question :  $$\int_{0}^{\infty}\exp(-x^2-1/x^2)dx=?$$  I think the answer is $\sqrt{ \pi/2 \cdot \exp(-2)}$  If I change $-x^2-1/x^2$ to $-(x-1/x)^2-2$ then the above integral becomes    $$\exp(-2)\int_{0}^{\infty} \exp(-(x-1/x)^2)dx$$   integral of $\exp(-x^2)dx$ from $0$ to infinity = square root of $\pi/2$, but then is the   integral of $\exp(-(x-1/x)^2)dx$ from $0$ to infinity=integral of $\exp(-x^2)dx$ from $0$ to infinity ?


Using * works great when I'm just searching for a word, but often I want to search for a phrase or a filename that appears in code, and it would be nice to just visually select the string and be able to hit * or # to search for it. This turns out to be more complicated than I hoped. I started with this:  vnoremap * y/\<<c-r>"<cr>\>   But this breaks if my string has a forward slash in it. I tried getting it to automatically replace forward slashes with the \/ combo, as follows:  vnoremap * yo<esc>pV:s-/-\\/-ge<cr>0D"_dd/\<<c-r>"<cr>\> " y                - yank the text " o<esc>           - open a new line " p                - paste the string " V:s-/-\\/-ge<cr> - replace / with \/ " 0D"_dd           - Grab the string and get rid of the line I just created " /\<<c-r>"<cr>\>  - Do the search   The there are (at least) two problems with this: It won't work if I can't edit the current file, and it blows up if I'm trying to grab text in a comment. When I use o on a commented line, the new line starts with a comment which means it won't scoop up the right text when I run 0D. Is there a way to make this work the way I want?

I use vim and vim plugins for visual studio when writing C++. Often, I find myself wanting to search for a string within a function, for example every call to object->public_member.memberfunc().   I know vim offers a convenient way to search for a single word, by pressing * and #, and it can also search for typed strings using the ubiquitous slash / command. When trying to search for all the instances of a longer string like the one above, it takes a while to re-type after /.   Is there a way to search for selection? For example, highlight with v, then copy with y, is there a way to paste after /? Is there an easier shortcut?


The app wants to store data about a jump (length, height, time) Whenever I try to read my file I get this exception in the line "File directory = context.getFilesDir();"     java.lang.NullPointerException: Attempt to invoke virtual method   'java.io.File android.content.Context.getFilesDir()' on a null object   reference"   I don't really know what to put in the context, so it's not null.  Thanks in advance!  public class Save {  static private String savedData; private static Context context; static String stringJump;  public static void Save(Jump jump) {     savedData += jump.getLength() + " ";     savedData += jump.getHeight() + " ";     savedData += jump.getTime() + " ";     FileOutputStream outputStream;     String filename = "savedJump";      try {         outputStream = context.openFileOutput(filename, Context.MODE_PRIVATE);         outputStream.write(savedData.getBytes());         outputStream.close();     } catch (Exception e) {         e.printStackTrace();     }     stringJump = read_file(context, filename);     Toast.makeText(context, stringJump, Toast.LENGTH_SHORT).show(); }   public static String read_file(Context context, String filename) {     File directory = context.getFilesDir();     File file = new File(directory, filename);     return file.toString(); }   }

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


I delete C:\Windows\SystemApps\Microsoft.MicrosoftEdge_8wekyb3d8bbwe but it remain on the all apps list. It didn't work but I want to remove it too.

Is there any possibility to completely disable the new Edge browser? The old IE could be disabled in Settings → Default Programs, but in Windows 10, the checkbox is missing for Edge.  Is there any way to get rid of Edge, or at least to disable all entry-points?


I have problem with some domain in WHM for sending email, only a few special domain names can not send email  to any host(Gmail,Yahoo,...) (it is possible to receive)  But other domains are correct and there is no problem sending Exim log:  2018-05-21 15:57:14 1fKix9-0007MU-FG H=alt4.gmail-smtp-in.l.google.com [74.125.199.26] Connection timed out 2018-05-21 15:57:14 1fKix9-0007MU-FG == example@gmail.com R=dkim_lookuphost T=dkim_remote_smtp defer (110): Connection timed out 2018-05-21 15:57:35 1fKix9-0007MU-FG Sender identification U=exampledomain D=exampledomain.com S=email@exampledomain.com 2018-05-21 15:57:35 1fKix9-0007MU-FG == example@gmail.com R=dkim_lookuphost T=dkim_remote_smtp defer (-53): retry time not reached for any host for 'gmail.co

I have such a logs in mainlog of exim4. All I do with exim4 is learn only so all mails are fake. Now I try to manage theese logs that appear frequently:  2016-12-20 14:28:01 1cJ2UW-0006Yq-3m == root@adammax.tk R=manualrouteadam T=maildir_home defer (-52): Retry time not yet reached 2016-12-20 14:28:01 1cJ8rt-0001Ur-Qj == root@adammax.tk R=manualrouteadam T=maildir_home defer (-52): Retry time not yet reached 2016-12-20 14:28:01 1cJ2YZ-0000W9-W5 == root@adammax.tk R=manualrouteadam T=maildir_home defer (-52): Retry time not yet reached 2016-12-20 14:28:01 1cIsqP-0002Xn-KY == gogo@linwayedm.com.tw R=dnslookup T=remote_smtp defer (-53): retry time not reached for any host 2016-12-20 14:28:01 1cJE0z-00028i-Ve == root@adammax.tk R=manualrouteadam T=maildir_home defer (-52): Retry time not yet reached 2016-12-20 14:28:01 1cIrmt-0002Hz-Td == gogo@linwayedm.com.tw R=dnslookup T=remote_smtp defer (-53): retry time not reached for any host 2016-12-20 14:28:01 1cIsS3-0002Rj-MM == gogo@linwayedm.com.tw R=dnslookup T=remote_smtp defer (-53): retry time not reached for any host 2016-12-20 14:28:01 1cJ2X1-0000R4-EY == root@adammax.tk R=manualrouteadam T=maildir_home defer (-52): Retry time not yet reached 2016-12-20 14:28:01 End queue run: pid=11801   How to remove that since I do not need that?


It seems LaTeX can't tell whether it's on an even or odd page when it's at the beginning of a new page. I'm trying to put text in the margin using a custom sort of method in a book that I'm writing. marginpar and marginnote won't work for various reasons. I found this method . I don't fully understand the syntax but I can mostly tell what it's doing.   I've printed things to the margins in 3 places using marginpar marginnote and the custom method, mynote: once at the beginning of the document, once at the beginning of a new page of the document, and once at the beginning of a new page of the document that is created by \newpage. The 1st and 3rd instances put each of the text in the correct place, but the second instance puts the mynote in the wrong margin, as though it thinks it's still on the previous page.  I've tried \strictpagecheck, that doesn't do anything. I can't really think of anything else to try.   Can anyone give some insight? To clarify, I want to have the "My Note" on the second page be on the left, as it should be, and as the marginpar and marginnote are.  EDIT: As per @Werner 's recommendation, I have changed it to  \documentclass{book} \usepackage{marginnote} \usepackage{tabto} \usepackage{changepage}  \newcommand\mynote[1]{%     \checkoddpage\ifoddpage     \tabto*{\dimexpr\textwidth+\marginparsep}%     \else     \tabto*{\dimexpr-\marginparsep-\marginparwidth\relax}%     \fi     \smash{\begin{minipage}[t]{\marginparwidth}{#1}\end{minipage}}%     \tabto*{\TabPrevPos}% }  \begin{document}     \marginnote{Margin Note} \mynote{My Note} \marginpar{Margin Par}  \vspace{60em} \marginnote{Margin Note} \mynote{My Note} \marginpar{Margin Par}  \newpage  \marginnote{Margin Note} \mynote{My Note} \marginpar{Margin Par} \end{document}   But it still doesn't seem to get the My Note to the left on the second page for me, no matter how many times I compile. The output is   If it helps to know the context, I'm using this MyNote thing for my "Asides" in  on page 232.

I already looked at related questions, such as , but I am just as baffled as before. MWE:  \documentclass{article} \begin{document} \thepage\par \null\null\null\null\null\null\null\null \null\null\null\null\null\null\null\null \null\null\null\null\null\null\null\null \null\null\null\null\null\null\null\null \null\null\null\null\null\null\null\null \null\null\null\null\null\null \thepage\par \end{document}   The above code produces a two-page document. It prints \thepage as 1 on both pages. Add another \null or two, and the second \thepage correctly shows as 2.  Apparently, \thepage does not kick in until about the third line of the page. I have tried this with more complicated code, and it seems to be the general case.  Bug? Feature? My mistake? Is there any way I can get \thepage correct on the very first line of a page? OK to use LuaTeX.


As I hang around those who are toilet training, and people who really dislike macs, I'm wondering if there is any way to make my macbook pro urine proof?   Update  What about adding a waterproof case, if any exist? I'd like to be able to use it at the same time if possible.

I am just now coming to know the hard limits of water destroying equipment. I don't know if it's realistic to be able to have my Macbook as a floatable rubber ducky in the bath in this day & age, but products like  and commercials of scuba divers using iPads have me curious.   Is liquipel the best protection on the market? Are there other custom shops that could do anything to make a MacBook either resistant to liquid or even waterproof?


My program takes a input of a text file that has words each separated by a newline and my program takes it and deals with the data, and then I am required to output to a new file whilst keeping the console output.  Now I am wondering why when I append "\n" to my stringBuilder that it prints it out as it were to have a new line in the console, but in the file output, it doesn't take it as a new line and just puts all the words in one line.  When I use newLine, then only does it give a new line in both my console output and my output file. Why is that? What does (String)System.getProperty("line.separator") do that causes this?  String newLine = (String)System.getProperty("line.separator");   try{      BufferedReader fileIn = new BufferedReader(new FileReader(fileName));       stringBuilder.append(newLine);      while((s = fileIn.readLine()) != null){         stringBuilder.append(s);         stringBuilder.append(newLine);//using newLine,       }         String a = stringBuilder.toString();       if(s== null){         fileIn.close();      }

How do I get a platform-dependent newline in Java? I can’t use "\n" everywhere.


Just a thought. I have noticed that many, many more questions are getting duplicated on SO.   This may be partly due to availability of searching within SO. I know SO questions appear frequently in Google searches with anything relating to that question, but maybe if more of an emphasis was put on the internal SO searching. It could encourage users to browse before getting to the asking stage. Feel free to agree or disagree.

A recent downvote drew my attention to my  four years ago to . I edited the answer to update the links and to (very slightly) change the tone of the answer. I was in a very bad mood at the time of the answer.  Still, reading the comments, I think I was largely correct: it's better for the site if we encourage people to do a little research before posting. Maybe even just the "two minutes of searching" that I refer to in the answer.  I was considering deleting the answer, but decided to bring the old debate back to Meta, instead.  "Was I right, or was I right?"


I need to prove that $n!$ always divides $S=a(a+1)(a+2)…(a+n-1)$.  I can see that developing the expression of $S$ will lead me towards $(a+1)^n$ which is the sum of $\sum_{0}^n\binom{n}{k}a^k$ which is obviously divisible by $n!$  My problem is that I don't see how can I prove it. If you could give me at least a hint, that would be great.

How can we prove that the product of $n$ consecutive integers is divisible by $n$ factorial?     Note: In this  and the comments here the OP has clarified that he seeks a proof that "does not use the properties of binomial coefficients". Please post answers in said newer thread so that this incorrectly-posed question may be closed as a duplicate.


Let's say that we have a matrix $A \in M_n{\mathbb{C}}$ such that $A^2=A-I_n$. Now,I want to see what I can say about its eigenvalues. I think that they are roots of the polynomial equation $x^2-x+1=0$(of course,they may come in any multiplicity). Is it true that all of $A$'s eigenvalues need to be roots of this equation(and have different multiplicities) or do only some of them need to be and the others can be any complex numbers? I believe that they all are roots of this equation and have different multiplicities,but I am not so sure.

I would be very grateful if someone can help me with the following assignment:  I'm given an $n\times n$ matrix $A$.  If $A \neq I,0$ and $A = A^2$, I need to prove that $\lambda=0$ and $\lambda=1$ are $A$'s eigenvalues and that they are $A$'s only eigenvalues.


I have a troubles with linq.  I need to get from this:  +---------+---------+-------+ | Package | WorkDay | Hours | +---------+---------+-------+ | Pack1   | 03/01   |     8 | | Pack1   | 03/01   |     7 | | Pack1   | 03/02   |     6 | | Pack2   | 03/02   |     4 | +---------+---------+-------+   to this:  +-------+-------+-------+ |       | 03/01 | 03/02 | +-------+-------+-------+ | Pack1 |    15 |     6 | | Pack2 |     0 |     4 | +-------+-------+-------+   where cell value is the SUM of Hours for that Package for that WorkDay.  This code DOES work, but it produces wrong table layout:          var query = Time             .GroupBy(t => new { t.PackageId, t.WorkDay })             .Select(t => new             {                 Package = t.FirstOrDefault().Package,                 WorkDay = t.FirstOrDefault().WorkDay,                 Hours = t.Sum(x => x.Hours)             });   Maybe there is a way to transpose query results? Im not sure how to achieve my goal in elegant way. Could somebody help me please?


Dont know how to describe this better, but what are the two tubes on every side of apocalypse head? Are they part of his armor? Or part of his body? What is the usage of them? Does he also have them in the comics?    Maybe related to this question , but I am asking specific about the tubes only.

In the movie, we can see that Apocalypse is wearing some kind of suit      that, alongside his own self, his four principal followers protect with their lives even as the ancient Egyptians betrayed them and their doom is nigh. Besides protecting his life, they also made sure that the entire suit is transferred to his new body.   It seems this suit is regarded with equal importance to his life. What is this suit, and why is it so important? What is it made of, such that Magneto - for all the metal on Earth and the adamantium in Wolverine - can't control Apocalypse's suit?


I have a toy example reproduced below in which the response variable has three possible classes. I am trying to create an ROC but not sure how to deal with it when there are three classes. Any help will be appreciated.  Thanks   library(ipred) control = rpart.control(maxdepth = 20, minsplit = 20, cp = 0.01, maxsurrogate=2, surrogatestyle = 0, xval=25) n <- 500; p <- 10 f <- function(x,a,b,d) return( a*(x-b)^2+d ) x1 <- runif(n/2,0,4) y1 <- f(x1,-1,2,1.7)+runif(n/2,-1,1) x2 <- runif(n/2,2,6) y2 <- f(x2,1,4,-1.7)+runif(n/2,-1,1) y <- c(rep(-1,floor(n/3)),rep(0,ceiling(n/3)), rep(1,ceiling(n/3))) dat <- data.frame(y=factor(y),x1=c(x1,x2),x2=c(y1,y2), matrix(rnorm(n*(p-2)),ncol=(p-2))) names(dat)<-c("y",paste("x",1:p,sep="")) dat  plot(dat$x1,dat$x2,pch=c(1:2)[y], col=c(1,8)[y],       xlab=names(dat)[2],ylab=names(dat)[3]) indtrain<-sample(1:n,300,replace=FALSE) train<-dat[indtrain,]; dim(train)  test<-dat[setdiff(1:n,indtrain),]; dim(test)  test  mod <- bagging(y~.,  data=train, control=control, coob=TRUE, nbagg=25, keepX = TRUE) mod pred<-predict(mod, newdata=test[,-1],type="prob", aggregation= "average"); pred   For two class case, I use to do the following but it is no longer valid for three classes.    yhat <- pred[,2] y = test[, -1] plot.roc(y, yhat)

In other words, instead of having a two class problem I am dealing with 4 classes and still would like to assess performance using AUC.


title says it all.. The device works with that power supply (adapter), but will it make any damage to the device or even worse (blow out or something like that)?  thanks

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


I am looking for a way to trigger a piece of code when a console application is manually closed (users closes window). Been trying with:  AppDomain.CurrentDomain.ProcessExit +=     new EventHandler(CurrentDomain_ProcessExit);   but the above doesn't work if manually closed.  Is there any ways to use a .Net call for this or do I need to import the Kernel dll and do it that way?

I have a console application that contains quite a lot of threads.  There are threads that monitor certain conditions and terminate the program if they are true.  This termination can happen at any time.  I need an event that can be triggered when the program is closing so that I can cleanup all of the other threads and close all file handles and connections properly.  I'm not sure if there is one already built into the .NET framework, so I'm asking before I write my own.  I was wondering if there was an event along the lines of:  MyConsoleProgram.OnExit += CleanupBeforeExit;


I have downloaded "firefox-29.0.tar.bz2" to update my firefox. How do I use this file to update firefox?

I have downloaded tar.gz files. But I don't know how to install it. How do I install this kind of file?


I'm new to java programming and I'm making a project which implies the use of java and mysql and I cannot manage to fix a NullPointerException in this piece of code, can anyone help me?  here's the full code, the connection part is working fine, its tested  package database; import java.sql.Connection; import java.sql.DriverManager; import java.sql.PreparedStatement; import java.sql.ResultSet; import java.util.ArrayList;  import database.mainConnection;  public class userUtils extends mainConnection {      public static void main(String[] args ) throws Exception {         userLogin("mattia",hash("password");      }       /*public static Boolean registerUser(String name, String surname, String username, String email, String password, String Affiliation, String dateOfBirth) throws Exception {         Connection con = getConnection();         // 0000-00-00 format date          PreparedStatement query = con.prepareStatement("INSERT INTO users (UserID, Username, Email, Password, Name, Surname, BirthDate, Affiliation) VALUES (?,?,?,?,?,?,?,?)");          query.executeUpdate();         return false;     }*/      public static Boolean userLogin(String username, String password) throws Exception {         Boolean bool = null;         try{             Connection con = getConnection();             PreparedStatement query = con.prepareStatement("SELECT * FROM users WHERE Username=? AND Password=?");             query.setString(1, username);             query.setString(2, password);              ResultSet result = query.executeQuery();              if(result.next()) {                 bool = true;             }              } catch(Exception e) {                 e.printStackTrace();                 }         return bool;     } }   Also it doesn't give any results back, but i guess its due to the nullpointerexception  the error points at   con.prepareStatement("SELECT * FROM users WHERE Username=? AND Password=?"); and at a printlnine where i invoke the method

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


I've got everything else (e, p, q, phi(n), n), but cannot see a way to figure out what d should be. P and q are both 300 digits, so phi(n) and n are about 600 digits, but e is only 5 digits. I do already understand that ed is congruent to 1 mod phi(n). Thanks for any suggestions.

When given $p = 5, q = 11, N = 55$ and $e = 17$, I'm trying to compute the RSA private key $d$.  I can calculate $\varphi(N) = 40$, but my lecturer then says to use the extended Euclidean algorithm to compute $d$. That's where I get stuck.    Here's my work so far:  First I use the Euclid algorithm to calculate:  40 = 2(17) + 6  17 = 2(6) + 5 6 = 1(5) + 1 = gcd   So I know the GCD is 1. Applying the 'extended' section of the algorithm:  6 = 40-2(17) 5 = 17-2(6) 1 = 6-1(5) 1 = 6-1(17-2(6)) 3(6) = 1 (17) 3(40 - 2(17)) - 1(17) 3(40) - 3(17)   I know the answer is $33$, but I have no idea how to get there using the extended Euclidean algorithm. I can't figure out why I'm getting $3(40) - 3(17)$ when I know the answer should contain $33$.


I am very much interested in logic, study & interpretation of formal languages and proof theory and other aspects related to logic and semantics. But I believe I lack a good foundation. As part of degree, I only did one module on discrete mathematics which was not very deep.   I understand that logic is based lots of sets, relations and these aspects are important to understand other things that predicate and first order logic, semantic interpretation.....,  In short my question is, can I get some help about the books i can go through to master the important foundation of logic and then possibly books about important subtopics.

I am looking to study mathematical logic, however, I find that introductory books are very daunting, which kind of disheartens me. You see, slowly but surely, I started to realize that the maths which I have learned did not just pop out of thin air, but is a collection of systems, which must of been developed via some other system, i.e, maths did not develop itself.  So I began to look into the origins of mathematics, and read that it was developed via a type of logic, which exists sort of by 'default', via a set of axioms, and then of course I looked up the definition of axioms.   So given that I'd be studying a type of logic whose origins are self evident axioms, naturally I believed there would be no prerequisites. However, in looking up mathematical logic, I have come across things such as Boolean algebra, sets, first order logic, some other type of logic, called 'traditional logic', as well as references to a sort of calculus, though not in a mathematical sense, I think.  So all in all, I am trying to develop a type of mental spider web, and I am trying to find out the strands which lye at the absolute bounds so that I may learn this mystique logic. Though I have no idea where to start.  Side note: This is the book I have started reading:   Credit goes to Wolfgang Rautenberg.


I have come across an unusual problem and found no answers after due diligence. I am using Biblatex and Biber but my citations are undefined. Things have worked fine in the past and only changes in content were made. My usual debugging process did not solve the problem. Also, not even the MWE in the following link works (let alone other MWE's found elsewhere):    The MWE in the link above used to work fine. I used the debug process described at the bottom of the post in the link above. My .blg file shows nothing. The problem persists in both Sublime Text and TeXStudio, suggesting the problem is independent of editor. I think Biber may be corrupted, but not sure if that's possible or how it could happen. According to TeX Live Utility on Mac, "universal-darwin" and "x86_64-darwin" packages are both "Installed" for latexmk and biber.  Any suggestions are appreciated.  Terminal output:  INFO - This is Biber 1.8 INFO - Logfile is '/Users/andrewwong/Dropbox/researchUCI/Shirey/first.tex.blg' data source /var/folders/9w/srfgxgpd6372qtp2dyr_x4r40000gn/T/par-    616e64726577776f6e67/cache1ea1c894d061cba85b64a1b380f6c297de02c7c4// inc/lib/Biber/LaTeX/recode_data.xml not found in .   The following is displayed in first.tex.blg:  [0] 554906f9.pm:318> INFO - This is Biber 1.8 [0] 554906f9.pm:321> INFO - Logfile is '/Users/Dropbox/researchUCI/Shirey/first.tex.blg'

I'm trying to use biblatex and when I compile my document I get an error like the following:  Windows  data source C:\Users\<username>\AppData\Local\Temp\par-5061756c\ cache-890efc00b3ca6b775c7d44a325c1349fb2a3a3bd\inc\lib/Biber/LaTeX/recode_data.xml not found in .   Mac  data source /var/folders/v2/rld0ls7d2935gkvqv5hfr1x00000gn/T/par-616c616e/ cache-cdd483146f82a9655ce063f848d5139480fbf872/inc/lib/Biber/LaTeX/recode_data.xml not found in .   Linux  data source /tmp/par-6963617269756d/cache-f37ab610b7d79b2720a8ee3732849c6821705520 /inc/lib/Biber/LaTeX/recode_data.xml not found in .


Have got in BrE  I am really confused now, so I've found out that:  Facts :  HAVE GOT is only used in the present and past form.  the plain "have" is used in all tenses.  HAVE GOT cannot be combined with the modal verbs such as :must, may, might, can, etc. and can't be combined with to+infinitive.  Only the plain "have" can be combined with the modal verbs & it can be combined with to+infinitive.ex. I want to have a pair of shoes (or) I want to have got a pair of shoes.  HAVE GOT and the plain "have" are used in BrE. (Do BrE natives use both ? Could you explain the differences between them?)  The pattern  A. HAVE GOT : I have got.. & I haven't got..& have I got (in the negative, haven't I got ___ ?)  B. HAVE : I do have.. / I have.. & I don't have.. & do I have? (negative, don't I have?)  C. past : I had got /(I did have) I had & I hadn't got /I didn't have & had I got (hadn't I got?), did I have? ( didn't I have?)  Are these facts correct? I await your explanations, thanks.

I am really confused now, so I've found out that:  Facts :  HAVE GOT is only used in the present and past form.  the plain "have" is used in all tenses.  HAVE GOT cannot be combined with the modal verbs such as :must, may, might, can, etc. and can't be combined with to+infinitive.  Only the plain "have" can be combined with the modal verbs & it can be combined with to+infinitive. ex. I want to have a pair of shoes (or) I want to have got a pair of shoes.  HAVE GOT and the plain "have" are used in BrE. (Do BrE natives use both ? Could you explain the differences between them?)  The pattern  A. HAVE GOT : I have got.. & I haven't got..& have I got (in the negative, haven't I got ___ ?)  B. HAVE : I do have.. / I have.. & I don't have.. & do I have? (negative, don't I have?)  C. past : I had got /(I did have) I had & I hadn't got /I didn't have & had I got (hadn't I got?), did I have? ( didn't I have?)  Are these facts correct? I await your explanations, thanks.


Input file a.in:  00 10 11   Command 0  cat a.in | xargs -n 1 echo   Output 0  00 10 11   Command 1  cat a.in | xargs -n 1 -I '{}' echo '{}'   Output 1  00 10 11   Why does -n 1 lose its effect in Command 1?  Version: xargs (GNU findutils) 4.6.0

Input 0  echo foo | xargs -L 1 -I '{}' echo '{}'   Output 0  foo   Input 1  echo foo | xargs -I '{}' -L 1 echo '{}'   Output 1  {} foo   Why changing the order of options of xargs changes the output?  Version: xargs (GNU findutils) 4.6.0


Let $\mathfrak{C}$ be an open cover of a topological compact space $X$, and let $\mathfrak{B}\subseteq \mathfrak{C}$ be its finite subcover. Then every subset of $X$ also has the same cover and subcover! Shouldn't every such subset also be compact then?  Motivation: I read somewhere that every closed subset of a compact space is compact. I wonder why it shouldn't be the case for every subset of $X$, rather than just the closed ones.

It seems as if every subspace of a compact topological space (equipped with its relative topology) had ought to be compact as well. Is this true in general?  And in particular, I want to use the fact that every quasi-projective variety is compact with the Zariski topology - I remember having proven it for quasi-affine varieties, but the same proof does not work for quasi-projective varieties. Is every quasi-projective variety compact?


Our sandbox got refreshed friday afternoon by an "automated process". Is there any way to recover the lost data ? Also, the integration to Clarizen is gone and I no longer can connect it.   Thanks,   Regards,   Amir

I've been working on a small consulting project for ~3 mo (100 hours), mostly Apex with a little configuration.  I used a sandbox per recommendation.  I started to work on the deploy process today and per official recommendations as I read them updated my developer sandbox first, after backing it up as best I could easily.  Of course, the refresh blew away all my work:  my code and my configuration.  No option was provided to refresh less.  Why does Salesforce tell you to follow a process that deletes all your work?  I guess there was some implicit understanding I was supposed to have created some sort of changeset first?  Was there some way to know that??  If they really want you to start fresh, couldn't they at least provide a backup option that backs up more than just your data?  Or at least a prominent warning in the deploy documentation?  Is there any easy way to get my work back?  (I'm not a total idiot;  the Apex code I spent dozens of hours on is in my code repository and I can upload the files again and rebuild the trigger config.)  Official deploying doc I was trying to follow:


I'm currently taking differential equations but the guide book (Elementary differential equations and boundary value problems) is aimed for engineers (much like the calculus one from Stewart). I'm looking for a book with the classic mathematical format (definition, theorem, corollary...) and not too much talk or applications.  Thanks

I love R. Courant and F. John's Introduction to Calculus and Analysis because of its wide coverage, precise description and friendly written style.  Are there any classic textbooks like it on ODE/PDE?  thanks.


As the title states I need to prove there are infinitely primes of the form $16n+1$ but I have absolutely no idea how to do it.

Fix $k \in \mathbb{Z}_+$. Prove that we can find infinitely many primes of the form $a2^k +1,$ where $a$ is a positive integer. We can use the result that: If $p \ne 2$ is a prime, and if $p$ divides $s^{2^t}+1$, for $s > 1$ and $t \ge 1$, then $p \equiv 1 \pmod {2^{t+1}}$.  Ive trying to get something inductively: For $k = 1$, there are infinitely many primes of the form $2a + 1$. Suppose there are infinitely many primes of the form $a2^k + 1$, and then show that there are infinitely many primes of the form $a2^{k+1} + 1$. If there are infinitely primes of the form $a2^k + 1$, where $a$ is even, then we have that, $a2^k + 1 = (2q)2^k + 1 = q2^{k+1} + 1$. Hence we are done. Therefore, suppose there are only infinitely many primes of form $a2^k + 1$, where $a$ is odd. - but I can't get a contradiction out of this.


I have SSD and HDD hard drives in my laptop and I have Ubuntu on SSD and windows 10 in HDD and (sometimes) I want to eject HDD when I am working on Ubuntu (because of power saving and...), how to do that?

I am running Kubuntu from External Hard Drive. My Internal Hard Drive has Windows on it. I don't want to use it while on Ubuntu and want to turn it off to produce less heat as well consume lower battery. I think spinning down hard drive isn't an option for me. Because, it wear out the hard drive and I don't plan to spend on HDD's :)


I'm trying to install  and this is happening all the time:  Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  woeusb : Depends: libwxgtk3.0-0v5 (>= 3.0.4+dfsg) but it is not installable E: Unable to correct problems, you have held broken packages. dimitri@dimitri-OptiPlex-780:~$    I don't know what to do

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


This is hypothetical in the spirit of a recent question about derailleur cables, but I've seen two bikes being pushed with broken rear derailleurs in the last few days.   What are likely causes of broken rear derailleurs (commuting /road especially; I assume that in MTB it's hitting stuff). Alternatively what can we do to avoid it? I've worn one out but never broken one.   Perhaps more importantly, if a rear derailleur breaks on the road, what can a rider do, and what tools would they need?

I broke the rear derailleur on my surly karate monkey recently.  I had the bike setup 2x9. I decided to try and get home by converting to single speed via trail side repair (made easier by the horizontal dropouts on the bike).   I put the chain on the big chainring in the front, figuring the front derailleur would hold it in place. I pulled the chain out of the derailleur, shortened the chain so it would not be routed through the derailleur, and I tried to find the straightest line in the rear, and selected the 20t cog to place the chain on, this was the 4th cog in from the end of the cassette.   I pulled the rear wheel backwards to tension the chain as much as possible. I had already been using a chain tensioner (surly tuggnut) to keep it stationary, so I screwed that down to keep the rear wheel from slipping under pedaling.   However, after a short time, the chain started to upshift on the cassette. It went up a cog and jammed, shifting the non-driveside forward, pushing my tire in to my chainstays. this was difficult to fix, because I had to remove the tuggnut and undo my very tight quick release.  What's the best practice for positioning the chain in the rear to avoid auto shifting and jamming like I'm experiencing?


I want to include graphics from a Google Drive network file, using the LaTeX Base online LaTeX editor. The command \includegraphics {https://drive.google.com/file/d/1oqbedMUmelhHP0ZnB12MvUIXcyAg1Hix} fails with the error message  LaTeX Error: File `https://drive.google.com/file/d/1oqbedMUmelhHP0ZnB12MvUIXc yAg1Hix' not found.  The file exists and is accessible for all to view. The file opens correctly with Microsoft Edge and Google Chrome. The filename is Etab.jpg. How can I make LaTeX Base understand what I want to achieve? A previous, more general question on this forum on the same topic is yet unanswered. I am using a free version of the package and therefore not entitled to support from the supplier.

I have tried  \includegraphics{http://www.site.com/path/to/figure.png}   But this returns the error   ERROR: Package pdftex.def Error: File `http://www.website.com/path/to/figure.png' not found.    Are there other options?


My layers are gone and I'm in global view. How do I get them back? I've tried the numbers, shift + numbers, I'm in global view and nothing works. Please help!

For some reason the layer selection and the Lock to Scene button disappeared in 3D View / Object Mode. I can't find an option to toggle the visibility.  As it is supposed to look like   How it currently looks like    File / New restores the visibility therefore it must be a setting within the .blend file. How can the layer selection be restored?


How do you get rid of film grain in a render? I made the sampling high enough and I just want to get rid of the film grain and make the pixels look smooth.

I know that this question is a bit old or maybe overdone, but I'm running the latest edition of Blender and when I use the Cycles engine I get really fuzzy results and I can't find a simple, non-compromising solution to the quality.  I don't know exactly what I'm doing wrong here, but I'm sure others share my frustration.  Leaving everything in default settings, I started a new project and switched to the Cycles render.  I duplicated the cube and set colors for two Diffuse BSDF shaders, then went ahead and made walls and a floor all sharing the same diffuse shader.  I made two windows to emit blue light.  The screenshot has gaps between the walls because of the setup:  I'm aware that it's considered very incomplete and many have come to terms with some amount of noise, but is this normal?  Furthermore, with default settings or not, I can't change the amount of noise produced.  Supposedly, using "progressively refine" in the rendering tab should make it refine itself indefinitely, however Cycles only counts to 10 refines and then stops, creating a render which is a pixel-perfect match of the ordinary rendering method when it's completed.  I understand that there are tricks that can be used to reduce noise, but at the cost of extra processing time and usually small quality conflicts, like blurring.  My question essentially boils down to is this Cycles' current limit?


I submitted my manuscript to a journal (Q4), according to SCIMAGO ranking and unfortunately it got published. I say "Unfortunately" because I think it should be submitted to a better journal. Now, is there any way to withdraw this publication? According to my googling, papers published in Q4 journals do not have any weight in CVs for academic positions such as postdocs.

I think the title asks the question, but once again in more words:  Suppose you submit a paper to a journal and it is accepted by the journal.  By this I mean that the journal tells you that they have decided to publish your paper but you have not submitted or examined final proofs and -- especially -- not signed any paperwork allowing the journal to publish the paper.    I wonder how people feel about the ethics of deciding not to go through with the publication because you now feel that the paper could be published in a better journal?  This could happen either because of outside feedback you received in the meantime or because of feedback from the referees/editors of the journal itself.  (Added: In case this was not clear, I am assuming that upon submission one was seeking to publish in that journal conditional on not learning that one has "shot way too low".)    As far as I can see, it is absolutely legal to do this, so I am not interested in the legality of it, but rather its ethics and ramifications as an academic practice.  I also think I will get better answers if I do not telegraph my own feelings about this; I will be happy to document them later on.  Let me just say (i) this is a hypothetical question, but (ii) based on my own experience it is not ridiculous that it might be in the interest of the author to engage in this practice, if it happened to be kosher to all parties involved.  Note: I had previously asked a related question, at the time wondering whether it would be better asked separately.  Based on the way things have gone thus far, I now think it is better to post this followup question separately (not necessarily right away).


Is there a method to check if a container needs scrollbars possibly without adding an object to the container?   Alternatively is there a method to tell if scaled content extends past it's container?   Update: It looks like there is a element.scrollTopMax and element.scrollLeftMax. That might be non zero after an element is larger than the container.

Can I use JavaScript to check (irrespective of scrollbars) if an HTML element has overflowed its content? For example, a long div with small, fixed size, the overflow property set to visible, and no scrollbars on the element.


I tried to get drivers from realtech but this was not working, so I went to the ALSA project page  and attempted to install alsa-lib-1.2.4 and alsa-utils-1.2.4 as instructed by the README. Now when ever i try to use apt i get a broken pip error. $ sudo apt --fix-broken install  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following additional packages will be installed:   linux-libc-dev:i386 The following NEW packages will be installed:   linux-libc-dev:i386 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. 24 not fully installed or removed. Need to get 0 B/1,138 kB of archives. After this operation, 5,965 kB of additional disk space will be used. Do you want to continue? [Y/n] y (Reading database ... 233231 files and directories currently installed.) Preparing to unpack .../linux-libc-dev_5.4.0-52.57_i386.deb ... Unpacking linux-libc-dev:i386 (5.4.0-52.57) ... dpkg: error processing archive /var/cache/apt/archives/linux-libc-dev_5.4.0-52.57_i386.deb (--unpack):  trying to overwrite shared '/usr/include/sound/asequencer.h', which is different from other instances of package linux-libc-dev:i386 dpkg-deb: error: paste subprocess was killed by signal (Broken pipe) Errors were encountered while processing:  /var/cache/apt/archives/linux-libc-dev_5.4.0-52.57_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)

I tried to upgrade Intel graphics in ubuntu 16.10 using the official installer. The last stage of unpacking libcairo2 produces an error (see figure).  When I do upgrade I get the same error also:   Preparing to unpack .../0-libcairo2_1.15.2-0intel1_amd64.deb ... Unpacking libcairo2:amd64 (1.15.2-0intel1) over (1.15.2-0intel1) ... dpkg: error processing archive /tmp/apt-dpkg-install-aYhdFd/0 libcairo2_1.15.2-0intel1_amd64.deb (--unpack): trying to overwrite shared '/usr/share/doc/libcairo2/changelog.Debian.gz', which is different from other instances of package libcairo2:amd64 Preparing to unpack .../1-libcairo2_1.15.2-0intel1_i386.deb ... Unpacking libcairo2:i386 (1.15.2-0intel1) over (1.15.2-0intel1) ... dpkg: error processing archive /tmp/apt-dpkg-install-aYhdFd/1-libcairo2_1.15.2-0intel1_i386.deb (--unpack): trying to overwrite shared '/usr/share/doc/libcairo2/changelog.Debian.gz', which is different from other instances of package libcairo2:i386 Errors were encountered while processing: /tmp/apt-dpkg-install-aYhdFd/0-libcairo2_1.15.2-0intel1_amd64.deb /tmp/apt-dpkg-install-aYhdFd/1-libcairo2_1.15.2-0intel1_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   It seems that there is a conflict in thelibcairo releases; if yes, how to resolve it ?


My dependent variable is a probability. As such, values lie between 0 and 1. The most common values are 0, 0.5, and 1 each occurring in 20% to 30% of the observations but any value in between is possible and some do occur.   Question 1: Which regression model is best to explain such data?   Ordinary least squares (OLS, function lm in R’s stats package) is not suitable as it does neither account for the limited interval nor the accumulation at the margins. Logit regression (function glm with parameter family="binomial" in R’s stats package) accounts for the accumulation at 0 and 1 but does not allow intermediate values. Ordered logit regression (function polr in R’s MASS package) could be applied when I divide the [0, 1] interval in subintervals. However, I lose the continuous nature of the dependent variable. For probit and ordered probit regressions, the same applies as for logit and ordered logit. Left- and right-censored tobit regression (function tobit with parameters left=0 and right=1 in R’s AER package) might be appropriate. However, I found the following quote: “Some researchers have considered using censored normal regression techniques such as tobit ([R] tobit) on proportions data that contain zeros or ones. However, this is not an appropriate strategy, as the observed data in this case are not censored: values outside the [0, 1] interval are not feasible for proportions data.” (p. 302 in Baum (2008), ).    Below you find a code example   # Load libraries library(stats, MASS, AER) # Generate data set.seed(123) data <- data.frame(x1 <- runif(60, min = 0, max = 1), x2 <- runif(60, min = 0, max = 1)) data$y  <- -0.7 + data$x1 + 2 * data$x2 + rnorm(60, mean = 0, sd = 0.5)     data$y  <- ifelse(data$y < 0, 0, data$y) data$y  <- ifelse(data$y > 0.4 & data$y < 0.6, 0.5, data$y) data$y  <- ifelse(data$y > 1, 1, data$y)     data$yCat <- data$y     data$yCat <- ifelse(data$yCat > 0 & data$yCat < 0.5, 0.25, data$yCat)     data$yCat <- ifelse(data$yCat > 0.5 & data$yCat < 1, 0.75, data$yCat)     data$yCat <- as.factor(data$yCat)     hist(data$y, breaks=101) # Different regression models summary(lm(y ~ x1 + x2, data=data)) # OLS summary(glm(y ~ x1 + x2, data=data, family="binomial")) # Logit summary(polr(yCat ~ x1 + x2, data=data)) # Ordered logit summary(tobit(y ~ x1 + x2, data=data, left=0, right=1)) # Tobit   To make matters worse, my data is panel data. I know how to handle individual, time, and mixed effects and random and fixed effects models using plm from R’s plm package and F-test, LM-test, and Hausman test do decide which of these is best.   Question 2: For the dependent variable described above, which panel regression model is best?   Below your find a code example for the data structure. This extends the prior example.  # Load library library(plm) # Generate data (builds on prior example) data$id <- rep( paste( "F", 1:15, sep = "_" ), each = 4)     data$time <- rep( 1981:1984, 15 ) pData <- pdata.frame(data, c( "id", "time" )) # Panel regression example summary(plm(y ~ x1 + x2, data=pData, model="within", effect="twoways")) # Based on OLS

I am thinking of building a model predicting a ratio $a/b$, where $a \le b$ and $a > 0$ and $b > 0$. So, the ratio would be between $0$ and $1$.  I could use linear regression, although it doesn't naturally limit to 0..1.  I have no reason to believe the relationship is linear, but of course it is often used anyway, as a simple first model.  I could use a logistic regression, although it is normally used to predict the probability of a two-state outcome, not to predict a continuous value from the range 0..1.  Knowing nothing more, would you use linear regression, logistic regression, or hidden option c?


This is what I would like to do: Tab A Column A has a mass of numbers, Tab B Column B will have numbers inputted into it. I need to have the Tab B Column B highlight showing a match to a number in Tab A or have a 'Yes' or 'No' answer appear in Tab B column A indicating a match. Any ideas how to do this?

I have an Excel spreadsheet with 2 worksheets. The first is just a header row and a single column of item names. The second is a list of item groups, with a header row and a title in the left most column, with each subsequent row being one item or another from the other sheet:  Sheet1:            Sheet2: +-------+--+--+    +-------+-------+-------+-------+-------+ | Item  |  |  |    | Group | Item1 | Item2 | Item3 | ... +-------+--+--+    +-------+-------+-------+-------+-------+ | Shirt |  |  |    | A     | Shirt | Hat   | Tie   | +-------+--+--+    +-------+-------+-------+-------+-------+ | Hat   |  |  |    | B     | Socks | Shirt | SHOES | +-------+--+--+    +-------+-------+-------+-------+-------+ | Socks |  |  |    | C     | Hat   | Socks |       | +-------+--+--+    +-------+-------+-------+-------+-------+ | Tie   |  |  |    | D     | Tie   | Tie   | Socks | +-------+--+--+    +-------+-------+-------+-------+-------+ | ...   |  |  | +-------+--+--+   I'd like to conditionally format all the cells in "Sheet2" such that any value that does not match a value in the first column of "Sheet1" is marked with a red background; those that do are marked with a green background. So all the cells in this example starting at B2 would be green except the value "SHOES". The value beneath that has nothing entered so would not be formatted at all.  The formatting rule for green I've tried is:  =AND(NOT(ISBLANK(B2)), COUNTIF(Sheet1!$A2:$A1000,B2)>0)   For red, about the same:  =AND(NOT(ISBLANK(B2)), COUNTIF(Sheet1!$A2:$A1000,B2)<1)   Both rules are "applied to" somewhat arbitrary range (I'd like it to apply to the whole sheet, less the topmost and leftmost row/col):  =$C$3:$E$10,$C$36:$Q$50,$E$11,$C$11,$C$2,$E$2:$Q$2,$C$12:$E$35,$F$3:$Q$35   This semi-works, but the results are unpredictable. Some values highlight as I expect but only for a few rows, and others don't. Probably my ranges are out of whack somehow, but I don't use Excel nearly as much as I once did. Can anyone lend a hand?  Thanks!


The idea of this method is to convert decimal numbers to fraction numbers. The only thing that's causing a problem is the line wert = wert * 10. When I run for example 7.52 in this method I get:  7.52  75.19999999999999  751.9999999999999  7519.999999999999  75199.9999999999  ... and it goes on and on like this causing more problems. What am I missing? I want it to go like this 7.52 -> 75.2 -> 752.0.  public static Eintrag toBruchzahl(double wert) {     System.out.println(wert);     boolean isDone = false;     int k = 0;     while (!isDone) {         if (wert % 1 == 0) {             isDone = true;             Eintrag resultat = new Eintrag((int) wert, (int) Math.pow(10, k));             //resultat.normalisieren();             return resultat;         } else {             k++;             wert = wert * 10;             System.out.println(wert);         }     }     return null; }

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


I'm starting out in graphic design. What is the best free software available? Also, are there any recommendations for PC equipment and tips for getting the best outcome?

Thanks to the internet, graphic design and programming are becoming increasingly overlapping fields.   As a programmer, I constantly find myself needing basic knowledge of Graphic Design, but have trouble locating thorough yet concise graphic design learning resources, and instead usually find bits and pieces of knowledge applicable to the task at hand.  Can you guys offer some tips or recommend some good books, tutorials, blogs, and websites which provide a beginner level overview of web design that have been, in your experience, effective and high quality learning materials. I'm not looking for tips on how to use image editing tools, but assuming a basic grasp of those, which resources and advice will best help a new designer create professional looking designs?


Simple question from a newbie here...  I am trying to create a function that accepts an array and an empty string. The function will then perform the .join() method on the array, and is supposed to set the result to the empty string.  The function seems to join (checked with console.log), however it doesn't set the result to the variable outside. What am I missing here?  The code  //empty string var newStr ='';  var myArr = ['it','was', 'the', 'best', 'of', 'times'];  var rejoiner = function (arr, str) {   str = arr.join(' ');   //checking that the function is working   console.log(str); }   Then, run the function rejoiner, passing in myArr and newStr...  rejoiner(myArr, newStr);   Then check to see if newStr was set (failure! not set!)...  newStr;

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


I have an old computer and decided to play with it. No IT background, just user experience.   I am using computer -extensively- (10+ hours every day).   I dedided to try Linux - Ubuntu (as a newbie friendly version of Linux).  However I struggle to launch crucial software, which is Office 365, UiPath robotic process automation software, Teachmaster vocabulary software, local accounting software from my country among others.   This is a serious issue for me and I dont believe Ubuntu hasnt solved it over the years. I googled a lot and after two days decided to ask here, because Ive found some workarounds like using LibreOffice instead of 365 (but I dont want to switch because of many reasons), I run process automation in UiPath daily, same with accounting soft.   Is there any way how to run those programs? I dont consider Wine (they dont support my soft) or VirtualBox an option (whats the point of switching to Ubuntu if I need to run Windows all the day inside it?)  Please help, because I could not find anything reasonable on the web and I just simply cannot believe that Ubuntu is unable to run omnipresent .exe format.   Thank you a lot.

Can .exe and .msi files (Windows software) be installed in Ubuntu?


In a research paper scientific experiments are carried out and their results recorded.  Anybody can just fabricate experiment data saying they did an experiment and these were the results. The only way you'd know if it was true is if other non related people repeated the experiments and found the same data. Does the peer review process ensure experimental data being reported is accurate and how so?

In academia, there has been recently some cases that came to light of very well known scientists that have fabricated their data out of thin air.  In some instances these papers have been cited many times by other researchers and some of them have even been praised. Thus, when the truth came to light, it also appears to the  public that scientists have bad peer-review processes.  In light of the presented reasons, how can a reviewer make at least some sanity test that the data is (most likely) not fabricated? Suggesting so could come as a great injury to the researcher, but I think there should be some kind of mechanism to control this.


Imagine a list of lists, like this: x=[['foo','bar'],['baz'],['xyz']] Except longer. I need a script to generate permutations for a list of arbitrary length containing small sets of words, also of arbitrary length. So, in this case: [['foo','bar'],['baz'],['xyz']] [['foo','bar'],['xyz'],['baz']] [['xyz'],['baz'],['foo','bar']] [['baz'],['xyz'],['foo','bar']] [['xyz'],['foo','bar'],['baz']] [['baz'],['foo','bar'],['xyz']]  I've not been able to manage this with itertools. Any suggestions?

How do you generate all the permutations of a list in Python, independently of the type of elements in that list?  For example:  permutations([]) []  permutations([1]) [1]  permutations([1, 2]) [1, 2] [2, 1]  permutations([1, 2, 3]) [1, 2, 3] [1, 3, 2] [2, 1, 3] [2, 3, 1] [3, 1, 2] [3, 2, 1]


I have tried unsuccessfully to follow a hint in Gamelin & Greene's Topology, 2nd Edition, Dover, ex.9 in Section 6, that is written to demonstrate the existence of a continuous, real valued, continuous but unbounded function on a metric space that is not complete and therefore not compact.   The author of the hint uses the real metric to create a function from it using a Cauchy sequence that does not converge.  I don't want to detail the hint, because there are frequent typos in the book, most regrettably, and I don't know if I reading it as the author intended.   The author does seem to show that the inverse of the function is unbounded and continuous using the Cauchy sequence. Does anyone know such a construction, using the inverse of d($x,x_n$) ?

Suppose $(M,d)$ a metric space. I want to show that      If every continuous real-valued function on $M$ attains a maximum, then $(M, d)$ is compact.   I was trying to do this by assuming $M$ non-compact and showing explicitly a function which does not attain a maximum. If $M$ is not bounded it's enough to take the distance from a fixed point as we can always find a sequence which "exits" every compact and pushes the distance at infinity. But what if $M$ is bounded?