Log in

Relevant bibliographies by topics / Tree matching

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Tree matching'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tree matching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Tree matching"

1

LU, JIANGUO, JU WANG, and SHENGRUI WANG. "XML SCHEMA MATCHING." International Journal of Software Engineering and Knowledge Engineering 17, no. 05 (2007): 575–97. http://dx.doi.org/10.1142/s0218194007003446.

Full text

Abstract:

XML Schema matching problem can be formulated as follows: given two XML Schemas, find the best mapping between the elements and attributes of the schemas, and the overall similarity between them. XML Schema matching is an important problem in data integration, schema evolution, and software reuse. This paper describes a matching system that can find accurate matches and scales to large XML Schemas with hundreds of nodes. In our system, XML Schemas are modeled as labeled and unordered trees, and the schema matching problem is turned into a tree matching problem. We proposed Approximate Common S

APA, Harvard, Vancouver, ISO, and other styles

2

Ko, Sang-Ki, Ha-Rim Lee, and Yo-Sub Han. "State Complexity of Regular Tree Languages for Tree Matching." International Journal of Foundations of Computer Science 27, no. 08 (2016): 965–79. http://dx.doi.org/10.1142/s0129054116500398.

Full text

Abstract:

We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree language and investigate the state complexity. Based on the sequential and parallel tree concatenation, we define three types of tree languages for deciding the existence of different types of subtree occu

APA, Harvard, Vancouver, ISO, and other styles

3

Chen, Yangjun, and Leping Zou. "Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries." International Journal of Information Technology, Communications and Convergence 1, no. 3 (2011): 254. http://dx.doi.org/10.1504/ijitcc.2011.042125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Christou, Michalis, Tomáš Flouri, Costas S. Iliopoulos, et al. "Tree template matching in unranked ordered trees." Journal of Discrete Algorithms 20 (May 2013): 51–60. http://dx.doi.org/10.1016/j.jda.2013.02.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

WANG, YANCHUN, WEIGANG SUN, JINGYUAN ZHANG, and SEN QIN. "ON THE CONDITIONAL MATCHING OF FRACTAL NETWORKS." Fractals 24, no. 04 (2016): 1650054. http://dx.doi.org/10.1142/s0218348x16500547.

Full text

Abstract:

In this paper, we propose a new matching (called a conditional matching), where the condition refers to the matching of the new constructed network which includes all the nodes in the original network. We then enumerate the conditional matchings of the new network and prove that the number of conditional matchings is just the product of degree sequences of the original network. We choose two families of fractal networks to show our obtained results, including the pseudofractal network and Cayley tree. Finally, we calculate the entropy of the conditional matchings on the considered networks and

APA, Harvard, Vancouver, ISO, and other styles

6

Ramesh, R., and I. V. Ramakrishnan. "Parallel tree pattern matching." Journal of Symbolic Computation 9, no. 4 (1990): 485–501. http://dx.doi.org/10.1016/s0747-7171(08)80023-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Krishna, V., N. Ranganathan, and A. Ejnioui. "A tree-matching chip." IEEE Transactions on Very Large Scale Integration (VLSI) Systems 7, no. 2 (1999): 277–80. http://dx.doi.org/10.1109/92.766755.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dubiner, Moshe, Zvi Galil, and Edith Magen. "Faster tree pattern matching." Journal of the ACM 41, no. 2 (1994): 205–13. http://dx.doi.org/10.1145/174652.174653.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Purdom, Paul Walton, and Cynthia A. Brown. "Tree matching and simplification." Software: Practice and Experience 17, no. 2 (1987): 105–15. http://dx.doi.org/10.1002/spe.4380170203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yu, Shuchun, Yupeng He, Zhifeng Chen, Changhai Ru, and Ming Pang. "Stereo Matching Method Based on Combination Characteristic Cost Computing and Unstable Tree Reconstruction Optimization and Its Application in Medical Images." Journal of Medical Imaging and Health Informatics 10, no. 3 (2020): 646–53. http://dx.doi.org/10.1166/jmihi.2020.2912.

Full text

Abstract:

This study aimed to propose a stereo matching method based on the cost calculation of combination feature and reconstruction optimization of an unstable tree. For cost calculation, the improved Census transform was used to calculate the illumination characteristics, the color and gradient operators were used to calculate the color features, and the LBP (Local Binary Pattern) operator was used to calculate the texture features. Then, the initial matching cost was calculated by combining all three features. For cost aggregation, the minimum spanning tree algorithm was improved and the tree aggre

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Tree matching"

1

宋永健 and Wing-kin Sung. "Fast labeled tree comparison via better matching algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31239316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sung, Wing-kin. "Fast labeled tree comparison via better matching algorithms /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20229999.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Baseski, Emre. "Context-sensitive Matching Of Two Shapes." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607353/index.pdf.

Full text

Abstract:

The similarity between two shapes is typically calculated by measuring how well the properties and the spatial organization of the primitives forming the shapes agree. But, when this calculations are done independent from the context, i.e. the whole set of shapes in the experiments, a priori significance to the primitives is assigned, which may cause problematic similarity measures. A possible way of using context information in similarity measure between shape A and shape B is using the category information of shape B in calculations. In this study, shapes are represented as depth-1 shape tre

APA, Harvard, Vancouver, ISO, and other styles

4

Leavitt, Steven W., Austin Long, and Jeffrey S. Dean. "Tree-Ring Dating Through Pattern-Matching of Stable-Carbon Isotope Time Series." Tree-Ring Society, 1985. http://hdl.handle.net/10150/261321.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hogue, Andrew William 1978. "Tree pattern inference and matching for wrapper induction on the World Wide Web." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28406.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>Includes bibliographical references (p. 103-106).<br>We develop a method for learning patterns from a set of positive examples to retrieve semantic content from tree-structured data. Specifically, we focus on HTML documents on the World Wide Web, which contain a wealth of semantic information and have a useful underlying tree structure. A user provides examples of relevant data they wish to extract from a web site through a simple user interface in a web browser. To construct

APA, Harvard, Vancouver, ISO, and other styles

6

Geyer, Alois, Michael Hanke, and Alex Weissensteiner. "Scenario Tree Generation and Multi-Asset Financial Optimization Problems." Elsevier, 2013. http://dx.doi.org/10.1016/j.orl.2013.06.003.

Full text

Abstract:

We compare two popular scenario tree generation methods in the context of financial optimization: Moment matching and scenario reduction. Using a simple problem with a known analytic solution, we find that moment matching - accompanied by a check to ensure absence of arbitrage opportunities - replicates this solution precisely. On the other hand, even if the scenario trees generated by scenario reduction are arbitrage-free, the solutions to the approximate optimization problem represented by the reduced tree are biased and highly variable. These results hold for correlated and uncorrelate

APA, Harvard, Vancouver, ISO, and other styles

7

Saleem, Khalid. "Schema Matching and Integration in Large Scale Scenarios." Montpellier 2, 2008. http://www.theses.fr/2008MON20126.

Full text

Abstract:

Le besoin d'intégrer et d'analyser des grands ensembles de données issus des bases de données publiées sur le web est présent dans de nombreux domaines d'applications comme la génomique, l'environnement, la médecine et le commerce électronique. Ces données sont, après intégration, utilisées pour prendre des décisions, des échanges de services, etc. Les outils existants pour la découverte de correspondances (appelés matchers) permettent de traiter les schémas deux par deux et nécessitent l'intervention d'un expert afin de garantir une bonne qualité des correspondances. Dans un scénario de large

APA, Harvard, Vancouver, ISO, and other styles

8

Bodas, Shalmali Vidyadhar. "Improved association graph matching of intra-patient airway trees." Thesis, University of Iowa, 2008. https://ir.uiowa.edu/etd/197.

Full text

Abstract:

Pulmonary diseases are frequently associated with changes in lung anatomy. These diseases may change the airway, vessel and lung tissue properties. In order to evaluate the lung in a longitudinal study, a stable reference system is required to identify corresponding parts of the lung. The structure of the airway tree can be used to repeatedly identify the regions of interest. In this study, an improved method for matching of intra-patient airway trees was proposed and evaluated. The association graph method proposed by Pelillo et al. matches free and rooted trees by detecting the maximal sub-t

APA, Harvard, Vancouver, ISO, and other styles

9

Chowdhury, Israt Jahan. "Knowledge discovery from tree databases using balanced optimal search." Thesis, Queensland University of Technology, 2016. https://eprints.qut.edu.au/92263/1/Israt%20Jahan_Chowdhury_Thesis.pdf.

Full text

Abstract:

This research is a step forward in discovering knowledge from databases of complex structure like tree or graph. Several data mining algorithms are developed based on a novel representation called Balanced Optimal Search for extracting implicit, unknown and potentially useful information like patterns, similarities and various relationships from tree data, which are also proved to be advantageous in analysing big data. This thesis focuses on analysing unordered tree data, which is robust to data inconsistency, irregularity and swift information changes, hence, in the era of big data it becomes

APA, Harvard, Vancouver, ISO, and other styles

10

Buatongkue, Sirisuda. "Personal named entity linking based on simple partial tree matching and context free grammar." Thesis, Heriot-Watt University, 2017. http://hdl.handle.net/10399/3265.

Full text

Abstract:

Personal name disambiguation is the task of linking a personal name to a unique comparable entry in the real world, also known as named entity linking (NEL). Algorithms for NEL consist of three main components: extractor, searcher, and disambiguator. Existing approaches for NEL use exact-matched look-up over the surface form to generate a set of candidate entities in each of the mentioned names. The exact-matched look-up is wholly inadequate to generate a candidate entity due to the fact that the personal names within a web page lack uniform representation. In addition, the performance of a di

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Tree matching"

1

Cull, Paul. Walking tree heuristics for string matching and gene location. Oregon State University, Dept. of Computer Science, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rushton, B. T. Matching tree species to site conditions in reclamation. s.n, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hsu, Tai C. Fast walking tree method via recurrence reduction for biological string alignment. Oregon State University, Dept. of Computer Science, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, J. T. L. Reference manual for ATBE -- a tool for approximate tree pattern matching. Alpha version 1.0. Courant Institute of Mathematical Sciences, New York University, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

M, Warner, and Overseas Development Institute, eds. Matching livelihood needs to tree selection in high potential farming systems: Lessons from participatory research in Nepal and India. Overseas Development Institute, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cai, Jiazhen. More efficient bottom-up multipattern matching in trees. Courant Institute of Mathematical Sciences, New York University, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Irniger, Christophe-André Mario. Graph matching: Filtering databases of graphs using machine learning techniques. AKA, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

1949-, Booth T. H., ed. Matching trees and sites: Proceedings of an international workshop held in Bangkok, Thailand 27-30 March 1995. Australian Centre for International Agricultural Research., 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cavener, Jeffrey Douglas. Visualization, implementation, and application of the Walking Tree heuristics for biological string matching. 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Matching Livelihood Needs to Tree Selection in High Potential Farming Systems: Lessons from Participatory Research in Nepal and India (Agricultural Research & Extension Network (AgREN) Paper). Overseas Development Institute, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Tree matching"

1

Kilpeläinen, Pekka, and Heikki Mannila. "Grammatical tree matching." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56024-6_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Valiente, Gabriel. "Constrained Tree Inclusion." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44888-8_26.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jiang, Tao, Lusheng Wang, and Kaizhong Zhang. "Alignment of trees — An alternative to tree edit." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58094-8_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Breslauer, Dany. "The suffix tree of a tree and minimizing sequential transducers." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tischler, German. "On Wavelet Tree Construction." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21458-5_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Touzet, Hélène. "A Linear Tree Edit Distance Algorithm for Similar Ordered Trees." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11496656_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Phillips, Cynthia, and Tandy J. Warnow. "The asymmetric median tree — A new model for building consensus trees." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kilpeläinen, Pekka, and Heikki Mannila. "Query primitives for tree-structured data." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58094-8_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wang, Lusheng, and Dan Gusfield. "Improved approximation algorithms for tree alignment." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dulucq, Serge, and Hélène Touzet. "Analysis of Tree Edit Distance Algorithms." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44888-8_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Tree matching"

1

Li, Junshen, Haiyang Ren, Zhengyu Liao, et al. "DI-Tree: A Dual-ended Interval Tree for Efficient Event Matching in Content-based Pub/Sub Systems." In 2024 IEEE 30th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2024. http://dx.doi.org/10.1109/icpads63350.2024.00068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Yangjun, and Donovan Cooke. "Unordered Tree Matching and Strict Unordered Tree Matching: The Evaluation of Tree Pattern Queries." In 2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE, 2010. http://dx.doi.org/10.1109/cyberc.2010.17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kosaraju, S. R. "Efficient tree pattern matching." In 30th Annual Symposium on Foundations of Computer Science. IEEE, 1989. http://dx.doi.org/10.1109/sfcs.1989.63475.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Oflazer, Kemal. "Error-tolerant tree matching." In the 16th conference. Association for Computational Linguistics, 1996. http://dx.doi.org/10.3115/993268.993317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

