Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

33 results about "Append" patented technology

In general, to append is to join or add on to the end of something. For example, an appendix is a section appended (added to the end) of a document. In computer programming, append is the name of a procedure for concatenating (linked) lists or arrays in some high-level programming languages.

Feed-forward control system and feed-forward control method for wind generating set based on laser wind finding radar

The invention provides a feed-forward control system and a feed-forward control method for a wind generating set based on a laser wind finding radar. The feed-forward control system comprises a laser wind finding radar and a feed-forward controller. The feed-forward controller comprises a data processing unit and a feed-forward logical unit. The data processing unit calculates and sends a real-time wind speed fluctuating value delta V to the feed-forward logical unit; and the feed-forward logical unit calculates the wind speed fluctuating value delta V to obtain an append command vane angle beta which is added to an original variable-pitch controller command vane angle alpha to obtain and send a final variable-pitch command signal theta to a variable-pitch controller. The wind speed feed-forward control is added, so that loads of relevant parts of the wind generating set are reduced, output characteristics of the wind generating set are improved, and the safety of the wind generating set under extreme wind conditions is improved; and a prior running fan system is not needed to be transformed too much, the feed-forward control system and the feed-forward control method have wide adaptability simultaneously and are capable of being used in different environments and easy to implement, loads of parts are reduced, the wind energy utilization rate is improved, and the cost is reduced.
Owner:DONGFANG TURBINE CO LTD

Anti bacterial anti mite fiber and preparation method thereof

The invention relates to an anti bacterial anti mite fiber and preparation method thereof, the anti bacterial anti mite fiber is prepared by adding through a polymer an organic anti mite agent eugenol and / or ISO eugenol formulated with an inorganic anti bacterial agent zinc oxide and preparing into an anti bacterial anti mite agent, after melting, and spinning and being prepared. The method works by firstly mixing the organic anti mite agent eugenol and / or ISO eugenol with the inorganic anti bacterial agent zinc oxide, after refining with a ball crusher, and sieving to obtain a formulated anti bacterial anti mite powder material, then using a surface treatment agent to surface coat the formulated anti bacterial anti mite powder material; then adopting a direct append method, the surface coated and formulated anti bacterial anti mite powder material being evenly mixed with a polymer, after melting, and spinning to prepare into the anti bacterial anti mite fiber; or adopting a masterbatch method, the surface coated and formulated anti bacterial anti mite powder material being melted with a polymer and mixed together to prepare into an anti bacterial anti mite master batch, then the anti bacterial anti mite master batch being evenly mixed with a polymer, after melting, and spinning to prepare into a fiber with a long period anti bacterial anti mite effect.
Owner:SOUTH CHINA UNIV OF TECH +1

Intelligent queue for information teleservice messages with superceding updates

A message exchange network is disclosed in which at least two different methods of storing messages in memories of message storage entities, e.g., a mobile handset, an SMSC, an e-mail client, or an e-mail server, are utilized based on the type and the content of the information contained within the message. An information service message containing information that is supercedingly updateable, e.g., stock quote, weather or traffic information, is stored using a replacement method by which an older message previously stored is replaced by a newly received message. All other types of messages are stored using an append method by which the newly received message is stored in an unoccupied available memory location. In a disclosed embodiment, message identifier included in the message itself provides information necessary to distinguish between the aforementioned two types of messages. In a disclosed embodiment, a block of message identifiers is reserved for storage of information service messages. The architectures and methods for receipt, delivery and storage of messages disclosed herein replaceable and/or on demand update of information service messages while providing efficient use of memory in which the messages are stored, avoiding the annoyance and inconvenience to the subscriber in having to scroll through numerous stale and/or obsolete messages in order to view the most current up to date message and having to manually selecting and deleting obsolete and stale messages, and avoiding unnecessary deliveries of the obsolete and stale messages by message centers.
Owner:ARTAX LLC

Append operation method for LSM tree memory system and reading and merging method for loads of append operation

The invention provides an append operation method for an LSM tree memory system. The append operation method comprises following steps of: 1), constructing value to be appended and a key to be appended to be in a key-value structural body and utilizing a newly-constructed key-value structural body as latest data segments of the key to be appended for storage in a database; saving aggregate data amount of accumulated data segments before the key to be appended as for the newly-constructed key-value structural body and saving a storage position of a data segment before the key to be appended; and 2), updating table items of the key to be appended in the append table which records aggregate data amount of all data segments of all keys and storage positions of latest data segments. The invention further provides a reading and merging method for corresponding loads of append operation. The append operation method for the LSM tree memory system and the reading and merging method for loads of append operation have following beneficial effects: increase in system cost is avoided due to a read-write amplification problem of append operation; during the course of moving from a lower level to a higher level, loads of append operation are aggregated; and reading performance of loads of append operation can be improved.
Owner:中科海微(北京)科技有限公司

Read and merge method for insert operation and load of lsm tree storage system

The invention provides an append operation method for an LSM tree memory system. The append operation method comprises following steps of: 1), constructing value to be appended and a key to be appended to be in a key-value structural body and utilizing a newly-constructed key-value structural body as latest data segments of the key to be appended for storage in a database; saving aggregate data amount of accumulated data segments before the key to be appended as for the newly-constructed key-value structural body and saving a storage position of a data segment before the key to be appended; and 2), updating table items of the key to be appended in the append table which records aggregate data amount of all data segments of all keys and storage positions of latest data segments. The invention further provides a reading and merging method for corresponding loads of append operation. The append operation method for the LSM tree memory system and the reading and merging method for loads of append operation have following beneficial effects: increase in system cost is avoided due to a read-write amplification problem of append operation; during the course of moving from a lower level to a higher level, loads of append operation are aggregated; and reading performance of loads of append operation can be improved.
Owner:中科海微(北京)科技有限公司

Intelligent queue for information teleservice messages with superceding updates

A message exchange network is disclosed in which at least two different methods of storing messages in memories of message storage entities, e.g., a mobile handset, an SMSC, an e-mail client, or an e-mail server, are utilized based on the type and the content of the information contained within the message. An information service message containing information that is supercedingly updateable, e.g., stock quote, weather or traffic information, is stored using a replacement method by which an older message previously stored is replaced by a newly received message. All other types of messages are stored using an append method by which the newly received message is stored in an unoccupied available memory location. In a disclosed embodiment, message identifier included in the message itself provides information necessary to distinguish between the aforementioned two types of messages. In a disclosed embodiment, a block of message identifiers is reserved for storage of information service messages. The architectures and methods for receipt, delivery and storage of messages disclosed herein replaceable and / or on demand update of information service messages while providing efficient use of memory in which the messages are stored, avoiding the annoyance and inconvenience to the subscriber in having to scroll through numerous stale and / or obsolete messages in order to view the most current up to date message and having to manually selecting and deleting obsolete and stale messages, and avoiding unnecessary deliveries of the obsolete and stale messages by message centers.
Owner:ARTAX LLC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products