Abstract: A remote server receives traffic data from a plurality of probe vehicles traveling on roadways. The remote server stores the received traffic data in a regular lane database and/or a carpool lane database. The remote server differentiates the received traffic data for storage in the appropriate database based on the number of probe vehicles associated with each speed pattern observed within the received traffic data.

Abstract: A data processing system and method for automated retrieval and/or processing of information from a plurality of available data sources in a computer network, whereby the information is input or will be input in objects structured in modules, at least one property related to the information is assigned or will be assigned to the information in the modules of the object (property assignment), a comparison is performed of at least two objects (object comparison) by comparing at least one of the modules of a first object of at least two objects with at least one module of at least one other object of at least two objects, and the result of the comparison of the objects is presented as information.

Abstract: Web sites are grouped by generating feature space representations of documents, and aggregating the feature space representations into web site vectors. A document vector may be generated for each document of a plurality of documents associated with a set of web sites according to a query-based feature space model. The query-based feature space model defines features of the documents. Each document vector includes weights determined for features associated with the corresponding document. A web site vector is generated for each of the web sites using the plurality of document vectors. The web sites are grouped according to the web site vectors.

Abstract: Techniques for extending horizontal partitioning to column partitioning are provided. A database table is partitioned into custom groups of rows and custom groups of columns. Each partitioned column is managed as a series of containers representing all values appearing under the partitioned column. A logical row represents a row of the table logically indicating each column value of a row. Compression, deletion, and insertion within the containers are managed via a control header maintained with each container.

Abstract: The invention provides for techniques to process and produce email documents. The techniques provide for organizing a first plurality of email documents into a plurality of document groups, reviewing a document group from the plurality of document groups, and associating a review content with the document group. The techniques provide for ways to propagate the review content to one or more email documents associated with the document group and producing a second plurality of email documents. The techniques provide for annotating one or more email documents in accordance with the review content. Depending on the embodiment, review content may include text, graphics, audio, tag, and multimedia information. Produced documents can be searched and browsed in accordance with information in the review content. Email documents can be grouped by information in meta information and/or header information associated with the email documents into various groups, including threads or conversations, for example.

Abstract: Described embodiments process hash operation requests of a network processor. A hash processor determines a job identifier, a corresponding hash table, and a setting of a traversal indicator for a received hash operation request that includes a desired key. The hash processor concurrently generates a read request for a first bucket of the hash table, and provides the job identifier, the key and the traversal indicator to a read return processor. The read return processor stores the key and traversal indicator in a job memory and stores, in a return memory, entries of the first bucket of the hash table. If a stored entry matches the desired key, the read return processor determines, based on the traversal indicator, whether to read a next bucket of the hash table and provides the job identifier, the matching key, and the address of the bucket containing the matching key to the hash processor.

Abstract: Methods, devices, and systems for analyzing negotiated negotiable instruments for unlawful activity are described. A computer system, including a computer readable storage device and a processor may be provided. A plurality of electronic files may be received. Each of these electronic files of the plurality of electronic files may include an electronic image of at least a portion of a negotiable instrument and include a plurality of data fields. The plurality of electronic files may be divided into subsets based on whether data is available in particular data fields of the electronic files. Based upon the subset an electronic file is made a member of, various selection criteria may be applied to determine if the electronic file is a candidate for suspicious and/or illegal activity. Also, a listing of candidates for suspicious and/or illegal activity may be presented to a user.

Abstract: Described herein are methods and systems implementing a web page classification system for automatically generating at least one context feature for a web page and classifying the web page based on the at least one context feature. In one implementation, a context feature generating module of the web page classification system is configured to automatically generate at least one context feature based on at least two of uniform resource locator (URL) features, title features, and meta tags features of a web page and a classifying module is configured to classify the web page based on the at least one context feature.

Abstract: A dynamical hierarchical tagging system connected to a user site through a remote communications network. The system may comprise a master controller, a job management server connected to the master controller, one or more scanners in communication with the job management server, wherein the one or more scanners are configured to scan for one or more user assets located at the user site, resulting in scan results, a scan logic processor connected to the master controller, wherein the scan logic processor is configured to store the scan results in a user database, a tagging logic engine connected to the master controller, wherein the tagging logic engine is configured to tag the scan results stored in the user database, and an indexing logic processor connected to the master controller, wherein the indexing logic processor is configured to search and index the tagged scan results stored in the user database.

