Hui, CA
Alvin Hui, Sunnyvale, CA US
Patent application number | Description | Published |
---|---|---|
20110184780 | INTEGRATION OF eCOMMERCE FEATURES INTO SOCIAL NETWORKING PLATFORM - A method and system are provided for ecommerce marketplace users to provide contents for social networking platform integration, such as a user sharing purchases with friends so that the user may show new clothes to friends on a social networking service. Content can be transmitted to a social network server for storing at a message space of a user of the social network server and requesting the user of the social network to provide an opinion about the content. In addition, the content might include an image resembling a paper doll, the paper doll having the capability of having parts electronically superimposed with images of articles of clothing comprising all or part of an outfit. Images of such articles of clothing can be electronically superimposed on the paper doll. The paper doll with images of the articles of clothing can be transmitted to friends on a social network for an opinion or for completion of the outfit. | 07-28-2011 |
Alvin Hui, San Pedro, CA US
Patent application number | Description | Published |
---|---|---|
20110288763 | METHOD AND APPARATUS FOR DISPLAYING THREE-DIMENSIONAL ROUTE GUIDANCE - This invention relates to a route displaying method and apparatus in a navigation system. More specifically, this invention relates to a navigation-based apparatus and method to display a complete route presented in three-dimension. The navigation system may include a map adjusting unit to adjust visual ground of the map for the user. In one embodiment, the map adjusting unit can adjust the visual ground area convexly, so that the user can view the full route including the destination. In another embodiment, the map adjusting unit may adjust the visual ground area concavely to present more surrounding details of the vehicle to the user. The navigation system may also include a wireless communication device to retrieve the most current map and traffic information from a remote server, and communicatively couple with the map adjusting unit and a route generating unit to provide the most updated information with full route view to the user. The navigation system may also be integrated into a portable device such as a smartphone. | 11-24-2011 |
Angela T. Hui, Fremont, CA US
Patent application number | Description | Published |
---|---|---|
20090294969 | SEMICONDUCTOR CONTACT FORMATION SYSTEM AND METHOD - The present invention is a semiconductor contact formation system and method. Contact insulation regions are formed with multiple etch stop sublayers that facilitate formation of contacts. This contact formation process provides relatively small substrate connections while addressing critical lithographic printing limitation concerns in forming contact holes with small dimensions. In one embodiment, a multiple etch stop insulation layer comprising multiple etch stop layers is deposited. A contact region is formed in the multiple etch stop insulation layer by selectively removing (e.g., etching) some of the multiple etch stop insulation layer. In one embodiment, a larger portion of the multiple etch stop insulation layer is removed close to the metal layer and a smaller portion is removed closer to the substrate. The different contact region widths are achieved by performing multiple etching processes controlled by the multiple etch stop layers in the multiple etch stop insulation layer and spacer formation to shrink contact size at a bottom portion. Electrical conducting material (e.g., tungsten) is deposited in the contact region. | 12-03-2009 |
20100120239 | MEMORY DEVICE ETCH METHODS - A method of manufacturing a memory device forms a first dielectric layer over a substrate, forms a charge storage layer over the first dielectric layer, forms a second dielectric layer over the charge storage layer, and forms a control gate layer over the second dielectric layer. The method also forms a hard mask layer over the control gate layer, forms a bottom anti-reflective coating (BARC) layer over the hard mask layer, and provides an etch chemistry that includes tetrafluoromethane (CF | 05-13-2010 |
20100264519 | GATE TRIM PROCESS USING EITHER WET ETCH OR DRY ETCH APPRAOCH TO TARGET CD FOR SELECTED TRANSISTORS - Disclosed are methods and devices for targeting CD of selected transistors in a semiconductor device. Varying CD is done by forming hard mask lines in a hard mask layer that have varying amounts of spacer material associated therewith. Hard mask lines corresponding to selected transistors are either left covered or uncovered by a resist applied over the hard mask layer. Then, spacer material is selectively removed from the hard mask lines to vary the width of hard mask lines and associated side wall spacers. A gate layer is then etched through the spaces in the hard mask lines to form gate lines having varying widths and targeted CD. | 10-21-2010 |
20110037115 | SYSTEM AND METHOD FOR IMPROVING MESA WIDTH IN A SEMICONDUCTOR DEVICE - A method for forming a memory device is provided. A nitride layer is formed over a substrate. The nitride layer and the substrate are etched to form a trench. The nitride layer is trimmed on opposite sides of the trench to widen the trench within the nitride layer. The trench is filled with an oxide material. The nitride layer is stripped from the memory device, forming a mesa above the trench. | 02-17-2011 |
20110195578 | PLANAR CELL ON CUT USING IN-SITU POLYMER DEPOSITION AND ETCH - A method and manufacture for charge storage layer separation is provided. A layer, such as a polymer layer, is deposited on top of an ONO layer so that the polymer layer is planarized, or approximately planarized. The ONO includes at least a first region and a second region, where the first region is higher than the second region. For example, the first region may be the portion of the ONO that is over the source/drain region, and the second region may be the portion of the ONO that is over the shallow trench. Etching is performed on the polymer layer to expose the first region of the ONO layer, leaving the second region of the ONO unexposed. The etching continues to occur to etch the exposed ONO at the first region so that the ONO layer is etched away in the first region and the second region remains unexposed. | 08-11-2011 |
20120032308 | GATE TRIM PROCESS USING EITHER WET ETCH OR DRY ETCH APPROACH TO TARGET CD FOR SELECTED TRANSISTORS - Disclosed are methods and devices for targeting CD of selected transistors in a semiconductor device. Varying CD is done by forming hard mask lines in a hard mask layer that have varying amounts of spacer material associated therewith. Hard mask lines corresponding to selected transistors are either left covered or uncovered by a resist applied over the hard mask layer. Then, spacer material is selectively removed from the hard mask lines to vary the width of hard mask lines and associated side wall spacers. A gate layer is then etched through the spaces in the hard mask lines to form gate lines having varying widths and targeted CD. | 02-09-2012 |
20120139023 | METHOD AND APPARATUS FOR NAND MEMORY WITH RECESSED SOURCE/DRAIN REGION - A method and apparatus for a flash memory is provided. A NAND flash memory array includes a cell body, a first selective gate, and a first edge line. The cell body includes recessed doped source/drain region between the first selective gate and the first edge word line. | 06-07-2012 |
20120142175 | DUAL SPACER FORMATION IN FLASH MEMORY - A method and manufacture for memory device fabrication is provided. In one embodiment, at least one oxide-nitride spacer is formed as follows. An oxide layer is deposited over a flash memory device such that the deposited oxide layer is at least 250 Angstroms thick. The flash memory device includes a substrate and dense array of word line gates with gaps between each of the word lines gate in the dense array. Also, the deposited oxide layer is deposited such that it completely gap-fills the gaps between the word line gates of the dense array of word line gates. Next, a nitride layer is depositing over the oxide layer. Then, the nitride layer is etched until the at least a portion of the oxide layer is exposed. Next, the oxide layer is etched until at least a portion of the substrate is exposed. | 06-07-2012 |
20120241871 | INTEGRATING TRANSISTORS WITH DIFFERENT POLY-SILICON HEIGHTS ON THE SAME DIE - A method of fabricating an integrated circuit including a first region and a second region each having different poly-silicon gate structures is provided. The method includes depositing a first poly-silicon layer over the first and the second region and depositing, within the second region, an oxide layer over the first poly-silicon layer. A second poly-silicon layer is deposited over the first poly-silicon layer and the oxide region. A portion of the second poly-silicon layer that lies over the oxide region is then stripped away. | 09-27-2012 |
20130130487 | Integrated Circuit with Metal and Semi-Conducting Gate - A method for forming an integrated circuit system is provided including forming a semi-conducting layer over a substrate, forming a spacer stack having a gap filler adjacent to the semi-conducting layer and a inter-layer dielectric over the gap filler, forming a transition layer having a recess over the semi-conducting layer and adjacent to the spacer stack, and forming a metal layer in the recess. | 05-23-2013 |
20130140720 | VOID FREE INTERLAYER DIELECTRIC - A method of manufacturing a non-volatile memory device includes forming a number of memory cells. The method also includes depositing a first dielectric layer over the memory cells, where the first dielectric layer is a conformal layer having a substantially uniform thickness. The method further includes depositing a second dielectric layer over the first dielectric layer. Together, the first and second dielectric layers form an interlayer dielectric without voids. | 06-06-2013 |
20140042514 | CONTACTS FOR SEMICONDUCTOR DEVICES - A memory device includes a number of memory cells and a dielectric layer formed over the memory cells. The memory device also includes contacts formed in the dielectric layer and spacers formed adjacent the side surfaces of the contacts. The spacers may inhibit leakage currents from the contacts. | 02-13-2014 |
20140097497 | Spacer Design to Prevent Trapped Electrons - Charge-trapping field effect transistors may be formed into an array on a wafer suitable to be a NAND memory device. A thick oxide layer is applied over the gates to ensure that the gap between the gates is filled. The filled gap substantially prevents nitride from being trapped, which could otherwise decrease the yield of the devices. This technique, and its variations, are useful for a range of semiconductor devices. | 04-10-2014 |
20140117435 | INTEGRATING TRANSISTORS WITH DIFFERENT POLY-SILICON HEIGHTS ON THE SAME DIE - A method of fabricating an integrated circuit including a first region and a second region each having different poly-silicon gate structures is provided. The method includes depositing a first poly-silicon layer over the first and the second region and depositing, within the second region, an oxide layer over the first poly-silicon layer. A second poly-silicon layer is deposited over the first poly-silicon layer and the oxide region. A portion of the second poly-silicon layer that lies over the oxide region is then stripped away. | 05-01-2014 |
Chor Kuen Eddy Hui, San Ramon, CA US
Patent application number | Description | Published |
---|---|---|
20090043217 | HEART RATE MONITOR WITH CROSS TALK REDUCTION - A heart rate monitor determines a heart rate for a primary subject by reducing noise and cross-talk from unwanted signal transmission sources. A set of pulse peaks having about the same amplitude and an amplitude greater than any other set of peaks are processed to determine a subject's heart rate, while data having an amplitude below that of the set of peaks is ignored. To retrieve enough data to determine a peak amplitude, the signal having heart rate information is sampled at a frequency higher than a normal sampling frequency. In some embodiments, if no data is received for a set time period which is in or above the range, the threshold resets to zero under an assumption that the primary subject is no longer within transmitting range. | 02-12-2009 |
20100331714 | HEART RATE MONITOR WITH CROSS TALK REDUCTION - A heart rate monitor determines a heart rate for a primary subject by reducing noise and cross-talk from unwanted signal transmission sources. A set of pulse peaks having about the same amplitude and an amplitude greater than any other set of peaks are processed to determine a subject's heart rate, while data having an amplitude below that of the set of peaks is ignored. To retrieve enough data to determine a peak amplitude, the signal having heart rate information is sampled at a frequency higher than a normal sampling frequency. In some embodiments, if no data is received for a set time period which is in or above the range, the threshold resets to zero under an assumption that the primary subject is no longer within transmitting range. | 12-30-2010 |
Daniel Jeng-Ping Hui, Palo Alto, CA US
Patent application number | Description | Published |
---|---|---|
20120047147 | DYNAMIC PLACE VISIBILITY IN GEO-SOCIAL NETWORKING SYSTEM - In one embodiment, a user of a social networking system requests to search for a place near the user's current location. The social networking system generates a list of places near the user's current location, select a sub-set from the list of places based on visibility and activity of the user and the user's social contacts for each place in the list, and returns the sub-set to the user. | 02-23-2012 |
20120197709 | Mobile Advertisement with Social Component for Geo-Social Networking System - In one embodiment, a geo-social networking system receives from a first user's location a message identifying the first user and one or more other users, generating a redeemable certificate including pictures of the first user and the one or more other users, and present the redeemable certificate to the first user. | 08-02-2012 |
20140012926 | Recommending Additional Users for an Event Using a Social Networking System - Social networking system users may create events where a group of other users invited to the event meet at a specified time and location. While an inviting user initially specifies the group of users to invite to the event, the social networking system suggests additional users to invite to the event. The social networking system suggests additional users based on a prediction that the users would attend the event if invited. Various factors may be used to make the prediction, such as an affinity between the inviting user and the other users, the availability of the other users at the time of the event and/or the proximity of the other users to the location of the event. Invitations to the suggested additional users may be automatically sent or sent to a set of the additional users selected by the inviting user. | 01-09-2014 |
20140164511 | Eliciting Event-Driven Feedback - Particular embodiments detect events associated with information about activities that a user has engaged in. The activities may be associated with a location or location-agnostic. Based on the received information, the social-networking system sends the user a request for follow-up information after an appropriate time delay. The time delay may vary based on the user activity and the context of the event that triggered the request. After the follow-up information is received, such information is stored in the social-networking system and may be used to determine recommendations, sponsored stories, advertisements, etc. to send to friends of the user. The information may also be used for ranking or filtering recommendations. | 06-12-2014 |
20150067032 | TECHNIQUES FOR SERVER-CONTROLLED TILING OF LOCATION-BASED INFORMATION - Techniques for server-controlled tiling of location-based information are described. An apparatus may comprise a communication component and a tile component. The communication component may be operative to receive a location-based search request from a client application, the location-based search request comprising a geographic area, and to transmit a plurality of tiles to the client application. The tile component may be operative to determine the plurality of tiles as a set of tiles that cover the geographic area, each tile of the plurality of tiles covering a portion of the geographic area and comprising a set of locations. Other embodiments are described and claimed. | 03-05-2015 |
20150074596 | TECHNIQUES TO DISPLAY LOCATION-BASED INFORMATION - Techniques to display location-based information are described. An apparatus may comprise a screen management component and an interface component. The screen management component may be operative to display in a first screen area location-based information on a map according to geographic location, to display in a second screen area a list comprising the location-based information, and to adjust a relative size of the first screen area and the second screen area in response to a received interaction with one of the first screen area and second screen area. The interface component may be operative to receive the interaction with one of the first screen area and second screen area. Other embodiments are described and claimed. | 03-12-2015 |
20160044120 | Eliciting Event-Driven Feedback in a Social Network - Particular embodiments detect events associated with information about activities that a user has engaged in. The activities may be associated with a location or location-agnostic. Based on the received information, the social-networking system sends the user a request for follow-up information after an appropriate time delay. The time delay may vary based on the user activity and the context of the event that triggered the request. After the follow-up information is received, such information is stored in the social-networking system and may be used to determine recommendations, sponsored stories, advertisements, etc. to send to friends of the user. The information may also be used for ranking or filtering recommendations. | 02-11-2016 |
20160044121 | Eliciting Event-Driven Feedback in a Social Network - Particular embodiments detect events associated with information about activities that a user has engaged in. The activities may be associated with a location or location-agnostic. Based on the received information, the social-networking system sends the user a request for follow-up information after an appropriate time delay. The time delay may vary based on the user activity and the context of the event that triggered the request. After the follow-up information is received, such information is stored in the social-networking system and may be used to determine recommendations, sponsored stories, advertisements, etc. to send to friends of the user. The information may also be used for ranking or filtering recommendations. | 02-11-2016 |
David Hui, Santa Clara, CA US
Patent application number | Description | Published |
---|---|---|
20090010655 | Optical communications circuit current management - An optical communications circuit has a communications light signal source and a heat pump coupled to cool the signal source. A controller monitors a current and a temperature of the signal source, and regulates the temperature. The controller updates a heat pump control limit parameter for the heat pump, based on the monitored current. Other embodiments are also described and claimed. | 01-08-2009 |
20130077646 | AUTOMATIC MODULATION CONTROL FOR MAINTAINING CONSTANT EXTINCTION RATIO (ER), OR CONSTANT OPTICAL MODULATION AMPLITUDE (OMA) IN AN OPTICAL TRANSCEIVER - To a laser that has no tracking error a desired laser modulation current to maintain constant Optical Modulation Amplitude (OMA) is closely proportional to the laser bias current, lb, at any temperature when the laser is under constant power according to embodiments. To a laser that has tracking error a desired laser modulation current to maintain constant Optical Extension Ratio (ER) is closely proportional to the laser bias current, lb, at any temperature when the laser is under constant power according to embodiments. This phenomenon is appears apply to many if not all types of lasers. A laser modulation control is provided that determines a modulation current based on the laser bias current. Thus, embodiments may maintain performance and compensate for temperature changes without the need to actually measure temperature thereby eliminating the need for temperature sensors and their associated parameter vs. temperature look-up tables or dithering techniques used in the past. | 03-28-2013 |
David Hui, San Francisco, CA US
Patent application number | Description | Published |
---|---|---|
20120101206 | METHOD OF IMPARTING CORROSION RESISTANCE TO A SUBSTRATE SURFACE, AND COATED SUBSTRATES PREPARED THEREBY - The disclosure provides methods and materials for imparting corrosion resistance to a substrate, as well as the corrosion-resistant substrates prepared accordingly. Compositions and methods include nonpyrolyzed, silicon-based polymer coatings prepared on substrates. The prepared coatings are highly stable and resistant to corrosion. The invention finds utility, for example, in the fields of surface and coating chemistry. | 04-26-2012 |
David K. Hui, San Francisco, CA US
Patent application number | Description | Published |
---|---|---|
20120107614 | METHOD OF COATING A SUBSTRATE SURFACE, AND COATED SUBSTRATES PREPARED THEREBY - The invention provides compositions and methods useful in providing strongly bonded functional layers on substrates. In some embodiments, the invention provides functionalized substrate surfaces that have a surface property selected from smudge resistance, easy clean, oleophobic, oleophilic, hydrophobic, hydrophilic, electrostatic, sorbing, electroresponsive, charge responsive, bioinert, and bioactive. Methods for the manufacture of such coated substrates are provided. The invention finds utility, for example, in the fields of surface and ultrathin coating chemistry and chemical functionalization of surfaces. In some embodiments, the method provides surfaces having smudge resistance and easy-clean characteristics. | 05-03-2012 |
David Ka-Wai Hui, Fremont, CA US
Patent application number | Description | Published |
---|---|---|
20090137244 | SYSTEM AND METHOD FOR TRANSFERRING WIRELESS NETWORK ACCESS PASSWORDS - The present disclosure provides an access node for transferring and/or assigning network passwords. The access node includes a first interface for sending and receiving communication of a first type to and from a first node operating in a wireless local area network (WLAN). The access node also includes a second interface for sending and receiving communication of a second type to and from a second node in a mobile network, such as a GSM/GPRS network. The access node further includes a short messaging service (SMS) module for sending and receiving SMS messages to the second node carrying an OTP allocated. The access node also includes a mechanism to verify a precondition before the OTP is sent to the second node. | 05-28-2009 |
20120020340 | SYSTEM AND METHOD FOR TRANSFERRING WIRELESS NETWORK ACCESS PASSWORDS - The present disclosure provides an access node for transferring and/or assigning network passwords. The access node includes a first interface for sending and receiving communication of a first type to and from a first node operating in a wireless local area network (WLAN). The access node also includes a second interface for sending and receiving communication of a second type to and from a second node in a mobile network, such as a GSM/GPRS network. The access node further includes a short messaging service (SMS) module for sending and receiving. SMS messages to the second node carrying an OTP allocated. The access node also includes a mechanism to verify a precondition before the OTP is sent to the second node. | 01-26-2012 |
20120144463 | SYSTEM AND METHOD FOR EXTENDING SECURE AUTHENTICATION USING UNIQUE SESSION KEYS DERIVED FROM ENTROPY - In some aspects of the present disclosure a device is disclosed that includes a processor; a storage unit; a user interface; a transceiver; a device identifying unit arranged to store device identifying data; a memory unit arranged to store machine-executable instructions that when executed by the processor causes a password to be generated, based on the device identifying data, that is arranged to allow the device to access a public wireless local area network (PWLAN). | 06-07-2012 |
20150094027 | SYSTEM AND METHOD FOR TRANSFERRING WIRELESS NETWORK ACCESS PASSWORDS - The present disclosure provides an access node for transferring and/or assigning network passwords. The access node includes a first interface for sending and receiving communication of a first type to and from a first node operating in a wireless local area network (WLAN). The access node also includes a second interface for sending and receiving communication of a second type to and from a second node in a mobile network, such as a GSM/GPRS network. The access node further includes a short messaging service (SMS) module for sending and receiving. SMS messages to the second node carrying an OTP allocated. The access node also includes a mechanism to verify a precondition before the OTP is sent to the second node. | 04-02-2015 |
Delilah Hui, American Canyon, CA US
Patent application number | Description | Published |
---|---|---|
20090030400 | SYSTEM AND METHOD FOR INTRACRANIAL ACCESS - A delivery catheter for accessing the intra-cranial vascular includes a rigid proximal section and a distal section having an outer diameter and flexibility suitable for advancement into the intra-cranial vasculature, such as the Petrous segment or the Cavernous segment of the internal carotid artery. The wall thickness and rigidity of the catheter decrease from the proximal section to the distal section, preferably in discrete segments each having reduced wall thickness and/or durometer relative to proximally adjacent sections. An intra-cranial access system includes the delivery catheter and a selection catheter insertable through the lumen of the delivery catheter. The selection catheter is shaped to facilitate selection of the target branch of the neurovasculature off the aortic arch and allows the delivery catheter to be advanced over the selection catheter into the selected branch. | 01-29-2009 |
20100174269 | EMBOLIC COIL IMPLANT SYSTEM AND IMPLANTATION METHOD - Embolic coil implant systems and methods whereby coils are mechanically detachable are disclosed. The coils include a retention element that may be releasably retained within the distal end of an implant tool. The implant tool may include a fulcrum configured to engage a first filament and prevent the release of the coil when the first filament is engaged. Alternatively, an urging means and aperture may be disposed within the sidewall of the implant tool, and a first filament may, in conjunction with the aperture and sidewall, releasably retain the coil until the first filament is withdrawn. The implant tool may also include an alignment member for aligning the first filament. | 07-08-2010 |
20110172700 | SYSTEM AND METHOD FOR TREATING ISCHEMIC STROKE - A thromboembolic removal system for treating ischemic stroke, including a guide and occlusion catheter, a delivery and aspiration catheter, an aspiration pump, a thromboembolic receiver, and a thromboembolic separator. | 07-14-2011 |
20110184454 | EMBOLIC IMPLANTS - Embolic coils are disclosed. The coils include an inner coil, an outer coil, and a stretch resistant member. Some embodiments include a large diameter outer coil formed from a small diameter wire. The inner coils may be either closed pitch or open pitch. Alternative coils include an inner coil that is shape set to a diameter that is larger than the diameter of the outer coil. Another alternative coil has multiple stretch resistant members. | 07-28-2011 |
20130261730 | ANEURYSM OCCLUSION SYSTEM AND METHOD - An aneurysm occlusion system includes a device positionable within a cerebral blood vessel covering a neck of an aneurysm on the blood vessel. The device includes an expandable tubular element having a lumen surrounded by a sidewall including a plurality of gaps. When expanded, the tubular element includes longitudinal standards arrayed helically in a proximal to distal direction. The standards support struts and the gaps are defined between adjacent struts and are sufficiently large to permit delivery of embolic coils or other embolic materials therethrough. | 10-03-2013 |
20130331882 | EMBOLIC COIL IMPLANT SYSTEM AND IMPLANTATION METHOD - Embolic coil implant systems and methods whereby coils are mechanically detachable are disclosed. The coils include a retention element that may be releasably retained within the distal end of an implant tool. The implant tool may include a fulcrum configured to engage a first filament and prevent the release of the coil when the first filament is engaged. Alternatively, an urging means and aperture may be disposed within the sidewall of the implant tool, and a first filament may, in conjunction with the aperture and sidewall, releasably retain the coil until the first filament is withdrawn. The implant tool may also include an alignment member for aligning the first filament. | 12-12-2013 |
20140128907 | OCCLUSIVE COIL - Vessel occlusion coils disclosed that have a primary configuration for delivery and a secondary configuration for deployment that is conferred upon the devices by a stretch resistant member. In the secondary configuration, the stretch resistant member forms a stiffer coil and may have a greater diameter, and a more complex shape having some interior space, at one end than at the other end, for improved anchoring of the device in the vessel. The methods include intravascular delivery and deployment for implanting one or more vessel occlusion devices. | 05-08-2014 |
20140155931 | SYSTEM AND METHOD FOR TREATING ISCHEMIC STROKE - A thromboembolic removal system for treating ischemic stroke, including a guide and occlusion catheter, a delivery and aspiration catheter, an aspiration pump, a thromboembolic receiver, and a thromboembolic separator. | 06-05-2014 |
20140358175 | EMBOLIC COIL IMPLANT SYSTEM AND IMPLANTATION METHOD - Embolic coil implant systems and methods whereby coils are mechanically detachable are disclosed. The coils include a retention element that may be releasably retained within the distal end of an implant tool. The implant tool may include a fulcrum configured to engage a first filament and prevent the release of the coil when the first filament is engaged. Alternatively, an urging means and aperture may be disposed within the sidewall of the implant tool, and a first filament may, in conjunction with the aperture and sidewall, releasably retain the coil until the first filament is withdrawn. The implant tool may also include an alignment member for aligning the first filament. | 12-04-2014 |
20150196304 | SOFT EMBOLIC IMPLANT - Soft embolic implants exhibiting secondary shapes are disclosed. Some of the embolic implants exhibit progressively increasing softness from the distal end to the proximal end of the coil. The embolic implants have a primary coil, an optional second coil, a shape wire, and a stretch resistant fiber disposed in the lumen of the primary coil. An optional distal support wire is also disclosed. The embolic implants include a proximal constraint assembly configured to be releaseably retained by a delivery device. Disposed near each end of some of the implants are elliptical hole washers through which the shape wire and the stretch resistant fiber are threaded. The embolic implants have a primary, linear configuration for delivery through an implant tool, and a secondary configuration after deployment from the implant tool. The secondary shape can be J-shaped, helical, spherical, complex, or a combination of shapes. | 07-16-2015 |
Delilah Yin Hui, Union City, CA US
Patent application number | Description | Published |
---|---|---|
20090131972 | Absorbable implantable vaso-occlusive member - Compositions comprising absorbable implantable vaso-occlusive members are described. Also described are methods of making and using these absorbable vaso-occlusive compositions. | 05-21-2009 |
20100174301 | POLYMER COVERED VASO-OCCLUSIVE DEVICES AND METHODS OF PRODUCING SUCH DEVICES - This is a medical device for forming an embolism within the vasculature of a patient. More particularly, it concerns an occlusion device comprising an inner core covered with a polymer. The medical device encourages cellular attachment and growth while maintaining favorable handling, deployment and visualization characteristics. | 07-08-2010 |
Delilah Yin Hui, American Canyon, CA US
Patent application number | Description | Published |
---|---|---|
20100268326 | Expandable Framework with Overlapping Connectors - A stent may comprise a plurality of serpentine bands and connectors. A first connector may overlap a second connector when the stent is unexpanded. The first connector may also overlap the second connector in an unexpanded state when the stent is subject to compressive forces in the local area of the connectors, such as when the connectors are located on the inside of a curve. The second connector may be shaped according to a rotation of the first connector about the centroid of the cell between the first connector and the second connector. | 10-21-2010 |
20130060322 | EXPANDABLE FRAMEWORK WITH OVERLAPPING CONNECTORS - A stent may comprise a plurality of serpentine bands and connectors. A first connector may overlap a second connector when the stent is unexpanded. The first connector may also overlap the second connector in an unexpanded state when the stent is subject to compressive forces in the local area of the connectors, such as when the connectors are located on the inside of a curve. The second connector may be shaped according to a rotation of the first connector about the centroid of the cell between the first connector and the second connector. | 03-07-2013 |
20150190255 | MEDICAL DEVICES INCLUDING METALLIC FILMS AND METHODS FOR MAKING SAME - An endoprosthesis for deployment within a body passage includes a framework and a metallic film, which can circumferentially surround the framework or be surrounded by the framework. The framework and metallic film can be attached without using a third material, e.g., without sewing. The framework can define a circumferential recess along at least a portion of its length and circumference. The recess accommodates at least a portion of the metallic film therein. | 07-09-2015 |
Denise Dare Hui, San Mateo, CA US
Patent application number | Description | Published |
---|---|---|
20100280903 | DOMAIN CLASSIFICATION AND CONTENT DELIVERY - Methods, systems, and computer-readable media for categorizing sender domains are provided. An advertisement platform includes targeting components, databases, mail servers, and client devices. Recipients interact with the client devices to receive electronic mail from the mail servers. The mail servers store records of sender domains where the recipient performed a specified action to a message having a sender domain. The mail server transmits a log of the sender domains, actions, and an anonymous identifier for the recipient to the targeting system. The targeting components extract the sender domains that are used by the advertisement platform to communicate to the database to retrieve advertisement categories that correspond to the sender domains. The advertisement categories are used by the advertisement platform to direct content, including advertisements, to the recipients via the anonymous identifier. | 11-04-2010 |
Dennis Hui, Cupertino, CA US
Patent application number | Description | Published |
---|---|---|
20100279729 | Zero-Forcing Linear Beamforming for Coordinated Cellular Networks with Distributed Antennas - In a distributed antenna system that includes a plurality of transmitters and a controller, a method, performed by the controller, may be characterized by performing dirty-paper coding on downlink transmissions to users based on an order of the users, calculating beamforming vectors to provide that each of the downlink transmissions associated with each of the users does not interfere with other users, and maximizing, based on the calculated beamforming vectors, a data rate subject to a power constraint of the distributed antenna system. | 11-04-2010 |
20110280287 | EXPLOITING CHANNEL TIME CORRELATION TO REDUCE CHANNEL STATE INFORMATION FEEDBACK BITRATE - The required bitrate for reporting channel state information from a network transceiver to the network is dramatically reduced, while maintaining fidelity of channel estimates, by exploiting prior channel estimates and the time correlation of channel response. For a selected set of sub-carriers, the transceiver estimates channel frequency response from pilot signals. The transceiver also predicts the frequency response for each selected sub-carrier, by multiplying a state vector comprising prior frequency response estimate and a coefficient vector comprising linear predictive coefficients. The predicted frequency response is subtracted from the estimated frequency response, and the prediction error is quantized and transmitted to the network. The network maintains a corresponding state vector and predictive coefficient vector, and also predicts a frequency response for each selected sub-carrier. The received prediction error is inverse quantized and subtracted from the predicted frequency response to yield a frequency response corresponding to that estimated at the transceiver. | 11-17-2011 |
20120115427 | RECEIVER AND METHOD FOR REDUCING AN AMOUNT OF CHANNEL STATE INFORMATION FEEDBACK TO A TRANSMITTER - A receiver and a method are described herein for reducing an amount of channel state information related to a transmit channel correlation matrix φ | 05-10-2012 |
20120236967 | DATA MODULATION - A modulator includes a symbol mapper that is configured to map respective bits sets of a bit sequence corresponding to a burst and including data, training, tail, and guard bits into respective symbols to form a symbol sequence of data, training, tail, and guard symbols. A vector precoder is configured to apply a vector precoding transformation to the data and training symbols to form precoded symbols. These precoded symbols are combined with the tail and guard symbols in a symbol processor to form a sequence of transmit symbols. The record precoding conducted by the modulator of a transmitter enables improved link performance without the cost of increased processing complexity of the receiver algorithm. | 09-20-2012 |
Dennis Hui, Sunnyvale, CA US
Patent application number | Description | Published |
---|---|---|
20110274185 | Methods and Arrangements for Feeding Back Channel State Information - A method and an arrangement ( | 11-10-2011 |
20120155274 | DENIAL OF SERVICE (DoS) ATTACK PREVENTION THROUGH RANDOM ACCESS CHANNEL RESOURCE REALLOCATION - A system and method to substantially prevent Denial of Service (DoS) attacks due to Random Access Channel (RACH) overload in cellular wireless networks. Once a mobile handset is identified to cause or contribute significantly to a RACH overload of the cell, the system sends a special System Information Block (SIB) message targeted to that mobile handset and instructing it to redirect its RACH signaling to a separate RACH/PRACH (Physical Random Access Channel) resource or to a small part of the current RACH/PRACH resource. This allows most or all of the regular RACH/PRACH resource from being overloaded by a single user or a group of users. The use of a separate RACH/PRACH resource such as frequency, preamble sequence, and/or radio subframe access slot to “absorb” high volume RACH signaling traffic from a small number of malicious/defective mobile handsets substantially prevents the signaling DoS attacks in the wireless network and makes it more robust to such attacks. | 06-21-2012 |
20120207251 | BLIND FREQUENCY-OFFSET ESTIMATION FOR SPATIALLY CORRELATED SIGNAL - An iterative, blind, frequency-offset estimation process that does not require any training signal or demodulated information symbols is disclosed. Receivers embodying the disclosed processes can produce periodic frequency-offset estimates, without running computationally intensive equalization or demodulation algorithms, by exploiting the temporal correlation of the received signal in the time domain, as well as the received signal's correlation across in-phase and quadrature dimensions, in some embodiments, to find a frequency-offset estimate that best fits the received signal in a maximum-likelihood sense. In an exemplary method of estimating receiver frequency offset, a spatially stacked signal block is formed from multi-branch signal samples corresponding to each of two or more time-separated samples of the received signal. The spatially stacked signal block is used in computing a maximum-likelihood joint estimate of the receiver frequency offset and the spatial covariance of the spatially stacked signal block de-rotated by the receiver frequency offset. | 08-16-2012 |
20120230691 | METHOD OF DOWNLINK SIGNAL TRANSPORT OVER BACKHAUL COMMUNICATIONS THROUGH DISTRIBUTED PROCESSING - The amount of multi-antenna signals to be transmitted over the backhaul in a Coordinated MultiPoint (CoMP) system from the central processor (CP) to each base station is reduced. Embodiments of the present invention exploit characteristics of the underlying signal structure, and distribute some baseband processing functionalities—such as channel coding and the application of the multi-user precoding—from the CP to the remote base stations. Additionally, in some embodiments the non-precoded parts of multi-antenna signals are broadcast from the CP to all base stations in the CoMP system, to further reduce the burden on backhaul communications. In one embodiment, the backhaul network is a Gigabit-capable Passive Optical Network (GPON). | 09-13-2012 |
20120236774 | JOINT MANAGEMENT OF RADIO AND TRANSPORT RESOURCES - A system for managing radio access resources includes a joint radio resource management/transport resource management unit configured to communicate with a plurality of radio units over a transport network, to jointly allocate radio resources at the radio unit and transport resources on the transport network in response to requests from wireless terminals requesting access to radio resources from the radio units, to send a radio resource allocation schedule to the plurality of radio units that defines radio resource allocations for the wireless terminals, and to generate a transport resource allocation schedule that defines transport resource allocations for the wireless terminals. The system further includes a transport resource controller configured to receive the transport resource allocation schedule and to map user data to physical transport resources on the transport network in response to the transport resource allocation schedule. | 09-20-2012 |
20120243468 | SIGNAL COMPRESSION FOR BACKHAUL COMMUNICATIONS USING LINEAR TRANSFORMATIONS - A compression/decompression method for backhaul communication of a complex-valued radio signal between base stations and the network processing unit, such as a Central Processor of a Coordinated MultiPoint (CoMP) system, significantly reduces backhaul bandwidth. The spatial and temporal correlations of the wireless IQ signal are exploited in order to remove redundancy and substantially reduce signal bandwidth. Feature component signals of significance are extracted through linear transformation to form the radio signal, and are individually quantized, possibly at different bit rates in accordance with their relative importance. The transformation can either be pre-determined or computed in real-time based on the spatial and temporal statistics of the radio signal. In the latter case, the transformation matrix or matrices are also sent over the backhaul in order to allow the radio signal to be reconstructed at the receiving end. Different methods of generating the transformation matrices are proposed. | 09-27-2012 |
20120244898 | DYNAMIC, DISTRIBUTED COORDINATION OF PARAMETERS IN A CELLULAR TELECOMMUNICATION NETWORK - An apparatus, system, and method for dynamic, distributed coordination of parameters between a plurality of base stations in a cellular telecommunication network. An inter-cell communication interface connecting each given base station with the given base station's neighboring base stations is extended to communicate parameter settings between the given base station and the neighboring base stations. An apparatus in each given base station receives from the given base station's neighboring base stations, parameter settings being utilized by the neighboring base stations for transmitting and/or receiving in associated neighboring cells. The apparatus utilizes the parameter settings received from the neighboring base stations as factors to determine local parameter settings for the given base station. The given base station then sends the local parameter settings and supplemental information to the neighboring base stations so that optimal network-wide parameter settings can be selected. | 09-27-2012 |
20120275327 | NETWORK-CENTRIC LINK ADAPTATION FOR COORDINATED MULTIPOINT DOWNLINK TRANSMISSION - A Coordinated MultiPoint (CoMP) cell controller performs network-centric link adaptation for User Equipment (UE) in the CoMP cell. The CoMP cell controller receives at least infrequent channel estimates from a UE in the CoMP cell, from which it estimates downlink channel and thermal noise at the UE. The CoMP cell controller is aware of the desired signal to be received at the UE, and the intra-CoMP cell interference to the UE caused by transmissions to other UEs in the CoMP cell. The CoMP cell receives from the UE reports of inter-CoMP cell interference caused by transmissions by other CoMP cells. Based on the downlink channel quality, the desired signal, the intra-CoMP cell interference, the inter-CoMP cell interference, and the thermal noise, the CoMP cell controller performs link adaptation by selecting modulation and coding schemes, and other transmission parameters, for an upcoming transmission duration (such as a TTI). | 11-01-2012 |
20120288022 | CHANNEL ESTIMATION FOR A VERY LARGE-SCALE MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) SYSTEM - A transmitter, receiver, and method for channel estimation for a Multiple-Input Multiple-Output (MIMO) communication system in which the transmitter includes a multiplicity of transmit antennas spaced such that spacing between adjacent antennas provides a spatial correlation coefficient greater than a threshold level. The transmitter selects a subset of the multiplicity of transmit antennas for transmitting the pilot reference signals. The pilot reference signals are transmitted only from the selected subset of transmit antennas to the receiver. The receiver includes a channel estimator configured to derive a channel estimation for all of the multiplicity of transmit antennas using the received pilot reference signals and known or estimated spatial correlation among the multiplicity of transmit antennas. | 11-15-2012 |
20120300654 | Adaptive Feedback of Channel Information for Coordinated Transmission on a Wireless Backhaul - A backhaul link is established between a base station and a relay that assists the base station in communicating with a mobile device over an access link established between the relay and the mobile device. The channel response of the back-haul link is determined by estimating first and second parts of the backhaul link channel response, the second part changing faster than the first part. The first part of the backhaul link channel response is estimated by calculating an average of the backhaul link channel response over a predetermined period at the relay and the second part is estimated by calculating variation in the backhaul link channel response over the predetermined period at the relay. Quantized versions of the first and second parts of the backhaul link channel response are transmitted from the relay to the base station over the backhaul link | 11-29-2012 |
20130017855 | DISTRIBUTED BEAM SELECTION FOR CELLULAR COMMUNICATIONAANM HUI; DennisAACI SunnyvaleAAST CAAACO USAAGP HUI; Dennis Sunnyvale CA USAANM Guey; Jiann-ChingAACI FremontAAST CAAACO USAAGP Guey; Jiann-Ching Fremont CA US - A group of multiple base stations implements distributed and coordinated antenna beamforming selection to achieve increased performance. Each of the base stations in the group determines an associated optimal set of antenna beam direction parameters in a distributed manner based on local radio information exchanged between neighboring ones of the base stations. Each of the base stations transmits to one or more user equipments (UEs) served by that base station using its associated optimal set of beam direction parameters. The local radio information generated by one of the base stations indicates how the transmissions of its neighbor base stations affect the performance of the base station. The performance of a base station may be measured by the difficulty or challenge in maintaining a minimum desired signal quality, e.g., a minimum SINR, for the UE served by the base station. | 01-17-2013 |
20130072131 | Method, Apparatus and System For Choosing a Parameter Setting From a Set of Available Parameter Settings - A system comprises a communication device that chooses a parameter setting from a set of available parameter settings. The system may include multiple communication devices, and each available parameter setting may have an associated cost. The communication device may receive parameter setting information from one or more other communication devices in the system, and the parameter setting information may identify the parameter setting being used by the one or more communication devices in the system. The communication device may choose a parameter setting that is associated with the lowest cost based on the parameter setting information received from the one or more other communication devices in the system. | 03-21-2013 |
20130077658 | SPATIALLY RANDOMIZED PILOT SYMBOL TRANSMISSION METHODS, SYSTEMS AND DEVICES FOR MULTIPLE INPUT/MULTIPLE OUTPUT (MIMO) WIRELESS COMMUNICATIONS - Compressive sampling is used to generate pilot symbols to be transmitted over an array of antennas in a MIMO wireless communications device. A pilot symbol is transmitted over the array of antennas according to a spatially randomized antenna transmission function that randomly changes across the array of antennas. The randomized antenna transmission function may randomly select/deselect antennas and/or randomly change amplitude and/or phase of the pilot symbol transmission. Channel estimates can be constructed at a receiver based on the spatially randomized pilot symbols that were transmitted. | 03-28-2013 |
20130109421 | Adaptation of Parameters in a Communication Network | 05-02-2013 |
20130114468 | DYNAMIC SPACE DIVISION DUPLEX (SDD) WIRELESS COMMUNICATIONS WITH MULTIPLE ANTENNAS USING SELF-INTERFERENCE CANCELLATION - A system and method to perform Full Duplex (FD) Space Division Duplex (SDD) communication using a Self-Interference Cancelling (SIC) precoder that applies different antenna phase shifts and amplitude scales to the transmitted signals to force them to be in the null space of the selected receive antennas. Thus, a wireless communication unit can place nulls at each of its receive antennas digitally at baseband for one or more frequency bands. The SIC precoder may be computed based on the self-interference channel from the transmit chain(s) to the receive chain(s). Different SIC precoders may be adaptively selected and stored digitally for different frequency bands. Subsequent single or multi-user precoder can be applied in concatenation with the SIC precoder to transmit signals to one or more users while receiving signals from one or more users simultaneously over the same frequency band. | 05-09-2013 |
20130121448 | CHANNEL ESTIMATION AND EQUALIZATION FOR HARD-LIMITED SIGNALS - The present invention provides a method and apparatus for channel estimation when the amplitude of a received signal is hard-limited. A channel estimator computes amplitude estimates for the received signal based on the phase samples of the received signal. The amplitude estimates may comprise the expected values of the amplitude given the phase samples. The channel estimator then computes revised channel estimates based on the amplitude estimates and the phase samples. The process may be performed iteratively to refine the channel estimates during each iteration. | 05-16-2013 |
20130128785 | ENERGY EFFICIENT OPERATION FOR DENSE DEPLOYMENT OF WIRELESS ACCESS NODES - Systems and methods are disclosed for providing energy efficient operation for wireless access nodes in a dense deployment of wireless access nodes in a cellular communication network. In one particular embodiment, wireless access nodes form a super dense network. In one embodiment, a wireless access node in a dense deployment of wireless access nodes in a cellular communication network includes a transmitter and a receiver that are operated according to a discontinuous transmit and a discontinuous receive mode of operation. The wireless access node controls one or more duty cycles for the discontinuous transmit and discontinuous receive mode of operation based on an alertness state of the wireless access node. In one embodiment, the one or more duty cycles increase as the alertness state of the wireless access node increases. In this manner, the wireless access node is operated in an energy efficient manner. | 05-23-2013 |
20130128788 | ENERGY EFFICIENT OPERATION FOR WIRELESS ACCESS NODES IN A LOW-LOAD SERVICE AREA WITHIN A DENSE DEPLOYMENT OF WIRELESS ACCESS NODES - Systems and methods are disclosed for efficient operation of wireless access nodes in a dense deployment of wireless access nodes in a cellular communication network. In general, the dense deployment of wireless access nodes includes multiple wireless access nodes in a service area. The service area is preferably, but not necessarily, a low-load service area. As used herein, a low-load service area is an area within an overall service area of the dense deployment of wireless access nodes in which all wireless access nodes are not needed to provide a desired data capacity. Overlapping radio coverage areas of the wireless access nodes in, or serving, the service area are leveraged to enable efficient operation of the wireless access nodes in the service area. | 05-23-2013 |
20130136210 | Metric Corrections for Demodulators Using Serial Localization with Indecision - Demodulation methods and apparatus for a multi-stage SLI demodulator are disclosed. Residual signals from each demodulation stage are modeled as finite sets of unresolved signals and a new metric is introduced for use in search of best candidate symbol estimates. The metric may be evaluated based on a probability distribution function of the residual signals or a probability mass function of the unresolved signals. The metric may also be approximated by the sum of a conventional Euclidean metric and a correction metric. The best candidate symbol estimates generated from each stage of the multi-stage SLI demodulator are summed to form cumulative symbol estimates. | 05-30-2013 |
20130142078 | SYSTEMS AND METHOD FOR GRAPH-BASED DISTRIBUTED PARAMETER COORDINATION IN A COMMUNICATION NETWORK - Systems and method are disclosed for graph-based distributed parameter coordination in a communication network. In general, discrete local parameters to be coordinated among communication nodes in the network and their respective performance metrics, or costs, are modeled using a factor graph. Based on the factor graph, a variant of the sum-product algorithm, namely the min-sum algorithm, is applied in order for the communication nodes, through iterative message passing with their neighboring communication nodes, to decide upon optimal values for the local parameters for the communication nodes that collectively optimize a global performance metric across the communication network. In one embodiment, the communication network is a wireless communication network. In one specific embodiment, the wireless communication network is a cellular communication network. | 06-06-2013 |
20130142082 | GRAPH-BASED DISTRIBUTED COORDINATION METHODS FOR WIRELESS COMMUNICATION NETWORKS - Systems and methods are disclosed for graph-based distributed parameter coordination in a communication network. In general, discrete local parameters to be coordinated among communication nodes in the communication network and their respective performance metrics, or costs, are modeled using a factor graph. Based on the factor graph, a variant of the sum-product algorithm, namely the min-sum algorithm, is applied in order for the communication nodes, through iterative message passing with their neighboring communication nodes, to decide upon optimal values for the local parameters for the communication nodes that collectively optimize a global performance metric across the communication network. In one embodiment, the communication network is a wireless communication network. In one specific embodiment, the wireless communication network is a cellular communication network. | 06-06-2013 |
20130148706 | EXPLOITING CHANNEL TIME CORRELATION TO REDUCE CHANNEL STATE INFORMATION FEEDBACK BITRATE - The required bitrate for reporting channel state information from a network transceiver to the network is dramatically reduced, while maintaining fidelity of channel estimates, by exploiting prior channel estimates and the time correlation of channel response. For a selected set of sub-carriers, the transceiver estimates channel frequency response from pilot signals. The transceiver also predicts the frequency response for each selected sub-carrier, by multiplying a state vector comprising prior frequency response estimate and a coefficient vector comprising linear predictive coefficients. The predicted frequency response is subtracted from the estimated frequency response, and the prediction error is quantized and transmitted to the network. The network maintains a corresponding state vector and predictive coefficient vector, and also predicts a frequency response for each selected sub-carrier. The received prediction error is inverse quantized and subtracted from the predicted frequency response to yield a frequency response corresponding to that estimated at the transceiver. | 06-13-2013 |
20130259164 | ENHANCED METRICS FOR DEMODULATION AND SOFT INFORMATION GENERATION IN THE PRESENCE OF A NON-CONSTANT ENVELOPE MODULATED INTERFERER - Systems and methods utilize enhanced metrics for demodulation and/or soft bit information generation in the presence of a non-constant envelope modulated interfering signal. In one embodiment, a receiver includes a downconverter and a demodulator. The downconverter receives a radio frequency signal comprising a desired signal, noise, and a non-constant envelope modulated interfering signal, and downconverts the radio frequency signal to provide a downconverted signal. The demodulator demodulates the downconverted signal based on a demodulation metric that models the non-constant envelope modulated interfering signal as a stationary non-Gaussian random process with a probability distribution derived from a modulation constellation of a modulation used for the non-constant envelope modulated interfering signal. In one embodiment, the demodulator outputs demodulated symbols. In another embodiment, the demodulator outputs soft bit information. | 10-03-2013 |
20130294593 | NETWORK NODES PROVIDING PRE-CALL AND DURING CALL ADVERTISING - A voice call network node communicates advertisements to user terminals of a telecommunications system. The voice call network node includes a voice call handling component and an advertisement insertion component. The voice call handling component responds to a voice call from a caller user terminal by identifying characteristics of the caller user terminal and/or the callee user terminal. The advertisement insertion component communicates voice call profile information through a network to an advertisement service offering node. The voice call profile information identifies characteristics of the caller user terminal and/or the callee user terminal The advertisement insertion component also receives an advertisement from the advertisement service offering node responsive to the communicated voice call profile information, and communicates the advertisement to the caller user terminal and/or to the callee user terminal Related advertisement service offering nodes and user terminals are disclosed. | 11-07-2013 |
20130308616 | Time Slot Sharing in TDMA Communication System - The embodiments of the present invention relate to a method in a transmitting unit; a method in a receiving unit; a transmitting unit and a receiving unit, in a wireless communication network employing Time Division Multiple Access, TDMA, for transmitting and, receiving and demodulating data, respectively, the data being transmitted in a signal comprising a burst, wherein bursts relating to N | 11-21-2013 |
20140029511 | METHODS OF TRANSMITTING USING FILTERING IN THE TIME DOMAIN AND RELATED DEVICES - Methods may be provided to transmit data from a wireless terminal operating in a radio access network. For example, sampling rate conversion may be performed on a serial stream of modulation symbols to generate sampling rate converted symbols, and the sampling rate converted symbols may be transmitted over a wireless channel to a node of the radio access network. Related terminals are also discussed. | 01-30-2014 |
20140044202 | COMMUNICATING OVER A DESIRED TONE IN THE PRESENCE OF INTERFERENCE HAVING AN UNKNOWN MAGNITUDE THAT IS SUBSTANTIALLY CONSTANT - Methods and systems are disclosed for transmitting data over a desired frequency tone in the presence of an interference that has an unknown magnitude that is substantially constant. In general, data symbols are transmitted in a null space of the desired frequency tone. The null space of the desired frequency tone is orthogonal to the desired frequency tone. As such, the data symbols transmitted in the null space of the desired frequency tone are not interfered with by the interference at the desired frequency tone regardless of the magnitude of the interference. The data symbols transmitted in the null space of the desired frequency tone can then be recovered by a receiver without estimation of or compensation for the interference at the desired frequency tone. | 02-13-2014 |
20140086080 | METRIC COMPUTATION FOR INTERFERENCE-AWARE ROUTING - Systems and methods for computing and/or utilizing mutual information based link metrics for a link in a wireless mesh network are disclosed. In one embodiment, one or more mutual information values are computed for a link between a transmitter of a first network node and a receiver of a second network node in a wireless mesh network. Each of the one or more mutual information values is computed for a different hypothesized transmission mode for the link. One or more link metrics for the link are computed as a function of the mutual information values, where each link metric is computed based on a different one of the one or more mutual information values. In this manner, a link metric is computed for each of the one or more hypothesized transmission modes for the link. At least one of the link metrics are then provided to a routing update module. | 03-27-2014 |
20140092745 | LINK ADAPTATION FOR A MULTI-HOP ROUTE IN A WIRELESS MESH NETWORK - Systems and methods for link adaptation for a multi-hop route in a wireless mesh network are disclosed. In one embodiment, a wireless mesh network includes network nodes in a route through the wireless mesh network. The network nodes determine a bottleneck information flow rate for the route based on backward propagation of information indicative of a tentative bottleneck information flow rate for the route from an ending network node to a starting network node through one or more intermediate network nodes. A target information flow rate for the route that is less than or equal to the bottleneck information flow rate for the route is determined. A Modulation and Coding Scheme (MCS) and, in some embodiments, a transmission mode is determined for each network node in the route other than the ending network node based on forward propagation of information indicative of the target information flow rate for the route. | 04-03-2014 |
20140161030 | Methods and Devices for Transmission of Signals in a Telecommunication System - Methods and devices for generating training symbols to be transmitted in a radio network are provided for a radio system where multiple users are sharing the same transmission slot. The method involves forming a sequence of training symbols by repeating an initial block of training symbols and for each user rotating the repeated block by a user specific rotation angle. A rotated block is periodically extended in both ends. | 06-12-2014 |
20140204896 | METHOD OF DOWNLINK SIGNAL TRANSPORT OVER BACKHAUL COMMUNICATIONS THROUGH DISTRIBUTED PROCESSING - The amount of multi-antenna signals to be transmitted over the backhaul in a Coordinated MultiPoint (CoMP) system from the central processor (CP) to each base station is reduced. Embodiments of the present invention exploit characteristics of the underlying signal structure, and distribute some baseband processing functionalities—such as channel coding and the application of the multi-user precoding—from the CP to the remote base stations. Additionally, in some embodiments the non-precoded parts of multi-antenna signals are broadcast from the CP to all base stations in the CoMP system, to further reduce the burden on backhaul communications. In one embodiment, the backhaul network is a Gigabit-capable Passive Optical Network (GPON). | 07-24-2014 |
20140219377 | CHANNEL ESTIMATION FOR A VERY LARGE-SCALE MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) SYSTEM - A transmitter, receiver, and method for channel estimation for a Multiple-Input Multiple-Output (MIMO) communication system in which the transmitter includes a multiplicity of transmit antennas spaced such that spacing between adjacent antennas provides a spatial correlation coefficient greater than a threshold level. The transmitter selects a subset of the multiplicity of transmit antennas for transmitting the pilot reference signals. The pilot reference signals are transmitted only from the selected subset of transmit antennas to the receiver. The receiver includes a channel estimator configured to derive a channel estimation for all of the multiplicity of transmit antennas using the received pilot reference signals and known or estimated spatial correlation among the multiplicity of transmit antennas. | 08-07-2014 |
20140286267 | EFFICIENT UPLINK TRANSMISSION OF CHANNEL STATE INFORMATION - A User Equipment in a wireless communication network includes a multiplicity of antennas, from which a subset of antennas is selected using a selection scheme synchronized to the network. A set of sub-carriers is selected from a plurality of sub-carriers using a selection scheme synchronized to the network. The UE receives a plurality of known reference symbols over the selected set of sub-carriers and through the selected subset of antennas. A frequency response for each selected sub-carrier is estimated over only the selected subset of antennas. The results are quantized and transmitted to the network on an uplink control channel. | 09-25-2014 |
20140294104 | COMMUNICATING OVER A DESIRED TONE IN THE PRESENCE OF INTERFERENCE HAVING AN UNKNOWN MAGNITUDE THAT IS SUBSTANTIALLY CONSTANT - Methods and systems are disclosed for transmitting data over a desired frequency tone in the presence of an interference that has an unknown magnitude that is substantially constant. In general, data symbols are transmitted in a null space of the desired frequency tone. The null space of the desired frequency tone is orthogonal to the desired frequency tone. As such, the data symbols transmitted in the null space of the desired frequency tone are not interfered with by the interference at the desired frequency tone regardless of the magnitude of the interference. The data symbols transmitted in the null space of the desired frequency tone can then be recovered by a receiver without estimation of or compensation for the interference at the desired frequency tone. | 10-02-2014 |
20150071174 | BACKHAUL SIGNAL COMPRESSION THROUGH SPATIAL-TEMPORAL LINEAR PREDICTION - The technology in this application compresses multi-antenna, complex-valued signals by exploiting both a spatial and a temporal correlation of the signals to remove redundancy within the complex-valued signals and substantially reduce the capacity requirement of backhaul links. At a receiver, the compressed signal is received, and a decompressor decompresses the received signal over space and over time to reconstruct the multiple antenna stream. | 03-12-2015 |
20150117435 | Transmitter for Transmitting Discovery Signals, A Receiver and Methods Therein - A transmitter | 04-30-2015 |
20150131524 | REDUCED-SIZE MESSAGE PASS IN FACTOR GRAPHS FOR WIRELESS COMMUNICATIONS NETWORKS - Systems and methods are disclosed for graph-based distributed parameter coordination in a communications network. In general, discrete local parameters to be coordinated among communication nodes in the communications network and their respective performance metrics, or costs, are modeled using a factor graph. Based on the factor graph, a variant of a sum-product algorithm, namely the min-sum algorithm, is applied in order for the communication nodes, through iterative message passing of reduced size messages with their neighboring communication nodes, to decide upon optimal values for the local parameters for the communication nodes that collectively optimize a global performance metric across the communications network. In one embodiment, the communications network is a wireless communications network. In one specific embodiment, the wireless communications network is a cellular communications network. | 05-14-2015 |
20150146655 | DISTRIBUTED ROUTING IN WIRELESS NETWORKS - Systems and methods related to distributed route determination through a multi-hop wireless network based on multiple route metrics or properties are disclosed. In some embodiments, a method of operation of a network node comprises identifying a subset of neighbors of the network node in a wireless network based on: (a) link weight(s) for links from the network node to at least some of the neighbors of the network node with respect to route metric(s) and (b) defined limit(s) for the route metric(s). The method further comprises obtaining second link weights for the links from the network node to at least the subset of the neighbors with respect to a second route metric, and identifying from the subset of the neighbors, an optimal next hop neighbor for the network node. In this manner, multiple route metrics are taken into consideration in manner that is computationally efficient. | 05-28-2015 |
20150195033 | SELECTION OF COOPERATIVE STRATEGIES FOR RELAY NODES IN A WIRELESS NETWORK TO ENHANCE DATA THROUGHPUT - Systems and methods are disclosed for selecting cooperative strategies for relay nodes in a wireless network. In one embodiment, a cooperative strategy for a relay node in a wireless network is selected from a set of two or more cooperative strategies. The cooperative strategy defines a manner in which the relay node relays messages along a multi-hop route through the wireless network. Use of the cooperative strategy by the relay node is then effected. In one embodiment, the cooperative strategy is selected based on one or more channel quality based criteria. By selecting the cooperative strategy for the relay node, and in one preferred embodiment selecting cooperative strategies for all other relay nodes in the multi-hop route, performance of the wireless network can be improved. | 07-09-2015 |
20150237563 | Method for Improving Data Throughput in Wireless Networks - The proposed layer solution defines two or more layers of relay nodes to convey traffic data from a source node to a destination node. All of the nodes in a given layer were selected for that layer because they each satisfied a signal quality requirement specified for that layer, where all relay nodes defined in one layer simultaneously start transmitting in response to a received transmission. Due to the layered approach, the destination node may be configured to decode only the traffic data relayed by the relay nodes in the immediately preceding (final) layer while treating any remaining received signals as noise. As a result, only those access nodes most likely to significantly contribute to and improve the signal quality of traffic data received at the destination node are selected as relay nodes for a particular source-destination node pair. | 08-20-2015 |
20150264583 | Antenna Beam Control - Spatial sensor data, such as position, movement and rotation, which is provided by a sensor in a wireless communication device in a wireless communication system is used. By using the spatial sensor data it is possible to calculate predicted spatial data for use in controlling antenna beams for transmission as well as reception in the wireless communication system. | 09-17-2015 |
20150304207 | Route Determination in a Multi-Hop Network Using Multiple Routing Metrics - The proposed technology provides a computationally efficient way to find suitable routes under consideration of multiple metrics. The considered multi-hop network is represented by a connected graph having nodes and links interconnecting the nodes. The method comprises the step (S | 10-22-2015 |
20150312906 | Methods and Apparatus for Routing Communication using Slotted Resources of Radio Access Mesh Networks - Methods and network nodes ( | 10-29-2015 |
20160050612 | AGGREGATION-NODE SELECTION USING VIRTUAL HUB - A route determination method is provided in a multi-hop network having a number of nodes, where at least two nodes are target nodes. The multi-hop network includes a fictitious node having fictitious links to at least two of the target nodes. The method includes determining, at least part of one or more extended routes for connecting one or more of the nodes included in the multi-hop network, to the fictitious node and determining, at least a part of a route in the multi-hop network, using the at least part of one or more extended routes. Other methods and devices are disclosed for route determination in a multi-hop network have several gateways or aggregation nodes for connecting to a communication network, and for routing in a multi-hop network. | 02-18-2016 |
20160127919 | EFFICIENT BEAM SCANNING FOR HIGH-FREQUENCY WIRELESS NETWORKS - Systems and methods relating to non-adaptive beam scanning in a wireless network are disclosed. In some embodiments, a method of operation of a transmit node to perform non-adaptive beam scanning for transmit beam patterns of the transmit node that partition a service coverage area of the transmit node into transmit partition cells is provided. The method transmitting a known signal using each of multiple scanning beam patterns for each of multiple beam scanning stages over non-overlapping radio resource slots. The scanning beam patterns for the beam scanning stages are such that each unique combination of scanning beam patterns consisting of one scanning beam pattern from each of the beam scanning stages corresponds to a different transmit beam pattern of the transmit node. This multi-stage beam scanning approach provides an exponentially more efficient process for beam scanning than the conventional Sequential Beam Sweeping (SBS) approach. | 05-05-2016 |
Dennis Hui, Sunnyvalle, CA US
Patent application number | Description | Published |
---|---|---|
20120190389 | BACKHAUL SIGNAL COMPRESSION THROUGH SPATIAL-TEMPORAL LINEAR PREDICTION - The technology in this application compresses multi-antenna complex-valued signals by exploiting both a spatial and a temporal correlation of the signals to remove redundancy within the complex-valued signals and substantially reduce the capacity requirement of backhaul links. At a receiver, the compressed signal is received, and a decompressor decompresses the received signal over space and over time to reconstruct the multiple antenna stream. | 07-26-2012 |
Elliot Hui, Irvine, CA US
Patent application number | Description | Published |
---|---|---|
20100167330 | MICROMECHANICAL DEVICES FOR CONTROL OF CELL-CELL INTERACTION, AND METHODS OF USE THEREOF - The development and function of living tissues depends largely on interactions between cells that can vary in both time and space; however, temporal control of cell-cell interaction is experimentally challenging. By employing a micromachined silicon substrate with moving parts, herein is disclosed the dynamic regulation of cell-cell interactions via direct manipulation of adherent cells with micron-scale precision. The inventive devices and methods allow mechanical control of both tissue composition and spatial organization. The inventive device and methods enable the investigation of dynamic cell-cell interaction in a multitude of applications, such as intercellular communication, spanning embryogenesis, homeostasis, and pathogenic processes. | 07-01-2010 |
Frank Hui, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20110032742 | One-time programmable memory cell with shiftable threshold voltage transistor - According to one exemplary embodiment, a one-time programmable memory cell includes an access transistor coupled to a shiftable threshold voltage transistor between a bitline and a ground, where the access transistor has a gate coupled to a wordline. The shiftable threshold voltage transistor has a drain and a gate shorted together. A programming operation causes a permanent shift in a threshold voltage of the shiftable threshold voltage transistor to occur in response to a programming voltage on the bitline and the wordline. In one embodiment, the access transistor is an NFET while the shiftable threshold voltage transistor is a PFET. In another embodiment, the access transistor is an NFET and the shiftable threshold voltage transistor is also an NFET. The programming voltage can cause an absolute value of the threshold voltage to permanently increase by at least 50.0 millivolts. | 02-10-2011 |
20110108903 | Method for fabricating a flash memory cell utilizing a high-K metal gate process and related structure - According to one exemplary embodiment, a method for fabricating a flash memory cell in a semiconductor die includes forming a control gate stack overlying a floating gate stack in a memory region of a substrate, where the floating gate stack includes a floating gate overlying a portion of a dielectric one layer. The floating gate includes a portion of a metal one layer and the dielectric one layer includes a first high-k dielectric material. The control gate stack can include a control gate including a portion of a metal two layer, where the metal one layer can include a different metal than the metal two layer. | 05-12-2011 |
20110210397 | One-time programmable semiconductor device - According to one embodiment, a one-time programmable (OTP) semiconductor device includes a programming dielectric under a patterned electrode and over an implant region, where the programming dielectric forms a programming region of the OTP semiconductor device. The OTP semiconductor device further includes an isolation region laterally separating the programming dielectric from a coupled semiconductor structure, where the isolation region can be used in conjunction with the patterned electrode and the implant region to protect the coupled semiconductor structure. In one embodiment, the programming dielectric comprises a gate dielectric. In another embodiment, the electrode and implant regions are doped to be electrochemically similar. | 09-01-2011 |
20120039106 | Programmable Memory Cell with Shiftable Threshold Voltage Transistor - According to one exemplary embodiment, a one-time programmable memory cell includes an access transistor coupled to a shiftable threshold voltage transistor between a bitline and a ground, where the access transistor has a gate coupled to a wordline. The shiftable threshold voltage transistor has a drain and a gate shorted together. A programming operation causes a permanent shift in a threshold voltage of the shiftable threshold voltage transistor to occur in response to a programming voltage on the bitline and the wordline. In one embodiment, the access transistor is an NFET while the shiftable threshold voltage transistor is a PFET. In another embodiment, the access transistor is an NFET and the shiftable threshold voltage transistor is also an NFET. The programming voltage can cause an absolute value of the threshold voltage to permanently increase by at least 50.0 millivolts. | 02-16-2012 |
20120039108 | One-Time Programmable Memory Cell - According to one exemplary embodiment, a one-time programmable memory cell includes an access transistor coupled to a shiftable threshold voltage transistor between a bitline and a ground, where the access transistor has a gate coupled to a wordline. The shiftable threshold voltage transistor has a drain and a gate shorted together. A programming operation causes a permanent shift in a threshold voltage of the shiftable threshold voltage transistor to occur in response to a programming voltage on the bitline and the wordline. In one embodiment, the access transistor is an NFET while the shiftable threshold voltage transistor is a PFET. In another embodiment, the access transistor is an NFET and the shiftable threshold voltage transistor is also an NFET. The programming voltage can cause an absolute value of the threshold voltage to permanently increase by at least 50.0 millivolts. | 02-16-2012 |
20120326146 | Sacrificial Wafer Probe Pads Through Seal Ring for Electrical Connection to Circuit Inside an Integrated Circuit - The disclosure is directed to a semiconductor wafer, integrated circuit product, and method of making same, having multiple non-singulated chips separated by scribe lines, comprising a plurality of seal rings, each seal ring surrounding a corresponding chip and disposed between the corresponding chip and adjacent scribe lines. Well resistors are disposed below the seal rings and probe pads disposed in the scribe lines. In particular, at least one of the probe pads is coupled by at least one of the well resistors to at least one of the chips. | 12-27-2012 |
Hon C. Hui, San Mateo, CA US
Patent application number | Description | Published |
---|---|---|
20080207620 | MODULATORS OF PHARMACOKINETIC PROPERTIES OF THERAPEUTICS - The present application provides for a compound of Formula IV, | 08-28-2008 |
20080255214 | NOVEL HYDROXAMATES AS THERAPEUTIC AGENTS - The present invention is directed to certain hydroxamate derivatives that are useful in the treatment of hepatitis C. These compounds are also inhibitors of histone deacetylase and are therefore useful in the treatment of diseases associated with histone deacetylase activity. Pharmaceutical compositions and processes for preparing these compounds are also disclosed. | 10-16-2008 |
20080255221 | NOVEL HYDROXAMATES AS THERAPEUTIC AGENTS - The present invention is directed to certain hydroxamate derivatives that are useful in the treatment of hepatitis C. These compounds are also inhibitors of histone deacetylase and are therefore useful in the treatment of diseases associated with histone deacetylase activity. Pharmaceutical compositions and processes for preparing these compounds are also disclosed. | 10-16-2008 |
20090175820 | INHIBITORS OF CYTOCHROME P450 - The present application provides for a compound of Formula I, | 07-09-2009 |
20120237478 | MODULATORS OF PHARMACOKINETIC PROPERTIES OF THERAPEUTICS - The present application provides for a compound of Formula IV, | 09-20-2012 |
Hon Chung Hui, Foster City, CA US
Patent application number | Description | Published |
---|---|---|
20160122374 | METHODS FOR TREATING FILOVIRIDAE VIRUS INFECTIONS - Provided are compounds, methods, and pharmaceutical compositions for treating Filoviridae virus infections by administering ribosides, riboside phosphates and prodrugs thereof, of Formula IV: | 05-05-2016 |
Hon Chung Hui, San Mateo, CA US
Patent application number | Description | Published |
---|---|---|
20100143301 | MODULATORS OF TOLL-LIKE RECEPTORS - Provided are modulators of TLRs of Formula II: | 06-10-2010 |
20100189687 | MODULATORS OF PHARMACOKINETIC PROPERTIES OF THERAPEUTICS - The present application provides for a compound of Formula IV, or a pharmaceutically acceptable salt, solvate, and/or ester thereof, compositions containing such compounds, therapeutic methods that include the administration of such compounds, and therapeutic methods and include the administration of such compounds with at least one additional therapeutic agent. | 07-29-2010 |
20120003215 | PYRAZOLO[1,5-A]PYRIMIDINES FOR ANTIVIRAL TREATMENT - The invention provides compounds of Formula I or Formula II: | 01-05-2012 |
20130071354 | MODULATORS OF TOLL-LIKE RECEPTORS - Provided are modulators of TLRs of Formula II: | 03-21-2013 |
20130164280 | PYRAZOLO[1,5-A]PYRIMIDINES AS ANTIVIRAL AGENTS - The invention provides compounds and pharmaceutically acceptable salts and esters and compositions thereof, for treating viral infections. The compounds and compositions are useful for treating Pneumovirinae virus infection including Human respiratory syncytial virus infections. | 06-27-2013 |
20130273037 | COMPOUNDS AND METHODS FOR ANTIVIRAL TREATMENT - Compounds and pharmaceutically acceptable salts and esters and compositions thereof, for treating viral infections are provided. The compounds and compositions are useful for treating Pneumovirinae virus infections. The compounds, compositions, and methods provided are particularly useful for the treatment of Human respiratory syncytial virus infections. | 10-17-2013 |
20130274254 | INHIBITORS OF CYTOCHROME P450 (CYP3A4) - The present application provides for a compound of formula I, and related compounds, or a pharmaceutically acceptable salt, solvate, and/or ester thereof, compositions containing such compounds, therapeutic methods that include the administration of such compounds, and therapeutic methods that include the administration of such compounds with at least one additional therapeutic agent. | 10-17-2013 |
20130309197 | INHIBITORS OF CYTOCHROME P450 - The present application provides for a compound of formula I, or a salt thereof, compositions containing such compounds, therapeutic methods that include the administration of such compounds, and therapeutic methods that include the administration of such compounds with at least one additional therapeutic agent. | 11-21-2013 |
20140017199 | MODULATORS OF PHARMACOKINETIC PROPERTIES OF THERAPEUTICS - The present application provides for a compound of Formula IV, | 01-16-2014 |
20140072554 | PYRAZOLO[1,5-A]PYRIMIDINES FOR ANTIVIRAL TREATMENT - The invention provides compounds of Formula I or Formula II: | 03-13-2014 |
20140081022 | MODULATORS OF TOLL-LIKE RECEPTORS - Provided are modulators of TLRs of Formula II: | 03-20-2014 |
20140154240 | PYRAZOLO[1,5-A]PYRIMIDINES FOR ANTIVIRAL TREATMENT - The invention provides compounds of Formula I or Formula II: | 06-05-2014 |
20140316132 | MODULATORS OF TOLL-LIKE RECEPTORS - Provided are modulators of TLRs of Formula II: | 10-23-2014 |
20150139948 | MODULATORS OF PHARMACOKINETIC PROPERTIES OF THERAPEUTICS - The present application provides for a compound of Formula IV, | 05-21-2015 |
20150238501 | COMPOUNDS AND METHODS FOR ANTIVIRAL TREATMENT - Compounds and pharmaceutically acceptable salts and esters and compositions thereof, for treating viral infections are provided. The compounds and compositions are useful for treating Pneumovirinae virus infections. The compounds, compositions, and methods provided are particularly useful for the treatment of Human respiratory syncytial virus infections. | 08-27-2015 |
20160069915 | MODULATORS OF PHARMACOKINETIC PROPERTIES OF THERAPEUTICS - The present application provides for a compound of Formula IV, | 03-10-2016 |
Hongxiang Hui, Los Angeles, CA US
Patent application number | Description | Published |
---|---|---|
20090175787 | USE OF FRUCTOSE-BASED COMPOUNDS FOR THE DIAGNOSIS OF CANCER - This invention relates to compositions, methods utilizing fructose and other monosaccharides for the diagnosis of cancer. Cancer cells have shown a higher level of fructose utilization as compared to glucose. Further, cancer cells have shown a preferential use of fructose for nucleic acid synthesis. The present invention takes advantage of these features and provides for fructose or fructose-based compositions for the diagnosis of cancer using imaging techniques such as positron emission tomography. | 07-09-2009 |
20090232735 | USE OF FRUCTOSE-BASED THERAPIES FOR THE TREATMENT OF CANCER - The methods and compositions of the invention are based on the preferential utilization of fructose by cancer cells. This invention relates to compositions, methods and kits utilizing fructose and other monosaccharides for the treatment of cancer. This invention also relates to methods and kits for using compositions to mimic or corrupt metabolic pathways of fructose and/or signal transduction pathways related to cancer cells for the treatment of cancer. | 09-17-2009 |
Hua Hui, Foster City, CA US
Patent application number | Description | Published |
---|---|---|
20110188028 | METHODS AND SYSTEMS FOR HIERARCHICAL DE-ALIASING TIME-OF-FLIGHT (TOF) SYSTEMS - A TOF system acquires depth data using n≧3 modulation frequencies f | 08-04-2011 |
Hua Hui, San Carlos, CA US
Patent application number | Description | Published |
---|---|---|
20100331855 | Efficient Vision and Kinematic Data Fusion For Robotic Surgical Instruments and Other Applications - Robotic devices, systems, and methods for use in telesurgical therapies through minimally invasive apertures make use of joint-based data throughout much of the robotic kinematic chain, but selectively rely on information from an image capture device to determine location and orientation along the linkage adjacent a pivotal center at which a shaft of the robotic surgical tool enters the patient. A bias offset may be applied to a pose (including both an orientation and a location) at the pivotal center to enhance accuracy. The bias offset may be applied as a simple rigid transformation from the image-based pivotal center pose to a joint-based pivotal center pose. | 12-30-2010 |
Jason K. Hui, Fresno, CA US
Patent application number | Description | Published |
---|---|---|
20080264944 | FISHING ROD ENCLOSURE WITH MAGNETIC CLOSURE SYSTEM - The present invention provides for an enclosure having first and second interconnecting bodies, each body having a closed end and an open end. A first sleeve having a first grip portion and an insertion portion is attached to the open end of the first body of the enclosure. A second sleeve having a second grip portion is attached to the open end of the second body of the enclosure. The insertion portion of the first sleeve is configured to mate with the second sleeve. Magnets are mounted within cavities formed into the ends of the grip portions such that when the bodies of the enclosure are interconnected, the exposed ends of the magnetic members abut one another, thus producing an attractive magnetic force which aids in maintaining the connection of the two bodies of the enclosure. | 10-30-2008 |
John Hui, Long Beach, CA US
John Hui, Chino, CA US
Patent application number | Description | Published |
---|---|---|
20090288339 | UNATTENDED PLANT WATERING SYSTEM - An apparatus is provided for unattended watering of plants over an extended period of time utilizing a watering system that regulates a partial vacuum to control the discharge of water to the roots of the plants. A water reservoir is provided having an encapsulated interior cavity and an exterior exposed to ambient air, and having upper and lower ends. The reservoir is located above the root level of a plant to be watered. At least one drain opening is defined in the lower end of the reservoir. The upper end of the reservoir is closed and is provided with an adjustable valve, preferably a pinch valve, and an air conduit, preferably a flexible tube, that passes through the valve and extends between the interior and the exterior of the reservoir. The valve thereby interacts with the conduit to partially obstruct air flow through it, so as to maintain a partial vacuum in the upper end of the reservoir as water drains from the lower end of the reservoir. | 11-26-2009 |
20090288342 | UNATTENDED PLANT WATERING SYSTEM - An apparatus is provided for unattended watering of plants over an extended period of time utilizing a watering system that regulates a partial vacuum to control the discharge of water to the roots of the plants. A water reservoir is provided having an encapsulated interior cavity and an exterior exposed to ambient air, and having upper and lower ends. The reservoir is located above the root level of a plant to be watered. At least one drain opening is defined in the lower end of the reservoir. The upper end of the reservoir is closed and is provided with an adjustable valve, preferably a pinch valve, and an air conduit, preferably a flexible tube, that passes through the valve and extends between the interior and the exterior of the reservoir. The valve thereby interacts with the conduit to partially obstruct air flow through it, so as to maintain a partial vacuum in the upper end of the reservoir as water drains from the lower end of the reservoir. | 11-26-2009 |
John Shun Hui, Long Beach, CA US
Jonathan W Hui, Berkeley, CA US
Patent application number | Description | Published |
---|---|---|
20090279465 | Method for low power radio operation in a wireless packet network - A system and method allows devices to send and receive packets while using power to do so to the extent needed, thereby conserving power. | 11-12-2009 |
Jonathan W. Hui, Foster City, CA US
Patent application number | Description | Published |
---|---|---|
20110310765 | Method for Low Power Radio Operation in a Wireless Packet Network - A system and method allows devices to send and receive packets while using power to do so to the extent needed, thereby conserving power. | 12-22-2011 |
20120213124 | METHOD AND APPARATUS TO TRIGGER DAG REOPTIMIZATION IN A SENSOR NETWORK - In one embodiment, a probing technique allows a root node to determine whether to trigger reoptimization of a computer network represented by a directed acyclic graph (DAG) without injecting unnecessary traffic into the network. The root node may store and maintain information indicative of an ideal shape or topology of the DAG. During a normal DAG maintenance operation, the root node may transmit a DAG discovery request (probe request) that is configured to probe each node within the DAG for information used to determine a current topology of the DAG. In response, each node may record the information, e.g., routing and non-routing metrics, in a DAG discovery reply (probe reply) that is propagated to the root node. Upon receiving one or more replies, the root node may analyze the metrics to determine whether the current topology of the DAG deviates from the ideal DAG topology. The root node may thus determine DAG topology deviation upon probing at minimal cost. A number of algorithms may then be used to determine whether reoptimization, i.e., global repair, of the DAG is is required and, if so, the root node may dynamically trigger the global repair. | 08-23-2012 |
20120224487 | System and Method for Accepting Information from Routing Messages Into a List - A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a wireless link may be a function of the success rate experienced on that wireless link. | 09-06-2012 |
20120307624 | MANAGEMENT OF MISBEHAVING NODES IN A COMPUTER NETWORK - In one embodiment, a node in a computer network detects a misbehaving node in the computer network based on the misbehaving node acting in violation of one or more rules. As such, the node communicates information regarding the misbehaving node to a network management system (NMS), and then may receive isolation instructions from the NMS regarding how to isolate the misbehaving node from the computer network. Accordingly, the node may perform the isolation instructions. In another embodiment, the NMS receives the communicated information regarding the misbehaving node, and determines whether the misbehaving node should be isolated based on the communicated information. If so, then the NMS determines isolation instructions regarding how to isolate the misbehaving node from the computer network, and transmits them to one or more nodes in the computer network, accordingly. | 12-06-2012 |
20120307629 | SOURCE ROUTING CONVERGENCE IN CONSTRAINED COMPUTER NETWORKS - In one embodiment, a source routing device (e.g., root device) pre-computes diverse source-routed paths to one or more nodes in a computer network. Upon receiving a particular packet, the device forwards the particular packet on a source-routed first path of the pre-computed diverse paths. In the event the device implicitly detects failure of the first path, then it forwards a copy of the particular packet on a source-routed second path of the pre-computed diverse paths in response. In one embodiment, implicit failure detection comprises seeing a second (repeated) packet with the same identification within a certain time since the first packet, and the second packet is forwarded on the second path. In another embodiment, implicit failure detection comprises not seeing a link-layer acknowledgment returned or receiving an error notification from a node along the broken path, and a stored copy of the particular packet is forwarded on the second path. | 12-06-2012 |
20120307652 | LIGHTWEIGHT STORING MODE FOR CONSTRAINED COMPUTER NETWORKS - In one embodiment, a management device, such as a root node, monitors Internet Protocol (IP) overhead (e.g., IP header sizes during source-routing or route table sizes) within a directed acyclic graph (DAG) in a computer network. If it is determined that the IP overhead is above a configured threshold, then in response, a trigger is initiated to have devices within the DAG label-switch downward traffic directed away from the root node within the DAG. In another embodiment, a device communicating within a DAG stores IP routes corresponding to upward traffic from the device directed toward a root of the DAG, and IP-routes upward traffic based on the IP routes. Conversely, the device also stores labels corresponding to downward traffic from the device directed away from the root of the DAG, and label-switches downward traffic based on the labels, accordingly. | 12-06-2012 |
20120307653 | REACHABILITY RATE COMPUTATION WITHOUT LINK LAYER ACKNOWLEDGMENTS - In one embodiment, a device in a computer network receives a particular packet associated with a transmission attempts value, the associated transmission attempts value indicative of a first number of times a transmitter has attempted to transmit the particular packet. In response, the device increases by one a stored successful attempts value stored at the device, the stored successful attempts value indicative of a second number of times the device has received the same particular packet. As such, a reachability rate of a link from the transmitter to the device may be determined based on comparing the associated transmission attempts value to the stored successful attempts value. | 12-06-2012 |
20120307825 | MAINTAINED MESSAGE DELIVERY DURING ROUTING DOMAIN MIGRATION - In one embodiment, an ingress device of a first routing domain in a computer network buffers received packets, and in response to receiving a request from a particular node indicating that the particular node has migrated from the first routing domain to a second routing domain, determines how to reach the particular node in the second routing domain, and forwards the buffered received packets to the particular node in the second routing domain, accordingly. In another embodiment, a device in the first routing domain migrates from the first routing domain to a second routing domain, and determines its new IP address. The device may then send a request to the first ingress router to forward buffered packets for the device to the second routing domain at the new IP address, and may thus receive buffered packets forwarded from the first ingress router at the device in the second routing domain. | 12-06-2012 |
20130010615 | RAPID NETWORK FORMATION FOR LOW-POWER AND LOSSY NETWORKS - In one embodiment, a node joins a communication network, and in response to joining the network, operates in a rapid startup mode, wherein the node in rapid startup mode establishes network configurations rapidly by deemphasizing quality (optimality) of the network configurations. Subsequent to operating in the rapid startup mode (e.g., after some timer or explicit command), the node then operates in a robust mode, wherein the node in robust mode iteratively refines the network configurations to increase the quality of the network configurations. | 01-10-2013 |
20130013806 | EFFICIENT RENDEZVOUS FOR DISTRIBUTED MESSAGES IN FREQUENCY-HOPPING COMMUNICATION NETWORKS - In one embodiment, a rendezvous request message is generated (e.g., by a sender) that specifies a channel C and a rendezvous time T for which a distributed message is to be transmitted in a frequency-hopping computer network. The rendezvous request message is then transmitted on one or more channels used in the computer network based on reaching a plurality of intended recipients of the distributed message with the rendezvous request message prior to rendezvous time T. Accordingly, the distributed message is then transmitted on channel C at rendezvous time T. In another embodiment, a device receives a rendezvous request message, and in response to determining to honor the rendezvous request message, listens for the distributed message on channel C at rendezvous time T. | 01-10-2013 |
20130013809 | MANAGING HOST ROUTES FOR LOCAL COMPUTER NETWORKS WITH A PLURALITY OF FIELD AREA ROUTERS - In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network. | 01-10-2013 |
20130016612 | SELECTIVE TOPOLOGY ROUTING FOR DISTRIBUTED DATA COLLECTIONAANM Vasseur; Jean-PhilippeAACI Saint Martin DuriageAACO FRAAGP Vasseur; Jean-Philippe Saint Martin Duriage FRAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA US - In one embodiment, a device, such as a network management server, determines a traffic matrix of a mesh network, where the traffic matrix indicates an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices. One or more optimized root devices may then be selected for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic. As such, a DAG formation request may be transmitted to the selected root devices, carrying a characteristic for a corresponding DAG to form by the respective selected root devices that indicates which one or more types of traffic correspond to the corresponding DAG. | 01-17-2013 |
20130016757 | TIMING RE-SYNCHRONIZATION WITH REDUCED COMMUNICATION ENERGY IN FREQUENCY HOPPING COMMUNICATION NETWORKSAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA US - In one embodiment, a battery-operated communication device “quick-samples” a frequency hopping sequence at a periodic rate corresponding to a substantially low duty cycle, and is discovered by (e.g., attached to) a main-powered communication device. During a scheduled sample, the main-powered communication device transmits a control packet to be received by the battery-operated communication device, the control packet containing timing information and transmitted to account for worst-case clock drift error between the two devices. The battery-operated communication device responds to the control packet with a link-layer acknowledgment containing timing information from the battery-operated communication device. Accordingly, the two devices may re-synchronize their timing based on the timing information in the control packet and acknowledgment, respectively. | 01-17-2013 |
20130016758 | OVERLAYING INDEPENDENT UNICAST FREQUENCY HOPPING SCHEDULES WITH A COMMON BROADCAST SCHEDULEAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA US - In one embodiment, each device in a frequency hopping communication network independently determines its own local unicast listening schedule, and discovers a neighbor unicast listening schedule for each of its neighbors. The devices also synchronize to a common broadcast schedule for the network that simultaneously overlays a configured portion of all unicast listening schedules in the network. Accordingly, the device operate in a receive mode according to their local unicast listening schedule and the common broadcast schedule during the overlaid configured portion, and in a transmit mode according to each neighbor unicast listening schedule and the common broadcast schedule during the overlaid configured portion depending upon a destination of transmitted traffic. | 01-17-2013 |
20130016759 | POWER CONSERVATION AND LATENCY MINIMIZATION IN FREQUENCY HOPPING COMMUNICATION NETWORKSAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA US - In one embodiment, a communication device samples a particular frequency hopping sequence during only a particular specified sub-timeslot of a timeslot. If a transmission energy is not detected during the specified sub-timeslot, the device turns off its receiver for a remainder of the timeslot. Otherwise, it continues to sample the particular frequency hopping sequence for at least one or more additional sub-timeslots of the remainder of the timeslot. In another embodiment, a communication device determines whether a neighboring communication device is operating in a first mode or a second mode. If in the second mode, it transmits a transmission to the neighboring communication device starting at any sub-timeslot of the plurality of sub-timeslots. If in the first mode, it transmits the transmission to the neighboring communication device while ensuring that the transmission is actively energized during a particular specified sub-timeslot. | 01-17-2013 |
20130018993 | EFFICIENT USE OF DYNAMIC HOST CONFIGURATION PROTOCOL IN LOW POWER AND LOSSY NETWORKSAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Woo; Lik Chuen AlecAACI Union CityAAST CAAACO USAAGP Woo; Lik Chuen Alec Union City CA USAANM Hong; WeiAACI BerkeleyAAST CAAACO USAAGP Hong; Wei Berkeley CA US - In one embodiment, each of a plurality of devices in a computer network is configured to i) transmit a unicasted dynamic host configuration protocol (DHCP) solicit message to a neighbor device having a route to a border router as an assumed DHCP relay without regard to location of a DHCP server, and ii) operate as a DHCP relay to receive unicasted DHCP solicit messages and relay the solicit message to the border router of the network without regard to location of the DHCP server, and to relay a DHCP reply to a corresponding requestor device. | 01-17-2013 |
20130019005 | EFFICIENT ADMISSION CONTROL FOR LOW POWER AND LOSSY NETWORKSAANM Hui; Jonathan W.AACI Foster CityAAST CAAACO USAAGP Hui; Jonathan W. Foster City CA USAANM Vasseur; Jean-PhilippeAACI Saint Martin DuriageAACO FRAAGP Vasseur; Jean-Philippe Saint Martin Duriage FRAANM Ganesan; KarthikeyanAACI CampbellAAST CAAACO USAAGP Ganesan; Karthikeyan Campbell CA USAANM Jayaraman; VikramAACI CampbellAAST CAAACO USAAGP Jayaraman; Vikram Campbell CA US - In one embodiment, a centralized network management server (NMS) determines a network state of a low power and lossy network (LLN) based on resource utilization due to traffic in the LLN. The NMS also determines an admission state based on the network state, and admission control (network-wide and/or localized control) based on the admission state. As such, the centralized NMS can then administer the admission control for all nodes in the LLN, where network-wide control comprises a single control command to all nodes in the LLN, and the nodes direct admission based on the control command, and where localized control comprises a request-response exchange between the nodes and the centralized NMS, and the NMS directs admission on a per-request basis. | 01-17-2013 |
20130022042 | DELAY BUDGET BASED FORWARDING IN COMMUNICATION NETWORKS - In one embodiment, certain nodes in a computer network maintain a plurality of routing topologies, each associated with a different corresponding delay (e.g., dynamically adjusted). Upon receiving a packet with an indicated delay budget at a particular node, the node updates the delay budget based on an incurred delay up to and including the particular node since the indicated delay budget was last updated, and selects a particular routing topology on which to forward the packet based on the updated delay budget and the corresponding routing topology delays. The packet may then be forwarded with the updated delay budget on the selected routing topology, accordingly. | 01-24-2013 |
20130022046 | DIVERSE PATH FORWARDING THROUGH TRIAL AND ERROR - In one embodiment, a node determines an intention to transmit a diversely forwarded packet through a computer network, and as such, transmits a first version of the packet having a packet identifier (ID) and a first distinguisher value to a first next-hop node, and transmits a second version of the packet having the same packet ID and a second distinguisher value different from the first distinguisher value to a second next-hop node different from the first next-hop node. In another embodiment, a next-hop node that receives the packet determines whether any previously received packet at the next-hop node had a same packet ID and a different distinguisher value. In response to determining that no previously received packet has the same packet ID and different distinguisher value, the next-hop node stores the packet ID and the distinguisher value, and forwards the packet to a selected next-hop node. | 01-24-2013 |
20130022053 | PACKET TRAINS TO IMPROVE PACKET SUCCESS RATE IN CARRIER SENSE MULTIPLE ACCESS NETWORKS - In one embodiment, a communication device operates according to a particular frequency hopping sequence in a communication network, and receives a first packet with an indication that the first packet is part of a particular packet train, the packet train comprising a plurality of packets to be transmitted in succession. Accordingly, the communication device prevents transmission until receiving a final packet of the packet train, and stores received packets of the particular packet train while preventing the transmission. | 01-24-2013 |
20130022083 | SUB-SLOTTING TO IMPROVE PACKET SUCCESS RATE IN CARRIER SENSE MULTIPLE ACCESS NETWORKS - In one embodiment, a communication device in a frequency hopping communication network determines an intention to forward a first packet in a particular timeslot of a frequency hopping sequence. As such, the device scans in receive mode for an initial portion of the particular timeslot on a particular frequency known to neighbors of the communication device for reaching the communication device. In response to determining that the communication device is receiving a second packet during the initial portion, the device remains in receive mode to receive a remainder of the second packet. Conversely, in response to not receiving the second packet during the initial portion, the device proceeds to transmit the first packet during a remainder of the particular timeslot. | 01-24-2013 |
20130022084 | DYNAMIC COMMON BROADCAST SCHEDULE PARAMETERS FOR OVERLAYING AN INDEPENDENT UNICAST SCHEDULE - In one embodiment, each device in a frequency hopping communication network operates according to a common broadcast schedule for the network that simultaneously overlays a configured portion of all independently determined unicast listening schedules in the network, wherein the overlaid configured portion is based on broadcast schedule parameters consisting of a first time spent for broadcast transmissions in each broadcast period and a second time between broadcast periods. By monitoring network characteristics relating to unicast traffic and broadcast traffic in the network, updated broadcast schedule parameters may then be determined based on the network characteristics. Operation of the common broadcast schedule may thus be updated with the updated broadcast schedule parameters, accordingly. | 01-24-2013 |
20130024560 | CENTRALLY DRIVEN PERFORMANCE ANALYSIS OF LOW POWER AND LOSSY NETWORKS - In one embodiment, a centralized device for a computer network divides the computer network into one or more regions for which performance is to be measured, and selects one or more nodes within each respective region of the one or more regions. The centralized device may then send a performance measurement request (PMR) to the selected node(s) for each region, and receives measured performance reports from the selected node(s) for each region in response to the PMR. Accordingly, based on the measured performance reports, the centralized device may then adjust at least one of either the divided regions or the selected node(s) for one or more of the one or more regions, e.g., for future PMRs. | 01-24-2013 |
20130028095 | DYNAMIC ALLOCATION OF CONTEXT IDENTIFIERS FOR HEADER COMPRESSION - In one embodiment, routable traffic through one or more border routers between a local computer network and a global computer network is monitored in order to characterize use of one or more global prefixes of the traffic. A particular set of the global prefixes, up to a maximum number, that are most frequently used may be mapped into a set of context identifiers (IDs) having a shorter bit-length than the global prefixes. The context IDs may then be distributed into the local computer network, and the one or more border routers convert between the context IDs and the global prefixes, accordingly. | 01-31-2013 |
20130028103 | LINK RELIABILITY METRICS IN COMMUNICATION NETWORKS - In one embodiment, a transmitter in a communication network receives an indication of active transmission times of a receiver to which the transmitter attempts to reach with first transmissions, the active transmission times indicating respective times of second transmissions initiated by the receiver. Based on determining when the first transmissions occur, the transmitter may then compute a link reliability metric for a link from the transmitter to the receiver by excluding one or more of the first transmissions from the indicated active transmission times of the second transmissions. In one embodiment, the active transmission times are in the past and the reliability metric excludes any first transmissions in the past during those times, while in another embodiment the active transmission times are scheduled in the future and the reliability metric does not include any first transmissions since the first transmissions may be scheduled to avoid the active transmission times. | 01-31-2013 |
20130028104 | ESTIMATED TRANSMISSION OVERHEAD (ETO) METRICS FOR VARIABLE DATA RATE COMMUNICATION LINKS - In one embodiment, an expected transmission count (ETX) link metric is computed for a link between a transmitter and a receiver in a communication network, the ETX representative of an expected number of transmissions necessary for a message to be successfully received by the receiver over the link, and a data rate of the link at which the ETX is computed is also determined. From these, an estimated transmission overhead (ETO) link metric for the link may be computed by dividing the ETX by the data rate. In one embodiment, the data rate of the link may be adjusted based on the ETO (e.g., to minimize the ETO). In another embodiment, routes through the communication network may be selected based on ETO values along the route. | 01-31-2013 |
20130028140 | USING SERVICE DISCOVERY TO BUILD ROUTING TOPOLOGIES - In one embodiment, a particular route optimizing device of a computer network (e.g., an NMS or a device in the network) discovers one or more registered services for the computer network, the registered services indicating one or more corresponding routing characteristics associated with the respective registered service. By comparing the one or more service-related routing characteristics with a current routing characteristic of a routing topology of the computer network (where the routing topology built based on a current routing topology strategy), it can be determined whether to update the routing topology strategy based on the comparison. In response to determining to update the routing topology strategy, one or more devices in the computer network may then be informed of an updated routing topology strategy and associated service-related routing characteristics, where the one or more devices are configured to update the routing topology based on the updated routing topology strategy, accordingly. | 01-31-2013 |
20130028143 | REDUCED TOPOLOGY ROUTING IN SHARED MEDIA COMMUNICATION NETWORKS - In one embodiment, a particular node in a shared communication network determines a current path cost in a routing topology from itself to a root node via a current parent node. The particular node also determines a respective path cost from each reachable potential parent node of the particular node to the root node via each potential parent and a respective link metric to each potential parent node. A set of acceptable parent nodes are determined from the potential parent nodes that have a respective path cost that is less than the current path cost plus an acceptable cost increase, and also have a respective link metric that is within an acceptable range. By determining a respective number of child nodes for each acceptable parent node, the particular node may then select a new parent node based on giving preference to those having a greater respective number of child nodes. | 01-31-2013 |
20130028295 | COLLECTING POWER OUTAGE NOTIFICATIONS IN A FREQUENCY HOPPING COMMUNICATION NETWORK - In one embodiment, a device in a frequency hopping communication network operate in a first mode according to a common broadcast schedule for the network that simultaneously overlays a first configured portion of all independently determined unicast listening schedules in the network. In response to determining a power outage condition, the device switches to operation in a power outage mode where the common broadcast schedule for the network in the power outage mode simultaneously overlays a second configured portion of all independently determined unicast listening schedules in the network, the second configured portion greater than the first configured portion. In one embodiment, the device broadcasts one or more power outage notifications (PONs) in response to determining the power outage condition as a reduction of a main power supply at the device. In another embodiment, the device receives a PON while powered as the power outage condition. | 01-31-2013 |
20130031253 | NETWORK MANAGEMENT SYSTEM SCHEDULING FOR LOW POWER AND LOSSY NETWORKS - In one embodiment, a network management system (NMS) determines an intent to initialize a request-response exchange with a plurality of clients in a low power and lossy network (LLN). In response, the NMS adaptively schedules corresponding responses from the clients to distribute the responses across a period of time based on a network state of the LLN. Accordingly, requests may be generated by the NMS with an indication of a corresponding schedule to be used by the clients to respond, and transmitted into the LLN to solicit the responses, which are then received at the NMS according to the indicated schedule. | 01-31-2013 |
20130055383 | COORDINATED DETECTION OF A GREY-HOLE ATTACK IN A COMMUNICATION NETWORK - In one embodiment, a security device receives one or more first unique identifications of packets sent by a first device to a second device for which a corresponding acknowledgment was purportedly returned by the second device to the first device. The security device also receives one or more second unique identifications of packets received by the second device from the first device and acknowledged by the second device to the first device. By comparing the first and second unique identifications, the security device may then determine whether acknowledgments received by the first device were truly returned from the second device based on whether the first and second unique identifications exactly match. | 02-28-2013 |
20130064072 | PROACTIVE SOURCE-BASED REVERSE PATH VALIDATION IN COMPUTER NETWORKS - In one embodiment, a network device may receive an indication of a particular future message time, and determines a path validation time that is prior to the particular future message time by an amount at least long enough to detect and report a route change of a path from the network device to a source of the particular future message, wherein the source utilizes the path in reverse to reach the network device for the particular future message. Accordingly, the network device sends, at the path validation time, a keepalive message on the path, where in response to a failure of the keepalive message on the path, the network device repairs the path to the source with a particular route change, and reports the particular route change to the source, e.g., such that in response, the source may transmit the particular future message on the changed path in reverse. | 03-14-2013 |
20130067063 | DYNAMIC KEEPALIVE PARAMETERS FOR REVERSE PATH VALIDATION IN COMPUTER NETWORKS - In one embodiment, a network device determines a path from itself to a source device in a computer network, where the source device utilizes the path in reverse to reach the network device. Based on determining a reliability of the path in reverse, the network device may dynamically adjust one or more keepalive parameters for keepalive messages sent on the path. Accordingly, the network device may then send keepalive messages on the path based on the dynamically adjusted keepalive parameters. | 03-14-2013 |
20130083658 | CONGESTION-BASED TRAFFIC SHAPING FOR DISTRIBUTED QUEUING IN SHARED-MEDIA COMMUNICATION NETWORKS - In one embodiment, a device in a shared-media communication network determines a priority of a packet to be queued at the device, and based on the priority determines a length of time the packet is allowed to be queued before being successfully transmitted. After attempting to successfully transmit the queued packet within the shared-media communication network, in response to reaching a threshold amount of the length of time without having successfully transmitted the queued packet, the device may transmit a “shaping” request to one or more reachable neighbors in the shared-media communication network. Specifically, the shaping request is for a temporary reduction in bandwidth utilization by the reachable neighbors for traffic having a comparatively lesser priority than the priority of the packet. | 04-04-2013 |
20130094536 | EFFICIENT NETWORK DISCOVERY IN FREQUENCY HOPPING NETWORKS - In one embodiment, a device in a frequency hopping communication network transmits responsive beacon messages based on adaptive types of responsive beacon message transmission based on a number of received beacon requests within a given time period: the number below a threshold results in synchronized unicast messages; the number above the threshold results in unsynchronized broadcast messages. In another embodiment, the device suppresses unsolicited beacon message transmission based on a density-aware redundancy count of other unsolicited beacon message transmissions from neighboring devices. In another embodiment, the device may transmit unsolicited beacon messages according to an adaptive interval based on stability of the network. In another embodiment, the device may suppress transmission of a beacon request to join the communication network based on a density-aware redundancy count of other beacon requests from neighboring devices, and transmits beacon requests at an adaptive interval that increases in response to each unanswered beacon request. | 04-18-2013 |
20130094537 | DYNAMIC HOPPING SEQUENCE COMPUTATION IN CHANNEL HOPPING COMMUNICATION NETWORKS - In one embodiment, a device in a channel hopping communication network independently maintains a slot counter, and computes a channel identification (ID) based on a function having inputs of i) a unique feature of the device, ii) a current slot of the slot counter, and iii) a set of possible channel IDs. Accordingly, the device configures its radio to receive on the computed channel ID for the respective current slot. In another embodiment, the device may determine, for a neighbor device, a current neighbor slot and unique neighbor feature, and correspondingly computes a neighbor channel ID based on the function using the unique neighbor feature, the current neighbor slot, and the set of possible channel IDs. As such, the device configures its radio to transmit on the computed neighbor channel ID for the respective current neighbor slot. | 04-18-2013 |
20130121331 | ADAPTIVE REOPTIMIZATION RATE FOR UNSTABLE NETWORK TOPOLOGIES - In one embodiment, the network stability of a communication network is determined based on one or more network metrics related to stability, and then based on the network stability, a particular frequency at which to perform route reoptimization is determined, where the frequency inversely corresponds to the network stability. As such, distributed route reoptimization is triggered in the communication network at the adaptively determined frequency. | 05-16-2013 |
20130121335 | DYNAMIC MULTICAST MODE SELECTION IN A COMMUNICATION NETWORK - In one embodiment, a network device selectively operates according to a sparse multicast mode where the network device stores individual devices interested in one or more multicast groups and distributes corresponding multicast group traffic based on the individual devices. Alternatively, the network device selectively operates according to a dense multicast mode where the network device maintains a list of the one or more multicast groups in which at least one device is interested and distributes corresponding multicast group traffic through broadcasting. By determining one or more resource-related characteristics, the network device may then select between operation in the sparse multicast mode and the dense multicast mode based on the resource-related characteristics. | 05-16-2013 |
20130159548 | ASSISTED TRAFFIC ENGINEERING FOR MINIMALISTIC CONNECTED OBJECT NETWORKS - In one embodiment, a distributed intelligence agent (DIA), hosted on a border router that provides access for a computer network to a global computer network, determines a routing topology of the computer network, and also computes a traffic matrix for the computer network based on source and destination addresses of traffic traversing the DIA, the traffic matrix providing an estimate for an amount of traffic on each link of the routing topology. Accordingly, the DIA may determine one or more portions of the routing topology for which traffic engineering (TE) should be applied based on a threshold for traffic loads on the links, and may notify one or more nodes in the computer network to change its respective current next-hop in the routing topology to an alternate next-hop based on a TE solution computed by the DIA. | 06-20-2013 |
20130223218 | DYNAMIC DIRECTED ACYCLIC GRAPH (DAG) ROOT BYPASS FOR COMPUTER NETWORKS - In one embodiment, traffic flows through a root node of a primary directed acyclic graph (DAG) in a computer network are monitored to detect whether a particular traffic flow is above a path cost threshold. If so, then a corresponding source device may be instructed to cease using the primary DAG for the particular traffic flow, and specific action may be taken based on whether the particular traffic flow is point-to-point (P2P) or point-to-multipoint (P2MP). In particular, in response to the particular traffic flow being P2P, a source route may be computed and sent to the source device to cause the source device to use the source route for the particular traffic flow, while in response to the particular traffic flow being P2MP, the source device may be instructed to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root. | 08-29-2013 |
20130223225 | COMPUTING RISK-SHARING METRICS IN SHARED-MEDIA COMMUNICATION NETWORKS - In one embodiment, a routing node determines a risk-sharing metric between pairs of nodes in a shared-media communication network, and may then compute a plurality of routes that minimizes the risk-sharing metric between the routes, to correspondingly route traffic according to the computed plurality of routes. Additionally, in another embodiment, a particular node in the shared-media communication network may determine a risk-sharing metric between itself and each of one or more other nodes in the shared-media communication network. The particular node may then share the one or more determined risk-sharing metrics with one or more routing nodes in the shared-media communication network, accordingly. | 08-29-2013 |
20130223229 | PATH SELECTION BASED ON HOP METRIC DISTRIBUTIONS - In one embodiment, a network device determines, for each particular path of a plurality of paths in a computer network, a hop metric distribution that indicates, for each interval of the hop metric distribution, a number of hops along the particular path that have a hop metric value within a corresponding interval. As such, the device may then select a path from the plurality of paths that minimizes the number of hops with correspondingly poor hop metric values along the selected path based on the hop metric distribution, and may forward traffic on the selected path, accordingly. | 08-29-2013 |
20130223237 | DIVERSE PATHS USING A SINGLE SOURCE ROUTE IN COMPUTER NETWORKS - In one embodiment, a source device determines a source route from itself to a destination device in a computer network, and forwards a first packet on the source route with the source route included within the first packet. In addition, the source device generates a second packet with the source route included within the second packet, the second packet also including an indication to cause one or more of a plurality of transit devices to forward the second packet to a reachable 1-hop neighbor of a device in the source route two hops away from the respective transit device. The source device may then forward the second packet itself, as do one the one or more transit devices on a diverse path based on the source route, to a particular reachable 1-hop neighbor of a particular device in the source route two hops away from the source (or transit) device. | 08-29-2013 |
20130223275 | ON-DEMAND DIVERSE PATH COMPUTATION FOR LIMITED VISIBILITY COMPUTER NETWORKS - In one embodiment, a source device detects a packet flow that meets criteria for multi-path forwarding, and forwards a probe packet on a primary path from the source device to a destination device, the probe packet carrying an indication to cause a plurality of transit devices along the primary path to add their respective local neighbor topology to the forwarded probe packet, and also to cause the destination device to compute a diverse path from the primary path based on the accumulated local neighbor topologies in the probe packet. Accordingly, the source device may receive a returned diverse path as computed by the destination device in response to the probe packet, and may thus forward the packet flow on the primary path and the diverse path from the source device to the destination device according to the multi-path forwarding. | 08-29-2013 |
20130227055 | MANAGING FATE-SHARING IN SHARED-MEDIA COMMUNICATION NETWORKS - In one embodiment, a management device receives one or more fate-sharing reports locally generated by one or more corresponding reporting nodes in a shared-media communication network, the fate-sharing reports indicating a degree of localized fate-sharing between one or more pairs of nodes local to the corresponding reporting nodes. The management device may then determine, globally from aggregating the fate-sharing reports, one or more fate-sharing groups indicating sets of nodes having a global degree of fate-sharing within the communication network. As such, the management device may then advertise the fate-sharing groups within the communication network, wherein nodes of the communication network are configured to select a plurality of next-hops that minimizes fate-sharing between the plurality of next-hops. | 08-29-2013 |
20130283347 | SCALABLE REPLAY COUNTERS FOR NETWORK SECURITY - In one embodiment, an authenticator in a communication network maintains a persistent authenticator epoch value that increments each time the authenticator restarts. The authenticator also maintains a persistent per-supplicant value for each supplicant of the authenticator, each per-supplicant value set to a current value of the authenticator epoch value each time the corresponding supplicant establishes a new security association with the authenticator. To communicate messages from the authenticator to a particular supplicant, each message uses a per-supplicant replay counter having a security association epoch counter and a message counter specific to the particular supplicant. In particular, the security association epoch counter for each message is set as a difference between the authenticator epoch value and the per-supplicant value for the particular supplicant when the message is communicated, while the message counter is incremented for each message communicated. | 10-24-2013 |
20130283360 | DISTRIBUTED GROUP TEMPORAL KEY (GTK) STATE MANAGEMENT - In one embodiment, each security protocol supplicant in a computer network determines its group temporal key (GTK) state, and exchanges the GTK state with one or more neighbor supplicants in the computer network. Based on the exchange, a supplicant may determine whether any inconsistencies exist in its GTK state, and in response to any inconsistencies in the GTK state, may perform a GTK state synchronization with a security protocol authenticator by indicating to the authenticator what is needed to resolve the inconsistent GTK state at the particular supplicant. In another embodiment, the authenticator, which is configured to not store per-supplicant GTK state, may transmit beacons containing GTK identifiers (IDs) of GTKs currently enabled on the authenticator, and also responds to supplicants having inconsistent GTK states with one or more needed GTKs as indicated by the supplicants. | 10-24-2013 |
20140092749 | System and Method for Providing Route Information - A system and method changes a rate at which routing information is sent to increase it upon the detection of one or more events, maintaining the then current rate for an amount of time, or dropping it, otherwise. | 04-03-2014 |
20140119200 | System and Method for Computing Cost Metrics for Wireless Network Links - A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a wireless link may be a function of the success rate experienced on that wireless link. | 05-01-2014 |
20140126451 | System and Method for Reducing Power Used for Radio Transmission and Reception - A system and method allows devices to send and receive packets while using power to do so in a manner that responds to events, such as receipt or other identification of different parameters that control how packets are sent and received. | 05-08-2014 |
20150110159 | DYNAMIC HOPPING SEQUENCE COMPUTATION IN CHANNEL HOPPING COMMUNICATION NETWORKS - In one embodiment, a device in a channel hopping, communication network independently maintains a slot counter, and computes a channel identification (ID) based on a function having inputs of a unique feature of the device, ii) a current slot of the slot counter, and iii) a set of possible channel IDs. Accordingly, the device configures its radio to receive on the computed channel ID for the respective current slot. In another embodiment, the device may determine, for a neighbor device, a current neighbor slot and unique neighbor feature, and correspondingly computes a neighbor channel ID based on the function using the unique neighbor feature, the current neighbor slot, and the set of a possible channel IDs. As such, the device configures its radio to transmit on the computed neighbor channel ID for the respective current neighbor slot. | 04-23-2015 |
20150334031 | DELAY BUDGET BASED FORWARDING IN COMMUNICATION NETWORKS - In one embodiment, certain nodes in a computer network maintain a plurality of routing topologies, each associated with a different corresponding delay (e.g., dynamically adjusted). Upon receiving a packet with an indicated delay budget at a particular node, the node updates the delay budget based on an incurred delay up to and including the particular node since the indicated delay budget was last updated, and selects a particular routing topology on which to forward the packet based on the updated delay budget and the corresponding routing topology delays. The packet may then be forwarded with the updated delay budget on the selected routing topology, accordingly. | 11-19-2015 |
Joseph Hui, Danville, CA US
Patent application number | Description | Published |
---|---|---|
20110087672 | Determining and Displaying Application Server Object Relevance - In embodiments, the number of references to an object which is deployed into an application server framework may be determined by examining metadata extracted from configuration data sources within a multi-tier application framework. In embodiments, an object relevance value based on the extracted number of references to an object may be associated with the object. In embodiments, the number of references extracted from a data source may be weighted using a weight factor that is associated with the data source. In embodiments, the number of references to a source object may be extracted by traversing a source inheritance hierarchy and parsing the objects within the hierarchy. In embodiments, an object relevance display of a set of objects may be generated based in part on object relevance values of the set of objects. In embodiments, an object relevance display may be a molecular display, a flash tag cloud, and/or a source tree hierarchy. | 04-14-2011 |
Joseph S. Hui, Thousand Lakes, CA US
Patent application number | Description | Published |
---|---|---|
20100061371 | SYSTEMS, METHODS AND PROTOCOLS FOR SECURING DATA IN TRANSIT OVER NETWORKS - Methods, systems, and protocols are described for securing data in transit over networks. A communication session is initiated between a client and a server. One or more communication channels can be set up between the client and the server. Each established communication channel may have zero or more intermediary nodes that are selected by the client or by the server to process information exchanged between the client and the server via the communication channels. | 03-11-2010 |
Joshua W. Hui, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090119349 | Methods and Computer Program Products for Efficient Conflict Detection in a Replicated Hierarchical Content Repository Using Replication Anchors - Exemplary embodiments of the present invention relate to a methodology for using replication anchors to detect conflicts within replicated hierarchical content repository. The method comprises locking a data object in the event that an operation applied on the data object is replicated from a first server to a second server, reading a transaction identifier that is associated with the data object, retrieving a transaction sequence value that is associated with the transaction identifier, and determining if a conflict situation exist by comparing the retrieved transaction sequence value with an operation synchronization anchor value, the operation synchronization value being the transaction sequence value of a last transaction from the second server to the first server, wherein a conflict situation is determined to exist in the event that the transaction sequence value is greater than the operation synchronization anchor value. | 05-07-2009 |
20090119351 | Methods and Computer Program Products for Transaction Consistent Content Replication - Exemplary embodiments of the present invention relate to methodologies, computer program products and systems for the support of content replication, wherein transaction-level data replication consistency is guaranteed. Further, the exemplary methodologies of the present invention can be implemented while incurring little or no additional I/O overhead. | 05-07-2009 |
20090292779 | Method and System for Supervising Electronic Text Communications of an Enterprise - A method and system for supervising electronic text messages in an enterprise allows for storing organizational information related to the enterprise, identifying a source and a target of the electronic text message, invoking communication screens between the identified source and target, each of the invoked communication screens being determined by the organizational information for the identified source and target, analyzing the electronic text message by a set of rules corresponding to said invoked communication screens to provide a supervisory score, and applying supervisory action to the electronic text message based on the supervisory score, including any of blocking transmission, redirecting the electronic text message to a supervisor or a supervisory file, and copying the electronic text message to the supervisory file. | 11-26-2009 |
20100010965 | Query Management Systems - Methods and computer program products are presented for managing a query result set in response to a search, including: generating a user request corresponding with a portion of the query result set, responsive to the portion of the query result set being resident on a client cache, returning the portion of the query result set corresponding with the user request to a client table, responsive to the user request not having been sent to an application server, adding the user request to an inflight queue, sending the user request to the application server, returning the portion of the query result set corresponding with the user request to the client cache, and returning the portion of the query result set corresponding with the user request to the client table, and responsive to the user request having been sent to the application server, adding the user request to a blocked cache queue. | 01-14-2010 |
20130036349 | SYSTEM FOR SIMPLIFYING THE PROCESS OF CREATING XML DOCUMENT TRANSFORMATIONS - An extensible markup language (XML) document transformation system, including: a user interface configured to receive a user input; a transformation engine configured to: create a target model by incremental user selection of elements in a source model; interpret the target model to create an XML schema of the target model; and create a mapping between the source model of the XML document and the target model; and a memory device configured to store the mapping. | 02-07-2013 |
20130036352 | SIMPLIFYING THE PROCESS OF CREATING XML DOCUMENT TRANSFORMATIONS - A method for simplifying a process for creating a transformation of an extensible markup language XML document is described. The method includes: creating a target model by incremental user selection of elements in a source model; interpreting the target model to create an XML schema of the target model; and creating a mapping between the source model of the XML document and the target model, wherein the mapping is stored on a memory device. | 02-07-2013 |
20140304304 | MODULARIZING COMPLEX XML DATA FOR GENERATION AND EXTRACTION - A mechanism is provided for creating modules from an XML schema. The mechanism includes creating a syntax tree from a sample XML fragment of the XML schema, creating a module with a list of parameters based on the syntax tree, identifying variable pieces of information in the syntax tree to be inserted in the list of parameters with a variable sign, and inserting the variable information into the list of parameters. The mechanism includes inserting another module in the syntax tree of the module, in which the other module corresponds to another sample XML fragment and has another list of parameters, and identifying the other module with the variable sign in the syntax tree of the module. The mechanism includes inserting the other module into the list of parameters of the module in which the other module to serve as a parameter, and providing an option for constraining the module. | 10-09-2014 |
20140304305 | MODULARIZING COMPLEX XML DATA FOR GENERATION AND EXTRACTION - A mechanism is provided for creating modules from an XML schema. The mechanism includes creating a syntax tree from a sample XML fragment of the XML schema, creating a module with a list of parameters based on the syntax tree, identifying variable pieces of information in the syntax tree to be inserted in the list of parameters with a variable sign, and inserting the variable information into the list of parameters. The mechanism includes inserting another module in the syntax tree of the module, in which the other module corresponds to another sample XML fragment and has another list of parameters, and identifying the other module with the variable sign in the syntax tree of the module. The mechanism includes inserting the other module into the list of parameters of the module in which the other module to serve as a parameter, and providing an option for constraining the module. | 10-09-2014 |
Kelvin Yupak Hui, Fremont, CA US
Patent application number | Description | Published |
---|---|---|
20080211569 | Higher voltage switch based on a standard process - A higher voltage switching circuit based on a standard process limits the lowest applied voltage to an intermediate voltage between the higher voltage and ground, instead of ground. In this way, the maximum electric field across the gate dielectric is greatly reduced. In additional the use of p-type triple well also reduces junction breakdown in some embodiments. This concept is also valid in the case where the high voltage is negative, in which case the intermediate voltage is also negative. | 09-04-2008 |
Kenneth Hui, Fremont, CA US
Patent application number | Description | Published |
---|---|---|
20110233155 | WIRE RACK FOR MOUNTING ELECTRONIC DEVICE ON CAR AIR VENT - A wire configured to form a wire rack for mounting an electronic device onto a car air vent having two downward bends at each end for engaging a horizontal louver of a car air vent, the wire rack has a left half which is symmetrical with the right half, and each half has at least one wire loop formed by two contiguous bends connected with a wire segment there between. A first wire loop located in the left half and a corresponding first wire loop located in the right half is oriented to face up for supporting a lower side of an electronic device and a second wire loop located in the left half and a corresponding second wire loop located in the right half oriented to face each other for engaging left and right sides of an electronic device in a vertical position or a horizontal position. | 09-29-2011 |
Kevin Hui, Sunnyvale, CA US
Patent application number | Description | Published |
---|---|---|
20110255839 | IMPORTING BLU-RAY DISC CONTENT - A system is described, which includes an optical drive and a media server. The media server includes a storage device, and is coupled to the optical drive. The media server is configured to determine whether the optical drive contains an optical disc associated with digital content, and is further configured to receive a request for access to the digital content. | 10-20-2011 |
20110258644 | UTILIZING A DISC VAULT - A system is described, which includes a disc vault, which may hold a number of discs, and a media server. The media server includes a storage device, and is coupled to the disc vault. The media server is configured to determine whether a disc associated with digital content is present in the disc vault, and is further configured to receive a request for access to the digital content. | 10-20-2011 |
20120237078 | Watermarking and Fingerprinting Digital Content Using Alternative Blocks to Embed Information - A method of embedding information in digital content representing media streams. The method includes (1) selecting a set of locations within that digital content reprensenting the media stream to embed information, (2) selecting a set of possible alterations to make at those locations, and (3) making a subset of the possible alterations. The set of locations and possible alterations is herein sometimes called a “watermark.” The subset of actual alterations that are made is herein sometimes called a “fingerprint.” The method determines a set of locations at which there are alternative versions of digital content representing the same media stream, such as one being the original and one being an alternative version of the same digital content, herein sometimes called the “original movie” and the “alt-movie,” or herein sometimes called the “original block” and the “alt-block” for a particular block in the digital content representing the media stream. | 09-20-2012 |
Lap Shun Hui, Long Beach, CA US
Patent application number | Description | Published |
---|---|---|
20150294318 | INTERACTIVE AND CUSTOM-SUPPORT KIOSK, METHODS AND SYSTEM - An interactive and custom support kiosk is disclosed. In one embodiment, a kiosk is provided including a user attribute identification system and a region-specific linkage. The user attribute identification system may be a user language identification system where the user's preferred language may be detected. With detection of a user's preferred language, the kiosk may display a language-customized display with customized features based on the identified language. In some embodiments, the customized features may include a language-based experience format similar to a user's experience which would be expected in the user's home geography. In some examples, a second level of interaction may be provided wherein the user may be connected to a region-specific operator. The operator may provide immediate live help or assistance through the kiosk. In addition, security controls may be provided with the interactive language and custom support kiosk. | 10-15-2015 |
Lap Shun Hui, Chino, CA US
Patent application number | Description | Published |
---|---|---|
20080314526 | Hole punch with automatic reinforcement ring placement - Hole punch apparatus which automatically places a reinforcement ring precisely around each punched hole concurrently with the creation of each hole and using the same motion that punches the holes. In a preferred embodiment, the punch shaft has a ring compression disk affixed around it at a location above the punch face. The compression disk has a ring cushion and a stack of reinforcement rings extending along the punch shaft toward the punch face, but spaced therefrom to permit the punch face to puncture a sheet before the lowermost reinforcement ring is then compressed against the sheet in precise axial alignment with the punched hole. The rings each have sufficient adhesive to adhere to the sheet, one and only one ring at each hole, while disengaging from the remaining rings in the stack. A sheet interface unit is installed on the lower surface of a punch bracket enclosure and provides a sheet retainer so that the sheet cannot rise significantly above the bracket base and thus will pull the lowermost reinforcement ring away from the stack as the punch lever is released. When re-supply is needed, a new ring stack is readily installed using a ring stack cassette, which in the preferred embodiment also replaces the sheet interface unit including the sheet retainer. | 12-25-2008 |
20090113628 | Sleeping bag - A sleeping bag having an elongated bottom mat formed of flexible material and having opposing head and foot edges. The main cover is formed of flexible material, has head and foot edges, and overlies the bottom mat, to which it is permanently secured. The main cover has a transverse slit between the head and foot edges of the cover at a location closer to the foot edge of the main cover than to the head edge, and spaced from the foot edge by about one to three feet. The foot edge of the bottom mat is releasably secured to the foot edge of the main cover, and the head edge of the bottom mat is not joined to the head edge of the main cover to provide an entry into the sleeping bag for a user. A top cover, also formed of flexible material, is secured to the main cover and overlies only the portion of the main cover that includes the foot edge and the transverse slit of the main cover. | 05-07-2009 |
20090175473 | EARPHONE SET WITH DETACHABLE SPEAKERS OR SUBWOOFERS - An apparatus is provided including a first speaker which emits sound, a second speaker which emits sound, and a device which connects the first speaker and the second speaker. The device may connect the first speaker or front speaker, and the second speaker or rear speaker, so that the device can be attached to an ear of a person so that the first speaker lies near the middle of the ear while the second speaker lies at a location between an ear lobe of the ear and a mastoid of a skull of the person. | 07-09-2009 |
Lawrence Hui, Sunnyvale, CA US
Patent application number | Description | Published |
---|---|---|
20110103220 | HIGH CAPACITY ROUTER HAVING REDUNDANT COMPONENTS - A router includes multiple routing engines. If the active routing engine fails, a backup one of the routing engines detects the failure and assumes the role of active routing engine. A redundancy controller circuit, connected to the multiple routing engines, facilitates the selection and switching of the routing engines. Portions of the packet forwarding engine, in addition to the routing engine, may be redundantly implemented. The active routing engine controls the selection of the redundant portion of the packet forwarding engine. | 05-05-2011 |
Lok Yan Hui, Milpitas, CA US
Patent application number | Description | Published |
---|---|---|
20110066753 | VIRTUAL ROUTER REDUNDANCY FOR SERVER VIRTUALIZATION - A solution for virtual router redundancy for server virtualization includes, at a network device configured as a backup router of a virtual router, examining a packet stored in a memory of the network device. Responsive to the examining, the network device determines whether to forward the packet via a network towards a destination or to send the packet via the network to a master router of the virtual router for forwarding of the packet, by the master router, towards the destination. | 03-17-2011 |
20130100854 | VPLS OVER MULTI-CHASSIS TRUNK - One embodiment of the present invention provides a switch. The switch includes a link aggregation database, an arbitration module, a packet processor, and a logical connection management module. The link aggregation database stores information regarding a plurality of switches participating in a multi-chassis trunk. The plurality of switches includes the switch as well. The arbitration module selects a switch of the plurality of switches as an active switch based on the information in the link aggregation database. The packet processor constructs a packet for a remote switch forwardable via a logical connection. The logical connection management module operates in conjunction with the packet processor and constructs a message containing instructions for creating a second logical connection to a second switch of the plurality of switches. | 04-25-2013 |
20130205044 | Virtual Router Redundancy For Server Virtualization - A solution for virtual router redundancy for server virtualization includes, at a network device configured as a backup router of a virtual router, examining a packet stored in a memory of the network device. Responsive to the examining, the network device determines whether to forward the packet via a network towards a destination or to send the packet via the network to a master router of the virtual router for forwarding of the packet, by the master router, towards the destination. | 08-08-2013 |
Matt Hui, Monterey Park, CA US
Patent application number | Description | Published |
---|---|---|
20100230562 | FURNITURE FOOT WITH BALL JOINT AND FELT PAD - A furniture foot comprises (a) a furniture foot connector; (b) a foot base having a molded portion; (c) a ball joint connecting the furniture foot connector to the foot base; and (d) a felt pad co-molded with the molded portion of the foot base, such that the felt pad protrudes away from the foot base. | 09-16-2010 |
20120086258 | FURNITURE FOOT WITH BALL JOINT AND FELT PAD - A furniture foot comprises (a) a furniture foot connector; (b) a foot base having a molded portion; (c) a ball joint connecting the furniture foot connector to the foot base; and (d) a felt pad co-molded with the molded portion of the foot base, such that the felt pad protrudes away from the foot base. | 04-12-2012 |
Michael Hui, San Francisco, CA US
Patent application number | Description | Published |
---|---|---|
20090152955 | ADVANCED SWITCHER FOR HIGH OUT ELECTRONIC DEIVES - Disclosed herein is a circuit and device for activating and deactivating various high current output electrical devices, where such electrical devices are particularly appropriate for use in a hydroponic growing system. The circuit includes, a timer, a controller, a switch pair, defining a channel, one ballast connected to the switch pair and two high current output devices connected to one ballast. In an exemplary embodiment, the high current output device defines a high intensity light of the type commonly used in the indoor growing industry. The circuit includes the controller being connected to each the ballasts and upon the appropriate signal from the timer, the controller sends a high signal to switch which, in turn, sends a high signal to the ballast, which, in turn, powers one and only one of the high current output devices. In an exemplary embodiment there are six ballasts, each with two lighting arrays. | 06-18-2009 |
Mizhou Hui, Camarillo, CA US
Patent application number | Description | Published |
---|---|---|
20090175795 | CHIMERIC THERAPEUTIC AGENTS - A fusion protein including (i) a first segment that is located at the amino terminus of the fusion protein and contains the sequence of a first biological active peptide or protein; and (ii) a second segment that is located at the carboxyl terminus of the fusion protein and contains the sequence of a second biological active peptide or protein. The first and second segments are operably and covalently linked. Also disclosed are nucleic acids encoding the fusion protein, vectors and host cells having the nucleic acids, and related composition and methods of treating diabetes or/and obesity. | 07-09-2009 |
Mizhou Hui, Thousand Oaks, CA US
Patent application number | Description | Published |
---|---|---|
20080199958 | Suspension Culture Vessels - A cell culture vessel comprising a housing chamber which has an inverted frusto-conical bottom having a vertical axis. The culture vessel further comprises an upper and lower section which are concentric. The vessel requires little or no shear-force and less stress by shaking or impellor action. | 08-21-2008 |
20080292628 | Chimeric Protein - A fusion protein containing a first segment that is located at the amino terminus of the fusion protein and specifically binds to and neutralizes a first cytokine or growth factor; and a second segment that is located at the carboxyl terminus of the fusion protein and specifically binds to a second cytokine receptor which is often rich at disease sites such as IL-1 receptor-rich inflammatory site. In addition, the said second segment is usually the receptor antagonist such as IL-1 receptor antagonist and its functional equivalent analogues. Also disclosed are nucleic acids encoding the fusion protein, vectors and host cells having the nucleic acids, and related composition and methods to target inflammatory diseases and indications co-existed with inflammation. | 11-27-2008 |
20100076380 | BIOREACTORS - Disclosed are various examples of methods and systems for providing an oxygenated culture environment for growing animal cells, as well as methods and systems for oxygenating blood and related methods for treating diseases and related conditions. | 03-25-2010 |
20100190245 | METHOD TO INCREASE DISSOLVED OXYGEN IN A CULTURE VESSEL - Basing on study of a previous discovered effective bioreactor system, a method to increase culture medium dissolved oxygen is disclosed. This method together with addition of an optimal mixing forms a theoretical foundation for effective bioreactor design and prototype construction. | 07-29-2010 |
20100216188 | USE OF CHICK BETA ACTIN GENE INTRON-1 - A method to use chick beta actin gene intron-1 or functional equivalent as a gene expression enhancer element or a gene expression “hot spot” sequence for constructing or reconstructing a mammalian expression vector for extremely high expression of recombinant proteins is disclosed. Composition of a set of extremely strong gene expression vectors is also disclosed. | 08-26-2010 |
20120021507 | BIOREACTOR AND USES THEREOF - Disclosed are bioreactor systems and methods to transfer a gaseous composition into a liquid composition in a closed environment. Also disclosed are bioreactor systems and methods for high-density culture of microorganisms and stably culture of activated sludge. | 01-26-2012 |
Mun-Hong Hui, Oakland, CA US
Patent application number | Description | Published |
---|---|---|
20100138196 | SYSTEM AND METHOD FOR PREDICTING FLUID FLOW CHARACTERISTICS WITHIN FRACTURED SUBSURFACE RESERVOIRS - A system and method having application notably towards predicting fluid flow characteristics within fractured subsurface reservoirs. The system and method include steps of reservoir characterization, gridding, discretization, and simulation of geologically realistic models describing the fractured subsurface reservoirs. A stochastic fracture representation that explicitly represents a network of fractures within a subsurface reservoir is constructed and used to build a fine-scale geological model. The model is then gridded such that the network of fractures is represented by interfaces between the fine-scale cells. The model is the discretized and simulated. Simulation can be on a fine-scale or on an upscaled course-scale to produce efficient and reliable prediction of fluid flow characteristics within the subsurface reservoir. | 06-03-2010 |
20100138202 | SYSTEM AND METHOD OF GRID GENERATION FOR DISCRETE FRACTURE MODELING - Computer-implemented systems and methods are provided for generating accurate grids that can be used for simulation of highly complex subsurface reservoirs, such as fractured subsurface reservoirs. A representation of a fractured subsurface reservoir and an explicit discrete fracture represented within the fractured subsurface reservoir are provided. The representation of the fractured subsurface reservoir is decomposed into polyhedral cells. Interfaces between the polyhedral cells are selected to approximate the discrete fracture explicitly represented within the fractured subsurface reservoir. The selected interfaces are used to produce a grid that can be used for constructing a simulation model of the fractured subsurface reservoir. | 06-03-2010 |
Otto Hui, Burlingame, CA US
Patent application number | Description | Published |
---|---|---|
20090001855 | ELECTROACTIVE POLYMER TRANSDUCERS FOR SENSORY FEEDBACK APPLICATIONS - Electroactive polymer transducers for sensory feedback applications are disclosed. | 01-01-2009 |
20090152995 | ELECTROACTIVE POLYMER TRANSDUCERS BIASED FOR INCREASED OUTPUT - Electroactive polymer transducers are disclosed. They are biased in a manner that provides for increased force and/or stroke output, thereby offering improved work potential and power output capacity. The biasing may offer additional or alternate functional advantage in terms of matching transducer performance with a given application such as a normally-closed valve. The improved biasing (including increased output biasing) may utilize negative spring rate biasing and/or a combination of negative or zero-rate biasing with positive rate biasing to achieve the desired ends. | 06-18-2009 |
20100033835 | Optical lens displacement systems - The present invention provides optical systems, devices and methods which utilize one or more electroactive polymer actuators to adjust an optical parameter of the optical device or system. | 02-11-2010 |
20100205803 | ELECTROACTIVE POLYMER TRANSDUCERS FOR SENSORY FEEDBACK APPLICATIONS - Electroactive polymer transducers for sensory feedback applications are disclosed. | 08-19-2010 |
20110169742 | ELECTROACTIVE POLYMER TRANSDUCERS FOR SENSORY FEEDBACK APPLICATIONS - Electroactive polymer transducers for sensory feedback applications are disclosed. | 07-14-2011 |
20110285247 | ELECTROACTIVE POLYMER TRANSDUCERS FOR SENSORY FEEDBACK APPLICATIONS - Electroactive polymer transducers for sensory feedback applications are disclosed. | 11-24-2011 |
Philip Hui, Foster City, CA US
Patent application number | Description | Published |
---|---|---|
20100174250 | REDUCED PRESSURE THERAPY OF THE SACRAL REGION - Reduced pressure wound therapy is performed on a sacral region of a patient using an adhesive dressing comprising a flexible planar layer and a non-planar fold-sealing region configured to seal to the intergluteal cleft of a patient. The fold-sealing region is located on an outer edge of the adhesive dressing and comprises a tapered configuration. | 07-08-2010 |
20110137270 | PRESSURE INDICATOR - Disclosed herein is a device which is intended to deliver and maintain reduced pressure to body surfaces for application of reduced pressure wound therapy (RPWT) also known as negative pressure wound therapy (NPWT). During application of this type of therapy, a substantially airtight seal is formed around a section of tissue to be treated. This seal is formed by a dressing which provides fluid communication from a section of tissue to a reduced pressure source. Disclosed herein is a dressing system which is configured to enhance usability and functionality of this dressing. First, the system may be configured to allow full rotation of the fluid communication conduit to the reduced pressure source along the axis substantially normal to the dressing. Second, the system may be configured to include a one-way valve to prevent backflow of any drainage fluids. Third, the system may be configured with transparent windows covered by opaque flaps to allow inspection through the dressing. Fourth, the system may be configured to include an indicator which visually makes clear whether reduced pressure is being applied or not. Fifth, the system is configured to minimize the profile of the dressing system. | 06-09-2011 |
20130144231 | REDUCED PRESSURE THERAPY OF THE SACRAL REGION - Reduced pressure wound therapy is performed on a sacral region of a patient using an adhesive dressing comprising a flexible planar layer and a non-planar fold-sealing region configured to seal to the intergluteal cleft of a patient. The fold-sealing region is located on an outer edge of the adhesive dressing and comprises a tapered configuration. | 06-06-2013 |
Simon S. Hui, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20110208004 | ENDOSCOPIC LED LIGHT SOURCE HAVING A FEEDBACK CONTROL SYSTEM - An external endoscope light source system includes light emitting diodes for providing a light output to an endoscope. The light is provided to a fiber optic cable for transmission to the endoscope. A fiber optic receives a portion of the light output and provides the output to a color sensor for sensing color values. The color values are provided to a controller that adjusts power to the various LEDs to provide a white light output. Instead of a color sensor in the light source, the light source can receive a white balance signal from a video camera provided for an endoscope. The white balance signal varies intensity of light output from each of the LEDs to obtain a white light output. The camera also provides shutter speed of a camera image sensor to the light source. The shutter speed is used to pulse or modulate the light output only when the shutter of the camera is open. By modulating the light output by the light source, the amount of heat generated by the light source is minimized. | 08-25-2011 |
Simon Wing-Lok Hui, Redwood City, CA US
Patent application number | Description | Published |
---|---|---|
20110022672 | Method and Apparatus for Scalable Transport Processing Fulfillment System - A scalable fulfillment system is presented that supports business processes, manages the transport and processing of business-related messages or documents between a business entity and clients, such as customers, vendors, and business partners, and generally supports business document processing. The system intelligently manages the transportation of files from clients, through processing of files, to generating responses that return to the clients. To accommodate a heterogeneous interfacing and processing with different clients in a central system, a file normalization technique is used that captures a common meta-data format from the numerous heterogeneous file types used by numerous clients. The meta-data files, also referred to as messages, contain links to their associated data files and are processed separately. Once the messages are entered into the system, an intelligent queue scheduler (IQS) is used to schedule the processing of messages across a scalable resource of processing engines based on normalized file meta-data parameters. | 01-27-2011 |
Siuman Hui, San Francisco, CA US
Patent application number | Description | Published |
---|---|---|
20090168659 | DIRECTOR DEVICE AND METHODS THEREOF - A director device arrangement for enabling a plurality of monitoring functions to be performed on data traffic traversing through a network is provided. The arrangement includes a set of network ports for receiving data traffic and outputting the data traffic. The arrangement further includes a set of switch chips, which is configured to include at least a first switch chip and a second switch chip, which are configured to interact with one another to perform the plurality of monitoring functions on the data traffic received by the set of switch chips. The arrangement yet also includes a set of monitoring ports, which is configured to receive at least one of the data traffic traversing through the network. The data traffic is configured to traverse the director device arrangement irrespective whether the power is provided to the circuitry of the director device arrangement. | 07-02-2009 |
20100146113 | DIRECTOR DEVICE WITH VISUAL DISPLAY ARRANGEMENT AND METHODS THEREOF - A director device arrangement for performing a plurality of monitoring functions on data traffic traversing through a network is provided. The director device arrangement includes a power module, a processor module, a set of network ports, a set of switch modules, and at least one monitoring ports. The set of switch modules is configured to include at least a first switch module and a second switch module that interact with one another to perform the plurality of monitoring functions on the data traffic received. The at least one monitoring port is configured to receive at least one of the data traffic traversing through the network, whereas the data traffic is configured to traverse the director device arrangement between the set of network ports irrespective whether power is provided to the circuitry, the processor module, and the set of switch modules of the director device arrangement. | 06-10-2010 |
20120002552 | DIRECTOR DEVICE ARRANGEMENT WITH VISUAL DISPLAY ARRANGEMENT AND METHODS THEREOF - An apparatus for enabling a plurality of monitoring functions to be performed on network data is provided. The apparatus includes a power module and a processor module. The apparatus also includes a set of network ports that includes a set of input network ports for receiving the data traffic and a set of output network ports for outputting the data traffic from the apparatus. The apparatus further includes a switchboard arrangement that includes at least two chips that are configured to interact with one another to perform the plurality of monitoring functions on the data traffic received by the switchboard arrangement. The apparatus yet also includes logic module for analyzing the data traffic and for displaying the statistical data pertaining to the data traffic. The apparatus yet further includes a visual display arrangement that is configured for displaying the statistical data. | 01-05-2012 |
Siuman Hui, Millbrae, CA US
Patent application number | Description | Published |
---|---|---|
20110211441 | SEQUENTIAL HEARTBEAT PACKET ARRANGEMENT AND METHODS THEREOF - An arrangement in a network tap for monitoring state of a monitoring system is provided. The arrangement includes a set of network ports that includes a set of input network ports for receiving data traffic and a set of output network ports for outputting the data traffic from the network tap. The arrangement also includes a monitoring port that is configured to receive the data traffic from the set of network ports and to forward the data traffic onward to the monitoring system. The arrangement further includes a logic component configured for executing a sequential heartbeat diagnostic test. The sequential heartbeat diagnostic test is configured for providing a first set of sequential heartbeat packets for testing and determining the state of the monitoring system. The arrangement yet also includes a logic component for activating one or more events when a failure condition exists for the state of the monitoring system. | 09-01-2011 |
20110211463 | ADD-ON MODULE AND METHODS THEREOF - An arrangement for processing data traffic flowing through a network is provided. The arrangement includes a data interface for receiving the data traffic. The arrangement also includes an inspection engine for analyzing the data traffic, wherein the analyzing is performed on at least payload data. The arrangement further includes means for routing the data traffic through the network, wherein the means for routing is configured to define one or more ports for transmitting the data traffic. The means for routing the data traffic is dynamic to balance the data traffic across multiple outgoing ports. | 09-01-2011 |
20110211492 | IBYPASS HIGH DENSITY DEVICE AND METHODS THEREOF - A high density network arrangement for managing an integrated secured multiple networks arrangement is provided. The arrangement includes a power module for providing power to a circuitry of the high density network arrangement. The arrangement also includes a plurality of network interfaces, wherein each network interface of the plurality of network interfaces is configured for coupling with a network arrangement. The arrangement further includes a processor for providing processing capability to the high density network arrangement. The arrangement yet also includes logic arrangement for managing data traffic flowing through the plurality of network interfaces, wherein the data traffic is configured to traverse the high density network arrangement between the plurality of network arrangement interfaces irrespective whether the power is provided to the circuitry of the high density network arrangement. | 09-01-2011 |
20110214181 | DUAL BYPASS MODULE AND METHODS THEREOF - A dual bypass module for managing an integrated secured network environment is provided. The module includes network ports that receive and transmit data traffic flowing through the network. The module also includes a set of monitoring ports that is configured for transmitting the data traffic between the dual bypass module and a set of monitoring systems. The module further includes a set of relays configured for controlling the flow of data through the dual bypass module. The module yet also includes a configurable integrated circuit. The configurable integrated circuit includes at least one of a first logic arrangement for determining conditions of the set of monitoring systems, a second logic arrangement for redirecting the data traffic through a secured alternate path when a monitoring system is unavailable, and a third logic arrangement for redirecting the data traffic through a secured alternate path when a communication path becomes unavailable. | 09-01-2011 |
20130347062 | SECURED NETWORK ARRANGEMENT AND METHODS THEREOF - A high density network arrangement for managing an integrated secured multiple networks arrangement is provided. The arrangement includes a power module for providing power to a circuitry of the high density network arrangement. The arrangement also includes a plurality of network interfaces, wherein each network interface of the plurality of network interfaces is configured for coupling with a network arrangement. The arrangement further includes a processor for providing processing capability to the high density network arrangement. The arrangement yet also includes logic arrangement for managing data traffic flowing through the plurality of network interfaces, wherein the data traffic is configured to traverse the high density network arrangement between the plurality of network arrangement interfaces irrespective whether the power is provided to the circuitry of the high density network arrangement. | 12-26-2013 |
20140022891 | ARRANGEMENTS AND METHODS FOR MINIMIZING DELAY IN HIGH-SPEED TAPS - Methods and arrangements are provided for minimizing delay in a high-speed tap arrangement are disclosed and include hardware and software arrangements and methods for quickly switching the transmission path for data between a primary data path and a bypass data path. The switching is accomplished rapidly using set of powered analog switches and a relay to minimize packets loss in the event of power loss. Further, when power is restored, software and hardware methods and arrangements disclosed herein permit the data path to be promptly restored resulting in the restoration of tapping ability quickly after power is restored. | 01-23-2014 |
Tommy Hui, Foster City, CA US
Patent application number | Description | Published |
---|---|---|
20090198599 | Enhanced Automated Capture of Invoices into an Electronic Payment System - The recognition of invoices for multiple issuers and multiple recipients is automated. In one approach, many invoices are received. The received invoices are compared to a database of distinguishing features. These distinguishing features are for known templates of invoices from different issuers. Templates are selected for the invoices based on the comparisons to the distinguishing features. This also identifies the issuers for the invoices. Data is extracted from the invoices based on the selected templates. In this way, invoice capture can be automated. | 08-06-2009 |