Abstract: A request is received for an answer to a problem comprising optimum assignment of a plurality of first entities to a plurality of second entities. A particle swarm optimization (PSO) is defined associated with a swarm comprising a plurality of particles, each particle location in the swarm representing an assignment of a first entity to a second entity. The PSO determines a set of solutions as a potential answer to the optimum assignment. A cost matrix is configured to analyze each solution PSO in accordance with a Hungarian algorithm, is configured to optimize at least one constraint associated with the pluralities of first and second entities and is applied to the set of PSO solutions generated to determine a cost score for each respective particle. The solution having the particle with best cost score is selected to be an optimized global best particle location for the next PSO iteration.

Abstract: Provided are binding molecules, such as TCRs or antigen binding fragments thereof and antibodies and antigen-binding fragments thereof, such as those that recognize or bind human papilloma virus (HPV) 16, including HPV 16 E6 and HPV 16 E7. Also provided are engineered cells containing such binding molecules, compositions containing the binding molecules or engineered cells, and methods of treatment, such as administration of the binding molecules, engineered cells, or compositions.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Formulas are categorized. Based at least partly on the categorization, formulas are evaluated synchronously or asynchronously. An asynchronous evaluation may be performed if a certain set of criteria is not satisfied. Asynchronous evaluations may be performed using a queue. During an asynchronous update of an object, a counter field and/or an estimate field may be used respectively for indicating the consistency of values of the object and a time when the values were consistent. The versatility of formulas is enhanced by using a formula to create a default value for a custom field when it is created and to determine whether an action is to be performed, and is enhanced by having an action define when a formula is to be updated.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Workflow field formulas are triggered by actions in a workflow, to produce values in fields. Resulting values are protected by preventing a subsequent reevaluation of the workflow field formula from taking place when values of input fields used in the workflow field formula change.

Abstract: Series-sequential turbocharging systems and related methods are disclosed herein for boosting the intake pressure of an internal combustion engine, such as a split-cycle engine that operates in accordance with a Miller cycle. In some embodiments, a multi-stage turbocharging system is used in which a small flow capacity turbocharger with an associated turbine bypass valve is incorporated in series with a larger turbocharger and an aftercooler. At low engine speeds, the bypass valve is closed and the small flow capacity turbocharger performs the bulk of the compression work. At high engine speeds, the bypass valve is opened and the larger turbocharger performs the bulk of the compression work. The bypass valve can be modulated when the engine is operated at transitional speeds. Using this series-sequential turbocharging system, the boost and flow range required for optimal efficiency and performance can be met across the engine's speed range.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Formulas are categorized. Based at least partly on the categorization, formulas are evaluated synchronously or asynchronously. An asynchronous evaluation may be performed if a certain set of criteria is not satisfied. Asynchronous evaluations may be performed using a queue. During an asynchronous update of an object, a counter field and/or an estimate field may be used respectively for indicating the consistency of values of the object and a time when the values were consistent. The versatility of formulas is enhanced by using a formula to create a default value for a custom field when it is created and to determine whether an action is to be performed, and is enhanced by having an action define when a formula is to be updated.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Formulas are categorized. Based at least partly on the categorization, formulas are evaluated synchronously or asynchronously. An asynchronous evaluation may be performed if a certain set of criteria is not satisfied. Asynchronous evaluations may be performed using a queue. During an asynchronous update of an object, a counter field and/or an estimate field may be used respectively for indicating the consistency of values of the object and a time when the values were consistent. The versatility of formulas is enhanced by using a formula to create a default value for a custom field when it is created and to determine whether an action is to be performed, and is enhanced by having an action define when a formula is to be updated.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Formulas are categorized. Based at least partly on the categorization, formulas are evaluated synchronously or asynchronously. An asynchronous evaluation may be performed if a certain set of criteria is not satisfied. Asynchronous evaluations may be performed using a queue. During an asynchronous update of an object, a counter field and/or an estimate field may be used respectively for indicating the consistency of values of the object and a time when the values were consistent. The versatility of formulas is enhanced by using a formula to create a default value for a custom field when it is created and to determine whether an action is to be performed, and is enhanced by having an action define when a formula is to be updated.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Formulas are categorized. Based at least partly on the categorization, formulas are evaluated synchronously or asynchronously. An asynchronous evaluation may be performed if a certain set of criteria is not satisfied. Asynchronous evaluations may be performed using a queue. During an asynchronous update of an object, a counter field and/or an estimate field may be used respectively for indicating the consistency of values of the object and a time when the values were consistent. The versatility of formulas is enhanced by using a formula to create a default value for a custom field when it is created and to determine whether an action is to be performed, and is enhanced by having an action define when a formula is to be updated.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Formulas are categorized. Based at least partly on the categorization, formulas are evaluated synchronously or asynchronously. An asynchronous evaluation may be performed if a certain set of criteria is not satisfied. Asynchronous evaluations may be performed using a queue. During an asynchronous update of an object, a counter field and/or an estimate field may be used respectively for indicating the consistency of values of the object and a time when the values were consistent. The versatility of formulas is enhanced by using a formula to create a default value for a custom field when it is created and to determine whether an action is to be performed, and is enhanced by having an action define when a formula is to be updated.

