Reject EPS-FB and RAT-FB Call at Mobile Terminal

Techniques are disclosed that allow a user or upper-layer application running on a user equipment operating on a 5G network to ignore or reject an incoming call. This allows a user to avoid the degraded performance resulting from the fallback procedure that would otherwise terminate the 5G data connection in favor of a lower-capability network to complete the incoming call. Based on a command transmitted with the incoming call, the technique allows a user equipment to initiate a radio resource control (RRC) re-establishment procedure to recover 5G service. Alternatively, in the event the user equipment is connected to a network that only supports fallback call procedures, the technique allows a user or upper-layer application to reject the call by issuing a session initiation protocol (SIP) BYE message

Detecting the direction of ambient light using an array of photodiodes

So as to gain context, mobile devices, e.g., phones, tablets, laptops, etc., capture information about their surroundings, including sounds, lights, temperature, etc. An important piece of information is the direction of nearby light sources. Currently available ambient light sensors provide illuminance information so that the display can adjust its brightness accordingly. However, there is no directional information provided. This disclosure describes techniques that use a planar array of ambient light sensors with asymmetric masks to determine the angle of incident light

An Improved Tax Scheme for Selfish Routing

We study the problem of routing traffic for independent selfish users in a congested network to minimize the total latency. The inefficiency of selfish routing motivates regulating the flow of the system to lower the total latency of the Nash Equilibrium by economic incentives or penalties. When applying tax to the routes, we follow the definition of [Christodoulou et al, Algorithmica, 2014] to define ePoA as the Nash total cost including tax in the taxed network over the optimal cost in the original network. We propose a simple tax scheme consisting of step functions imposed on the links. The tax scheme can be applied to routing games with parallel links, affine cost functions and single-commodity networks to lower the ePoA to at most 4/3 - epsilon, where epsilon only depends on the discrepancy between the links. We show that there exists a tax scheme in the two link case with an ePoA upperbound less than 1.192 which is almost tight. Moreover, we design another tax scheme that lowers ePoA down to 1.281 for routing games with groups of links such that links in the same group are similar to each other and groups are sufficiently different