Abstract: A system and method classifies advertising based on referencable attributes. An individual advertisement is classified by predefined referencable attributes. The advertisement and the predefined referencable attributes are linked using alphanumeric or digital codes. The advertisement and the linked codes are stored such that the advertisement and linked codes are accessible by a user.

Abstract: System and method to partition littoral regions by profiles of specific parameters using fuzzy c-mean clustering. Fuzzy cluster partitions assign each datum to a set of data clusters such that the sum cluster membership probability of the point is equal to unity. Partial memberships can supply information about transition areas from one cluster to another.

Abstract: An approach is provided for determining and utilizing geographical locations contextually relevant to a user. A contextually relevant location platform determines location-based data associated with a user and/or user device. The contextually relevant location platform determines stationary points based, at least in part, on the location-based data. The contextually relevant location platform determines context data associated with the stationary points. The contextually relevant location platform determines at least one location anchor based, at least in part, on the stationary points and the associated context data, wherein the at least one location anchor represents a bounded geographical area of contextual relevance to the user.

Abstract: A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.

Abstract: Certain embodiments relate to systems and methods for performing data discrimination using dimensionality reduction techniques. Particularly the Sparse Matrix Transform (SMT) is applied to more efficiently determine the Fischer Discrimination vector for a given dataset. Adjustments to the SMT facilitate more robust identification of the Fischer Discrimination vector in view of various resource constraints.

Abstract: Technologies are generally described for a peer to peer search routing algorithm and system. In one example, a node in a peer to peer network includes a processor. In some examples, the processor may be configured to receive information regarding a topology of the peer to peer network and generate a first search routing algorithm for the peer to peer network based on the topology. In some examples, the processor may be configured to generate a second search routing algorithm for the peer to peer network based on a search characteristic and the topology. In some examples, the second search routing algorithm is distinct from the first search routing algorithm. In some examples, the processor may be configured to receive a request to search the peer to peer network. In some examples, the processor may be configured to search the peer to peer network using the second search routing algorithm.

Abstract: The present subject matter provides systems, methods, software, and data structures for patent mapping, storage, and searching. Some such embodiments include mapping patent documents, claims, and claim limitations. Some further embodiments provide for searching a universe of patent documents by patent document, claim, limitation, class, element, or concept.

Abstract: Apparatus, systems, and methods may operate to retrieve multiple rows of a database in response to receiving a request to execute an aggregate user defined function (UDF) over the multiple rows, to sort each of the multiple rows into common groups, grouping together individual ones of the multiple rows that share one of the common groups, and to send UDF execution requests to apply the aggregate UDF to aggregate buffers of the common groups to produce an aggregate result, so that one of the UDF execution requests and one context switch are used to process each of the aggregate buffers used within one of the groups to provide at least one intermediate result that can be processed to form the aggregate result. Other apparatus, systems, and methods are disclosed.

Abstract: Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

Abstract: The text mining device 300 includes a clustering section 301. The clustering section 301 performs clustering on a plurality of characteristic expressions extracted from a document set such that characteristic expressions, in which sentences to be referred to as original sentences are the same, are compiled in one cluster, based on the similarity in original document sets which are sets of documents including the respective characteristic expressions, the documents being of the document set. Consequently, the probability of repeatedly viewing the same original document by a user can be reduced reliably.

Abstract: Objects, such as documents, are classified according to a taxonomy. The taxonomy includes nodes, corresponding to object classes, arranged in a hierarchy. Class keywords are associated with the nodes. Search strings are formed for the classes by traversing the taxonomic branches and concatenating the keywords associated with the classes. For each object to be classified, a search engine is used to perform searches on the object using the search strings. The searches produce search scores for each search string. Each object is classified by identifying the class(es) corresponding to the highest search score(s) for the object, and classifying the object into the identified class(es).

Abstract: Systems and a method are described. The method includes identifying and presenting a plurality of data items comprised of receiving a selection that identifies a parent category; identifying a first plurality of categories based on the parent category, the first plurality of categories including a first category, the plurality of data items not being user-classifiable under the first plurality of categories; identifying the plurality of data items based on a link from the first category to a second category, the second category being included in a second plurality of categories that are respectively associated with the first plurality of categories, the plurality of data items being user-classified under the second category; and communicating, over a network, a user interface response to the receiving the selection, the user interface including the plurality of data items.

