Увійти

Готові списки джерел за темами / Weighted strings

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Weighted strings"

Автор: Grafiati

Опубліковано: 11 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Weighted strings".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Weighted strings"

1

ZHANG, MENG, LIANG HU, and YI ZHANG. "WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING." International Journal of Foundations of Computer Science 22, no. 04 (June 2011): 921–43. http://dx.doi.org/10.1142/s0129054111008490.

Повний текст джерела

Анотація:

Full-text index structures are widely used in string matching and bioinformatics. These structures such as DAWGs and suffix trees allow fast searches on texts. In this paper, we present a new partition of the factors of a word, called a consistent minimal linear partition. Based on this partition, we introduce the weighted directed word graph (WDWG), a space-economical full-text index. WDWGs are basically cyclic, which means that they may accept infinite strings. But by assigning weights to edges, the acceptable strings are limited only to the factors of the input string. For a given word w, any factor of w can be indexed by a state of the WDWG and its length. A WDWG of w has at most |w| states and 2|w| - 1 transition edges. We present an on-line algorithm to construct a WDWG for a given word in time linear in the length of the word. Our experiment shows the size of WDWGs is smaller than that of DAWGs for many data sets including DNA sequences, Chinese texts and English texts.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

MOHRI, MEHRYAR. "EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS." International Journal of Foundations of Computer Science 14, no. 06 (December 2003): 957–82. http://dx.doi.org/10.1142/s0129054103002114.

Повний текст джерела

Анотація:

The problem of computing the similarity between two sequences arises in many areas such as computational biology and natural language processing. A common measure of the similarity of two strings is their edit-distance, that is the minimal cost of a series of symbol insertions, deletions, or substitutions transforming one string into the other. In several applications such as speech recognition or computational biology, the objects to compare are distributions over strings, i.e., sets of strings representing a range of alternative hypotheses with their associated weights or probabilities. We define the edit-distance of two distributions over strings and present algorithms for computing it when these distributions are given by automata. In the particular case where two sets of strings are given by unweighted automata, their edit-distance can be computed using the general algorithm of composition of weighted transducers combined with a single-source shortest-paths algorithm. In the general case, we show that general weighted automata algorithms over the appropriate semirings can be used to compute the edit-distance of two weighted automata exactly. These include classical algorithms such as the composition and ∊-removal of weighted transducers and a new and simple synchronization algorithm for weighted transducers which, combined with ∊-removal, can be used to normalize weighted transducers with bounded delays. Our algorithm for computing the edit-distance of weighted automata can be used to improve the word accuracy of automatic speech recognition systems. It can also be extended to provide an edit-distance automaton useful for re-scoring and other post-processing purposes in the context of large-vocabulary speech recognition.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

BROUTIN, N., and L. DEVROYE. "An Analysis of the Height of Tries with Random Weights on the Edges." Combinatorics, Probability and Computing 17, no. 2 (March 2008): 161–202. http://dx.doi.org/10.1017/s0963548307008796.

Повний текст джерела

Анотація:

We analyse the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . .d}. The edges receive random weights whose distribution depends upon the number of strings that visit that edge. Such a model covers the hybrid tries of de la Briandais and the TST of Bentley and Sedgewick, where the search time for a string can be decomposed as a sum of processing times for each symbol in the string. Our weighted trie model also permits one to study maximal path imbalance. In all cases, the weighted height is shown to be asymptotic toclognin probability, wherecis determined by the behaviour of thecoreof the trie (the part where all nodes have a full set of children) and the fringe of the trie (the part of the trie where nodes have only one child and formspaghetti-like trees). It can be found by maximizing a function that is related to the Cramér exponent of the distribution of the edge weights.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Hyyrö, Heikki, and Shunsuke Inenaga. "Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions." International Journal of Foundations of Computer Science 29, no. 04 (June 2018): 623–45. http://dx.doi.org/10.1142/s0129054118410083.

Повний текст джерела

Анотація:

Kim and Park [A dynamic edit distance table, J. Disc. Algo., 2:302–312, 2004] proposed a method (KP) based on a “dynamic edit distance table” that allows one to efficiently maintain unit cost edit distance information between two strings [Formula: see text] of length [Formula: see text] and [Formula: see text] of length [Formula: see text] when the strings can be modified by single-character edits to their left or right ends. This type of computation is useful e.g. in cyclic string comparison. KP uses linear time, [Formula: see text], to update the distance representation after each single edit. Recently Hyyrö et al. [Incremental string comparison, J. Disc. Algo., 34:2-17, 2015] presented an efficient method for maintaining the dynamic edit distance table under general weighted edit distance, running in [Formula: see text] time per single edit, where [Formula: see text] is the maximum weight of the cost function. The work noted that the [Formula: see text] space requirement, and not the running time, may be the main bottleneck in using the dynamic edit distance table. In this paper we take the first steps towards reducing the space usage of the dynamic edit distance table by RLE compressing [Formula: see text] and [Formula: see text]. Let [Formula: see text] and [Formula: see text] be the lengths of RLE compressed versions of [Formula: see text] and [Formula: see text], respectively. We propose how to store the dynamic edit distance table using [Formula: see text] space while maintaining the same time complexity as the previous methods for uncompressed strings.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Louchard, Guy, and Wojciech Szpankowski. "A Probabilistic Analysis of a String Editing Problem and its Variations." Combinatorics, Probability and Computing 4, no. 2 (June 1995): 143–66. http://dx.doi.org/10.1017/s0963548300001541.

Повний текст джерела

Анотація:

We consider a string editing problem in a probabilistic framework. This problem is of considerable interest to many facets of science, most notably molecular biology and computer science. A string editing transforms one string into another by performing a series of weighted edit operations of overall maximum (minimum) cost. The problem is equivalent to finding an optimal path in a weighted grid graph. In this paper we provide several results regarding a typical behaviour of such a path. In particular, we observe that the optimal path (i.e. edit distance) is almost surely (a.s.) equal to αn for large n where α is a constant and n is the sum of lengths of both strings. More importantly, we show that the edit distance is well concentrated around its average value. In the so called independent model in which all weights (in the associated grid graph) are statistically independent, we derive some bounds for the constant α. As a by-product of our results, we also present a precise estimate of the number of alignments between two strings. To prove these findings we use techniques of random walks, diffusion limiting processes, generating functions, and the method of bounded difference.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Barton, Carl, Chang Liu, and Solon P. Pissis. "Fast Average-Case Pattern Matching on Weighted Sequences." International Journal of Foundations of Computer Science 29, no. 08 (December 2018): 1331–43. http://dx.doi.org/10.1142/s0129054118430062.

Повний текст джерела

Анотація:

A weighted string is a string in which a set of letters may occur at each position with respective occurrence probabilities. Weighted strings, also known as position weight matrices, weighted sequences or uncertain sequences, naturally arise in many contexts. In this paper, we study the problem of weighted string matching with a special focus on average-case analysis. Given a weighted pattern string [Formula: see text] of length [Formula: see text], a text string [Formula: see text] of length [Formula: see text], both on a constant-sized alphabet of size [Formula: see text], and a cumulative weight threshold [Formula: see text], defined as the minimal probability of occurrence of factors in a weighted string, we present an on-line algorithm requiring average-case search time [Formula: see text] for pattern matching for weight ratio [Formula: see text]. For a pattern string [Formula: see text] of length [Formula: see text], a weighted text string [Formula: see text] of length [Formula: see text], both on a constant-sized alphabet, and a cumulative weight threshold [Formula: see text], we present an on-line algorithm requiring average-case search time [Formula: see text] for the same weight ratio. The importance of these algorithms lies on the fact that, for these ratios, they can work in sublinear search time in the size of the input text, and in linear preprocessing costs in the size of the pattern.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Barton, Carl, and Solon P. Pissis. "Crochemore’s Partitioning on Weighted Strings and Applications." Algorithmica 80, no. 2 (January 27, 2017): 496–514. http://dx.doi.org/10.1007/s00453-016-0266-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

SADRI, JAVAD, CHING Y. SUEN, and TIEN D. BUI. "STATISTICAL CHARACTERISTICS OF SLANT ANGLES IN HANDWRITTEN NUMERAL STRINGS AND EFFECTS OF SLANT CORRECTION ON SEGMENTATION." International Journal of Pattern Recognition and Artificial Intelligence 24, no. 01 (February 2010): 97–116. http://dx.doi.org/10.1142/s0218001410007816.

Повний текст джерела

Анотація:

A novel and efficient method for correction of slant angles in handwritten numeral strings is proposed. For the first time, the statistical distribution of slant angles in handwritten numerals is investigated and the effects of slant correction on the segmentation of handwritten numeral strings are shown. In our proposed slant correction method, utilizing geometric features, a Component Slant Angle (CSA) is estimated for each connected component independently. A weighted average is then used to compute the String Slant Angle (SSA), which is applied uniformly to correct the slant of all the components in numeral strings. Our experimental results have revealed novel statistics for slant angles of handwritten numeral strings, and also showed that slant correction can significantly improve extraction of segmentation features and segmentation accuracy of touching numerals. Comparison between our slant correction algorithm and similar algorithms in the literature show that our algorithm is more efficient, and on average it has a faster running time.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Alshawi, Hiyan, Srinivas Bangalore, and Shona Douglas. "Learning Dependency Translation Models as Collections of Finite-State Head Transducers." Computational Linguistics 26, no. 1 (March 2000): 45–60. http://dx.doi.org/10.1162/089120100561629.

Повний текст джерела

Анотація:

The paper defines weighted head transducers, finite-state machines that perform middle-out string transduction. These transducers are strictly more expressive than the special case of standard left-to-right finite-state transducers. Dependency transduction models are then defined as collections of weighted head transducers that are applied hierarchically. A dynamic programming search algorithm is described for finding the optimal transduction of an input string with respect to a dependency transduction model. A method for automatically training a dependency transduction model from a set of input-output example strings is presented. The method first searches for hierarchical alignments of the training examples guided by correlation statistics, and then constructs the transitions of head transducers that are consistent with these alignments. Experimental results are given for applying the training method to translation from English to Spanish and Japanese.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Cieliebak, Mark, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, and Emo Welzl. "Algorithmic complexity of protein identification: combinatorics of weighted strings." Discrete Applied Mathematics 137, no. 1 (February 2004): 27–46. http://dx.doi.org/10.1016/s0166-218x(03)00187-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Weighted strings"

1

Wacher, Abigail. "String gradient weighted moving finite elements for systems of partial differential equations." Thesis, University of Oxford, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.404276.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Jansche, Martin. "Inference of string mappings for speech technology." Columbus, Ohio : Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1061209163.

Повний текст джерела

Анотація:

Thesis (Ph. D.)--Ohio State University, 2003.
Title from first page of PDF file. Document formatted into pages; contains xv, 268 p.; also includes graphics. Includes abstract and vita. Advisor: Chris Brew, Dept. of Linguistics. Includes bibliographical references (p. 252-266) and index.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Θεοδωρίδης, Ευάγγελος. "Αποδοτική διαχείριση κειμενικής πληροφορίας, δεικτοδότηση, αποθήκευση, επεξεργασία και εφαρμογές". Thesis, 2009. http://nemertes.lis.upatras.gr/jspui/handle/10889/1656.

