Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 5321. Отображено 100.
04-04-2013 дата публикации

HASH POINTER CHECKING FOR HIERARCHICAL DATABASE LOGICAL RELATIONSHIP

Номер: US20130086005A1
Автор: Mori Shigeko
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method of checking consistency of pointers in a hierarchical database includes reading segment information recorded on the hierarchical database and determining a type of each segment and pointer included in each segment. The method also includes extracting parent pointers and twin pointers from child segments and extracting a child pointer from the parent segment. The method also includes calculating a first hash value b a combination of a storage location address of the parent segment and a value of the child pointer and a combination of the values of the parent pointers and the twin pointers included in the child segments, and a second hash value from a combination of storage location addresses of the child segments and the values of the parent pointers included in the child segments. The method further includes indicating a consistency error when the first hash value and the second hash value differ. 1. A system for checking consistency of pointers in a hierarchical database , the system comprising:a reading unit configured for reading segment information recorded on the hierarchical database;a determination unit configured for determining a type of each segment and a type of a pointer included in each segment from the segment information read by the reading unit;an extraction unit that is configured for, in accordance with a determination result of the determination unit, extracting from a plurality of child segment parent pointers pointing to the same parent segment and twin pointers each pointing to the next child segment one after another starting from a specific child segment among the plurality of child segments, and extracting a child pointer from the parent segment, the child pointer pointing to the specific child segment;a calculation unit configured for calculating a first hash value by a combination of a storage location address of the parent segment and a value of the child pointer and a combination of the values of the parent pointers and the twin ...

Подробнее
Номер записи: 1
04-04-2013 дата публикации

TRANSACTION PROCESSING SYSTEM, METHOD, AND PROGRAM

Номер: US20130086018A1
Автор: Horii Hiroshi
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Using a KVS transaction processing mechanism, four lock states are managed. When a local transaction refers to and updates a map entry, the local transaction is graded up to a global transaction. Start processing as the global transaction is first performed to determine a transaction ID. A committed value, a value being updated, and a transaction ID being updated are then inserted into all map entries for which LX locks are being acquired at present. Another local transaction is then started for all map entries for which S locks are being acquired at present to acquire S locks. Next, the original local transaction is committed. As a result, the LX locks acquired are graded up to GX locks. After the termination of the global transaction as the waiting target, acquisition of S locks (GX locks) is tried as a global transaction. 1. A method for distributing data to a plurality of servers on which data is accessed from a client computer , the method comprising:placing, on each of the plurality of servers, a management table comprising a transaction ID and a value indicative of a state thereof, and a data table comprising a key value, a value, and a lock value;determining a transaction ID on the client computer to start a global transaction;starting a query local transaction on a server processing a local transaction among the plurality of servers;running a query in the query local transaction about all values being referred to in the local transaction;updating all values being updated in the local transaction to a combination of a value before being updated, a value being updated, and the transaction ID as a lock value on the data table; andcommitting the local transaction.2. The method according to claim 1 , wherein the query local transaction is not committed at a point of committing the local transaction.3. The method according to claim 1 , wherein the lock has an S lock indicative of being referred to by a global transaction or a local transaction claim 1 , an LX ...

Подробнее
Номер записи: 2
11-04-2013 дата публикации

System and Method for Representing Media Assets

Номер: US20130091109A1
Автор: Basso Andrea, Gausman Paul, Gibbon David C.
Принадлежит: AT&T Intellectual Property I, L.P.

Disclosed herein are systems, computer-implemented methods, and tangible computer-readable media for representing media assets. The method includes receiving an original media asset and derivative versions of the original media asset and associated descriptors, determining a lineage to each derivative version that traces to the original media asset, generating a version history tree of the original media asset representing the lineage to each derivative version and associated descriptors from the original media asset, and presenting at least part of the version history tree to a user. In one aspect, the method further includes receiving a modification to one associated descriptor and updating associated descriptors for related derivative versions with the received modification. The original media asset and the derivative versions of the original media asset can share a common identifying mark. Descriptors can include legal documentation, licensing information, creation time, creation date, actors' names, director, producer, lens aperture, and position data. 1. A method comprising:determining a lineage for a derivative version of an original media asset based on descriptors associated with the derivative version;generating a version history tree of the original media asset representing the lineage;presenting at least a portion of the version history tree to a user; andupon receiving a user request for access to the derivative version from the portion of the version history tree presented, reconstructing the derivative version using the original media asset and the descriptors associated with the derivative version.2. The method of claim 1 , wherein the descriptors comprise a legal document claim 1 , a license claim 1 , a creation time claim 1 , a creation date claim 1 , an actor name claim 1 , a director name claim 1 , a producer name claim 1 , a lens aperture claim 1 , and position data.3. The method of claim 1 , wherein the descriptors comprise weights.4. The ...

Подробнее
Номер записи: 3
18-04-2013 дата публикации

TIME-SERIES DATA DIAGNOSING/COMPRESSING METHOD

Номер: US20130097128A1
Автор: FUJIWARA Junsuke, Suzuki Hideaki, SUZUKI SHOJI
Принадлежит:

An allowable error used for compressing time-series data can be set without knowledge of equipment. It is possible to prevent the data from being lost not only in the event of an abnormality, but also during a period in which an evidence of a predicted abnormality is detected. In addition, it is also possible to verify the properness of a set allowable error. Thus, the amount of data gathered and stored in a memory can be reduced without losing information required for detection of an evidence of a predicted abnormality occurring in the equipment of interest. As a result, it is possible to provide a time-series data diagnosing/compressing method capable of gathering time-series data with a high degree of efficiency and a data gathering/storing apparatus adopting the method. That is to say, in accordance with the present invention, there is provided a predicted-failure-evidence diagnosing section not depending on the equipment and not requiring knowledge of the equipment and, on the basis of a result of a predicted-abnormality-evidence diagnosis carried out by this section on time-series data gathered from the equipment, an allowable error used for compressing the gathered data can be set and managed in order to compress the data if the result of the diagnosis is normal or restrict the compression of the data during a period in which an evidence of a predicted abnormality is detected. Thus, the amount of data stored in a memory can be reduced. 1. A time-series data diagnosing/compressing method comprising steps of:carrying out a predicted-abnormality-evidence diagnosis on time-series data gathered from one or more sensors provided on equipment;managing a compression strategy for the data on the basis of a result of the diagnosis and thereby compressing the data with data compressing means; andstoring the compressed data in a storage.2. The time-series data diagnosing/compressing method according to claim 1 , wherein the degree of diremption of the gathered time- ...

Подробнее
Номер записи: 4
25-04-2013 дата публикации

DISTRIBUTED TRANSACTION MANAGEMENT FOR DATABASE SYSTEMS WITH MULTIVERSIONING

Номер: US20130103659A1
Автор: Diaconu Cristian, Larson Per-Ake, Zwilling Michael James
Принадлежит: MICROSOFT CORPORATION

The subject disclosure relates to a distributed transaction management technique that ensures synchronization between participating nodes in a global or distributed database transaction. The technique leverages a commit protocol that uses local clocks at the respective participating nodes. Participants in a global transaction are configured to utilize the same commit timestamp and logical read time and can advance their respective local clocks to establish this synchronization. In one embodiment, distributed commit utilizes a modified version of two-phase commit that includes an extra phase to collect commit timestamp votes from participants. Additionally, a heartbeat mechanism can be used to establish loose synchronization between nodes. In another embodiment, a node can respond to a remote transaction request by returning a list of nodes involved in generating the result of the transaction and the types of access used by such nodes in addition to the transaction result itself. 120-. (canceled)21. A transaction management system , comprising: collect commit time votes from a plurality of nodes that participate in a transaction,', 'facilitate synchronization of a commit timestamp used by the plurality of nodes based at least in part on the commit time votes, wherein the commit timestamp is used by the plurality of nodes in committing the transaction to enforce atomicity of the transaction, and', 'facilitate synchronization of a plurality of local clocks associated with the plurality of nodes in conformance with the commit timestamp; and, 'logic configured toat least one processing unit configured to execute the logic.22. The system according to claim 21 , wherein the nodes comprise different computing devices.23. The system according to claim 22 , wherein the different computing devices are connected by at least one network.24. The system according to claim 21 , wherein the transaction is a database transaction.25. The system according to claim 21 , wherein the ...

Подробнее
Номер записи: 5
30-05-2013 дата публикации

DE-DUPLICATION IN BILLING SYSTEM

Номер: US20130138617A1
Автор: Pearson Malcolm Erik, Setzer Matthew Charles
Принадлежит: MICROSOFT CORPORATION

A computing system partitions received events into a number of channels by account identifier. The channels receive the events and perform de-duplication of the events. This de-duplication can be performed with a filter that is updated to reflect the receipt of any original event. The filter may be used to either determine that the event is not a duplicate of another, or to determine that the event cannot be ruled out as being a duplicate of another. In the latter case, further processing may be performed to for definitively determine whether the event is truly a duplication, or in the alternative, the event may be immediately treated as a duplicate. 1. A computer-implemented method for performing de-duplication of incoming events , the method comprising:an act of a computing system receiving a plurality of events in the form of event messages, each of at least some of the events affecting one or more of a plurality of accounts;an act of the computing system partitioning each of the plurality of events into a plurality of channels, each of the plurality of channels receiving a subset of the plurality of events; and determining, based at least in part on the event identifier of the first event, that the first event cannot be ruled out as being a duplicate;', 'identifying a value of the first event; and', wherein the subsequent action comprises a first combination of processes when the value of the first event is less than a predetermined threshold, and', 'wherein the subsequent action comprises a second combination of processes that is different than the first combination of processes when the value of the first event is greater than a predetermined threshold., 'an act of taking subsequent action, which is directed at determining whether the first event is a duplicate, based upon both of (1) the determination that the first event cannot be ruled out as being a duplicate, as well as (2) the value of the first event,'}], 'for at least one of the plurality of channels, ...

Подробнее
Номер записи: 6
20-06-2013 дата публикации

EMBEDDING CONTROLLERS AND DEVICES WITH DATA TO FACILITATE UP-TO-DATE CONTROL AND CONFIGURATION INFORMATION

Номер: US20130159260A1
Автор: VanGompel Dave
Принадлежит: ROCKWELL AUTOMATION TECHNOLOGIES, INC.

An industrial automation system comprising a processor with an updating component coupled to automation devices via a network. The updating component reads control information from machine readable representations of the devices and populates a data structure with the control information. The updating component also updates configuration information of a device from data stored in a file object and/or the data structure, further allowing this transfer to be fragmented into a plurality of messages if the configuration information exceeds a threshold. As well, a vendor deployment methodology is provided that embeds devices and firmware for devices with a Device Type Manager (DTM) prior to deployment and can optionally allow post deployment updates to the DTM. 1. An apparatus comprising:a memory; and 'an updating component configured to create a hierarchical tag of a controller in response to reading information specifying an identity, a data type, and a data size of a data element of an automation device, populate a name field of a data structure of the controller with the hierarchical tag, and communicatively map a data field of the data structure to the data element of the automation device based on the information,', 'at least one processor, communicatively coupled to the memory, configured to facilitate execution of computer-executable components, the computer-executable components comprisingwherein the hierarchical tag comprises a device name that represents a name of the automation device and an element name that represents the data element of the automation device.2. The apparatus of claim 1 , wherein the updating component is further configured to read claim 1 , as the information claim 1 , a machine-readable representation of the automation device.3. The apparatus of claim 1 , wherein the information comprises at least one of a device type manager claim 1 , an electronic data sheet claim 1 , or a device profile associated with the automation device.4. The ...

Подробнее
Номер записи: 7
27-06-2013 дата публикации

SYSTEMS AND METHODS FOR LOCATING APPLICATION SPECIFIC DATA

Номер: US20130166517A1
Автор: Saliba Jad John
Принадлежит: MAGNET FORENSICS INC.

A system and a method for locating application-specific data that has been previously deleted and located in an address of the data storage device marked as being available for storing new data. The method includes accessing unidentified data from at least one data storage device; examining the unidentified data to detect at least one application-specific data pattern associated with at least one application; for each detected application-specific data pattern, executing an application-specific validation process to determine whether the unidentified data includes valid data associated with a corresponding application; and if it is determined that the unidentified data includes valid data associated with the corresponding application, then recovering the valid data. 1. A system for locating for application-specific data comprising:(a) at least one data storage device, having unidentified data stored therein; (i) access unidentified data from at least one data storage device;', '(ii) examine the unidentified data to detect at least one application-specific data pattern associated with at least one application;', '(iii) for each detected application-specific data pattern, execute an application-specific validation process to determine whether the unidentified data includes valid data associated with a corresponding application; and', '(iv) if it is determined that the unidentified data includes valid data associated with the corresponding application, then recover the valid data., '(b) at least one processor operatively coupled to the at least one data storage device, the at least one processor configured to2. The system of claim 1 , wherein the unidentified data includes data that has been previously deleted and located in an address of the data storage device marked as being available for storing new data.3. The system of claim 1 , wherein the application-specific data pattern includes at least one user identifier for the at least one application claim 1 , the user ...

Подробнее
Номер записи: 8
01-08-2013 дата публикации

MINIMAL EXTENSIONS REQUIRED FOR MULTI-MASTER OFFLINE AND COLLABORATION FOR DEVICES AND WEB SERVICES

Номер: US20130198132A1
Автор: Clark Michael Ray, Khosravy Moe, Novik Lev
Принадлежит: MICROSOFT CORPORATION

The claimed subject matter provides a system and/or a method that facilitates managing data consistency in connection with a plurality of devices. A collection of devices can be associated with a user. A web service can receive a portion of data from at least one device via an interface component, wherein the web service can host and relate the portion of data with an account for the user. A master sync component can leverage a computing resource from at least one device in order to maintain data consistency between at least one of the following: two or more devices within the collection of devices associated with the user; or the account hosted by the web service and two or more devices within the collection of devices associated with the user. 1. A system comprising:a synchronization component configured to maintain data consistency by synchronizing a collection of data having serialized item-level metadata; andwherein the item-level metadata includes an update version structure associated with information including at least a last updater, a local update time, and a vector of update versions.2. The system of further comprising:a collection handler configured to serialize the item-level metadata for the collection of data.3. The system of further comprising:an item component configured to enable storage and retrieval of metadata at an item level.4. The system of wherein the synchronization component is configured to interface with a web service.5. The system of wherein the web service is configured to extend at least one of an offline data synchronization between multiple endpoints or a collaboration scenario between multiple endpoints.6. A computer readable storage media having computer readable instructions that when executed cause a computer to:store on a second computer readable storage media serialized item level metadata for a collection of synchronizable data comprising an update version structure including at three least fields, the at least three fields ...

Подробнее
Номер записи: 9
01-08-2013 дата публикации

MANAGING LARGE DATASETS OBTAINED THROUGH A SURVEY-DATA-ACQUISITION PROCESS

Номер: US20130198146A1
Автор: DiGiacobbe Paul James, Horn Adam Wesley, Howerton Timothy Faye, Rothermel Todd Dennis, Siebern Christopher Michael, Stehle Tommy Allen, Trotta Brian William
Принадлежит: HNTB HOLDINGS LTD.

The invention generally relates to enabling the management of survey data. One embodiment includes providing an upload description that describes characteristics of survey data to be uploaded, assigning a thread to process a group of files that store aspects of the survey data, dividing the file into data chunks, deriving from a given data chunk a corresponding data-integrity value and respectively associating the same with the given data chunk, communicating the data chunks to a remote storage device, utilizing the corresponding data-integrity values to ensure successful communication of the data chunk, and spatially storing the survey data such that it is retrievable upon a request that describes a geographic area of interest. 1. Computer-readable media having computer-executable instructions embodied thereon that , when executed , perform a method of managing survey data , the method comprising:communicating to a remote storage system an upload description that describes characteristics of survey data to be uploaded, wherein the survey data is made up of a plurality of files;communicating the plurality of files as discrete data chunks with an associated data-integrity value for each of the plurality of files;deriving from a given data chunk a corresponding data-integrity value and respectively associating the same with the given data chunk; andcommunicating to the remote storage system the corresponding data-integrity values to ensure successful communication of the given data chunk.2. The media of claim 1 , wherein one or more of the plurality of files is a Light Detection and Ranging (“LiDAR”) data exchange file (“LAS file”) containing point data records.3. The media of claim 1 , wherein the survey data is generated using a combination of GPS claim 1 , IMU claim 1 , and laser-pulse range-detections to generate a three-dimensional spatial description of an area.4. The media of claim 1 , wherein the method further comprises generating and communicating the ...

Подробнее
Номер записи: 10
08-08-2013 дата публикации

ENFORCING TEMPORAL UNIQUENESS OF INDEX KEYS UTILIZING KEY-VALUED LOCKING IN THE PRESENCE OF PSEUDO-DELETED KEYS

Номер: US20130204846A1
Автор: LYLE Robert W., Wang Ping
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Techniques are described for identifying conflicts between a prospective temporal key and an index of temporal keys, the index sorted based on a time value associated with each of the temporal keys. Embodiments determine whether a first temporal key within the index of temporal keys conflicts with the prospective temporal key. Here, the keys within the index may be sorted based upon a respective time value associated with each of the keys. Upon determining that the first temporal key conflicts with the prospective temporal key, the prospective temporal key is designated as conflicting with at least one existing temporal key in the index of temporal keys. 1. A method for identifying conflicts between a prospective temporal key and an index of temporal keys , wherein the temporal keys in the index are sorted based at least in part on a time value associated with each of the temporal keys , comprising:determining whether a first range of time specified by a first temporal key within the index of temporal keys overlaps with a prospective range of time specified by the prospective temporal key;determining whether the first temporal key is a pseudo-deleted key; anddetermining whether the prospective temporal key conflicts with any temporal keys in the index of temporal keys, based at least in part on the determination of whether the first range of time overlaps with the prospective range of time and whether the first temporal key is a pseudo-deleted key.2. The method of claim 1 , further comprising:upon determining that the prospective temporal key does not conflict with any temporal keys in the index of temporal keys, inserting the prospective temporal key into the index of temporal keys; andupon determining that the prospective temporal key conflicts with at least one temporal key in the index of temporal keys, designating the prospective temporal key as a conflicting key.3. The method of claim 1 , wherein determining whether a first range of time specified by the first ...

Подробнее
Номер записи: 11
29-08-2013 дата публикации

METHOD AND SYSTEM FOR PROPAGATION OF AMENDMENTS MADE TO A MASTER TO COPIES

Номер: US20130226868A1
Автор: Gramberg Oliver, Jeske Ralf, Messinger Christian, Wilke Kay
Принадлежит: ABB TECHNOLOGY AG

