3143 results about "Bitmap" patented technology

Methods and apparatus are disclosed for generating and using an enhanced tree bitmap data structure in determining a longest prefix match, such as in a router, packet switching system. One implementation organizes the tree bitmap to minimize the number of internal nodes that must be accessed during a lookup operation. A pointer is included in each of the trie or search nodes to the best match so far entry in the leaf or results array which allows direct access to this result without having to parse a corresponding internal node. Moreover, one implementation stores the internal node for a particular level as a first element in its child array. Additionally, one implementation uses a general purpose lookup engine that can traverse multiple tree bitmaps or other data structures simultaneously, and perform complete searches, partial searches, and resume partial searches such as after receiving additional data on which to search.

A deterministic finite automaton uses binary search (and optionally hashing) method(s) of sparse matrix representation to recognize the graphical representations of characters or icons from a bitmap representation of the computer screen. This recognition can be applied to translate data from an unknown form of original specification (file format) into a known form of representation, such as HTML. Alternatively this recognition can be applied to another process that can “see” what is on the screen, and perform programmed actions, based on what it “sees”.

A scanning system includes a hand-held scanning device that generates two-dimensional images of a pattern reflected off an object. The system also includes a memory and processing unit. The memory stores a calibration table for the scanner and received scanned bitmap images. The processing unit generates three-dimensional information as to a scanned object. The scanning can be performed without knowledge or even precise control of the position of the object relative to the scanner. Random movement of the object during scanning is also possible. For example, the scanner is simply swept over the surface of the object by hand. Three-dimensional information of the object is obtained from the captured images using a calibration table for the scanner. A method of calibration of the scanner in X, Y and Z directions is also described. The scanner can be used for a variety of purposes, including medical and industrial purposes. The illustrated embodiment is in-vivo scanning of human teeth for purposes of orthodontic treatment planning and diagnosis.

A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.

A novel solution for fast packet classification includes a novel data structure to store classifier rules which enables fast packet classification, which structure employs bitmaps for each field of the incoming packet for which classification is desired. A fast packet classification algorithm using the novel data structure allows the matching rule with the highest priority to be quickly obtained. A novel rule update algorithm allows new classifier rules to be added into the data structure incrementally. In one practical implementation of a classification engine employing the structures and algorithms of the present invention, a configurable processor with customized instructions is used to accelerate packet classification.

An efficient write-watch mechanism and process. A bitmap is associated with the virtual address descriptor (VAD) for a process, one bit for each virtual page address allocated to a process having write-watch enabled. As part of the write-watch mechanism, if a virtual address is trimmed to disk and that virtual address page is marked as modified, then the corresponding bit in the VAD is set for that virtual address page. In response to an API call (e.g., from a garbage collection mechanism) seeking to know which virtual addresses in a process have been modified since last checked, the memory manager walks the bitmap in the relevant VAD for the specified virtual address range for the requested process. If a bit is set, then the page corresponding to that bit is known to have been modified since last asked. If specified by the API, the bit is cleared in the VAD bitmap so that it will reflect the state since this time of asking. If the bit is not set, to determine if the page was modified, the page table entry (PTE) is checked for that page, and if the PTE indicates the page was modified, the page is known to be modified, otherwise that page is known to be unmodified since the last call. One enhancement uses page directory tables to locate a series of trimmed pages, sometimes avoiding the need to access the PTE.

The present invention features a playing card shuffling device, which through the use of a small image capturing means, captures an image of the face value of each card and stores the image in memory. This image is sorted in the format of a bitmap image. The operator of the machine would be able to recall through the use of a key pad, the images of the cards that comprised the individual hands in the previous game. This feature allows for verification of a winning hand after a game has been completed. Thereby, a quick recheck of hands before paying a winning hand is performed. The face value of each card is determined by character recognition software. These card values would be stored in memory for archival access for use in monitoring the randomness of the game and determining the number of winning hands.

A method and system for rendering a desktop on a computer using a composited desktop model operating system are disclosed. A composited desktop window manager, upon receiving content information from application programs, draws the window to a buffer memory for future reference, and takes advantage of advanced graphics hardware and visual effects to render windows based on content on which they are drawn. The windows may also be rendered based on environment variables including virtual light sources. The frame portion of each window may be generated by pixel shading a bitmap having the appearance of frosted glass based on the content of the desktop on top of which the frame is displayed. Legacy support is provided so that the operating system can draw and render windows generated by legacy applications to look consistent with non-legacy application windows.

Systems and methods for tracking changes and performing backups to a storage device are provided. For virtual disks of a virtual machine, changes are tracked from outside the virtual machine in the kernel of a virtualization layer. The changes can be tracked in a lightweight fashion with a bitmap, with a finer granularity stored and tracked at intermittent intervals in persistent storage. Multiple backup applications can be allowed to accurately and efficiently backup a storage device. Each backup application can determine which block of the storage device has been updated since the last backup of a respective application. This change log is efficiently stored as a counter value for each block, where the counter is incremented when a backup is performed. The change log can be maintained with little impact on I/O by using a coarse bitmap to update the finer grained change log.