Повний текст джерела

Анотація:

Βασική επιδίωξη της παρούσας διατριβής είναι η διερεύνηση των δυνατοτήτων του πεδίου της επιστήμης των υπολογιστών που πραγματεύεται την αποθήκευση και την επεξεργασία πληροφορίας, μέσα στο περιβάλλον που έχουν σχηματίσει οι σύγχρονες εφαρμογές. Τα τελευταία χρόνια, η πληροφορία που είναι διαθέσιμη σε ηλεκτρονική μορφή, έχει γιγαντωθεί με αποτέλεσμα να είναι αναγκαία η ανάπτυξη νέων τεχνικών για την αποτελεσματική αποθήκευση και επεξεργασία αυτής. Δύο πολύ χαρακτηριστικές και σημαντικές εφαρμογές, στις οποίες ανακύπτουν συνεχώς νέα προβλήματα, είναι η διαχείριση Βιολογικών δεδομένων, όπως π.χ. οι ακολουθίες γονιδιωμάτων, καθώς και η διαχείριση πληροφορίας από τον παγκόσμιο ιστό, όπως π.χ. τα έγγραφα HTML, XML ή οι συντομεύσεις (urls). Στόχος είναι ανάπτυξη δομών δεικτοδότησης πάνω στην πληροφορία έτσι ώστε τα σχετικά ερωτήματα με αυτή να απαντώνται αποδοτικά και πολύ πιο γρήγορα από το να ψάχναμε εκτενώς μέσα σε αυτή. Χαρακτηριστικά τέτοια ερωτήματα είναι η εύρεση προτύπων (pattern matching) ή ο εντοπισμός επαναλαμβανόμενων μοτίβων (motif extraction). Πιο συγκεκριμένα, τα ϑέματα στα οποία εστίασε η παρούσα διατριβή είναι τα ακόλουϑα: - Εντοπισμός Περιοδικοτήτων σε συμβολοσειρές. Στην ενότητα αυτή δίνεται μια σειρά από αλγόριθμους για την εξαγωγή περιοδικοτήτων από συμβολοσειρές. Δίνονται αλγόριθμοι για την εξαγωγή μέγιστων επαναλήψεων, της περιόδου του καλύμματος και της ρίζας μιας συμβολοσειράς. Οι αλγόριθμοι αυτοί χρησιμοποιούν ώς βάση το δένδρο επιθεμάτων και οι περισσότεροι από αυτούς είναι γραμμικοί. - Δεικτοδότηση Βεβαρημένων Ακολουθιών. Στην επόμενη ενότητα η μελέτη εστιάζει στην δεικτοδότηση βεβαρημένων ακολουθιών, καθώς και στην απάντηση ερωτημάτων σε αυτές όπως η εύρεση προτύπων, η εύρεση επαναλήψεων, η εύρεση καλυμμάτων, κ.α.. Οι βεβαρημένες ακολουθίες είναι ακολουθίες όπου σε κάθε ϑέση τους έχουμε εμφάνιση όλων των συμβόλων του αλφαβήτου της ακολουθίας, έχοντας λάβει ένα συγκεκριμένο βάρος. Οι βεβαρημένες ακολουθίες αναπαριστούν βιολογικές ακολουθίες είτε νουκλεοτιδίων είτε αμινοξέων και στην ουσία περιγράφουν την πιθανότητα εμφάνισης ενός συμβόλου του αλφαβήτου σε μια συγκεκριμένη ϑέση της ακολουθίας ή κάποιες συγκεκριμένες βιολογικές ιδιότητες που διαθέτουν οι ρυθμιστικές πρωτεΐνες σε κάθε ϑέση της ακολουθίας. Για την διαχείριση αυτών των ιδιόμορφων ακολουθιών προτείνεται ως δομή δεικτοδότησης το βεβαρημένο δένδρο επιθεμάτων (Weighted Suffix Tree), ένα δένδρο με παρόμοια δομικά χαρακτηριστικά με αυτά του γενικευμένου δένδρου επιθεμάτων. Στην παρούσα εργασία δίνεται ο ορισμός του βεβαρημένου δένδρου επιθεμάτων και αλγόριθμοι κατασκευής του σε γραμμικό χρόνο και χώρο. -Εξαγωγή μοτίβων από βεβαρημένες Ακολουθίες. Με την χρήση του βεβαρημένου δένδρου επιθεμάτων υλοποιούνται ένα σύνολο αλγόριθμων εξαγωγής επαναληπτικών δομών από βεβαρημένες ακολουθίες. Πιο συγκεκριμένα, δίνονται αλγόριθμοι για την εύρεση μέγιστων ευγών,επαναλαμβανόμενων μοτίβων και κοινών μοτίβων από περισσότερες της μίας βεβαρημένες ακολουθίες. - Αλγόριθμοι Σύστασης Σελίδων Παγκόσμιου Ιστού με χρήση τεχνικών επεξεργασίας συμβολοσειρών. Αρκετές εφαρμογές παγκόσμιου ιστού (συστήματα σύστασης ή συστήματα κρυφής μνήμης) προσπαθούν να προβλέψουν τις προθέσεις ενός επισκέπτη είτε για να του προτείνουν είτε για να προφορτώσουν μία σελίδα. Για το σκοπό αυτό προσπαθούν να εκμεταλλευτούν οποιαδήποτε εμπειρία που έχει καταγραφεί στο σύστημα από προηγούμενες προσπελάσεις. Προτείνεται νέος τρόπος δεικτοδότησης και αναπαράστασης της πληροφορίας που εξάγεται από τα διαθέσιμα δεδομένα, όπως οι προσβάσεις των χρηστών από τα logfilesκαι το περιεχόμενο των σελίδων. Για την εξόρυξη γνώσης από τα παραπάνω δεδομένα, αυτά αναπαριστώνται ως συμβολοσειρές και στη συνέχεια επεξεργάζονται και δεικτοδοτούνται από ένα γενικευμένο βεβαρημένο δένδρο επιθεμάτων. Το δένδρο αυτό συμπυκνώνει αποδοτικά τα πιο συχνά αλλά και πιο ουσιαστικά μοτίβα προσπελάσεων και χρησιμοποιείται, αφότου κατασκευαστεί, σαν ένα μοντέλο για την πρόβλεψη των κινήσεων τον επισκεπτών ενός ιστοτόπου.
The basic goal of this thesis is to explore the possibilities of the field of computer science that deals with storing and processing information in the environment that formed by the modern applications. In recent years, the information that is available in electronic form, has met an enormous growth. Thus it is necessary to develop new techniques for efficient storage and processing. Two very specific and important applications in which constantly new problems arise are, the management of biological data, such as genome sequences, and the management information from the Web, such as documents HTML, XML or shortcuts (urls). The objective is the development of data structures for indexing information so that the questions are able to be answered in less time than looking explicitly in information. Such questions are to find patterns (pattern matching) or the identification of repeated motifs (motif extraction). In particular, the issues on which this thesis has focused are: - Locating Periodicities in strings. This section provides a series of algorithms for the extraction of periodicities of strings. We propose algorithms for the extraction of maximum repetitions of the cover, period and the seed of a string. The algorithms used are based on suffix tree and they are optimal. - Weighted Sequences indexing. In the next section, the study focuses on indexing of weighted sequences, and to answer questions like finding models, pairs, covers etc. in them. The weighted sequences are sequences where each position consists of all the symbols of the alphabet in sequence, having each one a specific weight. For the management of these sequences a particular indexing structure is proposed with the name Weighted Suffix Tree, a tree with structural features similar to those of the generalized suffix tree. In this work we propose the definition of the weighted suffix tree and construction algorithms in linear time and memory space. With the utilization of weighted suffix tree on a set of weighted sequences we propose algorithms for extracting repetitive structures from a set of weighted sequences. More specifically, we propose algorithms for finding maximum pairs, repeated motifs and common patterns of more than one weighted sequences -Recommendation Algorithms for web pages using strings processing algorithms. Several web applications (Recommendation systems or cache systems) want to predict the intentions of a visitor in order to propose or to preload a webpage. For this purpose systems try to exploit any experience that is recorded in the system from previous accesses. A new method for indexing and representing of information extracted is proposed upon the recorder data, from the user accesses in log files and content pages. For extracting knowledge from these data, the information is represented as strings and then treated and processed as weighted sequences. All these sequences are indexed by a generalized weighted sequence tree.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Παναγής, Ιωάννης-Δαμαστιανός. "Δομές δεδομένων για τη διαχείριση συμβολοσειρών και για τη διαχείριση πληροφορίας σε δικτυοκεντρικά πληροφοριακά συστήματα". Thesis, 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/1426.

