Thematische Bibliographien / Shorův algoritmus

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Shorův algoritmus“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 17. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Shorův algoritmus" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Shorův algoritmus"

Litinskaia, Evgeniia L., Pavel A. Rudenko, Kirill V. Pozhar und Nikolai A. Bazaev. „Validation of Short-Term Blood Glucose Prediction Algorithms“. International Journal of Pharma Medicine and Biological Sciences 8, Nr. 2 (April 2019): 34–39. http://dx.doi.org/10.18178/ijpmbs.8.2.34-39.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cherckesova, Larissa, Olga Safaryan, Pavel Razumov, Irina Pilipenko, Yuriy Ivanov und Ivan Smirnov. „Speed improvement of the quantum factorization algorithm of P. Shor by upgrade its classical part“. E3S Web of Conferences 224 (2020): 01016. http://dx.doi.org/10.1051/e3sconf/202022401016.

Der volle Inhalt der Quelle

Annotation:

This report discusses Shor’s quantum factorization algorithm and ρ–Pollard’s factorization algorithm. Shor’s quantum factorization algorithm consists of classical and quantum parts. In the classical part, it is proposed to use Euclidean algorithm, to find the greatest common divisor (GCD), but now exist large number of modern algorithms for finding GCD. Results of calculations of 8 algorithms were considered, among which algorithm with lowest execution rate of task was identified, which allowed the quantum algorithm as whole to work faster, which in turn provides greater potential for practical application of Shor’s quantum algorithm. Standard quantum Shor’s algorithm was upgraded by replacing the binary algorithm with iterative shift algorithm, canceling random number generation operation, using additive chain algorithm for raising to power. Both Shor’s algorithms (standard and upgraded) are distinguished by their high performance, which proves much faster and insignificant increase in time in implementation of data processing. In addition, it was possible to modernize Shor’s quantum algorithm in such way that its efficiency turned out to be higher than standard algorithm because classical part received an improvement, which allows an increase in speed by 12%.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ekerå, Martin. „Quantum algorithms for computing general discrete logarithms and orders with tradeoffs“. Journal of Mathematical Cryptology 15, Nr. 1 (01.01.2021): 359–407. http://dx.doi.org/10.1515/jmc-2020-0006.

Der volle Inhalt der Quelle

Annotation:

Abstract We generalize our earlier works on computing short discrete logarithms with tradeoffs, and bridge them with Seifert's work on computing orders with tradeoffs, and with Shor's groundbreaking works on computing orders and general discrete logarithms. In particular, we enable tradeoffs when computing general discrete logarithms. Compared to Shor's algorithm, this yields a reduction by up to a factor of two in the number of group operations evaluated quantumly in each run, at the expense of having to perform multiple runs. Unlike Shor's algorithm, our algorithm does not require the group order to be known. It simultaneously computes both the order and the logarithm. We analyze the probability distributions induced by our algorithm, and by Shor's and Seifert's order-finding algorithms, describe how these algorithms may be simulated when the solution is known, and estimate the number of runs required for a given minimum success probability when making different tradeoffs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Devitt, S. J., A. G. Fowler und L. C. L. Hollenberg. „Robustness of Shor's algorithm“. Quantum Information and Computation 6, Nr. 7 (November 2006): 616–29. http://dx.doi.org/10.26421/qic6.7-5.

Der volle Inhalt der Quelle

Annotation:

Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this subroutine when exposed to a discrete error model that acts to perturb the computational trajectory of a quantum computer. Through detailed state vector simulations of an appropriate quantum circuit, we show that the error locations within the circuit itself heavily influences the probability of success of the QPF subroutine. The results also indicate that the naive estimate of required component precision is too conservative.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Akbar, Rahmad, Bambang Pramono und Rizal Adi Saputra. „Implementasi Algoritma Simon Pada Aplikasi Kamus Perubahan Fi’il (Kata Kerja Bahasa Arab) Berbasis Android“. Ultimatics : Jurnal Teknik Informatika 13, Nr. 1 (11.06.2021): 12–18. http://dx.doi.org/10.31937/ti.v13i1.1850.

Der volle Inhalt der Quelle

Annotation:

Kata kunci—Algoritma String Matching, Algoritma Simon, Kamus Perubahan Fi’il Android Ilmu Shorof atau Tashrif adalah bidang keilmuan derivasi kata dalam Bahasa Arab, salah satu fokus pembahasan bidang ilmu tersebut ialah proses perubahan kata kerja atau disebut juga dengan Fi’il menjadi beberapa jenis kata yang lain, seperti Fi’il Mudhori’, Fi’il Madhi, Fi’il Amr, Fi’il Nahi, Isim Fa’il, Isim Maf’ul, Isim Zaman, Isim Makan, Isim Alat, Masdar maupun Masdar mim. Proses pembelajaran ilmu Shorof masih banyak dilakukan dengan cara tradisional, terutama dilingkungan pesantren dengan cara menghafal turunan-turunan kata tersebut beserta terjemahanya. Sedangkan salah satu kitab dasar yang sering digunakan ialah kitab Amtsilah At-Tashrifiyah karangan KH.Ma'shum bin Ali sebagai rujukan proses perubahan kata, sedangakan untuk mencari terjemahan dalam Bahasa Indonesia harus menggunakan kamus Arab-Indonesia. Penelitian ini bertujuan untuk mempermudah proses pencarian kata dengan cara membuat kamus perubahan Fi’il berbasis android dan memanfaatkan Algoritma Simon sebagai metode pencarian katanya, sehingga dapat mempermudah proses pembelajaran ilmu Shorof. Algoritma Simon merupakan salah satu algoritma string matching dengan fase pencocokannya dilakukan dari kiri ke kanan dengan tahapan inisialisasi tiap indeks pada pola yang diberikan. Setelah dilakukan pengujian, proses pencarian kata dapat dilakukan dengan rata-rata running time yang dibutuhkan selama 3,67097786 mili second untuk pencarian kata dalam Bahasa Indonesia dan 23,8447333 mili second untuk pencarian kata dalam Bahasa Arab

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liu, Ye-Chao, Jiangwei Shang und Xiangdong Zhang. „Coherence Depletion in Quantum Algorithms“. Entropy 21, Nr. 3 (07.03.2019): 260. http://dx.doi.org/10.3390/e21030260.

Der volle Inhalt der Quelle

Annotation:

Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these algorithms. For all the quantum algorithms that we investigated, including Grover’s algorithm, Deutsch–Jozsa algorithm, and Shor’s algorithm, quantum coherence of the system states reduces to the minimum along with the successful execution of the respective processes. Notably, a similar conclusion cannot be drawn using other quantitative measures such as quantum entanglement. Thus, we expect that coherence depletion as a common feature can be useful for devising new quantum algorithms in the future.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kendon, V. M., und W. J. Munro. „Entanglement and its role in Shor's algorithm“. Quantum Information and Computation 6, Nr. 7 (November 2006): 630–40. http://dx.doi.org/10.26421/qic6.7-6.

Der volle Inhalt der Quelle

Annotation:

Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their classical counterparts. The nature of this resource is still not fully understood: here we use numerical simulation to investigate how entanglement between register qubits varies as Shor's algorithm is run on a quantum computer. The shifting patterns in the entanglement are found to relate to the choice of basis for the quantum Fourier transform.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Savran, I., M. Demirci und A. H. Yılmaz. „Accelerating Shor’s factorization algorithm on GPUs“. Canadian Journal of Physics 96, Nr. 7 (Juli 2018): 759–61. http://dx.doi.org/10.1139/cjp-2017-0768.

Der volle Inhalt der Quelle

Annotation:

Shor’s quantum algorithm is very important for cryptography, because it can factor large numbers much faster than classical algorithms. In this study, we implement a simulator for Shor’s quantum algorithm on graphic processor units (GPU) and compare our results with Liquid, which is a Microsoft quantum simulation platform, and two classical CPU implementations. We evaluate 10 benchmarks for comparing our GPU implementation with Liquid and single-core implementation. The analysis shows that GPU vector operations are more suitable for Shor’s quantum algorithm. Our GPU kernel function is compute-bound, due to all threads in a block reaching the same element of the state vector. Our implementation has 52.5× speedup over single-core algorithm and 20.5× speedup over Liquid.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

GAWRON, P., und J. A. MISZCZAK. „NUMERICAL SIMULATIONS OF MIXED STATE QUANTUM COMPUTATION“. International Journal of Quantum Information 03, Nr. 01 (März 2005): 195–99. http://dx.doi.org/10.1142/s0219749905000748.

Der volle Inhalt der Quelle

Annotation:

We describe the [Formula: see text] package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations — partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum error correction codes. A simulation of Shor's algorithm is presented as an example of package capabilities.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Muruganantham, B., P. Shamili, S. Ganesh Kumar und A. Murugan. „Quantum cryptography for secured communication networks“. International Journal of Electrical and Computer Engineering (IJECE) 10, Nr. 1 (01.02.2020): 407. http://dx.doi.org/10.11591/ijece.v10i1.pp407-414.

Der volle Inhalt der Quelle

