Method and system for document collection final search result by arithmetical operations between search results sorted by multiple ranking metrics

[0002] The present invention relates to a method and a system for searching information corresponding to a large amount of documents, particularly to a method and a system for acquiring a final search result by arithmetical operations between search results sorted by different ranking metrics.

[0003] As in the case of an Internet search, it is not unusual that search results amount to tens of thousands when information is searched with a keyword from a large amount of documents. To find a document of the user's interest from such enormous amounts of search results, the following means for a search are known:

[0004] changing search conditions by seeing several highly-ranked ones of the search result provided by a search engine and;

[0005] sorting them according to a menu provided by a search engine.

[0006] The former method includes a method wherein, besides changing a search condition by the user, specifying a condition such as “essential” or “not to be included” for each keyword displayed by a search engine, or providing a sample document to a search engine to get highly ranked documents results where the contents are similar to the sample document. While such methods are known as relevance feedback, it was not possible for them to cope with designation of relevance from multiple viewpoints such as current as possible and also deeply related to the computer field. The latter menu method includes a search by document type, a search by Web site, etc. However, while this method is also convenient as classification according to document types, it is not effective for a search of Web pages in large quantities.

[0007] In addition, there is Reference 1 (Japanese Unexamined Patent Publication No. Hei 10-143530) as a method for combining multiple searching methods by using multiple searching schemes. This Reference 1 is an approach which is close to a method of combining multiple search engines so as to obtain a more relevant search result. However, in the case of a method as in Reference 1, the search result is often in very large quantities due to multiple searching methods. Even if the larger number of correct answers can be acquired by combining search results, it cannot be expected that all of the highly-ranked search results are arranged in the most relevant ordering to a user's demand. A user must sequentially scan in order to find truly necessary data from such enormous search results. In the case of combining search results, the process will be under huge load since it is necessary to always seek search results of the entire database and logically combine them.

[0008] Moreover, the conventional searching technologies do not provide the means for meeting the following demands which are quite natural:

[0009] sorting the first several tens or hundreds of elements of the subject; and data set in a specific ordering or in various orderings; and

[0010] arranging further in order of decreasing relevance, since the amount is too large to check all the elements even after possible narrowing.

[0011] An object of the present invention is to provide a searching method, computer program product, and system for sorting a specific collection of documents in various orderings.

[0012] Another object is to provide a searching method, computer program product, and system for defining a new ranking metric by composing multiple ranking metrics to provide a user with highly relevant search results.

[0013] A further object is to provide a searching method, computer program product, and system for additionally specifying the most suitable arrangement by interactively combining ranking metrics.

[0014] A still further object is to provide a searching method, computer program product, and system for presenting a specific search result by sorting them in various orderings.

[0015] A still further object is to provide a searching method, computer program product, and system wherein, the larger the number of collected data is, the larger the likelihood of finding important data by sorting grows.

[0016] A still further object is to provide a searching method and a system of high practicality and scalability which only requires sorting of the search results acquired by the first search.

[0017] To attain the above objects, multiple rankings (weightings) are used when information is searched from a large amount of data (documents). Thus, in the case that relevant data does not gather in higher-ranking positions in a single ranking/ordering, relevant data originally in low ranks can be more easily discovered by ranking metrics from different viewpoints. Moreover, the sum, difference, intersection, etc. of the ones ranked high in more than one rankings are acquired. Thus, a means for collecting important data in higher-ranking positions is provided.

[0018] And more specifically, in searching documents related to prescribed information from a collection of documents, it is organized to sort the collection of documents with multiple ranking metrics; determine a new collection of documents in higher-ranking positions of the sorted collections of documents; perform arithmetical operation between the new collections of documents in higher-ranking positions; and determine documents in higher-ranking positions of a result of the arithmetical operation as a search result. To “rank” and to “sort” (by ranking metrics, relevance or weight) are used herein as the same meaning.

[0019] By way of example, “multiple ranking metrics” includes, but is not limited to: date and time of document publication; document size; frequency of document update; number of links included in a document; extent of inclusion of terminology related to prescribed information; number of keywords related to prescribed information; etc.

[0020] By way of example, “arithmetical operation” includes, but is not limited to: the sum of the collections of documents; the intersection of the collections of documents; or the difference between higher-ranking positions of the sorted collections of documents.

[0021] Namely, the final search results are acquired by performing arithmetical operation among specific (with fixed search results) collections of documents sorted in various orderings and not by narrowing the search results to gradually reduce the candidates. It also makes it possible to additionally specify the most suitable arrangement of search results by interactively composing such ranking metrics.

[0022] Thus, it becomes possible, by utilizing multiple ranking metrics, to rank a search result of a large amount of data so that highly relevant data from a viewpoint prescribed by a user gathers in higher-ranking positions. In the present invention, as ranking metrics for arranging data other than ranking metrics (order of relevance to a query) provided as standard, various orderings provide ranking metrics as above, such as an ordering of the date of document publication, an ordering of size of each data, decreasing order of frequency of document update, decreasing order of number of links included in a document, decreasing order of frequency of inclusion or decreasing order of number of terminology included in a specific field, or decreasing order of number of specified keywords.

[0023] The present invention is not only applicable to all the Internet search engines but also available for display of database records in a flexibly ordered manner, so it provides a very effective searching technique as a front end for information searching in general. While it is difficult, by ranking metrics through a mere search with keywords and a degree of their matching, to completely eliminate unnecessary documents adequately containing keywords (SPAM), it becomes easier to find really desirable documents by using the method of the present invention. Moreover, the present invention is capable of not only providing a powerful means for enhancing and differentiating a search engine but also becoming a promising tool for dramatically improving information searching capability of a search engine accumulating data in large quantities.

[0024] A more particular description of the invention briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. These drawings depict only one or more typical embodiments of the invention and are not therefore to be considered to be limiting of its scope.

[0025] FIG. 1 is a diagram for showing an overview of the searching method of the present invention.

[0026] FIG. 2 is a diagram for showing an example of ranking composition of the present invention.

[0027] FIG. 3 is a block diagram of the searching system of the present invention.

[0028] FIG. 4 is a flowchart of the searching method of the present invention.

[0029] FIG. 5 is an example of a search result by the present invention.

[0030] FIG. 6 is a diagram for showing an embodiment of hardware configuration of the system used in the searching system of the present invention.

[0031] FIG. 1 shows an outline of the searching method of the present invention. Other than collections of documents searched in decreasing order of relevance by ranking metrics provided as a standard, namely a query of “experiment and success,” for instance, collections of documents of successful examples of recent medical experiment are acquired as final search result by composing ranking of collections of documents in higher-ranking positions in multiple ranking metrics data (in this case, orderings of date and the number of medical terms). As it is not limited to these, ranking metrics in various fields are possible likewise.

[0032] In addition, there are two kinds in all ranking metrics, namely descending/ascending order, and besides, in the case of date or size, it is possible to specify order of being close to/far from a specific value such as 1995 or 1 MB. Likewise, all ranking metrics can be modified to specify not a specific value but an arbitrary value so that it becomes the top and other elements are in a line in decreasing order of closeness to the top element.

[0033] As a kind of arithmetical operation (composition of ranking metrics), it is possible to compose the following ranking metrics (where plural ranking metrics are referred to as A, B):

[0034] * The sum of A and B (A+B): Ranking metrics wherein elements which are in higher-ranking positions of A or in higher-ranking positions of B will be in higher-ranking positions.

[0035] * The intersection of A and B (A*B): Ranking metrics wherein elements which are in higher-ranking positions of A and besides, in higher-ranking positions of B will be in higher-ranking positions.

[0036] * The difference of A and B (A−B/B−A): Ranking metrics wherein elements which are in higher-ranking positions of A but not in higher-ranking positions of B will be in higher-ranking positions, or vice versa.

[0037] Moreover, as for a vector space model which is predominant as a means for characterizing a collection of documents, it is possible to generate various ranking metrics to it.

[0038] FIG. 2 shows an example of composition of ranking. Examples of the sum, intersection and difference are shown to collections of documents sorted by ranking metrics A and B. A line is drawn to the result of composition by a threshold, and highly ranked ones become the final search result. These calculations can be freely selected by a user.

[0039] FIG. 3 shows a block diagram of the searching system of the present invention. The searching system of the present invention comprises offline data extraction part 302 which extracts meta data for ranking metrics from a data set and provides an evaluable set of ranking metrics on searching, and interactive data manipulation part 308 for sorting in various ways the result of information searching by a user.

[0040] Block 301 is a set of data which is a subject of a database/document (including catalog information) data search. It is assumed that externally defined information of data itself such as frequency of update and the last update date is managed in advance as catalog information of individual data. Block 302 is an offline data extraction part for, in collecting source data, extracting an index necessary for searching and information necessary for ranking metrics.

[0041] Offline data extraction part 302 comprises text processing block 303 and meta data management 304. Block 303 is a text processing part which utilizes a dictionary/thesaurus for recognizing a word in text and giving its attribute and processing a tag, etc. Block 304 is document meta data which stores information (update date, byte number of text, link number, etc.) necessary for ranking metrics.

[0042] Block 305 is a dictionary/thesaurus which is a resource describing a word and its attribute, synonyms, superordinate/subordinate terms, related words, etc. Block 306 is an index which is a resource for acquiring from a word or a string pointers to data or documents containing it. Block 307 is ranking metrics data which is a resource describing an attribute necessary for arranging each data or document in specific order and a weight to be given to such an attribute.

[0043] Block 308 is an interactive data manipulation part for providing an interactive interface which provides a means for searching data and documents according to an instruction by a user to narrow them down to highly relevant ones. Block 309 is a means for inputting a searching request which accepts, through a menu or a query, an instruction by a user as to a subject of searching. Block 310 is a means for processing a searching request which seeks data and a collection of documents meeting a searching request by utilizing an index, etc.

[0044] Block 311 is a ranking/ordering selection part which accepts selection by a user as to an ordering of arranging elements of a search result. Block 312 is an element selection part which seeks, from search result arranged by certain ranking metrics, different ranking metrics wherein a specific element is in the top rank according to selection by a user. Block 313 is a ranking composition part which prepares, from plural ranking metrics specified by a user, new ranking metrics with their sum or intersection.

[0045] Block 314 is a search result which is data or a collection of documents meeting a searching request by a user. Block 315 is composed ranking metrics data which, by composing a ranking, becomes a resource for storing information of temporary ranking metrics applied to current search result. Block 316 is a means for displaying a searching request which sequentially displays elements of search result under the search result and given ranking metrics (which may be plural), and simultaneously presenting display of plural results if plural ranking metrics are specified.

[0046] Moreover, information other than catalog information of individual data is analyzed by text processing part 303 as to its text to be managed as specific attribute/attribute value of meta data management part 304 according to recognition of elements such as word segmentation, links (anchors in the case of a Web page) and extraction respectively. Ranking metrics such as order of date or size correspond to mapping from this attribute value to a natural number and sorting them in ascending/descending order.

[0047] As to ranking metrics based on occurrence frequency of words, it is difficult, by a method of recording occurrence frequency of each individual word as a pair of {word/occurrence frequency} all in meta data management part 304, to sort over a few million documents or records in real time or acquire K pieces of elements in higher-ranking positions. Such data is usually managed as an index of a search engine for a keyword search, and thus it is not realistic in terms of storage and processing time to generate from a specific document an inverted index of the words contained therein and their occurrence frequency.

[0048] Preferably, a vector space model should be utilized to calculate a page of high conformance to searching conditions on the basis of an arrangement represented by a frequency vector of the terms contained in each Web page. In such an arrangement, huge matrix V, which is number of terms N x number of documents M, is approximated by compressing it to principal components of several tens to several hundreds using a technique of singular value decomposition.

[0049] In the case of the present invention, this matrix V is utilized to allow creation of the following ranking metrics for specific domains/terminology. Creation of such ranking metrics is all offline work, so it does not affect efficiency while searching:

[0050] (1) When a set of terms occurring in a specific field (or a user's file) is given, rows of the above matrix V are shrunk only to those corresponding to these terms, and the above technique of singular value decomposition is applied. Thus, a feature vector of each document on the field can be calculated. A degree of relevance of each document in each individual search result is determined by a distance between a term vector (compressed to a principal component) used for a search and a feature vector of each document. Or, it is also possible to acquire from an original feature vector the centroid of a collection of documents on the field so that a distance from the centroid of each document is calculated in advance. In this case, while ranking metrics of documents are fixed regardless of searching conditions, calculation of sorting becomes faster.

[0051] (2) When a specific collection of documents is given, the rows of matrix V are shrunk to those corresponding to these documents to be processed likewise. Thus, it becomes possible to have ranking metrics such as a degree of relevance from a viewpoint of introducing new computer products and a degree of relevance from a viewpoint of a news document.

[0052] (3) Both are combined to rank highly relevant ones as to specific terms in a specific collection of documents. It is also possible to adopt hierarchical/nonhierarchical clustering instead of ranking metrics. In this case, the collection of documents are classified into clusters on the basis of feature vectors of the documents and then presented to a user. A function for defining ranking metrics is replaced by a function for giving a degree of relevance (a degree of similarity) in clustering. For instance, a distance between two feature vectors (cosine) may be calculated as a degree of similarity.

[0053] Interactive data manipulation part 308 comprises ordering selection part 311 for displaying search result of a query in order of selection, ranking composition part 313 for composing/displaying new ranking metrics from plural ranking metrics as specified by a user, and element selection part 312 for collecting in higher-ranking positions desirable data centering around a selected element. In ordering selection part 311, it is possible to specify other ranking metrics displayed in parallel with order of a search result returned by a search engine. It is possible to select by a user's specification or implementation whether to display search result by plural ranking metrics at a time or to always display it by finally selected ranking metrics.

[0054] If real time processing is considered, a higher speed can be implemented, for instance, by providing limitation wherein ranking metrics are only applied to the K highest positions of the first search result. Next, while it is possible to implement ranking composition part 313 for composing two orderings Fa and Fb in various forms, it can be simply implemented as follows, for instance.

[0055] The following linear equation defines a new ordering function, on the assumption that each ordering gives each data d integers Fa(d), Fb(d) where, the higher the ranking of an element is, the larger they are (provided that A, B and C possibly with subscripts are constants):

[0056] 1) Sum of Fa and Fb (Fa+Fb): A1*Fa(d)+B1*Fb(d)

[0057] 2) Intersection of Fa and Fb (Fa*Fb):

[0058] A2*(Fa(d)−C)+B2*(Fb(d)−D)

[0059] 3) Difference of Fa and Fb (Fa−Fb/Fb−Fa):

[0060] A3*Fa(d)−B3*Fb(d), and B4*Fb(d)−A4*Fa(d)

[0061] While A1-4 and B1-4 are coefficients for adjusting the values given to elements in higher-ranking positions in order Fa, Fb respectively to be almost the same, C and D are set as the values which the L-th elements of the search result with respect to Fa, Fb will take on respectively. Thus, composition of ordering can be defined at high speed and to an arbitrary number of ranking metrics.

[0062] To reverse the ordering, the signs (+,−) of Fa(d), Fb(d) must simply be reversed, and the following new ordering function can be defined so that a specified element e can be in the highest rank:

[0063] Fc(d)=Fa(e)−Fa(d) if Fa(d)>=Fa(e), otherwise

[0064] Fc(d)−Fa(d)−Fa(e) if Fa(d)<Fa(e)

[0065] Element selection part 312 can arrange data of order value close to the data selected by using the above new ordering functions. In the case that a search engine implements relevance feedback, search result by new ranking metrics can be displayed based on this data and the original query. By the ranking method of the present invention, when a search engine first arranges its search result and highly relevant data does not necessarily exist in higher-ranking positions, highly relevant data can efficiently be found if a user specifies an ordering from another viewpoint instead of searching a large amount of data himself or herself. In addition, if relevance feedback is utilized, it is possible to quickly reach searching conditions for collecting important data in higher-ranking positions, by adding the highly relevant data to the searching conditions.

[0066] FIG. 4 shows a flowchart of the method for searching of the present invention. First, in step 401, in means for processing a searching request 310, a query is acquired through means for inputting a searching request 309. This is referred to as query Q. Next, in step 402, query Q is evaluated based on index 306 so as to generate search result 314 which is a collection of documents to be a solution. This is referred to as solution S.

[0067] In step 403, a degree of relevance between each element included in search result 314 (referred to as document d_i) and query Q is calculated by a standard method for calculating a degree of relevance R_odefined in the system. A method for calculating a degree of relevance is a method for calculating weight of a document by using one of the data of ranking metrics data 307 (represented as a vector or a matrix with weight per word/attribute specified). One of the data 307 is assigned to standard calculation of a degree of relevance.

[0068] Next, since step 403 associates each element d_iof search result 314 with a degree of relevance (weight), in step 404, the elements are sorted in order of this weight. At this time, a certain threshold can be associated with ranking metrics so that any element with weight of the threshold or less can be eliminated as having no relation to query Q. To limit the size of solutions in step 402, these steps 402 to 404 can be applied by one operation.

[0069] Search result S wherein a degree of relevance of each element was calculated is visualized by means for displaying a searching request 316.

