A Technique for Improving Telecommunications Planning Based on Indices of Growth
Thomas Kokumo Yesufu,
Anthony Olutope Fakeye
Issue:
Volume 3, Issue 2, March 2015
Pages:
35-41
Received:
10 July 2015
Accepted:
18 July 2015
Published:
25 July 2015
Abstract: Subscribers’ indices of growth are essential for planning and ensuring the rapid pursuit of best practices by telecommunication systems in Nigeria. Based on network principles and the established process of telecommunications planning, a questionnaire was developed and administered to 300 stakeholders that were randomly selected from existing subscriber communities across Nigeria. Subsequently, a Java software application for the analysis and planning of telecommunication systems was developed using Netbeans Integrated Design Environment (IDE) for its Rapid Application Development (RAD). It was found that Nigerian telecommunication planning fell below expectations despite the high teledensity in Nigeria, and had 60% of the necessary user participation, 49% degree of communication, and 63% of demand-driven services. Subsequently, a mobile application software system was developed such that the participation of subscribers in the planning process was enlisted via a short message service (SMS) that uses a typical SMS delivery system for sorting out spurious messages. By continuously linking the planning of telecommunications to subscribers’ indices of growth, the software would improve reliability, effectively shorten the feedback loop for timely and accurate decision-making, reveal the magnitude of acceptance of telecommunication services, and thereby bring about seamless network integration, technologically and on the applications and service levels.
Abstract: Subscribers’ indices of growth are essential for planning and ensuring the rapid pursuit of best practices by telecommunication systems in Nigeria. Based on network principles and the established process of telecommunications planning, a questionnaire was developed and administered to 300 stakeholders that were randomly selected from existing subsc...
Show More
The Proof of Quantum Search Algorithm Optimization and the Simulation of the Algorithm Implementation
Hong-Tao Zhang,
Yong-Tao Dai,
Ling-Ying Tu,
Jun Shu,
Hong-Mei Xiong,
Yi-Fan Hu
Issue:
Volume 3, Issue 2, March 2015
Pages:
42-48
Received:
10 July 2015
Accepted:
18 July 2015
Published:
28 July 2015
Abstract: This paper illustrated the optimality of Grover quantum search algorithm, and simulated the number of iterations and the specific implementation steps of quantum search algorithm with QCL in Linux operating systems, then validated the time complexity of Grover's quantum searching algorithm is O(√(N)) while the algorithm's time complexity on classical computers is O(N). The Grover quantum search algorithm were shown to improve the performance significantly in the random database search problem. This conclusion was drawn from the simulation in the Linux operating systems adopted to quantum computation language. The present study highlighted the importance of high efficiency of the Grover quantum search algorithm to achieve the best possible performance in such cases. The existence of such efficiency is an outstanding advantage of quantum search algorithm over the conventional approach.
Abstract: This paper illustrated the optimality of Grover quantum search algorithm, and simulated the number of iterations and the specific implementation steps of quantum search algorithm with QCL in Linux operating systems, then validated the time complexity of Grover's quantum searching algorithm is O(√(N)) while the algorithm's time complexity on classic...
Show More
