166 results about "Total count" patented technology

A method for detecting an undesirable condition within a messaging network. A message is received and a source of the message is identified. If an entry in a database for the source has not been created, an entry is created. A source counter for the source is then set to one and a timestamp is created for the source. If an entry in the database for the source has been previously created, the source counter is incremented by one and the timestamp is updated. The source counter is then compared to a source threshold, and if the source counter exceeds the source threshold over the course of predetermined amount of time, a source alarm is triggered. A sliding with respect to the predetermined amount of time may also be implemented to account for total counts that may fall across or be split by set periods of time. The invention is particularly useful for detecting “spam” events and undesirable routing loops.

A method, a system, and a computer program product for determining a total count of audience members within a sensory receiving environment during the presentation of a program. A voice recognition unit is enabled when a signal for a program/subject/event, such as a broadcast program, is received. The voice recognition unit receives one or more sounds in the sensory receiving environment and analyzes the characteristics of the sounds. When one or more unique human voices are identified during the program, a count of the number of unique human voices is determined. The count of unique human voices is transmitted to a server, whereby the count of unique human voices is equal to a count of audience members. The total count of audience members is calculated for all sensory receiving environment associated with the program. An audience analysis graphical user interface is generated to display the total count of audience members.

A topological best match naming convention apparatus and method for graphical user interface (GUI) testing are provided. With the apparatus and method, properties of the GUI object are recorded and stored in a GUI object database. During execution of test scripts, if a lookup of an GUI object's name to its runtime control fails, the present invention attempts to perform a match with the currently known objects. The matching mechanism is based on a comparison of the properties of the GUI object to properties of known GUI objects. With this mechanism, a predetermined set of properties is collected from the GUI object that is subject to the test script and for which the lookup of the runtime control failed. Each property of the known GUI objects in the GUI object database is assigned a weight based on the probability that a GUI object having a matching property is the same GUI object. Each property is checked for a match and if a match is identified, the corresponding weight is added to a total count kept for each correspondence. A correspondence between a GUI object and a known GUI object having a highest total weight is selected as a best candidate for use in determining the runtime control for the GUI object.

A method, device, and system are disclosed. In one embodiment method begins by incrementing a count of a total number of write operations to a non-volatile memory storage for each write operation to the non-volatile memory storage. The method then receives a request for the total count of lifetime write operations from a requestor. Finally, the method sends the total count of lifetime write operations to the requestor.

A method of awarding a prize in a gaming system including a plurality of game consoles (11, 12, 13) comprising the steps of providing a trigger value derived from a random variable having a non-uniform distribution, periodically receiving count data from each game console, being data representing at least one parameter of a game console, calculating a total value representing the total count data received, comparing the total value with the trigger value, transmitting a prize instruction signal to an output means if the total value has a predetermined relationship with the trigger value, whereby the prize instruction signal results in at least one game console issuing a prize.

The invention provides a frequency calibration circuit and a method thereof. The frequency calibration circuit comprises a phase lock loop circuit, an M-dividing divider for generating a plurality of phase signals, a sampling circuit for sampling on the rising edges of the phase signals, a first counter for counting reference frequency signals, a second counter counting first phase signals, a logical control circuit for comparing a count value with a target count value to obtain a minimum difference value, and looking up a control bit of a voltage-controlled oscillator through the difference value, and a comparison circuit for judging whether the control voltage of the voltage-controlled oscillator is in a set range or not. The method comprises the following steps: sampling the reference frequency signals to obtain a total count value; comparing the total count value with a target count value; selecting a next resonance line according to a binary lookup flow till binary lookup ends; and outputting a resonance line corresponding to a minimum error in order that the output frequency of the voltage-controlled oscillator reaches a required value. Through adoption of the frequency calibration circuit and the method thereof, the speed and accuracy are increased, and the requirement on the working frequency of a digital circuit is lowered, so that a design method is simplified.

An iterative decoder includes at respective variable nodes, that is, at nodes that correspond to the bits of the code word, bit error detectors that after convergence determine if the respective hard decision bit values have changed from the bit values provided by the channel. The change in value for a given bit indicates that a bit error has been corrected. The bit error detector, for message-passing decoders that perform calculations by addition rather than multiplication, can be readily implemented as an XOR gate. Thus, a bit error is detected at the variable node by XOR'ing the sign bits of the input symbol and the variable node sum. After convergence, the output values produced by the bit error detectors at the respective variable nodes are added together using an adder tree that accumulates the detected bit errors for an entire date block, or ECC code word. Alternatively, the system may group the bits into respective code word symbols and combine the bit error values into symbols-with-errors values using, for example, XOR sub-trees that produce, for each symbol, a single error value. The error value for a given symbol indicates that the symbol is either error-free or includes one or more bit errors, and a total count of the symbols with errors is produced by adding the error values together.

One embodiment sets forth technique for computing a similarity score between two digital items is computed based on interaction histories associated with global users and interaction histories associated with local users. Global counts indicating the number of interactions associated with each unique pair of digital items are weighted based on a mixing rate. The weighted global counts are then combined with local counts to compute total counts. An effective interaction probability indicating the likelihood of a user interacting with one digital item in the pair of digital items after interacting with the other digital item in the pair is computed based on the total counts. The effective interaction probability is then corrected for noise, resulting in a similarity score indicating the similarity between the pair of digital items.

The invention discloses a multi-gamma-photo simultaneous medicine emission time coincidence nuclear medical imaging system and method, and belongs to the field of nuclear medical images. The system comprises multiple detector probes arranged in non-parallel mode, a time coincidence module and a computer platform. Each detector probe is composed of a collimator and a gamma photo detector with a time measuring function. Multiple gamma photos radiated by detection radionuclides within a short time form multiple gamma-photo coincidence events. The point with the smallest sum, of distances of projection lines determined by the multiple gamma-photo coincidence events, calculated by the method is the disintegration position of radionuclides, and the distribution of radionuclides in living bodies can be obtained by accumulating a certain number of mult-gamma-photo coincidence events. By means of the imaging system and method, reconstruction algorithm is simplified, the signal to noise ratio of reconstructed images is improved, the requirement for the gamma photo total count is lowered, and the irradiation risk to patients is lowered.

The invention relates to a water purifying agent for pond culture. The water purifying agent is powdery mixture which is prepared by uniformly mixing the following components in part by weight: 100 to 200 parts of bacillus subtilis, 100 to 200 parts of nitrobacteria, 150 to 200 parts of photosynthetic bacteria and 400 to 650 parts of zeolite powder, wherein the water purifying agent preferably comprises 100 parts of bacillus subtilis, 100 parts of nitrobacteria, 150 parts of photosynthetic bacteria and 650 parts of zeolite powder; the bacillus subtilis is light yellow powder and the total count of viable bacteria is more than or equal to 200 hundred million per one gram; the nitrobacteria is light grey powder and the total count of the viable bacteria is more than or equal to 80 hundred million per one gram; the photosynthetic bacteria is grey white powder and the total count of the viable bacteria is more than or equal to 30 to 50 hundred million per one gram; and the zeolite powder is clinoptilolite with particle size of 180 meshes. The water purifying agent has the advantages of improving water quality, conducting the function of oxidation, ammoniation, denitrification, dephosphorization, sulfurization, nitrogen fixation and the like, constructing and maintaining good ecological water environment, preventing and treating diseases, enhancing the anti-disease capacity of animals bred in the pond and improving the survival rate. The water purifying agent has a reasonable formula, is simple to prepare and has obvious application effect.

The invention provides a medical imaging method and a medical imaging system. The method comprises the following steps: getting scanning data; getting correction coefficients, including a normalization correction coefficient and a total count quantitative uniformity correction coefficient; correcting the scanning data with the correction coefficients to get corrected scanning data; performing image reconstruction with the corrected scanning data to get reconstructed images. Through the method, after a user performs normalization correction on scanning data, the SUV values of reconstructed images are kept consistent.

The invention relates to a single photon detector quantum efficiency absolute self-calibration method and dedicated apparatus therefore wherein, the parameter light beam is divided into two ways, then the time delay is introduced, making the twinning protons generated at spontaneously enter the single proton detector in sequence, then dividing the circuit after the detector into three ways, one of which enters directly into the counter to obtain the total counting ratio of the detected protons by the detector, the other two ways are led into the time lag corresponding to the optical path using the circuit method, and enter into the counter after the coincidence circuit, obtaining the coincidence counting rate of the proton pair arriving the detector in sequence, thus acquiring the quantum efficiency of the detector.

What is provided herein is a novel system and method for estimating the amount of color in a document. In one embodiment, a binary CMYK input image is received. Each of the CMYK plane is received at an offset from the previous plane, i.e., the 4 planes are not received simultaneously. Each plane is divided into M×N tiles. Pixel values of all four planes are examined separately and the number of on-pixels is counted for each plane. The number of on-pixel counts for each tile are aggregated for each plane. Total on-pixel counts are used to estimate the total number of white, black, color, and gray pixel counts. The total counts for all planes are used to estimate the amount of color. A document is determined to be color if the amount of color exceeds a predetermined threshold. A color billing strategy is determined based on the estimated color amount.

The invention provides a dynamic self-adaption skin color segmentation method and a device. The method comprises the following steps: a red green blue (RGB) image is obtained; colors and space of the RGB image are transformed to obtain a hue saturation value (HSV) image; a face of a person is tested to obtain a position and an area of the face; color values of a skin color pixels in the face area are collected to serve as a skin color sample, and color values of positions with intense light changes are recorded to serve as a skin color change sample; each chromatic value or saturation value of histograms of the skin color sample and the skin color change sample are polled and are combined with predetermined weight; through the covering rate of the pixel counts within the chrominance or saturation threshold ranges of the histograms to the total counts of the corresponding histograms, skin color segmentation threshold values are obtained; the skin colors are tested through the skin color segmentation threshold values. By means of the above method and device, the skin color dynamic and self-adaption segmentation can be achieved, and thereby the accuracy of the skin color testing and the adaptability of the skin color testing to light changes are improved.

The present invention extends to methods, systems, and computer program products for maintaining a count for lock-free stack access. A numeric value representative of the total count of nodes in a linked list is maintained at the head node for the linked list. Commands for pushing and popping nodes appropriately update the total count at a new head node when nodes are added to and removed from the linked list. Thus, determining the count of nodes in a linked list is an order 1 (or O(1)) operation, and remains constant even when the size of a linked list changes

Causing a processor to execute a plurality of tasks includes determining a count for each task to be executed, determining a total count representing a sum of all counts for all tasks to be included in a run list, and constructing the run list by distributing corresponding entries for each task within the run list a number of times in accordance with each task's weighting factor. The weighting factor corresponds to a ratio of the each task's count with respect to a total count. Causing a processor to execute a plurality of tasks may also include executing the tasks in the run list in a round-robin manner where a particular entry in the run list is skipped in response to a corresponding task having previously relinquished a slot prior to expiration of time allotted for the task to run in the slot.

Each note is detected from input sound in units of detection time at specific time intervals. Whether or not the player's input sound coincides with a reference melody set for an egg OB selected for causing a character to be created is determined based on the detected notes, and the character set for the egg OB is created when the input sound has been determined to coincide with the reference melody. Whether or not the input sound coincides with the reference melody is determined based on (1) the distribution of the notes included in the input sound with respect to the passage of time, or (2) the total count of each note included in the input sound.

In a communication network, end-user systems are connected via a common transmission medium to a timeslot assignment unit. Each end-user system has a buffer for storing packets, and a queue length detector for detecting a queue length of the stored packets. The end-user system forwards packets on assigned timeslots to the network and transmits a signal for indicating the detected queue length to the assignment unit. The timeslot assignment unit maintains timeslot records to store count numbers of assigned timeslots, determines a total count number of timeslots assigned to each end-user system during a period corresponding to the delay time of the unit, and receives a queue length signal from each end-user system. From the total count number and the queue length a virtual queue length is determined for indicating the number of packets to which timeslots are still not assigned. Based on the virtual queue length, timeslots are assigned to each end-user system.