Повний текст джерела

Анотація:

Οι Δομές Δεδομένων είναι ένας από τους σημαντικότερους και ιστορικότερους κλάδους της Επιστήμης των Υπολογιστών, με συνεχή εξέλιξη από τη δεκαετία του εβδομήντα μέχρι σήμερα, παρέχοντας λύσεις σε θεμελιώδη προβλήματα σε ταξινόμηση, οργάνωση, διαχείριση και αναζήτηση πληροφορίας. Παράλληλα, η ανάπτυξη σύγχρονων κλάδων της Επιστήμης των Υπολογιστών όπως τα Σύγχρονα, Δικτυοκεντρικά Πληροφοριακά Συστήματα και η Βιοπληροφορική, έφερε μαζί της την έκρηξη των δεδομένων. Η ανάγκη αποδοτικής διαχείρισης της παρεχόμενης πληροφορίας καθίσταται έτσι πιο επιτακτική από ποτέ. Στα πλαίσια αυτής της διατριβής αναγνωρίζοντας την ανάγκη για αποδοτική διαχείριση πληροφορίας σε όλα τα επίπεδα, παρουσιάζουμε τη μελέτη και την πρόταση λύσεων σε σύγχρονα προβλήματα στους χώρους: της Διαχείρισης Συμβολοσειρών, της Αναδιοργάνωσης Δικτυακών Τόπων, της Ανακάλυψης Web Services με υποστήριξη χαρακτηριστικών Ποιότητας Υπηρεσίας και της Προσωποποιημένης Ανάκτησης Πληροφορίας στο Διαδίκτυο. Σε αυτή την κατεύθυνση, στον τομέα της Διαχείρισης Συμβολοσειρών, παραθέτουμε αλγορίθμους σε θεμελιώδη προβλήματα στο χώρο της διαχείρισης Σταθμισμένων Ακολουθιών (weighted sequences), όπως ταίριασμα προτύπου, εύρεση επαναληπτικών δομών, και συνεχίζουμε δίνοντας απλοποιητικές αλλά βέλτιστες λύσεις σε προβλήματα περιοδικοτήτων σε συνήθεις συμβολοσειρές, όπως τα προβλήματα εύρεσης όλων των καλυμμάτων μιας συμβολοσειράς, εύρεσης της περιόδου μιας συμβολοσειράς και εύρεσης όλων των φύτρων μιας συμβολοσειράς. Στην Αναδιοργάνωση Δικτυακών Τόπων, παραθέτουμε δυο διαφορετικές μετρικές για την αποτίμηση της αντικειμενικής αξίας των ιστοσελίδων του κάθε ιστοτόπου. Αυτές οι μετρικές παραλλάζουν τις προσβάσεις που δέχεται κάποια ιστοσελίδα με τρόπο που καταδεικνύει την αντικειμενική αξία της ιστοσελίδας. Από πειραματική αποτίμηση των μετρικών, προκύπτει ότι παρέχουν ακριβή πληροφόρηση για τα σημεία του δικτυακού τόπου που χρήζουν αναδιοργάνωσης. Στη συνέχεια δίνουμε μια μέθοδο για τον εντοπισμό σημαντικών τμημάτων μεγαλύτερου μεγέθους στο δικτυακό τόπο και παρουσιάζουμε μια σειρά μεθόδων τόσο σε τεχνικό όσο και θεωρητικό επίπεδο για την αναδιοργάνωση ενός δικτυακού τόπου. Στον τομέα της Ανακάλυψης Web Services, εξετάζουμε την Ανακάλυψη που πληροί περιορισμούς ως προς την παρεχόμενη Ποιότητα Υπηρεσίας. Αρχικά, παρουσιάζονται δυο απλές μέθοδοι για την καταχώριση χαρακτηριστικών ποιότητας υπηρεσίας επεκτείνοντας υπάρχοντα πρότυπα υλοποίησης Web Service. Στη συνέχεια παρουσιάζουμε έναν αλγόριθμο για την ανακάλυψη του σεναρίου εκτέλεσης μιας ακολουθίας (workflow) από συνεχόμενες Web Services, που ελαχιστοποιεί το συνολικό χρόνο εκτέλεσης. Μια σειρά από ευριστικές μεθόδους παρουσιάζονται επίσης, για την υλοποίηση σε πρακτικό επίπεδο του προτεινόμενου αλγορίθμου, οι οποίες αποτιμούνται πειραματικά. Τέλος, στον τομέα της Προσωποποιημένης Ανάκτησης Πληροφορίας στο Διαδίκτυο εξετάζουμε διαφορετικές τεχνικές προσωποποίησης των αποτελεσμάτων των μηχανών αναζήτησης. Η πρώτη τεχνική εφαρμόζει μετα-κατηγοριοποίηση των αποτελεσμάτων και παρουσίασή τους ανάλογα με τη σειρά ενδιαφέροντος του χρήστη ως προς τις κατηγορίες των αποτελεσμάτων. Η δεύτερη τεχνική, βασίζει την προσωποποίηση στην έμμεση απεικόνιση των ενδιαφερόντων χρήστη στις κατηγορίες του Open Directory Project, επεκτείνει μια τεχνική που έχει πρόσφατα προταθεί, τους ιδεατούς κόμβους συσχέτισης κατηγοριών, και χτίζει πολλαπλά επίπεδα ιδεατών κόμβων για την επίτευξη πιο εκλεπτυσμένης προσωποποίησης. Κλείνοντας, παρουσιάζουμε την επέκταση της λογικής της μεθόδου προσωποποίησης για την κατασκευή εστιασμένων συλλεκτών.
Data Structures is one of the most important and most historical sectors of Computer Science, being under continuous development since the seventies. Data Structuring has offered solutions to fundamental problems in sorting, organising, and retrieving information. Meanwhile, the development of the modern fields of Computer Science such as Modern, Net-centric Information Systems and Bioinformatics has signalled a data blow-up. Therefore, the need for efficient information management has become a necessity. In this Thesis, having recognized the need for efficient information management at every level, we present a study and solutions to contemporary problems in the areas of: String Processing, Website Reorganization, Web Service retrieval with support for Quality of Service characteristics, and Personalized Information Retrieval on the Web. In the area of String Processing, we present algorithms for solving fundamental problems in Weighted Sequence Processing, such as Pattern Matching, Repetitive Structures Detection and we continue by giving simplifying yet optimal solutions to periodicity problems in ordinary sequences, namely detecting all covers in a sequence, detecting the period of a sequence and detecting all the seeds of a sequence. In the area of Website Reorganization, we present two different metrics for evaluation of the objective importance of each website's pages. These metrics modify the accesses each page receives in order to present the actual page importance. We have seen from the experimental evaluation of those metrics that they provide accurate information about the areas inside the website in need of reorganization. Furthermore, we present a method to detect larger important parts inside the website and we present methods for website reorganisation both from a technical and from a theoretical viewpoint. In the area of Web Service Retrieval we are coping with retrieval under constraints for the provided Quality of Service (QoS). Firstly, we present two simple methods to register QoS information by extending existing Web Service protocols. Secondly, we present an algorithm to discover the execution scenario for a sequence of contiguous Web Services that minimizes the total execution time. A series of heuristics to implement the above algorithm is also presented. We also present an extensive experimental evaluation of those heuristics. Ultimately, we present different personalization techniques for personalized Web Information Retrieval. The first technique, applies post-categorization of search engine results and presents them according to user preferences with respect to the results' categories. The second technique is based on implicit mapping of user preferences to the categories of the Open Directory Project, it extends a recently proposed technique, namely virtual nodes for associating categories, and builds multiple layers of nodes to achieve more elaborate personalization. Finally, we present the extension of personalization methods in order to build focused crawlers.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Weighted strings"

