Abstract: A system for classifying text is provided. The system includes a data store containing a plurality of previously observed word sequences and a processor coupled to the data store. The processor is configured to receive a first word sequence and generate bi-directional similarity metrics based on the first word sequence and each of the previously observed word sequences. The processor is also configured to assign a classification to the first word sequence based on at least one of the bi-directional similarity metrics.

Abstract: A method for expanding an initial ontology via processing of communication data, wherein the initial ontology is a structural representation of language elements comprising a set of entities, a set of terms, a set of term-entity associations, a set of entity-association rules, a set of abstract relations, and a set of relation instances. A method for extracting a set of significant phrases and a set of significant phrase co-occurrences from an input set of documents further includes utilizing the terms to identify relations within the training set of communication data, wherein a relation is a pair of terms that appear in proximity to one another.

Abstract: A method for expanding an initial ontology via processing of communication data, wherein the initial ontology is a structural representation of language elements comprising a set of entities, a set of terms, a set of term-entity associations, a set of entity-association rules, a set of abstract relations, and a set of relation instances. A method for extracting a set of significant phrases and a set of significant phrase co-occurrences from an input set of documents further includes utilizing the terms to identify relations within the training set of communication data, wherein a relation is a pair of terms that appear in proximity to one another.

Abstract: A method and an apparatus for determining a semantic matching degree. The method includes acquiring a first sentence and a second sentence, dividing the first sentence and the second sentence into x and y sentence fragments, respectively, performing a convolution operation on word vectors in each sentence fragment of the first sentence and word vectors in each sentence fragment of the second sentence, to obtain a three-dimensional tensor, performing integration and/or screening on adjacent vectors in the one-dimensional vectors of x rows and y columns, until the three-dimensional tensor is combined into a one-dimensional target vector, and determining a semantic matching degree between the first sentence and the second sentence according to the target vector.

Abstract: A computer implemented method for analysing natural language to determine a sentiment between two entities discussed in the natural language, comprising the following steps: receiving the natural language at a processing circuitry; analysing the natural language to determine a syntactic representation which shows syntactic constituents of the analysed natural language and to determine a sentiment score of each constituent; determining which constituents link the two entities; and calculating an overall sentiment score for the sentiment between the two entities by processing the sentiment score of each constituent of the constituents determined to link the two entities.

Abstract: Embodiments described herein provide approaches for validating synonyms in ontology driven natural language processing. Specifically, an approach is provided for receiving a user input containing a token, structuring the user input into a semantic model comprising a set of classes each containing a set of related permutations of the token, designating the token as a synonym of one of the set of related permutations, annotating the token with a class from the set of classes corresponding to the one of the set of related permutations, and validating the annotation of the token by determining an accuracy of the designation of the token as a synonym of the one of the set of related permutations. In one embodiment, the accuracy is determined by quantifying a linear distance between the token and a contextual token also within the user input, and comparing the linear distance to a pre-specified linear distance limit.

Abstract: A method and an apparatus for acquiring a network resource where the method includes extracting language configuration information of a browser, and placing the language configuration information into a language list, sending a hypertext transfer protocol (HTTP) request to a web server, locating a position of a media element, matching a value of a language attribute of a specified resource element in the media element with the language information in the language list, selecting a media resource address, and finally according to the media resource address, requesting a media resource from the web server and loading the media resource. Hence, the browser can automatically select a media file of a specified language version according to a language preference of a user, thereby reducing a workload of a website developer. Additionally, the user does not need to perform manual selection, thereby enhancing user experience.

Abstract: Methods, apparatuses, and computer program products are described herein that are configured to generate an operator text in response to an alarm that is either received from an alarm or alert system or that is self-generated based on an analysis of one or more data feeds. The method of an example embodiment may include determining whether an operator text is to be generated in response to a received alert condition by performing data analysis operations comprising: analyzing, using a processor, a primary data feed and at least one confirmatory data feed to identify one or more features; and determining based on the detection of a feature in the primary data feed or the at least one confirmatory data feed satisfies at least one predetermined constraint. The method may further include generating an output text that is displayable in a user interface that describes at least a diagnosis for the feature that satisfied that at least one predetermined constraint.

