Abstract: An information processing apparatus includes a communication unit and a control unit. The control unit is configured to control the communication unit to receive a plurality of pieces of post information sent from a first user, to obtain a plurality of pieces of evaluation information of another user with respect to the received plurality of post information, to classify the plurality of pieces of post information into a plurality of clusters, and to determine, as an advantage cluster of the first user, a cluster with the highest evaluation in the plurality of pieces of evaluation information out of the plurality of clusters.

Abstract: Tagging of content items and entities identified therein may include a matching process, a classification process and a disambiguation process. Matching may include the identification of potential matching candidate entities in a content item whereas the classification process may categorize or group identified candidate entities according to known entities to which they are likely a match. In some instances, a candidate entity may be categorized with multiple known entities. Accordingly, a disambiguation process may be used to reduce the potential matches to a single known entity. In one example, the disambiguation process may include ranking potentially matching known entities according to a hierarchy of criteria.

Abstract: A cloud storage system that includes at least one interface that connects the cloud storage system to a data network, at least one non-volatile mass memory, and at least one control unit connected to the interface and to the at least one mass memory and arranged to 1) receive requests from a user with regard to data objects from the interface according to a data transmission protocol, 2) store data objects transmitted according to a write request in the at least one mass memory and 3) retrieve data objects requested according to a read request from the at least one mass memory, wherein a predetermined storage period is assigned to each data object, stored in the at least one non-volatile mass memory by a write request, at the latest upon receiving the write request, and the stored data objects in a predetermined group cannot be changed by subsequent requests according to the protocol via the interface before expiration of the assigned storage period.

Abstract: Embodiments are disclosed for using an improved locality sensitive hashing (LSH) operation for the K-means clustering algorithm. In some embodiments, parameters of an LSH function are optimized with respect to a new cost model. In other embodiments, an LSH operation is applied with optimized parameters to a K-means clustering algorithm.

Abstract: A system for extracting customer feedback from a microblog site includes a retrieval unit coupled to the microblog site to capture microblog updates. A filter unit coupled to the retrieval unit filters the captured microblog updates according to filter criteria that remove non-actionable items from the captured microblog updates. A learning unit coupled to the filter unit prioritizes the filtered microblog updates, and a classification unit coupled to the learning unit classifies the filtered and prioritized microblog updates. An action unit coupled to the classification unit performs appropriate actions based on the classified, filtered and prioritized microblog updates.

Abstract: A system and method for accessing a hash table are provided. A hash table includes buckets where each bucket includes multiple chains. When a single instruction multiple data (SIMD) processor receives a group of threads configured to execute a key look-up instruction that accesses an element in the hash table, the threads executing on the SIMD processor identify a bucket that stores a key in the key look-up instruction. Once identified, the threads in the group traverse the multiple chains in the bucket, such that the elements at a chain level in the multiple chains are traversed in parallel. The traversal continues until a key look-up succeeds or fails.

Abstract: Searching a shared corpus is used to supplement word prediction, completion, and/or correction of text entry. A user input device at a client device receives user entry of text input comprising a string of symbols. The client device wirelessly transmits instructions to a remote site to conduct a search of a corpus using the string as a contiguous search term. From the remote site, the client device receives results of the search, including multiple sets of one or more words, each set occurring in the corpus immediately after the search term. The client device uses the received sets in word prediction, completion, and/or correction.

Abstract: Various embodiments include systems and methods for data mining of search engine and network operations to automatically identify query events. Data aggregated from such query events and stored as query history data may be processed to identify query ranking mismatches. These identified mismatches may be used with the query history data and target settings to automatically generate query rewrite data. In certain embodiments, this query rewrite data may be used to generate query rewrite input language (QRIL) records. Such QRIL records may then be used to automatically generate standardized rewrites which automatically resolve any conflicts between rewrites in a particular search engine.

Abstract: Various embodiments for adjusting a search result user interface when a foreign language search query is detected. A search query associated with a search request is obtained. A language of the search query is identified. An search result user interface is generated using a foreign language template when the language varies from an expected language. The search result user interface includes results based on the foreign language search query.

