Patent application number | Description | Published |
20160142518 | EVOLVED DATA COMPRESSION SCHEME SIGNALING - Methods, systems, and devices are described for wireless communication at a UE. In aspects, a receiver may receive a transmission requesting information about support for data compression. The receiver may determine parameters related to the types of supported data compression and communicate the information to the transmitting device. In some cases, the receiver may then receive a message from the transmitting entity that requests establishment of a data compression configuration. The receiver may respond with confirmation or rejection of the proposed compression configuration. If the configuration is confirmed, the transmitter and receiver may exchange compressed data packets according to the configuration. The devices may exchange status and control information related to the compression configuration (e.g., in a compression header of a compressed message or a separate status and/or control information message). | 05-19-2016 |
20160142932 | EVOLVED DATA COMPRESSION SCHEME FOR UNRELIABLE TRANSMISSION MODES - Methods, systems, and devices are described for wireless communication at a device. A transmitting device such as a base station may select some packets for direct transmission to a receiving device using data compression based on the reliability of the direct connection. The transmitting device may select other packets for indirect transmission via an unreliable connection using uncompressed packets or compressed packets that will not be used to update a compression buffer. In some cases, uncompressed packets may also be sent via the reliable connection. If a packet sent over the unreliable connection is lost, it may be transmitted over the reliable connection. | 05-19-2016 |
20160142934 | BUFFER STATUS REPORT FOR eDCS - Methods, systems, and devices are described for wireless communication. A user equipment (UE), for example, may determine a content size of an uncompressed buffer and a content size of a compressed buffer. The UE may then generate a buffer status report (BSR) based on the content sizes of the uncompressed buffer and the compressed buffer. Alternatively, a base station may receive a BSR based on a size of an uncompressed buffer of the UE. The base station may then receive a compressed packet from the UE and may determine a compression gain based on a size of the compressed packet and a size of a corresponding uncompressed packet. The base station may then adjust the received BSR based on the compression gain. | 05-19-2016 |
20160142937 | TECHNIQUES FOR COMPRESSING SESSION INITIATION MESSAGES USING TEMPLATES FOR EVOLVED DATA COMPRESSION SCHEME (EDCS) - Session initiation messages may be compressed using templates for evolved data compression scheme (eDCS). One or more session initiation messages may be exchanged between various network entities, such as UEs and base stations, for purposes such as registration, call setup, and call modification, for example. Session initiation messages may include header fields which identify the caller and characteristics of the device receiving the call, and may also contain payload, which describes the audio/video codec characteristics. Many of these contents may be repeated across all user devices of the same vendor attached to the same operator and may be compressed using templates to enhance system efficiency. These templates may be known at the transmitter and receiver, and reduce the data that has to be carried over air. | 05-19-2016 |
20160142951 | DATA COMPRESSION TECHNIQUES FOR HANDOVER AND RADIO LINK FAILURE RECOVERY - A user equipment (UE) and source base station may use data compression techniques for data packets sent between them. During a handover, the source base station may provide data compression context to a target base station, thus enabling the target base station to continue the data compression following the handover without having to reestablish the data compression context. The source base station may determine data compression capabilities of the UE or the target base station, or both, and may communicate the determined data compression capabilities to the UE or target base station. The source base station may identify at least one gap in a sequence of packets received from the UE, and communicate the existence of the gap to the target base station, which may request retransmission of packets associated with the gap. | 05-19-2016 |
Patent application number | Description | Published |
20090268683 | PARTIAL RADIO LINK CONTROL STATUS REPORT - Systems and methodologies are described that facilitate formation and/or dispatch of radio link control (RLC) protocol status reports to a base station. The system can include components that quantify an absence of protocol data units, ascertain whether a number of absent protocol data units exceeds the size of a transmission side grant, insert a sequence number associated with a first absent protocol data unit into an acknowledgement sequence number field associated with a partial status report, incorporates the sequence number associated with the first absent protocol data unit in the partial status report, includes sequence numbers of subsequent absent protocol data units into the partial status report without exceeding the transmission side grant, and sends the partial status report to the base station. | 10-29-2009 |
20100034187 | EFFICIENT PACKET HANDLING FOR TIMER-BASED DISCARD IN A WIRELESS COMMUNICATION SYSTEM - Systems and methodologies are described herein that facilitate efficient handling of packets (e.g., Packet Data Convergence Protocol (PDCP) Protocol Data Units (PDUs) or Service Data Units (SDUs)) in a wireless communication system. As described herein, a number of consecutive packets that are discarded due to a discard timer expiration event and/or other causes can be monitored and compared to a number of tolerated consecutive discarded packets. If the number of consecutive discarded packets does not exceed the number of tolerated consecutive packets, conventional processing operations such as header modification and compression, ciphering, or the like can be omitted for respective packets subsequent to a discarded packet, thereby significantly reducing processing overhead. As further described herein, the number of tolerated consecutive discarded packets can be chosen to maintain header compression (e.g., Robust Header Compression (RoHC)) synchronization, ciphering synchronization, and/or other suitable properties. | 02-11-2010 |
20100118892 | EFFICIENT UE QOS/UL PACKET BUILD IN LTE - An apparatus for wireless communication includes a processing system. The processing system is configured to perform a first set of functions in a first thread. The first set of functions includes obtaining second data from a second thread and providing first data to the second thread to facilitate construction of an uplink packet in the second thread. The processing system is further configured to perform a second set of functions in the second thread. The second set of functions includes obtaining the first data, constructing the uplink packet based on the first data, and providing the second data to the first thread to facilitate the performing of the first set of functions. | 05-13-2010 |
Patent application number | Description | Published |
20130124447 | COGNITIVE RELEVANCE TARGETING IN A SOCIAL NETWORKING SYSTEM USING CONCEPTS INFERRED FROM EXPLICIT INFORMATION - A social networking system infers a user's present interests based on the user's recent actions and/or the recent actions of the user's connections in the social networking system. The social networking system also determines a set of concepts associated with each of a set of information items, such as advertisements. By matching the user's present interests with the concepts associated with the information items, the social networking system selects one or more of the information items that are likely to be of present interest to the user. At least one of the matched interests and concepts are not identical. The social networking system then presents the selected information items for display to the user, thereby providing information based on an inferred temporal relevance of that information to the user. | 05-16-2013 |
20130159100 | SELECTING ADVERTISEMENTS FOR USERS OF A SOCIAL NETWORKING SYSTEM USING COLLABORATIVE FILTERING - A social networking system selects advertisements for its users using collaborative filtering based on the users' interactions with objects in the social networking system. The objects may be games, pages, groups, deals, messages, content items, advertisements, or any other object with which a user may interact in the system. The system may identify a viewing user's interaction with a first object, determine a second object that is similar to the first object based on interactions of users with both of the objects, and send an advertisement associated with the second object to the viewing user. The system determines a second object based a similarity score between the first object and the second object, which may be a measure of users who have interacted with both objects and may be normalized by a number of user interactions by the users with the objects. | 06-20-2013 |
20140032564 | Social Static Ranking for Search - In one embodiment, one or more computing devices assign each of a plurality of nodes of a graph of a social-networking system to one of a plurality of search indices. Each search index corresponds to a node type, and each node assigned to a search index is of the node type that the search index corresponds to. For each search index, the one or more computing devices determine a value for each node assigned to the search index based at least in part on edges connected to the node in the graph and rank the nodes assigned to the search index based at least in part on their values. The one or more computing devices provide the search indices for storage to facilitate responding to queries encompassing objects represented by the nodes assigned to the search indices. | 01-30-2014 |
20140330809 | Using Inverse Operators for Queries on Online Social Networks - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, parsing the structure query to identify a first query constraint and one or more second query constraints, identifying a inverse constraint associated with the first query constraint, and generating a query command based on the structured query, where the query command includes the inverse constraint and the one or more second query constraints. | 11-06-2014 |
20140330818 | Search Intent for Queries on Online Social Networks - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, generating search results corresponding to the structured query, determine a search intent based on the selected nodes or selected edges referenced in the structured query, and scoring the search results based on the search intent. | 11-06-2014 |
20140330819 | Search Query Interactions on Online Social Networks - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, generating a query command based on the structured query based on the structured query comprising a first query constraint and a second query constraint, identifying a first set of nodes matching the first query constraint and at least in part matching the second query constraint, identifying a second set of nodes matching the second query constraint, and generating search results based on the first and second set of nodes. | 11-06-2014 |
20140337317 | Approximate Privacy Indexing for Search Queries on Online Social Networks - In one embodiment, a method includes receiving from a first user of an online social network a search query, searching data stores to identify objects that match the search query, where identifying the objects is also based in part on the privacy setting for each object, determining for each identified object a visibility of the object with respect to the first user, and generating one or more search results corresponding to the search query. | 11-13-2014 |
20150039597 | Rewriting Search Queries on Online Social Networks - In one embodiment, a method includes accessing a set of queries of an online social network received from one or more users of the online social network, parsing each query using a parsing algorithm to generate a query command based on each query, each query command comprising one or more query constraints for a specified number of objects of a specified object-type as specified by parsing-configuration parameters of the parsing algorithm, retrieving the specified number of objects that match at least a portion of the query constraint from one or more data stores associated with the online social network, scoring each retrieved object based on a scoring algorithm, and generating one or more revised parsing-configuration parameters based on a comparison of the scores of the retrieved objects and the specified number of objects of the query constraints. | 02-05-2015 |
20150088872 | Social Static Ranking for Search - In one embodiment, one or more computing devices receive, from a client device of a first user, a query from the first user. The computer devices search a social graph to identify one or more nodes of the social graph that are relevant to the query. The computer devices obtain a static rank for each identified node. The static rank is based at least in part on a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph. The computer devices send to the client device of the first user for display, a search-results page responsive to the received query. The search-results page includes reference to one or more nodes having a static rank greater than a threshold rank. | 03-26-2015 |
20160041982 | Conditioned Search Ranking Models on Online Social Networks - In one embodiment, a method includes a computing system receiving a query from a first user, which can be parsed to identify i conditions associated with the query. The system may then identify one or more search results substantially matching the i conditions. Each search result may be associated with a feature vector of j features. The system may then access a conditioned ranking model that comprises j scoring functions for each i condition. The j scoring functions may correspond to j features of the feature vectors. A score for each search result may be calculated based on the i conditions and the j features. The system may then receive a selection of one of the search results from the first user, and in response modify one or more of the j scoring functions of the conditioned ranking model based on the selection. | 02-11-2016 |
20160103840 | Social Static Ranking for Search - In one embodiment, one or more computing devices receive, from a client device of a first user, a query from the first user. The computer devices search a social graph to identify one or more nodes of the social graph that are relevant to the query. The computer devices obtain a static rank for each identified node. The static rank is based at least in part on a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph. The computer devices send to the client device of the first user for display, a search-results page responsive to the received query. The search-results page includes reference to one or more nodes having a static rank greater than a threshold rank. | 04-14-2016 |
20160110413 | Search Query Interactions on Online Social Networks - In one embodiment, a method includes receiving, from a client system of a first user of an online social network, a structured query comprising references to one or more selected objects associated with the online social network, generating a query command based on the structured query, wherein the query command comprises an inner query constraint and an outer query constraint, identifying a first set of objects matching the inner query constraint and at least in part matching the outer query constraint, identifying a second set of objects matching the outer query constraint, and generating one or more search results based on the first and second sets of objects, wherein each search result corresponds to an object of the plurality of objects. | 04-21-2016 |
20160132507 | Search Intent for Queries on Online Social Networks - In one embodiment, a method includes receiving, from a client system of a first user, a structured query comprising references to one or more selected objects accessible by the computing device, generating one or more search results corresponding to the structured query, wherein each search result corresponds to a particular object accessible by the computing device, determining one or more search intents based at least on whether one or more of the selected objects referenced in the structured query match objects corresponding to a search intent indexed in a pattern-detection model, and scoring the search results based on one or more of the search intents. | 05-12-2016 |
20160132597 | Using Inverse Operators for Queries on Online Social Networks - In one embodiment, a method includes receiving, from a client device of a first user of an online social network, a structured query comprising references to one or more selected objects associated with the online social network, parsing the structured query to identify a first query constraint and one or more second query constraints, identifying an inverse constraint associated with the first query constraint, wherein the first query constraint has been previously flagged as identifying greater than a threshold number of objects, and generating a query command based on the structured query, wherein the query command comprises the inverse constraint and the one or more second query constraints. | 05-12-2016 |
Patent application number | Description | Published |
20100120440 | Method and apparatus for joint optimization of dedicatedand radio access networks - A computerized method and system for integrated access network business planning for a telecommunications carrier. The invention enables a user to input a set of network business planning parameters that are utilized by a linear programming model to jointly optimize a carrier's dedicated and radio access network by executing a plurality of network optimization models and determine network configuration changes for the dedicated and radio access networks as a constrained optimization based on the set of business planning parameters. | 05-13-2010 |
20100157841 | METHOD AND APPARATUS FOR DETERMINING BANDWIDTH REQUIREMENT FOR A NETWORK - A method and apparatus for determining a bandwidth requirement for a network are disclosed. For example, the method gathers data for one or more types of traffic, and determines an optimal traffic model for each of the one or more types of traffic in accordance with the data and one or more traffic model adaptation rules for each of the one or more types of traffic. The method then determines a demand forecast for each of the one or more types of traffic by applying the optimal traffic model for each of the one or more types of traffic, and determines a bandwidth requirement for the one or more types of traffic in accordance with the demand forecast. | 06-24-2010 |
20110085467 | Method and Apparatus for Clustering Based Optimal Fiber Ring Deployment - A computer readable storage medium stores a set of instructions executable by a processor. The instructions are operable to receive a data set including data corresponding to a set of nodes, the data corresponding to each of the nodes including a node prize, a node cost, and a node value that is the difference between the node prize and the node cost; select one or more of the nodes for inclusion in a cluster, the cluster comprising the one or more of the nodes, two or more external links from nodes in the cluster to a network, and one or more internal links between nodes if the cluster comprises two or more nodes, each of the internal links having an internal link cost, each of the external links having an external link cost; and determine a plan for incorporating the one or more nodes in the cluster into the network, the incorporating comprising building the cluster by building the two or more external links and the one or more internal links. | 04-14-2011 |
20110149761 | Technique for determining transport capacity required to achieve controllable worst case throughput - A link in a communications network is provisioned with a particular bandwidth capacity determined as a function of a “sub-par customer data fraction.” The sub-par data fraction is given by a) the amount of data transferred under sub-par condition divided by b) the total data transferred, where “sub-par condition” means that data is transferred below a given target bit rate. | 06-23-2011 |
20120082114 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area, and a physical characteristic of an antenna in the geographical area, determines busy time data traffic from the network traffic data, determines, for the cell, a cell range from the physical characteristic of the antenna, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range. | 04-05-2012 |
20120082115 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A FIXED WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area for mobility traffic and fixed wireless traffic, a physical characteristic of an antenna in the geographical area, and a type of connectivity at a customer premise, determines a busy time data traffic from the network traffic data for both the fixed wireless traffic and the mobility traffic, determines, for the cell, a cell range from the physical characteristic of the antenna and the type of connectivity at the customer premise, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range, wherein the average throughput comprises a throughput for serving both the mobility traffic and the fixed wireless traffic. | 04-05-2012 |
20120113965 | METHOD AND APPARATUS FOR LOCATING A WI-FI HOTSPOT FOR OFFLOADING WIRELESS TRAFFIC - A method and apparatus for locating a Wi-Fi hotspot for offloading wireless traffic from a cellular network are disclosed. For example, the method obtains network traffic data for the second type of wireless access network for a geographical area, and obtains a list of sectors in the geographical area. The method selects at least one sector from the list of sectors to be relieved, and determines a geographical range for the at least one sector. The method then obtains at least one hotspot of the first type of wireless access network within the geographical range, wherein the at least one hotspot is a potential location for offloading the wireless traffic from the second type of wireless access network. | 05-10-2012 |
20120127871 | METHOD AND APPARATUS FOR FORECASTING BUSY HOUR TRAFFIC FOR A WIRELESS NETWORK - A method and apparatus for forecasting busy hour traffic for a network are disclosed. For example, the method obtains actual traffic data for a seed time frame for each of one or more sectors in a given market and marketing projections for one or more forecast time frames for the given market, and determines a market traffic actual measure for the given market from the actual traffic data. The method obtains market traffic estimates from one or more previous runs, and updates the one or more market traffic estimates for the one or more forecast time frames beyond the seed time frame to obtain one or more updated market traffic estimates, wherein the updated market traffic estimates are used for forecasting the busy hour traffic data for each of the one or more forecast time frames beyond the seed time frame. | 05-24-2012 |
20120140643 | METHOD AND APPARATUS FOR AUTOMATIC ESTIMATION OF TRAFFIC REASSIGNMENT - A method and apparatus for providing an estimation of traffic reassignment for a network are disclosed. For example, the method and apparatus provide an automatic estimation of traffic reassignment for a wireless network. | 06-07-2012 |
20120151078 | METHOD AND APPARATUS FOR CAPACITY DIMENSIONING IN A COMMUNICATION NETWORK - A method, computer readable medium and apparatus for calculating a capacity for high speed packet access data in a link in a communications network are disclosed. For example, the method initializes parameters associated with streaming data, long elastic data and short elastic data, determines, via a processor, a capacity value such that a quality of service metric is met for the streaming data, the long elastic data and the short elastic data and provisions the link with the capacity value if the quality of service metric is met. | 06-14-2012 |
20130163432 | Technique for Determining Transport Capacity Required to Achieve Controllable Worst Case Throughput - A link in a communications network is provisioned with a particular bandwidth capacity determined as a function of a “sub-par customer data fraction. ” The sub-par data fraction is given by a) the amount of data transferred under sub-par condition divided by b) the total data transferred, where “sub-par condition” means that data is transferred below a given target bit rate. | 06-27-2013 |
20140031053 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A FIXED WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area for mobility traffic and fixed wireless traffic, a physical characteristic of an antenna in the geographical area, and a type of connectivity at a customer premise, determines a busy time data traffic from the network traffic data for both the fixed wireless traffic and the mobility traffic, determines, for the cell, a cell range from the physical characteristic of the antenna and the type of connectivity at the customer premise, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range, wherein the average throughput comprises a throughput for serving both the mobility traffic and the fixed wireless traffic. | 01-30-2014 |
20140082203 | METHOD AND APPARATUS FOR CAPACITY DIMENSIONING IN A COMMUNICATION NETWORK - A method, computer readable medium and apparatus for calculating a capacity for high speed packet access data in a link in a communications network are disclosed. For example, the method initializes parameters associated with streaming data, long elastic data and short elastic data, determines, via a processor, a capacity value such that a quality of service metric is met for the streaming data, the long elastic data and the short elastic data and provisions the link with the capacity value if the quality of service metric is met. | 03-20-2014 |
20140141788 | METRO CELL PLANNING - Dynamic metro cell location planning is provided within the wireless communication coverage area of a macro cell. Metro cell location planning can include obtaining performance parameters associated with the macro cell and evaluating coverage parameters of the macro cell. Metro cell location planning can also include selecting, based on the performance parameters and the coverage parameters, a location within a wireless communication coverage area of the macro cell for placement of the metro cell. The selected location can be conveyed to a user and/or entity for deployment of the metro cells. Metro cells can be used by a carrier to fill a coverage hole and/or to offload capacity hot-spots within the network. | 05-22-2014 |
20140378153 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area, and a physical characteristic of an antenna in the geographical area, determines busy time data traffic from the network traffic data, determines, for the cell, a cell range from the physical characteristic of the antenna, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range. | 12-25-2014 |
Patent application number | Description | Published |
20110167142 | HIERARCHICAL SERVICE MANAGEMENT - A service management system includes data storage storing a hierarchy of a network in a user premises. The hierarchy includes virtual network layers and devices in each layer. The storage device also stores service profiles for services associated with levels in the hierarchy, and the levels include one or more of the virtual network layers. The system receives information for creating a service for a device in a layer. The information includes service functions and attributes. The system also stores a service profile for the service in the storage device, and the service profile includes the received information. The system determines whether to trigger the service based on the received data and information in the service profile. | 07-07-2011 |
20130297764 | HIERARCHICAL SERVICE MANAGEMENT - A service management system may include a data storage device storing a hierarchy of a network in a user premises. The hierarchy may include virtual network layers and devices in each layer. The devices may be connected to the network in the user premises. The storage device may also store service profiles for services associated with the virtual network layers and the devices. The system can create services for the devices and identify services to trigger based on data received from the devices and the hierarchy. | 11-07-2013 |
20160034723 | TEST AUTOMATION FOR AUTOMATED FARE MANAGEMENT SYSTEMS - A test robot may receive a test scenario for testing a fare management system. The test robot may program a fare card to store card information based on the test scenario. The test robot may provide an instruction to an actuator component to cause the actuator component to move the fare card within communicative proximity of a card reader device. The fare card, when moved within communicative proximity of the card reader device, may cause the card reader device to read the stored card information from the fare card and to provide updated card information, based on the stored card information, for storage by the fare card. The test robot may read the updated card information from the fare card. The test robot may provide test result information, based on the updated card information, to a test management device. | 02-04-2016 |
20160055428 | SECURE SHORT-DISTANCE-BASED COMMUNICATION AND ENFORCEMENT SYSTEM - A secure short-distance-based communication and enforcement system validates users in a validation and enforcement area and can check if users in the validation and enforcement area have been validated. Run-time IDs and keys that may be location-specific and device-specific may be generated and utilized for secure communication between mobile devices and zone computers and enforcement computers that execute validation and inspection. | 02-25-2016 |
20160055689 | SECURE SHORT-DISTANCE-BASED COMMUNICATION AND ACCESS CONTROL SYSTEM - A secure short-distance-based communication and access control system controls access to a restricted area. A run-time mobile device identifier and keys that may be location-specific, device-specific and time-specific are generated and utilized for secure communication between mobile devices and zone computers. The zone computers can validate users via their mobile devices to allow or deny access to the restricted area. | 02-25-2016 |
20160055690 | SECURE SHORT-DISTANCE-BASED COMMUNICATION AND VALIDATION SYSTEM FOR ZONE-BASED VALIDATION - A secure short-distance-based communication and validation system validates users in a validation area. The system may include multiple zones in the validation area and beacons in each zone. A run-time mobile device identifier and keys that may be location-specific, device-specific and time-specific are generated and utilized for secure communication between mobile devices and a zone computer in a zone. The validation area may be in a vehicle, and validation may include deducting a fare. | 02-25-2016 |
20160055693 | VALIDATION IN SECURE SHORT-DISTANCE-BASED COMMUNICATION AND ENFORCEMENT SYSTEM ACCORDING TO VISUAL OBJECTS - A secure short-distance-based communication and enforcement system validates users in a validation and enforcement area and can check if users in the validation and enforcement area have been validated. A visual object can be displayed on an enforcement computer and a mobile device of a user in the in the validation and enforcement area to determine if a user is validated. The visual object may be periodically changed. | 02-25-2016 |
20160055697 | RESTRICTED AREA ACCESS CONTROL SYSTEM - An access control system controls access to a restricted area. A mobile device exchanges messages with a backend server to validate a user and to control an actuator for a physical barrier responsive to validation. Beacon-based unique identifiers are calculated at validation time for the current location to facilitate the validation. | 02-25-2016 |
Patent application number | Description | Published |
20120203913 | METHOD AND SYSTEM FOR FEDERATION OF PROXY-BASED AND PROXY-FREE COMMUNICATIONS SYSTEMS - A method and system for federation of proxy-based and proxy-free communications systems is disclosed. In one embodiment, a computer-executable method comprises broadcasting a network address of a federation computer with an identification of the federation computer as a server for domains operating on a proxy-less protocol. The method includes establishing communications with a server on the network according to a proxy-less communications protocol to receive data bound for a destination domain that operates according to a proxy-based communications protocol and to receive data bound for a destination domain that operates according to a proxy-less communications protocol. Further, the method calls for establishing communications with a proxy on the network according to a proxy-based protocol to receive data bound for a destination domain. | 08-09-2012 |
20140040404 | SYSTEM AND METHOD FOR FEDERATING CHAT ROOMS ACROSS DISPARATE UNIFIED COMMUNICATIONS SYSTEMS - A system and method for federating chat rooms across disparate unified communications systems is disclosed. According to one embodiment, a system includes a federation server that is configured to connect to a first unified communications system and a second unified communications system. The federation server has a moderator that includes an address. The federation server has a translation engine that intercepts a first formatted message from the first unified communications system. The translation engine generates a second formatted message from the first formatted message, where the second formatted message includes a request from the moderator to a chat room with the second unified communications system to provide an invitation to the first unified communications system. The federation server routes the second formatted message to the second unified communications system. | 02-06-2014 |
20140359027 | AUTOMATION PLATFORM FOR HUB-BASED SYSTEM FEDERATING DISPARATE UNIFIED COMMUNICATIONS SYSTEMS - An automation platform for a hub-based system federating disparate unified communications systems is herein disclosed. According to one embodiment, the method includes connecting a first unified communications system supporting a first domain and an automation platform to a federation server, where the automation platform includes a plurality of automated applications that includes comprising a social media automated application, an instant messaging automated application and a directory search automated application. The method further includes routing a message from the first unified communications system to an automated application of the plurality of automated applications, processing the message by the automated application, and issuing a command based on the processed message. | 12-04-2014 |
20140359457 | USER PORTAL TO A HUB-BASED SYSTEM FEDERATING DISPARATE UNIFIED COMMUNICATIONS SYSTEMS - An apparatus for managing connections of a hub-based federation system. The apparatus includes a user interface for receiving input from a user and a logic component for generating a checklist of action items based on the user input. The apparatus also includes a task manager for managing the checklist as a task and a hub interface for communicating with a hub capable of federating a plurality of unified communications systems. | 12-04-2014 |
20150039702 | SYSTEM AND METHOD FOR MONITORING A HUB-BASED SYSTEM FEDERATING DISPARATE UNIFIED COMMUNICATIONS SYSTEMS - An apparatus for monitoring a hub-based federation system. The apparatus includes a message generator, a first connector, a second connector, and a status manager. The message generator is configured to generate a first message based on a first communications protocol. The first connector is configured to send the first message to a hub via the first communications protocol. The hub federates a plurality of unified communications systems. The second connector is configured to receive a second message from the hub via a second communications protocol. The status manager is configured to analyze the second message to determine status information regarding the hub-based federation system. | 02-05-2015 |
20150236905 | SYSTEM AND METHOD OF PROCESSING MEDIA TRAFFIC FOR A HUB-BASED SYSTEM FEDERATING DISPARATE UNIFIED COMMUNICATIONS SYSTEMS - A system and method of processing media traffic for a hub-based system federating disparate unified communications systems is disclosed. According to one embodiment, a system includes a federation server that is configured to connect to a first unified communications system and a second unified communications system, where the federation server receives a media call initiation request from a first client of the first unified communications system, where the media call initiation request initiates a media call with a second client of the second unified communications system, and where the federation server provides a uniform resource locator to the second client based on the media initiation request, wherein the uniform resource locator is configured to direct a user on the second client to a browser to accept the media call. | 08-20-2015 |