Abstract: Various technologies and techniques are disclosed for creating and managing persistent document collections. A data store is used for storing one or more persistent document collections. A content management application is used for managing documents for users, for creating one or more persistent document collections of a sub-set of the documents upon user request, and for storing the one or more persistent document collections in the data store. Users can create one or more persistent document collections from a sub-set of the documents. Users can also modify the one or more persistent document collections. A requested portion of one or more persistent document collections can be output upon request from an external application so that the external application can download one or more of the documents that are represented by the persistent document collection for further modification by the user.

Abstract: A method of performing a search of heterogeneous data based on an input query includes: generating an index including at least two hash tables, where each hash table corresponds to a different data domain of the heterogeneous data and includes hash code sets, where at least one of the hash code sets is mapped to a hash code set of another one of the tables. The method further includes performing a hash on the input query to generate a hash code, by referring to the index, determining a first hash code set that the generated hash code belongs to, and determining a second hash code set that the determined first hash code set is mapped to, and providing at least one result based on the determined second hash code set.

Abstract: A method for provision of content data is disclosed. A user is registered by a computer system. An operator of the computer system selects a radio or music station. The computer system is configured to receive and read an audio feed from said radio or music station. The audio feed is transcoded by the computer system. The audio feed is then recorded by said computer system. The computer system then saves the time and hash codes stamped files into a content database. The computer system matches said time and hash codes stamped files with songs in a pre-existing audio signature database. The computer system then receives content identification data from said pre-existing audio signature database. The computer system then records said received content identification data in said content database. The computer system then sends said content identification data to a mobile application located on a mobile device of said user.

Abstract: A system for recommending content based on the audience, implemented by a computing processor, detects content that is to be transmitted to an audience. The system receives a user profile associated with the audience, and scores the content against the user profile to produce a rating. The content is weighted based on at least one attribute associated with the user profile. The system invokes an action in response to the rating.

Abstract: A system including variable parameter selection functionality operable for facilitating selection of a variable parameter of a composite query, parameter value assigning functionality operable for facilitating assignment to each parameter other than the variable parameter, one of the possible values associated therewith, composite query execution functionality operable, responsive to selection of the variable parameter and to assignment of the value to each parameter other than the variable parameter, for automatically executing the composite query for each possible value of the variable parameter, thereby being operable for receiving a multiplicity of composite query execution results corresponding to the multiplicity of possible values associated with the variable parameter, and composite query results display functionality operable, responsive to receiving the multiplicity of composite query execution results, for displaying, for each possible value associated with the variable parameter, a corresponding c

Abstract: A school ranking system may be configured to determine a rank of a school based on career outcomes data. Career outcomes data is obtained, at least in part, from member profile data stored by an on-line social network system. The school ranking system uses a list of the top-ranked companies for generating ranking data and also determines how many companies are to be included in the list of the top-ranked companies.

Abstract: A system for recommending content based on the audience, implemented by a computing processor, detects content that is to be transmitted to an audience. The system receives a user profile associated with the audience, and scores the content against the user profile to produce a rating. The content is weighted based on at least one attribute associated with the user profile. The system invokes an action in response to the rating.

Abstract: Caching algorithms estimate the popularity (future request rate or re-use time) and base caching decision on popularity (future request rate or re-use time). Thereby the popularity (future request rate or re-use time) upon which the decisions are made, is not limited to the locally measured one, but a combination of all popularities of all storage means, where the weight of each is determined by social relations between users served by the different storage means.

Abstract: The present invention provides a semantic information acquisition method and system, and corresponding keyword expansion and search methods and systems, comprising: searching for, then classifying an article; then, performing word segmentation according to the classified article to obtain the words in said category, and setting said category and words to serve as the semantic information of the keyword; also, a method and system using the semantic information acquisition method to expand a keyword, and a method and system using keyword expansion to perform a search. The described semantic information acquisition method effectively avoids the technical problems in the prior art of only being able to obtain semantic information of English vocabulary; and it also being impossible to classify semantic information based on category information. The invention is particularly suitable for searching using a keyword, searching a large number of texts, and organizing large amounts of related data and information.

