scispace - formally typeset
Search or ask a question

Showing papers on "String (computer science) published in 2001"


Proceedings ArticleDOI
06 Jul 2001
TL;DR: This model transforms a source-language parse tree into a target-language string by applying stochastic operations at each node, and produces word alignments that are better than those produced by IBM Model 5.
Abstract: We present a syntax-based statistical translation model. Our model transforms a source-language parse tree into a target-language string by applying stochastic operations at each node. These operations capture linguistic differences such as word order and case marking. Model parameters are estimated in polynomial time using an EM algorithm. The model produces word alignments that are better than those produced by IBM Model 5.

924 citations


Proceedings Article
11 Sep 2001
TL;DR: In this article, the authors propose a technique for building approximate string join capabilities on top of commercial databases by exploiting facilities already available in them. But this technique relies on matching short substrings of length, called -grams, and taking into account both positions of individual matches and the total number of such matches.
Abstract: String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more complex queries involving joins. This is due, for example, to the prevalence of typographical errors in data, and multiple conventions for recording attributes such as name and address. Commercial databases do not support approximate string joins directly, and it is a challenge to implement this functionality efficiently with user-defined functions (UDFs). In this paper, we develop a technique for building approximate string join capabilities on top of commercial databases by exploiting facilities already available in them. At the core, our technique relies on matching short substrings of length , called -grams, and taking into account both positions of individual matches and the total number of such matches. Our approach applies to both approximate full string matching and approximate substring matching, with a variety of possible edit distance functions. The approximate string match predicate, with a suitable edit distance threshold, can be mapped into a vanilla relational expression and optimized by conventional relational optimizers. We demonstrate experimentally the benefits of our technique over the direct use of UDFs, using commercial database systems and real data. To study the I/O and CPU behavior of approximate string join algorithms with variations in edit distance and -gram length, we also describe detailed experiments based on a prototype implementation.

556 citations


Book ChapterDOI
01 Jul 2001
TL;DR: It is shown that the algorithm is crucial to the effective use of block-sorting compression and a linear-time algorithm to simulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest common prefix information is presented.
Abstract: We present a linear-time algorithm to compute the longest common prefix information in suffix arrays As two applications of our algorithm, we show that our algorithm is crucial to the effective use of block-sorting compression, and we present a linear-time algorithm to simulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest common prefix information

520 citations


Journal ArticleDOI
TL;DR: In this article, it was shown that the compression ratio of Gzip and Gzip can be bounded in terms of the kth order empirical entropy of the input string for any k ≥ 0.
Abstract: The Burrows—Wheeler Transform (also known as Block-Sorting) is at the base of compression algorithms that are the state of the art in lossless data compression In this paper, we analyze two algorithms that use this technique The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity outperforms the Gzip compressor The second one uses an additional run-length encoding step to improve compression We prove that the compression ratio of both algorithms can be bounded in terms of the kth order empirical entropy of the input string for any k ≥ 0 We make no assumptions on the input and we obtain bounds which hold in the worst case that is for every possible input string All previous results for Block-Sorting algorithms were concerned with the average compression ratio and have been established assuming that the input comes from a finite-order Markov source

387 citations


Patent
30 May 2001
TL;DR: In this paper, the authors proposed a tag identification method using an efficient memoryless protocol, which includes a reader and a plurality of tags, and the reader is adapted to maintain an ordered set of query strings; select a string from the set of queries; broadcast a query message containing the selected string or a portion of the selected strings to the tags; and receive a response from one of the tags.
Abstract: The invention features a method and system for identifying a plurality of tags using an efficient memoryless protocol. The system includes a reader and a plurality of tags. The reader is adapted to maintain an ordered set of query strings; select a string from the set of query strings; broadcast a query message containing the selected string or a portion of the selected string to the tags; and receive a response from one of the tags. The tags operate without batteries and are adapted to respond to the selected string broadcast by the reader. Accordingly, the tag identification methods are efficient in terms of both time and communication complexities.

288 citations