Abstract: Transactions are granted concurrent access to a data item through the use of an optimistic concurrency algorithm. Each transaction gets its own instance of the data item, such as in a cache or in an entity bean, such that it is not necessary to lock the data. The instances can come from the data or from other instances. When a transaction updates the data item, the optimistic concurrency algorithm ensures that the other instances are notified that the data item has been changed and that it is necessary to read a new instance, from the database or from an updated instance.

Abstract: A system for managing objects in a clustered network includes a file system containing at least one copy of a data object. The system can include several clustered servers in communication with the file system. A distributed consensus algorithm is used to select a host server. The selected host server can contain a copy of the data object, such as in local cache, providing access to the local copy to any other server in the cluster. Any change made to an item hosted by the host server can also be updated in the file system. If the host server becomes unable to host the object, a new host can be chosen using the distributed consensus algorithm. The other servers are then notified of the new host by multicast messaging.

Abstract: Multiple application server instances can be arranged in a cluster that implements a distributed EJB timer system. A high availability database can store EJB timer info. The EJB timer jobs can be distributed among the application server instances of the cluster that implement the distributed EJB timer system. In case of a failure of an application server instance, the EJB timer info can be used to reassign the EJB timer jobs associated with the failed application server instance.

Abstract: Servers in a network cluster can each store a copy of a data item in local cache, providing read access to these copies through read-only entity beans. The original data item in the database can be updated through a read/write entity bean one of the cluster servers. That cluster server has access to an invalidation target, which contains identification information relating to copies of the data item stored on servers in the cluster. Once the read/write bean updates the data item in the database, an invalidate request can be sent or multicast to all cluster members, or to any read-only bean or server contained in the invalidation target. Each server or read-only bean receiving the request knows to drop any copy of the data item in local cache, and can request a current copy of the data item from the database.

Abstract: A Node Manager monitors the status of multiple servers. The Node Manager detects server failures, periodically monitors server health status, and performs server maintenance. When the Node Manager detects a server failure, it determines whether or not the server should be restarted. While periodically monitoring servers, the Node Manager may determine how often to trigger a health check, how long to wait for a response, and how to proceed if the server is deemed failed. The Node Manager may be controlled by an Administrative Server directly or by an external administrative agent. An administrative agent may control the Node Manager by interfacing with the Administrative Server. The Node Manager and AS may authenticate each other and encode their communications to each other for increased security.

Abstract: A system and a method for scheduling disk writes for use with an application server, transactional system, or other server. The disk scheduler and method is independent of the underlying operating system and the disk hardware. This allows it to be used without porting to the various settings in which application server might be deployed. In some embodiments, a high-performance, transactional filestore is also provided to minimize the latency of small, synchronous writes to disk. The implementation uses a log-structured file system combined with disk scheduling. By relaxing the requirement that log records be physically contiguous, every modification to the disk can be scheduled.

Abstract: A system for managing a JMS message store in a clustered network includes an object acting as a message store for Java Message Service (JMS). A lead server is selected from several clustered servers. The lead server uses a distributed consensus algorithm to select a host server, utilizing multicast messaging while executing rounds of the algorithm. The selected host server hosts the JMS message store, providing sole access to JMS. The other servers are notified of the new host by multicast messaging. All servers in the cluster can use JMS, but they must send messages to the message store on the host and pick up any messages from the message store.

Abstract: A Node Manager monitors the status of multiple servers. The Node Manager detects server failures, periodically monitors server health status, and performs server maintenance. When the Node Manager detects a server failure, it determines whether or not the server should be restarted. While periodically monitoring servers, the Node Manager may determine how often to trigger a health check, how long to wait for a response, and how to proceed if the server is deemed failed. The Node Manager may be controlled by an Administrative Server directly or by an external administrative agent. An administrative agent may control the Node Manager by interfacing with the Administrative Server. The Node Manager and AS may authenticate each other and encode their communications to each other for increased security.

Abstract: Concurrency can be maintained in cluster caching when processing an update request on network server that is storing a local copy of a data item. The request can be processed using the local copy of the data item. A predicated update request can be sent to a network database storing the data item, wherein the database can commit the update if the local copy is current with the data item. If the local copy is not current, the network server can request a new copy, process the request using the current copy, and try another predicated request. The process can continue until the update is committed to the database or aborted. Once committed, any other servers in the cluster can be notified that the data item has been updated. Those other servers can drop any local copy of the data item and can request an updated copy of the data item.

Abstract: Transactions are granted concurrent access to a data item through the use of an optimistic concurrency algorithm. Each transaction gets its own instance of the data item, such as in a cache or in an entity bean, such that it is not necessary to lock the data. The instances can come from the data or from other instances. When a transaction updates the data item, the optimistic concurrency algorithm ensures that the other instances are notified that the data item has been changed and that it is necessary to read a new instance, from the database or from an updated instance. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.