| Patent application number | Description | Published |
|---|
| 20110046419 | METHOD FOR PRODUCING ETHYLENE GLYCOL FROM POLYHYDROXY COMPOUND - A method for producing ethylene glycol, including (a) adding a polyhydroxy compound and water to a sealed high-pressure reactor, (b) removing air and introducing hydrogen, and (c) allowing the polyhydroxy compound to react in the presence of a catalyst while stiffing. The catalyst includes a first active ingredient and a second active ingredient. The first active ingredient includes a transition metal of Group 8, 9, or 10 selected from iron, cobalt, nickel, ruthenium, rhodium, palladium, iridium, and platinum, and/or a mixture thereof. The second active ingredient includes a metallic state of molybdenum and/or tungsten, or a carbide, nitride, or phosphide thereof. The method is carried out at a hydrogen pressure of 1-12 MPa, at a temperature of 120-300° C. for not less than 5 min in a one-step catalytic reaction. The efficiency, selectivity, and the yield of ethylene glycol are high. The preparation process is simple and the materials used are renewable. | 02-24-2011 |
| 20120172633 | METHODS FOR PREPARING ETHYLENE GLYCOL FROM POLYHYDROXY COMPOUNDS - This invention provides methods for producing ethylene glycol from polyhydroxy compounds such as cellulose, starch, hemicellulose, glucose, sucrose, fructose, fructan, xylose and soluble xylooligosaccharides. The methods uses polyhydroxy compounds as the reactant, a composite catalyst having active components comprising one or more transition metals of Groups 8, 9, or 10, including iron, cobalt, nickel, ruthenium, rhodium, palladium, iridium, and platinum, as well as tungsten oxide, tungsten sulfide, tungsten hydroxide, tungsten chloride, tungsten bronze oxide, tungsten acid, tungstate, metatungstate acid, metatungstate, paratungstate acid, paratungstate, peroxotungstic acid, pertungstate, heteropoly acid containing tungsten. Reacting at a temperature of 120-300° C. and a hydrogen pressure of 1-13 MPa under hydrothermal conditions to accomplish one-step catalytic conversion. It realizes efficient, highly selective, high yield preparation of ethylene glycol and propylene glycol from polyhydroxy compounds. The advantage of processes disclosed in this invention include renewable raw material and high atom economy. At the same time, compared with other technologies that converts biomass raw materials into polyols, methods disclosed herein enjoy advantages including simple reaction process, high yield of targeted products, as well as easy preparation and low cost for the catalysts. | 07-05-2012 |
| 20120178974 | MESOPOROUS CARBON SUPPORTED TUNGSTEN CARBIDE CATALYSTS, PREPARATION AND APPLICATIONS THEREOF - A supported tungsten carbide catalyst comprises tungsten carbide as its active component and a mesoporous carbon as its support, wherein tungsten carbide is highly dispersed on the surface and in the channels of the mesoporous carbon, and the content of tungsten element is in the range from 30% to 42% by mass based on the mesoporous carbon. This catalyst can be prepared by impregnation process. This catalyst can be used for the direct catalytic conversion of cellulose to ethylene glycol under the hydrothermal conditions and at a temperature of 245° C. and the hydrogen pressure of 6 MPa with high reactivity, selectivity and stability. | 07-12-2012 |
| 20120283487 | METHODS OF USING TUNGSTEN CARBIDE CATALYSTS IN PREPARATION OF ETHYLENE GLYCOL - Tungsten carbide catalysts are used in preparation of ethylene glycol by hydrogenating degradation of cellulose. The catalyst includes tungsten carbide as main catalytic active component, added with small amount of one or more transition metals such as nickel, cobalt, iron, ruthenium, rhodium, palladium, osmium, iridium, platinum, and copper as the second metal, supported on one or more porous complex supports such as active carbon, alumina, silica, titanium dioxide, silicon carbide, zirconium oxide, for conversion of cellulose to ethylene glycol. The catalyst realizes high efficiency, high selectivity, and high yield in the conversion of cellulose to ethylene glycol at the temperature of 120-300° C., hydrogen pressure of 1-10 MPa, and hydrothermal conditions. Compared to the existing industrial synthetic method of ethylene glycol using ethylene as feedstock, the invention has the advantages of using renewable raw material resources, environment friendly process, and excellent atom economy. | 11-08-2012 |
| 20150057469 | PROCESS FOR HIGHLY EFFICIENT CATALYTIC CONVERSION OF CELLULOSE RAW MATERIAL TO DIOL - This invention provides a method for highly efficient catalytic conversion of cellulosic raw materials to glycols. In the process, cellulosic compounds such as crop stalk, wood powder and etc., as feedstock are subjected to one-step catalytic conversion with a ternary composite catalyst composed of organic acid or inorganic acid which does not contain tungsten, a transition metal from Groups 8, 9 or 10 such as iron, cobalt, nickel, ruthenium, rhodium, palladium, iridium, and platinum, or a mixture thereof, and a tungsten oxide, a tungsten sulfide, a tungsten chloride, a tungsten hydroxide, tungsten bronze, tungstic acid, a tungstate, a metatungstate acid, a metatungstate, a paratungstate acid, a paratungstate, a peroxotungstic acid, pertungstate and heteropoly tungstate, or a mixture thereof. The reaction is carried out under hydrothermal conditions at a temperature between 120-300° C. with hydrogen pressure between 1-13 MPa. | 02-26-2015 |
| Patent application number | Description | Published |
|---|
| 20100250150 | METHOD FOR MEASURING SHAFTING MECHANICAL FATIGUE OF TURBINE GENERATOR SET - A method for measuring mechanical fatigue in shafts forming part of a turbine generator set, which involves determining a lumped mass model of a turbine generator set and its parameters; calculating a model frequency and a mode shape of the turbine generator set; acquiring an angular velocity change at a machine end; calculating a torque at a calculating section of shafting based on the model frequency, a mode shape curve and an equivalent rigidity of the lumped mass model, so as to obtain a torque-time history curve at the calculating section of the shafting; calculating a fatigue damage accumulative value for a dangerous section of a set shafting under a certain malfunction or disturbance, that is, the shafting mechanical fatigue of the turbine generator set. | 09-30-2010 |
| 20100286837 | METHOD OF MEASURING MECHANICAL FATIGUE IN TURBINE-GENERATOR ROTORS - The present invention relates to the coordinated control method of torsional stress relay in large thermal power plants' generators (300 MW and above), which will be adopted when shaft torsional oscillations occur. This invention also publishes a method of realizing selective trip the generators and the trip criterions which are implemented by the torsional stress relay and coordinated control master station (Tmaster). Tmaster will real-time monitor the operating status of the generators and TSR, TMaster will also real-time generate a trip priority level sequencing by analyzing the unit output. | 11-11-2010 |
| 20120039246 | PAGING METHOD, LOCATION UPDATE METHOD AND DEVICE - A paging method may reduce signaling overhead of system paging and save system paging resources. The method includes: receiving, by an eNodeB, a paging message, where the paging message carries a tracking area identity; paging a user equipment if the tracking area identity in the paging message is the tracking area identity of the eNodeB; and instructing a relay to page. A location update method is also disclosed, which reduces signaling load produced by location update. The method includes: generating, by a relay, a system message, where the system message includes a tracking area identity of the relay; and broadcasting the system message, and triggering a user equipment in a cell of the relay to initiate a location update request. The embodiments of the present invention disclose an eNodeB, a relay, a communication system. | 02-16-2012 |
| 20120100855 | Handover Control Method, Apparatuses and Communication System - A handover control method, apparatuses and a communication system are disclosed. In embodiments of the present invention, a control base station (DeNB) of a Relay node is identified according to an established relation between the Relay node and the Control base station, and therefore, a handover request message can be routed to the correct DeNB and finally sent to the RN, and a User Equipment can normally hand over to a cell controlled by the Relay node. | 04-26-2012 |
| 20120276910 | HANDOVER METHOD AND SYSTEM IN RELAY NETWORK, RELAY NODE, CONTROL BASE STATION AND BASE STATION - Embodiments of the present invention provide a handover method and system in a relay network, a relay node, a control base station and a base station. The method includes: receiving, by a relay node, a first area identifier that identifies the relay node; sending a system information broadcast message carrying the first area identifier to a terminal in a coverage area; receiving a handover request message forwarded by a control base station; and performing, according to the handover request message, a control operation of accessing the relay node on the terminal. The first area identifier that identifies the relay node is allocated to the relay node, so that the terminal in the relay network can be normally handed over from the base station to the relay node. | 11-01-2012 |
| 20130111940 | HEAT AND COLD SOURCES OF TEMPERATURE AND HUMIDITY INDEPENDENT CONTROL AIR CONDITIONING SYSTEM - The present invention discloses heat and cold sources of a THIC air conditioning system, comprising: a compressor ( | 05-09-2013 |
| 20130178214 | METHOD, APPARATUS, AND SYSTEM FOR PROCESSING MESSAGE - Embodiments of the present invention disclose a method, an apparatus, and a system for processing a message. The present invention relates to the field of wireless communications, and can increase the connection reestablishment success rate in a wireless communication system using an RN. The method for processing a message includes: receiving a handover request message A from an SeNB; parsing the handover request message A to obtain identity information of a reestablished cell controlled by an RN and user equipment context information prepared for the reestablished cell; and sending a first message to the RN according to the identity information of the reestablished cell, where the first message includes the user equipment context information prepared for the reestablished cell, where the user equipment context information provides a basis for the RN to prepare a connection. The present invention is mainly applicable to handover and reestablishment in a wireless communication system. | 07-11-2013 |
| 20130191916 | DEVICE AND METHOD FOR DATA MATCHING AND DEVICE AND METHOD FOR NETWORK INTRUSION DETECTION - The present invention discloses a device and method for data matching and a device and method for network intrusion detection. The method for data matching includes: searching in a regular expression set one or more complex regular expressions causing a sharp increase in number of states generated based on a regular expression during interaction; constructing a corresponding simplified expression for each complex regular expression; compiling a simplified state machine; compiling one or more substate machines, wherein each of the one or more substate machines is compiled based on a corresponding one of the one or more complex regular expressions; and matching data based on the simplified state machine and the one or more substate machines. The present invention further discloses a device for data matching employing the method for data matching and a device and method for intrusion detection employing the device and method for data matching. | 07-25-2013 |
| 20130196666 | METHOD AND APPARATUS FOR HANDOVER PREPARATION - The present invention discloses a method and an apparatus for handover preparation. The method includes: receiving, by a DeNB, a first handover request message sent by an RN; obtaining, by the DeNB, the first target cell identifier, and instructing a base station to which the first target cell belongs to perform handover preparation in the first target cell; receiving, by the DeNB, a second handover request message sent by the RN; and when a base station to which the second target cell belongs is different from the base station to which the first target cell belongs, instructing, by the DeNB, the base station to which the second target cell belongs to perform handover preparation in the second target cell. Embodiments of the present invention further disclose corresponding apparatuses. | 08-01-2013 |
| 20130295936 | Method and Device for Releasing Context-Related Resource of User Equipment - In a method for releasing the context-related resource of the user equipment includes a source intermediate node receives a control message. The control message carries an identifier of a user equipment handed over to a target access network node. The source intermediate node releases a context-related resource of the user equipment corresponding to the identifier of the user equipment. | 11-07-2013 |
| 20140156799 | Method and System for Extracting Post Contents From Forum Web Page - The present application discloses a method and a system for extracting post contents from a forum web page. The method includes: acquiring a forum web page; converting the forum web page into a DOM tree, wherein the DOM tree at least includes a root node and at least one child node attached to the root node; generating frequent patterns for the root node and the at least one child node in a one-to-one correspondence mode; determining a node corresponding to information contents in the forum web page according to a frequent pattern, satisfying a preset condition, in the frequent patterns; and extracting the information contents in the forum web page from the node corresponding to the information contents in the forum web page based on a preset common sub-tree algorithm. | 06-05-2014 |
| 20140171083 | METHOD, TERMINAL, BASE STATION, AND SYSTEM FOR ADJUSTING CONTROL PARAMETERS - The present invention discloses a method for adjusting control parameters. The method includes: when a terminal fails to be handed over from a source cell to a target cell, or when the terminal is handed over from a source cell to a target cell successfully and a radio link connection failure occurs on a radio link established between the terminal and the target cell, reestablishing, by the terminal, a radio link with a reestablished cell; and sending, by the terminal, a report message to a base station of the reestablished cell, where the report message carries moving speed information of the terminal and/or size information of the target cell. | 06-19-2014 |
| 20140289395 | NETWORK COMMENT COLLECTION METHOD AND SYSTEM - Disclosed are a network comment collection method and system. The method comprises: obtaining a web page entry link address; determining whether a web page corresponding to the web page entry link address has N network comments, N being a positive integer; when there are N network comments, determining whether M network comments among the N network comments satisfy a collection condition, M being a positive integer less than or equal to N; when there are M network comments satisfying the collection condition, collecting the M network comments. | 09-25-2014 |
| 20140362716 | METHOD, DEVICE, AND SYSTEM FOR INTER-FREQUENCY CELL MEASUREMENT - The present invention provides a method, a device, and a system for inter-frequency cell measurement. The method includes: performing, by a terminal, when receiving a measurement command of a network side device, inter-frequency cell measurement, in different cases, based on the time specified in different measurement time parameters or based on measurement time parameters corresponding to the information about an inter-frequency band. As different measurement time parameters specify different time actually used for measurement, not only an inter-frequency cell that meets a measurement event can be measured, but also the time for measurement by the terminal can be reduced, thereby reducing the power consumption of the terminal and enhancing the performance of the terminal. | 12-11-2014 |
| 20150117245 | Sending Node and Buffer Status Reporting Method - A sending node and a buffer status reporting method are disclosed. The method includes: classifying at least two RLC entities included in a sending node as at least one first RLC entity and one second RLC entity, where all the RLC entities are associated with a PDCP entity included in the sending node; and in a case in which a buffer of the first RLC entity includes to-be-sent data, generating a first buffer status report BSR based on a size of the to-be-sent data in the buffer of the first RLC entity, and sending the generated first BSR to a receiving node corresponding to the first RLC entity. By classification of the first RLC entity and the second RLC entity, the second RLC entity is exclusively associated with buffer status reporting of the PDCP entity. | 04-30-2015 |
| 20150131495 | METHOD AND SYSTEM FOR IMPLEMENTING TIME DIVISION DUPLEX CONFIGURATION OF SECONDARY SERVING CELL, AND BASE STATION - A method and a system for implementing time division duplex configuration of a secondary serving cell are provided. A primary base station receives time division duplex TDD configuration information of a secondary serving cell and an identity of the secondary serving cell from a secondary base station, where the TDD configuration information of the secondary serving cell is allocated by the secondary base station to the secondary serving cell. The primary base station sends the TDD configuration information of the secondary serving cell and the identity of the secondary serving cell to a terminal, so that the terminal determines an uplink-downlink subframe allocation of the secondary serving cell according to the TDD configuration information. | 05-14-2015 |
| 20150133135 | COUNTER CHECK AND RECONFIGURATION METHOD, APPARATUS, AND SYSTEM - The present invention relates to a counter check and reconfiguration method, apparatus, and system. The method includes: sending a second identity information and a second count information to a terminal, so that the terminal compares, according to the second identity information, the second count information with third count information maintained by the terminal itself to obtain first comparison result information or second comparison result information; receiving the first comparison result information sent by the terminal, or the second identity information and second comparison result information sent by the terminal; and determining counter check result information according to the received first comparison result information, or the received second identity information and second comparison result information. Thereby, the present invention implements a counter check process and a reconfiguration process in a network architecture in which a primary base station is separated from a secondary base station. | 05-14-2015 |
| 20150137620 | ANTI-INTERFERENCE SWITCH SIGNAL TRANSMISSION CIRCUIT - An anti-interference switch signal transmission circuit, in which a changeover contact is used at a signal terminal, wherein a normally closed contact is connected to DC−, a normally open contact is connected to DC+, and a common terminal is connected to a switch signal acquisition circuit. When no signal exists, DC− is connected to a positive input terminal of the switch signal acquisition circuit via the normally closed contact. Since a negative input terminal of the switch signal acquisition circuit is also connected to DC−, even if interference is caused, no false signal is generated. When a signal exists, the position of the changeover contact changes and DC+ is connected to DC− via the closed normally open contact through the switch signal acquisition circuit thus a loop is formed, so that the signal can be reflected. The interference problem is solved by connecting both the two terminals of the acquisition circuit to DC− when no signal exists. | 05-21-2015 |
| 20150140999 | LINK FAILURE RECOVERY METHOD AND APPARATUS - Embodiments of the present invention disclose a link failure recovery method and apparatus. The method includes: first receiving, by a primary base station, failure report information sent by a user equipment, acquiring, according to the failure report information, an identifier of a DRB that needs to be reconfigured, and reconfiguring a parameter for the DRB that needs to be reconfigured; and then sending, by the primary base station, a first reconfiguration message to the user equipment, so that the user equipment reconfigures a failed DRB according to the first reconfiguration message. The present invention is applicable to the field of communications systems. | 05-21-2015 |
| 20150146665 | METHOD, APPARATUS, DEVICE AND NETWORK SYSTEM FOR ADDING SECONDARY SERVING CELL - The present invention provides a method for adding a secondary serving cell, an apparatus, a device, and a network system. The method includes: communicating, with each other to acquire a unified serial number of a random access preamble code, a unified serial number of a PRACH mask code, and a unified cell radio network temporary identifier of a terminal; scrambling the serial number of the random access preamble code and the serial number of the PRACH mask code, and then sending the serial number of the random access preamble code and the serial number of the PRACH mask code to the terminal; and determining, a time advance command TAC according to a random access request message that carries the random access preamble code, and sending the TAC to the terminal. | 05-28-2015 |
| 20150201418 | RESOURCE RECONFIGURATION METHOD, BASE STATION, AND USER EQUIPMENT - This application discloses a resource reconfiguration method, a base station, and a user equipment. The method includes: receiving, by a primary base station, a first message, where the first message is used to request to reconfigure, for a user equipment, a resource corresponding to a secondary base station; and initiating, by the primary base station, reconfiguration of the resource corresponding to the secondary base station for the user equipment. By means of this application, the resource corresponding to the secondary base station can be reconfigured for the user equipment in a case in which the secondary base station does not provide a reconfiguration function. | 07-16-2015 |
| 20150237648 | Method for Controlling Uplink Signal Transmission and Apparatus Thereof - The invention discloses a method for controlling uplink signal transmission, a user equipment, and a base station. The method for controlling uplink signal transmission includes receiving uplink signal configuration information sent by a base station; sending an uplink signal to the base station according to the uplink signal configuration information before a first timer expires; stopping sending an uplink signal to the base station when the first timer expires; receiving trigger information sent by the base station, and restarting the first timer according to the trigger information; and sending an uplink signal to the base station before the restarted first timer expires. | 08-20-2015 |
| 20150248472 | CLUSTERING METHOD, APPARATUS, AND TERMINAL APPARATUS - A clustering method includes obtaining neighbor objects of an object to be visited. The object to be visited has a plurality of neighborhood domains. The method further includes determining whether a number of neighbor objects in at least one of the neighborhood domains is larger than or equal to a predetermined value, clustering the object to be visited into a group if the number of neighbor objects in the at least one of the neighborhood domains is larger than the predetermined value, and performing a cluster expansion on directly density-reachable objects in a predetermined neighborhood domain of the object to be visited. | 09-03-2015 |
| 20150261845 | CLUSTERING METHOD AND DEVICE - A clustering method for applying to a plurality of classes each including one or more images as objects, includes: performing an iterative merge on the classes according to inter-class Rank-Order distances; obtaining an intra-class convergence degree of each class obtained by the iterative merge, based on inter-object distances in the class; and grouping, for each class obtained by the iterative merge, objects in the class that have a distance smaller than the intra-class convergence degree of the class into a new class, thereby to perform an update on the classes. | 09-17-2015 |
| 20150262033 | METHOD AND TERMINAL DEVICE FOR CLUSTERING - Embodiments of the present disclosure disclose a method and a terminal device for clustering. The method includes: obtaining a weighted distance between two classes according to a weight coefficient corresponding to an inter-object distance with respect to all classes to be combined; determining whether there are classes that can be combined according to the weighted distance between the two classes and a preset distance threshold; combining all of the classes that can be combined respectively, when the classes that can be combined exist; returning to perform the step of obtaining the weighted distance between the two classes until the number of the classes after combined is the same as the number of the classes before combined; and obtaining a clustering result. The present disclosure improves accuracy of the clustering result. | 09-17-2015 |
| 20150264615 | DATA TRANSMISSION CONTROL METHOD, APPARATUS AND SYSTEM - A data transmission control method, apparatus and system are provided. A radio communication node receives a data packet sent by a base station, where the data packet is generated by using a Packet Data Convergence Protocol protocol data unit PDCP PDU of the base station. The radio communication node acquires the PDCP PDU, which is used as a Radio Link Control service data unit RLC SDU, in the data packet. The radio communication node sends data generated by using the RLC SDU to a user equipment, where a user plane connection is established between the radio communication node and the user equipment, and a control plane connection is established between the base station and the user equipment. | 09-17-2015 |
| Patent application number | Description | Published |
|---|
| 20100246224 | Power supply for negative voltage load - A power supply for a negative voltage load has a switch-mode power unit, a monitoring unit, a first auxiliary power unit and a second auxiliary power unit. The switch-mode power unit has a rectifying circuit, a power factor correction circuit, a DC to DC power circuit. The first auxiliary power unit is connected to output terminals of the power factor correction circuit and converts DC power to a first DC power for driving the monitoring unit. The second auxiliary power unit is connected to the negative voltage load in parallel and converts negative power from the negative voltage load to a second DC power for driving the monitoring unit when AC power is interrupted. Since the first and the second auxiliary power unit do not work at the same time, the power supply can effectively enhances the conversion efficiency of the power supply. | 09-30-2010 |
| 20110218852 | Matching of advertising sources and keyword sets in online commerce platforms - Providing online advertisements includes selecting, among a plurality of advertising sources provided by a seller, a selected plurality of advertising sources that meet a predefined condition; generating a plurality of keyword sets that correspond to the selected plurality of advertising sources; establishing a programming model according to a set of predefined constraints, wherein the programming model represents match of the selected plurality of advertising sources and the plurality of keyword sets; and determining a substantially optimal match between at least some of the plurality of advertising sources and the plurality of keyword sets by solving the programming model. | 09-08-2011 |
| 20110231399 | Clustering Method and System - The present disclosure discloses a method and system for clustering. The method includes: vectorizing a plurality of readable files to obtain a plurality of file vectors corresponding to the multiple readable files; extracting a total characteristic vector based on the file vectors; and clustering the readable files based on a ranking result of a respective similarity degree between the total characteristic vector and each of the file vectors. The present disclosure also provides a method and system for clustering webpages. An application of the methods or systems described in the present disclosure reduces the number of times of comparison of similarity degrees between file vectors, and further reduces the resulting burden on system resources. This advantageously results in reduced usage of CPU and memory, reduced run time of clustering and improved performance of clustering. | 09-22-2011 |
| 20120130804 | PREDICTION OF COST AND INCOME ESTIMATES ASSOCIATED WITH A BID RANKING MODEL - Prediction of cost and income estimates associated with a bid ranking model is disclosed, including: receiving a search keyword estimate prediction request, wherein the request comprises a search keyword, a bid price associated with the search keyword, and a prediction period; determining an average click through rate associated with the search keyword associated with the prediction period for a ranking position; determining a traffic value associated with the search keyword associated with the prediction period; determining an average cost per click associated with the search keyword associated with the prediction period for the ranking position; determining a number of impressions associated with the search keyword for the ranking position; and determining a cost estimate and an income estimate associated with the search keyword associated with the prediction period. | 05-24-2012 |
| 20120173344 | ESTIMATING BID PRICES FOR KEYWORDS - Estimating bid prices for keywords is disclosed, including: receiving a request to estimate a bid price associated with a target keyword for a bidder; determining whether the bidder has previously bid on the target keyword; in the event that the bidder has not previously bid on the target keyword, determining an estimated bid price based at least in part on a plurality of historical bid prices associated with the bidder corresponding to keywords other than the target keyword and a plurality of historical bid prices associated with other bidders corresponding to the target keyword; and in the event that the bidder has previously bid on the target keyword, determining the estimated bid price based at least on revising a current bid price associated with the request; and returning the estimated bid price associated with the target keyword. | 07-05-2012 |
| 20130144822 | Predicting A User Behavior Number of a Word - The present disclosure introduces a method, an apparatus and memory of predicting a user behavior number of a word for reducing the amount and the complexity of operation, saving the consumption of the equipment, and improving the accuracy and reliability of predictions. In an embodiment, a historical data sequence of the user behavior number of a word is converted from a time domain to a frequency domain. Based on the converted frequency domain, each estimated cycle and its effect rate value of the historical data sequence are ascertained. If the historical data sequence is stable, an average value of user behavior numbers of some historical data points before a prediction point is calculated as a user behavior number of the prediction point. Otherwise, the user behavior number is calculated based on a selected main cycle and a selected singularity. | 06-06-2013 |
| 20130254175 | RETURNING ESTIMATED VALUE OF SEARCH KEYWORDS OF ENTIRE ACCOUNT - Techniques for returning estimated value of search keywords of an entire account include, for the entire account, obtaining one or more selected search keywords and their respective forecast periods and parameter settings. An estimated value of a respective search keyword in the respective forecast period is forecasted. Based on stored historical data and parameter settings of the respective search keyword, the estimated value of the respective search keyword is modified to obtain a modified estimated value. The modified estimated value of each search keyword is added up to generate an estimated value of the entire account. The estimated value of the entire account is returned to a client terminal from which the entire account is logged in. The present disclosure modifies the respective search keyword's estimated value so that the estimated value of the entire account satisfies the expected value of the client. | 09-26-2013 |
| 20140172566 | MATCHING OF ADVERTISING SOURCES AND KEYWORD SETS IN ONLINE COMMERCE PLATFORMS - Online advertising includes: selecting, among a plurality of advertising sources provided by a seller, a selected plurality of advertising sources that meet a predefined condition; generating a plurality of keyword sets that correspond to the selected plurality of advertising sources; establishing a programming model according to a set of predefined constraints, wherein the programming model represents matches of the selected plurality of advertising sources and the plurality of keyword sets; and determining a substantially optimal match between at least some of the plurality of advertising sources and the plurality of keyword sets by finding a solution for the programming model; wherein the programming model includes an objective function subject to the set of predefined constraints, and finding a solution for the programming model includes searching to find a solution to the objective function. | 06-19-2014 |
| Patent application number | Description | Published |
|---|
| 20100208994 | Filling holes in depth maps - Various implementations relate to improving depth maps. This may be done, for example, by identifying bad depth values and modifying those values. The values may represent, for example, holes and/or noise. According to a general aspect, a segmentation is determined based on an intensity image. The intensity image is associated with a corresponding depth image that includes depth values for corresponding locations in the intensity image. The segmentation is applied to the depth image to segment the depth image into multiple regions. A depth value is modified in the depth image based on the segmentation. A two-stage iterative procedure may be used to improve the segmentation and then modify bad depth values in the improved segmentation, and iterating until a desired level of smoothness is achieved. Both stages may be based, for example, on average depth values in a segment. | 08-19-2010 |
| 20110273551 | METHOD TO CONTROL MEDIA WITH FACE DETECTION AND HOT SPOT MOTION - The invention relates to a robust method to control interactive media using gestures. A method of controlling a multimedia device, using face detection and (hot spot) motion, providing robust accuracy in issued commands, wherein the method involves the following steps: extracting a hot spot area using a current captured image (Ci), calculate and analyze the difference between the current captured image (Ci) and a previous captured image (Ci−1), resulting in Di, applying an erosion on the Di to remove small areas, applying extracted (hot spot) motion areas as masks to filter out non-hot spot area motion, add Di to build a motion image, find the largest x, y and the smallest x, y coordinates of all the detected motion connected components, denote each as Ix, Iy, sx and sy, and perform an algorithm to determine if a hand gesture represents a command to control a multimedia device. | 11-10-2011 |
| 20120019684 | Method for controlling and requesting information from displaying multimedia - The invention provides a robust method to control interactive media using gestures. A method to retrieve metadata information from a multimedia outlet device, wherein the method follows the steps: (1) extracting image hot spot areas in a current captured image using face detection, (2) detecting a human gesture directive in at least one image hot spot area using gesture recognition, (3) determining if the gesture directive matches a pre-assigned command to a rich interaction module, (4) sending a signal to a rich interaction module corresponding to the pre-assigned command detected, (5) extracting a media image hot spot area from electrical signals sent from the multimedia, (6) matching any detected human gestures in at least one image hot spot area using gesture recognition with a specific pixel on a device screen, and (7) retrieving information from metadata assigned to an area of pixels on the screen. | 01-26-2012 |
| 20120235996 | METHOD FOR DISTINGUISHING A 3D IMAGE FROM A 2D IMAGE AND FOR IDENTIFYING THE PRESENCE OF A 3D IMAGE FORMAT BY FEATURE CORRESPONDENCE DETERMINATION - A method identifies the presence of a three-dimensional (3D) image format in received image through the use of feature matching and correspondence. The received image is sampled using a candidate 3D format to generate two sub-images from the received image. Initially, these sub-images are compared to determine whether these sub-images are similar with respect to structure. If the sub-images are not similar, a new 3D format is selected and the method is repeated. If the sub-images are similar, features are detected in the two sub-images and a correspondence is formed between features that match in the two sub-images. Positional differences are computed between corresponding features. The amount and uniformity of the positional differences are then used to determine whether the format is 2D or 3D and, if 3D, which of the 3D formats was used for the received image. | 09-20-2012 |
| 20120242792 | METHOD AND APPARATUS FOR DISTINGUISHING A 3D IMAGE FROM A 2D IMAGE AND FOR IDENTIFYING THE PRESENCE OF A 3D IMAGE FORMAT BY IMAGE DIFFERENCE DETERMINATION - A method identifies the presence of a three-dimensional (3D) image format in received image through the use of image difference determination. The received image is sampled using a candidate 3D format to generate two sub-images from the received image. When the candidate 3D format is a non-blended 3D format, these sub-images are compared to determine whether these sub-images are similar with respect to structure. If the sub-images are not similar, a new 3D format is selected and the method is repeated. If the sub-images are similar, an image difference is computed between the two sub-images to form an edge map. Thicknesses are computed for the edges in the edge map. The thickness and uniformity distribution of the edges are then used to determine whether the format is 2D or 3D and, if 3D, which of the 3D formats was used for the received image. | 09-27-2012 |
| 20120308134 | REDUCING CHROMATIC ABERRATION - At least one implementation reduces chromatic aberration by aligning pixel in a color channel according to displacement from corresponding pixels in another color channel. In one particular implementation, a feature is calculated for a first block of pixels in a first color channel of an image. The feature is calculated for a second block of pixels in a second color channel of the image. Displacement is estimated between the first color channel and the second color channel by comparing the feature for the first block and the feature for the second block. At least a portion of the first color channel is aligned with at least a portion of the second color channel based on the estimated displacement. | 12-06-2012 |
| 20130002656 | SYSTEM AND METHOD FOR COMBINING 3D TEXT WITH 3D CONTENT - A method and system are defined for best positioning text in a 3D manner into associated 3D content by determining parallax information from the 3D content and by using such parallax information together with one or more requirements supplied by a user or producer for best positioning text in a 3D manner into associated 3D content. The determination of text position can be performed in real-time on the arriving image content stream as an on-line operation or in a non-real time mode on the entirety of the image content as an off-line operation. | 01-03-2013 |
| Patent application number | Description | Published |
|---|
| 20090248985 | Data Transfer Optimized Software Cache for Regular Memory References - Mechanisms are provided for optimizing regular memory references in computer code. These mechanisms may parse the computer code to identify memory references in the computer code. These mechanisms may further classify the memory references in the computer code as either regular memory references or irregular memory references. Moreover, the mechanisms may transform the computer code, by a compiler, to generate transformed computer code in which regular memory references access a storage of a software cache of a data processing system through a high locality cache mechanism of the software cache. | 10-01-2009 |
| 20090249318 | Data Transfer Optimized Software Cache for Irregular Memory References - Mechanisms are provided for optimizing irregular memory references in computer code. These mechanisms may parse the computer code to identify memory references in the computer code. These mechanisms may further classify the memory references in the computer code as either regular memory references or irregular memory references. Moreover, the mechanisms may transform the computer code, by a compiler, to generate transformed computer code in which irregular memory references access a storage of a software cache of a data processing system through a transactional cache mechanism of the software cache. | 10-01-2009 |
| 20090254711 | Reducing Cache Pollution of a Software Controlled Cache - Reducing cache pollution of a software controlled cache is provided. A request is received to prefetch data into the software controlled cache. A first designator is set for a first cache access to a first value. If there is the second cache access to prefetch, a determination is made as to whether data associated with the second cache access exists in the software controlled cache. If the data is in the software controlled cache, a determination is made as to whether a second value of a second designator is greater than the first value of the first cache access. If the second value fails to be greater than the first value, the position of the first cache access and the second cache access in a cache line is swapped. The first value is decremented by a predetermined amount and the second value is replaced to equal the first value. | 10-08-2009 |
| 20090254733 | Dynamically Controlling a Prefetching Range of a Software Controlled Cache - Dynamically controlling a prefetching range of a software controlled cache is provided. A compiler analyzes source code to identify at least one of a plurality of loops that contain irregular memory references. For each irregular memory reference in the source code, the compiler determines whether the irregular memory reference is a candidate for optimization. Responsive to identifying an irregular memory reference that may be optimized, the complier determines whether the irregular memory reference is valid for prefetching. If the irregular memory reference is valid for prefetching, a store statement for an address of the irregular memory reference is inserted into the at least one loop. A runtime library call is inserted into a prefetch runtime library to dynamically prefetch the irregular memory references. Data associated with the irregular memory references are dynamically prefetched into the software controlled cache when the runtime library call is invoked. | 10-08-2009 |
| 20090254895 | Prefetching Irregular Data References for Software Controlled Caches - Prefetching irregular memory references into a software controlled cache is provided. A compiler analyzes source code to identify at least one of a plurality of loops that contain an irregular memory reference. The compiler determines if the irregular memory reference within the at least one loop is a candidate for optimization. Responsive to an indication that the irregular memory reference may be optimized, the compiler determines if the irregular memory reference is valid for prefetching. Responsive to an indication that the irregular memory reference is valid for prefetching, a store statement for an address of the irregular memory reference is inserted into the at least one loop. A runtime library call is inserted into a prefetch runtime library for the irregular memory reference. Data associated with the irregular memory reference is prefetched into the software controlled cache when the runtime library call is invoked. | 10-08-2009 |
| 20100023700 | Dynamically Maintaining Coherency Within Live Ranges of Direct Buffers - Reducing coherency problems in a data processing system is provided. Source code that is to be compiled is received and analyzed to identify at least one of a plurality of loops that contain a memory reference. A determination is made as to whether the memory reference is an access to a global memory that should be handled by a direct buffer. Responsive to an indication that the memory reference is an access to the global memory that should be handled by the direct buffer, the memory reference is marked for direct buffer transformation. The direct buffer transformation is then applied to the memory reference. | 01-28-2010 |
| 20100088673 | Optimized Code Generation Targeting a High Locality Software Cache - Mechanisms for optimized code generation targeting a high locality software cache are provided. Original computer code is parsed to identify memory references in the original computer code. Memory references are classified as either regular memory references or irregular memory references. Regular memory references are controlled by a high locality cache mechanism. Original computer code is transformed, by a compiler, to generate transformed computer code in which the regular memory references are grouped into one or more memory reference streams, each memory reference stream having a leading memory reference, a trailing memory reference, and one or more middle memory references. Transforming of the original computer code comprises inserting, into the original computer code, instructions to execute initialization, lookup, and cleanup operations associated with the leading memory reference and trailing memory reference in a different manner from initialization, lookup, and cleanup operations for the one or more middle memory references. | 04-08-2010 |
| 20120265941 | Prefetching Irregular Data References for Software Controlled Caches - Prefetching irregular memory references into a software controlled cache is provided. A compiler analyzes source code to identify at least one of a plurality of loops that contain an irregular memory reference. The compiler determines if the irregular memory reference within the at least one loop is a candidate for optimization. Responsive to an indication that the irregular memory reference may be optimized, the compiler determines if the irregular memory reference is valid for prefetching. Responsive to an indication that the irregular memory reference is valid for prefetching, a store statement for an address of the irregular memory reference is inserted into the at least one loop. A runtime library call is inserted into a prefetch runtime library for the irregular memory reference. Data associated with the irregular memory reference is prefetched into the software controlled cache when the runtime library call is invoked. | 10-18-2012 |
| 20120303907 | Dynamically Maintaining Coherency Within Live Ranges of Direct Buffers - Reducing coherency problems in a data processing system is provided. Source code that is to be compiled is received and analyzed to identify at least one of a plurality of loops that contain a memory reference. A determination is made as to whether the memory reference is an access to a global memory that should be handled by a direct buffer. Responsive to an indication that the memory reference is an access to the global memory that should be handled by the direct buffer, the memory reference is marked for direct buffer transformation. The direct buffer transformation is then applied to the memory reference. | 11-29-2012 |
| Patent application number | Description | Published |
|---|
| 20080209193 | Manageability Extension Mechanism for System Firmware - A method and system to manage an extension mechanism for firmware is described. A firmware binary file is stored in an extension area of a storage device of a computer system. The Basic Input/Output System (BIOS) of the computer system is modified to access the stored firmware binary file stored in the extension area. In one embodiment, the computer system is Extensible Firmware Interface (EFI) compliant. | 08-28-2008 |
| 20090238203 | NETWORK INTERFACE AND DETECTION MODULE TO ENABLE NETWORK COMMUNICATION WITHIN INFORMATION HANDLING SYSTEMS - A network interface and detection module to enable network communication within information handling systems is disclosed. According to an aspect, a network interface module is disclosed. The network interface module can include a housing including a first cavity configured to receive a first network plug having a first dimension. The housing also includes a second cavity within the first cavity, and configured to receive a second network plug having a second dimension that is less than the first dimension. The network interface module can also include a network detection circuit coupled to a first terminal within the housing. The network detection circuit can enable a first network type from a plurality of network types in response to an operating state of the first network terminal. | 09-24-2009 |
| 20120106663 | METHOD FOR TRANSMITTING DATA - Embodiments in accordance with the present invention provide a method for transmitting a data frame between a battery management system (BMS) and an associated device. The battery management system is coupled to an associated device via a one-wire bi-directional communication line. The method includes obtaining a control right of the one-wire bi-directional communication line and determining a target device based on a frame header by sending the frame header of a data frame by a source device; sending a specific data byte of the data frame from the source device to the target device; checking whether an acknowledge character from the target device is received by the source device within a predetermined time period; and releasing the control right of the one-wire bi-directional communication line if the acknowledge character is received within the predetermined time period by the source device or otherwise resending the data frame. | 05-03-2012 |
| 20120112703 | System and Method for Managing a Battery - A method for managing a battery with multiple battery cells is disclosed. The method includes monitoring parameters of the battery cells by an information acquisition unit. Parameters of the battery cells include individual cell voltages. The method further includes selecting, by a controller one of multiple charging modes in which the battery cells are charged according to the cell voltages. The charging modes include a constant current charging mode, a constant voltage charging mode, and a pulse charging mode. | 05-10-2012 |
| 20120139482 | BATTERY CHARGING MANAGEMENT - A battery charging management apparatus includes an information obtaining unit and a controlling unit coupled to the information obtaining unit. The information obtaining unit obtains parameter information for temperature of a battery during a charging process performed by a charger for the battery. The controlling unit controls the charger to charge the battery based on the parameter information of the battery, so that operation of the charger conforms to a charging rule corresponding to the charging process. The controlling unit decreases a charging signal of the charger by a predetermined decrement if the temperature of the battery increases by a predefined increment. | 06-07-2012 |
| 20120165004 | METHOD AND DEVICE FOR DETECTION IN CELL RANDOM ACCESS - A method and a device for detection in cell random access are provided. The method includes: extending an original format used for a random access procedure to change a CP range defined by the original format; in the process of extracting a time-domain signal of a random access channel, extracting and splitting input data into time-domain antenna data in the original format and time-domain antenna data in an enhanced format, and performing signal extraction processing on the time-domain antenna data in the original format and the time-domain antenna data in the enhanced format respectively; and in the process of detection, detecting the time-domain antenna data in the original format and the time-domain antenna data in the enhanced format after the signal extraction processing to obtain detection information. The method can improve the performance of a BS and reduce the network construction costs without affecting an MS. | 06-28-2012 |
| 20120183002 | Network Interface and Detection Module to Enable Network Communication within Information Handling Systems - A network interface module can include a housing including a first cavity configured to receive a first network plug having a first dimension. The housing also includes a second cavity within the first cavity, and configured to receive a second network plug having a second dimension that is less than the first dimension. The network interface module can also include a network detection circuit coupled to a first terminal within the housing. | 07-19-2012 |
| 20130099726 | System and Method for Charging of Battery - A battery charging system for charging a battery with a plurality of battery cells. The battery charging system includes a battery charger and a battery management unit. The battery management unit includes a plurality of balancing circuits for controlling charging of each battery cell. The battery charging system can charge the battery in different stages depending on the voltage of each battery cell. | 04-25-2013 |
| 20130122213 | METHOD OF COATING AN INORGANIC SUBSTRATE WITH A STABLE ORGANIC LAYER - A method for coating a metallic or inorganic substrate is described, such as metal or glass supports, with an organic layer comprising conjugated diene phosphinate or phosphonate compounds. | 05-16-2013 |
| 20130274484 | AROMATIC COMPOUNDS BEARING AT LEAST ONE PHOSPHONATE OR PHOSPHINATE GROUP, PREPARATION METHOD AND USES THEREOF - An aromatic compound bearing at least a phosphonate or phosphinate group on the aromatic ring is described. Further described, is the process by which the aromatic compound is prepared, reacted with a reagent of formula (I) or (II) constituted of a diene backbone and bearing a phosphonate or phosphinate group on one of the double bonds, in the presence of a Lewis acid. | 10-17-2013 |
| 20130278219 | Battery Testing System and Control Method for Battery Testing System - Embodiments of the invention provide a battery testing system. The battery testing system includes a charger, a discharging unit, and a switch board. The switch board receives a first control signal from the control unit and controls the charger according to the first control signal, receives a first monitoring signal from the charger indicating a charging status of the battery and controls the control unit according to the first monitoring signal, receives a second control signal from the control unit and controls the discharging unit according to the control signal, and receives a second monitoring signal from the discharging unit indicating a discharging status of the battery and controls the control unit according to the second monitoring signal. The control unit is electrically isolated from the discharging unit and the charger by the switch board. Different charging/discharging equipments can be employed to test the battery. | 10-24-2013 |
| 20130335036 | BALANCE CHARGING DETECTOR - A balance charging detector is configured to detect a balance charging condition for a battery. The balance charging detector includes a controller and a comparing module. The controller is configured to monitor a status of the battery, access battery parameters for the battery that correspond to the status, and generate a group of balance charging parameters based on the battery parameters. The comparing module is configured to set a balance charging flag based on a comparison of the group of balance charging parameters and a set of thresholds. A balance charging signal can be generated if the balance charging flag is set to indicate presence of a condition to perform a balance charging of the battery. | 12-19-2013 |
| 20150263005 | Dynamic Random Access Memory (DRAM) and Production Method, Semiconductor Packaging Component and Packaging Method - A dynamic random access memory (DRAM) and a production method, a semiconductor packaging component and a packaging method. The production method of the DRAM comprises: providing a memory wafer, the memory wafer being provided with a memory bare chip, and the memory bare chip being provided with a top metal layer, the top metal layer being provided with a power source bonding pad, a signal bonding pad, and a micro bonding pad, and an internal bus led out of the memory bare chip being electrically connected to the micro bonding pad; repairing the memory wafer; if a yield of the memory wafer is greater than or equal to a preset threshold, rearranging the micro bonding pad to form a butt joint bonding pad, the butt joint bonding pad being electrically connected to the micro bonding pad and the power source bonding pad. The semiconductor packaging method comprises: providing a first wafer of the DRAM; providing a second wafer having a logic chip; realizing wafer level packaging of the first wafer and the second wafer through electrical connection of adaptive butt joint bonding pads. A structure of the DRAM is not significantly changed, a data bandwidth of the DRAM is increased, and meanwhile, a high yield is ensured. | 09-17-2015 |
| 20150271039 | Network Interface and Detection Module to Enable Network Communication within Information Handling Systems - A network interface module can include a housing including a first cavity configured to receive a first network plug having a first dimension. The housing also includes a second cavity within the first cavity, and configured to receive a second network plug having a second dimension that is less than the first dimension. The network interface module can also include a network detection circuit operatively connected to a first terminal within the housing. | 09-24-2015 |
| Patent application number | Description | Published |
|---|
| 20090144474 | Method and apparatus for providing an alternative power source for a graphics card - A method and apparatus for providing an alternative power source for a graphics card are disclosed. Specifically, one embodiment of the present invention sets forth a method, which includes the steps of laying a set of gold fingers on a printed circuit board according to an industrial standard bus interface, positioning a wire in a middle layer of the printed circuit board, attaching a first end of the wire to a specific gold finger, and attaching the alternative power source to a second end of the wire, wherein the second end of the wire is an electroplated contact protruded external to the printed circuit board. | 06-04-2009 |
| 20110116268 | LIGHT SOURCE DEVICE AND PORTABLE ELECTRONIC DEVICE USING SAME - A portable electronic device includes a housing, a display module received in the housing, and a light source device received in the housing. The light source device includes a light guiding unit, a light reflecting unit, and stimulated radiation medium positioned between the light guiding unit and the light reflecting unit. Outside light arrives at the medium through the light guiding unit and stimulates the medium to emit light, and the light emitted by the medium is reflected by the light reflecting unit to emit from the light guiding unit and illuminate the display module. | 05-19-2011 |
| 20110252249 | METHOD OF POWER SUPPLY FOR GRAPHICS CARDS - The present invention provides a method of providing power supply for graphics cards. The method according to present invention comprises making graphics cards obtain power supply from outside computer chassis. The method and devices according to present invention can resolve the issue of high cost of upgrading graphics cards to high-end graphics cards or setting new computers with high-end graphics cards. It can efficiently reduce cost of using high-end graphics cards, develop potential of high-end graphics cards to the full and bring economic benefits for the users. | 10-13-2011 |
| 20110265254 | HELMET MASSAGER AND HELMET THEREOF - A helmet massager and a helmet thereof are provided. The helmet massager comprises a helmet. The helmet comprises a first helmet body. The first helmet body comprises a first left helmet body and a first right helmet body which are butt jointed. The first left helmet body and the first right helmet body respectively have a first left rack and a first right rack. The helmet further comprises an adjusting device. The adjusting device comprises a base, a gear, a ratchet body with ratchet teeth, and a knob for driving the ratchet body to rotate. The base is located at a butt-joint site of the first left helmet body and the first right helmet body. Each of the first left rack and the first right rack engages with the gear. The ratchet body is positioned on the gear. The knob is mounted on the ratchet body. The base has a ring of locking teeth. The ratchet body has a rotating state and a rest state. When it is desired to adjust a size of a head room, the knob is turned in a forward direction or a reverse direction so that, via the ratchet body, the gear is driven by the knob to rotate. In this way, two adjacent butt-joint ends are driven by the gear to move away from or close to each other to change the size of the head room. | 11-03-2011 |
| 20120036712 | METHOD AND APPARATUS FOR PROVIDING AN ALTERNATIVE POWER SOURCE FOR A GRAPHICS CARD - A method and apparatus for providing an alternative power source for a graphics card are disclosed. Specifically, one embodiment of the present invention sets forth a method, which includes the steps of laying a set of gold fingers on a printed circuit board according to an industrial standard bus interface, positioning a wire in a middle layer of the printed circuit board, attaching a first end of the wire to a specific gold finger, and attaching the alternative power source to a second end of the wire, wherein the second end of the wire is an electroplated contact protruded external to the printed circuit board. | 02-16-2012 |
| 20120042974 | BRUSHLESS MOTOR - A brushless motor has a stator and a rotor rotatably installed inside of the stator. The stator includes a stator core with teeth protruding inwardly and windings wound on the teeth. The rotor includes a shaft, a rotor core fixed on the shaft, and a ring magnet fixed to the circumferential outer surface of the rotor core. The magnet includes a plurality of magnetic poles radially magnetized so that north poles and south poles are arranged alternately in the circumferential direction. Boundary lines between magnetic poles are skewed by an angle relative to an axis of the shaft. | 02-23-2012 |
| 20120079130 | AGENT SERVICE PROCESSING METHOD AND INTERNET PROTOCOL AGENT TERMINAL - An agent service processing method and an Internet Protocol (IP) agent terminal are provided. The method includes the following steps: receiving, by an IP agent terminal, a user side media stream sent by a user terminal through an IP network; performing audio and video processing on the user side media stream according to a control command from a computer used by an agent ; sending the processed user side media stream to an external device used by the agent, and/or sending the processed user side media stream to the computer used by the agent through a computer peripheral interface of the computer used by the agent. By using the agent service processing method and the IP agent terminal, conversation quality of an agent service is ensured, while service flexibility is considered. | 03-29-2012 |
| 20120098382 | ELECTRIC MOTOR - An electric motor, especially a brushless PMDC motor, has a stator and a rotor rotatably installed inside of the stator. The stator has a housing with an open end, an end cap fixed to the open end of the housing, a stator core fixed to an inner surface of the housing, and windings wound on the stator core. The rotor includes a plurality of permanent magnetic poles. The housing has a flange bent inwardly from the open end of the housing and abutting against the end cap inwardly and axially to thereby fix the end cap to the housing. The length of the flange measured along the circumferential direction of the housing is greater than half of that of the housing. | 04-26-2012 |
| 20120163166 | Ethernet Switch Ring (ESR) Protection Method And Transit Node - The present invention discloses an Ethernet Switch Ring (ESR) protection method, for introducing the pre-up state for the transit node, comprising, after the loop failure is recovered, the transit node on the loop will enter the pre-up state if not receiving the loop failure protocol message within the set time; and when the transit node is in the pre-up state and the loop is failed again, i.e., the transit node receives the loop failure protocol message in the pre-up state, the transit node opens the master and slave ports and refreshes the MAC address. Correspondingly, the present invention further discloses an ESR transit node. Since the pre-up state is introduced for the transit node and the transit node controls whether to open the recovered failed port by itself, the unsmooth flow caused by the master node which cannot notify the recovered failed port to open is avoided, and the ring network protection capability and user experience can be improved. | 06-28-2012 |
| 20120166915 | Method and Device for Decoding Reed-Solomon (RS) Code - The embodiments of the invention disclose a method and a device for decoding an RS code, the method comprising: receiving bit reliability information of the RS code output by a channel, performing a hard decision on the bit reliability information to obtain a hard-decision result value sequence; determining a type of an error of the hard-decision result value sequence according to an initial check array corresponding to an encoding mode of the RS code; according to preset corresponding relationships between types of errors of the hard-decision result value sequence and error-correcting modes capable of correcting the errors, determining an error-correcting mode corresponding to the type of the error of the hard-decision result value sequence, and performing a bit error correction on the hard-decision result value sequence according to the determined error-correcting mode; outputting the hard-decision result value sequence after the bit error correction as a decoding result. | 06-28-2012 |
| 20130196667 | HANDOVER METHOD AND SYSTEM IN RELAY NETWORK, RELAY NODE, CONTROL BASE STATION AND BASE STATION - Embodiments of the present invention provide a handover method and system in a relay network, a relay node, a control base station and a base station. The method includes: receiving, by a relay node, a first area identifier that identifies the relay node; sending a system information broadcast message carrying the first area identifier to a terminal in a coverage area; receiving a handover request message forwarded by a control base station; and performing, according to the handover request message, a control operation of accessing the relay node on the terminal. The first area identifier that identifies the relay node is allocated to the relay node, so that the terminal in the relay network can be normally handed over from the base station to the relay node. | 08-01-2013 |
| 20140111921 | Zr-Based Amorphous Alloy - A Zr-based amorphous alloy is provided; the formula of the Zr-based amorphous alloy is (Zr,Hf,Nb) | 04-24-2014 |
| 20140119088 | THREE-LEVEL INVERTER AND POWER SUPPLY EQUIPMENT - The present application provides a three-level inverter and power supply equipment, including: a first IGBT, where a collector thereof is connected to a positive direct current bus, an emitter thereof is connected to a first connection point, and the collector and the emitter are bridge-connected to a first freewheeling diode; a second IGBT, where a collector thereof is connected to the first connection point, an emitter thereof is connected to a second connection point, and the collector and the emitter are bridge-connected to a second freewheeling diode; a third IGBT, where a collector thereof is connected to the second connection point, an emitter thereof is connected to a third connection point, and the collector and the emitter are bridge-connected to a third freewheeling diode; a fourth IGBT, where a collector thereof is connected to the third connection point, an emitter thereof is connected to a negative direct current bus. | 05-01-2014 |
| 20140146453 | ZR-BASED AMORPHOUS ALLOY - A Zr-based amorphous alloy is provided; the formula of the Zr-based amorphous alloy is (Zr, Hf, Nb) | 05-29-2014 |
| 20140217847 | BRUSHLESS PERMANENT MAGNET MOTOR - A brushless permanent magnet electric motor ( | 08-07-2014 |
| 20140363314 | Brushless Motor - A brushless motor includes a stator comprising a stator core with teeth protruding inwardly and windings wound on the teeth, and a rotor comprising a shaft, a rotor core fixed to the shaft, and a ring magnet fixed to the circumferential outer surface of the rotor core. The ring magnet includes a plurality of magnetic poles radially magnetized so that north poles and south poles are arranged alternately in the circumferential direction, boundary lines between adjacent magnetic poles being skewed by an angle α relative to an axis of the shaft. A plurality of grooves are formed in a circumferential outer surface of the rotor core. Each groove extends from one axial end to the other axial end of the rotor core, has a circumferential width smaller than each of the magnetic poles, and is covered by the ring magnet with a void formed between the groove and the ring magnet. | 12-11-2014 |
| 20150079993 | HANDOVER METHOD AND SYSTEM IN RELAY NETWORK, RELAY NODE, CONTROL BASE STATION AND BASE STATION - Embodiments of the present invention provide a handover method and system in a relay network, a relay node, a control base station and a base station. The method includes: receiving, by a relay node, a first area identifier that identifies the relay node; sending a system information broadcast message carrying the first area identifier to a terminal in a coverage area; receiving a handover request message forwarded by a control base station; and performing, according to the handover request message, a control operation of accessing the relay node on the terminal. The first area identifier that identifies the relay node is allocated to the relay node, so that the terminal in the relay network can be normally handed over from the base station to the relay node. | 03-19-2015 |
| 20150120462 | Method And System For Pushing Merchandise Information - Method, system, and terminals for pushing merchandise information are disclosed. The method includes: at a server: receiving first identification data from a first client device, wherein the first identification data is acquired by the first client device from a first merchandise item; establishing a first association between the first merchandise item and a first user account of the first client device; generating second identification data for the first association between the first user account and the first merchandise item; receiving the second identification data from a second client device; and in response to receiving the second identification data from the second client device, establishing a second association between a second user account of the second client device, the first merchandise item, and the first user account. | 04-30-2015 |
| 20150208134 | Internet Protocol Television program search method, device and system - Provided are an IPTV program search method, device and system, and the method includes: an IPTV search server transmits, to a search template, search results corresponding to part of identifiers of M search results determined according to user search criteria carried in an initial search request; and the IPTV search server transmits, upon reception of a further search request from the search template with respect to said user search criteria, search results corresponding to part or all of identifiers of search results, of which corresponding search results have not been transmitted to the search template, to the search template, until the IPTV search server no longer receives any further search request, or until all of search results corresponding to identifiers of search results matching the user search criteria are already transmitted to the search template. | 07-23-2015 |
| 20150280535 | Permanent Magnet Brushless Motor - A permanent magnet brushless motor has a stator and a rotor. The stator has a yoke and s teeth extending from the yoke, forming a stator core, where s is an integer greater than four. Coils of a stator winding are wound about the teeth. The rotor has a shaft, a rotor core fixed to the shaft and a permanent magnet mounted to the rotor core. The permanent magnet forms p magnetic poles, where p is an even number greater than 2 but less than s. Each section of the permanent magnet corresponding to a respective magnetic pole is divided into n equal parts by n−1 magnet grooves, where n is an integer greater than 1 and p*n is an integral multiple of s. The magnet grooves significantly increase the detent torque of the motor. | 10-01-2015 |
| Patent application number | Description | Published |
|---|
| 20110320785 | Binary Rewriting in Software Instruction Cache - Mechanisms are provided for dynamically rewriting branch instructions in a portion of code. The mechanisms execute a branch instruction in the portion of code. The mechanisms determine if a target instruction of the branch instruction, to which the branch instruction branches, is present in an instruction cache associated with the processor. Moreover, the mechanisms directly branch execution of the portion of code to the target instruction in the instruction cache, without intervention from an instruction cache runtime system, in response to a determination that the target instruction is present in the instruction cache. In addition, the mechanisms redirect execution of the portion of code to the instruction cache runtime system in response to a determination that the target instruction cannot be determined to be present in the instruction cache. | 12-29-2011 |
| 20110320786 | Dynamically Rewriting Branch Instructions in Response to Cache Line Eviction - Mechanisms are provided for evicting cache lines from an instruction cache of the data processing system. The mechanisms store, for a portion of code in a current cache line, a linked list of call sites that directly or indirectly target the portion of code in the current cache line. A determination is made as to whether the current cache line is to be evicted from the instruction cache. The linked list of call sites is processed to identify one or more rewritten branch instructions having associated branch stubs, that either directly or indirectly target the portion of code in the current cache line. In addition, the one or more rewritten branch instructions are rewritten to restore the one or more rewritten branch instructions to an original state based on information in the associated branch stubs. | 12-29-2011 |
| 20110321002 | Rewriting Branch Instructions Using Branch Stubs - Mechanisms are provided for rewriting branch instructions in a portion of code. The mechanisms receive a portion of source code having an original branch instruction. The mechanisms generate a branch stub for the original branch instruction. The branch stub stores information about the original branch instruction including an original target address of the original branch instruction. Moreover, the mechanisms rewrite the original branch instruction so that a target of the rewritten branch instruction references the branch stub. In addition, the mechanisms output compiled code including the rewritten branch instruction and the branch stub for execution by a computing device. The branch stub is utilized by the computing device at runtime to determine if execution of the rewritten branch instruction can be redirected directly to a target instruction corresponding to the original target address in an instruction cache of the computing device without intervention by an instruction cache runtime system. | 12-29-2011 |
| 20110321021 | Arranging Binary Code Based on Call Graph Partitioning - Mechanisms are provided for arranging binary code to reduce instruction cache conflict misses. These mechanisms generate a call graph of a portion of code. Nodes and edges in the call graph are weighted to generate a weighted call graph. The weighted call graph is then partitioned according to the weights, affinities between nodes of the call graph, and the size of cache lines in an instruction cache of the data processing system, so that binary code associated with one or more subsets of nodes in the call graph are combined into individual cache lines based on the partitioning. The binary code corresponding to the partitioned call graph is then output for execution in a computing device. | 12-29-2011 |
| 20120198169 | Binary Rewriting in Software Instruction Cache - Mechanisms are provided for dynamically rewriting branch instructions in a portion of code. The mechanisms execute a branch instruction in the portion of code. The mechanisms determine if a target instruction of the branch instruction, to which the branch instruction branches, is present in an instruction cache associated with the processor. Moreover, the mechanisms directly branch execution of the portion of code to the target instruction in the instruction cache, without intervention from an instruction cache runtime system, in response to a determination that the target instruction is present in the instruction cache. In addition, the mechanisms redirect execution of the portion of code to the instruction cache runtime system in response to a determination that the target instruction cannot be determined to be present in the instruction cache. | 08-02-2012 |
| 20120198170 | Dynamically Rewriting Branch Instructions in Response to Cache Line Eviction - Mechanisms are provided for evicting cache lines from an instruction cache of the data processing system. The mechanisms store, for a portion of code in a current cache line, a linked list of call sites that directly or indirectly target the portion of code in the current cache line. A determination is made as to whether the current cache line is to be evicted from the instruction cache. The linked list of call sites is processed to identify one or more rewritten branch instructions having associated branch stubs, that either directly or indirectly target the portion of code in the current cache line. In addition, the one or more rewritten branch instructions are rewritten to restore the one or more rewritten branch instructions to an original state based on information in the associated branch stubs. | 08-02-2012 |
| 20120198429 | Arranging Binary Code Based on Call Graph Partitioning - Mechanisms are provided for arranging binary code to reduce instruction cache conflict misses. These mechanisms generate a call graph of a portion of code. Nodes and edges in the call graph are weighted to generate a weighted call graph. The weighted call graph is then partitioned according to the weights, affinities between nodes of the call graph, and the size of cache lines in an instruction cache of the data processing system, so that binary code associated with one or more subsets of nodes in the call graph are combined into individual cache lines based on the partitioning. The binary code corresponding to the partitioned call graph is then output for execution in a computing device. | 08-02-2012 |
| 20120204016 | Rewriting Branch Instructions Using Branch Stubs - Mechanisms are provided for rewriting branch instructions in a portion of code. The mechanisms receive a portion of source code having an original branch instruction. The mechanisms generate a branch stub for the original branch instruction. The branch stub stores information about the original branch instruction including an original target address of the original branch instruction. Moreover, the mechanisms rewrite the original branch instruction so that a target of the rewritten branch instruction references the branch stub. In addition, the mechanisms output compiled code including the rewritten branch instruction and the branch stub for execution by a computing device. The branch stub is utilized by the computing device at runtime to determine if execution of the rewritten branch instruction can be redirected directly to a target instruction corresponding to the original target address in an instruction cache of the computing device without intervention by an instruction cache runtime system. | 08-09-2012 |