Patent
27 Jul 2001
TL;DR: In this paper, a secure identification of a user in an electronic communications environment, wherein a host computer communicates with a plurality of electronic devices operated by the user, is discussed, and the user is issued a user code, known only to the user and stored in the host computer.
Abstract: Secure identification of a user in an electronic communications environment, wherein a host computer communicates with a plurality of electronic devices operated by the user. The user is issued a user code, known only to the user and stored in the host computer. User identification involves the host computer generating a pseudo-random security string and applying the user code to the pseudo-random security string to generate a transaction code. The host computer also transmits the pseudo-random security string to one of the electronic devices which displays the pseudo-random security string to the user. The user generates the transaction code by applying their known user code to the displayed pseudo-random security string. The user enerated transaction code is entered into an electronic device, then transmitted back to the host computer. Positive identification is achieved when the host computer determined transaction code matches the user generated transaction code.

275 citations


Patent
Barry Lynn Fritchman1
02 May 2001
TL;DR: In this paper, a method for matching a pattern string with a target string, where either string can contain single or multi-character wild cards, is described, which includes the steps of preprocessing the pattern string into a prefix, a suffix, and zero or more interior segments.
Abstract: The method of the present invention is useful in a computer system including at least one client. The program executes a method for matching a pattern string with a target string, where either string can contain single or multi-character wild cards. The method includes the steps of preprocessing the pattern string into a prefix segment, a suffix segment, and zero or more interior segments. Next, matching the prefix segment, the suffix segment, and the interior segment(s) with the target string.

217 citations


Patent
26 Feb 2001
TL;DR: In this paper, an intermediate switch is provided midway along the solar battery string, where the ground fault has occurred, and the battery string is divided into substrings, such that if the open-circuit voltage is high, a safety problem arises.
Abstract: When a ground fault occurs in some solar battery string, this solar battery string may be disconnected and operation of a solar power generation system may be continued. If the open-circuit voltage of the solar battery string is high, a safety problem arises. If the open-circuit voltage is decreased, the conversion efficiency decreases. Therefore, an intermediate switch is provided midway along the solar battery string. When a ground fault occurs, this solar battery string where the ground fault has occurred is divided into substrings.

188 citations


Patent
27 Jul 2001
TL;DR: In this paper, a method for controlling access to a product includes receiving a request for a product, generating a license string for the product, and transmitting that license string to a user of the product.
Abstract: A method for controlling access to a product includes receiving a request for a product, generating a license string for the product, and transmitting that license string to a user of the product. The license string is generated substantially at the time a request is received. A corresponding system is also described. In some embodiments the product functions for a trial period before requiring input of the license string. License strings may be generated that extend the trial period.

173 citations


Patent
09 Mar 2001
TL;DR: In this article, a system, method and computer program product for enhanced speech synthesis is described, where a string of words to be outputted is received, and a database of words is queried to match the string for output purposes.
Abstract: A system, method and computer program product are provided for enhanced speech synthesis. Initially, a string of words to be outputted is received. In response thereto, a database of words is queried to match the string of words for output purposes. If, however, no match is made, the string of words is parsed. The database of words is queried to match the parsed string of words for output purposes.

157 citations


Patent
Hiyan Alshawi1, Shona Douglas1
30 Nov 2001
TL;DR: In this article, the authors present a system and method for providing speech-enabled application programs that automatically execute requests input by users using a natural language exemplar mapped to the prospective variant.
Abstract: Embodiments of the invention relate to a system and method for providing speech-enabled application programs. The speech-enabled programs automatically execute requests input by users. One or more natural language variants may be mapped with at least one natural language exemplar. The natural language exemplar may correspond to a typical way to express a request relevant to the speech-enabled application program. The natural language variant may correspond to an alternative way of expressing the same request. A recognized input string is received and a prospective variant that most resembles the received recognized input string is selected from the natural language variants. The natural language exemplar mapped to the prospective variant is identified. An action instruction associated with the identified natural language exemplar is executed to fulfill the user's request.