Abstract: An approach to classify different defect records by mapping plain language phrases to a taxonomy. The approach includes a method that includes receiving, by at least one computing device, a defect record associated with a defect. The method further includes receiving, by the least one computing device, a plain language phrase or word. The method further includes mapping, by the least one computing device, the plain language phrase or word to a taxonomy. The method further includes classifying, by the least one computing device, how the defect was at least one of detected and resolved using the taxonomy.

Abstract: An apparatus supports acquisition of information from a document including a plurality of words. An acquisition hardware unit acquires first information that shows a degree to which the document belongs to each of a plurality of clusters based on a concept included in the document. Second information shows a degree to which a single word among the plurality of words appears in each of the plurality of clusters based on a concept of the single word. A generation hardware unit, based on the first and second information, generates third information that shows a degree of overlap between the concept included in the document and the concept of the single word. A determination hardware unit determines whether or not the third information shows a degree of overlap that is lower than a predetermined criterion, and an output hardware unit outputs a result of this determination.

Abstract: Systems, methods and computer program products for using searchable aggregate indices associated with non-aggregated value storage. In one method, a search system stores metadata values for each of a plurality of objects in a storage unit. The metadata values are stored in corresponding value storage locations that are associated with an identifiable metadata fields. An aggregate index is provided which includes a dictionary of terms that are contained in metadata values associated with a designated set of the metadata fields. The aggregate index is searched for one or more specific search terms, and one or more of the metadata values are retrieved from the value storage locations in response to the search, where the individual metadata fields associated with the retrieved metadata values are identified.

Abstract: A method for retrieving information may include receiving, in a non-World Wide Web (WWW) corpus, a search query for a media author. Search results for the search query may be identified within the non-WWW corpus. A score for each of a plurality of media authors identified in the search results may be generated. The score for a corresponding one of the plurality of media authors may be based on a combined media popularity score for a plurality of media items authored by the corresponding one of the plurality of media authors. The search results may be ranked based on the generated score for each of the plurality of media authors.

Abstract: Methods, systems and computer program products are provided for generating a playlist. An application programming interface (API) receives a request to generate a playlist, where the request includes a set of rule-primitives. A playlist engine evaluator evaluates a rule corresponding to each rule-primitive in the set of rule-primitives across a catalog of media content, calculates a cost associated with each item in the catalog of media content, and generates a playlist based on the items of the catalog having the lowest costs.

Abstract: A search request from a user is received wherein the search request includes a search framework profile and at least one search term. Scheduling information is accessed from the search framework profile and a search operation is scheduled for execution in accordance with the at least one search term and search scheduling information. An indication that the search request is scheduled for execution is returned to the user.

Abstract: Embodiments of the present disclosure help content providers identify popular topics based on Internet search data, as well as to quantify the popularity of content addressing those topics. A computer-implemented method according to one embodiment of the present disclosure comprises receiving search data by a computer system; identifying a category related to at least a portion of the search data; determining, by the computer system and based on the search data, a topic for content associated with the identified category; and determining, by the computer system, a score indicative of a level of popularity for the topic, wherein determining the score is based on the search data and on one or more formats for the content associated with the topic.

Abstract: The present invention relates to a method for searching in a database containing at least one set of objects each linked to at least one descriptor, the search being done by a search engine from at least one request by a user in order to return at least one result object, said search method being characterized in that the request comprises at least one search parameter comprising a series of at least one search element (10, 11, 12, 13) obtained by freely adding (15) elements to said series by the user, the addition step being able to be repeated multiple times until a search instruction is given.

Abstract: This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.

Abstract: A computer system including a computer-readable memory unit; and a processor coupled to the memory unit. The processor is configured to provide a graphical image representing a search engine interface for display on a screen of the computer system, wherein the search engine interface comprises an arrangement of cells, each cell representative of a calendar unit of time; cause performance of a search, upon selection of a particular cell, wherein said search is based on the unit of time represented by the selected cell; and display the results of the search.