BRÜGGEMANN-KLEIN, ANNE, and DERICK WOOD. "CATERPILLARS, CONTEXT, TREE AUTOMATA AND TREE PATTERN MATCHING." In Proceedings of the 4th International Conference. WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812792464_0023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Xu, Shibiao, Jiguang Zhang, Weilong Ding, Xukun Shen, G. Hemanth Kumar, and Xiaopeng Zhang. "Hybrid Tree Guided Patch Matching." In 2015 International Conference on Virtual Reality and Visualization (ICVRV). IEEE, 2015. http://dx.doi.org/10.1109/icvrv.2015.16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Shukla, Parijat, and Arun K. Somani. "Tree Matching Using Data Shaping." In 2015 IEEE International Congress on Big Data (BigData Congress). IEEE, 2015. http://dx.doi.org/10.1109/bigdatacongress.2015.32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

"UNORDERED TREE MATCHING AND TREE PATTERN QUERIES IN XML DATABASES." In 4th International Conference on Software and Data Technologies. SciTePress - Science and and Technology Publications, 2009. http://dx.doi.org/10.5220/0002238801910198.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Shoa, A., and S. Shirani. "Tree structure search for matching pursuit." In rnational Conference on Image Processing. IEEE, 2005. http://dx.doi.org/10.1109/icip.2005.1530540.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Tan, Xiao, Changming Sun, Xavier Sirault, Robert Furbank, and Tuan D. Pham. "Tree structural watershed for stereo matching." In the 27th Conference. ACM Press, 2012. http://dx.doi.org/10.1145/2425836.2425903.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Tree matching"

1

Burks, Thomas F., Victor Alchanatis, and Warren Dixon. Enhancement of Sensing Technologies for Selective Tree Fruit Identification and Targeting in Robotic Harvesting Systems. United States Department of Agriculture, 2009. http://dx.doi.org/10.32747/2009.7591739.bard.

Full text

Abstract:

The proposed project aims to enhance tree fruit identification and targeting for robotic harvesting through the selection of appropriate sensor technology, sensor fusion, and visual servo-control approaches. These technologies will be applicable for apple, orange and grapefruit harvest, although specific sensor wavelengths may vary. The primary challenges are fruit occlusion, light variability, peel color variation with maturity, range to target, and computational requirements of image processing algorithms. There are four major development tasks in original three-year proposed study. First, s

APA, Harvard, Vancouver, ISO, and other styles

2

Lee, W. S., Victor Alchanatis, and Asher Levi. Innovative yield mapping system using hyperspectral and thermal imaging for precision tree crop management. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7598158.bard.

Full text

Abstract:

Original objectives and revisions – The original overall objective was to develop, test and validate a prototype yield mapping system for unit area to increase yield and profit for tree crops. Specific objectives were: (1) to develop a yield mapping system for a static situation, using hyperspectral and thermal imaging independently, (2) to integrate hyperspectral and thermal imaging for improved yield estimation by combining thermal images with hyperspectral images to improve fruit detection, and (3) to expand the system to a mobile platform for a stop-measure- and-go situation. There were no

APA, Harvard, Vancouver, ISO, and other styles

3

Cai, J., R. Paige, and R. Tarjan. More Efficient Bottom-Up Multi-Pattern Matching in Trees. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada608560.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Arráiz, Irani, Carla Calero, Songqing Jin, and Alexandra Peralta. Planting the Seeds: The Impact of Training on Mango Producers in Haiti. Inter-American Development Bank, 2015. http://dx.doi.org/10.18235/0011702.

Full text

Abstract:

This paper evaluates the short-term impacts of a development project that aims to increase mango yields, sales of mango products, and the income of small mango farmers in rural Haiti. Various matching methods, in combination with difference-in-difference (DID), are used to deal with the potential selection bias associated with nonrandom treatment assignment. Robustness checks are conducted to investigate whether and to what extent the results are affected by the coexistence of other similar projects in the same sites. Rosenbaum bounds analysis is carried out to check the sensitivity of the est

APA, Harvard, Vancouver, ISO, and other styles

5

Mintii, Iryna S., Svitlana V. Shokaliuk, Tetiana A. Vakaliuk, Mykhailo M. Mintii, and Vladimir N. Soloviev. Import test questions into Moodle LMS. [б. в.], 2019. http://dx.doi.org/10.31812/123456789/3271.

