Version-3 (Sep-Oct 2018)
- Citation
- Abstract
- Reference
- Full PDF
Abstract: This review work was carried out in order to evaluate the general performance of cable modems in providing Broadband Internet through cable TV network. Also in this paper, the challenges facing the home Internet users as a result of the sharp rise in the number of Internet users were highlighted. On the other hand, the various parts of the cable TV were explored, and the investigations on the performance of the cable modems when upgraded to higher DOCSIS level were carried out using speed test Internet tools. Furthermore the results of the tests carried out through COMCAST Cable TV using DOCSIS 2.0 and DOCSIS 3.0 cable modem were documented and necessary inferences drawn out. In addition, the recommendation, based on the review and result of the speed test were provided.
Keywords–Broadband, Cable Modem, DOCSIS, satellite dish, Fibre cable, submarine cables.
[1]. Abhaya S.(1997).Computer Networks and Protocols. Workshop on Telecommunication, Science and Technology, Trieste, Italy, (1997)
[2]. Aranuwa, F.O (2013). Cable TV Networks as a Means of Providing Low Cost Internet Access to Nigerian Homes. Seminar Paper of the Department of Computer Science, Adekunle Ajasin, University, Akungba, Ondo State, Nigeria (2013)
[3]. Ariyo A.O & Olaojoyetan M.C. The Poor State of Broadband in Nigeria is an Impediment to National Development and Globalisation. Academic Journal of Interdisciplinary Studies, November 2013 Ed., MCSER Publishing, Rome-Italy.
[4]. Cable Network Connection. National Cable and Telecommunication Association Magazine, 2010, http//www.nata.com/organization. (2010)
[5]. Cisco Visual Networking Index. Forecast and Methodology 2014–2019, https://www.cisco.com (2015)...
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | A Parameter free Clustering of Density Based Algortihm |
Country | : | India |
Authors | : | Mr. Aakash Kulmitra || Mr. Ram Nivas Giri |
: | 10.9790/0661-2005030916 |
Abstract: Clustering is a kind of unsupervised learning process in data mining and pattern recognition, most of the clustering algorithms are sensitive to their input parameters. So it is necessary to evaluate results of the clustering algorithms. It is difficult to define which clustering designs are acceptable hence several clustering validation measures are developed. In the present paper we have a study of implementation on some of very common data sets with internal index compared to our new and improved parameter free Density Based Clustering with the help of differential evolution................
Keywords–DBSCAN , validation measures,sensitive input parameters,differential evolution
[1]. J. Kutarnia and P. Pedersen, "A Markov random field approach to group-wise registration / mosaicing with application to ultrasound," Med. Image Anal., vol. 24, no. 1, pp. 106–124, 2015.
[2]. D. Huang, J. Lai, and C. Wang, "Ensemble clustering using factor graph," Pattern Recognit., vol. 50, pp. 131–142, 2016.
[3]. A. Hinneburg and D. Keim, "An Efficient Approach to Clustering in Large Multimedia Databases with Noise," Proc. 4th Int. Conf. Knowl. Discov. Data Min. (KDD 98), no. October 2001, pp. 58–65, 1998.
[4]. G. Hamerly, "Making k -means even faster," Proc. 2010 SIAM Int. Conf. data Min. (SDM 2010), pp. 130–140, 2010.
[5]. X. Tang and P. Zhu, "Hierarchical Clustering Problems and Analysis of Fuzzy Proximity Relation on Granular Space," IEEE Trans. Fuzzy Syst., vol. 21, no. 5, pp. 814–824, 2013...
- Citation
- Abstract
- Reference
- Full PDF
Abstract: Vaccination is the way of prevention from various infectious diseases. It stimulates the immune system against a pathogen. In many developed countries, the process of Vaccination system is not technology based. In Bangladesh, patients use manual Vaccination system still now which is not secure. The existing systems are the paper-based system. Today peoples are going to be digitalized on their particular life in Bangladesh. So every parent's wants secured and flexible child vaccines system than the existing manual system. In fact, many parents don't register their childbirth just because the process of registering is tiresome. In this paper, we have implemented the web-based as well as android based vaccines system so that the parents get facilities to monitor vaccination activity by............
Keywords–Child Vaccination, Digitalized system, Manual system, SMS, Security
[1]. Salameh, Anas A. Mohammad, et al. "Web-based support for pregnant mother." International Journal on Advanced Science, Engineering and Information Technology 1.3 (2011): 307-310.M. Young, The Technical Writer's Handbook. Mill Valley, CA: University Science, 1989.
[2]. Zhang, Tong, et al. "Fall detection by embedding an accelerometer in cellphone and using KFD algorithm." International Journal of Computer Science and Network Security 6.10 (2006): 277-284.
[3]. Salameh, Osama. "A Mobile Phone SMS-Based System for Diabetes Self-Management." Int. Arab J. e-Technol. 2.3 (2012): 161-166.
[4]. Gatuha, George, and Tao Jiang. "KenVACS: Improving vaccination of children through cellular network technology in developing countries." Interdisciplinary Journal of Information, Knowledge, and Management 10 (2015): 037-046.
[5]. http://www.searo.who.int/bangladesh/areas/immunizationvaccine/en/.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Use of MPSO To Break Transposition Cipher System |
Country | : | Iraq |
Authors | : | Mohamed H. Ahmed || Dr.Salim A.Abbas || Ahmed Kareem Shibeeb |
: | 10.9790/0661-2005032532 |
Abstract: Particle swarm optimization (PSO) based cryptanalysis has acquired much attention because it has fast convergence rate. We investigate the use of Modify Particle Swarm Optimization (MPSO) with some modification in fitness function to break the transposition cipher.MPSO based on using multiple swarm rather than single swarm and exchange information between these swarms to determine the best key. Experimental results of the proposed MPSO appear that the MPSO algorithm reduce the number of tries which are needed to determine the secrete key of the attacked transposition cipher using ciphertext only attack Compared with PSO algorithm. Different parameters are taken for the case study: population size are [20-30] , key size [5-10] and ciphertext [500-10000]..
Keywords–ciphertext, cryptanalysis, Transposition Cipher, Particle Swarm Optimization Algorithm
[1]. Chris Bourke, "Cryptography and Computer Security".University of Nebraska, Lincoln, NE 68588, USA, CSCE 477-877,2015.
[2]. E.C. Laskari, G.C. Meletiou,Y.C. Stamatiou and M.N. Vrahatis,"Cryptography and Cryptanalysis Through Computational Intelligence".Springer-Verlag Berlin Heidelberg ,2007.
[3]. William Stallings," Cryptography and Network Security ". 5th Edition,2010.
[4]. Bethany Delman,"Genetic algorithms in cryptography". Master thesis,Rochester Institute of Technology,2004.
[5]. A.Menezes, P. Van Oorchot and S.Vanstone," Handbook of applied cryptography". Boca Raton, CRC Press,1997.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | SVD Adaptive Algorithm for Linear Least Square Regression and Anomaly Reduction |
Country | : | United States |
Authors | : | Chaman Lal Sabharwal |
: | 10.9790/0661-2005033348 |
Abstract: In data analysis, the accuracy of analysis depends on (1) the data representation, (2) the algorithm and (3) the metric used to measure error. For ordinary linear least square approximation (OLA), the existing formulation measures error along y or vertical direction. Conventionally, ordinary linear least square approximation (OLA) technique has been considered as the best fit regression line for linear trend data. Based on domain knowledge, several versions of OLA have been developed. They are all reformulations of OLA using prior domain knowledge, for supervised learning. Singular Value Decomposition (SVD) is also used least square approximation. The robustness of SVD approximation is attributed to (1) the SVD line is sensitive to temporal variation in time variables whereas OLA is not, it makes OLA less suitable for time sensitive data, and (2) SVD has smaller approximation error..........
Keywords–least square regression, singular value decomposition, precision, propensity, noise
[1]. Steven C Chapra and Raymond P Canale, Numerical Methods for Engineers, 7th Edition, ISBN: 978 0073397924 , McGraw-Hill Publishers, 2015.
[2]. Cohen, J., Cohen P., West, S.G., & Aiken, L.S. (2003). Applied multiple regression/correlation analysis for the behavioral sciences. (2nd ed.) Hillsdale, NJ: Lawrence Erlbaum Associates.
[3]. Draper, N.R.; Smith, H. (1998). Applied Regression Analysis (3rd ed.). John Wiley. ISBN 0-471-17082-8.
[4]. Gwowen Shieh, Clarifying the role of mean centering in multicollinearity of interaction effects,British Journal of Mathematical and Statistical Psychology (2011), 64, 462–477.
[5]. Jim Hefferon, Linear Algebra, Free Book, http://joshua.smcvt.edu/linearalgebra, 2014...
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Techniques for Cache Improvement |
Country | : | Saudi Arabia |
Authors | : | Dr. Mohammad Mahmood Otoom || Dr. Khalid Nazim Abdul Sattar |
: | 10.9790/0661-2005034953 |
Abstract: Personal data caches have been rendered ineffective in the process of reducing the median memory lag in multiprocessors, as is the case in single-processors, due to the distribution of data amongst processors, and further related to a cache issue. Therefore, a multitude of processors have been implemented with the purpose of sustaining cache improvement in the presence of large-scale shared data processes; thus it is difficult to perform a comparison of implementation implications and performance. This paper is penned with the purpose of aiding future computer architects comprehend the opportunity costs involved as well as contemporary cache improvement processes, and other design-related problems. Current design problems include: 1) the improvement strategy..........
[1]. S. Murugesan, "Harnessing green IT: Principles and practices," IT professional, vol. 10, no. 1, pp. 24–33, 2008.
[2]. S. Borkar, "Design challenges of technology scaling," Micro, IEEE, vol. 19, no. 4, pp. 23 –29, jul. 1999.
[3]. G. Gammie, A. Wang, H. Mair, R. Lagerquist, M. Chau, P. Royannez, S. Gururajarao, and U. Ko, "Smartreflex power and performance management technologies for 90 nm, 65 nm, and 45 nm mobile application processors," Proceedings of the IEEE, vol. 98, no. 2, pp. 144–159, 2010.
[4]. "International technology roadmap for semiconductors (ITRS)," http:// www.itrs.net/Links/2011ITRS/2011Chapters/2011ExecSum.pdf, 2011.
[5]. S. Borkar, "Thousand core chips: a technology perspective," in 44th annual Design Automation Conference. ACM, 2007, pp. 746–749..
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Establishing Point to Point Connections Among IoT Devices Over the Internet |
Country | : | India |
Authors | : | Dr. Sefer Kurnaz || Abdullah Abed |
: | 10.9790/0661-2005035463 |
Abstract: The rapid growth in the number of devices connected to the internet, other than computers, has proposed the Internet of Things (IoT) era. These devices make use of the high availability of internet connection to interchange data that enables them of achieving their tasks. However, as these devices usually belong to private networks, with private Internet Protocol (IP) addresses, it is not possible to reach these devices from outside their networks. To overcome this limitation, relay servers are used with public IP address to act like a midpoint in the communications among the IoT devices. This approach increases the path that the data travels through, from one IoT device to another, which increase s the time required to reach the destination device and the power consumption at these devices........
Keywords–Cloud Computing, Efficiency, Internet Services,Internet of Things.
[1]. R. Want, B. N. Schilit, and S. Jenson, "Enabling the internet of things," Computer, vol. 48, pp. 28-35, 2015.
[2]. H. Zisimopoulos and H. Liang, "Network entity, a wireless communication unit and methods for access to a remote private IP network and supporting thereof," ed: Google Patents, 2018.
[3]. Y. Rekhter, B. Moskowitz, D. Karrenberg, G. J. de Groot, and E. Lear, "Address allocation for private internets," 2070-1721, 1996.
[4]. M. Holdrege and P. Srisuresh, "Protocol complications with the IP network address translator," 2070-1721, 2000.
[5]. M. Hassan and R. Jain, High performance TCP/IP networking: Prentice Hall, 2003...
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | A Parameter free Clustering of Density Based Algortihm |
Country | : | India |
Authors | : | Mr. Akash Kulmitra || Mr. Ram Nivas Giri |
: | 10.9790/0661-2005036471 |
Abstract: Clustering is a kind of unsupervised learning process in data mining and pattern recognition, most of the clustering algorithms are sensitive to their input parameters. So it is necessary to evaluate results of the clustering algorithms. It is difficult to define which clustering designs are acceptable hence several clustering validation measures are developed. In the present paper we have a study of implementation on some of very common data sets with internal index compared to our new and improved parameter free Density Based Clustering with the help of differential evolution. Density based clustering methods are being used for clustering spatial databases with noise. Density Clustering of Spatial Data and its Application with noise (DBSCAN) can discover clusters of arbitrary shapes and sizes effectively with the help of Eps(radius of the cluster) and MinPts (minimum number of points.........
Keywords– DBSCAN , validation measures,sensitive input parameters,differential evolution
[1]. J. Kutarnia and P. Pedersen, "A Markov random field approach to group-wise registration / mosaicing with application to ultrasound," Med. Image Anal., vol. 24, no. 1, pp. 106–124, 2015.
[2]. D. Huang, J. Lai, and C. Wang, "Ensemble clustering using factor graph," Pattern Recognit., vol. 50, pp. 131–142, 2016.
[3]. A. Hinneburg and D. Keim, "An Efficient Approach to Clustering in Large Multimedia Databases with Noise," Proc. 4th Int. Conf. Knowl. Discov. Data Min. (KDD 98), no. October 2001, pp. 58–65, 1998.
[4]. G. Hamerly, "Making k -means even faster," Proc. 2010 SIAM Int. Conf. data Min. (SDM 2010), pp. 130–140, 2010.
[5]. X. Tang and P. Zhu, "Hierarchical Clustering Problems and Analysis of Fuzzy Proximity Relation on Granular Space," IEEE Trans. Fuzzy Syst., vol. 21, no. 5, pp. 814–824, 2013...
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Survey of Crop Prediction Using Different Classification Analytical Model |
Country | : | United States |
Authors | : | M.Saranya || Dr. S.Sathappan |
: | 10.9790/0661-2005037280 |
Abstract: In this paper, there are different ways has been analyzed to predict the crop yield. Now a day, there's tremendous growth in paper publication and analysis in numerous streams for getting efficient result. The crop yield productions are going to be continuously become terribly crucial in our standard of living. To pursue the quickest and extremely economical thanks to enhance the crop yield the near-term arrange is application and optimizing the present agriculture technologies. This may result in important improvement in agriculture that is suboptimal resolution. The most goal of this analysis is employed to summarize the historical trend of crop production in nominal region to look at the foremost constraint to extend the productivity in future. Except for this paper, to performing comparative study with techniques of LR, KNN, NBC, J.48, MLP, RF, SVM, DT and Artificial Neural Network (ANN) that statistics.......
Keywords–Machine Learning, Crop Prediction, Classification Model, Feature Selection Model, NN Model
[1]. Ester M, Kriegel HP, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Paper presented at International conference on knowledge discovery and data mining. 1996
[2]. Ramesh D, Vishnu Vardhan B. Data mining techniques and applications to agricultural yield data. In: International journal of advanced research in computer and communication engineering. 2013; 2(9).
[3]. D Ramesh and B Vishnu Vardhan(2015) "Analysis Of Crop Yield Prediction Using Data Mining Techniques". IEEE.
[4]. Thailand K. Saithanu1 and J. Mekparyup(2015), "Development Of Neural Network Models For Forecasting Rice Yield In The Northern". Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 11, Number 4 (2015), pp. 2191-2194 © Research India Publications http://www.ripublication.com
[5]. B. JI, Y. Sun, S.Yang And J. Wan (2007), "Artificial neural networks for rice yield prediction in mountainous regions". Fujian Agriculture and Forestry University, Fuzhou 350002, China (Revised MS received 22 October 2006; First published online 16 January 2007).