Gotowe bibliografie tematyczne / Virtual binary tree

Gotowa bibliografia na temat „Virtual binary tree”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 19 lutego 2023

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

Wybierz rodzaj źródła:

Spis treści

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

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 "Virtual binary tree"

1

Stantic, Bela, Rodney Topor, Justin Terry i Abdul Sattar. "Advanced indexing technique for temporal data". Computer Science and Information Systems 7, nr 4 (2010): 679–703. http://dx.doi.org/10.2298/csis101020035s.

Pełny tekst źródła
Streszczenie:
The need for efficient access and management of time dependent data in modern database applications is well recognized and researched. Existing access methods are mostly derived from the family of spatial R-tree indexing techniques. These techniques are particularly not suitable to handle data involving open ended intervals, which are common in temporal databases. This is due to overlapping between nodes and huge dead space found in the database. In this study, we describe a detailed investigation of a new approach called ?Triangular Decomposition Tree? (TD-Tree). The underlying idea for the TD-Tree is to manage temporal intervals by virtual index structures relying on geometric interpretations of intervals, and a space partition method that results in an unbalanced binary tree. We demonstrate that the unbalanced binary tree can be efficiently manipulated using a virtual index. We also show that the single query algorithm can be applied uniformly to different query types without the need of dedicated query transformations. In addition to the advantages related to the usage of a single query algorithm for different query types and better space complexity, the empirical performance of the TD-tree has been found to be superior to its best known competitors.
Style APA, Harvard, Vancouver, ISO itp.
2

Yin, Ying Ying. "Three-Dimensional Simulation of Virtual Plants Branch Structure Based on Quasi Binary-Tree and L System". Advanced Materials Research 1049-1050 (październik 2014): 1650–53. http://dx.doi.org/10.4028/www.scientific.net/amr.1049-1050.1650.

Pełny tekst źródła
Streszczenie:
In order to simulate the plant branch structure in three-dimensional space, and extract the growth more efficiently, this paper presented a new method to simulate the structure of plant branch based on quasi binary-tree structure and three-dimensional L system. The results of the actual trees simulation shows that this method can describe the plants branch structure efficiently and provide a new way for the simulation of plants.
Style APA, Harvard, Vancouver, ISO itp.
3

Istyastono, Enade Perdana, Nunung Yuniarti, Maywan Hariono, Sri Hartati Yuliani i Florentinus Dika Octa Riswanto. "BINARY QUANTITATIVE STRUCTURE-ACTIVITY RELATIONSHIP ANALYSIS IN RETROSPECTIVE STRUCTURE-BASED VIRTUAL SCREENING CAMPAIGNS TARGETING ESTROGEN RECEPTOR ALPHA". Asian Journal of Pharmaceutical and Clinical Research 10, nr 12 (1.12.2017): 206. http://dx.doi.org/10.22159/ajpcr.2017.v10i12.20667.

Pełny tekst źródła
Streszczenie:
Objective: The objective of this study is to construct predictive unbiased structure-based virtual screening (SBVS) protocols to identify potent ligands for estrogen receptor alpha by combining molecular docking, protein-ligand interaction fingerprinting (PLIF), and binary quantitative structure-activity relationship (QSAR) analysis using recursive partition and regression tree method.Methods: Employing the enhanced version of a directory of useful decoys, SBVS protocols using molecular docking simulations, and PLIF were constructed and retrospectively validated. To avoid bias, SMILES format of the compounds was used. The predictive abilities of the SBVS protocols were then compared based on the enrichment factor (EF) and the F-measure values.Results: The SBVS protocols resulted in this research were SBVS_1 (employing docking scores of the best pose on every compound to rank the results and selecting compounds within 1% false positives as positive), SBVS_2 (employing decision tree resulted from the binary QSAR analysis using docking scores and PLIF bitstrings of the best pose of every compound as descriptors), and SBVS_3 (employing decision tree resulted from the binary QSAR analysis using ensemble PLIF of the selected poses from optimized docking score as the cutoff). The EF values of SBVS_1, SBVS_2, and SBVS_3 are 28.315, 576.084, and 713.472, respectively, while their F-measure values are 0.310, 0.573, and 0.769, respectively.Conclusion: Highly predictive unbiased SBVS protocols to identify potent estrogen receptor alpha ligands were constructed. Further application in prospective screening is therefore highly suggested.
Style APA, Harvard, Vancouver, ISO itp.
4

Zheng, Yan Bin, Ling Yun Guo i Jing Jing Liu. "Efficient Collision Detection Based on Hybrid Bounding Volumes". Advanced Materials Research 472-475 (luty 2012): 2608–11. http://dx.doi.org/10.4028/www.scientific.net/amr.472-475.2608.

