Abstract: An acoustic layer is added to a keyboard-type device including: enclosing walls, optionally—one or more microphones, a signal processing device, at least one audio transducer, and an acoustic waveguide. The acoustic layer adjoins one or more internal areas of a keyboard-type device. The signal processing device receives an internal signal from an electronic device either through wires or wirelessly. The signal processing device provides a directive sound enhancement of the audio input signals based on room acoustics, such as reverberation, echo, noise, delay, frequency response, and/or speaker-positional information that is determined by the signal processing device. The audio transducer device generates an audible audio output in response to an audio signal output from the signal processing device. The acoustic waveguide receives the audible audio output and generates an enhanced bass audio output from the acoustic waveguide.

Abstract: A system includes a processor configured to transfer a newly generated encryption key for a newly paired device to the device and utilize the encryption key to create and encrypt a new virtual storage space corresponding to the device and accessible using the encryption key on a memory connected to the processor.

Abstract: Techniques to dynamically engage echo cancellation are described. In one embodiment, an apparatus may comprise a streaming component operative to establish a audio connection between the first client device and a second client device via the network interface controller; and receive a far-end audio stream at the first client device from the second client device via the audio connection; an audio capture component operative to capture a near-end audio stream at the first client device; and an echo processing component operative to compare the near-end audio stream and the far-end audio stream to determine whether a far-end echo is present in the near-end audio stream; and use an echo-cancellation module at the first client device where the far-end echo is present in the near-end audio stream. Other embodiments are described and claimed.

Abstract: A vehicle safe authentication system may include a vehicle safe, a vehicle camera, and a control unit programmed to receive an indication of unauthorized access at the vehicle safe and further programmed to activate the vehicle camera in response to the indication, wherein activation of the camera may include capturing at least one image.

Abstract: A system includes a processor configured to transfer a newly generated encryption key for a newly paired device to the device and utilize the encryption key to create and encrypt a new virtual storage space corresponding to the device and accessible using the encryption key on a memory connected to the processor.

Abstract: An infotainment system in a vehicle includes at least one processor configured to, in response to occurrence of a trigger condition defined by an invitation from a source remote from the vehicle and identifying media content and to acceptance of the invitation, select a medium carrying the media content to play the media content. The trigger condition may be a current location of the vehicle matching a specified location, a weather condition at a current location of the vehicle matching a specified weather condition, a current speed of the vehicle exceeding a specified speed, a current date matching a specified date, or a current time of day matching a specified time of day. Alternatively, the trigger condition may be a signal indicating presence of a passenger or presence of a connection with a mobile device.

Abstract: A bumper assembly includes a bumper upper member that is reinforced in a vehicle vertical direction against a bumper energy absorber structure. The bumper upper member includes a vertical rigidity flange that extends outwardly toward the bumper energy absorber that limits movement of the bumper upper member in response to a downward vertical force, which can improve static subjective rigidity, while maintaining pedestrian performance.

Abstract: Techniques to dynamically configure jitter buffer sizing are described. In one embodiment, an apparatus may comprise a streaming component operative to perform a streaming network connection for a media stream; a media playback component operative to playback the media stream; and a media buffer component operative to maintain a jitter buffer for a streaming network connection on a client device; generate a media frame distribution based on at least one of media frame retrieval from the jitter buffer by the media playback component and media frame addition to the jitter buffer by the streaming component; determine a jitter buffer target size based on the media frame distribution; and apply the jitter buffer target size to the maintaining of the jitter buffer for the streaming network connection. Other embodiments are described and claimed.

Abstract: Techniques to dynamically configure target bitrate for streaming network connections are described.

Abstract: Aspects of the present disclosure are presented for allowing a customer to request a service and to very quickly be put in touch with a local service provider who can perform the requested service. The customer need not know the identity of the vendor beforehand, and the vendor may not know the identity of the customer before agreeing to discuss the service, in some embodiments. Multiple local service providers may be contacted in parallel by a centralized server configured to connect the customer with the local service providers. In some embodiments, the most qualified or most highly rated local service providers for the particular service may be identified and then contacted first. In some embodiments, the customer may be put in touch with one or more vendors in a very short amount of time after submitting the request, e.g., within 90 seconds.