Abstract: A customer care knowledge management system. The system comprises a server computer comprising more than one search engine, configured to search an answer to the problem in the document, in a social community, and in at least one external website, wherein a social community is a computer managed online social community. The server computer further comprises a user interface server application, configured to combine search results from the more than one search engine, attach relevant discussions in a social community to the document, wherein a discussion is an aggregation of comments, replies, or posts on a topic, issue, or subject matter, filter at least some search results based on a profile of a customer care agent and the type of the problem, and notify at least one subject matter expert of the problem if no answer is found.

Abstract: A method of performing a search includes receiving, at a computing device, search results transmitted from a search system in communication with the computing device. The search results include a header for an application executable on the computing device and application access mechanisms associated with the header. Each application access mechanism has a reference to the application and indicates one or more performable operations for the application. The method includes displaying, on a display in communication with the computing device, a graphical user interface including the header, an expansion element associated with the header, and user selectable access links grouped with the header. Each access link is associated with an application access mechanism for the application. The expansion element has an expanded state and a collapsed state.

Abstract: Continuously blocking query result data for a remote query is provided. Included is: creating a first connection, using a communications network, between a database server and a client. At least one secondary connection is created, using the communications network, between the database server and the client, based on the database server supporting a continuous block fetch protocol. Using the at least one secondary connection, the database server receives at least one cursor-based fetch query. The database server generates continuous blocks of result data, based on the received at least one cursor-based fetch query and sends to the client, using the at least one secondary connection, the continuous blocks of result data.

Abstract: When a user conducts a search for content using one or more of the many search engines known in the art, embodiments of the present invention may receive results returned to the user's browser by the search engine, and may then proceed to filter, organize, modify, or enhance those results and/or their presentation by performing various editing and/or presentation operations on the search results, based on information relating to the user's prior interactions with the search results and the user's interests and preferences. Search results may also be modulated based on information about the way other users have responded to or interacted with each of the search results in the past.

Abstract: One or more systems, devices, methods, and/or processes described can apply searches and/or filters to data of social networks with respect to one or more geographical locations, geospatial references, location-based contexts, and/or map-based references. One or more social networks can be queried with search and/or filter parameters and one or more geographic locations, and results received from the social network(s) can be based on the search and/or filter parameter(s) and the geographic location(s) and presented to a user on a map or other user interface. Location-based information (e.g., in advertisement, a promotion, a coupon, etc.) can be provided to corresponding computing devices that correspond to one or more results of the one or more queries of the social network media data sources associated with the search region.

Abstract: A non-transitory computer-readable recording medium having recorded thereon a browser program running on a computer including a storage unit storing a table showing correspondences between text languages of web pages and character strings used in URLs to indicate the text languages, the program causing the computer to perform: receiving a designation of a URL; acquiring information indicating a text language designated by a user; determining whether the designated URL includes a top-level domain “com” or the top-level domain “com” with a slash “/” added thereto; acquiring, when determination is affirmative, source code of a web page indicated by the designated URL, and searching the source code for a URL including a character string corresponding to the designated text language; and, displaying, when the URL is found, a web page indicated by the found URL, and, displaying, when the URL is not found, the web page indicated by the designated URL.

Abstract: The present invention provides a system (10) for linking network content (12n) over a communications network (14n). The system (10) including: at least one memory or storage unit (20n) operable to store and/or maintain a plurality of linked-content facilities (30n), each of the linked-content facilities (30n) being independently associated with a network location that contains network content (12n); at least one processor operable to execute software that generates, maintains and/or controls access to the linked-content facilities (30n) for a plurality of users (24n); and, at least one input/output device (22n) operable to provide an interface for the users (24n) to operate the software in order to retrieve and/or view the linked-content facilities (30n) for selected network locations from the memory or storage unit (20n), via the communications network (14n).

Abstract: A system includes storage devices for storing content along with two or more computing devices such as two or more servers. One of the computing devices includes a staging memory that stores content that is received from the storage devices. The computing device also includes a user memory that is assigned to a user and stores content transferred from the staging memory. The user memory is accessible by the user while the staging memory is inaccessible by the user. The system also includes another computing device that has a content manager that initiates transferring of content from the storage devices to the staging memory and transferring content from the staging memory to the user memory for electronic publication of the content.

