Patent application number | Description | Published |
20130238744 | OBJECT MEDIATED DATA TRANSFER BETWEEN ELECTRONIC DEVICES - Systems, devices and methods for transferring data between two or more different electronic devices are described further herein. The data transfer is mediated by an object, such as a stylus, having a unique identifier. The same object is used when copying the data from a first electronic device and when pasting the data at a second electronic device. | 09-12-2013 |
20140062966 | Stylus Having a Flexibly-Resilient Tip - A stylus has a first end and a flexibly-resilient tip disposed at that first end. By one approach this tip is seamlessly connected to the stylus and thereby affords a fully-sealed connection that prevents contaminants from entering the stylus via the tip. The stylus can further include a pressure-sensitive sensor disposed therein that is configured to sense compression of the flexibly-resilient tip. If desired, the stylus can also include a wireless transmitter that operably couples to the pressure-sensitive sensor and that is configured to transmit information in response to sensed tip compression. | 03-06-2014 |
20140077763 | MULTI-ORIENTATION STAND FOR A PORTABLE ELECTRONIC DEVICE - A multi-orientation stand system for a portable electronic device, the multi-orientation stand including portable electronic device and a first surface disposed in contact with the portable electronic device for supporting the portable electronic device in a plurality of orientations. Also included is at least one charging feature disposed proximate the first surface for routing power to a power storing component of the portable electronic device upon contact between the first surface and the portable electronic device. | 03-20-2014 |
20140079266 | MATING PORTABLE SPEAKER WITH PROTECTED CONNECTOR - A speaker comprises a housing that defines an internal cavity within which a sound generating member is disposed. The housing includes a front panel and a rear panel and defines a base. The rear panel includes a kickstand configured to extend from the rear panel in a deployed position and, together with the base, to support the speaker housing in an upright, leaning orientation. The speaker comprises an electrical connector disposed between the kickstand and the rear panel. The electrical connector is configured for coupling an external source of electrical power to the speaker. Front panels of first and second speakers define front surfaces configured to facilitate positioning of the first speaker and the second speaker in a face-to-face mating arrangement. Each of the first speaker and the second speaker comprises magnetic elements disposed for retaining the first speaker and the second speaker in the face-to-face mating arrangement. | 03-20-2014 |
20140079276 | MULTIPLE-ORIENTATION, FREE-STANDING, PORTABLE SPEAKER - A speaker comprises a housing that defines an internal cavity and includes a front panel, a first side, a second side, and a third side. The speaker also includes a controller, an actuator, and a sound generating member that are disposed within the internal cavity. The controller is in communication with the actuator, and the actuator is configured for causing the sound generating member to vibrate, and thereby generate sound waves, as instructed by the controller. The front panel is configured to transmit the sound waves. The speaker has a center of mass that is affected by a position of the controller and the actuator, and the controller and the actuator are arranged and positioned so that the center of mass of the speaker is positioned along an axis that extends from, and is perpendicular to, the first side. | 03-20-2014 |
Patent application number | Description | Published |
20130034556 | FREE HEXASACCHARIDE ISOLATED FROM SEVERAL CAMPYLOBACTER SPECIES - An isolated or purified compound is provided, comprising A-GlcNAc[GlcNAc]-GalNAc-GalNAc-QuiNAc4NAc, wherein A is GlcNAc or Glc. There is further provided a vaccine based on such compound, having particular use to treat or prevent an infection caused by a | 02-07-2013 |
20130266604 | PEPTIDE CONTAINING MULTIPLE N-LINKED GLYCOSYLATION SEQUONS - Described herein is a peptide, referred to as a GlycoTag peptide, that includes repeats of an N-linked glycosylation sequon that is naturally present in | 10-10-2013 |
20130295099 | N-LINKEDGLYCAN COMPOUNDS - An isolated or purified compound is provided, comprising A-GlcNAc[GlcNAc]-GalNAc-GalNAc-QuiNAc4NAc, wherein A is GlcNAc or Glc. There is further provided a vaccine based on such compound, having particular use to treat or prevent an infection caused by a | 11-07-2013 |
20140170150 | N-LINKED GLYCAN COMPOUNDS - An isolated or purified compound is provided, comprising A-GlcNAc[GlcNAc]-GalNAc-GalNAc-QuiNAc4NAc, wherein A is GlcNAc or Glc. There is further provided a vaccine based on such compound, having particular use to treat or prevent an infection caused by a | 06-19-2014 |
Patent application number | Description | Published |
20120033662 | CROSSBAR SWITCH AND RECURSIVE SCHEDULING - A crossbar switch has N input ports, M output ports, and a switching matrix with N×M crosspoints. In an embodiment, each crosspoint contains an internal queue, which can store one or more packets to be touted. Traffic rates to be realized between all Input/Output (IO) pairs of the switch are specified in an N×M traffic rate matrix, where each element equals a number of requested cell transmission opportunities between each IO pair within a scheduling frame of F time-slots. An efficient algorithm for scheduling N traffic flows with traffic rates based upon a recursive and fair decomposition of a traffic rate vector with N elements, is proposed. To reduce memory requirements shared row queue (SRQ) may be embedded in each row of the switching matrix, allowing the size of all the XQs to be reduced. To further reduce memory requirements, a shared column queue may be used in place of the XQs. The proposed buffered crossbar switches with shared row and column queues, in conjunction with the now scheduling algorithm and the DCS column scheduling algorithm, can achieve high throughout with reduced buffer and VLSI area requirements, while providing probabilistic guarantees on rate, delay and jitter for scheduled traffic flows. | 02-09-2012 |
20120236849 | CROSSBAR SWITCH AND RECURSIVE SCHEDULING - A crossbar switch has N input ports, M output ports, and a switching matrix with N×M crosspoints. In an embodiment, each crosspoint contains an internal queue, which can store one or more packets to be touted. Traffic rates to be realized between all Input/Output (IO) pairs of the switch are specified in an N×M traffic rate matrix, where each element equals a number of requested cell transmission opportunities between each IO pair within a scheduling frame of F time-slots. An efficient algorithm for scheduling N traffic flows with traffic rates based upon a recursive and fair decomposition of a traffic rate vector with N elements, is proposed. To reduce memory requirements shared row queue (SRQ) may be embedded in each row of the switching matrix, allowing the size of all the XQs to be reduced. To further reduce memory requirements, a shared column queue may be used in place of the XQs. The proposed buffered crossbar switches with shared row and column queues, in conjunction with the now scheduling algorithm and the DCS column scheduling algorithm, can achieve high throughout with reduced buffer and VLSI area requirements, while providing probabilistic guarantees on rate, delay and jitter for scheduled traffic flows. | 09-20-2012 |
20130329748 | CROSSBAR SWITCH AND RECURSIVE SCHEDULING - A crossbar switch has N input ports, M output ports, and a switching matrix with N×M crosspoints. In an embodiment, each crosspoint contains an internal queue (XQ), which can store one or more packets to be routed. Traffic rates to be realized between all Input/Output (IO) pairs of the switch are specified in an N×M traffic rate matrix, where each element equals a number of requested cell transmission opportunities between each IO pair within a scheduling frame of F time-slots. An efficient algorithm for scheduling N traffic flows with traffic rates based upon a recursive and fair decomposition of a traffic rate vector with N elements, is proposed. To reduce memory requirements a shared row queue (SRQ) may be embedded in each row of the switching matrix, allowing the size of all the XQs to be reduced. To further reduce memory requirements, a shared column queue may be used in place of the XQs. The proposed buffered crossbar switches with shared row and column queues, in conjunction with the row scheduling algorithm and the DCS column scheduling algorithm, can achieve high throughput with reduced buffer and VLSI area requirements, while providing probabilistic guarantees on rate, delay and jitter for scheduled traffic flows. | 12-12-2013 |
20140119347 | DELAY AND JITTER LIMITED WIRELESS MESH NETWORK SCHEDULING - Schedule and channel assignment in a wireless mesh network (WMN) includes: forming a representation of a sequence of permutation matrices from an n×n rate matrix. The entries of the rate matrix define the bandwidth of links between nodes of the WMN. Each permutation matrix represents active radio links between nodes. The sequence of permutation matrices defines a sequence of radio links to provide desired bandwidth between nodes. Further, a representation of a sequence of partial permutation matrices corresponding to the sequence of permutation matrices is formed so that each of the permutation matrices can be decomposed into a group of partial permutation matrices. Each partial permutation matrix represents non-interfering radio links between the nodes. In each timeslot, the nodes are configured for radio transmission and reception in accordance with at least one of the partial permutation matrices in each group to transmit traffic between the nodes. | 05-01-2014 |
20140233377 | METHOD TO ACHIEVE BOUNDED BUFFER SIZES AND QUALITY OF SERVICE GUARANTEES IN THE INTERNET NETWORK - Methods to achieve bounded router buffer sizes and Quality of Service guarantees for traffic flows in a packet-switched network are described. The network can be an Internet Protocol (IP) network, a Differentiated Services network, an MPLS network, wireless mesh network or an optical network. The routers can use input queueing, possibly in combination with crosspoint queueing and/or output queueing. Routers may schedule QoS-enabled traffic flows to ensure a bounded normalized service lead/lag. Each QoS-enabled traffic flow will buffer O(K) packets per router, where K is an integer bound on the normalized service lead/lag. Three flow-scheduling methods are analysed. Non-work-conserving flow-scheduling methods can guarantee a bound on the normalized service lead/lag, while work-conserving flow-scheduling methods typically cannot guarantee the same small bound. The amount of buffering required in a router can be reduced significantly, the network links can operate near peak capacity, and strict QoS guarantees can be achieved. | 08-21-2014 |
20150304245 | CROSSBAR SWITCH AND RECURSIVE SCHEDULING - A crossbar switch has N input ports, M output ports, and a switching matrix with N×M crosspoints. In an embodiment, each crosspoint contains an internal queue (XQ), which can store one or more packets to be routed. Traffic rates to be realized between all Input/Output (IO) pairs of the switch are specified in an N×M traffic rate matrix, where each element equals a number of requested cell transmission opportunities between each 10 pair within a scheduling frame of F time-slots. An efficient algorithm for scheduling N traffic flows with traffic rates based upon a recursive and fair decomposition of a traffic rate vector with N elements, is proposed. To reduce memory requirements a shared row queue (SRQ) may be embedded in each row of the switching matrix, allowing the size of all the XQs to be reduced. To further reduce memory requirements, a shared column queue may be used in place of the XQs. The proposed buffered crossbar switches with shared row and column queues, in conjunction with the row scheduling algorithm and the DCS column scheduling algorithm, can achieve high throughput with reduced buffer and VLSI area requirements, while providing probabilistic guarantees on rate, delay and jitter for scheduled traffic flows. | 10-22-2015 |
20150312163 | METHOD TO ACHIEVE BOUNDED BUFFER SIZES AND QUALITY OF SERVICE GUARANTEES IN THE INTERNET NETWORK - Methods to achieve bounded router buffer sizes and Quality of Service guarantees for traffic flows in a packet-switched network are described. The network can be an Internet Protocol (IP) network, a Differentiated Services network, an MPLS network, wireless mesh network or an optical network. The routers can use input queueing, possibly in combination with crosspoint queueing and/or output queueing. Routers may schedule QoS-enabled traffic flows to ensure a bounded normalized service lead/lag. Each QoS-enabled traffic flow will buffer O(K) packets per router, where K is an integer bound on the normalized service lead/lag. Three flow-scheduling methods are analysed. Non-work-conserving flow-scheduling methods can guarantee a bound on the normalized service lead/lag, while work-conserving flow-scheduling methods typically cannot guarantee the same small bound. The amount of buffering required in a router can be reduced significantly, the network links can operate near peak capacity, and strict QoS guarantees can be achieved. | 10-29-2015 |
20150327123 | DELAY AND JITTER LIMITED WIRELESS MESH NETWORK SCHEDULING - Schedule and channel assignment (SCA) in a wireless mesh network (WMN) is disclosed. A method includes: forming a representation of a sequence of permutation matrices from an n×n rate matrix. The entries of the rate matrix define the bandwidth of links between the n nodes of the WMN. Each of the permutation matrices represents active radio links between the n nodes. The sequence of permutation matrices defines a sequence of radio links to provide the desired bandwidth of links between said n nodes. Further, a representation of a sequence of partial permutation matrices corresponding to the sequence of permutation matrices is formed in such a way that each of the permutation matrices can be decomposed into a group of partial permutation matrices. Each of the partial permutation matrices in a group represents non-interfering radio links between the n nodes. In each timeslot, the n nodes are configured for radio transmission and reception in accordance with at least one of the partial permutation matrices in each group to transmit traffic between the n nodes. Example SCA can be used to provision longer-term guaranteed-rate backhaul traffic flows supporting multimedia services such as VOIP or IPTV between base-stations in a WMN, with near-minimal delay and jitter and near-perfect Quality-of-Service for every provisioned traffic flow. | 11-12-2015 |
Patent application number | Description | Published |
20110044174 | METHOD TO SCHEDULE MULTIPLE TRAFFIC FLOWS THROUGH PACKET-SWITCHED ROUTERS WITH NEAR-MINIMAL QUEUE SIZES - A method to schedule multiple traffic flows through a multiplexer server to provide fairness guarantees, while simultaneously minimizing the sizes of the associated queues, is proposed. To minimize the sizes of the associated queues, the multiplexer server minimizes a quantity called the maximum Normalized Service Lag for each traffic flow. Every traffic flow to be scheduled through a multiplexer server is assigned two values, an initial Normalized Service Lag value, and a Normalized Lag Increment value. In each time-slot, the normalized service lag of every traffic flow is updated by adding the normalized lag increment value, whether or not there is a packet in the queue associated with the flow. In each time-slot, a multiplexer server selects a traffic flow to service with an available packet and with the maximum normalized service lag. Efficient software and hardware methods for performing the iterative calculations are presented. When the traffic rate requested by each traffic flow is stable, the multiplexer server schedule will repeat periodically. Efficient methods to compute periodic schedules is proposed. The methods can support multiple traffic flows with multiple traffic classes. The methods can be applied to packet-switched Internet routers to achieve near-minimal queue sizes and near-minimal delays. | 02-24-2011 |
20140204739 | METHOD TO SCHEDULE MULTIPLE TRAFFIC FLOWS THROUGH PACKET-SWITCHED ROUTERS WITH NEAR-MINIMAL QUEUE SIZES - A method to schedule multiple traffic flows through a multiplexer server to provide fairness while minimizing the sizes of the associated queues, is proposed. The multiplexer server minimizes a quantity called the maximum Normalized Service Lag for each traffic flow. In each time-slot, the normalized service lag of every traffic flow may be updated by adding the normalized lag increment value, whether or not there is a packet in the queue associated with the flow. In each time-slot, a multiplexer server selects a traffic flow to service with an available packet and with the maximum normalized service lag. When the traffic rate requested by each traffic flow is stable, the multiplexer server schedule may repeat periodically. Efficient methods to compute periodic schedules are proposed. The methods can be applied to packet-switched Internet routers to achieve reduced queue sizes and delay. | 07-24-2014 |
20150365336 | METHOD TO SCHEDULE MULTIPLE TRAFFIC FLOWS THROUGH PACKET-SWITCHED ROUTERS WITH NEAR-MINIMAL QUEUE SIZES - A method to schedule multiple traffic flows through a multiplexer server to provide fairness while minimizing the sizes of the associated queues, is proposed. The multiplexer server minimizes a quantity called the maximum Normalized Service Lag for each traffic flow. In each time-slot, the normalized service lag of every traffic flow may be updated by adding the normalized lag increment value, whether or not there is a packet in the queue associated with the flow. In each time-slot, a multiplexer server selects a traffic flow to service with an available packet and with the maximum normalized service lag. When the traffic rate requested by each traffic flow is stable, the multiplexer server schedule may repeat periodically. Efficient methods to compute periodic schedules are proposed. The methods can be applied to packet-switched Internet routers to achieve reduced queue sizes and delay. | 12-17-2015 |