Gotowe bibliografie tematyczne / Doubly chained tree structures

Spis treści

  1. Artykuły w czasopismach
  2. Części książek

Gotowa bibliografia na temat „Doubly chained tree structures”

Autor: Grafiati
Data publikacji: 6 września 2023
Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Doubly chained tree structures”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Doubly chained tree structures"

1

Suraweera, F. "Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching." Computer Journal 29, no. 1 (1986): 52–59. http://dx.doi.org/10.1093/comjnl/29.1.52.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Banaru, D. A., S. M. Aksenov, A. M. Banaru, and K. A. Potekhin. "STRUCTURAL CLASSES WITH A SOLE BEARING CONTACT OF CHAINED STRUCTURAL UNITS." Кристаллография 68, no. 4 (2023): 546–65. http://dx.doi.org/10.31857/s0023476123600246.

Pełny tekst źródła
Streszczenie:
Structural classes of the crystal structures consisting of mutually parallel chains of structural units (polymers) and constructed due to the sole bearing contact between polymer chains have been derived. In total, 43 structure classes have been found. Nets of bearing contacts in these classes belong to topological types sql, hxl, hcb, kgm, kgd, 2,4L2 and some other types of nets with doubly coordinated vertices. Examples of crystal structures of inorganic and organic polymers are presented.
Style APA, Harvard, Vancouver, ISO itp.
3

Kuske, Dietrich, and Markus Lohrey. "Automatic structures of bounded degree revisited." Journal of Symbolic Logic 76, no. 4 (2011): 1352–80. http://dx.doi.org/10.2178/jsl/1318338854.

Pełny tekst źródła
Streszczenie:
AbstractThe first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic structure of bounded degree is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). This result is shown to be optimal since we also present a string automatic structure of bounded degree whose first-order theory is hard for 2EXPSPACE. We prove similar results also for tree automatic structures. These f
Style APA, Harvard, Vancouver, ISO itp.
4

Lohmann, Simon, and Dietmar Tutsch. "The Doubly Linked Tree of Singly Linked Rings: Providing Hard Real-Time Database Operations on an FPGA." Computers 13, no. 1 (2023): 8. http://dx.doi.org/10.3390/computers13010008.

Pełny tekst źródła
Streszczenie:
We present a hardware data structure specifically designed for FPGAs that enables the execution of the hard real-time database CRUD operations using a hybrid data structure that combines trees and rings. While the number of rows and columns has to be limited for hard real-time execution, the actual content can be of any size. Our structure restricts full navigational freedom to every but the leaf layer, thus keeping the memory overhead for the data stored in the leaves low. Although its nodes differ in function, all have exactly the same size and structure, reducing the number of cascaded deci
Style APA, Harvard, Vancouver, ISO itp.
5

Wang, Yingxu, and Aderemi Adewumi. "The Formal Design Models of Digraph Architectures and Behaviors." International Journal of Software Science and Computational Intelligence 4, no. 1 (2012): 100–129. http://dx.doi.org/10.4018/jssci.2012010105.

Pełny tekst źródła
Streszczenie:
Graphs are one of the most fundamental and widely used non-linear hierarchical structures of linked nodes. Problems in sciences and engineering can be formulated and solved by the graph model. This paper develops a comprehensive design pattern of formal digraphs using the Doubly-Linked List (DLL) architecture. The most complicated form of graphs known as the weighted digraph is selected as a general graph model, based on it simple graphs such as nondirected and/or nonweighted ones can be easily derived and tailored. A rigorous denotational mathematics, Real-Time Process Algebra (RTPA), is adop
Style APA, Harvard, Vancouver, ISO itp.
6

Chen, Xiaoyu, Xuhui Zhang, Yan Guo, and Fulin Zhu. "Modeling and performance analysis of a curve-shaped based doubly clamped piezoelectric energy harvester (CD-PEH)." Journal of Intelligent Material Systems and Structures, July 29, 2023. http://dx.doi.org/10.1177/1045389x231181493.

Pełny tekst źródła
Streszczenie:
In this paper, a curve-shaped based doubly clamped piezoelectric energy harvester (CD-PEH) is explored for improving the energy harvesting performance. The harvester consists of a composed beam constructed with two arc-shaped structures and a flat beam, as well as two proof masses. A method based on chained beam constraint model theory (CBCM) is first applied to build the nonlinear restoring force model of the CD-PEH, the developed analytical model is validated by the finite element analysis (FEA). Then the electromechanically coupled model for the CD-PEH is built to investigate the effect of
Style APA, Harvard, Vancouver, ISO itp.
7

Klarlund, Nils, and Michael I. Schwartzbach. "Graph Types." DAIMI Report Series 21, no. 421 (1992). http://dx.doi.org/10.7146/dpb.v21i421.7952.

Pełny tekst źródła
Streszczenie:
Recursive data structures are abstractions of simple records and pointers. They impose a <em> shape</em> invariant, which is verified at compile-time and exploited to automatically generate code for building, copying, comparing, and traversing values without loss of efficiency. However, such values are always tree shaped, which is a major obstacle to practical use. We propose a notion of <em> graph types </em>, which allow common shapes, such as doubly-linked lists or threaded trees, to be expressed concisely and efficiently. We define regular languages of <em> ro
Style APA, Harvard, Vancouver, ISO itp.
8

KC, Akshay, Balachandra Muniyal, and Vikalp Parashar. "Optimizing data retrieval for enhanced data integrity verification in cloud environments." Open Engineering 14, no. 1 (2024). http://dx.doi.org/10.1515/eng-2024-0058.

Pełny tekst źródła
Streszczenie:
Abstract In today’s rapidly evolving digital landscape, the urgency to secure data within expansive cloud storage systems has reached unprecedented levels. Conventional remote storage methods, while widely used, are inherently vulnerable to security breaches, corruption, and tampering. Recognizing this critical challenge, a state-of-the-art protocol has emerged to address these vulnerabilities head-on. This innovative solution integrates a sophisticated binary search tree (BST) structure with elliptic curve cryptography, ensuring not only efficient data retrieval but also robust encryption mec
Style APA, Harvard, Vancouver, ISO itp.
9

Ünlü, Ali. "Qualitative motivation with sets and relations." Frontiers in Psychology 13 (January 25, 2023). http://dx.doi.org/10.3389/fpsyg.2022.993660.

Pełny tekst źródła
Streszczenie:
In self-determination theory (SDT), multiple conceptual regulations of motivation are posited. These forms of motivation are especially qualitatively viewed by SDT researchers, and there are situations in which combinations of these regulations occur. In this article, instead of the commonly used numerical approach, this is modeled more versatilely by sets and relations. We discuss discrete mathematical models from the theory of knowledge spaces for the combinatorial conceptualization of motivation. Thereby, we constructively add insight into a dispute of opinions on the unidimensionality vs.
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Doubly chained tree structures"

1

Torre, Pilar, and David T. Kao. "A uniform analysis of trie structures that store prefixing-keys with application to doubly-chained prefixing-tries." In Mathematical Foundations of Computer Science 1996. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61550-4_177.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii