I have a collection of orders that were submitted to an internal ERP, which were processed and partially shipped.  The table hierarchy is as follows:   Order table contains OrderReference(PO), OrderID OrderItems table contains Product/Lot/Qty requested (OrderID is parentID that joins these tables) Shipping contains OrderReference(PO), ShippingID ShippingArchive contains Product/Lot/Qty that was shipped (ShippingID is parent that joins these tables)   I want to create a report that looks as follows:  OrderReference#  Order Requested / Shipped Items / Missing Pieces  PC/Lot/Qty    -   PC/Lot/Qty    - PC/Lot/Qty   I have used a temp table to get some of the data but I realize I'm taking the wrong approach. I should be able to do all of this with a single query, though it will seemingly be a bit complex.   I get held up when I try to think about how to join where pieces don't exist, and where to perform the mathematics in my sorting and filtering. Please help!  Sincere thanks :)


As per  page of ALF,     ALF is an American sitcom that aired on NBC from September 22, 1986, to March 24, 1990.**      The title character is Gordon Shumway, a friendly extraterrestrial nicknamed ALF (an acronym for Alien Life Form), who crash lands in the garage of the suburban middle-class Tanner family. The series stars Max Wright as father Willie Tanner, Anne Schedeen as mother Kate Tanner, and Andrea Elson and Benji Gregory as their children, Lynn and Brian Tanner. ALF was performed by puppeteer Paul Fusco, who co-created the show with Tom Patchett.   in this drama some scenes their showing Alf's full body & his walking with his legs. Alf is shorter than 3ft.   So my question is when they shooting Alf's scene's did they used a Real person inside Alf's suite or did they used a Muppet all the time?

We all know and remember the 1980's family sitcom ALF. He is a cat-eating, food-loving alien from the planet Melmac.   One thing that I have always wondered: what exactly is ALF? He is not a puppet, because in some episodes, we see ALF's full body running and walking, and we see no strings. Is he a child in a costume, or a smaller man in a costume? Who or what exactly is ALF?


I would like to use Minor Conjuration to summon a flask of oil or alchemist's fire. Assuming  I keep the object within the spells range (10ft), am I allowed to light this conjured substance on fire and will it keep burning?  Although it is on fire it isn't really taking damage, it is being expended/used. Or if you interpret the bottle being shattered as damage then couldn't I just choose to summon a puddle of oil on the ground or above a creatures head? For example if I use this ability to create water or food does eating/drinking it dispel the conjuration? Or if created a torch could I not light the torch since that is the purpose of the object? Since the substance has to stay within 10ft of me and I would have to light it on fire with other means I don't believe that this would be an overpowered concept for a level 2 character.   Is this allowed within the scope of the RAW?

There are some clearly defined limitations already on the Wizard School of Conjuration's Minor Conjuration feature, however...  Does normal "wear and tear" count as damage?  (e.g. I'm in a fight without a weapon, and create, say, a dagger or club.  Will it hold up through the fight?).  How about a bottle of ink?  Does dipping my pen into it and writing a quick note "damage" the ink?  Is it one piece?  ( e.g., can I use it to make a temporary replacement for a set of Thieves' Tools (which is 'an item' on the equipment list) or is it limited to one contiguous item, such as a skillet, or a coil of rope?)


I tried to update my Ubuntu 14.04 to 16.04 and in the middle of the process the computer suffered a power down.  After turning it on again it was unstable, for example the screen wasn't the right resolution.  Trying to solve that I did run sudo apt-get update but the problem persisted. Also the top bar disappeared.  Then I tried to change the nvidia default drivers, selecting from the XOrg to another option. I didn't take a screenshot.  After that I couldn't access Ubuntu again. I tried turning the computer on again and getting into recovery mode, and the screen gets frozen and dead.  I tried rescatux as well, in order to fix GRUB in case it was an issue with that.  Now I have the computer turned on with the 14.04 live CD. I do have the hard drive mounted.  Is there any way to access any file in that drive and modify it in order to undo the selection of that Nvidia driver?  Or is there anything else that I could try?  Please take into consideration that I cannot access Ubuntu, so I cannot type anything into the terminal.

During the "install" phase of the upgrade there was a power failure. After when starting up again the following errors are reported:  init: udevtrigger main process (420) terminated with status 1 init: udevtrigger post-stop process (428) terminated with status 1 init: udevmonitor main process (419) killed by TERM signal The disk drive for / is not ready yet or not present Continue to wait; or press S to skip mounting or M for manual recovery   Pressing M gives me the following message:  Root filesystem check failed. A maintenance shell will now be started. CONTROL-D will terminate this shell and reboot the system.


Is there a way to integrate $1/f'(x)$ with regards to $x$, where $f'(x)$ is the first derivative of $f(x)$? Are there any rules/conditions which make it possible?

More specifically, I would like to know if there is a way I can express  $$\int \frac{x g'(x)}{f'(x)} dx $$  In terms of $f(x)$ and $g(x)$. Both $f(x)$ and $g(x)$ are non-negative and known to be increasing in $x$. If that helps.


I was rendering this scene (on cycles) to test out the lighting in my upcoming animation project but for some reason the render had blue stuff all over it, I tried to see if it had to do anything with the glossy floor reflection, or maybe the dark setting of the lighting. But I still got the same results. I also tried the same scene for eevee and the blue stuff was not there.

Since the Denoise feature was added to Blender I only use the default setting with it and it really does the work. But sometimes the denoise is noticable on some of my renders. How can I overcome the blurred effect? Denoising for me is a big help because my system is quite aged.


I need to query an SQL database to find all records with max RATE for each combination of fields A and B. For example, consider the following table with 4 columns, A, B, RATE & VALUE:  A B RATE VALUE = = ==== ===== a b 10   100 a b 2    110 a c 1    20 a c 3    55 a d 8    22 b c 3    10   I wish to get back one row from each distinct pair A & B with max RATE, getting these rows:  A B RATE VALUE = = ==== ===== a b 10   100 a c 3    55 a d 8    22 b c 3    10   How can I formulate such a query in SQL?

Let's say  this is the sample date coming from a join of 2 tables. Database is Postgres 9.6  id  product_id  invoice_id  amount       date 1    PROD1       INV01       2          01-01-2018 2    PROD2       INV02       3          01-01-2018 3    PROD1       INV01       2          05-01-2018 4    PROD1       INV03       1          05-01-2018 5    PROD2       INV02       3          08-01-2018 6    PROD2       INV04       4          08-01-2018   I want to know if it's possible in a optimized way to:   Get all the PRODx with their respective INVx which have the latest date, but per product_id. Please note that records unused from a day may be reported to a new one. This means:    id  product_id  invoice_id  amount       date 3    PROD1       INV01       2          05-01-2018 4    PROD1       INV03       1          05-01-2018 5    PROD2       INV02       3          08-01-2018 6    PROD2       INV04       4          08-01-2018     Get daily summed amounts for each PRODx but fill the gaps with the previous ones if day does not exist.   This means:   product_id    amount       date    PROD1         2          01-01-2018    PROD2         3          01-01-2018    PROD1         2          02-01-2018    PROD2         3          02-01-2018    PROD1         2          03-01-2018    PROD2         3          03-01-2018    PROD1         2          04-01-2018    PROD2         3          04-01-2018    PROD1         3          05-01-2018    PROD2         3          05-01-2018    PROD1         3          06-01-2018    PROD2         3          06-01-2018    PROD1         3          07-01-2018    PROD2         3          07-01-2018    PROD1         3          08-01-2018    PROD2         7          08-01-2018   A few thoughts:   For first question I could obtain the max(date) for each PRODx and the pick for each PRODx the rows that have the date=with max(date) but I was wondering if there's faster way to obtain this given a large number of recors in the database For the second question, I could generate a series of dates for the interval needed and then use WITH rows As and do the query grouping by product_id and sum by amount and then select for each date the previous values from rows with a limit 1 but that does not sound that optimized either.   Looking forward for any input. Thank you.  Later edit: Trying to give DISTINCT ON () a try.   If I have distinct on(product_id, invoice_id) then I don't get only the most recent ones for the most recent date. If there were invoice_ids in the the past, beside the latest date, then they will be returned If I have distinct on (product_id) then it returns from the most recent date, but as normal, only the last rows even if in the last day I have two positions for PROD1.    Basically I need something like 'I need for the most recent date, all the product_ids and their invoice_ids while keeping in mind that a product_id can have multiple invoice_ids'  Later edit 2:  Running a query like for first question seems to be reasonably fast:  select product_id, invoice_id, amount from mytable inner join myOtherTable on...              inner join (select max(date) as last_date, product_id                           from mytable                           group by product_id) sub on mytable.date =                           sub.last_date


I have a Debian Jessie VM in VirtualBox that I use for C++ programming. The primary virtual disk is set to be dynamically allocated 32GB. Over time, I have gradually used more space on the virtual disk, but recently I cleared my Bazel cache and removed other extraneous files.  Running df -h on the VM yields:  Filesystem Size Used Avail Use% Mounted on  /dev/sda1 31G 14G 15G 48% /  udev 10M 0 10M 0% /dev  tmpfs 403M 5.9M 397M 2% /run  tmpfs 1006M 68K 1006M 1% /dev/shm  tmpfs 5.0M 4.0K 5.0M 1% /run/lock  tmpfs 1006M 0 1006M 0% /sys/fs/cgroup  tmpfs 202M 4.0K 202M 1% /run/user/117  tmpfs 202M 8.0K 202M 1% /run/user/1000   From the command output, it appears as if I have only 14GB of space used on the virtual disk, but the VDI file still has a size of 24.2GB. Is there any way to shrink the VDI to the current size of the virtual disk?  EDIT: I have looked at the tools that were recommended by the other questions. None of them work for me, as I cannot figure out how to make zerofree run on my system and sfill -fvz (from secure-delete) only makes VirtualBox think the VM uses all of the 32 GB virtual disk. I don't know where to go from here.  Thanks, Neil

I have a Virtualbox VM, with a .vdi that is taking 49gb in the host machine.  I may have used that much space inside the VM once, but now I'm only really using about 6gb.  I tried this command for virtualbox:  vboxmanage modifyhd /path/to/disk.vdi --compact   It started working 0%..10%.....100%. But nothing really happened, the .vdi was still 49gb.  Then I run 'df -h' in the VM and found this:  root@mypc# df -h Filesystem                  Size  Used Avail Use% Mounted on /dev/mapper/mypc-root       2.0T   38G  1.9T   2% / udev                        1.3G  4.0K  1.3G   1% /dev tmpfs                       502M  784K  501M   1% /run none                        5.0M     0  5.0M   0% /run/lock none                        1.3G  160K  1.3G   1% /run/shm /dev/sda1                   228M   31M  185M  15% /boot /home/someuser/.Private     2.0T   38G  1.9T   2% /home/someuser   I don't know why it is using 38gb there.  I cleaned the Trash but it didn't help.  Any ideas on what else I can do?  The VM has Ubuntu 12, with encrypted LVM and home (that's the .Private dir). The host has Windows 7.  UPDATE  I was able to free space for /dev/sda1, but not for /dev/mapper/mypc-root. Zerofree starts and never ends, though I can tell the disk has stopped writting because it stops doing noise after a minute.  Here's the output for 'df -ih'  root@mypc:/home/someuser# df -ih Filesystem                 Inodes IUsed IFree IUse% Mounted on /dev/mapper/mypc-root        128M  208K  128M    1% / udev                         311K   495  310K    1% /dev tmpfs                        314K   428  314K    1% /run none                         314K     4  314K    1% /run/lock none                         314K     7  314K    1% /run/shm /dev/sda1                    122K   230  122K    1% /boot /home/someuser/.Private      128M  208K  128M    1% /home/someuser