A method and system are disclosed for propagation of changes or amendments, in a configuration of technical equipment such as transformers, generators, mills, and other automated machines or devices, by transfer (e.g., via a processor) of an amended configuration of a master having a specific apparatus or device to a non-limited number of duplicates of the master. Changes which have been incorporated with the master can be propagated from the master to the duplicate in a semi-automated or fully automated manner, and possible conflicts indicated automatically by graphic display. 1. Method for propagation of changes in a configuration of technical equipment , comprising:transferring a changed configuration of a master device having a specific apparatus or device to a non-limited number of duplicates of said master;detecting conflicts with a propagation of changes, a propagation from the master to at least one duplicate being executed by transferring a selected subset of the configuration of the master including changes; andpropagating at least some of the changes which have been done with the master from the master to the at least one duplicate in a semiautomated or fully automated manner, with possible conflicts being indicated automatically by a graphic or textual display.2. Method according to claim 1 , wherein the propagation of changes with the master comprises:a) matching, whereby a master and a duplicate or duplicates are analyzed to identify which objects in the duplicate have been copied from which object from the master and thus correspond to each other;b) comparing, whereby different types of changes are considered and checked for possible conflicts; andc) synchronizing, whereby the user will decide which changes are applied to the duplicate in order to synchronize the duplicate with the master.3. Method according to claim 2 , wherein the matching comprises:analyzing a respective data source to identify a master and duplicate automatically.4. Method ...

Подробнее
Номер записи: 12
29-08-2013 дата публикации

SEAMLESS CONTEXT TRANSFERS FOR MOBILE APPLICATIONS

Номер: US20130226878A1
Автор: Hacigumus Vahit Hakan, Sankaranarayanan Jagan
Принадлежит: NEC Laboratories America, Inc.

Methods and systems for seamless context transfers include receiving a context object from one or more applications, where the context object including updated context information for a user having an associated timestamp; entering the updated context information into a context information database; determining entries of the context information database for the user having a timestamp older than a predetermined threshold using a processor; purging the determined entries from the context information database; and sending an updated context object to one or more applications that reflects a current state of the context information for the user. 1. A method for seamless context transfers , comprising:receiving a context object from one or more applications, said context object including updated context information for a user having an associated timestamp;entering the updated context information into a context information database;determining entries of the context information database for the user having a timestamp older than a predetermined threshold using a processor;purging said determined entries from the context information database; andsending an updated context object to one or more applications that reflects a current state of the context information for the user.2. The method of claim 1 , wherein the predetermined threshold is based on a particular kind of context information that a determined entry belongs to.3. The method of claim 1 , further comprising receiving a request for an updated context application from one or more applications claim 1 , wherein sending the updated context object is responsive to said request receipt.4. The method of claim 1 , wherein updated context objects are sent according to a predefined schedule.5. The method of claim 1 , wherein updated context objects are sent immediately upon entering updated context information into or purging entries from the context information database.6. A system for seamless context transfer claim ...

Подробнее
Номер записи: 13
12-09-2013 дата публикации

METHODS AND APPARATUS FOR COMPLEMENTING USER ENTRIES ASSOCIATED WITH EVENTS OF INTEREST THROUGH CONTEXT

Номер: US20130238567A1
Автор: Ebling Maria R., Stern Edith Helen, Vortman Pnina
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Data validation techniques are provided. For example, such techniques complement user entries associated with events of interest through context. In one aspect of the invention, a technique for processing one or more user entries associated with one or more events of interest includes the following steps/operations. Context associated with the one or more events of interest is obtained. At least a portion of the obtained context is associated with one or more user entries representing events of interest. At least a portion of the one or more user entries is evaluated, responsive to at least a portion of the context. An indication of the one or more events of interest is provided, responsive to the evaluation. 1. A method of processing one or more user entries associated with one or more events of interest , comprising the steps of:obtaining context associated with the one or more events of interest;associating at least a portion of the obtained context with one or more user entries representing events of interest;evaluating at least a portion of the one or more user entries responsive to at least a portion of the context; andproviding an indication of the one or more events of interest responsive to the evaluation.2. The method of claim 1 , further comprising the step of obtaining a specification of context associated with one or more events of interest.3. The method of claim 1 , further comprising the step of specifying the one or more events of interest.4. The method of claim 2 , wherein the step of obtaining a specification of context comprises obtaining at least one of a location claim 2 , a time at location claim 2 , a proximity to a location claim 2 , a proximity to a person claim 2 , a proximity to a device claim 2 , a proximity to a person satisfying a condition claim 2 , a proximity to a location during a specified time interval claim 2 , an application invocation claim 2 , a duration of an application invocation claim 2 , a duration of an application focus ...

Подробнее
Номер записи: 14
12-09-2013 дата публикации

SEGMENT VALIDATION

Номер: US20130238578A1
Автор: Kitchel Davis, Riordan Brian
Принадлежит: STRAVA, INC.

Validating a segment is disclosed, including: determining that a stored segment meets a validation criterion; and adjusting GPS data associated with the stored segment using aggregated GPS data. 1. A system to validate a segment , comprising: determine that a stored segment meets a validation criterion; and', 'adjust GPS data associated with the stored segment using aggregated GPS data; and, 'one or more processors configured toone or more memories coupled to the one or more processors and configured to store the segment.2. The system of claim 1 , wherein the validation criterion comprises one or more of the following: a predetermined period of time has passed since the stored segment has been created or last validated claim 1 , a predetermined number of efforts has been determined to match the stored segment claim 1 , less than a predetermined threshold of efforts has been determined to match the stored segment since the segment has been created or last validated claim 1 , and receipt of an indication of a user selection to initiate a validation process.3. The system of claim 2 , wherein the predetermined number of efforts has been determined to match the segment is associated with a selected GPS-enabled device.4. The system of claim 1 , wherein adjusting GPS data associated with the stored segment using aggregated GPS data includes generating a new version of the segment.5. The system of claim 4 , wherein the aggregated GPS data comprises a first plurality of efforts that have been determined to match the stored segment.6. The system of claim 5 , wherein the first plurality of efforts is associated with a selected GPS-enabled device.7. The system of claim 5 , wherein the one or more processors are further configured to determine whether any of a second plurality of efforts matches the new version of the segment.8. The system of claim 5 , wherein adjusting GPS data associated with the stored segment using aggregated GPS data includes:identifying an effort from the ...

Подробнее
Номер записи: 15
19-09-2013 дата публикации

Multi-Source, Multi-Dimensional, Cross-Entity, Multimedia Centralized Personal Information Database Platform Apparatuses, Methods and Systems

Номер: US20130246342A1
Автор: Faith Patrick, Harris Theodore David
Принадлежит:

THE MULTI-SOURCE, MULTI-DIMENSIONAL, CROSS-ENTITY, MULTIMEDIA CENTRALIZED PERSONAL INFORMATION DATABASE PLATFORM APPARATUSES, METHODS AND SYSTEMS (“CPDB”) transform data aggregated from various computer resources using CPDB components into updated entity profiles and/or social graphs. In one implementation, the CPDB aggregates data records including search results, purchase transaction data, service usage data, service enrollment data, and social data. The CPDB identifies data field types within the data records and their associated data values. From the data field types and their associated data values, the CPDB identifies an entity. The CPDB generates correlations of the entity to other entities identifiable from the data field types and their associated data values. The CPDB also associates attributes to the entity by drawing inferences related to the entity from the data field types and their associated data values. Using the generated correlations and associated attributes, the CPDB generates an updated profile and social graph of the entity. The CPDB provides the updated profile and social graph for an automated web form filling request. 1. A centralized personal information platform processor-implemented method for enhancing transaction speed through the reduction of user input data transfer requirements , comprising:aggregating data records from a plurality of content sources;querying a data aggregation database for at least one data aggregation normalization template corresponding to the aggregated data records;determining at least one data field type in the aggregated data records using the at least one data aggregation normalization template;identifying at least one entity in the aggregated data records using the at least one data field type and associated field data values;generating an updated distributed linking node mesh database; andproviding the distributed linking node mesh database for searching.2. The method of claim 1 , wherein the content ...

Подробнее
Номер записи: 16
19-09-2013 дата публикации

SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR PUSHING AN APPLICATION UPDATE BETWEEN TENANTS OF A MULTI-TENANT ON-DEMAND DATABASE SERVICE

Номер: US20130246356A1
Автор: Smith Andrew, Taylor James, Weissman Craig
Принадлежит: SALESFORCE.COM, INC.

In accordance with embodiments, there are provided mechanisms and methods for pushing an application update between tenants of a multi-tenant on-demand database service. These mechanisms and methods for pushing an application update between tenants of a multi-tenant on-demand database service can enable tenants providing the application update to force instances of the application utilized by other tenants to be updated. This may allow the tenants providing the application update to ensure that instances of the application utilized by other tenants are updated. 1. A computer program product embodied on a tangible computer readable medium , comprising:computer code for receiving an update to an application from a first tenant of a multi-tenant on-demand database service; andcomputer code for pushing the update to at least one instance of the application utilized by a respective second tenant of the multi-tenant on-demand database service.2. The computer program product of claim 1 , wherein the update includes a patch to the application.3. The computer program product of claim 1 , wherein the first tenant includes a developer of the application that utilized the multi-tenant on-demand database service to generate the update to the application.4. The computer program product of claim 1 , wherein the computer program product is operable such that each instance of the application is utilized by one of a plurality of different second tenants of the multi-tenant on-demand database service.5. The computer program product of claim 1 , further comprising computer code for confirming the update to the at least one instance of the application prior to automatically pushing the update to the at least one instance of the application.6. The computer program product of claim 5 , wherein the computer program product is operable such that the update is automatically pushed to the at least one instance of the application based on the confirmation.7. The computer program product of ...

Подробнее
Номер записи: 17
19-09-2013 дата публикации

MANAGING REDUNDANT IMMUTABLE FILES USING DEDUPLICATION IN STORAGE CLOUDS

Номер: US20130246357A1
Автор: CHHAUNKER Gaurav, Jain Bhushan P., PATIL Sandeep R., RAMANTHAN Sri, TREVATHAN Matthew B.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method includes receiving a request to save a first file as immutable. The method also includes searching for a second file that is saved and is redundant to the first file. The method further includes determining the second file is one of mutable and immutable. When the second file is mutable, the method includes saving the first file as a master copy, and replacing the second file with a soft link pointing to the master copy. When the second file is immutable, the method includes determining which of the first and second files has a later expiration date and an earlier expiration date, saving the one of the first and second files with the later expiration date as a master copy, and replacing the one of the first and second files with the earlier expiration date with a soft link pointing to the master copy. 1. A method of file deduplication implemented in a computer infrastructure comprising a combination of hardware and software , the method comprising:receiving a request to save a first file as immutable;searching for a second file that is saved and is redundant to the first file;determining the second file is one of mutable and immutable;when the second file is mutable, saving the first file as a master copy, and replacing the second file with a soft link pointing to the master copy; andwhen the second file is immutable, determining which of the first and second files has a later expiration date and an earlier expiration date, saving the one of the first and second files with the later expiration date as a master copy, and replacing the one of the first and second files with the earlier expiration date with a soft link pointing to the master copy.2. The method of claim 1 , wherein the request to save the first file comprises a request or instruction to save the first file in a shared storage.3. The method of claim 2 , wherein:the request to save the first file is received from a local computing device; andthe shared storage is in a cloud environment remote ...

Подробнее
Номер записи: 18
19-09-2013 дата публикации

Computer product, verification support method, and verification support apparatus

Номер: US20130246359A1
Автор: Taichi Sugiyama, Takeshi Yasuie, Yuji Nomura
Принадлежит: Fujitsu Ltd

A computer-readable recording medium stores a program that causes a computer to execute a verification support process that includes acquiring a series of data transmitted and received between apparatuses; creating a plurality of data groups by dividing the series of acquired data; detecting among the created data groups, a data group that includes given data acting as an issuance request for identification information of a transmission source; adding the given data to the beginning of subsequent data groups that are among the created data groups and transmitted after the detected data group; and outputting the subsequent data groups to which the given data has been added.

Подробнее
Номер записи: 19
26-09-2013 дата публикации

Algorithm and System for Automated Enterprise-wide Data Quality Improvement

Номер: US20130254156A1
Автор: ABBASI SYED ASIM H.
Принадлежит:

Algorithm and System for Automated Enterprise-wide Data Quality Improvement by creating an infrastructure where error patterns can be stored in SQL statement format to system's local repository, in this way system can identify data errors either coming directly through keyboard entries or coming from another system through an automated feeds or manual feeds. The system automatically scans for erroneous records based on those error patterns and emails only faulty records in encrypted MS Excel format to correction agents for review and update to the production RDBMS. 1. An algorithm as shown in and its implementation—a system as shown in , utilizing which:error pattern can be submitted in SQL statement format to the system's local repository by system administrator along with the account information of correction agent which includes his/her email address;the system administrator then assign the said error pattern with the correction agent utilizing web-based Control Panel (CP);then system administrator schedules the error pattern for delivery via email either daily, weekly or monthly;the system is also having an Extraction-Transformation-Loading (ETL) process;and scanner process a.k.a. as Automatic Encrypted Report Delivery Vehicle (AERDV) process;2. The system of claim 1 , also has:two scheduler processes; one built into ETL process and other built into AERDV process;{'figref': {'@idref': 'DRAWINGS', 'FIG. 2'}, 'web-based graphical user interface (GUI) as shown in ;'}{'claim-ref': {'@idref': 'CLM-00001', 'claim 1'}, 'wherein said local repository in , comprised of three schemas: Schema 1, Schema 2 and Schema Main.'}3. The system of claim 1 , wherein said AERDV process a.k.a. scanner process claim 1 , picks up the error pattern SQL statement and executes it against the local repository (schema 1 or schema 2 whichever is ACTIVE); upon detection of related records claim 1 , the process generates the MS Excel file claim 1 , encrypts it and then emails it to the related ...

Подробнее
Номер записи: 20
26-09-2013 дата публикации

Data Integrity Validation

Номер: US20130254168A1
Автор: Leman Gregory Dale
Принадлежит:

Computer-implemented systems for searching within a database, providing searching and scoring exact and non-exact matches of data from a plurality of databases to validate data integrity. Embodiments are described relating to novel systems and methods for validating data. The embodiments create a “consensus value” for various items of data based on information shared by different entities, whose separate data can be used for this purpose whilst maintaining its confidentiality from other entities, who may be business competitors and/or who for various reasons should preferably not be given access to the data. Use of consensus value validation provides significant advantages over today's methodology of reliance on outside data vendors to provide purportedly fact-checked clean data. 1. A method for data integrity validation in an enterprise community having a plurality of enterprise members , each controlling customer records comprising data pertaining to customers , and having at least one data validation server comprising at least one non-transitory processor-readable medium , configured to maintain a set of identification data comprising at least two database customer records , each identifying a customer , each said database customer record comprising a plurality of data elements encoded with functional dependencies , each of said encoded data elements being further associated with a consensus value , the method comprising:a. receiving from an enterprise member, at an application programming interface comprising at least one non-transitory processor-readable medium having stored thereon processor-executable code, an incoming customer record identifying a customer, comprising a plurality of data elements;b. evaluating the authenticity of the incoming customer record and determining whether to accept it for processing;c. accepting the incoming customer record and structuring the incoming customer record to associate the data elements of the incoming customer record ...

Подробнее
Номер записи: 21
03-10-2013 дата публикации

System and Method for License Reclamation

Номер: US20130262401A1
Автор: BISHOP Chris, Pedone Jason
Принадлежит: Branch Banking and Trust Compnay

The present disclosure describes systems and methods for managing and implementing an asset license reclamation program across a network. The status of an asset, such as computer software, is automatically determined and if the asset does not meet particular use criteria, the asset may be flagged for reclamation and/or redeployment, either within the same network segment or in a separate network segment. 1. A method for managing an asset in a network , the method comprising the steps of:(a) automatically querying a plurality of workstations connected to the network to determine presence of the asset;(b) generating a first list of workstations based on results of the querying;(c) determining, for a first workstation on the first list, a date of last use of the asset;(d) determining, for the first workstation on the first list, a frequency of use of the asset during a first predetermined time interval;(e) for the condition where either the date of last use is earlier than a first predetermined date or the frequency of use is less than a predetermined threshold, determining if the first workstation is a member of a predetermined group of workstations;(f) for the condition where the first workstation is not a member of the predetermined group, sending to the first workstation a first message regarding the asset;(g) receiving from the first workstation, within a second predetermined time interval, a second message regarding the asset, otherwise sending to the first workstation an instruction to remove the asset;(h) receiving from the first workstation confirmation of removal of the asset;(i) updating a first database with a status of the first workstation regarding the asset; and(j) updating a second database with an indication of availability of the asset.2. The method of further comprising the steps of:(k) receiving from a second workstation a request for use of the asset;(l) verifying, from the second database, availability of the asset;(m) providing the asset to the ...

Подробнее
Номер записи: 22
03-10-2013 дата публикации

Validating Data

Номер: US20130262402A1
Автор: Codd Timothy D., Thomas Ronald G.
Принадлежит: Kaizen Logistics Services, LLC

A method of validating data that includes receiving a bill of material and a part provisioning dataset and extracting at least one of part information from the bill of material or part provisioning information from the part provisioning dataset. The method further includes comparing the part information to the part provisioning information and determining a compatibility between the part information and the part provisioning information. 1. A method of validating data , the method comprising:receiving, at a computing processor, a bill of material and a part provisioning dataset;extracting and storing in non-transitory memory at least one of part information from the bill of material or part provisioning information from the part provisioning dataset;comparing, at the computing processor, the part information to the part provisioning information; andexecuting a comparison algorithm on the computing processor for determining a compatibility between the part information and the part provisioning information.2. The method of claim 1 , further comprising storing an indicator of compatibility in the non-transitory memory for a compatibility between the part information and the part provisioning information.3. The method of claim 1 , further comprising communicating to a validation set a compatibility between the part information and the part provisioning information.4. The method of claim 1 , further comprising claim 1 , if the part information is compatible with the part provisioning information claim 1 , communicating to a validation set that at least one part in the part information is properly identified with a corresponding at least one part in the part provisioning information.5. The method of claim 1 , further comprising if the part information is incompatible with the part provisioning information claim 1 , communicating to a validation set that at least one part in the part information is erroneously identified with a corresponding at least one part in the part ...

Подробнее
Номер записи: 23
10-10-2013 дата публикации

DATA GOVERNANCE MANAGER FOR MASTER DATA MANAGEMENT HUBS

Номер: US20130268494A1
Автор: Babu Neturi Anil, Bahl Gurinder, Chan Cynthia, Gopal Gokulakrishnan Vasantha, Laik Pascal, Shah Karan D., Tahiliani Manoj
Принадлежит:

Improved data governance solutions to enterprise-level master data storage hubs are provided by implementing data governance functionality with regard to a master data hub. Data governance functionality is provided by providing visibility into the data quality the data of an enterprise. 1. A method comprising: wherein', 'the one or more data records are received from one or more data sources; and, 'receiving one or more data records at a master data management (MDM) module,'} the set of master data is stored in an MDM hub of the MDM module,', [ 'the storing is performed by an MDM application of the MDM module, and', 'storing the one or more data records in the MDM hub, wherein'}, 'the one or more data quality functions are performed by a data governance manager of the MDM module.', 'performing one or more data quality functions, wherein'}], 'the including the one or more data records in the set of master data comprises'}], 'including the one or more data records in a set of master data, wherein'}2. The method of claim 1 , wherein operational data from an operational system, or', 'analytical data from an analytical system, and, 'the one or more data records comprise at least one of'}the MDM module is configured to be coupled to the operational system and the analytical system.3. The method of claim 2 , wherein an application integration module, and', 'a middleware module,, 'the MDM module is coupled to the operational system and the analytical system via'}the one or more data records are received at the application integration module, andthe data governance manager is coupled to the MDM hub and the middleware module.4. The method of claim 3 , wherein the one or more data quality functions comprises: 'processing the one or more data records.', 'the managing comprises'}, 'managing the data quality of the master data, wherein'}5. The method of claim 3 , wherein the one or more data quality functions comprises:monitoring the data quality of the master data.6. The method ...

Подробнее
Номер записи: 24
17-10-2013 дата публикации

LIFECYCLE MARKETING OBJECT ORIENTED SYSTEM AND METHOD

Номер: US20130275366A1
Автор: Burk Stephen T., Dalvi Amol A.
Принадлежит:

The present invention involves a server for providing remote users a Lifecycle marketing system based on information in a data store of the customer enterprise. The server includes a database storing customer enterprise data. The customer enterprise data includes rules, criteria, and stages. Query software is capable of accessing data in enterprise data stores. Lifecycle definition software accesses the database and is capable of creating a lifecycle framework in the database based on information on contacts included in the enterprise data stores. 1. A server for providing remote users a Lifecycle marketing system based on information in a data store of the customer enterprise , said server comprising:a database storing customer enterprise data, said customer enterprise data including rules, criteria, and stages;query software capable of accessing data in enterprise data stores; andlifecycle definition software accessing said database and capable of creating a life cycle framework in said database based on information on contacts included in the enterprise data stores.2. The server of wherein said lifecycle definition software includes a user interaction module for allowing the user to enter rules for profile scoring of contacts of a customer.3. The server of wherein said lifecycle definition software includes a user interaction module for allowing the user to enter stage definitions relating to the life cycle framework.4. The server of wherein said database includes rules claim 1 , criteria claim 1 , and stages of a plurality of customer enterprises claim 1 , said lifecycle definition software being capable of separating said customer enterprise data in said database and restricting access to each of said plurality of customer enterprises.5. The server of wherein said query software is capable of dynamically constructing queries of the enterprise data stores based on said rules.6. The server of wherein said lifecycle definition software includes a history table for ...

Подробнее
Номер записи: 25
24-10-2013 дата публикации

VERIFYING AGE AND INTEGRITY OF WEBSITE PAGES

Номер: US20130282678A1
Автор: Wilson Kelce S.
Принадлежит:

Systems and methods are disclosed which enable the establishment of file dates and the absence of tampering, even for documents held in secrecy and those stored in uncontrolled environments, but which does not require trusting a timestamping authority or document archival service. A trusted timestamping authority (TTSA) may be used, but even if the TTSA loses credibility or a challenger refuses to acknowledge the validity of a timestamp, a date for an electronic document may still be established. Systems and methods are disclosed which enable detection of file duplication in large collections of documents, which can improve searching for documents within the large collection. 1. A computer implemented method of verifying age and integrity of a visited website page , the method executable by a processor , the method comprising:receiving at least a portion of the page into a non-transitory computer readable medium in a computing resource from across a public computer network;identifying a claimed date associated with the page;generating a first integrity verification code (IVC) for the page;selecting a closed a document dating list (DDL) edition in which to search for an IVC matching the first IVC, wherein a closing date of the DDL edition corresponds to the claimed date;searching, within the closed DDL edition, for the matching IVC; andresponsive to identifying the matching IVC within the closed DDL edition, generating a report indicating to a user of the computing resource that the claimed date has been verified.2. The method of wherein receiving at least a portion of the page comprises receiving at least a portion of a hypertext mark-up language (html) document.3. The method of wherein generating a first IVC for the page comprises generating a modified IVC using modification rules applied to elements in the page that are not printably determinable.4. The method of wherein searching claim 1 , within the closed DDL edition claim 1 , for the matching IVC comprises: ...

Подробнее
Номер записи: 26
31-10-2013 дата публикации

METHOD AND SYSTEM FOR TRANSACTION REPRESENTATION IN APPEND-ONLY DATASTORES

Номер: US20130290243A1
Автор: Buteau Gerard L., HAZEL Thomas, Jeffords Jason P.
Принадлежит: CloudTree, Inc.

A method, apparatus, and system, and computer program product for transaction representation in append-only data-stores. The system receives input from a user or agent and begins a transaction involving at least one datastore based on the received input. The system then creates, updates, and maintains a transaction state. The system ends the transaction and writes the state of the transaction to memory in an append-only manner, wherein the state comprises append-only key and value files. 1. A computer assisted method for transaction representation in append-only data-stores , the method including:receiving input from at least one of a user and an agent;beginning a transaction involving at least one datastore based on the received input;at least one selected from a group consisting of creating, updating and maintaining a transaction state;ending the transaction; andwriting the state of the transaction to memory in an append-only manner, wherein the state comprises append-only key and value files.2. The method of claim 1 , wherein the append-only key and values files encode at least one boundary that represents the transaction.3. The method of claim 2 , wherein append-only transaction log files group a plurality of files representing the transaction.4. The method of claim 1 , wherein the append-only key and values files represent an end state of the transaction.5. The method of claim 4 , wherein the memory comprises disk memory.6. The method of claim 1 , wherein beginning a transaction includes accessing at least one key/value pair within a datastore.7. The method of claim 6 , further comprising:creating a workspace comprising a user space context and a scratch segment maintaining key to information bindings; andmaintaining transaction levels.8. The method of claim 7 , further comprising:copying a state of the at least one datastore involved in the transaction from memory into the scratch segment.9. The method of claim 8 , further comprising:updating the scratch ...

Подробнее
Номер записи: 27
31-10-2013 дата публикации

Determining and storing at least one results set in a global ontology database for future use by an entity that subscribes to the global ontology database

Номер: US20130290272A1
Автор: Baiju D. Mandalia, Vijay Dheap
Принадлежит: International Business Machines Corp

Determining and storing at least one validated results set in a global ontology database for future use by an entity that subscribes to the global ontology database. If global ontology data is stored in a global ontology database, attempt to determine a mapping between first and second ontologies. If a mapping between the first and second ontologies can be determined from the global ontology data, the mapping is validated and the validated mapping is defined as a validated results set. If global ontology data is not stored in a global ontology database or a mapping between the first and second ontologies can not be determined from global ontology data stored in the global ontology database, the first and second ontologies are unified by determining a mapping between the first and second ontologies, the mapping is validated and the validated mapping is defined as a validated results set. The validated results set is stored in the global ontology database for future use by an entity that subscribes to the global ontology database.

Подробнее
Номер записи: 28
31-10-2013 дата публикации

SCALABLE DEDUPLICATION SYSTEM WITH SMALL BLOCKS

Номер: US20130290278A1
Автор: ARONOVICH Lior, ASHER Ron, HIRSCH Michael, KLEIN Shmuel T., MEIRI Ehud, TOAFF Yair
Принадлежит:

Exemplary method, system, and computer program product embodiments for scalable data deduplication working with small data chunk in a computing environment are provided. In one embodiment, by way of example only, for each of the small data chunk, a signature is generated based on a combination of a representation of characters that appear in the small data chunk with a representation of frequencies of the small data chunk. A signature is generated based on a combination of a representation of characters that appear. The signature is used to help in selecting the data to be deduplicated. Additional system and computer program product embodiments are disclosed and provide related advantages. 1. A method for scalable data deduplication working with small data chunks the method comprising:for each small data chunk, generating a signature based on a combination of a representation of characters that appear in the small data chunk and a representation of frequencies of the characters in the small data chunk, wherein the signature is used to help in selecting the data to be deduplicated,wherein:the signature is based on a c-spectrum of the small data chunk and an f-spectrum of the small data chunk,the c-spectrum of the small data chunk is a sequence of representations of different characters ordered by a frequency of occurrence in the small data chunk, andthe f-spectrum of the small data chunk is a corresponding sequence of frequencies of the different characters in the small data chunk.2. The method of claim 1 , wherein the signature is generated to provide for small modifications in the small data chunk to cause one of small changes and no changes in the signature.3. The method of claim 1 , further including claim 1 , in conjunction with generating the signature based on a c-spectrum and f-spectrum performing one or more of:{'sub': i', 'i', 'i+1', 'i, 'combining characters of the c-spectrum having similar frequencies into blocks, by weighing gaps d=f−fbetween frequencies ...

Подробнее
Номер записи: 29
07-11-2013 дата публикации

System and Method for Organizing Data

Номер: US20130297568A1
Автор: Bjorn J. Gruenwald
Принадлежит: Individual

A system and method for organizing raw data from one or more sources uses an improved mechanism for identifying duplicate data between fields (e.g., columns) in the databases. The fields may be similar fields within a single database or similar or identical fields within a pair of databases and as organized as arrays or field vectors. The present invention sorts each of the field vectors and if necessary, partitions them by common value. A number of comparisons required to identify the duplicate data between the field vectors is reduced by feeding back a difference between the compared values. This difference is used to adjust indices into the field vectors for subsequent comparison.

Подробнее
Номер записи: 30
07-11-2013 дата публикации

STORING DATA INTEGRITY INFORMATION UTILIZING DISPERSED STORAGE

Номер: US20130297947A1
Автор: Resch Jason K.
Принадлежит:

A method begins by a processing module generating an integrity check value for each encoded data slice of a set of encoded data slices to produce a set of integrity check values. The method continues with the processing module encoding the set of integrity check values to produce encoded integrity check values. The method continues with the processing module sending the encoded integrity check values for storage in a memory system. 1. A method comprises:obtaining at least a decode threshold number of encoded data slices of a set of encoded data slices;obtaining encoded integrity check values;decoding the encoded integrity check values to produce a set of stored integrity check values, wherein each integrity check value of the set of stored integrity check values is associated with a corresponding encoded data slice of the set of encoded data slices;calculating an integrity check value for each of the at least the decode threshold number of encoded data slices to produce a set of calculated integrity check values;for each the at least the decode threshold number of encoded data slices, comparing a corresponding integrity check value of the set of stored integrity check values with a corresponding integrity check value of the set of calculated integrity check values;when the comparing of the corresponding integrity check values for each of the at least the decode threshold number of encoded data slices is favorable, indicating that the at least the decode threshold number of encoded data slices is valid.2. The method of claim 1 , wherein the decoding the encoded integrity check values comprises at least one of:decrypting the encoded integrity check values to produce decrypted integrity check values; and dispersed storage error decoding the encoded integrity check values or the decrypted integrity check values to produce dispersed storage error decoded integrity check values, wherein the set of stored integrity check values includes the decrypted integrity check values ...

Подробнее
Номер записи: 31
14-11-2013 дата публикации

Method and System for Distributed Data Verification

Номер: US20130304708A1
Автор: Marins Sergejs, RITCHIE Grant C.
Принадлежит: LOCATIONARY, INC.

A method and system of verifying data stored in a database, by polling one or more computing devices. A server generates a poll object for a data item and a poll notification is transmitted to the one or more computing devices, whereupon users of the computing devices may respond to the poll notification and transmit responses. A set of response notifications is received and the server determines if the set of response notifications satisfies a quorum criterion. If the quorum criterion is satisfied, the server determines a data verification result, based on a tally criterion. 1. A method of verifying a data item stored in a database by polling one or more computing devices , the method comprising:generating a poll object for the data item;determining a quorum criterion and a tally criterion for the poll object;transmitting a poll notification associated with the poll object to the one or more user computing devices;receiving a set of response notifications from one or more responding devices, the one or more responding devices comprising at least one of the one or more computing devices;determining, using a processor, whether the set of response notifications satisfies the quorum criterion;if the quorum criterion is satisfied, determining, using a processor, a verification result based on the tally criterion and the set of response notifications; andupdating the data item based on the verification result.2. The method of claim 1 , further comprising identifying the one or more computing devices based on a target criteria.3. The method of claim 2 , wherein the target criteria is a device location of the one or more computing devices claim 2 , and wherein the identifying comprises locating devices within a predetermined range of a location associated with the data item.4. The method of any one of to claim 2 , wherein the target criteria relates to the data item.5. The method of any one of to claim 2 , wherein the target criteria relates to the poll object.6. The ...

Подробнее
Номер записи: 32
14-11-2013 дата публикации

META-CONFIGURATION OF PROFILES

Номер: US20130304709A1
Автор: Poulsen Andrew S.
Принадлежит:

Disclosed are methods for creating, applying, using and retrieving profile information that includes attributes that may be stored separately from, or with, the content to which the profiles are being applied. In this manner, profiles can be shared in various environments and across various applications. Attributes that have corresponding attributes in other content can be applied to the other content, as long as each of the attributes is valid. In computer aided design applications, the profile can be stored in a profile repository embedded within the CAD model. In addition, profile controllers are disclosed which control the attributes of a profile that can be used with selected content and other content and send a notification that a profile is available for use by other content. 1. A method of retrieving a profile for a vehicle , said profile having a plurality of attributes for modifying the presentation of content , said attributes comprising settings for specific content presentation characteristics , said content presentation characteristics comprising user-definable settings , said process comprising:selecting said profile to be retrieved and applied to said user-definable settings at the direction of a user at run time to change said content presentation characteristics;retrieving said profile from a profile repository at run time:loading said profile from said profile repository at run time; setting a current attribute pointer to a current attribute in said profile;', 'applying said current attribute to said user-definable settings at run time to modify said user-definable settings to correspond to said current attribute if said current attribute has a corresponding attribute present in said user-definable settings, and when current attribute is valid for said settings;', 'incrementing said current attribute pointer so that each attribute of said plurality of attributes in said profile is applied to said user-definable settings at run time which modifies ...

Подробнее
Номер записи: 33
14-11-2013 дата публикации

IDENTIFYING A COMPROMISED ENCODED DATA SLICE

Номер: US20130304711A1
Автор: Resch Jason K.
Принадлежит:

A method begins by processing module in response to a read command, issuing at least a read threshold number of read requests regarding a set of encoded data slices and receiving at least the read threshold number of encoded data slices. The method continues where the processing module selects a unique combination of encoded data slices and decodes the unique combination to produce a recovered data segment. The method continues where the processing module verifies an integrity value for the recovered data segment and indicates whether the unique combination is valid. The method continues where the processing module selects other combinations producing more recovered data segments for further validity verification. The method continues where the processing module utilizes a verified recovered data segment as a response to the read command and identifies a compromised encoded data slice. 1. A method for execution by one or more processing modules of a computing device , the method comprises:in response to a read command, issuing at least a read threshold number of read requests regarding a set of encoded data slices, wherein a data segment is dispersed storage error encoded to produce the set of encoded data slices, wherein the data segment has a known integrity value, wherein a decode threshold number of encoded data slices of the set of encoded data slices is needed to recover the data segment, and wherein the read threshold number is greater than the decode threshold number;receiving the at least the read threshold number of encoded data slices; selecting a unique combination of encoded data slices from the set of the at least the read threshold number of encoded data slices, wherein the unique combination includes the decode threshold number of encoded data slices;', 'disperse storage error decoding the unique combination of encoded data slices to produce a recovered data segment;', 'generating an integrity value for the recovered data segment;', 'verifying the ...

Подробнее
Номер записи: 34
14-11-2013 дата публикации

SYSTEM AND METHOD FOR METADATA LEVEL VALIDATION OF CUSTOM SETUP OBJECTS

Номер: US20130304713A1
Автор: Roy-Faderman Avrom
Принадлежит: SALESFORCE.COM, INC.

In one embodiment, a computer-implemented method executable by a server system to validate metadata of an application is provided. The method includes: receiving a custom metametadata object having a definition that specifies a format of metadata of an object, and having validation rules that specify a use of the custom metametadata object; generating a metadata record using the custom metametadata object; building an application using the metadata record; and validating the metadata record based on the validation rules of the metametadata object. 1. A computer-implemented method executable by a server system to validate metadata of an application , the method comprising:receiving a custom metametadata object having a definition that specifies a format of metadata of an object, and having validation rules that specify a use of the custom metametadata object;generating a metadata record using the custom metametadata object; andvalidating the metadata record based on the validation rules of the metametadata object.2. The computer-implemented method of further comprising claim 1 , selectively generating an error message based on the validating.3. The computer-implemented method of claim 2 , wherein the error message includes a message that indicates a generic violation of the use of the custom metametadata object.4. The computer-implemented method of claim 1 , wherein the error message includes a message that indicates a violation of a particular validation rule.5. The computer-implemented method of claim 1 , wherein the validating is performed before runtime of an application that incorporates the metadata record.6. The computer-implemented method of claim 5 , wherein the validating is performed by an evaluation tool of the server system.7. The computer-implemented method of claim 1 , further comprising relating the metadata record to another metadata record claim 1 , and wherein the validating the metadata record is based on the metadata record and the another ...

Подробнее
Номер записи: 35
14-11-2013 дата публикации

Distributed Transaction Management Using Two-Phase Commit Optimization

Номер: US20130304714A1
Автор: Lee Juchang, Muehle Michael
Принадлежит:

A computer-implemented method, a computer-readable medium and a system are provided. A transaction master for each of a plurality of transactions of a database is provided. Each transaction master is configured to communicate with at least one transaction slave to manage execution of a transaction in the plurality of transactions. Each transaction master configured to perform generating a transaction token to specify data to be visible for a transaction on the database, the transaction token including a transaction identifier for identifying whether the transaction is a committed transaction or an uncommitted transaction, receiving a request to commit the transaction, initiating, based on the request, a two-phase commit operation to commit the transaction. The two-phase commit operation includes preparing for committing the transaction, writing a committed transaction to a memory, optimizing the two-phase commit operation by omitting a phase of the two-phase commit operation, generating an acknowledgement of the committed transaction. The plurality of transactions of the database are executed with each transaction master. 1. A computer-implemented method , the method comprising: receiving a request to commit the transaction;', 'initiating, based on the request, a two-phase commit operation to commit the transaction, wherein the two-phase commit operation comprises preparing for committing the transaction and writing a committed transaction to a memory;', 'optimizing the two-phase commit operation by omitting the writing of the committed transaction to the memory; and', 'generating an acknowledgement of the committed transaction., 'providing a transaction master for each of a plurality of transactions of a database, wherein each transaction master is configured to communicate with at least one transaction slave to manage execution of a transaction in the plurality of transactions, each transaction master configured to perform operations comprising2. The computer- ...

Подробнее
Номер записи: 36
14-11-2013 дата публикации

ALLOWING UPDATES TO DATABASE OBJECTS

Номер: US20130304716A1
Автор: Mantena Gouri, Markham Tulasi J., Pham Hoa, Pham Tuan A., Reilly William J., Tan Yi-Wen, Tran Mai T., Waite Debra J.
Принадлежит:

A system and method for allowing flexible and simultaneous updates to database objects from one or more users is disclosed. The system may receive a change request to the object from the first user and then from a second user. The system may determine if the object is locked and, if so, informing the first user. If an edit request is received from the second user, the second user may be provided with multiple options, such as incorporating changes made by first user and overwriting changes made by second user with changes made by first user, incorporating changes made by first user and overwriting changes made by first user with changes made by second user, and cancelling changes made by second user. 1. A method for making changes to a data object , the method comprising:receiving one or more changes to the data object from a first user;receiving a request from a second user for access to the data object;determining if the data object is locked;receiving a request to save a change to the data object from the second user, wherein the request to save the change to the data object from the second user is subsequent to the one or more changes to the data object from the first user; andproviding the second user with priority over the first user to resolve a conflict between the one or more changes to the data object from the first user and the change to the data object from the second user by providing the second user with final authority to overwrite the one or more changes to the data object from the first user.2. The method according to claim 1 , further comprising providing the second user with final authority to implement each of the following:incorporate changes made by the first user and overwriting changes made by the second user with changes made by the first user when the changes conflict;incorporate changes made by the first user and overwriting changes made by the first user with changes made by the second user when the changes conflict; andcancel changes ...

Подробнее
Номер записи: 37
28-11-2013 дата публикации

PARTIAL SOURCE VERIFICATION OF EDC DATA

Номер: US20130318049A1
Автор: BOYD Paul, Bradford Paul, BUTLER Hanan, KAY Scott, SHEPARD Scott
Принадлежит:

Systems, methods, and other embodiments associated with partial source verification are described. In one embodiment, a method includes selecting, from a corpus of records, a set of records that includes fewer records than the corpus, where each record corresponds to an instance of an electronic form that records information about a given subject. The set of records is provided for source verification. 1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method , the method comprising:selecting, from a corpus of records, a set of records that includes fewer records than the corpus, where each record corresponds to an instance of an electronic form that records information about a given subject; andproviding the set of records for source verification.2. The non-transitory computer-readable medium of claim 1 , where the method further comprises:receiving a number n that specifies a number of subjects for selection that meet a predetermined chronological criteria;designating for verification a set of n subjects that meet the chronological criteria; andselecting records for the set of n subjects for source verification.3. The non-transitory computer-readable medium of claim 1 , where selecting comprises:identifying a pool of records within the corpus that are eligible for automatic selection;automatically selecting one or more records from the pool of records that are eligible for automatic selection; andwhere automatically selecting comprises selecting records in a manner that is blind with respect to users generating the records.4. The non-transitory computer-readable medium of claim 3 , further comprising:identifying m subjects having records in the pool of records;calculating a number k of subjects for automatic selection by applying a subject selection rate to the number m;automatically designating for verification a set of k subjects from the m subjects having records ...

Подробнее
Номер записи: 38
28-11-2013 дата публикации

TECHNIQUES FOR IMPLEMENTING BATCH PROCESSING IN A MULTI-TENANT ON-DEMAND DATABASE SYSTEM

Номер: US20130318057A1
Автор: Smith Andrew, Waite Andrew, Weissman Craig, YANCEY Scott
Принадлежит: SALESFORCE.COM, INC.

In accordance with embodiments, there are provided techniques for implementing batch processing in a multi-tenant database system. These techniques for implementing batch processing in a multi-tenant database system may enable embodiments to provide great flexibility to a tenant of the architecture to perform desired functions on content of the database while allowing the owner of the architecture schedule the processing of the functions on the content. 1. A batch processing method in a multi-tenant database system , the method comprising:operating on instructions from a tenant to have said database system perform processes on a subset of content stored on said database system;identifying from said instructions an object associated with a class to execute a batch code interface that invokes multiple methods to schedule and execute functions upon said subset; andexecuting said batch code interface asynchronously with operations of said database system by invoking said multiple methods, thereby providing a batch processing facility to said tenant.2. The method as recited in wherein executing further includes invoking a third method in which said tenant is notified of completion of said first and second methods.3. The method as recited in wherein executing further includes invoking said multiple methods claim 1 , with one of said multiple methods identifying objects of said subset subject to processes.4. The method as recited in wherein executing further includes invoking said multiple methods claim 1 , with one of said multiple methods identifying objects of said subset subject to processes and a number of iterations of a second method will be invoked to process said objects.5. The method as recited in wherein executing further includes invoking said multiple methods claim 1 , with one of said multiple methods identifying objects of said subset subject to processes and calling a querylocator object to identify multiple subgroups of said objects to process in ...

Подробнее
Номер записи: 39
28-11-2013 дата публикации

TRANSFER OF DATA FROM TRANSACTIONAL DATA SOURCES TO PARTITIONED DATABASES IN RESTARTABLE ENVIRONMENT

Номер: US20130318059A1
Автор: JANG Jing-Song, McArdle James M., Spicer Michael J.E.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Method, system, and computer program product for transferring data from transactional data sources to partitioned databases are provided. One or more messages from a transactional data source are read. Each message includes one or more records to be inserted into a database comprising a plurality of partitions. One of the partitions of the database in which the one or more records of each message are to be inserted is then identified. A transaction is initiated to insert the one or more records of each message into the one partition and to delete the one or more messages from the transactional data source. The transaction is committed only when insertion of the one or more records of each message into the one partition and deletion of the one or more messages from the transactional data source succeed. 1. A system for transferring data from transactional data sources to partitioned database , the method comprising a feed handler reading a first set of one or more messages from a transactional data source , each message in the first set comprising one or more records to be inserted into a database comprising a plurality of partitions a sorter in communication with the feed handler , the sorter identifying a first of the plurality of partitions of the database in which to insert the one or more records of each message in the first set; and a first flusher in communication with the sorter and the first partition , the first flusher initiating a first transaction to insert the one or more records of each message in the first set into the first partition and to delete the one or more messages in the first set from the transactional data source , and committing the first transaction only when insertion of the one or more records of each message in the first set into the first partition and deletion of the one or more messages in the first set from the transactional data source succeed.2. The system of claim 1 , wherein the first flusher further rolls back the first ...

Подробнее
Номер записи: 40
28-11-2013 дата публикации

SYSTEM AND METHOD FOR TRACKING EVENTS

Номер: US20130318097A1
Автор: Ahuja Gaurav, Gambhir Nitin
Принадлежит:

A system and method for keeping track of events. In the preferred embodiment, a counter is created on a mobile device and is set to update one or more values based on the occurrence of a triggering event. The triggering event may be based on the user pressing a button or otherwise interacting with the mobile device, or may be based on other functions of the mobile device, such as the arrival in a particular location as determined by GPS. Counters may be shared with other mobile devices, and data in the counters may be stored on the mobile device or in a remote location. Mobile devices can share data from their counters with other mobile devices, and counters can be set to compare data between different mobile devices. Alerts can be set based on predetermined criteria. 1. A method for maintaining and updating information on an electronic device , the method comprising:creating a counter, said counter comprising a name and a first data field, wherein the data field is stored in memory and is identified by a tag;initializing said data field in said counter;associating an event with said counter; andupdating the data field upon occurrence of said event, wherein said updating the data field comprises:reading a value of the data field;modifying the value; andstoring the value.2. The method of claim 1 , further comprising a database for storing data associated with each counter.3. The method of claim 2 , wherein said updating the data field comprises:reading a value of the data field that is stored in the database;modifying the value; andstoring the value in the database.4. The method of claim 1 , wherein the event comprises arriving at a predetermined location.5. The method of claim 1 , wherein the event comprises the arrival of a predetermined date.6. The method of claim 1 , wherein the event comprises the arrival of a predetermined time.7. The method of claim 1 , further comprising wirelessly communicating information upon occurrence of the event.8. The method of claim ...

Подробнее
Номер записи: 41
05-12-2013 дата публикации

Augmenting metadata using user entered metadata

Номер: US20130325819A1
Автор: Yupeng Liao, Zhibing WANG
Принадлежит: HULU LLC

In one embodiment, a method obtains metadata associated with a media program. The method receives user entered metadata from a first user for an object in a frame of the media program and compares the user entered metadata from the first user with user entered metadata from second users for the object. Then, the method verifies that the user entered metadata from the first user and the second users should be associated as augmenting metadata for the object in the media program based on the comparison. Upon verifying, the method performs: determining metadata storage including metadata for one or more other objects in the media program and storing the user entered metadata for the object in the media program in the metadata storage for the media program as the augmenting metadata.

Подробнее
Номер записи: 42
05-12-2013 дата публикации

VERIFYING DATA INTEGRITY UTILIZING DISPERSED STORAGE

Номер: US20130325820A1
Автор: Grube Gary W., Markison Timothy W.
Принадлежит: CLEVERSAFE, INC.

A method begins by a processing module retrieving at least a threshold number of error coded data slices of a set of error coded data slices from storage units of a dispersed storage network (DSN) and identifying, based on an intentional error pattern, error coded data slices that were intentionally altered to produce identified error coded data slices. The method continues with the processing module decoding the set of error coded data slices to produce a recovered data segment and encoding the recovered data segment using an altered dispersed storage error encoding function to produce a test set of error coded data slices for comparing with corresponding error coded data slices. When the test set of error coded data slices substantially match the corresponding error coded data slices, the method continues with the processing module indicating that the recovered data segment has not been corrupted. 1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN) , the method comprises:retrieving at least a threshold number of error coded data slices of a set of error coded data slices from storage units of the DSN, wherein a dispersed storage error encoding function has been altered to include an intentional error pattern to produce an altered dispersed storage error encoding function, wherein a data segment was encoded using the altered dispersed storage error encoding function to produce the set of error coded data slices, and wherein, as a result of the intentional error pattern, one or more error coded data slices of the set of error coded data slices is intentionally altered to include an error;identifying, based on the intentional error pattern, error coded data slices of the at least a threshold number of error coded data slices that were intentionally altered to include the error to produce identified error coded data slices;modifying the identified error coded data slices to extract the ...

