Can we load a assembly in reflection-only context into a new app domain?  I could not find anything related to this.
I'm writing a tool to report information about .NET applications deployed across environments and regions within my client's systems.  I'd like to read the values of assembly attributes in these assemblies.  This can be achieved using Assembly.ReflectionOnlyLoad, however even this approach keeps the assembly loaded.  The issue here is that I cannot load two assemblies that have the same name from different paths, so naturally I can't compare the same application deployed in different systems.  At this point I'm assuming the solution will involve using temporary AppDomains.  Can someone detail how to load an assembly into another AppDomain, read the attributes from it and then unload the AppDomain?  This needs to work for assemblies on the file system as well as those at URL addresses.
Find the value of : $\cos x \cos 2x...\cos 999x$ given that $x=\frac {2\pi}{1999}$ Given $x=\frac {2\pi}{1999}$  Find the value of $$\cos x \cos 2x \cos 3x ...\cos 999x$$  So I tried expanding $\sin {2000x}=2\sin 1000x \cos 1000x$  Then rewriting  $\cos 1000x= \cos {(999x+x)}$   No luck so far. In the book "Jurassic Park" does the Lysine Contingency actually get explained? I was watching the movie recently and noticed that one of the characters (very) briefly mentions a safety they built into the system should any of the dinosaurs escape. They called it the Lysine Contingency saying that all the dinos have been genetically modified to depend heavily on lysine in their diet, so if any of them escape they wouldn't be able to survive without the food supplements that the park gives them.   Why doesn't the story end right there? Does the Michael Crichton book actually explain this in depth? Given a PRF $F$ , is $G(s) = F_s(1)\|F_s(2)\|\cdots \|F_s(n+1)$ a PRG? If $F$ a PRF, and we construct $G$ using $F$ in the following way:  $$G(s) = F_s(1)\|F_s(2)\|\cdots \|F_s(n+1)$$ where $|s|= n$.   Is $G$ then a PRG? If so how can I prove this? If not how can $G(s)$ be distinguished from a random $r$? And what if $n+1 &lt;$ range of $F_s$? or it could be for any $n &gt; |s|$. My dconf/gsettings installation is broken. How can I fix it without Ubuntu reinstall? I run Ubuntu 12.04.1 LTS x64 in VirtualBox. After one very unfortunate misclick (reset saved state instead of load saved state) I got a very annoying problem.  Almost all applications (unity, synaptic, gedit, etc.) print on start:  Using the 'memory' GSettings backend.  Your settings will not be saved or shared with other applications.   And all GUI settings reset after reboot.   Another symptom:  $ GSETTINGS_BACKEND=dconf dconf-editor (dconf-editor:2353): GLib-GIO-WARNING **: Can't find module 'dconf' specified in GSETTINGS_BACKEND GLib-GIO-Message: Using the 'memory' GSettings backend.  Your settings will not be saved or shared with other applications   But /usr/lib/x86_64-linux-gnu/gio/modules/libdconfsettings.so is present.     What I tried (and it didn't help):   sudo apt-get install -f --reinstall  dconf-tools libdconf0 libdconf-dbus-1-0 dconf-service Build dconf-0.5 from sources and make install it Create empty user profile and start programs there   I have to keep current Ubuntu installation so a complete reinstall is not an option for me.   How can I fix it? Search and download audio-only from youtube Is there a way to search and then download from YouTube, with the situation that I only need to download the audio only, not the video. I have an existing windows application, for which I have decided to create a Mac version. The problem is that the current UI involves a lot of buttons, tabbed panels, multiple windows etc.  This UI had been rated as intuitive and easy to use and straightforward  by many customers and editors. But a beginner (very less experience) may find in confusing a little, but it has been complemented with tutorial.      When creating the Macintosh variant, should I focus on creating a simplified and minimalistic UI (this does not mean the current UI is complex, but I think Mac user's prefer a simple UI right?) or should I try to copy the exact same thing?  By reducing the UI some of the features may be missing. But it can be added later if needed. Should I focus on a fresh approach (this is easier rather than copying the complex UI pattern) or should I go with the old recognized setup? How can I contribute to Ubuntu? I would like to know what kinds of contributions someone can make to Ubuntu. Such as Programmer, User, Proofreader, etc. Understanding shape and calculation of confidence bands in linear regression Where do I find the current C or C++ standard documents? For many questions the answer seems to be found in "the standard". However, where do we find that? Preferably online.  Googling can sometimes feel futile, again especially for the C standards, since they are drowned in the flood of discussions on programming forums.  To get this started, since these are the ones I am searching for right now, where are there good online resources for:   C89 C99 C11 C++98 C++03 C++11 C++14 C++17 Can I use HMAC-SHA1 in counter mode to make a stream cipher? Say I have an embedded device which is only capable of doing HMAC-SHA1 transformations (that device is, in fact, a YubiKey).  Would it be secure to feed it like a block cipher in counter mode to get a random pad suitable as an stream cipher?  Of course, I'm talking about not repeating the counter value ever to encrypt data (so this construction would also need some random IV or treating the counter value as a nonce forever). \documentclass[11pt]{article}  \begin{document}   The above equations on application of Laplace Transform become:  $$sL_1\hat{i}_{L1}(s) = D\cdot \hat{v}_{C1}(s) + D\cdot \hat{v}_{C2}(s) - D\prime \cdot \hat{v}_g(s) + (C_{C1} + V_{C2} - V_g + V_D)\cdot \hat{d}(s)$$ $$sL_2\hat{i}_{L2}(s) = -D\prime \cdot \hat{v}_{C1}(s) + D\cdot \hat{v}+{C2}(s) + D\prime \cdot \hat{v}_g(s) + (C_{C1} + V_{C2} - V_g + V_D)\cdot \hat{d}(s)$$ $$sC_1\hat{v}_{C1}(s) = -D\cdot \hat{i}_{L1}(s)+ D\prime \cdot \hat{i}_{L2}(s) + (-I_{L1} -I_{L2} - I_1)\cdot \hat{d}(s) -D\prime \cdot \hat{i}_l(s)$$ $$sC_1\hat{v}_{C1}(s) = D\prime \cdot \hat{i}_{L1}(s)- D\cdot \hat{i}_{L2}(s) + (-I_{L1} -I_{L2} - I_1)\cdot \hat{d}(s) -D\prime \cdot \hat{i}_l(s)$$ $$sL_l\hat{i}_l(s) = D\prime \cdot \hat{c}_{C1}(s) + D\prime \cot \hat{v}_{C2}(s) - D\prime \cdot \hat{v}_g(s) +(V_g - V_D - V_{C1} - V_{C2})\cdot \hat{d}(s) - R_l \cdot \hat{i}_l(s)$$  \end{document}   Error:   181 Underfull \hbox (badness 10000) in paragraph at lines 181--181 181 Overfull \hbox (22.63293pt too wide) detected at line 181 Can a particle be physically observed inside a quantum barrier? I understand that if a particle approaches a finite potential barrier of height $V_0$ with energy $E &lt; V_0$, there is still a finite probability of finding the particle on the other side of the barrier due to quantum tunneling.  My question is, since the wavefunction is nonzero inside the barrier region, is it possible to actually make a position measurement and locate a particle inside the barrier?  I mean, if we can say that "there is a nonzero probability that the particle is inside the barrier", surely this would suggest we can do so?  If not, why not? Am I understanding the whole wavefunction/probability distribution thing right? How can I get a copy of a Canadian visa refusal letter? I have applied for a Canadian Temporary Resident Visa (TRV); a previous paper application was refused in 2016. I have lost the copy of my refusal letter and want to submit it when I apply for my new visa. How how can I get the a copy of the 2016 refusal letter from Embassy? Can we escape Earth's gravity slowly? I had a recent conversation with my girlfriend, who is a physics grad student. She was kind enough to listen to me rant about an idea concerning escape velocity. Unfortunately, I am still thinking about this question, but don't want to bother her with it.  My thought is that we shouldn't actually need to reach 11km/sec to leave the earth's gravity. Instead of this, can we simply apply enough force to overcome earth's gravity without reaching that speed? How we would do this is not a part of my question.  Orbital altitude is $99$ miles. Travelling $60$ mph straight up should get you there in $1.65$ hours, granted you have enough force to push. I know some of the simpler math like $F=ma$, but that didn't help me understand.  I browsed some articles about space elevators and couldn't find my answer.  Then I thought about a regular elevator and the fact that it has enough force to move it away from the earth successfully. Even if the elevator moved at $1$ nanometer/sec, it would still move away from the Earth, overcoming the minute pull of gravity at that altitude.  If you missed it, my question was:  can we simply apply enough force to overcome Earth's gravity without reaching that speed?  Edit: In another example, let's say we could drive a car from here to low Earth orbit. As long as we had enough torque, we should be able to overcome gravity, much like a pickup truck pulling a bunch of lumber. Is that correct? Not all files are visible over MTP I have LG L5 (e610 model) device with Cyanogenmod 10. When I connect the phone to a computer with Linux (I have mtpfs installed), I can see both internal storage and the SD card.  However when I navigate inside them, I can't see some of the files.  For example, if I open file manager app on the phone, I can see several files in the Internal storage/Notifications directory, however the directory on the computer only shows one of those files.  If I switch USB connection type to PTP (camera) - as OS X doesn't support MTP natively - Image Capture sees the phone as a camera, however it can only see about a third of all the images present on the phone.  I don't have a Windows machine to try, but I suspect the results would be similar.  I tried upgrading Cyanogenmod to the latest nightly, clearing and reinstalling it - same results.  Any idea as to what is going on?  How can I make all files appear on the host computer? How do you correctly say large numbers I am travelling from Panama to Los Angeles and around the States for approx 80 days then flying back to Panama and making my way up Central America for approx 3 months before flying back to LA to fly home to Australia.    Will this be OK with an ESTA?    Does it count as spending too long in the States?    I have been told that Panama is not far enough away. Before today, I would visit Stack Overflow every day and click somewhere in the upper-left corner (I've forgotten what it said, and it's gone now!) and if I didn't have any notifications I would see a list of interesting questions from various sites in the Stack Exchange network which - I believe - were classified as "hot".  Now this new top bar has appeared, and I have no idea how to get this list any more. I'm not really sure what it was called so my searches have been useless as well. What is time, does it flow, and if so what defines its direction? I already know that if groups $G,H,K$ are finitely generated abelian groups, following is true.  If $G\times K$ is isomorphic to $H\times K$, then $G$ is isomorphic to $H$. I prove this by uniquness of factorization of finitely generated abelian groups.  My questions are   If group $G$ is finite,$G\times K$ is isomorphic to $H\times K$, then $G$ is isomorphic to $H$? Can you give me a easiest proof and it can be proved by projection function on external direct product? If $G,H,K$ are groups.  If $G\times K$ is isomorphic to $H\times K$, then $G$ is isomorphic to $H$. This statement is false. What is a counterexample?   *$\times$ is external direct product