Abstract: An automated contact import module enables users to select groups of contacts to import from an email, contact management, scheduling (ECS) application based on viewing contacts by category, organization, email domain, and similar attributes. Contacts in selected groups are imported to a CRM application with automatic data mapping. Communication history may be part of the import process by searching previously indexed emails, appointments, and comparable data associated with the selected contacts effectively creating a data hierarchy at the CRM application.

Abstract: A computer-implemented method for determining a connection ranking value between entities includes receiving private information from a user, and retrieving public information from publicly available sources. The method also includes matching the public information with the private information, generating a graph database with the public and private information, establishing at least one search criteria, and generating a connection ranking value between entities in the graph database based on the search criteria.

Abstract: A computer-implemented method for determining connections between entities includes receiving private information from a user, retrieving public information from publicly available sources, and matching the public information with the private information. The method also includes generating a graph database with the public and private information, determining connections between entities in the graph database, and determining strength of connectivity between entities in the graph database.

Abstract: One embodiment of the invention sets forth a mechanism for recommending digital items to a user. Each digital item in a set of digital items is scored based on user preferences and other metrics. The digital items are ordered based on scores. The digital items are then evaluated in order of respective rank to determine a subset of digital items that re recommended to the user. The evaluation process is based on different evaluation criteria as well as the presentation style of the recommended digital items.

Abstract: Systems and methods for reconciling a forecast for a dimension based upon data that is associated with the dimension. A method can be used that includes generating a plurality of forecasts for the dimensions such that the forecast of a first dimension is generated independently of a forecast of a second dimension. The forecast of the first dimension has a constraint that is influenced by the forecast of the second dimension. A reconciliation is performed between the forecast of the first dimension and the forecast of the second dimension in order to determine how the constraint of the first dimension's forecast is to influence the first dimension's forecast.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to expert modeling in a KM system and provide method, system and computer program product for organically ranked knowledge and categorization for a KM system. In one embodiment of the invention, a method for organically ranked knowledge and categorization in a KM system can be provided. The method can include bookmarking answer content for a first end user of the knowledge management system, suggesting a set of categories previously associated with the answer content by other end users of the knowledge management system, and categorizing the bookmarked answer content with a category selected from the set of categories.

Abstract: Architecture that selects a classification engine based on the expertise of the engine to process a given entity (e.g., a file). Selection of an engine is based on a probability that the engine will detect an unknown entity classification using properties of the entity. One or more of the highest ranked engines are activated in order to achieve the desired performance. A statistical, performance-light module is employed to skip or select several performance-demanding processes. Methods and algorithms are utilized for learning based on matching the best classification engine(s) to detect the entity class based on the entity properties. A user selection option is provided for specifying a maximum number of ranked, classification engines to consider for each state of the machine. A user can also select the minimum probability of detection for a specific entity (e.g., unknown file). The best classifications are re-evaluated over time as the classification engines are updated.

Abstract: A method and apparatus are provided for processing a graphic in a document so that the graphic may be reused in a different application than the one it was originally used in. For a given document, a graphic may be identified from within the document and extracted from the document. The extracted graphic may be stored in a suitable storage medium, such as a reusable graphic repository. A structural feature associated with the extracted graphic may also be extracted. The extracted graphic may then be classified based on the extracted structural feature. Furthermore, a method and apparatus are provided for generating a reusable graphic from a document.

Abstract: Systems and methods for defining attributes for one or more entries in a computer implemented directory structure. The method comprises grouping a set of non-schema attributes associated with a directory entry into a multivalue schema attribute, wherein the multivalue attribute comprises values associated with each of the corresponding non-schema attributes grouped into the multivalue attribute; encoding at least one of the non-schema attributes into a string having one or more parts; and performing computing operations on the non-schema attributes in the directory entries based on content of the encoded strings defined in the multivalue attribute in which the respective non-schema attributes are grouped.

Abstract: Methods and apparatus for representing probabilistic data using a probabilistic histogram are disclosed. An example method comprises partitioning a plurality of ordered data items into a plurality of buckets, each of the data items capable of having a data value from a plurality of possible data values with a probability characterized by a respective individual probability distribution function (PDF), each bucket associated with a respective subset of the ordered data items bounded by a respective beginning data item and a respective ending data item, and determining a first representative PDF for a first bucket associated with a first subset of the ordered data items by partitioning the plurality of possible data values into a first plurality of representative data ranges and respective representative probabilities based on an error between the first representative PDF and a first plurality of individual PDFs characterizing the first subset of the ordered data items.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for classifying a live media tag into a type. A system configured to practice the method receives a group of tags generated in real time and associated with at least a portion of a live media event, identifies a tag type for at least one tag in the group of tags, and classifies the at least one tag as the tag type. Tag types can include system-defined types, user-entered types, categories, media categories, and text labels. More than one user can generate tags for the media event via more than one tagging platform. The system can further identify the tag type by sending to a user a list of suggested tag types, receiving from the user a selection of a suggested tag type from the list, and identifying the tag type as the suggested tag type.

