WE are planning to shoot LARGE SIZE CARPETS ( 5m /10 m ) with High Quality Resolution for professional Usage , ( LARGE PRINTING , MUSEUM CONSERVATION..ect ) Please can you advise the best camera  , Lenses and Required Lighting. we want to build a studio to take high quality images of  CARPET / RUGS.  few people suggest me to use  " Gig Pan " ..  i need your valuable suggestions to choose the right equipment.  with best regards
I am trying to take pictures of large rugs. The rug size is about 10mx5m, and I'm  planning to purchase , and Canon 7D Mark II with Canon EF 50MM F/1.2L USM lens, since we need high quality images.  We want to set up a studio to take giga-pixel quality images of the large rugs for museum conservation purposes  Could you please suggest the best way for mounting the camera to the ceiling, and any other recommendations for my camera/lens setup, and required lighting? It will be  an indoor shoot. Just we want to setup a studio to shoot the large rugs.
SimpleXML: Selecting Elements Which Have A Certain Attribute Value Trichromelibrary was suddenly downloading from Google Play Store From nowhere, my friend got a notification that com.google.android.trichromelibrary was downloading together with a progress bar.  Why? Why are imported PDFs blurry in InDesign? Programmatically determining amount of parameters a function requires - Python Animagi (Sirus specifically) and wands? Bird flying in a cage Assume that you are holding a cage containing a bird.  Do you have to make less effort if the bird flies from its position in the cage and manages to stay in the middle without touching the walls of the cage? Does it make a difference whether the cage is completely closed or it has rods to let air pass? Will wolves attack and kill ocelots in Minecraft? I know they kill sheep. I just don't want my cats being eaten. I have come across the following few questions on past exams papers.. I know how to solve these type when it is of the form $a_nz^n$ but don't have a clue what to do with these. Any help would be greatly appreciated!  (i) $\displaystyle\sum_{n=0}^\infty \bigg(\dfrac{1}{2n}\bigg)z^{3n}$.  (ii) $\displaystyle\sum_{n=0}^\infty(2^n+i)(z-i)^n$.  (iii) Show that the radius of convergence of $\displaystyle\sum_{n=0}^\infty z^{n!}$ is $1$ and that there are infinitely many $z \in \mathbb{C}$ with $|z|=1$ for which the series diverges. Is it correct to say I electrocuted my friend if he was only injured by electricity? I have rigged up a notch filter from . See below: -     Its the first circuit. Now I am trying to calculate its transfer function. I have calculated two equations, but I need the third one:   (Vin-V2)/(1/SC1) = V2/R3 (Vin-V1)/R1 = (V1-Vo)/(R2+(1/SC2))   V1 and V2 are the potentials at the input of the op-Amp. In a  about formatting a double[][] to CSV format,  that using StringBuilder would be faster than String.Join. Is this true? Cannot add PPA: 'ppa:~darklin20/ubuntu/bomi'.     ERROR: '~darklin20' user or team does not exist.   Showing this message when suing this command:    sudo add-apt-repository ppa:darklin20/bomi   please help me. Does installing and using Wine open up your Linux platform to Windows viruses? Give the "some of your recent flags have been declined" banner some room The "some of your recent flags have been declined" message recently got a banner, which makes it stand out  more (which is nice) but it touches the 'Flag' button, which is less nice. Can it have some margin at the bottom (and perhaps less padding?)    Tested in the latest Safari and Firefox on macOS Catalina. Proving that this function is continuous on $G\times G$ Pipe sound output to file? Let $X$ be a normed vector space.   Show that if a subsequence of a Cauchy sequence converges, then the whole sequence converges. Use the part 1 to show that $S = \{x\in X : \|x\| = 1\}$ is complete if and only if $X$ is Banach.     I have found the first part in a book, but I do not how to prove part 2. Thanx regards Suppose $G$ is a non-abelian group and $H,K$ are two abelian subgroups of $G$. Then must $HK$ be an abelian subgroup of $G$?  I know an example, but I am confused. Thus I just want to check that. A riddle about guessing hat colours (which is not among the commonly known ones) This is a riddle I heard recently, and my question is if someone happens to know the solution. I'm asking this out of curiosity more than anything else.  So here it is. The riddle is one of the countless variations of the "prisoners have to guess their hat colour" puzzle. $n$ prisoners are put a hat on top of their head, which can be red or blue. The colours are chosen at random by $n$ independent fair coin tosses. Then each prisoner can guess their own hat colour (red or blue) or pass. The prisoners can see each other, but not hear each other's calls and of course they have no other means of communication. This means that each call can only depend on the other prisoners' hat colours. However, before the distributing of hats begins, the prisoners are told the rules and can agree on a strategy. The prisoners win iff no prisoner guesses wrong and at least one prisoner guesses right. Which strategy should the prisoners use so that the winning probability becomes maximal?  Some remarks:   A simple strategy is that one player just guesses and all other players pass, so that the maximal probabilty is at least 1/2. For $n=2$ this strategy is optimal. For $n=3$, there is a strategy that wins in 6 out of 8 cases: When a player sees (red,red) he guesses blue, for (blue,blue) he guesses red, and otherwise he passes. More generally this shows that the maximal probability is at least 3/4 for $n\ge 3$. It's possible to show that any strategy fails for at least 2 hat colour configurations (unless $n=1$), which shows that the above strategy is optimal for $n=3$. For $n=4$ there are more than $10^{15}$ strategies, and for $n=5$ it's about $10^{38}$ strategies, making it quite infeasible to just use a brute-force computer program (maybe for $n=4$ it's possible when exploiting the obvious symmetries). When changing the rules slightly by forbidding players to pass, then the maximal winning probability is always 1/2. This is a nice little exercise.   Actually I heard the riddle only for $n=3$ and then thought about the general $n$. So it's entirely possible that there is no nice solution. My hypothesis is that $\mathbb{R \times R}$,  the set of all pairs $(r_1, r_2)$, of real numbers is uncountable. I understand that the set of all pairs of natural numbers is countable. But could someone explain why the set of all pairs of real numbers uncountable? I am having trouble proving it using diagolization