Abstract: In particular embodiments, a client loads a flash player. The flash player requests a flash redirection browser to execute an NPN call, the NPN call including a string. The flash redirection browser determines whether a cache at the client includes the string, and if the cache includes the string, the flash redirection browser determines an identifier associated with the string in the cache and returns the identifier to the flash player.

Abstract: The present disclosure describes methods, systems, and computer program products for providing and maintaining an evolving canonical data model (CDM) which consolidates current knowledge of the correspondences of existing schemas.

Abstract: A method of providing access control to a database accessible from a user interface is implemented at a policy enforcement point, which is located between the database and the user interface and includes the steps of: (i) intercepting a database query; (ii) assigning attribute values on the basis of a target table or target column in the query, a construct type in the query, or the user or environment; (iii) partially evaluating an access-control policy defined in terms of said attributes, by constructing a partial policy decision request containing the attribute values assigned in step ii) and evaluating the access-control policy for this, whereby a simplified policy is obtained; (iv) deriving an access condition, for which the simplified policy permits access; and (v) amending the database query by imposing said access condition and transmitting the amended query to the database.

Abstract: According to a general aspect, a system includes a query engine configured to receive a query from a user via a user interface layer for obtaining data from one or more databases, determine if a keyword of the query can be mapped to at least one of a plurality of keyword mappings stored in a semantic layer, and if the keyword cannot be mapped, provide an interactive object, via the user interface layer, to learn a new keyword mapping for the keyword such that the semantics layer is updated with the new keyword mapping for future queries. The system includes a prediction engine configured to check for previous queries of the user or other users that map the query to predict a next query, and the query engine is configured to provide query results of the query and the next query as a suggestion via the user interface layer.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for providing query suggestions. One of the methods includes receiving query log data that identifies a query and a location where the query was issued. A point of interest near the location where the query was issued is identified. A category of the point of interest near the location where the query was issued is identified. The query is associated with the category of the point of interest near the location where the query was issued.

Abstract: Systems and methods for displaying estimated relevance indicators for result sets of documents and for displaying query visualizations are disclosed. A method includes receiving a search query including a plurality of query terms. The method further includes searching a database using the search query to identify the result set of documents and calculating an estimated relevance score for the result set of documents. The estimated relevance score is indicative of a degree to which the result set of documents are relevant to the search query. The method further includes providing for display the estimated relevance indicator based on the estimated relevance score. The estimated relevance indicator provides a visual indication of the degree to which the result set of documents are relevant to the search query. Query visualizations including a plurality of nodes and a plurality of connectors are also disclosed.

Abstract: Methods for identifying content in encrypted or otherwise protected files utilize crowd sourcing for content identification. One such method includes, using a computer, selecting defined content titles to be presented with identifiers for data files for use in obtaining user selection data. The method may also include receiving the user selection data from multiple independent sources, the user selection data indicating users' selections of single ones of the content titles for respective single ones of the data files. The method may also include determining for ones of the identifiers, using the one or more computers processing the user selection data, respective ones of the content titles satisfying a minimum confidence threshold for association with the ones of the identifiers. An apparatus for performing the method comprises a processor coupled to a memory, the memory holding instructions for performing steps of the method as summarized above.

Abstract: Method for real time computation of the state variables of a hybrid differential-algebraic process model (DAP) in succeeding time steps on a process computer with a process interface, the process computer detecting at least one process variable of a physical process and/or producing output for influencing the physical process, the hybrid DAP being solved at least by a integrator functionality, a condition evaluation functionality and identification of a condition change by a consistency detection functionality for structure decision variables, and depending on the result parts of the hybrid DAP being active or inactive. Prompt computation is possible when a condition of the hybrid DAP changes by the consistency detection functionality being carried out in a sorted consistency handling function (KHF), in the case of a condition change, first and third parts of the sorted KHF being carried out once and a second part thereof being carried out repeatedly.

Abstract: An evaluation model generation device is provided to generate an evaluation model which evaluates the function or non-function of an IT system based on a system model including a process model which describes processing between processes on the IT system, a server model which describes a physical system configuration of the IT system, and allocations which represent correspondence relations between the elements in the process model and those in the server model. The evaluation model generation device includes: path enumeration means 110 which extracts a process path between processes in the process model, and a server path corresponding to the process path and located on the server model; allocation estimation means 120 which estimates the allocation based on the process path and the server path; and model conversion means 130 which converts the system model into the evaluation model using the process paths, the server paths, and the estimated allocations.

Abstract: A mechanism is provided in a data processing system for detecting lithographic hotspots. The mechanism receives a design layout. The mechanism generates spatial pattern clips from the design layout. The mechanism performs a transform on the spatial pattern clips to form frequency domain pattern clips. The mechanism performs feature extraction on the frequency domain pattern clips to form frequency domain features. The mechanism utilizes the extracted features on a set of training samples to train a machine learning classifier model. The mechanism classifies a set of previously unseen patterns, based on frequency domain features of the previously unseen patterns using the trained machine learning classifier model, into hotspots and non-hotspots.

Abstract: Methods for product data management and corresponding systems and computer-readable mediums. A method includes receiving one or more layer boundaries of one or more plies of a composite part. The method includes creating a topological definition from the layer boundaries, the topological definition includes one or more vertices and half-edges. The method includes identifying one or more vertical ramp sections of one or more vertical ramps from the topological definition that form one or more discontinuities in the topological definition. The method includes adding one or more additional vertices and half-edges to the topological definition based on the layer boundaries and the vertical ramp sections. The method includes creating one or more faces in the topological definition along the vertical ramp based on the additional vertices and half-edges to resolve the discontinuities. The method includes transmitting the topological definition with the faces.

Abstract: A method for creating personalized objects having a mechanically functional portion the method comprising at least one step of editing a three-dimensional model (10; 11) using computer program and a step of transforming the model into a physical object using a rapid prototyping machine, wherein during the editing step: a computer program processes a deformation of the original model into a deformed model, a three-dimensional geometrical constraints database, associated with said models, provides a set of constraints on the geometry of said mechanically functional portions, and a computer program computes at least one step of comparison between some geometrical constraints from said database and a model selected between the original model and the deformed model.

Abstract: A method for detecting tooth wear using digital 3D models of teeth taken at different times. The digital 3D models of teeth are segmented to identify individual teeth within the digital 3D model. The segmentation includes performing a first segmentation method that over segments at least some of the teeth within the model and a second segmentation method that classifies points within the model as being either on an interior of a tooth or on a boundary between teeth. The results of the first and second segmentation methods are combined to generate segmented digital 3D models. The segmented digital 3D models of teeth are compared to detect tooth wear by determining differences between the segmented models, where the differences relate to the same tooth to detect wear on the tooth over time.

Abstract: A computer-implemented method is provided for simulating a modal frequency response of a real-world object. The computer-implemented method includes dividing a plurality of excitation frequencies into a plurality of excitation frequency subsets, calculating modal frequency responses for at least a portion of the excitation frequencies in a given excitation frequency subset, and generating a simulation of the real-world object based at least in part on the modal frequency responses.

Abstract: A method for configuring a package labeler, and or labeling process including: providing a package defined as a computed mesh; providing a computed mesh description of a package labeler; providing operational parameters of a labeling operation for the package; simulating the interaction of the package and the package labeler according to the operational parameters of the labeling operation, the computed mesh of the package labeler and the computed mesh of the package; determining the location and/or deformation of the package mesh during at least a portion of the simulated interaction; and confirming, rejecting, or configuring the package labeler according to the determined location(s).

Abstract: Operation of an arbiter in a hardware design is verified. The arbiter receives a plurality of requests over a plurality of clock cycles, including a monitored request and outputs the requests in priority order. The requests received by and output from the arbiter in each clock cycle are identified. The priority of the watched request relative to other pending requests in the arbiter is then tracked using a counter that is updated based on the requests input to and output from the arbiter in each clock cycle and a mask identifying the relative priority of requests received by the arbiter in the same clock cycle. The operation of the arbiter is verified using an assertion which establishes a relationship between the counter and the clock cycle in which the watched request is output from the arbiter.

Abstract: A variable discretization method for general multiphase flow simulation in a producing hydrocarbon reservoir. For subsurface regions for which a regular or Voronoi computational mesh is suitable, a finite difference/finite volume method (“FDM”) is used to discretize numerical solution of the differential equations governing fluid flow (101). For subsurface regions with more complex geometries, a finite element method (“FEM”) is used. The invention combines FDM and FEM in a single computational framework (102). Mathematical coupling at interfaces between different discretization regions is accomplished by decomposing individual phase velocity into an averaged component and a correction term.

Abstract: The present invention provides a SOI MOS device modeling method. The SOI MOS device is one having a source-drain injection not reaching the bottom. The method comprises: a) establishing an overall model comprising a primary MOS device model simulating an SOI MOS device having the source-drain injection reaching the bottom, a source body PN junction bottom capacitance model simulating a source body PN junction bottom capacitance, and a drain body PN junction bottom capacitance model simulating a drain body PN junction bottom capacitance; and b) extracting parameters respectively for the primary MOS device model, the source body PN junction bottom capacitance model, and the drain body PN junction bottom capacitance model in the overall model. In the prior art, the source body junction bottom capacitance and the drain body junction bottom capacitance in the SOI MOS device having a source-drain injection not reaching the bottom affect the performances of the device.

Abstract: Groups of signals in an electronic design for which interesting assertions, such as assert, assume and cover properties, can be generated are identified. A sliding temporal window of fixed depth is used to sample unique present and past value combinations of signals in the signals groups generated by one or more simulations or emulations. The values of signals in the signal groups are organized into truth tables. Minimal functional relations are extracted from the truth tables, using techniques similar to those for synthesis of partial finite memory machines from traces, and used to generate assertions. The assertions are filtered using a cost function and pertinence heuristics, and a formal verification tool used to prune unreachable properties and generate traces for reachable cover properties. Syntactically correct assert, assume and cover property statements for the generated properties are instantiated and packaged into a file suitable for further simulation or emulation or formal verification.

Abstract: An information processing apparatus includes a processor and a memory configured to store therein correspondence information defining an association relationship between position of the connection point of circuits and information of wiring which has one end located at the position of the connection point. The processor is configured to identify a first circuit from a group of multiple images representing an overall circuit, acquire, based on the correspondence information, information of a first position of a connection point of a second circuit at which the identified first circuit is coupled and information of a first wiring which one end is located at the first position, extract, from the second image, a partial image that includes images of the first wiring and the connection point at the first position based on the acquired information of the first position and the first wiring, and output the extracted partial image.

Abstract: A method for generating a circuit description for a multi-die field-programmable gate array, FPGA, comprising a first FPGA die and at least one further FPGA die is described. The method is performed in an FPGA design tool and comprises automatically evaluating a first and a second partition of a partitioned circuit description, the partitions being associated with respective ones of the FPGA dies. At least one multiplexing element is inserted into the first partition and a corresponding de-multiplexing element is inserted into the second partition based on the automated evaluation.

Abstract: A computer-implemented method for filtering components from a logical component hierarchy is provided. The method uses a computing device having a processor and a memory. The method includes identifying, in the memory, a filter associated with the logical component hierarchy. The method also includes comparing, by the processor, a sub-component of the logical component hierarchy with the filter. The method further includes identifying the sub-component for filtration based on the comparison of the sub-component with the filter. The method also includes filtering the sub-component from the logical component hierarchy.

Abstract: A method of forming a layout design is disclosed. The method includes placing a first set of layout patterns in a first layout layer and placing a second set of layout patterns in a second layout layer. The first set of layout patterns is aligned with one or more grid lines of a first set of grid lines. The first set of grid lines extends along a first direction, where two grid lines of the first set of grid lines overlap two cell boundaries of a standard cell layout. The second set of layout patterns is aligned with one or more grid lines of a second set of grid lines. The second set of grid lines extends along the first direction and has at least two different line pitches, where two grid lines of the second set of grid lines overlap two cell boundaries of the standard cell layout.