Подробнее
Номер записи: 43
05-12-2013 дата публикации

System and Method For Providing High-Availability and High-Performance Options For Transaction Log

Номер: US20130325828A1
Автор: Brett Derek Hawton, Matthew Donald Larson
Принадлежит: Confio Corp

The present invention provides a method and system for using an operating system level I/O filter driver for providing transparent database transaction log file redundancy. In accordance with the method, the I/O filter driver intercepts a database management system request to write data to the database transaction log file. The I/O filter driver writes the data to at least two transaction log files.

Подробнее
Номер записи: 44
19-12-2013 дата публикации

GUARDED FILE DESCRIPTORS

Номер: US20130339313A1
Автор: Blaine Russell A., Marsland Timothy P., Nham Benjamin H., Swift Adam C., Trumbull Benjamin C., Vaishampayan Umesh S.
Принадлежит: Apple Inc.

Guarded file access operations are provided for creating and using guarded file descriptors, which can detect and prevent erroneous file access operations in computer programs. A file descriptor can be associated with a guard identifier to create a guarded file descriptor. The association can be established when the file is opened, and can be maintained independently of the computer program, which ordinarily maintains its own association between files, file descriptors, and guard identifiers. Subsequent file operations using the guarded file descriptor check that the guard identifier previously associated with that file descriptor is presented, and generate errors without performing the requested file operations if the correct guard identifier is not presented. This check serves as a validation of the computer program's use of file descriptors. An error and stack trace can be generated for use in analyzing a cause of the guard violation. 1. A method comprising:attempting, by a computer system, to perform a file operation on a file descriptor, wherein the attempting comprises receiving, by the computer system, the file descriptor and a guard identifier;determining, by the computer system, whether the guard identifier is invalid for the file descriptor; andgenerating, by the computer system, a guard violation in response to the guard identifier being invalid for the file descriptor.2. The method of claim 1 , wherein determining whether the guard identifier is invalid for the file descriptor comprises:searching, by the computer system, a lookup table that associates valid guard identifiers with file descriptors for one or more associations between the file descriptor and the guard identifier; anddetermining, by the computer system, that the guard identifier is invalid in response to the search finding no association between the file descriptor and the guard identifier in the lookup table.3. The method of claim 1 , wherein determining whether the guard identifier is ...

Подробнее
Номер записи: 45
19-12-2013 дата публикации

FACILITATING TRANSACTION COMPLETION SUBSEQUENT TO REPEATED ABORTS OF THE TRANSACTION

Номер: US20130339330A1
Автор: Belmar Brenton F., Jacobi Christian, Philley Randall W., Slegel Timothy J.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Processing of transactions within a computing environment is facilitated by taking actions to increase the chances of successfully executing a transaction. A counter is maintained that provides a count of how often a transaction has aborted. The counter increments the count each time the transaction is aborted, and it is reset to zero upon successful completion of the transaction or an interruption leading to no more re-executions of the transaction. If the count reaches a threshold value, then an interrupt is presented and transaction execution is unsuccessful. However, before the count reaches the threshold, a number of actions may be taken to increase the chances of successfully executing the transaction. These actions include actions to be performed within the processor executing the transaction, and/or actions to be performed against conflicting processors. 1. A method of facilitating processing within a computing environment , said method comprising:tracking, by a processor of the computing environment, a number of times a transaction executing within the processor aborts, the transaction effectively delaying committing transactional stores to main memory until completion of a selected transaction, and the tracking employing a counter within the processor to track the number of aborts;determining whether the transaction has successfully completed, and based on the transaction successfully completing, automatically resetting the counter to a predefined value; and reaching by the counter a threshold number of aborts for the transaction causing an interrupt to be presented for the transaction; or', 'presenting an interrupt of the transaction in which the transaction is not re-executed., 'based on the transaction aborting, automatically resetting the counter to the predefined value based on one of the following2. The method of claim 1 , further comprising based on the transaction aborting claim 1 , determining whether the counter has reached the threshold number ...

Подробнее
Номер записи: 46
02-01-2014 дата публикации

METHOD FOR SELECTING STORAGE CLOUD FOR STORAGE OF ENTITY FILES FROM PLURALITY OF STORAGE CLOUDS, AND COMPUTER AND COMPUTER PROGRAM THEREFOR

Номер: US20140006350A1
Автор: FUKUI YUTO, Furuichi Sanehiro, Tada Masami
Принадлежит:

A technique to enable the user of storage clouds to use of a plurality of storage clouds without the user of storage clouds being aware of which data is being entrusted to which storage cloud and without sacrificing safety or ease-of-use by selecting at least one storage cloud to store an entity file storable in a cloud-utilizing terminal from among a plurality of storage clouds connected via a network to the cloud-utilizing terminal. This technique includes referencing the attributes or context of an entity file, or the attributes of a virtual folder and each attribute of a plurality of storage clouds, in response to the creation or update of the entity file in the virtual folder in the cloud-utilizing terminal, and selecting at least one storage cloud from among a plurality of storage clouds for storing the entity file so as to satisfy predefined rules. 1. A method for selecting at least one storage cloud to store an entity file storable in a cloud-utilizing terminal from among a plurality of storage clouds connected via a network to the cloud-utilizing terminal , the cloud-utilizing terminal having a virtual folder able to display links associated with entity files stored in each storage cloud of the plurality of storage clouds , comprising steps of:the cloud-utilizing terminal executing a step of referencing at least one of (i) attributes of a first entity file of the entity files and (ii) attributes of a first virtual folder and each attribute of the plurality of storage clouds, in response the creation or update of the first entity file in the first virtual folder in the cloud-utilizing terminal, and selecting at least one storage cloud from the plurality of storage clouds for storing the first entity file so as to satisfy predefined rules; anduploading the first entity file in the cloud-utilizing terminal to a selected storage cloud selected by the cloud-utilizing terminal, and a link to the uploaded first entity file being displayed in the first virtual ...

Подробнее
Номер записи: 47
02-01-2014 дата публикации

LOCATING AMBIGUITIES IN DATA

Номер: US20140006359A1
Автор: Whelan John Desmond
Принадлежит: The Boeing Company

A system comprising an associative memory, an input module, a query module, and a display module. The input module is configured to receive a value within a first perspective of the associative memory. The query module is configured to perform an open query of the associative memory using the value, perform the open query within at least one of an insert perspective and a second perspective of the associative memory. The at least one of the insert perspective and the second perspective has as many or more category associations for the value relative to the first perspective. The display module is configured to display a result of the query and to display a list of one or more potential ambiguities that result from the open query. 1. A system comprising:a processor;an associative memory comprising a plurality of data and a plurality of associations among the plurality of data, wherein the plurality of data is collected into associated groups, and wherein the associative memory is configured to be queried based on at least one relationship, selected from a group that includes direct and indirect relationships, among the plurality of data in addition to direct correlations among the plurality of data;an input module configured to receive a value within a first perspective of the associative memory, wherein the first perspective comprises a first choice of context for a group of data within the plurality of data;a query module configured to perform an open query of the associative memory using the value, wherein the query module is further configured to perform the open query within at least one of an insert perspective and a second perspective of the associative memory, wherein the insert perspective comprises a type of perspective which is configured to be fed back into the associative memory, wherein the second perspective comprises a second choice of context for the group of data, and wherein the at least one of the insert perspective and the second perspective has ...

Подробнее
Номер записи: 48
02-01-2014 дата публикации

Management apparatus and management method

Номер: US20140006360A1
Автор: Yasuomi Iriyama
Принадлежит: Fujitsu Ltd

A management apparatus includes a processor coupled to a memory. The processor is configured to identify, in a case that a first file is updated or deleted, a second file that has a reference relation with the first file by referring to correspondence information indicating a correspondence between a referred-to-by file and a referred-to file, and check consistency between the second file and the first file.

Подробнее
Номер записи: 49
02-01-2014 дата публикации

CONFLICT RESOLUTION VIA METADATA EXAMINATION

Номер: US20140006361A1
Автор: Abaraoha Okacey Chidinma, Akinyemi Adedeji Olumuyiwa, Remick Brian Douglas
Принадлежит: MICROSOFT CORPORATION

A computing device detects a synchronization conflict between two versions of a file. In particular, the file may comprise a digital photo. The computing device may characterize a nature of a difference between metadata fields as immutable, mergeable, or subsumable. Core metadata fields may be defined such that a nature of a difference, or conflict, is categorized as immutable. Non-core metadata fields may be defined such that a nature of a difference, or conflict, is characterized as either mergeable or subsumable. A conflict between corresponding mergeable non-core metadata fields may be resolved by merging values of the corresponding non-core metadata fields. A conflict between corresponding subsumable non-core metadata fields may be resolved by replacing a value of a non-core metadata field of an older of the two versions of the file with a value of a corresponding non-core metadata field of a younger of the two versions of the file. 1. A computing device comprising:at least one processor; and determining whether a first copy of a file differs from a second copy of the file; and the first copy of the file and the second copy of the file each including respective content and respective metadata;', 'determining whether all core metadata fields of the first copy of the file match corresponding core metadata fields of the second copy of the file;', 'if all of the core metadata fields of the first copy of the file are determined to match the corresponding core metadata fields of the second copy of the file:', 'categorizing a nature of differences of one or more metadata fields of the first copy of the file with respect to one or more corresponding metadata fields of the second copy of file, and', 'resolving a conflict of the one or more metadata fields of the first copy of the file with respect to the one or more corresponding metadata fields of the second copy of the file based on the categorized nature of the differences., 'a memory connected with the at least one ...

