Lu, San Jose
Aiguo Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140181773 | SHAPING INTEGRATED WITH POWER NETWORK SYNTHESIS (PNS) FOR POWER GRID (PG) ALIGNMENT - Embodiments are described in which shaping is integrated with power network synthesis (PNS) for power grid (PG) alignment. Specifically, some embodiments create placement constraints based on the PG that is expected to be created by PNS, and then perform shaping (or perform legalization) on the circuit design based on the placement constraints. This ensures that the physical partitions (e.g., instances of multiply-instantiated-blocks) are aligned with the power grid during shaping. | 06-26-2014 |
Cheng Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20120275667 | CALIBRATION FOR STEREOSCOPIC CAPTURE SYSTEM - Apparatus and a method for generating a rectified image. First pixel information corresponding to a first image is received from a first imager. Second pixel information corresponding to a second image is received from a second imager. A plurality of facial feature points of a portrait in each of the first and second images are identified. A fundamental matrix is generated based on the detected facial features. An essential matrix is generated based on the fundamental matrix. Rotational and translational information corresponding to the first and second imagers are generated based on the essential matrix. The rotational and translational information are applied to at least one of the first and second images to generate at least one rectified image. | 11-01-2012 |
Chen-Wei Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20160099266 | SELF-ALIGNED ISOLATION STRUCTURES AND LIGHT FILTERS - An image sensor includes a semiconductor layer with a plurality of photodiodes. A plurality of isolation structures is disposed in the back side of the semiconductor layer between individual photodiodes in the plurality of photodiodes. The plurality of isolation structures extend into the back side of the semiconductor layer a first depth and extend out of the back side of the semiconductor layer a first length. A plurality of light filters is disposed proximate to the back side of the semiconductor layer such that the plurality of isolation structures is disposed between individual light filters in the plurality of light filters. An antireflection coating is also disposed between the semiconductor layer and the plurality of light filters. | 04-07-2016 |
Chiyuan Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140070416 | GUARD RING STRUCTURE AND METHOD FOR FORMING THE SAME - A guard ring structure is provided, including a semiconductor substrate with a circuit region encircled by a first ring and a second ring. In one embodiment, the semiconductor substrate has a first dopant type, and the first and second ring respectively includes a plurality of separated first doping regions formed in a top portion of the semiconductor substrate, having a second dopant type opposite to the first conductivity type, and an interconnect element formed over the semiconductor substrate, covering the first doping regions. | 03-13-2014 |
20160105299 | Front-End Module And Coupling Compensation For Closed-Loop Digital Pre-Distortion System - Examples of front-end modules, apparatuses and methods for coupling compensation in a closed-loop digital pre-distortion (DPD) system are described. The closed-loop DPD circuit may include a PA and a loopback path. The PA may receive a PA input signal and amplify the PA input signal to provide a PA output signal proportional to a product of the PA input signal and a gain of the PA. The loopback path may receive the PA output signal to output a loopback signal. A forward coupling and a backward coupling may exist between the PA input signal and an output of the loopback path. The output of the loopback path may be proportional to a product of the PA output signal and a gain of the loopback path. The loopback path may include a coupling cancellation mechanism configured to cancel couplings between the PA input signal and the loopback signal. | 04-14-2016 |
Defeng Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100223320 | DATA DISTRIBUTION EFFICIENCY FOR ONLINE COLLABORATIVE COMPUTING SESSIONS - In one embodiment, an online collaborative computing session is initiated between a presenter device and a plurality of attendee devices via a server in a computer network. The server distributes session data from the presenter device to the plurality of attendee devices. To decrease the amount of traffic in the network, at least one of the plurality of attendee devices may be selected as a super node, where each super node is then responsible for one or more corresponding attendee devices of the session. The session data is received at the super nodes and distributed from the super node to its one or more corresponding attendee devices. | 09-02-2010 |
Ding Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20130147822 | Frame Buffer Management and Self-Refresh Control in a Self-Refresh Display System - A system and method are disclosed is to prevent the screen tearing in a video display system with self-refresh features while limiting space used for memory size in the self-refreshing sink device. A flexible method is utilized to manage a frame buffer and control self-refresh display timing to prevent screen tearing. The sink device has capabilities including one or more of self-refreshing and applying single frame updates as well as burst single frame updates while self-refresh is active. The memory utilized by the frame buffer during self-refresh is limited to less than that needed to store two full frames of video. | 06-13-2013 |
Donghui Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090093131 | Low-temperature catalyzed formation of segmented nanowire of dielectric material - The present invention discloses a method of forming a segmented nanowire including: providing a substrate; pre-cleaning the substrate; pre-treating the substrate; forming and placing a catalyst over the substrate; and forming the segmented nanowire over the catalyst with recurring pulses of plasma-enhanced chemical vapor deposition (PECVD) of a dielectric material. | 04-09-2009 |
Dyung Aina M. Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090018068 | G-protein coupled receptors - The invention provides human G-protein coupled receptors (GCREC) and polynucleotides which identify and encode GCREC. The invention also provides expression vectors, host, cells, antibodies, agonists, and antagonists. The invention also provides methods for diagnosing, treating, or preventing disorders associated with aberrant expression of GCREC. | 01-15-2009 |
20100099617 | Secreted proteins - The invention provides human secreted proteins (SECP) and polynucleotides which identify and encode SECP. The invention also provides expression vectors, host cells, antibodies, agonists, and antagonists. The invention also provides methods for diagnosing, treating, or preventing disorders associated with aberrant expression of SECP. | 04-22-2010 |
20140056906 | SECRETED PROTEINS - The invention provides human secreted proteins (SECP) and polynucleotides which identify and encode SECP. The invention also provides expression vectors, host cells, antibodies, agonists, and antagonists. The invention also provides methods for diagnosing, treating, or preventing disorders associated with aberrant expression of SECP. | 02-27-2014 |
Elaine Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140222918 | SYSTEMS AND METHODS FOR PARENTS' CONNECTION AND COMMUNICATION PLATFORM - A method implemented by a server in communication with a client for supporting an online communication platform for parents of children enrolled at a school. The method includes receiving a class search request from the client describing class search criteria. The server sends a set of virtual classes associated with the selected virtual school that match the class search criteria. The server receives a selection of a virtual class from the client where the virtual class responds to a real-world class offered during an academic term. The server adds a user as a member of the virtual class. | 08-07-2014 |
Eric Chiyuan Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090178833 | SLICED ELECTROMAGNETIC CAGE FOR INDUCTORS - A system within a circuit is disclosed. The system comprises a first shield and a device above the first shield. The system also includes a plurality of conductive walls coupled to and extending from the first shield to block electromagnetic (EM) waves to other parts of the circuit. A system and method in accordance with the present invention adds metal walls on the edge of a sliced shield. The walls block the electromagnetic wave from coupling to other parts of the circuit from a sideways direction. The use of this structure allows for more compact layout placement with insignificant degradation. | 07-16-2009 |
20090315611 | QUADRATURE MIXER CIRCUIT - A mixer is disclosed. In one embodiment, the mixer includes a polyphase filter that generates linear quadrature signals. The mixer also includes a potentiometric mixer that performs a frequency-conversion operation on the quadrature signal. According to the embodiments disclosed herein, the output of the potentiometric mixer has high linearity. | 12-24-2009 |
20110143690 | METHOD AND SYSTEM FOR INTEGRATING TRANSMIT SWITCH FUNCTIONALITY IN A WLAN RADIO TRANSCEIVER - A radio transceiver is disclosed. The transceiver comprises an integrated circuit. The integrated circuit comprises a transmit path; a first switch coupled in series with the output of the transmit path; a receive path; and a second switch coupled as a shunt with the input of the receive path. The transceiver further comprises a plurality of external matching networks coupled to the transmit and receive paths of the integrated circuit to ensure minimal loading from one path to the other. The transceiver also comprises a shared balun for converting differential signals from the plurality of external matching networks to single ended signals; and an antenna to interface with the single ended signals. A method and system in accordance with an embodiment enables tying together the transmit path and the receive paths of a radio transceiver without the need for an external T/R switch. A method and system in accordance with an embodiment minimizes the loading effects between the transmit path and the receive path such that output power and NF noise figure are not degraded after tying the transmit path and the receive path together. | 06-16-2011 |
20130033312 | SINGLE-ENDED TO DIFFERENTIAL AMPLIFIER - A circuit for single ended to differential conversion is disclosed. The circuit comprises a source for providing a single ended signal; and a transformer for receiving the single ended signal. The transformer includes first and second inductors. The first and second inductors are mutually coupled. When the operating frequency changes, a phase difference of currents flowing through the inductors changes, and therefore a phase difference between effective impedance of the first and second inductors changes to maintain a substantially 180 degree phase difference due to the mutual coupling. | 02-07-2013 |
Fei Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20120098753 | SYSTEM AND METHOD FOR PROVIDING MULTI-DIMENSIONAL TOUCH INPUT VECTOR - A touch panel method and system detects one or more touch objects placed on a surface of a touch panel and assigns consistent ID, position, size and convex contour to each touch object. The method and system allows multiple simultaneous touch objects on the touch panel to be distinguished. The touch panel includes on its periphery at least one light transmitter and at least one light sensor, each positioned around at least a portion of a perimeter of the touch panel. A processor in communication with the at least one light sensor acquires light intensity data from the sensor(s), wherein any one or more touch objects placed within a touch detectable region of the panel interrupts at least a subset of light paths between transmitter and sensor. Based on the interrupted light paths, the processor generates a touch input vector (assigned ID and spatial properties) that represents the placement of each touch object on the touch panel. | 04-26-2012 |
20140168164 | MULTI-DIMENSIONAL TOUCH INPUT VECTOR SYSTEM FOR SENSING OBJECTS ON A TOUCH PANEL - A touch panel system allows multiple simultaneous touch objects on a touch panel to be distinguished. The touch panel includes on its periphery a first plurality of light transmitters and a second plurality of light sensors, each positioned around at least a portion of a perimeter of the touch panel. A processor in communication with the at least one light sensor acquires light intensity data from the sensor(s), wherein any one or more touch objects placed within a touch detectable region of the panel interrupts at least a subset of light paths between transmitter and sensor. Based on the interrupted light paths, the processor generates a touch input vector that represents the placement of each touch object on the touch panel. | 06-19-2014 |
Frank Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20130179144 | PERFORMANCE BOTTLENECK DETECTION IN SCALABILITY TESTING - A testing system can perform scalability testing on a target system, including automatically identifying a performance bottleneck component of the target system when the target system includes multiple components. The testing system can specify a target load of a specified component of the target system. The testing system can provide a simulated request to the target system and measure performance of the target system. Based on the measurement, the testing system can determine a scaling factor. The testing system can scale up the simulated request by the scaling factor, and determine whether one or more components of the target system have reached full capacity. The testing system can then adjust the scaling factor and the simulated request, until the testing system identifies a component of the target system that is a performance bottleneck of the target system when a specific number of requests are provided. | 07-11-2013 |
20130179401 | Checkpoint Based Progressive Backup - Methods, program products, and systems for checkpoint based progressive backup are described. When a system receives a request to update a page of a storage device storing database files of a database, the system can update the page and replicate the updated page in a shadow page in a backup queue. The backup queue can store multiple shadow pages, where each updated page can correspond to at most a specified number of shadow pages in the queue. Each shadow page can be associated with a timestamp of a latest update. At pre-specified temporal checkpoints, the system can write the shadow pages in the queue to a backup file in the order of the timestamps. Upon receiving a restoration request, the system can restore the database to a state as of the time of the checkpoint using the backup file. | 07-11-2013 |
Hongbin Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20150055481 | CONTEXT-AWARE PATTERN MATCHING ACCELERATOR - Methods and systems for improving accuracy, speed, and efficiency of context-aware pattern matching are provided. According to one embodiment, a packet stream is received and pre-matched by an acceleration device with one or more conditions to identify packets meeting the one or more conditions. The acceleration device then correlates at least one identified packet based on the one or more conditions to generate matching tokens of the packet that meet the one or more conditions and sends, to one or more processors of the acceleration device, the matching tokens along with identifiers of the one or more conditions so that the processors can process the matching tokens and the identifiers of the one or more conditions based on one or more of context aware string matching, regular expression matching, and packet field value matching to extract packets that match context of the one or more conditions. | 02-26-2015 |
20150113264 | INLINE INSPECTION OF SECURITY PROTOCOLS - Systems and methods for inline security protocol inspection are provided. According to one embodiment, a security device receives an encrypted raw packet from a first network appliance and buffers the encrypted raw packet in a buffer. An inspection module accesses the encrypted raw packet from the buffer, decrypts the encrypted raw packet to produce a plain text and scans the plain text by the inspection module. | 04-23-2015 |
20150326534 | CONTEXT-AWARE PATTERN MATCHING ACCELERATOR - Methods and systems for improving accuracy, speed, and efficiency of context-aware pattern matching are provided. According to one embodiment, a packet stream is received by a first stage of a CPMP hardware accelerator of a network device. A pre-matching process is performed by the first stage to identify a candidate packet that matches a string or over-flow pattern associated with IPS or ADC rules. A candidate rule is identified based on a correlation of results of the pre-matching process. The candidate packet is tokened to produce matching tokens and corresponding locations. A full-match process is performed on the candidate packet by a second stage of the CPMP hardware accelerator to determine whether it satisfies the candidate rule by performing one or more of (i) context-aware pattern matching, (ii) context-aware string matching and (iii) regular expression matching based on contextual information, the matching tokens and the corresponding locations. | 11-12-2015 |
20160094519 | DIRECT CACHE ACCESS FOR NETWORK INPUT/OUTPUT DEVICES - Methods and systems for improving efficiency of direct cache access (DCA) are provided. According to one embodiment, a set of DCA control settings are defined by a network I/O device of a network security device for each of multiple I/O device queues based on network security functionality performed by corresponding CPUs of a host processor. The control settings specify portions of network packets that are to be copied to a cache of the corresponding CPU. A packet is received by the network I/O device. Information associated with the packet is queued onto an I/O device queue. The information is then transferred from the I/O device queue to a host memory of the network security device. Based on the control settings for the I/O device queue only those portions of the information corresponding to the one or more specified portions are copied to the cache of the corresponding CPU. | 03-31-2016 |
Jengping Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090160006 | Systems and methods for biasing high fill-factor sensor arrays and the like - A high fill-factor photosensor array is formed comprising a P-layer, an I-layer, one or more semiconductor structures adjacent to the I-layer and each coupled to a N-layer, an electrically conductive electrode formed on top of the P-layer, and an additional semiconductor structure, adjacent to the N-layer and which is electrically connected to a voltage bias source. The bias voltage applied to the additional semiconductor structure charges the additional semiconductor structure, thereby creating a tunneling effect between the N-layer and the P-layer, wherein electrons leave the N-layer and reach the P-layer and the electrically conductive layer. The electrons then migrate and distribute uniformly throughout the electrically conductive layer, which ensures a uniform bias voltage across to the entire photosensor array. The biasing scheme in this invention allows to achieve mass production of photosensors without the use of wire bonding. | 06-25-2009 |
20090160007 | Systems and Methods for biasing high fill-factor sensor arrays and the like - A high fill-factor photosensor array is formed comprising a P-layer, an I-layer, one or more semiconductor structures adjacent to the I-layer and each coupled to a N-layer, an electrically conductive electrode formed on top of the P-layer, and an additional semiconductor structure, adjacent to the N-layer and which is electrically connected to a voltage bias source. The bias voltage applied to the additional semiconductor structure charges the additional semiconductor structure, thereby creating a tunneling effect between the N-layer and the P-layer, wherein electrons leave the N-layer and reach the P-layer and the electrically conductive layer. The electrons then migrate and distribute uniformly throughout the electrically conductive layer, which ensures a uniform bias voltage across to the entire photosensor array. The biasing scheme in this invention allows to achieve mass production of photosensors without the use of wire bonding. | 06-25-2009 |
20110107928 | DIGITAL PRINTING PLATE AND SYSTEM WITH ELECTROSTATICALLY LATCHED DEFORMABLE MEMBRANES - A printing surface includes a substrate having latching electrodes on a first surface, a spacer layer on the first surface of the substrate, the spacer layer patterned to form wells such that the latching electrodes reside in the wells, a deformable membrane, the membrane having conductive regions, on the spacer layer to enclose the wells, each enclosed well and its associated region of the membrane forming a pixel membrane, and actuation circuitry to actuate the electrodes to cause selected ones of the pixel membranes to remain in a deflected state when the pixel membranes receive an impulse to return to an undeflected state. | 05-12-2011 |
Jeng Ping Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100196914 | RARE CELL DETECTION USING FLAT-PANEL IMAGER AND CHEMILUMINESCENT OR RADIOISOTOPIC TAGS - Disclosed is a method using a large area flat panel imager which is specifically adapted for rare cell detection methods. The method generally includes an imager having a sample receiving surface which can provide a digital or electronic image of a sample deposited on the surface. The method also includes a selectively positionable microscope and/or camera which are used to obtain high resolution images of the deposited samples. An electronic controller can also be used in conjunction with the imager, microscope, and/or camera to selectively position at least one of those components to focus on desired regions of the deposited sample. The noted method is particularly adapted for use with chemiluminescence or other tagging technologies. | 08-05-2010 |
20100237244 | CURRENT-ACTUATED-DISPLAY BACKPLANE TESTER AND METHOD - A backplane test system is provided that uses a pressed or deposited resistive film and infra-red (IR) imaging to visualize and quantify the current drive of pixels. In one form, the system is used for measuring organic light-emitting-diode (OLED) backplanes or other current-actuated-display (CAD) backplanes. | 09-23-2010 |
20120120332 | OPTOELECTRONIC PATTERNED TRANSIENT ELECTRODES FOR PARTICULATE MANIPULATION - An optically based transport system and method for transporting particles across a virtual electrode array are disclosed. The system comprises a photoconductor layer where optically induced electrodes are projected thereon through sequential light images in a traveling wave grid pattern in order to transport particles across the virtual electrode array with a traveling wave. | 05-17-2012 |
Jing Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140071558 | POWER MANAGEMENT FOR STORAGE DEVICE READ CHANNEL - A hard disk drive or other storage device comprises a storage medium, a read head configured to read data from the storage medium, and control circuitry coupled to the read head and configured to process data received from the read head. The control circuitry comprises read channel circuitry that includes a low-density parity check decoder or other type of decoder. | 03-13-2014 |
Jingwen Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20120166973 | PRESENTING LIST PREVIEWS AMONG SEARCH RESULTS - Systems, methods, and computer storage media having computer-executable instructions embodied thereon that facilitates the presentation of list previews among search results are provided. Upon referencing a user query that indicates a user intent to view a list, a search result within a search results page is presented that includes a list preview. Such a list preview includes at least a portion of a list within a webpage that corresponds with the search results. | 06-28-2012 |
20150278355 | TEMPORAL CONTEXT AWARE QUERY ENTITY INTENT - Systems, methods, and computer-readable storage media for detecting shifts in intent for search queries are provided. The system includes databases and servers. The databases store search logs and entity mappings. The servers merge the entity mappings with search logs, identify shifts in intent for recurring queries in the search log, identify intents for new queries in the search log, and updates mappings between an entity and a query based on the shifted intents. The server may provide client devices that display a search box where queries are entered. The search box may include an autosuggest area that is updated to include spiking entities or spiking queries. | 10-01-2015 |
Juwei Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090222388 | Method of and system for hierarchical human/crowd behavior detection - The present invention is directed to a computer automated method of selectively identifying a user specified behavior of a crowd. The method comprises receiving video data but can also include audio data and sensor data. The video data contains images a crowd. The video data is processed to extract hierarchical human and crowd features. The detected crowd features are processed to detect a selectable crowd behavior. The selected crowd behavior detected is specified by a configurable behavior rule. Human detection is provided by a hybrid human detector algorithm which can include Adaboost or convolutional neural network. Crowd features are detected using textual analysis techniques. The configurable crowd behavior for detection can be defined by crowd behavioral language. | 09-03-2009 |
Lawrence T. Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140215050 | METHOD AND SYSTEM FOR WEB ANALYTICS USING A PROXY - A method for tracking visits to a web page using a proxy is disclosed, which includes receiving a request from a web browser on a proxy for a web page hosted on a web server; sending the request for the web page from the proxy to the web server; receiving the web page from the web server on the proxy; inserting one or more web page tags into the web page to generate a modified web page, wherein the one or more web page tags generate data about traffic to the web page; forwarding the modified web page to the web browser with the one or more web page tags embedded therein; executing the one or more web page tags within the modified web page; and sending data from the executed one or more web page tags a data collection system. | 07-31-2014 |
Lixin Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20160094564 | TAXONOMIC MALWARE DETECTION AND MITIGATION - In an example, a classification engine compares two binary objects to determine whether they can be classified as belonging to a common family. As an example application, the classification engine may be used to detect malware objects derived from a common ancestor. To classify the object, the binary is disassembled and the resulting assembly code is normalized. Known “clean” functions, such as compiler-generated library code, are filtered out. Normalized blocks of assembly code may then be characterized, such as by forming N-grams, and checksumming each N-gram. These may be compared to known malware routines. | 03-31-2016 |
20160094571 | DETECTION AND MITIGATION OF MALICIOUS INVOCATION OF SENSITIVE CODE - Particular embodiments described herein provide for an electronic device that can be configured to identify regions of code to be monitored, probe and lock code pages that include the identified regions of code, and remap the code pages as execute only. The code pages can be remapped as execute only in an alternate extended page table view. | 03-31-2016 |
Lu Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140160592 | Systems and Methods for X-Sample Based Data Processor Marginalization - Systems, methods, devices, circuits for data processing, and more particularly to data processing including operational marginalization capability. | 06-12-2014 |
20140198404 | SYSTEMS AND METHODS FOR X-SAMPLE BASED NOISE CANCELLATION - Systems, methods, devices, circuits for data processing, and more particularly to cancelling noise while processing data. | 07-17-2014 |
20140254041 | Servo Marginalization - Servo channel noise limits are defined through Viterbi decisions based on servo gate signals. Y values are used to produce a first Viterbi decision at each servo gate. Viterbi decisions and Y values are used to produce ideal Y values. Y values and ideal Y values are used to produce an error value which is adjusted by a noise factor based on estimated channel characteristics. The noise value is combined with Y values and used to produce a second Viterbi decision at each servo gate. | 09-11-2014 |
20140268401 | Systems and Methods for P-Distance Based Priority Data Processing - The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for priority based data processing. | 09-18-2014 |
20140307345 | Systems and Methods for Preventing Adjacent Track Erasure - A data processing circuit includes a subtraction circuit operable to subtract an ideal version of a data pattern from a sampled version of a data pattern to yield a difference signal, an error calculation circuit operable to calculate an error between the ideal version of the data pattern and the sampled version of the data pattern based on the difference signal, and a comparator circuit operable to compare the error with a threshold value and operable to assert a track refresh signal if the error is greater than the threshold value. The track refresh signal is operable to trigger a magnetic storage device to refresh data on a data track. | 10-16-2014 |
20140334028 | Systems and Methods for Processing Data With Linear Phase Noise Predictive Filter - Systems, methods, devices, circuits for data processing, and more particularly to systems and methods for data processing with a linear phase noise predictive filter. A data processing system includes an equalizer circuit operable to filter a digital data input to yield equalized data, a linear phase noise predictive finite impulse response filter operable to filter the equalized data to yield filtered data, and a data detector circuit operable to apply a data detection algorithm to the filtered data to yield a detected output. The greatest tap coefficient for the linear phase noise predictive finite impulse response filter is at a center tap. | 11-13-2014 |
20140334281 | Systems and Methods for Data Processor Marginalization Based Upon Bit Error Rate - Systems, methods, devices, circuits for data processing, and more particularly to data processing including operational marginalization capability, and/or operational improvement capability. | 11-13-2014 |
20150062734 | Systems and Methods for Multi-Level Encoding and Decoding - A storage system includes a storage medium operable to maintain a data set, a read/write head assembly operable to write the data set to the storage medium and to read the data set from the storage medium, a multi-level encoder operable to encode the data set at a plurality of different code rates before it is written to the storage medium, and a multi-level decoder operable to decode the data set retrieved from the storage medium and to apply decoded values encoded at a lower code rate when decoding values encoded at a higher code rate. | 03-05-2015 |
20150082115 | Systems and Methods for Fragmented Data Recovery - Systems and method relating generally to data processing, and more particularly to systems and methods for fragmenting a data set and recovering the fragmented data set. | 03-19-2015 |
Luke Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20150277791 | SYSTEMS AND METHODS OF DISK STORAGE ALLOCATION FOR VIRTUAL MACHINES - A method for allocating storage for a virtual machine includes receiving a request to allocate a block of disk storage on a physical disk to a virtual disk associated with the virtual machine. The method also includes identifying a plurality of available blocks on the physical disk, each of the plurality of available blocks defining a radial distance from a center axis of a platter of the physical disk. The method further includes determining which of the plurality of available blocks has a greatest radial distance from the center axis of the platter and, based on the determining, selecting an allocation block from the plurality of available blocks, the allocation block having the greatest radial distance from the center axis of the platter. The method also includes allocating the allocation block to the virtual machine. | 10-01-2015 |
Maohua Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20130198148 | ESTIMATING DATA REDUCTION IN STORAGE SYSTEMS - Embodiments of the present invention provide a system, method and computer program products for estimating data reduction in a file system. A method includes selecting a sample of all data from data files in the file system, wherein said sample represent a subset of all the data in the file system. The method further includes estimating a data reduction ratio by data deduplication for the file system based on said sample. The method further includes estimating a data reduction ratio by data compression for the file system based said sample. The method further includes generating a combined data reduction estimate for the file system based on said data compression estimate and said data deduplication estimate. | 08-01-2013 |
20130290276 | ENHANCING PERFORMANCE-COST RATIO OF A PRIMARY STORAGE ADAPATIVE DATA REDUCTION SYSTEM - Data reduction in a storage system comprises determining attributes of data for storage in the storage system and determining expected data reduction effectiveness for the data based on said attributes. Said effectiveness indicates the benefit that data reduction is expected to provide for the data based on said attributes. The data reduction further comprises applying data reduction to the data based on the expected data reduction effectiveness and performance impact, to improve resource usage efficiency. | 10-31-2013 |
20130290277 | DEDUPLICATING STORAGE WITH ENHANCED FREQUENT-BLOCK DETECTION - Detecting data duplication comprises maintaining a fingerprint directory including one or more entries, each entry including a data fingerprint and a data location for a data chunk. Each entry is associated with a seen-count attribute which is an indication of how often the fingerprint has been seen in arriving data chunks. Higher-frequency entries in the directory are retained, while also taking into account recency of data accesses. A data duplication detector detects that the data fingerprint for a new chunk is the same as the data fingerprint contained in an entry in the fingerprint directory. | 10-31-2013 |
20140006363 | OPTIMIZED DATA PLACEMENT FOR INDIVIDUAL FILE ACCESSES ON DEDUPLICATION-ENABLED SEQUENTIAL STORAGE SYSTEMS | 01-02-2014 |
20140279927 | SCALABLE GRAPH MODELING OF METADATA FOR DEDUPLICATED STORAGE SYSTEMS - Embodiments of the invention relate to a method and computer program product for providing a scalable representation of metadata for deduplicated storage systems. The method includes identifying shared data segments that are contained in a plurality of data objects in a deduplicated storage system. A data object centric graph is generated. The generating includes creating vertices that represent the data objects and creating edges between the data objects. An edge connecting two data objects indicates that the two data objects contain at least one shared data segment in common. Each shared data segment between any two data objects is represented by at most one of the edges. At least one of the data objects is manipulated based on the data object centric graph. | 09-18-2014 |
20140358857 | DE-DUPLICATION WITH PARTITIONING ADVICE AND AUTOMATION - Migrating a sub-volume in data storage with at least two de-duplication domains, each of the domains having at least one sub-volume. A first sub-volume is assigned to a de-duplication domain and a first content summary is computed for the first sub-volume. Similarly, a second sub-volume is assigned to a second de-duplication domains and a second content summary is computed for the second sub-volume. A first content affinity is calculated between the first sub-volume and a third sub-volume, and a second content affinity is calculated between the second sub-volume and the third sub-volume. A domain placement is selected for the third sub-volume based on comparison of the first content affinity and the second content affinity. | 12-04-2014 |
20140358867 | DE-DUPLICATION DEPLOYMENT PLANNING - Assignment of files to a de-duplication domain. Address space of data files is divided into multiple containers. For each of the containers, a file metadata scan is performed to obtain file system metadata, which is aggregated and summarized in a content feature summary. A content feature summary prediction measurement is measured between containers from the generated content feature summary, and files from each container are assigned to a de-duplication domain based upon the content similarity predication measurement. | 12-04-2014 |
20140358870 | DE-DUPLICATION DEPLOYMENT PLANNING - Assignment of files to a de-duplication domain. Address space of data files is divided into multiple containers. For each of the containers, a file metadata scan is performed to obtain file system metadata, which is aggregated and summarized in a content feature summary. A content feature summary prediction measurement is measured between containers from the generated content feature summary, and files from each container are assigned to a de-duplication domain based upon the content similarity predication measurement. | 12-04-2014 |
20140359244 | DE-DUPLICATION WITH PARTITIONING ADVICE AND AUTOMATION - Migrating a sub-volume in data storage with at least two de-duplication domains, each of the domains having at least one sub-volume. A first sub-volume is assigned to a de-duplication domain and a first content summary is computed for the first sub-volume. Similarly, a second sub-volume is assigned to a second de-duplication domains and a second content summary is computed for the second sub-volume. A first content affinity is calculated between the first sub-volume and a third sub-volume, and a second content affinity is calculated between the second sub-volume and the third sub-volume. A domain placement is selected for the third sub-volume based on comparison of the first content affinity and the second content affinity. | 12-04-2014 |
20150331622 | MANAGEMENT OF SERVER CACHE STORAGE SPACE - An application server can be configured to access data stored on a networked storage server that is accessible over a network and that includes a cache device configured to store data received from the networked storage server. The application server can include a cache management module that is designed to monitor a data access requests transmitted over the network, the data access requests specifying a first page of data. In response to an indication that the requested data includes data stored in the cache device as an existing page of data, the first page of data can be mapped to a location corresponding to the existing page. | 11-19-2015 |
20150363457 | DEDUPLICATING STORAGE WITH ENHANCED FREQUENT-BLOCK DETECTION - Detecting data duplication includes maintaining a fingerprint directory including one or more entries. Each entry includes a data fingerprint and a data location for a data chunk. A shadow list including a record of fingerprint values not contained in the fingerprint directory is maintained. Each entry is associated with a seen-count attribute, which is an indication of how often a data fingerprint has been seen in arriving data chunks to be written in a storage system, and distinguishes multiply-seen entries for data fingerprints present in at least two data chunks from once-seen entries for data fingerprints present in no more than a single data chunk. Each entry retrieved from the shadow list relates to twice-seen fingerprints. | 12-17-2015 |
20160034201 | MANAGING DE-DUPLICATION USING ESTIMATED BENEFITS - A protocol is employed to estimate duplication of data in a storage system. This estimate is employed as a factor of enabling de-duplication, and if de-duplication is enabled, the data sets which will be subject to the de-duplication. The protocol includes a measurement procedure and an execution procedure. The measurement procedure characterizes data duplication in part of the data on the storage system, and the execution procedure use the characterization to adjust selection of which data sets are subject to de-duplication. | 02-04-2016 |
20160048341 | OPTIMIZED DATA PLACEMENT FOR INDIVIDUAL FILE ACCESSES ON DEDUPLICATION-ENABLED SEQUENTIAL STORAGE SYSTEMS - Data deduplication for data storage tapes includes intercepting tape control commands for a single data storage tape. The intercepted tape control commands are modified for adding processing logic and parameters for placement of deduplicated file data on the single data storage tape. Deduplication metadata is written to a metadata portion of the single data storage tape. The deduplicated file data is written to a data portion of the single data storage tape based on the placement to increase read throughput for a deduplicated set of individual files and to reduce an average number of per-file gaps on the single data storage tape without re-duplicating deduplicated data for meeting optimization of individual file accesses. | 02-18-2016 |
Mary Xiao-Hua Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100158278 | Power Management Controller for Drivers - A driver controller comprising a state machine for controlling transitions between a plurality of states. An output switch for providing a low impedance path to ground during transition periods. An output stage for decoupling output signal from driver amplifier during the transition periods. | 06-24-2010 |
20130094661 | POWER MANAGEMENT CONTROLLER FOR DRIVERS - A driver controller comprising a state machine for controlling transitions between a plurality of states. An output switch for providing a low impedance path to ground during transition periods. An output stage for decoupling output signal from driver amplifier during the transition periods. | 04-18-2013 |
Meijun Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20160133351 | CONDUCTIVE PASTE FOR A SOLAR CELL ELECTRODE - The invention relates to a conductive paste composition useful in the manufacture of photovoltaic cell electrodes, especially electrodes contacting the p-type emitter of an n-type base cell. The paste composition may comprise a source of a conductive metal, a glass frit such as a lead borate, aluminum metal powder, and a boron source that may be at least one of elemental boron, a non-oxide, boron-containing substance, or a combination thereof, all dispersed in an organic vehicle that renders the composition suitable for screen printing or other like application method. Also provided are a semiconductor device such as a photovoltaic cell having an electrode made with the paste composition, and a method for its manufacture. | 05-12-2016 |
Mike Y. Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090285719 | Compressible Transparent Sealing for Open Microplates - An apparatus for sealing a microplate, wherein the apparatus comprises a microplate having a first surface and an opposing second surface. A plurality of wells is formed in the first surface of the microplate, wherein each of the plurality of wells is sized to receive an assay therein. A sealing cover is disposed over the microplate adjacent the plurality of wells and is compliant to accommodate variations between the sealing cover and the microplate and/or distribute loads evenly therebetween. | 11-19-2009 |
20100086977 | Pressure Chamber Clamp Mechanism - In a high-density sequence detection system, an apparatus for transporting a microplate. A control system provides a thermocycler control signal to regulate a desired thermal output of a thermocycler block. A frame has a first side, a second side, and an opening that extends through the first side and the second side. A window is positioned in the opening and a circumferential seal is positioned around a periphery of the opening at the second side. The seal has a peripheral lip that seals against the microplate. A clamp is adapted to engage and displace the frame from an unclamped position to a clamped position, wherein in the unclamped position, the microplate is displaced away from the thermocycler block and in the clamped position, the clamp urges the microplate against the thermocycler block. In some embodiments the peripheral lip is positioned radially inward of the periphery of the opening. | 04-08-2010 |
Nan Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090104782 | SELECTIVE ETCHING OF SILICON NITRIDE - Methods for etching dielectric layers comprising silicon and nitrogen are provided herein. In some embodiments, such methods may include providing a substrate having a dielectric layer comprising silicon and nitrogen disposed thereon, forming reactive species from a process gas comprising hydrogen (H | 04-23-2009 |
20130214236 | USING TiON AS ELECTRODES AND SWITCHING LAYERS IN ReRAM DEVICES - A single TiON film is used to form a ReRAM device by varying the oxygen and nitrogen content throughout the device to form the electrodes and switching layer. A ReRAM device that can be formed in a single deposition chamber is also disclosed. The ReRAM device can be formed by forming a first titanium nitride layer, forming atitanium oxynitride-titanium oxide-titanium oxynitride layer, and then forming a second titanium nitride. | 08-22-2013 |
20140054531 | DEFECT ENHANCEMENT OF A SWITCHING LAYER IN A NONVOLATILE RESISTIVE MEMORY ELEMENT - Embodiments of the invention set forth a nonvolatile memory element with a novel variable resistance layer and methods of forming the same. The novel variable resistance layer includes a metal-rich host oxide that operates with a reduced switching voltage and current and requires significantly reduced forming voltage when manufactured. In some embodiments, the metal-rich host oxide is deposited using a modified atomic layer deposition (ALD) process. In other embodiments, the metal-rich host oxide is formed by depositing a metal-containing coupling layer on a host oxide and thermally processing both layers to create a metal-rich composite host oxide with a higher concentration of oxygen vacancies. | 02-27-2014 |
20140192585 | Resistive Random Access Memory Cell Having Three or More Resistive States - Provided are resistive random access memory (ReRAM) cells, each having three or more resistive states and being capable of storing multiple bits of data, as well as methods of fabricating and operating such ReRAM cells. Such ReRAM cells or, more specifically, their resistive switching layer have wide range of resistive states and are capable of being very conductive (e.g., about 1 kOhm) in one state and very resistive (e.g., about 1 MOhm) in another state. In some embodiments, a resistance ratio between resistive states may be between 10 and 1,000 even up to 10,000. The resistive switching layers also allow establishing stable and distinct intermediate resistive states that may be assigned different data values. These layers may be configured to switching between their resistive states using fewer programming pulses than conventional systems by using specific materials, switching pluses, and resistive state threshold. | 07-10-2014 |
Nghia Thuc Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20130019469 | Thin Foil Semiconductor Package - The present invention relates to methods and arrangements for using a thin foil to form electrical interconnects in an integrated circuit package. One such arrangement involves a foil carrier structure, which includes a foil adhered to a carrier having cavities. Some methods of the present invention involve attaching dice to the foil and encapsulating the foil carrier structure in a molding material. In one embodiment, the molding material presses against the foil, which causes portions of the foil to distend into the cavities of the carrier. As a result, recessed and raised areas are formed in the foil. Afterwards, the carrier is removed and portions of the raised areas in the foil are removed through one of a variety of techniques, such as grinding. This process helps define and electrical isolate contact pads in the foil. The resulting molded foil structure may then be singulated into multiple semiconductor packages. | 01-24-2013 |
Qi Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140195508 | Lateral Search - A search query is received. Personal information for a user is then determined. A search is performed in a general subdomain of general content using the search query. For example, the general subdomain of general content may be a WWW search. Then, a vertical subdomain is determined based on the personal information. A search is then performed in the vertical subdomain of specialized content using the search query. The search performed in the general subdomain and the search performed in the vertical subdomain generate general search results and vertical search results. The results may be combined and outputted to a client. | 07-10-2014 |
20140195511 | Lateral Search - A search query is received. Personal information for a user is then determined. A search is performed in a general subdomain of general content using the search query. For example, the general subdomain of general content may be a WWW search. Then, a vertical subdomain is determined based on the personal information. A search is then performed in the vertical subdomain of specialized content using the search query. The search performed in the general subdomain and the search performed in the vertical subdomain generate general search results and vertical search results. The results may be combined and outputted to a client. | 07-10-2014 |
Qinghui Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20080215176 | METHOD AND SYSTEM FOR PROVIDING AUTOMATED HIGH SCALE FABRICATION OF CUSTOM ITEMS - Method and system for providing volume manufacturing of customizable items including receiving a data package including a plurality of manufacturing parameters, each of the plurality of manufacturing parameters associated with a unique item, verifying the received data package, and implementing a manufacturing process associated with the received data package is provided. | 09-04-2008 |
20110183295 | METHOD AND SYSTEM FOR PROVIDING AUTOMATED HIGH SCALE FABRICATION OF CUSTOM ITEMS - Method and system for providing volume manufacturing of customizable items including receiving a data package including a plurality of manufacturing parameters, each of the plurality of manufacturing parameters associated with a unique item, verifying the received data package, and implementing a manufacturing process associated with the received data package is provided. | 07-28-2011 |
20110213483 | METHOD AND SYSTEM FOR PROVIDING AUTOMATED HIGH SCALE FABRICATION OF CUSTOM ITEMS - Method and system for providing volume manufacturing of customizable items including receiving a data package including a plurality of manufacturing parameters, each of the plurality of manufacturing parameters associated with a unique item, verifying the received data package, and implementing a manufacturing process associated with the received data package is provided. | 09-01-2011 |
Qinghui Peter Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100173266 | SYSTEM AND METHOD FOR AUTOMATED GENERATING OF A CUTTING CURVE ON A SURFACE - In accordance with various aspects of the present invention, a system and method for automated generating of a cutting curve on a surface is provided. In accordance with an exemplary embodiment, a computer-implemented method for automated generating of a cutting curve on a gingival surface to facilitate cutting of an aligner material comprises the defining of initial gingival curves along the line around a tooth (LAT) on a patient's jaw, including within an interproximal area between teeth. The initial gingival curves are replaced with a modified, dynamic cutting curve comprising an offset adjustment configured to minimize weakening of a region of the aligner material within the interproximal area. This process for generating a modified, dynamic cutting curve within an interproximal area can be suitably applied or continued for each of other the teeth and interproximal areas between those teeth to define a complete dynamic cutting curve. The resulting complete dynamic cutting curve can then be output for conversion into machine executable code to facilitate cutting of the aligner material. | 07-08-2010 |
Ruoyang Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20130198416 | Systems And Methods For Dynamic Priority Control - System and methods are provided for dynamically managing a first-in/first-out (FIFO) command queue of a system controller. One or more commands are received into the command queue, a command being associated with a priority parameter. A current command first in line to be executed in the command queue is determined, the current command being associated with a first priority parameter. A second command associated with a second priority parameter is determined, the second priority parameter being largest among priority parameters associated with the one or more commands. A final priority parameter for the current command is computed based at least in part on the second priority parameter. | 08-01-2013 |
Sean Shau-Tu Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140145756 | MEMORY INTERFACE CIRCUITRY WITH IMPROVED TIMING MARGINS - Integrated circuits may include memory interface circuitry that communicates with memory. The memory interface circuitry may include latch circuitry that receives a data strobe enable signal from the memory controller and latches the data strobe enable signal using a data strobe signal received from the memory. The integrated circuit may include logic circuitry that gates the data strobe signal using the latched data strobe enable signal. The logic circuitry may pass the data strobe signal in response to activation of the latched data strobe enable signal. The integrated circuit may include counter circuitry that monitors the gated data strobe signal. The counter circuitry may monitor the gated data strobe signal by counting pulses in the gated data strobe signal to produce a counter value. When the counter value reaches a target value, the logic circuitry may block the data strobe signal from passing to the memory controller. | 05-29-2014 |
Shan Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140289284 | GEOSPATIAL SMOOTHING IN WEB APPLICATIONS - A system acquires geocoded data, smoothes the geocoded data, and displays the smoothed geocoded data in a graphical visualization representative of the physical locations of the acquired geocoded data. The system obtains an indication of operational parameters for smoothing geocoded data, such as a data precision level, viewing window, data characteristics, and smoothing parameters. The system generates an area map that includes entries for each location in the viewing window (or other predetermined area) according to the data precision level. The system may populate any entries without associated data values with a zero value. To process the geocoded data, the system may determine a vector of interest from the area map and generate, for example, a single smoothing matrix that smoothes each of the values in the vector of interest. The system applies the smoothing matrix to the vector of interest. | 09-25-2014 |
Shi Da Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100028864 | REAGENTS AND METHODS FOR DETECTING NEISSERIA GONORRHOEAE - This invention provides compositions and methods for detecting | 02-04-2010 |
20110269134 | Reagents and Methods for Detecting Neisseria Gonorrhoeae - This invention provides compositions and methods for detecting | 11-03-2011 |
20120115148 | Reagents and Methods for Detecting Neisseria Gonorrhoeae - This invention provides compositions and methods for detecting | 05-10-2012 |
Shi-Da Y. Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140087371 | Compositions and Methods for Detection of Clostridium Difficile - Methods for the rapid detection of the presence or absence of | 03-27-2014 |
20150299780 | COMPOSITIONS AND METHODS FOR DETECTION OF CLOSTRIDIUM DIFFICILE - Methods for the rapid detection of the presence or absence of | 10-22-2015 |
Siqing Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090031955 | VACUUM CHUCKING HEATER OF AXISYMMETRICAL AND UNIFORM THERMAL PROFILE - Embodiments of a vacuum chuck having an axisymmetrical and/or more uniform thermal profile are provided herein. In some embodiments, a vacuum chuck includes a body having a support surface for supporting a substrate thereupon; a plurality of axisymmetrically arranged grooves formed in the support surface, at least some of the grooves intersecting; and a plurality of chucking holes formed through the body and within the grooves, the chucking holes for fluidly coupling the grooves to a vacuum source during operation, wherein the chucking holes are disposed in non-intersecting portions of the grooves. | 02-05-2009 |
20090093129 | Gas Baffle and Distributor for Semiconductor Processing Chamber - Apparatus and methods for distributing gas in a semiconductor process chamber are provided. In an embodiment, a gas distributor for use in a gas processing chamber comprises a body. The body includes a baffle with a gas deflection surface to divert the flow of a gas from a first direction to a second direction. The gas deflection surface comprises a concave surface. The concave surface comprises at least about | 04-09-2009 |
Siu-Chuang Ivan Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100167681 | INTERFERENCE-ROBUST RECEIVER FOR A WIRELESS COMMUNICATION SYSTEM - An interference-robust receiver includes an RF signal processor, a frequency conversion interface and an analog signal processor. The RF signal processor provides an RF signal. The frequency conversion interface includes a passive mixer for generating an intermediate frequency signal by down-converting an in-band part of the RF signal to a passband of a filter and down-converting an out-of-band part of the RF signal to a stopband of the filter. The filter can thus filter the intermediate frequency signal with the passband and the stopband. | 07-01-2010 |
20100279641 | RECEIVER FOR WIRELESS COMMUNICATION SYSTEM - One exemplary receiver for a wireless communication system includes a plurality of signal processing components arranged to generate a receiver output according to a radio frequency (RF) signal. The signal processing components include amplifiers having a class-AB biased amplifier included therein. The signal processing components are disposed in a chip, and the class-AB biased amplifier is an amplifier which processes a signal corresponding to the RF signal before any other amplifier included in the chip. Another exemplary receiver for a wireless communication system includes an RF signal processor and a frequency conversion interface. The RF signal processor is to generate an RF signal, and has a class-AB biased amplifier arranged to apply amplification upon the RF signal. The frequency conversion interface is coupled to the RF signal processor, and used for receiving the RF signal generated from the RF signal processor and generating a down-converted result of the RF signal. | 11-04-2010 |
20110230151 | FREQUENCY-SELECTIVE CIRCUIT WITH MIXER MODULE IMPLEMENTED FOR CONTROLLING FREQUENCY RESPONSE, AND RELATED SIGNAL PROCESSING APPARATUS AND METHOD - A frequency-selective circuit includes a signal input port, a signal output port, and a frequency response control block. The frequency response control block includes a mixer module and a filter module. The mixer module has a first port electrically connected to a signal path between the signal input port and the signal output port, a second port electrically connected to the filter module, and a local oscillator (LO) port. The mixer module operates according to an LO input received by the LO port. The filter module is electrically connected to the second port of the mixer module. | 09-22-2011 |
20110287729 | WIRELESS COMMUNICATION RECEIVER HAVING ONE SIGNAL PROCESSING CIRCUIT WHOSE OPERATION MODE IS ADJUSTED BY MONITORING SIGNAL LEVEL OF SPECIFIC SIGNAL OF PRECEDING SIGNAL PROCESSING CIRCUIT AND RELATED WIRELESS COMMUNICATION METHOD - A wireless communication receiver includes a first signal processing circuit, a second signal processing circuit, and a detecting circuit. The first signal processing circuit generates a first processed signal by processing a received radio frequency (RF) signal. The second signal processing circuit is coupled to the first signal processing circuit. The detecting circuit monitors a specific signal of the first signal processing circuit and generates at least a control signal to the second signal processing circuit in response to a signal level of the monitored specific signal. The control signal controls the second signal processing circuit to switch from a first operation mode to a second operation mode. | 11-24-2011 |
20130187718 | AMPLIFIER CIRCUIT AND METHOD FOR IMPROVING THE DYNAMIC RANGE THEREOF - The invention provides an amplifier circuit. In one embodiment, the amplifier circuit includes a first class-AB amplifier and a second class-AB amplifier. The first class-AB amplifier amplifies an input signal to generate the first output signal. The second class-AB amplifier amplifies the first output signal to generate a final output signal on an output node. When the power of the input signal is greater than a threshold level, the second class-AB amplifier is in a turned-off state during a turned-on duration period of the first class-AB amplifier, and the first class-AB amplifier is in a turned-off state during a turned-on duration period of the second-class AB amplifier. | 07-25-2013 |
20130188755 | RECEIVER - A receiver includes a low noise amplifier (LNA), a passive mixer, a passive filter, a baseband processing block and a voltage controller. The LNA receives and amplifies a radio frequency (RF) signal. The passive mixer is coupled to the LNA without any AC coupling capacitance therebetween, and generates an intermediate frequency signal by down-converting the RF signal. The passive filter filters the intermediate frequency signal. The baseband processing block includes a transimpedance amplifier (TIA) and processes the filtered intermediate frequency signal. The voltage controller keeps a first node and a second node of a signal path to be around a common DC voltage, wherein the first node is located between an output terminal of the LNA and an input terminal of the passive mixer, and the second node is located between an output terminal of the passive mixer and an output terminal of the TIA. | 07-25-2013 |
20140335810 | RECEIVER FOR WIRELESS COMMUNICATION SYSTEM - One exemplary receiver for a wireless communication system includes signal processing components arranged to generate a receiver output according to a radio frequency (RF) signal. The signal processing components include amplifiers having a class-AB biased amplifier included therein. The signal processing components are disposed in a chip, and the class-AB biased amplifier is an amplifier which processes a signal corresponding to the RF signal before any other amplifier included in the chip. The class-AB biased amplifier has a first amplifier block, a bias circuit and a second amplifier block. The first amplifier block is arranged to receive an input at the input port and generating a first output. The bias circuit is arranged to bias the first amplifier block for a class-AB operation. The second amplifier block is arranged to generate an output at the output port according to the first output. | 11-13-2014 |
20150063510 | COMMUNICATION UNIT AND SLICED RADIO FREQUENCY MODULE THEREFOR - A communication unit includes at least one divider module arranged to receive a radio frequency (RF) signal and output a divided representation of the RF signal, and a plurality of sliced RF modules. Each of the plurality of sliced RF modules includes: an input for receiving a clock signal; a timing synchronisation module arranged to receive the divided representation of the RF signal and synchronise the divided representation of the RF signal to the clock signal, across the plurality of sliced RF modules; and at least one logic module operably coupled to the timing synchronisation module and arranged to receive the clock signal and a synchronised output from the timing synchronisation module. A combiner port is arranged to couple a number of synchronised outputs from the plurality of sliced RF modules. | 03-05-2015 |
20150065194 | FREQUENCY AND PHASE CONVERSION CIRCUIT, WIRELESS COMMUNICATION UNIT, INTEGRATED CIRCUIT AND METHOD THEREFOR - A frequency and phase conversion circuit and wireless communication unit for supporting a plurality of different duty cycles is described. The frequency and phase conversion circuit comprises: a local oscillator module comprising a plurality of frequency conversion modules arranged to receive at least one input clock signal wherein a plurality of phases of the at least one input clock signal are selectable to support a plurality of different duty cycle clock signals; and at least one frequency conversion module comprising a plurality of mixer arrangements configured to receive at least one baseband input signal and the selected plurality of phases of the at least one input clock signal and output a frequency and phase converted representation of the at least one baseband input signal, wherein at least one of the plurality of mixer arrangements is re-used in a plurality of the selectable supportable duty cycles. | 03-05-2015 |
Tongxin Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100118308 | Composite Optical Focusing Devices - The present invention is an optical system, comprising: a light source for providing light rays; a combined two or more parabolic reflectors or elliptical reflectors having inner reflecting surfaces, wherein the reflectors sharing a common focal point, and a device-under-test is disposed thereabout the focal point; wherein the collimated light rays coming into the parabolic reflector parallel to the axis of symmetry of each parabolic reflector would be directed to the focal point on the surface of the device-under-test. The reflected light rays from the device-under-test are directed by the other parabolic reflectors along the axes of symmetry of each parabolic reflector and generate information indicative of the device-under-test; wherein the reflected light rays exit the reflector; and a detector for receiving the exited light rays. | 05-13-2010 |
Wenhu Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090046579 | Lesser disruptive open shortest path first handling of bidirectional forwarding detection state changes - A method and apparatus for processing link down events associated with links between adjacent nodes is described. A node receives link down events associated with a link fault protocol for a link between the node and a neighboring node. In response to receiving the link down event, the node removes a data structure associated with the neighboring node from a forwarding table associated with a routing protocol running on the node. The node reserves the data structure for speedy adjacency recovery. In addition, the node places the neighboring node in the initialize state of the routing protocol. | 02-19-2009 |
20090285101 | Method and Apparatus for Dynamically Runtime Adjustable Path Computation - A method and apparatus for performing a dynamically runtime adjustable constrained shortest path first (CSPF) computation of a label switched path (LSP) is described. In one embodiment of the invention, a network element acting as a source of the LSP receives a request to compute the LSP which includes one or more traffic engineering constraints. If the request includes at least one additive constraint, the network element performs a CSPF calculation. If the request does not include an additive constraint, the network element prunes each link that does not satisfy each of the constraints, and prunes those links whose paths converge at an intermediary network element according to cost, calculates a path to the destination according to cost. Other methods and apparatuses are also described. | 11-19-2009 |
20090285208 | Method and Apparatus for Performing a Constraint Shortest Path First Computation - A method and apparatus for performing a constrained shortest path first (CSPF) computation is described. In one embodiment of the invention, the network element receives a request with one or more exclusion constraints or a path re-optimization request. The network element marks one or more attribute bits in a traffic engineering data structure based on the request. If an exclusion bit is set for a link, that link is skipped during CSPF computation. If a re-optimization bit is set for a link, the allocated bandwidth of the link is added to the advertised bandwidth of the link to form a re-optimization comparison value, which is used for a bandwidth comparison during path re-optimization. | 11-19-2009 |
20100226382 | LDP IGP Synchronization for Broadcast Networks - A network element that has a broadcast interface to a broadcast network becoming operational determines whether at least one alternate path exists to the broadcast network. The broadcast interface is to carry traffic on a label switched path. If an alternate path exists, the broadcast interface will not be advertised to the broadcast network until label distribution protocol (LDP) is operational with all neighbors on the broadcast interface. | 09-09-2010 |
20110044330 | Link State Identifier Collision Handling - Methods and apparatus for a network element to handle LSID collisions to prevent different LSAs associated with different routes from sharing the same LSID. According to one embodiment, responsive to determining that a tentative LSID that is generated for a first route that is being added collides with an LSID that is assigned to an LSA for a second route, and that one of the first and second routes is a host route, the host route is suppressed. If the first route is the host route, suppressing includes not originating an LSA for the first route. If the second route is the host route, suppressing includes purging the LSA for the second route and not originating an LSA for the second route. Although the host route is suppressed, network reachability of the range subsuming the host route is provided through the route that is not the host route. | 02-24-2011 |
20110044348 | LDP IGP SYNCHRONIZATION FOR BROADCAST NETWORKS - A method and apparatus for LDP-IGP synchronization for broadcast networks. In one embodiment of the invention, responsive to a network element bringing up an adjacency with a Designated Router of the broadcast network on a broadcast interface, that network element advertises in its Link State Advertisement (LSA) a peer-to-peer (P2P) adjacency to each member of the broadcast network that has bidirectional IGP communication with the network element instead of advertising a pseudo-node adjacency to the pseudo-node of the broadcast network. Each P2P adjacency includes a high cost to discourage use of those links for transit traffic. After LDP becomes operational with all neighbors on the broadcast interface, the network element advertises the pseudo-node adjacency instead of the P2P adjacencies. Accordingly, transit traffic is avoided through that network element until LDP is operational with all neighbors on the broadcast interface. | 02-24-2011 |
20110110226 | Disjoint Path Computation Algorithm - A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP. | 05-12-2011 |
20120069740 | Relayed CSPF Computation for Multiple Areas and Multiple Autonomous Systems - Computing a constraint-based label switched path (LSP) that spans multiple areas is described. In one embodiment, a router in a first one of the multiple areas computes a path segment that meets a set of one or more constraints to at least one border router of the first area that lies in a path necessary to reach the destination. The router transmits a path computation request message to a path computation element (PCE) in a second one of the areas, which includes a set of one or more attributes for each computed path segment that are used by the PCE to compute one or more path segments towards the destination of the constraint-based LSP. The router receives a path computation reply message from the PCE that specifies a set of one or more computed path segments that meet the set of constraints and that were computed by one or more PCEs downstream from the router. The router stitches at least one of the set of computed path segments that are specified in the path computation reply message with the path segment computed by the router to form at least part of the constraint-based LSP. | 03-22-2012 |
20120075986 | Fast Flooding Based Fast Convergence Architecture - Fast flooding based fast convergence to recover from a network failure. A router detects a network failure, and responsive to that failure, transmits a fast failure notification message to a set of one or more routers. The fast failure notification message includes information that identifies the network failure and also indicates that the fast failure notification message is to be flooded by the set of routers independently of convergence. The router updates a routing table to reflect the network failure. The transmission of the fast failure notification message is performed prior to completion of the routing table update to reflect the network failure. | 03-29-2012 |
20120075988 | FAST FLOODING BASED FAST CONVERGENCE TO RECOVER FROM NETWORK FAILURES - A router detects a network failure and responsive to that failure, floods a fast failure notification message out a set of interfaces of the router. The fast failure notification message includes information that identifies the network failure and includes as its source MAC (Media Access Control) address a MAC address that is assigned to an interface that is coupled with the detected network failure and is not part of the set of interfaces of the router. The router updates a routing table to reflect the network failure. The flooding of the fast failure notification message is performed prior to completion of the routing table update to reflect the network failure. | 03-29-2012 |
20120120847 | LDP IGP SYNCHRONIZATION FOR BROADCAST NETWORKS - A network element that has a broadcast interface to a broadcast network becoming operational determines whether at least one alternate path exists to the broadcast network. The broadcast interface is to carry traffic on a label switched path. If an alternate path exists, the broadcast interface will not be advertised to the broadcast network until label distribution protocol (LDP) is operational with all neighbors on the broadcast interface. | 05-17-2012 |
20120147888 | MANAGING STALE ROUTE REMOVAL IN A ROUTING INFORMATION BASE OF A NETWORK ELEMENT - A network element of a communications network includes a fresh route queue, a stale route queue, a Routing Information Base (RIB), a network interface, and a routing protocol module. The network interface receives link state information from other network elements. The routing protocol module determines a plurality of routes from the link state information. The routing protocol module identifies among the plurality of routes a subset of routes that are present in the stale route queue, adds the subset of routes to the fresh route queue, and deletes the subset of routes from the stale route queue. The routing protocol module then remove routes in the RIB that correspond to any routes remaining in the stale route queue, and moves the routes from the fresh route queue to the stale route queue. Related methods for managing routes in a RIB of a network element are disclosed. | 06-14-2012 |
20120213063 | Disjoint Path Computation Algorithm - A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP. | 08-23-2012 |
20130003731 | Link State Identifier Collision Handling - Methods and apparatus for a network element to handle LSID collisions to prevent different LSAs associated with different routes from sharing the same LSID. According to one embodiment, responsive to determining that a tentative LSID that is generated for a first route that is being added collides with an LSID that is assigned to an LSA for a second route, and that one of the first and second routes is a host route, the host route is suppressed. If the first route is the host route, suppressing includes not originating an LSA for the first route. If the second route is the host route, suppressing includes purging the LSA for the second route and not originating an LSA for the second route. Although the host route is suppressed, network reachability of the range subsuming the host route is provided through the route that is not the host route. | 01-03-2013 |
20130021943 | METHODS AND NETWORK ELEMENTS OPERABLE TO SPECIFY AND DETERMINE COMPLETE SETS OF LINK STATE MESSAGES FOR LINK STATE ROUTING PROTOCOLS - A method, performed by a transmitter network element utilizing a link state routing protocol which has a maximum link state message size. The method is for providing information to avoid a disruption in data forwarding that would result from a receiver network element performing preferred route computations based on an incomplete set of link state messages. The method includes generating a complete set of link state messages having information indicating that the link state messages are the complete set of the link state messages. The complete set of the link state messages are collectively coherent with a link state of the transmitter network element. The method also includes transmitting the complete set of the link state messages, and the information indicating that the link state messages are the complete set of the link state messages, to a network. Also disclosed are transmitter network elements, receiver network elements, and methods thereof. | 01-24-2013 |
20130070604 | OPEN SHORTEST PATH FIRST (OSPF) NONSTOP ROUTING (NSR) WITH LINK DERIVATION - OSPF NSR with link derivation synchronization is described. When a network element having an active OSPF instance and a standby OSPF instance attempts to create a FULL adjacency with a neighbor network element using a neighbor data structure of the active OSPF instance, and if and when a switch causes the second OSPF instance to act as the active OSPF instance, neighbor information is retrieved from the LSAs of the standby OSPF instance and a link is derived between the network element and the neighbor network element based on the retrieved neighbor information. In one embodiment, the standby OSPF instance retrieves virtual neighbor information from its LSAs and derives a virtual link between the network element and the neighbor network element based on the retrieved virtual neighbor information without having to synchronize the neighbor information between the active and standby OSPF instance. | 03-21-2013 |
20130070637 | OSPF NON-STOP ROUTING WITH RELIABLE FLOODING - A network element is configured for open shortest path first (OSPF) non-stop routing (NSR) with reliable flooding. An active OSPF instance determines to flood a link-state advertisement (LSA). The LSA is synchronized with a backup OSPF instance including storing the LSA with a status that indicates that flooding is pending. The active OSPF instance attempts to reliably flood the LSA to a set of adjacent network elements of the flooding scope of the LSA. If flooding of the LSA completes, the active OSPF instance causes the backup OSPF instance to alter the status of the LSA to indicate that flooding is complete. If the backup OSPF instance becomes the currently active OSPF instance prior to the flooding of the LSA completing, then the new active OSPF instance attempts to reliably flood the LSA. | 03-21-2013 |
20130073741 | OSPF NSR WITH DELAYED NEIGHBOR SYNCHRONIZATION - A network element attempts to bring up an adjacency with a neighbor using a neighbor state machine (NSM) of an active OSPF instance, including: maintaining a neighbor data structure only in the active instance prior to the NSM transitioning to a Full state, delaying synchronization from the active instance to a standby OSPF instance of the neighbor data structure, maintaining tracking information of the NSM in only the active instance; installing LSAs received from the neighbor in both the LSDB of the active and standby instances, and, if and when the NSM of the active instance transitions to the Full state and all LSAs requested from the neighbor during database exchange are ensured to synchronize to the standby instance's LSDB, synchronizing from the active instance to the standby instance data item(s) of the neighbor data structure. | 03-21-2013 |
20130083692 | OSPF NONSTOP ROUTING SYNCHRONIZATION NACK - A network element is configured for synchronizing dynamic OSPF data between an active OSPF instance and a backup OSPF instance. Upon an OSPF data synchronization event, the active OSPF instance synchronizes dynamic OSPF data with the backup OSPF instance. Upon receiving the dynamic OSPF data, the backup OSPF instance determines whether the requisite data structures exist. If the data structures do not exist, the backup OSPF instance returns a NACK to the active OSPF instance and clears its dynamic OSPF data. Responsive to receiving the NACK, the active OSPF instance resynchronizes its dynamic OSPF data with the backup OSPF instance. | 04-04-2013 |
20130083801 | OSPF NONSTOP ROUTING (NSR) SYNCHRONIZATION REDUCTION - A network element is configured to reduce the synchronization costs for implementing Open Shortest Path First (OSPF) Nonstop routing (NSR). The reduced synchronization costs are achieved by reducing the number of acknowledgement messages that are needed to be sent though reliable inter-process communication (IPC) between the active OSPF instance and the standby OSPF instance. The number of acknowledgement messages is reduced by tracking the link state advertisements (LSAs) that have been sent by the active OSPF instance to the standby OSPF instance and by the standby OSPF replying with an acknowledgement of only the last LSA in a group of LSAs received from the active OSPF instance, where the group can have a variety of boundaries such as a group of LSAs in an IPC message. This avoids having a significant number of acknowledgement messages sent through the IPC. | 04-04-2013 |
20130083802 | OSPF NON-STOP ROUTING FROZEN STANDBY - Open Shortest Path First (OSPF) Non-stop Routing (NSR) with frozen standby LSDB is described. A network element includes a first OSPF instance initially acting as an active OSPF instance and a second OSPF instance initially acting as a standby OSPF instance. The second OSPF instance receives LSAs from the first OSPF instance and installs the LSAs in its LSDB. The LSAs in the LSDB are only aged by the active OSPF instance. If and when the second OSPF instance becomes the active OSPF instance, the second OSPF instance then ages the LSAs in the LSDB and processes each of the LSAs according to the aging of that LSA, where processing includes one of purging that LSA and refreshing that LSA. | 04-04-2013 |
20140146661 | METHOD AND APPARATUS FOR FACILITATING PROCESS RESTART IN AN IS-IS SYSTEM - A method and apparatus for facilitating process restart in an IS-IS router that includes an active router processor (RP) module for supporting an active IS-IS process instance and standby router processor (RP) module for supporting a standby IS-IS process instance. Routing database information maintained by the active IS-IS process is synchronized to a standby database associated with the standard IS-IS process instance, which is used for synchronizing a new database on the active RP module. When a new instance of the active IS-IS process is restarted on the active RP module, the new instance uses the contents of the new database for continuing to maintain routing functionality. | 05-29-2014 |
20140146821 | METHOD AND APPARATUS FOR PROTOCOL DATA UNIT SYNCHRONIZATION IN AN IS-IS SYSTEM - A method and apparatus for effectuating synchronization of local LSPs and remote LSPs in an IS-IS router that includes an inter-process communication module disposed between an active router processor (RP) module and standby router processor (RP) module. Both remote LSP update(s) received by an active IS-IS process and local LSP update(s) generated by the active IS-IS process running on the IS-IS router are synchronized to corresponding database portions associated with a standby IS-IS process of the IS-IS router using respective raw LSPs. | 05-29-2014 |
20140146828 | LDP IGP SYNCHRONIZATION FOR BROADCAST NETWORKS - A network element that has a broadcast interface to a broadcast network becoming operational determines whether at least one alternate path exists to the broadcast network. The broadcast interface is to carry traffic on a label switched path. If an alternate path exists, the broadcast interface will not be advertised to the broadcast network until label distribution protocol (LDP) is operational with all neighbors on the broadcast interface. | 05-29-2014 |
20140149782 | METHOD AND APPARATUS FOR FACILITATING PROCESS RESTART IN A MULTI-INSTANCE IS-IS SYSTEM - A method and apparatus for facilitating process restart in an IS-IS router that includes an active router processor (RP) module for supporting an active IS-IS process instance as well as one or more dormant instances of the active IS-IS process. Routing database information maintained by the active IS-IS process is synchronized to one or more corresponding databases associated with the dormant instances. Responsive to a control signal, one of the dormant instances may be activated as the new active IS-IS process instance on the active RP module, wherein the contents of the database corresponding to the newly activated instance are used for continuing to maintain routing functionality. | 05-29-2014 |
20140149819 | METHOD AND APPARATUS FOR PROTOCOL DATA UNIT RECOVERY IN AN IS-IS SYSTEM - A method and apparatus for effectuating LSP recovery in an IS-IS router. When a standby router processor (RP) module of the IS-IS router is activated, at least one CSNP packet is generated by the newly activated RP module based on its link state database. The CSNP packet is then transmitted on all point-to-point links and all broadcast links supported by the IS-IS router. | 05-29-2014 |
20140211800 | Accelerated MAC address resolution for IPv6 traffic with IS-IS Protocol - A method is executed by a router for improved Intermediate System to Intermediate System (IS-IS) protocol and Neighbor Discovery (ND) protocol execution to avoid dropped data traffic caused by Media Access Control (MAC) address resolution for next hops of routes determined by the IS-IS protocol. An IS-IS adjacency is established between the router and a neighbor router over a link, where a MAC address for the neighbor router is received from the neighbor router. A routing information base (RIB) is updated to include the neighbor router as a next hop for at least one destination address by the IS-IS process. The MAC address of the neighbor router is provided to an ND process to update the RIB, a forwarding information base (FIB) or L2 forwarding table of at least one line card of the router to include the MAC address of the neighbor router in response to the providing of the MAC address to the ND process. | 07-31-2014 |
20140233738 | Mechanism for Co-Ordinated Authentication Key Transition for IS-IS Protocol - An automated key transition method is executed by a node in a network. The network includes a set of nodes utilizing a current key identifier provided by a group key management server or provisioned manually. A key identifier specifies an authentication protocol and an authentication key for use in the authentication of intermediate-system to intermediate-system (IS-IS) protocol data units. The method includes receiving a message from the group key management server that includes a most recent key field to replace the current key identifier, advertising the most recent key identifier to all reachable nodes, verifying whether all reachable nodes have advertised the most recent key identifier, continuing authentication using the current key identifier until all reachable nodes have been verified to advertise the most recent key identifier, and switching authentication to use the most recent key identifier upon verification that all reachable nodes have advertised the most recent key identifier. | 08-21-2014 |
20140313880 | FAST FLOODING BASED FAST CONVERGENCE TO RECOVER FROM NETWORK FAILURES - A method in a router for initiating fast flooding based fast convergence to recover from a network failure is disclosed. The method also starts with detecting a network failure. Responsive to the detected network failure, the router floods a layer 2 fast failure notification message out a set of one or more interfaces of the router. The fast failure notification message includes information that identifies the network failure and indicates to a router that receives the fast failure notification message to flood the fast failure notification message out its interfaces that are not blocked by a spanning tree protocol (STP) independently of updating its routing table to reflect the network failure. The method continues with the router updating a routing table to reflect the network failure. | 10-23-2014 |
20140348002 | RELAYED CSPF COMPUTATION FOR MULTIPLE AREAS AND MULTIPLE AUTONOMOUS SYSTEMS - A method in a router for participating in computation of a constraint-based label switched path (LSP) that spans a plurality of areas to reach a destination is described. The method comprises computing a path segment that meets a set of one or more constraints to at least one border router of the first area, transmitting a path computation request message to a path computation element in a second one of the plurality of areas, receiving a path computation reply message from the path computation element, and stitching at least one of the set of computed path segments that are specified in the path computation reply message with the path segment computed by the router to form at least part of the constraint-based LSP. | 11-27-2014 |
20150263932 | PROCEDURE TO IDENTIFY MULTI-HOMED PREFIXES FOR IS-IS LFA - A method of a network device identifies multi-homed prefixes in an intermediate system-intermediate system (IS-IS) area or IS-IS domain during shortest path first (SPF) computation for use in a loop free alternate (LFA) computation. The method and network device select a next node in a shortest path tree (SPT) and determine a set of prefixes associated with the selected node in the SPT. A next prefix from the set of prefixes of the selected node is selected and a check is made whether the selected prefix exists in the local RIB associated with another node of a same level, then the selected prefix is marked as a multi-homed prefix in the local RIB. A check is made whether all prefixes associated with the selected node are processed and whether all nodes in the SPT have been processed, before downloading the local RIB to a global RIB. | 09-17-2015 |
20150271052 | Procedure to Add Alternate Paths for IS-IS Default Route - A method is implemented by a network device to determine loop free alternatives (LFA) for each next hop in a default route to border nodes of a level 1 intermediate system—intermediate system (IS-IS) area of the network device. The method selects a next next-hop for the default route and looks up a corresponding border node for the selected next-hop in a local routing information base (RIB). A next next-hop of the corresponding border node is selected. A check is made whether the selected next-hop of the corresponding border node is the same as selected next-hop of default route. Then an LFA of the selected next-hop of the corresponding border node is assigned as LFA of the selected next-hop of the default route. | 09-24-2015 |
20150271056 | OPTIMIZED APPROACH TO IS-IS lFA COMPUTATION WITH PARALLEL LINKS - A method is executed by a network device to a calculate loop free alternative (LFA) for each node in an intermediate system-intermediate system (IS-IS) area or IS-IS domain where the network device is connected with other nodes via multiple parallel links. The method includes a shortest path first (SPF) computation of the primary paths for the network device that tracks directly connected links from each node in the IS-IS area or IS-IS domain to the network device which is a source node for the SPF. These tracked links can then be utilized in subsequent LFA computations to avoid unnecessary calculations. | 09-24-2015 |
20150271059 | BETTER ALTERNATE PATHS FOR MULTI HOMED IS-IS PREFIXES - A method is executed by a network device to determine a loop free alternate (LFA) for a multi-homed prefix in an IS-IS area or IS-IS domain. The method includes selecting a next node from the IS-IS area or the IS-IS domain and selecting a next prefix for the selected node. A check is made whether the selected prefix is a multi-homed prefix (MHP). A check is made whether a shortest path first (SPF) cost of the selected node and cost to the selected prefix is equal to an SPF cost of the selected prefix, whether a next hop of selected prefix is same as next hop of selected node, and whether a LFA next hop of the selected node is better protection than a current next hop protection of the selected prefix and the LFA next hop of the selected node is then inherited for the selected prefix. | 09-24-2015 |
20150350059 | ENHANCED PROCEDURE TO COMPUTE LFAS WITH IGP MAX METRIC - A method and implementing system calculates a loop free alternative (LFA) next hop as a backup for a primary path next hop for an interior gateway protocol (IGP). The method enables consideration of the LFA next hop where a link to the next hop has a reverse cost that has a maximum value. The method includes selecting a next candidate next hop from a set of candidate next hops in the network, checking whether a link to the next candidate next hop is an administratively allowable link, and checking whether the link has a maximum forward cost. The method further checks whether the link is bi-directional and computes the LFA using the next candidate next hop where the link is administratively allowable link, where the link does not have a maximum forward cost and where the link is bi-directional without consideration of reverse cost of the link. | 12-03-2015 |
20150350060 | Simplified Approach to Verify LFAS in Deployment - A method and system are provided to install a loop free alternative (LFA) next hop as a backup for a primary path next hop for an interior gateway protocol (IGP). The method enables testing of the LFA next hop to ensure proper handling of data forwarding on the LFA. The method includes receiving a trigger message from an administrative module indicating a switch to the LFA next hop the message including a prefix and an interface. A check is made whether a set of primary path next hops of the prefix have been exhausted. A next primary path next hop is selected from the set of primary path next hops of the prefix. A check is made whether the next primary path next hop matches the interface. The next primary path next hop is replaced by installing the LFA next hop into a global routing information base. | 12-03-2015 |
20150350061 | ALTERNATE METHOD TO GIVE OPERATORS FLEXIBILITY TO CHOOSE LFAs - The method and system to computes an LFA next hop as a backup for a primary path next hop that enables an administrator to control LFA selection for a given destination node using a tag and a weight. The method includes checking whether an interface of a next candidate node has a tag with a tag value matching a tag value of a primary SPF path for the destination node. The method further includes checking whether the destination node has any LFA, checking whether a stored tag differs from the tag value of the primary SPF path, and checking whether the interface of the next candidate node is preferred based on a comparison of a weight values, and replacing a stored LFA for the destination node with the next candidate node. Where conditions are met a stored LFA is replaced with the next candidate node. | 12-03-2015 |
20150365271 | OPTIMIZATION TO EXPAND IS-IS LEAF NODES DURING LFA COMPUTATION - A method and system implemented by a network device, where the network device is in a network having a plurality of nodes. The method computes a loop free alternative (LFA) next hop as a backup for a primary path next hop for intermediate system-intermediate system (IS-IS). The method improves LFA computation efficiency by minimizing expansion of prefixes. The method includes expanding all prefixes of the next LFA shortest path first (SPF) destination node and inheriting a next candidate next hop as a current LFA next hop where the next candidate next hop provides link or node protection and better protection than the current LFA next hop. | 12-17-2015 |
Xiaoxu Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140362880 | CW DUV Laser With Improved Stability - A deep ultra-violet (DUV) continuous wave (CW) laser includes a fundamental CW laser configured to generate a fundamental frequency with a corresponding wavelength between about 1 μm and 1.1 μm, a third harmonic generator module including one or more periodically poled non-linear optical (NLO) crystals that generate a third harmonic and an optional second harmonic, and one of a fourth harmonic generator module and a fifth harmonic generator. The fourth harmonic generator module includes a cavity resonant at the fundamental frequency configured to combine the fundamental frequency with the third harmonic to generate a fourth harmonic. The fourth harmonic generator module includes either a cavity resonant at the fundamental frequency for combining the fundamental frequency with the third harmonic to generate a fifth harmonic, or a cavity resonant at the second harmonic frequency for combining the second harmonic and the third harmonic to generate the fifth harmonic. | 12-11-2014 |
20150041666 | Multi-Spot Illumination For Improved Detection Sensitivity - Methods and systems for minimizing interference among multiple illumination beams generated from a non-uniform illumination source to provide an effectively uniform illumination profile over the field of view of an inspection system are presented. In some examples, a pulsed beam of light is split into multiple illumination beams such that each of the beams are temporally separated at the surface of the specimen under inspection. In some examples, multiple illumination beams generated from a non-uniform illumination source are projected onto spatially separated areas on the surface of the specimen. A point object of interest illuminated by each area is imaged onto the surface of a time-delay integration (TDI) detector. The images are integrated such that the relative position of the illumination areas along the direction of motion of the point object of interest has no impact on the illumination efficiency distribution over the field of view. | 02-12-2015 |
20150372446 | Laser Repetition Rate Multiplier And Flat-Top Beam Profile Generators Using Mirrors And/Or Prisms - A repetition rate (pulse) multiplier includes one or more beam splitters and prisms forming one or more ring cavities with different optical path lengths that delay parts of the energy of each pulse. A series of input laser pulses circulate in the ring cavities and part of the energy of each pulse leaves the system after traversing the shorter cavity path, while another part of the energy leaves the system after traversing the longer cavity path, and/or a combination of both cavity paths. By proper choice of the ring cavity optical path length, the repetition rate of an output series of laser pulses can be made to be a multiple of the input repetition rate. The relative energies of the output pulses can be controlled by choosing the transmission and reflection coefficients of the beam splitters. Some embodiments generate a time-averaged output beam profile that is substantially flat in one dimension. | 12-24-2015 |
Yang Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20150347388 | Digital Content Genre Representation - A digital media store may receive content from a content creator and/or distributor thereof. The distributor may provide the content with a label genre. A first mapping rule may be applied to the label genre to convert it to a canonical genre and the canonical genre may be converted to a regional genre based on the application of a second mapping rule. The regional genre may be presented to a consumer's electronic device along with a translation, if necessary. | 12-03-2015 |
20160042761 | Finding Differences in Nearly-Identical Audio Recordings - Systems and techniques are provided for finding differences in nearly-identical audio recordings. A first version of an audio recording may be received. A second version of the audio recording may be received. A difference between the first version of the audio recording and the second version of the audio recording may be determined using time domain analysis and frequency domain analysis. The difference may be stored in a difference set. The difference set may allow the first version of the audio recording to be distinguished from the second version of the audio recording. The audio recording may be a music track. The first version of the audio recording may be an explicit version of the music track. The second version of the audio recording may be an edited version of the music track. | 02-11-2016 |
Yuan Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100088257 | Systems and Methods for Generating Predicates and Assertions - Systems and methods for deriving a predicate by constructing a logic formula from information recorded during test execution, optimizing the logic formula and computing the logical implication of the optimized logic formula. Systems and methods for deriving an assertion from a logical implication by substituting each predicate in the logical implication with corresponding design elements from a hardware design description, inserting the design elements into a target template, inserting a context-sensitive input of the target template based on design elements in the hardware design description and creating an instance name for an instantiation of the target template. Systems and methods for generating a set of clauses that are implied by a disjunctive normal formula of a set of cubes. | 04-08-2010 |
20140250414 | METHOD FOR MEASURING ASSERTION DENSITY IN A SYSTEM OF VERIFYING INTEGRATED CIRCUIT DESIGN - An assertion-based verification tool for circuit designs includes an effective measurement of assertion density for any given generated set of assertions. A register-transfer level (RTL) description of an integrated circuit (IC) is used to compute a set of predicates. Then, determination is made as to the number of predicates that are satisfiable on the given set of assertions received respective of the RTL description. | 09-04-2014 |
Yu-Lun Richard Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20080197888 | Low voltage shutdown circuit - A low voltage shutdown circuit comprises an input node for receiving a voltage V | 08-21-2008 |
Yunshan Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140059310 | Virtualization-Aware Data Locality in Distributed Data Processing - A virtualized computing system for executing a distributed computing application, such as Hadoop, is discussed. The virtualized computing system stores data in a distributed filesystem, such as Hadoop Distributed File System, and processes data using a topology awareness that takes into account the virtualization layer of the virtualized computing system. The virtualized computing system employs locality-related policies, including replica placement policies, replica choosing policies, balancer policies, and task scheduling policies that take advantage of the awareness of the virtualization topology. | 02-27-2014 |
20150120791 | MULTI-TENANT PRODUCTION AND TEST DEPLOYMENTS OF HADOOP - A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Production, test, and development deployments of a Hadoop application may be executed using multiple compute clusters and a shared instance of a distributed filesystem, or in other cases, multiple instances of the distributed filesystem. Data nodes executing as virtual machines (VMs) for test and development deployments can be linked clones of data nodes executing as VMs for a production deployment to reduce duplicated data and provide a shared storage space. | 04-30-2015 |
20150121371 | MULTI-TENANT DISTRIBUTED COMPUTING AND DATABASE - A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Deployments of a distributed computing application, such as Hadoop, may be executed concurrently with a distributed database application, such as HBase, using a shared instance of a distributed filesystem, or in other cases, multiple instances of the distributed filesystem. Computing resources allocated to region server nodes executing as VMs may be isolated from compute VMs of the distributed computing application, as well as from data nodes executing as VMs of the distributed filesystem. | 04-30-2015 |
Zhi Liang Lu, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140258267 | Aggregating and Searching Social Network Images - Methods and systems directed to aggregating social content from social networking sites, and making the social content available for searching is disclosed. Social content, corresponding to multiple computer users, is obtained from a plurality of social networking sites. The social content is stored in a content store, making it available for searching. In response to receiving a search query (directed to social content), a set of search results is identified, the search results including at least one item of social content obtained from a social networking site. The social content in the search results is filtered according to privacy constraints. A presentation of the filtered search results is generated and provided to the requesting computer user. | 09-11-2014 |