Blender crashes while rendering video [closed]

T

thesreal

I am using Blender 4.2 on Linux Mint and whenever I render a video, it always crashes part-way. Here is the gdb debugger output

Code: 
Append frame 3972
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3973
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3974
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3975
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3976
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3977
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3978
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3979
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3980
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3981
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3982
Time: 00:00.03 (Saving: 00:00.00)

Append frame 3983
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3984
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3985
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3986
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3987
Time: 00:00.01 (Saving: 00:00.00)

Append frame 3988
Time: 00:00.01 (Saving: 00:00.00)


Thread 83 "blender" received signal SIGSEGV, Segmentation fault.
[Switching to Thread 0x7fff61600600 (LWP 36566)]
0x00007ffee3fb8010 in ?? ()
(gdb) bt
#0  0x00007ffee3fb8010 in  ()
#1  0x0000000000000071 in  ()
#2  0x00000000000001f5 in  ()
#3  0x00007ffea8fa5c4c in  ()
#4  0x0000000000000780 in  ()
#5  0x00000000000001f1 in  ()
#6  0x000000000132b39c in  ()
#7  0x0000000000f3ebb9 in  ()
#8  0x00007ffff7f97b45 in tbb::internal::custom_scheduler<tbb::internal::IntelSchedulerTraits>::process_bypass_loop(tbb::internal::context_guard_helper<false>&, tbb::task*, long) ()
    at /home/thes_real/Downloads/blender/blender-4.2.0-linux-x64/lib/libtbb.so.2
#9  0x00007ffff7f97e78 in tbb::internal::custom_scheduler<tbb::internal::IntelSchedulerTraits>::local_wait_for_all(tbb::task&, tbb::task*) ()
    at /home/thes_real/Downloads/blender/blender-4.2.0-linux-x64/lib/libtbb.so.2
#10 0x00007ffff7f80757 in tbb::internal::arena::process(tbb::internal::generic_scheduler&) ()
    at /home/thes_real/Downloads/blender/blender-4.2.0-linux-x64/lib/libtbb.so.2
#11 0x00007ffff7f8eac0 in tbb::internal::market::process(rml::job&) ()
--Type <RET> for more, q to quit, c to continue without paging--c

#12 0x00007ffff7f9259c in tbb::internal::rml::private_worker::run() () at /home/thes_real/Downloads/blender/blender-4.2.0-linux-x64/lib/libtbb.so.2
#13 0x00007ffff7f927d9 in tbb::internal::rml::private_worker::thread_routine(void*) () at /home/thes_real/Downloads/blender/blender-4.2.0-linux-x64/lib/libtbb.so.2
#14 0x00007fffdde94ac3 in start_thread (arg=<optimised out>) at ./nptl/pthread_create.c:442
#15 0x00007fffddf26850 in clone3 () at ../sysdeps/unix/sysv/linux/x86_64/clone3.S:81

Computer specs: Intel Core i9-14900K ASUS DUAL OC RX 7600 XT with 16GB VRAM 32GB DDR5 7200MHz Corsair Vengeance Samsung 970 Plus 1TB NVMe SSD Linux Mint 21.3 (with XFCE installed) EVGA GT 750 Supernova 750W ATX PSU
 

Unreplied Threads

2-category structure on Mod(R)

  • curious math guy
  • Mathematics
  • Replies: 0
Apologies for the basic question but I'm curious to know if there is an ``interesting" $2$-category structure on the category of modules over a ring $R$.

Essentially what is not clear to me if $M,N$ are two $R$-modules, what should be a $2$-morphism, that is if $f,g:M\to N$ are two $R$-module morphisms, what should be a morphism $H:f\to g$?

I suppose I could just take the "trival" category, i.e. that there is no non-trivial morphisms, but I'm curious if there is an ``interesting/non-trivial" one.

Riesz transform of constant function

My one-line question would be, what is the Riesz transform of the constant function, identically equal to 1 on $\mathbb{R}^2$?

But more fundamentally, my question stems from some confusion about the definition of the Riesz transform. On $\mathbb{R}^2$, the Riesz transform is given by

$$R_jf(x)=cP.V.\int_{\mathbb{R}^2}\frac{x_j-y_j}{|x-y|^3}f(y)\,dy$$ for some constant $c$, and most sources I've seen (including many textbooks and wikipedia) defines the principal value by the following $$P.V.\int_{\mathbb{R}^2}\frac{x_j-y_j}{|x-y|^3}f(y)\,dy=\lim_{\epsilon\to 0^+}\int_{|x-y|\ge \epsilon}\frac{x_j-y_j}{|x-y|^3}f(y)\,dy.$$ Now if we take this definition, then it's not clear that the Riesz transform of a constant function should be defined since there's not enough decay at infinity. On the other hand, I've seen in some sources (particularly in defining the Hilbert transform) the following "alternative" definition of the principal value $$P.V.\int_{\mathbb{R}^2}\frac{x_j-y_j}{|x-y|^3}f(y)\,dy=\lim_{\epsilon\to 0^+}\int_{\epsilon^{-1}\ge |x-y|\ge \epsilon}\frac{x_j-y_j}{|x-y|^3}f(y)\,dy.$$ Now if we do define the principal value this way, then the Riesz transform of a constant function would simply be 0 because of the cancellation property of the kernel, i.e. the kernel integrated over any circle centered at $x$ vanishes.

So, how is the Riesz transform "truly" defined (as a singular integral; not fourier transforms)?

How does the charge move in an analog bucket-brigade device?

  • Ken Shirriff
  • Physics
  • Replies: 0
