Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.
457 results about "Data dependent" patented technology
Filter
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
Data Dependent Acquisition (DDA) is the standard method for running LC-MS/MS experiments. Here, we present a quick overview of the DDA method, as well as of the less common Data Independent methods (DIA). In LC-MS/MS, purified peptides are separated on an online chromatography gradient (usually low pH Reverse Phase)...
A communication system comprising at least one mobile handheld telephone handset adapted to communicate via a wirelesstelephony medium with a telephone networkhandling system. The handset comprises input devices to receive input from a user and produce signals dependent thereupon, an onboard processor to adapt speech input to produce a voice transmission signal as part of a telephone conversation with a third party; and an antenna to transmit the voice transmission signal via the wirelesstelephony medium. The telephone networkhandling system comprises a receiver to receive the voice transmission signal, and means to forward the voice signal to a third party. The handset further comprises a first processor to carry out a first processing step on selected input signals and produce data dependent thereupon which preserves predetermined information necessary to carry out a remote second processing step, an onboard processor to adapt the data according to a conventional wirelesstelephony protocol to produce a transmission signal, and an antenna to transmit the transmission signal via the wireless telephony medium to the telephone networkhandling system. The system further comprises a remote processor adapted to receive and adapt the transmission signal from the telephone network handling system to regenerate the data, and to carry out a second processing step on the data and produce an output dependent thereupon.
A multi-ring memory controller sends request packets to multiple rings of serial flash-memory chips. Each of the multiple rings has serial flash-memory chips with serial links in a uni-directional ring. Each serial flash-memory chip has a bypassing transceiver with a device ID checker that bypasses serial packets to a clock re-synchronizer and bypass logic for retransmission to the next device in the ring, or extracts the serial packet to the local device when an ID match occurs. Serial packets pass through all devices in the ring during one round-trip transaction from the controller. The average latency of one round is constant for all devices on the ring, reducing data-dependent performance, since the same packet latency occurs regardless of the data location on the ring. The serial links can be a Peripheral Component Interconnect (PCI) Express bus. Packets have modified-PCI-Express headers that define the packet type and data-payload length.
A novel and useful apparatus for and method of spur reduction using computation spreading with dithering in a digital phase locked loop (DPLL) architecture. A software based PLL incorporates a reconfigurable calculation unit (RCU) that is optimized and programmed to sequentially perform all the atomic operations of a PLL or any other desired task in a time sharing manner. An application specific instruction-set processor (ASIP) incorporating the RCU is adapted to spread the computation of the atomic operations out over a PLL reference clock period wherein each computation is performed at a much higher processor clock frequency than the PLL reference clock rate. This significantly reduces the per cycle current transient generated by the computations. The frequency content of the current transients is at the higher processor clock frequency which results in a significant reduction in spurs within sensitive portions of the output spectrum. Further reduction in spurs is achieved by dithering the duration of the software loop of atomic operations and / or by randomly shuffling one or more non-data dependent instructions within each iteration of the software loop.
We describe a system to optimize performance of a mobile phone network towards a performance goal. The system receives performance data comprising aggregated data for a plurality of calls and commissions measurement data comprising data logged for a plurality of mobile phones, and outputs data for changing a configuration of said network. The system includes a performance monitoring system; a measurement data request system, wherein measurement data is selectively commissioned in response said performance mismatch; a measurement data analysis system to analyze the commissioned measurement data to determine a probable cause of said mismatch, and to provide analysis data identifying the probable cause; and an action determination system to receive said analysis data and to output action data dependent on the analysis data, the action data identifying one or more configuration changes to be made to the mobile phone network to reduce the mismatch.
A clientprogramming model with abstraction hides from an underlying client application or application program interface (API) the details of where each element of data is located, and which copy of the data is resident on an available server and associated databases. The model wraps a database, such as a virtual database, and provides data-dependent and application-dependent routing, failover, and operational administration.
An encoder reorders quantized wavelet coefficients to cluster large and small wavelet coefficients into separate groups without requiring the use of data-dependent data structures. The coefficients are then adaptively encoded based on a run-length code which continuously modifies a parameter that controls the codewords uses to represent strings of quantized coefficients, seeking to minimize the number of bits spent in the codewords. A matrix of indices contains the coarsest coefficients in the upper left corner, and filling in low high and high low sub bands in larger and larger blocks in an alternating manner, such that low high sub bands comprise the top of the matrix and the high low sub bands comprise the left side of the matrix. The shortest codewords are assigned to represent a run of the most likely character having length of 2k, where k is a parameter. k is adjusted based on successive characters being encountered. k is increased when the character is the same, and decreased when the character is different. A decoder applies the above in reverse order. Decoding of the encoded coefficients is first performed, followed by an unshuffling of the coefficients. The unshuffled coefficients are then subjected to an inverse wavelet transform to recover the transformed and compressed data, such as image pixels.
The invention comprises a personal data sharingsystem comprising an aggregator for aggregating data from a plurality of disparate sources and for categorising said aggregated data into discrete groups of data, a platform configured to enable the assignment of an access permission level for each one of said discrete groups of data by allowing the user to configure said access permission level or by automatically assigning said access permission level from a number of pre-determined access permission levels; said platform being further configured to permit access to a discrete group of data dependent upon said access permission level. The invention also comprises a method of sharing personal data comprising the steps of aggregating data from a plurality of disparate sources and categorising said aggregated data into discrete groups of data, assigning an access permission level for each one of said discrete groups of data by allowing the user to configure said access permission level or by automatically assigning said access permission level from a number of pre-determined access permission levels; and permitting access to a discrete group of data dependent upon said access permission level.
A method for unsupervised anomaly detection, which are algorithms that are designed to process unlabeled data. Data elements are mapped to a feature space which is typically a vector space . Anomalies are detected by determining which points lies in sparse regions of the feature space. Two feature maps are used for mapping data elements to a feature apace. A first map is a data-dependent normalization feature map which we apply to network connections. A second feature map is a spectrum kernel which we apply to system call traces.
A memory, system, and method for providing security for data stored within a memory and arranged within a plurality of memory regions. The method includes receiving an address within a selected memory region and using the address to access an encryption indicator. The encryption indicator indicates whether data stored in the selected memory page are encrypted. The method also includes receiving a block of data from the selected memory region and the encryption indicator and decrypting the block of data dependent upon the encryption indicator.
A processor is connected to a storage device storing an incoming e-mail, a dependency database, and code for a calendar application. The dependency database can be built from an e-mail corpus containing a plurality of natural language e-mails containing scheduling information. The incoming e-mail is parsed by the processor to build a dependency tree containing word pairs from the e-mail that are found in the dependency tree. The word pairs are stored as dependency pairs in a tree structure in the dependency tree. A probability sum for the dependency tree is calculated to determine if the e-mail contains scheduling information. If the probability sum exceeds a predetermined value, the e-mail is assumed to contain scheduling information and the scheduling information is extracted from the dependency tree and exported to the calendar application.
The invention belongs to the field of cloud computing application, and relates to method for task rely relation description, decoupling, parallel scheduling and the like in cloud service. Rely task relations are provided, and a decoupling parallel scheduling method of rely tasks are constructed. The method comprises first decoupling the task rely relations with incoming degree being zero to construct a set of ready tasks and dynamically describing tasks capable of being scheduled parallelly at a moment; then scheduling the set of the ready tasks in distribution type and multi-target mode according to real time resource access so as to effectively improve schedule parallelism; and during the distribution of the tasks, further considering task execution and expenditure of communication (E / C) between the tasks to determine whether task copy is used to replace rely data transmission so as to reduce the expenditure of communication. The whole scheduling method can schedule a plurality of tasks in the set of the ready tasks in dynamic parallel mode, well considers performance indexes including real time performance, parallelism, expenditure of communication, loading balance performance and the like, and effectively improves integral performance of the system through the dynamic scheduling strategy.
A data dependent scrambler for a communications channel that receives a user data sequence including X bits that are organized as N M-bit symbols includes a seed finder that generates a scrambling seed that is dependent upon the symbols in the user data sequence. A first scrambler receives the user data sequence from the data buffer and the scrambling seed from the seed finder and generates the scrambled user data sequence. An H-code finder generates at least one of an H-code token that is dependent upon the symbols in the user data sequence and an offset of the H-code token from the scrambling seed. An H-code encoder receives the scrambled user data sequence and at least one of the H-code token and the offset. The H-code encoder increases a Hamming weight of the scrambled user data sequence using the at least one of the H-code token and the offset.
A method for unsupervised anomaly detection, which are algorithms that are designed to process unlabeled data. Data elements are mapped to a feature space which is typically a vector space d. Anomalies are detected by determining which points lies in sparse regions of the feature space. Two feature maps are used for mapping data elements to a feature apace. A first map is a data-dependent normalization feature map which we apply to network connections. A second feature map is a spectrum kernel which we apply to system call traces.
A multi-ring memory controller sends request packets to multiple rings of serial flash-memory chips. Each of the multiple rings has serial flash-memory chips with serial links in a uni-directional ring. Each serial flash-memory chip has a bypassing transceiver with a device ID checker that bypasses serial packets to a clock re-synchronizer and bypass logic for retransmission to the next device in the ring, or extracts the serial packet to the local device when an ID match occurs. Serial packets pass through all devices in the ring during one round-trip transaction from the controller. The average latency of one round is constant for all devices on the ring, reducing data-dependent performance, since the same packet latency occurs regardless of the data location on the ring. The serial links can be a Peripheral Component Interconnect (PCI) Express bus. Packets have modified-PCI-Express headers that define the packet type and data-payload length.
An equalizer for serial data communications can be configured to compensate for the effects of deterministic jitter. The equalizer can be configured to compensate a received serial data stream for the effects of data-dependent jitter as well as duty cycledistortionjitter. The equalizer can be configured to determine the value of one or more previously received symbols and compare them to a recovered symbol. The equalizer can adjust a variable delay positioned in the serial data path to introduce a delay into the data path that is based in part on the received data stream. The equalizer can be configured to vary the delay when any of the one or more previously received symbols is different from the recovered symbol, and can be configured to maintain a constant delay if the one or more previously received symbols is the same as the recovered symbol.
Systems and methods for analyzing the jitter content of an oversampled digital communication signal are disclosed. Advantageously, the communication signal can correspond to an arbitrary data sequence, rather than only to a repeating test sequence. For example, the systems and methods can be embodied in test equipment and in simulation equipment as design tools and / or validation tools. The systems and methods disclosed advantageously facilitate the decomposition and quantification of the main jitter components (random and deterministic), as well as its various subcomponents (periodic jitter, data-dependent jitter, inter-symbol interference, device-state-dependent jitter, other bounded uncorrelated jitter, and data-dependent-random jitter).
A modem (10) for transmitting a discrete multitone modulated (DMT) signal over a communications channel (H) is disclosed. In the encoding of an input bitstream, unloaded subchannels in the DMT spectrum are assigned signal values so that a trailing portion of each block or frame of the resulting datastream are forced to a known value, for example zero. The known-valued trailing portion of each block provides the effect of a cyclic prefix, without necessitating the prepending of an actual cyclic prefix and incurring the corresponding data rate loss; alternatively, the effect of a cyclic prefix can be augmented by the forcing of the trailing portion of the blocks to known values.
A tandem massspectrometer includes a two-dimensional ion trap that has an elongated ion-trapping region extending along a continuously curving path between first and second opposite ends thereof. The elongated trapping region has a central axis that is defined substantially parallel to the curved path and that extends between the first and second opposite ends. The two-dimensional ion trap is configured for receiving ions through the first end and for mass selectively ejecting the ions along a direction that is orthogonal to the central axis, such that the ejected ions are directed generally toward a common point. The tandem massspectrometer also includes a collision cell having an ion inlet that is disposed about the common point for receiving the ions that are ejected therefrom and for causing at least a portion of the ions to undergo collisions and form product ions by fragmentation. A mass analyzer in communication with the collision cell receives the product ions from the collision cell and obtains product ion mass spectra with a rapid scan rate. In this way, a plurality of product ion spectra may be obtained for a large number of precursor ions in a sample without the need for data-dependent operation.
A data encodingsystem for a data stream comprises a data dependent scrambler that receives the data stream including K m-bit symbols, that selects a seed based on the K m-bit symbols, that scrambles the K m-bit symbols using the seed and that outputs a codeword including the scrambled K m-bit symbols and the seed. A DC control module receives a plurality of the codewords from the data dependent scrambler, selectively inverts selected ones of the plurality of codewords to reduce a difference between a total number of zeroes and total number of ones in the plurality of codewords and outputs an encoded data stream.
Embodiments of the present invention provide a system and method for service management in a distributed database environment. In general, embodiments of the present invention provide a service manager that connects to or is part of a database appliance that collects database performance data in the distributed databasesystem. The database appliance accesses traffic between database clients and database servers and collects a variety of database performance statistics without having to rely on agents at the database clients or database servers. The service manager can access the performance data from the database appliance (locally or over communications link) and archive the performance data. Additionally, the service manager can compare items of the performance data (e.g., specific performance statistics) to user defined thresholds. If a threshold is met, the service manager can notify a user by, for example, sending an email.
Methods and apparatus for data-dependent mass spectrometric MS / MS or MSn analysis are disclosed. The methods may include determination of the charge state of an ion species of interest, followed by automated selection of a dissociation type (e.g., CAD, ETD, or ETD followed by a non-dissociative charge reduction or collisional activation) based at least partially on the determined charge state. The ion species of interest is then dissociated in accordance with the selected dissociation type, and an MS / MS or MSn spectrum of the resultant product ions may be acquired.
A fast method of color interpolation of pixels of an image acquired by a color filtered digital sensor uses a very simple cost function that nevertheless produce interpolated images of good quality. The cost function is computationally simpler because it does not require the calculation of powers and square roots. The triangulationalgorithm may be executed in far less time, while practically ensuring the same performance. The triangulationalgorithm on average may use only two iteration steps. The interpolation process may be followed by an anti-aliasingprocessing that effectively removes color artifacts.