Global Journal of Computer Science and Technology (GJCST)
Not a member yet
1830 research outputs found
Sort by
An Optimized Input Sorting Algorithm
Get PDFOne of the fundamental issues in compute science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research, because efficient sorting is important to optimize the use of other algorithms. Sorting involves rearranging information into either ascending or descending order. This paper presents a new sorting algorithm called Input Sort. This new algorithm is analyzed, implemented, tested and compared and results were promising
Big Data using Cloud Technologies
Get PDFCloud technology is playing a vital role in presentera to store and process massive amount of data, which leads to the convergence of cloud and big data. Cloud computing holds a tremendous promise of unlimited, on demand, elastic, computing and data storage resources. It has the potential to enhance business agility and productivity while enabling greater efficiencies and reducing costs. Big data environments require clusters of servers to support the tools that process the large volumes, high velocity, and varied formats of big data. It offers the promise of providing valuable insights that can create competitive advantage and also to explode new innovations. In this paper, I discussed how cloud and big data technologies are converged to improve quantitative decision making with minimal risk and to offer cost-effective delivery model for cloud-based big data analytics
Dynamic Congestion Control in Network Layer for Advanced Cloud Computing
Get PDFCloud computing becoming attractive tool for delivering web-based services. It can enable rapid development and dynamic scaling and it offers flexible powerful but low cost distribution infrastructure. In paper we proposed new infrastructure capabilities to support dynamic networks. In the network layer Allocation of resource at specific locations and those sites are connects by backbone supporting provisional virtual links. Each location constructs one data center for processing of resource specified by function. Application controller updates the distribution information and multicast to access nodes for load balancing of flow of packets and regulating the traffic flow within application cluster to avoid congestion. The processing elements create the virtual output queues to adjust to prevent output congestion
Isotropic Dynamic Hierarchical Clustering
Get PDFWe face a business need of discovering a pattern in locations of a great number of points in a high-dimensional space. We assume that there should be a certain structure, so that in some locations the points are close while in other locations the points are more dispersed. Our goal is to group the close points together. The process of grouping close objects is known under the name of clustering. 1. We are particularly interested in a hierarchical structure. A plain structure may reduce the number of objects, but the data are still difficult to manage or present. 2. The classical technique suited for the task at hand is a B-Tree. The key properties of the B-Tree are that it is hierarchical and balanced, and it can be dynamically constructed from the input data. In these terms, B-Tree has certain advantages over other clustering algorithms, where the number of clusters needs to be defined a priori. The BTree approach allows to hope that the structure of input data will be well determine without any supervised learning. 3. The space is Euclidean and isotropic. This is the most challenging part of the project, because currently there are no B-Tree implementations processing indices in a symmetrical and isotropical way. Some known implementations are based on constructing compound asymmetrical indices from point coordinates, where the main index works as a key, while the function of other (999!) indices is lost; and the other known implementations split the nodes along the coordinate hyper-planes, sacrificing the isotropy of the original space. In the latter case the clusters become coordinate parallelepipeds, which is a rather artificial and unnecessary assumption. Our implementation of a B Tree for a high-dimensional space is based directly on concepts of factor analysis. 4. We need to process a great deal of data, something like tens of millions of points in a thousand-dimensional space. The application has to be scalable, even though, technically, out task is not co
An Energy Conscious Topology Augmentation Methodology for On-Chip Interconnection Networks
Get PDFOn-chip communication, modular, scalable packet-switched micro-network of interconnects, generally known as Network-on-Chip (NoC) architecture can be designed as regular or application-specific (irregular) network topologies. Application specific custom network topologies are advantageous in terms of optimized design according to given performance metrics and regular network topologies are advantageous in terms of its modularity, lower design time and efforts required and thus are suitable for mass production. So to offer the advantages of both the topologies this paper proposes a methodology to augment the regular topology according to the application characteristics. The experimental results demonstrate that the proposed methodology can reduce dynamic communication energy consumption by on average of 32.79% and reduction in average per flit latency by on average of 16.22% over regular 2D NoC architecture
State of the Art Survey on Session Hijacking
Get PDFWith the advent of online banking more and more users are willing to make purchases online and doing so flourishes the online E-Business sector ever so more. Attackers are ever so vigilant and active now on web than ever to leverage the insecure web application and database that is out there on the internet to exploit. Today2019;s internet as we see are heavily integrated with sophisticated network whether it2019;s wired or wireless network. But the inherent compliancy to not integrating security while developing application leave it vulnerable to many attacks. One of the attack that has been prevalent now-a-days is: session hijacking
Performance Analysis of Energy Efficient Grid based Wireless Body Area Network System
No full textWireless Body Area Network makes it possible to monitor patient2019;s health under critical situations by integrating bio-sensors with a mobile phone. With this WBAN has now become a emerging technology to improve patient2019;s quality of life by enabling health monitoring at home instead of at a hospital. WBAN reduces the workload of medical practitioners as well as healthcare costs which further results in higher efficiency. This paper presents the architecture of existing wireless health monitoring system (WBAN system). Due to limited battery capacity of sensor nodes there is need to have energy efficient design. This work explores the grid based data dissemination model for WBAN. The grid model divides the network area into cells. All the nodes will not participate in data transmission which conserves energy. Further we compare existing model with the grid model on the basis of energy consumed, throughput and delay
Security Threats to Wireless Networks and Modern Methods of Information Security
Get PDFNetwork is a technology used to connect computers and devices together. They allow people the ability to move easily and stay in touch while roaming the Internet in the coverage area. This increases efficiency by allowing data entry and access to the site. Comparing wireless networks wired networks in terms of cost, we find that wired networks are more expensive due to the cost of the network connections of electricity and running and add computers and change their positions to suit the network supply. As a result, the use of widespread wireless networks. But there are security gaps in these networks may cause problems for users Security holes intended problem or weakness in the wireless network system may make it easier for hackers to penetrate and steal sensitive data and causing material losses to individuals and companies
Supporting SMEs during the Risk Assessment Stage of Platform as a Service Cloud Selection: A Case Study of SMEs in the West Midlands, UK
Get PDFThe Cloud Computing (CC) paradigm has become popular among Small to Medium size Enterprises (SMEs) due to the promise of cost effective access to the latest applications via a Cloud Service Provider (CSP). There are many factors and pitfalls of Cloud Computing adoption as well as benefits to SMEs which have been highlighted through a research project that involved SMEs from the West Midlands UK. This paper outlines the challenges SMEs face when considering Platform as a Service (PaaS) adoption, and highlights that lack of understanding of the technology has either meant SMEs have not adopted Cloud Computing or have experienced difficulties with the adoption as important considerations where not evaluated. Through a comprehensive investigation a theoretical framework 2013; Cloud Step followed by an interactive tool 2013; PaaS Cloud Dial have been developed to aid SMEs in understanding what factors need to be considered prior adoption of PaaS. Both have been validated through work with SMEs and the findings obtained from the validation procedure indicated that both the framework and application are valuable and suitable in supporting SMEs risk assessment and decision making process regrading Cloud adoption
Image Retrieval based on Macro Regions
Get PDFVarious image retrieval methods are derived using local features, and among them the local binary pattern (LBP) approach is very famous. The basic disadvantage of these methods is they completely fail in representing features derived from large or macro structures or regions, which are very much essential to represent natural images. To address this multi block LBP are proposed in the literature. The other disadvantage of LBP and LTP based methods are they derive a coded image which ranges 0 to 255 and 0 to 3561 respectively. If one wants to integrate the structural texture features by deriving grey level co-occurrence matrix (GLCM), then GLCM ranges from 256 x 256 and 3562 x 3562 in case of LBP and LTP respectively. The present paper proposes a new scheme called multi region quantized LBP (MR-QLBP) to overcome the above disadvantages by quantizing the LBP codes on a multi-region, thus to derive more precisely and comprehensively the texture features to provide a better retrieval rate. The proposed method is experimented on Corel database and the experimental results indicate the efficiency of the proposed method over the other methods