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ę "Algorithm of Discovery" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Mosaic reasoning for discoveries
    Autorzy:
    Stilman, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/91717.pdf
    Data publikacji:
    2013
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    algorithm optimizing warfighting
    Linguistic Geometry
    LG
    Algorithm of Discovery
    DNA
    mosaic
    Opis:
    We investigate structure of the Primary Language of the human brain as introduced by J. von Neumann in 1957. Two components have been investigated, the algorithm optimizing warfighting, Linguistic Geometry (LG), and the algorithm for inventing new algorithms, the Algorithm of Discovery. The latter is based on multiple thought experiments, which manifest themselves via mental visual streams (“mental movies”). There are Observation, Construction and Validation classes of streams. Several visual streams can run concurrently and exchange information between each other. The streams may initiate additional thought experiments, program them, and execute them in due course. The visual streams are focused employing the algorithm of “a child playing a construction set” that includes a visual model, a construction set, and the Ghost. Mosaic reasoning introduced in this paper is one of the major means to focusing visual streams in a desired direction. It uses analogy with an assembly of a picture of various colorful tiles, components of a construction set. In investigating role of mosaic reasoning in the Algorithm of Discovery, in this paper, I replay a series of four thought experiments related to the discovery of the structure of the molecule of DNA. Only the fourth experiment was successful. This series of experiments reveals how a sequence of failures eventually leads the Algorithm to a discovery. This series permits to expose the key components of the mosaic reasoning, tiles and aggregates, local and global matching rules, and unstructured environment. In particular, it reveals the aggregates and the rules that played critical role in the discovery of the structure of DNA. They include the generator and the plug-in aggregates, the transformation and complementarity matching rules, and the type of unstructured environment. For the first time, the Algorithm of Discovery has been applied to replaying discoveries not related to LG and even to mathematics.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 3; 147-173
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorithm for generalization of action rules to summaries
    Autorzy:
    Tzacheva, A. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/969800.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    action rules
    interestingness
    actionable knowledge discovery
    summaries
    diversity
    generalization
    flexible attributes
    cost of action rules
    Opis:
    A knowledge discovery system is prone to yielding plenty of patterns, presented in the form of rules. Sifting through to identify useful and interesting patterns is a tedious and time consuming process. An important measure of interestingness is: whether or not the pattern can be used in the decision making process of a business to increase profit. Hence, actionable patterns, such as action rules, are desirable. Action rules may suggest actions to be taken based on the discovered knowledge. In this way contributing to business strategies and scientific research. The large amounts of knowledge in the form of rules presents a challenge of identifying the essence, the most important part, of high usability. We focus on decreasing the space of action rules through generalization. In this paper, we propose an improved method for discovering short descriptions of action rules. The new algorithm produces summaries by maximizing the diversity of rule pairs, and minimizing the cost of the suggested actions.
    Źródło:
    Control and Cybernetics; 2010, 39, 2; 457-468
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A custom co-processor for the discovery of low autocorrelation binary sequences
    Autorzy:
    Russek, P.
    Karwatowski, M.
    Jamro, E.
    Wiatr, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/114571.pdf
    Data publikacji:
    2016
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    LABS
    SDLS algorithm
    custom processors
    HLS
    FPGA
    Opis:
    We present a custom processor that was designed to enhance algorithms of finding Low Autocorrelation Binary Sequences (LABS). Finding LABS is very computationally exhaustive, but no custom computing solutions have been reported in the literature so far. A computational kernel which allowed creating an effective single-purpose processor was determined and an appropriate architecture was proposed. The selected elements of the architecture were coded in High-Level Synthesis (HLS) language to speed up the design process. Afterwards, the processor was verified and tested in Xilinx’s Virtex7 FPGA. At the beginning of the paper, we briefly present the finding LABS problem and its importance. Later, we deliver the algorithm, its custom processor structure, and implementation results in terms of the processor performance, size and power.
    Źródło:
    Measurement Automation Monitoring; 2016, 62, 5; 154-156
    2450-2855
    Pojawia się w:
    Measurement Automation Monitoring
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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