377 results about "Size value" patented technology

A bridge associated with a broadcast aperture facilitates the transfer of rendering commands and data between a processor and multiple graphics devices. The bridge receives data written by the processor to the broadcast aperture and forwards it to multiple graphics devices, eliminating the need for the processor to perform duplicative(?) write operations. During system initialization, a broadcast aperture is allocated to the bridge in address space based on an aperture size value set using a system configuration utility and stored in system configuration memory. A graphics driver activates the broadcast aperture by sending unicast aperture parameters associated with the multiple graphics devices to the bridge via a bridge driver. Upon activating the broadcast aperture, multiple graphics devices can be operated in parallel to improve rendering performance. Parallel rendering techniques include split-frame, alternate frame, and combined split- and alternate frame rendering.

Certain aspects of a method and system for delayed completion coalescing may be disclosed. Exemplary aspects of the method may include accumulating a plurality of bytes of incoming TCP segments in a host memory until a number of the plurality of bytes of incoming TCP segments reaches a threshold value. A completion queue entry (CQE) may be generated to a driver when the plurality of bytes of incoming TCP segments reaches the threshold value and the plurality of bytes of incoming TCP segments may be copied to a user application. The method may also include delaying in a driver, an update of a TCP receive window size until one of the incoming TCP segments corresponding to a particular sequence number is copied to the user application. The CQE may also be generated to the driver when at least one of the incoming TCP segments is received with a TCP PUSH bit SET and the TCP receive window size is greater than a particular window size value.

A database spread over multiple nodes allows each node to store a journal recording changes made to the database and also allows a journaling component to manage the memory space available for journaling. Two threshold size values may be specified for the journal. The first threshold value specifies a journal size at which to being pruning the journal on a given node. A journal pruning algorithm may be used to identify journal entries that may be removed. For example, once a given transaction completes (i.e., commits) the journal entries related to that transaction may be pruned from the journal. The second threshold value specifies the maximum size of the journal. After reaching this size, journal entries may be written to disk instead of the in-memory journal.

The present invention is to provide a method and device which can determine current available bandwidth for each Transport Control Protocol (TCP) connection and adjust window size dynamically according to the available bandwidth to achieve high network utilization and efficient flow control in the same time without the need to buffer any received TCP packets, which can work with and without support of large window option. The device classifies incoming traffic into several groups (public and private), monitors and allocates the available bandwidth for each group. To enable flow control, the device also records the initial window size value for each connection and compares it with the original window size value for a newly received TCP packet. If the original window size value received from TCP receivers changes, the device varies the modified window size accordingly to enable efficient flow control in the same device as well.

The present invention provides a method and an apparatus for scheduling a flow on an output link among a plurality of flows of incoming packet traffic at a network device associated with a data network. A scheduler comprises scheduler logic that uses a credit counter per flow to keep track of the service difference received between two or more flows and selects the flow for service next that has the maximum credit value. The scheduler logic updates an amount of credit value in a counter of the next flow with the front-end packet currently being served among the first and second flows with a value that substantially equals a packet size value divided by a flow weight value of the front-end packet currently being served. The scheduler logic further updates an amount of credit value in the first and second counters of the first and second flows having packets waiting with a value that substantially equals the size of the front-end packet currently being served.

This invention discloses an self-adaptive mike array system and a method for processing its phone signals, which adds an self-adaptive filter coefficient refresh control module in the mike system to control if the filter should refresh the coefficient or the step-size value when refreshing the coefficient, so that the refreshment of the coefficient is only against the noise so as to avoid the side effect of reducing effective phone signal amplitude while conducting filter coefficient refresh using existing technology when the noise component from the back signals is comparable with or smaller so than the phone component from frontage. This invented system applies a high-order adaptive filter to reduce the noise amplitude to the utmost degree and ensures the best noise-elimination effect no matter what positions the system zero-point directs when multiple noise sources exist.

A first embodiment of the present application is directed to a method and system used to weld a cylindrical workpiece. A substantially cylindrical workpiece is loaded into a workpiece support, and a robotic welding arm is positioned located at a start position. A value representing a size of the cylindrical workpiece is input into a robot controller via a system interface. Inputting of the size value to the robotic interface obtains a control program. Operation of the obtained control program is initiated by an operator, causing the robot arm to move a preprogrammed distance toward a work surface of the workpiece. Then a welding process is performed by the welder carried on the robot arm in accordance with the control program. The process includes initiating operation of the welder, and moving the welder in a pattern appropriate for the welding operation. The workpiece and welder are moved relative to each other so as to perform the welding process as determined by the control program.

A method of downloading a file from a Internet server to an Internet client, preferably without action by the Internet client. The method begins by associating the file into a set of components at the server. A profile of the file is then generated. This profile includes identifying information for the file as well as for each component thereof. Such information preferably includes an identifier, a size value, and a code uniquely identifying the component. The file is transferred by initiating a download sequence by which each component is transferred, one-by-one, from the server to the client using an Internet protocol. When the download sequence is complete, the individual components are reassembled into the file using the profile without action by the Internet client. If the transmission is interrupted for any reason, the download sequence is restarted with the component affected by the interruption. This avoids the need to retransfer the entire file.

Gain errors are corrected in an ADC chip including an integrator (17), a comparator (30), and a digital filter (37) by storing a gain-adjusted LSB size based on measured gain error in a memory (44). The gain-adjusted LSB size is applied to the digital filter to cause gain-adjusted LSB size values to be added to or subtracted from accumulated content of the digital filter in accordance with a first or second state, respectively, of the comparator (30) during each cycle of the ADC. The final accumulated content after all required cycles of the ADC is a gain-corrected digital output signal (Dout(gain-corrected)).

The invention discloses a method for optimizing the time synchronous correction and a device thereof, which are applied to a digital communication network. The method comprises the following steps: a synchronous protocol module acquires the current time offset value by transmitting synchronization messages via a main side and a secondary side; a judgment module compares that the symbol of the current time offset value and the symbol of the time offset value of the previous synchronization are both positive or both negative; if yes, the judgment module makes a decision that the clock slave is in the positive offset or negative offset relative to the clock master, and correspondingly determines that the follow-up correction is the negative correction or the positive correction, that is, a follow-up correction module decreases a preset interval adjustment step size value from or adds a preset interval adjustment step size value to the synchronous correction at each time of follow-up correction. The method and the device for optimizing the time synchronous correction process the time offset value and take different synchronous correction plans according to the processing result, effectively improve the synchronization precision without changing the synchronization frequency or the interval time, and have strong anti-interference capability and good versatility.

A method, apparatus, and computer-readable medium configured for maintaining consistent per-hop packet forwarding behavior among a plurality of network devices in a network within a Differentiated Services (DS) domain are disclosed. In one aspect, a method involves creating and storing a network-wide PHB definition that associates a PHB with a DS code point (DSCP) value, and with a set of parameters that define the bandwidth and buffer resources allocated to the PHBs on all interfaces of network devices within the DS domain. A mapping of each of the PHBs in the network-wide PHB definition to one or more queues of the network devices is determined. Drain size and queue size values are determined for each of the queues to which PHBs are mapped. A mapping of each of the PHBs to a threshold value associated with the queues is determined. Parameters of fragmentation and interleave mechanisms are determined. Network device configuration parameter values based on the mappings, the drain size, and the queue size, etc. are sent to each of the network devices within the DS domain. As a result, consistent PHB is achieved throughout a network using abstract definitions of PHBs.

Certain aspects of the present disclosure generally relate to techniques for compactly describing lifted low-density parity-check (LDPC) codes. A method for wireless communications by a transmitting device is provided. The method generally includes selecting a first lifting size value Z and a first set of lifting values for generating a first lifted LDPC code; generating the first lifted LDPC code by applying the first set of lifting values to interconnect edges in Z copies of a base parity check matrix (PCM) having a first number of base variable nodes and a second number of base check nodes to obtain a first lifted PCM corresponding to the first lifted LDPC code; determining a second set of lifting values for generating second lifted PCM corresponding to a second lifted LDPC code for a second lifting size value based on the first lifted PCM and the first set of lifting values; encoding a set of information bits based on at least one of: the first lifted LDPC code or the second lifted LDPC code to produce a code word; and transmitting the code word.

