Abstract: A method and apparatus for “ring fencing” an operating system, with any apps or programs running on that operating system, in such a way that all operations of the apps, programs, and operating system use real resources only with the permission or through the intermediation of a resource allocator programmed to allow only secure access to a known finite set of resources. The list of kinds of resources is short, and the list of resources is under the explicit control of the resource allocator, which is programmed with Communicating Sequential Processes techniques so as to give formally verifiable assurance of predefined security requirements. At the same time, the full features of the operating system are supported with minimal changes in its kernel and no changes in app or program binary code that accesses real resources via calls or bytecode that drives dynamic system libraries or a runtime environment.

Abstract: A task scheduling method is disclosed, where each processor core is programmed with a short list of priorities, each associated with a minimum response time. The minimum response times for adjacent priorities are different by at least one order of magnitude. Each process is assigned a priority based on how its expected response time compares with the minimum response times of the priorities. Lower priorities may be assigned a timeslice period that is a fraction of the minimum response time. Also disclosed is a task division method of dividing a complex task into multiple tasks is; one of the tasks is an input gathering authority task having a higher priority, and it provides inputs to the other tasks which have a lower priority. A method that permits orderly shutdown or scaling back of task activities in case of resource emergencies is also described.

Abstract: A task scheduling method is disclosed, where each processor core is programmed with a short list of priorities, each associated with a minimum response time. The minimum response times for adjacent priorities are different by at least one order of magnitude. Each process is assigned a priority based on how its expected response time compares with the minimum response times of the priorities. Lower priorities may be assigned a timeslice period that is a fraction of the minimum response time. Also disclosed is a task division method of dividing a complex task into multiple tasks is; one of the tasks is an input gathering authority task having a higher priority, and it provides inputs to the other tasks which have a lower priority. A method that permits orderly shutdown or scaling back of task activities in case of resource emergencies is also described.

Abstract: A task scheduling method is disclosed, where each processor core is programmed with a short list of priorities, each associated with a minimum response time. The minimum response times for adjacent priorities are different by at least one order of magnitude. Each process is assigned a priority based on how its expected response time compares with the minimum response times of the priorities. Lower priorities may be assigned a timeslice period that is a fraction of the minimum response time. Also disclosed is a task division method of dividing a complex task into multiple tasks is; one of the tasks is an input gathering authority task having a higher priority, and it provides inputs to the other tasks which have a lower priority. A method that permits orderly shutdown or scaling back of task activities in case of resource emergencies is also described.

Abstract: A task scheduling method is disclosed, where each processor core is programmed with a short list of priorities, each associated with a minimum response time. The minimum response times for adjacent priorities are different by at least one order of magnitude. Each process is assigned a priority based on how its expected response time compares with the minimum response times of the priorities. Lower priorities may be assigned a timeslice period that is a fraction of the minimum response time. Also disclosed is a task division method of dividing a complex task into multiple tasks is; one of the tasks is an input gathering authority task having a higher priority, and it provides inputs to the other tasks which have a lower priority. A method that permits orderly shutdown or scaling back of task activities in case of resource emergencies is also described.

Abstract: A task scheduling method is disclosed, where each processor core is programmed with a short list of priorities, each associated with a minimum response time. The minimum response times for adjacent priorities are different by at least one order of magnitude. Each process is assigned a priority based on how its expected response time compares with the minimum response times of the priorities. Lower priorities may be assigned a timeslice period that is a fraction of the minimum response time. Also disclosed is a task division method of dividing a complex task into multiple tasks is; one of the tasks is an input gathering authority task having a higher priority, and it provides inputs to the other tasks which have a lower priority. A method that permits orderly shutdown or scaling back of task activities in case of resource emergencies is also described.

Abstract: A task scheduling method is disclosed, where each processor core is programmed with a short list of priorities, each associated with a minimum response time. The minimum response times for adjacent priorities are different by at least one order of magnitude. Each process is assigned a priority based on how its expected response time compares with the minimum response times of the priorities. Lower priorities may be assigned a timeslice period that is a fraction of the minimum response time. Also disclosed is a task division method of dividing a complex task into multiple tasks is; one of the tasks is an input gathering authority task having a higher priority, and it provides inputs to the other tasks which have a lower priority. A method that permits orderly shutdown or scaling back of task activities in case of resource emergencies is also described.

