65results about How to "Less storage" patented technology

An efficient method for compressing sampled analog signals in real time, without loss, or at a user-specified rate or distortion level, is described. The present invention is particularly effective for compressing and decompressing high-speed, bandlimited analog signals that are not appropriately or effectively compressed by prior art speech, audio, image, and video compression algorithms due to various limitations of such prior art compression solutions. The present invention's preprocessor apparatus measures one or more signal parameters and, under program control, appropriately modifies the preprocessor input signal to create one or more preprocessor output signals that are more effectively compressed by a follow-on compressor. In many instances, the follow-on compressor operates most effectively when its input signal is at baseband. The compressor creates a stream of compressed data tokens and compression control parameters that represent the original sampled input signal using fewer bits. The decompression subsystem uses a decompressor to decompress the stream of compressed data tokens and compression control parameters. After decompression, the decompressor output signal is processed by a post-processor, which reverses the operations of the preprocessor during compression, generating a postprocessed signal that exactly matches (during lossless compression) or approximates (during lossy compression) the original sampled input signal. Parallel processing implementations of both the compression and decompression subsystems are described that can operate at higher sampling rates when compared to the sampling rates of a single compression or decompression subsystem. In addition to providing the benefits of real-time compression and decompression to a new, general class of sampled data users who previously could not obtain benefits from compression, the present invention also enhances the performance of test and measurement equipment (oscilloscopes, signal generators, spectrum analyzers, logic analyzers, etc.), busses and networks carrying sampled data, and data converters (A/D and D/A converters).

A method and apparatus providing for the construction of customized advertisement banners for Web pages on a client computer. The advertisement banners are customized based upon various factors including user profile information, technographic information, geographic information, demographic information and user interaction information. The information being either stored on the user's computer, server computers or obtained from the user's interaction with the Web page containing the advertisement banner. Once specific information is obtained, customized advertisement content is selected from Web server computers and the advertisement banner is dynamically constructed and displayed on the user's computer.

Remote office deduplication comprises calculating one or more fingerprints of one or more data blocks, sending the one or more fingerprints to one or more backup servers via a network interface, receiving from the one or more backup servers an indication of which one or more data blocks corresponding to the one or more fingerprints should be sent to the one or more backup servers, and if the indication indicates one or more data blocks to be sent to the one or more backup servers, sending the one or more data blocks to the one or more backup servers via the network interface.

An enhancement that reduces the digital interface rate of analog-to-digital (A/D) and digital-to-analog (D/A) converters through the use of compression and decompression is described. Improved A/D converters compressing a sampled version of an A/D converter's analog input signal in real time, thereby significantly decreasing the required bit rate of the A/D converter's digital interface. Similarly, improved D/A converters decrease the required bit rate of the D/A converter's digital interface. D/A converters include a decompressor that decompresses the D/A converter's compressed digital input in real time, prior to conversion to an analog output signal.

A computer network discovery system may involve a computing system and a database disposed within a remote network management platform, and a proxy server application disposed within an enterprise network. The computing system may be configured to: transmit first instructions causing the proxy server application to obtain configuration and operational information for virtual machines; store the configuration and operational information for the virtual machines in a first set of tables of the database; transmit second instructions causing the server device to obtain configuration and operational information for services; and store the configuration and operational information for the services in a second set of tables of the database, where the first set and the second set of tables have tables in common that store at least part of the configuration and operational information for the virtual machines and the services.

An architecture and method for data storage and retrieval which also addresses a number of key problems associated with systems employing hash-based techniques. The architecture and method employs a collision-free hashing scheme called Bloomier filter while eliminates its false positives in a storage efficient way. Wildcard support is added through the use of a scheme called prefix collapsing, while introducing only a small additional storage requirement and reduced hardware complexity. Real update traces indicate that both fast and incremental updates are provided—features generally not available in prior-art collision-free hashing schemes.

A system and method for segmenting, distributing and replacing streaming multimedia clips in a network system including at least one origin server connected to a plurality of streaming caches via an interactive distribution network, such as the Internet. The at least one origin server stores a plurality of streaming multimedia clips in an associated memory and segments the clips into a plurality of data segment of exponentially increasing size; the origin server then distributes the plurality of data segments to the plurality of streaming caches where each streaming cache decides whether to store or discard each segment in accordance with a predefined probability. Another aspect of the invention involves replacing stored data segments at each of the plurality of streaming caches as needed. In one embodiment, a hotness rating is computed for each streaming multimedia clip stored in an SC. Clips are replaced as needed based on their hotness rating relative to other clips. In a second embodiment, a potential function is computed for each segment stored in an SC. Segments are replaced as needed based on their potential function value relative to other stored segments.

A method for pre-processing point clouds comprising large amounts of point data. The method comprises converting the points' coordinates to Morton indices, sorting the Morton indices and sequentially determining intervals based on predefined criteria, which intervals define the leaf nodes and form the basis and starting point for the generation of a tree index structure comprising the leaf nodes, nodes, branches and nodes connecting the branches. Point data contained within a node or sub-trees of a node are quantizable.

A method for achieving fast and efficient measurement of path capacity of a communication network. The method includes the following steps: (a) transmitting a number of probes from a local endpoint to a remote endpoint over a network path and each probe contains at least two outgoing packets and each probe can elicit at least two response packets from the remote endpoint; (b) determining a first minDelay by measuring RTT between the time sending the first probe packet and the time receiving the first response packet; (c) determining a second minDelay by measuring RTT between the time sending the second probe packet and the time receiving the second response packet; and (d) determining a minimum delay difference by subtracting said first minDelay from said second minDelay. The minimum delay difference divided by packet size can be used as a measurement of the network path capacity.

A method of computing an estimated queuing delay is described that uses both historical queue delay data in the form of multiple calendar-based queue delay profiles and real-time data in the form of field-reports from service objects of actual queue delay. A decision selects either the source data from queue delay profiles or a real-time report. A clustering algorithm is used to assign potentially widely disparate geographic locations to clusters and to assign service type records to a cluster. Calendar-based queue delay profiles may be associated at the cluster level, at the service-type level, and at the individual service point level. Service objects may request an estimated queue delay; service objects may be provided with a estimated queue delay for a specified service point and also delays for alternative service points. Such requests may be prior to selecting or moving to a particular service queue.

A client machine writes to and reads from a virtual disk on a remote storage platform using a storage protocol. Metadata is generated and is stored in replicas on different metadata nodes of the storage platform. A modified log-structured merge tree is used to store and compact string-sorted tables of metadata. During file storage and compaction, a consistent file identification scheme is used across all metadata nodes. A fingerprint file is calculated for each SST file on disk that includes hash values corresponding to regions of the SST file. To synchronize, the fingerprint files of two SST files are compared, and if any hash values are missing from a fingerprint file then the key-value-timestamp triples corresponding to these missing hash values are sent to the SST file that is missing them in the SST file is compacted with the missing triples to create a new version of the SST file. The other fingerprint file is then analyzed the same way.

A packaging arrangement (100, 200) for storing at least one component (105, 205), comprising at least one tray (101, 102, 103, 104, 203, 204) being adapted to hold and set the component and to provide individual mechanical protection for at least parts of the component.

A system and method for managing shared resources is disclosed. The system includes a primary coherency processing unit which processes lock requests from a plurality of data processing hosts, the primary coherency processing unit also storing a first current lock state information for the plurality of data processing hosts, the first current lock state information including a plurality of locks held by the plurality of data processing hosts. The system further includes a standby coherency processing unit storing fewer locks than the primary coherency processing unit, the locks stored by the standby coherency processing unit being a subset of locks included in the first current lock state information, the standby coherency unit configured to perform a plurality of activities of the primary coherency processing unit using the subset of locks in response to a failure of the primary coherency processing unit.

