| 19th week of 2013 patent applcation highlights part 56 |
| Patent application number | Title | Published |
|---|
| 20130117201 | EVOLUTION OF A USER INTERFACE BASED ON LEARNED IDIOSYNCRASIES AND COLLECTED DATA OF A USER - A user interface evolves based on learned idiosyncrasies and collected data of a user. Learned idiosyncrasies and collected data of the user can be stored in a knowledge base. Information from the surrounding environment of the user can be obtained during learning of idiosyncrasies or collection of data. Thought-based statements can be generated based at least in part on the knowledge base and the information from the environment surrounding the user during learning of idiosyncrasies or collection of data. The thought-based statements serve to invoke or respond to subsequent actions of the user. The user interface can be presented so as to allow for interaction with the user based at least in part on the thought-based statements. Furthermore, personality nuances of the user interface can be developed that affect the interaction between the user and the user interface. | 2013-05-09 |
| 20130117202 | KNOWLEDGE-BASED DATA QUALITY SOLUTION - The subject disclosure relates to a knowledge-driven data quality solution that is based on a rich knowledge base. The data quality solution can provide continuous improvement and can be based on continuous (or on-going) knowledge acquisition. The data quality solution can be built once and can be reused for multiple data quality improvements, which can be for the same data or for similar data. The disclosed aspects are easy to use and focus on productivity and user experience. Further, the disclosed aspects are open and extendible and can be applied to cloud-based reference data (e.g., a third party data source) and/or user generated knowledge. According to some aspects, the disclosed aspects can be integrated with data integration services. | 2013-05-09 |
| 20130117203 | DOMAINS FOR KNOWLEDGE-BASED DATA QUALITY SOLUTION - The subject disclosure relates to a knowledge-driven data quality solution that is based on a rich knowledge base. The data quality solution can provide continuous improvement and can be based on continuous (or on-going) knowledge acquisition. The data quality solution can be built once and can be reused for multiple data quality improvements, which can be for the same data or for similar data. The disclosed aspects are easy to use and focus on productivity and user experience. Further, the disclosed aspects are open and extendible and can be applied to cloud-based reference data (e.g., a third party data source) and/or user generated knowledge. According to some aspects, the disclosed aspects can be integrated with data integration services. | 2013-05-09 |
| 20130117204 | INFERRING PROCEDURAL KNOWLEDGE FROM DATA SOURCES - A procedural inference system is described herein that infers procedural knowledge from various data sources to help a user complete one or more tasks for which the data sources provide information. The system understands users' queries, identifies a task at hand, provides recommendations on the steps to take and the agents to use based on a knowledge base of tasks and agents, and provides the fabric to determine which different agents can work together to help the user accomplish a task. Tasks can be started on one device and completed on another seamlessly. Users are able to finish complex, multi-step tasks efficiently, without trial and error or data reentry. Thus, the procedural inference system provides a generalized framework that helps users to complete tasks using already available data and does not ask each data provider to invest in infrastructure to build dedicated task information systems. | 2013-05-09 |
| 20130117205 | METHOD OF IDENTIFYING A PROTOCOL GIVING RISE TO A DATA FLOW - Method of identifying a protocol at the origin of a data flow. The method of identifying a protocol giving rise to a packet flow comprises the following steps: a capture of the flow of the protocol to be identified, statistical classification of the flow, comprising an extraction of the classification parameters and a comparison of the classification parameters with statistical models constructed during a learning phase. The statistical classification comprises: a first phase of global statistical classification; and a step of synthesis of the results of the first and second classification phases so as to identify the protocol giving rise to the flow. | 2013-05-09 |
| 20130117206 | DYNAMIC TRAINING AND TAGGING OF COMPUTER CODE - System, method, device and article of manufacture are provided wherein software code is sorted between optional pools using attributes of software in the target pools. Training for subsequent sorts can take place when attributes of already sorted code is considered and used when sorting previously unclassified code. Manual intervention may also be used to sort code and to verify the accuracy of previous sorts. | 2013-05-09 |
| 20130117207 | METHOD OF CLASSIFYING INPUT PATTERN AND PATTERN CLASSIFICATION APPARATUS - A method of classifying an input pattern and a pattern classification apparatus are provided. The method includes enabling an artificial neural network to learn based on learning input data received by an input layer of the artificial neural network, determining classification of an input pattern received by the input layer of the enabled artificial neural network according to an output value obtained from an output layer of the artificial neural network, the obtained output value being based on the input pattern, updating connection intensities of a plurality of connection lines of the enabled artificial neural network to output a result value indicating the determined classification from the output layer when the input pattern, and determining updated classification of the input pattern according to an updated output value obtained from an output layer of the updated artificial neural network, the obtained updated output value being based on the input pattern. | 2013-05-09 |
| 20130117208 | Predictive Service for Third Party Application Developers - Disclosed is an apparatus, method and computer program device which send a prediction request to a prediction service to construct a prediction result, receives a prediction result and an estimation of accuracy of the prediction result from the prediction service and configures an application to adapt to at least one of user preferences, behavior and habits based upon the prediction result and estimation of accuracy of the prediction result. The prediction service can include an over-the-air server which is coupled to a prediction server or a dedicated API residing on one or more user devices and configured to access a prediction server. | 2013-05-09 |
| 20130117209 | METHOD AND APPARATUS FOR USING MEMORY IN PROBABILISTIC MANNER TO STORE SYNAPTIC WEIGHTS OF NEURAL NETWORK - Certain aspects of the present disclosure support a technique for utilizing a memory in probabilistic manner to store information about weights of synapses of a neural network. | 2013-05-09 |
| 20130117210 | METHODS AND APPARATUS FOR UNSUPERVISED NEURAL REPLAY, LEARNING REFINEMENT, ASSOCIATION AND MEMORY TRANSFER: NEURAL COMPONENT REPLAY - Certain aspects of the present disclosure support techniques for unsupervised neural replay, learning refinement, association and memory transfer. | 2013-05-09 |
| 20130117211 | METHODS AND APPARATUS FOR UNSUPERVISED NEURAL REPLAY, LEARNING REFINEMENT, ASSOCIATION AND MEMORY TRANSFER: NEURAL COMPONENT MEMORY TRANSFER - Certain aspects of the present disclosure support techniques for unsupervised neural replay, learning refinement, association and memory transfer. | 2013-05-09 |
| 20130117212 | METHODS AND APPARATUS FOR UNSUPERVISED NEURAL REPLAY, LEARNING REFINEMENT, ASSOCIATION AND MEMORY TRANSFER: NEURAL ASSOCIATIVE LEARNING, PATTERN COMPLETION, SEPARATION, GENERALIZATION AND HIERARCHICAL REPLAY - Certain aspects of the present disclosure support techniques for unsupervised neural replay, learning refinement, association and memory transfer. | 2013-05-09 |
| 20130117213 | METHODS AND APPARATUS FOR UNSUPERVISED NEURAL REPLAY, LEARNING REFINEMENT, ASSOCIATION AND MEMORY TRANSFER: STRUCTURAL PLASTICITY AND STRUCTURAL CONSTRAINT MODELING - Certain aspects of the present disclosure support techniques for unsupervised neural replay, learning refinement, association and memory transfer. | 2013-05-09 |
| 20130117214 | Behavioral Fingerprinting Via Derived Personal Relation - Disclosed herein are example embodiments for behavioral fingerprinting via derived personal relation. For certain example embodiments, at least one indication of personal relation for at least one authorized user may be derived via at least one user-device interaction, and the at least one indication of personal relation may be incorporated into at least one behavioral fingerprint that is associated with the at least one authorized user, the at least one behavioral fingerprint including one or more indicators of utilization of one or more user devices by the at least one authorized user. | 2013-05-09 |
| 20130117215 | Constraint satisfaction problem solving using constraint semantics - A computer-implemented method, apparatus and product for solving a Constraint Satisfaction Problem (CSP). The computer-implemented method, performed by a computerized device, comprising: obtaining the CSP comprising a set of variables, a set of corresponding domains, and a set of constraints; and solving the CSP by iteratively: limiting the domains to exclude values that cannot satisfy one or more constraints of the set of constraints; heuristically selecting a variable out of the set of variables, wherein said heuristically selecting is based on constraint semantics of a constraint of the set of constraints; and limiting a corresponding domain of the selected variable. | 2013-05-09 |
| 20130117216 | STAR AND SNOWFLAKE SCHEMAS IN EXTRACT, TRANSFORM, LOAD PROCESSES - A computer-implemented method, computer program product and a system for supporting star and snowflake data schemas for use with an Extract, Transform, Load (ETL) process, comprising selecting a data source comprising dimensional data, where the dimensional data comprises at least one source table comprising at least one source column, importing a data model for the dimensional data into a data integration system, analyzing the imported data model to select a star or snowflake target data schema comprising target dimensions and target facts, generating a meta-model representation by mapping at least one source table or source column to each target fact and target dimension, automatically converting the meta-model representation into one or more ETL jobs, and executing the ETL jobs to extract the dimensional data from the data source and loading the dimensional data into the selected target data schema in a target data system. | 2013-05-09 |
| 20130117217 | STAR AND SNOWFLAKE SCHEMAS IN EXTRACT, TRANSFORM, LOAD PROCESSES - A computer-implemented method, computer program product and a system for supporting star and snowflake data schemas for use with an Extract, Transform, Load (ETL) process, comprising selecting a data source comprising dimensional data, where the dimensional data comprises at least one source table comprising at least one source column, importing a data model for the dimensional data into a data integration system, analyzing the imported data model to select a star or snowflake target data schema comprising target dimensions and target facts, generating a meta-model representation by mapping at least one source table or source column to each target fact and target dimension, automatically converting the meta-model representation into one or more ETL jobs, and executing the ETL jobs to extract the dimensional data from the data source and loading the dimensional data into the selected target data schema in a target data system. | 2013-05-09 |
| 20130117218 | CROSS-STORE ELECTRONIC DISCOVERY - An electronic discovery (eDiscovery) application is used in managing an electronic discovery process across different electronic data sources using a central interface. The eDiscovery application assists in managing: authentication support for the different data sources; accessing the different data sources; placing holds on content across the different data sources; searching and filtering content across the different data sources; gathering data across the data sources; and the like. The eDiscovery application may be configured as an application on premise, a cloud based service and/or a combination of a cloud based service and an application. | 2013-05-09 |
| 20130117219 | ARCHITECTURE FOR KNOWLEDGE-BASED DATA QUALITY SOLUTION - The subject disclosure relates to a knowledge-driven data quality solution that is based on a rich knowledge base. The data quality solution can provide continuous improvement and can be based on continuous (or on-going) knowledge acquisition. The data quality solution can be built once and can be reused for multiple data quality improvements, which can be for the same data or for similar data. The disclosed aspects are easy to use and focus on productivity and user experience. Further, the disclosed aspects are open and extendible and can be applied to cloud-based reference data (e.g., a third party data source) and/or user generated knowledge. According to some aspects, the disclosed aspects can be integrated with data integration services. | 2013-05-09 |
| 20130117220 | MULTI-MASTER TEXT SYNCHRONIZATION USING DELTAS - A server enforces a policy for selecting what received change to process. The non-selected changes are not processed by the server. Instead, after the selected change is processed and is incorporated into the current version of the text, the server sends an update to each of the clients indicating the change made to the current version of text. A client performs a conflict resolution procedure when its change was not processed by the server. The conflict resolution procedure detects the differences between the updated text version and its text change that was not accepted by the server and uses the differences to deduce the intent of the user and come up with a merged version of the text which preserves the intent and avoids data loss. The updated version is then sent back to the server to update the current version of the text. | 2013-05-09 |
| 20130117221 | Moving Data Within A Distributed Data Storage System Using Virtual File Links - A record within a destination virtual file is generated on a destination node of a distributed data storage system. The record comprises a link directed to a source virtual file stored on a source node. The source virtual file is mapped to a chain of linked pages stored in a page buffer of the distributed data storage system. A request is later received at the destination node to access data defined by the destination virtual file. Data is provided, in response to the request, from the source virtual file stored on the source node using the link. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117222 | SYSTEMS AND METHODS OF MEDIA MANAGEMENT, SUCH AS MANAGEMENT OF MEDIA TO AND FROM A MEDIA STORAGE LIBRARY - A system and method for determining media to be exported out of a media library is described. In some examples, the system determines a media component to be exported, determines the media component is in the media library for a specific process, and exports the media component after the process is completed. | 2013-05-09 |
| 20130117223 | INFORMATION PROCESSING SYSTEM AND METHOD OF CONTROLLING THE SAME - In an information processing system | 2013-05-09 |
| 20130117224 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR CLONING A CHILD OBJECT WITH A PARENT OBJECT - In accordance with embodiments, there are provided mechanisms and methods for cloning a child object with a parent object. These mechanisms and methods for cloning a child object with a parent object can provide improved functionality of the cloning process. Namely, the cloning of the child record with the cloning of the parent record may prevent the requirement that parent and child records be cloned via separate cloning processes. | 2013-05-09 |
| 20130117225 | Distributed storage medium management for heterogeneous storage media in high availability clusters - A high availability cluster and method of storage medium management in such high availability cluster. A number k of nodes belonging to the cluster, where k≧2 and includes a master node, are provisioned with high-access-rate and low-access-rate storage media. A file is written to the high-access-rate medium of a serving node selected from among k-1 nodes excluding the master node. The file is also written to low-access-rate medium of each of k-2 nodes excluding the master node and the serving node. A distributed storage medium management protocol supervises file migration from the, low-access-rate medium of a back-up node to the high-access-rate medium of the back-up node upon disruption of file availability on the serving node. File rebalancing relies on parameters including popularity, write- and read-requests, capacity, processing load or cost. | 2013-05-09 |
| 20130117226 | Method and A System for Synchronizing Data - The embodiments herein provide a system and a method for synchronizing a plurality of changes from a source to a destination. The method comprises the steps of starting with an initial polling time, checking for an elapse of a polling interval from a last polled time, polling a source for fetching a data after an elapse of a polling interval from a last polled time, selecting a plurality of changes from the source made by a user, processing the data fetched at the last polling time in a single thread, writing the processed data at a destination and reporting a status of a synchronization process. The initial polling time is a time from which a synchronization of changes in a data is initiated. The method uses both an even t based trigger and a scheduler based trigger | 2013-05-09 |
| 20130117227 | CACHE BASED KEY-VALUE STORE MAPPING AND REPLICATION - Technologies are generally described for cache based key-value store mapping and replication. In some examples, key-value stores may be mapped for data structure replication through extraction of file breaks in an existing key-value store by iterating through the store and examining changes in cache addresses to detect jumps in address values. Specially formulated queries may be executed to return the values within an address range that spans a physical storage volume in order to recover full key-value sets that are physically grouped at a current data center including record duplicates. Such sets may be used to replicate or inform the key-value sets at a new location or in a new key-value store allowing construction of a replicated database tree structure complete with record duplications that develop as tables are optimized over time. | 2013-05-09 |
| 20130117228 | Method and System for Object Synchronization in CRM systems - In an embodiment of the present invention, a Response object collects and synchronizes information from other types of objects as may be implemented in a CRM system. For example, certain objects may include a Lead or Contact Object, a Campaign object, and an Opportunity Object that is synchronized into a Response object. In this way, the results for a given Lead or Contact can be directly attributed to the Campaign or Opportunity without having to guess as may be necessary in certain typical CRM systems. | 2013-05-09 |
| 20130117229 | Method and A System for Integrating Data from a Source to a Destination - The embodiments herein provide a system and a method for integrating a data from a source to a destination. The method comprises generating a global-id, setting an event-id corresponding to an entity id in the global id, polling a data from a source, sorting changes of a source system based on a time of update and an entity id, creating and comparing an old as of state value and a new as of state value for each field for each update in the entity in the source and destination to detect a conflict on an entity, sending a time of update in the entity and a revision id of a change to the destination, comparing the global id with an event id for each entity at the destination to detect a presence of an entity in the destination and processing an entity at the destination based an event id. | 2013-05-09 |
| 20130117230 | Enablement of Quasi Time Dependency in Organizational Hierarchies - Changes to a hierarchical organizational structure may be stored in different versions of a data structure depicting the hierarchical organizational structure. Each of these versions may include a validity period field representing a time period that the hierarchical organizational structure depicted in the version accurately reflects the organizational structure of the organization. Each of the versions may also be designated as active or inactive. In some instances, each of the versions may be designated as inactive except for a version that reflects the organizational structure of the organization at a particular time, which may change over time. Historical copies of versions may be stored and subsequently recalled to identify an organizational structure that was in effect at a particular time in the past. The recalled version may then be used to limit the results of a query to a selected node of the historical organizational structure. | 2013-05-09 |
| 20130117231 | APPLICATION PROTECTION THROUGH A COMBINED FUNCTIONALITY FAILURE MANAGER - A method for providing application functionality protection. The method includes accessing a distributed computer system having a cluster including a plurality of nodes, and receiving an indication of an application failure. The method further includes attempting to restore the application through a number of application restart attempts, and receiving an indication that the restart attempts have not restored the application. An image history is then accessed to obtain a last known good point in time image of the application. The application is restored in accordance with the last known good point in time image. | 2013-05-09 |
| 20130117232 | SNAPSHOTS OF DATABASE MODELS - Methods, systems, and computer program products are provided for capturing snapshots of database models. Metadata of a database model is captured. A database model snapshot object is generated based on the captured metadata. The generated database model snapshot object is transportable, extensible, secure, and human readable. Furthermore multiple database model snapshot objects may be compared to each other to determine differences in database models in different database systems, to track how a database model of a database system is changing over time, to track how database source projects evolve over time and/or for other uses. | 2013-05-09 |
| 20130117233 | Point-In-Time Database Recovery Using Log Holes - A first plurality of log segments are generated in a data storage application. The log segments are sequentially positioned within a log area and at least one of the log segments contains log hole information identifying a portion of log to skip during replay of the log. Thereafter, a portion of log segments are replayed up to a specified position while skipping at least one portion of the log prior to the specified position that is identified by the at least one log hole. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117234 | Database Log Parallelization - A plurality of transactions in a data storage application are executed during which log entries according to the plurality of transactions are stored in a plurality of log buffers. The log entries are sequentially written into a current log buffer and the plurality of log buffers are written to a plurality of log partitions according to a round-robin distribution. Thereafter, in response to a data recovery event, a sequential list of the log entries in the log buffers are assembled to generate a log that can be used for data recovery by the data storage application. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117235 | Implicit Group Commit When Writing Database Log Entries - First k log buffers, in a data storage application including a plurality of log buffers are each loaded with exactly one transaction. Each log buffer is written to one of a plurality of log partitions. Thereafter, each of the log buffers is sent to an input/output (I/O) subsystem when they are respectively loaded with a single transaction. Transactions are subsequently accumulated in respective new current log buffers after sending the k log buffers to the I/O subsystem. The accumulated transactions are sent to the I/O subsystem when the earlier occurs of (i) the respective current log buffer being full or (ii) a number of incomplete input/output requests handled by the I/O subsystem falls below k. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117236 | Database Log Replay Parallelization - A plurality of transactions are executed in a data storage application. As a result, log entries according to the plurality of transactions are stored in at least one log. During a data recovery operation, log entries from the log are dispatched into a plurality of worker queues. Each worker queue corresponds to a different one of a plurality of logical central processing units. The log entries are replayed using the plurality of worker queues such that log entries associated with a same object are executed serially by a single worker queue and at least a portion of the log entries associated with different objects are executed in parallel by different worker queues. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117237 | Distributed Database Log Recovery - Log entries are recorded in a data storage application (such as an in-memory database, etc.) for a plurality of transactions among nodes in a node hierarchy. The node hierarchy comprises master node having a plurality of slave nodes. Thereafter, at least a portion of the master node log entries are replayed until a first replay position is reached. Next, for each slave node, at least a portion of its respective log entries are replayed until the first replay position is reached (or an error occurs). Subsequently, replay of at least a portion of the log entries of the master node that are subsequent to the first replay position is initiated by the master node in parallel to at least a portion of the replaying by the slave nodes. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117238 | ORACLE REWIND: METADATA-DRIVEN UNDO - Metadata-driven undo is described. In an embodiment, a metadata repository stores metadata that is associated with operations. Attributes associated with each operation are also stored in the metadata. Each operation is associated with an undolet that includes instructions for generating undo entries for operations of a particular operation type. Undo log entries are generated using the metadata and the undolet when a request is intercepted that includes an undoable operation. When an undo command is issued, the instructions in the undo log that are associated with a particular business transaction are executed to “rewind” the transaction. | 2013-05-09 |
| 20130117239 | Generating Information with Plurality of Files Enumerated Therein - A mechanism is provided for generating enumerated information in which a plurality of files is enumerated except entirely-invalidated files on a sequential medium. Management information for managing locations where the plurality of files on the sequential medium are recorded is acquired from the sequential medium. The enumerated information in which the plurality of files are enumerated is generated in an order according to the locations where the plurality of files are recorded on the basis of the acquired management information. | 2013-05-09 |
| 20130117240 | ACCESSING CACHED DATA FROM A PEER CLOUD CONTROLLER IN A DISTRIBUTED FILESYSTEM - The disclosed embodiments provide a system that archives data for a distributed filesystem. Two or more cloud controllers collectively manage distributed filesystem data that is stored in one or more cloud storage systems; the cloud controllers cache and ensure data consistency for the stored data. During operation, a cloud controller receives a request from a client for a data block of a file stored in the distributed filesystem. Upon determining that the requested data block is not currently cached in the cloud controller, the cloud controller sends a peer cache request for the requested data block to a peer cloud controller in the distributed filesystem. | 2013-05-09 |
| 20130117241 | Shadow Paging Based Log Segment Directory - Replay of data transactions is initiated in a data storage application. Pages of a log segment directory characterizing metadata for a plurality of log segment are loaded into memory. Thereafter, redundant pages within the log segment directory are removed. It is then determined, based on the log segment directory, which log segments need to be accessed. These log segments are accessed to execute the log replay. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117242 | Adaptive Data Suppression - Systems, method and devices for adaptively suppressing data items based on one or more dynamic characteristics of the data items are disclosed. Adaptive data suppression of an operational data item may be accomplished by monitoring the operational data item for one or more dynamic characteristics required by a data aging rule associated with the operational data item, wherein at least one of the database and operational data item are stored in memory, detecting the one or more dynamic characteristics required by the data aging rule, recording the one or more detected dynamic characteristics and assessing whether the one or more detected dynamic characteristics satisfy the data aging rule. If a data aging rule is satisfied, the operational data item may be suppressed to persistent data storage. Related systems, methods, and articles of manufacture are also described. | 2013-05-09 |
| 20130117243 | COMPRESSION AND STORAGE OF COMPUTER AIDED DESIGN DATA - The size of lightweight JT data files containing CAD data is reduced by employing lossy compression where acceptable for portions of the CAD data, such as 3D geometry data. Compression for the remaining portions can be augmented by exploiting common repeated structures for some portions, such as precise Brep data, and compressing separate but similar data, such as all metadata for a given part and all scene graph data, together as a single block. The compressed data is then written in separate, uniquely identified data segments indexed in a table of contents, allowing quick access to any data segment for streaming. | 2013-05-09 |
| 20130117244 | DATA SECURITY METHOD USING DATABASE ENGINE - Disclosed is a data security method in a database engine. A data security engine unit is provided in the database engine so that the data security engine unit performs a data security function while automatically converting queries, which were stored in data storage engine unit without having been encoded and which were used to perform input or inquiry on the source data, to queries to be used to perform input or inquiry on encoded data. A data management engine unit performs operations associated with the input or inquiry with respect to the source data. A data storage engine unit stores encoded data which is encoded from the source data by the data security engine unit. | 2013-05-09 |
| 20130117245 | METHOD AND SYSTEM FOR IDENTIFICATION OF ASSET RECORDS IN A VERSION MANAGED DATASTORE - Described herein are embodiments of methods and systems and devices identification of asset records in a version managed datastore. In accordance with one aspect, a method is provided for identification of asset records in a version managed datastore. In one embodiment, the method includes: receiving an asset identifier, wherein the asset identifier is created as part of an asset record for a version of a version managed database; determining, using a processor, whether the asset identifier has been previously stored in an asset identity management database; sending a notice if the asset identifier has been previously stored in the asset identity management database; and storing at least the asset identifier in the asset identity management database if the asset identifier has not been previously stored in the asset identity management database. | 2013-05-09 |
| 20130117246 | METHODS OF PROCESSING TEXT DATA - Examples of the present invention provide methods relating to identification of a portion of text data common with reference text data, the method including obtaining the text data and the reference text data, the text data and the reference text data comprising a number of lines of text, identifying one or more lines of text of the text data that are common to the lines of text of the reference text data, and for one or more further lines of text of the text data that are not common to the lines of text of the reference text data, comparing the line of text of the text data with a corresponding line of text of the reference data to identify one or more common characters of the line of text. | 2013-05-09 |
| 20130117247 | Columnar Database Using Virtual File Data Objects - A plurality of virtual files are instantiated in a columnar database. The columnar database includes a columnar data store that persists tables of data contained therein to the plurality of virtual files. Each virtual file is stored in physical data storage and a portion of the virtual file can be cached transiently in a persistence layer intermediate the columnar data store and the physical data storage. The virtual files each comprise a database object for storing data records. Operation are processed, in the columnar database, using the virtual files such that changes to virtual files resulting from the operations of one transaction are isolated from changes on the same virtual files resulting from the operations of other transactions. Related apparatus, systems, techniques and articles are also described. | 2013-05-09 |
| 20130117248 | ADAPTIVE MEDIA FILE REWIND - An addressable device receives a user-characterized rewind description. The addressable device stores the user-characterized rewind description. The addressable device renders an at least one media file to include a resume point of the at least one media file. The addressable device receives a command to preferentially rewind. The addressable device, responsive to receiving the command to preferentially rewind, re-renders the at least one media file to the user-characterized rewind description such that the display shows the at least one media file at a replay point of the media file at least the user-characterized rewind description prior to the resume point. | 2013-05-09 |
| 20130117249 | LOCALE CENTRIC SEARCH OPTIMIZATION IN RESPONSE TO USER OPT-IN - The present disclosure provides for locale-centric search optimization upon user opt-in. In response to receiving a search query generated by a user of an electronic communication device who has opted to receive search suggestions that are relevant to a locale, a search engine server provides to the user at least one keyword suggestion that is relevant to the locale and can then perform a search on an updated search query generated by the user of the electronic communication device. The updated search query may include the initial search query, or the at least one keyword suggestion provided to the user that is relevant to the locale, or some combination. The search engine server returns the results of the search on the updated search query to the user via the electronic communication device. | 2013-05-09 |
| 20130117250 | ASSOCIATIVE SEARCH ENGINE - This invention relates to an advertisement machine which provides advertisements to a user searching for desired information within a data network. The machine receives, from a user, a search request including a search argument corresponding to the desired information and searches, based upon the received search argument, a first database having data network related information to generate search results. It also correlates the received search argument to a particular advertisement in a second database having advertisement related information. The search results together with the particular advertisement are provided by the machine to the user. | 2013-05-09 |
| 20130117251 | CENTRAL SERVER, PROXY SERVER ARRANGEMENT FOR USE IN THE DISTRIBUTION OF INFORMATION ON THE INTERNET - In an exemplary embodiment of the present invention, a proxy server comprising a computer program product is provided. According to a feature of the present invention, the computer program product is disposed on a computer readable media, and the product includes computer executable process steps operable to control a computer to: implement a proxy server operable to receive a rule protocol for modification of information received via the Internet, according to instructions caused by an entity that generates content related to the information, and to modify content by the proxy server, of information received via the Internet, according to the rule protocol. | 2013-05-09 |
| 20130117252 | LARGE-SCALE REAL-TIME FETCH SERVICE - System and method for fetching embedded object content as part of a batch crawl. A fetch server receives a request on a request thread to retrieve content for objects embedded in a document, such as a web page. The fetch server attempts to locate the content of the object in cache first and in disk storage next. If the content is not located in the cache the fetch server may switch the request to a worker thread. If the content is not located in the disk storage, the fetch server may schedule a request to retrieve the content of the embedded object through a batch web crawl. Scheduling a request may include determining that a request to crawl the content of the object has already been scheduled or inserting a request into a scheduling queue. | 2013-05-09 |
| 20130117253 | SYSTEMS AND METHODS FOR IDENTIFYING HIERARCHICAL RELATIONSHIPS - Embodiments include a computer-implemented method that includes identifying a candidate parent entity having one or more characteristics indicative of the entity having a parent hierarchical relationship to another entity of an entity set, identifying a candidate child entity set including entities of the entity set that each have one or more characteristics indicative of the entity having a child hierarchical relationship to the candidate parent entity, comparing characteristics of the candidate parent entity to characteristics of an entity of the candidate child entity set to determine whether a hierarchical relationship exists between the candidate parent entity and the entity of the candidate child entity set, determining that a hierarchical relationship exists between the candidate parent entity and the entity of the candidate child entity set, and updating a hierarchical index to reflect the hierarchical relationship between the candidate parent entity and the entity of the candidate child entity set. | 2013-05-09 |
| 20130117254 | Method and System to update user activities from the World Wide Web to subscribed social media web sites after approval - Disclosed is a system and method to search the World Wide Web for latest user activities and information and update the user activities and information to user subscribed social media websites with user's approval. User subscribes their personal information and interests to the present invention. Present invention crawls and formats the information available in the World Wide Web for the provided user information and interests. The formatted information is notified to the user for approval. The user reviews the information, accepts or rejects the information. The user can edit the information to change the content. The approved information is updated to user subscribed social media websites. | 2013-05-09 |
| 20130117255 | ACCESSING A DIMENSIONAL DATA MODEL WHEN PROCESSING A QUERY - Techniques are disclosed for accessing a dimensional data model when processing a query. In one embodiment, the query is processed by performing a two-stage zigzag join operation including a zigzag main join and a zigzag back join. The zigzag main join is configured to generate a set of row identifiers of fact records satisfying any local predicates in the query. The zigzag back join is configured to generate query results based on the set of row identifiers. The query results are returned responsive to the query. | 2013-05-09 |
| 20130117256 | SQL ENUMERATOR - Techniques for collecting database information related to a received request are disclosed herein. In one embodiment a system includes a database, an event detector, and a structured query language (“SQL”) enumerator. The event detector is configured to identify a received request as producing one or more database query language statements and to define an event delimiting processing of the request. The SQL enumerator is configured to record, based on the event, information indicative of how the database processed the statements produced during the event. The SQL enumerator is further configured to provide the recorded information and an indication of a relationship of the information to the request to an issuer of the request. | 2013-05-09 |
| 20130117257 | QUERY RESULT ESTIMATION - Techniques for efficiently performing queries are provided. A search component can receive a request for information based on data, and a management component can determine a degree of accuracy requested for the information. In turn, the search component can render the information based on the degree of accuracy requested. In an aspect, the search generates a query configured to determine the first information, and the management component instructs the search component to perform the query to a level of completion less than full completion when the degree of accuracy requested is below a predetermined threshold to cause the search component to render an estimation of the first information. In another aspect, a tracking component can track information associated with multiple query requests and an analysis determine and employ a related aspect of the tracked information to a new query request to determine an answer for a the new query request. | 2013-05-09 |
| 20130117258 | Previewing Search Results - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for previewing search results. In one aspect, a method includes receiving a query from a client device. One or more image search results are provided to the client device, each of the one or more image search results identifying a corresponding image resource and each of the one or more image search results including an image representation of the corresponding image resource. One or more related queries are provided to the client device, the one or more related queries having been determined to be related to the query, wherein each of the one or more related queries includes a preview image to be displayed at the client device, the preview image representing an image search result responsive to the related query. | 2013-05-09 |
| 20130117259 | Search Query Context - Search techniques are described. In one or more implementations, a search service receives a search query from a user. A query context is formed for the user based on a history of content consumption that is verified for the user. A plurality of search results are generated that reference different types of content that correspond to the search query, respectively. The plurality of search results are ordered for output in a user interface according to the different types of content based at least in part on the query context. | 2013-05-09 |
| 20130117260 | SYSTEM, METHOD AND USER INTERFACE FOR CONTENT SEARCH - A system and method for searching content and user interface for presenting results of the search are provided, wherein visual elements representing the content are distributed in three dimensions on a display, with the various axes representing criteria that relate to a central starting point of the search and the proximity to the central point indicating the degree of relevance. The outer bounds of the display contain a large amount of varied material of various types to allow a user to select content of a different type, with the content at the periphery of the display being essentially random and representing little or no link to the starting point of the search. Any displayed element may be selected, as a source for a next level search, in which case content relationships will be re-drawn, with the selected content used as the center point for a next level search. | 2013-05-09 |
| 20130117261 | Context Sensitive Transient Connections - Methods, system and computer readable medium for allowing user interaction to an article on an Internet property includes detecting a selection of the article for viewing, by a user. Comments and interactions for the article provided by one or more posters are retrieved, wherein the posters are independent contributors that are not related to the user. A select subset of the comments/interactions for the article are presented to the user in an ordered list based on an association strength between the user and each of the posters related to the subset of the comments/interactions. Interaction, by the user, with a comment/interaction provided by a poster, is monitored and the association strength between the user and the relevant poster is updated based on the interaction. The updated association strength is used to adjust ranking of the comments/interactions for presenting to the user during subsequent selection. | 2013-05-09 |
| 20130117262 | Content Display Systems and Methods - Systems and methods to display content are described. In some embodiments, program content is received from a content source. A method identifies product-related metadata associated with the program content where the product-related metadata includes at least one item displayed in the program content. The program content is communicated to a display device for presentation to a user in a first portion of the display device. The product-related metadata is communicated to the display device for presentation to the user in a second portion of the display device. | 2013-05-09 |
| 20130117263 | Context-Based Item Bookmarking - In a method for context-based item bookmarking ( | 2013-05-09 |
| 20130117264 | OBJECT ARRANGEMENT APPARATUS, METHOD THEREFOR AND COMPUTER PROGRAM - Disclosed is an object arrangement apparatus which arranges a plurality of objects approximately uniformly to a plurality of arrangement destinations by a comparatively easy processing configuration. This object arrangement apparatus includes an arrangement destination determination means. The arrangement destination determination means refers to sequence information generated based on unique information for objects and refers to corresponding information between arrangement destination identifiers identifying arrangement destinations of the objects and second numbers associated with the arrangement destination identifiers. The arrangement destination determination means generates first numbers by using the sequence information, the first numbers not having a correlation therebetween when the first numbers are generated with different sequence information, and repeats generating a new first number until the first number matches the second number contained in the corresponding information. The arrangement destination determination means determines, when the first number matches any of the second numbers, to arrange the object to an arrangement destination corresponding to the arrangement destination identifier related to the matched second number. | 2013-05-09 |
| 20130117265 | COMMUNICATION ASSISTANCE DEVICE, COMMUNICATION ASSISTANCE METHOD, AND COMPUTER READABLE RECORDING MEDIUM - A communication assistance device ( | 2013-05-09 |
| 20130117266 | GEO-FENCE BASED ON GEO-TAGGED MEDIA - Architecture that creates a geo-fence based on geo-tagged item (e.g., a photo. The geo-tagged item can be used to share virtual boundaries, such as geo-fences, between users via conventional methods (e.g., email) for sharing digital media. An extraction component that extracts geolocation information (e.g., latitude and longitude coordinates, altitude, bearing, distance, place names, etc.) of a geo-tagged item. The geolocation information can be related to a geographical location at which the item is geo-tagged. A boundary component then creates a virtual boundary (e.g., geo-fence) in association with the geographical location and based on the geolocation information. Thereafter, the virtual boundary is triggered when the user crosses (e.g., engages, intersects) the boundary and the attached action is triggered. The geo-tagged item can be shared with another user, which when is processed, creates a virtual boundary for that other user. | 2013-05-09 |
| 20130117267 | CUSTOMER SUPPORT SOLUTION RECOMMENDATION SYSTEM - Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium and a method for automatically providing support solutions in response to user feedback items. The method comprises receiving user feedback items and corresponding support solutions. The method further comprises identifying, using clustering techniques, associations between the user feedback items and the corresponding support solutions. The method further comprises storing the identified associations as an items-solutions model that correlates the user feedback items with the corresponding support solutions. The method further comprises receiving a new user feedback item. The method further comprises automatically determining, using the items-solutions model, at least one support solution that corresponds to the new user feedback item. The method further comprises providing the at least one support solution in response to the received new user feedback item. | 2013-05-09 |
| 20130117268 | Identifying and suggesting classifications for financial data according to a taxonomy - A method includes identifying a table within a first document. The method includes analyzing at least one of: a column heading in the table, a row heading in the table, and data in a cell in the table. The method includes determining, based on the analysis, that the table contains financial data classifiable according to a taxonomy. The method includes analyzing, by a classification component comprising at least one classification engine, at least one of a column heading in the table and a row heading in the table. The method includes generating, by the classification component, a classification suggestion for at least one element in the table, based on the analysis of the classification component. | 2013-05-09 |
| 20130117269 | SYSTEM AND METHOD FOR ONBOARDING AN ITEM COLLECTION - In various example embodiments, a system and method for onboarding a collection of items is provided. In example embodiments, image data containing images of a plurality of items from a client device is received. The image data is parsed to distinguish an item of the plurality of items. The item is then identified. In some embodiments, the item is identified by determining at least one catalog item that matches an identifying feature of the item, providing a verification request indicating the at least one catalog item, and receiving a verification response confirming the identity of the item. An inventory list is compiled by including the identified item in the inventory list. | 2013-05-09 |
| 20130117270 | CATEGORY-PREFIXED DATA BATCHING OF CODED MEDIA DATA IN MULTIPLE CATEGORIES - Innovations for category-prefixed data batching (“CPDB”) of entropy-coded data or other payload data for coded media data, as well as innovations for corresponding recovery of the entropy-coded data (or other payload data) formatted with CPDB. The CPDB can be used in conjunction with coding/decoding for video content, image content, audio content or another type of content. For example, after receiving coded media data in multiple categories from encoding units, a formatting tool formats payload data with CPDB, generating a batch prefix for a batch of the CPDB-formatted payload data. The batch prefix includes a category identifier and a data quantity indicator. The formatting tool outputs the CPDB-formatted payload data to a bitstream. At the decoder side, a formatting tool receives the CPDB-formatted payload data in a bitstream, recovers the payload data from the CPDB-formatted payload data, and outputs the payload data (e.g., to decoding units). | 2013-05-09 |
| 20130117271 | Method and Apparatus for Automatically Classifying Application in Mobile Terminal - Embodiments of the present invention provide a method and an apparatus for automatically classifying an application in a mobile terminal. The method includes: obtaining classification attribute information in a configuration file of a mobile terminal application; and adding the mobile terminal application into an application set of a class corresponding to the classification attribute information of the mobile terminal application. Through the embodiments of the present invention, automatic classification of mobile terminal applications can be implemented, and an installation process of the application is simplified. | 2013-05-09 |
| 20130117272 | SYSTEMS AND METHODS FOR HANDLING ATTRIBUTES AND INTERVALS OF BIG DATA - Data management techniques are provided for handling of big data. A data management process can account for attributes of data by analyzing or interpreting the data, assigning intervals to the attributes based on the data, and effectuating policies, based on the attributes and intervals, that facilitate data management. In addition, the data management process can determine relations among data in a data collection and generate and store approximate results concerning the data based on the attributes, intervals, and the policies. | 2013-05-09 |
| 20130117273 | FORENSIC INDEX METHOD AND APPARATUS BY DISTRIBUTED PROCESSING - Provided is a forensic index method by distributed processing, including: generating data to be divided by dividing data to be indexed according to predetermined division setting for distributed processing; allocating the generated data to be divided to a plurality of data processing units according to the predetermined division setting, extracting an index by filtering the allocated data to be divided in the plurality of data processing units, and generating divided index data including the extracted index; and generating an index database by merging the generated divided index data. | 2013-05-09 |
| 20130117274 | ELECTRONIC DEVICE WITH ADDRESS BOOK AND ADDRESS BOOK MANAGEMENT METHOD - In an address book management method of an electronic device, a directory of members of an address book is created. A communication bulk and a communication count of each of the members listed in the address book are obtained. The communication bulk for each member is a total quantity of electronic communication in a predetermined time period between a predetermined user of the electronic device and the member, the total quantity measured according to a predetermined criterion, and the communication count for each member is a total number of occasions of electronic communication between the user and the member in the predetermined time period. An accumulative contact quantity index of each member is calculated according to the calculated communication bulk and communication count of the member. Thus, the members in the directory of the address book are ordered according to the accumulative contact quantity indexes. | 2013-05-09 |
| 20130117275 | INDEX MONITORING SYSTEM, INDEX MONITORING METHOD AND PROGRAM - Provided are an index monitoring system, an index monitoring method and a program which enable to understand a state of a monitoring target object, including a retention state of an index value. | 2013-05-09 |
| 20130117276 | METHODS AND APPARATUS FOR DISCOVERY OF ATTRIBUTES USING A SOCIAL MOBILE APPLICATION - In one general aspect, a computer-readable storage medium can be configured to store instructions that when executed cause a processor to perform a process. The instructions can include instructions to receive, at a first device, a target attribute associated with a first user account and to access a code representing the target attribute and including a plurality of values. The instructions can include instructions to send, to the second device, a portion of the code and an indicator of a relative location within the code of the portion of the code, and to receive an indicator from the second device that the portion of the code is included at the relative location within at least one code from a plurality of codes associated with a plurality of attributes associated with a second user account. | 2013-05-09 |
| 20130117277 | AGGREGATING DISTRIBUTED SOURCES OF APPLICATION GUIDANCE INFORMATION - A product guidance system is described herein that provides consistent methods and processes to aggregate product guidance from different online (and potentially local) sources, to ensure that the guidance aggregation is done with proper quality criteria (e.g., content/author reputation), to define how guidance is aggregated and presented appropriately for the context (e.g., a novice user may see different UI experience and different content than an advanced user), and to specify how the guidance is delivered within the product surface itself. The system defines a consistent information asset type meta-model, applies a semantic approach and algorithms to aggregate guidance content from varying sources and deliver through consistent interfaces, and provides an asset and user interface composition model to present the retrieved information following flexible categorization and navigation schemes. Thus, the product guidance system helps product teams deliver the right information, within the right context, and within the product surface. | 2013-05-09 |
| 20130117278 | METHODS, COMPUTER-ACCESSIBLE MEDIUM AND SYSTEMS FOR CONSTRUCTION OF AND INTERFERENCE WITH NETWORKED DATA, FOR EXAMPLE, IN A FINANCIAL SETTING - Networked data can, e.g., define connections between similar entities. Such data can be valuable for, e.g., improving business revenue opportunities (e.g., increasing sales, reducing customer attrition/churn, etc.) as networked data can capture similarities that can be often hard to encapsulate in traditional variables such as, e.g., socio-demographics. For example, related research has generally focused on the case where social network data was obtained directly or indirectly from online data, or from offline call logs in a telecommunication setting. Results can be implemented when inferring the values of target variables over the networked data. Methods, computer-accessible medium and systems according to exemplary embodiments of the present disclosure for creating privacy-friendly pseudo-social networked (PSN) data from off-line banking data can be provided. Exemplary PSN in accordance with certain exemplary embodiments of the present disclosure can be used, e.g., for a variety of networked data-mining applications for banks and other financial institutions to increase revenue or manage risk, for example. | 2013-05-09 |
| 20130117279 | Systems and Methods for Dynamic Conversation Management - Certain embodiments herein relate to generating profiles associated with users and comparing the profiles to determine which contributions, such as conversations, in which the users should participate. User profiles may be based on a user's historical activities, such as browsing certain web pages or generating ideas that may be shared by others, as well as a user's personality profile. Each profile may be scored based at least in part on the user's historical activities and personality profile, as examples, to identify other users who should be invited to participate in conversations with the user. | 2013-05-09 |
| 20130117280 | METHOD AND APPARATUS FOR VISUALIZING AND INTERACTING WITH DECISION TREES - A decision tree model is generated from sample data. A visualization system may automatically prune the decision tree model based on characteristics of nodes or branches in the decision tree or based on artifacts associated with model generation. For example, only nodes or questions in the decision tree receiving a largest amount of the sample data may be displayed in the decision tree. The nodes also may be displayed in a manner to more readily identify associated fields or metrics. For example, the nodes may be displayed in different colors and the colors may be associated with different node questions or answers. | 2013-05-09 |
| 20130117281 | METHOD AND APPARATUS FOR SOCIAL MEDIA ADVISOR FOR RETENTION AND TREATMENT (SMART) - A method and apparatus are implemented in one or more processors for processing various social media data received over a network for collection, analysis, and application to business logic and/or business applications. Based on personally identifying information of an account holder, social media data regarding the account holder is retrieved from one or more social media sources or a clearing house over the network. The retrieved social media data is processed (i.e., parsed and/or filtered, and validated) via certain criteria. A usefulness score for the social media data is computed based on various factors including at least one of an identity match value, a truth confidence value, and a context data relevance value. The social media data and its computed usefulness score can be presented to a user and business applications for further processing and treatment of the account holder. | 2013-05-09 |
| 20130117282 | SYSTEM AND METHOD FOR DETECTING DNS TRAFFIC ANOMALIES - Systems and methods for analyzing domain name system lookup data are disclosed. The method may include: calculating traffic scores for a network address based on a set of DNS lookup data associated with the network address, where the set of DNS lookup data includes a plurality of query records having one or more queried network addresses; calculating a first variance and a second variance for the network address based on the traffic scores for the network address; and determining a rank of the network address based on the first and second variances. | 2013-05-09 |
| 20130117283 | DYNAMIC IDENTITY MATCHING IN RESPONSE TO THREAT LEVELS - A dynamic identity matching facility that enables an operator to determine the status of an individual based on identification information contained on an identification record provided by the individual. The operator scans the individual's identification information from the identification record using a scanning device. The facility decodes the scanned identification information and identifies a number of candidates based on the decoded identification information. For each identified candidate, the facility generates a candidate score. Based on the candidate score of each identified candidate, the facility selects a number of the identified candidates for display. The facility displays the selected candidates to the operator along with the candidate's criminal or other acts. | 2013-05-09 |
| 20130117284 | USE OF SOCIAL RANKS TO FIND PROVIDERS OF RELEVANT USER-GENERATED CONTENT - A social rank service is provided to a consumer. The social rank service enables the consumer to compare social ranks of contributors who generate and distribute user-generated content regarding a topic. The social ranks of the contributors are based on the volume of content on the topic generated by the contributors. The social ranks of the contributors are also based on the credibility of the contributors. In this way, the consumer may be able to identify contributors who regularly generate credible content on the topic. | 2013-05-09 |
| 20130117285 | SEARCH SUPPORT APPARATUS, SEARCH SUPPORT METHOD, AND SEARCH SUPPORT PROGRAM - Provided is a search support apparatus including: a search keyword reception unit that sequentially receives a part of search keywords input by a target user; a first ranking unit that ranks the search keywords for each user based on search history information and generates keyword ranking information; a user association degree calculation unit that calculates a degree of association of search trends between the target user and other users by using the keyword ranking information; a second ranking unit that ranks the other users based on the degree of association and generates other user ranking information; a score calculation unit that calculates a score of the search keywords matching a part of the search keywords; and an input candidate presenting unit that presents, to the target user, search keywords matching a part of the search keywords as input candidates of the search keywords in descending order of the score. | 2013-05-09 |
| 20130117286 | Primary Data Storage System with Quality of Service - The invention is directed to a primary data storage system for use in a computer network in which a network allows user computers to transfer data to/from the primary data storage system. In one embodiment, the primary data storage system allows an administrator of the computer network to define two or more volumes on the primary data storage system and define quality of service goals for each volume. The primary data storage system operates so as allocate resources within the primary data storage system to the volumes based upon criticality and performance goals specified for each of the volumes. | 2013-05-09 |
| 20130117287 | METHODS AND SYSTEMS FOR CONSTRUCTING PERSONAL PROFILES FROM CONTACT DATA - A system and method for building a profile record for a person. Email addresses and corresponding person names are extracted from an email message and stored as records each record having an email address and corresponding person name as a key/value pair. A pair of such records is compared. If the person names are known for both records, then a match between the person names is evaluated. If the person name is known for only one of the records, then a match between the known person name for the one record and an email prefix for the other record is evaluated. If the person name is not known for either record, then a match between the email prefixes for both records is evaluated. | 2013-05-09 |
| 20130117288 | DYNAMICALLY TYPED QUERY EXPRESSIONS - A dynamic call on dynamic data can be transformed into a dynamic call on a structure representing dynamic data. Specifically, a dynamic query with a code object representation that includes an untyped parameter can be transformed into a dynamic query with a function call with a dynamic meta-object. The function call with the dynamic meta-object tracks operation(s) that correspond to the code object representation that includes an untyped parameter in order to build a structure representing such code object representation. At runtime, the dynamic query is built and the structure representing the code object representation is rebuilt so as to enable a dynamic query with a code object representation that references untyped data. | 2013-05-09 |
| 20130117289 | CONTENT MIGRATION FRAMEWORK - The present disclosure involves computer-implemented methods, software, and systems for supporting migration of unstructured data stored in enterprise content management systems. A computer-implemented method includes generating a search for content matching at least one content search rule, receiving a list of matched documents, wherein each document in the list of matched documents is associated with at least a source repository identifier and a unique document identifier, calculating a target repository identifier and at least one metadata change instruction for each unique document identifier using at least one migration rule, and modifying metadata for the document associated with each unique document identifier using the calculated at least one metadata change instruction. | 2013-05-09 |
| 20130117290 | PLATFORM FOR SOFTWARE AS A SERVICE AND METHOD FOR PROVISIONING SERVICE FOR SUPPORTING MULTI-TENANTS USING THE PLATFORM - An SaaS platform for providing an SaaS (Software as a Service) service in cloud computing and a method for provisioning a service for supporting multi-tenants using the platform are provided. The SaaS platform includes a setting environment module configured to set an environment so that setting information for each tenant is converted into metadata to be stored, a metadata manager configured to manage the metadata for each tenant and application data, and an execution engine module configured, if a service request is received from a tenant user, to request the metadata of the corresponding tenant from the metadata manager, to load the metadata of the corresponding tenant transferred from the metadata manager, and to dynamically generate and provide a service to the tenant user. | 2013-05-09 |
| 20130117291 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR DEFINING APPLICATIONS USING METADATA RECORDS CREATED FROM AN OBJECT SPECIFYING A PREDEFINED METADATA FORMAT - In accordance with embodiments, there are provided mechanisms and methods for defining applications using metadata records created from an object specifying a predefined metadata format. These mechanisms and methods for defining applications using metadata records created from an object specifying a predefined metadata format can enable embodiments to provide third party developers a manner of defining a custom format for metadata that is separate from any existing standard metadata formats that are part of a platform maintaining the metadata. | 2013-05-09 |
| 20130117292 | CONNECTION OF USERS BY GEOLOCATION - Architecture that enables discovery and communications between users that have common interests (e.g., visited the same place). For example, when users arrive at a geographic location (e.g., a business) at various times, the users are registered (automatically or manually) via a location-based service. A user can register at the location so other users may discover the user by association to the same location and according to concurrent (all or a portion of overlap of time) visitation. The registration process creates visit information of a visiting user, and a history component stores the visit information and provides access to the visit information according to user access preferences. The architecture further enables searches to be performed over the visit information by users to find other users who visited the location at the same time, to find potential new friends, and also suggest other users who match the user profile preferences. | 2013-05-09 |
| 20130117293 | FILE SYSTEM DIRECTORY ATTRIBUTE CORRECTION - Various embodiments are directed to systems and methods for facilitating file attribute correction. A computer system may receive a request to enumerate a first directory stored on a data storage. For a first file in the first directory, the computer system may determine that the first file has a corresponding first entry in an attribute cache, determine that the first entry for the first file indicates native file attributes that match the first file, and return for the first file at least one logical attribute indicated by the first entry. | 2013-05-09 |
| 20130117294 | TRAIL LOG ANALYSIS SYSTEM, MEDIUM STORING TRAIL LOG ANALYSIS PROGRAM, AND TRAIL LOG ANALYSIS METHOD - A trail log analysis system detects a fraudulent operation from a trail log of an information system, and confirms the correctness of a system action. An information development device generates an information development table from a trail log to be analyzed. The information development table defines a subject (who), an object (what), and an action (what is to be done) as comparison targets, and counts and record an event occurrence number corresponding to an event occurrence time recorded in a trail log for each combination of comparison targets. An accumulation device generates an accumulative information development table by accumulating the information development table corresponding to a trail log recorded previously and up to a time point immediately before the last collected trail log to be analyzed. A comparison device compares the information development table with the accumulative information development table, and outputs a comparison result. | 2013-05-09 |
| 20130117295 | METHOD FOR SEARCHING FOR FLASH VIDEO TAG IN BITSTREAM AND SEARCHING APPARATUS THEREOF - A method for searching for a flash video (FLV) tag in a bitstream includes the following steps: setting a first start position and a first search length related to a first search process, wherein the first search length indicates a bitstream length of the first search process performed upon the bitstream; starting the first search process upon the bitstream from the first start position to search for the FLV tag; when the FLV tag is not found in the first search length, setting a second start position related to a second search process immediately following the first search process, wherein the first start position and the second start position are separated by a time period equaling a sum of the first search length and a first skip length corresponding to the first search process; and starting the second search process upon the bitstream from the second start position to search for the FLV tag. | 2013-05-09 |
| 20130117296 | COMMUNICATION ASSISTANCE DEVICE, COMMUNICATION ASSISTANCE METHOD, AND COMPUTER READABLE RECORDING MEDIUM - A communication assistance device ( | 2013-05-09 |
| 20130117297 | DOMAIN SPECIFIC QUERY-COMPLETION SUGGESTIONS - Systems, methods, and computer-readable storage media for providing query-completion suggestions configured to be searched against vertical information domains in response to receiving a general web search query are provided. At least a portion of a general web search query is received. As the portion of the general web search query is received, query-completion suggestions are determined as is a likely primary intent associated with at least a portion of the determined query-completion suggestions. If the likely primary intent associated with a particular query-completion suggestion is for information associated with a particular vertical information domain other than the general web domain, the query-completion suggestion is provided such that selection thereof causes searching of the query-completion suggestion against the particular information domain for search results. | 2013-05-09 |
| 20130117298 | WEB SERVICE PERFORMANCE OPTIMIZATION BY ADAPTIVELY USING COMPRESSION - A method, non-transitory computer readable medium and apparatus for optimizing a web service by adaptively using compression are disclosed. For example, the method receives a request for a data file, determines whether the data file should be compressed based upon a previous request for the data file, compresses the data file if it is determined that the data file should be compressed, and sends the data file in a compressed format. | 2013-05-09 |
| 20130117299 | SYSTEM AND METHOD FOR SHOWING COVER ART ON A DISPLAY - A graphical display system for an audio system that receives data from a personal electronic device is provided. The personal electronic device is associated with a specific song. The graphical display system includes a display and a control module. The control module is in communication with the display and the personal electronic device. The control module has a control module memory that contains a database. The database includes a plurality of songs and metadata of the plurality of songs that indicates a title, an artist, a specific album, and a cover art that corresponds to each of the plurality of songs. The control module includes control logic for establishing a short range wireless connection between the control module and the personal electronic device. The control module includes control logic for receiving audio data that is associated with the specific song through the short range wireless connection. | 2013-05-09 |
| 20130117300 | COLLABORATIVE PATENT REVIEW MONITORING SYSTEM - An online automated pre-issuance or post-grant review monitoring system is disclosed, comprising network-accessible collaborative tools through which a company or client that may be interested reviewing a competitor's patent portfolio may order a search vendor or law firm to provide this monitoring and interact among users. | 2013-05-09 |
