478 results about "Sequential data" patented technology

A table, such as a database table can be partitioned into blocks that are conveniently sized for storage and retrieval. The amount of storage space required and the speed of storing and retrieving blocks is proportional to the size of the blocks. Compressing the blocks leads to less required space and more speed. The columns in a table, and therefore the rows in a transposed block, tend to contain similar data. Compression algorithms can work more efficiently when sequential data items are similar. Therefore, transposing the blocks before compression or compressing them in a column-wise manner leads to better compression. Different compression algorithms can be used for each set of columnar data to yield even better compression.

A method and system for monitoring and analyzing compliance with an internal dosing regimen prescribed to be taken in multiple dose forms includes the steps of detecting internalization of a first dose form to generate a first data point, detecting internalization of a second dose form to generate a second data point, and analyzing the first data point and the second data point. The step of analyzing the first and second data points generates a metric of a variety of possible metric types. The first and second dose forms may be two of any plural number of sequentially-internalized dose forms which generate a like number of sequential data points. Subsequent internalizations of dose forms result in at least a like number of data points being generated. To effect the disclosed method a system is provided which includes at least two dose forms, a time stamp identifier operatively associated with each dose form, a receiving device for receiving the time stamp identifier data, and an analyzer for analyzing the received data,

A method and system for performing data analysis where multiple, categorical dimensions and statistical measures are used. The method includes preparing multi-dimensional data into nodes and arranging them logically in the form of a partial-order database. The database may then be traversed by a data-mining tool, or queried in an OLAP manner. Queries are answered through a process of associative partial-order search, which includes optional support for “children-of” requests, and optional support for fuzzy pattern-matching. By aggregating measures on-the-fly, this method is able to preform well without requiring a large number of summary nodes, when taken as a percentage of the total node count.

A disk drive is disclosed which links disk commands that access near sequential data sectors. The linked and non-linked disk commands are inserted into an input / output queue and selected for execution according to a rotational position optimization (RPO) algorithm. If an error occurs while executing a linked disk command, the disk commands are unlinked and at least one of the unlinked disk commands is executed. The residual unlinked disk commands are inserted back into the input / output queue for later execution in an order determined by the RPO algorithm.

A multi-head disk drive is disclosed comprising a plurality of disk surfaces, and a head assembly comprising a plurality of heads, wherein each disk surface comprises a plurality of data zones, and each data zone having a data transfer rate different from the other zones of the respective disk surface. A controller is operable to sequentially write a sequence of data blocks to the plurality of disk surfaces in accordance with a list of head-zone combinations, each head-zone combination corresponding to one of the heads and one of the data zones of the respective disk surface. The head-zone combinations in the list are ordered from highest data transfer rate to lowest data transfer rate, and each disk surface comprises a pivot point defining a direction of writing data in the data zones from one of an outer diameter toward a middle diameter and an inner diameter toward the middle diameter.

Systems and methods for writing a sequence of data to a disk drive using sorted data zones are provided. In one embodiment, a multi-head disk drive comprises a plurality of disk surfaces, wherein each disk surface comprises a plurality of data zones, each data zone having a data transfer rate different from the other zones of the respective disk surface. The multi-head disk drive also comprises a head assembly comprising a plurality of heads, wherein each head is configured to write data to a respective one of the disk surfaces, and a controller configured to operate the plurality of heads to sequentially write a sequence of data blocks to the plurality of disk surfaces in accordance with a list of head-zone combinations ordered from highest data rate to lowest data rate, each head-zone combination corresponding to one of the heads and a data zone of the respective disk surface.

The present invention is based on the encoding of sequential data or sequences in a novel manner that permits efficient storage and processing of sequential data, as well as methods for searching sequences or databases of sequences. The methods and systems of the current invention may be adapted broadly to various fields of application and to a variety of sequences types. For example, the current invention has broad application including to the fields of bioinformatics, molecular biology, pharmacogenomics, phonetic sequences, lexicographic sequences, signal analysis, game playing, law enforcement, biometrics, medical diagnosis, equipment maintenance and micro-array data analysis.

