1199 results about "Bitmap" patented technology

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 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.

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.

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 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 method of processing a commerce service in a commerce processor communicating with a customer premises equipment (CPE), the method including executing a first browser and outputting a coordinate corresponding to a bitmap associated with inputted payment data on a screen of the first browser, receiving coordinate values corresponding to payment data through the output coordinate, transmitting the received coordinate values based on a communication protocol to a second browser, unscrambling the transmitted coordinate values corresponding to the payment data and retrieving payment data from the unscrambled coordinate values, and performing a payment process for a product item corresponding to the retrieved payment data.

A method of distributed control of a wireless mesh network without knowledge of global topology. The method includes: a station joining the network with any current member by propagating the join-request, or two meshes merging using the steps of: one mesh joining the other as a whole and then re-synchronizing its timing. The method further includes: first, each station periodically transmits a beacon; second, in response to a beacon being no longer detected, a station transmitting a bitmap of stations that it can still receive; third, each station responds by adding stations that it can receive with all of the bitmaps received from other members, and retransmitting the updated bitmap; fourth, after time for all stations to respond, all stations base current membership on the bitmap. The method further includes: determining sharable time slots that will not interfere with neighbors or other slot sharers, using and then releasing those slots.

A communication apparatus includes a receiving device configured to receive one physical frame in which a plurality of MAC frames are aggregated. This physical frame includes one acknowledgement request frame for the plurality of MAC frames. The apparatus includes an acknowledgement frame forming device configured to form an acknowledgement frame representing reception statuses of the plurality of MAC frames in response to the acknowledgement request frame. The apparatus also includes a transmitting device configured to transmit the acknowledgement frame. This acknowledgement frame includes a compressed acknowledgement frame representing an acknowledgement bitmap having a size equal to a maximum number of MSDUs (MAC Service Data Units) when one MPDU (MAC Protocol Data Unit) corresponds to one MSDU.

Apparatus, systems, and methods can operate to provide efficient data clustering, data classification, and data compression. A method comprises training set of training instances can be processed to select a subset of size-1 patterns, initialize a weight of each size-1 pattern, include the size-1 patterns in classes in a model associated with the training set, and then include a set of top-k size-2 patterns in a way that provides an effective balance between local, class, and global significance patterns. A method comprises processing a dataset to compute an overall significance value of each size-2 pattern in each instance in the dataset, sort the size-2 patterns, and select the top-k size-2 patterns to be represented in clusters, which can be refined into a clustered hierarchy. A method comprises creating an uncompressed bitmap, reordering the bitmap, and compressing the bitmap. Additional apparatus, systems, and methods are disclosed.

A processing system wherein a bitmap array is first used to obtain an index. The index is used to obtain a value from an array. A predefined default value is used to improve compression and speed in cases where a single default value is often encountered. In this embodiment the size of each entry in the bitmap array is one bit. In another approach, a bitmap array having two bit entries is provided. The use of two bits allows four different entry values. Two values are used to indicate two different default values. A third value is used for a “repeat” indicator to when the last-used next-state value should be re-used. The fourth value is used to indicate indexing into a pointer table, similarly to the embodiment using single-bit entries in the bitmap array.

A method, system computer program product recorded on a computer readable medium, for fast incremental backup of a storage device includes selecting an area of the data storage device for backup; creating the bitmap of data storage device; reading the selected area of the data storage device; converting data read from the data storage device into a usable format for the comparison of descriptors; reading descriptors of logical storage units of the selected area; discarding selected data access attributes of the descriptors; generating hash values for the descriptors; comparing the hash values of the descriptors of the logical storage units of the selected area with the hash values of the descriptors of previously archived logical storage units; for physical storage units related to logical storage units of the selected area whose hash values of the descriptors are identical to the hash values of the descriptors of the archived logical storage units, checking if these physical storage units need to be backed up; updating the bitmap of data storage device; and backing up contents of the physical storage units marked in the backup. The logical storage units can be files. The descriptors can be compared on a physical storage unit basis.