I'm trying to understand the details of a bucket-brigade delay line. The basic idea is clear: the alternating clock phases raise the voltage of alternating capacitors, causing the charge to dump into the next capacitor, causing the charges to move through the device. The part I don't understand is why the charge gets transferred entirely rather than averaged between the two capacitors.

The schematic below (source) shows the bucket-brigade circuit with PMOS transistors. The alternating clocks cause a charge-pump action with one capacitor pulled low and the other high. Presumably, the transistor gate voltage controls how much charge is transferred and the transistor cuts off at the right point to transfer the charge and reset the capacitor, but I can't get the math to work out.

Schematic of a bucket brigade with PMOS transistors and capacitors driven by alternating clock phases.

To make it concrete, suppose the clocks oscillate between 0V and -15V. Suppose the voltage at the top of C1 is -5V and C2 is 0V with both clocks off (0V). If Tr2's gate is pulled to -15V by the clock, then C2 will now be at -15V, the transistor Tr2 will conduct and C1 and C2 will average out to -10V each. When Tr2's gate goes back to 0V, C2 will be raised to +5V. So C1 is -10V and C2 is +5V which isn't what we want. But even worse, the transistor will still conduct until C2's voltage reaches the threshold, which brings us to C1 = -5V + Vt and C2 = 0V - Vt, which is about where we started. So I must be doing something wrong.

I looked at the Wikipedia page, and this answer (which has an erroneous explanation of a different circuit), and this detailed description but I can't figure it out.

Circuit from NI DAQ 6001 to push button

  • Govind Sankar M R
  • Physics
  • Replies: 0
enter image description here

I need to design a circuit with a NI DAQ 6001 and 3 push buttons. I don't know any design software, so I just drew by hand. I can give an explanation for you to understand.

Pins 1, 2, and 3 are programmed to be digital output pins which give a 5 V output and pins 4, 5, and 6 are programmed to be digital inputs.

I need a 5 V signal to the push button which will then be read by the NI DAQ. For this I wired from DO Pin 1 to the push button and then from the push button to DI Pin 6. Similarily DO Pin 2 -> push button -> DI Pin 5 and DO Pin 3 -> push button -> DI Pin 4. On receiving 5 V at the DI terminals, the rest will be done by the software. There is already a pull-down resistor in the NI USB 6001, so I haven't used any. Is this circuit correct?

The purpose of Enigma plugboard

  • Mikhail Gaichenkov
  • Technology
  • Replies: 0
It is well known the number of Enigma combinations with plugboard: $${5!\over(5-3)!}\cdot26^3\cdot{26!\over(26-20)!\cdot2^{10}\cdot10!}=158,962,555,217,826,360,000$$.

So, $(26-20)!\cdot2^{10}\cdot10!$ just decreases the overall number of combinations. Indeed, the commercial machine was not supplied with the board. On the other hand, the military version had the board to mix the electrical circuits with less level of combinations. I guess to prevent it's easy breaking.

My questions is about pros and cons of the switch board.

Do we want to increase the number of combinations and the strength of the code at the same time and how no board situation affects the breaking the code?

Thank you for the explanations or estimations.

PS My initial question was at Math.Stack forum but I have not got any answer (just a recommendation to ask Crypto).

Alterar window.location.href não redireciona para a nova página [fechada]

  • Tiago Coelho
  • Technology
  • Replies: 0
O if está a funcionar mas o window.location não vai para o google é somente um exemplo mas penso que explique o erro.

Code: 
function eliminaParagem (){
    var confirma =confirm("Tem a certeza que quer eliminar a paragem");
    if (confirma==true){
        window.location.href="wwww.google.pt";
    } 
}

ScriptManager.RegisterStartupScript e a Key

  • Joao Rezende
  • Technology
  • Replies: 0
Boa tarde,

Queria entender como funciona essa Key, tenho uma função no aspx que necessito no code-behind, mas quando a chamo com uma Key estática, colocando csname = "x"; Ela só é chamada uma vez, mas preciso que seja chamada quantas vezes for necessário, daí tentei colocar o nome como variável e ela nunca é chamada, mesmo sem o if (!Page.ClientScript.IsStartupScriptRegistered(Page.GetType(), csname))

Eis o código, este código coloca os itens em um mesmo row de uma gridview, depois ele verifica se colocará o ícone de Expand naquele row, para que o mesmo possa ser expandido quando clicarmos no ícone.

Code: 
protected void gvProduct_RowDataBound(object sender, GridViewRowEventArgs e)
    {
        if (e.Row.RowType == DataControlRowType.DataRow)
        {
            HyperLink hlProcesso = (HyperLink)e.Row.FindControl("hlProcesso");
            GridView gvRepetidos = (GridView)e.Row.FindControl("gvRepetidos");                
            DataTable dtNew = dtFormsFilhos.Clone();
            bool isRepetido = false;                

            foreach (DataRow row in dtFormsFilhos.Rows)
            {
                if (row["ProcessoFilho"].ToString().Contains(hlProcesso.Text))
                {
                    dtNew.Rows.Add(row.ItemArray);
                    isRepetido = true;                          
                }                    
            }

            if (isRepetido)
            {
                //se coloco o csname como "x" ou "inclui", funciona 1x
                //mas se coloco como está, não funciona. Não entendo como essa key funciona!
                string csname = hlProcesso.Text.ToString();
                string cstext = "IncluiExpand('" + hlProcesso.Text + "')";
                if (!Page.ClientScript.IsStartupScriptRegistered(Page.GetType(), csname))
                    ScriptManager.RegisterStartupScript(this.Page, this.Page.GetType(), csname, cstext, true);
            }

            gvRepetidos.DataSource = dtNew;
            gvRepetidos.DataBind();                
        }
    }
Top