As in the title:  If two real (square) matrices are conjugated over $\mathbb{C}$, are they then also conjugated over $\mathbb{R}$?

Given a field $F$ and a subfield $K$ of $F$. Let $A$, $B$ be $n\times n$ matrices such that all the entries of $A$ and $B$ are in $K$. Is it true that if $A$ is similar to $B$ in $F^{n\times n}$ then they are similar in $K^{n\times n}$?   Any help ... thanks!


This is the problem I found back in the first year in the university.  Suppose we have a non-degenerate (i.e. not a point and not an empty set) ellipse $E\subset \Bbb R^2$. Now define a set $D$ by a property $$(x,y)\in D\iff \text{tangent lines to }E \text{ through} (x,y)\text{ are orthogonal}.$$ We are to completely describe $D$ in terms of characteristics of $E$.  The answer is (don't look if you don't want spoilers)       that $D $ is a circle with the same center as $E$. Its radius is $\sqrt{a^2+b^2}$ where $a$ and $b$ are short and long radii of the ellipse.   The proof I found back then used coordinates and required a lot of boring algebraic maniplations. I wonder if there exist an elegant (definition of elegance is up to you) solution to this problem.

For a given ellipse, find the locus of all points P for which the two tangents are perpendicular.   I have a trigonometric proof that the locus is a circle, but I'd like a pure (synthetic) geometry proof.


It just interest me how, no matter what computer I put it in, whether it be running Windows, Mac or Linux, I can't seem to format it (I know that they're made to be write-once only). I'm guessing it's a hardware thing. But even so, what stops a computer from ignoring the rules and formatting the disc anyway?