Various methods and systems are provided for allocating time-frequency resources for downlink (DL) and uplink (UL) communications between base stations and mobile stations. Different forms of resource allocation messages including combinations of bitmaps and bitfields provide additional information about the resources and/or how they are assigned. In some implementations the resource allocation messages enable reduced overhead, which may ultimately improve transmission rates and/or the quality of transmissions.

A method and apparatus for transmitting a block acknowledgement (ACK) frame are provided. The method for transmitting a block ACK frame includes receiving a plurality of frames from a transmitting station, receiving a request for transmission of a compressed block ACK frame from the transmitting station, checking the reception status of the plurality of frames received, generating a compressed block ACK frame containing a run-length encoded bitmap field, and sending the compressed block ACK frame to the transmitting station.

A differential snapshot is established and maintained for a set of files stored on a volume. Copy-on-write operations are avoided for logically insignificant moves of blocks, such as the block rearrangements characteristic of defragmentation utilities. A file system passes a block copy command to lower-level drivers that are to inform the snapshotter that a block move operation is not logically meaningful. When the logically insignificant move is of a block whose data forms part of the data captured in the snapshot virtual volume, and when the move is to a block location that is functioning as logical free space, the snapshotter can simply modify its block bitmap and update translation table entries without needing to perform a copy-on-write.

A method of scheduling transmitting and receiving communication slots for co-located radio devices is provided. A Bluetooth (BT) device first synchronizes its communication time slots with a co-located radio module, and then obtains the traffic pattern of the co-located radio module. Based on the traffic pattern, the BT device selectively skips one or more TX or RX time slots to avoid data transmission or reception in certain time slots and thereby reducing interference with the co-located radio module. In addition, the BT device generates a co-located coexistence (CLC) bitmap and transmits the CLC bitmap to its peer BT device such that the peer BT device can also skip data transmission or reception in certain time slots affected by the co-located radio module. The skipped time slots are disabled for TX or RX operation to prevent interference and to achieve more energy saving.

A method, system, apparatus, and computer-readable medium are provided for taking snapshots of a storage volume. According to aspects of one method, each snapshot is represented as a unique sequence number. Every fresh write access to a volume in a new snapshot lifetime is allocated a new section in the disk, called a provision, which is labeled with the sequence number. Read-modify-write operations are performed on a sub-provision level at the granularity of a chunk. Because each provision contains chunks with valid data and chunks with invalid data, a bitmap is utilized to identify the valid and invalid chunks with each provision. Provisions corresponding to different snapshots are arranged in a linked list. Branches from the linked list can be created for storing writable snapshots. Provisions may also be deleted and rolled back by manipulating the contents of the linked lists.

A method for transmitting and receiving a codebook subset restriction bitmap is provided. The Codebook Subset Restriction (CSR) bitmap transmission method of an evolved Node B (eNB) in transmission mode 9 for communication with 8 antenna ports includes generating a CSR bitmap including bits corresponding to restricted precoding matrix indicators and rank indicators that are not allowed for reporting and transmitting the CSR bitmap to a User Equipment (UE). The CSR bitmap comprises 53 bits corresponding to a first codebook and 56 bits corresponding to a second codebook, the 53 bits corresponding to a first codebook comprise 16, 16, 4, 4, 4, 4, and 1 bits for layers 1, 2, 3, 4, 5, 6, 7, and 8, respectively, and the 56 bits corresponding to a second codebook comprise 16, 16, 16 and 8 bits for layers 1, 2, 3, and 4, respectively.

A system, method and data structure for error correction for use in the transmission of content data distribution networks uses a compressed memory, for example a bitmap, to identify portions of transmitted content data files where transmission errors have occurred. The error memory, is used to generate an error status report that is returned to a transmission controller via a low bandwidth back channel, for example the Internet. The information in multiple error status reports is aggregated by the control system of the transmitter and used to re-transmit those portions of previously transmitted content data files that were not properly received due to error. By re-transmitting only the data packets of the transmitted content data files that contain errors, overall transmission speed is increased and bandwidth usage is conserved.

Systems and methods for retransmitting unsuccessfully transmitted data across a communication link. The retransmission mechanism may be applied to point to multipoint networks including wireless networks. Each packet is encapsulated in an ARQ frame and assigned a sequence number for the purpose of coordinating acknowledgments and retransmissions. Information as to which packets require retransmission is communicated in the form of a bitmap where each bit indicates an acknowledgment status for a given packet. Any missing packets in the received sequence are assumed to require retransmission.

