Abstract: Disclosed herein are electrotransfer (ET) methods for delivering therapeutic agents to tumors. Also disclosed are methods of using the ET methods for differential delivery of an agent to more than one tissue. For example, the ET methods can be used to deliver soluble peptides of PD1 to tumor tissue to block normal PD1-PDL1 binding while separately using the ET methods to deliver PD1 or PDL1 antigen to another tissue, such as skin or muscle, to induce systemic and polyclonal checkpoint inhibitor antibodies.

Abstract: A multi-stage poker game or tournament and a method for conducting the same comprising a first stage in which a first plurality of players buy in at a first amount and a second stage in which a second plurality of players buy in at a second, greater amount. The second stage is a continuation of the game, such that non-eliminated players from the first stage may continue playing the game, along with the second plurality of players. The latter group may start the second stage with substantially equal chip counts, but the chip counts for the former group may be unevenly distributed, e.g., in proportion or substantially equal to their chip counts at the end of the first stage. The end of the first stage or beginning of the second stage may be marked by the occurrence of a predetermined trigger, such as a predetermined average chip count being reached or percentage or number of first stage players being eliminated.

Abstract: The present invention provides a device for non-invasive monitoring thermal stress of a user. The device is capable of monitoring the internal body temperature and changes in the internal body temperature of a user. Also, the device is capable of alerting a user when the user is in danger of thermal stress.

Abstract: A multi-stage poker game or tournament and a method for conducting the same comprising a first stage in which a first plurality of players buy in at a first amount and a second stage in which a second plurality of players buy in at a second, greater amount. The second stage is a continuation of the game, such that non-eliminated players from the first stage may continue playing the game, along with the second plurality of players. The latter group may start the second stage with substantially equal chip counts, but the chip counts for the former group may be unevenly distributed, e.g., in proportion or substantially equal to their chip counts at the end of the first stage. The end of the first stage or beginning of the second stage may be marked by the occurrence of a predetermined trigger, such as a predetermined average chip count being reached or percentage or number of first stage players being eliminated.

Abstract: The present invention provides a device for non-invasive monitoring thermal stress of a user. The device is capable of monitoring the internal body temperature and changes in the internal body temperature of a user. Also, the device is capable of alerting a user when the user is in danger of thermal stress.

Abstract: A defragmentation technique determines the extent to which data blocks of a file are fragmented on disks of a computer and, in response, efficiently relocates those blocks if such relocation improves the on-disk layout of the file. Each indirect block of the file is examined and the current layout of the range of pointers referencing the data blocks is determined. In addition, the number of operations needed to retrieve those data blocks from disks is calculated. A potential new layout is then estimated based on an average fullness of the file system. If the potential new layout improves the fragmentation of the current layout, then the data blocks for that range are relocated, if there is sufficient free space on disk. Otherwise, the blocks are not relocated and the current on-disk layout of the file is maintained.

Abstract: Audio sources in typical computer systems provide different numbers of channels of audio signals to a mixing component of the operating system. This conventional arrangement usually prevents the audio signals from all sources from being played back through all output channels. Novel arrangements of upmixing and mixing components are disclosed that allow audio signals to be delivered to all output channels regardless of the configuration of the audio sources and the number of channels that are provided by those audio sources.

Abstract: Presented is a method for quantifying breastfeeding between a mother and a baby, the method including measuring a physiological volume indicative of stomach fullness volume for the baby; setting a signal threshold value of the physiological volume to correspond to a stomach level that is less than or equal to the stomach fullness volume; obtaining an objective measurement of the physiological volume indicative of a level of fullness of the baby's stomach; and providing an indication to the mother when the objective measurement equals or exceeds the signal threshold value. In one embodiment, for instance, a conductivity sensor may be used to determine the amount of breast milk available in a breast and/or the amount of breast milk that has left the breast during a breastfeeding event.

Abstract: This invention provides a specified retention date within a data set that is locked against deletion or modification within a WORM storage implementation. This retention date scheme does not utilize any proprietary application program interfaces (APIs) or protocols, but rather, employs native functionality within conventional file (or other data containers, data sets or block-based logical unit numbers) properties available in commonly used operating systems. In an illustrative embodiment, the retention date/time is calculated by querying the file's last-modified time prior to commit, adding the retention period to this value and thereby deriving a retention date after which the file can be released from WORM. Prior to commit, the computed retention date is stored in the file's “last access time” property/attribute field, or another metadata field that remains permanently associated with the file and that, in being used for retention date, does not interfere with file management in a WORM state.

Abstract: A write-once-read-many (WORM) storage system that employs large-capacity and relatively inexpensive disks in connection with a file system on a file server is provided. The file system contains most or all of the required WORM functionality so as to impose a minimal footprint on client applications, client operating systems and open protocols if desired. The system is organized around WORM storage volumes that contain files that, when committed to WORM storage, cannot be deleted or modified. Any file path or directory tree structure used to identify the file within the WORM volume is locked and cannot be deleted. In one embodiment, the administrator creates a WORM volume, capable of storing designated WORM files. The client then creates an appropriate WORM file using the appropriate protocol semantics. The file is written to the volume and committed by transitioning the file attributes from a not-read-only to a read-only state.

Abstract: A defragmentation technique determines the extent to which data blocks of a file are fragmented on disks of a computer and, in response, efficiently relocates those blocks if such relocation improves the on-disk layout of the file. Each indirect block of the file is examined and the current layout of the range of pointers referencing the data blocks is determined. In addition, the number of operations needed to retrieve those data blocks from disks is calculated. A potential new layout is then estimated based on an average fullness of the file system. If the potential new layout improves the fragmentation of the current layout, then the data blocks for that range are relocated, if there is sufficient free space on disk. Otherwise, the blocks are not relocated and the current on-disk layout of the file is maintained.

Abstract: A defragmentation technique determines the extent to which data blocks of a file are fragmented on disks of a computer and, in response, efficiently relocates those blocks if such relocation improves the on-disk layout of the file. Each indirect block of the file is examined and the current layout of the range of pointers referencing the data blocks is determined. In addition, the number of operations needed to retrieve those data blocks from disks is calculated. A potential new layout is then estimated based on an average fullness of the file system. If the potential new layout improves the fragmentation of the current layout, then the data blocks for that range are relocated, if there is sufficient free space on disk. Otherwise, the blocks are not relocated and the current on-disk layout of the file is maintained.

Abstract: This invention provides a specified retention date within a data set that is locked against deletion or modification within a WORM storage implementation. This retention date scheme does not utilize any proprietary application program interfaces (APIs) or protocols, but rather, employs native functionality within conventional file (or other data containers, data sets or block-based logical unit numbers) properties available in commonly used operating systems. In an illustrative embodiment, the retention date/time is calculated by querying the file's last-modified time prior to commit, adding the retention period to this value and thereby deriving a retention date after which the file can be released from WORM. Prior to commit, the computed retention date is stored in the file's “last access time” property/attribute field, or another metadata field that remains permanently associated with the file and that, in being used for retention date, does not interfere with file management in a WORM state.