The invention provides a method for correcting image barrel distortion. The method comprises the steps of forming a lookup table according to relations of an ideal coordinate of pixels prior to image distortion and a distortion factor, calculating distances R<x> and R<y> of the ideal coordinates (x, y) on an x direction and a y direction relative to an original point, enabling a central point coordinate (xc, yc) (x, y) of an image be set to be the original point, and obtaining the equations that R<x>=xc-x and R<y>=yc-y; calculating a K value, calculating a distortion factor S, and obtaining the ideal coordinate corresponding to a distortion coordinate according to relations between the distortion coordinate and the ideal coordinate; endowing a pixel value of the distortion coordinate to the ideal coordinate, and forming a corrected image according to the ideal coordinate and the pixel value of the distortion coordinate. The invention further provides a device for correcting image barrel distortion and an image processing device. According to the method and device for correcting image barrel distortion and the image processing device, operation quantity can be reduced, barrel correction is achieved rapidly and effectively, a memory which is low in cost can be used, and the cost is reduced.

A Wearable Cardioverter Defibrillator (WCD) system has a processor that performs two different analyses to an ECG of the patient. A first-level analysis can be computationally economical, while a fuller second-level analysis can give shock/no-shock advice with more certainty. In some of these embodiments the second-level analysis of the ECG is performed only if the first-level analysis of the ECG detects a possible shockable condition. As such, the first-level analysis may operate as a gatekeeping function, often preventing the more computationally intensive second-level analysis from being performed. An advantage can be that the WCD system needs to store less charge, for powering the processor. In turn, this permits portions of the WCD system to be less bulky and weigh less.

A combined nutcracker and bottle opener, including an element usable for holding and cracking the hard outer shell of a nut and also for holding and twisting a cap from a bottle, and an element for prying a cap from a bottle, which can have an outer shape resembling the lower torso and legs of a human body.

A method of producing a benchmark application for testing input/output—I/O—settings of a computer application, the method comprising: compiling trace data relating to operations to be executed by the computer application; grouping the trace data into one or more phases, based on different stages in the execution of the computer application to which the operations relate; identifying patterns in the trace data and comparing the patterns; producing simplified trace data in which trace data having similar patterns are combined; and outputting a benchmark application which includes the simplified trace data and information indicating where the trace data have been combined.

A methods for storing a searchable set of keywords includes concatenating the keywords to form a string, and defining one or more links between two or more characters in the string. A delimiting character separates the keywords in the string, and the links are pointers. Any inaccessible characters in the string are removed to improve the storage cost the method.

An object of the present invention is to provide a thin film transistor having a gate insulating film for suppressing a shift amount of a threshold voltage generated by use under a high temperature environment. In a thin film transistor having a channel layer made of microcrystalline silicon, a gate insulating film 140 is a film obtained by laminating a first silicon nitride film 141 having a nitrogen concentration of 6×10²¹ atoms/cc or less and a second silicon nitride film 142 having a nitrogen concentration higher than 6×10²¹ atoms/cc. Therefore, the second silicon nitride film 142 increases the blocking effect against mobile ions entering from a glass substrate 20 to make the mobile ions less likely to be stored in an interface with a channel layer 50. The first silicon nitride film 141 increases the dielectric breakdown voltage of the gate insulating film 140.

A nuclear fuel pellet with a porous substrate, such as a carbon or tungsten aerogel, on which at least one layer of a fuel containing material is deposited via atomic layer deposition, and wherein the layer deposition is controlled to prevent agglomeration of defects. Further, a method of fabricating a nuclear fuel pellet, wherein the method features the steps of selecting a porous substrate, depositing at least one layer of a fuel containing material, and terminating the deposition when the desired porosity is achieved. Also provided is a nuclear reactor fuel cladding made of a porous substrate, such as silicon carbide aerogel or silicon carbide cloth, upon which layers of silicon carbide are deposited.

The present invention introduces a specific form of parity protection chunk (PPC) that allows for distributed creation of coordinated PPCs that can reliably provide protection against the concurrent loss of two or more storage servers of devices. Coordinated PPCs can protect against the concurrent loss of multiple lost chunks by ensuring that the PPCSs protecting any specific chunk have at most a single overlapping failure domain. This is done without requiring full centralized control over the assignment of protected chunks to specific PPCs. The PPCs are created as part of the put transaction for a chunk. The chunk itself is stored as a whole replica, and the PPCs provide parity protection for the chunk.