Abstract: The present invention relates to a method and device for displaying browser resources and a computer readable storage medium. The method comprises: acquiring current location information about a scroll bar of a web page in a browser window and generating an area coverage of the web page covered by the window in accordance with the acquired location information; determining the resources to be displayed of the web page within the area coverage in accordance with layout information about each resource to be displayed of the web page in the web page; and downloading the determined resources to be displayed and correspondingly displaying the downloaded resources to be displayed within the area coverage.

Abstract: Disclosed are a method and device for obtaining web page category standards, and a method and device for categorizing web pages. Tag contents are extracted from sample pages; standard characteristic terms are extracted from the tag contents; on the basis of the standard characteristic terms extracted from the tag contents, a list of standard categories and standard weights of standard characteristic terms, i.e. the standard for web page categories, are obtained; web pages to be categorized are categorized on the basis of the standard.

Abstract: An apparatus for providing a contact interface comprises a web page provider configured to provide a web page list comprising at least some information of at least one web page to a user terminal; and an additional contact interface provider configured to, when one of the at least one web page is selected, provide additional data corresponding to an additional contact interface provided to be contactable to the owner of the selected web page, to the user terminal.

Abstract: An approach is provided for aggregating and linking place data among entities via a collaborative registry. A place resource servicing application receives an input from a provider for specifying place information, the place information including, at least in part, a description of content available from the provider related to a place at a geographic location. The place resource servicing application determines the place from the place information. The place resource servicing application aggregates the place information with other place information available from one or more other providers in a registry based, at least in part, on the determined place.

Abstract: Systems and methods are disclosed for distributed file collection and processing. According to certain embodiments, a producer system may detect a producer configuration file that specifies a file type, identify at least one file of the specified file type, and send the at least one identified file to a collector system. A conductor system may receive a request from a consumer system and allocate the at least one identified file to the consumer system based on the request. The collector system may receive the at least one identified file from the producer system. The consumer system may send the request to the conductor system and pull the at least one identified file from the collector system.

Abstract: The method can include receiving the first stream of tuples to be processed by the stream operator hosted by one or more computer processors, the stream operator having at least one input port and a condition input port. The method can also include receiving, at runtime, a customized condition at the condition input port of the stream operator. The method can also include monitoring a first group of one or more tuples from the first stream of tuples at a first window of the stream operator. The method can also include determining whether the first group of one or more tuples at the first window fulfills the customized condition. The method can also include deleting, in response to the first group of one or more tuples fulfilling the customized condition, the first group of one or more tuples.

Abstract: Techniques for pro-active self-healing in a distributed file system are disclosure herein. In accordance with one embodiment, a method is provided. The method comprises prior to detecting an access request by a client application to an image on a storage server, identifying, by a self-healing daemon executed by a processing device, a first region of the image comprising stale data. A partial lock on the image is acquired. The partial lock prevents access to the first region of the image. Responsive to acquiring the partial lock, the self-healing daemon provides access to a second region of the image file comprising data other than the stale data.

Abstract: Methods, apparatus, and other embodiments facilitate transitioning a database between two modes. The two modes include a mode where table information for separate tables in the database is stored in a single monolithic file and a mode where the table information for separate tables is stored in separate files. Conventional attempts to make this type of transition lock the database for an unacceptable amount of time. Example methods and apparatus make a copy of a database that is to be transitioned, lock the copy, make a second instance of the copy, and then perform the work necessary for the transition in the second instance. This allows the original database to remain running. When the second instance is complete, the second instance is synchronized to the original database and then the transition is completed by copying the second instance to the original or failing the original over to the second instance.

Abstract: A system that displays geographic data is disclosed. The system obtains polygons that define a set of geographic regions. Then, the system projects rays from endpoints of the line segments that define the polygons onto a reference line to form intersection points. For each interval between pairs of consecutive intersection points on the reference line, the system keeps track of open line segments that project onto the interval. For each data point in a set of data points, the system identifies a relevant interval on the reference line that the data point projects onto, and performs a crossing number operation to identify polygons that the data point falls into, and the system increments a count for each polygon that the data point falls into. Finally, the system displays the set of geographic regions in a manner that indicates a number of data points that fall into each geographic region.