The invention discloses a self-adaptive screen regulation method. The method includes the steps of obtaining environment data and data of a user, wherein the environment data includes at least one of the light ray brightness data of the environment where the terminal device is located and the shaking data of the terminal device, and the data of the user includes at least one of the distance between the user and the terminal device, the size values of pupils of the user and the distance between eyelids of the user; automatically regulating parameters of a screen according to the environment data and the data of the user, wherein the parameters of the screen include at least one of the brightness of the screen and the sizes of fonts of the screen. The invention further provides a self-adaptive screen regulation device and the terminal device. By means of the self-adaptive screen regulation method, the self-adaptive screen regulation device and the terminal device, the parameters of the screen are automatically regulated, the trouble of manual regulation is avoided, regulation is convenient and rapid, the parameters of the screen are regulated according to the environment data and the data of the user, and accuracy is higher.

A multi-queue FIFO memory device that uses existing pins of the device to load a desired number of queues (N) into a queue number register is provided. The queue number register is coupled to a queue size look-up table (LUT), which provides a queue size value in response to the contents of the queue number register. The queue size value indicates the amount of memory (e.g., the number of memory blocks) to be included in each of the N queues. The queue size value is provided to a queue start/end address generator, which automatically generates the start and end address associated with each queue in response to the queue size value. These start and end addresses are stored in queue address register files, which enable proper memory read/write and flag counter operations.

The embodiment of the invention provides a keyword extraction method and device. The method comprises the following steps: acquiring web page text information; pre-processing the web page text information to obtain a sequence of candidate keywords; Constructing the candidate keyword map according to the sequence of the candidate keywords, obtaining a similarity value between each candidate keyword and other candidate keywords in the sequence of the candidate keywords according to the candidate keyword map operation, and using the similarity value as an initial weight value of each candidate keyword; According to the initial weight value of each candidate keyword, calculating the convergence weight value corresponding to each candidate keyword, sorting the convergence weight value corresponding to each candidate keyword by size value, and extracting the target keywords of the web page text information in each candidate keyword by sorting the convergence weight value of each candidate keyword according to the size value of the convergence weight value. The embodiment of the invention improves the initial weight algorithm of the TextRank algorithm, and realizes more efficient extraction of keywords in the web page text information.

The invention relates to a method for determining the optical particle size of finely ground gas coal participating in coking and coal blending, which comprises the following steps: firstly, grinding the gas coal according to the different particle size grinding grades; secondly, mixing with a single coal respectively by the same proportion, and obtaining the mixed coal; thirdly, placing all the mixed coal in crucibles respectively, heating at the temperature of 850 DEG C plus or minus 10 DEG C for 13-20 minutes, and weighing the coke weight m respectively; fourthly, rotating in a caking index rotary drum for 250 plus or minus 50 turns respectively, screening respectively, and weighing the coke weight m1 respectively; fifth, further placing into the caking index rotary drum for rotating for 250 plus or minus 50 turns, screening, and weighing the coke weight m2 respectively; sixth, putting all the m, m1 and m2 into a formula that X is equal to (30*m1+70* m2)/m+10 for calculation; and seventh, determining the particle size value with the maximum X value as the optimal particle size of the finely ground gas coal. The method can ensure the reasonable particle size of the coal entering a furnace and lead the quality of the produced coke to be stable.

