Abstract:
A method for detecting an arrhythmia hidden by rapid pacing in a rate adaptive pacemaker/defibrillator. Unmasking a potential arrhythmia is accomplished by lengthening the pace cycle length by a small amount for a number of cycles followed by a shortening of the pace cycle length for the same number of cycles giving an average pacing rate equivalent to the desired rate. This can occur at all times or only when conditions make arrhythmia masking possible. Changing the pace cycle by a small amount over a number of cycles will move the arrhythmia and paced rhythm out of synchronization. Forcing the pacer to continue sensing the arrhythmia is accomplished by insuring that the pacer's sense refractory is less than one half of the pacing cycle length. This is done by constraining the programming of that value to one half the minimum pacing cycle length or using an adaptive sense refractory period. In another embodiment, a hidden arrhythmia is detected by periodically checking a relative refractory portion of the pace refractory period to see if a signal indicative of arrhythmia can be detected. This relative refractory period is produced by shortening the established refractory period by a calculated adaptive relative refractory period.
Abstract:
A method and implementation are disclosed for binding a mobile node to a subnet. The invention comprises steps and implementations for intercepting messages sent by a mobile node to a server, associating a predetermined subnet with the intercepted messages and forwarding the intercepted messages to the server. The invention intercepts reply messages sent by at least one server and selects reply messages that are associated with the predetermined subnet. The selected reply messages are forwarded to the mobile node, and reply messages that are not associated with the predetermined subnet are discarded.
Abstract:
A search algorithm to find a globally optimal radio plan for a wireless network, including assignments of frequency and transmission power to multiple access points. Two different evaluation metrics are used in order to provide an optimal solution in a reasonable time period. Frequency searches are performed using a special rapid evaluation metric. Transmission powers are selected using a more refined metric that estimates data throughput. The search results are deterministic and execution time is also substantially deterministic.
Abstract:
An apparatus for reducing the stresses placed on a cantilevered component mounted to a rigid frame includes cushioned bushings coupling the cantilevered component to a rigid frame. As the cantilevered component is loaded due to bending moments, the cushioned bushings flex and cushion the cantilevered component. The cantilevered component is retained within the bushing using hardware that allows the cantilevered component to float as needed to further reduce stresses and strains thereon.
Abstract:
A set of new information elements are defined that are to be used between an access point and a client that allow an access point to advertise its capabilities, configuration, and/or parameters allowing the client to tune to the parameters prior to, during, or after associating with the access point. If the access point adjusts these parameters, the changes are advertised in subsequent beacons and response frames and the client responsive to receiving a beacon or response frame with changed parameters will change its parameters accordingly. If the station changes its operating parameters it will send a message to the access point informing the access point of the changes.
Abstract:
A search algorithm to find a globally optimal radio plan for a wireless network, including assignments of frequency and transmission power to multiple access points. Two different evaluation metrics are used in order to provide an optimal solution in a reasonable time period. Frequency searches are performed using a special rapid evaluation metric. Transmission powers are selected using a more refined metric that estimates data throughput. The search results are deterministic and execution time is also substantially deterministic.
Abstract:
A method, an apparatus, and a software program to implement a method to detect a rogue access point of a wireless network. The method includes maintaining an AP database that includes information about managed access point (APs) and friendly APs, including the MAC address of each managed AP. The method further includes sending a scan request to one or more managed APs, including one or more of a request for the receiving managed AP to scan for beacons and probe responses and a request for the receiving managed AP to request its clients to scan for beacons and probe responses. The method further includes receiving reports from at least one of the receiving managed APs, a report including information on any beacon or probe response received that was sent by an AP. For each beacon or probe response on which information is received, the method analyzes the information received in the report about the AP that sent the beacon or probe response, the analyzing including ascertaining if the MAC address of the AP that sent the beacon or probe response matches a MAC address of an AP in the AP database to ascertain whether or not the AP is a potential rogue AP or a managed or friendly AP.
Abstract:
A set of new information elements are defined that are to be used between an access point and a client that allow an access point to advertise its capabilities, configuration, and/or parameters allowing the client to tune to the parameters prior to, during, or after associating with the access point. If the access point adjusts these parameters, the changes are advertised in subsequent beacons and response frames and the client responsive to receiving a beacon or response frame with changed parameters will change its parameters accordingly. If the station changes its operating parameters it will send a message to the access point informing the access point of the changes.
Abstract:
Systems and methods for evaluating wireless network quality. A metric provided by embodiments of the present invention relies on information that is relatively easy to collect, can be very efficiently computed, and yet provides a realistic estimate of likely wireless network performance. In one implementation, the input includes path loss data and access point transmitter power level and frequency settings. A capacity indicator is computed for each client and each access point. A data rate indicator is computed for each client location. The traffic load is computed for each access point. Based on these computed indicators, a bidirectional client throughput can be computed for each client and a combined metric can be determined for the network as a whole.
Abstract:
The matching algorithm of the layout synthesis method and apparatus disclosed locates transistor pattern matches in a design, links a parameterized tile to each identified match, and adjusts certain variable parameters of the linked parameterized tile to meet the physical design requirements of each located match. Each transistor pattern corresponds to a parameterized tile, which is an actual physical representation of the corresponding pattern and includes variable parameters, which may include transistor size. The matching algorithm locates matches in the design for an ordered list of patterns, names each located match, links the proper parameterized tile to each named match, and adjusts the tile's variable parameters as required. Transistors in the design are included in one and only one named located match.