Full text

Abstract:

The purpose of the study is to highlight the theoretical and methodological aspects of preparing the test questions of the most common types in the form of text files for further import into learning management system (LMS) Moodle. The subject of the research is the automated filling of the Moodle LMS test database. The objectives of the study: to analyze the import files of test questions, their advantages and disadvantages; to develop guidelines for the preparation of test questions of common types in the form of text files for further import into Moodle LMS. The action algorithms for import

APA, Harvard, Vancouver, ISO, and other styles

6

Mathew, Jijo K., Christopher M. Day, Howell Li, and Darcy M. Bullock. Curating Automatic Vehicle Location Data to Compare the Performance of Outlier Filtering Methods. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317435.

Full text

Abstract:

Agencies use a variety of technologies and data providers to obtain travel time information. The best quality data can be obtained from second-by-second tracking of vehicles, but that data presents many challenges in terms of privacy, storage requirements and analysis. More frequently agencies collect or purchase segment travel time based upon some type of matching of vehicles between two spatially distributed points. Typical methods for that data collection involve license plate re-identification, Bluetooth, Wi-Fi, or some type of rolling DSRC identifier. One of the challenges in each of thes

APA, Harvard, Vancouver, ISO, and other styles

7

Smith, Paul N., David R. J. Gill, Michael J. McAuliffe, et al. Mortality Following Primary Hip and Knee Arthroplasty: Supplementary Report. Australian Orthopaedic Association, 2023. http://dx.doi.org/10.25310/irjq4670.

Full text

Abstract:

Mortality information has been obtained by matching all procedures reported to the Registry up to and including 31 December 2022 with the National Death Index (NDI). The NDI is the national mortality database maintained by the Australian Institute of Health and Welfare (AIHW). The Registry was granted access to this data following a formal ethics application to AIHW. Adjusted mortality is obtained after direct standardisation of the crude cumulative mortality data by 5 year age intervals and gender to the Estimated Resident Population Status based on the 2001 census. As the total population ha

APA, Harvard, Vancouver, ISO, and other styles

8

Lewis, Peter L., David RJ Gill, Michael J. McAuliffe, et al. Mortality Following Primary Hip and Knee Arthroplasty: 2024 Supplementary Report. Australian Orthopaedic Association, 2024. http://dx.doi.org/10.25310/pnhy7426.

Full text

Abstract:

Mortality information has been obtained by matching all procedures reported to the Registry up to and including 31 December 2023 with the National Death Index (NDI). The NDI is the national mortality database maintained by the Australian Institute of Health and Welfare (AIHW). The Registry was granted access to this data following a formal ethics application to AIHW. Adjusted mortality is obtained after direct standardisation of the crude cumulative mortality data by 5 year age intervals and gender to the Estimated Resident Population Status based on the 2001 census. As the total population ha

APA, Harvard, Vancouver, ISO, and other styles

9

Bäumler, Maximilian, and Matthias Lehmann. Generating representative test scenarios: The FUSE for Representativity (fuse4rep) process model for collecting and analysing traffic observation data. TU Dresden, 2024. http://dx.doi.org/10.26128/2024.2.

Full text

Abstract:

Scenario-based testing is a pillar of assessing the effectiveness of automated driving systems (ADSs). For data-driven scenario-based testing, representative traffic scenarios need to describe real road traffic situations in compressed form and, as such, cover normal driving along with critical and accident situations originating from different data sources. Nevertheless, in the choice of data sources, a conflict often arises between sample quality and depth of information. Police accident data (PD) covering accident situations, for example, represent a full survey and thus have high sample qu

APA, Harvard, Vancouver, ISO, and other styles

10

99mTc SPECT-CT, Consensus QIBA Profile. Chair Yuni Dewaraja and Robert Miyaoka. Radiological Society of North America (RSNA)/Quantitative Imaging Biomarkers Alliance (QIBA), 2019. https://doi.org/10.1148/qiba/20191021.

Full text

Abstract:

The quantification of 99mTc labeled biomarkers can add unique value in many different settings, ranging from clinical trials of investigation new drugs to the treatment of individual patients with marketed therapeutics. For example, goals of precision medicine include using companion radiopharmaceutical diagnostics as just-in-time, predictive biomarkers for selecting patients to receive targeted treatments, customizing doses of internally administered radiotherapeutics, and assessing responses to treatment. This Profile describes quantitative outcome measures that represent proxies of target c

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!