A communication apparatus generates a single physical frame including a plurality of MAC frames, and transmits the physical frame. The physical frame has variable-length bitmap information comprising bits corresponding to the plurality of MAC frames, respectively, and length information of the bitmap information.

An improved method and apparatus for creating a snapshot of a file system. A record of which blocks are being used by a snapshot is included in the snapshot itself, allowing effectively instantaneous snapshot creation and deletion. The state of the active file system is described by a set of metafiles; in particular, a bitmap (henceforth the “active map”) describes which blocks are free and which are in use. The inode file describes which blocks are used by each file, including the metafiles. The inode file itself is described by a special root inode, also known as the “fsinfo block”. The system begins creating a new snapshot by making a copy of the root inode. This copy of the root inode becomes the root of the snapshot.

A computer system modifies digital images of the human form as well as other objects. The computer system provides intuitive means for accessing warp, smooth, stretch, copy, and paste tools for image modification; undo, toggle and restore tools for change management; and zoom, fit, and full tools for image display sizing. The computer system is controlled by a program that uses a combination of novel approaches to make image manipulation fast and easy. Buttons are displayed only when they are actually available for use, based on the current system operating mode. The image sizing tools enable an image size change to accomodate the tool size without a required change to the cursor state or to the edit mode state. When regions are defined by the user, the cursor shape changes to indicate whether the cursor is located inside a region, outside the region, and on the region bounding box; allowing a user to perform different operations depending upon cursor location rather than depending upon, and requiring, user executed button pushing as a specific operation. The computer system uses display contexts and bitmap masks that enhance operation speed. Operations are always performed on the full image resolution rather than a displayed image resolution.

A method supporting a Hybrid Automatic Repeat Request (HARQ) between a subscriber station and a base station in a broadband wireless access communication system including. The method includes the steps of: transmitting at least one H-ARQ enabled uplink burst from the subscriber station to the base station; generating ACK/NACK information according to the received HARQ enabled uplink burst at the base station; mapping the generated ACK/NACK information to a bitmap at the base station; transmitting the bitmap through a downlink information from the base station to the subscriber station.

The present invention relates to display of visual content on a client device using server-side rasterization of visual content. Visual content is rendered on a server system, transformed into bitmaps compatible with the display attributes of a client device, and transmitted for display on the client device. The invention allows the server to perform, in effect, as a remote browser for displaying Web pages, e-mail, e-mail attachments, electronic document and forms, database queries and results, drawings, presentations, and images at the client device. The approach is “remote” because the server does the rendering and the client provides the interface; “multi-level” because rendered visual content is represented as a multi-level set of raster representations; and constitutes a “browsing system” because the client and server share data about the source visual content element being browsed, and the client performs a specific browsing function assisted by the server.

A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. Objects containing bitmap values may be indexed by means of an index tree that includes summary bitmap values.

A method and apparatus for recording on an optical recording medium, including the recording of management information, are described as a standard for the write-once Blu-ray disc. The management information is recorded in a management area of the disc, such as a temporary defect management area (TDMA), and includes record status information and update information. The record status information is a space bitmap (SBM) indicating whether a recording operation has been performed for a predetermined area of the disc, and the update information is SBM update information indicating whether the record status information is to be continuously managed. The SBM update information controls the state of an SBM-on/off function for each of a plurality of recording areas and may be in the form of either start position information and length information corresponding to the respective areas or an SBM update flag. The SBM update information is recorded in the TDMA and is stored in a memory of an optical disc recording/reproducing device for use during recording and reproducing operations. At the time of recording in the predetermined area, an SBM-on state enables a logical overwriting operation to be performed as necessary.

Methods and systems are provided for sequence number checking. Sequence numbers of data packets are compared to a “sliding” window. The sliding window indicates a range of sequence numbers considered valid (or invalid). The size of the sliding window may be a particular value or varied. If a sequence number is “below” the sliding window, then it may be considered invalid. If a sequence number is within the sliding window, then it may be further checked to determine if a duplicate sequence number has been received. If a sequence number is “above” the sliding window, then it may be considered valid and the sliding window is advanced. The sliding window and sequence numbers are processed using multiple level bitmaps, which indicate a historical state of sequence numbers received. Furthermore, the multiple level bitmaps may comprise summary bits to summarize a state of subsequent bits.

A mobile device has a touch sensitive surface such as a touch screen. In a touch-based zooming control method, the mobile device displays target data of a selected content on a screen. While the target data is displayed, the mobile device activates a zoom mode in response to a given gesture or input event. Then, the mobile device receives a touch-based gesture input which starts from a specific point on the target data, and executes a zooming function such as a zoom-in and a zoom-out in response to the received gesture input. Particularly, a continuous zooming control in various zooming rates is possible based on a single touch gesture. A toggling-based zooming control is also possible. A bitmap image is used for a rapid real-time display of the target data.