array – Cómo imprimir las operaciones hechas durante una multiplicación de matrices ? (Java)

estoy haciendo un código que multiplica dos matrices(A)(B) y de ahí resulte otra matriz (C).
Mi problema está en que debo imprimir lo remarcado en rojo
introducir la descripción de la imagen aquí

La parte del código que debería hacer eso es lo que les muestro:

System.out.println("nnMULTIPLICACIÓN MATRICIAL:n");
    //OPERACIONES
    for(int i = 0; i < matrixA.length; i++) {
        for(int j = 0; j < matrixB(0).length; j++) {
            String val = String.format("%2s", (nfC++));
            System.out.print(val+"  ");
            for(int k = 0; k < matrixA(0).length; k++) {
                //mult
                matrixC(i)(j) += matrixA(i)(k)*matrixB(k)(j);
                System.out.print(" ("+matrixA(i)(k)+")*("+matrixB(k)(j)+") ");      
            }
            System.out.print("= "+matrixC(i)(j));
            System.out.println();
        }
        System.out.println();
    }

Pero me sale así y no sé cómo podría arreglarlo:
introducir la descripción de la imagen aquí

html – No puedo ver las animaciones en CSS

Estoy aprendiendo a animar en CSS

Cuando ejecuto este código en Codepen uso este preprocesador:

introducir la descripción de la imagen aquí

Pero cuando quiero usar VScode con la extensión de Live server, no me funciona
pensé que era porque no lo subía a la web, pero cuando lo hice tampoco me funcionó, luego revisando, me dijeron que le ponga -webkit, pero tampoco funciona.

Este es el código

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">

    <link rel="stylesheet" href="normalize.css">
    <title>Document</title>

    <style>
        .circle{
            width:200px;
            height:200px;
            border-radius:50%;
            background-color:red;
            border:5px solid #000;
        }

        .circle:first-child {
            -webkit-animation:circle1 1s infinite alternate;

            @-webkit-keyframes circle1{
                to{
                    width:400px;
                    height:450px;
                }
            }
        }
    </style>

</head>
<body>
    
    <div class="circle">

    </div>

    
</body>
</html>

sql – ¿Cómo usar Query para devolver todas las filas de una hoja que coincidan con el valor de una celda?

Hola y gracias por responder. Ésta es la primera vez que escribo una pregunta así que voy a tratar de ser lo más claro posible.

Estoy haciendo un archivo de Google Sheets para tomar órdenes de clientes. Como resultado final me gustaría tener una hoja “Órdenes” con una tabla en la que los datos se cargan por orden de llegada (Ver primera imagen), y una segunda hoja “Consulta” con el mismo formato de tabla, pero que al escribir la fecha de entrega en una celda, me devuelva todas las filas de la hoja “Órdenes” que posean esa fecha de entrega (Segunda imagen)

Investigando un poco en internet vi que se usa una fórmula con Query, pero no sé usarlo.
La fórmula que usé es:
=QUERY(Ordenes!$A$2:$K;"select A, B, C, D, E, F, G, H, I, J, K where B = B1; 1)") Ver segunda imagen

Imagen 1. Hoja "Ordenes"

Imagen 2. Hoja "Consulta"

¿Cómo interpretar las gráficas de la función pcr del paquete qualityTools en R?

Para una variable referente al diámetro interior de una pieza (de un dataframe dado), aplicamos la función pcr para analizar la capacidad de un proceso con límite inferior 35.02 y limite superior 35.18.
Mi problema es que al obtener las gráficas, no sé interpretar bien los valores de la fracción esperada de piezas defectuosas (en piezas por millón), no sé cuándo he de decir que están por encima o por debajo del margen inferior o superior.

introducir la descripción de la imagen aquí

Las Vegas algorithm for finding 00000 in bit string