Annotation:

Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum cryptography are Shor’s algorithm and the Grover’s’s algorithm. For finding the number of integer factorization of each photon, Shor’s algorithm is used. Grover’s’s algorithm used for searching the unsorted data. Shor’s algorithm overcomes RSA algorithm by high security. By the implementation of quantum cryptography, we are securing the information from the eavesdropper and thereby preventing data in the communication channel.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Shorův algoritmus"

Nwaokocha, Martyns. „Shorův algoritmus v kvantové kryptografii“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-445457.

Der volle Inhalt der Quelle

Annotation:

Kryptografie je velmi důležitým aspektem našeho každodenního života, protože poskytuje teoretický základ informační bezpečnosti. Kvantové výpočty a informace se také stávají velmi důležitou oblastí vědy kvůli mnoha aplikačním oblastem včetně kryptologie a konkrétněji v kryptografii veřejných klíčů. Obtížnost čísel do hlavních faktorů je základem některých důležitých veřejných kryptosystémů, jejichž klíčem je kryptosystém RSA . Shorův kvantový faktoringový al-goritmus využívá zejména kvantový interferenční účinek kvantového výpočtu k faktorovým semi-prime číslům v polynomiálním čase na kvantovém počítači. Ačkoli kapacita současných kvantových počítačů vykonávat Shorův algoritmus je velmi omezená, existuje mnoho rozsáhlých základních vědeckých výzkumů o různých technikách optimalizace algoritmu, pokud jde o faktory, jako je počet qubitů, hloubka obvodu a počet bran. v této práci jsou diskutovány, analyzovány a porovnávány různé varianty Shorova factoringového algoritmu a kvantových obvodů. Některé varianty Shorova algoritmu jsou také simulované a skutečně prováděné na simulátorech a kvantových počítačích na platformě IBM QuantumExperience. Výsledky simulace jsou porovnávány z hlediska jejich složitosti a míry úspěšnosti. Organizace práce je následující: Kapitola 1 pojednává o některých klíčových historických výsledcích kvantové kryptografie, uvádí problém diskutovaný v této práci a představuje cíle, kterých má být dosaženo. Kapitola 2 shrnuje matematické základy kvantového výpočtu a kryptografie veřejných klíčů a popisuje notaci použitou v celé práci. To také vysvětluje, jak lze k rozbití kryptosystému RSA použít realizovatelný algoritmus pro vyhledávání objednávek nebo factoring. Kapitola 3 představuje stavební kameny Shorova algoritmu, včetně kvantové Fourierovy transformace, kvantového odhadu fází, modulární exponentiace a Shorova algoritmu. Zde jsou také uvedeny a porovnány různé varianty optimalizace kvantových obvodů. Kapitola 4 představuje výsledky simulací různých verzí Shorova algoritmu. V kapitole 5 pojednejte o dosažení cílů disertační práce, shrňte výsledky výzkumu a nastíňte budoucí směry výzkumu.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nyman, Peter. „Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer“. Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Der volle Inhalt der Quelle

Annotation:

Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska problem som dekoherens hos kvantbitarna och instabilitet i kvantstrukturen skapar redan vid ett litet antal register tvivel om en snabb utveckling av kvantdatorer som verkligen fungerar. Trots detta kan man inte förneka att stora framsteg gjorts inom kvantteknologin. Det råder givetvis ett stort gap mellan skapandet av en leksakskvantdator med 10-15 kvantregister och att t.ex. tillgodose de tekniska förutsättningarna för det projekt på 100 kvantregister som aviserades för några år sen i USA. Det är också uppenbart att svårigheterna ökar ickelinjärt med ökningen av antalet register. Därför är simulering av kvantdatorer i klassiska datorer en viktig del av kvantdatorprojektet. Självklart kan man inte förvänta sig att en kvantalgoritm skall lösa ett NP-problem i polynomisk tid i en klassisk dator. Detta är heller inte syftet med klassisk simulering. Den klassiska simuleringen av kvantdatorer kommer att täcka en del av gapet mellan den teoretiskt matematiska formuleringen av kvantmekaniken och ett förverkligande av en kvantdator. Ett av de viktigaste problemen i vetenskapen om kvantdatorn är att utveckla ett nytt symboliskt språk för kvantdatorerna och att anpassa redan existerande symboliska språk för klassiska datorer till kvantalgoritmer. Denna avhandling ägnas åt en anpassning av det symboliska språket Mathematica till kända kvantalgoritmer och motsvarande simulering i klassiska datorer. Konkret kommer vi att representera Simons algoritm, Deutsch-Joszas algoritm, Grovers algoritm, Shors algoritm och kvantfelrättande koder i det symboliska språket Mathematica. Vi använder samma stomme i alla dessa algoritmer. Denna stomme representerar de karaktäristiska egenskaperna i det symboliska språkets framställning av kvantdatorn och det är enkelt att inkludera denna stomme i framtida algoritmer.

