How to use Restrictions.and for joined table?
How do you "OR" criteria together when using a criteria query with hibernate?
How to customize Latexian to use other TeX engines or biber? The Mac editor Latexian has built in methods for compiling using latex+dvips, pdflatex and xelatex.  Furthermore, it assumes bibtex and makeindex to deal with bibliographies and indexes, respectively.  How do I customize Latexian to use, e.g. LuaTeX for compiling or Biber for bibliographies? If $|f(z)|\le |g(z)|$, can we say $f$ is constant? Let $f$ and $g$ be entire functions and $g(z)\neq 0$ for all $z\in \mathbb{C}$. If $|f(z)|\le |g(z)|$, can we say $f$ is constant?  Liouville theorem says that an entire bounded function is constant, but g is not given bounded here. So I think it should be false. What else can we say about $f$? Randomly populating procedural shape (or Image Texture) in Cycles Check if a user has a role How can I check if a user has a certain role?  I found  but it is for Drupal 6. How to scale and shift voltage signal? I want to scale and shift my voltage signal by below relation:  $$ V_{out} = \frac {10} {12} \cdot V_{in} - 10 $$  Indeed my primary voltage is from 0v to 24v and I want to put it from -10v to +10v.  I try to use the below circuit but its gain is always greater than 1.    Image from SLOA097 TI.  Does anyone know how I can achieve my goal? I have ±12v and 5v power lines.  EDIT: According to the innovative solution by scorpdaddy, I thought it would be valuable to edit my question:   High input impedance is required to decrease load effects. How can it be achieved? How can I achieve the more and more accuracy? Unit Test - Creating Custom Metadata I have three questions that I'd like to be clarified.   Is their anyway we could create Custom Metadata in Test Classes? I tried to create on my Test Class but I got an error saying the fields of the metadata could not be writable.  If not, then does that mean we should declare real values in our Custom Metadata and use that instead in our test classes? If (2) is correct, then does this mean we have to create the Custom Metadata in the environment we'll be deploying our code before doing the actual deployment? Grant the OP a binding close as duplicate vote Since the  to the close as duplicate mechanism it is a lot more visible to the OP that there is/might be a duplicate to their question. Empirically, I've noticed a lot more people agreeing, in the comments under their question, that their question is a dupe.   For instance, :        I'm aware that allowing  is  (back in the stone age) but now Stack Exchange is so much larger, and Stack Overflow is groaning under the weight of questions, I think this should be partially revisited.  Based on the principle that the simplest way to keep a site clean is to have as many people as possible nibbling away, I propose that the OP gets granted a binding close-as-duplicate vote.  It should simply be an additional line in the banner, which is . It might be something like this:     This question may already have an answer here:   &nbsp; "" 3 answers   &nbsp; Does this fully answer your question?  Yes / No   I'm not wedded to the Yes / No thing I just can't think of a better way at the moment.  Clicking on Yes would take the OP to the close as duplicate dialogue with that question highlighted. If there are multiple duplicate questions you'd need to ask the OP multiple times. A No could be used to track the relative success of the project, i.e.   Whether the question subsequently gets closed. Whether the question gets reopened again. How many times the OP actually clicks. How many times the OP disagrees with the analysis of the community.   Potentially, a No could be used to open a comment dialogue asking the OP to explain why they think their question is not a duplicate thereby stopping them simply putting "this is not a duplicate" in the question and formalising this process somewhat. Not sure about this idea...  I do not think this should be restricted by reputation, anyone should be able to close their own question as a duplicate. It gives people with lower reputation a more positive experience of the closing process and emphasises the importance of duplicate finding.  Most importantly, self-closes should not, initially, count towards the question ban. We can help new users learn how to use a lot more of the site than they might otherwise see and encourage them to search for duplicates more thoroughly. If the OP then goes on to do the same thing 10 times in a row then you can start using it toward the ban as they're obviously using the users as a personalised search service but at least the first 3-4 times this should not have any effect.  This question is, deliberately, only requesting 20% of the linked question (from 2009) and then only based on the new UI. The linked question asks for binding migration votes etc, which I do not want to see and I am not requesting a binding close-as-duplicate for the OP until someone else has already voted to close (though I think if the OP has 3k rep this might be allowable). This, I hope, addresses the concern's raised in the linked question and explains why this is not a duplicate of that question. Given a joint density function, what is the conditional expectation $E[Y|x]$? The random variables $X$ and $Y$ have the joint density $$f_{X,Y}(x,y)= \left\{\begin{matrix}e^{-y}, \mbox{ } 0\leq x \leq y \le \infty \\ 0,  \mbox{   otherwise}\end{matrix}\right.$$ Evaluate the conditional expectation $E[Y|x]$.    I'm not sure if I'm doing this correctly. Please let me know if something is off in my solution. Thanks for reading.  My solution: (My expected value is negative, which I'm pretty sure can never be the case. Also in line 4 and 8, are the domains correct?)  $$E[Y|x] = \int_{-\infty}^{\infty}yf_{Y|X}(y|x)dy.$$  $$f_{Y|X}(y|x) = \frac{f_{X,Y}(x,y)}{f_{X}(x)}.$$    $$f_{X}(x) = \int_{-\infty}^{\infty}f_{X,Y}(x,y)dy$$   $$= \int_{0}^{\infty}e^{-y}dy $$  $$=\left [ -e^{-y} \right]\Big|_0^\infty $$  $$ = -e^{-\infty}-(-e^{0})=1. $$ $$f_{X}(x) = 1, x \geq 0.$$ Thus,   $$E[Y|x] = \int_{0}^{\infty}-ye^{-y}dy$$  $$= -\int_{0}^{\infty}ye^{-y}dy$$ After integration by parts,  $$E[Y|x] = \left [ ye^{-y}+e^{-y} \right]\Big|_0^\infty$$ $$=0-[e^{0} + 0]=-1$$ Therefore, $E[Y|x] = -1.$  Thanks in advance for reading this long problem and responding! This came up in proving non-regularity of a certain language (powers of 2 over the ternary alphabet). Any clue to the above equation could help me move forward.  Edit: Of course, $x = 1, y = 1$ is a solution. I am looking for non-trivial solutions. Use hostnames to connect to machines on LAN I have just had my broadband upgraded to  which means my router has had to change. Previously I was using a Thomson TG585v7 ADSL thingy provided by my ISP. One nice thing about that router was that it would act as a local DNS and allow me to find my other machines on the network by using &lt;hostname&gt;.lan instead of IP addresses.  I've now switched to a Linksys WRT320N ethernet router which connects to my fibre modem, and which I've updated to the latest firmware (1.0.04). I have 2 machines on the network which I regularly want to connect to each other; one is running Windows 7 and the other is running OS X Lion.  The problem I'm having is that I'm unable to connect to my Win7 machine from the OS X machine using the Win7 machine's name. However, I'm able to ping the OS X machine from my Win7 machine using the hostname. A hidden process, what it is? [root@datacenteronline ~]# ssh root@192.168.1.172 Last login: Wed Apr 17 09:55:45 2013 from 192.168.1.187 [root@localhost ~]# ls /proc/ | grep 2266 [root@localhost ~]# cd /proc/2266 [root@localhost 2266]# ls attr             cpuset   limits      net            root       statm autogroup        cwd      loginuid    numa_maps      sched      status auxv             environ  maps        oom_adj        schedstat  syscall cgroup           exe      mem         oom_score      sessionid  task clear_refs       fd       mountinfo   oom_score_adj  smaps      wchan cmdline          fdinfo   mounts      pagemap        stack coredump_filter  io       mountstats  personality    stat [root@localhost 2266]# ls -al /proc/2266 total 0 dr-xr-xr-x   7 apache apache 0 Apr 17 09:45 . dr-xr-xr-x 266 root   root   0 Apr 17 09:11 .. dr-xr-xr-x   2 apache apache 0 Apr 17 09:45 attr -rw-r--r--   1 root   root   0 Apr 17 09:45 autogroup -r--------   1 root   root   0 Apr 17 09:45 auxv -r--r--r--   1 root   root   0 Apr 17 09:45 cgroup --w-------   1 root   root   0 Apr 17 09:45 clear_refs -r--r--r--   1 root   root   0 Apr 17 09:45 cmdline -rw-r--r--   1 root   root   0 Apr 17 09:45 coredump_filter -r--r--r--   1 root   root   0 Apr 17 09:45 cpuset lrwxrwxrwx   1 root   root   0 Apr 17 09:45 cwd -&gt; / -r--------   1 root   root   0 Apr 17 09:45 environ lrwxrwxrwx   1 root   root   0 Apr 17 09:45 exe -&gt; /usr/local/apache2/bin/httpd dr-x------   2 root   root   0 Apr 17 09:45 fd dr-x------   2 root   root   0 Apr 17 09:45 fdinfo -r--------   1 root   root   0 Apr 17 09:45 io -rw-------   1 root   root   0 Apr 17 09:45 limits -rw-r--r--   1 root   root   0 Apr 17 09:45 loginuid -r--r--r--   1 root   root   0 Apr 17 09:45 maps -rw-------   1 root   root   0 Apr 17 09:45 mem -r--r--r--   1 root   root   0 Apr 17 09:45 mountinfo -r--r--r--   1 root   root   0 Apr 17 09:45 mounts -r--------   1 root   root   0 Apr 17 09:45 mountstats dr-xr-xr-x   6 apache apache 0 Apr 17 09:45 net -r--r--r--   1 root   root   0 Apr 17 09:45 numa_maps -rw-r--r--   1 root   root   0 Apr 17 09:45 oom_adj -r--r--r--   1 root   root   0 Apr 17 09:45 oom_score -rw-r--r--   1 root   root   0 Apr 17 09:45 oom_score_adj -r--r--r--   1 root   root   0 Apr 17 09:45 pagemap -r--r--r--   1 root   root   0 Apr 17 09:45 personality lrwxrwxrwx   1 root   root   0 Apr 17 09:45 root -&gt; / -rw-r--r--   1 root   root   0 Apr 17 09:45 sched -r--r--r--   1 root   root   0 Apr 17 09:45 schedstat -r--r--r--   1 root   root   0 Apr 17 09:45 sessionid -r--r--r--   1 root   root   0 Apr 17 09:45 smaps -r--r--r--   1 root   root   0 Apr 17 09:45 stack -r--r--r--   1 root   root   0 Apr 17 09:45 stat -r--r--r--   1 root   root   0 Apr 17 09:45 statm -r--r--r--   1 root   root   0 Apr 17 09:45 status -r--r--r--   1 root   root   0 Apr 17 09:45 syscall dr-xr-xr-x  29 apache apache 0 Apr 17 09:45 task -r--r--r--   1 root   root   0 Apr 17 09:45 wchan   Cound anyone tell me what it is? Clipped data frame clips labels? I have a large project with provincial data. The project is currently using a data driven map with a clipped data frame for the province. The issue is the data I'm trying to show is thousands of point labels within each province, and the now clipped border is clipping labels as well. How do I stop the labels from being clipped along with the data frame?  Also, I only want to show labels that are applicable to that specific province and not the neighbouring provinces. Adding arrows in curves Why do the $n \times n$ non-singular matrices form an "open" set? Why is the set of $n\times n$ real, non-singular matrices an  open subset of the set of all $n\times n$ real matrices? I don't quite understand what "open" means in this context.  Thank you. I posted a question which was closed as off-topic and it seems like it could fit on another site in the network. How can I go about moving it there?   What is migration? When can a question be migrated, and who can migrate it? When should I consider migration, and when is it inappropriate? What causes a migration to be blocked and what happens after? What causes a migration to be rejected and what happens after? Anything else I should know about migration? How do R and Python complement each other in data science? In many tutorials or manuals the narrative seems to imply that R and python coexist as complementary components of the analysis process. To my untrained eye, however, it seems that both languages sort of do the same thing.  So my question is if there are really specialized niches for the two languages or if it's just a personal preference whether to use one or the other? Let $f$ and $g$ be continuous at $ x=a$, with $f(a)<g(a)$. Prove that there exists a neighborhood $I$ of a such that $f(x)<g(x)$ for all $x \in I$. On which Stack Exchange site can I ask questions like        When will [some new feature] for [some product] be released?   Where can I download an update for [some product]?   I'm getting errors when accessing the customer portal for [some company] – how can I fix this?   Why was I banned for doing [some action] on [some platform]?   Why is [some company] discontinuing [some product]?   Why is [some company] giving away [some product] for free?   What's the price for [some product]?      or any other product support/customer service questions?  It's not a product related to programming (or I've read  on Meta Stack Overflow) so I know Stack Overflow isn't the right place. Which other site in the network will take these kind of questions? 35km commute possible? Currently, on every other day I commute to work which is a distance of 18km each way. I enjoy this ride but next year I may be moving to a place which will be about 35km from work. Questions:  1) Would it still be reasonable to commute this kind of distance each way once I have moved?  2) Google maps estimates that this distance would take 2 hours to complete. Would it be possible (depending on the bike and fitness) to do this distance in about an hour? Using same modulus for RSA I know that there exist some attack when using same modulus.      But with a little modification, $m$ is the plain-text $N$ is the RSA modulus $r_1, r_2$ is the random padding $e, s$ is the public exponent $C_e, C_s$ is the cipher-text  encrypt as follow $$С_e = (m + r_1)^e   \bmod N$$ $$С_s = (m + r_2)^s   \bmod N$$  If attacker only knows $C_e, C_s, r_1, r_2, e, s, N$. Is it possible to know $m$?  It seems the  does not work?