Problem 1: Consider the following problem: given a binary string $w=a_1a_2cdots a_n in{0,1}^*$, decide whether $w$ contains 00000 as a substring (i.e., where $w$ contains five consecutive 0’s). There is an obvious $O(n)$-time algorithm. You will investigate the hidden constant factor, concerning the number of bits that need to be examined (i.e., the number of $a_i$‘s that need to be evaluated) to solve this problem.

  1. (10/100 points) First argue that every deterministic algorithm solving this problem needs to evaluate $Omega(n)$ bits in the worst case.
  2. (30/100 points) Prove that for a sufficiently large constant $c$, for any string $a_1 cdots a_c$ of length $c$ that does not contain 00000, there must exist two indices $i,j in {1,ldots,c}$ with $a_i=a_j=1$ and $2 leq |i-j| leq 5$.
  3. (60/100 points) Design a Las Vegas randomized algorithm solving this problem (with zero error probability) that evaluates an expected $alpha n + o(n)$ number of bits for any input, for some constant $alpha$ strictly smaller than $1$. (You do not need to optimize the constant $alpha$.)

Above is a question some friends and I have looked at to prepare for a qualifying exam and is itself from a past qualifying exam. Parts 1 and 2 are fine but what we are having troubles with is part 3. I think the idea behind this problem is to imagine that evaluating some bit $s_i$ is really expensive, so we would like to get the right answer while minimizing how many of these bits we evaluate. That said, there is some ambiguity to us about whether we (1) care about the number of distinct bits we evaluate or (2) the total number of times we evaluate any bit. Clearly if we were worried about the latter, we could just store the result of the bit evaluation and avoid doing an expensive evaluation again, but we are not sure. For now, I assume the latter case and specifically that if we want the value for the same bit twice, we assume we need to evaluate it each time and incur $2$ units to the cost we are trying to minimize.


Now I have some idea for this problem and to help explain my idea, let us consider a simple deterministic algorithm with the pseudocode written below. We will loop from the start of the string to the end, checking all meaningful 5 bit substrings. If we ever find a $1$ bit as we loop over a 5 bit substring, we know that substring cannot be $00000$ but if we start at the bit right after that $1$ bit, there might be one. Thus, we update our new starting point to the position right after that $1$ bit and then start back up again from there.

On input $s$:

  1. set $i leftarrow 1$
  2. while($i leq (n-4)$):
    • set $b leftarrow text{true}$
    • for($j = 0$ to $4$):
      • if( $a_{i+j} = 1$ ):
        • $i leftarrow (i+j+1)$
        • $b leftarrow text{false}$
        • break for loop.
    • if( $b = text{true}$ ):
  3. return FALSE

My idea for a Las Vegas algorithm was to do the same algorithm but slightly modify it by making the inner loop performed in random order, making the pseudocode now be

On input $s$:

  1. set $i leftarrow 1$
  2. while($i leq (n-4)$):
    • set $b leftarrow text{true}$
    • for($j = 0$ to $4$ in random order):
      • if( $a_{i+j} = 1$ ):
        • $i leftarrow (i+j+1)$
        • $b leftarrow text{false}$
        • break for loop.
    • if( $b = text{true}$ ):
  3. return FALSE

The positive thing going for this algorithm is that if there exists a $1$ bit in the 5 bit substring we are looking at in the inner loop, we will find it in at most $3$ loop iterations in expectation. However, if I define a bit string $s$ to be
$$s = 100001 100001 100001 cdots 100001$$
then the algorithm should require looking at $6$ bits (potentially some of the same ones multiple times) in expectation to get past each $100001$ substring. This implies on this input we will go to see the value of $n$ bits (the number of distinct bits seen may be less) in expectation before we answer the question of if $00000$ is contained in $s$. Thus, this algorithm does not seem sufficient.

Does anyone have any thoughts on how to approach this problem or think we should actually be worried about the number of distinct bits we evaluate? If yes to the latter, then I could potentially see other ways to tackle this problem.

¿Cómo puedo ver los nodos correspondientes a las predicciones de una base de datos en un árbol de decisión en python?

