I have a Windows 8.1 machine.   I made a SteamOS Virtual Machine on HyperV, using the   I know it's possible to dual boot from VHD, however Windows bootloader does not support non windows / Linux VHD boot, and SteamOS is a Debian. I wonder if it's possible to dual boot this SteamOS VHD and if it is, how will I do it?

Is there some way to boot a Linux system from a VHD in Windows 7?  If there is a way, how do I put it there in the first place?  EDIT: To clarify, I'm not trying to run Linux in a VM. I'm trying to boot it in my physical machine, from a VHD, as I can do with Windows 7.


Given that the sample size is $1500$ and the confidence interval of $p$ is $(0.050, 0.083)$. Find the confidence level and the number of successes.  I have so far that $E=Z_{1-\alpha/2}∗\sqrt{(p∗({p-1}))/n}$   Where $p$ is the center of the given interval, so $p = (0.050+0.083)/2 = 0.0665$  Also, the error $E$ as the difference of the midpoint and the endpoint of the interval so $E=0.0665-0.050=0.0165$   Plugging this into the equation I got that  $0.0165=Z_{1-\alpha/2}*\sqrt{((0.0665)(1-0.0665))/1500}$   Solving for $Z_{1-\alpha/2}$ gives $Z_{1-\alpha/2}=2.56$ and since $Z_{2.96} = 0.99$   $Z_{1-\alpha/2} = 0.01$  Is what I have so far right? If so, how do I find the number of successes? Is it just to multiply 0.99 by the number of trials?   So that way I would get $1500*0.99=1485$ ?