Abstract: Methods and apparatuses provide for listing codecs for offers and for providing an effective listing of codecs for answers. For example, a method relating to offers is provided which includes receiving an incoming offer that lists a plurality of codecs, determining for each of the plurality of codecs whether one or more related codecs are not listed in the incoming offer, generating an outgoing offer that lists the plurality of codecs and the one or more related codecs that were determined not to be listed in the incoming offer, and transmitting the outgoing offer.

Abstract: A method for specialized processing of data in a port-extended network comprises receiving, by the control node of the port-extended network, a data frame that includes, at a first field of the data frame, information indicative of an incoming port at which the data frame was received, the first field having been inserted by a satellite node associated with the port. The method also comprises determining that one or more packets of a frame require specialized processing, and replacing the information contained in the first field with information indicative of the specialized processing. The method further comprises replacing information contained in a second field with information indicative of an outgoing port of a second satellite node of the port-extended network. A modified data frame is transmitted onto the port-extended network, the modified data frame that includes the information indicative of the specialized processing in the first field.

Abstract: A bumper assembly includes a bumper upper member that is reinforced in a vehicle vertical direction against a bumper energy absorber structure. The bumper upper member includes a vertical rigidity flange that extends outwardly toward the bumper energy absorber that limits movement of the bumper upper member in response to a downward vertical force, which can improve static subjective rigidity, while maintaining pedestrian performance.

Abstract: Aspects of the disclosure relate generally to reducing latency for consensus in geographically distributed disaster-safe persistent data-store systems. These distributed systems may include registry system having redundant storage for maintaining the system status. Each registry system may include a server and a storage component. Consensus may be achieved by querying all of other servers of the registry system. In one example, the consensus data may be sharded into independent small groups. This may allow for multiple consensus transactions to be generated and run in parallel, which, in turn may reduce the latency. In addition, or alternatively, requests to a server to write or otherwise change the data-store may be batched at the server side. Thus, for the consensus, the server need only communicate with the other servers only once per batch. This may also reduce the latency of the distributed system.

Abstract: A method is used for managing degraded storage elements in data storage systems. A storage element experiencing degradation is identified where the storage element is a member of a first RAID group of storage elements. A first slice of data associated with the storage element is identified. The first slice of data is copied to a second RAID group of storage elements.

Abstract: A method and corresponding apparatus are provided to detect false answer supervision by determining false answer supervision as either as a function of a number of completed calls of short duration or as a function of a distribution of differences between timestamps of alert signals and timestamps of connect signals used to complete calls, detecting false answer supervision based on the indicator of false answer supervision determined by either functions separately or in combination, and affecting a decision in response to the detecting.

Abstract: Systems and methods are disclosed herein for providing fault tolerant processing of events. The system includes multiple consensus computers configured to communicate with one another and multiple event processors configured to process data such as events. Each consensus computer is further configured to receive a request to process a unit of data from an event processor. A consensus computer communicates with at least one other consensus computer to reach consensus as to whether the unit of data has previously been assigned to an event processor for processing. Then, a consensus computer sends a message to the event processor that sent the inquiry including instructions to either process the unit of data or not process the unit of data. Because the consensus computers determine whether a unit of data has previously been assigned to an event processor, the system ensures that an event is not processed more than once.

Abstract: Aspects of the present invention concern a method and system for scheduling a request for execution on multiple processors. This scheduler divides processes from the request into a set of domains. Instructions in the same domain are capable of executing the instructions associated with the request in a serial manner on a processor without conflicts. A relative processor utilization for each domain in the set of the domains is based upon a workload corresponding to an execution of the request. If there are processors available then the present invention provisions a subset of available processors to fulfill an aggregate processor utilization. The aggregate processor utilization is created from a combination of the relative processor utilization associated with each domain in the set of domains. If processors are not needed then some processors may be shut down. Shutting down processors in accordance with the schedule saves energy without sacrificing performing.

Abstract: Aspects of the disclosure relate generally to a distributed event joining system for joining primary and secondary events based on a common key. In one example, a continuous stream of primary events may be submitted by a plurality of ad serving computers for storage at a cache layer. Each primary event may be associated with a primary event key. After a time T, the stream of primary events may be sent to long term memory. The system may also receive secondary events, each associated with a primary key. The primary key may be used to identify a primary event in the cache layer. If the primary event is not available in the cache layer, the long term memory may be searched for the primary key. Paired events may then be submitted to a distributed joined event storage system.