15th week of 2014 patent applcation highlights part 49 |
Patent application number | Title | Published |
20140101111 | BACKUP OF DATA ACROSS NETWORK OF DEVICES - A distribution plan that indicates how to encode and distribute backup data across multiple data centres may be generated. The distribution plan may be generated such that one or more characteristics of the distribution plan, such as costs, are optimized while constraints on the plan, such as protection level, recovery point objective (RPO), and recovery time objective (RTO) are satisfied. The protection level may indicate the number of the data centres that are to remain available such that the backup data is recoverable from encoded fragments of the backup data stored in the data centres that remain available. | 2014-04-10 |
20140101112 | METHOD AND SYSTEM FOR MANAGING METADATA - A computer-based method and scoring system for management of metadata is provided. | 2014-04-10 |
20140101113 | Locality Aware, Two-Level Fingerprint Caching - The present disclosure provides for implementing a two-level fingerprint caching scheme for a client cache and a server cache. The client cache hit ratio can be improved by pre-populating the client cache with fingerprints that are relevant to the client. Relevant fingerprints include fingerprints used during a recent time period (e.g., fingerprints of segments that are included in the last full backup image and any following incremental backup images created for the client after the last full backup image), and thus are referred to as fingerprints with good temporal locality. Relevant fingerprints also include fingerprints associated with a storage container that has good spatial locality, and thus are referred to as fingerprints with good spatial locality. A pre-set threshold established for the client cache (e.g., threshold Tc) is used to determine whether a storage container (and thus fingerprints associated with the storage container) has good spatial locality. | 2014-04-10 |
20140101114 | METHOD AND SYSTEM FOR PROCESSING DATA - Methods, computer systems, and computer program products for processing data a computing environment are provided. The computer environment for data deduplication storage receives a plurality of write operations for deduplication storage of the data. The data is buffered in a plurality of buffers with overflow temporarily stored to a memory hierarchy when the data received for deduplication storage is sequential or non sequential. The data is accumulated and updated in the plurality of buffers per a data structure, the data structure serving as a fragment map between the plurality of buffers and a plurality of user file locations. The data is restructured in the plurality of buffers to form a complete sequence of a required sequence size. The data is provided as at least one stream to a stream-based deduplication algorithm for processing and storage. | 2014-04-10 |
20140101115 | SEGMENT GROUP-BASED SEGMENT CLEANING APPARATUS AND METHODS FOR STORAGE UNITS - Victim segments to be returned to a free area in a segment cleaning process from a plurality of segments included in each segment group are selected by using a method corresponding to the segment group. A host comprises an interface relaying data exchange with a storage device; and a file system module performing a segment cleaning process by selecting victim segment from a plurality of segments stored in the storage device, discovering live blocks in each of the victim segments, writing back the discovered live blocks to the storage device through the interface, and returning the victim segments to a free area. The file system module calculates victim points for all segments included in a first segment group using a first victim point calculation formula, calculates victim points for all segments included in a second segment group using a second victim point calculation formula, and selects the victim segments based on the victim points. | 2014-04-10 |
20140101116 | ROBUST TRANSMISSION OF DATA UTILIZING ENCODED DATA SLICES - A method begins by a processing module concurrently encoding a collection of data segments to produce sets of encoded data slices, where each set includes a total number of encoded data slices and where a decode threshold number of encoded data slices is required to recover a corresponding data segment. The method continues with the processing module determining a transmit number to be initially greater than the decode threshold number and less than the total number. The method continues with the processing module selecting a transmit number of encoded data slices from each set of encoded data slices to produce sets of transmit encoded data slices. The method continues with the processing module randomizing ordering of the sets of transmit encoded data slices to produce a random order of encoded data slices and transmitting encoded data slices of the random order of encoded data slices. | 2014-04-10 |
20140101117 | METHODS AND SYSTEMS FOR MANAGING RECORDS IN AN ON-DEMAND SYSTEM - Methods and systems are provided for managing records in a database. An exemplary method involves a server coupled to the database determining a value indicative of a relative uniqueness of an input record based on a subset of a plurality of fields of the input record and storing the input record in the database when that value is unique among one or more values for one or more existing records in the database. Each value of the one or more values for the existing records is also based on the subset of the plurality of fields of a respective existing record and is indicative of the relative uniqueness of that respective existing record. | 2014-04-10 |
20140101118 | SYSTEM AND METHOD FOR CREATING MULTIPLE VERSIONS OF A DESCRIPTOR FILE - A system (e.g., content management system, content delivery system) and method are described herein which are configured for receiving one or more source descriptor files (e.g., MPD files, HLS m3u8 files, HTTP manifest files) along with associated adaptive bit rate segments. The system and method are also configured for receiving rules (e.g., content ratings, timing information, user profiles, regional and demographic information) and then creating multiple descriptor files based on the received rules and the source descriptor file(s). The system and method are further configured for distributing the multiple descriptor files to one or more downstream systems (e.g., content to delivery systems, users). | 2014-04-10 |
20140101119 | META CLASSIFIER FOR QUERY INTENT CLASSIFICATION - Systems and methods are provided for classifying a search query. A first group of query classifiers can be used to evaluate a query relative to various subject matter domains. The evaluation results from the first group of domain classifiers can then be used by a second group of meta-classifiers. The meta-classifiers are based on non-linear classification models. The meta-classifiers are associated with meta-classifier categories that may correspond to a domain or that may correspond to a plurality of domains. The assigned meta-classifier category for a query can be used in any convenient manner, such as by triggering additional uses of the search query to match images or other alternative types of documents, or such as by allowing a subject matter domain to be assigned to the query. | 2014-04-10 |
20140101120 | QUALITY CONTROL SYSTEM FOR PROVIDING RESULTS IN RESPONSE TO QUERIES - The invention further provides a method and system for providing results in response to queries. A challenge keyword is transmitted to a remote search engine computer system and a reference result is received from the search engine computer system. A reference score is calculated based on the reference search result. The challenge keyword in entered into at least a first engine and a challenge result is received from the first engine. A challenge answer score is calculated based on the challenge result. A challenge reference score for the first engine based on a comparison of the challenge answer score for the first engine with the reference score, and published for further analysis. | 2014-04-10 |
20140101121 | BUILDING NOMENCLATURE IN A SET OF DOCUMENTS WHILE BUILDING ASSOCIATIVE DOCUMENT TREES - A method for topic discovery through structural knowledge in an associative document tree building system includes inserting a set of documents into nodes of a document tree, extracting a tag set of tags from the set of documents and inserting each tag into a different node of a tag tree. The method also includes conducting a search engine query using the tags of the extracted tag set to produce a new set of documents and inserting the new set of documents into nodes of the document tree. The method yet further includes extracting a new tag set of tags from the new set of documents and inserting each tag of the new tag set into a different node of the tag tree. Finally, the method includes displaying at least a portion of each of the document tree and tag tree in a user interface displayed. | 2014-04-10 |
20140101122 | System and method for collaborative structuring of portions of entities over computer network - Techniques for arranging information in a computer based network system. The techniques running by processors, enabling the hierarchical arrangement of tree nodes by users, the ability to upload documents to the system, the ability to mark portion(s) of document(s) and associate each portion with at least one tree node, later saved on data storage devices. | 2014-04-10 |
20140101123 | CUSTOM EVENT AND ATTRACTION SUGGESTIONS - A computing device may determine a geographic location of the computing device. The computing device may receive information associated with a user. The information may include a search history, a browsing history, an electronic communication message, a social media profile, and a geographic location history. The computing device may determine, based on the information associated with the user, a predicted interest of the user. The computing device may determine, based on the predicted interest of the user, events within a threshold distance from the geographic location of the computing device. The computing device may determine, based on a strength of a relationship between the predicted interest and respective event information associated with each of the events, a ranking of the events. The computing device may output, based on the ranking, at least a portion of the event information for at least one of the events. | 2014-04-10 |
20140101124 | SYSTEM AND METHOD FOR RECURSIVELY TRAVERSING THE INTERNET AND OTHER SOURCES TO IDENTIFY, GATHER, CURATE, ADJUDICATE, AND QUALIFY BUSINESS IDENTITY AND RELATED DATA - A system and a method used for data discovery in accordance with an inquiry in which multiple sources, which may be web sites or other data sources, are examined for data relevant to the inquiry. The process and method is performed recursively an indeterminate number of iterations, using data and metadata from multiple sources to corroborate discovered data and metadata from other sources, until no further relevant data or sources are found, or adjudication or exception rules have been met. Discovered data and metadata are curated, adjudicated to assess reliability, synthesized, and clustered into composite records using precedence rules and provenance to determine the most reliable data sources as well as terms of use for each source. Data, metadata, and information about each search are retained and can be used for subsequent purposes, such as subsequent searches or other downstream activities. | 2014-04-10 |
20140101125 | SYSTEM FOR MULTIPLE TASKS ON A DISPLAY - A system has a processor and tangible, non-transistory media that stores a program that when executed by the processor is configured to perform operations. The system receives a request from a requesting user to reconfigure a search screen on a display, adds at least one search window to the search screen; receives a plurality of search requests from the search screen, and performs a plurality of searches to perform a separate search resulting in separate search results for each of the search requests provided by the requesting user. Each of the search results is displayed on a separate frame on a display. Other embodiments include operations other than searches. | 2014-04-10 |
20140101126 | SYSTEM AND METHOD FOR DETECTING A SEARCH INTENT - A method and system for detecting a search intent of a user are provided. The method includes receiving an input search query from a user device; tokenizing the input search query to at least one token to create at least one tokenized query; processing the at least one tokenized query by a plurality of engines, wherein each engine of the plurality of engines configured to compute a certainty score that indicates a probability that the at least one tokenized query is mapped to at least one entity, wherein each engine of the plurality of engines is further configured to correspond to at least one entity indicating a topic of interest, thereby the plurality of engines are configured with different entities; receiving from a set of engines of the plurality of engines their respective entities and computed certainty scores, wherein the set of engines output computed certainty scores above a predefined threshold; and analyzing the received certainty scores and the respective entities to determine the search intent. | 2014-04-10 |
20140101127 | SYSTEM AND METHODS THEREOF FOR DOWNLOADING APPLICATIONS VIA A COMMUNICATION NETWORK - A method and system for downloading at least one application via a communication network are provided. The method comprises receiving an input search query from a user device; determining the search intent respective of the input search query, wherein the search intent indicates a topic of interest of a user of the user device; selecting, based on the search intent, at least one application from at least one applications central repository; creating a display segment over a display of the user device; displaying an icon corresponding to the at least one selected application in the display segment; establishing a direct communication link between the user device and a location hosting the at least one selected application in response to an input received from the user device; and downloading the application to the user device. | 2014-04-10 |
20140101128 | ESTIMATING ROWS RETURNED BY RECURSIVE QUERIES USING FANOUT - In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth. | 2014-04-10 |
20140101129 | HIGH PERFORMANCE SECURE DATA ACCESS IN A PARALLEL PROCESSING SYSTEM - A mechanism is provided for secure data access in a parallel processing system. A database having two tables is provided. A subset of the tables' primary key attributes is considered sensitive. A first user is authorized to access the primary key's sensitive attribute in an unmasked format, while a second user is authorized to access same data in a masked format. Two security tables are generated having a plurality of entries mapping the values of the primary key attribute in the unmasked format to the values of the primary key attribute in the masked format. A security view is generated joining the two security tables. The security view grants the first user access to the values of the primary key's sensitive attribute in the unmasked format only and grants the second user access to the values of the primary key's sensitive attribute in the masked format only. | 2014-04-10 |
20140101130 | JOIN TYPE FOR OPTIMIZING DATABASE QUERIES - A query complier analyzes a query to identify a correlated scalar subquery. The query complier transforms the query having the correlated scalar subquery into a query of AGGREGATION INNER/OUTER JOIN or MAX1ROW INNER/OUTER JOIN depending on a result type of the correlated scalar subquery. The AGGREGATION INNER/OUTER JOIN performs JOIN on the rows of the correlated scalar subquery with the rows of a main query and AGGREGATE on the joined rows and returns a result of the joined rows of the main query and aggregation value thereof. The MAX1ROW INNER/OUTER JOIN performs JOIN on the rows of the correlated scalar subquery with the rows of a main query, raises Error when the number of joined rows of the subquery is two or more and returns a result of the row of the main query and the joined row of the subquery. | 2014-04-10 |
20140101131 | SWAPPING EXPECTED AND CANDIDATE AFFINITIES IN A QUERY PLAN CACHE - In an embodiment, a hit percentage of an expected affinity for a first query is calculated, wherein the expected affinity comprises a first address range in a query plan cache, a hit percentage of a candidate affinity for the first query is calculated, wherein the candidate affinity comprises a second address range in a query plan cache, and if the hit percentage of the candidate affinity is greater than the hit percentage of the expected affinity by more than a threshold amount, query plans in the candidate affinity are swapped with query plans in the expected affinity. | 2014-04-10 |
20140101132 | SWAPPING EXPECTED AND CANDIDATE AFFINITIES IN A QUERY PLAN CACHE - In an embodiment, a hit percentage of an expected affinity for a first query is calculated, wherein the expected affinity comprises a first address range in a query plan cache, a hit percentage of a candidate affinity for the first query is calculated, wherein the candidate affinity comprises a second address range in a query plan cache, and if the hit percentage of the candidate affinity is greater than the hit percentage of the expected affinity by more than a threshold amount, query plans in the candidate affinity are swapped with query plans in the expected affinity. | 2014-04-10 |
20140101133 | ESTIMATING ROWS RETURNED BY RECURSIVE QUERIES USING FANOUT - In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth. | 2014-04-10 |
20140101134 | SYSTEM AND METHOD FOR ITERATIVE ANALYSIS OF INFORMATION CONTENT - The present invention is directed to a system and method enabling the tracking of users, content and actions in respect to online content; assigning topics to online content; providing such information for analysis at a central systems; and providing an overview of users, content and actions in the aggregate. The processing of online interactions permits tracking users, identifying influential content and users, identifying the type of interactions that users prefer with respect to specific content, and so forth. As such, the system permits targeted and informed interactions with users and content sites, which recommendations are of value to, among others, online publishers, advertisers, search engines and users. | 2014-04-10 |
20140101135 | METHOD AND SYSTEM FOR DYNAMICALLY OPTIMIZING CLIENT QUERIES TO READ-MOSTLY SERVERS - A system and method of query optimization are disclosed. A complexity measure of a client query received from a client application is compared to a predetermined threshold, which is determined using at least one of system data and query execution data. An optimized query is generated by modifying the client query to reduce the complexity measure of the client query if the complexity measure of the client query exceeds the predetermined threshold. The optimized query is submitted to a server application on a server and a post-processing routine to be applied to the result set is selected. | 2014-04-10 |
20140101136 | TRANSCODING AND SERVING RESOURCES - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for transcoding and providing resources. A query is received. A resource is generated, and the resource, when processed by a client device, causes the client device to perform various operations. The operations include displaying a search result having an associated landing page and detecting user interaction with the search result. The operations include, in response to detecting user interaction with the search result, displaying a first portion of the landing page that is embedded within the resource and requesting, over a network, a second portion of the landing page. The operations include receiving the second portion of the landing page, and loading the second portion of the landing page. The generated resource is provided in response to the query. | 2014-04-10 |
20140101137 | SYSTEM AND METHOD FOR A CONTACT PERSONA-BASED GROUP IN A SOCIAL MEDIA NETWORK - A system and method for automatically adding users to a dynamically created virtual group for a social network. The virtual group is created on the basis of a user's current interest in topics or entities as indicated in the user's personal profile. The user's current interests can also be inferred from the user's interaction with the social network. | 2014-04-10 |
20140101138 | INFORMATION PROCESSING APPARATUS CAPABLE OF DISPLAYING LIST OF MULTIPLE CONTENTS, CONTROL METHOD THEREFOR, AND STORAGE MEDIUM - An information processing apparatus which makes it possible to easily find a page on which a desired content is allocated when many contents are displayed separately on a plurality of pages. Contents are classified into a plurality of groups based on attribute information on the contents. One tab is selected from among a displayed plurality of tabs corresponding to the groups. Contents in a group corresponding to the selected tab are displayed in a predetermined display area. The attribute information on the contents is displayed near the plurality of tabs. First attribute information on a first content in a first group corresponding to a first tab and second attribute information on a second content in a second group corresponding to a second tab displayed next to the first tab are compared, and based on a comparison result, the second attribute information is displayed near the second tab. | 2014-04-10 |
20140101139 | METHODS AND DEVICES FOR QUERYING DATABASES USING ALIASING TABLES ON MOBILE DEVICES - A method for responding to natural language financial performance queries received from a user device is provided herein. The method may include: receiving a first spoken natural language request from the user device; parsing the request into words, using a processor; searching a table of natural language words and keywords to determine whether the request includes any of the words stored in the table; generating instructions for querying a database based on one or more keywords; receiving financial information responding to the query from the database; and transmitting the financial information to the user device for display in a graphic format and/or for playback of an audio. | 2014-04-10 |
20140101140 | METHOD AND SYSTEM FOR INFORMATION RETRIEVAL AND PROCESSING - A computer-implemented system for the retrieval and manipulation of information available via, an information network includes an information retrieval and processing component. The information retrieval and processing component includes: (a) search query means for conducting a search of the information network to obtain references to the information relevant to a search query; (b) information retrieval means for retrieving information available from sources on the information network, and an information store, for storage of retrieved information; and (c) processing means for processing of information retrieved from sources on the information network, and of information stored in the information store, to produce corresponding processed information. The system includes a cell-based user interface, and an intermediate storage layer, which permits a user, who may be unfamiliar with sophisticated computer programming languages, to develop automated processes for information transfer and manipulation based on present and historical information available via the information network. | 2014-04-10 |
20140101141 | INFORMATION PROVISION SYSTEM, INFORMATION PROVISION SYSTEM CONTROL METHOD, INFORMATION PROVISION DEVICE, PROGRAM, AND INFORMATION RECORDING MEDIUM - To provide an information provision system capable of improving a users operability in obtaining a list of desired information. A designated position obtaining unit ( | 2014-04-10 |
20140101142 | RELATIONSHIP-BASED SEARCH AND RECOMMENDATIONS - Techniques are described for determining relationships between user activities and determining search results and content recommendations based on the relationships. A plays-related-to-searches application may determine a relationship score between plays of a media title and searches of a query by determining a distance between a projection of the search onto the space of the users and a projection of plays of the media title onto the space of the users. A plays-after-searches application may determine a score for plays of the streaming media title given the search by multiplying a number of times plays of the media title occur after the query is entered by the number of times any play occurs, and dividing by a product of the number of times plays of the media title occur after any query is entered and the number of times plays of any media title occur after the query is entered. | 2014-04-10 |
20140101143 | METHODS AND SYSTEMS FOR OBTAINING AND PRESENTING ALUMNI DATA - Obtaining alumni data from a database includes storing standardized alumni data in alumni data profiles, receiving a selected data entity representing an institution, searching the alumni data profiles to locate the profiles of alumni of the institution, determining a plurality of ranked sets of data by searching the profiles of alumni of the institution, and displaying each of the elements of the plurality of ranked sets of data respectively as elements in a plurality of facets. The elements in the plurality of facets may be displayed visually as a graphics display. A further operation may include receiving a selected data entity representing an element of a first facet and, responsive to receiving the selected data entity, displaying, at each of the facets of the plurality of facets other than the first facet, the elements of the facet ranked in order of the number of alumni in each element of the facet. | 2014-04-10 |
20140101144 | Methods and Systems for Displaying Microblog Topics - Methods and mobile terminals are provided for displaying microblog topics. An example method includes, sending by a mobile terminal a post that includes at least a first geographic location of the mobile terminal to a server so that the server can search for microblog topics associated with the first geographic location of the mobile terminal based on at least information associated with the post, receiving the microblog topics sent by the server, and sorting the received microblog topics. The method further includes, displaying one or more first microblog topics of the sorted microblog topics on a center area of an interface of the mobile terminal, and displaying the rest of the sorted microblog topics around the center area toward one or more sides of the interface. | 2014-04-10 |
20140101145 | DYNAMIC CAPTIONS FROM SOCIAL STREAMS - Architecture that augments a search result entry caption with keywords related to topics currently being shared and discussed in other social network information sources. This can provide a much better idea of the content of the website or webpage. The architecture obtains a link from updates of social topics of social network information sources (e.g., social networks for people places professionals, etc.), extracts title content of a document title associated with the link, compares the title content to document text for similarity to create non-duplicative content, creates keywords related to popular social topics from the non-duplicative content, and then augments a search result entry of a search result page with the keywords of the popular social topics. | 2014-04-10 |
20140101146 | SYSTEM AND PROCESS FOR DISCOVERING RELATIONSHIPS BETWEEN ENTITIES BASED ON COMMON AREAS OF INTEREST - A method for generating a relevance score for at least one candidate retrieved in a search, the method comprising: initiating a query seeking at least one the candidate based upon at least one filter selected from the group consisting of: product name, product category, company name, HS code, SIC code and any other product-related qualifier; searching at least one database for matches between the candidate and the filter, thereby generating at least one matched candidate; generating an initial relevance score for each the matched candidate; generating at least one additional score for each the matched candidate, wherein the additional score is at least one selected from the group consisting of: a reputation score, a score boost, a past behavior score, a profile match score, a preference match score and a web behavior score; and generating a final relevance score based upon the initial relevance score and the at least one additional score for each the matched candidate. | 2014-04-10 |
20140101147 | SEARCH - A computer system for assisting searching of a database of a plurality of attributes, measures and content in order to answer analytical queries, the system comprising an input device for receiving word queries requesting information and/or metrics from the database a processor configured to process word queries requesting information and/or metrics from the database; and a storage memory containing a plurality of responses to word queries which responses contain and/or correspond to attributes, content and/or measures of the database, and containing one or more ordered combinations of attributes wherein the attributes of the ordered combinations are in a set order, the processor configured to match one or more words in a received word query with one or more attribute, content and/or measure in or corresponding to the stored responses, to provide relevant responses to the input word query based on the matching, and to rank the relevant responses, wherein the ranking of each relevant response is based at least partially on the position of one or more matched attributes of that relevant response within at least one ordered combination. | 2014-04-10 |
20140101148 | PREFERENCE-INFORMATION GATHERING SYSTEM, PREFERENCE INFORMATION GATHERING APPARATUS, PREFERENCE-INFORMATION GATHERING METHOD, AND PREFERENCE-INFORMATION GATHERING PROGRAM - A preference-information gathering system is capable of gathering information on every commodity and/or every service, which are each of interest to a user, as user's preference information. The preference-information gathering system includes a user portable terminal capable of storing a user identifier uniquely identifying the user, an information searching apparatus and a preference-information management apparatus for managing the information on preferences with the user. The information searching apparatus has a search-information inputting unit for requesting a user to enter search information to be used in a process to search for information desired by the user and a user-identifier acquisition unit for acquiring a user identifier. The information searching apparatus transmits information found in a search process requested by the user as the desired information on a commodity and/or a service and the user identifier to the preference-information management apparatus by associating the information and the identifier with each other. | 2014-04-10 |
20140101149 | COMPUTER IMPLEMENTED METHODS AND APPARATUS TO INTERACT WITH RECORDS USING A PUBLISHER OF AN INFORMATION FEED OF AN ONLINE SOCIAL NETWORK - Disclosed are methods, apparatus, systems, and computer-readable storage media for interacting with records using a publisher configured to publish information to a feed of a social network. In some implementations, a computing device receives a request to interact with a child record related to a parent record stored in a database system. The request is generated via the publisher displayed in a user interface on a display device. The user interface is also configured to display the feed in association with an entity of the social network. Child record information indicating a type of the child record and field data to populate one or more fields of the child record can be received. The field data is differentiated from message content generated via the publisher to include in a feed item for presentation in the feed when displayed to one or more users following the parent record. The requested interaction with the child record can be performed using the child record information. | 2014-04-10 |
20140101150 | EFFICIENT HIGH PERFORMANCE SCALABLE PIPELINED SEARCHING METHOD USING VARIABLE STRIDE MULTIBIT TRIES - A method for high speed searching of a large database provides speed, throughput, and efficient memory usage comparable to TCAM-assisted searches without using dedicated processors. Successive groups of bits from a key are processed by tables in a search tree. The tables are constructed with different sizes and types according to the structure of the key and the distribution of information in the database. Each link to a subsequent table specifies both the type of the linked table and how many key bits the table will process. The tables include, but are need not be limited to, address offset tables that use bits from the key as an addressing offset to locate a result. Embodiments are implemented on pipeline processors that include internal memory units and access to external memory. Embodiments also include string compare tables, memory mapped tables, and/or instructions to continue searching on a different memory unit. | 2014-04-10 |
20140101151 | SYSTEM FOR DISPLAY OF OBJECTS - A system may generate a database of a geographical map of a navigation device. The geographical map covering a geographical area which is divided into several update regions. The system may identify at least one object in the geographical map which covers an object area in the geographical area. The object area can be divided into different parts which are located in different update regions. The system can store in the database, for each of said at least one object, information indicating that the object area overlaps with plural update regions, the information including pointers to update regions in which the respective different parts of the object area are stored. | 2014-04-10 |
20140101152 | Proactive creation of image-based products - A method for proactively creating an image product includes storing a library of specification terms for image products by a computer system, receiving a command from a user, tokenizing the command into a plurality of tokens by the computer system, matching one or more of the tokens to the specification terms in the library to determine specification parameters for an image product by the computer system, automatically identifying images based on the specification parameters by the computer system, and automatically creating a design for the image product that incorporates at least some of the images identified based on the specification parameters. | 2014-04-10 |
20140101153 | Naming Methodologies for a Hierarchical System - Methods and systems are disclosed for naming methodologies for a hierarchical system. In one embodiment, a computer implemented method of organizing instance names in a hierarchical system includes receiving a description of a hierarchical system that includes plurality of instances arranged in different branches in a plurality of hierarchical levels in a physical data structure, creating an instance name data structure configured to describe the corresponding instances in the hierarchical system, where the instance name data structure comprises a map of indexes and a corresponding array of offsets configured to access naming information in a subsequent level, and associating names of instances in the hierarchical system to a corresponding set of unique integers which are arranged in a sequential manner. | 2014-04-10 |
20140101154 | SIMPLIFYING GROUPING OF DATA ITEMS STORED IN A DATABASE - An aspect of the present invention simplifies grouping of data items previously stored in a database, the data items being stored in the form of rows and columns in respective tables (in the database). In one embodiment, a system displays a cross product of values from two or more columns in the form of multiple lines, where each line contains a respective value from each of the two or more columns to specify a corresponding criterion (combination of values). In response to receiving inputs indicating the respective groups for each of the lines, the system determines a group for each data item (stored in the database) based on the received inputs. A user is accordingly required to only specify the desired groups corresponding to various combinations of values of the columns to cause grouping of data items in the database. | 2014-04-10 |
20140101155 | GENERATING A TUNABLE FINITE AUTOMATON FOR REGULAR EXPRESSION MATCHING - Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA. Different from an NFA, a TFA guarantees that the number of concurrent active states is bounded by a bound factor b that can be tuned during the construction of the TFA according to the needs of the application for speed and storage. A TFA can achieve significant reductions in the number of states and memory space. | 2014-04-10 |
20140101156 | REGROUPING NON-DERMINISTIC FINITE AUTOMATON ACTIVE STATES TO MINIMIZE DISTINCT SUBSETS - Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA. Different from an NFA, a TFA guarantees that the number of concurrent active states is bounded by a bound factor b that can be tuned during the construction of the TFA according to the needs of the application for speed and storage. A TFA can achieve significant reductions in the number of states and memory space. | 2014-04-10 |
20140101157 | ENCODING NON-DERMINISTIC FINITE AUTOMATON STATES EFFICIENTLY IN A MANNER THAT PERMITS SIMPLE AND FAST UNION OPERATIONS - Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA. Different from an NFA, a TFA guarantees that the number of concurrent active states is bounded by a bound factor b that can be tuned during the construction of the TFA according to the needs of the application for speed and storage. A TFA can achieve significant reductions in the number of states and memory space. | 2014-04-10 |
20140101158 | File Handling in a Hierarchical Storage System - A mechanism is provided for file handling in a hierarchical storage system. A user virtual file system scans, reads and analyses data or user behavior to create or modify at least one rule or metadata. The user virtual file system identifies logical or temporal relationships of files based on the at least one rule or the metadata. The user virtual file system groups identified related files in the at least one container. The user virtual file system moves the at least one container to different tiers of storage based on the at least one rule or the metadata. | 2014-04-10 |
20140101159 | Knowledgebase Query Analysis - A computerized method of analyzing a knowledgebase comprising; assembling a collection of queries made by users to obtain information from the knowledgebase; identifying in each query, sets of collocated words in that query to form a list of collocated word sets in the collection; from the list, identifying and presenting frequently collocated word sets in the collection. Likewise, a histogram of scaled relative difference between the frequency of word sets at first and second time intervales may be presented. | 2014-04-10 |
20140101160 | SYSTEMS AND METHODS FOR CLASSIFYING AND TRANSFERRING INFORMATION IN A STORAGE NETWORK - Systems and methods for data classification to facilitate and improve data management within an enterprise are described. The disclosed systems and methods evaluate and define data management operations based on data characteristics rather than data location, among other things. Also provided are methods for generating a data structure of metadata that describes system data and storage operations. This data structure may be consulted to determine changes in system data rather than scanning the data files themselves. | 2014-04-10 |
20140101161 | Method and system to manage privacy of shared contact information. - A method for determining an address include the steps of registering an alias and associating it with one or more sets of contact information, providing an alias to obtain the address or other contact information, determining if the alias has been registered, resolving the alias to obtain the address. | 2014-04-10 |
20140101162 | METHOD AND SYSTEM FOR RECOMMENDING SEMANTIC ANNOTATIONS - A method for recommending semantic annotations on a main document and sub documents is provided. The method includes: extracting a keyword of the main document; extracting a or a set of keyword of each sub document; and generating a or a set of keyword similarity of each of the sub documents based on a degree of similarity between the keyword of the main document and the keyword of each of the sub documents. The method also includes: obtaining a plurality of words appeared on each of the sub documents and calculating a frequency of each of the words; generating a semantic capacity of each of the sub documents according to the frequencies; grouping the main document and at least one of the sub documents into a semantic document set based on the semantic capacities and the keyword similarities; and annotating the main document according to the semantic document set. | 2014-04-10 |
20140101163 | KEYWORD GENERATION - This specification describes technologies relating to generation of keywords. In general, one aspect of the subject matter described in this specification can be embodied in methods that include receiving structured data describing a content item, the structured data indicating a category for the content item. The methods may further include searching domains associated with the category using a first query, formed based on data elements in the structured data, to identify resources associated with the identified domains. The methods may further include determining one or more queries based on data reflecting past search queries, where each of the one or more determined queries resulted in one or more of the identified resources being returned as part of a search result, and determining keywords based on the one or more determined queries. The methods may further include transmitting or storing the keywords for use in impression allocation decisions. | 2014-04-10 |
20140101164 | EFFICIENT SELECTION OF QUERIES MATCHING A RECORD USING A CACHE - A method is provided for constructing a cache for storing results of previously evaluated queries in a binary tree based on a cache key. The cache is searched, by a processing device, for a node representing a set of previously evaluated queries that match a given record using an instance of the cache key. In response to finding a representative node that matches the instance of the cache key, the method performs processing associated with the set of previously evaluated queries. In response to finding no representative nodes, the method creates a new node using the instance of the cache key. The method of the invention then updates the cache by classifying the compatibility of newly registered queries with the cache key and evaluating whether compatible newly registered queries match the record. | 2014-04-10 |
20140101165 | SEARCHABLE AND SIZE-CONSTRAINED LOCAL LOG REPOSITORIES FOR TRACKING VISITORS' ACCESS TO WEB CONTENT - A method and system for tracking visitors' access to web content using a searchable and size-constrained local log repository is disclosed. A repository indexer receives visitor logs from a remote source and indexes the logs to include a usage field indicating when or how frequently an associated visitor log was accessed from a local log repository by a report request manager. The local log repository stores the logs and is size constrained. A repository manager removes a subset of the logs in the local log repository based on parameters within the subset of the logs' usage field. The report request manager receives a request from a requestor for a report indicating visitors' access to a content object, searches for logs within the local log repository pertinent to the request, aggregates data across the logs responsive to the search, and generates a report presenting the aggregated data. | 2014-04-10 |
20140101166 | Methods And Systems For Processing Media Files - Systems and methods for processing media files are described. In one embodiment, one or more events are captured having associated event data and associated with a client device, wherein each event is associated with an article and at least one of the articles is a media file, wherein at least one of the events is captured in real time upon the occurrence of the event, at least some of the event data and articles associated with the events are indexed and stored, a search query is received, and the at least one media file is determined as relevant to the search query. | 2014-04-10 |
20140101167 | Creation of Inverted Index System, and Data Processing Method and Apparatus - The present disclosure relate to techniques for establishing an inverted indexing system and related data processing. The techniques may include writing, by a computing device, inverted indexes of a massive amount of data records into at least one inverted file. The computing device may then write description information of the written inverted file into a description file associated with the inverted file, and establish the inverted indexing system based on the inverted file and the description file of the inverted file. The techniques enhance efficiency in establishing the inverted indexing system and in processing data using the systems. | 2014-04-10 |
20140101168 | TECHNIQUE FOR RECYCLING MATCH WEIGHT CALCULATIONS - Disclosed is a system for, and method of, recycling field value weights as computed for database linking purposes. Such field value weights may be used for a search operation. In some embodiments, such weights may be used for a search operation prior to their values stabilizing during an iterative linking operation. | 2014-04-10 |
20140101169 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND COMPUTER PROGRAM - An information processing device according to the present technology includes an action recognition unit that recognizes an operation action of a user based on sensor information, and an action representation generation unit that analyzes operation action data showing the operation action of the user recognized by the action recognition unit to generate an action segment represented by a meaning and content of the operation action from the operation action data. | 2014-04-10 |
20140101170 | Methods and Systems for Prefetching Music for Devices - Methods and systems are presented for prefetching music for devices. The disclosed method includes detecting an access to a music library through a device. The music library is associated with a user music account and is managed in cloud music storage. The disclose method further includes monitoring use activities for the user music account and the use activities of selected songs in the music library are adjustable for relevance based on assigned weightings. One or more songs from the music library that satisfy a prefetching constraint based on the monitored use activities are identified. The songs that satisfy the prefetching constraint are tagged for transferring to the device. The tagged songs are transferred to the device without receiving a user initiated request for the tagged songs. | 2014-04-10 |
20140101171 | Similar Document Search - Described herein are methods for finding substantially similar/different sources (files and documents), and estimating similarity or difference between given sources. Similarity and difference may be found across a variety of formats. Sources may be in one or more languages such that similarity and difference may be found across any number and types of languages. A variety of characteristics may be used to arrive at an overall measure of similarity or difference including determining or identifying syntactic roles, semantic roles and semantic classes in reference to sources. | 2014-04-10 |
20140101172 | Configurable Dynamic Matching System - A system is provided that that dynamically matches data originating from one or more data sources. The system analyzes a matching configuration file, where the matching configuration file includes one or more matching configurations. The system modifies a probabilistic matching algorithm of a matching engine at runtime based on the one or more matching configurations and based on two or more data records of the plurality of data records that require matching. The system compares two data records of a plurality of data records using the modified probabilistic matching algorithm. The system generates a match score for the two data records based on the match weight for each data record field. | 2014-04-10 |
20140101173 | METHOD OF PROVIDING INFORMATION OF MAIN KNOWLEDGE STREAM AND APPARATUS FOR PROVIDING INFORMATION OF MAIN KNOWLEDGE STREAM - A method for providing information about a main knowledge stream is disclosed. According to an embodiment of the present invention, the method includes obtaining reference links representing reference relationships among reference documents in each of a plurality of documents stored in a database, determining one or more basic paths connecting the reference links, calculating probability values of the reference links by overlapping the determined basic paths, determining a first document among the documents and an input reference link associated with the first document, and performing a Markov chain model using a probability value of the input reference link, and calculating information about the main knowledge stream associated with the first document using the result obtained by performing the Markov chain model. | 2014-04-10 |
20140101174 | ELECTRONIC DEVICE AND MULTIMEDIA FILE SORTING METHOD - A multimedia file sorting method for use in an electronic device is provided. The method has the following steps of: retrieving time information and location information of multimedia files stored in the electronic device; filtering the multimedia files according to the retrieved time information and the retrieved location information; and sorting the multimedia files into multiple groups according to similarities within both the retrieved time information and the retrieved location information. | 2014-04-10 |
20140101175 | SYSTEM AND METHOD FOR SORTING DATA - A method and apparatus that enables a user to sort data from one or more sample lots, which may be obtained via a network, such as the Internet, into a composite parameter structure. The composite parameter structure is a function of one or more parameters corresponding to one or more characteristics associated with one or more sample lots. The composite parameter structure representation may be printed, stored, or transmitted to another location. A server device that is coupled and working in conjunction with a client device may implement the present invention. | 2014-04-10 |
20140101176 | BLENDED MATCH MODE DFA SCANNING - Disclosed is a method for simultaneously finding matches for rules that require greedy matching and comprehensive matching by executing a single Deterministic Finite Automaton (DFA). DFAs annotations are used to enable a single DFA to represent rules that require greedy and comprehensive matching. DFA descents are performed from various positions in an input stream, match information is recorded and match results are selectively generated (filtered) to achieve the greedy or comprehensive match behavior required by individual rules. | 2014-04-10 |
20140101177 | IN-MEMORY DATA PROFILING - In an example embodiment, a method of performing data profiling in an in-memory database is provided. A command requesting a data attribute calculation on data in the in-memory database may be received. The data attribute calculation may then be performed on the data in the in-memory database by utilizing a precreated procedure in the in-memory database, the precreated procedure described in a computer language utilized by the in-memory database. Finally, a result of the performing of the data attribute calculation may be returned to the client computer. | 2014-04-10 |
20140101178 | PROGRESSIVE ANALYSIS FOR BIG DATA - According to one general aspect, a method may include receiving a data query request that includes one or more search parameters to be searched for within a plurality of files that are stored according to a hierarchical organizational structure, wherein each file includes at least one data record. The method may include scanning a plurality of files to determine if one or more files match a sub portion of the search parameters. The method may further include parsing the candidate files to determine which, if any, records included by the respective candidate files meet the search parameters. The method may include generating, by one or more result analyzers, query results from the resultant data. The method may also include streaming, to the user device, the query results as at least one query result becomes available and to start streaming before the query requests have been fully generated. | 2014-04-10 |
20140101179 | Mapping Infrastructure Layout Between Non-Corresponding Datasets - A system or computer usable program product for mapping infrastructure layout between non-corresponding datasets including accessing from a memory a set of long links with points that trace the curvature of a set of linestrings, accessing from the memory a set of short links that are short enough for analytical purposes wherein each short link represents a straight line, and from the set of long links and the set of short links, using a processor to create a set of hybrid links for storage in the memory, each hybrid link corresponding to one short link for analytic purposes, a plurality of the hybrid links including at least one of the points for tracing the curvature of the set of linestrings. | 2014-04-10 |
20140101180 | Mapping Infrastructure Layout Between Non-Corresponding Datasets - A method for mapping infrastructure layout between non-corresponding datasets including accessing from a memory a set of long links with points that trace the curvature of a set of linestrings, accessing from the memory a set of short links that are short enough for analytical purposes wherein each short link represents a straight line, and from the set of long links and the set of short links, using a processor to create a set of hybrid links for storage in the memory, each hybrid link corresponding to one short link for analytic purposes, a plurality of the hybrid links including at least one of the points for tracing the curvature of the set of linestrings. | 2014-04-10 |
20140101181 | METHOD AND SYSTEM FOR AUTOMATING THE EDITING OF COMPUTER FILES - The present invention is a method and system for automating repetitive user actions during the text editing operations of various computer files. Computer users may commonly perform some repetitive or patterned actions while editing text files such as scripts, or editing markup files like HTML or XML, or editing source code or even regular text files that contain tabular data or lists. The method and system of the present invention determines a pattern transformation, then applies it to any part of the text that matches a “Pattern”. The method thus develops an algorithm that makes the transformation from “Pattern 1” to “Pattern 2”, and formalizes it, by developing a finite-state machine. The pattern transformation is applied to any part of the text that matches “Pattern 1”, and after this transformation has been applied, then the new text will match the user's intentions. | 2014-04-10 |
20140101182 | DIGITAL PUBLISHING PLATFORM - The present subject matter relates in general to system and method of content management and content life cycle management on a digital publishing platform. More specifically, the present subject matter relates to methods and systems for publishing, collaborating, distributing, managing, and subscribing digital contents and rights using a content-centric approach. Some such embodiments include receiving an electronic data item including at least one content item and based on a type of the electronic data item, identifying in a configuration-setting repository, a normalized data type for which the electronic data item is to be stored in. The electronic data item may then be transformed to the identified normalized form. Such embodiments may further extract content items from the electronic data item and performing a semantic analysis on each extracted content item to generate metadata descriptive of each respective content item. The extracted content items and metadata may then be stored. | 2014-04-10 |
20140101183 | ELECTRONIC PUBLICATION SYSTEM - A system and method for modifying publication data in a publication system are described. An example embodiment includes receiving proposed publication data and accessing a success measurement associated with past publications within a publication system. The success measurement may indicate a measurement of success associated with the past publications. An example system and method may generate modification data to be used to modify the proposed publication data. The modification data may be based on the success measurement and proposed publication data. | 2014-04-10 |
20140101184 | FILE SYSTEM ADAPTED FOR USE WITH A DISPERSED DATA STORAGE NETWORK - A computer a network interface and a central processing unit. The network interface communicates with a network. The central processing unit (CPU) is operable to receive a networked file system access request packet and to identify a root directory based on the networked file system access request packet. The CPU then identifies a file directory based on the root directory and the networked file system access request packet. The CPU then identifies file object metadata based on the file directory and identifies a set of slice servers based on the file object metadata and the networked file system access request packet. The CPU then issues, via the network interface, a set of commands to a set of slice servers regarding the networked file system access request packet. | 2014-04-10 |
20140101185 | START POINTER TRACKING IN NFAs - In a hardware engine, finding rule matches within an input stream by executing a Nondeterministic Finite Automaton (NFA) with active states tracked in parallel cells, a Start Pointer (SP) is captured by the cell beginning a match and passed from cell to cell until the match completes, when it is reported by the cell ending the match. For multiple overlapping matches, different cells may hold different SPs, and a cell representing multiple NFA states may hold multiple SPs. Methods are given to select one SP when multiple SPs collide in the same state. | 2014-04-10 |
20140101186 | METHODS AND SYSTEMS FOR IDENTIFYING SIMILAR SCHOOLS - Method, apparatus, and a computer-readable storage device for determining similarities. A plurality of sets having social network service members as entities is constructed by associating each of the social network service members with each of a predetermined selection of professional outcomes by school of graduation of the member. One of the plurality of sets is selected. A similarity algorithm calculates the similarity score of at least some of the plurality of sets in the plurality of sets to the selected one of the plurality of sets, and presents for rendering the k sets in the plurality of sets with the highest similarity scores. The similarity algorithm used may be a cosine similarity algorithm using the sets as vectors. | 2014-04-10 |
20140101187 | USING A TUNABLE FINITE AUTOMATON FOR REGULAR EXPRESSION MATCHING - Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA. Different from an NFA, a TFA guarantees that the number of concurrent active states is bounded by a bound factor b that can be tuned during the construction of the TFA according to the needs of the application for speed and storage. A TFA can achieve significant reductions in the number of states and memory space. | 2014-04-10 |
20140101188 | USER INTERFACE OPERATING METHOD AND ELECTRONIC DEVICE WITH THE USER INTERFACE AND PROGRAM PRODUCT STORING PROGRAM FOR OPERATING THE USER INTERFACE - A user interface operating method, an electronic device with the user interface and a program product storing a program for operating the user interface are disclosed. A user interface operating method includes steps of displaying a time image, a multimedia object corresponding to a time point in the time image, and first information of the multimedia object corresponding to the time point on a user interface of an electronic device; triggering a search process if the time image and the multimedia object corresponding to the time point in the time image overlap with each other on the user interface, the search process including searching for, based on the first information, multimedia objects corresponding to other time points in the time image related to the first information; and displaying on the user interface the multimedia objects corresponding to other time points in the time image and found in the search process. | 2014-04-10 |
20140101189 | USING CALENDAR EVENTS TO MODIFY NOTIFICATION AND ALERT BEHAVIOR, SYSTEM AND METHOD - A system configured to receive and modify notifications based on calendar events and user-defined rules. The system includes a server that implements a calendar event modification module. The module performs a method that includes receiving search criteria associated with an action. The action instructs the server to either ignore notifications intended for a user device, or modify such notifications before forwarding them to the user device. The action is performed when a notification intended for the user device is received while any calendar events that satisfy the search criteria are occurring. | 2014-04-10 |
20140101190 | NON-TRANSITORY COMPUTER-READABLE RECORDING MEDIUM HAVING RECORDED BROWSER PROGRAM THEREON - 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. | 2014-04-10 |
20140101191 | Performing a Search for a document - A system for performing a search for a document in a collection of documents ( | 2014-04-10 |
20140101192 | RELATIONSHIP-BASED SEARCH AND RECOMMENDATIONS - Techniques are described for determining relationships between user activities and determining search results and content recommendations based on the relationships. A plays-related-to-searches application may determine a relationship score between plays of a media title and searches of a query by determining a distance between a projection of the search onto the space of the users and a projection of plays of the media title onto the space of the users. A plays-after-searches application may determine a score for plays of the streaming media title given the search by multiplying a number of times plays of the media title occur after the query is entered by the number of times any play occurs, and dividing by a product of the number of times plays of the media title occur after any query is entered and the number of times plays of any media title occur after the query is entered. | 2014-04-10 |
20140101193 | GENERATING SNIPPETS FOR PROMINENT USERS FOR INFORMATION RETRIEVAL QUERIES - Implementations include receiving trigger query data, the trigger query data identifying one or more trigger queries and one or more sets of authoritative users, each set of authoritative users being associated with a respective trigger query, providing a plurality of trigger query and authoritative user pairs, each trigger query and authoritative user pair identifying a trigger query and an authoritative user from a set of authoritative users associated with the trigger query, for each trigger query and authoritative user pair: generating a snippet based on user data, the user data being associated with the authoritative user in one or more computer-implemented services, each snippet being specific to the trigger query and specific to the authoritative user, and storing one or more snippets in computer-readable memory, each snippet being associated with the trigger query and the authoritative user for which the snippet was generated. | 2014-04-10 |
20140101194 | SEARCHABLE WEB WHOIS - Systems and methods for searching domain names and owner information associated with the domain names in a web-based Whols search tool. Systems including one or more databases and one or more text indexes may store data including the domain names and owner information, and index text-searchable portions of the data. A search request may be received from a user with user preferences such as a selection of multiple or all top level domains. Search results may be ranked by relevancy, and may include the domain name with associated owner information. | 2014-04-10 |
20140101195 | INCREMENTAL VISUAL QUERY PROCESSING WITH HOLISTIC FEATURE FEEDBACK - To reduce communication costs and computational complexity, only a subset of ranked SIFT points within a query image for a visual search request is transmitted to the visual search server in each iteration of an incremental search. For each candidate match, a flag identifying the matching points is returned by the server for use in computing holistic (e.g., histogram) information for a bounding box within the query image including the matching points. Distance from that query image holistic information is used to reject images from a short list used for a subsequent iteration, if any. If all images are rejected or a match criteria is met during one iteration, the search may terminate early without consideration of remaining SIFT points. | 2014-04-10 |
20140101196 | INFORMATION DELIVERY USING QUERIES AND CHANGEABLE DATABASE CONTAINING QUERIES, ADVISORY INFORMATION, AND FLOW LOGIC - A data storage system may contain a changeable database that includes: advisory information that includes the content of at least one advisory statement for addressing an issue with equipment; query information that includes the content of at least one query delivered to the equipment; and flow logic information indicating a sequence for the delivery of the advisory statements and the queries based on the equipment's responses to the queries. An information delivery engine may deliver the queries and the advisory statements to the equipment in a sequence based on the equipment's answers to the queries and the flow logic information. This system may be adapted to troubleshoot equipment, such as an optical network terminal. | 2014-04-10 |
20140101197 | User Engagement In a Social Network Using Indications of Acknowledgement - A method and system for enhancing and incentivizing user engagement with indications of acknowledgement at a social network is described. An acknowledgement application receives indications of acknowledgement associated with at least one information item from a first user and at least one second user at a social network. The acknowledgement application aggregates and processes the indications of acknowledgement. The acknowledgement application provides at least one result from the processing in response to hovering over an option for the indications of acknowledgement associated with the at least one information item. The acknowledgement application rewards the first user at least one numerical point based on indications of acknowledgement associated with the at least one specific topic and provides at least one badge of achievement to the first user on accumulating at least one threshold of a total number of points. | 2014-04-10 |
20140101198 | CLOUD-BASED SKIP TRACING APPLICATION - A method executed at least in part in a computing device for providing cloud based skip tracing is provided. The method includes providing a cloud based service enabling data interchange with a plurality of vendors providing skip tracing services and receiving at the cloud based service and from a user a file of records for skip tracing. The method further includes applying a waterfall process to the records using the computing device wherein the waterfall process includes at least a subset of the plurality of vendors and returning to the user a results file containing skip tracing results corresponding to the records. The method may further include generating a waterfall score card and sending the waterfall score card to the user, the waterfall score card summarizing performance of the subset of the plurality of vendors. | 2014-04-10 |
20140101199 | REST AND ODATA OBJECT NAVIGATION - According to some embodiments, a method and apparatus are provided to receive a request for a REST or OData object at an input field and suggest a file associated with the REST or OData object. | 2014-04-10 |
20140101200 | Metric Gathering and Reporting System for Identifying Database Performance and Throughput Problems - A database back end system includes a monitoring server operable to poll a first database for a first query running on the first database and add the first query to a query list in a second database, and a reporting server operable to normalize the first query, analyze the second database to find a second query in the query list, wherein the second query is found based upon the normalized first query, and report the second query to a user, wherein the reporting is based upon the analyzing of the second database to find the second query. | 2014-04-10 |
20140101201 | DISTRIBUTED DATA WAREHOUSE - Methods and data structures are provided for allowing data mining with improved efficiency. During processing of a usage log (or multiple logs) for an activity, such as a usage logfile of network search activity, a common fact table is generated. The common fact table allows a plurality of auxiliary data structures to be formed from the common fact table. These auxiliary data structures are designed to allow users to submit queries against the contents of the data structure in order to investigate the data. The efficiency of access of the common fact table is improved by allowing users to access auxiliary data structures other than the auxiliary data structures that are associated with a user. Optionally, the common fact table and/or the auxiliary data structures can include dimension values that correspond to both pre-identified dimension values as well as dimension values that are identified during processing of the activity logfiles. | 2014-04-10 |
20140101202 | File Access Using Counter Locking Mechanism - In an embodiment, a method is provided for accessing a file node. In this method, a file access request specifying a file node to be accessed by way of a file system is received at a server from a client device. A counter is referenced to identify that the file node is being accessed in response to a different file access request. The counter is configured to track whether the file node is being accessed. The file node is provided to the client device when the counter indicates a termination of access to the file node resulting from the different file access request. | 2014-04-10 |
20140101203 | ENFORCING POLICIES OVER LINKED XML RESOURCES - A system and method generate an ontology of linked resources. The method includes providing a policy comprising at least one logical rule which is to hold across an ontology of linked resources and initializing a set of resources with an initial subset of the set of resources, each resource in the initial subset being identified by a respective link. Each of the resources in the subset is processed, which includes populating the ontology with a corresponding member of a resource class, for a resource that is valid against a schema, asserting the member's class as a class specific to the schema of the validated resource in the ontology and providing a dependency specification for extracting links within the resource, each extracted link identifying one of the set of resources. A link property is asserted in the ontology for a link between the resource of the subset containing an extracted link and the resource identified by the extracted link and the ontology populated with a member of the resource class for each newly identified resource. A verification that the at least one logical rule holds across the set of resources in the ontology is performed. | 2014-04-10 |
20140101204 | METHOD AND SYSTEM FOR PROVIDING A CLARITY GRADE FOR A GEM - A method and system for generating a clarity grading look-up table includes collecting actual inclusion parameter data for a plurality of gems, where the actual inclusion parameter data includes an actual clarity grade and an actual inclusion parameter data combination. A mathematical relationship between a clarity grade and a particular inclusion parameter combination is then extrapolated from the actual inclusion parameter data. A derived clarity grade is then assigned to a plurality of inclusion parameter combinations as a function of the mathematical relationship and a set of inputted inclusion parameters. Also, a method and system for providing a clarity grade includes receiving a plurality of inclusion characteristics associated with a gem and parameterizing each of the inclusion characteristics, so that a parameter value is assigned to each inclusion characteristic. The parameter values are then input to a mathematical formula so as to provide a parameterized clarity grade for the gem. | 2014-04-10 |
20140101205 | Efficient Pushdown Of Joins In A Heterogeneous Database System Involving A Large-Scale Low-Power Cluster - A system and method for allocating join processing between and RDBMS and an assisting cluster. In one embodiment, the method estimates a cost of performing the join completely in the RDBMS and the cost of performing the join with the assistance of a cluster coupled to the RDBMS. The cost of performing the join with the assistance of the cluster includes estimating a cost of a broadcast join or a partition join depending on the sizes of the tables. Additional costs are incurred when there is a blocking operation, which prevents the cluster from being able to process portions of the join. The RDBMS also maintains transactional consistency when the cluster performs some or all of the join processing. | 2014-04-10 |
20140101206 | METHODS AND SYSTEMS FOR AGNOSTIC DATA STORAGE - Methods and systems of agnostic data storage are provided. The agnostic data storage systems and methods store data records of various data types from different data sources. The method stores IDs and data elements of data records in different data tables. IDs of data records are stored in a first table, and data elements of data records are stored in a second table. Data entries of the second table are linked to an entry in the first table. The second table stores data element name, data element value, and data element data type respectively. | 2014-04-10 |
20140101207 | System and Method for Storing a Dataset of Image Tiles - System and method for storing a dataset of image tiles. Method includes determining a number of zoom levels, accessing a cluster file that includes a subset of the zoom levels, and accessing the image tiles. For each of the image tiles, a cluster name is computed. For each of the image tiles, if the cluster file has a name that matches the computed cluster name, an image tile pointer is stored in a fixed length index, and the image tile associated with the computed cluster name is stored. For each of the image tiles, if the cluster file name does not match the computed cluster name, another subset of the zoom levels is computed, a new cluster file is created, an image tile pointer is created and stored, and the image tile is stored associated with the computed cluster name in the new cluster file according to the image tile pointer. | 2014-04-10 |
20140101208 | KEYWORD-BASED USER INTERFACE IN ELECTRONIC DEVICE - A method for providing a user interface (UI) in an electronic device includes determining at least a starting keyword from a given target database, and associating each said starting keyword with a function of the electronic device; determining at least a linking keyword from a user profile database; creating a keyword tree from the at least a starting keyword and the at least a linking keyword, wherein the keyword tree has at least two layers, and the at least a linking keyword is placed in an upper layer relative to the at least a starting keyword; and providing the keyword tree on the electronic device for a user to browse and thereby select at least a said starting keyword by at least a said linking keyword on the keyword tree, thus starting the function. | 2014-04-10 |
20140101209 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR CONDITIONALLY PERFORMING GARBAGE COLLECTION - In accordance with embodiments, there are provided mechanisms and methods for conditionally performing garbage collection. These mechanisms and methods for conditionally performing garbage collection can enable reduced application delay, improved data management efficiency, enhanced customer response, etc. | 2014-04-10 |
20140101210 | IMAGE PROCESSING APPARATUS CAPABLE OF EASILY SETTING FILES THAT CAN BE STORED, METHOD OF CONTROLLING THE SAME, AND STORAGE MEDIUM - An image processing apparatus capable of easily setting files permitted to be stored and also enables editing of the files which are stored. A HDD is capable of storing files. A document management section manages basic extensions each indicative of a type of a file permitted to be stored in the HDD and associated extensions each indicative of a type of a file associated with a file permitted to be stored in the HDD, in association with each other. The document management section permits a file associated with a file of which a type is indicated by a basic type information item managed by the management unit and which is open to be stored in the HDD. | 2014-04-10 |