A method of incremental backup of a storage device includes reading descriptors of logical storage units of the storage device; comparing the descriptors of the logical storage units of the storage device with descriptors of archived logical storage units; for logical storage units of the storage device whose descriptors are not identical to the descriptors of the archived logical storage units, backing up contents of physical storage units that correspond to those logical storage units of the storage device; and, for logical storage units of the storage device whose descriptors are identical, performing a comparison step to check if these logical storage units need to be backed up. The logical storage units can be files. The comparison step can be, e.g., (1) bit-wise comparison of the logical blocks, (2) comparing control sums of the logical blocks, and (3) comparing log files relating to the logical storage units The physical storage units can be blocks. The descriptors can be, e.g., MFT entries, hash function values, timestamps, checksums, and file metadata. The descriptors can be compared on a physical storage unit basis. The method further can optionally include generating a bitmap of the physical storage units of the storage device; marking, in the bitmap, those physical storage units that correspond to logical storage units with different descriptors; and archiving content of the physical storage units marked in the bitmap. The method can further optionally include archiving logical storage units of the storage device having the same name as corresponding archived logical storage units of the storage device, but different time stamps.

A method and apparatus which provide solutions for avoiding journal overflow in after and before journal methods of a backup and recovery system used with a storage system. The after journal method solutions, which are conducted when the amount of free space reaches a threshold, include periodically taking a new snapshot and deleting the oldest journal, periodically taking a new logical snapshot and deleting the oldest journal, stopping the taking journal entries when the journal volume is full, and stopping the taking journal entries when the journal volume is full and then switching to bitmap management. The before journal method solution, which is conducted when the amount of free space reaches a threshold, includes applying wrap-around overwriting to overwrite the oldest journal entry by the newest journal entry.

A unique identifier is assigned to a network node and is used to obtain an “asset model” corresponding to the node and to determine whether the node is a member of a particular category. An asset model is a set of information about a node (e.g., the node's role within the enterprise, software installed on the node, and known vulnerabilities/weaknesses of the node). An identifier lookup module determines a node's identifier based on characteristics of the node (such as IP address, host name, network zone, and/or MAC address), which are used as keys into lookup data structures. A category lookup module determines whether a particular node is a member of (i.e., within) a particular category using a transitive closure to model the categories (properties) that can be attached to an asset model. A transitive closure for a particular asset category is stored as a bitmap, similar to bitmap indexing.

The invention discloses a name routing fast matching search method and device. The device mainly comprises a tree-bitmap and a Blond filter. The tree-bitmap is used for storing the first m layers of name routing, and performing fast longest prefix matching on the first m layers of request content name reaching a router; the Blond filter is used for storing the rest of the prefix of the name routing, and performing longest prefix matching on the rest of the request content name reaching the router. According to the different prefix length of the name routing to be updated, the tree-bitmap and the Blond filter can be updated respectively or simultaneously by the method. According to the invention, the characteristics of fast searching, little required storing of the tree-bitmap and the characteristics of high time efficiency and spatial efficiency are utilized, the routing addressing problem based on the content name in the novel network system is solved, and the requirements of little occupied memory, fast matching speed and fast updating speed of the future network routing are met.

In an aggregated file system, a file may begin with a set of stripe fragments all in the RAID-5 scheme in order to take advantage of the RAID-5 scheme's storage efficiency. After that, when one of the fragments is accessed by a file switch, it will be duplicated into the data mirroring scheme. The file's corresponding metadata server maintains a data structure, e.g., a bitmap, indicating which fragments have been duplicated into the data mirroring scheme. In other words, the file, at this moment, exists in a hybrid scheme. A file consolidator running on the metadata server is triggered at a predefined time to copy the fragments from the data mirroring scheme back to the RAID-5 scheme, This file consolidator also updates the bitmap to reflect the changes to the file's scheme change. This hybrid scheme is expected to increase the I/O capacity of the conventional RAID-5 scheme and the storage usage of the conventional mirroring scheme.