Abstract: Embodiments of apparatuses and methods for scaling up cluster nodes are described. In some embodiments, an apparatus may include a detector to detect hardware information of a node to be added to a domain of a computing cluster and a domain application configurator to generate a delta domain template for the node from a common domain template of the computing cluster and information of the domain. In some embodiments, the delta domain template may include information to provision applications required by the domain to the node. Other embodiments may be described and/or claimed.

Abstract: A method includes receiving at a receiver a voice signal in the form of a sequence of data packets, and using an automatic level control (ALC) component of the receiver to detect that one of the received packets is a silence packet or a noise packet. The method further includes receiving at a jitter delay control circuit from the ALC component a signal or signals to indicate that the one of the received packets is a silence or a noise packet, and dropping the one of the received packets in response to the signal or signals received from the ALC component. The ALC component includes a gain adjustment block and a level estimation and active voice detector block. The gain adjustment block is controlled by the level estimation and active voice detector block to adjust a gain applied by the gain adjustment block to an audio signal.

Abstract: A system and associated processes to provide interactive public branch exchange (PBX) processes. The PBX processes including: session initiation protocol (SIP) processes, application processes, and an interface with signaling process. The media processes cause the machine to: perform an audio/video play process, perform a record process, and perform a mixing process.

Abstract: Machine-readable media, methods, apparatus and system for synchronizing between a decentralized computing system and a centralized computing system. In some embodiments, a decentralized record may be received from a computing platform, wherein the decentralized record may be created when the computing platform communicates in a decentralized pattern. Information may be detected from the decentralized record to provide detected information, wherein the detected information may reveal a decentralization characteristic of the decentralized record. Then, the decentralized record may be converted into a centralized record while hiding the detected information from the centralized record and the centralized record may be sent to a server.

Abstract: Apparatus and systems, as well as methods and articles, may operate to generate a system coverage map from a plurality of geosystemic data points, as well as to change wireless system operational parameters responsive to various parameters associated with the plurality of geosystemic data points.

Abstract: A method and apparatus to manage delay in a multimedia conference session is described.

Abstract: A method and apparatus to manage tone clamping are described wherein atone is clamped using a buffer with a first size and the performance of the clamping is analyzed. The buffer is set to a second size in accordance with the analysis. The clamping comprises receiving audio information, storing the audio information in the buffer, detecting tone information in the audio information, and removing the tone information from the audio information. Other embodiments are described and claimed.

Abstract: In some embodiments, a method includes detecting a tone in each data frame of a sequence of telephony signal data frames. A first data frame of the sequence of telephony signal data frames may be transmitted immediately after detecting the tone therein. Transmission of a last one or last ones of the sequence of telephony signal data frames may be deferred. It may then be determined whether the tone is present in a next data frame that immediately follows the sequence of telephony signal data frames. If it is determined that the tone is not present in the next data frame, the last one or ones of the sequence of data frames and the next data frame may be transmitted. If it is determined that the tone is present in the next data frame, a respective replacement data frame may be transmitted in place of each one of the last one or last ones of the sequence of data frames and in place of the next data frame.

Abstract: A dynamic data queuing mechanism for network packets is disclosed. A three-dimensional coil may be expanded or contracted in length. In addition, the size of each loop of the three-dimensional coil may be adjusted. Moreover, simple circular queue and dynamic buffer management techniques are combined to implement circular queues that may be adjusted in size. Size adjustment, in turn, causes an entire queue either to expand or contract. Circular queue size is changed dynamically, without any copying or moving of queue data. This advantage is attained with little overhead added to conventional circular queues, and is useful in reducing memory requirements for simple circular queues by adjusting queue size as needs change. This is particularly useful for multiple queues that share the same memory space.

Abstract: A method and apparatus to manage tone clamping are described.

Abstract: A method and apparatus to store a media file are described.

Abstract: A method and apparatus to manage delay in a multimedia conference session is described.

Abstract: A method and apparatus to manage a remote resource over a network is described.

Abstract: According to some embodiments, a conference call is facilitated by dynamically determining information streams to be received by a mixing unit.

Abstract: A dynamic data queuing mechanism for network packets is disclosed. A three-dimensional coil may be expanded or contracted in length. In addition, the size of each loop of the three-dimensional coil may be adjusted. Moreover, simple circular queue and dynamic buffer management techniques are combined to implement circular queues that may be adjusted in size. Size adjustment, in turn, causes an entire queue either to expand or contract. Circular queue size is changed dynamically, without any copying or moving of queue data. This advantage is attained with little overhead added to conventional circular queues, and is useful in reducing memory requirements for simple circular queues by adjusting queue size as needs change. This is particularly useful for multiple queues that share the same memory space.

Abstract: The present invention is in the field of delivery and storage of real-time data in communications networks. More particularly, the present invention provides a method, apparatus, system, and machine-readable medium to store an encoded audio or video stream.