Patent
14 Jul 2001
TL;DR: In this article, a method and apparatus for detecting a class of viral code is presented. The apparatus consists of an heuristic analyzer and a search component, which heuristically analyzes a subject file and generates a set of flags along with statistical information.
Abstract: A method and apparatus for detecting a class of viral code are provided. The apparatus comprises an heuristic analyzer and a search component. The heuristic analyzer heuristically analyzes a subject file and generates a set of flags along with statistical information. The search component uses the set of flags with statistical information to perform a search for a scan string and/or a statement type in the subject file. A positive detection alarm is triggered if the scan string and/or statement type is found at least a corresponding predetermined number of times. The heuristic analyzer may be rule-based and comprise an heuristic engine and heuristic rules. The search component also may be rule-based and comprise a search engine and viral code class rules.

Patent
Jeff Reynar1
24 Apr 2001
TL;DR: In this paper, a method for recognizing strings, labeling the strings with a semantic category and providing e-commerce actions based on the category is disclosed, which can be used to implement coupon and affiliate programs to reward frequent shoppers or frequent recommenders.
Abstract: Methods for recognizing strings, labeling the strings with a semantic category and providing e-commerce actions based on the category is disclosed. The semantic category may include a type label and other metadata. Recognizer plug-ins perform the recognition of particular strings in an electronic document. The recognizer plug-ins may be packaged with an application program module or they may be written by third parties to recognize particular strings that are of interest. Action plug-ins provide possible actions to be presented to the user based upon the type label associated with the string. Tradenames, trademarks, formal names or types of consumer products may be labeled and actions to buy the products may be presented. The metadata may be used to implement coupon and affiliate programs to reward frequent shoppers or frequent recommenders. Numerous other e-commerce opportunities are presented via the semantic category and the metadata.

Proceedings Article
11 Sep 2001
TL;DR: This paper proposes to map the substrings of the data into an integer space with the help of wavelet coefficients, and defines a distance function which is a lower bound to the actual edit distance between strings.
Abstract: We consider the problem of substring searching in large databases. Typical applications of this problem are genetic data, web data, and event sequences. Since the size of such databases grows exponentially, it becomes impractical to use inmemory algorithms for these problems. In this paper, we propose to map the substrings of the data into an integer space with the help of wavelet coefficients. Later, we index these coefficients using MBRs (Minimum Bounding Rectangles). We define a distance function which is a lower bound to the actual edit distance between strings. We experiment with both nearest neighbor queries and range queries. The results show that our technique prunes significant amount of the database (typically 50-95%), thus reducing both the disk I/O cost and the CPU cost significantly .

Journal ArticleDOI
TL;DR: The development of techniques to use the succinct tree representation through balanced parentheses for suffix trees and several index structures for binary texts, with less space are given.

Journal Article
TL;DR: This paper develops a technique for building approximate string processing capabilities on top of commercial databases by exploiting facilities already available in them by relying on generating short substrings of length q, called q-grams, and processing them using standard methods available in the DBMS.
Abstract: String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data. This is due, for example, to the prevalence of typographical errors in data, and multiple conventions for recording attributes such as name and address. Commercial databases do not support approximate string queries directly, and it is a challenge to implement this functionality efficiently with user-defined functions (UDFs). In this paper, we develop a technique for building approximate string processing capabilities on top of commercial databases by exploiting facilities already available in them. At the core, our technique relies on generating short substrings of length q, called q-grams, and processing them using standard methods available in the DBMS. The proposed technique enables various approximate string processing methods in a DBMS, for example approximate (sub)string selections and joins, and can even be used with a variety of possible edit distance functions. The approximate string match predicate, with a suitable edit distance threshold, can be mapped into a vanilla relational expression and optimized by conventional relational optimizers.