Подробнее
Номер записи: 50
09-01-2014 дата публикации

SYSTEM AND METHOD FOR PERFORMING SHARD MIGRATION TO SUPPORT FUNCTIONS OF A CLOUD-BASED SERVICE

Номер: US20140012814A1
Автор: Bercovici Tamar, Jourda Florian, Trombley-Shapiro Benjamin
Принадлежит:

Systems and methods of maintaining a horizontally scaled database based on data ownership for a cloud-based platform (e.g., cloud-based collaboration and/or storage platform/service) are disclosed. The system database comprises multiple shard databases, and all files and folders owned by a user are stored on a single shard database. When a user transfers ownership of a file and/or a folder to a second user, the transferred file and/or folder is stored on the shard database that stores all of the data for the second user. 1. A method of database partitioning comprising:partitioning a database into multiple shard databases based upon ownership of objects stored in the database, wherein objects owned by a given user are stored in a single shard database, andfurther wherein a user-initiated action that transfers ownership of an object from a first user to a second user results in movement of the object from a first shard database associated with the first user to a second shard database associated with the second user;maintaining a mapping database that maps database object identifications to shard database identifications indicating in which one of the multiple shard databases respective objects are stored.2. The method of claim 1 , wherein at least a subset of users of the database are associated with an enterprise account provided by a cloud-based platform claim 1 , and further wherein objects owned by the subset of users are stored in a single shard database.3. The method of claim 2 , further comprising:permitting an administrator of the enterprise account to query database objects owned by the subset of users associated with the enterprise account.4. The method of claim 1 , further comprising:receiving a database-related request for a first object;upon determining that the request involves transfer of ownership of the first object from a given first user to a given second user, identifying a first shard database that stores objects owned by the first given user and ...

Подробнее
Номер записи: 51
09-01-2014 дата публикации

EVALUATION APPARATUS, DISTRIBUTED STORAGE SYSTEM, EVALUATION METHOD, AND COMPUTER READABLE RECORDING MEDIUM HAVING STORED THEREIN EVALUATION PROGRAM

Номер: US20140012816A1
Автор: Iizawa Ken, KATO Jun, Kumano Tatsuo, Maeda Munenori, Ozawa Toshihiro, Tamura Masahisa
Принадлежит: FUJITSU LIMITED

An evaluation apparatus includes: a calculation unit configured to calculate the evaluation value of the evaluation target content by using an evaluation value estimation algorithm, based on a count value for the evaluation target content and a sum value of respective count values for the plurality of contents; a verification unit configured to verify whether the sum value of the respective count values for the plurality of contents reaches a predetermined value; and a processing unit configured to reduce the respective count values of the plurality of contents, when the sum value of the respective count values for the plurality of contents reaches the predetermined value, and is capable of detecting a sudden data spike at high speed in the evaluation value estimating algorithm. 1. An evaluation apparatus which estimates an evaluation value for an evaluation target content among a plurality of contents , the apparatus comprising:a calculation unit configured to calculate the evaluation value of the evaluation target content by using an evaluation value estimation algorithm, based on a count value for the evaluation target content and a sum value of respective count values for the plurality of contents;a verification unit configured to verify whether the sum value of the respective count values for the plurality of contents reaches a predetermined value; anda processing unit configured to reduce the respective count values of the plurality of contents, when the sum value of the respective count values for the plurality of contents reaches the predetermined value.2. The evaluation apparatus according to claim 1 , wherein the processing unit reduces the respective count values for the plurality of contents by (1−α) times (0<α<1).3. The evaluation apparatus according to claim 1 , wherein the processing unit converts the reduced count values into integer values by rounding up to the reduced count values for the plurality of contents.4. The evaluation apparatus according ...

Подробнее
Номер записи: 52
09-01-2014 дата публикации

Statistics Mechanisms in Multitenant Database Environments

Номер: US20140012817A1
Автор: Collins Jesse, Kim Hoon, Rajan Chirag
Принадлежит:

Statistics mechanisms in multitenant database environments. A master statistics file is maintained in a multitenant database system. The master statistics file has statistics corresponding to multiple tenants within the multitenant database system. Statistics for a selected table within the multitenant database system are generated. The selected table corresponding to a selected tenant of the multitenant database system. The master statistics file is updated based on the generated statistics for the selected table. 1. A method comprising:maintaining a master statistics file in a multitenant database system, the master statistics file having statistics corresponding to multiple tenants within the multitenant database system;generating statistics for a selected table within the multitenant database system, the selected table corresponding to a selected tenant of the multitenant database system; andupdating the master statistics file based on the generated statistics for the selected table.2. The method of wherein generating statistics for the selected table comprises:determining a total number of rows in the selected table;determining a number of disk blocks the selected table uses; anddetermining an average length of rows in the selected table.3. The method of wherein generating statistics for the selected table comprises claim 1 , for an index within the selected table:determining a number of rows in the index;determining a number of leaf blocks for the index; anddetermining a number of distinct keys for the index.4. The method of wherein generating statistics for the selected table further comprises:determining an average number of leaf blocks per key;determining an average number of data blocks per key;determining a clustering factor; anddetermining a B-tree level.5. The method of wherein generating statistics for the selected table comprises:determining a number of distinct keys for one or more columns within the selected table;determining a number of nulls in ...

Подробнее
Номер записи: 53
09-01-2014 дата публикации

Automatic Consistent Sampling For Data Analysis

Номер: US20140012819A1
Автор: Gorelik Alexander
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method, computer program product, and system for analyzing data within one or more databases, comprising selecting one or more databases for analysis, each database comprising one or more database objects comprising one or more data values, applying a function to each data value in each database object within the one or more databases, where the function produces function values limited to a predetermined range, identifying for analysis the data values producing a certain function value within the predetermined range to form a sampled data set, and analyzing the sampled data set to determine relationships between the database objects within and across the one or more databases. 1. A computer-implemented method of analyzing data within one or more databases , comprising:selecting one or more databases for analysis, each database comprising one or more database objects comprising one or more data values;applying a function to each data value in each database object within the one or more databases, wherein the function produces function values limited to a predetermined range;identifying for analysis the data values producing a certain function value within the predetermined range to form a sampled data set; andanalyzing the sampled data set to determine relationships between the database objects within and across the one or more databases.2. The method of claim I , wherein said analysis further comprises determining one or more primary key-foreign key relationships between the database objects within and across the one or more databases.3. The method of claim 1 , wherein the data values in each database object are arranged in columns claim 1 , and further comprising:identifying for analysis the data values that do not produce the certain function value to form an unsampled data set, unless the data values are in a high cardinality column; andanalyzing the unsampled data set with the sampled data set to determine relationships between the database objects within and ...

Подробнее
Номер записи: 54
09-01-2014 дата публикации

RELIABLE PROFILING FOR MONITORING SYSTEMS

Номер: US20140012821A1
Автор: Flinsenberg Ingrid Christina Maria, Fuhrmann Peter, Hu Hao
Принадлежит: KONINKLIJKE PHILIPS N.V.

The present invention relates to an apparatus and method for analyzing building auditing information to identify irregular usage patterns and incorrect audit information. The auditing information, such as energy consumption, is analyzed using presence information at room or zone level. Based on pre-selected expectations, clustering is applied to data sets. By using different criteria, the clustering results are examined within every cluster and among clusters to find irregular information. Furthermore, through cross-checking with other background information, irregular usage pattern can be found and incorrect audit information can be identified, so that succeeding energy prediction and decision-support algorithms can work on a reliable set of profiles. 1. An apparatus for analyzing a building energy/lighting auditing information retrieved by a monitoring system , said apparatus comprising: a dedicated or disturbed processor including:a. a clustering unit for clustering data sets of said building energy/lighting auditing information based on at least one predetermined clustering criteria relating to a building's characteristics and/or energy/lighting usage pattern(s) to obtain clusters with a commonality;b. a comparison unit for comparing clusters obtained by said clustering stage based on at least one predetermined comparison criteria to determine potential candidates for irregular or incorrect clusters; andc. a checking unit for cross-checking candidates determined by said comparison stage with background information relating to a specific condition of the building's energy/lighting use including at least one of building room types(s), calendar information, time or user schedules to determine irregular energy/lighting usage patterns or incorrect auditing information.2. The apparatus according to claim 1 , further comprising an audit stage for processing auditing information from which incorrect data sets have been removed and for translating said auditing ...

Подробнее
Номер записи: 55
23-01-2014 дата публикации

DATA MANAGEMENT IN A DATA VIRTUALIZATION ENVIRONMENT

Номер: US20140025646A1
Автор: Canales Valenzuela Carolina, Sanchez Herrero Juan Antonio
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

The invention relates to a system handling a plurality of data sets stored in different repositories (), the system comprising a data managing unit () configured to provide processing rules for processing the data sets stored in the different repositories, the processing rules including access rules providing information which of the data repositories should be accessed in the case of a data access request for one of the data sets, the processing rules further including consistency enforcement rules providing correction actions when an inconsistency for said one data set stored in different data repositories is detected. Furthermore, a virtualizing unit is detected which is configured to control data access requests for the data sets and configured to enforce the processing rules provided by the data managing unit (), wherein, when the data virtualizing unit () detects the data access request for said one data set, the data virtualizing unit handles the data access request for said one data set, accesses at least two repositories () where said one data set is stored based on the access rules, and corrects a detected inconsistency for said one data set based on the consistency enforcement rules. 1310320. A system handling a plurality of data sets stored in different repositories ( , ) , the system comprising:{'b': '200', 'a data managing unit () configured to provide processing rules for processing the data sets stored in the different repositories, the processing rules including access rules providing information which of the data repositories should be accessed in the case of a data access request for one of the data sets, the processing rules further including consistency enforcement rules providing correction actions when an inconsistency for said one data set stored in different data repositories is detected,'}{'b': 100', '200', '100', '310', '320, 'a virtualizing unit () configured to control data access requests for the data sets and configured to enforce the ...

Подробнее
Номер записи: 56
23-01-2014 дата публикации

Normalization Engine to Manage Configuration Management Database Integrity

Номер: US20140025647A1
Автор: Kumar Narayan, Mueller Douglas, Rangarajan Govindarajan, Wallace Darius
Принадлежит: BMC SOFTWARE, INC.

Data is often populated into Configuration Management Databases (CMDBs) from different sources. Because the data can come from a variety of sources, it may have inconsistencies—and may even be incomplete. A Normalization Engine (NE) may be able to automatically clean up the incoming data based on certain rules and knowledge. In one embodiment, the NE takes each Configuration Item (CI) or group of CIs that are to be normalized and applies a rule or a set of rules to see if the data may be cleaned up, and, if so, updates the CI or group of CIs accordingly. In particular, one embodiment may allow for the CI's data to be normalized by doing a look up against a Product Catalog and/or an Alias Catalog. In another embodiment, the NE architecture could be fully extensible, allowing for the creation of custom, rules-based plug-ins by users and/or third parties. 1. A computer program product , the computer program product being tangibly embodied on a non-transitory computer-readable storage medium and comprising instructions that , when executed by at least one processor , are configured to:communicate with one or more resources via a network;identify at least one inconsistency with incoming data received from the one or more resources; andnormalize the incoming data received from the one or more resources by cleaning the incoming data to reconcile the at least one inconsistency.2. The computer program product of claim 1 , wherein the one or more resources include one or more data providers including one or more external data providers.3. The computer program product of claim 1 , wherein the instructions that are configured to identify the at least one inconsistency with the incoming data include instructions that claim 1 , when executed by the at least one processor claim 1 , are configured to:apply one or more rules stored in a repository to the incoming data received from the one or more resources.4. The computer program product of claim 3 , wherein the rules include ...

Подробнее
Номер записи: 57
23-01-2014 дата публикации

Method of Optimizing Data Flow Between a Software Application and a Database Server

Номер: US20140025648A1
Автор: Clothier Matthew, Corbett Sean, Elliott Edward Philip Edwin
Принадлежит: Data Accelerator Ltd.

A method may include receiving a request for a resource on a database server, the request being from a request initiator coupled to a network. Redundant data in the request is identified based on the data optimization rules, where the redundant data is unnecessary for the database server to satisfy the request for the resource. The redundant data is removed from the request based on the data optimization rules to create an optimized request. The optimized request is provided, using the network to the database server. 1. A method comprising:receiving a request for a resource on a database server, the request being from a request initiator coupled to a network;identifying, based on data optimization rules, redundant data in the request, the redundant data being unnecessary for the database server to satisfy the request for the resource;removing, based on the data optimization rules, the redundant data from the request to create an optimized request;providing, using the network, the optimized request to the database server.2. The method of claim 1 , wherein the data optimization rules instruct caching the redundant data to produce a cached portion of the request claim 1 , the optimized request comprising the cached portion of the request.3. The method of claim 2 , wherein the data optimization rules instruct satisfying at least a portion of the request with the cached portion of the request.4. The method of claim 1 , wherein the data optimization rules instruct compressing the request to produce the optimized request.5. The method of claim 1 , wherein the data optimization rules instruct compressing the request based on one or more of a performance measure of the network and a processing measure of the request initiator.6. The method of claim 1 , wherein the data optimization rules instruct pre-caching the request if the resource has been previously requested by the request initiator.7. The method of claim 1 , wherein the data optimization rules instruct:determining if ...

Подробнее
Номер записи: 58
06-02-2014 дата публикации

METHOD AND APPARATUS FOR UPDATING PERSONAL INFORMATION IN COMMUNICATION SYSTEM

Номер: US20140040188A1
Автор: KIM Wuk, Lee Kyung-Tak, Oh Gyu-Bong
Принадлежит: SAMSUNG ELECTRONICS CO., LTD.

A method and an apparatus for updating personal information in a communication system supporting a Converged Address Book (CAB) service are provided. The apparatus and method includes importing external personal profile information from a non-CAB system, and updating personal information in accordance with a user preference-based synchronization method using the external personal profile information. 1. A method for updating personal information by a Converged Address Book (CAB) eXtensible Markup Language (XML) Document Management Server (XDMS) in a communication system supporting a CAB service , the method comprising:receiving a profile import request from a CAB client;providing profile import request information to a CAB server;storing external personal profile information that the CAB server has imported from a non-CAB system, as a new personal profile information document in accordance with an instruction of the CAB server;setting an update type of personal profile information as ‘profile import’ in the personal profile information document stored in the CAB XDMS; andsetting and storing an approval type depending on a user preference checked by the CAB server.2. The method of claim 1 , further comprising notifying changes in the personal profile information to the CAB client.3. The method of claim 2 , further comprising:if the user preference is set as ‘manual’, receiving, from the CAB client, modified personal profile information in which changes selected depending on a CAB user's choice are reflected among the notified changes, and updating only the changes selected by the CAB user in the personal profile information.4. The method of claim 2 , further comprising:if the user preference is set as ‘manual’, causing a reference link indicating a location, in which the new personal profile information is stored, to be included in the personal profile information document;providing newly generated personal profile information to the CAB client using the reference ...

Подробнее
Номер записи: 59
06-02-2014 дата публикации

METHOD FOR ENCODING A MESH MODEL, ENCODED MESH MODEL AND METHOD FOR DECODING A MESH MODEL

Номер: US20140040215A1
Автор: Cai Kangying, Meng Wei Liang, Tian Jiang
Принадлежит: THOMSON LICENSING

Many 3D mesh models have a large number of small connected components that are repeated in various positions, scales and orientations. The respective positions are defined by the position of at least one reference point per component. For an enhanced encoding of the positions of the respective reference points, a given space is divided into segments and the number of points lying in each particular segment is determined. When a cell with at least n points is subdivided into child cells, an indication is added indicating if all points of a parent are in only one child cell. If so, the index of the only non-empty child node is encoded, while otherwise the number of points in one of the two child cells is decremented and encoded. The invention avoids non-effective subdivisions of a cell, and therefore improves the compression efficiency. 1. A method for encoding points of a mesh model using a hierarchical tree , wherein the method comprises steps ofencoding a value being the total number of points;recursively dividing a bounding box around the points of the mesh model, wherein each dividing step divides a current parent cell into a pre-defined number of child cells, and for each dividing step performing the steps ofdetermining a current parent cell and a total number of points included in the current parent cell;determining if the current parent cell includes at least a minimum number of points;if the current parent cell includes not at least said minimum number of points, encoding a code word that comprises a number of points within a pre-defined one of the child cells, and otherwisedetermining a point distribution, wherein it is determined whether all points of the current parent cell are within a single child cell according to the current dividing step; andencoding a code word, wherein the code word begins with an indication, and whereinif not all points of the current parent cell are in a single child cell according to said determined point distribution, the ...

Подробнее
Номер записи: 60
06-02-2014 дата публикации

METHODS AND SYSTEMS FOR AN INTENT LOCK ENGINE

Номер: US20140040218A1
Автор: Graefe Geotz, Kimura Hideaki, Kuno Harumi
Принадлежит:

In at least some examples, a system may include a processor core and a non-transitory computer-readable memory in communication with the processor core. The non-transitory computer-readable memory may store an intent lock engine to manage intent locks based on a private lock table for each process associated with said processor core and a global lock table for a plurality of processes associated with at least one of a plurality of processor cores including said processor core. 1. A system , comprising:a processor core; anda non-transitory computer-readable memory in communication with the processor core and storing an intent lock engine to manage intent locks based on a private lock table for each process associated with said processor core and a global lock table for a plurality of processes associated with at least one of a plurality of processor cores including said processor core.2. The system of claim 1 , wherein upon receipt of an intent lock request claim 1 , the intent lock engine causes a process associated with said processor core to check its private lock table for an intent lock compliant with the intent lock request before submitting the intent lock request to the global lock table.3. The system of claim 2 , wherein the intent lock engine claim 2 , when the intent lock request is submitted to the global lock table claim 2 , increments a counter separate from the global lock table for an intent lock type associated with the intent lock request.4. The system of claim 1 , wherein the private lock table and the global lock table track share mode locks claim 1 , share mode intent locks claim 1 , exclusive mode locks claim 1 , and exclusive mode intent locks.5. The system of claim 1 , wherein the intent lock engine causes a process associated with the processor core to apply a mutex lock when the intent lock request corresponds to an absolute lock.6. The system of claim 1 , wherein the intent lock engine claim 1 , when an intent lock corresponding to the ...

Подробнее
Номер записи: 61
13-02-2014 дата публикации

SUPPORT FOR COMPENSATION AWARE DATA TYPES IN RELATIONAL DATABASE SYSTEMS

Номер: US20140046919A1
Автор: Yalamanchi Aravind
Принадлежит: ORACLE INTERNATIONAL CORPORATION

Techniques are provided for extending a business transaction framework to support user-provided compensation logic for business transactions. The extensibility framework may be used to implement user-defined semantics for (a) validating concurrent updates to shared data and (b) performing compensating actions when an associated transaction is aborted. In one embodiment, the extensibility and the compensation are provided at the data-type level. User-provided logic also maintains summaries that include values that are externalized so that they may be referenced in user-provided operational constraints. 1. A method for performing shared updates , comprising:receiving user-provided logic for determining whether updates to a particular column are valid in the presence of concurrent updates to the same value;receiving a request, associated with a particular business transaction, to perform an update to a value in the particular column; and (a) determining, for the particular column, at least one of a projected value and a confirmed value;', invoking the user-provided logic, and', 'passing, to the user-provided logic, the at least one of the projected value and the confirmed value to enable the user-provided logic to determine whether the update should be allowed based, at least in part, on one or more constraints on the value of the particular column and the at least one of the projected value and the confirmed value;, '(a) causing the user-provided logic to generate an indication of whether the update should be allowed, in the presence of concurrent updates to the same value, by, '(c) determining whether to allow the update based, at least in part, on the indication., 'in response to the request2. The method of wherein:the step of receiving user-provided logic includes receiving an implementation of a method of a customized data classification type; andthe step of invoking the user-provided logic includes making a call to the implementation of the method.3. The method ...

Подробнее
Номер записи: 62
20-02-2014 дата публикации

REMOTELY UPDATED TOOLBAR LANGUAGE TRANSLATION SERVICE

Номер: US20140052702A1
Автор: Fierro Alex, Gozman Dmitry, Shlyapnikov Aleksey Nikolayevich, Vayvod Anton Viktorovich
Принадлежит: GOOGLE INC.

A translation service provided by a browser toolbar may be automatically updated. In one implementation, a device may obtain a version identifier corresponding to a first configuration file, stored locally by the device, that includes configuration options relating to a language translation service provided by a browser toolbar implemented by the device. The device may request a version identifier corresponding to a second configuration file, stored at an update server and determine whether the second configuration file is different than the first configuration file. The device may download the second configuration file when the second configuration file is different than the first configuration file may update operation of the language translation service based on the obtained options. 1. A computing device implemented method comprising:obtaining, by the device, a version identifier corresponding to a first configuration file, stored locally by the device, that includes configuration options relating to a language translation service provided by a browser toolbar implemented by the device;requesting, by the device, and without intervention by a user of the device, a version identifier corresponding to a second configuration file, stored at an update server;determining, by the device and based on the version identifiers corresponding to the first and second configuration files, whether the second configuration file is different than the first configuration file;downloading, by the device, the second configuration file, from the update server, when the second configuration file is different than the first configuration file;parsing, by the device, the second configuration file to obtain updated configuration options relating to the language translation service provided by the browser toolbar; andupdating, by the device, operation of the language translation service based on the obtained options.2. The method of claim 1 , further comprising:overwriting, when the ...

Подробнее
Номер записи: 63
13-03-2014 дата публикации

DYNAMIC ANOMALY, ASSOCIATION AND CLUSTERING DETECTION

Номер: US20140074796A1
Автор: Akoglu Leman, Tong Hanghang
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Techniques are provided for dynamic anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data containing one or more attributes. One or more clusters associated with one or more of the code tables are established. One or more new data points are received. A determination is made if a given one of the new data points is an anomaly. At least one of the one or more code tables is updated responsive to the determination. When a compression cost of a given one of the new data points is greater than a threshold compression cost for each of the one or more clusters, the given one of the new data points is an anomaly. 1. A method , comprising:building one or more code tables for each attribute in a set of data containing one or more attributes;establishing one or more clusters associated with one or more of the code tables;receiving one or more new data points;determining if a given one of the new data points is an anomaly; andupdating at least one of the one or more code tables responsive to the determination;wherein at least one of the building, establishing, receiving, determining and updating steps are performed by a processor device.2. The method of claim 1 , wherein the building step comprises:counting the number of appearances of each attribute value;estimating the bit length of required to compress each attribute value; andcalculating the usage of each attribute value.3. The method of claim 1 , wherein each code table comprises a code word column claim 1 , a bit length column and a usage column.4. The method of claim 1 , further comprising a step of assigning the given one of the new data points to an existing cluster when the given one of the new data points is determined not to be an anomaly.5. The method of claim 4 , wherein the step of assigning the given one of the new data points to an existing cluster comprises:calculating a compression cost of the given one of the new data points for each of the one ...

Подробнее
Номер записи: 64
13-03-2014 дата публикации

System and Method for Providing Version Management Services Within a Collaborative Content Editing Environment

Номер: US20140074807A1
Автор: Burns Michael J., Kane-Esrig Yana
Принадлежит: Alcatel-Lucent USA Inc.

A plurality of versions of an object are stored in a memory. A plurality of votes relating to the plurality of versions are received from a plurality of parties. A version of the object is selected from among the plurality of versions, based on the plurality of votes. A second plurality of versions of the object are generated based on the selected version. Metadata associated with the selected version is stored, the metadata comprising first data specifying the plurality of parties from whom votes were received and second data specifying the votes received. In one embodiment, the object is an architectural design. 1. A method comprising:storing a plurality of versions of an object in a memory;receiving, from a plurality of parties, a plurality of votes relating to the plurality of versions;selecting a version of the object from among the plurality of versions, based on the plurality of votes;generating one or more versions of the object based on the selected version; andstoring metadata associated with the selected version, the metadata comprising first data specifying the plurality of parties from whom votes were received and second data specifying the votes received.2. The method of claim 1 , wherein the object is an architectural design.3. The method of claim 1 , further comprising:providing access to the plurality of versions via a network; andreceiving the plurality of votes via the network.4. The method of claim 1 , further comprising:generating a development history tree indicating relationships among the plurality of versions; andproviding an animation showing a chronological development of the plurality of versions based on the development history tree.5. The method of claim 1 , wherein the metadata associated with the selected version further comprises third data specifying a plurality of elements associated with the selected version and fourth data specifying claim 1 , for each respective element among the plurality of elements claim 1 , a contributor who ...

Подробнее
Номер записи: 65
20-03-2014 дата публикации

METHOD AND SYSTEM FOR SECURE AUTOMATED DOCUMENT REGISTRATION FROM SOCIAL MEDIA NETWORKS

Номер: US20140081932A1
Автор: KRISLOV Clinton A.
Принадлежит:

A method and system for secure automated document registration with social media. A secure cloud transformed electronic document is created on an application on a target network device from an original electronic document. The original electronic document is electronic text, audio, video or pictures from a social media network or from a telecommunications network. The secure cloud transformed electronic document is made viewable via the target network device and other target devices from anywhere on a cloud communications network or on a social media network without the ability to tamper with the information within the secure cloud transformed electronic document. This provides an automatic secure electronic document registration system on the cloud communications network and the social media network. 1. A method for automatic registration of electronic documents from social media networks with cloud computing , comprising:receiving an original electronic document on a first application in a non-transitory computer readable medium on a target network device with one or more processors from a social media network via a cloud communications network;automatically applying via the first application a first set of electronic document registration rules to the original electronic document, wherein the first set of electronic document registration rules include document registration rules applied to all electronic document being registered via an automatic document registration system, thereby creating a first level modified electronic document;automatically applying via the first application a second set of electronic document registration rules to the first level modified electronic document thereby creating a second level modified electronic document, wherein the second set of electronic document registration rules include local document registration rules applied only via the first application on the target network device;automatically transforming via the first ...

Подробнее
Номер записи: 66
27-03-2014 дата публикации

Methods for determining event counts based on time-sampled data

Номер: US20140089270A1
Автор: Graham Stephen Wood, John Beresniewicz, Uri Shaft
Принадлежит: Oracle International Corp

A method for determining event counts for a database system includes capturing samples for the active sessions based on a pre-defined sampling frequency and identifying events from the captured samples. The method further includes determining the wait time for each of the identified events and determining an event count for the active sessions using a harmonic mean. The harmonic mean is a summation of the maximum of either one or the ratio of the sampling frequency to the determined wait time for each of the identified events.

Подробнее
Номер записи: 67
03-04-2014 дата публикации

Message Validation in a Service-Oriented Architecture

Номер: US20140095454A1
Автор: George David P., Marcoli Carlo
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Message validation in a service-oriented architecture defines a message structure using XML data types. Context-independent validity constraints are specified using an XML schema. Context-specific validity constrains are specified in an intermediary data structure for a specific service operation. A service interface including the XML schema and the intermediary data structure is published. 1. A method of removing a hard link between validation constraints and data types in a service-oriented architecture , comprising:receiving a message according to an XML data type;validating the message, using a processor, according to context-independent validity constraints of an XML schema with reference to XML schema definitions; 'publishing a service interface including the XML schema and the intermediary data structure, said intermediary data structure including said context-specific validity constraints; and', 'validating the message, using the processor, according to context-specific validity constraints of an intermediary data structure for a specific service operation with reference to intermediary data structure definitions, wherein all of said context-specific validity constraints are required for said specific service operation;'}decoupling specific validity constraints from the data types by maintaining generality with said context-independent validity constraints using an XML schema that apply to service operations in the service-oriented architecture and adding validation specificity with said intermediary data structure including said context-specific validity constraints for use with said specific service operation added to the service-oriented architecture, wherein the general reusability of the context-independent validity constraints using an XML schema is maintained2. The method of claim 1 , wherein the message is populated according to an intermediary data structure defining elements or attributes of the data type that are mandatory in the context of a ...

