Data validation dropdown list problem in Microsoft Excel

In my Excel sheet, I have two columns. In the 2nd column, the values ​​of the 1st column (with duplicates) are displayed as a drop-down list with the help of data validation.
On the first column, the values ​​are "A", "A", "B", "C", "A", "A", "D". Please check the attached screen shot.

enter the description of the image here

The problem is:
On the drop-down menu, if I select a duplicate letter "A" except the first one, it only takes the first letter "A", which is displayed on the first column of the first row.
I wanted to select the particular duplicate "A" on 4 duplicate

Please suggest me the solution.

Thank you

directx – Object Matrix Problem in Direct3D11

I have a problem with the transformation matrix of my cube. When I change my position (global matrix) and rotate the camera, it becomes distorted.

Cube deformation bug

Here is my shader update code:

void IShader :: UpdateShader ()
{
XMMATRIX view = XMLoadFloat4x4 (& m_viewMtx); // The view matrix of the camera (using XMMatrixLookAt ())
XMMATRIX persp = XMLoadFloat4x4 (& m_perspMtx); // The perspective matrix of the camera
XMMATRIX world = XMLoadFloat4x4 (geo-> GetWorldMatrix ()); // Here, get the world position of the cube (it is updated with the help of the keyboard input of another class)
// GetWorldMatrix () returns m_worldMtx

XMMATRIX m = view * persp * world;

m = XMMatrixTranspose (m);

VERTEX_BASIC_CONSTANT_t k;
k.mWorldViewPersp = m; // The vertex shader contains only one float4x4 in the cbuffer ...

D3D11_MAPPED_SUBRESOURCE map;
memset (& map, 0, sizeof (map));

ID3D11Buffer * context = sh-> GetVSCBuffer ();
m_pD3DCtx-> Card (
the context,
0
D3D11_MAP_WRITE_DISCARD,
0
&map
)

memcpy (map.pData, & k, sizeof (k));

m_pD3DCtx-> Unmap (
the context,
0
)
}

Here's how I update the cube position:

void Geo :: UpdatePos (VEC3 offset)
{
XMMATRIX t = XMMatrixTranslation (offset.x, offset.y, offset.z);

XMStoreFloat4x4 (& m_worldMtx, t);
}

This problem of deformation concerns only the cube, not the ground.

computational complexity – Calculate the amount of FLOP for an eigenvalue problem solver

I have 2 complex and unsymmetrical matrices $ A_ {1000×1000} $, $ B_ {1000×1000} $ and I use Matlab to get its own values ​​(functions like eig or eigs). The two matrices are different – one is denser and the other has more complex values. To compare the complexity of the eigenvalue resolution process for both matrices, I would like to calculate the amount of FLOP needed for this procedure. Of course, it is possible to calculate the time required for the resolver of eigenvalues ​​to carry out its task, but this is extremely unstable, because many processes in the background are likely to generate noise.

In Matlab, no function allows me to get FLOPs for wigs but I could use another software because the only thing I need are these dice $ A, B $ which can be exported. Does anyone have any idea of ​​how I could reach my goal?

Tell Google about an Android development problem or ask to implement a feature

This question is for Android developers or experts.

I have to officially ask Google to solve a development problem (see the SO questions on the link below).

https://stackoverflow.com/questions/56539920/storage-access-framework-doesnt-show-cloud-roots-when-using-action-open-documen

https://stackoverflow.com/questions/56664638/storage-access-framework-does-the-file-picker-app-not-imotment-action-open-do

I do not know what is the right place / way to do it.

I mean, I do not know whether to ask for a feature or file a bug fix request (and where). There could also be other possibilities.

What do I have to do?

complexity theory – Is there a deterministic algorithm for a randomized algorithm for a problem?

If the runtime of the algorithm is limited, in that for each entry $ x $ there is a number $ T (x) $ so that whatever the coin throws, the algorithm always ends in $ T (x) $ Step by step, you can always "try all possibilities" and convert your randomized algorithm into a deterministic algorithm, albeit with a much longer runtime.

For polynomial time algorithms in particular, it is assumed that you can discard any algorithm with at most a polynomial swelling in time, conjecture usually defined as follows: $ mathsf {P} = mathsf {BPP} $.

php – How can I solve the problem of htaccess making social robots see the answer 404 even if the page displays correctly?

I'm using the htaccess code below that seems to work correctly to rewrite the URLs. However, when a page is shared on social networks or scanned by bots such as AHREF, they all return 404 and yet the pages of the site display correctly, and when I print http_response_code () on one page, the answer value is 200.