Pełny tekst źródła
Streszczenie:
The collision detection in virtual scene can effectively improve the fidelity of virtual reality, however, the existing collision detection algorithm are not fully ideal. In this paper, a collision detection optimization algorithm based on hybrid bounding volumes is presented to improve the real-time ability of bounding volumes collision detection. The algorithm combines the simplicity of AABB-AABB overlap test with the tightness of k-dops. Bounding volumes binary trees of the objects are designed as double-layered structure, which employ AABBs at the top layer, and k-dops at other layers. The intersection test uses different methods to detect the contact status among objects. Quest tree method is used to speed up the algorithm. Experiment results show that the algorithm above is efficient in improving the real-time and accuracy of collision detecting.
Style APA, Harvard, Vancouver, ISO itp.
5

Istyastono, Enade Perdana. "Binary Quantitative Structure-Activity Relationship Analysis to Increase the Predictive Ability of Structure-Based Virtual Screening Campaigns Targeting Cyclooxygenase-2". Indonesian Journal of Chemistry 17, nr 2 (31.07.2017): 322. http://dx.doi.org/10.22146/ijc.24172.

Pełny tekst źródła
Streszczenie:
Structure-Based Virtual Screening (SBVS) campaigns employing Protein-Ligand Interaction Fingerprints (PLIF) identification have served as a powerful strategy in fragments and ligands identification, both retro- and prospectively. Most of the SBVS campaigns employed PLIF by comparing them to a reference PLIF to calculate the Tanimoto-coefficient. Since the approach was reference dependent, it could lead to a very different discovery path if a different reference was used. In this article, references independent approach, i.e. decision trees construction using docking score and PLIF as the descriptors to increase the predictive ability of the SBVS campaigns in the identification of ligands for cyclooxygenase-2 is presented. The results showed that the binary Quantitative-Structure Activity Relationship (QSAR) analysis could significantly increase the predictive ability of the SBVS campaign. Moreover, the selected decision tree could also pinpoint the molecular determinants of the ligands binding to cyclooxygenase-2.
Style APA, Harvard, Vancouver, ISO itp.
6

Ramadhan, Duaa, Abdulmuttalib Rashid i Osama Rashid. "Two Dimensional Path Planning with Static Polygon Obstacles Avoidance". 3D SCEEER Conference sceeer, nr 3d (1.07.2020): 65–72. http://dx.doi.org/10.37917/10.37917/ijeee.sceeer.3rd.10.

Pełny tekst źródła
Streszczenie:
This paper presents the designing of path planning system in an environment contains a set of static polygon obstacles localized and distributed randomly by using differential drive mobile robot. In this paper the designed algorithm (two dimensional path planning algorithm) is proposed in order of investigate the path planning of mobile robot with free collision using the visibility binary tree algorithm. The suggested algorithm is compared with the virtual circles tangents algorithm in the time of arrival and the longest of the path to the target. The aim of this paper is to get an algorithm has better performance than the other algorithms and get less time of arrival and shortest path with free collision.
Style APA, Harvard, Vancouver, ISO itp.
7

Ramadhan, Duaa, Abdulmuttalib Rashid i Osama Rashid. "Two Dimensional Path Planning with Static Polygon Obstacles Avoidance". 3D SCEEER Conference sceeer, nr 3d (1.07.2020): 65–72. http://dx.doi.org/10.37917/ijeee.sceeer.3rd.10.

Pełny tekst źródła
Streszczenie:
This paper presents the designing of path planning system in an environment contains a set of static polygon obstacles localized and distributed randomly by using differential drive mobile robot. In this paper the designed algorithm (two dimensional path planning algorithm) is proposed in order of investigate the path planning of mobile robot with free collision using the visibility binary tree algorithm. The suggested algorithm is compared with the virtual circles tangents algorithm in the time of arrival and the longest of the path to the target. The aim of this paper is to get an algorithm has better performance than the other algorithms and get less time of arrival and shortest path with free collision.
Style APA, Harvard, Vancouver, ISO itp.
8

Wu, Enhua, i Guangzheng Fei. "Real Time Generation of Progressive Meshes for Changing Environments". International Journal of Virtual Reality 4, nr 3 (1.01.2000): 93–102. http://dx.doi.org/10.20870/ijvr.2000.4.3.2652.