[0070] In step 405, it is confirmed to a user if a satisfactory list of elements (documents) was acquired by the method for calculating a degree of relevance used so far. If such a satisfactory list has not been acquired yet, it proceeds to step 406 in order to newly perform another calculation of a degree of relevance from ranking metrics data 307. If a current list of elements is satisfactory, it proceeds to step 409.

[0071] In step 406, a table of ranking metrics data 307 provided by the system is displayed to a user for selection. Other than ranking metrics data, the user can select one element d which appears in a search result so far and provide instructions of a change to rank it No.1.

[0072] In step 407, when ranking metrics data is newly selected in step 406, it is R_j, and a degree of relevance is calculated under R_iby ordering selection 311 as to each element d_iof search result S in the same procedure as in steps 403 to 404. If a certain element d is selected, ranking metrics are changed by element selection 312 so as to render weight of this element maximum (there are plural methods for changing weight, such as changing weight of a word or an attribute of ranking metrics data, and adjusting constants in calculation of a degree of relevance so as to render a degree of relevance of d maximum), and a degree of relevance of each element d_iis recalculated.

[0073] In step 408, according to the degree of relevance of d_irecalculated in steps 407, newly ranked elements are displayed. Again, user confirmation is sought at step 405. The process of steps 406 to 408 continues until user confirmation is received sending processing to step 409.

[0074] Next, in step 409, if lists of elements ranked from viewpoints of plural degrees of relevance respectively are all satisfactory, their ranking metrics are composed, and it proceeds to step 410 and displays an ranking composition menu so as to have a selection made whether to newly sort the elements with one ranking metrics. If a current list of elements is satisfactory, or if the current search is to be ended, it is terminated.

[0075] In step 410, two ranking metrics R_jand R_kof ranking metrics data 307 used so far and a composition method such as the sum and difference are selected in a ranking composition menu.

[0076] Then, in step 411, a new degree of relevance of each element d_iof search result S is calculated in ranking composition 313 based on the ranking metrics and composition method selected in step 410. Ranking metrics data M composed at this time is held effective as composed ranking metrics data 315 through a searching session.

[0077] Lastly, in step 412, a degree of relevance specified in step 411 is calculated, and each element d_iof search result S is displayed in means for displaying a searching request 316.

[0078] FIG. 5 shows an example of search result by the searching system of the present invention. The example in FIG. 5 is an example of a search in the case of ranking metrics composition (corresponding to step 412 in FIG. 4) where there are a result of searching a table of information field news by a “computer” (corresponding to step 404 in FIG. 4) and a result in the decreasing order of a degree of relevance calculated with more weight on “software” field (corresponding to step 408 in FIG. 4), and the sum (+) was selected for these as a type of calculation. Thus, a search result which has computer related news especially highly relevant to the software field in higher-ranking positions can be acquired.

[0079] FIG. 6 shows an embodiment of hardware configuration of a system used in the present invention. System 100 comprises a central processing unit (CPU) 1 and memory 4. CPU 1 and memory 4 are connected via bus 2 with hard disk drive 13 (or a storage medium drive such as CD-ROM 26 and DVD 32) as auxiliary storage by way of IDE controller 25. Likewise, CPU 1 and memory 4 are connected via bus 2 with hard disk drive 30 (or a storage medium drive such as MO 28, CD-ROM 29 and DVD 31) as auxiliary storage by way of SCSI controller 27. Preferably, document data 301, dictionary thesaurus 305, index 306, ranking metrics data 307 and document meta data 304 are stored in an auxiliary storage.

[0080] Floppy disk drive 20 is connected with bus 2 via floppy disk controller 19. A floppy disk is inserted into floppy disk drive 20, and a code or data of a computer program for giving instructions to a CPU and so on in synergy with an operating system to implement the present invention can be recorded on this floppy disk, hard disk drive 13 (or a storage media such as MO, CD-ROM and DVD) and ROM 14, which is executed by being loaded to memory 4. This code of a computer program can also be compressed or divided into two or more so as to be recorded on two or more media. While, search result 314 is normally stored in an auxiliary storage, it can be stored and calculated only in memory 4 if memory 4 is large enough.

[0081] System 100 can further have user interface hardware and comprise pointing device (a mouse, a joystick, etc.) 7 or keyboard 6 for entry and display 12 for presenting a user with visual data such as a search result. It is also possible to connect it with a printer via parallel port 16 or connect it with a modem via serial port 15.

