Urban Traffic Network (UTN) can be represented as a directed graph say, G={V, E}, where V={v1,v2,v3⋯.,v m}, is a finite set of vertices and E={e1,e 2.e3,⋯,en}, is a finite set of edges. The vertices of UTN are the road junctions or terminals and the edges are road segments. The Mobile Phone Network (MPN) around the UTN can also be represented as a graph say G/={T, E} with vertices T={t1,t2, t3⋯.,tl} and edges E={e1,e2.e3, ⋯en}. The vertices t1,t2, t 3⋯.,tl are the points on the road segments nearest to Base Transceiver Station (BTS) Cell centre and the edges e1,e 2.e3,⋯en are the finite set of edges, same as the edges of UTN. In this paper, a method has been discussed to map a MPN onto a UTN. The mapping can be used for urban traffic management, such as counting the number of traffic users around a road junction. We have also stated and proved that "Any MPN graph can be constructed as an UTN graph". Further, we have used the application of the mapping in counting traffic users to find the traffic congestion levels.
Source

In the recent days, the exponential growth in functionality of mobile devices leads the manufacturers to develop more and more sophisticated microprocessors and microcontrollers. The power requirements of the microprocessors are increasing day by day along with the processing speed and chip area. So, rather than traditional number systems, Residue Number System (RNS) is becoming attractive for their capabilities for performing addition and multiplication operation efficiently. In this paper, based on the formulation of the Chinese remainder theorem and RNS, a guideline for a Reconfigurable DSP Processor is proposed that can process some predefined functions. As RNS minimizes the carry propagation, the scheme can be implemented in Mobile and Wireless Computing and other fields where high speed computations are required with limited resources.
Source