1

Little, Jean. Garfield gains weight. New York: Ballantine Books, 2001.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

translator, Scott-Railton Thomas, ed. Blast: Dead weight. Paris?]: Europe Comics, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Thorpe, J. Analysis of bird strikes to UK registered aircraft 1984: (civil aircraft over 5700kg maximum weight). London: Civil Aviation Authority, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Garfield pulls his weight. Taiwan: Shuang Dua, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Garfield pulls his weight. New York: Ballantine Books, 1994.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Thorpe, J. Analysis of bird strikes to United Kingdom registered aircraft 1985: Civil aircraft over 5700kg maximum weight. London: Civil Aviation Authority, 1987.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Neonpi. Taiŏt'ŏ: Kŏn'gang han saenghwal ŭl wihan pon'gyŏk taiŏt'ŭ wept'un. Sŏul-si: Chungang Books, 2011.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Carlos, Pacheco, and Merino Jesús, eds. Superman.: The weight of the world. New York: DC Comics, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Busiek, Kurt. Superman.: The weight of the world. New York: DC Comics, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Gaines, Charles. Staying hard: The only exercise book you will ever need. New York: Simon & Schuster, 1985.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Weighted strings"

1

Rabusseau, Guillaume. "Minimization of Graph Weighted Models over Circular Strings." In Lecture Notes in Computer Science, 513–29. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89366-2_28.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Bansal, Nikhil, Mark Cieliebak, and Zsuzsanna Lipták. "Efficient Algorithms for Finding Submasses in Weighted Strings." In Combinatorial Pattern Matching, 194–204. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27801-6_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Cieliebak, Mark, Zsuzsanna Lipták, Emo Welzl, Thomas Erlebach, and Jens Stoye. "Algorithmic Complexity of Protein Identification: Searching in Weighted Strings." In Foundations of Information Technology in the Era of Network and Mobile Computing, 143–56. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-0-387-35608-2_13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Barton, Carl, and Solon P. Pissis. "Linear-Time Computation of Prefix Table for Weighted Strings." In Lecture Notes in Computer Science, 73–84. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23660-5_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

