PIR Sensor + LEDs with no additional Microcontroller
NPN circuit to switch 12v 1A DC load by 3.3v 1A DC using PIR
There are some kind of door devices which push the door back after we open the door and come out.  My problem is that the door area is not constructed in a way that such a device can be installed.  There is no space adjacent to the door anywhere.  Automatic closure of door is extremely important to me.   Please see following pictures and tell what choices do I have. I tried Libreoffice, but its Import option while pasting in the cell is very  annoying.I also tried Gnumeric but I am not able to paste using middle button.Parcellite to make copy paste faster and middle button pasting is not working with Gnumeric. Is there any simple table maker app available that can accept only simple unformatted text? All these software are very complicated for this simple work. Adobe Illustrator: Lines with stroke < 2.0pt doesn't change color I created lines using the line segment tool in Adobe Illustrator (latest Adobe Cloud version) and I can't change the color of the stroke (through the Appearance panel) if the stroke weight is less than 2.0pt.   If the stroke is 2pt or more, then the color around the line changes but not the line itself.    The whole behavior is odd for me as I've never faced in Illustrator before.  Edit: added screen below with the line selected. I want to disable the internal Microphone on my laptop and the internal Webcam completely that they're no longer selectable, and no longer available?  I will only use my external Webcam, and my external (USB) headset.  The internal audio should still be available for playback. Why 32bits OSs can't address more than 3.2/3.2 gb of memory? Don't know if this is the right place to ask this question.  I've been reading that 32bit OSs (like the Ubuntu i'm running right now) can't adress more than 3.2gb or 3.3gb of RAM memory.  I remember for my old Computer Architecture course that the memory limitation was 2^32 "pointers" (don't remember the right word). I mean, the memory was represented like an array where the CPU can acces it directly, but up to its limit. If the CPU is 32 bit, then it can address 2^32 words, if it's 64 bits 2^64, etc.  So, if what i said before is right, then, my OS should be able to address 2^32 = 4294967296 = 4Gb.  I'm thinking maybe some sort of space is reserved to the particular use of the Kernel, cache, buffering or swapping. But don't have the correct answer.  Can you give me a hint? Find files using ls and wildcards pwd : ../bin under bin I have a directory called datafiles.  Use meta characters and the ls -lL command (with lower and upper case L) to list all filenames under the datafiles directory that contain a dot . with the letter 'f' or 'u' anywhere after the dot.  I tried: ls -lL datafiles *.*f*u  ls -lL datafiles .[f*u]     Thank you for answering. Unfortunately, none of the solutions worked the way I wanted it.  By clarifying the question, /bin/datafiles/file.backup is the root to the directory. From the /bin directory, the command I used is ls -lL datafiles followed by meta characters.  I'm looking for file.backup that has a dot and followed by f or u, not directly followed by f or u (anywhere after the dot), and not ending by f or u. While modeling an Audi R8 I have the following problem. The thing I want to create is seen in this image:    I want to create a sharp crease (outlined in red) which starts around the first exhaust and then goes to the second.  Is there an efficient way to do this (I also use the Subdivision Surface Modifier for this model). This is a recurring question (see ,  and ), but I have a different spin.  Suppose I have a bunch of samples from a generic MCMC sampler. For each sample $\theta$, I know the value of the log likelihood $\log f(\textbf{x} | \theta)$ and of the log prior $\log f(\theta)$. If it helps, I also know the value of the log likelihood per data point, $\log f(x_i | \theta)$ (this information helps with certain methods, such as WAIC and PSIS-LOO).  I want to obtain a (crude) estimate of the marginal likelihood, just with the samples that I have, and possibly a few other function evaluations (but without rerunning an ad hoc MCMC).  First of all, let's clear the table. We all know that the harmonic estimator is the . Let's move on. If you are doing Gibbs sampling with priors and posteriors in closed form, you can use ; but I am not sure how to generalize outside of those cases. There are also methods that require you to modify the sampling procedure (such as via ), but I am not interested in that here.  The approach I am thinking of consists of approximating the underlying distribution with a parametric (or nonparametric) shape $g(\theta)$, and then figuring out the normalization constant $Z$ as a 1-D optimization problem (i.e., the $Z$ that minimizes some error between $Z g(\theta)$ and $f(\textbf{x}|\theta) f(\theta)$, evaluated on the samples). In the simplest case, suppose that the posterior is roughly multivariate normal, I can fit $g(\theta)$ as a multivariate normal and get something similar to a Laplace approximation (I might want to use a few additional function evaluations to refine the position of the mode). However, I could use as $g(\theta)$ a more flexible family such as a variational mixture of multivariate $t$ distributions.  I appreciate that this method works only if $Z g(\theta)$ is a reasonable approximation to $f(\textbf{x}|\theta) f(\theta)$, but any reason or cautionary tale of why it would be very unwise to do it? Any reading that you would recommend?  The fully nonparametric approach uses some nonparametric family, such as a Gaussian process (GP), to approximate $\log f(\textbf{x}|\theta) + \log f(\theta)$ (or some other nonlinear transformation thereof, such as the square root), and  to implicitly integrate over the underlying target (see  and ). This seems to be an interesting alternative approach, but analogous in spirit (also, note that GPs would be unwieldy in my case). Prove that $\mathbb{|Q| = |Q\times Q|}$ How to make a multiboot CD that will start a user-chosen ISO file I have many CD ISOs downloaded from the Internet. They are each about 100 MB in size and consist of repair/diagnostic programs and other tools. Some of them are Linux-based; others are based on DOS clones, like FreeDOS. I want to put all of the ISOs onto one bootable DVD, so that when I use the DVD, I will get a menu prompting me to select the ISO I want to boot. How can I do this? I've seen some rescue CDs that are combinations of other people's ISOs, but I have no idea how they were made.  Regarding bounty: I, a different person than the OP, have placed a bounty on this question for a solution that meets ALL of these criteria:  Is for DVDs (not flash drives!!!) Is free Works with any ISO file, regardless of original OS Deciphering the RSA encrypted message from three different public keys Where is the BIOS stored? From :     BIOS software is stored on a non-volatile ROM chip on the motherboard. ... In modern computer systems, the BIOS contents are stored on a flash memory chip so that the contents can be rewritten without removing the chip from the motherboard. This allows BIOS software to be easily upgraded to add new features or fix bugs, but can make the computer vulnerable to BIOS rootkits.   Since ROM means Read-Only Memory,  why can the BIOS contents be rewritten?  Does the "flash memory chip"  mean the same as the "non-volatile ROM", both meaning where BIOS is stored? Help center still has the guidance about old Favorite tags How well does jQuery support backward compatibility? We have had issues with Mootools not being very backward compatible specifically in the area of drag and drop functionality. I was wondering if anyone has had any similar problems with jQuery not being backward compatible. We are starting to use it quite heavily and are thinking about upgrading to a newer version to start using several plugins that require it. Will we have any issues if we get rid of the older version? Prove if $(a,p)=1$, then $\{a,2a,3a,...,pa\}$ is a complete residue system modulo $p$. let $p$ be a prime and let $a$ be an integer not divisible by $p$, that is $(a,p)=1$. Then $\{a,2a,3a,...,pa\}$ is a complete residue system modulo $p$.  Since $p\nmid a$, $p\nmid\{a,2a,3a,...,(p-1)a\}$ Since $p|p$, $p|\{pa\}$ which is exactly one element in the set and is therefore a complete residue system.   Wondering if this is an acceptable proof to this theorem. Is Unit Testing worth the effort? I am working to integrate unit testing into the development process on the team I work on and there are some sceptics. What are some good ways to convince the sceptical developers on the team of the value of Unit Testing? In my specific case we would be adding Unit Tests as we add functionality or fixed bugs. Unfortunately our code base does not lend itself to easy testing. Prevent Windows 10 installer from using the preinstalled serial key without disabling UEFI Since I started learning  and  last year, I've read a huge number of articles which insist that design patterns (especially in Java) are workarounds for the missing features in imperative languages. One article I found :     Most people I've met have read     by the Gang of   Four (GoF). Any self respecting programmer   will tell you that the book is   language agnostic and the patterns   apply to software engineering in   general, regardless of which language   you use. This is a noble claim.   Unfortunately it is far removed from   the truth.      Functional languages are extremely   expressive. In a functional language   one does not need design patterns   because the language is likely so high   level, you end up programming in   concepts that eliminate design   patterns all together.   The main features of functional programming (FP) include functions as first-class values, currying, immutable values, etc. It doesn't seem obvious to me that OO design patterns are approximating any of those features.  Additionally, in functional languages which support OOP (such as F# and OCaml), it seems obvious to me that programmers using these languages would use the same design patterns found available to every other OOP language. In fact, right now I use F# and OCaml every day, and there are no striking differences between the patterns I use in these languages vs. the patterns I use when I write in Java.  Is there any truth to the claim that functional programming eliminates the need for OOP design patterns? If so, could you post or link to an example of a typical OOP design pattern and its functional equivalent? How to jump to the region header from the endregion tag in c# visual studio 2012? How do I update the GUI from another thread? Which is the simplest way to update a Label from another Thread?   I have a Form running on thread1, and from that I'm starting another thread (thread2).  While thread2 is processing some files I would like to update a Label on the Form with the current status of thread2's work.   How could I do that?