Abstract: Systems and associated methods provide a cluster-level semi-supervision model for inter-active clustering. Embodiments accept user provided semi-supervision for updating cluster descriptions and assignment of data items to clusters. Assignment feedback re-assigns data items among existing clusters, while cluster description feedback helps to position existing cluster centers more meaningfully. The feedback can continue until the user is satisfied with the clustering achieved or one or more predetermined stopping criteria have been reached.

Abstract: A method, system, and computer program product for improved clustering of analytic functions in a data processing environment are described. A set of instances of an analytic function receiving data input from a set of data sources is identified. A first subset of instances is configured to receive input from a first subset of data sources, and a second subset of instances is configured to receive input from a second subset of data sources. The set of instances is assigned to a cluster. The cluster begins executing in a computer in the data processing environment, when the first subset of data sources begins transmitting time series data input to the first subset of instances in the cluster.

Abstract: A program product for clustering multi-modal data including hard and soft cross-mode constraints is provided. The program-product includes a non-transitory processor-readable medium on which program instructions are embodied. The program instructions are operable, when executed by at least one processor, to: color nodes in a graph having a plurality of objective edges and a plurality of constraint edges; partition the nodes by color; map the partitions back to the graph to form a color-partitioned graph having at least two sub-domains; and cross-associate all data that are part of a cluster. At least two colors are used to color the nodes. The plurality of constraint edges connects a respective plurality of node pairs, the two nodes in the node pairs being different colors. The partitioned nodes of the same color are independent of constraint edges.

Abstract: Invitational content targeted to a particular behavior can be served to the user when the user is likely to reproduce a desired behavior. The user is classified into one or more spatial-temporal segments based on an analysis of the user's characteristics and the user's past behavior. When a request is made for an item of invitational content, a spatial-temporal segment is selected based on a substantial likelihood that the current context will lead to a repeat of the representative past behavior. An item of invitational content associated with the selected segment is then served to the user.

Abstract: The present technology is directed to improving the conversion rate of invitational content that is provided to the user of an interactive, content-receiving-and-displaying device. The content of a large number of primary-content sources is analyzed and keyword and/or other context-providing information is extracted from the primary-content sources. The keyword and/or other context-providing information is used to index the primary-content sources into an index according to a hierarchical taxonomy; the hierarchical taxonometric index is used to identify primary-content sources with which a given item of invitational content correlates; and the given item of invitational content is delivered to a user in response to the user accessing a primary-content source with which the given item of invitational content correlates.

Abstract: A data center management system may include a data center customer profile corresponding to a data center customer. The data center customer profile may include a data center resource usage model and a service level agreement (SLA). A data center resource optimization module may determine a data center resource allocation for the data center customer based on the data center customer profile. A data center customer cost determination module may determine a data center customer cost that represents a cost to the data center of providing data center resources to the data center customer.

Abstract: The invention relates to a device (1) for transmitting to a user system (3) geographical data that is stored, using a unit-surface sorting, in the database (4) of a provider system (2).

Abstract: Techniques, including systems are methods, for analyzing data from multiple sources are disclosed and suggested herein. In an embodiment, external information from one or more external information sources and internal information from one or more internal information sources is received. The received external information and internal information are stored in one or more data stores that collectively implement one or more ontologies. One or more conditions are applied to the external information and internal information in the one or more data stores to determine a conclusion and the conclusion is provided to a user.

Abstract: In one embodiment, a method of generating annotation tags (28) for a digital image (22) includes maintaining a library (16) of human-meaningful words or phrases organized as category entries (72) according to a number of defined image description categories (70), and receiving context metadata (20) associated with the capture of a given digital image (22). The method further includes selecting particular category entries (72-1, 72-2) as vocabulary metadata (24) for the digital image (22) by mapping the context metadata (20) into the library (16), and generating annotation tags (28) for the digital image (22) by logically combining the vocabulary metadata (24) according to a defined set of deductive logic rules (30) that are predicated on the defined image description categories (70). In another embodiment, a processing apparatus (12), such as a digital processor (18, 26) and supporting memory (14), etc., is configured to carry out the above method, or to carry out variations of the above method.