Pełny tekst źródła
Streszczenie:
The progressive mesh representation is in general introduced for a continuous level of detail, and with it smooth transition between meshes can be achieved. However, the method is impractical for realtime simplification. Despite that, the realtime generation of progressive meshes is often required for applications such as in a robot simulation system or a flight simulation system where models are constantly modified by the actions of object collision, object destruction and reconstruction, etc. A new method is presented in this paper to tackle realtime simplification through progressive meshes. By the algorithm only the current mesh and readily accessible local information of each vertex, such as vertex position, edge length, neighboring vertices, adjacent faces, and face normals, are considered at each simplification step. All edge-collapse costs are calculated and sorted into a binary tree using the heap sort algorithm at the initial stage. At the iterative stages only the neighboring affected costs need be recalculated and rearranged in the binary tree. Other properties, such as vertex color and face texture, are processed in the same way as the geometry. The algorithm greatly improves the time performance under the constraint that the quality of the generated meshes be acceptable. Tests show that the algorithm is viable in a realtime simplification for medium-scale virtual models on PC platforms.
Style APA, Harvard, Vancouver, ISO itp.
9

Rafiq, Muhammad Yasir, Mueen Ud-Din Azad, Aamer Rafique i Lu Shi Chang. "Development of a Model for Retention of MS/MPhil Students at Virtual University (VU) of Pakistan". International Journal of Distance Education Technologies 18, nr 2 (kwiecień 2020): 1–18. http://dx.doi.org/10.4018/ijdet.2020040101.

Pełny tekst źródła
Streszczenie:
Due to the of use of ICTs and ODL, Virtual University (VU) has become one of leading distance learning university in Pakistan. However, the retention rate among online learners found considerably low. The primary objective of this research was to dig out determinants of retention of MS /MPhil students at VU and modeling their retention by considering important influences. For sampling purpose, three departments with the most students were considered and complete enumeration was done. There were 4,608 students from three departments; Computer Science & Technology, Management Sciences and Education have been included in this study. To dig out the important retention factors, this research has used a Chi-Square test, optimal scaling, a decision tree using CHAID analysis, and then developed a suitable model for student retention. Binary logistic regression techniques were applied. Results have revealed that gender, scholarship, province, location, and division are significant factors and contributing in predicting students' retention at VU. Detailed outputs are shown in respective tables and figures. At the end, different recommendations and suggestions are proposed.
Style APA, Harvard, Vancouver, ISO itp.
10

Ramadhan, Duaa, Auday Al-Mayyahi i Moofed Rashid. "Path Planning and Obstacles Avoidance in Dynamic Workspace Using Polygon Shape Tangents Algorithm". Iraqi Journal for Electrical and Electronic Engineering 17, nr 1 (20.05.2021): 1–10. http://dx.doi.org/10.37917/ijeee.17.1.16.

Pełny tekst źródła
Streszczenie:
This paper presents the design of a path planning system in an environment that contains a set of static and dynamic polygon obstacles localized randomly. In this paper, an algorithm so-called (Polygon shape tangents algorithm) is proposed to move a mobile robot from a source point to a destination point with no collision with surrounding obstacles using the visibility binary tree algorithm. The methodology of this algorithm is based on predicting the steps of a robot trajectory from the source to the destination point. The polygon shapes tangent algorithm is compared with the virtual circles' tangents algorithm for different numbers of static and dynamic polygon obstacles for the time of arrival and the length of the path to the target. The obtained result shows that the used algorithm has better performance than the other algorithms and gets less time of arrival and shortest path with free collision.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Virtual binary tree"

1

Stantic, Bela, i n/a. "Access Methods for Temporal Databases". Griffith University. School of Information and Communication Technology, 2005. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20060906.144815.

Pełny tekst źródła
Streszczenie:
A Temporal database is one that supports some aspect of time distinct from user defined time. Over the last two decades interest in the field of temporal databases has increased significantly, with contributions from many researchers. However, the lack of efficient access methods is perhaps one of the reasons why commercial RDBMS vendors have been reluctant to adopt the advances in temporal database research. Therefore, an obvious research question is: can we develop more robust and more efficient access methods for temporal databases than the existing ones? This thesis attempts to address this question, and the main contributions of this study are summarised as follows: We investigated different representations of 'now' and how the modelling of current time influences the efficiency of accessing 'now relative' temporal data. A new method, called the 'Point' approach, is proposed. Our approach not only elegantly models the current time but also significantly outperforms the existing methods. We proposed a new index structure, called a Virtual Binary tree (VB-tree), based on spatial representation of interval data and a regular triangular decomposition of this space. Further, we described a sound and complete query algorithm. The performance of the algorithm is then evaluated both asymptotically and experimentally with respect to the state-of-the-art in the field. We claim that the VB-tree requires less space and uses fewer disk accesses than the currently best known structure - the RI-tree.
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Virtual binary tree"