The invention is a system designed for acquisition of seismic data by means of acquisition stations set on water bottom of a water body. The system comprises acquisition stations (DSAU) combining a streamlined boom suited to penetrate the bottom and thus couple seismic receivers with the underlying formation, a sealed body for electronic data acquisition and communication modules. These acquisition stations (DSAU) are placed in the water and drop to the bottom under the effect of gravity. Relay buoys (RCB) are positioned at the surface, each with a GPS positioning module, a radio link with a central station (CCRU), on a ship for example, and modules providing acoustic communication with bottom acquisition stations (DSAU), which are used to determine the position of the stations in relation to the relay buoys and to exchange control data and seismic data (good running order data or possibly seismic traces acquired if the conditions lend themselves thereto) to provide seismic prospecting or monitoring of an underground formation.

A performance monitoring system, comprising: a server; a storage system; and a management server, the management server the management server is configured to: obtain the gathered time-sequential data from the server; judge whether at least one bottleneck has occurred in the logical resource of a specified one of the plurality of virtual machines at each time of the obtained time-sequential data, judge whether at least one bottleneck causing large influence on the specified one of the plurality of virtual machines has occurred; and notify that at least one large bottleneck has occurred in the specified one of the plurality of virtual machines.

Data deduplication compression in a streaming storage application, is provided. The disclosed deduplication process provides a deduplication archive that enables storage of the archive to, and extraction from, a streaming storage medium. One implementation involves compressing fully sequential data stored in a data repository to a sequential streaming storage, by: splitting fully sequential data into data blocks; hashing content of each data block and comparing each hash to an in-memory lookup table for a match, the in-memory lookup table storing all hashes that have been encountered during the compression of the fully sequential data; for each data block without a hash match, adding the data block as a new data block for compression of fully sequential data; and encoding duplicate data blocks using the in-memory lookup table into data segments.

A method to transmit data using a device having a plurality of physical input / output (I / O) interfaces is provided. The method comprises receiving data and determining a topology according to which data is to be transmitted. Data is transmitted in sequential order via a single physical interface for a first topology and in random order via a plurality of physical interfaces for a second topology.A System On Chip (SOC) unit enabled to transmit data via one or more physical interfaces is provided. The SOC comprises a processor and a network interface including multiple physical input / output (I / O) interfaces coupled to the processor. In response to receiving data for transmission, the processor is enabled to select a single I / O interface for sequential data transmission according to a first topology or select multiple physical I / O interfaces for random order data transmission according to a second topology.

A cache-based storage architecture has primary and secondary storage subsystems that are controlled by first and second data layout engines to provide a high-performance storage system. The primary storage subsystem illustratively comprises non-volatile electronic storage media configured as a cache, while the secondary storage subsystem comprises magnetic storage media configured as a disk array. The data layout engines illustratively implement data layout techniques that improve read and write performance to the primary and secondary storage subsystems. To that end, the data layout engines cooperate to optimize the use of the non-volatile cache as a primary storage stage that efficiently serves random data access operations prior to substantially transposing them into sequential data access operations for permanent (or archival) storage on the disk array.

The technique of the invention enables the user to readily refer to the details of efficient image processing performed on input image data. On completion of each selected image processing option performed on input image data Dpi, the details of an efficient series of image processing operations sequentially performed for conversion of the input image data Dpi to final retouched image data are updated by taking into account latest settings of relevant parameters of the selected image processing option. The updated details are stored in the form of a work memo file FL2. The work memo file FL2 includes data DT11 ‘execution order’, data DT12 ‘retouching option’, and data DT13 ‘parameters’. The concrete procedure of the invention for ‘efficiency’ updates the parameters of each image processing option to be performed multiple times to the latest settings, while maintaining the user's specified work sequence of the respective image processing options.

A method and apparatus associated with transferring data from a remote device to a recipient device having a first memory space and a second memory space. The method includes issuing a transfer command from the remote device to request transferring a set of data to the second memory space; temporarily storing the set of data in the first memory space pending a transfer to the second memory space; and appending the set of data to other sequential data in the first memory to obtain a transfer data block of a predetermined size for transfer to the second memory space. A corresponding apparatus is provided comprising circuitry configured to buffer write commands by characterizing each write command as being either a sequential write or a random write, and responsively appending data associated with sequential write commands in order to obtain a transfer block of a predetermined size.

