371 research outputs found
Modification to queueing system M/M/1 with Blum-Blum-Shub generator
No full textQueueing theory is a mathematical method which is used to investigate the queueing system behavior. In addition, it helps the facilities to build a queueing system for managing the waiting-line. In this paper, the researchers modified a type of queueing model simulation which is called ‘M/M/1’ by using a part of Blum-Blum-Shub algorithm. The simulation results reveals that the arrangement of waiting-line is mostly equivalent in graphs, yet there is a difference in the rate interval boundaries. It becomes lower than the original M/M/1 simulation. That leads to present an indication of predicting the optimal waiting-line to manage the queueing process in consuming a minimal time. More precisely, the total average of mean number of boxes in queue of MM1 and MM1BBS are (0.9027 and 0.2560), and the mean delay in the system evaluated as (0.0481 and 0.03373), while the utilization rates are (0.5498 and 0.5707)
The distribution of the maximum condition number on great circles through a fixed 2×2 real matrix
No full textAbstractIf PA(χ) denotes the probability that the maximum condition number along a great circle passing through a matrix A in the unit sphere in the space of 2×2 matrices is less than χ, then PA(χ) always attains its maximum at the normalized identity matrix. This result is the first nontrivial case of a linear algebra version of a conjecture formulated in Shub and Smale (M. Shub and S. Smale, Theoretical Computer Science 113 (1994) 141–164) for homotopies of systems of homogeneous equations. The Hopf fibration is used to relate the probability PA(χ) to the area of an `ellipse' on a sphere in R3
Esfir Shub och kompilationsfilmen : en analys av montaget i Romanovdynastins fall
No full textThis essay is a product of the author’s interest in silent films from Soviet, especially, documentary films. Before the 1920’s documentary filmmaking had mostly been limited to newsreels and short scenes. Only occasional feature-length documentaries had been made. During the 1920s, documentary film achieved new status, not only because of its use as propaganda; it was also identified as artistic cinema. Discussions how to use this genre were taking place all over Europe, and in the US. In France, many different journals on cinema were started. In Soviet the discussions later became politicised. It was a good climate for groundbreaking cinema, and Esfir Shub was one of the film pioneers in Soviet. The ambition with the essay is to give Esfir Shub theoretical approach to non-fiction film a greater acknowledgement. The thesis is how Esfir Shub combines titles and pictures with cutting in The Fall of the Romanov Dynasty (1927) and to theorise the film with Shub’s own conceptual ideas. The method is close reading of the film and the articles written by Shub. The conclusions made by the author, is that Shub uses titles and pictures, in a dynamic cross-cutting between the oppressor and the oppressed. She is faithful to her own theories. She is only using authentically material and not played scenes; otherwise she would distort historical facts. The montage is built in two different ways. Firstly Shub use an ironic tone in the titles when she introduces the oppressors from the old regime, and comment these images widely. Secondly she uses pictures of typical symbols of capitalism and does not need to comment in such matter as earlier, because the film material she had captured speaks for itself
[EFF15S4] Session 4: Rediscovering Esfir Shub: The Compilation Film and the Art of the Editing Table
No full text25 March 2015, 11:30, Birkbeck Cinema
This event combined screenings and discussion to explore the work of Esfir Shub (1894-1959), often considered the inventor of the compilation film, and undoubtedly a major figure in the history of documentary filmmaking. Although her name is always cited in histories of Soviet film and documentary cinema, Shub’s films are rarely if ever seen, with the exception of The Fall of the Romanoff Dynasty (1927). This study day featured screenings of rare films (notably Today and Komsomol: Patron of Electrification), as well as a re-evaluation of Shub’s role as an artist and as a pioneer of the recycling of archive footage in the essay film tradition.
Films: Today [Segodnya], Esfir Shub, Russia, 1930, 35mm, 70 minutes, Russian with English subtitles
Repurposing newsreels and other documentary materials, Shub creates a montage film that seeks to demonstrate the differences between life in communist and capitalist societies.
Komsomol: Patron of Electrification [K.S.E. – Komsomol Shef Elektrifikatsii], Esfir Shub, Russia, 1932, digital, 55 minutes, Russian with English subtitles
A very early Soviet sound film, Shub’s experimental documentary portrays the process of electrification across Soviet society and industry.
Panel:
• Michael Chanan (University of Roehampton, writer and filmmaker, notably The American Who Electrified Russia, 2009)
• Bernard Eisenschitz (film historian, Paris, author of Nicholas Ray: An American Journey, Faber & Faber, 1993, and Gels et dégels: une autre histoire du cinéma soviétique 1926-1968, Mazzotta, 2013)
• Esther Leslie (Birkbeck, author of Hollywood Flatlands: Animation, Critical Theory and the Avant-Garde, Verso, 2004, and Walter Benjamin, reaction, 2007)
• Graham Roberts (University of Leeds Trinity, author of Forward Soviet: History and Non-Fiction Film in the Soviet Union, I.B. Tauris, 1998, and Man with the Movie Camera, I.B. Tauris, 1999
Analisis Pola Identifikasi Zero Knowledge Proof Dengan Algoritma Feige Fiat Shamir Menggunakan Blum Blum Shub
No full textProtocol Zero Knowledge Proof is one of the protocols in Cryptography that has a fairly good level of security, because it applies the concept of "Truly Zero Knowledge Proof" which is not leaking any information. This protocol is used in the Fiat Shamir, Guillou Quisquater and Schnorr Feige Algorithms, all of which are Cryptographic Algorithms using private keys and public keys. In the Public key, all three of these Algorithms use a random number generator at the values p and q to get the public key. In this study, the author will generate a public key generation test using CPRNG (Cryptographically-secure Pseudo-Random Number Generator) with the Blum Blum Shub algorithm. The test will be conducted on the Fiat Feige Algorithm, the formation of the key will use the Blum Blum Shub Algorithm, but the Identification Protocol still uses the Fiat Shamir Feige Algorithm. The results of this study show the Feige Fiat Algorithm with the Blum Blum Shub Algorithm as the key builder successfully identifies the pattern sent by the signer
Analisis Pola Identifikasi Zero Knowledge Proof dengan Algoritma Feige Fiat Shamir Menggunakan Blum Blum Shub
No full textProtocol Zero Knowledge Proof is one of the protocols in Cryptography that has a fairly good level of security, because it applies the concept of "Truly Zero Knowledge Proof" which is not leaking any information. This protocol is used in the Fiat Shamir, Guillou Quisquater and Schnorr Feige Algorithms, all of which are Cryptographic Algorithms using private keys and public keys. In the Public key, all three of these Algorithms use a random number generator at the values p and q to get the public key. In this study, the author will generate a public key generation test using CPRNG (Cryptographically-secure Pseudo-Random Number Generator) with the Blum Blum Shub algorithm. The test will be conducted on the Fiat Feige Algorithm, the formation of the key will use the Blum Blum Shub Algorithm, but the Identification Protocol still uses the Fiat Shamir Feige Algorithm. The results of this study show the Feige Fiat Algorithm with the Blum Blum Shub Algorithm as the key builder successfully identifies the pattern sent by the signer
On the Kostlan–Shub–Smale model for random polynomial systems. Variance of the number of roots
No full textAbstractWe consider a random polynomial system with m equations and m real unknowns. Assume all equations have the same degree d and the law on the coefficients satisfies the Kostlan–Shub–Smale hypotheses. It is known that E(NX)=dm/2 where NX denotes the number of roots of the system. Under the condition that d does not grow very fast, we prove that limsupm→+∞VarNXdm/2⩽1. Moreover, if d⩾3 then VarNXdm/2→0 as m→+∞, which implies NXdm/2→1 in probability
Wilkinson's work was partly funded by NSF Grant #DMS-0100314.
No full textA key feature of a general nonlinear partially hyperbolic dynamical system is the absence of dierentiability of its invariant splitting. In this paper, we show that often partial derivatives of the splitting exist and the splitting depends smoothly on the dynamical system itself. Dedicated to David Ruelle on his 65th birthday. October 15, 2002 Shub's work was partly funded by NSF Grant #DMS-9988809. Wilkinson's work was partly funded by NSF Grant #DMS-0100314. 1
A self-splicing group I intron in the DNA polymerase gene of bacillus subtilis bacteriophage SPO1
No full textWe report a self-splicing intron in bacteriophage SPO1, whose host is the gram-positive Bacillus subtilis. The intron contains all the conserved features of primary sequence and secondary structure previously described for the group IA introns of eukaryotic organelles and the gram-negative bacteriophage T4. The SPO1 intron contains an open reading frame of 522 nucleotides. As in the T4 introns, this open reading frame begins in a region that is looped out of the secondary structure, but ends in a highly conserved region of the intron core. The exons encode SPO1 DNA polymerase, which is highly similar to E. coli DNA polymerase I. The demonstration of self-splicing introns in viruses of both gram-positive and gramnegative eubacteria lends further evidence for their early origin in evolution. © 1990
- …