I know it's kind of a dead / dying technology, but I was wondering what stops a CD-R from being rewritten like a CD-RW.   Is it some sort of firmware on the disc, essentially in place to make people buy more CDs?  Or is there a more technical reason, ie. CDs store their data magnetically (correct?) but CD-Rs have less magnetism, so once it has been written to, that's it? (Sorry if that's completely wrong; I have no idea how CDs work.)


The Opperman conjecture, is the statement that for every integer $x\geq 2$, there always exists a prime btween $x^2$ and $(x+1)^2$.  How about for every integer $n\geq 3$, is there always a prime between $x^n$ and $(x+1)^n$, $x\geq 2$ ?

I am looking at Dudley's proof of the existence of Mill's constant. It starts out as follows     The proof depends on the following theorem: there is an integer $A$ such that if $n>A$, then there is a prime $p$ such that   $$ n^3 < p < (n+1)^3 -1.$$   We will not prove this but we will use it to determine a sequence of primes$\ldots$   Where can I find a proof of this theorem?


I am new with Ubuntu.  I want to set up a local repository for Ubuntu 12.04 (Precise Pangolin), because I don't have Internet access on my laptop. I downloaded the repository using a local link (mirror ini Indonesia), but some of the repository is in error. What would be a link or similar for the download?

I would like to build my own local repository on my LAN, so that machines on the LAN can update and upgrade from it. I want to download the packages and store them on my local server so that I can update, upgrade, install, etc, from it without using the internet.


Sometimes, when you create a question which returns a lot of similar questions, it makes the height of the floating "Similiar Questions" box too big to fit on the page. As a result, it blocks some of the footer on the right hand side. It's actually doing it as I type this question.  I think a max height based on the view port - footerHeight should fix it.

I have noticed that while asking questions and scrolling to the bottom of the page, the right sidebar containing recent questions covers the footer partially. Also, a part of it goes beyond the browser's boundary. It may not be a big problem but it still doesn't look good.    This also happens on the  page


I have code that creates a csv mailing list for use in Excel 2013. My problem is that when the csv is clicked to open in Excel, the leading zero on zip codes is removed.   In older versions of Excel, you could add a single quote to denote that the cell should be treated as a string, but in the newer versions, the single quote is included. I've also tried double quotes and enclosing the zip code in single and double quotes with no luck.  I know that you can change the csv to a text file, and then manually import it into Excel, setting the zip column as a text column, but I would prefer make it easier on the end user.   Is there a way to import a number as a string from a csv in Excel 2013?

Does anyone happen to know if there is a token I can add to my csv for a certain field so Excel doesn't try to convert it to a date?  I'm trying to write a .csv file from my application and one of the values happens to look enough like a date that Excel is automatically converting it from text to a date.  I've tried putting all of my text fields (including the one that looks like a date) within double quotes, but that has no effect.


hi guys I have to prove this equality $$B_n=e^{-1}\sum_{k=0}^{\infty}\frac{k^n}{k!},$$ that is called bell equality only using induction on $n$ . How can i do this? I have tried by  substituting the recursive formula  $\sum\limits_{k=0}^{n} \binom{n}{k} B_{k}$ in the first one. But I am completely lost with indexes. I have already tried to search some informations on the internet but nothing using induction

As we know, Bell number can be given using two formula  $B_N=\sum_{k=0}^{N-1}C_{N-1}^{k}B_k$ (recursive)  $B_N=e^{-1}\sum_{k=0}^{\infty}\frac{k^N}{k!}$ (Dobinski's  formula)  Now I want to substitute Dobinski's  formula into recursive one to validate it is valid.  Here is what I do  $$ \begin{align} B_N&=\sum_{k=0}^{N-1}C_{N-1}^{k}B_k \\ &=\sum_{k=0}^{N-1}C_{N-1}^{k}(e^{-1}\sum_{i=0}^{\infty}\frac{i^k}{i!}) \\ &=e^{-1}\sum_{i=0}^{\infty}\frac{1}{i!}(\sum_{k=0}^{N-1}C_{N-1}^{k}i^k) \\ &=e^{-1}\sum_{i=0}^{\infty}\frac{(i+1)^{N-1}}{i!} \\ &=e^{-1}\sum_{i=0}^{\infty}\frac{(i+1)^N}{(i+1)!} \\ &=e^{-1}\sum_{k=0}^{\infty}\frac{(k+1)^N}{(k+1)!} \\ ?&=e^{-1}\sum_{k=0}^{\infty}\frac{k^N}{k!} \end{align} $$  But I have no idea how to deal with the line with a question sign? Thank you very much!


So I have the following three equations which I do not know how to solve:  -D * x - E * y = A + (R * D)  E * F * x - D * F * y - G * z = B - (R * E * F)  E * G * x - D * G * y + F * z = C - (R * E * G)  What is the solution for this? How do I get the values of x, y and z. The rest are constants.

Have to admit, I forgot how to do simple 9th grade algebra problems. I need to know how to do this stuff for an exam tomorrow.  I am doing recurrences and the only thing I need to do is find $a, b$, and $c$ from the following  $$\begin{align*} a + b + c &= 3\\ 4a + 2b+ c&= 6\\ 9a + 3b + c& = 13 \end{align*}$$  Can someone refresh my memory on how to solve for  $a, b$ and $c$ ?


Following interesting trigonometric series came into my mind when I solve another series problem.  $\sum\limits_{n=1}^{\infty}\underbrace{\sin \left ( \sin \left ( \sin \left ( \dots \sin \left ( \dfrac {\pi}{2} \right ) \dots \right ) \right ) \right )}_{n \text { number of } \sin \text { terms}}\\=\sin \left ( \dfrac {\pi}{2} \right )+\sin \left (  \sin \left ( \dfrac {\pi}{2} \right ) \right )+\sin \left ( \sin \left (  \sin \left ( \dfrac {\pi}{2} \right ) \right ) \right )+\dots\\=1+\sin \left (  \sin \left ( \dfrac {\pi}{2} \right ) \right )+\sin \left ( \sin \left (  \sin \left ( \dfrac {\pi}{2} \right ) \right ) \right )+\dots $  Since for each $x\in \mathbb {R}$, $-1\le \sin x \le 1$, $n$th term of the series is defined  and lies between minus one and plus one.  Do you have any idea about convergence of the series?  I believe that many of you have nice ideas and arguments. So please share with us. Thank you.

I thought about sequences, and I had an idea.     Let's define a sequence $(a_i)$ such that    $$a_0 = c \qquad\text{and}\qquad a_{n+1}=\sin a_n$$   where $c$ is arbitrary constant. Let's also define $$S_N := \sum_{i=0}^Na_i=c\;+\;\sin c\;+\;\sin\sin c\;+\;\cdots\;+\;\underbrace{\sin\sin\cdots\sin}_{N\text{ times}} c$$      Is $\lim_{N\to\infty} S_N$ convergent or divergent?   The problem is that I have no idea how I can, or if it is even possible to, determine $a_n$. Or if it is possible to show whether the sum converges.


I tried using Stirling's approximation and d'Alambert's ratio test but can't get the limit. Could someone show how to evaluate this limit?

I'm trying to find  $$\lim_{n\to\infty}\frac{n}{\sqrt[n]{n!}} .$$   I tried couple of methods: Stolz, Squeeze, D'Alambert  Thanks!  Edit: I can't use Stirling.


how would we determine the solution of  4x≡1 (mod 27)  which is specifically negative and closest to 0. I know we first get the gcd, but what do we do after that?

When I am faced with a simple linear congruence such as  $$9x \equiv 7 \pmod{13}$$ and I am working without any calculating aid handy, I tend to do something like the following:  "Notice" that adding $13$ on the right and subtracting $13x$ on the left gives: $$-4x \equiv 20 \pmod{13}$$  so that $$x \equiv -5 \equiv 8 \pmod{13}.$$  Clearly this process works and is easy to justify (apart from not having an algorithm for "noticing"), but my question is this: I have a vague recollection of reading somewhere this sort of process was the preferred method of C. F. Gauss, but I cannot find any evidence for this now, so does anyone know anything about this, or could provide a reference? (Or have I just imagined it all?)  I would also be interested to hear if anyone else does anything similar.


How do I set a global variable inside of a python function?

How can I create or use a global variable in a function?  If I create a global variable in one function, how can I use that global variable in another function? Do I need to store the global variable in a local variable of the function which needs its access?


I hear some people read days in names as non-ordinal numbers. Not sure if that is correct.   For example,  25 October is read as "twenty five October" or "twenty fifth October"? Or both?   I am looking for official rule, not slang or casual talk.

Investigations continue into the break-in at Gringotts on 31 July   . . . (Harry Potter and the Philosopher's Stone; Harry Potter and the   Sorcerer's Stone)      The first reader (Stephen Fry) says ‘the thirty first of July,’ and the second one (Jim Dale) ‘thirty one July.’ I’m confused whether the latter can be used or not. Would you tell me?


I need simple example of ARIMA model, that performs forecasting on a small time series set e.g., (x1,y1), (x2,y2), (x3,y3), (x4,y4), (x5,y5), (x6,y6)  I found many definitions from various places… but I couldn't find a solved example.

This may be hard to find, but I'd like to read a well-explained ARIMA example that   uses minimal math extends the discussion beyond building a model into using that model to forecast specific cases uses graphics as well as numerical results to characterize the fit between forecasted and actual values.


I want to rotate my model and I have X and Y rotations. Here is my code:  D3DXQUATERNION q, qrotation;  D3DXQuaternionRotationAxis(&q, &D3DXVECTOR3(1.0f, 0.0f, 0.0f), m_matrixRotX*0.0174532925f); qrotation = q;  D3DXQuaternionRotationAxis(&q, &D3DXVECTOR3(0.0f, 1.0f, 0.0f), m_matrixRotY*0.0174532925f); qrotation *= q;  D3DXMatrixRotationQuaternion(&worldMatrix, &qrotation);   But I get the same gimbal lock. What is the problem?   EDIT 1: OK, but how can I rotate my object if I have X Y and Z rotations?  EDIT 2: Here is all my code:   m_matrixRotY += (float)m_mouseStateX; m_matrixRotX += (float)m_mouseStateY; if (m_matrixRotY >= 360.0f)m_matrixRotY = 0.0f; if (m_matrixRotX >= 360.0f)m_matrixRotX = 0.0f;  D3DXQuaternionRotationYawPitchRoll(&qrotation, m_matrixRotY*0.0174532925f, m_matrixRotX*0.0174532925f, 0.0f);  D3DXMatrixRotationQuaternion(&worldMatrix, &qrotation);   I want to rotate my object in world static XYZ axis (world orientation not   local orientation). Each frame I get mouse x y states and add them to total rotation. Is it wrong that I am counting total rotation and then creating the quaternion from it?  NOTE: m_mouseStateX = current_mouse_state - previous_mouse_state

I am trying to write code with rotates an object.  I implemented it as:  Rotation about X-axis is given by the amount of change in y coordinates of a mouse and  Rotation about Y-axis is given by the amount of change in x coordinates of a mouse.  This method is simple and work fine until on the the axis coincides with Z-axis, in short a gimble lock occurs.  How can I utilize the rotation arount Z-axis to avoid gimbal lock.


I'm trying to fix an error with pagination of WP page Navi plugin. After I've added posts_per_page parameter to the query I'm getting 404 error when clicking on link page3,4 etc (there are 10 records totally) and after page 8 (where there around 60 records totally). Without this parameter it works fine but I want to display various number of posts under categories.   Here is the code of one of the pages I'm trying to fix:  $paged = (get_query_var('paged')) ? get_query_var('paged') : 1; query_posts($query_string .'&posts_per_page=5&paged=' . $paged); ?>  <?php if (have_posts()) : ?> <?php while (have_posts()) : the_post(); ?>
<a href="<?php echo get_permalink(); ?>"><?php the_title(); ?>
 <?php endwhile; ?> <?php else : ?> <?php _e('Sorry, no posts matched your criteria.'); ?>  <?php endif; ?>
 <?php if (function_exists('wp_pagenavi')){ wp_pagenavi(); } ?>   Any help is much appreciated.

I got a paged loop that pulls in 4 posts per page from custom post type. It works great, with the only downside that the pagination wont go over the page/20 everything after that is 404, and the posts_nav_link won't show the next arrow at all. Like the pages just aren't there.  In total there are 119 published posts in the custom post type. If I change posts_per_page to, say 6, then I get access to more of the posts from the end, but it also stops at the page/20.  On the production site the pagination stops at 21, I guess because the live database has more entries.  I got the "Blog pages show at most" setting set to 6.  Here's the loop I'm using:  <?php $paged = get_query_var('paged') ? get_query_var('paged') : 1; $args  = array(     'posts_per_page' => 4,     'orderby'        => 'modified',     'post_type'      => "projekte",     'paged'          => $paged ); $custom_query = new WP_Query($args); $c = 0; while($custom_query->have_posts()) :     $custom_query->the_post();     ?>     <article>...</article>     <?php endwhile; wp_reset_postdata(); // reset the query ?>   I've gone through the functions.php a million times looking for a some limiting get_pre_posts filter but there's nothing I can see.  I also got an error log setup and nothing is returned there, I've tested it that it works.  Any suggestions?


I am having problem with my WiFi connection.  Initially all is right.  This is my panel    This is the pop up menu    After certain time the net connection is gone  Then I disable and re enable WiFi as it works sometimes. But now even the Wi-Fi networks disappear.      Then I reboot my computer. Now everything is back to normal. My WiFi network auto connects.    How to fix this?  I am using Ubuntu 16.04  The output of my terminal command:  lspci -knn | grep Net -A2   is as given below:  09:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd.     RTL8723BE PCIe Wireless Network Adapter [10ec:b723] Subsystem: Lenovo RTL8723BE PCIe Wireless Network Adapter [17aa:b736] Kernel driver in use: rtl8723be Kernel modules: rtl8723be

I have installed Ubuntu 15.04 on my laptop with RTL8723BE Wi-fi card. But it is always disconnecting from network. I have tried echo "options rtl8723be fwlps=N ips=N" | sudo tee /etc/modprobe.d/rtl8723be.conf but that didn't helped. What can I do to prevent the wifi from disconnecting? If I upgrade to kernel 4.X, will it help?  ~$ lspci -knn | grep Net -A2  09:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter [10ec:b723]     Subsystem: Hewlett-Packard Company Device [103c:2231]     Kernel driver in use: rtl8723be   ~$ rfkill list 0: hci0: Bluetooth     Soft blocked: yes     Hard blocked: no 1: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no   ~$ ifconfig && iwconfig && route -n && ping -c 1 google.com eth0      Link encap:Ethernet  HWaddr 38:63:bb:cd:4a:7e             UP BROADCAST MULTICAST  MTU:1500  Metric:1           RX packets:3 errors:0 dropped:0 overruns:0 frame:0           TX packets:53 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:752 (752.0 B)  TX bytes:8445 (8.4 KB)  lo        Link encap:Local Loopback             inet addr:127.0.0.1  Mask:255.0.0.0           inet6 addr: ::1/128 Scope:Host           UP LOOPBACK RUNNING  MTU:65536  Metric:1           RX packets:3870 errors:0 dropped:0 overruns:0 frame:0           TX packets:3870 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:0            RX bytes:314613 (314.6 KB)  TX bytes:314613 (314.6 KB)  wlan0     Link encap:Ethernet  HWaddr c0:38:96:6d:c4:83             inet addr:192.168.1.205  Bcast:192.168.1.255  Mask:255.255.255.0           inet6 addr: fe80::c238:96ff:fe6d:c483/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:15240 errors:0 dropped:0 overruns:0 frame:0           TX packets:14627 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:14410285 (14.4 MB)  TX bytes:2192744 (2.1 MB)  eth0      no wireless extensions.  wlan0     IEEE 802.11bgn  ESSID:"DIR-615"             Mode:Managed  Frequency:2.437 GHz  Access Point: 00:90:4C:08:00:0D              Bit Rate=150 Mb/s   Tx-Power=20 dBm              Retry short limit:7   RTS thr=2347 B   Fragment thr:off           Power Management:off           Link Quality=70/70  Signal level=-22 dBm             Rx invalid nwid:0  Rx invalid crypt:0  Rx invalid frag:0           Tx excessive retries:0  Invalid misc:186   Missed beacon:0  lo        no wireless extensions.  Kernel IP routing table Destination     Gateway         Genmask         Flags Metric Ref    Use Iface 0.0.0.0         192.168.1.1     0.0.0.0         UG    400    0        0 wlan0 169.254.0.0     0.0.0.0         255.255.0.0     U     1000   0        0 wlan0 192.168.1.0     0.0.0.0         255.255.255.0   U     0      0        0 wlan0 PING google.com.Dlink (172.26.136.19) 56(84) bytes of data. 64 bytes from 19.136.26.172.in-addr.arpa (172.26.136.19): icmp_seq=1 ttl=249 time=102 ms  --- google.com.Dlink ping statistics --- 1 packets transmitted, 1 received, 0% packet loss, time 0ms rtt min/avg/max/mdev = 102.547/102.547/102.547/0.000 ms


I would like to be able to follow only one thread's execution while debugging. I use a threadpool so the debugger keeps switching between threads and this makes debugging very uncomfortable.  Reading:       I get one solution which is conditional breakpoints (based on the name of the thread). However, I can't tell "the thread #3" will always be the one treating the interesting case, so I would have to change the condition for each execution. Too much work.  Another solution is to use the freeze/thaw feature to make only my interesting thread run. However, this make some information unavailable because all threads are paused.  What I am using now is to put make the program run until I get to a breakpoint where I am sure to be in the good thread. Then I pause all other threads of threadpool and try to resume the execution. If the programs seems to be stuck, I pause, and thaw the current thread.  The ideal solution would to find the correct thread, flag it and then say to Visual Studio: "break only if the current thread is flagged".  Is this even possible ?

One thing that annoys me when debugging programs in Visual Studio (2005 in my case) is that when I use "step over" (by pressing F10) to execute to the next line of code, I often end up reaching that particular line of code in a totally different thread than the one I was looking at. This means that all the context of what I was doing was lost.  How do I work around this?  If this is possible to do in later versions of Visual Studio, I'd like to hear about it as well.  Setting a breakpoint on the next line of code which has a conditional to only break for this thread is not the answer I'm looking for since it is way too much work to be useful for me :)


As far as I can see, the feats from Essentials are way more powerful than their older counterparts. On the other hand, I see the Essential classes as weaker versions of the older ones (specially Fighter/Knight).  So, are those two supposed to be combined? They don't seem to be meant to be used together. I believe the powers shown in the new books are meant to be used since not even the classes from Essentials can use them, mostly, but the feats, I'm not so sure.  If you create a Knight with the Essentials feats, it might do fine, but a Fighter with the same feats might get a little overpowered, I believe.  Is there any official release about the matter?

In Heroes of the Fallen Lands many of the core feats have been streamlined, some paragon feats have become available to all levels.  Before that feats were tiered by level: heroic, paragon, epic.  Can a character that was made before the Heroes of the Fallen Lands publication use Heroes of the Fallen Lands feats?


I'm making an enemy in my game. He stands at the side of road with a rocket launcher and fires when you get close. It nearly all works fine, except I just need a reference to the players position so that I can make his rocket explode when it reaches the same height on the map as the player car.  The enemy is a prefab which is NOT instanced at build-time, there a several spawn-points all with n% chance of spawning a guy there using the prefab. The player IS instanced at build-time. And here is my problem..  Although I have put a "public GameObject player" into my variables in the script on the prefab, it doesnt let me drag the already instanced player into it. I've read about a bit, and I see that Unity will not allow this (or at least thats what I gathered!)  So after much searching I came up with   player = GameObject.FindGameObjectWithTag("Player");   But i havent even tested yet because the source where i got that advice in the very next comment the guy says I shouldnt do this because it takes too much system resources up.  EDIT: I have tested it with that line, it does work. But is there a better way  But he doesnt say the way that it should be done! And the thread is about 6 years old. So I thought I'd write here again and ask you fine folks for more help.  I hope I explained the problem clearly enough, I think i got the terminology right. Basically, the RocketerEnemy prefab is going to be instantiated in runtime, but the PlayerCar is already instantiated by my dragging it into the heirarchy at the beginning of the project. This is stopping me from dragging the PlayerCar object into the box in the Inspector (for the Enemy prefab) . All I really need is the PlayerCar.transform.position.Y value for each frame.  THANKS IN ADVANCE !

I'm creating a game where I have an Entity class that contains basic entity info (pos, health,..) and some functions. Enemies and Player later on inherit from this class.   Public class Entity {  public Vector2 position; public float health; ,...   Lets say that I have a function like this inside the Entity class:  public GameObject movingIntoEnemy(Vector2 movingToPoint) {     foreach (GameObject go in GameObject.Find("GameMap").GetComponent<GameMap>().enemyList)     {         if (go.GetComponent<EnemyScript>().enemy.position == movingToPoint)         {             return go;         }     }     return null; }   This function looks for a GameObject called "GameMap" and then cycles through enemies in it's list. If an enemy is found, it returns it's GameObject. Using GameObject.Find() is pretty ineffective, so what would be a better approach to this? I mean, I can't just easily use  public GameObject GameMap;   since the code is in a class, and this class needs to be instantiated first in my player/enemy scripts.  My question is - how do I attach gameObjects to this class before it is even created? What is the appropriate approach to this? I guess that I might pass these GameObjects to the class through it's constructor, but it would make things much more complicated.   Thanks in advance ;)


I have a very vague recollection of a short story in which somehow the parts of a spaceship were aliens of different races, whose innate powers allowed them to perform a function (braking, steering...). The end revelation is about the nature of the ship's accelerator.  Any bell ringing?

The plot is about:   A spaceship travelling through the universe Earth is a rogue planet whose inhabitants have been cut off and don't realise that their true purpose is to be part of the spaceship   The reason earth was in turmoil (wars etc.) was that they didn't realise that their true role was to fit into the ship  The ship contained 3 or 4 beings that made the thing work Planets throughout the universe are populated with the various beings which are components of the space craft   I seem to remember like an eye shaped being Each of them fulfil their role Humans are part of that as well.  There are loads of planets with humans on but earth has gotten overlooked so it never realised that's what they were designed for The story concludes with the ships picking up someone from Earth   and with the "human" realising that this is what they should really be doing  Humans have a different name that explains their role in the ship.   I probably read it around 30 years ago in English in a sci-fi collection book.


I run  pip install pelican markdown  I got this error message:  Exception: Traceback (most recent call last):   File "/usr/lib/python2.7/dist-packages/pip/basecommand.py", line 122, in main     status = self.run(options, args)   File "/usr/lib/python2.7/dist-packages/pip/commands/install.py", line 283, in run     requirement_set.install(install_options, global_options, root=options.root_path)   File "/usr/lib/python2.7/dist-packages/pip/req.py", line 1436, in install     requirement.install(install_options, global_options, *args, **kwargs)   File "/usr/lib/python2.7/dist-packages/pip/req.py", line 672, in install     self.move_wheel_files(self.source_dir, root=root)   File "/usr/lib/python2.7/dist-packages/pip/req.py", line 902, in move_wheel_files     pycompile=self.pycompile,   File "/usr/lib/python2.7/dist-packages/pip/wheel.py", line 206, in move_wheel_files     clobber(source, lib_dir, True)   File "/usr/lib/python2.7/dist-packages/pip/wheel.py", line 193, in clobber     os.makedirs(destsubdir)   File "/usr/lib/python2.7/os.py", line 157, in makedirs     mkdir(name, mode) OSError: [Errno 13] Permission denied: '/usr/local/lib/python2.7/dist-packages/pelican-3.6.3.dist-info'  Storing debug log for failure in /home/begueradj/.pip/pip.log   How to fix this?

When I used  pip install ipython   or  pip install "ipython[notebook]"   I get the following error:  Downloading/unpacking ipython   Downloading ipython-2.3.1-py27-none-any.whl (2.8MB): 2.8MB downloaded Installing collected packages: ipython Cleaning up... Exception: Traceback (most recent call last):   File "/usr/lib/python2.7/dist-packages/pip/basecommand.py", line 122, in main     status = self.run(options, args)   File "/usr/lib/python2.7/dist-packages/pip/commands/install.py", line 283, in run     requirement_set.install(install_options, global_options, root=options.root_path)   File "/usr/lib/python2.7/dist-packages/pip/req.py", line 1435, in install     requirement.install(install_options, global_options, *args, **kwargs)   File "/usr/lib/python2.7/dist-packages/pip/req.py", line 671, in install     self.move_wheel_files(self.source_dir, root=root)   File "/usr/lib/python2.7/dist-packages/pip/req.py", line 901, in move_wheel_files     pycompile=self.pycompile,   File "/usr/lib/python2.7/dist-packages/pip/wheel.py", line 206, in move_wheel_files     clobber(source, lib_dir, True)   File "/usr/lib/python2.7/dist-packages/pip/wheel.py", line 193, in clobber     os.makedirs(destsubdir)   File "/usr/lib/python2.7/os.py", line 157, in makedirs     mkdir(name, mode) OSError: [Errno 13] Permission denied: '/usr/local/lib/python2.7/dist-packages/IPython'  Storing debug log for failure in /home/username/.pip/pip.log   What does this error mean? How do I fix it?


I received the following message from Stack Overflow when I try and ask a question:  You have reached your question limit.  Sorry, we are no longer accepting questions from this account. See the Help Center to learn more.  After reading around on numerous posts, I am still not sure if this is a permanent IP address ban, or if I have a chance at getting my privilege back. I am new to programming and realize that I shouldn't have deleted some of the questions that I previously asked and that I need to be explicit in the questions that I post. I would love to get the privilege back and am willing to answer other questions to do so. I can't even comment yet as I must have a reputation of 50. I am willing to fix my questions and post answers in hopes of getting the question asking capability back, but I want to make sure this ban isn't permanent first.

If you are reading this, you may have been affected by one of our post quality bans. If so, it is important that you  to understand what has happened and how to regain the permissions that you lost. While trying to ask a question, one could see:  We are no longer accepting questions from this account. See  to learn more.  Likewise, for answers:  We are no longer accepting answers from this account. See  to learn more.   Why am I getting this message? Are deleted posts taken into account too? Is a question/answer ban the same as a suspension? How do I avoid getting a question ban? How long do I have to wait before I can post again? What can I do to release the ban? How can I reactivate my account? Can I simply create a new account? I'll just ask somewhere else on the SE network, and they'll migrate my question to the correct site! Will a ban on one Stack Exchange site affect my standing on other sites in the network? Does this apply to meta sites too? My account is in good standing. Why am I still blocked?


I'm not sure if this is the place to ask about graduate admission, so please let me know if the question is off-topic.  I'm currently in my senior year doing my undergraduate degree. I recently made the decision to pursue graduate studies (M.S. CS), but my GPA is a bit low. I will graduate with a double major degree in international relations and computer science. My major GPA will be 3.1/4.0 (cumulative 3.3/4.0), and so I decided to delay graduation an take another semester to raise my GPA (retaking a couple of courses and taking one new one) and also give me more time to prepare for graduate admission as I felt I was a bit too unprepared. After the extra semester (and assuming I do average to well) my major GPA will be 3.4/4.0.  I took the GRE and did well (163V / 169Q / 5.5 AW), but felt that I want to invest as much effort as I can (since this is the only time I'll have, to raise my undergraduate GPA) and then apply when I'm better prepared.  Does graduating late reflect poorly for graduate admission? I wanted to use that time and take advantage of the fact that I'm taking fewer courses during the semester to work on other projects as well.  Any feedback is appreciated. Thank you!

Would spending one more year as an undergraduate adversely affect my chances of getting into a graduate program?   I wasn't really thinking about economics PhD until recently so my GPA is not too impressive and I lack in math courses so I've decided to spend one more year to boost my GPA taking upper level courses and get a math minor.  However, could the very fact of spending one more year to finish college be a disadvantage of getting into a graduate program?


Is there any performance - difference between inner join and simple join?  i.e. does either of them have a better execution plan and/or execution time? And will both these approaches always yield same result sets?

Both these joins will give me the same results:  SELECT * FROM table JOIN otherTable ON table.ID = otherTable.FK   vs  SELECT * FROM table INNER JOIN otherTable ON table.ID = otherTable.FK   Is there any difference between the statements in performance or otherwise?   Does it differ between different SQL implementations?


I have the latest version of Blender installed (2.69) on Debian stable, and in System Preferences there is no CUDA (GPU) option for compute device. The graphics card is Nvidia GeForce 430. It supports CUDA 2.1, so according to the  it should work. Looks like the Nvidia driver is at the newest version. Is it a bug or am I missing something?  Update: Still no answer. I've looked into the driver more: it's the most recent repository version, but the driver on the Nvidia website is newer (mine is 304.88, theirs is 331.38). Does anybody run Blender on Linux with Nvidia drivers from repository (not nouveau but the manufacturer drivers)?  Anna  P.S. I've seen a couple other threads with a similar question but in  the problem was resolved when Blender v.2.69 was installed and in  the card in question was explicitly among the ones no longer supported.

I want to enable GPU rendering, but there is no option in User Preferences > System:    Why is this? How can I get cycles to render using my GPU?


I was given the equation of motion for a damped oscillator is   $$\frac{{\rm d}^2x}{{\rm d}t^2} + \frac{b}{m}\frac{{\rm d}x}{{\rm d}t} + \frac{k}{m}x= 0$$ and the solution of the motion equation is  $$x(t)=A \exp\left(-(b/2m)t\right)\cos(\omega t+\phi).$$ Now how do I go from the solution of the motion equation to this, while using the first and second derivative to solve: $$ω=\sqrt{\frac{k}{m} - \frac{b^2}{4 m^2}}.$$ I feel like I can do it just that I get confused on what is the derivative for A, $\omega$, and $\phi$. Any help will be appreciated thank you.

A damped harmonic oscillator with   $m = 10$kg, $k = 250$N/m, and       $c = 60$kg/s is subject to a driving force given by $F_0\cos(\omega t)$,   where       $F_0 = 48$N.       (a) What value of $\omega$ results in steady-state oscillations with maximum       amplitude?       (b) What is the maximum amplitude? What is the phase shift at the       resonance   Studying for my exam tomorrow, I am kinda of confused to how to even begin this problem. What does it mean by steady-state solution?   I know maximum amplitude occurs when velocity is zero.  The diff equation looks as follows: $$a + \frac{cv}{m} + \frac{kx}{m}$$  and thats all I know. Please do not give me the answer, but please tell me how I can approach this.


There are hints in 2014 Irish movie Calvary that the barman murdered Father James's dog, as explained in .  Why would the barman do this? I did not notice prior to this event indications that he held any grudges.

In John Michael McDonagh's wonderful philosophical black comedy , a good priest receives a death threat during a confessional giving him a week to sort out his affairs.   During the course of the week there are a lot of encounters between the priest and his parishioners, many acting as red herrings to distract the audience form the identity of the potential killer. Several threatening acts also take place: the church is burned and the priest's dog is killed.   But in the final encounter between the priest and the mystery antagonist (I'm not saying who to avoid spoilers) the antagonist admits burning the church but claims not to have killed the priest's dog.  Are they lying? Or is there a good reason that someone else might have killed the dog?


As you reach the end, you get 3 missions, each indicating that one of the 3 main factions (the NCR, Caesar's Legion and Mr. House) are watching you and if you continue to help the other 2 factions you'll be treated as an enemy and fail any remaining missions with those factions.  I am wondering, what is the last mission I can do for each of the main factions before they hate me? This would be under the assumption that I've done NCR and Legion side quests before triggering the Reputation Reset with them after I made contact with Mr. House.

Let's say I'm working the various quests in New Vegas, and am currently in the early stages of both  and the  quests.  What is the latest point in The House Always Wins that I can safely complete the Wild Card series, assuming I want to take control New Vegas?  (Note: I do plan on finishing off as many side quests as possible before going this route, so time is not exactly a factor here -- I just want to be sure I don't go so far down The House Always Wins that I'm unable to do the Wild Cards.)


If we are in a sequence space, then the $ l^{p} $-norm of the sequence $ \mathbf{x} = (x_{i})_{i \in \mathbb{N}} $ is $ \displaystyle \left( \sum_{i=1}^{\infty} |x_{i}|^{p} \right)^{1/p} $.  The $ l^{\infty} $-norm of $ \mathbf{x} $ is $ \displaystyle \sup_{i \in \mathbb{N}} |x_{i}| $.  Prove that the limit of the $ l^{p} $-norms is the $ l^{\infty} $-norm.  I saw an answer for $ L^{p} $-spaces, but I need one for $ l^{p} $-spaces. Besides, I didn’t really understand the $ L^{p} $-answer either.  Thanks for your help!

Could someone help me prove that given a finite measure space $(X, \mathcal{M}, \sigma)$ and a measurable function $f:X\to\mathbb{R}$ in $L^\infty$ and some $L^q$, $\displaystyle\lim_{p\to\infty}\|f\|_p=\|f\|_\infty$?    I don't know where to start.


Which one is correct, possibly both?  Try reducing your query and searching again Try reducing your query and search again

In written and standard semi-formal (and above) spoken English, one would use "try to":  Try to be a better person. Try to get the fishhook out of my thumb, please. Try to find a pharmacy when you need one.  But in spoken English, we (Americans, at least) usually substitute "try and" for all those cases. "Try to" makes sense because the "to" begins the construction of an infinitive: "try to be", "try to do", "try to act" and so on. "Try and" on the other hand doesn't seem to make any sense. I'm curious how the "try and" crept in, and when. It's really tough to Google small words like these, so I'm not finding anything on the Web. Is it a contraction of something like "Try hard, and ..."? Note: I've seen  and it is somewhat related but doesn't tell me what I want to know. Edit Observe how, even on this site,  construction. Turning it on its head Note that you can't make a negative construction with "try and":  It's raining. Try not to get wet. It's raining. Try not and get wet. [?]  Even adding do doesn't help. The following means something different from "try not to get wet."  It's raining. Don't try and get wet.  Even use of to instead of and there means something else:  It's raining. Don't try to get wet.  "Try not to get wet" means try to stay dry. "Don't try to get wet" means avoid actively seeking out a soaking, and implies that a soaking might in fact be what you are looking for. MORE I just happened to notice a video from an editor for Merriam-Webster on this very topic, so I include the link here: .


I want to return tow values from fallow method public  Double MyCalc(double a, double n)     {          a=a/2;         double d;         double m;         double l;         double q=0;         double af=0;      if (n <= 100000000)     {         d = n * 0.5 / 100;         af = (d * a / 100);         q = d;        // x1 = af;         return q;     }   I want return q and x1

I want to return two objects from a Java method and was wondering what could be a good way of doing so?  The possible ways I can think of are: return a HashMap (since the two Objects are related) or return an ArrayList of Object objects.  To be more precise, the two objects I want to return are (a) List of objects and (b) comma separated names of the same.  I want to return these two Objects from one method because I dont want to iterate through the list of objects to get the comma separated names (which I can do in the same loop in this method).  Somehow, returning a HashMap does not look a very elegant way of doing so.


What happens to items carried by familiars?  The Find Familiar spell says that as an action you can temporarily dismiss your familiar, and then on a second action make it reappear within 30 feet of you.  If my familiar had been carrying something, say a potion of healing, what happens to the potion when the familiar is dismissed and reappeared?

The Find Familiar spell states, in part:  As an action, you can temporarily dismiss your familiar. It disappears into a pocket dimension where it awaits your summons.  The question arising from this is:  Is this pocket dimension different for every familiar in the world? Thus being a personal pocket dimension? If this is true, then it should be able to store items given by its master for safe keeping away from anyone else, as long as these are items that a familiar could carry with it. Can the familiar bring small items with it into the pocket dimension for safe keeping?


Why do we write. He talks as if he were my master? Shouldn't the verb be singular in this case? And if not then why?

In which cases should I use the subjunctive mood?     I suggest that every applicant fill out the form carefully.        If she were rich, she would live on Long Island.


Let $f$ holomorophic function on $\{|z|<1\}$. Suppose $|f(\frac{1}{n})|\leq e^{-n}$ for $n=2,3,\dots $ ,then $f=0$.  If $f(\frac{1}{n})=0$, by identity theorem, $f=0$.But I cannot prove it.

Let $f$ be an entire function. Assume that $\mid f(1/n)\mid\le e^{-n}$ for all $n\in \mathbb{N}$. Show that $f$ vanishes identically.


Is there any way to get to the double "==" operator for a generic parameter?  Note that .Equals does not work correctly in all cases. Given: bool MyMethod<T>(T left, T right) {    return EqualityComparer.Default.Equals(left,right); }  Then: double a = double.NaN; double b = double.NaN; a == b; //returns false MyMethod(a,b); //returns true  I'd like to get to the actual "==" operator for all types of T.  Is that possible? I have read  and it does not address my situation because the best answer suggests using EqualityComparer.Default but that does not return the mathematically correct value when comparing two double.NaN values.

According to the documentation of the == operator in ,      For predefined value types, the   equality operator (==) returns true if   the values of its operands are equal,   false otherwise. For reference types   other than string, == returns true if   its two operands refer to the same   object. For the string type, ==   compares the values of the strings.   User-defined value types can overload   the == operator (see operator). So can   user-defined reference types, although   by default == behaves as described   above for both predefined and   user-defined reference types.   So why does this code snippet fail to compile?  bool Compare<T>(T x, T y) { return x == y; }   I get the error Operator '==' cannot be applied to operands of type 'T' and 'T'. I wonder why, since as far as I understand the == operator is predefined for all types?  Edit: Thanks, everybody. I didn't notice at first that the statement was about reference types only. I also thought that bit-by-bit comparison is provided for all value types, which I now know is not correct.  But, in case I'm using a reference type, would the == operator use the predefined reference comparison, or would it use the overloaded version of the operator if a type defined one?  Edit 2: Through trial and error, we learned that the == operator will use the predefined reference comparison when using an unrestricted generic type. Actually, the compiler will use the best method it can find for the restricted type argument, but will look no further. For example, the code below will always print true, even when Test.test<B>(new B(), new B()) is called:  class A { public static bool operator==(A x, A y) { return true; } } class B : A { public static bool operator==(B x, B y) { return false; } } class Test { void test<T>(T a, T b) where T : A { Console.WriteLine(a == b); } }


I have followed the '3 simple steps' to update my ESTA as I want to change the address for which I am staying at in the USA, however they just sent me a copy of my current ESTA with the old address on it and I can't find any option to update/change it. Does anybody know where this is or can help me at all?

I have an ESTA for my visit last Sept to NY and I know it is valid for 2years.  I am going to Las Vegas in May, do I have to update the address at which I will be staying?


*How can i make sure my validAccounts array does not have null values?**  This program is an ATM program that uses a text file and checks to see if the user's password and account number matches the possible passwords and balance from the text file    import java.util.*;  import java.io.*;   public class ATM2 {  public static Scanner kbd;  public static final int MAXSIZE = 60000;  public static void main(String[] args) {     kbd = new Scanner(System.in);     Scanner input = null;     String[] validAccounts = new String[MAXSIZE];     int lineNum = 1;     try {         input = new Scanner(new File("ATMdata.txt"));         // counts how many lines are in text         while (input.hasNextLine()) {             String line;             line = input.nextLine();             lineNum++;          }         // sets the array to the number of lines in text         validAccounts = new String[lineNum];         // prints out the number of lines in text         System.out.println(lineNum);          input.close();      }      catch (FileNotFoundException e) {         System.out.println("There was an error opening one of the files.");     }      try {          int count = 0;         input = new Scanner(new File("ATMdata.txt"));         // counts how many lines are in text         while (input.hasNextLine()) {             String line;             line = input.nextLine();              validAccounts[count] = line;             count++;          System.out.println(line);         }         input.close();      } catch (FileNotFoundException e) {         System.out.println("There was an error opening file");     }      System.out.println("What is your account number?");     String acctNum = kbd.nextLine();     System.out.println("What is the password?");     String pwd = kbd.nextLine();      checkID(acctNum,  pwd,validAccounts);     }  // Each entry in the validAccounts array is assumed to be holding: // the account number followed by // a space, followed by // the password for the account // followed by a space // followed by the current balance.  public static String checkID(String acctNum, String pwd,         String[] validAccounts) {     String account = "" ;     String password = "" ;     String balance;  String result = "error";  //This is supposed to check the array for a valid input for(int i = 0; i <validAccounts.length ; i ++){     **//It is giving me an error for the line below-if anyone could help me figure it           out!**     int space1 = validAccounts[i].indexOf(" ");//ERROR     account = validAccounts[i].substring(0, space1);     int space2 = validAccounts[i].indexOf(" ", space1 + 1);     password = validAccounts[i].substring(validAccounts[i].indexOf(" ") + 1, space2);     balance = validAccounts[i].substring(validAccounts[i].lastIndexOf(" ") + 1);  } if (acctNum.equals(account)){     return account; } if(pwd.equals(password)){     return password;   }       return result; }   }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I am struggling with the following last part of a problem. I have reduced everything to the following lemma which I can not prove. Let $$P(z) = a_{n} x^{n} + \cdots + a_{0}$$ a polynomial with real coefficients such that $0 \leq a_{0} \leq \cdots \leq a_{n}$. How can I prove that all the roots of $P(z)$ are contained in the circumference $|z|\leq 1$? Thank you all for your time.

Let $P(z)=a_0+a_1z+\cdots+a_nz^n$ be a polynomial whose coefficients satisfy $$0<a_0<a_1<\cdots<a_n.$$  I want to show that the roots of $P$ live in unit disc. The obvious idea is to use Rouche's theorem, but that doesn't quite work here, at least with the choice $f(z)=a_nz^n, g(z)=$ (the rest).  Any ideas?


I tried to install Microsoft Office on Linux with wine but it kept saying it encountered a program.

How can I get playonlinux to install Microsoft Office 2016. The options from the install menu only go up to 2013.   Is there a more recent version of PlayOnLinux (or indeed Wine) I can download to enable installation of MS Office 2016?  The steps I take are:   open PlayOnLinux  click Install Click Office returns a list of several software packages including MS Office 2007, 2010 and 2013 (but alas not 2016)


I'm using Ubuntu 16.04 and I cannot unset the http_proxy permanently. Every time I open a terminal window, it is restored to http://127.0.0.1:1080.  I have checked /etc/environment, ~/.profile, ~/.bashrc and the scripts inside /etc/profile.d but find nothing about proxy.  So now I want to know how to find out where-in which file-an environment variable is defined. I mean something like where http_proxy and it prints /etc/blahblah(the path of the file that defines http_proxy).

I have a Linux instance that I set up some time ago.  When I fire it up and log in as root there are some environment variables that I set up but I can't remember or find where they came from.     I've checked ~/.bash_profile, /etc/.bash_rc, and all the startup scripts.  I've run find and grep to no avail.   I feel like I must be forgetting to look in some place obvious. Is there a trick for figuring this out?


My problem is somewhat similar to  . I tried the answer given there but it didn't solve my problem.  The problem is that my figure goes too much into right, even though I have used \centering command. This problem only comes on compiling with XeLaTex and not with Latex; I don't know why. The MWE will illustrate this. Here is code:  \documentclass[14pt,a4paper]{extbook} \usepackage{float} \usepackage{graphicx} \usepackage[top=2.7cm, bottom=2.7cm, left=2.2cm, right=2.2cm]{geometry}  \begin{document} \date{}  123456789123456789123456789123456789123456789  \begin{figure*}[htbp]  \centering       \includegraphics [scale=0.5] {MWE.eps}  \caption{Using centering}  \end{figure*}  123456789123456789123456789123456789123456789  \begin{figure*}[htbp]  \centering  \vbox{\vspace{1.8em}\includegraphics [scale=0.5] {MWE.eps}}   \caption{Using centering and vbox and vspace\{1.8em\}}  \end{figure*}  123456789123456789123456789123456789123456789  \begin{figure*}[htbp]  \centering  \hbox{\hspace{-0.4em}\includegraphics [scale=0.5] {MWE.eps}}   \caption{Using centering and hbox and hspace\{-4em\}}  \end{figure*}  \end{document}   Here is the output using XeLatex (on windows)   Here is the output using Latex (on linux)   Here is the  which is used in the example:

I recently updated MikTex and it seems Xelatex is not able to place figures correctly anymore. Before updating all figures were shown correctly. I work with Texworks and Miktex 2.9  Here it is the code that I run:  \documentclass[10pt,a4paper]{report} \usepackage{graphicx} \graphicspath{{method1/}{method2/}{dpfig/}}  \begin{document}  \begin{figure}[!htbp] \centering \begin{tabular}{cc} \includegraphics[trim=6cm 2.5cm 6cm 2.5cm,clip=true,width=0.33\textwidth]{figure1.eps}& \includegraphics[trim=6cm 2.5cm 6cm 2.5cm,clip=true,width=0.33\textwidth]{figure2.eps}\\ \end{tabular} \caption{Two figures} \end{figure} \end{document} \end{figure}   With this code, figures are correctly trimmed and the relative position between figure 1 and figure 2 is maintained. However, the position in the document is wrong: figure are placed upper and more right than expected (as the bottom-left corner of the table was placed in the middle of the page). The unusual thing is that this does not happen in draft mode and picture are shown centered as it would be.  I usually compile with Xelatex, Makeindex and Bibtex.  I hope to have been clear.. bye!  EDIT: Sorry, I forgot to add the images I prepared from the file that run that script:


I am still a freshmen taking statistics and am disappointed with a second semester statistical theory course which just raves on from typical distributions to bi-variate random variables to random variable functions and Order Statistics.   I am mad with my teacher who pretty much expects the class to "remember" he theories and fails to explain their origin or source.    Although I am yet to learn Analysis or collegiate integral calculus for that matter I found this book "An Outline of Statistical Theory - Goon, Gupta, Dasgupta" which teaches probability from a measure theoretic perspective and am enjoying it. Although I don't get concepts like the Lebesgue-Stieltjes integral, I am however enjoying the rigor and the grassroot teaching of the book.  Looking for books on measure theory/ Probability that might further help me understand statistics properly instead of superficially. Any suggestions will be greatly appreciated..

To give you some background, I have a grasp on the basics of statistics and probability theory and even remember touching Bayes theorem at the university data mining course. But being a few years away from the university made my math got extremely rusty (so much for last-minute pre-exam cramming). While I remember various random basic concepts, there are a lot of gaps in my understanding of them.  What would be a good material (a book, a site, or otherwise equally accessible medium) to revise the fundamentals and go beyond basics? I'd like a book that can be actually read as a book (most statistics books are really dry and are close to being reference material, rather than a book).


I exported some tables in my mySQL database on my own server (localhost) to a web host using phpMyAdmin. The tables contain swedish special characters, and the CHARSET is set to latin1_swedish_ci. When imported, the characters look correctly in phpMyAdmin of the web host server, but when they are fetched and displayed on the web, there is a question mark (inside a diamond) instead of each special character.  If I update the data by fething the data into a form and then manually replace the question marks with the special characters and submit (thus updating the table), then the updated data shows correctly in the web when fetched.  But if I do the same thing but using the same update form on my own server where the fetched data displays correctly both in phpMyAdmin and web/localhost and setting the post attribute to the insert page on the web server, then that data does not display correctly (on the web).  I.e. this is the opposite problem of that explained in .   What might be wrong?  EDIT: As to the suggestion that using "UTF-8 all the way through" might solve the problem: My question more concerns how I might understand why a problem like this can occur. If the data looks ok in phpMyAdmin, does that mean that the problem lies simply in the fetching? Or might there still be something wrong with the data?

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I see a few sites use the hamburger menu in a web experience as a constant navigation element. I can understand using it when the browser window is reduced in width/height in a responsive manner but not so sure hiding your main navigation constantly is a great experience i.e.    Is this a design preference, a work around for non-responsive design sites or just plain wrong?

I'm working on a new version of a corporate website. As it stands, it has about 6 different sections. Each of those sections have between 3 to 6 sub-pages. My nav is at the top of the page and looks a bit like the wireframe below:         – Wireframes created with   I have made some simple dropdowns with js to handle the desktop side of things. For tablets and mobile devices I have gone with the standard right aligned hamburger menu button. The more I look at the site on a tablet, the more I like the lack of clutter at the top.  Apart from potentially confusing some users, what are the downsides of going with the hamburger menu for all devices?    and a number of other sites do this already.


How can a IP address have SSL Certificate with different issud to and not showing SSL error?    The above CloudFlare's site is HTTPS enabled and showing  in address bar. The certificate is issued to cloudflare-dns.com.

When I visit , any web browser I use considers the URL to be secure.  This is what Google Chrome shows:    Normally, when I try to visit an HTTPS site via its IP address, I get a security warning like this:    From my understanding, the site certificate needs to match the domain, but the Google Chrome Certificate Viewer does not show 1.1.1.1:     says:     No - we no longer accept certificate requests for either intranet names or IP addresses. This is an industry-wide standard, not one specific to GoDaddy.   (emphasis mine)  And also:     As a result, effective October 1, 2016, Certification Authorities (CAs) must revoke SSL certificates that use intranet names or IP addresses.   (emphasis mine)  And:     Instead of securing IP addresses and intranet names, you should reconfigure servers to use Fully Qualified Domain Names (FQDNs), such as www.coolexample.com.   (emphasis mine)  It's well after the mandatory revocation date 01 October 2016, yet the certificate for 1.1.1.1 was issued on 29 March 2018 (shown in the screenshot above).    How is it possible that all the major browsers think that  is a trusted HTTPS website?


I have this:   chmod u+x $(find scripts -name "*.sh")   But I believe it's only running chmod u+x for the first item in the list from find, since the results are newline separated.  How can I run chmod u+x for each item returned from the find call?  My guess is that xargs is the best way? something like this:   find scripts -name "*.sh" | xargs chmod u+x

How would one run a specific command for each file that was found by using the find command? For the purpose of the question lets say that I would simply like to delete each file found by find.


I have an a string like this  $size = "facebook_page [600x315]";   I want to extract   600x315  I tried this   preg_match('~[(.*?)]~', $size, $output);  print_r($output[1]);   It doesn't give me any output. Where am I going wrong? If there's another method it'd help a lot.

I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps.  It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps?


In LaTeX, I want to refer any article by using \cite{name} successfully. Now I want to cite the same article in my paper and also the citation is hyperlink with the original document. I tried with command \hyperref{} but not successful. Can anyone plz tell me to do so? Thanks.

It's cool to add a hyperlink in references like this:   I want to know how to add the blue box in bibtex. For example, the following article's link is "ee".   @inproceedings{DBLP:conf/osdi/DeanG04, author    = {Jeffrey Dean and            Sanjay Ghemawat}, title     = {MapReduce: Simplified Data Processing on Large Clusters}, booktitle = {OSDI}, year      = {2004}, ee        = {http://www.usenix.org/events/osdi04/tech/dean.html}, crossref  = {DBLP:conf/osdi/2004}, bibsource = {DBLP, http://dblp.uni-trier.de} }


I would like the limits to be vertically above and below the summation sign. I also need a larger summation sign... This is currently what I have:   $x^2sin(x) = \sum_{n=-\infty\atop n\ne \pm 1}^\infty \dfrac {4i(-1)^{n}n}{(n^2 - 1)^2} $   Any help appreciated!

I'm very familiar with how symbols display differently in inline mode (with $ ... $) vs. how display math shows them (with \[ ... \] or $$ ... $$).  Two examples would be with limits  $\lim_{n\rightarrow \infty}f(x)$   vs.  \[ \lim_{n\rightarrow \infty}f(x) \]   and with sums  $\sum_{n=1}^{x} n^2$   vs.  \[ \sum_{n=1}^{x} n^2 \]   My Question is:     How do you display these things in inline mode (with all the nice inline formatting) as if they were in display mode ?   The inverse -- how to display things in display mode as if they were in inline mode -- is also of interest.


I have a form where I want the values of text fields to be changed on select change event, I want to call the onchange event for the select field to calls a javascript function that gets values from database but its not working, need workable example according to this scenario (I am not familiar with AJAX/JSON/JSTL etc so I haven't used those).          (NEED WORKABLE EXAMPLE)            -----------------------------    Name   |                           |   (Select Field)           -----------------------------            -----------------------------    Price  |                           |   (Text Field)           -----------------------------            -----------------------------    Image  |                           |           |                           |           |                           |           |                           |           |                           |           -----------------------------                              <form name="product" method="post" action=".\GetProducts">

                                                                                <select class="form-control" name="orproductname" id="orproname" onchange="document.product.submit();">                                 <% ProductDAO pdr = new ProductDAO(); String[] kl = pdr.getProductNames();                                 for(int i=0;i<kl.length;i++) {%>                                 <option><% out.println(kl[i]); %></option>                                 <% } %>                                 </select>

                                                                                <input class="form-control" type="text" placeholder="Original Price" id="orproprice" name="orproductprice" required>

                          <input class="btn btn-primary send" style="width:200px; margin-right:20px" type="submit" value="Order">                         <input class="btn btn-primary send" style="width:200px" type="reset" value="Clear">                     </form>

I need to do an  request in JavaScript. What's the best way to do that?  I need to do this in a Mac OS X dashcode widget.


There's a well-known warning in gcc  warning: passing argument ... from incompatible pointer type [-Wincompatible-pointer-types]   and most often it occurs when trying to do something with parameter argv of function main.  I've read this answer:  . Ok, the C standard says so and the following code will compile with a warning:  int main(int argc, char *argv[]) {         const char * const * b = argv;         return b == 0; }   Not sure about C++, because g++ compiles same code without warnings.  Is there any reason behind this part of the standard? Can I do something bad after the cast, for example make argv point to non-writable memory?  This may be a duplicate of  , but Aaron's anwer is incorrect: read the comments.  Is Kevin's answer incorrect?  I'm thinking to add a convenience inline function like: const char * const *foo(char * const *a). Unlike C-style casts it would be type safe.

The following code snippet (correctly) gives a warning in C and an error in C++ (using gcc & g++ respectively, tested with versions 3.4.5 and 4.2.1; MSVC does not seem to care):  char **a; const char** b = a;   I can understand and accept this. The C++ solution to this problem is to change b to be a const char * const *, which disallows reassignment of the pointers and prevents you from circumventing const-correctness ().  char **a; const char* const* b = a;   However, in pure C, the corrected version (using const char * const *) still gives a warning, and I don't understand why. Is there a way to get around this without using a cast?  To clarify: 1) Why does this generate a warning in C?  It should be entirely const-safe, and the C++ compiler seems to recognize it as such. 2) What is the correct way to go about accepting this char** as a parameter while saying (and having the compiler enforce) that I will not be modifying the characters it points to? For example, if I wanted to write a function:  void f(const char* const* in) {   // Only reads the data from in, does not write to it }   And I wanted to invoke it on a char**, what would be the correct type for the parameter?


Can LaTeX natively include only specific expressions from an input file (ignoring the rest)? I am not sure how to best word my question. Below is an example of what I'd like to do.  Situation  For example, let's say I have many files with all kinds of code, but each one shares something in common, a summary environment.  I decide to create a document that contains summaries of all of the other documents. For a meaningful document, I need to get the name of the input file and include only the following code from the input:   \begin{summary} A bunch of text. \end{summary}   Here is a sample file structure:  Documents/   JimsAdventures.tex   CrazyGorilla.tex   BrightHorizon.tex   MoonLanding.tex   Summaries.tex <-- includes summaries of all other tex files and their file names   It would be great if Summaries.tex could automatically detect new files in the Documents folder such that it is completely automated (obviously that is a bonus and not really a criterion for the question).  I know this is possible with scripting languages by calling a shell script with the --shell-escape option combined with \immediate\write18 or \include{|myscript.sh}, but is this possible natively in LaTeX?    UPDATE June 30, 2015  Solution based on Werner's suggestion:  LaTeX does support this feature with the catchfilebetweentags package. What it does not support is getting a list of files (e.g. within the same folder) to input automatically (unless the only change between file names is a number: in which case you can use a sequence see ) .   To avoid using --shell-escape and maintain an OS-independent workflow, it is possible to achieve the same thing by creating a separate file (e.g. Documents.txt) that contains the names (or paths depending on whether you want to reconstruct paths with a macro or not) of the documents (stories). To have Summaries.tex automated, you can reference this file (e.g. Documents.txt) instead of having LaTeX generate it with --shell-escape + external script. Of course, 100% automation would require a system that runs a pre-compilation script that collects all of the tex files you want to include and spits them out into Documents.txt beforehand.  see

I would like to include part of the contents of a .tex file into a different .tex file. I don't have the option of modifying the file to include. The file to include may change so simply copying and pasting the part I need is not ideal.  Essentially, I'm wondering if there is something that would work like  \input[start-end]{file.tex}   where start and end are the first and last lines to include from the file?


I am currently porting a game from Cocos2d written in ObjectiveC to Cocos2d-x in C++. Now the objective C guys have used Reflection to populate modal classes from a json object. Is the same possible in C++ Can we use reflection in C++ ?   Kind Regards

This is a somewhat bizarre question. My objectives are to understand the language design decision and to identify the possibilities of reflection in C++.   Why C++ language committee did not go towards implementing reflection in the language? Is reflection too difficult in a language that does not run on a virtual machine (like java)? If one were to implement reflection for C++, what will be the challenges?   I guess the uses of reflection are well-known: editors can be more easily written, program code will be smaller, mocks can be generated for unit tests and so on. But it would be great if you could comment on uses of reflection too.


I have downloaded and installed emacs from the homepage and now want to unistall and reinstall it. When i do remove purge or autoremove the emacs icon is still to see at the sidebar left, but the terminal says that package emacs is not installed so not removed. How can i completely unistall emacs and all related data?

I used source code to build one package such as below:  ./configure --prefix=/usr --sysconfdir=/etc --localstatedir=/var --libexecdir=/usr/lib --with-package-name="Myplugin" --with-package-origin="http://www.ubuntu.org/" --enable-gtk-doc --disable-static make make install   But unfortunately, i discovered that its the latest version, and has lot of bugs, so i need to remove it/uninstall it. But how can i do so? I tried make clean; make uninstall but still i see it exist:  # pkg-config --list-all | grep Myplugin myplugin-.... $ ls /usr/lib/myplugin/libXYZ.so exist....   How do you remove this now?


I have two command buttons cancel, canceAll. I have two methods cancel, cancelAll in conteoller. How can i call actionfunctions from single javascript function based on the button clicked?  I tried like this but it is not saving, showing compilation error.  function cancelAllFunc(Clicked_Id){             var id = Clicked_Id.id;             if (confirm("--?") == true) {                 if(id='1') {                     cancelAllMethod();                 }                 else {                     cancelMethod();                 }             } else {              }           }  <apex:commandButton value="Cancel All" onclick="cancelAllFunc()" id="1"/> <apex:commandButton value="Cancel" onclick="cancelAllFunc()" id="2"/>  <apex:actionFunction name="cancelAllMethod" action="{!cancelAllMethod}" /> <apex:actionFunction name="cancelMethod" action="{!cancelMethod}" />

I have two function which needs to be called from one button. Currently I am doing this by creating two button one "Confirm" and another "Save". but I don't want two button I want only one button "Save", on click of Save first the method called by "Confirm" button should be called and then the method called by "Save" button.  Below is my code:  <apex:commandButton value="Confirm" action="{!save}"/>    <apex:commandButton value="Save" action="javascript:top.window.opener.closeFunction()" ></apex:commandbutton>


My private gmail account didnt recognize my password, answered all account recovery questions and it says it cannot recognize my account but i still have access to my email on my phone? I use this account for my business and need access. What can I do to get my account recovered?

I have forgotten the password or username for my Google account, or I'm unable to access my account for other reasons.  How can I recover my account?  (This Q&A is meant as a general description for all Google and Gmail username/password questions. See: )


is a feature of macOS that prevents unsigned applications from being launched. It can be disabled host-wide in System Preferences, or you can keep the protection in place and exempt a single application by right-clicking and choosing "open" which prompts a dialogue with the option to "launch anyway" (rather than simply double-clicking, which prompts a dialogue with no option to launch, only dismiss).  Forever after, that application will launch without issue. Gatekeeper has presumably whitelisted it. How can I revoke this exemption and remove the application from the whitelist after once approving it?   suggests consulting the manpage for spctl for more information. Going from there, I've tried spctl --disable <path to app>, spctl --remove <path to app>, and spctl --add --label disable <path to app>; spctl --disable --label disable, but the app still launches successfully when double-clicked in Finder.   suggests that spctl --remove <path to app> should have done the trick, and indeed after running that command, the application no longer shows up under the whitelist of exempted applications with spctl --list | grep <app name>. But the app still launches. How do I get this revocation to stick?

There are questions with good answers that explain how to remove the com.apple.quarantine extended attribute but I was wondering how does one restore / set it back again?  I tried this:  xattr -w com.apple.quarantine $VALUE /Applications/AnApp.app   but apparently not knowing what attribute's value should be this achieves nothing.  I guess it is all about the attribute's value, which is of the following format:  com.apple.quarantine: 0061;53822fd4;Google\x20Chrome;C1022EC2-E1B2-4896-AF74-B68F4BF97779   What I want to do is make Gatekeeper ask me again whether I want to run this app or file, or not. Restore the same behavior as if the file was just downloaded from the Internet and it is run for the first time.


It is not work for me, i want to convert date format to datetime of mysql format using php.i have try to obtain through the below code.what is wrong with my code         $travelDatesconv=strtotime($travelDate);       //15/03/2015           $travelDates=date('Y-m-d H:i:s',strtotime($travelDatesconv));              echo $travelDates."=>uu";                   //i need 2015-03-15 00:00:00

I have a datetime column in MySQL.   How can I convert it to the display as mm/dd/yy H:M (AM/PM) using PHP?


I have two users and groups in Unix: user1:user1 and user2:user2.  I have a directory myDirectory with below details (ls -ltr)  drwxr-xr-x.  4 user2 user2   35 Apr 27 10:16 myDirectory   Now, I am running a script, myScript.sh as user1:  #!/bin/sh  whoami  if [ -f /myDirectory/*.tar.gz ] then     rm -f /myDirectory/*.tar.gz fi  cp -f someDirectory/*.tar.gz /myDirectory/   However, I get the following error:  cp: cannot create regular file ‘/myDirectory/myTar.tar.gz’: Permission denied   What am I doing wrong? How can I fix this?

I have a couple of files that I want to move to another's user home directory. I don't have permissions to write to that user's home directory, but I know his password.  I know how to copy the file using scp (see ). However, if I want to move the file, copying and then removing the original file is inefficient. Is there a way to move the file, without using sudo (I don't know the root's password)?


Look that every text is displayed below the picture. I would like every text to be displayed perfectly in the center of the picture.  Here is the code:     body {   left: 8%;   top: 10%;   position: absolute;   background-color: #6699cc; }  .box3 {  background-color: #191919;  position: absolute;  padding: 15px 40px 15px;  font-size: 12px;  color: #DDDDDD;  font-family: Verdana;  font-size: 12px;  width: 400px; }  .box3 > li {  display: block; }  .box3 > li span {  display: inline-block;  vertical-align: middle; }

           Skype name

              Gadu-Gadu number

              Email address

            How do you make every text display perfectly in the center of the image?  I will be very grateful for effective help.

Why won't vertical-align: middle work?  And yet, vertical-align: top does work.   span{   vertical-align: middle; }
      Doesn't work.


I want an RSS feed for my  of my , an alternative or bonus would be an RSS feed for my "Achievements", so that I don't have to login to the website via a browser I have visited a few similar questions , ,  & many others without a solution. I also read about , but I don't know how to make it work for me. Is there a way I can generate an RSS feed, maybe say using a rss feed generator from another website?

Just wondering if I'm missing something here. Also, I couldn't find any previous question related to this.


Code which works with a single document  pdftotext *.pdf - | grep therapy   You can use find as described in the thread  but I would like to understand why the above command is not working.   Differential code where pdfgrep may add some benefit but still early in development   pdftotext *.pdf - | pdfgrep therapy #Wrong syntax so error # Usage: pdfgrep [OPTION]... PATTERN FILE... # Syntax Warning: Invalid Font Weight # Syntax Warning: Invalid Font Weight   I would like to get then a fast way to move to the specific pdf page if there is a good match.  However, I have not found any evidence that such a feature exists.   OS: Debian 8.5 Linux kernel: 4.6 backports Hardware: Asus Zenbook UX303UA Poppler-utils: pdftotext

Is there a way to search PDF files using grep, without converting to text first in Ubuntu?


How do I find this limit $ \lim \limits_{n \to \infty}(\dfrac{1}{n+1}+\dfrac{1}{n+2}.....\dfrac{1}{n+n})$  $(A)=\log_e1$  $(B)=\log_e2$  $(C)=\log_e3$  $(D)=\log_e4$  Please give me hint or something. What  i could see is $ \lim \limits_{n \to \infty}\dfrac{1}{n} \rightarrow 0 $ that is not even in the options.

For each positive integer $n$, let $x_n=1/(n+1)+1/(n+2)+\cdots+1/(2n)$. Prove that the sequence $(x_n)$ converges.   This is what I have so far..  Let $\epsilon > 0$ be given to us. We must show that there exists an $N \in \mathbb{N}$  such that $n\ge N \implies \left|\frac{1}{2n} - 1\right| < \epsilon$. Choose $N$ to be any positive integer which is larger than $\frac{1}{\epsilon}$. (So $N>\frac{1}{\epsilon}$.) Then $n\ge N \implies \left|\frac{1}{2n} - 1\right| = |\frac{1-2n}{2n}|$


I have a Czech Republic student visa, can I visit someone in Germany with my student visa or student ID? Or like do I have to apply for another visa?

I have requested for a French long term (Type D) student visa from a consulate in India. It's a national Type D visa and not a Schengen visa. My question is that can we still go to other Schengen countries on this visa? If not then can we get a Schengen visa from a consulate in France?


I read several questions about sabbatical leaves in this website. When checking a faculty list, it is common that some are on sabbatical leave and some are visiting professors. When emailing professors, it is not strange to receive a reply that he or she is on sabbatical leave.  However, the general picture of sabbatical visits is unclear to me. It is interesting to experience a new academic environment in a different country; but how do people handle it?   Cost of Living/Moving: When someone goes to another country, there are lots of unexpected expenses. High rent for a furnished house (for a year). They still have expenses in their home country (like mortgage). They will receive half of their salary from home the university and zero from the host university (not considering exceptions where getting paid for occasional tasks). Research Output: The professor cannot plan for a long-term research. Probably co-supervise some graduate students. Position: It is not clear to me what the place of a visiting professor is. In a research group, he is not a postdoc to follow the PI plans to get hand in experimental works, and he is not the boss to plan and conduct others. In a department, the head cannot force him to teach a course (it is not his duty), and the department has not offered him an official position, space and service for doing nothing. The vague point for me is that there is no official contract to define each party responsibility (as the host university is not paying).   How can one handle the expenses? And what is the professional motivation to do a temporary job (beside the fun part of going somewhere)?  Sorry for a series of questions, I could not separate them.

The  of sabbatical doesn't match how I think of an academic sabbatical. What does it mean to go on academic sabbatical, and does it depend on the country?


How does pricing with AWS works.  By exemple: 1024 Go of Data Transfer Out in their calculator () cost about 120$.  If you remove this 1024Go and move it in "Total Data Processed by all ELBs", it cost way less, about 30$.  Basically, my question is : Does you pay for transfer being sent from your EC2 to the visitor connected to the ELB? Which price is right?

This is a  about Licensing.    Questions on licensing are off-topic on Server Fault.  If your question has been closed as a duplicate of this question, then this is because we want to help you understand why licence questions are off topic rather than just telling you "it just is". In all likelihood, this question will not address your question directly, it was not meant to.    I have a question regarding software licensing. Can the Server Fault community please help with the following:   How many licenses do I need? Is this licensing configuration valid? What CALs do I need to be properly licensed? Can I run this product in a virtual environment? Can I downgrade this product to an earlier version? Am I entitled to feature X with license Y?


I am currently studying in class 10 and I am unable to do this problem. $$\tan 70 ° -\tan 20° -2 \tan 40° =4\tan 10°$$ Can anybody please help me.  Thanks!


On the  wiki, people present various form of padre approximant for $\sin{(x)}, \exp{(x)}$, erf$(x)$ but does not provide instruction on how to create them. What would be the correct way to find the Padé approximant for $\ln{(1+x)}$ ? Thank you very much !

Like $\log(1+x)$? Is there any algorithms? I have read many materials but doesn't have an idea


A paper describing grossone used to measure such things as the sierpinski carpet here:     I'd like to discuss the legitimacy of grossone. What is the general consensus in the mathematical world? Is it similar to the $\tau$ vs. $\pi$ debate that was entirely irrelevant? Or is it a legitimate solution to the long standing problems of calculations at infinity?    In the paper, he distinguishes between iterations of the sierpinski carpet, that are undistinguisable with the common notion of infinity.

The arXiv blog having chosen GrossOne for , I read the arXiv paper concerned, and posted a comment there. The arXiv blog used to be quite high profile as these things go.  Is there an existing well-known (but not to me) mathematical construction that does what Sergeyev proposes?


When I create a page in latex, below everything appears the nº of page: 1 , 2 ...  Its possible to show  the page number above the total page?  For example:   \documentclass[11pt,a4paper]{article}  \begin{document}   Hi % page 1  \newpage  Hi2 % page 2  \end{document}     Thanks.

I want to add a footer to my document displaying the current number out of total number of pages. How do I do that?


I get the following warnings whenever I run apt upgrade: W: Possible missing firmware /lib/firmware/i915/icl_dmc_ver1_09.bin for module i915 W: Possible missing firmware /lib/firmware/i915/tgl_dmc_ver2_04.bin for module i915 W: Possible missing firmware /lib/firmware/i915/skl_huc_2.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/bxt_huc_2.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/kbl_huc_4.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/glk_huc_4.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/kbl_huc_4.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/cml_huc_4.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/cml_guc_33.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/icl_huc_9.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/ehl_huc_9.0.0.bin for module i915 W: Possible missing firmware /lib/firmware/i915/ehl_guc_33.0.4.bin for module i915 W: Possible missing firmware /lib/firmware/i915/tgl_huc_7.0.3.bin for module i915 W: Possible missing firmware /lib/firmware/i915/tgl_guc_35.2.0.bin for module i915

I am getting these warnings every time I update my initramfs image(-s) with  on my Dell PowerEdge T20 server running    10.0. Is there a fix?    W: Possible missing firmware /lib/firmware/i915/bxt_dmc_ver1_07.bin for module i915 W: Possible missing firmware /lib/firmware/i915/skl_dmc_ver1_27.bin for module i915 W: Possible missing firmware /lib/firmware/i915/kbl_dmc_ver1_04.bin for module i915 W: Possible missing firmware /lib/firmware/i915/cnl_dmc_ver1_07.bin for module i915 W: Possible missing firmware /lib/firmware/i915/glk_dmc_ver1_04.bin for module i915 W: Possible missing firmware /lib/firmware/i915/kbl_guc_ver9_39.bin for module i915 W: Possible missing firmware /lib/firmware/i915/bxt_guc_ver9_29.bin for module i915 W: Possible missing firmware /lib/firmware/i915/skl_guc_ver9_33.bin for module i915 W: Possible missing firmware /lib/firmware/i915/kbl_huc_ver02_00_1810.bin for module i915 W: Possible missing firmware /lib/firmware/i915/bxt_huc_ver01_07_1398.bin for module i915 W: Possible missing firmware /lib/firmware/i915/skl_huc_ver01_07_1398.bin for module i915


With String[] args, I can get input on run, But how to set custom parameter for each input like:  -c for cat name, -d for dog name  so that I can run java abc.jar -c myCat -d myDog or java abc.jar -d myDog -c myCat

What is a good way of parsing command line arguments in Java?