Book ChapterDOI
06 May 2001
TL;DR: A probabilistic construction of all-or-nothing transforms and exposure-resilient functions is given which is essentially optimal and substantially improves on previous constructions of [19, 5], as a result of which nearly optimal adaptively secure ERF's and AONT's are obtained.
Abstract: We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposure-resilient functions. Both are concerned with retaining security when an intruder learns some bits of a string which is supposed to be secret: all-or-nothing transforms (AONT) protect their input even given partial knowledge of the output; exposure-resilient functions (ERF) hide their output even given partial exposure of their input. Both of these primitives can be defined in the perfect, statistical and computational settings and have a variety of applications in cryptography. In this paper, we study how these notions fare against adaptive adversaries, who may choose which positions of a secret string to observe on the fly. In the perfect setting, we prove a new, strong lower bound on the constructibility of (perfect) AONT. This applies to both standard and adaptively secure AONT. In particular, to hide an input as short as log n bits, the adversary must see no more than half of the n-bit output. This bound also provides a new impossibility result on the existence of (ramp) secret-sharing schemes [6] and relates to a combinatorial problem of independent interest: finding "balanced" colorings of the hypercube. In the statistical setting, we show that adaptivity adds strictly more power to the adversary. We relate and reduce the construction of adaptive ERF's to that of almost-perfect resilient functions [19], for which the adversary can actually set some of the input positions and still learn nothing about the output. We give a probabilistic construction of these functions which is essentially optimal and substantially improves on previous constructions of [19, 5]. As a result, we get nearly optimal adaptively secure ERF's and AONT's. Finally, extending the statistical construction we obtain optimal computational adaptive ERF's, "public-value" AONT's and resilient functions.

Patent
Stephen William Edge1
27 Sep 2001
TL;DR: In this paper, a method and system allowing two or more different coordinates for a geographic location to be expressed as a single string of characters is presented. But this method is not suitable for the localization of objects.
Abstract: A method and system allows two or more different coordinates for a geographic location to be expressed as a single string of characters. The single string of characters may include numerical digits or numbers, alphabetic characters or letters, punctuation or other typographical marks, other symbols, or a combination of two or more of these. A geographic location may refer to a physical place, the location of an object, or some other location.

Patent
12 Mar 2001
TL;DR: In this paper, a document scanner, system and method operates in conjunction with a document imprinted with data and a plurality of form documents adapted to have data imprinted thereon, and the system selects one of the stored forms, extracts the data from each data field, decodes or calculates the data, and validates the data (in the presence of data validation parameters) and stores the decoded or calculated data.
Abstract: The document scanner, system and method operates in conjunction with a document imprinted with data and a plurality of form documents adapted to have data imprinted thereon. The documents have at least one and typically many data image fields. Ultimately, the document scanner, system and method outputs a delimited string of decoded characters to another computer system via a common computer communications port. The method includes either scanning a form document to obtain positional information of the data field or fields or inputting a topological description of the field. Typically, the operator identifies descriptors for each data field which include data field size information, data type information, the presence or absence of data validation parameters, the presence or absence of data error reporting and data correction routines or parameters, and data output destination information. The data output destination information locates the decoded data in a certain sequence or location in the delimited string of decoded characters output to the coupled computer system. The document scanner, system and method scans the document imprinted with data and captures an image thereof. The scanned input document image is compared with the stored forms, and particularly the stored data field descriptors utilizing positional, data field size and data type information. The system selects one of the stored forms, extracts the data from each data field, decodes or calculates the data, and validates the data (in the presence of data validation parameters) and stores the decoded/calculated data. A data error reporting and data correction system, activated in the presence of the data error reporting and correction descriptor, enables correction of errors.

Patent
Robin Green1
31 Jul 2001
TL;DR: A character look-up table is a boolean array with one bit elements that are processed in groups whose size corresponds to the maximum bit processing count of the computer, effectively culling non-matching words simultaneously as mentioned in this paper.
Abstract: A computer-operated document retrieval system includes a lexicon of words contained in system documents, and a document look-up table that relates words by unique word numbers to the documents. A word look-up table identifies sets of words with common characteristics, specifically prefix value and word length, and a character look-up table identifies whether any word contains a specified character. A target set generator accesses the word look-up table to compose a target word set with characteristics corresponding to the search string. A refining module reduces the target set by selecting a set of characters from the search string, and accessing the character look-up table to identify which target words use the character set. The character look-up table is a boolean array with one bit elements that are processed in groups whose size corresponds to the maximum bit processing count of the computer, effectively culling non-matching words simultaneously. A string comparison module determines whether any word remaining in the target set matches the search string. The system quickly executes various searches, including prefix, exact match, wildcard, and fuzzy searches.