Abstract: A system that facilitates a geofencing operation is disclosed. The system obtains polygons that define a set of geographic regions. Then, the system projects rays from endpoints of the line segments that define the polygons onto a reference line to form intersection points. For each interval between pairs of consecutive intersection points on the reference line, the system keeps track of open line segments that project onto the interval. For each data point in a set of data points, the system identifies a relevant interval on the reference line that the data point projects onto, and performs a crossing number operation to identify polygons that the data point falls into, and the system increments a count for each polygon that the data point falls into. Finally, the system performs a geofencing operation for the location-aware device based on the identified polygons that the data point falls into.

Abstract: A system, a method and instructions embodied on a non-transitory computer-readable storage medium that solve a 3D point-in-polygon (PIP) problem is presented. This system projects polygons that comprise a set of polyhedra onto projected polygons in a reference plane. Next, the system projects a data point onto the reference plane, and performs a 2D PIP operation in the reference plane to determine which projected polygons the projected data point falls into. For each projected polygon the projected data point falls into, the system performs a 3D crossing number operation by counting intersections between a ray projected from the corresponding data point in a direction orthogonal to the reference plane and polyhedral faces corresponding to projected polygons, to identify polyhedra the data point falls into. The system then generates a visual representation of the set of polyhedra, wherein each polyhedron is affected by data points that fall into it.

Abstract: The disclosure provides a method and device for recommending a candidate word according to a geographic position. The method may include receiving a coded character string of a user by a computing device. The computing device may collect geographic position information corresponding to the coded character string, and then determine a geographic area in which the geographic position information is located. The computing device may obtain a geographic candidate word corresponding to the coded character string according to a geographic word stock of the determined geographic area. The geographic word stock of the geographic area may store the coded character strings and a corresponding geographic word according to the geographic area. As compared to current technologies, complexity of input can be reduced and intelligence of an input method can be improved.

Abstract: Systems, methods, and media for storing a digital image using the Digital Imaging and Communication in Medicine (DICOM) standard. In an embodiment, a digital image at a first resolution is divided into a plurality of regions. Each of the plurality of regions is stored as a separate DICOM image file. In addition, each of the DICOM image files is associated with a DICOM series representing the digital image at the first resolution.

Abstract: A relationship status website identifies a significant other with whom the user is involved in a romantic relationship. The user may upload one or more photos of the significant other. Other members may access the website to learn whether a potential romantic partner is already involved in a relationship and is attempting to cheat. The website relies on image recognition software features to compare the uploaded photo of a potential partner with the photos of other members' established significant others. Images used for comparison are limited to those uploaded by users within a predetermined radius. Other identifying features may also be uploaded by each user and compared to the features of potential romantic partners by other members. The user may also file a complaint regarding the cheating behavior of a current or former significant other.

Abstract: Products (e.g., books) often include a significant amount of informative textual information that can be used in identifying the item. An input query image is a photo (e.g., a picture taken using a mobile phone) of a product. The photo is taken from an arbitrary angle and orientation, and includes an arbitrary background (e.g., a background with significant clutter). From the query image, the identification server retrieves the corresponding clean catalog image from a database. For example, the database may be a product database having a name of the product, image of the product, price of the product, sales history for the product, or any suitable combination thereof. The retrieval is performed by both matching the image with the images in the database and matching text retrieved from the image with the text in the database.

Abstract: The image search technique makes it is possible to accurately search for similar images using many queries. To achieve this purpose, an image search device is provided and includes: an image storage unit which stores images and tag information about the images; an image input unit which receives an image; a search query generation unit which extracts, from the image, feature values for search queries; a similar image search unit which performs a similar-image search to obtain similar images and grouping information; a query grouping unit which divides the queries into groups in accordance with the obtained grouping information; a query group importance level determination unit which calculates the levels of importance of the groups; a search result generation unit which sorts the search results in accordance with the levels of importance of the groups; and a data output unit which outputs information about the search results for each group.