Abstract: A ballistic structure having at least one laminate sheet of a plurality of fiber bundles or tapes is disclosed. In embodiments having more than one laminate sheet, the inter-laminate shear strength between the laminate sheets is controlled to control ballistic effectiveness of the ballistic structure.

Abstract: A ballistic structure having at least one laminate sheet of a plurality of fiber bundles or tapes is disclosed. In embodiments having more than one laminate sheet, the inter-laminate shear strength between the laminate sheets is controlled to control ballistic effectiveness of the ballistic structure.

Abstract: A ballistic structure for armor with improved multi-hit behavior includes at least a ceramic element and at least one defined void in the ceramic element to separate the ceramic element into separate ballistic segments. The defined void is, for example, a slit of given depth and width.

Abstract: A ballistic structure for armor with improved multi-hit behavior includes at least a ceramic element and at least one defined void in the ceramic element to separate the ceramic element into separate ballistic segments. The defined void is, for example, a slit of given depth and width.

Abstract: A formed metallic armor assembly is disclosed, wherein a backing portion is adhered to a durable, formed metallic facing element. The metallic facing element has a reduced effective density to reduce the weight of the assembly without reducing the effectiveness of defeating penetration threats. The backing portion is selected to have a predetermined thickness to be effective against predetermined penetration threats.

Abstract: A data storage apparatus has a plurality of n disks and data comprising a plurality of data groupings stored respectively across the plurality of n disks. Each one of the n data groupings comprises a data portion and a data redundancy portion. Advantageously, the n data portions are recoverable from any and all combinations of n−m data grouping(s) on n−m disk(s) when the other m data grouping(s) are unavailable, where 1≦m<n. The disk storage apparatus may be configured for a parameter m which is selectable.

Abstract: A ballistic composite laminate exemplified by a panel incorporating resin impregnated, heat and pressure bonded, fabric layers of high tensile strength "S" glass roving filaments on its backside extending through approximately one-half its thickness with the remainder of its thickness on the face side of the laminate formed of appreciably lower cost fabric layers of "E" glass filaments, which meet acceptance according to military ballistic acceptance tests substantially matching higher cost panels reinforced with fabrics of 100% "S" glass filaments.

Abstract: A method and apparatus for producing shipping rolls of wrinkle free ballistics type film faced composite sheet material which when assembled and cured on a shipping tube is subject to having surface wrinkles and creases. By assembling the material on a forming roll of large diameter, such that the thickness of the wound wraps of a given length of the sheet material is relatively thin, the deformation of each wrap is minimized during heat and compression curing and the cured material is free of surface wrinkles and creases. The cure-stabilized material then can be unwound and cut to desired length and wound on a small diameter shipping tube to provide a shipping package of material free of wrinkles and creases. The curing apparatus includes a cylinder with an internally lined inflatable bladder, such cylinder being adaptable to being moved into surrounding relation with the sheet material.

Abstract: A method and means for producing disks of tightly packed on-end aligned fibers wherein side-by-side filament tows are surrounded and pulled by a Chinese-finger type gripper sleeve which tightens about the tows and compacts the filaments as it is pulled. The gripper sleeve and filament assembly is further compacted by being pulled through a draw-down die and into a tube surrounded by a backup casing. The highly compacted mass of filaments with the surrounding portion of the sleeve within the tube are cut free from the external portion of the portion of the puller sleeve and the loaded tube is removed from the casing. A plurality of disks of predetermined thickness containing the desired highly compacted on-end aligned fibers are then formed by cross-sectionally cutting the filament loaded tube segment by segment.

Abstract: A hyperbolic geometry model formed by several pieces of flexible material joined along their edges in a predetermined manner. In one embodiment, the pieces are polygons arranged so that the sum of the angles about each vertex or corner exceeds 360.degree.. In a second embodiment the pieces are elongated strips joined edge-to-edge about a center line with the inner strips being comparatively straight and the strips away from the center line having a progressively decreasing radius of curvature. In a final embodiment the pieces are arcuate strips joined edge-to-edge about a center point with the radius of curvature of the strips progressively increasing to a finite limit away from the center point. The resulting hyperbolic geometry model is a sheet of flexible material which, because of its increasing fullness away from the center of the model, exhibits geometric properties which illustrate the characteristics of a hyperbolic plane.