Abstract: In a search system for searching a database based on a keyword input from a portable terminal while outputting a result of the search to the portable terminal to display, there are provided a search server that searches the database for information including the input keyword, a degree-of-popularity calculating apparatus which acquires number-of-member information from an i-Mode® server having the number-of-member information on the number of members for each menu in which various webpages are sorted for each category thereof, and calculates the degree of popularity of the menu based on the acquired number-of-member information, and information ranking means for ranking a plurality of pieces of information searched by the search server based on the degree of popularity of the menu to which the information belongs generated by the degree-of-popularity calculating apparatus.

Abstract: Methods and systems for clustering information items using nonnegative tensor factorization are disclosed. A processing device receives one or more class labels, each corresponding to an information item, a selection for a nonnegative tensor factorization model having an associated objective function and one or more parameter values, each corresponding to one of one or more penalty constraints. The processing device determines a constrained objective function based on the objective function associated with the selected nonnegative tensor factorization model, the one or more parameter values and the one or more class labels and including the one or more penalty constraints. The processing device determines clusters for the plurality of information items by evaluating the constrained objective function. Pairwise constraints may be received in addition to or instead of the class labels.

Abstract: A conceptual tagging and message matching system and method are provided. In one example, the system and method generate web pages or third party web pages with pieces of content combined with the message.

Abstract: An apparatus for connecting getting-in and off records of a vehicle includes: a driving information memory unit for storing getting-in and off records having a pair of getting-in and getting-off records, each of which represents a getting-in or off time and place; a grouping unit for grouping the getting-in or off records representing a same getting-in or off time zone and place, so that segmentalized getting-in or off groups are generated; a connecting unit for searching a segmentalized getting-in group connected to one segmentalized getting-off group, and for storing connection information between a searched segmentalized getting-in group and the one segmentalized getting-off group; and an estimating unit for specifying a getting-off time and a getting-off point when the getting-off action of the driver is detected, and estimating a getting-in time for a next driving according to the connection information.

Abstract: Embodiments include a method of aggregating data from a plurality of QuickBooks (QB) files that may be in physically separate locations, and having at least one account name in common. In one embodiment, the method includes, assigning a different parent account identification (ID) number to each differently named parent account. The method includes creating an entry in a hash table for each parent account ID, the contents of the entry being a collection of rows including a row for each different sub account of the parent account, wherein data for multiple instances of like named parent accounts are aggregated, the key of the entry in the hash table being the parent account ID.

Abstract: Methods and apparatus to classify reports are disclosed herein. An example method includes determining a type of an examination associated with a report; obtaining an identification of a person associated with the report; using the identification to determine whether the person associated with the report is specialized in the type of the examination; when the person associated with the report is specialized in the type of the examination, classifying the report as associated with a specialist; when the person associated with the report is unspecialized in the type of the examination, classifying the report as associated with a non-specialist; and presenting a document consumer with an indication of the classification of the report.

Abstract: A method is provided for extracting data from service repair verbatims in a vehicle service reporting system. Each service repair verbatim includes a technician's comments concerning a part, a symptom associated with the part, and a repair action associated with the symptom. Each service repair verbatim includes information relating to an identified problem with at least one vehicle part. A diagnostic and prognostic ontology database is provided that is structured by vehicle part classification, a vehicle part sub-class classification, and a relationship classification, wherein the relationship classification includes symptom relationships and action relationships. Each of the service repair verbatims are reconstructed utilizing the diagnostic and prognostic ontology database. Combinations of information are extracted from the reconstructed service repair verbatims as a function of user input criteria. A frequency is determined of each combination extracted in the reconstructed service repair verbatims.

Abstract: Method embodiments for performing a structured collection protocol by utilizing a collection device comprise collecting one or more sampling sets of biomarker data, wherein each sampling set comprises a sufficient plurality of sampling instances recorded over a collection period.

Abstract: DOM based unique ID generation, including receiving a hypertext markup language (HTML) page at a computer, and identifying HTML page elements in response to the receiving, the HTML page elements comprising parent nodes, the parent nodes comprising child nodes. The method further comprising processing each of the HTML page elements, the processing comprising: grouping the child nodes by parent node into a group of child nodes, detecting patterns in the group of child nodes in response to the grouping, reducing the group of child nodes to text strings in response to the detecting, storing the text strings as text values in the parent nodes, and generating a unique identifier (ID) of the HTML page in response to the processing.