Abstract: Agents monitoring data exchanged between a software component and a database access component provide first, second, third, and fourth data. First data describes a detected first request from the software component to the database access component corresponding to an attempt to open a connection with a database the software component interfaces with using the database access component. Second data describes a detected connection object provided to the software component using the database access component and corresponding to a connection with the database. Third data describes a detected second request from the software component to the database access component corresponding to a query of the database by the software component. Fourth data describes a result set from the database responsive to the query. At least a portion of a service model is generated using the first, second, third, and fourth data to at least model opening the connection and the query.

Abstract: The collection and aggregation of time series data from a variety of heterogenic time series data sources. This may be accomplished through the use of multiple collector modules, each configured to gather time series data from a different time series data source, and translate that time series data from its original format into a common format. An evaluation module applies one or more expressions against the time series data in the common format in order to identify one or more operations to perform, such as alerting, reporting, actuating, and so forth. Accordingly, the principles describe herein allow real world information to be gather and acted upon even when the time series data is gathered from disparate sources. Furthermore, different systems can rely upon the actions being consistent based on access to the same underlying data.

Abstract: Systems, methods, and related technologies for application-centric object storage and virtual data objects are described. In certain aspects, a processing device can process a first data object in a first format to generate a virtual data object, the virtual data object including a representation of the first data object in a second format. The processing device can receive a request with respect to the first data object from an application that is configured with respect to the second format. The processing device can complete the request with respect to the first data object and the application via the virtual data object.

Abstract: A first entry is received at an event log interface. The event log interface is configured to store received entries in an event log. It is determined that there is not enough storage space to store the first entry in the event log. A second entry is identified. The second entry is the oldest entry in the event log based on when the second entry was written to the event log. It is determined that the second entry contains an indicator to preserve. A copy of the second entry is sent to the event log interface to be written to the event log. One or more entries are deleted from the event log. The one or more entries includes the second entry. The first entry is written to the event log. The copy of the second entry is written to the event log.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for infinite versioning by automatic coalescing. In a particular embodiment, a method provides determining an age range for a plurality of data versions stored in a secondary data repository and identifying first data versions of the plurality of data versions that are within the age range. The method further provides determining a compaction ratio for the first data versions and compacting the first data versions based on the compaction ratio.

Abstract: Coordinate data is encoded as a distributed representation for processing and analysis by a machine-intelligence system such as a hierarchical temporal memory system. Input coordinates represented in coordinate space having at least one dimension are obtained. The input coordinates change over time. A corresponding region around each of the input coordinates in the coordinate space is determined. A subset of coordinates within the corresponding region for each of the input coordinates is selected. A distributed representation for each of the input coordinates reflecting the selected subset of coordinates for each of the input coordinates is generated. The distributed representation may be provided to one or more processing nodes for detection of temporal sequences and spatial patterns. Based on discrepancies between predicted coordinate data and actual coordinate data, anomalies may be detected.

Abstract: Systems, methods, and related technologies for application-centric object storage and interfaces. In certain aspects, a processing device receives, from a first application, one or more requests with respect to a data object. The processing device processes the one or more requests to identify one or more substructures of the data object. Based on an identification of the one or more substructures of the data object, the processing device defines a storage structure for the data object. The processing device defines an interface through which the first application can provide data access commands to the data object as stored in the defined storage structure.

Abstract: Systems, methods, and related technologies for application-centric object storage and managing object requests via multiple indexes are described. In certain aspects, a processing device can receive a first data object, generate, with respect to the first data object, a first index, generate, with respect to the first data object, a second index through which the first data object can be accessed, receive a request with respect to the first data object, process the request to determine which of the first index or the second index to utilize in completing the request, and complete the request via at least one of the first index or the second index.

Abstract: A hash database configuration method and apparatus, where the method includes establishing an index area and a data area on a disk, where the index area includes p disk pages with an equal size, and receiving an allocation request of key-value pairs, allocating m keys in the key-value pairs to disk pages in the index area, and allocating n values in the key-value pairs to the data area, where m, n, and p are all integers greater than 1, and the efficiency of accessing the hash database is improved.