Quantum computing is an extremely promising project combining theoretical and experimental quantum physics, mathematics, quantum information theory and computer science. At the first stage of development of quantum computing the main attention was paid to creating a few algorithms which might have applications in the future, clarifying fundamental questions and developing experimental technologies for toy quantum computers operating with a few quantum bits. At that time expectations of quick progress in the quantum computing project dominated in the quantum community. However, it seems that such high expectations were not totally justified. Numerous fundamental and technological problems such as the decoherence of quantum bits and the instability of quantum structures even with a small number of registers led to doubts about a quick development of really working quantum computers. Although it can not be denied that great progress had been made in quantum technologies, it is clear that there is still a huge gap between the creation of toy quantum computers with 10-15 quantum registers and, e.g., satisfying the technical conditions of the project of 100 quantum registers announced a few years ago in the USA. It is also evident that difficulties increase nonlinearly with an increasing number of registers. Therefore the simulation of quantum computations on classical computers became an important part of the quantum computing project. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation. Classical simulation of quantum computations will cover part of the gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. One of the most important problems in "quantum computer science" is the development of new symbolic languages for quantum computing and the adaptation of existing symbolic languages for classical computing to quantum algorithms. The present thesis is devoted to the adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulation on the classical computer. Concretely we shall represent in the Mathematica symbolic language Simon's algorithm, the Deutsch-Josza algorithm, Grover's algorithm, Shor's algorithm and quantum error-correcting codes. We shall see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include this framework in future algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kugel, Felix. „Das Shor-Verfahren als stochastischer Algorithmus“. [S.l.] : [s.n.], 2006. http://137.193.200.177/ediss/kugel-felix/meta.html.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Thakkar, Darshan Suresh, und darshanst@gmail com. „FPGA Implementation of Short Word-Length Algorithms“. RMIT University. Electrical and Computer Engineering, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080806.140908.

Der volle Inhalt der Quelle

Annotation:

Short Word-Length refers to single-bit, two-bit or ternary processing systems. SWL systems use Sigma-Delta Modulation (SDM) technique to express an analogue or multi-bit input signal in terms of a high frequency single-bit stream. In Sigma-Delta Modulation, the input signal is coarsely quantized into a single-bit representation by sampling it at a much higher rate than twice the maximum input frequency viz. the Nyquist rate. This single-bit representation is almost exclusively filtered to remove conversion quantization noise and sample decimated to the Nyquist frequency in preparation for traditional signal processing. SWL algorithms have a huge potential in a variety of applications as they offer many advantages as compared to multi-bit approaches. Features of SWL include efficient hardware implementation, increased flexibility and massive cost savings. Field Programmable Gate Arrays (FPGAs) are SRAM/FLASH based integrated circuits that can be programmed and re-programmed by the end user. FPGAs are made up of arrays of logic gates, routing channels and I/O blocks. State-of-the-art FPGAs include features such as Advanced Clock Management, Dedicated Multipliers, DSP Slices, High Speed I/O and Embedded Microprocessors. A System-on-Programmable-Chip (SoPC) design approach uses some or all the aforementioned resources to create a complete processing system on the device itself, ensuring maximum silicon area utilization and higher speed by eliminating inter-chip communication overheads. This dissertation focuses on the application of SWL processing systems in audio Class-D Amplifiers and aims to prove the claims of efficient hardware implementation and higher speeds of operation. The analog Class-D Amplifier is analyzed and an SWL equivalent of the system is derived by replacing the analogue components with DSP functions wherever possible. The SWL Class-D Amplifier is implemented on an FPGA, the standard emulation platform, using VHSIC Hardware Description Languages (VHDL). The approach is taken a step forward by adding re-configurability and media selectivity and proposing SDM adaptivity to improve performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bandini, Michele. „Crittografia quantistica e algoritmo di Shor“. Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/17073/.

Der volle Inhalt der Quelle

Annotation:

In questo elaborato si cerca di dare un'idea di come funzioni un computer quantistico, portando come esempio l'Algoritmo di Shor per la fattorizzazione: si cerca di chiarirne la matematica e la fisica che vi stanno dietro e l'importanza applicativa e storica che ha avuto. Brevi cenni sull'odierna tecnologia dei calcolatori quantistici.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schilling, Gordian Hansjoerg. „Algorithms for short-term and periodic process scheduling and rescheduling“. Thesis, Imperial College London, 1998. http://hdl.handle.net/10044/1/7696.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Feng, Wenlan. „Modelling market demand and manufacturing response using genetic algorithms“. Thesis, Glasgow Caledonian University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361094.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Drobouchevitch, Inna G. „Design and analysis of algorithms for short-route shop scheduling problems“. Thesis, University of Greenwich, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285392.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Healy, Cornelius Thomas. „Short-length low-density parity-check codes : construction and decoding algorithms“. Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/7875/.