The present invention provides a fast and efficient way of processing structured data by utilizing an intermediate file to store the structural information. The structured data may be processed into a Binary mask Format (BMF) file which may serve as a starting point for post-processing. A tree structure built on top of the BMF file may be constructed very quickly, and also takes up less space than a DOM tree. Additionally, BMF records may reside entirely in the memory and contain structural information, allowing SAX-like sequential data access.

A method of quantifying similarities between sequential data streams typically includes providing a pair of sequential data streams, designing a Hidden Markov Model (HMM) of at least a portion of each stream; and computing a quantitative measure of similarity between the streams using the HMMs. For a plurality of sequential data streams, a matrix of quantitative measures of similarity may be created. A spectral analysis may be performed on the matrix of quantitative measure of similarity matrix to define a multi-dimensional diffusion space, and the plurality of sequential data streams may be graphically represented and / or sorted according to the similarities therebetween. In addition, semi-supervised and active learning algorithms may be utilized to learn a user's preferences for data streams and recommend additional data streams that are similar to those preferred by the user. Multi-task learning algorithms may also be applied.

The invention generally relates to systems and methods for eye detection for use in, for example, installations and systems for tracking eyes and gaze angle / directions. The system includes a plurality of eye detection units connected to an image sensor. The eye detection units are adapted to receive regions of picture elements of a digital image frame substantially in parallel and wherein the eye detection units are adapted to operate substantially in parallel, each eye detection unit being adapted to receive a specified region of the picture elements of at least one digital image frame and including an eye feature extraction module adapted to perform a eye feature extraction process on the received picture elements to identify predetermined eye features. An eye data generating module is adapted to receive information of potential identified eye features including picture element coordinates for the identified eye features, and the received region of picture elements, and generate eye data based on the information of potential eye features, wherein the eye data is generated if identified eye features fulfil predetermined conditions, and transfer generated eye data and the received regions of picture elements to a processing module, and wherein a data flow of the eye data and the region of picture elements of a digital image frame is substantially parallel.

A method for displaying graphical objects is provided. In one embodiment, the method includes accessing a data structure including a plurality of sequential data objects and the location of associated graphical data stored in a non-volatile storage device. Further, the method may include rendering a first graphical object associated with a first data object of the data structure in a viewport of a device, including loading the graphical data for the first data object from the non-volatile storage into an active memory. The method may also include rendering a second graphical object in the viewport based on the location of the second data object with respect to the first data object within the data structure. In one embodiment, graphical data for data objects is loaded into the active memory on an as-needed basis. Various devices, machine-readable media, and other methods for displaying graphical objects are also provided.

In a clinical and physiological abnormality monitoring apparatus, and blood pressure monitoring apparatus detects a blood pressure abnormality and the like of a body by employing a pulse wave signal. A frequency analysis is carried out with respect to a pulse wave signal, while this pulse wave signal corresponds to time sequential data of pulse waves. As a result, both a C-frequency component indicative of a fluctuation component of a base line of the pulse wave signal, and also an A-frequency component representative of the respective pulse waves are acquired. A ratio C / A of power of a peak contained in the C-frequency component with respect to power of a peak contained in the A-frequency component is calculated to determine abnormality of the blood pressure.

In one embodiment, a method includes receiving, at a local node of a network, a sequenced data packet of a flow made up of multiple sequenced data packets from a source node directed toward a destination node. The flow is to be parsed by the local node to describe the flow for administration of the network. Based on sequence data in the sequenced data packet, it is determined whether the sequenced data packet is out of order in the flow. If it is determined that the sequenced data packet is out of order, then the sequenced data packet is forwarded toward the destination node before parsing the sequenced data packet. The out of order sequenced data packet is also stored for subsequent parsing at the local node.

A method and apparatus are disclosed that store sequential data units of a data packet received at an input port in contiguous banks of a buffer in a shared memory. Buffer memory utilization can be improved by storing multiple packets in a single buffer. For each buffer, a buffer usage count is stored that indicates the sum (over all packets represented in the buffer) of the number of output ports toward which each of the packets is destined. The buffer usage count provides a mechanism for determining when a buffer is free. The buffer usage count can also indicate a number of destination ports for a packet to perform a multicasting operation. Buffers can comprise one or more groups and each of the groups can comprise a plurality of banks.