Подробнее
Номер записи: 68
05-01-2017 дата публикации

AUTOMATIC EXPIRING OF CACHED DATA

Номер: US20170004049A1
Автор: COMAN Alexandru Adrian
Принадлежит:

A method includes determining a time shift for data validity windows corresponding to a user, receiving a request for an incremental data update from the user, the user having cached data, determining that the request for the incremental data update is received within an unexpired data validity window for the cached data, wherein the data validity window is based on the determined time shift and in a case the incremental data update is received within the unexpired data validity window for the user, determining that the user is eligible for the incremental data update. 1. A computer-implemented method comprising:receiving a request from at least one client device of a plurality of client devices for an incremental data update, the at least one client device having cached data, the request including a data validity window corresponding to the at least one client device, the data validity window having a start time shifted based on an identifier associated with the at least one client device, the start time of the data validity window being shifted differently for at least two client devices of the plurality of client devices;determining whether the request is received within an unexpired data validity window for the identifier associated with the at least one client device, the unexpired data validity window being a predetermined data validity window with a start time adjusted by a predetermined time shift corresponding to the identifier; andsending the incremental data update to the at least one client device when the request is received within the unexpired data validity window.2. The computer-implemented method of claim 1 , further comprising:sending a set of full client data to the at least one client device for replacing the cached data when the request is not received within the unexpired data validity window.3. The computer-implemented method of claim 1 , wherein the data validity window starts and ends at a different time for each client device of the ...

Подробнее
Номер записи: 69
05-01-2017 дата публикации

VISUAL SEARCH METHOD, SYSTEM AND MOBILE TERMINAL

Номер: US20170004148A1
Автор: Liu Ming
Принадлежит:

The present disclosure discloses a visual search method, system and a mobile terminal. The visual search method includes: collecting, by a mobile terminal, an image, acquiring an image complexity parameter of the image, sending the image to a serving end for the serving end to perform image search and receiving a search result fed back by the serving end when a value of the image complexity parameter is not within a preset range; and performing image search locally in a mobile terminal according to the image when the value of the image complexity parameter is within the preset range. 1. A visual search method , comprising:collecting, by a mobile terminal, an image, and acquiring an image complexity parameter of the image;sending the image to a serving end for the serving end to perform image search when a value of the image complexity parameter is not within a preset range, and receiving a search result fed back by the serving end; andperforming image search locally in the mobile terminal according to the image when the value of the image complexity parameter is within the preset range.2. The visual search method of claim 1 , wherein a step of acquiring an image complexity parameter of the image comprises:performing comparative feature extraction on the image and acquiring an image feature grouping mapping table;incorporating comparative features according to the image feature grouping mapping table and counting number of pixel points corresponding to comparative features which can be incorporated into one class; andcalculating to obtain an image complexity coefficient according to a number counting result and the image feature grouping mapping table.3. The visual search method of claim 2 , wherein a step of incorporating comparative features according to the image feature grouping mapping table comprises:converting the comparative features into binary comparative features; andincorporating the comparative features according to binary comparative features and the ...

Подробнее
Номер записи: 70
05-01-2017 дата публикации

INTEGRATING COPY DATA TOKENS WITH SOURCE CODE REPOSITORIES

Номер: US20170004154A1
Автор: BLUMENAU Steven M., Murphy Christopher, Sullivan James
Принадлежит:

Computerized systems and methods are provided for integrating copy data tokens with source code repositories. A first command associated with the version control system stores in the memory a copy of source code and a copy of the data token from the remote repository, comprising source data and mount data. A second command associated with the version control system is executed to create a version of the source code stored in the memory. Based on the execution of the second command a working copy of the copy data is created based on the data token for use with the version of the source code, comprising creating a copy of the copy data from the data source based on the source data, and mounting the working copy to the device based on the mount data, thereby automatically managing the copy data for the version control system. 1. A computerized method for integrating a data token into a version control system , the data token defining attributes for copy data associated with the data token to facilitate the automatic management of the copy data for the version control system , the computerized method comprising: source data for the copy data indicative of a data source for the copy data; and', 'mount data indicative of a device to which the computing device mounts the copy data;, 'executing, by a computing device with a processor and memory, a first command associated with the version control system configured to store in the memory (a) a copy of source code associated with the source code repository from a remote repository, and (b) a copy of the data token from the remote repository, the data token defining attributes associated with copy data for use with the source code repository, the attributes comprisingexecuting, by the computing device, a second command associated with the version control system configured to create a version of the source code stored in the memory; andcreating, by the computing device, based on the execution of the second command a working ...

Подробнее
Номер записи: 71
05-01-2017 дата публикации

MANAGEMENT OF LONG-RUNNING LOCKS AND TRANSACTIONS ON DATABASE TABLES

Номер: US20170004165A1
Автор: Fries Justin T., Lakshminarayanachar Venkataraghavan, Lalgowdar Rajesh C., Thyagaraj Lohitashwa
Принадлежит:

Establishment of an exclusive lock on each of an outer database ownership table and an inner database ownership table is attempted. In response to establishing the exclusive lock on each of the outer database ownership table and the inner database ownership table, a switch is made to a pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table. Release and re-acquisition of each of the pair of overlapping shared locks on the outer database ownership table and the inner database ownership table is alternated. 1. A method , comprising:attempting to establish, via at least one processor, an exclusive lock on each of an outer database ownership table and an inner database ownership table;switching, in response to establishing the exclusive lock on each of the outer database ownership table and the inner database ownership table, to a pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table; andalternating release and re-acquisition of each of the pair of overlapping shared locks on the outer database ownership table and the inner database ownership table.2. The method of claim 1 , where switching claim 1 , in response to establishing the exclusive lock on each of the outer database ownership table and the inner database ownership table claim 1 , to the pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table comprises:releasing the exclusive lock on each of the outer database ownership table and the inner database ownership table;acquiring the pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table;committing an exclusive lock transaction on each of the outer database ownership table and the inner database ownership table; andstarting processing of overlapping shared lock transactions on each of the outer database ownership table ...

Подробнее
Номер записи: 72
05-01-2017 дата публикации

UNSUPERVISED MULTISOURCE TEMPORAL ANOMALY DETECTION

Номер: US20170004166A1
Автор: Biem Alain E., Gao Jing, Turaga Deepak S., Vu Long H., Xiao Houping
Принадлежит:

In one embodiment, a computer-implemented method includes observing one or more entities by way of two or more data sources. A plurality of detection scores are computed by one or more detectors. Each detection score corresponds to an entity of the one or more entities, a detector of the one or more detectors, and a time. The plurality of detection scores are compiled into two or more tensors, where each tensor corresponds to a data source of the two or more data sources. The two or more tensors are compared to one another, by a computer processor. An inconsistency score is calculated for each of the one or more entities, based on comparing the two or more tensors to one another. 1. A computer-implemented method , comprising:observing one or more entities by way of two or more data sources;computing a plurality of detection scores by one or more detectors, wherein each detection score corresponds to an entity of the one or more entities, a detector of the one or more detectors, and a time;compiling the plurality of detection scores into two or more tensors, wherein each tensor corresponds to a data source of the two or more data sources;comparing, by a computer processor, the two or more tensors to one another; andcalculating an inconsistency score for each of the one or more entities, based on the comparing the two or more tensors to one another.2. The method of claim 1 , wherein the comparing the two or more tensors to one another comprises performing joint tensor factorization.3. The method of claim 2 , wherein the performing joint tensor factorization comprises:projecting the one or more tensors onto a common subspace; andidentifying differences between a remainder of the one or more tensors outside the common subspace.4. The method of claim 1 , wherein each tensor of the two or more tensors comprises a first dimension corresponding to the one or more entities claim 1 , a second dimension corresponding to the one or more detectors claim 1 , and a third dimension ...

Подробнее
Номер записи: 73
05-01-2017 дата публикации

SYSTEM FOR AUTOMATING DATA VALIDATION

Номер: US20170004167A1
Автор: Bauer Robert J., Early Stephen Isaac, Fawzi Mark Jeffrey
Принадлежит:

Embodiments of the invention are directed to systems, methods, and computer program products for automating data validation. The system is configured to receive the initial data set in the first data structure from a network of distributed servers; transform the initial data set into an expected data set having the second data structure using a first mapping logic; use the expected data set to validate a converted data set that was generated by converting the initial data set into the second data structure using a second mapping logic; and transmit control signals configured to cause a user device associated with the user to receive a notification indicating that the match is within the pre-determined tolerance level. 1. A system for automating data validation of data that has been converted from an initial data set having a first data structure to a converted data set having a second data structure during a data conversion procedure , the system comprising:one or more memory devices;one or more processing devices operatively coupled to the one or more memory devices; and receive the initial data set in the first data structure from a network of distributed servers;', 'transform the initial data set into an expected data set having the second data structure using a first mapping logic, wherein transforming further comprises mapping one or more fields associated with the initial data set into one or more fields associated with the expected data set, wherein the transformed data is stored in a database as the expected data set;', receiving the converted data set;', 'comparing the one or more fields associated with the expected data set with one or more fields associated with the converted data set;', 'determining a match between the one or more fields associated with the expected data set and the one or more fields associated with the converted data set based on at least the comparison; and', 'determining that the match between the one or more fields associated with ...

Подробнее
Номер записи: 74
05-01-2017 дата публикации

Methods and Devices For Handling Hash-Tree Based Data Signatures

Номер: US20170004168A1
Автор: HAKALA Harri, JAATINEN Mikael, LEHTINEN Hannu, MATTILA Leena
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