Patent
30 May 2001
TL;DR: The process of turning plain text into animated sequences using a digital image generator, which can be a computer or digital video system is disclosed in this article, where a text string is analyzed to determine the concepts contained in the string and an animation compositor is used to compose an animated sequence based on the selected concept.
Abstract: The process of turning plain text into animated sequences using a digital image generator, which can be a computer or digital video system is disclosed. A text string is analyzed to determine the concepts contained in the string. An Animation Compositor is used to compose an animated sequence based on the selected concept. The disclosed invention combined with the animation compositor can take a text string and display an animated story, which is conceptually related to the text.

Book ChapterDOI
16 Jul 2001
TL;DR: A new algorithm for statically detecting buffer overflow defects caused by string manipulations in C programs is presented, capable of precisely handling destructive memory updates, even in the presence of overlapping pointer variables which reference the same buffer at different offsets.
Abstract: All practical C programs use structures, arrays, and/or strings. At runtime, such objects are mapped into consecutive memory locations, hereafter referred to as buffers. Many software defects are caused by buffer overflow -- unintentional access to memory outside the intended object. Stringma nipulation is a major source of such defects. Accordingto the FUZZ study, they are the cause of most UNIX failures. We present a new algorithm for statically detecting buffer overflow defects caused by string manipulations in C programs. In many programs, our algorithm is capable of precisely handling destructive memory updates, even in the presence of overlapping pointer variables which reference the same buffer at different offsets. Thus, our algorithm can uncover defects which go undetected by previous works. We reduce the problem of checkings tring manipulation to that of analyzing integer variables. A prototype of the algorithm has been implemented and applied to statically uncover defects in real C applications, i.e., errors which occur on some inputs to the program. The applications were selected without a priori knowledge of the number of string manipulation errors. A significant number of string manipulation errors were found in every application, further indicating the extensiveness of such errors. We are encouraged by the fact that our algorithm reports very few false alarms, i.e., warnings on errors that never occur at runtime.

Proceedings ArticleDOI
06 Jul 2001
TL;DR: It is shown that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a drawing realizing the string graph in the plane.
Abstract: We show that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a drawing realizing the string graph in the plane. This upper bound confirms a conjecture by Kratochv\'{\i}l and Matou\v{s}ek~\cite{KM91} and settles the long-standing open problem of the decidability of string graph recognition (Sinden~\cite{S66}, Graham~\cite{G76}). Finally we show how to apply the result to solve another old open problem: deciding the existence of Euler diagrams, a central problem of topological inference (Grigni, Papadias, Papadimitriou~\cite{GPP95}).

Patent
28 Sep 2001
TL;DR: In this paper, a system can automatically produce software string generator and parser software components allowing remote access to functions within the application programming interface definition by processes that are not natively compatible with the computing system environment in which the application program operates.
Abstract: A system can analyze an application programming interface definition to automatically produce software string generator and parser software components allowing remote access to functions within the application programming interface definition by processes that are not natively compatible with the computing system environment in which the application programming interface operates. A first string generator processes can produce an encapsulated function call from a first process, such as a Java-based process, that calls a first function in a first computing environment. A second parser process operates in a second computing environment to receive the encapsulated function call and to invoke a second function call in a second process, such as a C-based process. Results from the second function call are returned to a second string generator which produces an encapsulated response that is returned to a first parser process. The first parser process maps the encapsulated response back into first function call parameters for return to the first process, thus providing access to second functions of the application programming interface by the first process.

Journal ArticleDOI
TL;DR: Standard robust control design based on a straightforward Lyapunov argument commonly seen in control design for rigid-body systems is extended to the flexible system and robustly stabilizing controls are found.
Abstract: Suppression of vibration is an important engineering problem. In this note, control problem of a flexible system that includes a stretched string supported on a transporter is defined and solved. Such a system may be encountered in device manufacturing and process automation. Robust and adaptive control is designed to damp out transverse oscillation of the string via compensating for possible uncertainties in string dynamics and transporter motion. Standard robust control design based on a straightforward Lyapunov argument commonly seen in control design for rigid-body systems is extended to the flexible system. Asymptotically/exponentially and robustly stabilizing controls are found.

