Abstract: A “dry” packaging in which a prosthetic heart valve is packaged within a container with hydrogel that can be provided in many forms. Certain embodiments include hydrogel that is preloaded with glycerol or the like. The hydrogel regulates the humidity within the container through a diffusion-driven mechanism if a gradient of humidity between the inside and the outside of the hydrogel exists. Humidity regulation is important to prevent the tissue of the valve structure from drying out. When the partially-hydrated hydrogel is present within container, which is saturated with air of a predefined humidity, the water molecules from the air will be absorbed by the hydrogel if the air humidity is high (i.e. when the thermodynamics favor hydrogel hydration) or vice versa. Various embodiments are configured to also house at least a portion of a delivery device for delivering the prosthetic heart valve.

Abstract: Adeno-associated virus (AAV) Clade F vectors or AAV vector variants (relative to AAV9) for precise editing of the genome of a cell and methods and kits thereof are provided. Targeted genome editing using the AAV Clade F vectors or AAV vector variants provided herein occurred at frequencies that were shown to be 1,000 to 100,000 fold more efficient than has previously been reported. Also provided are methods of treating a disease or disorder in a subject by editing the genome of a cell of the subject via transducing the cell with an AAV Clade F vector or AAV vector variant as described herein and further transplanting the transduced cell into the subject to treat the disease or disorder of the subject. Also provided herein are methods of treating a disease or disorder in a subject by in vivo genome editing by directly administering the AAV Clade F vector or AAV vector variant as described herein to the subject.

Abstract: There are provided systems and methods for risk analysis for fraud detection for electronic transaction processing flows. An entity, such as a user, business, or other personal or commercial entity, may interact with another entity in order to engage in a transaction, for example, a purchase, transfer, or other transaction process. The first entity may utilize a service provider to engage in transaction processing, which may provide multiple flows that govern the features provided to the entities. Such features may include fees required for transaction processing. In order to ensure that the entities do not fraudulently choose a flow type that decreases or cancels fees due, or does not provide certain protections to other parties, a risk analysis of the transaction and the account may be executed based on accessible historical data and identifiers. Thus, the entities may automatically be entered to one flow over another based on the risk analysis.

Abstract: There are provided systems and methods for risk analysis for fraud detection for electronic transaction processing flows. An entity, such as a user, business, or other personal or commercial entity, may interact with another entity in order to engage in a transaction, for example, a purchase, transfer, or other transaction process. The first entity may utilize a service provider to engage in transaction processing, which may provide multiple flows that govern the features provided to the entities. Such features may include fees required for transaction processing. In order to ensure that the entities do not fraudulently choose a flow type that decreases or cancels fees due, or does not provide certain protections to other parties, a risk analysis of the transaction and the account may be executed based on accessible historical data and identifiers. Thus, the entities may automatically be entered to one flow over another based on the risk analysis.

Abstract: Methods and systems to process a request received at an application program interface are described. The system receives a request from a client machine that includes a job that is associated with data. The request is received at an application program interface. Next, a peer-to-peer network of processing nodes generates a plurality of sub-jobs based on the job. The peer-to-peer network of processing nodes schedules the plurality of sub-jobs for parallel processing based on an availability of resources that are respectively utilized by the sub-jobs and parallel processes the plurality of sub-jobs before generating task results that are respectively associated with the plurality of sub-jobs.

Abstract: Methods and systems to process a request received at an application program interface are described. The system receives a request from a client machine that includes a job that is associated with data. The request is received at an application program interface. Next, a peer-to-peer network of processing nodes generates a plurality of sub-jobs based on the job. The peer-to-peer network of processing nodes schedules the plurality of sub-jobs for parallel processing based on an availability of resources that are respectively utilized by the sub-jobs and parallel processes the plurality of sub-jobs before generating task results that are respectively associated with the plurality of sub-jobs.

Abstract: Methods and systems to process a request received at an application program interface are described. The system receives a request from a client machine that includes a job that is associated with data. The request is received at an application program interface. Next, a peer-to-peer network of processing nodes generates a plurality of sub-jobs based on the job. The peer-to-peer network of processing nodes schedules the plurality of sub-jobs for parallel processing based on an availability of resources that are respectively utilized by the sub-jobs and parallel processes the plurality of sub-jobs before generating task results that are respectively associated with the plurality of sub-jobs.

Abstract: Systems and methods for publishing information to a plurality of software applications are provided. The methods may comprise identifying a plurality of records based on a last sequential identification code in a high watermark table of a persistent store. The plurality of records may be generated subsequent to a previous record corresponding to the last sequential identification code. A plurality of corresponding messages each corresponding to a record of the plurality of records may be prepared. Each of those messages may then be transmit to at least one software application and may include a most recent message corresponding to a most recent record. In the high water mark table of the persistent store, an updated last sequential identification code may be stored as a pointer for subsequent reference. The updated last sequential identification code may correspond to the most recent message transmitted in the plurality of corresponding messages.

Abstract: Methods and systems to process a request received at an application program interface are described. The system receives a request from a client machine that includes a job that is associated with data. The request is received at an application program interface. Next, a peer-to-peer network of processing nodes generates a plurality of sub-jobs based on the job. The peer-to-peer network of processing nodes schedules the plurality of sub-jobs for parallel processing based on an availability of resources that are respectively utilized by the sub-jobs and parallel processes the plurality of sub-jobs before generating task results that are respectively associated with the plurality of sub-jobs.

Abstract: Systems and methods for publishing information to a plurality of software applications are provided. The methods may comprise identifying a plurality of records to transmit to the software applications based on a last sequential identification code in a high watermark table of a persistent store. The plurality of records may be generated subsequent to a previous record corresponding to the last sequential identification code. A plurality of corresponding messages each corresponding to a record of the plurality of records may be prepared. Each of those messages may then be transmit to at least one software application and may include a most recent message corresponding to a most recent record. In the high water mark table of the persistent store, an updated last sequential identification code may be stored as a pointer for subsequent reference. The updated last sequential identification code may correspond to the most recent message transmitted in the plurality of corresponding messages.

Abstract: A “push” based publication model in which messages are sent automatically to communicate event related data to other system applications when an event occurs that causes a change to a persistent data store. A shadow table stores records relating to information stored in the main table. Each record is assigned a sequentially ordered identification code. A high water mark table stores the identification number of the last message published for a group of messages, and thus points to where publication last stopped. By using sequentially ordered codes, it is readily apparent from a gap in the sequence codes whether a record/message is missing. The shadow table may be configured as an Index Ordered Table to eliminate a query “hop” from the index table to the shadow table. The persistent store is queried to identify changes in persistent store structure, and the message structure is modified automatically to reflect any changes.

Abstract: A “push” based publication model in which messages are sent automatically to communicate event related data to other system applications when an event occurs that causes a change to a persistent data store. A shadow table stores records relating to information stored in the main table. Each record is assigned a sequentially ordered identification code. A high water mark table stores the identification number of the last message published for a group of messages, and thus points to where publication last stopped. By using sequentially ordered codes, it is readily apparent from a gap in the sequence codes whether a record/message is missing. The shadow table may be configured as an Index Ordered Table to eliminate a query “hop” from the index table to the shadow table. The persistent store is queried to identify changes in persistent store structure, and the message structure is modified automatically to reflect any changes.