The disclosure relates to a method () of handling a hash-tree based data signature. The method () is performed in a first device () and comprises: receiving (), from a second device (), a data signature generation request, the request comprising an indication on type of storage of a generated data signature; generating (), in response to the data signature generation request, the data signature B using a hash-tree based data signing method; and providing (), to the second device (), a reference C to the generated data signature, wherein the generated data signature is obtainable by means of the reference C. The disclosure also relates to a method in a second device, corresponding devices, computer programs and computer program products. 1. A method of handling a hash-tree based data signature , the method being performed in a first device and comprising:the first device receiving, from a second device, a data signature generation request, the request comprising an indication on type of storage of a generated data signature,the first device generating, in response to the data signature generation request, a data signature B using a hash-tree based data signing method, andthe first device providing, to the second device, a reference C to the generated data signature B, wherein the generated data signature B is obtainable by means of the reference C.2. The method as claimed in claim 1 , wherein the indication on type of storage is set to indicate storage by the first device and wherein the method comprises storing the generated data signature B.3. The method as claimed in claim 1 , comprising:receiving, from the second device, a data signature verification request, the request comprising a hash A of a data asset and the reference C to the generated data signature,correlating the reference C with a stored data signature B, andverifying integrity of the data asset upon successfully correlating the reference C with the stored data signature B.4. The method as claimed in ...

Подробнее
Номер записи: 75
05-01-2017 дата публикации

Systems and methods for type coercion

Номер: US20170004169A1
Автор: John J. Beahan, JR., John W.L. Merrill
Принадлежит: Zestfinance Inc

Systems and methods for converting a data item provided by an external data provider system into a data type specified by a data processing system for a data field of the data item. A data processing system stores a coercion rule for each data field of a first data set provided by the data provider system. Each stored coercion rule identifies at least one data type for the corresponding data field. Responsive to a second data set provided by the data provider system, the data processing system coerces each data item of the second data set into at least one data type specified by the stored coercion rule for the data field of the data item to generate at least one converted data item of the second data set. The data processing system generates information from at least one converted data item, and provides the information to a consuming system.

Подробнее
Номер записи: 76
05-01-2017 дата публикации

Method And Apparatus For Reconstructing Cube In Multidimensional Online Analytical Processing System

Номер: US20170004170A1
Автор: Tu Dandan, Yin Bian, Zhang Yong
Принадлежит:

A method and an apparatus for reconstructing a cube in a multidimensional online analytical processing (MOLAP) system, where a cube is reconstructed based on a received reconstruction request and data stored in an old cube, and there is no need to acquire, from a database, data required for updating the cube, thereby ensuring data integrity when model reconstruction and data reconstruction are performed in the MOLAP system. 1. A method for reconstructing a cube in a multidimensional online analytical processing (MOLAP) system , comprising:receiving a reconstruction request submitted by a user, wherein the reconstruction request is used to reconstruct an old cube that is stored in a storage medium of the MOLAP system; andreconstructing the old cube according to the reconstruction request and data stored in the old cube to generate a new cube.2. The method according to claim 1 , wherein the reconstruction request comprises a model of the new cube claim 1 , and wherein reconstructing the old cube comprises:acquiring, from the old cube, second data that matches a data structure of the model of the new cube;loading the second data into the model of the new cube so as to generate the new cube; andstoring the new cube and deleting the old cube.3. The method according to claim 1 , wherein the reconstruction request comprises update data claim 1 , and wherein reconstructing the old cube comprises:determining a location of to-be-updated data in the old cube according to the update data; andupdating data stored in the location of the to-be-updated data to the update data to generate the new cube.4. The method according to claim 3 , wherein determining the location of the to-be-updated data in the old cube comprises:replicating the old cube;using the replicated old cube as a first cube; anddetermining the location of the to-be-updated data in the first cube according to the update data, and updating the data in the location of the to-be-updated data in the first cube to the ...

Подробнее
Номер записи: 77
05-01-2017 дата публикации

DISTRIBUTED SCALABLE POLICY BASED CONTENT MANAGEMENT

Номер: US20170004171A1
Автор: Craddock Julian, EISENER THANE, Haskins Paul, Leonard Glenda Ann, Rachow Waldo
Принадлежит:

A method for defining and constraining the behavior of a shared, mobile content management system is disclosed. The method includes providing an admin console for defining, modifying, and managing declarative policies. Declarative policies are defined based on an XML policy model. The XML policy model dictates the policies that can be expressed by the admin console. The defined declarative policies are enacted without requiring the content management system to be restarted, reconfigured, or re-implemented. An XML-based policy wizard definition language is provided to define policy wizards in the admin console that guide an administrator through the steps of creating and editing the policies. Additionally, at least one policy repository based on LDAP is provided. The at least one policy repository has an interface and is adapted to store a plurality of declarative policies. The policy repository has scalable and distributed capabilities. 126-. (canceled)27. A distributed , scalable policy filter architecture for a content management system comprising:a computer comprising a processor and a memory;a policy repository for storing a plurality of policies stored in the memory, the policy repository comprising an interface for allowing a content management engine run on the processor to retrieve the stored policies via a plurality of indexes of the stored policies, the indexes including a system trigger index and a condition index, each of the plurality of indexes being tied to a specific domain name in a directory; a plurality of filters that act as policy decision points, the plurality filters retrieving the relevant policies from the policy repository, the filters being adapted to retrieve and evaluate the policies via the interface of the policy repository, the evaluation of the policies by the plurality of filters to determine what system transactions are required in response to a content request; and the evaluation of the policies being performed in at least one of ...

Подробнее
Номер записи: 78
05-01-2017 дата публикации

METADATA MANAGER FOR ANALYTICS SYSTEM

Номер: US20170004187A1
Автор: Bengali Ketan, Chan Hon Yuk, Chang Ming, Patra Sasmita, Tung David
Принадлежит:

A metadata management system receives metadata changes and automatically updates a metadata architecture which maps the data. The metadata changes may be received through a simple user interface by a user or administrator. Once received, the system may automatically update schemas and data transformation code to process data according to the new data mapping preference. The system may handle metadata updates in a multi-tenant system having one or more applications per tenant, and may update data for a single tenant and 1 or more tenant applications in a multitenancy. 1. A method for managing metadata , the method comprising:maintaining data in a data collection store, wherein the data in the data collection store corresponds to a first format associated with a tenant application at a client device;receiving a portion selection over a computer network interface from the client device, wherein the portion selection identifies at least one portion of the maintained data and is selected via a user interface of the client device;transforming the at least one portion of the maintained data from the first format into a second format according to the received portion selection, wherein the transformed data in the second format is stored in a data repository according to a schema that associates an object name to the second format data stored in the data repository; andperforming analytics on the data in the second format that is associated with the object name, wherein results of the analytics are output for display on the user device.2. The method of claim 1 , wherein the received portion selection include changes in metadata selections.3. The method of claim 2 , wherein the transformation of the at least one portion from the first format to the second format is performed in accordance with the changes in the metadata selections.4. The method of claim 1 , wherein the transformation of the at least one portion from the first format to the second format includes splitting ...

Подробнее
Номер записи: 79
05-01-2017 дата публикации

Apparatus and Method for Graphically Displaying Transaction Logs

Номер: US20170004188A1
Автор: Gupta Vishal
Принадлежит:

A computing device obtains and analyzes the log entries of a log file, and generates an interactive graph that visually represents the results of the analysis to output to a display device. More particularly, the device groups each log entry in the log file into a corresponding pattern, and then generates the graph to plot the line numbers of the log entries to their corresponding patterns. The plot is formed as a wave to make it easy for a user to identify patterns of commands and actions that are executed in the performance of a given task, as well as for determining whether an underlying system is exhibiting anomalous behavior. 1. A computer-implemented method comprising:obtaining, by a processing circuit, a log file comprising a plurality of log entries from a memory circuit, wherein each log entry is identified by a corresponding line number;generating, by the processing circuit, a list that maps the line number of each log entry to a corresponding pattern of log entries, wherein each corresponding pattern of log entries is identified by a pattern number and represents a task performed by the computing device;computing, by the processing circuit, a pattern value for each pattern in the list;detecting, by the processing circuit, an anomalous pattern in the list; andoutputting, by the processing circuit, an interactive graph to a display device, wherein the interactive graph plots the pattern value for a pattern in the list to the line number of a representative log entry in that pattern, and visually indicates the anomalous pattern to the user.2. The method of wherein the log entries of each pattern in the list are related to the task represented by the pattern.3. The method of wherein generating claim 1 , by the processing circuit claim 1 , a list that maps the line number of each log entry to a corresponding pattern of log entries comprises:computing a dice coefficient for first and second log entries read from the log file;assigning the first and second log ...

Подробнее
Номер записи: 80
05-01-2017 дата публикации

AUTOMATIC REPAIR OF CORRUPTED BLOCKS IN A DATABASE

Номер: US20170004194A1
Автор: Agarwal Deepak, Gupta Anurag Windlass, Kulesza Jakub
Принадлежит: Amazon Technologies, Inc.

A distributed data warehouse system maintains data blocks on behalf of clients, and stores primary and secondary copies of data blocks on different disks or nodes in a cluster. The data warehouse system may back up data blocks in a key-value backup storage system. In response to a query targeting a data block previously stored in the cluster, the data warehouse system may determine whether a consistent, uncorrupted copy of the data block is available in the cluster (e.g., by applying a consistency check). If not (e.g., if a disk or node failed), the data warehouse system may automatically initiate an operation to restore the data block from the backup storage system, using a unique identifier of the data block to access a backup copy. The target data may be returned in a query response prior to restoring primary and secondary copies of the data block in the cluster. 1. A method , comprising: storing columnar data of a database table in a plurality of physical data blocks in a distributed data storage system on behalf of one or more clients, wherein the distributed data storage system comprises a cluster of one or more nodes, each of which comprises one or more disks on which physical data blocks are stored, wherein each of the plurality of physical data blocks is associated with a respective unique identifier, and wherein said storing columnar data comprises storing two or more copies of each portion of the columnar data in different physical data blocks in the distributed data storage system;', 'storing a backup copy of each of the plurality of physical data blocks in a remote key-value durable backup storage system, wherein for each of the plurality of physical data blocks, the respective unique identifier serves as a key to access the data block in the remote key-value durable backup storage system;', 'receiving, from a client, a query directed to a portion of the columnar data stored in the distributed data storage system;', accessing one of the plurality of ...

Подробнее
Номер записи: 81
05-01-2017 дата публикации

SYNCHRONIZING DATA BETWEEN CLOUD MANAGER AND PROVIDERS

Номер: US20170004197A1
Автор: Caldwell Corey Brent, Dennis John, Handler Douglas, Hintzke Matthew Steven, Richman Evan, Schwartz Todd, Younge Bradley
Принадлежит: SkyKick Inc.

System and method are disclosed for enabling data synchronization with different cloud service providers. Semantics of provide data from the cloud service providers may be determined and captured in a data object—i.e. a provider data object. The provider data object may then be instantiated for individual cloud service providers for synchronizing data with a given cloud service provider. Provider data can be received from the given cloud service provider can be processed using the instance of the provider data object. Specific provider information can then be extracted from the received provider data according the semantics defined in the instance of the provider data object. The extracted provider information can then compared with provider information already stored in a database. When one or more differences are detected between the two, the received provider information can be saved to the database. 1. A method of synchronizing data from different cloud services , the method being implemented by a computer system with a database , the method comprising:storing, in storage associated with the computer system, a provider data object, the provider data object comprising information regarding one or more licenses provided by a given cloud service provider;generating a first instance of the provider data object for a first cloud service provider;processing first data from the first cloud service provider using the first instance of the provider data object such that first license information regarding a first license provided by the first cloud service provider is extracted;comparing the first instance of the provider data object with first provider information stored in the database, wherein the comparing of the first instance of the provider data object comprises determining whether the first license information is different from corresponding first license information stored in the database; andif the first license information is determined to be different from ...

Подробнее
Номер записи: 82
05-01-2017 дата публикации

Monitoring a Corpus for Changes to Previously Provided Answers to Questions

Номер: US20170004204A1
Автор: Aaron M. Cohen, Paul R. Bastide
Принадлежит: International Business Machines Corp

Mechanisms are provided for identifying changes, within a corpus of information, to answers to questions provided within the corpus of information. A mapping of a question and a previously provided answer to the question in a question/answer data structure is generated. A transaction referencing the previously provided answer, and having an update to the previously provided answer, is received and correlated with the question/answer data structure, which is updated based on the transaction. A determination is made as to whether the strength of the mapping of the first question to the previously provided answer based on the update to the question/answer data structure has fallen equal to or below a predetermined threshold. In response to this being the case, a change to the previously provided answer is propagated throughout the corpus of information.

Подробнее
Номер записи: 83
05-01-2017 дата публикации

METHOD OF ADMINISTERING A HEALTH CARE CODE REPORTING SYSTEM

Номер: US20170004266A1
Автор: Vanderhoef Eric
Принадлежит:

A method of administering a healthcare analytics process through a computer system having at least one server, at least one client device, and a communication network operatively and electrically connecting the client device to the at least one server, the method comprising the steps of: providing a coding program running on the at least one server without transmitting advertisements to the at least one client device; accessing, by a user from the client device, the coding program, and entering search data into the at least one client device by the user; transmitting the search data to the at least one server; and generating with the coding program on the at least one server, search results associated with the search data and displaying the search results associated with the search data at the at least one client device. 1. A method of administering a healthcare analytics process through a computer system having at least one server , at least one client device , and a communication network operatively and electrically connecting the client device to the at least one server , the method comprising the steps of:providing a coding program running on the at least one server without transmitting advertisements to the at least one client device;accessing, by a user from the client device, the coding program, and entering search data into the at least one client device by the user;transmitting the search data to the at least one server; andgenerating with the coding program on the at least one server, search results associated with the search data and displaying the search results associated with the search data at the at least one client device.2. The method of claim 1 , further comprising claim 1 , stitching the search data on the at least one server.3. The method of claim 1 , further comprising claim 1 , removing duplicates and fixing errors in the search data on the at least one server. This non-provisional application claims priority to U.S. Provisional Application ...

Подробнее
Номер записи: 84
07-01-2016 дата публикации

Insurance Data Archiving and Retrieval System

Номер: US20160004685A1
Автор: Tawade Vaibhav P.
Принадлежит:

A method and apparatus for retrieving and presenting insurance data from a legacy insurance data archiving system receives insurance data originating from legacy data storage of the legacy insurance data archiving system. The legacy insurance archiving system has an associated legacy format for formatting the insurance data for display on a display device. The legacy format also includes at least a screen format for displaying the insurance data on the display device. The method and apparatus also store the received insurance data in a database on memory of a second insurance data archiving system, and generates a display screen template substantially having the screen format of the legacy insurance archiving system. The display screen template has fields that each are configured to display at least one datum of the received insurance data. The method and apparatus also stores the display screen template in the memory of the second system. 1. A method of retrieving and presenting insurance data from a legacy insurance data archiving system , the method comprising:receiving insurance data originating from legacy data storage of the legacy insurance data archiving system, the legacy insurance archiving system having an associated legacy format for formatting the insurance data for display on a display device, the legacy format including at least a screen format for displaying the insurance data on the display device;storing the received insurance data in a database on memory of a second insurance data archiving system for subsequent retrieval, the received insurance data being stored in the database in a prescribed format;generating a display screen template substantially having the screen format of the legacy insurance archiving system, the display screen template having a plurality of fields that each are configured to display at least one datum of the received insurance data;storing the display screen template in the memory of the second insurance data archiving ...

Подробнее
Номер записи: 85
05-01-2017 дата публикации

DATA DRIVEN CLASSIFICATION AND DATA QUALITY CHECKING SYSTEM

Номер: US20170004413A1
Автор: Flores Jaime A., Harris Patrick N., Warn Brian, Young Danielle C.
Принадлежит:

A computer implemented data driven classification and data quality checking system is provided. The system has an interface application enabled to receive data and has an associative memory software. The system has a data driven associative memory model configured to categorize one or more fields of received data and to analyze the received data. The system has a data quality rating metric associated with the received data. The system has a machine learning data quality checker for the received data, and is configured to add the received data to a pool of neighboring data, if the data quality rating metric is greater than or equal to a data quality rating metric threshold. The machine learning data quality checker is configured to generate and communicate an alert of a potential error in the received data, if the data quality rating metric is less than the data quality rating metric threshold. 1. A computer implemented data driven classification and data quality checking system comprising:an interface application enabled to receive data;an associative memory software in communication with the interface application;a data driven associative memory model learned using the associative memory software, the data driven associative memory model configured to categorize one or more fields of the received data and configured to analyze the received data;a data quality rating metric associated with the received data and calculated by the data driven associative memory model, by comparing the received data with a pool of neighboring data in the category of field of the received data; anda machine learning data quality checker for the received data, enabled by the data driven associative memory model, and coupled to the interface application, and configured to add the received data to the pool of neighboring data, if the data quality rating metric is greater than or equal to a data quality rating metric threshold, andthe machine learning data quality checker configured to ...

Подробнее
Номер записи: 86
07-01-2016 дата публикации

USING BYTE-RANGE LOCKS TO MANAGE MULTIPLE CONCURRENT ACCESSES TO A FILE IN A DISTRIBUTED FILESYSTEM

Номер: US20160004718A1
Автор: Lin Yun, Sharpe Richard
Принадлежит:

The disclosed embodiments disclose techniques for using byte-range locks to manage multiple concurrent accesses to a file in a distributed filesystem. Two or more cloud controllers collectively manage distributed filesystem data that is stored in the cloud storage systems; the cloud controllers ensure data consistency for the stored data, and each cloud controller caches portions of the distributed filesystem. During operation, a cloud controller receives from a first client a request to access a portion of the file. The cloud controller contacts the owning cloud controller for the portion of the file to request a byte-range lock for that portion of the file. The owning cloud controller returns a byte-range lock to the requesting cloud controller if no other clients of the distributed filesystem are currently locking the requested portion of the file with conflicting accesses. 1. A computer-implemented method for using byte-range locks to manage multiple concurrent accesses to a file in a distributed filesystem , the method comprising:collectively managing the data of the distributed filesystem using two or more cloud controllers, wherein collectively managing the data comprises storing the data for the distributed filesystem in one or more cloud storage systems, wherein the cloud controllers cache and ensure data consistency for data stored in the cloud storage systems;receiving at a first cloud controller a request from a first client to access a portion of the file;contacting the owning cloud controller for the portion of the file to request a byte-range lock for the portion of the file; andreceiving the byte-range lock at the first cloud controller if no other clients of the distributed filesystem are currently locking the portion of the file with conflicting accesses.2. The computer-implemented method of claim 1 ,wherein clients that are associated with other cloud controllers are currently accessing portions of the file using granted byte-range locks; ...

Подробнее
Номер записи: 87
05-01-2017 дата публикации

Search by applicant ranker scores

Номер: US20170004456A1
Автор: Dong Li, Mudit Goel, Yi Feng, Yida Yao
Принадлежит: LinkedIn Corp

Disclosed in some examples are systems, methods, and machine-readable mediums which enhance the social networking service by providing a search functionality to allow members to search for jobs based upon their predicted applicant score or rank. Thus, a member may easily search for jobs in which the member is likely to compare favorably to others who have already applied. In order to maintain this data, the social networking service may utilize an event-driven live update architecture which allows the social networking service to manage these scores and update these scores based upon events (e.g., new job postings, new job applicants, and the like).

Подробнее
Номер записи: 88
07-01-2016 дата публикации

SELF-SERVICE CONFIGURATION FOR DATA ENVIRONMENT

