Abstract: Files stored on a hard disk drive are scanned for a predefined pattern, such as a virus definition. For each one of a plurality of files, predetermined select portion(s) (e.g., likely sites of infection) are stored in a common file. After storing the predetermined select portions, the portions are tested without accessing the file to determine whether content of the predetermined select portion corresponds to the predefined pattern.

Abstract: A ladder accessory device includes an arm and a sleeve for engaging a hollow rung of a ladder. While installed, the sleeve is generally stationary within the hollow rung. The arm is generally is free to rotate within the sleeve about a first axis defined by length of the arm. A member engages the arm at a first joint about which the arm may rotate. A platform engages the member at a second joint about which the platform may rotate. Motion about the first axis and motion about the first joint enable the platform to be generally self-leveling in two directions while the member suspends the platform at a level lower than the arm. Range of motion of the first joint and second joint extend sufficiently to allow the arm, member and platform to be stored in a generally parallel alignment.

Abstract: A virus and malware cleaner is generated for a personal computer. Scanning software determines the presence of suspicious attributes resident to the computer. When automated detection of the need for a Custom Cleaner occurs, specific system information, along with information about the suspicious attributes, is included in a Custom Cleaner Request. The request is automatically generated and transmitted to a server for processing. In response a Custom Cleaner may be automatically created from a database of parameterized instructions, then downloaded to the user's computer for execution. Automatic verification of the Custom Cleaner success in removing infected files may be sent to the server. In the event that a Custom Cleaner cannot be generated automatically, an escalation occurs in which a support technician becomes involved in preparing the Custom Cleaner. Escalation data accessed by the support technician may include automatically generated diagnostic hints.

Abstract: Files are tested for presence of a predefined data pattern, such as a virus definition. For each one file of a first plurality of files, physical address data is derived from logical address information. Also, an entry is made in a first data structure. The entry includes file information and the derived physical address data. For each one cylinder of a hard drive, the first data structure is tested to identify any files having file contents stored in the cylinder. When the testing determines that the first data structure includes an entry having physical address data corresponding to the one cylinder, a read operation I requested to read the cylinder. Such testing and reading is repeated to read in multiple cylinders in a generally sequential order. The cylinder content is stored in a buffer. File content is read from the buffer for each one file of a second plurality of files. The read file content is tested for the presence of the predefined data pattern.

Abstract: In a multi-pole, double-throw switch, three multi-terminal device connectors are coupled to a printed circuit board, along with two header connectors and a movable array. A pcb trace electrically couples each terminal of each device connector to one or more corresponding contacts at the header connectors. The movable is movable between a first throw position in which a first header connector is engaged, and a second throw position in which a second header connector is engaged. In the first throw position, each terminal of a first of the three device connectors is electrically connected to a corresponding terminal of a second of the three device connectors. In the second throw position, each terminal of the first of the three device connectors is electrically connected to a corresponding terminal of a third of the three device connectors.

Abstract: In a scanning display apparatus an image signal source produces an image signal. A light emitter is coupled to the image signal source and responsive to the image signal to emit light. A lensing system receives light from the light emitter and passes exiting light. A scanner scans the image light. A light sensor detects intensity of background light. A controller adjusts intensity of the image light in response to the detected background light intensity.

Abstract: Apparent distance of a pixel within an optical field of view is determined. Incoming light is scanned along a raster pattern to direct light for a select pixel onto a light distance detector. The distance is sampled for each pixel or for a group of pixels. The light distance detector includes a concentric set of rings sensors. The larger the spot of light corresponding to the pixel, the more rings are impinged. The diameter of the spot is proportional to the distance at which the light originated (e.g., light source or object from which light was reflected). Alternatively, a variable focus lens (VFL) adjusts focal length for a given pixel to achieve a standard spot size. The distance at which the light originated correlates to the focal length of the VFL.

Abstract: A sender prepares a message, then transmits an e-mail notice to the receiver and the e-mail message to a forwarding server. The “e-mail notice” is a short message, including a message ID and specifically does not include the complete prepared message. The “e-mail message” is in binary format and also includes the message ID of the corresponding e-mail notice. The receiving user receives the e-mail notice, then contacts the forwarding server to receive the e-mail message corresponding to the message ID within the received e-mail notice.

Abstract: Control points used in deriving an object boundary for a prior frame are overlaid onto a current frame. An initial estimate of an object boundary are derived from the control points and edge energy data. The operator adjusts the control points to better model the boundary for the current frame. For each updated control point, the object boundary is rederived. A restricted area is defined encompassing the initial control points. When a control point is moved outside the restricted area, the restricted area is redefined to accommodate it. The boundary between control points is derived by finding a best path. Only points within the restricted area are considered. A first set of rules is used to find the best path when the distance between the two points is less than threshold value. A second set of rules is used when the distance between the two points exceeds the threshold value.

Abstract: Object segmentation and tracking are improved by including directional information to guide the placement of an active contour (i.e., the elastic curve or ‘snake’) in estimating the object boundary. In estimating an object boundary the active contour deforms from an initial shape to adjust to image features using an energy minimizing function. The function is guided by external constraint forces and image forces to achieve a minimal total energy of the active contour. Both gradient strength and gradient direction of the image are analyzed in minimizing contour energy for an active contour model.