Der volle Inhalt der Quelle

Annotation:

Error control coding is an essential part of modern communications systems. LDPC codes have been demonstrated to offer performance near the fundamental limits of channels corrupted by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as cycles the iterative message passing decoding is known to be optimal and may converge in a single iteration, although identifying the message update schedule which allows single-iteration convergence is not trivial. At finite block lengths graphs without cycles have poor minimum distance properties and perform poorly even under optimal decoding. LDPC codes with large block length have been demonstrated to offer performance close to that predicted for codes of infinite length, as the cycles present in the graph are quite long. In this thesis, LDPC codes of shorter length are considered as they offer advantages in terms of latency and complexity, at the cost of performance degradation from the increased number of short cycles in the graph. For these shorter LDPC codes, the problems considered are: First, improved construction of structured and unstructured LDPC code graphs of short length with a view to reducing the harmful effects of the cycles on error rate performance, based on knowledge of the decoding process. Structured code graphs are particularly interesting as they allow benefits in encoding and decoding complexity and speed. Secondly, the design and construction of LDPC codes for the block fading channel, a particularly challenging scenario from the point of view of error control code design. Both established and novel classes of codes for the channel are considered. Finally the decoding of LDPC codes by the belief propagation algorithm is considered, in particular the scheduling of messages passed in the iterative decoder. A knowledge-aided approach is developed based on message reliabilities and residuals to allow fast convergence and significant improvements in error rate performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Resende, Diogo Soares. „Ferramenta trifásica para síntese e análise da proteção em sistemas desequilibrados“. Universidade Federal de Juiz de Fora (UFJF), 2016. https://repositorio.ufjf.br/jspui/handle/ufjf/3134.

Der volle Inhalt der Quelle

Annotation:

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-01-09T16:42:49Z No. of bitstreams: 1 diogosoaresresende.pdf: 5068811 bytes, checksum: e6f520585ffef78e123573bd1e41ff4d (MD5)
Approved for entry into archive by Diamantino Mayra (mayra.diamantino@ufjf.edu.br) on 2017-01-31T11:22:04Z (GMT) No. of bitstreams: 1 diogosoaresresende.pdf: 5068811 bytes, checksum: e6f520585ffef78e123573bd1e41ff4d (MD5)
Made available in DSpace on 2017-01-31T11:22:04Z (GMT). No. of bitstreams: 1 diogosoaresresende.pdf: 5068811 bytes, checksum: e6f520585ffef78e123573bd1e41ff4d (MD5) Previous issue date: 2016-09-01
FAPEMIG - Fundação de Amparo à Pesquisa do Estado de Minas Gerais
Esta dissertação propõe uma ferramenta computacional para síntese e análise da proteção em sistemas de subtransmissão e de distribuição de energia elétrica na presença de desequilíbrios. Tais sistemas, em especial os de distribuição, são geralmente desequilibrados e podem conter trechos mono, bi ou trifásicos, além de operarem com carregamento distribuído de maneira assimétrica, o que torna as grandezas elétricas observadas diferentes para cada fase analisada. Neste trabalho foram desenvolvidos dois métodos, que foram implementados na ferramenta proposta: (i) procedimentos automáticos para ajustes ótimo de dispositivos de proteção em sistemas de distribuição desequilibrados; (ii) método para a análise gráfica do desempenho da proteção aplicada a sistemas desequilibrados. A ferramenta proposta foi desenvolvida em ambiente MatLab e permite também a síntese dos ajustes de proteções de sobrecorrente (mediante a utilização de um Algoritmo Genético) e de distância, além de calcular as relações de transformação para TCs e TPs. A ferramenta foi calibrada através da comparação dos resultados obtidos pela mesma com os obtidos por equipamentos reais de proteção, tendo também sido realizados testes com diferentes sistemas da literatura.
This thesis proposes a computacional tool for synthesis and analysis of protection in electricity subtransmission and distribution systems in presence of imbalances. Such systems, in particular distribution, are generally unbalanced, and can contain mono-, bi- or triphasic sections, and operate with asymmetrically distributed loads, which makes electrical quantities observed different for each phase analyzed. In this work were developed two methods, which have been implemented in the proposed tool: (i) automatic procedures for optimal settings of protection devices in unbalanced distribution systems; (ii) method for graphical analysis of protection’s performance applied to unbalanced systems. The proposed tool was developed in MatLab and also allows the synthesis of overcurrent (using a Genetic Algorithm) and distance settings and calculates the transformation ratios to PTs and CTs. The tool is calibrated by comparing the results obtained by the same with those obtained by actual equipment protection, has also been made tests with different systems in the literature.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Shorův algoritmus"