Номер: US20160004731A1
Автор: McAlister Grant Alexander MacDonald, SHETH RAJESH SUDHAKAR, Sivasubramanian Swaminathan
Принадлежит: Amazon Technologies, Inc.

The values of various operating and/or configuration parameters of a data environment are managed using a set of self-service Web services and interfaces of a separate control environment. A customer can submit a Web services call into an externally-facing application programming interface (API) or other such externally-facing interface of the control environment. The API receiving the call, as well as information extracted from the call, can be used to determine appropriate adjustments to be performed in the data environment. A workflow can be instantiated that includes tasks used to validate and/or apply the adjustments to the target resources, such as databases, data instances, data stores, instance classes, etc. Various real-time functions such as monitoring and auto-scaling also can be performed via the control plane. 1. A computer-implemented method of managing configuration values for a relational database instance using one or more self-service Web services , comprising: providing a plurality of application programming interfaces (APIs) each enabling a user to submit a Web service request to a control environment, each API corresponding to a desired action to be performed with respect to a relational database for the user in a separate database environment;', 'providing a default parameter group for at least one data instance to be provisioned in the database environment, the default parameter group including values for a plurality of database configuration parameters, the default parameter group having a first version number;', 'in response to receiving a first Web service request to the control environment through a first API of the plurality of APIs, causing at least one task to be performed to specify a first modified parameter group to be applied when provisioning a data instance in the separate database environment, the first modified parameter group having a second version number; and', 'in response to receiving a second Web service request to the ...

Подробнее
Номер записи: 89
07-01-2016 дата публикации

Column Store Optimization Using Simplex Store

Номер: US20160004739A1
Автор: Gildhoff Hinnerk, Grouisborn Tim, KAZMAIER GERRIT SIMON, Tyercha Edward-Robert, Volker Lars
Принадлежит:

Using index clusters to approximate coordinate values for vertices of compressed simplexes of a spatial data set, valid subspaces can be identified and used to identify other simplexes that may intersect a first simplex. Such approaches can be used for filtering, refining, etc. analysis of intersections between areas, lines, volumes, etc. within spatial data sets. 1. A computer program product comprising a machine-readable medium storing instructions that , when executed by at least one programmable processor , cause the at least one programmable processor to perform operations comprising:defining an index cluster for a coordinate value of a vertex of a first simplex, the first simplex comprising a plurality of vertices and forming at least part of a shape within a coordinate system, a plurality of index vectors defining the first simplex, each index vector of the plurality of index vectors identifying one coordinate value within a dimensional dictionary for a dimension within the coordinate system for each vertex of the plurality of vertices, the index cluster comprising an interval within the dimensional dictionary for the coordinate value;scanning other index vectors for the interval, the other index vectors identifying value-IDs for other coordinate values for other vertices of other simplexes in a data set;identifying, based on the scanning, a subset of the other simplexes that possibly intersect the first simplex, the identifying comprising designating another simplex as a member of the subset when a comparison of the index cluster with the other index vector for the coordinate value for the other simplex returns a true value; andpromoting the subset.2. The computer program product of claim 1 , wherein the promoting comprises presenting the subset to a user and/or utilizing the subset as a filter result.3. The computer program product of claim 2 , wherein the promoting comprises utilizing the subset as a filter result claim 2 , the utilizing comprising: ...

Подробнее
Номер записи: 90
07-01-2016 дата публикации

METHODS AND APPARATUS FOR HARMONIZATION OF DATA STORED IN MULTIPLE DATABASES USING CONCEPT-BASED ANALYSIS

Номер: US20160004742A1
Автор: Mohan Rengaswamy, Palwai Prashanth, Yount Joshua Julian
Принадлежит:

In some embodiments, a data harmonization system can organize, classify, analyze and thus relate previously unrelated data stored in multiple databases and/or associated with different organizations. In such embodiments, the data harmonization system can relate such previously unrelated data sets to, for example, track trends, exceptions, inconsistencies, location, etc. such that determinations can be made based on such different and/or previously unrelated data sets. In such embodiments, the data harmonization system can be used to harmonize both structured data and/or unstructured data based on concept-based analysis. 1. A method , comprising:accessing a first database including a plurality of first data objects, the plurality of first data objects associated with at least a first identifier type, a first characteristic type, a second characteristic type, each first data object from the plurality of first data objects having at least one of a value associated with the first identifier type, a value associated with the first characteristic type or a value associated with the second characteristic type;accessing a second database including a plurality of second data objects, the plurality of second data objects associated with at least the second identifier type, the second characteristic type, and a third characteristic type, each second data object from the plurality of second data objects having at least on of a value associated with the second identifier type, a value associated with the third identifier type or a value associated with the second characteristic type;applying a business rule to the plurality of first data objects and to the plurality of second data objects, the business rule being a logical expression indicating a relationship between a first concept and a second concept, the first concept being a logical expression indicative of the presence of a selected value of the first characteristic type and the second concept being a logical expression ...

Подробнее
Номер записи: 91
07-01-2016 дата публикации

METHODS AND SYSTEMS FOR DATA CLEANING

Номер: US20160004743A1
Автор: Tang Nan, WANG Jiannan
Принадлежит:

A method for cleaning data stored in a database which utilises a data fixing rule. The data fixing rule comprises a set of attribute values that capture an error in a plurality of semantically related attribute values. The data fixing rule also comprises a deterministic correction which is operable to replace one of the set of attribute values with a correct attribute value to correct the error. The method comprises applying the data fixing rule to the database to detect if the set of attribute values that captures the error is stored in the database and, if the set of attribute values is detected, the method applies the deterministic correction to correct the error in the attribute values. 1. A method for cleaning data stored in a database , the method comprising: a first set of attributes and respective attribute values;', 'a second set of attributes and respective attribute values, wherein the second set of attribute values are erroneous values; and', 'a correct value;, 'providing a data fixing rule to capture an error, the data fixing rule comprisingapplying the data fixing rule to the database to capture the error, wherein the error is captured when the first set of attributes and attribute values, and the second set of attributes and at least one of the erroneous values of the second set of attribute values match a record in the database; andreplacing the at least one erroneous value in the record with the correct value.2. The method according to claim 1 , wherein the data fixing rule is defined for a relationship R in the form (((X claim 1 , tp[X]) claim 1 ,(B claim 1 ,−Tp[B]))→+tp[B]) claim 1 , where:X is a set of attributes in attr(R) and B is an attribute in attr(R) \ X;tp[X] is a pattern with attribute values in X and, for each A∈X, tp[A] is a constant in dom(A);−Tp[B] is a finite set of constant values in dom(B); and+tp[B] is a constant value in dom(B) \−Tp[B], wherein +tp[B] of B indicates the correction to an erroneous value in −Tp[B].3. The method ...

Подробнее
Номер записи: 92
07-01-2016 дата публикации

METHOD AND APPARATUS FOR INTEGRATION OF COMMUNITY-PROVIDED PLACE DATA

Номер: US20160004753A1
Автор: GROSSE Alexander, Schmidt Andreas
Принадлежит:

An approach is provided for integrating place metadata provided by a community of metadata builders, including receiving registration data that indicates one or more values for a corresponding one or more attributes that describe a place. A place is associated with a geographic location. Providing an indication of match between the registration data and metadata for a predetermined place is also initiated. In some embodiments, a new entry for a set of predetermined places is generated based on validating the registration data and a negligible degree of match. In some embodiments, a unique identifier for the place is included in indication of match for either a new place represented by the registration data or a matching predetermined place. 1. A computer-readable storage medium carrying one or more sequences of one or more instructions which , when executed by one or more processors , cause an apparatus to perform at least the following:receiving registration data that indicates one or more values for a corresponding one or more attributes that describe a place that is associated with a geographic location; andinitiating providing indication of a match between the registration data and metadata for a predetermined place,wherein the registration data includes one or more fields that hold the one or more values.2. A computer-readable storage medium of claim 1 , wherein the apparatus is caused to further perform:validating the registration data; andgenerating a new entry for predetermined places based on the validation of the registration data and a negligible degree of match.3. A computer-readable storage medium of claim 2 , wherein the indication of the match further indicates a unique identifier for the place claim 2 , the unique identifier corresponding to the new entry of the place within a data structure claim 2 , the predetermined places having been assigned respectively a plurality of unique identifiers within the data structure.4. A computer-readable storage ...

Подробнее
Номер записи: 93
02-01-2020 дата публикации

INTELLIGENT DISPLAY ON/OFF SWITCHING FOR ELECTRONIC DEVICE DISPLAYS

Номер: US20200004313A1
Автор: Bender Michael, Kelley John F., Seager Todd P.
Принадлежит:

A method of controlling the display of an electronic devices that includes measuring a motion of a device; and determining if the motion of the device and the display state of the device at the time of motion match conditions in a database of motions that are correlated to display states that signal a change from the display state at the time of the motion to a called display state. The method may further include adjusting power from a battery to the display to effectuate a change of display state in response to motion of the device matching conditions in the database of motions that signal the change of display state or a user intervention signaling a change in display state. The method further includes updating a database of motions in response to changes in the display state effectuated by user intervention. 1. A method of controlling a display state of electronic devices comprising:measuring a motion of a device, the device including a display and a selectable button for activating the display independent of a motion status;determining a display state of the device at a time of the motion;determining when a motion of the device and the display state of the device at the time of motion match conditions in a database of motions, the database of motions including correlated display states that signal a change from the display state at the time of the motion to a called display state;adjusting power from a battery to the display to effectuate the change of display state in response to the motion of the device and the display state of the device at the time of the motion matching conditions in the database of motions that signal the change of the display state, or a display state change requested by activation of the selectable button, andupdating the database of motions when changes in the display state are effectuated by the activation of the selectable button.2. The method of claim 1 , wherein adjusting power from the battery to the display state follows a ...

Подробнее
Номер записи: 94
05-01-2017 дата публикации

METHOD FOR UNIFYING FORMATS OF ELECTRONIC RECEIPTS

Номер: US20170004572A1
Автор: Sambe Masanori
Принадлежит:

A method for unifying formats of electronic receipts, includes the steps of receiving, from a first processing device, first electronic receipt data in a structured data format, the first electronic receipt data containing a user ID and transaction content corresponding to one transaction, receiving, from a second processing device, second electronic receipt data in a non-structured data format, converting the received second electronic receipt data into the structured data format, the converted second electronic receipt data containing a user ID and transaction content corresponding to one transaction, and storing the first electronic receipt data in the structured data format and the second electronic receipt data in the structured data format in a table, each entry of the table containing a user ID and transaction content corresponding to one transaction. 1. A method for unifying formats of electronic receipts , comprising:receiving, from a first processing device, first electronic receipt data in a structured data format, the first electronic receipt data containing a user ID and transaction content corresponding to one transaction;receiving, from a second processing device, second electronic receipt data in a non-structured data format;converting the received second electronic receipt data into the structured data format, the converted second electronic receipt data containing a user ID and transaction content corresponding to one transaction; andstoring the first electronic receipt data in the structured data format and the second electronic receipt data in the structured data format in a table, each entry of the table containing a user ID and transaction content corresponding to one transaction.2. The method according to claim 1 , whereinthe user ID in the first electronic receipt data is of a first type, and the user ID in the second electronic receipt data is of a second type that is different from the first type, andthe user ID in the second electronic ...

Подробнее
Номер записи: 95
07-01-2016 дата публикации

AUTOMATED END-TO-END SALES PROCESS OF STORAGE APPLIANCES OF STORAGE SYSTEMS USING PREDICTIVE MODELING

Номер: US20160004975A1
Автор: Chamness Mark, Singer David
Принадлежит:

Techniques for generating end-to-end sales leads based on storage capacity forecast using predictive modeling are described herein. According to one embodiment, diagnostic data is received from a data collector that periodically collects the diagnostic data from a storage system having one or more storage units to store data objects. A capacity forecaster coupled to the data collector forecasts a full capacity date using predictive modeling based on the diagnostic data, where the full capacity date estimates a date in which the one or more storage units reach a full storage capacity. A context generator coupled to the capacity forecaster generates a context having information identifying the one or more storage units of the storage system and an operator operating the storage system, wherein the context is used to communicate with the operator for acquiring an additional storage unit to increase storage capacity prior to the full capacity date. 1. A computer-implemented method , comprising:receiving diagnostic data associated with a storage system having one or more storage units to store data objects;forecasting, by a capacity forecaster, a full capacity date using predictive modeling based on the diagnostic data, wherein the full capacity date corresponds to a date on which the one or more storage units are predicted to reach a full storage capacity;generating, by a generator, an indication identifying a type of the one or more storage units of the storage system, wherein the indication is used to communicate regarding an increase in a storage capacity of the storage system before the full capacity date;updating the generator and the capacity forecaster based at least in part on an event that occurs in response to the indication; andusing the updated generator to generate a subsequent indication based at least in part on a subsequent full capacity date that is determined using predictive modeling.2. The method of claim 1 , further comprising:evaluating the event ...

Подробнее
Номер записи: 96
04-01-2018 дата публикации

METHOD AND SYSTEM FOR AUTOMATING EXECUTION OF PROCESSES

Номер: US20180004545A1
Автор: MURALIDHARAN Naveen, Ponnan Suresh Babu, SETHURAMAN Kumaran, VADIVEL Padmanaban
Принадлежит:

The present disclosure relates to a method and system for automating execution of processes by a process automation system. The process automation system captures environment data and application data associated with at least one of applications and systems which are utilized for performing a process and records each of user actions performed on at least one of the applications and the systems with reference to the environment data. The process automation system determines one or more automation rules for each set of connected user actions within and between the at least one of the applications and the systems from the recorded user actions for execution of a corresponding activity in the process and creates an execution sequence comprising the one or more automation rules for automating the process. 1. A method for automating execution of processes , the method comprising:capturing, by a process automation system, environment data and application data associated with at least one of applications and systems utilized for performing a process;recording, by the process automation system, each user action performed on at least one of the applications and the systems with reference to the environment data;determining, by the process automation system, one or more automation rules for each set of connected user actions performed within and between the at least one of the applications and the systems from the recorded user actions for execution of a corresponding activity in the process; andcreating, by the process automation system, an execution sequence comprising the one or more automation rules for automating the process.2. The method as claimed in claim 1 , wherein the environment data comprises information about operating system details claim 1 , software and hardware information claim 1 , hostname details claim 1 , screen resolution details claim 1 , user account details claim 1 , processing details claim 1 , screen size details and type of monitor used.3. The ...

Подробнее
Номер записи: 97
02-01-2020 дата публикации

DYNAMIC STATE-DRIVEN CENTRALIZED PROCESSING

Номер: US20200004576A1
Автор: Bull John
Принадлежит:

The present solution is generally directed to dynamic state-driven centralized processing that manages remote procedure calls. In particular, the present solution can reduce the number of remote procedure calls by selecting and applying multiple processing scripts for a single electronic transaction based on a real-time condition, and provide dynamic-state-driven processing. 1. A method of dynamic-state-driven centralized processing , comprising:receiving, by a centralized state processing system comprising one or more processors and memory, a data structure constructed by a remote transaction processing server based on processing a plurality of electronic transactions that occurred within a spatiotemporal area, the data structure including a plurality of entries that each have a type identifier;parsing, by the centralized state processing system, the plurality of entries based on the type identifier to identify a first entry having a first type identifier and a second entry having a second type identifier;identifying, by the centralized state processing system, using a parameter repository storing a plurality of thresholds, a first threshold for the first entry based on the first type identifier, and a second threshold for the second entry based on the second type identifier;determining, based on a comparison between the first threshold and a first value of the first entry, a positive delta value;determining, based on a comparison between the second threshold and a second value of the second entry, a negative delta value;selecting, by the centralized state processing system, from a script repository, a first script to apply to the first entry based on the positive delta value and the first type identifier, and a second script to apply to the second entry based on the negative delta value and the second type identifier;determining, by the centralized state processing system, a first output for the first entry using the first script, and a second output for the ...

Подробнее
Номер записи: 98
02-01-2020 дата публикации

DATA CORRUPTION SOURCE AND TIMELINE ANALYSIS

Номер: US20200004644A1
Автор: McBride Gregory E., Reed David C.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method for analyzing data corruption is disclosed. In one embodiment, such a method includes identifying a data set containing corrupted data. The method searches the data set for the corrupted data to verify that the corrupted data is contained within the data set. The method repeatedly performs the following until the corrupted data is no longer found within the data set: revert to a previous version of the data set by removing an incremental update to the data set, and search the previous version for the corrupted data. When a previous version of the data set is found that no longer contains the corrupted data, the method determines a timestamp associated with the previous version and provides the timestamp to a user. A corresponding system and computer program product are also disclosed. 1. A method for analyzing data corruption , the method comprising:identifying a data set containing corrupted data;searching the data set for the corrupted data to verify that the corrupted data is contained within the data set; reverting to a previous version of the data set by removing an incremental update to the data set; and', 'searching the previous version for the corrupted data;, 'repeatedly performing the following until the corrupted data is no longer found within the data setwhen a previous version of the data set is found that no longer contains the corrupted data, determining a timestamp associated with the previous version; andproviding the timestamp to a user.2. The method of claim 1 , further comprising providing claim 1 , to the user claim 1 , a previous version of the data set just prior to corruption of the corrupted data.3. The method of claim 1 , further comprising providing claim 1 , to the user claim 1 , a previous version of the data set just after corruption of the corrupted data.4. The method of claim 1 , further comprising providing claim 1 , to the user claim 1 , a comparison of a previous version of the data set just prior to corruption of the ...

Подробнее
Номер записи: 99
02-01-2020 дата публикации

OPTIMIZED DATA CORRUPTION SOURCE AND TIMELINE ANALYSIS

Номер: US20200004645A1
Автор: McBride Gregory E., Reed David C.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method for analyzing data corruption is disclosed. In one embodiment, such a method includes identifying a data set containing corrupted data. The method identifies a specific location within the data set containing the corrupted data and analyzes the specific location to determine if the corrupted data is contained therein. The method repeatedly performs the following until the corrupted data is no longer found within the specific location: revert to a previous version of the specific location by removing an incremental update to the specific location, and analyze the previous version of the specific location to determine if it contains the corrupted data. When a previous version of the specific location is found that no longer contains the corrupted data, the method determines a timestamp associated with the previous version and provides the timestamp to a user. A corresponding system and computer program product are also disclosed. 1. A method for analyzing data corruption , the method comprising:identifying a data set containing corrupted data;identifying a specific location within the data set containing the corrupted data;analyzing the specific location to determine if the corrupted data is contained within the specific location; reverting to a previous version of the specific location by removing an incremental update to the specific location; and', 'analyzing the previous version of the specific location to determine if it contains the corrupted data;, 'repeatedly performing the following until the corrupted data is no longer found within the specific locationwhen a previous version of the specific location is found that no longer contains the corrupted data, determining a timestamp associated with the previous version; andproviding the timestamp to a user.2. The method of claim 1 , wherein the specific location is a specific storage element within the data set.3. The method of claim 1 , wherein the specific location is a specific range or collection of ...

Подробнее
Номер записи: 100