Patent application number | Description | Published |
20140233613 | WiFi Management Interface for Microwave Radio and Reset to Factory Defaults - WIFI management interfaces for microwave radio and reset to factory defaults are provided herein. Methods may include transmitting or receiving, on a dedicated management interface antenna of the wireless radio management signals, signals in a dedicated band for controlling operations of the wireless radio, and transmitting or receiving, on at least one additional antenna of the wireless radio management signals, signals that are not used for controlling operations of the wireless radio. The dedicated management interface antenna and the at least one additional antenna being physically separated from one another. | 08-21-2014 |
20140301381 | GENERIC CLIENT FOR COMMUNICATION DEVICES - A wireless communication device can include a processor to operate multiple virtual network interfaces that communicate simultaneously over a common wireless physical interface with different wireless networks. A first virtual network interface can be an infrastructure virtual interface to communicate over a first infrastructure network, and a second virtual network interfaces can be an ad-hoc interface to communicate over a second ad-hoc network. Another virtual network interfaces can be a Station (STA) infrastructure interface to communicate with an Access Point (AP) over a first infrastructure wireless network, and another virtual network interface can be a AP infrastructure interface to communicate with a STA over a second infrastructure wireless network. Another virtual network interface can be a Wireless Distribution System (WDS) interface to allow the AP infrastructure interface to communicate with another Access Point. | 10-09-2014 |
20140355578 | Wireless Access Points Providing Hybrid 802.11 and Scheduled Priority Access Communications - Wireless access points providing hybrid 802.11 and scheduled priority access communications are provided herein. An exemplary wireless access point may be configured to communicate with a set of standard access clients using an 802.11 mode of communication during standard access phases, as well as communicate with a set of priority access clients during priority access phases, when the wireless access point is not communicating with the set of standard access clients, using a priority mode of communication. | 12-04-2014 |
20140355584 | Wireless Access Points Providing Hybrid 802.11 and Scheduled Priority Access Communications - Wireless access points providing hybrid 802.11 and scheduled priority access communications are provided herein. An exemplary wireless access point may be configured to communicate with a set of standard access clients using an 802.11 mode of communication during standard access phases, as well as communicate with a set of priority access clients during priority access phases, when the wireless access point is not communicating with the set of standard access clients, using a priority mode of communication. | 12-04-2014 |
20150215952 | Channel Optimization in Half Duplex Communications Systems - Channel Optimization in Half Duplex Communications Systems is provided herein. Methods may include obtaining at a first terminal, radio frequency (RF) spectral information local to the first terminal, analyzing at the first terminal, RF spectral information for a second terminal that is not co-located with the first terminal, transmitting data to the second terminal on a second terminal optimal frequency band, and receiving data from the second terminal on the first terminal optimal frequency band, where the first terminal optimal frequency being based upon the RF spectral information local to the first terminal. | 07-30-2015 |
20150319584 | Wireless Access Points Providing Hybrid 802.11 and Scheduled Fixed Access Communications - Wireless access points providing hybrid 802.11 and scheduled priority access communications are provided herein. An exemplary wireless access point may be configured to communicate with a set of standard access clients using an 802.11 mode of communication during standard access phases, as well as communicate with a set of priority access clients during priority access phases, when the wireless access point is not communicating with the set of standard access clients, using a priority mode of communication. | 11-05-2015 |
20150327272 | WiFi Management Interface for Microwave Radio and Reset to Factory Defaults - WIFI management interfaces for microwave radio and reset to factory defaults are provided herein. Methods may include transmitting or receiving, on a dedicated management interface antenna of the wireless radio management signals, signals in a dedicated band for controlling operations of the wireless radio, and transmitting or receiving, on at least one additional antenna of the wireless radio management signals, signals that are not used for controlling operations of the wireless radio. The dedicated management interface antenna and the at least one additional antenna being physically separated from one another. | 11-12-2015 |
Patent application number | Description | Published |
20110236692 | FLUOROELASTOMER COMPOSITIONS HAVING SELF-BONDING CHARACTERISTICS AND METHODS OF MAKING SAME - Self-bonding curable fluoroelastomer compositions are provided wherein the compositions including a) a fluoropolymer composition having at least one curable fluoropolymer; and b) a compound selected from the group consisting of aluminum acrylates, silicon acrylates, and ammonia acrylates, wherein the self-bonding curable fluoroelastomer composition is able to bond directly to a substrate. Bonded structures formed of such self-bonding compositions and a substrate having a surface bonded thereto are also described herein along with a method for bonding a self-bonding curable fluoroelastomer composition to a substrate surface. The fluoroelastomers herein may encompass both non-fully fluorinated (FKM) and fully fluorinated (FFKM) elastomers. | 09-29-2011 |
20120077935 | FLUORINE-CONTAINING ELASTOMER COMPOSITIONS SUITABLE FOR HIGH TEMPERATURE APPLICATIONS - A curable fluorine-containing elastomer composition is described which includes a first curable perfluoropolymer comprising tetrafluoroethylene, a first perfluoroalkylvinyl ether and at least one first cure site monomer having at least one cure site, wherein tetrafluoroethylene is present in the first curable perfluoropolymer in an amount of at least about 50 mole percent; a second curable perfluoropolymer comprising tetrafluoroethylene, a second perfluoroalkylvinyl ether and at least one second cure site monomer having at least one cure site, wherein the second curable perfluoropolymer comprises fluoroplastic particles therein; and at least one curative. Cured compositions and molded articles formed from such compositions are also disclosed. | 03-29-2012 |
20120100379 | FLUOROELASTOMER BONDING COMPOSITIONS SUITABLE FOR HIGH-TEMPERATURE APPLICATIONS - Bonding compositions are provided herein for bonding a curable fluoroelastomer composition, and preferably a perfluoroelastomer composition, to a substrate during a heat curing process. The compositions include (a) a compound selected from the group consisting of aluminum acrylates, silicon acrylates, ammonia acrylates, and combinations thereof, (b) an adhesive compound; and (c) a solvent. Methods of bonding fluoro- and perfluoroelastomers to a substrate surface are also including herein which utilize the bonding compositions. | 04-26-2012 |
20140107280 | Fluoroelastomer Compositions Having Self-Bonding Characteristics and Methods of Making Same - Self-bonding curable fluoroelastomer compositions are provided wherein the compositions including a) a fluoropolymer composition having at least one curable fluoropolymer; and b) a compound selected from the group consisting of aluminum acrylates, silicon acrylates, and ammonia acrylates, wherein the self-bonding curable fluoroelastomer composition is able to bond directly to a substrate. Bonded structures formed of such self-bonding compositions and a substrate having a surface bonded thereto are also described herein along with a method for bonding a self-bonding curable fluoroelastomer composition to a substrate surface. The fluoroelastomers herein may encompass both non-fully fluorinated (FKM) and fully fluorinated (FFKM) elastomers. | 04-17-2014 |
Patent application number | Description | Published |
20090063426 | IDENTIFICATION OF SEMANTIC RELATIONSHIPS WITHIN REPORTED SPEECH - Methods and computer-readable media for associating words or groups of words distilled from content, such as reported speech or an attitude report, of a document to form semantic relationships collectively used to generate a semantic representation of the content are provided. Semantic representations may include elements identified or parsed from a text portion of the content, the elements of which may be associated with other elements that share a semantic relationship, such as an agent, location, or topic relationship. Relationships may also be developed by associating one element that is in relation to, or is about, another element, thereby allowing for rapid and effective comparison of associations found in a semantic representation with associations derived from queries. The semantic relationships may be determined based on semantic information, such as potential meanings and grammatical functions of each element within the text portion of the content. | 03-05-2009 |
20140040371 | Systems and methods for identifying geographic locations of social media content collected over social networks - A new approach is proposed that contemplates systems and methods to identify geographic locations of all social media content items retrieved form a social network in real time, wherein the geographic locations are physical locations from which the social media content items are originated or authored. If the latitude/longitude (geographic) coordinates of the content item are available, the geographic location of the social media content item can be identified using such geographic coordinates. For content items which geographic coordinates are not available, historical archive of content items with high-confidence of geographic locations are utilized to train a location classifier to predict geographic locations of such content items with high accuracy. Finally, the identified locations of the content items are confirmed to be accurate and are presented to a user together with the content items. | 02-06-2014 |
20150019558 | IDENTIFICATION OF SEMANTIC RELATIONSHIPS WITHIN REPORTED SPEECH - Methods and computer-readable media for associating words or groups of words distilled from content, such as reported speech or an attitude report, of a document to form semantic relationships collectively used to generate a semantic representation of the content are provided. Semantic representations may include elements identified or parsed from a text portion of the content, the elements of which may be associated with other elements that share a semantic relationship, such as an agent, location, or topic relationship. Relationships may also be developed by associating one element that is in relation to, or is about, another element, thereby allowing for rapid and effective comparison of associations found in a semantic representation with associations derived from queries. The semantic relationships may be determined based on semantic information, such as potential meanings and grammatical functions of each element within the text portion of the content. | 01-15-2015 |
Patent application number | Description | Published |
20080276248 | Visibility-aware services - The present visibility-aware service reduces power-intensive activities when a window associated with the visibility-aware service is not visible. The window is not visible when the window is minimized or when the window is switched from a foreground position to a background position on a display. | 11-06-2008 |
20090006471 | Exposing Specific Metadata in Digital Images - Specific metadata exposure with digital images involves making image metadata values associated with metadata type identification tags accessible via an application programming interface (API). In an example embodiment, a browser exposes an image metadata API that may be called with reference to a particular metadata type identification tag. The browser ascertains a particular image metadata value that is associated with the particular metadata type identification tag from image metadata of a targeted image item. When the particular image metadata value is returned to a caller of the image metadata API, the caller may consume or present the particular image metadata value in any manner. | 01-01-2009 |
20090006474 | Exposing Common Metadata in Digital Images - Common metadata exposure with digital images involves making image metadata types that are common across multiple image file formats accessible via an application programming interface (API). In an example embodiment, a browser exposes an image metadata API that may be called with reference to a preselected image metadata name. The browser determines an image metadata value that is associated with the preselected image metadata name from image metadata of a targeted image. When the image metadata value is returned to a caller of the image metadata API, the caller may consume or present the image metadata value in any manner. | 01-01-2009 |
20120131087 | CONCURRENTLY APPLYING AN IMAGE FILE WHILE IT IS BEING DOWNLOADED USING A MULTICAST PROTOCOL - A system and a process for deploying a computer file involves a client computer applying the computer file concurrently with downloading the computer file from a file server. The concurrent operations can be performed even when the data of the computer file is downloaded out of order. The computer file includes a plurality of file segments. The client computer obtains information defining the file segments and monitors the received data of the computer file during downloading. When downloading of a file segment is complete, the client computer applies the completed segment concurrently with receiving other segments of the computer file from the file server. The process can be used when the computer file is downloaded using a multicast protocol, but is not limited to use with multicast protocols. The client computer can request only needed segments of the computer file. | 05-24-2012 |
20120143993 | CLIENT-ADJUSTABLE WINDOW SIZE FOR CONNECTIONLESS TRANSFER PROTOCOLS - Described herein are various principles for operating transfer protocols using adaptive flow control techniques. In accordance with some of these principles, a client may adaptively negotiate with a server regarding a window size to use when communicating datagrams using a connectionless content unit transfer protocol like the Trivial File Transfer Protocol (TFTP). In some implementations, a client may inform a server whether to increase or decrease a window size. In these implementations, the client may increase the window size upon determining that a previous window size has led to successful transfer of content without any loss of datagrams and the client may decrease the window size upon detecting a loss of a datagram. Because of the limited resources available in some environments in which these techniques may be used, in some implementations a window size may be increased by small amounts but may be decreased drastically upon detecting a loss. | 06-07-2012 |
20120144060 | SHARED BUFFER FOR CONNECTIONLESS TRANSFER PROTOCOLS - Described herein are various principles for operating a connectionless content unit transfer protocol to transmit content of a content unit to multiple clients using a shared buffer. A server may transfer content of one or more content units to each of multiple clients upon request from the client using individual buffers. For each content unit being transferred, the server may maintain a count of the aggregate size of buffers for transferring content of that content unit. If the server determines that the aggregate size of the buffers transmitting a particular content unit is larger than the content unit itself, the server may establish a shared buffer for transferring that content unit to clients. A server using a shared buffer in this manner may transfer content of the content unit to clients using the shared buffer until all requesting clients have received the content unit. | 06-07-2012 |
20150249702 | CLIENT-ADJUSTABLE WINDOW SIZE FOR CONNECTIONLESS TRANSFER PROTOCOLS - Described herein are various principles for operating transfer protocols using adaptive flow control techniques. In accordance with some of these principles, a client may adaptively negotiate with a server regarding a window size to use when communicating datagrams using a connectionless content unit transfer protocol like the Trivial File Transfer Protocol (TFTP). In some implementations, a client may inform a server whether to increase or decrease a window size. In these implementations, the client may increase the window size upon determining that a previous window size has led to successful transfer of content without any loss of datagrams and the client may decrease the window size upon detecting a loss of a datagram. Because of the limited resources available in some environments in which these techniques may be used, in some implementations a window size may be increased by small amounts but may be decreased drastically upon detecting a loss. | 09-03-2015 |
Patent application number | Description | Published |
20100138688 | MANAGING SERVICE LEVELS ON A SHARED NETWORK - Devices and methods for modeling and analysis of services provided over a common network include a processor configured to track services connected to the common network through nodes and links; run service models associated with the services under selected conditions, the selected conditions including failure and repair of one of the nodes or links; and propose corrective action and/or change of network resources of the common network to minimize impact of the failure. The processor may also run Network models. The models may be executed successively or simultaneously, and outputs of one model may be used as input to other models, including any necessary conversions for compatibility. | 06-03-2010 |
20110276887 | ORGANIZING, DISPLAYING, AND/OR MANIPULATING NETWORK TRAFFIC DATA - A system and method for analyzing network traffic activity by displaying a collection of flow objects and receiving a user's selection of a traffic operation that is to be applied to a set of selected flow objects. Thereafter, the results of applying the traffic operation to the selected flow objects are displayed. The traffic operation may include a merge operation that provides statistics related to an aggregation of the flow objects. The traffic operation may also include a modification operation that modifies the selected flow objects, including, for example, a modification based on predicted traffic flow. Other traffic operations may also be provided, including providing access to plug-in traffic operation applications. | 11-10-2011 |
20120179813 | TRAFFIC FLOW INFERENCE BASED ON LINK LOADS AND GRAVITY MEASURES - Traffic flow between each pair of nodes in a network are determined based on loads measured at each link and based on gravity measures. The gravity measures correspond to a likelihood of the node being a source or a sink of traffic and may be assigned based on characteristics associated with each node, such as the demographics of the region in which the node is located, prior sinking and sourcing statistics, and so on. The gravity measures are used to generate an objective function for solving a system of linear equations, rather than as criteria that must be satisfied in the solution. The measured link loads are allocated among the traffic flows between nodes to at least a given allocation efficiency criteria by solving a system of linear equations with an objective of minimizing a difference between the assigned gravities and the resultant gravities corresponding to the determined flows. | 07-12-2012 |
20140133349 | TRAFFIC FLOW INFERENCE BASED ON LINK LOADS AND GRAVITY MEASURES - Traffic flow between each pair of nodes in a network may be modeled based on loads measured at each link and based on gravity measures associated with each node. Gravity measures correspond to a relative likelihood of the node being a source or a sink of traffic. Gravity objectives are assigned to nodes to serve as an objective for a node's performance. These gravity objectives may be based on qualitative characteristics associated with each node. Because the assigned gravity objectives may be subjective, the gravity measures are used to generate a quantitative function for determining whether a network can achieve these gravity objectives. In one embodiment, link loads are allocated to traffic flows between nodes and current gravity measures are determined. Changes to link loads and traffic flows may then be modeled to minimize a difference between the assigned gravity measures and the gravity measures. | 05-15-2014 |
Patent application number | Description | Published |
20080301758 | Distributed knowledge access control - Techniques for distributed knowledge access control are disclosed herein. These techniques may enable access control information to be provided in the form of a statement that includes an assertion and a construct that targets the assertion to one or more intended entities. By targeting the statement to intended entities, the construct may help protect resources from unauthorized use and may also help protect the issuer of the statement from accountability resulting from misuse of the statement. | 12-04-2008 |
20090271528 | EFFICIENT CHUNKING ALGORITHM - The present invention provides a method for chunking an object. The method is arranged to provide efficient chunking of objects such that objects can be efficiently updated between a remote machine and a local machine over a network. The chunking algorithm is applicable in networked application such as file synchronization using remote differential compression (RDC) techniques. The chunking algorithm provides enhanced efficiencies by locating chunk boundaries around local maxima. | 10-29-2009 |
20100011194 | STATE AS A FIRST-CLASS CITIZEN OF AN IMPERATIVE LANGUAGE - A state component saves a present state of a program or model. This state component can be invoked by the program or model itself, thereby making state a first-class citizen. As the state of the program evolves from the saved state, the saved state remains for reflection and recall, for example, for testing, verification, transaction processing, etc. Using a state reference token, the saved state of the program or model can be accessed by the program or model. For example, the program or model by utilizing a state component, can return itself to the saved state. After returning to the saved state, a second execution path can be introduced without requiring re-execution of the actions leading to the saved state. In another example, the state space of an executing model is saved in order to generate inputs required to exercise a program or model. | 01-14-2010 |
20140258986 | Identifying Implicit Assumptions Associated with a Software Product - A framework is described herein for identifying implicit assumptions associated with an SDK and its accompanying documentation (e.g., dev guide). An implicit assumption is information that is not expressly stated in the documentation, but which would be useful in assisting an application developer in building an application. The framework also describes a systematic approach for identifying one or more vulnerability patterns based on the identified implicit assumptions. An application developer may run a test on an application that is being developed to ensure that it does not have any deficiency which matches a vulnerability pattern. | 09-11-2014 |
20140280427 | METHOD AND SYSTEM FOR DECOMPOSING SINGLE-QUBIT QUANTUM CIRCUITS INTO A DISCRETE BASIS - A target quantum circuit expressed in a first quantum gate basis may be transformed into a corresponding quantum circuit expressed in a second quantum gate basis, which may be a universal set of gates such as a V gate basis set. The target quantum circuit may be expressed as a linear combination of quantum gates. The linear combination of quantum gates may be mapped to a quaternion. The quaternion may be factorized, based at least in part on an amount of precision between the target quantum circuit and the corresponding quantum circuit expressed in the second quantum gate basis, into a sequence of quaternion factors. The sequence of quaternion factors may be mapped into a sequence of quantum gates of the second quantum gate basis, where the sequence of sequence of quantum gates is the corresponding quantum circuit. | 09-18-2014 |