I have created one block by using view, which display author details on each node page,   Here is the link by which the block has been created,now i want to display total number of node  and total number of work viewed created by individual user on the same block which has been created above.    The way on this link is working fine for displaying all user but its not working after adding CONTEXTUAL FILTERS (nodes) Content: Nid | Aggregation setting by which this block will be able to display on each node.  Please suggest something.  Thanks
I created a view to show Users. These users can create nodes of the "Questions" content type.  The view has to render a table to show how many (the total number) Questions the user has created. Something like:  User +++ Questions created John --- 10 Ted  --- 4 Alf  --- 19
After the training phase, is it better to run neural networks on a GPU or CPU? My understanding is that GPUs are more efficient for running neural nets, but someone recently suggested to me that GPUs are only needed for the training phase. Once trained, it's actually more efficient to run them on CPUs.  Is this true? Cartoon with a young unicorn and a demon In the late 80s or early 90s I remember watching an animated series that followed a young unicorn and a demon.   In one episode the unicorn gave the demon his horn, and the unicorn almost died.   In another episode there was a man who was able to turn people into human shaped building blocks and built a huge tower from them.   Those are the two scenes I remember with any clarity.   Does anyone have any idea? What to do with an Ubuntu disk image that appears as a WinRAR file? How to partition a list in a specific way Can I boot memtest86+ if I'm using UEFI? Downloaded the Ubuntu 16.04.2 .iso install disk and flashed it onto a USB stick.  Booting on the USB stick, there is no memtest86+ option (along with "Try Ubuntu").  Is there a way to add it to the install options?  (it's for a UEFI boot PC running normally Windows, its owner does not want to install Ubuntu. "memtest86+" is completely free (unlike "memtest86"), but is quite old, and does not offer a UEFI boot - this is why having it within the Ubuntu options makes things easier) I'm currently reading documentation about map projections to understand the source code of the Proj4 project.  The scale factor is named in a variety of sources I read. This sources explained its definition and its value for some projections.   In the source code of Proj4, for the mercator projection (sphere and ellipse case), the scale factor influences the coordinates on the projection :   //P-&gt;k0 is the scale factor xy.x = P-&gt;k0 * lp.lam; xy.y = - P-&gt;k0 * log(pj_tsfn(lp.phi, sin(lp.phi), P-&gt;e));   Why and how I should use the scale factor during the computation of the projection ? Is there any valuable resources on the web ?  This question in asked in the sense of projection computation. I can find the formula for the inverse and forward projection as well as the scale factor in a various of resources, but no one explains how I should use both in a algorithm. You have the definition of the projection and the definition of the scale factor, but it's not clearly written that I should multiply or divide the result by the scale factor.   Is it a general rule : if I find the formula for any projection with the related scale factor, should I, in all cases, always divide or multiply the results by the scale factor ? We have two iPads, and both of them have Minecraft PE. My son wants to connect the two and play with me. I have absolutely no idea what I am doing here, so I do not know how to do this.   One game says "Broadcast to LAN", and the other one says "Local Server Multiplayer". I have switched both to on.   What do I need to do to be able to play joined? We are both on the same WiFi. The identity cannot be a commutator in a Banach algebra? The Wikipedia article on  claims, without a proof or reference, that there does not exist a (unital) Banach algebra $B$ and elements $x, y \in B$ such that $xy - yx = 1$. This is surprising to me, but maybe the proof is straightforward; anyone have a proof and/or a reference?   More generally, I would have naively thought that I could embed any ring into a Banach algebra. I guess there are actually serious restrictions to doing this; are these issues discussed anywhere? Denote by $\mathbb{N}$ the set of natural numbers and by $2^{\mathbb N}$ the set of all subsets of $\mathbb N$. Let $E$ be some subset of $2^{\mathbb N}$ such that for  every pair of elements in $E$, one is a subset of the other. Clearly, $E$ could be countable by considering $E=\big\{\{1,\cdots, n\}, n\in\mathbb N\big\}$. My question is the following: could we find an example that $E$ is uncountable? Many thanks for the answer! I have read the first five Dune novels and after the first I do not recall any further mention of Imperial conditioning. In the novels written since Frank Herbert's death, were any further references or details given about what this process actually involved and why it was considered virtually impossible to remove? What is the difference between the memory usage report in System Monitor and the one by free? I am using System Monitor 2.28.0.  When I look in the Resources tab, I see a nice graph with for memory and swap.  Memory is about 60% 2.3 GiB of 3.8.  When I type the command free, I got :               total       used       free     shared    buffers     cached Mem:       3994908    3962396      32512          0     100852    1477032 -/+ buffers/cache:    2384512    1610396 Swap:      8000328      28468    7971860   cat /proc/meminfo | grep MemFree give  MemFree:           34536 kB   The situation has remained the save for several minute.  I started a lot of process with a script and the script is waiting for the free memory to get lower.  According to what I am seeing in the Process tab (or with top), the number in System Monitor seem a lot closed to the total of the memory of the process that the one reported by free.   Thanks I exported a map and everything looks fine when viewing the PDF. But when printing it on my plotter, all the text disappears. The scale bar would bring but the text associated to the scale bar wouldn't. The title block also disappears. I've tried messing around with the settings. I've checked/unchecked &quot;Embed All Document Fonts&quot; and &quot;Convert Marker Symbols to Polygons&quot;. I'm not sure what I'm doing wrong here. What's weird is I exported this map a few weeks ago and it printed just fine. Today, I needed to make a change to the map and exported it out, and now I am experiencing this issue. I must have changed one of the export settings in the past few weeks but I'm not sure what it is. Has anyone experienced this? Are we inside a black hole? I was surprised to only recently notice that      An object of any density can be large enough to fall within its own   Schwarzschild radius.   Of course! It turns out that supermassive black holes at galactic centers can have an average density of less than water's.  Somehow I always operated under the assumption that black holes of any size had to be superdense objects by everyday standards.  Compare the Earth to collapsing into a mere 9mm marble retaining the same mass, in order for the escape velocity at the surface to finally reach that of light.  Or Mt. Everest packed into one nanometer.  Reading on about this , it increases proportionally with total mass.  Assuming matter is accumulated at a steady density into a spherical volume, the volume's radius will only "grow" at a cube root of the total volume and be quickly outpaced by its own gravitational radius.  Question: For an object the , what would have to be its diameter for it to qualify as a black hole (from an external point of view)?  Would this not imply by definition that:   The Earth, Solar system and Milky Way are conceivably inside this black hole? Black holes can be nested/be contained within larger ones? Whether something is a black hole or not is actually a matter of perspective/where the observer is, inside or outside? Need assistance shrinking MDF File Verbose logging was accidentally left on for one of our database ballooning our database MDF file from roughly 90GB to 192GB.  We've disabled verbose logging, truncated the logging table but now we want to shrink the MDF file to reclaim disk space as the drive the MDF file is on is only around 200GB. I don't have the luxury of increasing its size. Our disk space monitoring tool is alerting me that drive space is less than 8% over and over and over.  Given this is the first instance this has ever happened, we don't expect to ever need that extra 102GB of disk space again. We'd like to reclaim it.   I've tried to use the GUI to shrink the database and the files but it doesn't actually change in size. I've also tried using DBCC SHRINKFILE and DBCC ShrinkDatabase with NoTruncate and TruncateOnly. No matter what I do the file doesn't seem to budge.  One potential issue is that somehow the database initial size is 188GB. Deleting and re-creating the database isn't a very practical option for us so how can I shrink the MDF file and reclaim our disk space?  Running dbcc shrinkfile('My_Data'), I get the following results:  DBID: 5  Field: 1 CurrentSize:24030464 MinimumSize: 128 UsedPages: 17770472 EstimatedPages: 17770472   The database MDF file is still the same size (192,243,712 KB).  The table has a clustered index:  Name:TRACES ObjectID: 394588594 Type: Clustered Index/b-tree   The query:  SELECT     name,     size/128.0 - CAST(FILEPROPERTY(name, 'SpaceUsed') AS int)/128.0 AS AvailableSpaceInMB FROM sys.database_files   ...for the database I am trying to shrink, returns:  Name: My_Data AvailableSpaceInMB: 48693.375000 Name: My_Log  AvailableSpaceInMB: 67028.437500   I've also tried shrinking in small chunks using a PowerShell script that shrinks in 20MB increments. That also doesn't change the size of the MDF file.  I've tried dbcc shrinkfile(My_Data) without any other options from SQL Management Studio. It runs for a long time, finishes, and the MDF file is still the same size. Specifying a target size, it runs for a good 30-40 minutes (finishes) and nothing changes file size wise.  I ran this: DBCC SHRINKFILE (N'My_Data' , 139045) and get the following results:  DbId: 5 Field: 1 CurrentSize: 24030464 MinimumSize: 128 UsedPages: 17808744 EstimatedPages: 17808744 How do you empty the buffers and cache on a Linux system? Prior to doing some benchmarking work how would one free up the memory (RAM) that the Linux Kernel is consuming for its buffers and cache?    Note that this is mostly useful for benchmarking. Emptying the buffers and cache reduces performance! If you're here because you thought that freeing buffers and cache was a positive thing, go and read . The short story: free memory is unused memory is wasted memory. Countable set of truth assignments satisfying set of well formed formulas I am trying to answer the following question posed in my logic class: (throughout we work in propositional logic) is there a set $S$ of well-formed-formulas (wffs) satisfied by countable set $V$ of truth assignments such that any truth assignment satisfying $S$ lies in $V$?    My guess is no.  My first reaction to this was to do a diagonalization.  Present $V$ as an array with $v_{i, j}$ the truth value that assignment $v_i$ gives to the $j$-th propositional letter.  Obviously the hard case is when $S$ is infinite; if $S$ is finite, then only finitely many propositional letters occur in the $S$-formulae.  Then there is some maximal $k$ for which all $A_n$ with $n \geq k$ do not occur in V.  Then the diagonalization is trivial: just diagonalize from the $k$-th letter onward, since changing $A_k$ in this range doesn't affect anything in $S$.  But I have little clue about how to approach the main case when $S$ is infinite. I thought maybe I should try using the fact that $S$ is consistent (since it's satisfiable).  If it's maximally consistent, then I think this is simple too, since for every propositional letter $A_n$, either $A_n$ is in $S$ or $(\neg A_n)$ is in $S$, implying that there is only one truth assignment satisfying $S$--since every truth assignment must agree on each propositional letter.    But if $S$ is not maximally consistent, this isn't available to me.  Somehow I would like to show that infinitely many propositional letters do not occur in $S$.  Then I can apply the trick above and just diagonalize through the superfluous letters.    So, yes, just looking for some hints or corrections if you have any please, though maybe if I don't get anywhere on my own I'll give up and ask for more.  Thanks.  (By the way, by referring to letters that "occur in $S$" I mean letters that occur in some formula in $S$). The problem Comments are terrible; no one agrees on what they're for, or how long they should be kept. Comment flags are equally terrible, because if no one's on the same page as far as what should be posted in the first place then no one can agree on what should be removed either. On top of that, we have this confusing set of flags where two mean &quot;noise&quot;, one means &quot;vile&quot;, one means &quot;moderator, help!&quot; and one means nothing at all - the end result is that it's all but impossible to even analyze comment flagging. The solution (or, part of it) Two years ago, in a fit of rage, I . Nothing got done. As always, everyone has a different idea of how things are supposed to work, and I'd bitten off more than I could chew. So, here we are, two years later, and comment flags still suck. So let's start by just cutting the fat: if we can trim down the list of flags to a set of clearly distinct problems, we might have something we can build on. Here's what I'm proposing, based on the past two years of discussion:   Re-word the &quot;rude or offensive&quot; flag to read,  rude or abusive: this comment violates .   Remove the &quot;not constructive&quot;, &quot;obsolete&quot; and &quot;too chatty&quot; flags.  Add a new comment flag:  no longer needed: this comment is obsolete, chatty or otherwise unnecessary   Re-word the &quot;other...&quot; flag:  in need of moderator attention: these comments require action by a moderator. Be specific and detailed!    That's it; that's all I'm proposing to start out - simplify things so that we have something to build on. See also: Converting vector layer to raster using QGIS? In qgis in the raster menu there is an item "convert vector to raster".  This behaves strangely - I do not understand how it is supposed to work.  I can select a vector file, an attribute and an output raster. But, for some reason the output file is only accepted if it exists and even if I select an existing raster nothing seems to happen.  Also I do not understand how the program knows what kind of raster to create, what cell-size, projection etc.  How can I convert vector to raster? Install ffmpeg in Ubuntu 12.04 LTS Background :  I used ffmpeg to merge two videos side by side. First I install ffmpeg by following command as it suggest by Ubuntu itself.  sudo apt-get install libav-tools   or   sudo apt-get install ffmpeg   But then I realize it is not the correct version since it doesn't support for -filter_complex and few other functions.   After a few hours researcher I found  and I succeed with video conversion as well. As per that article, it is suggesting we need to build it our own.        Question :  What is easiest way to install that ffmpeg version (which is support for -filter_complex ) without following all those steps ? I need to start reading Lucifer comics, but I am having trouble figuring out where to start Do I read the Sandman stuff, or do I jump right into the main comics? Because I really want to maintain continuity, what's the right sequence to ensure that I get every bit of the story?