RewriteEngine on

#RewriteBase /

RewriteCond% {REQUEST_FILENAME} -d
RewriteRule ^ (. +[^/]) $ 1 / [R]

RewriteCond% {REQUEST_FILENAME}! -F
RewriteCond% {REQUEST_FILENAME}! -D

RewriteCond $ 0 #% {REQUEST_URI} ([^#]*) # (. *)  1 $
RewriteRule ^. * $% 2index.php [QSA,L]

The long URL being rewritten

index.php? component = publications & view = post & category = 15-blog & post = 31-comment-blog-well & menuid = 25-blog

The rewritten URL

/ the-blog / how-blog-well

PHP functions that process URLs

/ *
Process URLs as sent from links, before converting them to SEF
recover $ _GET[] values ​​to use in database queries and
other instructions
* /

getNonSEF () function
{
$ path = pathinfo (currenturl ());
$ filename = $ path['filename'];
$ dirnames = explode (& # 39; / #, $ path['dirname'])
preg_match (#[^/]+ $ # i, $ path['dirname'], $ match);


// product detail and message display
if ($ path['dirname']. & # 39; / & # 39; == ROOT_URL)
{
$ postid = posts () -> where (& quot; alias & quot ;, getCurrentFilename ()) -> value (& # 39; id & # 39;);
$ cat_id = categories () -> where (& quot; alias & quot ;, getCurrentFilename ()) -> value (& # 39; id;);

$ groupval = getDbo (& # 39; mod_cmse_products & # 39;) -> select (& # 39; group_id & # 39; group_alias & # 39;) -> where (& # 39; group_alias & # 39 ;, $ filename) -> get ()[0];

if (! empty ($ postid)) {
$ queryurl = parse_url (menus () -> where ([['type', 3], ['src_id', $postid]]) -> value (& # 39; url & # 39;))['query'];
}other
if (! empty ($ cat_id)) {
$ url = menus () -> where ([['src_id', $cat_id], ['type', 2]]) -> value (& # 39; url & # 39;);
if (! empty ($ url)) {
$ queryurl = parse_url ($ url)['query'];
}other{
// the category has no menu item
$ queryurl = & # 39; component = posts & view = category & category = & # 39; $ ID_Cat. & # 39; - & # 39 ;. getCurrentFilename ();
}
}other
// product category
if ($ filename == $ groupval-> group_alias) {
$ queryurl = <component = products & view = productgroup & gid = & # 39; $ groupval-> group_id. - - #. $ groupval-> group_alias;
//}other
//index.php?component=products&view=productgroups&menuid=25-all-services
// if (in_array ($ filename, menus () -> where (& # 39; type, 5) -> pluck (& ​​quot; alias & quot;)))) {
// $ queryurl = parse_url (menus () -> where (& quot; alias & quot ;, getCurrentFilename ()) -> value (& quot; url & quot;)['query'];
}other{
$ queryurl = parse_url (menus () -> where (& quot; alias & quot ;, getCurrentFilename ()) -> value (& quot; url & quot;)['query'];
}

}other

{
// if the view is posted and has a category alias in the URL but has no menu assigned
$ postval = posts () -> select ('id', 'catid', 'alias') -> where (& # 39; $ filename) -> get ()[0];

$ prodval = getDbo (& # 39; mod_cmse_products & # 39;)
-> select (& # 39; prod_alias & # 39 ;, & # 39; prod_id & # 39 ;, & # 39; prod_gid & # 39;)
-> where (& # 39; prod_alias & # 39 ;, $ filename)
-> get ()[0];

if ($ filename == $ postval-> alias) {
$ posturl = menus () -> select ('id', 'url', 'src_id') -> where ([['src_id', $postval->catid],['type', 2]]) -> get ()[0];
parse_str (parse_url ($ posturl-> url)['query']$ urlparts);

$ queryurl = & # 39; component = & # 39; $ urlparts['component']. & # 39; & view = post & category = & # 39; $ urlparts['category']. & # 39; & post = & # 39 ;. $ postval-> id. - #. $ way['filename']. & # 39; & menuid = & # 39; $ urlparts['menuid'];
}other

// component is a product
if ($ filename == $ prodval-> prod_alias) {
$ prodgroup = getDbo (& # 39; mod_cmse_products & # 39;) -> where (& # 39; group_id & # 39 ;, prodval-> prod_gid) -> value (& # 39; group_alias & # 39;);
$ queryurl = <component = products & view = productdetail & gid = & # 39; $ prodval-> prod_gid. & # 39; - & # 39; $ prodgroup. & # 39; & pid = & # 39; $ prodval-> prod_id. & # 39; - & # 39; $ prodval-> prod_alias;
}

}


$ queryurl = html_entity_decode ($ queryurl);


// retrieve the elements of the query
$ view = getInput ($ queryurl, & view;
$ category = getInput ($ queryurl, & # 39; category);
$ post = getInput ($ queryurl, & # 39; post);
$ menuid = str_replace (- ',', (int) getInput ($ queryurl, 'menuid');
$ listpage = getInput ($ queryurl, & # 39; listpage & # 39;)
$ prodid = getInput ($ queryurl, & ppp;);
$ groupid = getInput ($ queryurl, & gid; gid & # 39;)
$ parent = $ match[0];

// registered components
$ com_posts = ['post', 'category', 'categories'];
$ com_product = ['productdetail', 'productgroup', 'productgroups'];

// the decision maker (roger)
if (in_array ($ view, $ com_product)) {
$ component = "products";
}other
if (in_array ($ view, $ com_posts)) {
$ component = & # 39; posts & # 39 ;;
}

$ list = [$component, $view, $category, $post, $menuid, $listpage, $prodid, $groupid, $parent];

return $ list;
}


/ *
router that encapsulates the URL in the files
for example: <a href = "catid. - & # 39 ;. $ cat-> alias. & # 39; & post = & # 39; $ post-> id. & # 39; & # 39; & # 39; $ post-> alias. & # 39; & menuid = & # 39; $ menuid); ?> "> See the message
* /

function router ($ url)
{
$ shares = parse_url (ROOT_URL. $ url);
parse_str ($ shares['query']$ q);

$ component = $ q['component'];
$ view = $ q['view'];
$ category = $ q['category'];
$ post = $ q['post'];
$ menuid = $ q['menuid'];
$ prodgroup = $ q['gid'];
$ prodid = $ q['pid'];


if (isset ($ component))
{
if ($ view == & post; && isset ($ post) &&! isset ($ category) && isset ($ menuid)) {
$ num = (int) $ post;
$ route = str_replace ($ num. - & # 39;, #,; post);
}other
// publications without a menu ID use a category alias in the URL
if ($ view == & post; && isset ($ post) && isset ($ category)) {
$ num = (int) $ post;
$ nums = (int) $ category;
$ route = str_replace ($ nums. - #, & # 39;, # category). & # 39; / & # 39 ;. str_replace ($ num. - #, & # 39;, # post);
}other
// show the category
if ($ view == & # 39; && isset ($ category)) {
$ num = (int) $ category;
$ route = str_replace ($ num. - & # 39;, #,; category);
}other
if ($ view == & # 39; categories & # 39;) {
$ num = (int) $ menuid;
$ route = str_replace ($ num. - -, #,; $ menuid);
}other

// detailed product view
if ($ view == & # 39; productdetail && isset ($ prodgroup) && isset ($ prodid)) {
$ route = preg_replace (#  d +  - #, & # 39; & # 39;, strtolower ($ prodgroup)). & # 39; / & # 39 ;. preg_replace (#  d +  - # & # 39 ;, $ prodid);
}other

if (isset ($ view) && $ view == & # 39; productgroup && isset ($ prodgroup)) {
$ num = (int) $ prodgroup;
$ route = str_replace ($ num. - -, & # 39;, $ prodgroup);
}other
if (isset ($ view) && $ view == & # 39; productgroups & # 39;) {
$ num = (int) $ menuid;
$ route = str_replace ($ num. - -, #,; $ menuid);

if (pathinfo (currenturl ())['filename'] == & # 39; cart & # 39; &&! requestKey (& # 39;)) {
redirect (str_replace ($ num. - & # 39;, # menuid), 301);
}
}

}other{
// default URL
$ route = $ url;
}

return $ route;
}

What's odd is when I use Facebook's object debugger to scratch the pages, although the 404 report, the og: image, is returned and when I click on "see what the scraper sees" , the HTML code is correct! The bot sees the good HTML code, but reports "an incorrect response code".

I've tried adding the following condition to tell the bots to use the given URL, but it does not work.

RewriteCond% {HTTP_USER_AGENT} (facebookexternalhit /[0-9]| Twitterbot | Pinterest | Google. * Extract)
RewriteRule. * [L]

This is the type of URL that fails with 404 and sometimes 500, only seen by the bots http://websitedons.net/demo/whmcs/the-blog

But this URL returns 200 http://websitedons.net/demo/whmcs

How does one write htaccess to consistently provide good answers?

How can I prove that no algorithm exists for a given problem?

Is there a general framework to show that a problem does not have an algorithm? For example, to show that two problems are as difficult one as the other, we use reduction.

differential equations – pde 4 orders with precision problem

Clear ["Global`*"]
c = 0.03;
k = 10 [Pi];
w = 10 ^ 7;
h0[x_] : = Exp[-x^2/0.05];
p[t_, x_] : = -D[h[t, x], {x, 2}

- c Exp[2 I k x + 2 I w t]
eq1 = D[h[t, x], t]== 1/3 D[(h[t, x]^ 3 D[p[t, x], X]), X];
Traditional form[eq1];
x0 = -1.5;
x1 = 1.5;
con1 =
!  ( * SuperscriptBox[(h), 
TagBox[
RowBox[{"(", 
RowBox[{"0", ",", "1"}], ")"}],
Derivative],
MultilineFunction-> None])[t, x0] == D[h0[x], X]/. x -> x0;
con2 =
!  ( * SuperscriptBox[(h), 
TagBox[
RowBox[{"(", 
RowBox[{"0", ",", "1"}], ")"}],
Derivative],
MultilineFunction-> None])[t, x1] == D[h0[x], X]/. x -> x1;
con3 =
!  ( * SuperscriptBox[(h), 
TagBox[
RowBox[{"(", 
RowBox[{"0", ",", "3"}], ")"}],
Derivative],
MultilineFunction-> None])[t, x0] == D[h0[x], {x, 3}]/. x -> x0;
con4 =
!  ( * SuperscriptBox[(h), 
TagBox[
RowBox[{"(", 
RowBox[{"0", ",", "3"}], ")"}],
Derivative],
MultilineFunction-> None])[t, x1] == D[h0[x], {x, 3}]/. x -> x1;
sol = NDSolve[{eq1, h[0, x] == h0[x], con1, con2, con3, con4},
h, {t, 0, 2.5}, {x, x0, x1},
MaxSteps -> 10 ^ 5,
Method -> {"PDEDiscretization" -> {"MethodOfLines",
"SpatialDiscretization" -> {"TensorProductGrid",
"MinPoints" -> 2500}}},
PrecisionGoal -> 2, MaxStepSize -> 0.01];
Ground[Abs[Evaluate[h[1., x] /. ground[[1, 1]]]]{x, x0, x1},
PlotRange -> All]

The mathematica code gives the warning that ""

NDSolve :: eerr: Warning: estimate of the local spatial error scaled to 866.6341537688944.at t = 2.5 in the direction of the independent variable x is much greater than the prescribed error tolerance. The spacing of the grid with 501 points may be too large to achieve the desired accuracy. A singularity can be formed or a smaller grid spacing can be specified using the MaxStepSize or MinPoints method options.

and bad results.enter the description of the image herebut the good result is enter the description of the image here. My problem is how to improve the code?

any problem with April 2019 UC / May 2019 CU for sharepoint 2013

I just wanted to know if there was a problem or a regression with April 2019 CU / May 2019 CU for SharePoint 2013?

Does anyone have a non experience

javascript – Problem when counting equal values ​​in jQuery DataTable

Good night

I have a table and I try to filter equal values ​​in the rows, but without success. Code to filter (returns the record number that corresponds to the total number of records);

                                                var filterData = table.column (4) .data (). filter (function (value, index) {
return value = "New York"? right wrong;
})
console.log (filterData.count ());
$ (". sum"). html (filterData.count ());


Board:

var table = "";
table = $ (.table) .DataTable ();

Board:

        
Name Position Office Age City Salary
Tiger Nixon System Architect Edinburgh 61 New York 320,800
Garrett Winters Accounting Tokyo 63 New York 170,750
Ashton Cox Junior Technical Writer San Francisco 66 New York 86,000
Cedric Kelly Senior Javascript Developer Edinburgh 22 New York 433,060
Airi Satou Accounting Tokyo 33 New York 162,700
Brielle Williamson Integration Specialist New York 61 New York 372,000
Herrod Chandler Commercial assistant San Francisco 59 New York 137,500
Rhona Davidson Integration Specialist Tokyo 55 New York 327,900