De Stefano, Claudio, Marco Garruto, Luis Lapresa, and Angelo Marcelli. "Using Strings for On-Line Handwriting Shape Matching: A New Weighted Edit Distance." In Image Analysis and Processing – ICIAP 2005, 1125–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11553595_138.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Franek, Lucas, and Xiaoyi Jiang. "Evolutionary Weighted Mean Based Framework for Generalized Median Computation with Application to Strings." In Lecture Notes in Computer Science, 70–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34166-3_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Welsing, Alexander, Andreas Nienkötter, and Xiaoyi Jiang. "Exponential Weighted Moving Average of Time Series in Arbitrary Spaces with Application to Strings." In Lecture Notes in Computer Science, 45–54. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-73973-7_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Amir, Amihood, Zvi Gotthilf, and B. Riva Shalom. "Weighted Shortest Common Supersequence." In String Processing and Information Retrieval, 44–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24583-1_6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Iliopoulos, Costas S., Katerina Perdikuri, Evangelos Theodoridis, Athanasios Tsakalidis, and Kostas Tsichlas. "Motif Extraction from Weighted Sequences." In String Processing and Information Retrieval, 286–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30213-1_41.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Jiang, Xiaoyi, and Horst Bunke. "Weighed Mean Generalized Median of Strings." In Pattern Recognition and String Matching, 295–314. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4613-0231-5_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Weighted strings"

1

Hajianmaleki, Mehdi, Jeremy S. Daily, Lev Ring, and Raju Gandikota. "Buckling Analysis of Drill Strings in Inclined Wellbores Using the Explicit Finite Element Method." In ASME 2012 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/imece2012-89638.

Повний текст джерела

Анотація:

Understanding drill string buckling behavior is a significant challenge to the petroleum industry. In this paper, the explicit finite element method implemented in Abaqus software is employed to study the buckling of drill strings for inclined straight wellbores. Classic solutions for the critical buckling length of self-weighted columns as well as critical buckling load for drill pipe inside inclined wellbores are compared to explicit FEA and accurate results are provided by the finite element based predictions. The effect of different inclination angles and string effective weight due to the buoyancy effect has been studied and the results for sinusoidal and helical buckling are compared to analytical results and experimental data in the literature. The theoretical predictions for different inclination angles agree with the simulations. Theoretical buckling load of inclined drill strings approaches zero by decreasing the effective weight of a floating drill string. However, the results of finite element simulations show that significant buckling load would still exist for very low drill string effective weight. These results are confirmed by experimental results provided by other researchers. Overall, the efficacy of using explicit finite element methods to model drill string buckling behavior is demonstrated.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Kishino, Mika, and Kanako Komiya. "Extraction of Linguistic Speech Patterns of Japanese Fictional Characters using Subword Units." In 10th International Conference on Natural Language Processing (NLP 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.112307.

Повний текст джерела

Анотація:

This study extracted and analyzed the linguistic speech patterns that characterize Japanese anime or game characters. Conventional morphological analyzers, such as MeCab, segment words with high performance, but they are unable to segment broken expressions or utterance endings that are not listed in the dictionary, which often appears in lines of anime or game characters. To overcome this challenge, we propose segmenting lines of Japanese anime or game characters using subword units that were proposed mainly for deep learning, and extracting frequently occurring strings to obtain expressions that characterize their utterances. We analyzed the subword units weighted by TF/IDF according to gender, age, and each anime character and show that they are linguistic speech patterns that are specific for each feature. Additionally, a classification experiment shows that the model with subword units outperformed that with the conventional method.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Amat, Sergio, Gustavo E. Henríquez Velez, and María J. Legaz. "Drilling String Vibration: Modelling and Simulation." In ASME 2018 37th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/omae2018-77685.

Повний текст джерела

Анотація:

The offshore industry has a significant impact on the global economy and it is expected to grow over the next 4 years. A crucial part of an offshore structure is the drill string. Drill strings can be seriously damaged by vibration during drilling operations. The control of vibrations in drill strings is essential. In drilling wells, this is useful to minimize the risks of well loss and also to improve drilling performance. The objective of this study is to model and simulate the vibrations in drill strings. This is made to know the region of stabilization of the system and to establish the optimal parameters of drilling which can be manipulated from the driller console, such as angular velocity of the drill string on the surface and the weight on the drill bit. The simulation of these vibrations is made by solving the differential equations that describe these phenomena. An interface for the manipulation of variables involved in the models of the drill string has been designed and shown in this work.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Dalgit Singh, Harpreet Kaur, Essam Sammat, Thakornpol Kleawyothatis, Kittikun Niracharopas, and Kazem Kiani Nassab. "Gulf of Thailand 4-String Well Design Transformation Using MPD System – Cost Saving, Operational Challenges and Learnings." In IADC/SPE Asia Pacific Drilling Technology Conference and Exhibition. SPE, 2022. http://dx.doi.org/10.2118/209911-ms.

Повний текст джерела

Анотація:

Abstract Gulf of Thailand (GoT) or Gulf of Siam is mainly offshore development gas wells in Thailand. Well C and well H were originally designed with GoT 4-string standard template. However, Managed Pressure Drilling (MPD) solution was then selected to save one (1) casing string provided that the maximum expected formation pressure to be within the range of 1.46-1.50SG as per geological prognosis. Both wells were drilled to plan TD with 3-casing strings as planned to result in a cost-saving from the design transformation (4-strings to 3-strings) using the MPD system. There is always a risk of lost circulation and ballooning in intermediate/high-pressure wells (Pore Pressure (PP) > 1.45SG) when drilling conventionally with 3-casing strings (instead of GoT 4-string standard design). Required high mud weight imposes an overbalance during drilling and tripping operations that exceed formation integrity at shallower depths below the 7" casing. MPD is a proven technology for maintaining Constant Bottom Hole Pressure (CBHP) that enables precise control on wellbore pressure to mitigate ballooning and kick/loss hazards, narrow margin drilling window, and formation pressure uncertainties. The 6-1/8" hole sections of both wells were drilled with the MPD technology to mitigate the loss of circulation and ballooning while drilling. MPD system worked for this project to drill the wells to TD successfully according to the plan and without any major issue. The MPD solution enabled drilling with the lowest and safest underbalanced mud weight to allow a reduction in Bottom Hole Pressure (BHP) and consequently eliminated ballooning while drilling. Surface back pressure (SBP) on connections was increased (compared to the plan) based on connection gas reading caused by pore pressure uncertainties. MPD dynamic formation integrity test (DFIT) and static pore pressure tests (PPT) have established a baseline for heavy kill mud weight estimations and displacing before tripping out of the hole. Observations and learnings from well C confirmed the study’s preliminary conclusions that the 4-strings transformation is quite challenging for PP greater than 1.55SG, and 4-string transformation is not recommended if PP exceeds 1.60SG. The wells were completed with 3-casing strings however, no NPT related to well design and MPD was encountered. The technology was proven and allowed to drill the well with 3-strings design. The solution can save some cost in intermediate pressure wells (1.46-1.54SG PP), and it is proposed for the next trials with more focus on wellbore conditioning and tripping practices.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Malocha, Svetlana, Rodolfo Chang, and Jon Vandendriessche. "String weighted tapered SAW transducer analysis." In 2009 IEEE International Ultrasonics Symposium. IEEE, 2009. http://dx.doi.org/10.1109/ultsym.2009.5441791.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Barenghi, Alessandro, and Gerardo Pelosi. "Constant weight strings in constant time." In CF '20: Computing Frontiers Conference. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3387902.3392630.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Reinås, Lorents, Morten Sæther, and Bernt Sigve Aadnøy. "The Effect of a Fatigue Failure on the Wellhead Ultimate Load Capacity." In ASME 2012 31st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/omae2012-83325.

Повний текст джерела

Анотація:

A subsea well will experience external loading during drilling operations that can lead to the development of a fatigue fracture in the primary load bearing structural members of the upper well construction. Such a fatigue fracture can occur at several fatigue hotspots which all are located in the upper part of a subsea well. There are two main load sharing structural members; the outer tubular string named the conductor (structural) casing and the next tubular string named the surface casing. Both these strings have a circumferential load bearing weld close to the top. The load sharing between these 2 tubular strings are affected by the supported weight from further tubular strings placed inside the well. This paper discusses the residual ultimate load capacity of a typical North Sea subsea well assuming that a fatigue fracture has developed. The discussion is based on FEM analysis results where a fully developed fatigue fracture has been introduced to the analytical model of a typical well either to the conductor part of the well or to the surface casing string. Then the residual ultimate load capacity is evaluated assuming a fully developed fatigue fracture. Evaluations presented herein can be important and necessary tools in considering the consequences of a possible fatigue failure of a subsea well. A reduction in ultimate load capacity due to a fatigue fracture may reduce the safety margin should an accidental or extreme loading occur. The results indicate that the location of the potential fatigue failure is important when assessing the residual ultimate load capacity. If the factored fatigue life of a subsea well is approaching its limit the presence of a fatigue fracture should be assumed. The most prudent approach would then be to perform a permanent P&A operation of the well. Planning of such operations should comprehend the possibility of reduced structural capacity of the well due to a fatigue fracture. This paper also discusses the results in an operational context. The applied methodology is outlined and illustrative results are presented from a typical North Sea well.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Okul, Aydin, and Ercan Gurses. "Development of Structural Neural Network Design Tool for Buckling Behaviour of Skin-Stringer Structures Under Combined Compression and Shear Loading." In ASME 2018 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/imece2018-87970.

Повний текст джерела

Анотація:

Stiffened panels are commonly used in aircraft structures in order to resist high compression and shear forces with minimum total weight. Minimization of the weight is obtained by combining the optimum design parameters. The panel length, the stringer spacing, the skin thickness, the stringer section type and the stringer dimensions are some of the critical parameters which affect the global buckling allowable of the stiffened panel. The aim of this study is to develop a design tool and carry out a geometric optimization for panels having a large number of stringers. The panel length and the applied compression-shear loads are assumed to be given. In the preliminary part, a simplified panel with minimized number of stringers is found. This panel gives the same equivalent critical buckling load of panels having larger number of stringers. Additionally, the boundary conditions to be substituted for the outer stringer lines are studied. Then the effect of some critical design parameters on the buckling behavior is investigated. In the second phase, approximately six thousand finite element (FE) models are created and analyzed in ABAQUS FE program with the help of a script written in Phyton language. The script changes the parametric design variables and analyzes each skin-stringer model, and collect the buckling analysis results. These design variables and analysis results are grouped together in order to create an artificial neural network (ANN) in MATLAB NNTOOL toolbox. This process allows faster determination of buckling analysis results than the traditional FE analyses.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Sherman, Elena, and Andrew Harris. "Accurate String Constraints Solution Counting with Weighted Automata." In 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE). IEEE, 2019. http://dx.doi.org/10.1109/ase.2019.00049.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Rama, Taraka. "Automatic cognate identification with gap-weighted string subsequences." In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Stroudsburg, PA, USA: Association for Computational Linguistics, 2015. http://dx.doi.org/10.3115/v1/n15-1130.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Weighted strings"

