Patent application number | Description | Published |
20150229432 | FULL-DUPLEX ETHERNET COMMUNICATIONS OVER COAXIAL LINKS USING TIME-DIVISION DUPLEXING - A coax line terminal coupled to a plurality of coax network units by a coax plant uses time-division duplexing to communicate with the coax network units. In the coax line terminal, a control signal is repeatedly asserted and de-asserted. When the control signal is de-asserted, data are transmitted from the coax line terminal to the plurality of coax network units on a specified frequency band. When the control signal is asserted, transmission of the data ceases and data are received from respective coax network units on the specified frequency band. | 08-13-2015 |
20150270986 | CREDIT-BASED DYNAMIC BANDWIDTH ALLOCATION FOR TIME-DIVISION MULTIPLE ACCESS COMMUNICATIONS - A master device coupled to multiple slave devices in a system performs a method of allocating bandwidth. In the method, credits are assigned to each device of a plurality of devices in the system. Bandwidth is allocated among the plurality of devices for high-priority traffic, regardless of the credits. After allocating bandwidth for high-priority traffic, bandwidth is allocated among the plurality of devices based on the credits. A transmission schedule is generated for the plurality of devices based on the allocated bandwidth. | 09-24-2015 |
20150288452 | COORDINATION OF PHYSICAL LAYER CHANNEL BONDING - A coax line terminal includes a first media access controller (MAC) corresponding to a first group of coax network units and a second MAC corresponding to a second group of coax network units. The coax line terminal also includes a first physical media entity (PME), coupled to the first MAC, to generate signals for transmission in a first frequency band, and a second PME, coupled to the first and second MACs, to generate signals for transmission in a second frequency band. The coax line terminal further includes a PME multiplexer to control access of the first and second MACs to the second PME. | 10-08-2015 |
20150326405 | MULTICAST TRAFFIC BRIDGING - A fiber-coax unit (FCU) is coupled to an optical line terminal (OLT) and a plurality of coax network units (CNUs). The FCU receives a multicast frame from the OLT. The multicast frame includes a first multicast logical link identifier (LLID) dedicated for multicast traffic directed to CNUs. The FCU replaces the first multicast LLID in the multicast frame with a second multicast LLID corresponding to one or more multicast groups that include at least one CNU of the plurality of CNUs. The FCU transmits the multicast frame to the plurality of CNUs. | 11-12-2015 |
Patent application number | Description | Published |
20150036784 | SHIFT REGISTER UNIT, SHIFT REGISTER AND DISPLAY APPARATUS - A shift register unit, a shift register and a display apparatus, insulate a start charging capacitor from the gate of the driving transistor, and adopt a dual pulling-down structure for the gate of the driving transistor and the output terminal simultaneously thereby the transistor can be turned off normally and a leakage is prevented. The shift register unit comprises: a driving transistor (T | 02-05-2015 |
20150103037 | PIXEL CIRCUIT, DRIVING METHOD THEREOF, ORGANIC LIGHT-EMITTING DISPLAY PANEL AND DISPLAY DEVICE - Embodiments of the present disclosure provide a pixel circuit, a driving method thereof, an organic light-emitting display panel and a display device. The pixel circuit is provided with a touch sensing module, a driving transistor, a driving control module and a light-emitting module. The pixel circuit compensates for a threshold voltage of the driving transistor by a diode connection of the driving transistor and a discharging of a storage capacitor, so that a driving current of the driving transistor is independent of the threshold voltage of the driving transistor, and thus the driving currents of the OLEDs located at different positions on the organic light-emitting display panel are consistent, which can improve a brightness uniformity and a reliability of the display panel. | 04-16-2015 |
20150205429 | TOUCH DRIVER CIRCUIT, IN-CELL OPTICAL TOUCH PANEL AND DISPLAY DEVICE - The invention discloses a touch driver circuit, an in-cell optical touch panel and a display device. The touch driver circuit comprises a photosensor module, a data writing module, a driver module, and a control module. The data writing module transmits a scan signal at a scan signal terminal to the driver module under the control of the scan signal terminal. When the scan signal drives the driver module to turn on, the driver module outputs a touch sensing signal to the control module; the touch sensing signal decreases with the increase of an intensity of light irradiated on the photosensor module. Under the control of the control signal, the control module outputs the touch sensing signal output by the driver module to the touch signal sensing terminal, thereby realizing the touch sensing function. Compared with a conventional in-cell optical touch panel, the driver module transmits the touch sensing signal to the touch signal sensing terminal under the control of the control module, and in the case where touch signal sensing terminals of driver circuits of different stages are connected to the same touch signal sensing line, the cross-talk between the signals output at the touch signal sensing terminal of the driver circuits of different stages can be avoided. | 07-23-2015 |
20150220186 | ACTIVE MATRIX ORGANIC LIGHT-EMITTING DIODE PIXEL CIRCUIT, METHOD FOR DRIVING THE SAME, AND DISPLAY DEVICE - The present disclosure relates to a field of display technology, and provides an AMOLED pixel circuit, a method for driving the same, and a display device, which can improve an integration of an in-cell touch control circuit with an AMOLED driving circuit. The AMOLED pixel circuit comprises a light-emitting module, a touch control module, a control module, an output module and a driving and amplifying module. The MOLED pixel circuit provided in embodiments of the present disclosure can be used in the manufacture of the AMOLED display device. | 08-06-2015 |
20150280704 | SHIFT REGISTER, DISPLAY APPARATUS, GATE DRIVING CIRCUIT, AND DRIVING METHOD - A shift register, a display apparatus, a gate driving circuit and a driving method, the shift register comprises a plurality of stages of shift register circuits (SR | 10-01-2015 |
20150301686 | TOUCH DRIVING CIRCUIT, OPTICAL IN CELL TOUCH PANEL AND DISPLAY DEVICE - Embodiments of the present disclosure provide a touch driving circuit, an optical in cell touch panel and a display device, the touch driving circuit comprises a driving sub-module, a photosensitive sub-module, and a controlling sub-module. The photosensitive sub-module outputs a touch signal to the driving sub-module under controls of the switch signal terminal and the gate signal terminal; the driving sub-module outputs a touch sensing signal to the controlling sub-module under a control of the touch signal, and the touch sensing signal decreases as an intensity of light radiated on the photosensitive sub-module increases; and the controlling sub-module outputs the touch sensing signal to the touch signal reading terminal when the control signal terminal controls the controlling sub-module to be in a turn-on state, thus achieving the touch function. As compared with the driving circuit in the existing optical in cell touch panel, the controlling sub-module is utilized to control the driving sub-module so as to output the touch sensing signal to the touch signal reading terminal, in a case in which the touch signal reading terminals of the respective stages of the driving circuits are connected to a same touch signal reading line, a crosstalk can be prevented from occurring in the signals outputted from the different stages of the driving circuits. | 10-22-2015 |
20150364079 | SHIFT REGISTER UNIT, GATE DRIVING CIRCUIT AND DISPLAY PANEL - This disclosure provides a shift register unit comprising an access control module and a shift register module. The access control module is used for controlling access of an input signal and a reset signal. The shift register module is used for outputting the accessed input signal or reset signal under the driving of a clock signal. The access control module comprises a depletion field effect transistor. The shift register unit further comprises a connection control module arranged between the access control module and the shift register module for blocking the connection between the access control module and the shift register module when the shift register module performs outputting. By means of the design of the connection control module in this disclosure, when the shift register unit performs outputting, its high potential leakage path is blocked, so as to reduce the leakage current greatly, and ensure normal output of the shift register unit. This disclosure further provides a gate driving circuit comprising the shift register unit and a display panel comprising the gate driving circuit. | 12-17-2015 |
Patent application number | Description | Published |
20140372396 | Database System Lock Operation Method and Device - A database system lock operation method is provided that includes: acquiring, by a first processing node, a lock operand of a target lock; using, by the first processing node, the target lock to perform a lock acquiring operation on a target data object; when the lock operand meets a condition for a successful lock acquiring operation, determining, by the first processing node, that the lock acquiring operation is successful, and updating a value of a data bit that is in the lock operand and used to indicate a state of the target lock on the first processing node to a value that is used to indicate that the state of the target lock on the first processing node is lock held. Accordingly, the embodiments of the present invention further disclose a node device. The embodiments of the present invention can improve performance of a database system. | 12-18-2014 |
20150254264 | Method for Recording Transaction Log, and Database Engine - A method for recording a transaction log, and a database engine, and pertains to the field of database technologies. The method includes receiving an structured query language (SQL) request; modifying, according to the SQL request, a data page corresponding to the SQL request; generating a corresponding transaction log for the modifying; partitioning the transaction log to obtain a plurality of log segments; and writing the plurality of log segments into a plurality of log buffers, and writing the log segments in the plurality of log buffers into a log file in parallel. According to the present invention, not only lock granularities of the log buffers of the transaction log are reduced, but also a speed at which a log file is written into a magnetic disk is greatly increased, thereby improving performance of a database system and enhancing user experience. | 09-10-2015 |
20150261626 | DATA RESTORATION METHOD AND SYSTEM - Embodiments of the present invention disclose a data restoration method, including: after a transaction is submitted, saving a generated transaction log to a buffer of a current node, and backing up the transaction log to a buffer of at least one backup node except the current node; writing the transaction log saved in the buffer of the current node or the transaction log backed up in the buffer of the backup node into a transaction log file in a disk, where the transaction log file in the disk is used for restoring data of the current node; and restoring, based on the transaction log file in the disk, lost data of the current node when a data loss event occurs in the current node. By means of the present invention, a risk of system data can be reduced, and durability, safety, and reliability of the system data can be improved. | 09-17-2015 |
Patent application number | Description | Published |
20130173738 | Administering Globally Accessible Memory Space In A Distributed Computing System - In a distributed computing system that includes compute nodes that include computer memory, globally accessible memory space is administered by: for each compute node: mapping a memory region of a predefined size beginning at a predefined address; executing one or more memory management operations within the memory region, including, for each memory management operation executed within the memory region: executing the operation collectively by all compute nodes, where the operation includes a specification of one or more parameters and the parameters are the same across all compute nodes; receiving, by each compute node from a deterministic memory management module in response to the memory management operation, a return value, where the return value is the same across all compute nodes; entering, by each compute node after local completion of the memory management operation, a barrier; and when all compute nodes have entered the barrier, resuming execution. | 07-04-2013 |
20130173740 | ADMINISTERING GLOBALLY ACCESSIBLE MEMORY SPACE IN A DISTRIBUTED COMPUTING SYSTEM - In a distributed computing system that includes compute nodes that include computer memory, globally accessible memory space is administered by: for each compute node: mapping a memory region of a predefined size beginning at a predefined address; executing one or more memory management operations within the memory region, including, for each memory management operation executed within the memory region: executing the operation collectively by all compute nodes, where the operation includes a specification of one or more parameters and the parameters are the same across all compute nodes; receiving, by each compute node from a deterministic memory management module in response to the memory management operation, a return value, where the return value is the same across all compute nodes; entering, by each compute node after local completion of the memory management operation, a barrier; and when all compute nodes have entered the barrier, resuming execution. | 07-04-2013 |
Patent application number | Description | Published |
20080215563 | Pseudo-Anchor Text Extraction for Vertical Search - A search method uses pseudo-anchor text associated with search objects to improve search performance. The pseudo-anchor text may be extracted in combination with an identifier of the search objects (such as a pseudo-URL) from a digital corpus such as a collection of documents. Pseudo-anchor texts for each object are preferably extracted from candidate anchor blocks using a machine learning based approach. The pseudo-anchor texts are made available for searching and used to help ranking the objects in a search result to improve search performance. Method may be used in vertical search of objects such as published articles, products and images that lack explicit URL and anchor text information. | 09-04-2008 |
20100145956 | PSEUDO-ANCHOR TEXT EXTRACTION - A search method uses pseudo-anchor text associated with search objects to improve search performance. The pseudo-anchor text may be extracted in combination with an identifier of the search objects (such as a pseudo-URL) from a digital corpus such as a collection of documents. Pseudo-anchor texts for each object are preferably extracted from candidate anchor blocks using a machine learning based approach. The pseudo-anchor texts are made available for searching and used to help rank the objects in a search result to improve search performance. The method may be used in vertical search of objects such as published articles, products and images that lack explicit URLs and anchor text information. | 06-10-2010 |
20100281009 | HIERARCHICAL CONDITIONAL RANDOM FIELDS FOR WEB EXTRACTION - A method and system for labeling object information of an information page is provided. A labeling system identifies an object record of an information page based on the labeling of object elements within an object record and labels object elements based on the identification of an object record that contains the object elements. To identify the records and label the elements, the labeling system generates a hierarchical representation of blocks of an information page. The labeling system identifies records and elements within the records by propagating probability-related information of record labels and element labels through the hierarchy of the blocks. The labeling system generates a feature vector for each block to represent the block and calculates a probability of a label for a block being correct based on a score derived from the feature vectors associated with related blocks. The labeling system searches for the labeling of records and elements that has the highest probability of being correct. | 11-04-2010 |
20110078162 | WEB-SCALE ENTITY SUMMARIZATION - Described is a summarizing a web entity (e.g., a person, place, product or so forth) based upon the entity's appearance in web documents (e.g., on the order of hundreds of millions or billions of webpages). Webpages are separated into blocks, which are then processed according to various features to filter the number of blocks to further process, and rank the most relevant blocks with respect to the entity that remain. A redundancy removal mechanism removes redundant blocks, leaving a set of remaining blocks that are used to provide a summary of information that is relevant to the entity. | 03-31-2011 |
20110078554 | WEBPAGE ENTITY EXTRACTION THROUGH JOINT UNDERSTANDING OF PAGE STRUCTURES AND SENTENCES - Described is a technology for understanding entities of a webpage, e.g., to label the entities on the webpage. An iterative and bidirectional framework processes a webpage, including a text understanding component (e.g., extended Semi-CRF model) that provides text segmentation features to a structure understanding component (e.g., extended HCRF model). The structure understanding component uses the text segmentation features and visual layout features of the webpage to identify a structure (e.g., labeled block). The text understanding component in turn uses the labeled block to further understand the text. The process continues iteratively until a similarity criterion is met, at which time the entities may be labeled. Also described is the use of multiple mentions of a set of text in the webpage to help in labeling an entity. | 03-31-2011 |
20110251984 | WEB-SCALE ENTITY RELATIONSHIP EXTRACTION - Methods and systems for Web-scale entity relationship extraction are usable to build large-scale entity relationship graphs from any data corpora stored on a computer-readable medium or accessible through a network. Such entity relationship graphs may be used to navigate previously undiscoverable relationships among entities within data corpora. Additionally, the entity relationship extraction may be configured to utilize discriminative models to jointly model correlated data found within the selected corpora. | 10-13-2011 |
20110264658 | WEB OBJECT RETRIEVAL BASED ON A LANGUAGE MODEL - A method and system is provided for determining relevance of an object to a term based on a language model. The relevance system provides records extracted from web pages that relate to the object. To determine the relevance of the object to a term, the relevance system first determines, for each record of the object, a probability of generating that term using a language model of the record of that object. The relevance system then calculates the relevance of the object to the term by combining the probabilities. The relevance system may also weight the probabilities based on the accuracy or reliability of the extracted information for each data source. | 10-27-2011 |
20110283205 | AUTOMATED SOCIAL NETWORKING GRAPH MINING AND VISUALIZATION - The automated social networking graph mining and visualization technique described herein mines social connections and allows creation of a social networking graph from general (not necessarily social-application specific) Web pages. The technique uses the distances between a person's/entity's name and related people's/entities names on one or more Web pages to determine connections between people/entities and the strengths of the connections. In one embodiment, the technique lays out these connections, and then clusters them, in a 2-D layout of a social networking graph that represents the Web connection strengths among the related people's or entities' names, by using a force-directed model. | 11-17-2011 |
20120303557 | INTERACTIVE FRAMEWORK FOR NAME DISAMBIGUATION - A “Name Disambiguator” provides various techniques for implementing an interactive framework for resolving or disambiguating entity names (associated with objects such as publications) for entity searches where two or more same or similar names may refer to different entities. More specifically, the Name Disambiguator uses a combination of user input and automatic models to address the disambiguation problem. In various embodiments, the Name Disambiguator uses a two part process, including: 1) a global SVM trained from large sets of documents or objects in a simulated interactive mode, and 2) further personalization of local SVM models (associated with individual names or groups of names such as, for example, a group of coauthors) derived from the global SVM model. The result of this process is that large sets of documents or objects are rapidly and accurately condensed or clustered into ordered sets by that are organized by entity names. | 11-29-2012 |
20130198192 | AUTHOR DISAMBIGUATION - The techniques described herein automatically generate high precision clusters and high recall clusters for a set of documents having an author with a same or similar name. The high precision clusters and the high recall clusters can then be used in a labeling process so that efficient and accurate author disambiguation is realized. | 08-01-2013 |
20130339344 | WEB-SCALE ENTITY RELATIONSHIP EXTRACTION - Techniques for displaying a relationship graph are described herein. In one example, a search term may be used to obtain a plurality of documents from a network, such as the Internet. A plurality of entities, and relationships between at least some of those entities, may be extracted from the documents. In an example user interface, representations of a plurality of entities may be displayed, such as by shapes (e.g., circles) labeled to identify people or organizations. Edges (e.g., lines) may be used to connect different representations of entities and to thereby indicate a relationship between the connected entities. In a particular example, input from movement of a cursor over an edge may result in display of a description of a relationship between the connected entities. In a further particular example, size of each entity may be related to a number of connections each has with others. | 12-19-2013 |
20150046779 | AUGMENTING AND PRESENTING CAPTURED DATA - Captured data can be transformed and augmented for a particular presentation in a document, such as a note of a notebook application, based on an identified entity for the captured data. The particular presentation of captured data can be provided based on entity detection, extraction, and knowledge base resolution and retrieval. Methods, systems, and services are provided that identify a primary entity of an item input to a notebook application and create an entity object for the primary entity of the item at least from one or more structured representations for content associated with the item. A template for presenting the entity object can be determined according to the primary entity, where the template is selected from a set of templates corresponding to different primary entities such that an arrangement and presentation for one primary entity is different than that of another primary entity. | 02-12-2015 |
20150095316 | Web-Scale Entity Relationship Extraction - Methods and systems for Web-scale entity relationship extraction are usable to build large-scale entity relationship graphs from any data corpora stored on a computer-readable medium or accessible through a network. Such entity relationship graphs may be used to navigate previously undiscoverable relationships among entities within data corpora. Additionally, the entity relationship extraction may be configured to utilize discriminative models to jointly model correlated data found within the selected corpora. | 04-02-2015 |