I am trying to return a 2D array from a method but I am returning some weird code back instead; I was expecting that to return a 3x3 array filled in |x,x,x| |x,x,x| |x,x,x|  but I am getting back this code [[I@3cd1a2f any help? import java.util.*;  class Untitled {     public static void main(String[] args) {         System.out.print(test());     }     public static int[][] test(){         int[][] result = new int[3][3];              for(int i=0; i< 3 ; i++) // i = x         {             for(int j=0; j<3; j++) // j = y  result = [i][j]             {                 result[i][j] = i;             }         }                  return result;     } }

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


A Note: This question may be the exact same question as given in  but the solutions listed there haven't worked for me.  Question:   I am trying to terminate a software installation from Ubuntu Software Center. I tried installing matlab-support 0.0.17 from the software center:     This package does not provide MATLAB. Instead, it configures an   existing MATLAB installation to integrate more comfortably in Debian   installation.   However,  I didn't have MATLAB installed on my system and accidentally attempted to download matlab-support 0.0.17. As a result, I'm facing the following problem:  Whenever I open Ubuntu Software Center, I notice that there is a process always running. It shows matlab-support 0.0.17 installing...    I look for a way to terminate the installation from the Progress tab to get this:    Once there, I see no way to deselect or terminate the process.  Edit: Output for 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 12 not upgraded.   Edit: Output for sudo apt-get upgrade  Reading package lists... Done Building dependency tree        Reading state information... Done The following packages have been kept back:   dpkg-dev libatlas3gf-base libblas-dev libblas3gf libdpkg-perl liblapack-dev liblapack3gf linux-headers-generic-lts-quantal   linux-image-generic-lts-quantal r-base-dev r8168-dkms texinfo 0 upgraded, 0 newly installed, 0 to remove and 12 not upgraded.   Edit: Output for dpkg -l | grep matlab No output message:  anirudh@anirudh-Vostro-3445:~$ dpkg -l | grep matlab anirudh@anirudh-Vostro-3445:~$    Edit: Output for sudo apt-get install matlab-support  Reading package lists... Done Building dependency tree        Reading state information... Done The following NEW packages will be installed:   matlab-support 0 upgraded, 1 newly installed, 0 to remove and 12 not upgraded. Need to get 0 B/27.9 kB of archives. After this operation, 165 kB of additional disk space will be used. debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable Selecting previously unselected package matlab-support. (Reading database ... 187961 files and directories currently installed.) Unpacking matlab-support (from .../matlab-support_0.0.17_all.deb) ... Processing triggers for bamfdaemon ... Rebuilding /usr/share/applications/bamf.index... Processing triggers for desktop-file-utils ... Processing triggers for gnome-menus ... Processing triggers for hicolor-icon-theme ... Processing triggers for man-db ... Setting up matlab-support (0.0.17) ... debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable dpkg: error processing matlab-support (--configure):  subprocess installed post-installation script returned error exit status 1 Errors were encountered while processing:  matlab-support E: Sub-process /usr/bin/dpkg returned an error code (1)   Edit: Output for sudo fuser -v /var/cache/debconf/config.dat                       USER        PID ACCESS COMMAND /var/cache/debconf/config.dat:                      root      11060 F.... dpkg-preconfigu   Edit: Another set of commands with output sudo kill -9 11060 and sudo apt-get install matlab-support :  anirudh@anirudh-Vostro-3445:~$ sudo kill -9 11060 anirudh@anirudh-Vostro-3445:~$ sudo apt-get install matlab-support E: Could not get lock /var/lib/dpkg/lock - open (11: Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/), is another process using it?   Edit: Output for sudo fuser /var/lib/dpkg/lock (No output message)  anirudh@anirudh-Vostro-3445:~$ sudo fuser /var/lib/dpkg/lock [sudo] password for anirudh:  anirudh@anirudh-Vostro-3445:~$

I'm trying to install the flashybrid but when I enter the apt-get install flashybrid command, I get this error:  root@user-desktop:/home/user# apt-get install flashybrid Reading package lists... Done Building dependency tree Reading state information... Done flashybrid is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 1 not fully installed or removed. After this operation, 0B of additional disk space will be used. debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable Setting up flashybrid (0.15+nmu2) ... debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable dpkg: error processing flashybrid (--configure): subprocess post-installation script returned error exit status 1 Errors were encountered while processing: flashybrid E: Sub-process /usr/bin/dpkg returned an error code (1)   I also tried this one to find what is already using that file:  root@user-desktop:/home/user# lsof | grep /var/cache/debconf/config.dat lsof: WARNING: can't stat() fuse.gvfs-fuse-daemon file system /home/user/.gvfs Output information may be incomplete. dpkg-prec 4672 root 4rW REG 8,6 39658 1697827 /var/cache/debconf/config.dat   But I don't know how to fix this.


Hello Is there a way to use an gmail accout as a mailinglist.  Right now we are having some problems at my job with our email. We are moving over to another system but in the mean time we need to have a mailinglist that is one email we can send to to communicate with all the employees.  Example: Send email to everyone@gmail.com and the mail will go to everyone signed up.  Who can you do this well with google? Dose everyone have to confirm with the confirmation code? What is an easyer way to do this that is spam free?

Can I setup kind of a mailing list / newsletter from my Gmail / GApps account?


If $X \sim Beta(a, b)$ and $Y \sim Beta(c, d)$, independently, such that $a = c + d$, find the distribution of $XY$  How to tackle this problem?

Here is a problem that came in a semester exam in our university few years back which I am struggling to solve.     If $X_1,X_2$ are independent $\beta$ random variables with densities $\beta(n_1,n_2)$ and $\beta(n_1+\dfrac{1}{2},n_2)$ respectively then show that $\sqrt{X_1X_2}$ follows $\beta(2n_1,2n_2)$.   I used the Jacobian method to obtain that the density of $Y=\sqrt{X_1X_2}$ is as follows: $$f_Y(y)=\dfrac{4y^{2n_1}}{B(n_1,n_2)B(n_1+\dfrac{1}{2},n_2)}\int_y^1\dfrac{1}{x^2}(1-x^2)^{n_2-1}(1-\dfrac{y^2}{x^2})^{n_2-1}dx$$  I am lost at this point actually. Now, in the main paper, I found a hint had been supplied. I tried to use the hint but could not obtain the desired expressions. The hint is verbatim as follows:     Hint: Derive a formula for the density of $Y=\sqrt{X_1X_2}$ in terms of the given densities of $X_1$ and $X_2$ and try to use a change of variable with $z=\dfrac{y^2}{x}$.   So at this point, I try to make use of this hint by considering this change of variable. Hence I get, $$f_Y(y)=\dfrac{4y^{2n_1}}{B(n_1,n_2)B(n_1+\dfrac{1}{2},n_2)}\int_{y^2}^y\dfrac{z^2}{y^4}(1-\dfrac{y^4}{z^2})^{n_2-1}(1-y^2.\dfrac{z^2}{y^4})^{n_2-1}\dfrac{y^2}{z^2}dz$$which after simplification turns out to be (writing $x$ for $z$)$$f_Y(y)=\dfrac{4y^{2n_1}}{B(n_1,n_2)B(n_1+\dfrac{1}{2},n_2)}\int_{y^2}^y\dfrac{1}{y^2}(1-\dfrac{y^4}{x^2})^{n_2-1}(1-\dfrac{x^2}{y^2})^{n_2-1}dx$$  I do not really know how to proceed. I am not even sure that I am interpreting the hint properly. Anyway, here goes the rest of the hint:     Observe that by using the change of variable $z=\dfrac{y^2}{x}$, the required density can be expressed in two ways to get by averaging $$f_Y(y)=constant.y^{2n_1-1}\int_{y^2}^1(1-\dfrac{y^2}{x})^{n_2-1}(1-x)^{n_2-1}(1+\dfrac{y}{x})\dfrac{1}{\sqrt{x}}dx$$Now divide the range of integration into $(y^2,y)$ and $(y,1)$ and write $(1-\dfrac{y^2}{x})(1-x)=(1-y)^2-(\dfrac{y}{\sqrt{x}}-\sqrt{x})^2$ and proceed with $u=\dfrac{y}{\sqrt{x}}-\sqrt{x}$.   Well, honestly, I cannot understand how one can use these hints: it seems I am getting nowhere. Help is appreciated. Thanks in advance.


Find the value of $$\sin\frac{\pi}{7}\sin\frac{2\pi}{7}\sin\frac{3\pi}{7}\sin\frac{\pi}{14}\sin\frac{3\pi}{14}\sin\frac{5\pi}{14}$$   $$\sin\frac{\pi}{7}\sin\frac{2\pi}{7}\sin\frac{3\pi}{7}\sin\frac{\pi}{14}\sin\frac{3\pi}{14}\sin\frac{5\pi}{14}$$ $$=\sin\frac{2\pi}{14}\sin\frac{4\pi}{14}\sin\frac{6\pi}{14}\sin\frac{\pi}{14}\sin\frac{3\pi}{14}\sin\frac{5\pi}{14}$$ $$=\sin\frac{\pi}{14}\sin\frac{2\pi}{14}\sin\frac{3\pi}{14}\sin\frac{4\pi}{14}\sin\frac{5\pi}{14}\sin\frac{6\pi}{14}$$  How can I compute $$\prod\limits_{r=1}^{n}\sin\frac{r\pi}{c}$$

Using $\text{n}^{\text{th}}$ root of unity  $$\large\left(e^{\frac{2ki\pi}{n}}\right)^{n} = 1$$  Prove that   $$\prod_{k=1}^{n-1}\sin\frac{k \pi}{n} = \frac{n}{2^{n-1}}$$


I wonder if either the coordinate ring $A(X):=\mathbb{C}[x,y]/(x^2+y^2-1)$ or the polynomial ring $\mathbb{C}[t,t^{-1}]$ are unique factorization domains?   I know that those are isomorphic, so the answere for one of those would do it. In my trys of solving this issue, I saw that: $y^2 = (1-x)(1+x)$ ist a none-unique factorization in irreducible elements, because $y, (1-x)$ and $(1+x)$ are irreducible in $\mathbb{C}[x,y]/(x^2+y^2-1)$. But I can't even prove, that $y$ is irreducible. I know, that there are no none-units nor units, which I could multiply and get $y$ again. As far as I know, the units in $A(X)$ are the constant polynomials.  I hope that someone can understand my issue (so in advance in hope you can read my spelling w/o getting hurt :) ..) and make this topic clear to me.   Thanks

Let $R$ be the ring of functions that are polynomials in $\cos t$ and $\sin t$ with real coefficients.    Prove that $R$ is isomorphic to $\mathbb R[x,y]/(x^2+y^2-1)$.  Prove that $R$ is not a unique factorization domain. Prove that $S=\mathbb C[x,y]/(x^2+y^2-1)$ is a principal ideal domain and hence a unique factorization domain.  Determine the units of the rings $S$ and $R$. (Hint: Show that $S$ is isomorphic to the Laurent polynomial ring $\mathbb C[u,u^{-1}]$.)


This was a part of a larger question. I have the solution with me, but I have a problem with the way they wrote it.   The expression was written as  $$\frac{\sin (\frac{x+29x}{2})\sin(\frac{2x.15}{2})}{\sin\frac{2x}{2}}$$  Is this a formula that I am not aware of, or was it somehow derived from the specific information

How can we sum up $\sin$ and $\cos$ series when the angles are in arithmetic progression? For example here is the sum of $\cos$ series:  $$\sum_{k=0}^{n-1}\cos (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \cos \biggl( \frac{ 2 a + (n-1)\cdot d}{2}\biggr)$$  There is a slight difference in case of $\sin$, which is: $$\sum_{k=0}^{n-1}\sin (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \sin\biggl( \frac{2  a + (n-1)\cdot d}{2}\biggr)$$   How do we prove the above two identities?


How old was Tom Riddle when he made each of his Horcruxes, and who did he kill to create each? I know about Myrtle, The Riddle family, Hepzibah, and Harry's parents, but who were the others?

In what order and when were Voldemort's Horcruxes made? I found a list with . But not creation date.


I'm designing a digital I/O module which isolated with optocouplers. I'm done with the outputs, but having a confusion about input side.     I will have some switches and sensors to read as inputs, but I don't know how to do the connections, can someone show me as a schematic?  Which pin should be GPIO pin for example?

I'm designing an I/O module by using optocouplers for the inputs and outputs which I want to control by a microcontroller.   Here are my questions:   In the datasheet of optocoupler's output current (per channel) is 50mA, and for the output port(figure 1) Relay nominal operating current is 16.7 mA. By knowing these can I calculate how much current will I need for the system. Which parameters do I know?   There are 12 relays, 20 optocouplers (5 module) in total. 3 Opto module for output, 2 for input ports     By directly connecting the GPIO pin and output of the optocoupler to the switches (as input), Can I control the inputs shown in the figures. For the input ports, I don't know how to make the connections. What should I connect to the collector pin?


I know that TNG showed that Spock and McCoy were still alive, and it explained about Scotty, and Generations explained about Kirk, but does anyone know what happened to Sulu, Chekov or Uhura? I know that there was something mentioned somewhere in Voyager about a Captain Sulu having sponsored Chakotay's entrance into the academy, but if anyone else knows anything, I would be pleased to find out.

I just rewatched the TNG episode "Relics", where Scotty is revealed to have kept himself alive in the transport buffers of a ship. This got me thinking - do we know what happened to other members of the TOS bridge crew after the TOS movies (Up to and including Generations)?  For example, we know that Kirk eventually meets his end in Star Trek: Generations and that Spock has a long career and eventually ends up in the reboot universe.  Do we know any information about other members of the Enterprise crew?  If that question is too broad (for example, if there's lots of canon information about the crew after TOS), then more specifically, what is the latest canon information that we know about their lives?


What I want to do is for the flight sim world (XP11 now). One of the helpful things with max was the ability to use planes to put a plan on in order to get correct shapes etc for a model. Essentially there would be 3 views, top, side and front.  I'm trying to build a poly aircraft hanger on which photo textures can be baked.

Cannot find Background Images feature to add in a photo in Blender 2.8  Where is it?


I have an old laptop Acer 6930. There are 2 RAMs in it and both of them are 667 MHz:      When I checked in CPUZ , it shows like this:    Is there anything wrong with it?   Besides it shows as 333 MHz in CPUZ instead of 667 MHz. Laptop became very slow after having these 2 RAMs.

I am running a Core i7 CPU originally at 3Ghz overclocked to 4Ghz using a multiplier of x20 and a Bus Speed of 200 Mhz  My memory is 1600 Mhz OCZ.  I installed CPU-Z to see what is going on - but it shows me (under the "Memory" Tab):  DRAM Frequency 800 Mhz  Channel Triple - NB Frequency 3800.2 Mhz  So what is the actual frequency its running on then? I am slightly confused.


{  public static class Member {     private String name;     private int age;      public Member(String x,int y){     name=x;     age=y;     }     public int compareTo(Member a){     if(a.getAge()>age)         return 1;        else if (age<a.getAge())         return -1;         else return 0;     }      public String getName(){return name;}      public int getAge(){return age;} }  public static void sortMember(Member [] a,int l){ for (int j = 0; j < l-1; j++) { if (a[j].compareTo(a[(j+1)]) > 0) {       Member temp = a[j];       a[j] = a[j+1];       a[j+1] = temp;  }} } public static void main(String[] args) {      String name[]=new String[7];     int age[]=new int[7];     for(int x=0,y=0;x<14;x+=2,y++){     name[y]=args[x];     age[y]=Integer.parseInt(args[x+1]);}      Member [] s= new Member[7];      for(int i =0;i< (s.length -1);i++){         s[i]=new Member(name[i],age[i]);                     }          for(int count =0;count< (s.length -1);count++){              System.out.println(s[count].getName()+" "+s[count].getAge());              }           sortMember(s,s.length);     for(int count =0;count< (s.length -1);count++){     System.out.println(s[count].getName()+" "+s[count].getAge());     }     }}     CommandLine Arguments: Alice 15 Bob 55 Cat 56 David 63 Elan 37 Fanny 75 Helen 55  Output:  Alice 15 Bob 55 Cat 56 David 63 Elan 37 Fanny 75 Exception in thread "main" java.lang.NullPointerException     at TestAsg1Q1$Member.compareTo(TestAsg1Q1.java:16)     at TestAsg1Q1.sortMember(TestAsg1Q1.java:30)     at TestAsg1Q1.main(TestAsg1Q1.java:55)

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'm working on an addon that generates buildings based upon a base mesh.  Presently, I'm hoping to add a feature that allows the user to very quickly create the base mesh using a modal operator, whereby they would be able to extrude the base mesh in fixed increments by clicking and dragging the faces they want to extrude.  I want the operator to check if the mouse cursor is over a face on the base object, and set that face as the active selection. Anyone done something like this before? Any help you could offer would be greatly appreciated!  (Note: If there's a more efficient means to the same end, I'm very open to suggestions!)

Can I get from bpy which (if any) vertex / edge / face is currently under the mouse cursor? This would be quite useful for making more modeling tools.  Right now what I have to do is, , use a selection list and update it when new valid edges are added to the selection. The problem with that is I loop through all edges each time, which can be a bit slower on large meshes.


Let $A \in M_n(\mathbb{C})$ be an invertible matrix.  Prove that $A$ is diagonalizable iff $A^{m}$ is diagonalizable for $m \in \mathbb{N}$  I have proved that if $A$ is diagonalizable then $A^{m}$ is diagonalizable.  But I didn't know how to prove that if $A^{m}$ is diagonalizable for $m \in \mathbb{N}$ then $A$ is diagonalizable.

Suppose that $V$ is a finite dimensional $\mathbb C$-vector space, and suppose that $T:V\rightarrow V$ is injective. If there is a $m\in\mathbb N$ such $T^m$ is diagonalizable, then $T$ is diagonalizable.  I've found the proof for the case that $T^m=Id$, but I can't adapt it to this case.


I have recently noticed that notifications in chatrooms work in the same manner as in the comment section on the site. That is: you are only notified if your username is deliberately tagged (or if it's a comment on your question).   Would it be an idea to allow for notifications to all users that have participated in a specific chat when any new message is added?   This is what I would expect from being used to other chats, and I therefore forgot about a conversation completely while waiting for it to notify me because I am not aware that I must manually go there and look often. The chatrooms are different in use and purpose from comment sections, and you except to be a part of a conversation, not just to leave a comment - which thus needs a different reasoning for these notifications.   I can imagine an on/off button for the notifications, though, since some users might wish to exit the conversation for good at some point and let them avoid the nuisance of being notified.

I created  and enabled desktop notifications. Currently I don't get notified of all new messages, only those where someone mentioned me. In my opinion it's confusing and notifications should be shown for all new messages, like in Skype for example. Can we have optional notification for any new chat message in our room, not just those aimed at us?


I am in need for a technical solution for a shooting of shoes. I have this reference:     Could someone please advise on the fallowing:   Do I need a light box like this one?      What is the correct camera to shoot with (a fullframe maybe?) or will an average DSLR make the job with the correct lens? What is a proper lens to shoot this correctly?  What is the kind of light and light setup for this? Is there a particular technique to achieve this (like focus stacking for example)?     The result I want is exactly as in the exmaple I gave. Also if nobody has the time to answer as I imagine is not that simple and this result comes with years of experience, a good tutorial might come handy.  Thank you in advance!

Our college is setting up a photo studio in campus. Mostly the we do product shoots. We have some old strobes, softboxes to start with. We need suggestions on the equipments listed below.   Which are the commonly used backdrop screen colors used or say must have colors?  Suggested tripod and head? Colors for reflectors?


Suppose $ f $  has a power series expansion at $0$ which converges in all of C. Suppose also that $ \int_C \mid{f(x+iy)\mid} dxdy <\infty $. Prove $ f $ is identically $0$. Now I have proved that $f(0) =0$. Can I then claim that by continuity and since C is an open and connected region $f$ will also be zero or is this logic flawed?

Let , $f:\Bbb C \to \Bbb C$ be an entire function and $\displaystyle \int_{\Bbb R^2}|f(x+iy)|\,dx\,dy<\infty$. Then prove that $f(z)=0$ for all $z\in \Bbb C$.   Put $x=r\cos \theta$ and $y=r\sin \theta$. Then , integration becomes $\displaystyle \int_{r=0}^{\infty}\int_{\theta=0}^{2\pi}|f(re^{i\theta})|r\,d\theta\,dr<\infty$. But from here I'm unable to conclude nothing.! How I proceed? Any hint please.


All I want is to have two different windows of the same document but at different zoom percentage that updates change in real-time, like one in 500% zoom for detailing work and other at 100% for the final result.

When drawing pixel art in Photoshop, I like to have the zoom level really high.  Is there a way to also have a regular-level zoom (or perhaps an outer zoom) in another part of the window, so that I can see how the regular zoom will look as I work?


I have a scrip with a while. On that while i would like to measure the time that the content of it takes to run, in miliseconds, something like this:  while condition; do     #begin measure time at begining     instructions     #end measure time at end     echo "$end-$begin" done   I can't use date +%s.%N because my machine doesnt have it, so i need to use either time or times comand. Any idea how to?  thanks

I love using time to find out how long a command took to execute but when dealing with commands that execute sub-commands internally (and provide output that allows you to tell when each of those sub-commands start running) it would be really great to be able to tell after what number of seconds (or milliseconds) a specific sub-command started running.  When I say sub-command, really the only way to distinguish these from the outside is anything printed to standard out.  Really this seems like it should be an option to time.


I have:  If $\phi:\mathbb{Z}\to\mathbb{Z}$ is a homomorphism, then $f(1)=f(1\ast1)=f(1)\cdot f(1)$. Then $$0=f(1)\cdot f(1)-f(1)=f(1)\cdot\left[f(1)-\epsilon\right]$$ implies that $f(1)=0$ or $f(1)=1$, since there are no zero-divisors in $\mathbb{Z}$.  How should I show that this leads to the fact that $\forall x\in\mathbb{Z}$, we have $f(x)=0$ or $f(x)=x$?

I must assume that there exists f such that:  $$f(x+y) = f(x)+f(y)\\f(x\cdot y) = f(x)\cdot f(y)$$ One thing I managed to do was:  $$f(2+2) = f(2) + f(2) = f(2\cdot 2) = f(2)\cdot f(2) \implies \\f(2)+f(2) = f(2)\cdot f(2)\implies \\2f(2) = f^2(2) \implies f^2(2)-2f(2)=0 \implies f(2)(f(2)-2) = 0 \implies\\ f(2) = 0 \text{ or } f(2) = 2$$  but how to extend this argument to all the integers? That is, how to force $f(3) = 3$ and so on?


im trying to make a small program that asks for a number between 1-10 and then gives out a different prewritten response. this is what i have so far.  import java.util.Scanner; public class AlasFutureTeller {         public static void main(String [ ] args)     {         System.out.println("I CAN READ YOUR FUTURE!");         System.out.println("TYPE A NUMBER BETWEEN 1 AND 10 TO MEET YOUR FATE!!");         Scanner oneTen = new Scanner (System.in);         int one == oneTen;         if (oneTen=="one")             System.out.println("YOU WILL GO TO SLEEP TODAY!!");         else if ( oneTen=="two")             System.out.println("YOU WILL HAVE A BIRTHDAY EVERY YEAR UNTIL YOU DIE!!");         else if ( oneTen=="three")             System.out.println("YOU WILL SHOWER SOMETIME IN THIS YEAR!!");         else if ( oneTen=="four")             System.out.println("YOU WILL LIVE UNTIL YOU THE DAY YOU DIE!!");     } }

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?


Barack Obama told a Virginia school last year, "I think it's time we treated our teachers with the same level of respect right here in the United States of America."  I totally understand what he's saying, but I want to ask how that 'treated' is grammatically possible? Cause he's saying 'It's time we~', which means he's talking about what we should do in the future (?), but why did he say that past verb?

It's time colleges helped you compare apples to apples. (The Boston Globe)  If the time is a present moment, why does the journalist use "help" in the past tense? Or is "helped" subjunctive?


I'm on 14.04 LTS. 16.04.1 is supposed to be out, but this is what I get in the command line:  $ sudo do-release-upgrade -c Checking for a new Ubuntu release No new release found $ lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 14.04.4 LTS Release:        14.04 Codename:       trusty   I have no idea where to start investigating this. Why can't my Ubuntu find the upgrade?  EDIT: answers have been suggested saying I should try sudo do-release-upgrade -d. I'm not sure I want to do that: I don't want to install the development version. Even if what this produces is not the installation of the development version but the installation of the point release (and I'm not sure I'll have any evidence of that until after the fact), I'm not sure I want to request the development version. I want to request a normal update. Also, this does not explain what's going on, nor does it solve it: it just bypasses it. If using -d is really the only solution available, I'll do it, but I'd much rather go to the root of the problem if I can.  EDIT 2: I ended up using the new meta-release-lts file solution.

So, today is July 21st and . gives me an option to download 16.04.1 LTS. However, attempting to upgrade gets me this message -  $ sudo do-release-upgrade Checking for a new Ubuntu release No new release found   What is wrong? Does it matter that I am running apt-get update behind apt-cacher-ng?  Note: Commenting out the files in apt.conf.d that used apt-cacher-ng did not make a difference.  Edit: Explanation for possible duplicates:  deals with upgrade from 12.04LTS to 14.04LTS. My question is specific to 14.04 LTS to 16.04.1 LTS upgrade. Old answers, while good for archival purposes are less relevant in a fast changing package like ubuntu. Moreover none of the answers answer what is wrong. The link  pointed out is mentioned in one of the comments. This Q & A is more helpful for people upgrading today than the work around mentioned in "".


I would like to be able to call in a rectangular image into Latex and have it appear as a parallelogram instead of a rectangle. For instance, \documentclass{article} \usepackage{graphicx} \begin{document} \begin{minipage}[]{\textwidth}   \centering   \includegraphics[width=0.45\textwidth]{example-image}     \end{minipage} \end{document}  produces the rectangular image  QUESTION: How may I have it appear as a parallelogram inclined slightly to the right (say, base angles 85 degrees and 95 degrees, respectively) with the lengths of the corresponding sides the same as that of the rectangle? Something like this:  Thank you.

Using the graphicx package, I can make any arbitrary box rotated using the \rotatebox{...}{...} command. Is there a comparable command in any package that lets me shear a box, i.e., producing a kind of general slanting?


I know that I already found this, but I am not sure where, so I ask it here.  How can I individually specify the number and alignment of a bracket matrix using bmatrix?  \documentclass{article}  \usepackage{mathtools}  \begin{document}  \begin{displaymath} A = \left[% \begin{array}[@{}lcr@{}] a & b & c \\ d & e & f \\ \end{array} \right] \end{displaymath}  % Achieve the same as above  \begin{displaymath} \begin{bmatrix}[lcr] a & b & c \\ d & e & f \\ \end{bmatrix} \end{displaymath}  \end{document}

When studying systems of linear equations, it's nice to remind people that the last column of the coefficient matrix holds the constants.  This is often done in books by putting a vertical line between the last column and the next to last column.  What is a good way to do this in LaTex?


I have a Python script which generates a lot of different text outputs that require me to clear the screen quite regularly. The problem with this is that once the script is finished, I have a terminal full of junk that I no longer need. I could just clear the terminal, but I'd prefer to have a behaviour similar to what happens when you 'watch' a command.  Watch makes it's own kind of 'sub-screen', and once you kill it you're returned to the terminal with all the displayed output from your command cleared away and your previous commands shown in the terminal. I think this is much cleaner.  Is there any way to achieve this? I'm using C shell if it's relevant but I could just as easily use bash or some other shell.

I want a similar behavior as less vim nano etc. uses.  Is this possible to achieve with bash?


Does there exist a bijection $f: \mathbf{N} \to \mathbf{N}$ such that $$ \forall A \subseteq \mathbf{N}, \quad  \sum_{n \in A}\frac{1}{n}<\infty \Longleftrightarrow \sum_{n \in A}\frac{1}{\sqrt{f(n)}}<\infty\,\,? $$

Let me start with a precise statement of the question.  For a subset $A\subseteq \mathbb{N}$ and a series of positive real numbers $\sum_{n=0}^\infty a_n$, I'll use the notation $\sum_A a_n$ as a shorthand for $\sum_{n\in A} a_n$.  Is there a bijection $f:\mathbb{N}\rightarrow \mathbb{N}$ with the property that for every $A\subseteq \mathbb{N}$, $\sum_A \frac{1}{n}$ converges iff $\sum_{f(A)} \frac{1}{\sqrt{n}}$ converges?  Background: Fix a series of positive terms $\sum_{n=0}^\infty a_n$.  Given a subset $A\subseteq \mathbb{N}$, call it $a_n$-small if $\sum_A a_n$ converges.  The following proposition is easy to prove:  Proposition:  The set $\{A\subseteq \mathbb{N}: A\text{ is } a_n\text{-small}\}\cup \{\mathbb{N}\}$ is a topology of closed sets on $\mathbb{N}$.  I will use the notation $(\mathbb{N},a_n)$ to refer to this topology.  Then one can ask how topological properties of $(\mathbb{N},a_n)$ are related to series properties of $\sum a_n$.  For example, I can show:  Proposition:  The following are equivalent.  $\sum a_n$ converges.  $(\mathbb{N},a_n)$ is discrete.  $(\mathbb{N},a_n)$ is disconnected.  $(\mathbb{N},a_n)$ is Hausdorff    And there are other nice things.  For example, $(\mathbb{N},a_n)$ is compact iff $(\mathbb{N},a_n)$ is cofinite iff $\liminf a_n > 0$. With this language, my question can be reformulated as...  Are $\left(\mathbb{N}, \frac{1}{n}\right)$ and $\left(\mathbb{N}, \frac{1}{\sqrt{n}}\right)$ homeomorphic?  I have made very little progress on this.  Of course, the identity function $i:(\mathbb{N}, \frac{1}{\sqrt{n}})\rightarrow (\mathbb{N}, \frac{1}{n})$ is a continuous bijection, but the inverse map is not continuous.  Also, if there is such a bijection, there there is such a bijection with agrees with $i$ on any preassigned finite set. Edit  I thought I add in a slightly suprising (to me, at least) example when things work out to be homeomorphic. Begin with a convergent series $\sum c_n$. and divergent series $\sum a_n$ with $\lim a_n = 0$.  Create a new series $b_n$ using all the terms of $c_n$ and $a_n$ (in whatever order you wish).  Then $(\mathbb{N}, a_n)$ and $(\mathbb{N}, b_n)$ are homeomorphic.  The idea is that since $\lim a_n = 0$, there is a convergent infinite subseries $\sum_A a_n$.  Then we use a bijection which with $A$ and $A\cup \{\text{indices of }c_n\}$ to "squeeze" the $c_n$ in without changing the topology.  Of course, I am glossing over many details, but I can include them if desired.


i want to install ubuntu 20.10 (1º option) and windows 10 (2º option) in my machine. I have UEFI and i read somewhere thath i dont need more to create swap etc partitions, that linux made that alone. Anyone can give me a sugestion or some link with a good tutorial. Thanks. Best Regards!

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


In Professor Leonard's lectures:    ... we are starting to integrate.  He keeps using 'dx', our old friend from 'dy/dx' back in differentiation.  What is 'dx'?  If 'dy/dx' is a ratio, which it sure seems to be, then 'dx' = one:  f(x) = x^2 f'(x) = dy/dx = 2x = 2x/1 (obviously).   So 'dy' = 2x and 'dx' = 1.     Solving this:  (integral) x^2(x^3-4)^5 dx   ... he is careful to hang on to 'dx' through the whole chain of calculations but is seems to me that 'dx' is always one and can be ignored, no?  I've read 'similar' threads here, that ended up as long fights about 'dy/dx' being or not being a ratio, so I'm clearly not the first person to wonder about what it is.  Maybe if I can get clear on what 'dx' by itself is, that will help.  He treats it as a variable holding a value on which one performs algebra but we never see it's value.  What is it's value?

When I was at school and learning integration in maths class at A Level my teacher wrote things like this on the board.  $$\int f(x)\, dx$$  When he came to explain the meaning of the $dx$, he told us "think of it as a full stop".  For whatever reason I did not raise my hand and question him about it.  But I have always shaken my head at such a poor explanation for putting a $dx$ at the end of integration equations such as these.  To this day I do not know the purpose of the $dx$.  Can someone explain this to me without resorting to grammatical metaphors?


I was using recuva to find pictures and videos on a windows xp hard drive, but I keep getting an internal error message. Does anyone know of an alternative program for recovering broken and damaged files?  I know that with ubuntu it's sometimes better and I had some more success recovering data from windows computers with ubuntu, I tried find but are there any GUI programs that someone would recommend?

Are there any tools, methods, incantations to recover recently deleted files on Ubuntu?  If it makes any difference, I want to recover a  2.x database file. But would be better to have a method/tool that works on any kind of file.


As I was reading and going through the second course of Andrew Ng's deep learning course, I came across a sentence that said,  With a well-turned mini-batch size, usually it outperforms either gradient descent or stochastic gradient descent (particularly when the training set is large).  But how is it possible? can mini-batch gradient descend really give us a better set of weights and biases even though it's not updating them based on the whole dataset? I can only think that it's maybe not overfitting and in that way, it can give better results.

I often read that in case of Deep Learning models the usual practice is to apply mini batches (generally a small one, 32/64) over several training epochs. I cannot really fathom the reason behind this.  Unless I'm mistaken, the batch size is the number of training instances let seen by the model during a training iteration; and epoch is a full turn when each of the training instances have been seen by the model. If so, I cannot see the advantage of iterate over an almost insignificant subset of the training instances several times in contrast with applying a "max batch" by expose all the available training instances in each turn to the model (assuming, of course, enough the memory). What is the advantage of this approach?


I have this:  #!/bin/bash  for file in `find . -type d` do   echo $file done   If I have just one directory called My Directory, the output is  My Directory   How do I fix this?  The echo $file is just temporary. There will be other code in there operating on the directories.

I wrote the following script to diff the outputs of two directores with all the same files in them as such:  #!/bin/bash  for file in `find . -name "*.csv"`   do      echo "file = $file";      diff $file /some/other/path/$file;      read char; done   I know there are other ways to achieve this.  Curiously though, this script fails when the files have spaces in them.  How can I deal with this?  Example output of find:  ./zQuery - abc - Do Not Prompt for Date.csv


I downloaded this add-on, but can't seem to find where to use it in any of the menus. I'm using version 2.81 of blender. Does anyone know where I can find it in version 2.81? Or does it even work in version 2.81?    It says its located in the Toolbar in the 3D view, but can't seem to find it there. I'll include a picture. Is this the correct toolbar? Or is there another one?

After installing the addons in the user preferences, they don't show up anywhere in blender 2.8 except from workspace addons tab in the properties and clicking it doesnt do anything. In user preferences next to the addons list, it also says that "Upgrade to 2.8x required". Does that mean that we can't use any addons in 2.8 unless they are upgraded for 2.8 builds?


I have a class Car:   public class Car{      final int uniqueId;      Car(int id)        {          uniqueId=id;        }  }   I have to store this as key in a HashMap. The max cars will be 1000. I have to decide the hashCode for this. What would be an efficient hashCode implementation for this? So the right number of buckets are formed.  The IDE generated:  @Override     public int hashCode() {         final int prime = 31;         int result = 1;         result = prime * result + ID;         return result;     }   But it will generate a unique hashcode for each value. So it does not seems right

How do we decide on the best implementation of hashCode() method for a collection (assuming that equals method has been overridden correctly) ?


I'm using windows currently but because of programming, aesthetics, financial and other reasons I have decided to move to Ubuntu.  Problem is my device is a laptop with Intel CPU and AMD R7 M360 GPU and I have read online (like ) that AMD graphics are a mess in Ubuntu 16.04.  I'm not very familiar with how Ubuntu work or what some of these technical words used in the link above, Until now I have just simply wrote C++ codes in Ubuntu or any Linux environment.  Should I avoid moving to Ubuntu or is there a solution to this driver issue?  Thanks.

Since I have an onboard Intel graphics card, and a ATI Radeon display controller, I was wondering if I could switch between the two as my graphics in use, as I could in 14.04 LTS through ATI Catalyst?  16.04 LTS is using the onboard, and the hardware listing lists ATI as well as display controler, but not in use. Additional drivers don't provide anything.   So is AMDGPU being used, or is ATI disabled?  lspci:  00:02.0 VGA compatible controller: Intel Corporation Broadwell-U Integrated Graphics (rev 09) 04:00.0 Display controller: Advanced Micro Devices, Inc. [AMD/ATI] Venus XTX [Radeon HD 8890M / R9 M275X/M375X] (rev ff)   lspci -nnk | grep VGA -A1  00:02.0 VGA compatible controller [0300]: Intel Corporation Broadwell-U Integrated Graphics [8086:1616] (rev 09)     Subsystem: Lenovo Broadwell-U Integrated Graphics [17aa:3824]


There are 10 differente figures (A,B,C,D,E,F,G,H,I,J), all equally probable to get.  We bought 25 pack which each contains only 1 figure  What is the porbability if we bought 25 packs we got all the differente figures, we found all the figures?  I figured that the total numbers of outcomes will be based on repetitive combination so (25-1+10 10) but i don't know how i should calculate the numbers of possible good outcomes

I'm trying to solve the well known Coupon Collector's Problem by explicitly finding the probability distribution (so far all the methods I read involve using some sort of trick). However, I'm not having much luck getting anywhere as combinatorics is not something I'm particularly good at.   The Coupon Collector's Problem is stated as:  There are $m$ different kinds of coupons to be collected from boxes. Assuming each type of coupon is equally likely to be found per box, what's the expected amount of boxes one has to buy to collect all types of coupons?  What I'm attempting:  Let $N$ be the random variable associated with the number of boxes one has to buy to find all coupons. Then $P(N=n)=\frac{|A_n|}{|\Omega _n|}$, where $A_n$ is the set of all outcomes such that all types of coupons are observed in $n$ buys, and $\Omega _n$ is the set of all the possible outcomes in $n$ buys. I think $|\Omega _n| = m^n$, but I'm not even sure about that anymore, as all my attempts so far led to garbage probabilities that either diverged or didn't sum up to 1.


To continue on from  question, do weapons and armor also get shared between settlements, in their raw state? Or are they only usable as scrap when making mods? I have a supply line running between two settlements, but I don't seem to be able to get the weapons or armor between them. Could there be a delay?

Supply routes are great when a settlement is just starting out to get things off the ground, but what is specifically transferred along them? I know anything on the  Junk, Aid and Mods tabs are transferred, and Fusion cores and Power Armor pieces aren't. Does that mean weapons, armor and ammo aren't transferred at all?  And what about Food and Water resources? Can I build a farming community with a surplus of food and use that to feed a merchant-only settlement, or are local crops always required? Ditto water.


I have to show that for any $b >1$, we have  $$ b^n > n$$ for all $n$ sufficiently large, using only very basic analysis (no calculus). My attempt is as follows.    We know that $b^{n+1} - b^n = b^n(b-1)$. For $n$ sufficiently large, say $$n \geq N = \left\lceil \frac{\ln(2/(b-1))}{\ln b} \right\rceil + 1,$$ we have  $$ b^{n+1} - b^n > 2.$$  Now let $\Delta = N - b^N$. Then for any $j\geq 1$, we have  $$ b^{N+j} = (b^{N+j} - b^{N+j-1}) + \ldots + (b^{N+1} - b^N) + b^N > 2j + b^N = 2j + N - \Delta = N+j + (j - \Delta).$$ Thus we have $b^n > n$ for any $n \geq N + |\Delta|$.    This works, but it  seems messy. Is there is better way? I know induction is usual for this type of problem, but establishing the base case for generic $b$ seems difficult.

Prove for any $a>1$ there exist a natural number, $N$, such that $a^n>n$ for all $n \ge N$  My attempt:  By definition, for $N$ to be a natural number $1\le N \le ∞$ for any integer $N$.  By induction, the base case $n=1$ is true because $a^1>1$ which is true.  Now assume that $a^k>k$ is true, then it is also true for $n= k+1$.  Hypothesis  $a^{k+1}>k+1$  Now I am not sure if I am on the right track


I recently bought a new laptop computer and have been unable to install Ubuntu alongside the Windows 8 operating system. I used to be able to install Ubuntu alongside a Windows OS but with Windows 8 that's no longer possible or too difficult for me to master. I don't really need Windows so I just want to wipe the disk and do a clean install of Ubuntu. What I want to know is if this is easy - as it used to be - or is it just as complicated as installing Ubuntu alongside Windows 8. Thanks for your replies.

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


I run the following regressions:  Y_1 ~ c_1 + b_1*X Y_2 ~ c_2 + b_2*X   and I get two estimates for b_1 and b_2. What is the appropiate statistic to test if b_1 <= b_2 and is there a function for that in R?

This seems to be a basic issue, but I just realized that I actually don't know how to test equality of coefficients from two different regressions. Can anyone shed some light on this?   More formally, suppose I ran the following two regressions:  $$ y_1 = X_1\beta_1 + \epsilon_1 $$ and  $$ y_2 = X_2\beta_2 + \epsilon_2 $$ where $X_i$ refers to the design matrix of regression $i$, and $\beta_i$ to the vector of coefficients in regression $i$. Note that $X_1$ and $X_2$ are potentially very different, with different dimensions etc. I am interested in for instance whether or not $\hat\beta_{11} \neq \hat\beta_{21}$.   If these came from the same regression, this would be trivial. But since they come from different ones, I am not quite sure how to do it. Does anyone have an idea or can give me some pointers?   My problem in detail: My first intuition was to look at the confidence intervals, and if they overlap, then I would say they are essentially the same. This procedure does not come with the correct size of the test, though (i.e. each individual confidence interval has $\alpha=0.05$, say, but looking at them jointly will not have the same probability). My "second" intuition was to conduct a normal t-test. That is, take   $$ \frac{\beta_{11}-\beta_{21}}{sd(\beta_{11})} $$  where $\beta_{21}$ is taken as the value of my null hypothesis. This does not take into account the estimation uncertainty of $\beta_{21}$, though, and the answer may depend on the order of the regressions (which one I call 1 and 2).   My third idea was to do it as in a standard test for equality of two coefficients from the same regression, that is take  $$ \frac{\beta_{11}-\beta_{21}}{sd(\beta_{11}-\beta_{21})} $$   The complication arises due to the fact that both come from different regressions. Note that   $$ Var(\beta_{11}-\beta_{21}) = Var(\beta_{11}) + Var(\beta_{21}) -2 Cov(\beta_{11},\beta_{21}) $$ but since they are from different regressions, how would I get $Cov(\beta_{11},\beta_{21})$?  This led me to ask this question here. This must be a standard procedure / standard test, but I cound not find anything that was sufficiently similar to this problem. So, if anyone can point me to the correct procedure, I would be very grateful!


There may not be a good answer to this; it is perhaps more or less a matter of coincidence. But the thing is: For any ring, the characteristic of the ring is the order of the element $1$ in the ring --- except if this order is $\infty$, in which case the characteristic is zero. So wouldn't it be more natural to call it characteristic $\infty$? Is there some smart reason behind this that I just haven't noticed yet, or is it just because mathematicians are weird?

The  (with unity, say) is the smallest positive number $n$ such that $$\underbrace{1 + 1 + \cdots + 1}_{n \text{ times}} = 0,$$ provided such an $n$ exists. Otherwise, we define it to be $0$.   But why characteristic zero? Why do we not define it to be $\infty$ instead? Under this alternative definition, the characteristic of a ring is simply the “order” of the additive cyclic group generated by the unit element $1$.   My feeling is that there is a precise and convincing explanation for the common convention, but none comes to mind.  I couldn't find the answer in the Wikipedia article either.


I have exchange 2010 installed on a 2008 R2 Domain controller. Will it create problems for exchange if I depromote the dc back to a normal domain member?  I am guessing it probably will which is why it is not a best practise to have your servers configured in this way.

Initially when setting up Exchange 2010 CAS I ran into problems with permissions. I got around them by promoting the server to be a DC with a GC.  The Server was initially installed with 2008 R2 Standard ED. I need to do an in-place upgrade to ENTERPRISE which requires me to demote the DC on this server first (AKAIK).  This is a production server.  My question is: How best to achieve this?  If you can only offer some advice for possible problems I would greatly appreciate that too.


I have an SQL query as below : update tableShared SET shareWith = case when shareWith like 'alex@gmail.com,%'   then replace(shareWith,'alex@gmail.com,','') when shareWith like '%,alex@gmail.com,%' then replace(shareWith,',alex@gmail.com,',',') when shareWith like '%,alex@gmail.com'   then replace(shareWith,',alex@gmail.com','') when shareWith = 'alex@gmail.com' then '' else shareWith end where createdBy = 'marc@gmail.com' AND reportName = 'sales Report 2020'  I want to use this query dynamically in PHP PDO prepared statements. Here is my code :     $stmt = $conn->prepare("update tableShared         SET shareWith = case           when shareWith like '?,%'   then replace(shareWith,'?,','')           when shareWith like '%,?,%' then replace(shareWith,',?,',',')           when shareWith like '%,?'   then replace(shareWith,',?','')           when shareWith = '?' then ''           else shareWith           end        where createdBy = ? AND reportName = ?");      $stmt->execute([ $_POST['username'], $_POST['username'], $_POST['username'], $_POST['username'],        $_POST['username'], $_POST['username'], $_POST['username'], $_POST['createdBy'], $_POST['reportName'] ]);  I believe my code is not working because the parameters ?  aren't recognized between the quotes when I execute the query. my first solution was this way but wasn't working as well although it seems more correct to me. $stmt = $conn->prepare("update tableShared SET shareWith = case     when shareWith like ?   then replace(shareWith,?,'')     when shareWith like ? then replace(shareWith,?,',')     when shareWith like ?   then replace(shareWith,?,'')     when shareWith = ? then ''     else shareWith     end   where createdBy = ? AND reportName = ?");   $stmt->execute([ $_POST['username'] .',%',          $_POST['username'] .',',          '%,'. $_POST['username'] .',%',          ','. $_POST['username'] .',' ,          '%,'. $_POST['username'],          ','. $_POST['username'],          $_POST['username'],          $_POST['createdBy'],          $_POST['reportName'] ]);  Any suggestions please how can I use PDO prepared statements inside multiple SQL LIKE operator if this is possible ? Thank you very much.

Here's my attempt at it:  $query = $database->prepare('SELECT * FROM table WHERE column LIKE "?%"');  $query->execute(array('value'));  while ($results = $query->fetch())  {     echo $results['column']; }


I'm working on animated text shown over a video. Textes are shown on three different moments, over a white background. To get my stuff organized, I created three scenes, and set my text on each one of them. First scene worked really nicely, I had no trouble at all, and could easily render the video with text on it. In second scene, Text was shown on screen as expected, until I animated it. After setting a simple 4 keyframes "get in screen - stand there a couple of seconds - get out of screen" animation, text just dissapeared fron render. When deleting the first keyframes (the ones that set text origin location), I got it to be shown on render, but it just kept on there and didn't get out of screen when it should. That's what you should see on the .blend file I upload, action keyframed on frames 1560 to 1581 is not rendered.    This is a screenshot where you can see the difference between what is shown on 3d editor and what is shown on VSE previsualization. Render acts as shown on VSE previsualization.    EDIT - My problem is not about having the scene overrid by a strip from VSE. The scenes are set on VSE over video strips, and can be seen correctly over video on render. My problem is about not knowing how to handle animation timing with various scenes on the project. I set markers on VSE and then used them as a guide to keyframe animations. This works well for my first scene, but my second scene seems not to match with timeline, I just don't know how to properly sync the scenes on the project.

Blender is rendering an older version of my project, not the most recent one. I have made it using the Blender Render but it does not want to render in cycles either. A black and grey screen is rendered as if everything is transparent. Checked general camera, lighting and compute devises in case I messed something up but I can't find anything. All my textures and objects look normal, does anybody know what is wrong or what to check?  Ok added link:


Every time I hold button 1 to break a block it sends me to the menu screen.  I can't figure it out so its impossible to play classic.  I've tried re installing Java 7 but that didn't change a thing, and changing game quality didn't do anything either.  I want to play minecraft but can't unless this is fixed.

I've already tried clicking and holding the left button of my mouse, and it just won't work! Whenever I press it, it opens the game menu instead.


What can we say about $\displaystyle \sum_{k=1}^{\infty}\frac{(-1)^k\log (2k+1)}{2k+1}$? Clearly it takes a value of negative real number, and seems to be an analogy of $\displaystyle \sum_{k=0}^{\infty}\frac{(-1)^k}{2k+1}=\frac{\pi}{4}$, but I don't know the way of evaluating $\displaystyle \sum_{k=1}^{\infty}\frac{(-1)^k\log (2k+1)}{2k+1}$.

In my integration adventures, I came across this sum which I could not simplify:  $$\sum_{n=1}^{\infty}\frac{(-1)^{n}\log(2n+1)}{2n+1}$$   seems to believe the sum diverges and is not of much help here.  Does a closed form for this sum exist?  If not, can this sum be transformed nicely that has faster convergence?


I create one webpage with create page html.   I have created event as 早上好 in chinese. But it is showing the event  as æ©ä¸å¥½.   What would be the problem here.and tell how to resolve this. please explain me.   I am already adding this code in my html file,  <head>     <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /> </head>   But it cannot show as the event name like as I have entered.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


Are there any recommendations about writing constants on the left of comparison  in  to avoid bug if assignment will be mistyped. Is it a good practice ? or this will reduce code readability and not recommended to do that, as there is a  in case if assignment within conditional expression will be written.  const int maxValue = 15;   1)  if (currentValue == maxValue) {     // do something  }   (  if  operator equal to == will mistyped to assignment operator =, currentValue = maxValue the if will be always true as anything that isn’t zero is “true”  Or better to write   2)  if (maxValue == currentValue) {    // do something  }

Okay, we know that the following two lines are equivalent -    (0 == i) (i == 0)   Also, the first method was encouraged in the past because that would have allowed the compiler to give an error message if you accidentally used '=' instead of '=='.  My question is - in today's generation of pretty slick IDE's and intelligent compilers, do you still recommend the first method?    In particular, this question popped into my mind when I saw the following code -   if(DialogResult.OK == MessageBox.Show("Message")) ...    In my opinion, I would never recommend the above. Any second opinions?


Let $f$ be an entire function. Suppose that $f$ satisfies   $$ |f(x+iy)|\leq\frac{1}{|y|}. $$   for all $x,y\in\mathbb{R}$. Prove that $f$ is identically zero.   I'm having some trouble with this, but I'm probably just overthinking it. The first instinct as usual is to try and make something happen with Liouville's theorem (and then since $f$ tends to zero on the imaginary axis we can conclude that $f\equiv 0$), but since $f$ is potentially unbounded on the real axis it's inapplicable. I'm pretty sure it's still impossible for $|f|\to\infty$ as $x\to\pm\infty$ while the function is bounded everywhere else, as it seems there would be some topological obstruction, but I could be wrong. I've also thought of getting an estimate on the $|f'|$ as in the proof of Liouville's theorem, but it fails for the same reasons. Any hints or tips are greatly appreciated. Thank you

Let $f(z)$ be an entire function such that $$|f(z)|<\frac{1}{|\text{Im}(z)|},\qquad z\in\Bbb C-\Bbb R.$$ The question asked me to prove that $f(z)=0$. At least looking at it, it really seems to have an application of Liouville's theorem lurking around somewhere, but I haven't found it.   My thoughts first led me to think about doing this by contradiction and using Picard's little theorem. So, I've considered a strip containing the real axis (say of width $2$ for simplicity). This will imply the complement maps into the unit disk, which implies that this strip has to map almost everywhere else on the complex plane. Now, on the imaginary axis, I know that $f(z)$ will vanish as $z\to\infty$, and this seems like it might be useful. I'm sort of under the impression $f(z)$ might have an essential singularity at $\infty$, which would mean $f(1/z)$ has an essential singularity at $0$. Either way, it of course can't have a pole at $\infty$ because of $f(z)$ vanishing on the imaginary axis, and if it is a removable singularity, it must be $0$, which still gives the solution. Therefore, I think it must have something to do with $f(z)$ having an essential singularity at $\infty$.   I was hoping to combine this with the above inequality and deduce a contradiction, but I haven't thought of one yet.   Any hints or suggestions? I'm studying for a prelim. exam, so this isn't homework.  Update: So, in the spirit of searching methods using the essential singularity at $z=0$, we have $$\left|f\left(\frac{1}{z}\right)\right|\leq\frac{1}{\left|\text{Im}\left(\frac{1}{z}\right)\right|}=\frac{|z|^2}{|y|}.$$ Thus, for $|y|>1$, we have $$\left|f\left(\frac{1}{z}\right)\right|<|y|\left|f\left(\frac{1}{z}\right)\right|<|z|^2.$$ Thus, if I can show that $|f(1/z)|$ is a polynomial, we'll know it can't have an essential singularity at the origin, concluding my proof.


I just installed Ubuntu 14.10 from the .iso.  It worked fine the first time, but the second time I booted it up, the resolution was really messed up.  The monitor was displaying everything really squashed as if it was a square screen. (It's not)  I looked at the "displays" settings and everything looked okay, but no matter what I tried from the forums and Youtube, it stayed flatter than it should.  Does anyone know how to fix this?

Here's the scoop: I have a crappy VisionQuest TV that I am currently using as a monitor on my computer running XBMCbuntu. It defaults to 1280x768 which the TV will not display correctly. It appears to be the correct size, but the screen is panned WAY to the left. The TV works fine on 1024x768 with the screen sitting in the right spot. Problem is, I have to change the resolution to 1024x768 every  time I boot up.   Any ideas?


I have a geoserver installed on a server and I want to move the geoserver to another server. What is the easiest way to do that?

I have GeoServer (v2.2 from OpenGeo Suite) running on a test server hosting many different WMS services sourcing many different PostGIS db tables.  I want to push this setup onto a production server now but I'm not sure what the best method would be for migrating this info without recreating all the Workspaces, Stores, and WMS layers again.  Both servers are the same:  Windows Server 2008 R2 Standard  My thoughts so far are:   Stop GeoServer on test Make backup of all dbs in PGAdmin on test Restore backup(s) to production db Copy data directory from test and paste it to same location on production Start GeoServer on production   Thoughts?


In my page content, I have the following:
✔ Fully qualified and insured technicians, with over a decade of experience
  On the frontend, WordPress changes the ✔ to:   I can't change the colour of this SVG image, it is black, and we need it white. How do I prevent the conversion of emojis to SVG? EDIT I've found  which says to use: add_filter( 'emoji_svg_url', '__return_false' );  All that does is break the image but display the alt text in the correct format:  The same code remains:

So WP 4.2 introduced emojis (smileys) that basically adds JS and other junk all over your pages. Something some people may find shocking. How does one completely erase all instances of this?


When making a little animation thing, I ran into a problem, the camera could not see the entire skybox. (a large cube with textures on it) As in the camera would not render the entire box. Here is a picture:   Can anybody help me? Essentially I want the camera to be able to see further.

I have created a simple model here   When rendering it the end of it is cut off   How can I get the camera to render a longer distance?


Although the title should summarize the content of a question, sometimes it is hard to synthesize the whole question in just a sentence.   It would be very interesting if there is any standard way to provide it. Taking into account accessibility principles, questions in Stack Exchange should be written in an easy and plain English, understandable for everyone, avoiding the using of jargon terms like TL;DR.  So my question is: Using , what is the best way to format and remark a summary to a question?  Maybe the next approach could be correct?     Using , what is the best way to format and remark a summary to a very large question?

TL;DR Should users with short attention spans be catered to? Ooh, is that a squirrel? The Question Should users be encouraged to begin their question with a TL;DR summary, rather than end with it? Explanation If the question is sufficiently complex to warrant a summary, I'd think that it should be placed at the top of the question so it could be seen in the preview. I'm wondering if that's a change I should start making when editing posts.


I am unable to install apache. I get these errors when I try to install it.

Err http://archive.canonical.com natty InRelease     Err http://security.ubuntu.com oneiric-security InRelease                Err http://extras.ubuntu.com natty InRelease                             Err http://security.ubuntu.com oneiric-security Release.gpg   Temporary failure resolving ‘security.ubuntu.com’ Err http://archive.canonical.com natty Release.gpg   Temporary failure resolving ‘archive.canonical.com’ Err http://extras.ubuntu.com natty Release.gpg   Temporary failure resolving ‘extras.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric InRelease Err http://gb.archive.ubuntu.com oneiric-updates InRelease Err http://gb.archive.ubuntu.com natty-backports InRelease Err http://gb.archive.ubuntu.com oneiric Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric-updates Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com natty-backports Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’  Reading package lists... Done W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/InRelease       W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/InRelease   W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/InRelease   W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘archive.canonical.com’ W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/Release.gpg  Temporary failure resolving ‘security.ubuntu.com’ W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘extras.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Some index files failed to download. They have been ignored, or old ones used instead.   This is what I'm seeing when I try to run sudo apt-get update. I did an update on my instance yesterday and am now experiencing this.


I'm reading a text - Roger Koenker (2005) Quantile Regression [page 8] - that goes like this:  Consider the function $$R(\xi) = \sum_{i=1}^n \rho_\tau(y_i-\xi)$$ where $$\rho_\tau(y_i-\xi) =(y_i-\xi)(\tau - I[y_i-\xi<0])$$ If $\hat \xi$ solves $\min_\xi R(\xi)$ then the objective function must be increasing as  one moves away from $\hat \xi$. This requires that the left and right derivatives are both non-negative at $\hat \xi$. Thus   $$R'(\xi+) := \lim_{h \rightarrow 0} \frac{R(\xi + h) - R(\xi)}{h} = \sum_i( I[y_i-\xi<0]- \tau ) $$  with $R'(\hat \xi+) \geq 0$ and   $$R'(\xi-) :=  \lim_{h \rightarrow 0} \frac{R(\xi - h) - R(\xi)}{h} = \sum_i (\tau - I[y_i-\xi<0] ) $$  with $R'(\hat \xi- )\geq 0$.  My question is: Shouldn't $R'(\xi+) =  \sum_i( I[y_i-\xi\leq 0]- \tau )$ with a weak inequality in the indicator function rather than the strict?  Because for $y_i - \xi = 0$ the limit  $$ \lim_{h \rightarrow 0^+} \frac{(y_i-\xi-h)(\tau - I[y_i-\xi-h<0]) - (y_i-\xi)(\tau - I[y_i-\xi<0])}{h} =  \\[8pt] \lim_{h \rightarrow 0^+} \frac{-h(\tau - I[-h<0]) }{h} = -(\tau - \lim_{h \rightarrow 0^+}  I[-h < 0]) = 1-\tau$$ so the i'th summand in $R'(\xi+)$ should be $I[y_i-\xi\leq 0] - \tau$.

The question comes from the paper ``Regression Quantiles'' by Roger Koenker and Gilbert Bassett(Econometrica, 1978).   $0< \theta <1$. Define $\psi(b;\theta,y,X)=\sum^{T}_{t=1}[\theta-1/2+1/2 \; \text{sgn}(y_{t}-x_{t}b)][y_{t}-x_{t}b]$, where sgn(u) takes values $1,0,-1$ as $u \gtreqless 0$.  Here, $y_{t}$ is a scalar and $x_{t}$ is a $K \times 1$ vector.  Then \textbf{my question} is: what is the directional derivative of $\psi(b)$ in the direction $w$?  The paper states that the answer is  \begin{equation} \psi^{\prime}(b;w)=\sum^{T}_{t=1}[1/2-1/2 \; \text{sgn}^{\ast}(y_{t}-x_{t}b;-x_{t}w)-\theta]x_{t}w, \end{equation}  where   $\text{sgn}^{\ast}(u;z)=  \begin{cases} \text{sgn} \; u \; \text{if} \; u \neq 0,\\ \text{sgn} \; z \; \text{if} \; u = 0 \end{cases}$  But I do not know how to derive this result.


One day my company is going to need a server, and I like Ubuntu since it has the least amount of viruses out of all the OSes (I think), but when I look at the Ubuntu Server it only has black background and white text, which is command line. Is that all to Ubuntu Server? Or is it like Ubuntu Desktop, and a modules for command line? I don't really want it to just be the command line.  I'm new to the Ubuntu OS stuff. Even now I still use windows.

Trying to run a Ubuntu server for the first time... But everything is in a terminal. Is there a way to switch to a GUI?


I am required to show that: $\det(qA) = q^n(\det A)$, where $A$ is a real $n\times n$ Matrix, and $q$ is a constant   I believe that this claim is true after doing few examples. However, but I do not know how to start the proof.

Let $A$ be an $n \times n$ matrix and $k$ be a scalar. Prove that $\det(kA)=k^n\det A$.   I really don't know where to start. Can someone give me a hint for this proof?


What's the difference between the following:         By the age of 45, most men had died.     By the age of 45, most men had been dead.      I was told the second is wrong but I don't know why.

I gave him the money by 6 PM.   I had given him the money by 6 PM.   I can't spot the difference between them and both seem right, but I was told the first one is wrong. Can anyone say, why?  Here is a another set of sentences with the same issue:     By 5 PM I gave him the book.   By 5 PM I had given him the book.   In both the sentences the book was given before 5 PM and no later than 5 PM. But I can't understand then what the difference between them is.   Is it right to use simple past with 'by' at all? If yes, then why and if not, then why is it incorrect to use simple past with 'by'?


Multiple Regression -  Found a Significant model but one variable does not significantly predict the behaviour, how to explain this ? Also attaching correlation table.

In a multiple linear regression, why is it possible to have a highly significant F statistic (p<.001) but have very high p-values on all the regressor's t tests?  In my model, there are 10 regressors. One has a p-value of 0.1 and the rest are above 0.9    For dealing with this problem see the .


I am using macOS high Sierra. By mistake I converted my admin account to standard user account. Now by entering into the single user mode and trying to mount the disk,it shows message that "devise is write locked "  and "IO failed , error = 13" and trying to remove the apple set up done file the error message is "no such file found."  Please guide how to resolve this situation.

On my mac I have 2 accounts and the both are normal account. So in this moment I don't have a Administrator account, only one that was in the past a administrator, but now is not.  How I can have again a Administrator account?


\newcommand*{\name}[1][C]{%   I have come very familiar with \newcommand however, I came across this line of code and i do not know what the [C] is for.

I'm trying to work through LaTeX Beginner's Guide by Stefan Kottwitz. Here's where I got stumped:  \documentclass{article} \newcommand{\keyword}[2][\bfseries]{{#1#2}} \begin{document} \keyword{Grouping} by curly braces limits the \keyword{scope} of \keyword[\itshape]{declarations}. \end{document}   The output adds boldface to "Groupings" and "scope," while "declarations" is italicized. I do not understand this syntax. I vaguely get that \bfseries is the "default" and \itshape got specifically subbed in for "declarations" but I cannot follow Kottwitz's explanation:     Let's look again at the bold marked line in the code. By using [\bfseries], we introduced an optional parameter. We refer to it with #1. Its default value is \bfseries. Since we used a declaration this time, we added a pair of braces to ensure that only the keyword is   affected by the declaration. Later in the document, we gave [\itshape]   to \keyword, changing the default formatting to italics.   Can I get a second opinion/explanation of what is going on here?


I have recently updates my 5 yrs old HP dv5 AMD laptop to Ubuntu 14.04, all good so far just that I am not able to grasp the right process to install drivers for the ATI Radeon card provided in this laptop.  Though I am happy with the current graphics on the monitor just that I am not able to change the resolution setting, default I am getting below options:  "1280 x 800" and below, nothing over it.  I am new to Ubuntu/Linux so how should I install the correct drivers to allow me to get the correct resolution?

I am planning on doing a fresh install of Ubuntu and want to know what is the correct way to install ATI Catalyst Video Driver?      There are multiple valid answers for this question spanning over several versions of Ubuntu. For your convenience an index of each below:


I cannot expand this variable in sed. I've tried everything I can think of.  I am trying to put the md5sum of file1 in line 10 of file2  I can take $x out of the regex and put some text and it works. It just will not accept the variable. printf the variable is fine.  #!/bin/bash  x=$(md5sum /etc/file1)  printf "$x \n"  sed -i 10"s/.*/$x/g" /usr/bin/file2

In my bash script I have an external (received from user) string, which I should use in sed pattern.  REPLACE="<funny characters here>" sed "s/KEYWORD/$REPLACE/g"   How can I escape the $REPLACE string so it would be safely accepted by sed as a literal replacement?  NOTE: The KEYWORD is a dumb substring with no matches etc. It is not supplied by user.


Why is the sum of outer products equal to the matrix product of a matrix and its transpose? So $A^TA = \sum_{i=1}^n a_i a_i^T$, where $A = [ a_0, a_1 , ... , a_n ] $, $a_i \in \mathbb{R}^k$. An answer or a link to the answer would be greatly appriciated. It seems so simple but I just cannot figure it out.  It is essentially this question of which I do not understand the answer:

I have recently read in a script about statistical methods in a chapter about linear regression that:  Given an $n \times k$-matrix $A$, we have $$A^T A = \sum_{i=1}^{n} a_i^T a_i$$ where $a_i$ denotes the $i$-th row of $A$.  Unfortunately, the author doesn't give a proof of that and I can't figure out one myself. Maybe someone can help me. source:  on page 10


Prove: $(A')^{-1}=\left(A^{-1}\right)'$.  $$\begin{align*}\left(A^{-1}\right)'=\left(\frac{1}{\det (A)}A^*\right)'=\frac{1}{\det (A)}\left(A^*\right)'=\frac{1}{\det (A)}(A')^*=(A')^{-1}\end{align*}$$  Is it right?（This is the question...）Duplicate?    $A'$ is the transpose of A.  $A^*$ is the adjugate matrix

I can't seem to find the answer to this using Google.   Is the transpose of the inverse of a square matrix the same as the inverse of the transpose of that same matrix?


I don't understand these terms. They both have "likelihood". How are they different? Can someone provide an intuitive explanation of them?

I see these terms being used and I keep getting them mixed up. Is there a simple explanation of the differences between them?


I am trying to recreate the Maple UI in a LaTeX document. Therefore I need certain text in my document to be in Times New Roman and I want the rest of the text in my document to remain as the default font. Any ideas as to how to do this?

The standard font packages make global changes to the fonts in my document. What if I want to use a particular font for just a portion of my text?   How do I find the right name of the font? How do I select the font? How do I restrict the scope of the font change?     There are separate answers for different flavors of TeX (quick links):


Umm... this was closed as a duplicate to , but, A. That question never got any answers and B. In my particular case, it is showing physical fitness as my account when it is not. It would be helpful if the closers commented with reasoning to help explain why this question was closed. On my reputation graph, the graph is tracking physical fitness SE, even though I don't have an account there. It is not tracking any of my actual sites with 200+ reputation.

Today I noticed that when I look at the reputation graph on my profile, I don't even belong to most of the sites it is showing. My highest reputation sites are not shown at all. This is me:  This is not me:


With Screenspace reflections on I want to keep my edge fading at 0.075, but prevent it from fading the edges of the screen when zoomed in on a reflective surface.  So currently I get this really nasty effect on my window material (top left) when it's not fully in frame:    Is there a way to render the borders just outside the camera's vision, and then crop that to my actual desired output resolution to get around this? Is this possible with render borders?  So although I want a 1920x1080 image, I want to render, say, 2120x1280 (an extra 100px around the borders) and then have blender crop it back to what it should be and save this as the render output.  Edit: This is not a duplicate of the referred to question. The problem has nothing to do with faces not facing the camera and not being reflected. There's almost no reflection in the glass but this is intentional. I just wanted to show the black edge effect in a previously rendered frame.

I started to work with EEVEE short time ago and I was amazed by the capabilities of this engine. However, I noticed something strange when I was rendering some tests. Some objects/reflections/shadows dissapear when they're off canvas. I imagine that maybe this is for save memory data, but it can be not suitable to some projects. To make my point graphical, I made a simple scene with simple objects. The main object is the sphere with a mirror-like shader. Out of focus there are different objects with different shaders. A yellow cone, a blue cylinder and a white cube light. But surprisingly, those objects dissapear when the composition is rendered. See the rendered animation below:  Notice that the blue cylinder is not even showing at all in the final render. And the blooming effect from the light cube also dies. I would like to improve this bahaviour and render the objects that are still out of canvas using EEVEE. Do I missing something like memory configuration or reflection/shadow tweaks? Is this caused by the EEVEE engine or by my GPU config (GTX1060)? Thank you in advance!


I am creating a React/Laravel web application that will allow the user to search and navigate through celebrities based on their 'categories'. I have set up a Categories table using MySQL like so:  *CATEGORIES_TABLE* id      name                   parent_category_ids     children_category_ids 1       Music                  0                       23,24,25,26,27,28,29,30,31... 2       Sport                  0                       45,46,47,48,49,50,51...  ... continued ...  23      Pop Music               1                       120,121..  ... continued ...  45      Soccer                  2                       180,181...  ... continued ...  180     Club Teams              45,2...                  250,251,252... 181     International Teams     45,2...                  301,302,303...  ... continued ...  250     Real Madrid FC          180,45,2                 1045,1046,1047,1048,1049,1050... 251     Barcelona FC            180,45,2                 1080,1082,1083,1084,1085,1086..     *CELEBRITIES_TABLE* id      name                   category_ids 1       Justin Bieber          1,17,18... 2       Christiano Ronaldo     2,24,32,34...   As you can see, categories can have multiple parents and multiple children, and celebrities can have multiple categories.  My issue is that I'm not that experienced in Database Design so I'm not sure if this will work. I am worried that this setup will be hard to maintain and it won't be efficient at inserting/deleting new categories and celebrities etc.  Any thoughts on this would be much appreciated, I don't want to get stuck into it for it to not work, thank you!

Our team is developing a new system and it has a Warehouse table that must have a hierarchical relationship between entries since a customer can have 1st, 2nd, 3rd and Nth degree warehouses.  We first thought that  was the best way to do it. By creating a Parent and a Child column on the table and then making Parent the FK to Child (on the same table) but friend DBA told us that there is a different way.  So, for instance, we had thought about making a table like this:  CREATE TABLE Warehouse( filterId INT PRIMARY KEY IDENTITY, parentId INT NOT NULL, active BOOL DEFAULT 1, warehouseName VARCHAR(30) NOT NULL, FOREIGN KEY parentId REFERENCES Warehouse(filterId)  | FILTERID   | PARENTID | ACTIVE | WAREHOUSENAME | -------------------------------------------------- |          1 |        0 |      1 | N WAREHOUSE 1 | |          2 |        1 |      1 | ROOM 1        | |          3 |        1 |      1 | ROOM 2        | |          4 |        1 |      1 | ROOM 3        | |          5 |        1 |      1 | ROOM 4        | |          6 |        2 |      1 | SHELF 1       | |          7 |        2 |      1 | SHELF 2       | |          8 |        2 |      1 | SHELF 3       | |          9 |        2 |      1 | SHELF 4       | |         10 |        2 |      1 | SHELF 5       | |         11 |        2 |      1 | SHELF 6       | |         12 |        2 |      0 | SHELF 7       | |         13 |        3 |      1 | BOX 1         | |         14 |        3 |      0 | BOX 2         | |         15 |        3 |      1 | BOX 3         | |         16 |        3 |      1 | BOX 4         | --------------------------------------------------   But this DBA said that we should work on something like this:  CREATE TABLE Warehouse( filterId VARCHAR(20) PRIMARY KEY, active BOOLEAN DEFAULT 1, warehouseName VARCHAR(30) NOT NULL)   | FILTERID   | ACTIVE | WAREHOUSENAME | --------------------------------------- | 1.00       |      1 | N WAREHOUSE 1 | | 1.01       |      1 | ROOM 1        | | 1.02       |      1 | ROOM 2        | | 1.03       |      1 | ROOM 3        | | 1.04       |      1 | ROOM 4        | | 1.01.01    |      1 | SHELF 1       | | 1.01.02    |      1 | SHELF 2       | | 1.01.03    |      1 | SHELF 3       | | 1.01.04    |      1 | SHELF 4       | | 1.01.05    |      1 | SHELF 5       | | 1.01.06    |      1 | SHELF 6       | | 1.01.07    |      0 | SHELF 7       | | 1.01.01.01 |      1 | BOX 1         | | 1.01.01.02 |      0 | BOX 2         | | 1.01.01.03 |      1 | BOX 3         | | 1.01.01.04 |      1 | BOX 4         | ---------------------------------------   Which way should we follow?   On one hand we have a relationship between parentId and filterId; on the other we do not have any relationship, but it is easy to understand where does the entry belong.  Not all the warehouses are of the same level - that's what I mean by degree. They should be ordered like: For Customer A, 1 is parent of 1.1 and 1.2, 2 is parent of 2.1, 3 is parent of 3.1 and 4 is parent of 4.1 and 4.2 - but 1, 2, 3 and 4 are of the same level (1st level), and 1.1, 1.2, 2.1, 3.1, 4.1 and 4.2 are also of the same level (2nd level) but not of the same parents.


Certain .NET classes must have some kind of attribute set on either the class or individual members to tell it to show those members' values by default while hovering the mouse over an object in debug mode.  Here's an example:    Out of all the members in Type, only Name and FullName are shown while the object is fully collapsed.  I'd like to do the same for some of my own classes so that I can have an entity's ID and Name members shown by default.  Is there a way I can do this?  Note:  My question pertains to VS 2013, but it would be nice to know how to do this for earlier versions like 2010 or earlier for those using older versions.  I am also using C# 4.0 just in case the method to achieve what I am doing differs between languages and .NET frameworks.

Say you have a custom class call it Foo. When you then have an instance of this class, during debugging, if you mouse over this object, you'll either see the fully qualified namespace name of the type, or if you override ToString in this class, you'll see that. Is there any way to customize what the tool tip will say?


When you made a group of objects, how to make array of them?  I know for shift+A to make group instance but I want to control it like array modifier.

Is it possible to array a group of objects?   For example, if I have three objects in a group, (I want to keep them as separate objects) is it possible to easily duplicate them as if I pressed AltD for every single one?


In the early 2000s I read a good sci-fi fantasy book about two binary planets that shared the same atmosphere at one point. The inhabitants used hot air balloons/gondolas to travel from one planet to the other. What was the book called? I've been searching on google for hours with no luck. However I can say its not the Flight of the Dragonfly/Rocheworld book series. Additionally, I suspect this book was used as inspiration for Lexx, season 3 "Fire and Water."

I read this book many years ago. It is set on a double planet with a shared atmosphere. The people on the planet have a caste system, they are either military or thinkers. There are giant trees on the planet, which are used for almost everything, building materials as well as an energy source from the crystals the trees form.  There are also poisonous bubbles that float around. The inhabitants were able to destroy them with ranged weapons, but the bubbles became more dangerous which forced the mass migration of the inhabitants to the adjoining planet via balloons made from and powered by the giant trees.  There is also a sequel where the main character from the first book travels through space to another planet in the system using a more advanced rocket based off the trees.


I need to resize my shirt design 4500x5400 but I can't. When I set the size 4500*5400 px in Illustrator and save as png it show beyond my size. I'm really worried please anyone is here to help me how to exact resize and will show  4500*5400 png after save the image?

As all Illustrator users know, there is a hard limit on the size you can export a PNG file. I'm curious if anyone knows the maximum limit on this, and if it differs depending on the DPI of the exported PNG file.  For my immediate needs I am interested in a 300 DPI export, but curious what the dimension limit is for 72, 150 if it's dependent on the DPI.


What if my first name doesn't exactly match my ID?

If the name on my boarding pass lists Debbie and my Drivers License lists Debra, will this be a problem?


Recently I switched from Fedora to Ubuntu. I like to work with half windows (for example a terminal on the left side and a chrome on the right). But I have a small issue, when I have chrome maximized and try to raise a terminal on the right side of my screen, it also brings a terminal that is on the left side.   For example: Open windows: 2 terminals(1 left, 1 right), Google Chrome  When switching from Google Chrome to left terminal,  Desired result:   Actual result:   Any idea how I can stop this?

I'm on Ubuntu 17.10 with GNOME 3.26.  Often I have windows tiled on the left and right side of the screen. A typical setup is to have a browser and text editor on the left, a PDF reader and terminal on the right.  Something I've seen happen very often: I'm reading the PDF on the right, having the window in focus. The text editor on the left. When I click on the text editor to write something, it brings forward another window on the right (say the file browser), covering the PDF reader.  This seems to have something to do with the Alt-Tab view history.  My question is: Is it possible to remove the automatic bring-to-front of windows? I don't understand why unrelated windows are brought to the front when I click on another application.


I've made an iPhone app where the user takes a picture. What would i need to put in my code so that when the user takes the photo it saves the photo to the users library?  Below is my code so far  import UIKit import AVFoundation  class ViewController: UIViewController, UIImagePickerControllerDelegate, UINavigationControllerDelegate {  var picker = UIImagePickerController()  @IBOutlet var camera: UIButton!    @IBAction func camera(sender: UIButton) {           if UIImagePickerController.availableCaptureModesForCameraDevice(.Rear) != nil {             picker = UIImagePickerController() //make a clean controller             picker.allowsEditing = false             picker.sourceType = UIImagePickerControllerSourceType.Camera             picker.cameraCaptureMode = .Photo             picker.showsCameraControls = true              //customView stuff             let customViewController = CustomOverlayViewController(                 nibName:"CustomOverlayViewController",                 bundle: nil             )               let customView:CustomOverlayView = customViewController.view as! CustomOverlayView             customView.frame = self.picker.view.frame              customView.cameraLabel.text = "Hello Cute Camera"               picker.modalPresentationStyle = .FullScreen             presentViewController(picker,animated: true,completion: {                     self.picker.cameraOverlayView = customView                 }             )             } else { //no camera found -- alert the user.             let alertVC = UIAlertController(                 title: "No Camera",                 message: "Sorry, this device has no camera",                 preferredStyle: .Alert)             let okAction = UIAlertAction(                 title: "OK",                 style:.Default,                 handler: nil)             alertVC.addAction(okAction)             presentViewController(                 alertVC,                 animated: true,                 completion: nil)         }       //MARK: Picker Delegates     func imagePickerController(         picker: UIImagePickerController,         didFinishPickingMediaWithInfo info: [String : AnyObject])     {         let chosenImage = info[UIImagePickerControllerOriginalImage] as! UIImage //2         UIImageWriteToSavedPhotosAlbum(chosenImage, self,nil, nil)     }     //What to do if the image picker cancels.     func imagePickerControllerDidCancel(picker: UIImagePickerController) {         dismissViewControllerAnimated(true,             completion: nil)     }         }       override func viewDidLoad() {     super.viewDidLoad()     // Do any additional setup after loading the view, typically from a nib. }  override func didReceiveMemoryWarning() {     super.didReceiveMemoryWarning()     // Dispose of any resources that can be recreated. }   }

What do I need to do to save an image my program has generated (possibly from the camera, possibly not) to the system photo library on the iPhone?


I am new to the Ubuntu. I have installed the ubuntu 12.04 from the usb drive. But it needs the usb drive every time to open and run.  Please suggest me a solution to overcome.

I had Ubuntu 12.04 Beta installed on my computer. When 12.04 was finally released, I made a bootable USB Flash Drive using Startup Disk Creator.  Then I decided to check if this drive works properly and to reinstall the system on my desktop. I must add, my desktop behaves a bit strange when it comes to bootable USB's, it recognizes them as HDD.  In BIOS I changed priority of boot so USB Flash Drive (recognized as HDD) was first. Successfully booted, I installed Ubuntu. Everything worked fine, but...  Now I cannot boot from my real HDD. Every time I want to boot, I put the USB Flash Drive into my computer, boot, safely remove it and everything works.  What do I need to do to repair boot?


I have heard the phrase a few years ago and now I can't remember it. It's a figurative phrase or expression used when someone has the skill of speaking fluently with a great lexicon, someone eloquent. It's not silver tongue. It goes more along the lines of someone that has the gift/touch of someone. The first and only time I heard the phrase was from a video of someone one (can't remember who it was) during an interview and they were acknowledging their way of well speaking because they had the insert phrase here. EDIT: I kept searching in Google using my keywords and 20 minutes after posting this I found it! It was the gift of gab.

Do you know any idioms meaning "you know how to convince me"?  Edit: the context is a humorous response to someone offers you something you can't resist


I have a list structured like so:  >>> print(pts) [[(120, 1200), (121, 1201), (122, 1202)],  [(130, 1300), (131, 1301), (132, 1302)]]   And I need all the x and y points concatenated seperately like so:  >>> print(y) [120 121 122 130 131 132] >>> print(x) [1200 1201 1202 1300 1301 1302   The original list is created by the following method:  pts = [] y = [120, 121, 122] x = [1200, 1201, 1202] pts.append(list(zip(y, x))) x = [1300, 1301, 1302] y = [130, 131, 132] pts.append(list(zip(y, x)))   The final result must be seperate y and x lists so I can use it with np.polyfit().  The length of both the individual points list and overal list will vary, however, I will always have equal length of y and x points.  I'm thinking there should be a way to reshape and slice?  Maybe I could flatten and take all  the even indices for x and odd indices for y?

I have a list of 2-item tuples and I'd like to convert them to 2 lists where the first contains the first item in each tuple and the second list holds the second item.  For example:  original = [('a', 1), ('b', 2), ('c', 3), ('d', 4)] # and I want to become... result = (['a', 'b', 'c', 'd'], [1, 2, 3, 4])   Is there a builtin function that does that?


I think I read this (probably in an anthology) around 1972. As I remember it -- this sentient submarine battleship is left over from a war and awakens when challenged. Is this Van Vogt?

Looking for the name of a short story. It was about an AI submarine that woke up one day and did battle with an invading spaceship that was hiding underwater in preparation to invade the earth. The battle ended with both sub and spaceship being destroyed. The close of the story was one man talking to the other about reactivating the subs that were designed to keep enemy subs away


Hope someone can spot what is going on here, I've spent hours looking and I think it is impossible.  I have 2 for loops and this passes the counters to a thread for more processing. when I use more than one thread or do not add a wait in the for loop the threads are passed the same counters.  my code   public static List<Thread> TPool = new List<Thread>(); for (int i = 1; i <= 10; i++) {   for (int m = 2; m <= 10; m++) {     waitingThreadPooling(new ThreadStart(() => run_test(i, m)), 3);     //wait(10);   } } private static void run_test(int the_i, int the_m) {   string Test = "i:" + the_i + ", m:" + the_m;   // more code   Console.WriteLine(Test); } public static void waitingThreadPooling(ThreadStart start, int MaxThreads = 50) {   Pool_Threads_Remove_Dead(ref TPool);   while (true)   {     if (TPool.Count < MaxThreads)     {       Thread _thread = new Thread(start);       _thread.Start();       TPool.Add(_thread);       break;     }     else     {        Pool_Threads_Remove_Dead(ref TPool);     }     Wait(10);   } }   this outputs  i:1, m:4  <<< i:1, m:4  <<< whats going on here??? i:1, m:3 i:1, m:5 i:1, m:6 i:1, m:8 i:1, m:7

I met an interesting issue about C#. I have code like below.  List<Func<int>> actions = new List<Func<int>>();  int variable = 0; while (variable < 5) {     actions.Add(() => variable * 2);     ++ variable; }  foreach (var act in actions) {     Console.WriteLine(act.Invoke()); }   I expect it to output 0, 2, 4, 6, 8. However, it actually outputs five 10s.  It seems that it is due to all actions referring to one captured variable. As a result, when they get invoked, they all have same output.  Is there a way to work round this limit to have each action instance have its own captured variable?


I am writing a shell script in abc.sh  echo $(date) openssl aes-256-cbc -a -salt -in abc.zip -out abc.zip.enc  echo $(date)   It is showing the time at both start and end of the process, but I want the exact amount of time taken to complete such process.

I'm trying to measure the execution time of a process that I call via the command line (i.e., I want to find out how long it takes to for the process to finish). Is there any command that I can add to the command calling the process that will achieve this?