magento2 – Automatic URLs generated by magento 2 has missing characters

At magento 1 for example, if my category name is “Armação”, the url automatically generated for this category is “armacao”. The magento 1 automatically did it for special characters.

In magento 2 I dont know how to use it. There is a configuration to do it or magento 2 not support it?
Magento 2 example:
Category: Armação
Link after save: arma-o

I have this problem with all magento 2(v2.3.5) links. Please help me to solve this problem!

enter image description here

design – Why are code readability and debugging arguments often expressed as a counter-argument for the use of generated LR parsers?

Enh… it isn’t a solid argument, but it isn’t something you should just ignore. Parsers are already a pain and a half to debug, so making them even more difficult to debug isn’t a great idea.

There’s also the occasional desire to edit the parser with certain rules that can’t be easily defined in grammars – sometimes for academic reasons, sometimes for performance reasons, sometimes because someone thinks it is easier to do the check there rather than as a post-parsing step.

Mostly though, when I hear this argument it isn’t so much that the parsing code is ugly, but that the output tree is ugly. This isn’t unique to LR parsers of course, but generated parsers do tend towards outputting unwieldy (but technically correct) parse trees. Some see the work to massage that into a nice tree to be nearly as much work as parsing in the first place.

Again, not strong arguments but situations that can make the generator a worse option than it first appears.

functional analysis – Generated Space of a Set of Piecewise Functions

How can I find the generated space of $A$?
begin{equation*}
A = {maxleft(pm(x-a),0right) }_{ain mathbb{N}}
end{equation*}

In other words, what type of function $g(x)$ can I writte as a linear combination of the elements of $A$?
begin{equation*}
g(x) = sum_{i in mathbb{N}}a_i maxleft(i-x,0right) + b_i maxleft(x – i,0right)
end{equation*}

Can I find a selfadjoint operator whose eigenfunctions are in $A$? In particular, Is $A$ a set of eigenfunctions of a Sturn-Liouville operator? (In that case the problem is solved).

python – Validating generated Captcha with User’s input

I’ve made a captcha from a random selection within the text file ‘captcha.txt’.
I have converted these recalled characters to a variable which i can then validate the user’s input with.

import random 
import os
def captchasub():

    thisfolder = os.path.dirname(os.path.abspath(file))
    captchatxt = os.path.join(thisfolder, 'captcha.txt')

    with open(captchatxt) as text_file: 
        captcha = text_file.read()
        validation = print("".join(random.choices(captcha, k=6,)))
        x = input('Please Rewrite the Captcha Above:')
        if x != validation:
            print ('Stupid Robot')
            return captchasub()
        if x == validation:
            print ('Welcome')

captchasub()

I’m however not recieving the ‘welcome’ print im expecting when successfully completing a captcha.

I believe that everything is fine up until x != validation and onwards (maybe even at x = input).

javascript – Deleting Bot generated messages in DMs (with discord.js)

I startet not a while ago with discord.js and was working on a command handler – on commands in general.
I realised that my bot could also reply on dms, so I tried this:

if (!msg.guild) {

msg.channel.send("I am not answering to to DMs, please respect that!");

}

I somehow bugged and replied to me with like 10 messages and it would go on if I hadn’t stopped the bot.

Now I decided I don’t want the bot even to reply to a dm, it should just ignore it, but now I have like 10/20 messages from him I can’t get rid of.
Can anyone send me one line of code where I can manually delete a single message. I would like copy the ID of every message he wrote me thats not the problem.

Thanks in advance!

conversion – How to exclude annotation encoding=’Mathematica’ from generated MathML?

I do not see how to remove <annotation encoding='Mathematica' from generated MathML. Afaict it is not needed for a one way conversion and it often doubles the size of generated MathML.

How to do this quickly?

Shouldn’t "Annotations"->{} option handle this?