Espero su ayuda en ese tema, gracias se me hace complicado identificar los nodos en python.

lógica – ¿Cómo puedo revertir únicamente las vocales de un string en PHP?

Empecé a realizar un pequeño ejercicio que invierte las letras de una palabra en string:
Ejemplo: Hola > aloH

<?php 
$palabra = "Hola";
$cuenta = strlen($palabra);
$invertida = "";
for($i=$cuenta; $i>-1; $i--){$invertida.=$palabra($i);}
echo $invertida;

Lo que quiero hacer ahora es un código que invierta únicamente las vocales del string, ejemplo:
Hola > Halo
Comer > Cemor
Cosa > Caso
¿Me podrían ayudar?
De antemano les agradezco su tiempo!!

¿Cómo podría sacar las credenciales del teléfono en android?

¿Cómo puedo sacar el número de teléfono y el email para que se rellene automáticamente en mi pantalla de login?

air travel – Can I use my TWIC card as my photo ID to fly from Philadelphia to Las Vegas?

I live in the United States and I’m traveling from Philadelphia International Airport to McCarran Airport in Las Vegas. My passport has expired and I have misplaced my driver’s license. I am trying to save money and time by using my Transportation Worker Identification Credentials (TWIC Card) as my photo ID to board the plane.

It was issued to work at the power plant, which is located in the port. Anybody working at any port in the US needs this card to be able to enter it. Applying for it is similar to applying for a passport. So it is not an easy credential to obtain. There is a little chip in it that is like a SIM card and has everything the government would want to know about me on it. It is a federally-issued card and has my photo on it.

Will I be able to use this to board the plane, or will I have to deal with the long lines at the DMV and get a new license made?

Las Vegas Marijuana Cannabis Businesses and Digital Services

Las Vegas marijuana cannabis businesses are rooting their ground and many new popping up all over the Las Vegas valley getting ready for the new law to take effect making secured digital services like business voice, secured encrypted emails, and even hosted IP cam monitoring systems in high demand.

Clark County set a high and very strict set of rules for marijuana dispensaries, the newest legal vice in this capital of vice, will also be kept separate, even when the state gets its system of recreational dispensaries set up. The zoning rules for Clark County don’t allow dispensaries anywhere near a casino. Clark County has at least a dozen dispensaries parallel to the Strip, but they’re at least several blocks away and nowhere in sight. In addition, the Nevada Gaming Control Board does not allow investors in the casino industry to invest in dispensaries, and vice versa this includes all lines of communication must be encrypted to protect business-sensitive data.

These types of businesses need a higher grade level of hosting, putting companies like NocRoom Voice & Data to work with offering medical-grade Hosted PBX w/VoIP Phone System and encrypted emails with full turn-key solutions for its clients including off-premises hosting for the surveillance system and file sharing between locations of client businesses.
SEMrush

How does NocRoom do this?

NocRoom uses the latest technology offering for IP-based networks helping our customers like for example the medical billing company BillNet Solutions to process more than 5000+ calls, 7000 emails, and file-sharing 1TB of data per day between its two locations. This customer relies on the latest technology for security and to keep all their locations acting as one single office – with over 100 employees this can be a challenge. All data from hosted PBX, emails, and file sharing are encrypted in and out of the office network. With the new IP-based networks like hosted PBX, emails, and open-source software – all working smoothly together.

Who is NocRoom?

Founded in 2006, NocROOM is located at one of the largest internet exchange points in the world, facilitating excellent inter-connectivity with Latin America, the Caribbean, and Europe. NocRoom is a global provider of optimized network solutions that offer the best possible performance, reliability, and availability. Our advanced, IP-based networks deliver data, voice, and content to clients and partners worldwide. Offerings include colocation, transit, transport, VoIP, and network-based services.

Email:

LinkedIn: https://www.linkedin.com/in/vincentgonzalezipv4