[0082] This system 100 can be connected with a network via serial port 15 and a modem or communication adapter 18 (Ethernet or Tokenring card) etc. so as to communicate with other computers and so on. For instance, document data 301, etc. may be downloaded from Internet, or document data 301, ranking metrics data 307, etc. may be referred to from a server, etc. distributed by a local area network. Furthermore, it is possible to connect a remote transmitter-receiver with serial port 15 or parallel port 16 so as to exchange data by means of an infrared ray or an electric wave.

[0083] Speaker 23 receives a speech signal which is D/A (digital/analog) converted by audio controller 21 via amplifier 22 and outputs it as speech. In addition, audio controller 21 makes it possible to A/D (analog/digital) convert speech information received from microphone 24 and capture into the system speech information outside the system. It is also possible to use an application such as ViaVoice (a trademark of IBM) so that a searching command is issued by voice to select ranking metrics, select calculation and perform a search.

[0084] Thus, it may be easily understood that a searching system in the present invention is implementable by a communication terminal with a communication facility including an ordinary personal computer (PC) or a workstation, a notebook PC, a palmtop PC, a network computer, various household electrical appliances with a built-in computer such as a TV set, a game console with a communication facility, a telephone, a fax, a portable telephone, a PHS, an electronic organizer or combination of these. However, these components are taken as examples, and it does not follow that all of them are required components of the present invention.

[0085] As will be understood by one of ordinary skill in the art, computer programs or code such as that described herein are typically distributed as part of a computer program product that has a computer useable media or medium containing the program code. Therefore, “media”, “medium”, “computer useable medium”, or “computer useable media” , as used herein, may include a diskette, a tape, a compact disc, an integrated circuit, a programmable logic array (PLA), a remote transmission over a communications circuit, a remote transmission over a wireless network such as a cellular network, or any other medium useable by computers with or without proper adapter interfaces. Note that examples of a computer useable medium include but are not limited to palpable physical media, such as a CD Rom, diskette, hard drive and the like, as well as other non-palpable physical media, such as a carrier signal, whether over wires or wireless, when the program is distributed electronically. Note also that “servlets” or “applets” according to JAVA technology available from Sun Microsystems out of Mountain View, Calif., would be considered computer program products.

[0086] Although the enabling instructions might be “written on” on a diskette or tape, “stored in” an integrated circuit or PLA, “carried over” a communications circuit or wireless network, it will be appreciated, that for purposes of the present invention described herein, the computer useable medium will be referred to as “bearing” the instructions, or the instructions (or software) will be referred to as being “on” the medium. Thus, software or instructions “embodied on” a medium is intended to encompass the above and all equivalent ways in which the instructions or software can be associated with a computer useable medium.

[0087] For simplicity, the term “computer program product” is used to refer to a computer useable medium, as defined above, which bears or has embodied thereon any form of software or instructions to enable a computer system (or multiple cooperating systems) to operate according to the above-identified invention.

[0088] It will be likewise appreciated that the computer hardware upon which the invention is effected contains one or more processors, operating together, substantially independently, or distributed over a network, and further includes memory for storing the instructions and calculations necessary to perform the invention.

[0089] Those skilled in the art will recognize that a system according to the present invention may be created in a variety of different ways known in the art. For example, the hardware configuration shown in FIG. 6 may be configured with appropriate software so that the computing device functions as described hereafter. Furthermore, discrete electronic components may be used to create a system that implements all or part of the functional. Finally, note that combinations of multiple computing devices running appropriate software or discrete electrical components can be used in like fashion. Essentially, the hardware is configured (whether by software, custom designed, etc.) to perform the functional elements making up the present invention.

[0090] While the preferred embodiment of the present invention has been described in detail, it will be understood that modification and adaptations to the embodiment(s) shown may occur to one of skill in the art without departing from the scope of the present invention as set forth in the following claims. Thus, the scope of this invention is to be construed according to the appended claims and not just to the specifics disclosed in the exemplary embodiment or embodiments.

[0091] References in the claims to an element in the singular is not intended to mean “one and only” unless explicitly so stated, but rather “one or more.” All structural and function equivalents to the elements of the above-described exemplary embodiment that are currently known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the present claims. No element, component, or method step in the present disclosure is intended to be dedicated to the public regardless of whether the element, component, or method step is explicitly recited in the claims. No claim element herein is to be construed under the provisions of 35 U.S.C. § 112, sixth paragraph, unless the element is expressly recited using the phrase “means for” or “step for.”