wp_insert_post fails at return statement (nothing is returned to the caller, the error displayed is: The Link You Followed Has Expired)

there is a WooCommerce site where we try to add the Wholesale Pro plugin, which upon activation creates two pages (login, store). For this task it calls the wp_insert_post from a static method. The wp_insert_post does its stuff, and we even log every part of the wp_insert_post procedure to debug.log, comes down to return statement and then the WordPress fails with "The Link You Followed Has Expired" on the plugins.php screen. The return statement returns nothing to the caller static method, but the page/post is created in wp_posts table.

The plugin itself is proven to activate and work properly on another site.

Why is this language *not* pumpable? (language = arbitrary word followed by exact same arbitrary word)(pumping lemma for context-free-languages)

1 language = arbitrary word followed by exact same arbitrary word = u * u (with u being out of non-empty words of alphabet {0, 1} )
(sorry for the formatting, see screenshot-link for conventional/clear expression)

The purpose is to prove that the given language is not a context-free-language (using the pumping lemma).

So i thought that this language should definitely be pumpable, since you can choose x and z as corresponding parts in one of the u/"halves". So if word to be pumped is "0101" then you choose e.g. x=1 (0101) and z=1 (0101) and the remaining parts that stay static are assigned with u=0 (0101), y=0(0101), and v=empty.
If pumped zero-times/i=0 word reads: 00
i=1: 0101
i=2: 011011
i=3: 01110111
(and so on)

(For more complicated words you would need to use all three (u, y, v), but the basic principle would still be that x and z are assigned corresponding parts of the word and u,y,v would be assigned the remainder. (This doesn’t work for the extremely small words 00,01,10,11 that would become empty when zero-pumped, but as long as the exceptions are finite / of finite/fixed number this isn’t a problem AFAIU.)
Clearly this is wrong, but can anybody explain how/why?

Mathamatica: soln=NDSolve[{pde,u[x],{x}” cannot be followed by

I try to solve this third order PDE using Mathematica wolframscript in Linux:

   In[37]:= pde=I*D3[u[x],x]+e^{x^2}*D[u[x],x]==D[u[x],x]                                                        2                            x Out[37]= {I D3[u[x], x] + e   u'[x]} == u'[x]  In[38]:= soln=NDSolve[{pde,u[x],{x}], u[0]==0, u'[0]==1, u''[0]==-1, u'''[0]==0} , u[x],x]                                                   

But I get the following error:

Syntax::sntxf: "soln=NDSolve[{pde,u[x],{x}" cannot be followed by      "], u[0]==0, u'[0]==1, u''[0]==-1, u'''[0]==0}, u[x],x]". 

I see that something is wrong here, but what is it, is it the formatting or is it the initial conditions typing?


How can divide by 2 blocksize bubblesort followed by a final mergesort be optimized in a particular environment?

I am wondering if we had a large array to sort (let’s say 1,048,576 random integers), chosen because it is a perfect power of 2, if we can just keep dividing those blocks into smaller and smaller half size blocks, how would someone know (on a particular computer using a particular language and complier) what the ideal blocksize would be to get the best actual runtime speed using mergesort to put them all back together? For example, what if someone had 1024 sorted blocks of size 1024, but it could that be beaten by some other combination? Is there anyway to predict this or someone has to just code them and try them all and pick the best? Perhaps for simplicity they would want to use some simple bubblesort on the 1024 size blocks, then merge them all together at the end using mergesort. Of course the mergesort portion would only work on 2 sorted blocks at a time, merging them into 1 larger sorted block.

Also, what about the time complexity analysis on something like this? Would all divide and conquer variations of this be of the same time complexity? The 2 extremes would be 2 sorted blocks (of size 524,288) or 1,048,576 “sorted” blocks of size 1, handed over to a merge process at that point.

Getting list of followed sites for a specific user

There is an undocumented API /_vti_bin/homeapi.ashx/sites/followed that returns the list of followed sites for the currently logged in user.


Is there a way to retrieve the list of followed sites for a specific user using REST API, Graph or some other way?


We are going to need to write a crawler that runs every day and for every user in Office 365, gets the list of followed sites. This will later be used for a separate email notifications feature. But first, I am trying to understand if it’s even possible to get users’ followed sites.

Any help will be greatly appreciated!

Unable to get driver to recognize NVIDIA GPU when I followed instructions for tensorflow install for 18.04

I am following the instructions here https://www.tensorflow.org/install/gpu

My output for nvidia-smi was “No devices were found.” However when I run lspci -vv | grep NVI I get

0a:00.0 VGA compatible controller: NVIDIA Corporation Device 1f06 (rev a1) (prog-if 00 [VGA controller]) 0a:00.1 Audio device: NVIDIA Corporation Device 10f9 (rev a1) 0a:00.2 USB controller: NVIDIA Corporation Device 1ada (rev a1) (prog-if 30 [XHCI]) 0a:00.3 Serial bus controller [0c80]: NVIDIA Corporation Device 1adb (rev a1)

When I run the bug report, nvidia-bug-report-sh Iget this


One thing that stood out to me was the fact that it says

ERROR: Kernel configuration is invalid."; \ echo >&2 " include/generated/autoconf.h or include/config/auto.conf are missing.";\ echo >&2 " Run 'make oldconfig && make prepare' on kernel src to fix it.";

I am unsure of how to do that or if it will fix the problem.