Настройки

Укажите год
-

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

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

Подробнее
-

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

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

Подробнее

Форма поиска

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

Применить Всего найдено 6. Отображено 6.
25-01-2018 дата публикации

TOMOGRAPHY SYSTEM

Номер: US20180025514A1

Systems and methods for MBIR reconstruction utilizing a super-voxel approach are provided. A super-voxel algorithm is an optimization algorithm that, as with ICD, produces rapid and geometrically agnostic convergence to the MBIR reconstruction by processing super-voxels which comprise a plurality of voxels whose corresponding memory entries substantially overlap. The voxels in the super-voxel may also be localized or adjacent to one another in the image. In addition, the super-voxel algorithm straightens the memory in the “sinogram” that contains the measured CT data so that both data and intermediate results of the computation can be efficiently accessed from high-speed memory and cache on a computer, GPU, or other high-performance computing hardware. Therefore, each iteration of the super-voxel algorithm runs much faster by more efficiently using the computing hardware. 1. A tomography system , comprising:one or more computer processors having a first memory, the first memory having a first access speed;a second memory having a second access speed slower than the first access speed; and receiving measured data from a tomography scanner;', 'storing the measured data in the second memory; and', 'creating an initial image from the received measured data, the initial image comprising a plurality of voxels;', 'updating a super voxel in the initial image, the super voxel comprising a plurality of voxels whose corresponding data locations in the second memory substantially overlap, the updating performed by retrieving said corresponding data from the second memory and storing said corresponding data in the first memory, said corresponding data comprising a subset of the measured data., 'one or more program modules stored on a third memory and executable by the one or more processors to perform operations comprising2. The system according to claim 1 , wherein the first memory is organized in cache lines claim 1 , and the updating includes rearranging the portions of the ...

Подробнее
30-04-2002 дата публикации

Method for optimizing creation and destruction of objects in computer programs

Номер: US0006381738B1

Information is computed about the reachability relationships among objects and pointers to enable transformation of a computer program for optimizing the creation and destruction of objects, while strictly performing the semantics of the original program. An interprocedural analysis is used to determine whether an object that is allocated on the heap during the execution of a procedure is not reachable from any global variable, parameter, or the return value of the procedure after it returns. If so, that object can be allocated on the stack frame of the procedure in which it is otherwise heap-allocated. This simplifies the memory allocation and deallocation operations, as allocation on the stack can be done more efficiently than allocation on the heap, and objects allocated on the stack frame of a procedure are automatically deallocated when the procedure returns, without incurring the overhead of garbage collection. This, in turn, leads to faster programs which use fewer computer processor ...

Подробнее
29-01-2002 дата публикации

Method for optimizing array bounds checks in programs

Номер: US0006343375B1

A method and several variants for optimizing the detection of out of bounds array references in computer programs are described, while preserving the semantics of the computer program. Depending on the variant implemented, the program is divided at run-time or compile-time into two or more regions. The regions are differentiated by the number of checks that need to be performed at run-time on the array accesses within the region. In particular, some regions of the program will not need any array bounds checks performed at run-time, which will increase the speed at which the computer program executes. As well, the state of program variables at the time any out of bounds access is detected is the same as the state of the program variables would have been had the transformation not been performed. Moreover, the regions not needing any checks at run-time will be known at compile-time, enabling further compiler optimizations on the region. The variants of the method are distinguished by the number of regions created, the number of checks needed at run-time, and the size of the program that results from the optimization.

Подробнее
06-12-2005 дата публикации

Method for compiling program components in a mixed static and dynamic environment

Номер: US0006973646B1

This invention describes a method and several variants for compiling programs or components of programs in a mixed static and dynamic environment, so as to reduce the amount of time and memory spent in run-time compilation, or to exercise greater control over testing of the executable code for the program, or both. The invention involves generating persistent code images prior to program execution based on static compilation or dynamic compilation from a previous run, and then, adapting those images during program execution. We describe a method for generating auxiliary information in addition to the executable code that is recorded in the persistent code image. Further, we describe a method for checking the validity of those code images, adapting those images to the new execution context, and generating new executable code to respond to dynamic events, during program execution. Our method allows global interprocedural optimizations to be performed on the program, even if the programming ...

Подробнее
04-03-2003 дата публикации

Method for optimizing locks in computer programs

Номер: US0006530079B1

A method and several variants for using information about the scope of access of objects acted upon by mutual exclusion, or mutex, locks to transform a computer program by eliminating locking operations from the program or simplifying the locking operations, while strictly performing the semantics of the original program. In particular, if it can be determined by a compiler that the object locked can only be accessed by a single thread it is not necessary to perform the "acquire" or "release" part of the locking operation, and only its side effects must be performed. Likewise, if it can be determined that the side effects of a locking operation acting on a variable which is locked in multiple threads are not needed, then only the locking operation, and not the side effects, needs to be performed. This simplifies the locking operation, and leads to faster programs which use fewer computer processor resources to execute; and programs which perform fewer shared memory accesses, which in turn ...

Подробнее
18-08-2016 дата публикации

Tomography system

Номер: WO2016131062A1

Systems and methods for MBIR reconstruction utilizing a super- voxel approach are provided. A super- voxel algorithm is an optimization algorithm that, as with ICD, produces rapid and geometrically agnostic convergence to the MBIR reconstruction by processing super- voxels which comprise a plurality of voxels whose corresponding memory entries substantially overlap. The voxels in the super- voxel may also be localized or adjacent to one another in the image. In addition, the super- voxel algorithm straightens the memory in the "sinogram" that contains the measured CT data so that both data and intermediate results of the computation can be efficiently accessed from high-speed memory and cache on a computer, GPU, or other high-performance computing hardware. Therefore, each iteration of the super- voxel algorithm runs much faster by more efficiently using the computing hardware.

Подробнее