The invention provides an optimization control method based on selective harmonic elimination pulse width modulation (SHEPWM). The optimization control method based on the SHEPWM comprises the following steps: writing amplitude expressions of fundamental waves and controlled harmonic waves of all times in an arraying mode, confirming amplitude of the fundamental waves and the controlled harmonic waves of all times, and obtaining a switch angle. The optimization control method is combined with characteristics of amplitude frequency of a filter, obtains the most advantageous size value of the amplitude of the controlled harmonic waves by optimizing an objective function, improves the harmonic wave distribution condition of an SHEPWM wave form, reduces amplitude of surplus harmonic wave, enables a total harmonic content to reduce, and even removes the big surplus harmonic waves. Small amplitude changes of a controlled harmonic wave component can cause great influence on harmonic wave distribution of output voltage, and suitable changes can reduce amplitude of surplus harmonic wave components of a traditional SHEPWM method.

The present invention relates to a transmission time interval (TTI) bundling method in wireless access systems and to an apparatus for same. In particular, the TTI bundling method includes the following steps: a terminal receives information indicating the bundling size value from a base station; the terminal automatically re-transmits packets through a predetermined number of TTIs following four TTIs without the reception of Acknowledgement/Negative-ACK (ACK/NACK) information for the packets from the base station; the terminal receives the ACK/NACK information for the packets from the base station; and the terminal retransmits packets in a Hybrid Automatic Repeat and Request (HARQ) scheme when receiving the NACK, wherein the predetermined number of TTIs is determined according to the bundling size value.

Techniques and apparatus are provided for efficiently generating multiple lifted low-density parity-check (LDPC) codes for a range of block lengths and having good performance. A method for wireless communications by a transmitting device generally includes selecting integer lifting values for a first lifting size value Z, selected from a range of lifting size values, wherein the selected integer lifting value is greater than a maximum lifting size value of the range of lifting size values; determining one or more integer lifting values for generating at least a second lifted LDPC code having a second lifting size value based on an operation involving the second lifting size value and the selected one or more integer lifting values for generating the first lifted LDPC code; encoding a set of information bits based on the second lifted LDPC to produce a code word; and transmitting the code word.

The invention includes an apparatus and method for wirelessly transmitting data between a plurality of subscriber units and a base transceiver station. The method includes at least one subscriber unit transmitting a request to send data blocks to the base transceiver station. The request includes a data transmission queue size value. A base user queue size estimate is updated at the base transceiver station. The base user queue size estimate corresponds to the one subscriber unit that transmitted the request to send data. The base user queue size estimate is based upon the data transmission queue size value. The base transceiver station generates a schedule that includes time slots and frequency blocks in which the requested data blocks are to be transmitted from the one subscriber unit to the base transceiver station. The subscriber unit transmits the data blocks the subscriber requested to be sent, according to the schedule. Each transmitted data block includes encoded information representing a current data transmission queue size value. The base user queue size estimate is updated based upon the encoded information. The base user queue size estimate influences future schedules generated by the base transceiver station.

A method of managing a memory of an apparatus the apparatus executing one or more processes using the memory. The method comprises maintaining a plurality of lists of identifiers, wherein each list has an associated size value and an associated threshold corresponding to a maximum number of identifiers in that list, wherein each identifier identifies a corresponding region of the memory that had been allocated for a process but that is currently not required by any of the one or more processes, and wherein the size of a region of the memory identified by an identifier of a list equals the size value associated with that list. When a process requests allocation of a region of the memory: one of the lists are identified that has an associated size value suitable for the allocation request; and if that list is not empty, to that process a region is identified of the memory identified by one of the identifiers stored in that list and that identifier is removed from that list, and, otherwise, a region of the memory is allocated with a size of the identified associated size value and the allocated region is identified of the memory to that process. The method comprises adjusting one or more of the thresholds in dependence upon the current usage of the memory by the one or more processes.

This invention provides one Holman decoding method for JPEG codes flow, which comprises the following steps: a, according to the flow number list to establish minimum code sub list; b, according to the code number forming minimum code address list; c, adopting 0 to 16 bit comparer to get the Holman code relative RUN/SIZE list; d, according to SIZE value to restore codes front data. Comparing with current technique, this method forms different codes length minimum codes list and address list to lower the register array materials occupancy.