Abstract: Apparatuses and methods for conducting a survey are disclosed. In one embodiment, a computer is provided comprising processing circuitry configured to select a first audio data representing a first one of a plurality of survey questions to be output via a speaker; communicate the selected first audio data for output to the user via the speaker; receive a second audio data as a result of the first one of the plurality of survey questions being output via the speaker; determine whether the second audio data corresponds to one of a responsive answer and a non-responsive answer to the first one of the plurality of survey questions; and perform one of a responsive process and a non-responsive process based at least in part on the determination of whether the second audio data corresponds to the one of the responsive answer and the non-responsive answer.

Abstract: Provided are compositions and methods for the treatment of hemoglobinopathies such as thalassemias and sickle cell disease. Compositions and methods include one or more endonuclease(s) or endonuclease fusion protein(s), including one or more homing endonuclease(s) and/or homing endonuclease fusion protein(s) and/or CRISPR endonuclease(s) and/or CRISPR endonuclease fusion protein(s): (a) to disrupt a Bcl11a coding region; (b) to disrupt a Bcl11a gene regulatory region; (c) to modify an adult human ?-globin locus; (d) to disrupt a HbF silencing DNA regulatory element or pathway, such as a Bcl11a-regulated HbF silencing region; (e) to mutate one or more ?-globin gene promoter(s) to achieve increased expression of a ?-globin gene; (f) to mutate one or more ?-globin gene promoter(s) to achieve increased expression of a ?-globin gene; and/or (g) to correct one or more ?-globin gene mutation(s).

Abstract: Provided are compositions and methods for the treatment of hemoglobinopathies such as thalassemias and sickle cell disease. Compositions and methods include one or more endonuclease(s) or endonuclease fusion protein(s), including one or more homing endonuclease(s) and/or homing endonuclease fusion protein(s) and/or CRISPR endonuclease(s) and/or CRISPR endonuclease fusion protein(s): (a) to disrupt a Bcl11a coding region; (b) to disrupt a Bcl11a gene regulatory region; (c) to modify an adult human ?-globin locus; (d) to disrupt a HbF silencing DNA regulatory element or pathway, such as a Bcl11a-regulated HbF silencing region; (e) to mutate one or more ?-globin gene promoter(s) to achieve increased expression of a ?-globin gene; (f) to mutate one or more ?-globin gene promoter(s) to achieve increased expression of a ?-globin gene; and/or (g) to correct one or more ?-globin gene mutation(s).

Abstract: A method, apparatus and computer program product for storing data in a disk storage system is presented. A high-performance dictionary data structure is defined. The dictionary data structure is stored on a disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure. Updates run faster than one insertion per disk-head movement. The structure can also be stored on any system with two or more levels of memory. The dictionary is high performance and supports with full transactional semantics, concurrent access from multiple transactions, and logging and recovery. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk.

Abstract: An indexing system and method for a filesystem, such as a database using the POSIX application programming interface, uses two fractal tree indices, a metadata index mapping the full pathname of files to file metadata, preferably data such as returned with a struct stat call, and a data index mapping pathname and block number to a datablock of a predetermined size, optionally a fixed size. The data index has keys ordered lexicographically, and the system and method allows for modifying existing keys, and creating new keys if there is no existing key, for writes smaller than the predetermined block size and for unaligned writes. The invention provides at least about an order of magnitude improvement in microdata operations (such as creating and scanning files smaller than a predetermined size, such as 512-byte files), and has write times comparable with existing file systems.

Abstract: Provided are compositions and methods for the treatment of hemoglobinopathies such as thalassemias and sickle cell disease. Compositions and methods include one or more endonuclease(s) or endonuclease fusion protein(s), including one or more homing endonuclease(s) and/or homing endonuclease fusion protein(s) and/or CRISPR endonuclease(s) ad/or CRISPR endonuclease fusion protein(s): (a) to disrupt a Bcl11a coding region; (b) to disrupt a Bcl11a gene regulatory region; (c) to modify an adult human ?-globin locus; (d) to disrupt a HbP silencing DNA regulatory element or pathway, such as a Bcl11a-regulated HbP silencing region; (e) to mutate one or more ?-globin gene promoter(s) to achieve increased expression of a ?-globin gene; (f) to mutate one or more ?-globin gene promoter(s) to achieve increased expression of a ?-globin gene; and/or (g) to correct one or more ?-globin gene mutation(s).

Abstract: A method, apparatus and computer program product for storing data in a disk storage system is presented. A high-performance dictionary data structure is defined. The dictionary data structure is stored on a disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure. Updates run faster than one insertion per disk-head movement. The structure can also be stored on any system with two or more levels of memory. The dictionary is high performance and supports with full transactional semantics, concurrent access from multiple transactions, and logging and recovery. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk.

Abstract: A method, apparatus and computer program product for storing data in a disk storage system is presented. A dictionary data structure is defined and stored on the disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure, with full transactional semantics, at a rate that is faster than one insertion per disk-head movement. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. The dictionary employs indirect logging for physical block logging.

Abstract: A method, apparatus and computer program product for storing data in a disk storage system is presented. A dictionary data structure is defined and stored on the disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure, with full transactional semantics, at a rate that is faster than one insertion per disk-head movement. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. The dictionary employs indirect logging for physical block logging.

Abstract: A method, apparatus and computer program product for storing data in a disk storage system is presented. A dictionary data structure is defined and stored on the disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure, with full transactional semantics, at a rate that is faster than one insertion per disk-head movement. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. The dictionary employs indirect logging for physical block logging.

Abstract: A method, apparatus and computer program product for storing data in a disk storage system is presented. A high-performance dictionary data structure is defined. The dictionary data structure is stored on a disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure. Updates run faster than one insertion per disk-head movement. The structure can also be stored on any system with two or more levels of memory. The dictionary is high performance and supports with full transactional semantics, concurrent access from multiple transactions, and logging and recovery. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk.

Abstract: In a multiple processor computing apparatus, directional routing restrictions and a logical channel construct permit fault tolerant, deadlock-free routing. Processor allocation can be performed by creating a linear ordering of the processors based on routing rules used for routing communications between the processors. The linear ordering can assume a loop configuration, and bin-packing is applied to this loop configuration. The interconnection of the processors can be conceptualized as a generally rectangular 3-dimensional grid, and the MC allocation algorithm is applied with respect to the 3-dimensional grid.

Abstract: A method, apparatus and computer program product for storing data in a disk storage system is presented. A dictionary data structure is defined and stored on the disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure, with full transactional semantics, at a rate that is faster than one insertion per disk-head movement. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. The dictionary employs indirect logging for physical block logging.

Abstract: In accordance with one embodiment of the invention, a server system computes a feasible stretch value for use in scheduling job requests. A stretch value provides an indication of the delay experienced by each job to complete, when the server processes many jobs concurrently. For a set of job requests, a processing time is calculated for each job request based on, for example, the characteristics of the job and the server system. Thereafter, an estimated stretch value for the set is selected. The server system computes a deadline for each job to be the arrival time of the job request plus the product of the processing time and the estimated stretch value. Thereafter, each job request is scheduled, based on an "earliest deadline first" arrangement, wherein the job request that has the earliest deadline is scheduled first, the job request having the next earliest deadline is scheduled second, etc.The selected stretch value is deemed feasible if each pending job in the set can be completed prior to its deadline.