Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "computation models" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    A sequential method for the synthesis of formulae of algorithms
    Autorzy:
    Ovsyak, V.
    Ovsyak, O.
    Powiązania:
    https://bibliotekanauki.pl/articles/114500.pdf
    Data publikacji:
    2015
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    computation models
    algebra of algorithms
    synthesis of algorithms
    minimization of algorithm
    Opis:
    New method for the synthesis of algorithm formulae based on the concept of algorithm algebra is presented. The concept of algorithm algebra there is shown in papers [1-4]. The synthesis is performed in two stages. First, all sequences are formulated, which is followed by the bonding the sequences by conditions. This operation is termed by elimination. If the algorithm contains a cyclic operations, then each cyclic operation is considered as a complex one, over which the synthesis of sequences and eliminations are successively performed. Additionally, the algorithm algebra tools for transformation and minimization of algorithms are illustrated by a simple but instructive example.
    Źródło:
    Measurement Automation Monitoring; 2015, 61, 1; 21-23
    2450-2855
    Pojawia się w:
    Measurement Automation Monitoring
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Models of quantum computation and quantum programming languages
    Autorzy:
    Miszczak, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/200159.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    programming languages
    models of computation
    Turing machine
    Opis:
    The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 3; 305-324
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Extending scientific computing system with structural quantum programming capabilities
    Autorzy:
    Gawron, P.
    Klamka, J.
    Miszczak, J.
    Winiarczyk, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/199942.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    quantum information
    quantum programming
    models of quantum computation
    Opis:
    We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave providing library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for higl-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices implemented in quantum-octave.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2010, 58, 1; 77-88
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Dynamic Turing Machine: model and properties for runtime code changes
    Autorzy:
    Rudy, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/305728.pdf
    Data publikacji:
    2016
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    computability theory
    models of computation
    Turing machine
    runtime code changes
    Opis:
    In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. This model is capable of applying runtime code modifications for 3-symbol deterministic Turing Machines at runtime and requires a decomposition of the simulated machine into parts called subtasks. The algorithm for performing runtime changes is considered, and the ability to apply runtime changes is studied through computer simulations. Theoretical properties of the proposed model, including computational power as well as time and space complexity, are studied and proven. Connections between the proposed model and Oracle Machines are discussed. Moreover, a possible method of implementation in real-life systems is proposed.
    Źródło:
    Computer Science; 2016, 17 (2); 187-224
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Modelling interactive computing systems: Do we have a good theory of what computers are?
    Autorzy:
    Martin, Alice
    Magnaudet, Mathieu
    Conversy, Stéphane
    Powiązania:
    https://bibliotekanauki.pl/articles/31804107.pdf
    Data publikacji:
    2022
    Wydawca:
    Copernicus Center Press
    Tematy:
    philosophy of computing
    models of computation
    interactive computing
    computing mechanism
    computational mechanistic explanation
    Opis:
    Computers are increasingly interactive. They are no more transformational systems producing a final output after a finite execution. Instead, they continuously react in time to external events that modify the course of computing execution. While philosophers have been interested in conceptualizing computers for a long time, they seem to have paid little attention to the specificities of interactive computing. We propose to tackle this issue by surveying the literature in theoretical computer science, where one can find explicit proposals for a model of interactive computing. In that field, the formal modelling of interactive computing systems has been brought down to whether the new interaction models are reducible to Turing Machines. There are three areas where interaction models are framed. The comparison between TMs and interactive system models is at stake in all of them. These areas are namely some works on concurrency by Milner, on Reactive Turing Machines, and on interaction as a new computing paradigm. For each of the three identified models, we present its motivation, sum up its account for interaction and its legacy, and point out issues regarding the understanding of computers. The survey shows difficulties for epistemologists. The reason is that these analyses focus on the formal equivalence between interactive models of computation and classic ones. Such a project is different from addressing how a computing machine can be interactive: in other words, which mechanisms allow it.
    Źródło:
    Zagadnienia Filozoficzne w Nauce; 2022, 73; 77-119
    0867-8286
    2451-0602
    Pojawia się w:
    Zagadnienia Filozoficzne w Nauce
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Extending the sheba propagatio model to reduce parameter-related uncertainties
    Autorzy:
    Pierantoni, G.
    Coghlan, B.
    Kenny, E.
    Gallagher, P.
    Perez-Suarez, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/305331.pdf
    Data publikacji:
    2013
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    heliophysics
    HELIO
    SCI-BUS
    distributed computation infrastructure
    propagation models
    Opis:
    Heliophysics is the branch of physics that investigates the interactions and correlation of different events across the Solar System. The mathematical models that describe and predict how physical events move across the solar system (ie. Propagation Models ) are of great relevance. These models depend on parameters that users must set, hence the ability to correctly set the values is key to reliable simulations. Traditionally, parameter values can be inferred from data either at the source (the Sun) or arrival point (the target) or can be extrapolated from common knowledge of the event under investigation. Another way of setting parameters for Propagation Models is proposed here: instead of guessing a priori parameters from scientific data or common knowledge, the model is executed as a parameter-sweep job and selects a posteriori the parameters that yield results most compatible with the event data. In either case ( a priori and a posteriori ), the correct use of Propagation Models requires information to either select the parameters, validate the results, or both. In order to do so, it is necessary to access sources of information. For this task, the HELIO project proves very effective as it offers the most comprehensive integrated information system in this domain and provides access and coordination to services to mine and analyze data. HELIO also provides a Propagation Model called SHEBA, the extension of which is currently being developed within the SCI-BUS project (a coordinated effort for the development of a framework capable of offering to science gateways seamless access to major computing and data infrastructures).
    Źródło:
    Computer Science; 2013, 14 (2); 253-272
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    SAT-based bounded model checking for timed interpreted systems and the RTECTLK properties
    Autorzy:
    Woźna-Szcześniak, B.
    Szcześniak, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/951862.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
    Tematy:
    model czasowy
    logika czasowa
    drzewo obliczeń
    timed models
    timed logic
    computation tree
    Opis:
    We define an SAT-based bounded model checking (BMC) method for RTECTLK (the existential fragment of the real-time computation tree logic with knowledge) that is interpreted over timed models generated by timed interpreted systems. Specifically, we translate the model checking problem for RTECTLK to the model checking problem for a variant of branching temporal logic (called EyCTLK) interpreted over an abstract model, and we redefine an SAT-based BMC technique for EyCTLK.
    Źródło:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2015, 20; 69-81
    2450-9302
    Pojawia się w:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Probabilistic adaptive computation time
    Autorzy:
    Figurnov, M.
    Sobolev, A.
    Vetrov, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/201248.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    deep learning
    probabilistic models
    adaptive computation time
    uczenie głębokie
    modele probabilistyczne
    adaptacyjny czas obliczeniowy
    Opis:
    We present a probabilistic model with discrete latent variables that control the computation time in deep learning models such as ResNets and LSTMs. A prior on the latent variables expresses the preference for faster computation. The amount of computation for an input is determined via amortized maximum a posteriori (MAP) inference. MAP inference is performed using a novel stochastic variational optimization method. The recently proposed adaptive computation time mechanism can be seen as an ad-hoc relaxation of this model. We demonstrate training using the general-purpose concrete relaxation of discrete variables. Evaluation on ResNet shows that our method matches the speed-accuracy trade-off of adaptive computation time, while allowing for evaluation with a simple deterministic procedure that has a lower memory footprint.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 6; 811-820
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies