51st week of 2012 patent applcation highlights part 63 |
Patent application number | Title | Published |
20120323901 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND RECORDING MEDIUM THAT HAS RECORDED INFORMATION PROCESSING PROGRAM - When a search keyword is characteristically used in an image, it is detected more easily. An image search device | 2012-12-20 |
20120323902 | MOBILE TERMINAL AND FILE BROWSING METHOD IMPLEMENTED BY MOBILE TERMINAL - A mobile terminal and a file browsing method implemented by the mobile terminal are disclosed, including: a scanning module scans the files in the mobile terminal and acquires related information of each file in the mobile terminal; an indexing module creates a global index list according to the related information of the files; and a browsing module classifies and displays the files according to the file types in the global index list while searching a target file. According to the technical solution, the target file can be quickly and conveniently found from the mobile terminal. | 2012-12-20 |
20120323903 | Multimedia Aggregation in an Online Social Network - In particular embodiments, a search request is received at a social network. A search may be performed to find any matching users whose associated content matches one or more terms in the search request. The search may be performed in a data store of social networking content associated with users of the social network. Matching users having matching associated content may be determined from the search results. Associated content information for at least one matching user may be retrieved. Information to display a web page may be sent in response to the search request. The information to display the web page may comprise profile information and the associated content information for the matching users. | 2012-12-20 |
20120323904 | AUTOMATIC GENERATION OF A SEARCH QUERY - A method, computer-readable medium, and system for automatic generation of a search query are disclosed. A semantic key may be automatically recognized in a first search query, thereby allowing a second search query to be automatically generated based on the first search query. A first search may be performed using the second search query. Search results generated responsive to the first search may include one or more instances of at least one semantic sub-key associated with the semantic key. In this manner, more relevant search results may be returned while relieving the user of manually entering the semantic key separately from the search query keywords and/or demarcating the semantic key and the search query keywords. | 2012-12-20 |
20120323905 | RANKING DATA UTILIZING ATTRIBUTES ASSOCIATED WITH SEMANTIC SUB-KEYS - A method, computer-readable medium, and system for ranking data are disclosed. Where a semantic key is associated with a search query, a plurality of semantic sub-keys associated with the semantic key may be determined. Each semantic sub-key of the plurality of semantic sub-keys may be associated with at least one respective attribute. At least one semantic sub-key of the plurality of semantic sub-keys may be determined, where the at least one semantic sub-key is associated with an attribute matching a portion of the search query. At least one document associated with the at least one semantic sub-key may be ranked above at least one other document associated with at least one other semantic sub-key of the plurality of semantic sub-keys. As such, ranking of documents associated with search results may be improved by utilizing attributes of semantic sub-keys. | 2012-12-20 |
20120323906 | LEXICAL ANSWER TYPE CONFIDENCE ESTIMATION AND APPLICATION - A system, method and computer program product for automatically estimating the confidence of a detected LAT to provide a more accurate overall score for an obtained candidate answer. A confidence “score” or value of each detected LAT is obtained, and the system and method performs combining the confidence score with a degree of match between a LAT and an AnswerType of the candidate answer to provide improved overall score for the candidate answer. | 2012-12-20 |
20120323907 | WEB SEARCHING - A human or hand-labeled ranking of URL results for a search query is compared against actual click data for the respective query/URL pairs (e.g., which URLs were actually clicked on by users when the URLs were presented to users when the search query was run in the real world). The human ranking or ordering of the URL results (e.g., pre-existing relevance ranking) for the query can then be adjusted, if necessary, based upon the real world click data (e.g., click relevance ranking). The modified pre-existing relevance ranking can be used in providing future search results. | 2012-12-20 |
20120323908 | RANKING SEARCH RESULTS BASED UPON CONTENT CREATION TRENDS - Embodiments of the present invention provide a method, system and computer program product for ranking search results based upon content creation trends. In an embodiment of the invention, a method for ranking search results based upon content creation trends includes first receiving a set of results from a search engine produced in response to a search engine query of one or more search terms. The method additionally includes ranking the results of the result set according to at least one ranking factor. The method yet further includes retrieving trend data for terms associated with either or both of the results and/or the search terms. Finally, the method includes weighting the ranked results in the result set according to the retrieved trend data. | 2012-12-20 |
20120323909 | QUERY-BASED USER GROUPS IN SOCIAL NETWORKS - Implementations of the present disclosure include obtaining one or more queries, processing data stored in a data store based on at least one query of the one or more queries to identify a plurality of users, the plurality of users sharing a commonality that is a subject of the at least one query, generating one or more query-based social circles, the plurality of users populating a query-based social circle of the one or more query-based social circles, the query-based social circle being directed to the commonality and defining a distribution list for distributing digital content provided by one or more users of the plurality of users, and transmitting social circle data corresponding to the query-based social circle to display a representation of the query-based social circle to at least one user of the plurality of users. | 2012-12-20 |
20120323910 | IDENTIFYING INFORMATION OF INTEREST BASED ON USER PREFERENCES - Techniques for calculating a ranking of at least one item in a plurality of items. The techniques include receiving user preferences comprising a plurality of first-order user preferences indicative of a user's preferences for items in the plurality of items, and at least one second-order user preference indicative of the user's preferences among first-order user preferences in the plurality of first-order user preferences; calculating, with at least one processor, a ranking of the at least one item in the plurality of items based, at least in part on, at least one data structure encoding a preference graph that represents the received user preferences; and identifying and outputting at least a subset of the plurality of items to a user, in accordance with the ranking. | 2012-12-20 |
20120323911 | METHOD AND SYSTEM FOR TAGGING PLANTS USING A SOCIAL NETWORKING SYSTEM - A method and system are disclosed for tagging plants using a social networking system. The method includes receiving and storing a database, said database comprising a plurality of plant types, each plant type associated with a geographical location, said database further comprising user-based information. One social networking function is provided via a user interface for users of a computer-based service, said computer-based service accessible to users over a network that provides, to the user, the information stored in the database. A plurality of selectable plant types is provided, in response to a request by a user, whereby the user may select a plant type and tag a location within the associated geographical location associated with the selected plant. | 2012-12-20 |
20120323912 | Collaborative, Incremental Specification Of Identities - Methods and systems for collaborative, incremental specification of identities are provided. Users of an information processing system collaborate to define and refine identities of entities, and users can create references for those identities. Relationships among the identifiers imply related keywords that can be used to improve search, navigation, and integration. Relationship factoring can be used to maintain efficient logical and physical representations. | 2012-12-20 |
20120323913 | SELECTIVE LOGGING BASED ON SET PARAMETER - Logging for a transaction is coordinated when provided by applications implemented on multiple nodes. An indicator is set, prior to activity occurring related to a transaction, to log information for a transaction based on specified criteria. A first application implemented on a first node generates, based on the set indicator, a first detailed log for activity occurring related to the transaction. A transaction identifier and the indicator are passed to a downstream second application implemented on a second node. A second detailed log for activity occurring related to the transaction is generated by the downstream second application based on the set indicator. The first detailed log is correlated with the second detailed log. | 2012-12-20 |
20120323914 | STORING AND RETRIEVING ASSOCIATED INFORMATION WITH A DIGITAL IMAGE - A method and apparatus for processing metadata of an image are disclosed. The metadata is associated with the image and an applet views the metadata in response to selection of the image. The metadata may include links to websites, audio files, video files, and text files, as well as image capture information including GPS location, time and date of capture, camera settings, etc. In response to selection of the image, or in response to arriving at a website pointed to by a URL in the metadata, a list of information materials associated with the image may be displayed. One or more of the information materials may be automatically activated. | 2012-12-20 |
20120323915 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND PROGRAM - There is provided an information processing device including a display control unit configured to display pieces of content at a first position of a screen, a condition setting unit configured to set a clustering condition for the pieces of content in accordance with a user operation, and a clustering unit configured to classify the pieces of content into a cluster in accordance with the clustering condition. The display control unit moves a display of the pieces of content from the first position toward a second position corresponding to the cluster. | 2012-12-20 |
20120323916 | METHOD AND SYSTEM FOR DOCUMENT CLUSTERING - A method and system for document clustering. The method includes: extracting text feature information of the documents, establish a social network based on information related with the documents, performing graph clustering based on the social network to obtain structural sub-set, extracting structural feature information of the structural sub-set, and performing clustering on the documents based on the text feature information and the structural feature information. | 2012-12-20 |
20120323917 | NAVIGATING MEDIA CONTENT BY GROUPS - Grouping media files via playlists on a computer-readable medium. One or more media files are selected according to a grouping criterion to define one or more playlists from the media files. A container group is associated with the playlists and stores values identifying each of the playlists associated with the container group along with references to each of the playlists. | 2012-12-20 |
20120323918 | METHOD AND SYSTEM FOR DOCUMENT CLUSTERING - A method and system for document clustering. The method includes: extracting text feature information of the documents, establish a social network based on information related with the documents, performing graph clustering based on the social network to obtain structural sub-set, extracting structural feature information of the structural sub-set, and performing clustering on the documents based on the text feature information and the structural feature information. | 2012-12-20 |
20120323919 | DISTRIBUTED REVERSE SEMANTIC INDEX - Embodiments of the invention relate to building a distributed reverse semantic index. In one general embodiment a plurality of documents are received with each document having at least one defined rule and or semantic. The documents are distributed among a plurality of nodes of a system. The documents are processed in a generally parallel fashion. Processing the documents includes processing text data of each of the document and breaking each document into fields to index the text data to create index data by deferring how to categorize the text data based upon the defined rule and or semantics. The indexed data is combined back together to create an indexer-agnostic semantic index including a plurality of the semantic index shards and to semantically classify the documents based on the index shards into groups based on document type to create the distributed reverse semantic index. | 2012-12-20 |
20120323920 | CREATING A SEMANTICALLY AGGREGATED INDEX IN AN INDEXER-AGNOSTIC INDEX BUILDING SYSTEM - A method for creating a semantically aggregated index in an indexer-agnostic index building system includes: extracting documents from a data source, each document including a data object; distributing the documents to a plurality of processing nodes within the system; for each node: indexing the data objects for each document into fields using semantic rules; and grouping indexed data objects for related fields by: classifying the documents into logical groups based on the semantic rules; and creating a searchable index shard for related logical groups. | 2012-12-20 |
20120323921 | DICTIONARY FOR HIERARCHICAL ATTRIBUTES FROM CATALOG ITEMS - A plurality of items included in a catalog may be obtained, each item associated with an item category. Brand indicators may be obtained, each brand indicator associated with the item category. Brand indicators associated with each of the items may be determined, and the each item may be assigned to a partition group associated with the brand indicator that is associated with the each item. Correlated string tokens that are correlated, greater than a predetermined correlation threshold value, with the brand indicator associated with the partition group that is associated with the each one of the items, the correlated string tokens associated with the each one of the plurality of items, may be determined. A dictionary hierarchy may be generated based on the one or more correlated string tokens. | 2012-12-20 |
20120323922 | DATA ELEMENT CATEGORIZATION IN A SERVICE-ORIENTED ARCHITECTURE - An approach is presented for specifying categories of data elements during a service specification phase of a service-oriented architecture (SOA) life cycle defined in a service modeling methodology like Service-Oriented Modeling and Architecture (SOMA). A Unified Modeling Language based SOA modeling tool for the service modeling methodology includes a middleware based integration plug-in that categorizes service-specific data elements as transaction elements, glue elements, core Common Information Model (CIM) elements, and elements extending the CIM elements, and associates the categorized data elements with corresponding operations of the service being modeled. | 2012-12-20 |
20120323923 | Sorting Data in Limited Memory - A system for sorting tables comprises an interface operable to receive a first segment of an index column and a first segment of a key column from an on-disk database (ODDB), wherein a value in the index column represents a row of information in the ODDB and a value in the key column represents data to be sorted and each index value is associated with a key value, and wherein the ODDB is operable to store the sorted index values and key values in the first segments, a processor communicatively coupled to the interface, the processor is operable to sort the index values in the first segment and key values in the first segment by the key values according to sorting criteria, remove the sorted index values and key values in the first segments from an in-memory database in a sorting module, and the interface is operable to receive a second segment of the index column and a second segment of the key column from the ODDB. | 2012-12-20 |
20120323924 | METHOD AND SYSTEM FOR A MULTIPLE DATABASE REPOSITORY - Method, system, and programs for creating partitioned or fragmented log files during data logging to better manage file size, more easily facilitate data retrieval and file optimization. In an embodiment, typically large monolithic log files are fragmented or divided into smaller files that can be searched, stored, vacuumed and retrieved more easily. | 2012-12-20 |
20120323925 | System and Method for Synchronously Generating An Index to a Media Stream - A computer-implemented system and method for generating an index to a captured media stream. The system includes an output device configured to play a media stream. The system further includes an automatic tagging system for generating at least one auto tag based on the content of the received media stream, the auto tag associated with a portion of the received media stream and a user driven tagging system for generating at least one user tag based on a command received from a user, the user tag associated with a portion of the received media stream being provided at the time the command is received. The system yet further includes a non-transitory storage medium for capturing the received media stream in a media data file associated with a media index file, the media index file including the at least one auto tag and the at least one user tag. | 2012-12-20 |
20120323926 | Efficient Optimization over Uncertain Data - The subject disclosure is directed towards using fingerprints, comprising lists of simulation results corresponding to partial (random sampled) simulation results, to determine whether a full simulation may be avoided by reusing simulation results from a previous full simulation. Before running a full simulation, a current fingerprint is obtained via a partial simulation. If a previous fingerprint matches (is identical or similar to) the current fingerprint, the associated previous results are reused. Also described is indexing fingerprint data to facilitate efficient lookup-based fingerprint matching. | 2012-12-20 |
20120323927 | Method and System for Inverted Indexing of a Dataset - Methods and systems for providing an inverted index for a dataset are disclosed. The inverted index includes a position vector, with fields that correspond to values in the indexed dataset. The fields include data to be used in determining where each value appears in the dataset. The position vector is populated differently for different value types. A 1:1 value appears once in the dataset; a 1:n value appears multiple times. For a 1:1 value, the position vector stores information for where that value appears. For a 1:n value, the position vector stores a pointer, e.g. a memory reference, that identifies a list of locations where the value appears. The list can be encoded or otherwise compressed. A set of indicators can be stored for the fields indicating whether the field has 1:n or 1:1 value information. The indicator is used to control interpretation of the information in a field. | 2012-12-20 |
20120323928 | AUTOMATED GENERATION OF SUGGESTIONS FOR PERSONALIZED REACTIONS IN A SOCIAL NETWORK - A system and method for automatic generating suggestions for personalized reactions or messages. A suggestion generation module includes a plurality of collector modules, a credentials module, a suggestion analyzer module, a user interface module and a decision tree. The plurality of collector modules are coupled to respective systems to collect information accessible by the user and important to the user from other systems such as e-mail systems, SMS/MMS systems, micro blogging systems, social networks or other systems. The information from these collector modules is provided to the suggestion analyzer module. The suggestion analyzer module cooperates with the user interface module and the decision tree to generate suggested reactions or messages for the user to send. The suggested reactions or messages are presented by the user interface module to the user. The user interface module also displays the original message, other information about the original message such as others' responses, and action buttons for sending, discarding or ignoring the suggested message. | 2012-12-20 |
20120323929 | COMPRESSION AWARE PHYSICAL DATABASE DESIGN - A plurality of indicators representing a plurality of respective candidate database configurations may be obtained, each of the candidate database configurations including a plurality of database queries and a plurality of candidate database indexes associated with a database table. A portion of the candidate database indexes included in the plurality of database indexes may be selected based on skyline selection. An enumeration of the portion of the plurality of the candidate database indexes may be determined based on a greedy algorithm. | 2012-12-20 |
20120323930 | TEXT SUGGESTIONS FOR IMAGES - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving image data corresponding to an image, processing the image data to identify one or more features within the image, generating one or more keywords based on each of the one or more features, transmitting the one or more keywords to a computing device for displaying a list of the one or more keywords to a user, receiving text, the text comprising at least one keyword of the one or more keywords, that at least one keyword having been selected by the user from the list, and transmitting the image and the text for display, the text being associated with the image. | 2012-12-20 |
20120323931 | SPATIAL ATTRIBUTE RANKING VALUE INDEX - A request may be received that includes an indicator associated with a geographic location and scope. A database search may be initiated, based on the geographic location and scope. A list of one or more tags may be received, the tags associated with the geographic location, ordered based on relevance within the geographic scope, based on tag locale rankings associated with each of the tags included in the list of tags, the tag locale rankings based on comparisons of relative frequencies of occurrence of the tags, based on first bounded geographic areas, compared with second relative frequencies of occurrence of the tags based on second bounded geographic areas that are respectively larger than the first bounded geographic areas, the request geographic scope indicating one of a plurality of hierarchical geographic analysis levels associated with a plurality of geographic locations. | 2012-12-20 |
20120323932 | ITERATIVE SET EXPANSION USING SAMPLES - A set expansion system is described herein that uses general-purpose web data to expand a set of seed entities. The system includes a simple yet effective quality metric to measure the expanded set, and includes two iterative thresholding processes to rank candidate entities. The system models web data sources and integrates relevance and coherence measurements to evaluate potential set candidates using an iterative process. The system uses general-purpose web data that is not specific to the given seeds. The system defines quality of the result set as the sum of two component scores: the relevance of a set of entities that measures their similarity with the given seeds, and the coherence of the set of entities produced which is how closely the entities in the set are related to each other. Based on this quality measure, the system develops a class of iterative set expansion processes. | 2012-12-20 |
20120323933 | DISPLAYING NOTIFICATIONS BASED ON IMPORTANCE TO THE USER - Embodiments prioritize notifications relating to received communication items for display to a user of a computing device. For each received communication item, the computing device searches for related user data items such as calendar data, contacts, emails, and the like. Each of the user data items has a priority value. The computing device calculates a priority score for the notification based on the priority values associated with the related user data items. The notification is displayed among other notifications based on the calculated priority score relative to the priority scores of the other notifications. In some embodiments, the notifications include an ordered set of notifications displayed as tiles on a user interface of a mobile computing device. | 2012-12-20 |
20120323934 | Rendering Tape File System Information in a Graphical User Interface - A mechanism is provided for rendering tape file system information. The mechanism obtains a list of one or more files residing on a tape in the tape file system from a file directory. The mechanism obtains location information associated with at least one file of the one or more files. Finally, the mechanism renders a representation of the location information with the at least one file. | 2012-12-20 |
20120323935 | AUTOMATIC SYNCHRONIZATION OF MOST RECENTLY USED DOCUMENT LISTS - A most recently used (MRU) client synchronization engine is provided to synchronize a user's most recently used (MRU) document list associated with a client machine with a file hosting server's MRU document list. The file hosting server's MRU document list contains a list of the user's most recently used documents that are stored on the file hosting server. The user's documents that are stored on the file hosting server are accessible to the user on one or more web-enabled client machines. The MRU client synchronization engine analyzes registry data pertaining to the documents that a user uses on the client machine with the file hosting server's MRU document list to determine the user's most recently used documents. | 2012-12-20 |
20120323936 | COMPUTER-IMPLEMENTED METHOD OF ARRANGING TEXT ITEMS IN A PREDEFINED ORDER - A computer-implemented method of and a device, such as a base station for a headset, for arranging text items in a predefined order, comprising storing, in the memory of a peripheral device, a collection of multiple text items arranged in multiple sets of text items and in multiple groups of text items; storing a respective code item with a respective group of text items; and storing a sort key that has values that designate a predefined order of the text items in each set. The sort key is appended to the text items and comprises at least one character with a value within the Private Use range of the Unicode format. | 2012-12-20 |
20120323937 | BULK CREATE, UPDATE AND DELETE (CUD) DATABASE OPERATIONS FOR TABLE INHERITANCE - Enterprise systems, methods and computer program products are disclosed for providing bulk create (insert), update and delete operations for table inheritance in an enterprise resource system using an object-oriented language supporting polymorphism. The computer implemented method comprises receiving a request for one of a create, update and delete operation with respect to data of first and second tables of an inheritance table hierarchy; creating a temporary table comprising a surrogate key and a record identifier; establishing a filter condition with fields from different tables in table inheritance; and one of creating, updating and deleting data from the different tables in table inheritance according to the filter condition. The process is implemented on an application object server including a compiler for the object-oriented language, a kernel instance and a data access layer. | 2012-12-20 |
20120323938 | MULTI-MEDIA MANAGEMENT AND STREAMING TECHNIQUES IMPLEMENTED OVER A COMPUTER NETWORK - Various aspects described or referenced herein are directed to different methods, systems, and computer program products relating to multi-media management and streaming techniques implemented over a computer network. In one embodiment, a Multi-Media Management and Streaming (MMMS) System may be configured or designed to provide online users with “location based” streaming radio functionality. Users from different geographic locations may access a variety of MMMS System GUIs to search for, create, and/or share customized streaming radio stations which may be configured to identify and play/stream music associated with one or more artists/bands, songs, venues, and/or events. | 2012-12-20 |
20120323939 | MINING DEPENDENCIES FROM DISK IMAGES - Methods and arrangements for automatically finding the dependency of a software product on other software products or components. From an install image or directory, a signature is found by deriving the same from a directory structure of the software. Further, a directory tree structure is built and an approximate sub-tree matching algorithm is applied to find commonalities across software products. | 2012-12-20 |
20120323940 | SELECTION MAPPING BETWEEN FETCHED FILES AND SOURCE FILES - An element in a fetched file (a file received from the web server in response to an HTTP request) can be mapped to the source code that generated it and vice versa. When code is compiled at the web server, calls can be executed that emit HTML that includes metadata that maps a snippet of code back to a particular source file and to a particular location in the source file. The HTML can include injected symbols that specify that the information from a particular start position for a particular character length in the HTML comes from a particular start position to a particular end position in the source file. | 2012-12-20 |
20120323941 | Processing Queries for Event Data in a Foreign Representation - The subject disclosure is directed towards processing a query corresponding to event data in a foreign representation. In order to produce results for the query, an event structure is defined for each requested event type. Information is automatically generated for configuring adapters to identify attribute data associated with the each requested event type and return the attribute data according to the event structure. These adapters search historical event data or real-time event data for the event-related data. | 2012-12-20 |
20120323942 | DYNAMIC APPLICATION NAME DISPLAY - The present invention relates to a method for providing data during an Application Selection process from a processing device to an interface device, wherein it comprises a step of modifying dynamically at least a part of said data from transaction to transaction, said at least part of data being a dynamic data. | 2012-12-20 |
20120323943 | Systems and Methods for Correlating Meta-Data Model Representations and Asset-Logic Model Representations - Systems and methods for correlating meta-data model representations and asset-logic model representations in a system model. The system model may be deployed in conjunction with a production allocation application, whereby data pertaining to allocation changes to a production system might be more readily identified for different purposes such as, for example, technical and/or fiscal allocation. | 2012-12-20 |
20120323944 | MANAGEMENT OF NETWORK-BASED DIGITAL DATA REPOSITORY - Improved techniques and systems for storage, delivery and acquisition of digital assets are disclosed. The techniques and systems are suitable and useful for storing, delivering and accessing digital assets (e.g., media assets) that have been acquired from online stores. The techniques and systems are also suitable and useful for storing, delivering and accessing digital assets that have been acquired from other than from online stores. Regardless, the digital assets become accessible from a network-based digital data repository (e.g., cloud data storage) via electronic devices (e.g., user devices) and thus usable by the electronic devices. The digital assets can include media assets and/or non-media assets. | 2012-12-20 |
20120323945 | SYSTEM AND METHOD FOR READ-AHEAD ENHANCEMENTS - A method and system are provided for identifying type-ahead candidates. A method includes determining a context of past non-threaded emails of a user. The method further includes generating a context index associating the past non-threaded emails of the determined context with repeatable values within the past non-threaded emails. The method further includes receiving characters in a current email and determining a context of the current email. The method further includes determining matches between the current email and the past non-threaded in the context index. The method further includes identifying the corresponding repeatable values and matching the identified corresponding repeatable values with the received characters. The method further includes presenting the candidate words to the user for inclusion in the current email. | 2012-12-20 |
20120323946 | DATA FRAMEWORK TO ENABLE RICH PROCESSING OF DATA FROM ANY ARBITRARY DATA SOURCE - Data is accessed and updated in a data store at a field granularity. A user query specifies one or more non-unique fields of a record. The query is sent to a data store to retrieve the fields of the record at a field granularity, in satisfaction of the query. The fields of the record can also be modified by transmitting a record ID along with original content, while omitting some of the record data, and by also including the modification to be made. | 2012-12-20 |
20120323947 | Enriching Database Query Responses using Data from External Data Sources - The subject disclosure is directed towards enriching database query responses using data from external data sources. When processing a database query seeking enriched data from an external data source, a request is communicated to the external data source based on the database query. An enriched database query response is generated based on data provided by the external data source. The enriched database query response may be combined with data returned via an internal database query operation, and/or inserted into a local database table. | 2012-12-20 |
20120323948 | DIALOG-ENHANCED CONTEXTUAL SEARCH QUERY ANALYSIS - Embodiments of the present invention relate to systems, methods, and computer-storage media for a method of contextually analyzing terms within a search query. In one embodiment, a received search query is classified into a domain category. Additionally, information is assigned to a schema associated with the domain by analyzing the search query. Further, at least one search result that helps a user complete a task within the domain is provided based on the information in the schema. | 2012-12-20 |
20120323949 | AUTOMATED DATA CONVERSION AND ROUTE TRACKING IN DISTRIBUTED DATABASES - A determination is made as to whether a data type associated with a received logical table definition associated with a database query within a distributed database system differs from a data type associated with a local logical table definition. A data conversion is performed on data retrieved from a locally-stored physical table referenced by the local logical table definition in response to determining that the data types differ. Local data conversion information is created identifying the data conversion performed on the retrieved data in response to performing the data conversion. At least one of the retrieved data and the converted data with the created local data conversion information is forwarded to at least one of a distributed database node and an application-level module. | 2012-12-20 |
20120323950 | EMBEDDED QUERY FORMULATION SERVICE - Systems and methods for providing and utilizing a query formulation service are described herein. In accordance with certain embodiments, an application is configured to obtain data from a target data source by interacting with a data service that makes data from a plurality of data sources available, each data source supporting a different method of query formulation. To obtain data from the target data source, the application requests a query formulation user interface (UI) associated with the target data source from a query formulation service and embeds the requested query formulation UI when it is received from the query formulation service. A user of the application then interacts with the embedded query formulation UI to formulate a query that is suitable for obtaining data from the target data source and the application sends the query to the data service for execution against the target data source. | 2012-12-20 |
20120323951 | Method and apparatus for providing contextual based searches - An approach is presented for providing contextual based searches. A contextual query platform processes at least one query to parse one or more terms associated with at least one contextual parameter. The platform further determines one or more values and/or one or more probabilities associated with the one or more values for the at least one contextual parameter based on one or more probabilistic models associated with the at least one contextual parameter. The platform further compares the one or more values and/or the one or more probabilities against at least one threshold criteria. The platform further determines whether to process the at least one query using the one or more values, to generate a recommendation for using the one or more values, to determine one or more alternate values, or a combination thereof based, at least in part, on the comparison. | 2012-12-20 |
20120323952 | PROVIDING EFFECTIVE INTERACTIVE QUERY SUGGESTIONS WITHOUT QUERY LOGS - Methods and arrangements for providing interactive query suggestions. A partial user query phrase is received, the partial query phrase comprising a final word element. A vocabulary is accessed and, from the vocabulary, at least one possible completion of the final word element is ascertained. A phrase index is accessed and, from the phrase index, at least two phrases corresponding to completions of the partial user query phrase with the at least one possible completion of the final word element are ascertained. A probability score is assigned to each of the at least two phrases, and the at least two phrases are ranked based on probability. | 2012-12-20 |
20120323953 | PREDICTIVE SELECTION OF ITEM ATTRIBUTES LIKELY TO BE USEFUL IN REFINING A SEARCH - Systems and methods are described for identifying item attributes that are likely to be useful to users in refining searches for items. In one embodiment, when a user submits a search query to search for items, all or a portion of the search query is used to look-up a previously-generated list of item attributes (and optionally associated attribute values) that are associated with the search query and are useful for refining the search. These item attributes, and any associated attribute values, are then presented to the user in a selectable form such that the user can interactively narrow the search. | 2012-12-20 |
20120323954 | SYSTEMS AND METHODS FOR COOPERATIVE DATA EXCHANGE - Various systems and methods for financial analysis are provided. A system is provided comprising a first node comprising a public facing data store in communication with a private facing data store, wherein the first node further comprises a cooperative lookup module configured to locate a second node, a secure data connection between the first node and the second node, and wherein the first node is configured to request processed internal data from the second node. | 2012-12-20 |
20120323955 | RELATIONAL MODELING AND RUNTIME FOR DATE EFFECTIVE ENTITIES - A database application may receive a database query to retrieve a relation with date effective information stored by a relational database, and send a database result having the date effective information. The database application may comprise a data mapping component to retrieve a relation definition for the relation from metadata associated with the relation, the relation definition having a relation variable with a set of attributes including multiple date effective attributes, the relation definition having a definition for an alternate key formed from a composite of a date effective attribute and one other attribute from the set of attributes, and a data access component to generate the relation with the date effective information using the alternate key, the relation having a set of one or more tuples, with each tuple having one or more attribute values for corresponding date effective attributes of the relation. Other embodiments are described and claimed. | 2012-12-20 |
20120323956 | Composable SQL Query Generation - A system and method for facilitating querying one or more data sources. A system provides mechanisms to enable flexible specification of user queries and generation of one or more SQL queries that correspond closely to corresponding user queries. An operator tree and a logical operator tree may be created as intermediate steps to generate the one or more SQL queries. Capabilities of data sources are determined and used to generate remotable SQL queries for composable queries, to reduce an amount of post-processing that is performed on result sets. The system enables user queries that extend beyond those defined by a data model. | 2012-12-20 |
20120323957 | CHAINAGE CALCULATION METHODOLOGY AND SYSTEM - Disclosed embodiments provide a methodology and architecture for calculating the chainage distance using two Positive Train Control (PTC) system messages (e.g., Train Route and Current Position) provided by the PTC system. | 2012-12-20 |
20120323958 | SPECIFICATION OF DATABASE TABLE RELATIONSHIPS FOR CALCULATION - A relationship amongst multiple relationships between database tables can be specified independent of a query. More specifically, a function (USERELATIONSHIP) can be introduced to the DAX language (Data Analysis Expressions), which provides a way to author formulas that are not evaluated immediately, but that can be evaluated dynamically and concurrently in many different contexts. The function enables a single relationship to be specified in the calculation formula away from the query. This provides a mechanism within the formula that specifies specific relationship(s) that are to be followed when the dynamic expression is evaluated. | 2012-12-20 |
20120323959 | MULTIPLE ELECTRONIC IDENTITY RECOGNITION - A method, device and computer program product for multiple identity recognition includes receiving a first communication from a sender addressed to a recipient using a first identity. A determination may be made as to whether the sender has multiple identities, and in response to determining that the sender has multiple identities, information regarding the identities of the sender is retrieved. The identities of the sender may be associated together so that the recipient may be provided an indication that the sender has at least one identity other than the first identity. | 2012-12-20 |
20120323960 | AUTOMATIC CONTACT LIST ALIASING IN A COLLABORATION SYSTEM - In one embodiment, an addition of an identifier to a contact list can be detected. The identifier can identify an entity in a first collaboration system. Data can be searched to find a different identifier that identifies the entity in at least a second collaboration system. The different identifier can be added to the contact list. | 2012-12-20 |
20120323961 | Content transfer - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-12-20 |
20120323962 | SET-LEVEL COMPARISONS IN DYNAMICALLY FORMED GROUPS - Methods are disclosed of processing a set-level query across one or more attributes, the query being grouped by one or more attributes, whereby groups that satisfy the set-level query may be aggregated over one or more attributes. The methods use bitwise arithmetic to efficiently traverse bitmap and bit-slice vectors and indexes of a data relation to determine groups that solve the set-level query. | 2012-12-20 |
20120323963 | SYSTEMS AND METHODS FOR APPLYING SECONDARY INFORMATION TO BUSINESS ADDRESSES - Systems and methods are provided for determining secondary address information. In one implementation, a method is provided that uses a data processing apparatus. According to the method, a code word is created for a business name and a building default extended delivery code. A data table is searched using the code word and secondary address information is revealed when a match is found between the code word and data stored in the data table. | 2012-12-20 |
20120323964 | ARRANGEMENT FOR A DISTRIBUTED FILE SYSTEM HAVING DATA OBJECTS MAPPED INDEPENDENT OF ANY DATA OBJECT ATTRIBUTE - Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file. | 2012-12-20 |
20120323965 | DYNAMIC MENUS FOR MULTI-PREFIX INTERACTIVE MOBILE SEARCHES - The present invention includes systems and methods for retrieving information via a flexible and consistent targeted search model that employs interactive multi-prefix, multi-tier and dynamic menu information retrieval techniques that provide context-specific functionality tailored to particular information channels, as well as to records within or across such channels, and other known state information. Users are presented with a consistent search interface among multiple tiers across and within a large domain of information sources, and need not learn different or special search syntax. A thin-client server-controlled architecture enables users of resource-constrained mobile communications devices to locate targeted information more quickly by entering fewer keystrokes and performing fewer query iterations and web page refreshes, which in turn reduces required network bandwidth. | 2012-12-20 |
20120323966 | STORAGE DEVICE, SERVER DEVICE, STORAGE SYSTEM, DATABASE DEVICE, PROVISION METHOD OF DATA, AND PROGRAM - In a storage device of one embodiment, a record acquisition unit acquires each of records stored in a plurality of database devices as a file containing items contained in the record. The items contained in the file includes first information for specifying a record, second information indicating a degree of newness of the record and third information for specifying a database device storing the record. The file has a file name able to be specified based on the first information. A storage unit stores the file. A receiving unit receives the first information contained in any of the records stored in the plurality of database devices. A retrieval unit retrieves from the storage unit a file specified based on the first information received by the receiving unit. A file transmitting unit transmits the file retrieved by the retrieval unit to the server device. | 2012-12-20 |
20120323967 | Spelling Using a Fuzzy Pattern Search - A multimedia system configured to receive user input in the form of a spelled character sequence is provided. In one implementation, a spell mode is initiated, and a user spells a character sequence. The multimedia system performs spelling recognition and recognizes a sequence of character representations having a possible ambiguity resulting from any user and/or system errors. The sequence of character representations with the possible ambiguity yields multiple search keys. The multimedia system performs a fuzzy pattern search by scoring each target item from a finite dataset of target items based on the multiple search keys. One or more relevant items are ranked and presented to the user for selection, each relevant item being a target item that exceeds a relevancy threshold. The user selects the indented character sequence from the one or more relevant items. | 2012-12-20 |
20120323968 | Learning Discriminative Projections for Text Similarity Measures - A model for mapping the raw text representation of a text object to a vector space is disclosed. A function is defined for computing a similarity score given two output vectors. A loss function is defined for computing an error based on the similarity scores and the labels of pairs of vectors. The parameters of the model are tuned to minimize the loss function. The label of two vectors indicates a degree of similarity of the objects. The label may be a binary number or a real-valued number. The function for computing similarity scores may be a cosine, Jaccard, or differentiable function. The loss function may compare pairs of vectors to their labels. Each element of the output vector is a linear or non-linear function of the terms of an input vector. The text objects may be different types of documents and two different models may be trained concurrently. | 2012-12-20 |
20120323969 | SEARCH FORMULA UPDATE DEVICE, SEARCH FORMULA UPDATE METHOD - Disclosed is a search formula update device capable of updating with high precision a search formula specifying an element of a structured document according to modifications of structure and content. The search formula update device is provided with a partial structure extraction unit for extracting a partial structure from structure information; a partial structure detection unit for detecting, among the extracted partial structures, partial structures constituting the structure of the post-update structured document; a structure reconstitution unit for combining the detected partial structures to reconstitute structure information of the post-update structured document; an objective element estimation unit for estimating an objective element in the post-update structured document on the basis of the detected partial structures and a search formula; and a search formula update unit for using the reconstituted structure information so as to specify the objective element in the post-update structured document to generate a search formula. | 2012-12-20 |
20120323970 | DYNAMIC LOCK-FREE HASH TABLES - A table update component may perform updates on a dynamic linear hash table, the updates requested by clients based on request item values. A table capacity status component may determine first capacity indicators associated with the dynamic linear hash table, based on results of the update requests. A table maintenance component may initiate lock-free merges and lock-free splits of hash table buckets associated with the dynamic linear hash table, based on initiating lock-free merges and lock-free splits of linked lists included in hash table buckets associated with the dynamic linear hash table, based on the determined first capacity indicators, the linked lists including hashed items stored in the dynamic linear hash table. | 2012-12-20 |
20120323971 | OPTIMIZING DATA STORAGE AND ACCESS OF AN IN-MEMORY DATABASE - System, method, computer program product embodiments and combinations and sub-combinations thereof are provided for optimizing data storage and access of an in-memory database in a database management system. Embodiments include utilizing in-memory storage for hosting an entire database, and storing objects of the database individually in separate portions of the in-memory storage, wherein a portion size is based upon an object element size. | 2012-12-20 |
20120323972 | CONCURRENTLY ACCESSED HASH TABLE - A method of resizing a concurrently accessed hash table is disclosed. The method includes acquiring the locks in the hash table. The hash table, in a first state, is dynamically reconfigured in size into a second state. Additionally, the amount of locks is dynamically adjusted based on comparing the size of the hash table in the second state to the size of the hash table in the second state. | 2012-12-20 |
20120323973 | SYSTEM AND METHOD FOR CONVERTING COMPONENT DATA - An application server reads components data from a component information system (CIS) of a database server connected to the application server. The components data are converted to HDL data. If the converted HDL data includes illegal characters, a user is prompted to modify the illegal characters. If the converted HDL data does not include illegal characters, the application server amends formats of the converted HDL data according to requirements of each client connected to the application server. Each client includes a drawing unit. The application server controls the drawing unit to draw circuit diagram using the HDL data with the amended formats. | 2012-12-20 |
20120323974 | METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR DATABASE TABLE AGGREGATION - Database table aggregation is implemented by a method that includes encoding first and second components via a waveform definition, the first and second components specifying criteria for aggregating data. The method also includes generating a complex waveform representing the components in a pattern corresponding to the waveform definition and criteria, which spans a first axis indicative of a time period for aggregating the data. The method further includes providing a byte count for aggregated data stored in a first table defined by the criteria, aggregating the data for the time period, and creating a second table for overflow data when the count is exceeded. The method also includes updating the complex waveform to reflect results of the aggregation that includes generating a waveform representing the second table along a second axis depicted at a location corresponding to a time in which the data aggregation for the first table was initiated. | 2012-12-20 |
20120323975 | PRESENTATION SOFTWARE AUTOMATION SERVICES - Embodiments are disclosed for performing automation services. Automation services are, in embodiments, applications, processes, or systems capable of converting an initial file into a converted file having a different file type from the initial file. In embodiments, a requestor generates a conversion request message. The conversion request message may contain information about the desired conversion, options to be performed during the conversion, and an initial file that is to be converted. The initial file may be represented by a data stream that is part of the request message. The request message is sent to a file converter that performs the desired request on the data stream to create a converted file. | 2012-12-20 |
20120323976 | SYSTEM AND METHOD FOR AUTOMATICALLY ROUTING AND MANAGING STORED DOCUMENTS BASED ON DOCUMENT CONTENT - A system and method for routing and managing documents based on document content comprises obtain a document, determine a classification for the document based on the document content, determine a storage location for the document based on the document classification, determine whether the document is stored in the determined storage location, when the document is stored in the determined storage location, update the document in the determined storage location, when the document is not stored in the determined storage location, determine whether the document is stored in another storage location, when the document is stored in another storage location, add the document in the determined storage location and delete the document from the other storage location, and when the document is not stored in the other storage location, add the document to the determined storage location. | 2012-12-20 |
20120323977 | STORAGE MEDIA ABSTRACTION FOR UNIFORM DATA STORAGE - A storage abstraction system is described herein that exposes storage from an operating system as a uniform storage device and abstracts from applications the selection of a particular storage location and different properties of storage devices. The application provides the data to store and some information about the application's goals for storing the data, and lets the operating system route the data to the right place based on the data's characteristics. The operating system may choose to store data anywhere from L2 cache to a cloud-based storage service and anything in between, based on information about the data's persistence requirements, expected usage, access frequency, security needs, and so forth. The system lets applications and users focus on expressing their goals and needs for the data, and lets the operating system manage the hardware. | 2012-12-20 |
20120323978 | Transforming and Storing Messages in a Database - A system for storing messages in an on-disk database (ODDB), comprises an interface operable to receive a first message comprising first data from an execution venue, wherein the first message is one of a group of associated messages related to a financial transaction, a processor communicatively coupled to the interface, the processor is operable to load the first message into an in-memory database (IMDB), identify a second message in the group of associated messages, transform the second message with the first data from the first message, and determine whether all messages in the associated group of messages have been loaded into the IMDB, and the interface is further operable to transfer the first message to the ODDB. | 2012-12-20 |
20120323979 | GARBAGE COLLECTION BASED ON TOTAL RESOURCE USAGE AND MANAGED OBJECT METRICS - A method includes selectively controlling, at a computing device having a memory, initiation of a full garbage collection operation based on a total resource usage metric and a managed object metric. The managed object metric is based on objects managed by a runtime application. | 2012-12-20 |
20120323980 | FILE SYSTEM LOCATION VERIFICATION USING A SENTINEL - A new file system is mounted to a mount point of an existing file system implemented in a computational system. A sentinel indicator is stored in the mount point. Prior to initiating an input/output (I/O) operation by a program, a determination is made by the program as to whether the sentinel indicator exists. In response to determining by the program that the sentinel indicator exists, the I/O operation is performed by the program. In certain alternative embodiments, in response to determining by the program that the sentinel indicator exists, the I/O operation is not performed by the program. | 2012-12-20 |
20120323981 | PROXY CALCULATION SYSTEM, PROXY CALCULATION METHOD, PROXY CALCULATION REQUESTING APPARATUS, AND PROXY CALCULATION PROGRAM AND RECORDING MEDIUM THEREFOR - A function f(x) is calculated with a calculating apparatus that makes a correct calculation with a low probability. Provided that G and H are cyclic groups, f is a function that maps an element x of the group H into the group G, X | 2012-12-20 |
20120323982 | METHOD AND STRUCTURE FOR PROVABLY FAIR RANDOM NUMBER GENERATOR - A random number generator includes a fairness checker and correction module that ensures that a complete random sequence within a predetermined period of time will be output by the random number generator. | 2012-12-20 |
20120323983 | METHOD AND DEVICE FOR GENERATING A FILTER COEFFICIENT IN REAL TIME - The present invention provides a method and device for generating a filter coefficient in real time. The method includes: looking up a converted window function value in a converted window function table based on a current coefficient index; generating a current cut-off angular frequency; generating a look-up table address based on the current coefficient index, the filter order and the current cut-off angular frequency and looking up a sine value in a sine table based on the look-up table address; and multiplying the converted window function value by the sine value to obtain the filter coefficient. The device includes a first memory, a second memory, a look-up table address generation module and a first multiplier. The present invention is easily implemented with low hardware resource consumption and high flexibility, and is particularly applicable for the hardware implementation of high-order finite impulse response filters. | 2012-12-20 |
20120323984 | LANGUAGE INTEGRATED QUERY OVER VECTOR SPACES - Language-integrated query (LINQ) operators can be extended to a set of vectors associated with a digital signal processing (DSP) environment. A language-integrated query (LINQ) operator can be created to execute a change of basis for a set of vectors. LINQ operators can be further be utilized with specifically generated parameters to perform a change of basis for the set of vectors. Additionally, the standard LINQ operators can be extended to enable querying with LINQ against the set of vectors. | 2012-12-20 |
20120323985 | ALIGNMENT OF MULTIPLE LIQUID CHROMATOGRAPHY-MASS SPECTROMETRY RUNS - The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided. | 2012-12-20 |
20120323986 | System and Method for Providing an Adjunct Device in a Content Delivery Network - A cache server receives content and an instruction indicating an event associated with the content that causes a processor to invoke a call out to an adjunct device. The instruction further indicates an operation that the adjunct device is to perform. The cache server detects the event associated with the content, halts a flow of the content in response to detecting the event associated with the content, passes via the call out the content to the adjunct device to perform the operation, receives from the adjunct device a response and resulting data from the operation, and performs an additional operation on the resulting data based on the response from the adjunct device. | 2012-12-20 |
20120323987 | SHARED NETWORK RESPONSE CACHE - A method is disclosed for reducing network traffic using a shared network response cache. The method intercepts a network request to prevent the network request from entering a data network. The network request is sent by a client and is intended for one or more recipients on the data network. The method checks a shared response cache for an entry matching the network request. The method sends a local response to the client in response to an entry in the shared response cache matching the network request. The local response satisfies the network request based on information from the matching entry in the shared response cache. | 2012-12-20 |
20120323988 | TASK ALLOCATION IN A COMPUTER NETWORK - A method of allocating computing tasks in a communication network comprises providing a server that sends a request with an expiration time over the network to one or more processor computers for an allocation of a processing task to be performed by the server computer. The server computer performs the allocated processing task to completion if it's received within the expiration time and only if a higher priority task is not received before processing is completed. | 2012-12-20 |
20120323989 | DYNAMIC DISTRIBUTION OF TARGET SELECTION ALGORITHMS - Methods of distributing a selection algorithm that selects a target server component from among a plurality of server components having a same functionality type include receiving notifications from the plurality of server components indicating addresses at which the plurality of server components can be contacted, receiving a selection algorithm that is to be used by a client component for selecting the target server component from among the plurality of server components, and associating the selection algorithm with the functionality type. The methods may further include receiving a message from the client component requesting addresses of server components having the functionality type, sending the addresses of the plurality of server components to the client component, and sending the selection algorithm to the client component. | 2012-12-20 |
20120323990 | EFFICIENT STATE RECONCILIATION - The embodiments described herein generally relate to methods and systems for using a token as a bi-directional parameter of a long polling request for state updates. A client polls a server for state updates, in which updates may be the result of a server event. Server state data is hashed to generate a token/hash representing the current state data. The server compares this token/hash to the token/hash received from the client in the polling request. If the tokens differ, the server sends the actual state data with the server token to the client. By using tokens as request parameters, unnecessary state updates are avoided, and client/server synchronization is achieved more quickly by restricting the pushing of data to state updates. Further, the client may force a response to a poll by sending an empty or random/default value for the token request parameter. | 2012-12-20 |
20120323991 | MOBILE SOCIAL INTERACTION - A question associated with a first user may be obtained. A search link may be determined based on content of the first question A response may be obtained. Updates to a content graph may be initiated, including an addition of a question node and a first link indicating asking of the question by the first user, and an addition of a response node and a second link indicating an answer relationship between the question and the response, and a third link indicating answering of the question from a second user, the second user associated with the first user via a friend link indicating a friend connection relationship between nodes associated with the first user and the second user. | 2012-12-20 |
20120323992 | GEOSPATIAL VISUALIZATION PERFORMANCE IMPROVEMENT FOR CONTIGUOUS POLYLINES WITH SIMILAR DYNAMIC CHARACTERISTICS - Techniques are disclosed for rendering geographic information system (GIS) data. A server component responding to a request for GIS data for a given area combines contiguous elements that share the same dynamic characteristics. For example, a map server may combine the polylines of contiguous road segments sharing the same current speed/congestion conditions. Doing so may greatly reduce the number of individual polylines that are sent to a client for rendering. | 2012-12-20 |
20120323993 | DATA PROCESSING DEVICE AND DATA PROCESSING METHOD - A data processing device connected to a client via a network including a Cookie generator which generates a Cookie, a calculator which calculates a secret value using the Cookie generated by the Cookie generator and a hidden key which is a predetermined character string, a screen sender which sends screen data which includes the Cookie generated by the Cookie generator and the secret value calculated by the calculator to the client, a table which stores the Cookie, a request telegraph receiver which receives a request telegraph which includes the Cookie and the secret value from the client, a Cookie verification unit which verifies whether the Cookie stored in the table and a received Cookie which is a Cookie included in the request telegraph, match, and a secret value verification unit which verifies whether a value calculated using the received Cookie and the hidden key matches a secret value included in the request telegraph. | 2012-12-20 |
20120323994 | TRANSPARENT NETWORK SUBSTRATE SYSTEM - A transparent network substrate system including at least one server module and at least one client module. The server module provides a selected functionality, such as moving an actuator, performing a mathematical operation, and receiving data from a sensor. Upon execution the server module's machine code writes information necessary to describe the selected functionality to memory. The information written to memory includes information necessary to invoke the server module functionality and may include types, members, and parameters. The client module searches the memory for the selected functionality; requests information from the server module; and invokes the functionality of the server module. Once invoked by the client the server module uses the information in memory for creating dynamic function calls. | 2012-12-20 |
20120323995 | SYSTEMS AND METHODS FOR STREAMLINED CONTENT DOWNLOAD - Systems and methods in accordance with embodiments of the invention enable streamlined content download that minimizes user input during the download process. One embodiment includes a system for streamlined downloading of content to a user computing device, including: an application server system configured to locate an intermediary application in response to a request received from a user computing device; where the intermediary application includes a content ID and configures a user computing device to initialize a download manager on a user computing device, and to pass the content ID to the download manager; and where the download manager configures the user computing device to utilize the content ID to retrieve content access information, and download content from a content server system utilizing the content access information. | 2012-12-20 |
20120323996 | Method of Reporting Execution Result for SACMO and Related Communication Device - A method of reporting a result of execution of a workflow of a software and application control management object (SACMO) management object tree for a SACMO client in a service system is disclosed. The method comprises determining a node of the SACMO management object tree according to the result of the execution of the workflow; generating a message comprising an address of the node of the SACMO management object tree; and transmitting the message to a SACMO server of the service system, for reporting the result to the SACMO server. | 2012-12-20 |
20120323997 | Context Aware Interaction - A network-connected server for meeting initiation has software executing on the server from a non-transitory physical medium, the software providing a function allowing a user to schedule a meeting and to configure availability conditions, a function for informing scheduled participants of the scheduled meeting, a function for receiving indications of availability for the scheduled meeting from communication appliances associated with scheduled participants, and a function for connecting the communication appliances to communicate when the configured availability conditions are met. | 2012-12-20 |
20120323998 | Social Networking System Data Exchange - An online publisher provides content items such as advertisements to users. To enable publishers to provide content items to users who meet targeting criteria of the content items, an exchange server aggregates data about the users. The exchange server receives user data from two or more sources, including a social networking system and one or more other service providers. To protect the user's privacy, the social networking system and the service providers may provide the user data to the exchange server without identifying the user. The exchange server tracks each unique user of the social networking system and the service providers using a common identifier, enabling the exchange server to aggregate the users' data. The exchange server then applies the aggregated user data to select content items for the users, either directly or via a publisher. | 2012-12-20 |
20120323999 | ROBUST FILTERS FOR SOCIAL NETWORKING ENVIRONMENTS - Networking systems and methods according to exemplary embodiments of the present invention can provide robust filtering to enable users to customize their networking environments. A networking system can comprise a plurality of interfaces, a request unit, a management unit, and a filter unit. Each interface can include a plurality of displayable objects, each of which can represent some user of the networking system. The request unit can receive from a client a request for one of the interfaces. The management unit can manage filters, where each active filter hides one or more users from one or more other users. When an interface is requested by a client associated with a first user, the filter unit can apply the active filters to the requested interface to exclude displayable objects that represent users hidden from the first user by one or more active filters. | 2012-12-20 |
20120324000 | SYSTEM AND METHOD FOR FLOW CONTROL IN A MESSAGING SUBSYSTEM BASED ON MESSAGE-IN/OUT RATES - Systems and methods are provided, for use in a messaging subsystem, which supports flow control of messages between producers and consumers. A system can include at least one producer that is operable to send messages in a batch to one or more consumers via at least one destination; and one or more consumers that are operable to process messages received from the at least one producer via the at least one destination. The system can also include a message broker which includes the at least one destination and which manages communications between the at least one producer and the one or more consumers. The message broker includes a flow controller that is operable to monitor a producing rate and a consuming rate, and dynamically adjust a batch size of the batch at the at least one producer based on the producing rate and the consuming rate to communicate the messages more efficiently. | 2012-12-20 |