How can I only return / restrict X results in Google Data Studio?

I have a general query and then run many tables / charts on it.

In some, I just want to show X results. How can I do that?

You know how MySQL LIMIT X (E.g. SELECT * FROM Table LIMIT 30).

This way I can sort by size and return the largest / lowest value.

As an interim solution I used:

lines per page

But it wastes time and resources to get it all, and makes the end user navigate back and forth.

REST API search query Get results

I managed to get the value I need


The concept is like this

//fetch json data alove

            for(let i=0;i

Is there a better way to get the value?
e.g. I want to go over the array and look for whether the value of "key" is the name. Get the value of "Value".

Searching the SharePoint list – wrong results

As always, I think you can help me. πŸ™‚ πŸ™‚

I have a problem with Search the SharePoint list.

2 cases:

1) I am looking for an item with the number 251 (this item is included in the searched list).

The results are: 876, 198, 251, 45.

Why do so many unrelated items appear in the results? Shouldn't only 251 appear in the results? It is only in 3rd position!

2) I enter a search field number that is not in the list: 344

The results are: 765, 45, 132, 223

Should not be no search results there instead of showing lots of strange hits?

Any idea why this search works this way?

Thanks in advance!
AgaEnter image description here

Fine mlm script provides the best results for your company search

It's exactly the scenario for the users out there who are looking forward to getting into a network marketing business. It was an efficient business portal to make more profits in a short time. With an MLM script you can build your own business marketing business.

MLM script is a solution with a strong technical background. The script gives users great pleasure in doing business without complications. The smooth functionality of the software is well suited for important tasks in a complete security zone. It was developed with great flexibility and supports all important business plans such as binary, monoline, unilevel, matrix and more.

Get the software you want to create your Marketing business website by ARM MLM. The script includes easy-to-use features and responsive features that fit your devices. Get a product with added value according to your requirements from us and offer first-class solutions at the best price.

at.algebraic topology – persistent homology stability results (query on Lipschitz functions)

One of the advantageous properties of persistent homology is its stability results (so-called robustness against noise).

Usually the referenced document is this paper:
entitled "Lipschitz have functions $ L_p $-stable endurance ".

According to the authors, the Lipschitz condition is crucial (otherwise the results do not apply).

My understanding is that the Lipschitz function $ f $ is used to build up the filtration $ X_a = f ^ {- 1} (- infty, a) $ in the context of persistent homology.

My question is how "universal" is this Lipschitz assumption?

That is, for a "typical" filtration $ K_1 subseteq K_2 subseteq dots K_m $it can be expressed in the form of $ K_i = f ^ {- 1} (- infty, a) $ for some Lipschitz function $ f $?

If not, can the often quoted statement that persistent homology is "robust against noise" not apply?

Many thanks. This is my main question after reading the referenced paper, since it is written from a very general point of view (more general than the context of persistent homology).

Combinatorics – what is a good method for modeling combination trees (results of sports competitions)?

Probably newbie question here, point me to relevant theories / tutorials if necessary:

  • Suppose I want to evaluate the probabilities of final placements for a sports competition
  • The competition consisted of 8 teams, but I can simplify the problem to 4 participants (say A – B – C – D)
    • The competition is divided into n Travel where each team faces another team (and only one). With 4 participants I have 2 matches per trip
    • At the end of a game, 5 different point assignments are possible (depending on the number of points)

After a trip there are 30 different possible combinations in terms of team points. So the model looks like a tree with a trip on every level.

Even if I simplify the situation for two remaining rides, I can't think of an elegant way to implement this problem (for example in Python) instead of "manually" creating the tree with the 30 combinations at each level and counting the leaves.

I am not familiar with this type of problem and therefore I am not sure what to do next.

Statistics – How do I find the results of iron hail rolls in Anydice?

iron Born There are generally two types of dice: action dice and progress dice.

Progress rolls are static and use the number of progress fields you filled in during the game (from 0 to 10) "Progress score" to two Challenge diceeach of which is a d10. The challenge dice win a draw. For each challenge die that does not exceed your progress value, you will experience a worse result level (from Strong hit to Weak hit die with a challenge, and hit badly by young lady if the second challenge turns out to be insurmountable.)