Asquith, Paul. Short sales and trade classification algorithms. Cambridge, MA: National Bureau of Economic Research, 2008.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Burstein, Joseph. Exact numerical solutions of nonlinear differential equations, short algorithms: After three centuries of approximate methods. Boston: Metrics Press, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

1974-, Zomorodian Afra J., Hrsg. Advances in applied and computational topology: American Mathematical Society Short Course on Computational Topology, January 4-5, 2011, New Orleans, Louisiana. Providence, R.I: American Mathematical Society, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tschinkel, Yuri, Carlo Gasbarri, Steven Lu und Mike Roth. Rational points, rational curves, and entire holomorphic curves on projective varieties: CRM short thematic program, June 3-28, 2013, Centre de Recherches Mathematiques, Universite de Montreal, Quebec, Canada. Providence, Rhode Island: American Mathematical Society, 2015.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

United States. National Aeronautics and Space Administration., Hrsg. Development, refinement and testing of a short term solar flare pR[sic]ediction algorithm: Progress report, August 1992 - February, 1993. [Washington, DC: National Aeronautics and Space Administration, 1993.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

United States. National Aeronautics and Space Administration., Hrsg. FNAS short term solar flare prediction algorithm: Semi-annual report, February 1, 1993 - August 1, 1993. [Washington, DC: National Aeronautics and Space Administration, 1993.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Priest, Graham. Logic: A Very Short Introduction. Oxford University Press, 2017. http://dx.doi.org/10.1093/actrade/9780198811701.001.0001.

Der volle Inhalt der Quelle

Annotation:

Logic is often perceived as having little to do with the rest of philosophy, and even less to do with real life. Logic: A Very Short Introduction shows how wrong this conception is. It explores the philosophical roots of the subject, explaining how modern formal logic deals with issues ranging from the existence of God and the reality of time to paradoxes of probability and decision theory. Along the way, the basics of formal logic are explained in simple, non-technical terms, showing that logic is a powerful and exciting part of modern philosophy. It also covers the subjects of algorithms and axioms, and proofs in mathematics.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Voit, Eberhard O. Systems Biology: A Very Short Introduction. Oxford University Press, 2020. http://dx.doi.org/10.1093/actrade/9780198828372.001.0001.

Der volle Inhalt der Quelle

Annotation:

Systems biology came about as growing numbers of scientists and engineers from different fields created experimental methods and algorithms that supported the analysis of very large quantities of biological data. Systems Biology: A Very Short IntroductionÂ outlines the exciting processes and possibilities in this new field. It describes how modern biology enabled us to learn how intricately the expression of every gene is controlled, how signalling systems keep organisms running smoothly, how complicated even the simplest cells are, and how computational methods may help us understand these complex systems of life. It explores what this field is about, why it is needed, and how it will affect our understanding of life, particularly in the areas of personalized medicine, drug development, food and energy production, and sustainable stewardship of our environments.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

John F. Kennedy Space Center., Hrsg. Development of algorithms and error analyses for the short baseline lightning detection and ranging system. Kennedy Space Center, Fla: National Aeronautics and Space Administration, John F. Kennedy Space Center, 1998.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Shorův algoritmus"

Bläser, Markus, und Bodo Siebert. „Computing Cycle Covers without Short Cycles“. In Algorithms — ESA 2001, 368–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44676-1_31.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fishkin, Aleksei V. „Disk Graphs: A Short Survey“. In Approximation and Online Algorithms, 260–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24592-6_23.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Stetsyuk, Petro I. „Shor’s r-Algorithms: Theory and Practice“. In Optimization Methods and Applications, 495–520. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68640-0_24.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liebchen, Christian. „Finding Short Integral Cycle Bases for Cyclic Timetabling“. In Algorithms - ESA 2003, 715–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39658-1_64.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Elyash, Igor G. „Management of Short Bowel Syndrome“. In Clinical Algorithms in General Surgery, 201–2. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-98497-1_53.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mäkinen, Veli, Niko Välimäki, Antti Laaksonen und Riku Katainen. „Unified View of Backward Backtracking in Short Read Mapping“. In Algorithms and Applications, 182–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12476-1_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liang, Jie, und Ronald Jackups. „Sequence and Spatial Motif Discovery in Short Sequence Fragments“. In Encyclopedia of Algorithms, 1945–52. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_601.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liang, Jie, und Ronald Jackups. „Sequence and Spatial Motif Discovery in Short Sequence Fragments“. In Encyclopedia of Algorithms, 1–10. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_601-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Park, Kyewon Koh. „A Short Proof of Even α-Equivalence“. In Algorithms, Fractals, and Dynamics, 193–99. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4613-0321-3_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Danda, Umesh Sandeep, G. Ramakrishna, Jens M. Schmidt und M. Srikanth. „On Short Fastest Paths in Temporal Graphs“. In WALCOM: Algorithms and Computation, 40–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68211-8_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Shorův algoritmus"

Maknickienė, Nijolė, und Kristina Miškinytė. „SKAITMENINIŲ VALIUTŲ KAINŲ PROGNOZAVIMAS NAUDOJANT GILIOJO MOKYMOSI ALGORITMĄ“. In 23rd Conference for Young Researchers "Economics and Management". Vilnius Gediminas Technical University, 2020. http://dx.doi.org/10.3846/vvf.2020.033.

Der volle Inhalt der Quelle

Annotation:

Kriptovaliutos vis dar yra finansų rinkos naujovė ir iki galo neištirta finansinis instrumentas. Tai išlaiko kriptovaliutas įdomia ir aktualia tema, tiek mokslininkams, tiek reguliacinėms institucijoms bei investuotojams. Kriptovaliutų rinka yra auganti, nestabili ir nuolat besikeičianti, kas suteikia jai aukštą riziką ir plačias galimybes. Finansinis išmanymas ir toliaregiškas prognozavimas, nepasimetant pinigų vertės, rizikos ir nenuspėjamumo chaose yra ypač svarbus šiandieninėje ekonomikoje. Sudėtingas kriptovaliutų rinkos pobūdis reikalauja plataus profilio duomenų kiekio, kuriam apdoroti taikomi įvairūs metodai, tokie kaip statistinė, techninė, sentimentų, sprendimų bei kita analizė. Ankstesni tyrimai kriptovaliutų kainas numatė dviem būdais: empirine analize ir mašinų mokymosi algoritmų analize. Šiame straipsnyje testuojamas giliojo mokymosi algoritmo taikymo galimybės kriptovaliutų kainų prognozavime. Taikant ilgalaikės trumpalaikės atminties tinklo (angl. long, short-term network, toliau LSTM) algoritmą, prognozuojamas trumpalaikis kriptovaliutų kainų kitimas bei įvertinamas sugeneruotų duomenų tikslumas. Rezultatai parodė, kad giliojo mokymosi algoritmas kainas prognozuoja su maža paklaida ir tiksliai nuspėję kainos pokyčio tendenciją, kas leidžia teigti, kad giliojo mokymosi algoritmas yra efektyvi rizikos mažinimo priemonė finansų rinkoje.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

CHOFFRUT, CHRISTIAN. „A SHORT INTRODUCTION TO AUTOMATIC GROUP THEORY“. In Semigroups, Algorithms, Automata and Languages. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812776884_0004.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

„De Novo Short Read Assembly Algorithm with Low Memory Usage“. In International Conference on Bioinformatics Models, Methods and Algorithms. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004881002150220.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sharma, Shashank, und Ankit Singhal. „De-Novo Assembly of Short Reads in Minimal Overlap Model“. In International Conference on Bioinformatics Models, Methods and Algorithms. SCITEPRESS - Science and and Technology Publications, 2015. http://dx.doi.org/10.5220/0005214100440054.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

„The Distribution of Short Word Match Counts between Markovian Sequences“. In International Conference on Bioinformatics Models, Methods and Algorithms. SciTePress - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004203700250033.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mucha, Marcin. „Lyndon Words and Short Superstrings“. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.69.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Castillo, K., und F. R. Rafaeli. „A short note on interlacing and monotonicity of zeros of orthogonal polynomials“. In NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms”. Author(s), 2016. http://dx.doi.org/10.1063/1.4965368.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bremler-Barr, Anat, Yotam Harchol, David Hay und Yacov Hel-Or. „Encoding Short Ranges in TCAM Without Expansion“. In SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2935764.2935769.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Feng, X., Z. Meng und I. H. Sudborough. „Improved upper bound for sorting by short swaps“. In 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/ispan.2004.1300465.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kirousis, Lefteris. „Coloring Random Graphs: A Short Survey“. In 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2009. http://dx.doi.org/10.1109/synasc.2009.8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Shorův algoritmus"

Asquith, Paul, Rebecca Oman und Christopher Safaya. Short Sales and Trade Classification Algorithms. Cambridge, MA: National Bureau of Economic Research, Juli 2008. http://dx.doi.org/10.3386/w14158.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Plimpton, S. Fast parallel algorithms for short-range molecular dynamics. Office of Scientific and Technical Information (OSTI), Mai 1993. http://dx.doi.org/10.2172/10176421.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cable, S., T. Tajima und K. Umegaki. Particle simulation algorithms with short-range forces in MHD and fluid flow. Office of Scientific and Technical Information (OSTI), Juli 1992. http://dx.doi.org/10.2172/6970874.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, Juni 2021. http://dx.doi.org/10.18235/0003313.

Der volle Inhalt der Quelle

Annotation:

This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Downard, Alicia, Stephen Semmens und Bryant Robbins. Automated characterization of ridge-swale patterns along the Mississippi River. Engineer Research and Development Center (U.S.), April 2021. http://dx.doi.org/10.21079/11681/40439.

Der volle Inhalt der Quelle

Annotation:

The orientation of constructed levee embankments relative to alluvial swales is a useful measure for identifying regions susceptible to backward erosion piping (BEP). This research was conducted to create an automated, efficient process to classify patterns and orientations of swales within the Lower Mississippi Valley (LMV) to support levee risk assessments. Two machine learning algorithms are used to train the classification models: a convolutional neural network and a U-net. The resulting workflow can identify linear topographic features but is unable to reliably differentiate swales from other features, such as the levee structure and riverbanks. Further tuning of training data or manual identification of regions of interest could yield significantly better results. The workflow also provides an orientation to each linear feature to support subsequent analyses of position relative to levee alignments. While the individual models fall short of immediate applicability, the procedure provides a feasible, automated scheme to assist in swale classification and characterization within mature alluvial valley systems similar to LMV.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ruiz, Pablo, Craig Perry, Alejando Garcia, Magali Guichardot, Michael Foguer, Joseph Ingram, Michelle Prats, Carlos Pulido, Robert Shamblin und Kevin Whelan. The Everglades National Park and Big Cypress National Preserve vegetation mapping project: Interim report—Northwest Coastal Everglades (Region 4), Everglades National Park (revised with costs). National Park Service, November 2020. http://dx.doi.org/10.36967/nrr-2279586.

Der volle Inhalt der Quelle

Annotation:

The Everglades National Park and Big Cypress National Preserve vegetation mapping project is part of the Comprehensive Everglades Restoration Plan (CERP). It is a cooperative effort between the South Florida Water Management District (SFWMD), the United States Army Corps of Engineers (USACE), and the National Park Service’s (NPS) Vegetation Mapping Inventory Program (VMI). The goal of this project is to produce a spatially and thematically accurate vegetation map of Everglades National Park and Big Cypress National Preserve prior to the completion of restoration efforts associated with CERP. This spatial product will serve as a record of baseline vegetation conditions for the purpose of: (1) documenting changes to the spatial extent, pattern, and proportion of plant communities within these two federally-managed units as they respond to hydrologic modifications resulting from the implementation of the CERP; and (2) providing vegetation and land-cover information to NPS park managers and scientists for use in park management, resource management, research, and monitoring. This mapping project covers an area of approximately 7,400 square kilometers (1.84 million acres [ac]) and consists of seven mapping regions: four regions in Everglades National Park, Regions 1–4, and three in Big Cypress National Preserve, Regions 5–7. The report focuses on the mapping effort associated with the Northwest Coastal Everglades (NWCE), Region 4 , in Everglades National Park. The NWCE encompasses a total area of 1,278 square kilometers (493.7 square miles [sq mi], or 315,955 ac) and is geographically located to the south of Big Cypress National Preserve, west of Shark River Slough (Region 1), and north of the Southwest Coastal Everglades (Region 3). Photo-interpretation was performed by superimposing a 50 × 50-meter (164 × 164-feet [ft] or 0.25 hectare [0.61 ac]) grid cell vector matrix over stereoscopic, 30 centimeters (11.8 inches) spatial resolution, color-infrared aerial imagery on a digital photogrammetric workstation. Photo-interpreters identified the dominant community in each cell by applying majority-rule algorithms, recognizing community-specific spectral signatures, and referencing an extensive ground-truth database. The dominant vegetation community within each grid cell was classified using a hierarchical classification system developed specifically for this project. Additionally, photo-interpreters categorized the absolute cover of cattail (Typha sp.) and any invasive species detected as either: Sparse (10–49%), Dominant (50–89%), or Monotypic (90–100%). A total of 178 thematic classes were used to map the NWCE. The most common vegetation classes are Mixed Mangrove Forest-Mixed and Transitional Bayhead Shrubland. These two communities accounted for about 10%, each, of the mapping area. Other notable classes include Short Sawgrass Marsh-Dense (8.1% of the map area), Mixed Graminoid Freshwater Marsh (4.7% of the map area), and Black Mangrove Forest (4.5% of the map area). The NWCE vegetation map has a thematic class accuracy of 88.4% with a lower 90th Percentile Confidence Interval of 84.5%.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!