(mathml = ExportString(Column@List@f(x), "MathML", "Annotations" -> {})) // AbsoluteTiming // Column
0.0025588
<math xmlns='http://www.w3.org/1998/Math/MathML'>
 <semantics>
  ....
  <annotation encoding='Mathematica'>TagBox(...</annotation>  (*THIS is a waste of space for me*)
 </semantics>
</math>

I can mathml->XMLElement->DeleteCase->ExportString but then the procedure takes +500% of time for something that could’ve been just dropped before.

mathml // 
  ImportString(#, "XMLElement") & // 
  DeleteCases(#, XMLElement("annotation", ___), (Infinity)) & // 
  ExportString(#, "XML") & // 
  AbsoluteTiming // Column
0.0108532
<math xmlns='http://www.w3.org/1998/Math/MathML'>
 <semantics>
  ...
 </semantics>
</math>

sequences and series – What is the set of pairs of points in $mathbb C$ generated from one pair by the AGM iteration and its inverse?

The arithmetic mean of two complex numbers $a,b$ is $tfrac12(a+b)$, and the geometric mean is $pmsqrt{ab}$, which is two-valued. The arithmetic-geometric mean is the limit of the pair of sequences formed by iterating

$$mathbb C^2tomathbb C^2:;(a,b)mapsto(a’,b’)=left(frac{a+b}{2},;sqrt{ab}right)$$

(and choosing one of the two possible square roots at each step). See Cox’s paper The Arithmetic-Geometric Mean of Gauss.


Instead of taking one path and indexing by $mathbb N$, let’s consider the set $Ssubseteqmathbb C^2$ of all pairs of points which can be reached in this way, taking both square roots, and also iterating backwards:

$$(a,b)mapsto(a’,b’)=left(frac{a+b}{2},quadpmsqrt{ab}right)$$

$$(a’,b’)mapsto(a,b)=left(a’pmsqrt{a’^2-b’^2},quad a’mpsqrt{a’^2-b’^2}right).$$

$S$ could be indexed by some directed graph where each vertex has two successors and two predecessors. The two successors of $(a,b)$ (given by the two choices of geometric mean) share their two predecessors: $(a,b)$ itself and $(b,a)$. The two predecessors of $(a’,b’)$ share successors: $(a’,b’)$ and $(a’,-b’)$.

With that in mind, we can define equivalence classes

$$(a,b)={(a,b),(a,-b),(-b,a),(-b,-a),(-a,-b),(-a,b),(b,-a),(b,a)};$$

note that $(a,b)in S$ if and only if $(a,b)subseteq S$. Our multi-valued functions act on these by

$$(a,b)mapstoleft(frac{a+b}{2},;sqrt{ab}right),;left(frac{a-b}{2},;isqrt{ab}right)$$

$$(a,b)mapstoleft(a+sqrt{a^2-b^2},;a-sqrt{a^2-b^2}right),;left(b+isqrt{a^2-b^2},;b-isqrt{a^2-b^2}right).$$

Let’s also define $A={amidexists b:(a,b)in S}={bmidexists a:(a,b)in S}subseteqmathbb C$, and $X^*$ as the derived set (the set of accumulation points, or limit points) of a set $X$. Now for the questions.


Given a single pair $(a_0,b_0)$ to generate $S$, in general, what does $S$ or $A$ look like? Where does it accumulate?

If $a^*in A^*$, is there some $b^*$ such that $(a^*,b^*)in S^*$?

If $(a^*,b^*)in S^*$, must $a^*=pm b^*$?

If $(a^*,b^*)in S^*$, is it actually the limit of some sequence $(a_n,b_n)to(a^*,b^*)$ following the two-valued function and its inverse? that is, a sequence where, for all $ninmathbb N$, $(a_{n+1},b_{n+1})$ is one of the four values obtainable from $(a_n,b_n)mapsto(a_{n+1},b_{n+1})$?


The case $a_0=b_0=0$ is trivial: $S={(0,0)}$.

The case $a_0neq b_0=0$ is tractable:

$$S={(a_0/2^n,0),,(ia_0/2^n,ia_0/2^n)mid ninmathbb Z}$$

(I know, this is abusing set notation to have $(a,b)in S$ rather than $(a,b)subseteq S$)

$$A={0,,pm a_0/2^n,,pm ia_0/2^nmid ninmathbb Z}$$

$$S^*={(0,0)},quad A^*={0}.$$

The case $a_0=pm b_0neq0$ has the same form.

It remains to consider the general case $a_0b_0(a_0!^2-b_0!^2)neq0$.

wallet – What is the longest known vanity address generated?

GEnesisReVC

1GEnesisReVCQG641yERVQgStUvqH6S9U2

On Mac Pro with GPU it was 9 days to have 50% chance of genesisre (not case sensitive)

Was using https://github.com/exploitagency/vanitygen-plus

What I really like about this address:

  • capitalization of GEnesisRe
  • VC suffix
  • memorable U2 ending
  • capitalization right after VC
  • capitalization just before U2

OK, so right now time to raise some money and open a VC fund investing in regenerative communities – independent food, energy, water production and focus on education and new post-scarcity paradigm economy.


EDIT / UPDATE: Out of curiosity tried running the command as if I was to bruteforce it with the exact capitalisation:

Difficulty: 9883693997182075238
(20.44 Mkey/s)(total 398458880)(Prob 0.0%)(50% in 10630.3y) 

With -i (case insensitive):

Difficulty: 18982355007608803
(19.72 Mkey/s)(total 230686720)(Prob 0.0%)(50% in 21.2y) 

Bottom line – got lucky, incredibly lucky.


EDIT / UPDATE:

I wanted to send the minimal transaction (546 Satoshis) and be included in the block but they happened almost instantly, what a chance!

Don't trust, verify. Happy Bitcoin halving! Monday 11th May 2020

G2xJA5vc8aN0ml+wum97coQlaa9BDsSdN7AkCfwX4MAsKuiIXsgsOzyMGv0S0/3kELLoaDzNTpMIUvaTMNzi7nc=

New Bytes generated from an true random bytes, still true random?

I have a question regarding “True Random”.

I have a true random byte generated binary sequence produced from a QRNG hardware unit.

From this true random binary input sequence, I’ producing a new sequence by a pure description process of the binary input.

There is absolute no mathematical or algorithmic transformation of the binary input, the way we are producing the result is only based on the way we are describing the input binary sequence bit-per-bit.

Process Example (all the binary values are fake and only represented to illustrate the the case) :

  1. QRNG True Random binary input sequence -> 10101011
  2. Description process of represented input binary sequence (absolutely no logical or mathematical transformation of the binary structure during this process)
  3. The new produced binary sequence obtained from the process (2) -> 1100011010111110001100111100011010

My question is to know if we can consider the newly produced binary sequence as a real true random binary sequence because there is absolutely no transformation of the input, only a descriptive representation?

How to explain that this notion does not alter the TRUE RANDOM character of the entry?

What are the rules to respect to preserve the TRUE RANDOM character of a binary output and what are the operations that are authorized or not ?!

Thank you in advance for you support :)​

Best regards.

schema.org – Auto generated FAQs – Does “unnamed item” in schema hurt SEO?

I’m using FAQ schema in a collection list template, so dynamic tags for the Question and Answer. On pages without FAQ my page still contains the schema script but without any content. It’s therefore showing as an error rather than acting in a spammy way – it’s not showing anything that’s not on the page as the tags are empty. On other pages the tags pull through Q&A where I’ve entered the information.

Is it fine to leave the empty script on those page without FAQ, or should I create an exclusion for those empty pages to prevent it from being created in the first place?

Some of the questions are auto-filled by our customers but sometimes they are empty and not yet prepopulated.

enter image description here