Journal articles: 'Digital search tree'

1

Vosselman, George. "Applications of tree search methods in digital photogrammetry." ISPRS Journal of Photogrammetry and Remote Sensing 50, no. 4 (August 1995): 29–37. http://dx.doi.org/10.1016/0924-2716(95)98235-r.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Holmgren, Cecilia. "A weakly 1-stable distribution for the number of random records and cuttings in split trees." Advances in Applied Probability 43, no. 01 (March 2011): 151–77. http://dx.doi.org/10.1017/s0001867800004730.

Full text

Abstract:

In this paper we study the number of random records in an arbitrary split tree (or, equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for the convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number. After normalization the distributions are shown to be asymptotically weakly 1-stable. This work is a generalization of our earlier results for the random binary search tree in Holmgren (2010), which is one specific case of split trees. Other important examples of split trees includem-ary search trees, quad trees, medians of (2k+ 1)-trees, simplex trees, tries, and digital search trees.

APA, Harvard, Vancouver, ISO, and other styles

3

Holmgren, Cecilia. "A weakly 1-stable distribution for the number of random records and cuttings in split trees." Advances in Applied Probability 43, no. 1 (March 2011): 151–77. http://dx.doi.org/10.1239/aap/1300198517.

Full text

Abstract:

In this paper we study the number of random records in an arbitrary split tree (or, equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for the convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number. After normalization the distributions are shown to be asymptotically weakly 1-stable. This work is a generalization of our earlier results for the random binary search tree in Holmgren (2010), which is one specific case of split trees. Other important examples of split trees include m-ary search trees, quad trees, medians of (2k + 1)-trees, simplex trees, tries, and digital search trees.

APA, Harvard, Vancouver, ISO, and other styles

4

Pittel, Boris. "Paths in a random digital tree: limiting distributions." Advances in Applied Probability 18, no. 01 (March 1986): 139–55. http://dx.doi.org/10.1017/s0001867800015603.

Full text

Abstract:

We study a rule of growing a sequence {tn } of finite subtrees of an infinite m-ary tree T. Independent copies {ω (n)} of a Bernoulli-type process ω on m letters are used to trace out a sequence of paths in T. The tree tn is obtained by cutting each , at the first node such that at most σ paths out of , pass through it. Denote by Hn the length of the longest path, hn the length of the shortest path, and Ln the length of the randomly chosen path in tn. It is shown that, in probability, Hn – loga n = O(1), hn – log b (n/log n) = 0(1), (or hn – log b (n/log log n) = O(1)), and that is asymptotically normal. The parameters a, b, c depend on the distribution of ω and, in case of a, also on σ. These estimates describe respectively the worst, the best and the typical case behavior of a ‘trie’ search algorithm for a dictionary-type information retrieval system, with σ being the capacity of a page.

APA, Harvard, Vancouver, ISO, and other styles

5

Pittel, Boris. "Paths in a random digital tree: limiting distributions." Advances in Applied Probability 18, no. 1 (March 1986): 139–55. http://dx.doi.org/10.2307/1427240.

Full text

Abstract:

We study a rule of growing a sequence {tn} of finite subtrees of an infinite m-ary tree T. Independent copies {ω (n)} of a Bernoulli-type process ω on m letters are used to trace out a sequence of paths in T. The tree tn is obtained by cutting each , at the first node such that at most σ paths out of , pass through it. Denote by Hn the length of the longest path, hn the length of the shortest path, and Ln the length of the randomly chosen path in tn. It is shown that, in probability, Hn – logan = O(1), hn – logb (n/log n) = 0(1), (or hn – logb (n/log log n) = O(1)), and that is asymptotically normal. The parameters a, b, c depend on the distribution of ω and, in case of a, also on σ. These estimates describe respectively the worst, the best and the typical case behavior of a ‘trie’ search algorithm for a dictionary-type information retrieval system, with σ being the capacity of a page.

APA, Harvard, Vancouver, ISO, and other styles

6

ZINCIR-HEYWOOD, A. N., M. I. HEYWOOD, C. R. CHARTWIN, and T. TUNALI. "HETEROGENEOUS DIGITAL LIBRARY QUERY PLATFORM USING A TRULY DISTRIBUTED MULTI-AGENT SEARCH." International Journal of Cooperative Information Systems 09, no. 03 (September 2000): 229–54. http://dx.doi.org/10.1142/s0218843000000132.

Full text

Abstract:

A platform for performing multi-agent searches in heterogeneous digital libraries is proposed. This differs significantly from previous approaches by completely removing the concept of a centralized search engine. Specifically, the organization of information held on domain index servers is constrained to conform to a virtual tree representation based on facets and global keyword concept schema particular to the set of information providers associated with the domain of interest (e.g. preparatory intranet). Simulation studies are used to compare this platform against a digital library platform presently in use, which employs the traditional central server scheme. Improvements in terms of query service time and robustness are demonstrated.

APA, Harvard, Vancouver, ISO, and other styles

7

Louchard, Guy, Wojciech Szpankowski, and Jing Tang. "Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm." SIAM Journal on Computing 28, no. 3 (January 1998): 904–34. http://dx.doi.org/10.1137/s0097539796301811.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Song, Yue, Minjuan Wang, and Wanlin Gao. "Method for Retrieving Digital Agricultural Text Information Based on Local Matching." Symmetry 12, no. 7 (July 2, 2020): 1103. http://dx.doi.org/10.3390/sym12071103.

Full text

Abstract:

In order to improve the retrieval results of digital agricultural text information and improve the efficiency of retrieval, the method for searching digital agricultural text information based on local matching is proposed. The agricultural text tree and the query tree are constructed to generate the relationship of ancestor–descendant in the query and map it to the agricultural text. According to the retrieval method of the local matching, the vector retrieval method is used to calculate the digital agricultural text and submit the similarity between the queries. The similarity is sorted from large to small so that the agricultural text tree can output digital agricultural text information in turn. In the case of adding interference information, the recall rate and precision rate of the proposed method are above 99.5%; the average retrieval time is between 4s and 6s, and the average retrieval efficiency is above 99%. The proposed method is more efficient in information retrieval and can obtain comprehensive and accurate search results, which can be used for the rapid retrieval of digital agricultural text information.

APA, Harvard, Vancouver, ISO, and other styles

9

Johnson, Derek, Erin Faulkner, Georgia Meredith, and Tim J. Wilson. "Police Functional Adaptation to the Digital or Post Digital Age: Discussions with Cybercrime Experts." Journal of Criminal Law 84, no. 5 (September 23, 2020): 427–50. http://dx.doi.org/10.1177/0022018320952559.

Full text

Abstract:

This article examines the challenges of functional adaptation faced by the police in response to technologically driven changes in the nature of crime. It also recounts how research under the auspices of a ‘dark web’ research project resulted in a search for an effective approach to engaging with investigators dealing with cybercrime. In doing so it tested, as a research methodology, a standard change implementation tool (problem tree analysis) from the Disaster Management and Sustainable Development (DMSD) discipline. This in turn resulted in significant consideration being given to the physical space in which that methodology is used. It presents the results of a workshop held with cybercrime investigators (not all were police officers) in terms of the importance of four key organisational and cultural issues (management, leadership and institutional ethos within the police; the risks of over-complication and exaggerated distinctions between cyber and real world policing; ethics; and knowledge, training and development) alongside the development and acquisition of new technical capabilities.

APA, Harvard, Vancouver, ISO, and other styles

10

Shi, Wenkui, Jianqiang Chen, Yanming Shen, and Yi Jiang. "SPH Method with Space-Based Variable Smoothing Length and Its Applications to Free Surface Flow." International Journal of Computational Methods 16, no. 02 (November 29, 2018): 1846002. http://dx.doi.org/10.1142/s0219876218460027.

Full text

Abstract:

In order to improve the computational efficiency and spatial resolution of smoothed particle hydrodynamics (SPH) method, a SPH method with space-based variable smoothing length has been developed. In addition, since linked-list search algorithm cannot handle the variable smoothing length problems, an improved linked-list search algorithm and a balanced alternating digital tree (B-ADT) search algorithm have been proposed. The performance of the two improved search algorithms has been evaluated in detail. These methods have been used to simulate two cases of water entry impact and two cases of gas–liquid two-phase flow. The results show that, by using space-based variable smoothing length algorithm, computational cost can be greatly reduced and the numerical accuracy is maintained.

APA, Harvard, Vancouver, ISO, and other styles

11

Knessl, Charles, and Wojciech Szpankowski. "Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme." SIAM Journal on Computing 30, no. 3 (January 2000): 923–64. http://dx.doi.org/10.1137/s0097539799356812.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Gross, Sebastian, Marcel Kliemannel, and Niels Pinkwart. "Orientation and Navigation Support in Resource Spaces Using Hierarchical Visualizations." i-com 16, no. 1 (April 1, 2017): 35–44. http://dx.doi.org/10.1515/icom-2016-0043.

Full text

Abstract:

AbstractIn this article we investigate how orientation and navigation in (extensive) spaces consisting of digital resources can be supported by using hierarchical visualizations. Such spaces can consist of heterogeneous sets of digital resources as for instance articles from Wikipedia, textbooks, and videos. Due to easier access to digital resources in the Internet age, a manual exploration of these spaces might lead to information overload. As a result, techniques need to be developed in order to automatically analyze and structure sets of resources. We introduce a prototypical implementation of a visualization pipeline that extracts information dimensions from resources in order to group them into semantically similar clusters, and visualizes these clusters using two different visualizations: a treemap visualizing clusters and nested subclusters, and a rooted tree visualizing groups of semantically similar resources as subtrees. In a lab study we evaluated the two visualizations and compared them to two control groups. The results may hint to users’ better understanding of the resources’ underlying knowledge as compared to using typical approaches (e.g. web search results as list) when using hierarchical visualizations.

APA, Harvard, Vancouver, ISO, and other styles

13

Tulowiecki, Stephen J. "Information retrieval in physical geography." Progress in Physical Geography: Earth and Environment 42, no. 3 (April 29, 2018): 369–90. http://dx.doi.org/10.1177/0309133318770972.

Full text

Abstract:

Information retrieval (IR) methods seek to locate meaningful documents in large collections of textual and other data. Few studies apply these techniques to discover descriptions in historical documents for physical geography applications. This absence is noteworthy given the use of qualitative historical descriptions in physical geography and the amount of historical documentation online. This study, therefore, introduces an IR approach for finding meaningful and geographically resolved historical descriptions in large digital collections of historical documents. Presenting a biogeography application, it develops a ‘search engine’ using a boosted regression trees (BRT) model to assist in finding forest compositional descriptions (FCDs) based on textual features in a collection of county histories. The study then investigates whether FCDs corroborate existing estimates of relative abundances and spatial distributions of tree taxa from presettlement land survey records (PLSRs) and existing range maps. The BRT model is trained using portions of text from 458 US county histories. Evaluating the model’s performance upon a spatially independent test dataset, the model helps discover 97.5% of FCDs while reducing the amount of text to search through to 0.3% of total. The prevalence rank of taxa in FCDs (i.e. the number of times a taxon is mentioned at least once in an FCD, divided by the total number of FCDs, then ranked) is strongly related to the abundance rank in PLSRs. Patterns in species mentions from FCDs generally match relative abundance patterns from PLSRs. However, analyses suggest that FCDs contain biases towards large and economically valuable tree taxa and against smaller taxa. In the end, the study demonstrates the potential of IR approaches for developing novel datasets over large geographic areas, corroborating existing historical datasets, and providing spatial coverage of historic phenomena.

APA, Harvard, Vancouver, ISO, and other styles

14

Nelson, M. A., and I. O. A. Odeh. "Digital soil class mapping using legacy soil profile data: a comparison of a genetic algorithm and classification tree approach." Soil Research 47, no. 6 (2009): 632. http://dx.doi.org/10.1071/sr08224.

Full text

Abstract:

Digital soil class mapping (DSCM) provides a means of meeting the growing global demand for soil information. The search for optimal models for digital soil class mapping to take advantage of increasing availability of ancillary information, such as gamma radiometric data, is ongoing. One of the novel approaches to DSCM is based on genetic algorithms, which provide predictive function for DSCM. This paper aims: to develop a scheme for implementing genetic algorithms for rule-set production (GARP) in digital soil class mapping; to compare the performance of GARP and classification tree model (CT); and to evaluate the usefulness of gamma radiometrics as a predictor for DSCM of legacy soil data. We first collated the legacy soil class data from databases of soil profiles and the associated ancillary data from disparate sources. We then created a 200-m resolution DSCM based on the Australian Soil Classification, for the Namoi catchment in north-western New South Wales, using GARP based on the general scorpan-sspfe model and compared the GARP performance with the widely used CT model. Elevation, terrain attributes, magnetic survey, land use, NDVI, and, where available, radiometric data were used as the ancillary variables. In this implementation, inclusion of radiometric data in either of the prediction models significantly improved the classification accuracy and the resulting DSCM. Based on various classification and prediction performance measures, GARP was shown to be outperformed by the CT. We conclude that GARP needs further improvement for its full potential to be realised for digitally mapping soil classes.

APA, Harvard, Vancouver, ISO, and other styles

15

Ali, Aqib, Jamal Abdul Nasir, Muhammad Munawar Ahmed, Samreen Naeem, Sania Anam, Farrukh Jamal, Christophe Chesneau, Muhammad Zubair, and Muhammad Saqib Anees. "Machine Learning Based Statistical Analysis of Emotion Recognition using Facial Expression." RADS Journal of Biological Research & Applied Sciences 11, no. 1 (September 14, 2020): 1–8. http://dx.doi.org/10.37962/jbas.v11i1.262.

Full text

Abstract:

Background: Humans can deliver many emotions during a conversation. Facial expressions show information about emotions. Objectives: This study proposed a Machine Learning (ML) approach based on a statistical analysis of emotion recognition using facial expression through a digital image. Methodology: A total of 600 digital image datasets divided into 6 classes (Anger, Happy, Fear, Surprise, Sad, and Normal) was collected from publicly available Taiwan Facial Expression Images Database. In the first step, all images are converted into a gray level format and 4 Regions of Interest (ROIs) are created on each image, so the total image dataset gets divided in 2400 (600 x 4) sub-images. In the second step, 3 types of statistical features named texture, histogram, and binary feature are extracted from each ROIs. The third step is a statistical feature optimization using the best-first search algorithm. Lastly, an optimized statistical feature dataset is deployed on various ML classifiers. Results: The analysis part was divided into two phases: firstly boosting algorithms-based ML classifiers (named as LogitBoost, AdaboostM1, and Stacking) which obtained 94.11%, 92.15%, and 89.21% accuracy, respectively. Secondly, decision tree algorithms named J48, Random Forest, and Random Committee were obtained with 97.05%, 93.14%, and 92.15% accuracy, respectively. Conclusion: It was observed that decision tree based J48 classifiers gave 97.05% classification accuracy.

APA, Harvard, Vancouver, ISO, and other styles

16

Jiang, Chen, Bo Yuan, Tsung-Yi Ho, and Xin Yao. "Placement of Digital Microfluidic Biochips via a New Evolutionary Algorithm." ACM Transactions on Design Automation of Electronic Systems 26, no. 6 (June 28, 2021): 1–22. http://dx.doi.org/10.1145/3460230.

Full text

Abstract:

Digital microfluidic biochips (DMFBs) have been a revolutionary platform for automating and miniaturizing laboratory procedures with the advantages of flexibility and reconfigurability. The placement problem is one of the most challenging issues in the design automation of DMFBs. It contains three interacting NP-hard sub-problems: resource binding, operation scheduling, and module placement. Besides, during the optimization of placement, complex constraints must be satisfied to guarantee feasible solutions, such as precedence constraints, storage constraints, and resource constraints. In this article, a new placement method for DMFB is proposed based on an evolutionary algorithm with novel heuristic-based decoding strategies for both operation scheduling and module placement. Specifically, instead of using the previous list scheduler and path scheduler for decoding operation scheduling chromosomes, we introduce a new heuristic scheduling algorithm (called order scheduler) with fewer limitations on the search space for operation scheduling solutions. Besides, a new 3D placer that combines both scheduling and placement is proposed where the usage of the microfluidic array over time in the chip is recorded flexibly, which is able to represent more feasible solutions for module placement. Compared with the state-of-the-art placement methods (T-tree and 3D-DDM), the experimental results demonstrate the superiority of the proposed method based on several real-world bioassay benchmarks. The proposed method can find the optimal results with the minimum assay completion time for all test cases.

APA, Harvard, Vancouver, ISO, and other styles

17

Jurczyk-Romanowska, Ewa, and Adnan Tufekčić. "Can genealogical exploration of the past be conducive to the development of ICT competences?" E-methodology 5, no. 5 (April 23, 2019): 132–59. http://dx.doi.org/10.15503/emet.v5i5.526.

Full text

Abstract:

Aims. Apart from its numerous benefits, the development of the information society has also resulted in the digital exclusion of people who do not have the competence to use a computer and the Internet. This group is largely made up of older people. The European Union has taken a number of measures to reduce the digital divide, including the funding of ICT training programmes. The research which forms the basis for creating such training for seniors has focused on an analysis of various forms of genealogical activity on the Internet. The authors assumed that seniors are somehow predestined for genealogical activity, due to their age and experience. It was therefore decided to base the computer training programme on the development of genealogical interests. Methods. The study identified and categorized various forms of genealogical activity on the Internet, and the research was based on "genealogy" records in the Google search engine. Explorations were carried out in four countries: Poland, Turkey, Italy and Bosnia and Herzegovina. Results. As a result of the explorations, it was found that genealogical activity on the Internet falls into four basic categories: (1) sources of knowledge about genealogy, (2) tools for creating family trees, (3) presentation of the results of genealogical searches, (4) virtual genealogical communities. The last (5) category is of a commercial nature and includes genealogical accessories stores. Conclusion. Research conducted in the area of genealogical activity on the Internet leads to the conclusion that it may be an additional motivation for older people to undertake training in the field of ICT, which prompts further didactic and research directions. On the basis of the analysis, the implementation of the training programme in the Learning Tree project was designed and set in motion.

APA, Harvard, Vancouver, ISO, and other styles

18

Balachandra and Prema K.V. "Certificate Path Verification in Hierarchical and Peer-to-Peer Public Key Infrastructures." Journal of Technology Management for Growing Economies 1, no. 1 (April 26, 2010): 77–92. http://dx.doi.org/10.15415/jtmge.2010.11005.

Full text

Abstract:

“Authentication of users in an automated business transaction is commonly realized by means of a Public Key Infrastructure(PKI). A PKI is a framework on which the security services are built. Each user or end entity is given a digitally signed data structure called digital certificate. In Hierarchical PKI, certificate path is unidirectional, so certificate path development and validation is simple and straight forward. Peer-to-Peer(also called Mesh PKI) architecture is one of the most popular PKI trust models that is widely used in automated business transactions, but certificate path verification is very complex since there are multiple paths between users and the certification path is bidirectional. In this paper, we demonstrate the advantage of certificate path verification in Hierarchical PKI based on forward path construction method over reverse path construction method with respect to the time requirement. We also propose a novel method to convert a peer-to-peer PKI to a Depth First Search(DFS) spanning tree to simplify the certificate path verification by avoiding multiple paths between users, since the DFS spanning tree equivalent of peer-to-peer PKI contains only one path between any two Certification Authorities.

APA, Harvard, Vancouver, ISO, and other styles

19

Singhal, Shubhanshi, Akanksha Kaushik, and Pooja Sharma. "A Novel approach of data deduplication for distributed storage." International Journal of Engineering & Technology 7, no. 2.4 (March 10, 2018): 46. http://dx.doi.org/10.14419/ijet.v7i2.4.10040.

Full text

Abstract:

Due to drastic growth of digital data, data deduplication has become a standard component of modern backup systems. It reduces data redundancy, saves storage space, and simplifies the management of data chunks. This process is performed in three steps: chunking, fingerprinting, and indexing of fingerprints. In chunking, data files are divided into the chunks and the chunk boundary is decided by the value of the divisor. For each chunk, a unique identifying value is computed using a hash signature (i.e. MD-5, SHA-1, SHA-256), known as fingerprint. At last, these fingerprints are stored in the index to detect redundant chunks means chunks having the same fingerprint values. In chunking, the chunk size is an important factor that should be optimal for better performance of deduplication system. Genetic algorithm (GA) is gaining much popularity and can be applied to find the best value of the divisor. Secondly, indexing also enhances the performance of the system by reducing the search time. Binary search tree (BST) based indexing has the time complexity of which is minimum among the searching algorithm. A new model is proposed by associating GA to find the value of the divisor. It is the first attempt when GA is applied in the field of data deduplication. The second improvement in the proposed system is that BST index tree is applied to index the fingerprints. The performance of the proposed system is evaluated on VMDK, Linux, and Quanto datasets and a good improvement is achieved in deduplication ratio.

APA, Harvard, Vancouver, ISO, and other styles

20

Davies, E. "A Generalised Approach to the use of Sampling for Rapid Object Location." International Journal of Applied Mathematics and Computer Science 18, no. 1 (March 1, 2008): 7–19. http://dx.doi.org/10.2478/v10006-008-0001-3.

Full text

Abstract:

A Generalised Approach to the use of Sampling for Rapid Object LocationThis paper has developed a generalised sampling strategy for the rapid location of objects in digital images. In this strategya prioriinformation on the possible locations of objects is used to guide the sampling process, and earlier body-based and edge-based approaches emerge automatically on applying the righta prioriprobability maps. In addition, the limitations of the earlier regular sampling technique have been clarified and eased—with the result that sampling patterns are better matched to the positions of the image boundaries. These methods lead to improved speeds of operation both in the cases where all the objects in an image have to be located and also where the positions of individual objects have to be updated. Finally, the method is interesting in being intrinsically able to perform full binary search tree edge location without the need for explicit programming.

APA, Harvard, Vancouver, ISO, and other styles

21

Алексеев, А. С., И. М. Чернов, И. В. Никифорчин, and Е. А. Иванова. "Tree stands of Scots pine and Norway spruce state assessment using hemispherical photography by Fish-eye lens and subsequent analysis of the digital images." Известия СПбЛТА, no. 233 (December 29, 2020): 95–110. http://dx.doi.org/10.21266/2079-4304.2020.233.95-110.

Full text

Abstract:

На примере чистых и смешанных древостоев хвойных пород с преобладанием сосны обыкновенной и ели европейской было проведено поисковое исследование возможностей определения состояния древостоев на основе цифровой полусферической съемки полога леса снизу вверх объективом типа «Рыбий глаз» и последующей обработки полученных изображений. Исследования были проведены на 25 пробных площадях, заложенных по европейской методике мониторинга состояния лесов ICP-Forest с регулярным их размещением по территории. На пробных площадях традиционным наземным методом были визуально определены такие показатели состояния древостоев как средние дефолиация верхней 1/3 части кроны деревьев, дефолиация всей кроны деревьев и класс повреждения древостоев. На этих же пробных площадях были получены снимки древесного полога объективом для полусферической съемки «Рыбий глаз», которые были обработаны с помощью программы открытого доступа Gap Light Analyzer. Методами регрессионного и дисперсионного анализа были установлены статистически достоверные связи между показателями состояния древостоев и их индексом листовой поверхности, полученным при обработке цифровых изображений. Показатели состояния древостоев и их индекс листовой поверхности связаны обратной зависимостью с коэффициентами детерминации от 79,8 до 87,4%. Полученные результаты позволяют в принципе разработать измерительную методику оценки состояния древостоев, обладающую свойствами объективности, технологичности, экономичности и точности. Основной целью такой методики является удаление из оценок состояния древостоев субъективного подхода, свойственного всем визуальным определениям. On the example of pure and mixed stands of coniferous species with a predominance of Scots pine and Norway spruce, a search study was conducted to determine the state of stands based on digital hemispherical shooting of the forest canopy from bottom to top with a Fish-eye lens and subsequent processing of the images obtained. The research was carried out on 25 test areas laid down according to the European method of monitoring the state of forests ICP-Forests. On the test areas land-based method to identify indicators of the status of the forest as the average defoliationof upper 1/3 part of the trees, defoliation of all trees and the class of damage of forest stands. At the same test areas, images of the tree canopy were obtained with a Fish-eye hemispherical lens, which were processed using the Gap Light Analyzer open access program. Using regression and variance analysis methods, statistically significant relationships were established between indicators of the state of stands and their leaf area index with determination coefficient from 79,8 to 87,4%. The results obtained allow us to develop a methodology for assessing the state of stands, which are usually determined visually with a high degree of subjectivity, by measuring.

APA, Harvard, Vancouver, ISO, and other styles

22

Алексеев, А. С., И. М. Чернов, И. В. Никифорчин, and Е. А. Иванова. "Tree stands of Scots pine and Norway spruce state assessment using hemispherical photography by Fish-eye lens and subsequent analysis of the digital images." Известия СПбЛТА, no. 233 (December 29, 2020): 95–110. http://dx.doi.org/10.21266/2079-4304.2020.233.95-110.

Full text

Abstract:

На примере чистых и смешанных древостоев хвойных пород с преобладанием сосны обыкновенной и ели европейской было проведено поисковое исследование возможностей определения состояния древостоев на основе цифровой полусферической съемки полога леса снизу вверх объективом типа «Рыбий глаз» и последующей обработки полученных изображений. Исследования были проведены на 25 пробных площадях, заложенных по европейской методике мониторинга состояния лесов ICP-Forest с регулярным их размещением по территории. На пробных площадях традиционным наземным методом были визуально определены такие показатели состояния древостоев как средние дефолиация верхней 1/3 части кроны деревьев, дефолиация всей кроны деревьев и класс повреждения древостоев. На этих же пробных площадях были получены снимки древесного полога объективом для полусферической съемки «Рыбий глаз», которые были обработаны с помощью программы открытого доступа Gap Light Analyzer. Методами регрессионного и дисперсионного анализа были установлены статистически достоверные связи между показателями состояния древостоев и их индексом листовой поверхности, полученным при обработке цифровых изображений. Показатели состояния древостоев и их индекс листовой поверхности связаны обратной зависимостью с коэффициентами детерминации от 79,8 до 87,4%. Полученные результаты позволяют в принципе разработать измерительную методику оценки состояния древостоев, обладающую свойствами объективности, технологичности, экономичности и точности. Основной целью такой методики является удаление из оценок состояния древостоев субъективного подхода, свойственного всем визуальным определениям. On the example of pure and mixed stands of coniferous species with a predominance of Scots pine and Norway spruce, a search study was conducted to determine the state of stands based on digital hemispherical shooting of the forest canopy from bottom to top with a Fish-eye lens and subsequent processing of the images obtained. The research was carried out on 25 test areas laid down according to the European method of monitoring the state of forests ICP-Forests. On the test areas land-based method to identify indicators of the status of the forest as the average defoliationof upper 1/3 part of the trees, defoliation of all trees and the class of damage of forest stands. At the same test areas, images of the tree canopy were obtained with a Fish-eye hemispherical lens, which were processed using the Gap Light Analyzer open access program. Using regression and variance analysis methods, statistically significant relationships were established between indicators of the state of stands and their leaf area index with determination coefficient from 79,8 to 87,4%. The results obtained allow us to develop a methodology for assessing the state of stands, which are usually determined visually with a high degree of subjectivity, by measuring.

APA, Harvard, Vancouver, ISO, and other styles

23

Flajolet, Philippe, and Robert Sedgewick. "Digital Search Trees Revisited." SIAM Journal on Computing 15, no. 3 (August 1986): 748–67. http://dx.doi.org/10.1137/0215054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Dasgupta, Subhasis, Pinakpani Pal, Chandan Mazumdar, and Aditya Bagchi. "Resolving authorization conflicts by ontology views for controlled access to a digital library." Journal of Knowledge Management 19, no. 1 (February 9, 2015): 45–59. http://dx.doi.org/10.1108/jkm-10-2014-0435.

Full text

Abstract:

Purpose – This paper provides a new Digital Library architecture that supports polyhierarchic ontology structure where a child concept representing an interdisciplinary subject area can have multiple parent concepts. The paper further proposes an access control mechanism for controlled access to different concepts by different users depending on the authorizations available to each such user. The proposed model thus provides a better knowledge representation and faster searching possibility of documents for modern Digital Libraries with controlled access to the system. Design/methodology/approach – Since the proposed Digital Library Architecture considers polyhierarchy, the underlying hierarchical structure becomes a Directed Acyclic Graph instead of a tree. A new access control model has been developed for such a polyhierarchic ontology structure. It has been shown that such model may give rise to undecidability problem. A client specific view generation mechanism has been developed to solve the problem. Findings – The paper has three major contributions. First, it provides better knowledge representation for present-day digital libraries, as new interdisciplinary subject areas are getting introduced. Concepts representing interdisciplinary subject areas will have multiple parents, and consequently, the library ontology introduces a new set of nodes representing document classes. This concept also provides faster search mechanism. Secondly, a new access control model has been introduced for the ontology structure where a user gets authorizations to access a concept node only if its credential supports it. Lastly, a client-based view generation algorithm has been developed so that a client’s access remains limited to its view and avoids any possibility of undecidability in authorization specification. Research limitations/implications – The proposed model, in its present form, supports only read and browse facilities. It would later be extended for addition and update of documents. Moreover, the paper explains the model in a single user environment. It will be augmented later to consider simultaneous access from multiple users. Practical implications – The paper emphasizes the need for changing the present digital library ontology to a polyhierarchic structure to provide proper representation of knowledge related to the concepts covering interdisciplinary subject areas. Possible implementation strategies have also been mentioned. This design method can also be extended for other semantic web applications. Originality/value – This paper offers a new knowledge management strategy to cover the gradual proliferation of interdisciplinary subject areas along with a suitable access control model for a digital library ontology. This methodology can also be extended for other semantic web applications.

APA, Harvard, Vancouver, ISO, and other styles

25

Kirschenhofer, Peter, and Helmut Prodinger. "Further results on digital search trees." Theoretical Computer Science 58, no. 1-3 (June 1988): 143–54. http://dx.doi.org/10.1016/0304-3975(88)90023-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Aguech, Rafik, Nabil Lasmar, and Hosam Mahmoud. "Distances in random digital search trees." Acta Informatica 43, no. 4 (September 22, 2006): 243–64. http://dx.doi.org/10.1007/s00236-006-0019-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Manzoor, Sohaib, Khalid Bashir Bajwa, Muhammad Sajid, Hira Manzoor, Mahak Manzoor, Nouman Ali, and Muhammad Ilyas Menhas. "Modeling of Wireless Traffic Load in Next Generation Wireless Networks." Mathematical Problems in Engineering 2021 (August 30, 2021): 1–15. http://dx.doi.org/10.1155/2021/7293093.

Full text

Abstract:

Software defined WiFi network (SD-WiFi) is a new paradigm that addresses issues such as mobility management, load management, route policies, link discovery, and access selection in traditional WiFi networks. Due to the rapid growth of wireless devices, uneven load distribution among the network resources still remains a challenging issue in SD-WiFi. In this paper, we design a novel four-tier software defined WiFi edge architecture (FT-SDWE) to manage load imbalance through an improved handover mechanism, enhanced authentication technique, and upgraded migration approach. In the first tier, the handover mechanism is improved by using a simple AND operator and by shifting the association control to WAPs. Unauthorized user load is mitigated in the second tier, with the help of base stations (BSs) which act as edge nodes (ENs), using elliptic ElGamal digital signature algorithm (EEDSA). In the third tier, the load is balanced in the data plane among the OpenFlow enabled switches by using the whale optimization algorithm (WOA). Moreover, the load in the fourth tier is balanced among the multiple controllers. The global controller (GC) predicts the load states of local controllers (LCs) from the Markov chain model (MCM) and allocates packets to LCs for processing through a binary search tree (BST). The performance evaluation of FT-SDWE is demonstrated using extensive OMNeT++ simulations. The proposed framework shows effectiveness in terms of bandwidth, jitter, response time, throughput, and migration time in comparison to SD-WiFi, EASM, GAME-SM, and load information strategy schemes.

APA, Harvard, Vancouver, ISO, and other styles

28

Cénac, Peggy, Brigitte Chauvin, Stéphane Ginouillac, and Nicolas Pouyanne. "Digital search trees and chaos game representation." ESAIM: Probability and Statistics 13 (January 2009): 15–37. http://dx.doi.org/10.1051/ps:2007043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Drmota, Michael, and Wojciech Szpankowski. "The expected profile of digital search trees." Journal of Combinatorial Theory, Series A 118, no. 7 (October 2011): 1939–65. http://dx.doi.org/10.1016/j.jcta.2011.04.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Mishra, Shubhanshu. "Information extraction from digital social trace data with applications to social media and scholarly communication data." ACM SIGIR Forum 54, no. 1 (June 2020): 1–2. http://dx.doi.org/10.1145/3451964.3451981.

Full text

Abstract:

Information extraction (IE) aims at extracting structured data from unstructured or semi-structured data. The thesis starts by identifying social media data and scholarly communication data as a special case of digital social trace data (DSTD). This identification allows us to utilize the graph structure of the data (e.g., user connected to a tweet, author connected to a paper, author connected to authors, etc.) for developing new information extraction tasks. The thesis focuses on information extraction from DSTD, first, using only the text data from tweets and scholarly paper abstracts, and then using the full graph structure of Twitter and scholarly communications datasets. This thesis makes three major contributions. First, new IE tasks based on DSTD representation of the data are introduced. For scholarly communication data, methods are developed to identify article and author level novelty [Mishra and Torvik, 2016] and expertise. Furthermore, interfaces for examining the extracted information are introduced. A social communication temporal graph (SCTG) is introduced for comparing different communication data like tweets tagged with sentiment, tweets about a search query, and Facebook group posts. For social media, new text classification categories are introduced, with the aim of identifying enthusiastic and supportive users, via their tweets. Additionally, the correlation between sentiment classes and Twitter meta-data in public corpora is analyzed, leading to the development of a better model for sentiment classification [Mishra and Diesner, 2018]. Second, methods are introduced for extracting information from social media and scholarly data. For scholarly data, a semi-automatic method is introduced for the construction of a large-scale taxonomy of computer science concepts. The method relies on the Wikipedia category tree. The constructed taxonomy is used for identifying key computer science phrases in scholarly papers, and tracking their evolution over time. Similarly, for social media data, machine learning models based on human-in-the-loop learning [Mishra et al., 2015], semi-supervised learning [Mishra and Diesner, 2016], and multi-task learning [Mishra, 2019] are introduced for identifying sentiment, named entities, part of speech tags, phrase chunks, and super-sense tags. The machine learning models are developed with a focus on leveraging all available data. The multi-task models presented here result in competitive performance against other methods, for most of the tasks, while reducing inference time computational costs. Finally, this thesis has resulted in the creation of multiple open source tools and public data sets (see URL below), which can be utilized by the research community. The thesis aims to act as a bridge between research questions and techniques used in DSTD from different domains. The methods and tools presented here can help advance work in the areas of social media and scholarly data analysis.

APA, Harvard, Vancouver, ISO, and other styles

31

Mora Delgado, Jairo, Rodrigo Serrano, Roberto Piñeros Varón, and Gisou Díaz. "Use of gps and gis for monitoring of cattle´s grazing on a silvipasture of Tolima (Colombia)." Revista Investigaciones Andina 20, no. 36 (March 30, 2018): 23–38. http://dx.doi.org/10.33132/01248146.967.

Full text

Abstract:

Cattle behavior and grazing distribution is probably related to the available food, although it could also be influenced by the canopy shade, ambient temperature and access to water. The objective of this study was to evaluate the interaction among tree cover (TC) and cattle positions (CP) when searching for food and comfort areas, under warm and hot weather, in a silvopasture system. Analyses were conducted on Pajonales farm, located in the municipality of Ambalema (lat. 4° 45’ 25.9” N; 74° 52’ 20.8” W) in Colombia, from December 2009 to January 2010. The farm has an average elevation of 300 masl. Mean precipitation is 1270 mm.year-1, and temperatura 28°C. The pasture used for this study had an area of approximately 54 ha, with topography from flat to gently sloping. TC was determined from digital orthophotos QuickBird using ArcGIS® 9.1. The paddock was segmented into a 0.25 ha grid cell lattice and all sapling canopies within grid cells and animal movement were mapped.Six cows (3 Brahman and 3 F1, Brahman x Holstein) equipped with GPS-collars (Garmin eTrex-Vista) configured to record and store position, were tracked during 60 days at 5‐min intervals. Average values indicate that cows, generally, traveled greater distances in warm period (7.4 km) and 6.1 km in the hot period. Cows prefer areas with low TC (˂ 20%) and intermediate TC (20-40%); these areas had more biomass of fodder dry matter. The study is an important contribution to understanding the dynamics of animals in search for food under grazing conditions.

APA, Harvard, Vancouver, ISO, and other styles

32

Szpankowski, Wojciech. "A characterization of digital search trees from the successful search viewpoint." Theoretical Computer Science 85, no. 1 (August 1991): 117–34. http://dx.doi.org/10.1016/0304-3975(91)90050-c.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Nebel, Markus E. "Digital search trees with keys of variable length." RAIRO - Theoretical Informatics and Applications 30, no. 6 (1996): 507–20. http://dx.doi.org/10.1051/ita/1996300605071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Javanian, Mehri, and Mohammad Q. Vahidi-asl. "Analysis of digital search trees incorporated with paging." RAIRO - Theoretical Informatics and Applications 51, no. 1 (January 2017): 7–15. http://dx.doi.org/10.1051/ita/2017002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Du, Rosena R. X., and Helmut Prodinger. "Notes on protected nodes in digital search trees." Applied Mathematics Letters 25, no. 6 (June 2012): 1025–28. http://dx.doi.org/10.1016/j.aml.2011.11.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Wen, Chao Yan, Sheng Wang, Yu Huang, and Wu Yuan. "An efficient, robust and automatic overlapping grid assembly approach for partitioned multi-block structured grids." Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 233, no. 4 (January 10, 2018): 1217–36. http://dx.doi.org/10.1177/0954410017749865.

Full text

Abstract:

An efficient, robust and fully automatic grid assembly method on multi-block cell-centered structured grids for massively parallel computation is proposed in this paper. Compared with the traditional serial algorithm, the new approach eliminates the complex irregular boundaries created during the grid partition and avoids the large load imbalance caused by the large variation of grid-block overlapping. The main task of the overlapping grid assembly is to categorize all grid points into field points, fringe points and hole points. As to the main processes of the overlapping grid assembly, for hole cutting, an improved hole map method is applied to accurately identify the hole points located on the wall boundary with less memory cost. For donor search which is the most complex process on account of the irregular distribution of the partitioned multi-block structured grids in a parallel computation environment, the Alternating Digital Tree (ADT) is utilized to find out the potential donor cells quickly for query points. Besides, to achieve better overlapping quality, the wall distance criterion is implemented for overlapping optimization. In addition, two load balance algorithms are designed to solve the imbalance problem of overlapping grid assembly. Two test cases are applied to test the new overlapping grid assembly algorithm and the results show that the new overlapping grid assembly algorithm can deal with large-scale simulation of vehicles. The comparison of total time and speed-up among three algorithms manifests that the initial load balance algorithm using query point number as load criterion is not reliable while the improved load balance algorithm achieves good speed-up and least runtime. Meanwhile, the maximum proportion the improved load balance algorithm takes in one physical unsteady step in wing-pylon-store separation test case is less than 6.1%.

APA, Harvard, Vancouver, ISO, and other styles

37

Dainelli, Riccardo, Piero Toscano, Salvatore Filippo Di Gennaro, and Alessandro Matese. "Recent Advances in Unmanned Aerial Vehicle Forest Remote Sensing—A Systematic Review. Part I: A General Framework." Forests 12, no. 3 (March 11, 2021): 327. http://dx.doi.org/10.3390/f12030327.

Full text

Abstract:

Natural, semi-natural, and planted forests are a key asset worldwide, providing a broad range of positive externalities. For sustainable forest planning and management, remote sensing (RS) platforms are rapidly going mainstream. In a framework where scientific production is growing exponentially, a systematic analysis of unmanned aerial vehicle (UAV)-based forestry research papers is of paramount importance to understand trends, overlaps and gaps. The present review is organized into two parts (Part I and Part II). Part II inspects specific technical issues regarding the application of UAV-RS in forestry, together with the pros and cons of different UAV solutions and activities where additional effort is needed, such as the technology transfer. Part I systematically analyzes and discusses general aspects of applying UAV in natural, semi-natural and artificial forestry ecosystems in the recent peer-reviewed literature (2018–mid-2020). The specific goals are threefold: (i) create a carefully selected bibliographic dataset that other researchers can draw on for their scientific works; (ii) analyze general and recent trends in RS forest monitoring (iii) reveal gaps in the general research framework where an additional activity is needed. Through double-step filtering of research items found in the Web of Science search engine, the study gathers and analyzes a comprehensive dataset (226 articles). Papers have been categorized into six main topics, and the relevant information has been subsequently extracted. The strong points emerging from this study concern the wide range of topics in the forestry sector and in particular the retrieval of tree inventory parameters often through Digital Aerial Photogrammetry (DAP), RGB sensors, and machine learning techniques. Nevertheless, challenges still exist regarding the promotion of UAV-RS in specific parts of the world, mostly in the tropical and equatorial forests. Much additional research is required for the full exploitation of hyperspectral sensors and for planning long-term monitoring.

APA, Harvard, Vancouver, ISO, and other styles

38

Hubalek, Friedrich, Hsien-Kuei Hwang, William Lew, Hosam Mahmoud, and Helmut Prodinger. "A multivariate view of random bucket digital search trees." Journal of Algorithms 44, no. 1 (July 2002): 121–58. http://dx.doi.org/10.1016/s0196-6774(02)00210-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Shishibori, Masami, Satoshi Kiyohara, and Jun-ichi Aoe. "Improvement of binary digital search trees using hierarchical structures." Systems and Computers in Japan 28, no. 2 (February 1997): 86–95. http://dx.doi.org/10.1002/(sici)1520-684x(199702)28:2<86::aid-scj9>3.0.co;2-n.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

JáJá, Joseph F., Kwan Woo Ryu, and Uzi Vishkin. "Sorting strings and constructing digital search trees in parallel." Theoretical Computer Science 154, no. 2 (February 1996): 225–45. http://dx.doi.org/10.1016/0304-3975(94)00263-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Drmota, Michael. "The variance of the height of digital search trees." Acta Informatica 38, no. 4 (January 1, 2002): 261–76. http://dx.doi.org/10.1007/s236-002-8034-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Kirschenhofer, Peter, Helmut Prodinger, and Wojciech Szpankowski. "Digital Search Trees Again Revisited: The Internal Path Length Perspective." SIAM Journal on Computing 23, no. 3 (June 1994): 598–616. http://dx.doi.org/10.1137/s0097539790189368.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Louchard, G. "Exact and asymptotic distributions in digital and binary search trees." RAIRO - Theoretical Informatics and Applications 21, no. 4 (1987): 479–95. http://dx.doi.org/10.1051/ita/1987210404791.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Prodinger, Helmut. "External Internal Nodes in Digital Search Trees via Mellin Transforms." SIAM Journal on Computing 21, no. 6 (December 1992): 1180–83. http://dx.doi.org/10.1137/0221069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Suh, Jong Hwan. "SocialTERM-Extractor: Identifying and Predicting Social-Problem-Specific Key Noun Terms from a Large Number of Online News Articles Using Text Mining and Machine Learning Techniques." Sustainability 11, no. 1 (January 2, 2019): 196. http://dx.doi.org/10.3390/su11010196.

Full text

Abstract:

In the digital age, the abundant unstructured data on the Internet, particularly online news articles, provide opportunities for identifying social problems and understanding social systems for sustainability. However, the previous works have not paid attention to the social-problem-specific perspectives of such big data, and it is currently unclear how information technologies can use the big data to identify and manage the ongoing social problems. In this context, this paper introduces and focuses on social-problem-specific key noun terms, namely SocialTERMs, which can be used not only to search the Internet for social-problem-related data, but also to monitor the ongoing and future events of social problems. Moreover, to alleviate time-consuming human efforts in identifying the SocialTERMs, this paper designs and examines the SocialTERM-Extractor, which is an automatic approach for identifying the key noun terms of social-problem-related topics, namely SPRTs, in a large number of online news articles and predicting the SocialTERMs among the identified key noun terms. This paper has its novelty as the first trial to identify and predict the SocialTERMs from a large number of online news articles, and it contributes to literature by proposing three types of text-mining-based features, namely temporal weight, sentiment, and complex network structural features, and by comparing the performances of such features with various machine learning techniques including deep learning. Particularly, when applied to a large number of online news articles that had been published in South Korea over a 12-month period and mostly written in Korean, the experimental results showed that Boosting Decision Tree gave the best performances with the full feature sets. They showed that the SocialTERMs can be predicted with high performances by the proposed SocialTERM-Extractor. Eventually, this paper can be beneficial for individuals or organizations who want to explore and use social-problem-related data in a systematical manner for understanding and managing social problems even though they are unfamiliar with ongoing social problems.

APA, Harvard, Vancouver, ISO, and other styles

46

Jacquet, Philippe, and Wojciech Szpankowski. "Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees." Theoretical Computer Science 144, no. 1-2 (June 1995): 161–97. http://dx.doi.org/10.1016/0304-3975(94)00298-w.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Dennert, Florian, and Rudolf Grübel. "Renewals for exponentially increasing lifetimes, with an application to digital search trees." Annals of Applied Probability 17, no. 2 (April 2007): 676–87. http://dx.doi.org/10.1214/105051606000000862.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Grübel, Rudolf, and Paweł Hitczenko. "Pruned Discrete Random Samples." Journal of Applied Probability 50, no. 2 (June 2013): 542–56. http://dx.doi.org/10.1239/jap/1371648960.

Full text

Abstract:

Let Xi,i ∈ ℕ, be independent and identically distributed random variables with values in ℕ0. We transform (‘prune’) the sequence {X1,…,Xn},n∈ ℕ, of discrete random samples into a sequence {0,1,2,…,Yn}, n∈ ℕ, of contiguous random sets by replacing Xn+1 with Yn +1 if Xn+1 >Yn. We consider the asymptotic behaviour of Yn as n→∞. Applications include path growth in digital search trees and the number of tables in Pitman's Chinese restaurant process if the latter is conditioned on its limit value.

APA, Harvard, Vancouver, ISO, and other styles

49

Grübel, Rudolf, and Paweł Hitczenko. "Pruned Discrete Random Samples." Journal of Applied Probability 50, no. 02 (June 2013): 542–56. http://dx.doi.org/10.1017/s0021900200013553.

Full text

Abstract:

Let X i ,i ∈ ℕ, be independent and identically distributed random variables with values in ℕ0. We transform (‘prune’) the sequence {X 1,…,X n },n∈ ℕ, of discrete random samples into a sequence {0,1,2,…,Y n }, n∈ ℕ, of contiguous random sets by replacing X n+1 with Y n +1 if X n+1 >Y n . We consider the asymptotic behaviour of Y n as n→∞. Applications include path growth in digital search trees and the number of tables in Pitman's Chinese restaurant process if the latter is conditioned on its limit value.

APA, Harvard, Vancouver, ISO, and other styles

50

Zhang, Hong, Linda C. Smith, Michael Twidale, and Fang Huang Gao. "Seeing the Wood for the Trees: Enhancing Metadata Subject Elements with Weights." Information Technology and Libraries 30, no. 2 (June 1, 2011): 75. http://dx.doi.org/10.6017/ital.v30i2.3007.

Full text

Abstract:

Subject indexing has been conducted in a dichotomous way in terms of what the information object is primarily about/of or not, corresponding to the presence or absence of a particular subject term, respectively. With more subject terms brought into information systems via social tagging, manual cataloging, or automated indexing, many more partially relevant results can be retrieved. Using examples from digital image collections and online library catalog systems, we explore the problem and advocate for adding a weighting mechanism to subject indexing and tagging to make web search and navigation more effective and efficient. We argue that the weighting of subject terms is more important than ever in today’s world of growing collections, more federated searching, and expansion of social tagging. Such a weighting mechanism needs to be considered and applied not only by indexers, catalogers, and taggers, but also needs to be incorporated into system functionality and metadata schemas.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Digital search tree'

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