Patent
19 Nov 2001
TL;DR: A user interface for a text entry device, comprising of a display having a first display section and a second display section, and a keypad including a set of text entry keys each having a given set of characters associated therewith, is described in this paper.
Abstract: A user interface for a text entry device, comprising: a display having a first display section and a second display section, and a keypad including a set of text entry keys each having a set of characters associated therewith. The set of characters associated with each of the text entry keys being displayed in the second display section. A predictive character editor engine with associated directories is adapted to receive a string of input strokes and to output a list of matching word candidates in response thereto. A controller receives inputs from a set of text entry keys, and generates said string of input strokes for the predictive character editor. The controller presents in said first display section at least one of said matching word candidates from the predictive character editor for selection by the user.

Book ChapterDOI
27 Jun 2001
TL;DR: This paper completes the picture by showing that MGs in the sense of [11] and LCFRSs give in fact rise to the same class of derivable string languages.
Abstract: The type of a minimalist grammar (MG) as introduced by Stabler [11,12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism. Michaelis [6] has shown that MGs constitute a subclass of mildly context-sensitive grammars in the sense that for each MG there is a weakly equivalent linear context-free rewriting system (LCFRS). However, it has been left open in [6], whether the respective classes of string languages derivable by MGs and LCFRSs coincide. This paper completes the picture by showing that MGs in the sense of [11] and LCFRSs give in fact rise to the same class of derivable string languages.

Patent
19 Mar 2001
TL;DR: In this paper, the search criteria are represented as strings of beads in a three-dimensional scene, each bead representing a criterion and each string representing a different category, for example, drama, action, suspense, and horror may be included in a category of genre.
Abstract: A user interface for querying and displaying records from a database employs a physical metaphor for the process of constructing queries and viewing results. The criteria are represented in displays as symbols that can be included in a query. The display of the symbols are ranked in terms of their respective utility, where the utility is inferred from the commands received to generate the queries. In one embodiment, the ranking is based on frequency of use. The ranking may be indicated by various display effects. For example, in an embodiment, the search criteria are indicated as strings of beads in a three-dimensional scene, each bead representing a criterion and each string representing a different category. For example the criteria, drama, action, suspense, and horror may be included in a category of genre. Criteria are selected to form a query by moving corresponding beads to a query string which is then submitted to perform the search. Those beads that correspond to highly ranked criteria are shown in the foreground of the scene and those that correspond to lesser ranked criteria are shown in the background. The beads can be rotated from background to foreground with suitable commands.

Patent
02 Jun 2001
TL;DR: A spelling correction system and method for phrasal strings using a dictionary looping technique is described in this article, where the string is segmented into a plurality of different segmentations and compared to dictionary entries.
Abstract: A spelling correction system and method for phrasal strings using a dictionary looping technique. The method of the present invention includes spelling correction of an input phrasal string by segmenting the string into a plurality of different segmentations, comparing each segmentation to dictionary entries using the dictionary looping technique, assigning a cost to each segmentation, and determining an output string by finding the segmentation having the lowest cost. The dictionary looping technique determines compares each segmentation to dictionary entries by performing a looping search through a phrasal dictionary data structure in a looping manner whereby a number of different searches are performed. Dictionary looping allows the dictionary to be compact because the dictionary need not include all potential combinations of all possible phrases that could be encountered. The present invention also includes a phrasal spelling correction system and a dynamic dictionary that uses the above-described method.

Patent
21 Mar 2001
TL;DR: In this paper, the search criteria are displayed as strings of beads in a 3D scene, each bead representing a criterion and each string representing a different category, such as drama, action, suspense, and horror.
Abstract: A user interface for querying and displaying records from a database employs a physical metaphor for the process of constructing queries and viewing results. In one embodiment, the search criteria are displayed as strings of beads in a three-dimensional scene, each bead representing a criterion and each string representing a different category. For example the criteria, drama, action, suspense, and horror may be included in a category of genre. Criteria are selected to form a query by moving corresponding beads to a query string. In general, a three-dimensional scene is constructed in which objects may be manipulated to change their physical relationships to other objects in the scene. These changes may indicate changes in a current query being defined or edited, a current profile being defined or edited, a goodness of fit of results to a given search, etc. The three-dimensional nature of the scene is asymmetric to take advantage of the multiple dimensions for purposes of differentiating objects in the scene such that varying positions along one dimension indicate variation with respect to a characteristic corresponding to that dimension.