Abstract: An object is tracked among a plurality of image frames. In an initial frame an operator selects an object. The object is distinguished from the remaining background portion of the image to yield a background and a foreground. A model of the background is used and updated in subsequent frames. A model of the foreground is used and updated in the subsequent frames. Pixels in subsequent frames are classified as belonging to the background or the foreground. In subsequent frames, decisions are made, including: which pixels do not belong to the background; which pixels in the foreground are to be updated; which pixels in the background were observed incorrectly in the current frame; and which background pixels are being observed for the first time. In addition, mask filtering is performed to correct errors, eliminate small islands and maintain spatial and temporal coherency of a foreground mask.

Abstract: A virtual image is registered among a perceived real world background. Tracking light is scanned into the real world environment, which includes at least one detector pair. A first time and a second time at which the tracking light impinges on the first detector is detected, in which the first time and second time occurs within adjacent scan lines. A time at which a horizontal scan line edge (e.g., beginning of scan line or end of scan line) is encountered is derived as occurring one half way between the first time and the second time. The horizontal location of the first detector then is determined within a specific scan line inferring the scan line edge time. The vertical location of the detector is determined within a scan frame by measuring time duration using the beginning of the frame. By determining a location independently from the temporal resolution of the augmented imaging system, the temporal location of the detector is identified to a sub-pixel/sub-line precision.

Abstract: A VLIW instruction format is introduced having a set of control bits which identify subinstruction sharing conditions. At compilation the VLIW instruction is analyzed to identify subinstruction sharing opportunities. Such opportunities are encoded in the control bits of the instruction. Before the instruction is moved into the instruction cache, the instruction is compressed into the new format to delete select redundant occurrences of a subinstruction. Specifically, where a subinstruction is to be shared by corresponding functional processing units of respective clusters, the subinstruction need only appear in the instruction once. The redundant appearance is deleted. The control bits are decoded at instruction parsing time to route a shared subinstruction to the associated functional processing units.

Abstract: Receiver access to a secure communication is determined by the sender. The sender defines an access parameter, such as number of times a message can be decrypted, expiration time of message, or some contingent event that triggers expiration of a message. A send configuration module defines the encryption method, encryption key length, and the control parameter(s). A key management module serves to implement the send configuration parameters during a communication. Upon receiving a message the receiver module contacts the key management module to request a decryption key. The key management module returns the decryption key or a ‘denied’ message. Once the message is decrypted at the receiver, the key and the decrypted source are deleted from the receiver computer. The message is displayed in a bit-mapped window.

Abstract: Allowed actions of a computer-based player in a game are limited. A pre-action value is identified which corresponds to a relative advantage between the computer-based player and a real person player prior to a current action taken by the computer-based player. A post-action value is identified corresponding to the relative advantage between the computer-based player and the real person player after the current action taken by the computer-based player. The current action is limited to be among a set of allowed actions, which keep the post-action value at least as great as a threshold value. The current action of the computer-based player also may be limited to keep the post-action value not more than a tolerable value, where possible. The current action is selected from the set of allowed actions. The threshold value and tolerance value are prescribed, selected or varied over the course of the game.

Abstract: A processor including a transposable register file. The register file allows normal row-wise access to data and also allows a transposed column-wise access to data stored in a column among registers of the register file. In transposed access mode, a data operand is accessed in a given partition of each of n registers. One register stores a first partition. An adjacent register stores the second partition, and so forth for each of n partitions of the operand. A queue-based transposable register file also is implemented. The queue-based transposable register file includes a head pointer and a tail pointer and has a virtual register. Data written into the virtual register is written into one of the registers as selected by the head pointer. Data read from the virtual register is read from one of the registers as selected by the tail pointer.

Abstract: The template data transfer coprocessor (TDTP) offloads block data transfer operations from a mediaprocessor. A uni-block template, program-guided template, an indirect template and queue-based template are described. The TDTP includes a template interpreter that employs an event-driven control mechanism to set up a template and compute block information and block information for each template. The programming involved in defining block data transfers for video and image processing algorithms is substantially reduced by the use of these templates.

Abstract: The register file of a processor includes embedded operand queues. The configuration of the register file into registers and operand queues is defined dynamically by a computer program. The programmer determines the trade-off between the number and size of the operand queue(s) versus the number of registers used for the program. The programmer partitions a portion of the registers into one or more operand queues. A given queue occupies a consecutive set of registers, although multiple queues need not occupy consecutive registers. An additional address bit is included to distinguish operand queue addresses from register addresses. Queue state logic tracks status information for each queue, including a header pointer, tail pointer, start address, end address and number of vacancies value. The program sets the locations and depth of a given operand queue within the register file.

Abstract: An area of on-chip memory is allocated to store one or more tables of commonly-used opcodes. The normal opcode in the instruction is replaced with a shorter code identifying an index into the table. As a result, the instruction is compressed. For a VLIW architecture, in which an instruction includes multiple subinstructions (multiple opcodes), the instruction loading bandwidth is substantially reduced. Preferably, an opcode table is dynamically loaded. Different tasks are programmed with a respective table of opcodes to be stored in the opcode table. The respective table is loaded when task switching.

Abstract: In a scanning display apparatus an image signal source produces an image signal. A light emitter is coupled to the image signal source and responsive to the image signal to emit light. A lensing system receives light from the light emitter and passes exiting light. A scanner scans the image light. A light sensor detects intensity of background light. A controller adjusts intensity of the image light in response to the detected background light intensity.