Abstract: An approach for managing memory usage in cloud and traditional environments using usage analytics is disclosed. The approach may be implemented in a computer infrastructure including a combination of hardware and software. The approach includes determining that space is available within one or more tables which have schema definitions with string fields having a predefined length. The approach further includes creating a virtual table and mapping the available space to the virtual table for population by one or more records.

Abstract: An example method of providing simulated control of a third-party database to a client includes receiving, at a simulation control proxy, a query that selects data from a database table stored in a third-party database. The method also includes submitting, over a network, the query to the third-party database. The method further includes loading a set of database records included in an initial result set of the query. The method also includes determining whether a data storage device includes modification data indicating that the initial result set is stale. The method further includes updating the initial result set in accordance with the modification data if the initial result set is stale. The method also includes sending the updated result set of the query to a client. The updated result set of the query is different from the initial result set of the query.

Abstract: A method, apparatus, and program product are provided for ranking a plurality of items. A plurality of items is received. Criteria associated with the plurality of items and weights associated with each criterion are defined. Intermediate rankings are either generated using at least one sorting algorithm or provided or both. A conformity matrix and scoring function are generated from the intermediate rankings. A customized genetic algorithm seeks a ranking that maximizes the scoring function by evolving a population of rankings according to each ranking's unsolved ranges. An unsolved range in a ranking is identified based on the conformity matrix and scoring function. In response to a ranking having additional unsolved ranges, the steps of identifying the unsolved range and rearranging the items using the customized genetic algorithm are repeated. In response a ranking have no additional unsolved ranges, the ranking for the plurality of items is provided.

Abstract: Methods, indexing systems, computer program, computer program product for indexing and searching content are disclosed. For example, in one embodiment a method performed by an indexing system (104) for indexing or updating an index (106) for content is disclosed. The method includes for each one of a plurality of keywords (204) in a data storage system (1206), wherein each keyword is associated with a modality (206) and at least a first time stamp (208): retrieving (1002) from the data storage system a keyword (204a) and its associated first time stamp (208a); defining a time range for the keyword; determining which other keywords (214a) in the data storage system are associated with a time stamp within the time range; and updating the index with said other keywords that were determined to be associated with a time stamp within the time range.

Abstract: Examples of techniques for processing model changes are described herein. A method includes generating, via a processor, a change log in a model. The method also includes detecting, via the processor, a change to a model element of a model package in the model. The method further includes storing, via the processor, the detected change as a change item in a topic of the change log.

Abstract: A method, system, and graphical user interface for alerting a computer user to new results for a prior search are disclosed. One aspect of the invention involves a graphical user interface on a computer that includes a plurality of links recommended by a search engine for a computer user. The plurality of links are determined by the search engine by: producing search results by rerunning a plurality of search queries that have been performed previously for the computer user; and evaluating the produced search results to select search results that meet predefined search result selection criteria. At least one of the criteria is based on Internet usage data for the user.

Abstract: According to one embodiment, there is provided a database system in which a database server and a storage are connected via a communication line. The storage includes a data area, a transaction information storage area, a journal log storage area, and a first circuit. The database server includes a second circuit. The second circuit writes transaction information into the transaction information storage area determined from a combination of the subject database server and a unit of division of processing executing transaction processing.

Abstract: Asynchronous snapshot invalidation techniques are described. According to various such techniques, an enhanced file handle structure may be defined that includes a snapshot generation ID that is to comprise a value that singularly identifies a snapshot performed at a particular point in time. In some embodiments, when a snapshot ID assigned to that snapshot is reused at a subsequent point in time, a different snapshot generation ID may be assigned to that subsequent snapshot. With respect to an in-core cache, the differing snapshot generation IDs may eliminate unacceptable ambiguity regarding respective file information sets corresponding to the initial and subsequent snapshots sharing the same snapshot ID. As a result, obsolete file information sets may be cleared from the in-core cache asynchronously, enabling improved performance. The embodiments are not limited in this context.