Action roles are a bit more complicated. Instead of using your progress bar, roll a D6 Action die and add a value you have (usually 1 or higher). The resulting Action score Never exceed 10 points. The action value is compared to the challenge dice, similar to a progress die, where the challenge dice draw and the quality of the result is reduced from a strong hit to a weak hit and then to a failure.
The action role is also complicated by momentumA metric from -6 to +10 that can work against the challenge die or the action die.

  • If the pulse is negative (-1 to -6), the exact match of the action die (the face of the die itself) is canceled as if that particular face of the die read 0 instead.
  • If the momentum is positive (2 * to 10), it can be used to cancel any challenge dice that are lower than the momentum. They don't count against your result, even if they exceed your action points. (* Since a challenge die cannot be canceled by a momentum score that exactly matches it, momentum scores of 0 and 1 have no meaningful consequence.)

I can't deal with the script needed to tell Anydice to tell me the likelihood that a given throw (for a given progress value and for an entered action throw bonus and momentum value) will be a strong hit, weak good luck ,

What features of Anydice do I need to put together action rolls?

Incorrect results in queries with join for some versions of MariaDB

I have found that some versions of the MariaDB server have some simple queries for certain data that give incorrect results.

I have 2 tables:

CREATE TABLE `tab_parent` (
  `id` bigint(12) unsigned NOT NULL AUTO_INCREMENT,
  `f_date` date DEFAULT NULL,
  `f_value` int(11) NOT NULL DEFAULT 0,
  PRIMARY KEY (`id`)
CREATE TABLE `tab_child` (
  `id` bigint(12) unsigned NOT NULL AUTO_INCREMENT,
  `parent_id` bigint(12) unsigned DEFAULT NULL,
  PRIMARY KEY (`id`),KEY `parent_id` (`parent_id`),
  CONSTRAINT `fk_2` FOREIGN KEY (`parent_id`) REFERENCES `tab_parent` (`id`) ON DELETE SET NULL

And a view that counts how many children have a parent:

CREATE VIEW `tab_parent_view` AS 
  SELECT `tab_parent`.*, 
  COUNT(`tab_child`.`id`) AS `child_count` 
  FROM (`tab_parent` LEFT JOIN `tab_child` ON(`tab_child`.`parent_id` = `tab_parent`.`id`))
GROUP BY `tab_parent`.`id`;

For example data like here:, the two queries do not return the same number of records for the versions 10.2.27 and 10.4.8 of MariaDB. However, the results are correct for versions 10.1.43, 10.3.15, 10.3.16 and 10.4.12.

SELECT * FROM tab_parent_view WHERE f_date>='2020-02-07' AND f_date<'2020-02-08';
SELECT * FROM tab_parent      WHERE f_date>='2020-02-07' AND f_date<'2020-02-08'; 

Only 2 records are returned for the view, but all 4 available for the table:

query results

Is this a known bug in MariaDB? I would like to know what the reason is and on which versions it is fixed. I have not found this problem for MySQL.

Mathematics – Convert the results of a function to a Python list

I have the function f (x) and the user inserts the domain boundaries of the function. From then on I use the "for range" to throw all domain values ​​into the function.
My question is: How can you include the results of these calculations in a list and determine the maximum and minimum values ​​of the function?
* I do not intend to use known derivatives or algorithms

Download – Android Update results in "Data hash does not match digest in descriptor" error

My Samsung Galaxy A70 asked for a software update this morning. I dutifully followed and left it to continue.

When I returned, I received the following error:

Partition tz

Reason tz: The hash of the data does not match the digest in descriptor 2

Plus some other things about hash, firmware version, etc.

Enter image description here

For clarification, I have only decided on an update. I have not connected any cables (as shown in the picture) and have not tried any manual firmware / software installation.

It's still under warranty, so I'll probably just go back to the retailer, but I thought I'd ask here, hoping that there is a quick fix that won't void the warranty.

Any suggestions?

Thank you very much