1

Baehr, Jason. Intellectual Virtues and Truth, Understanding, and Wisdom. Redaktor Nancy E. Snow. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199385195.013.3.

Pełny tekst źródła
Streszczenie:
This chapter addresses the proper end or aim of intellectual virtues. After distinguishing between two fundamentally different conceptions of intellectual virtue, the author considers the plausibility, with respect to each conception, of the “binary thesis,” according to which the proper aim of intellectual virtues is true belief and the avoidance of cognitive error. The author goes on to argue that if one understands intellectual virtues (as many virtue epistemologists do) as admirable traits of personal character—for example, as traits like curiosity, open-mindedness, intellectual courage, and intellectual humility—then sophia or theoretical wisdom presents itself as a plausible way of understanding their aim.
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Virtual binary tree"

1

"Fast Fourier Transform: a Virtual Binary Tree". W Set Theory and Its Applications in Physics and Computing, 323–29. WORLD SCIENTIFIC, 2022. http://dx.doi.org/10.1142/9789811261787_0014.

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

van Inwagen, Peter. "Lightweight Platonism". W Being, 231–54. Oxford University PressOxford, 2022. http://dx.doi.org/10.1093/oso/9780192883964.003.0006.

Pełny tekst źródła
Streszczenie:
Abstract The “Lightweight Platonism” presented in this chapter is an ontology (including a meta-ontology) that is consistent with the theses defended in the earlier chapters. The meta-ontology explicitly rejects the position that finding the theories that best explain certain phenomena (e.g., that this apple and that book, although they are not identical, are identical in color) is a permissible method for ontology. Rather, the proper method for ontology is to see what existential propositions our discourse commits us to (using the methods endorsed by Quine), and to form theories about the nature of the objects in virtue of whose existence those propositions are true. I contend our discourse commits us to the existence of substances and relations and nothing else. “Relations” (understood to include propositions and attributes) are things that can be said or things that can be said of things. Binary relations, for example, are things that can be said of two things.
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Virtual binary tree"

1

Othman, Nor Farhana, i Haslina Arshad. "Binary search tree traversal for Arrick Robot virtual assembly training module". W 2011 International Conference on Electrical Engineering and Informatics (ICEEI). IEEE, 2011. http://dx.doi.org/10.1109/iceei.2011.6021772.

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

Zhang, Hui, Chuan Zhu, Guangjie Han, Joel J. P. C. Rodrigues i Yan Wan. "A virtual binary-tree infrastructure based data gathering scheme for wireless sensor networks with a mobile sink". W 2014 9th International Conference on Communications and Networking in China (CHINACOM). IEEE, 2014. http://dx.doi.org/10.1109/chinacom.2014.7054254.

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

Mack, Peter, i D. B. Megherbi. "A content-based image retrieval technique with tolerance via multi-page differentiate hashing and binary-tree searching multi-object buckets". W 2016 IEEE International Conference on Computational Intelligence and Virtual Environments for Measurement Systems and Applications (CIVEMSA). IEEE, 2016. http://dx.doi.org/10.1109/civemsa.2016.7524250.

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

Wasfy, Tamer M., Hatem M. Wasfy i Jeanne M. Peters. "Real-Time Explicit Flexible Multibody Dynamics Solver With Application to Virtual-Reality Based E-Learning". W ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48743.

Pełny tekst źródła
Streszczenie:
A flexible multibody dynamics explicit time-integration parallel solver suitable for real-time virtual-reality applications is presented. The hierarchical “scene-graph” representation of the model used for display and user-interaction with the model is also used in the solver. The multibody system includes rigid bodies, flexible bodies, joints, frictional contact constraints, actuators and prescribed motion constraints. The rigid bodies rotational equations of motion are written in a body-fixed frame with the total rigid body rotation matrix updated each time step using incremental rotations. Flexible bodies are modeled using total-Lagrangian spring, truss, beam and hexahedral finite elements. The motion of the elements is referred to a global inertial Cartesian reference frame. A penalty technique is used to impose joint/contact constraints. An asperity-based friction model is used to model joint/contact friction. A bounding box binary tree contact search algorithm is used to allow fast contact detection between finite elements and other elements as well as general triangular/quadrilateral rigid-body surfaces. The real-time solver is used to model virtual-reality based experiments (including mass-spring systems, pendulums, pulley-rope-mass systems, billiards, air-hockey and a solar system) for a freshman university physics e-learning course.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Virtual binary tree” dla poszczególnych typów źródeł:
Artykuły w czasopismach
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