1

Bonfil, David J., Daniel S. Long, and Yafit Cohen. Remote Sensing of Crop Physiological Parameters for Improved Nitrogen Management in Semi-Arid Wheat Production Systems. United States Department of Agriculture, January 2008. http://dx.doi.org/10.32747/2008.7696531.bard.

Повний текст джерела

Анотація:

To reduce financial risk and N losses to the environment, fertilization methods are needed that improve NUE and increase the quality of wheat. In the literature, ample attention is given to grid-based and zone-based soil testing to determine the soil N available early in the growing season. Plus, information is available on in-season N topdressing applications as a means of improving GPC. However, the vast majority of research has focused on wheat that is grown under N limiting conditions in sub-humid regions and irrigated fields. Less attention has been given to wheat in dryland that is water limited. The objectives of this study were to: (1) determine accuracy in determining GPC of HRSW in Israel and SWWW in Oregon using on-combine optical sensors under field conditions; (2) develop a quantitative relationship between image spectral reflectance and effective crop physiological parameters; (3) develop an operational precision N management procedure that combines variable-rate N recommendations at planting as derived from maps of grain yield, GPC, and test weight; and at mid-season as derived from quantitative relationships, remote sensing, and the DSS; and (4) address the economic and technology-transfer aspects of producers’ needs. Results from the research suggest that optical sensing and the DSS can be used for estimating the N status of dryland wheat and deciding whether additional N is needed to improve GPC. Significant findings include: 1. In-line NIR reflectance spectroscopy can be used to rapidly and accurately (SEP <5.0 mg g⁻¹) measure GPC of a grain stream conveyed by an auger. 2. On-combine NIR spectroscopy can be used to accurately estimate (R² < 0.88) grain test weight across fields. 3. Precision N management based on N removal increases GPC, grain yield, and profitability in rainfed wheat. 4. Hyperspectral SI and partial least squares (PLS) models have excellent potential for estimation of biomass, and water and N contents of wheat. 5. A novel heading index can be used to monitor spike emergence of wheat with classification accuracy between 53 and 83%. 6. Index MCARI/MTVI2 promises to improve remote sensing of wheat N status where water- not soil N fertility, is the main driver of plant growth. Important features include: (a) computable from commercial aerospace imagery that include the red edge waveband, (b) sensitive to Chl and resistant to variation in crop biomass, and (c) accommodates variation in soil reflectance. Findings #1 and #2 above enable growers to further implement an efficient, low cost PNM approach using commercially available on-combine optical sensors. Finding #3 suggests that profit opportunities may exist from PNM based on information from on-combine sensing and aerospace remote sensing. Finding #4, with its emphasis on data retrieval and accuracy, enhances the potential usefulness of a DSS as a tool for field crop management. Finding #5 enables land managers to use a DSS to ascertain at mid-season whether a wheat crop should be harvested for grain or forage. Finding #6a expands potential commercial opportunities of MS imagery and thus has special importance to a majority of aerospace imaging firms specializing in the acquisition and utilization of these data. Finding #6b on index MCARI/MVTI2 has great potential to expand use of ground-based sensing and in-season N management to millions of hectares of land in semiarid environments where water- not N, is the main determinant of grain yield. Finding #6c demonstrates that MCARI/MTVI2 may alleviate the requirement of multiple N-rich reference strips to account for soil differences within farm fields. This simplicity will be less demanding of grower resources, promising substantially greater acceptance of sensing technologies for in-season N management.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!