A cache controller and a method is provided. The cache controller comprises: request reception logic operable to receive a write request from a data processing apparatus to write a data item to memory; and cache access logic operable to determine whether a caching policy associated with the write request is write allocate, whether the write request would cause a cache miss to occur, whether the write request is one of a number of write requests which together would cause greater than a predetermined number of sequential data items to be allocated in the cache and, if so, the cache access logic is further operable to override the caching policy associated with the write request to non-write allocate. In this way, in the event that the number of consecutive data items to be allocated within the cache exceeds the predefined number then the cache access logic will consider that it is highly likely that the write requests are associated with a block transfer operation and, accordingly, will override the write allocate caching policy. Accordingly, the write request will proceed but without the write allocate caching policy being applied. Hence, the pollution of the cache with these sequential data items is reduced.

A method for payload-based channel estimation of a wireless channel begins by receiving a frame via the wireless communication channel. The frame includes a training sequence, a frame information section, and a plurality of time sequential data payload sections. As the frame is being received, the method continues by determining a channel estimation based on the training sequence. The method continues as the frame is being received by determining a channel estimation of a data payload section of the plurality of time sequential data payload sections to produce a payload channel estimation. The method continues as the frame is being received by updating the channel estimation based on the payload channel estimation to produce an updated channel estimation.

A method of displaying linearly ranked data items that involves fixed patterns and user-responsive visual prominence to improve user consideration of those results. Ranked Data Items can be generated dynamically via a search engine or be a historical record of collected Data Items over time and ranked by the user. The plotting of the Ranked Data Items on the non-linear results space can be shared with other networked users.

A method for optimally maintaining the execution of a first application, wherein the first application is further configured to received a set of sequential data elements from a second application, and the set of sequential data elements further includes a first data element and a second data element. The method includes establishing a connection between the first application and the second application. The method further includes transmitting a request to send the set of sequential data elements; receiving the first data element from the second application; and determining if the connection is still active. If not, the method also includes reestablishing the connection; transmitting a request to the second application to resend the first data element; receiving the first data element; and, if necessary, receiving the second data element.

A tone detector and associated method for use with EVRC-B and GSM vocoders to enable reliable detection of system connect tones over a wireless communication system. The tone detection method examines a number of sequential data frames of the signal received from the vocoder and determines that the tone is present if the spectral energy at frequencies around the tone is much higher than that at neighboring frequencies and if the calculated center frequency of the data frames is at or near the frequency of the tone.

Provided are a method, system, and article of manufacture for managing write requests to data sets in a primary volume subject to being copied to a secondary volume. Information indicating data sets to copy from a primary storage to a secondary storage is generated. A write request is received to write data to a target data set indicated in the information to copy from the primary storage to the secondary storage. A determination is made as to whether the write request is part of a sequential write access. The target data set and sequential data sets following the target data set are copied from the primary storage to the secondary storage. The write request to write the data to the primary storage is executed in response to receiving acknowledgment that the target data set was copied to the secondary storage.

A digital data system comprises a plurality of links for passing messages between nodes, which may be end points such as memory or processing units, or intermediate or branch points such as routers or other devices in the system. A link level flow control is implemented by control symbols passed between adjacent nodes on a link to efficiently regulate message burden on the link. The control symbols may be embedded within in a message packet to quickly effect control on a link—such as reducing data flow, requesting retransmission of corrupted data, or other intervention—without disruption of the ongoing packet reception. A control symbol may be recognized within the packet by a flag bit, a marker such as a transition in a signal, or a combination of characteristics. The control symbol may be a short word, having a control action identifier code at defined bit positions to indicate the desired link-level control function. A node receiving the control symbol implements the designated control action while maintaining packet order data (such a bit positions and byte counts), and applying message housekeeping processing (such as error checking) as though the control symbol were absent. The control symbol is thus embedded in a manner such that a receiving node need not receive a complete message, or even a complete packet, before acting on the control symbol. The beginning and end of the interrupted packet, meanwhile, are handled as a single message packet, and are processed by the receiving node in properly-aligned bit positions, allowing message flow to continue along the link without interruption. Thus, retransmission of the affected packet or message is not required. The result is that control operations dictated by the embedded control symbol are effected immediately and without slowing down communications.