Comparison of Statistical Calculations for Software Model Analysis

•

0 likes•95 views

Software engineering is the latest and most complicated discipline of engineering. Current software engineering is based on empirical practices, while theoretical research and investigation into foundations of software engineering have long been left behind. Theoretical software engineering studies the nature of software, mathematical models of software architecture, mechanism of software behaviors, methodologies of large scale software development and laws behind software behaviors and software engineering practices. The main part of software development is using a software models to find a systematic and disciplined way of the solutions for a given project. This paper focuses on fundamental theory of different lifecycle models with the cross comparison of statistical calculation for software model analysis with emphasis on the dependency of activities on phases. We used a mechanism for finding the dependency matrices between the different phases of different models. In this paper we devised a methodology for estimating the occurrence relationship between the activities with its correlation and regression. Finally we have given the comparison of statistical calculation for dependency values among different models.

Science

International Journal of Computing Algorithm, Vol 2(1), June 2013
ISSN(Print):2278-2397
Website: www.ijcoa.com
Comparison of Statistical Calculations for Software
Model Analysis
N.Sasikala1
, G.Rasitha Banu2
, K.Rangarajan3
1 2
Research Scholar, Mother Theresa Women’s University
3
Hod, MCA Department, Bharath University
Abstract
Cloud Computing is the utilization of pool of resources for remote users through internet that
can be easily accessible, scalable and utilization of resources. To attain maximum utilization
of resources the tasks need to be scheduled. The problem in scheduling is allocating the
correct resources to the arrived tasks. Dynamic scheduling is that the task arrival is uncertain
at run time and allocating resources are tedious as several tasks arrive at the same time. To
avoid this scheduling problem, Genetic Algorithm is used. Genetic algorithm is a heuristic
method that deals with the natural selection of solution from all possible solutions. Using
genetic algorithm the tasks are scheduled according to the computation and memory usage.
The tasks are scheduled dynamically. The execution time is reduced by parallel processing.
The scheduled data is stored in cloud. By using GA to obtain global optimization.

Viewers also liked

Beekman5 std ppt_06

Department of Education - Philippines

Education and trainning

Rojan_Tegre

Bilingual sentence-aligned parallel corpora, or bitexts, are a useful resource for solving many computational linguistics problems including part-of speech tagging, syntactic parsing, named entity recognition, word sense disambiguation, sentiment analysis, etc.; they are also a critical resource for some real-world applications such as statistical machine translation (SMT) and cross-language information retrieval. Unfortunately, building large bi-texts is hard, and thus most of the 6,500+ world languages remain resource-poor in bi-texts. However, many resource-poor languages are related to some resource-rich language, with whom they overlap in vocabulary and share cognates, which offers opportunities for using their bi-texts. We explore various options for bi-text reuse: (i) direct combination of bi-texts, (ii) combination of models trained on such bi-texts, and (iii) a sophisticated combination of (i) and (ii). We further explore the idea of generating bitexts for a resource-poor language by adapting a bi-text for a resource-rich language. We build a lattice of adaptation options for each word and phrase, and we then decode it using a language model for the resource-poor language. We compare word- and phrase-level adaptation, and we further make use of cross-language morphology. For the adaptation, we experiment with (a) a standard phrase-based SMT decoder, and (b) a specialized beam-search adaptation decoder. Finally, we observe that for closely-related languages, many of the differences are at the subword level. Thus, we explore the idea of reducing translation to character-level transliteration. We further demonstrate the potential of combining word- and character-level models.

Dr. Preslav Nakov — Combining, Adapting and Reusing Bi-texts between Related ...

Yandex

PCC’s ILAG Grant Project created a collaborative effort between PCC’s 3 campuses to design and develop a simulation based teaching opportunity in the Introduction to Business class. Our Big Idea was to introduce the commercial “CEO” simulation into the entry level business class. The CEO simulation is designed to give students the opportunity to make the decisions necessary to start and manage a business by embedding the simulation into their class.

Pueblo Community College's Business Simulation Project

cccscoetc

WHO SHOULD ATTEND?  Academicians working with research or commercial projects in Social Sciences, Engineering, and Medicine.  Research Scholars who are pursuing higher studies and professional degrees.  Industrial Executives who are handling with commercial data analysis. INTRODUCTION The workshop aimed to connect the theoretical knowledge of Business Statistics into practical applications, for academicians and executives of manufacturing and service sectors. It provides strong base in data analysis and interpretations to carry out projects independently. It sharpens the computing, analytical, and logical skills of participants as most of the real life and decision-making problems could be solved through the existing statistical software packages. WORKSHOP OBJECTIVES ● Provide inferential and predictive analytic services, which will enhance knowledge in Research and Development. ● Data analysis using statistical software for developing computing skills and interpretation on interdisciplinary areas.

STATISTICAL APPLICATION TRAINING PROGRAM

USAINS Holding Sdn. Bhd. (wholly-owned by Universiti Sains Malaysia)

WHO SHOULD ATTEND? This course is designed for anyone looking to improve team dynamics through applying Emotional Intelligence. EQ is a recognised strategic tool for enhanced performance, productivity, communication, and influencing people. Individuals who have little understanding of emotional intelligence competencies, who would like to understand how to make a greater contribution in key areas of their business and personal lives. OBJECTIVES At the end of this course, participants will be able to: i. Define EQ. ii. Measure their level of EQ based on established EQ Test. iii. Determine why EQ is critical for organization and personal success. iv. Explain how EQ could increase organizations productivity and competitiveness. v. Explain application of EQ to personal and professional life. vi. Identify specific action to increase EQ for self, work , family and community growth which will facilitate: vii. To understand the concept the concept of awareness of self and others. viii. Achievement of better level of competitiveness. ix. Overall enhanced productivity. x. Enhanced self-confidence and self-empowerment. xi. Positive interactions by building rapport, trust and credibility. xii. Increased success & reduce stress on the job. xiii. Successful business relationship.

POWER OF EMOTIONAL INTELLIGENCE (EQ) AT WORK JUNE 2014

USAINS Holding Sdn. Bhd. (wholly-owned by Universiti Sains Malaysia)

yt: An Analysis and Visualization System for Astrophysical Simulation Data

John ZuHone

Who Should Attend • Technicians, engineers, and researchers • Decision makers, policy makers, and managers LEARNING OUTCOMES: Upon completion of this course, participants will be able to: • Explain the importance of vacuum in thin film. • List down application of plasma related to thin film. • Discuss factors affecting properties of a surface and thin film. • List down parameters influencing an interfacial layer. • Compare interaction between electron-surface and particle-surface. • Elaborate growing process of a thin film. • List down factors affecting the properties of a thin film. • Differentiate between physical and chemical vapor deposition techniques. • Recommend a suitable thin film deposition technique for a specific application.

THIN FILM SCIENCE & APPLICATION JUNE 2014

USAINS Holding Sdn. Bhd. (wholly-owned by Universiti Sains Malaysia)

Current Legal Issues In Education

Department of Education - Philippines

Viewers also liked (9)

Beekman5 std ppt_06

Education and trainning

Dr. Preslav Nakov — Combining, Adapting and Reusing Bi-texts between Related ...

Pueblo Community College's Business Simulation Project

STATISTICAL APPLICATION TRAINING PROGRAM

POWER OF EMOTIONAL INTELLIGENCE (EQ) AT WORK JUNE 2014

yt: An Analysis and Visualization System for Astrophysical Simulation Data

THIN FILM SCIENCE & APPLICATION JUNE 2014

Current Legal Issues In Education

Similar to Comparison of Statistical Calculations for Software Model Analysis

In this paper , we will provide a scheduler on batch jobs with GA regard to the threshold detector. In The algorithm proposed in this paper, we will provide the batch independent jobs with a new technique ,so we can optimize the schedule them. To do this, we use a threshold detector then among the selected jobs, processing resources can process batch jobs with priority. Also hierarchy of tasks in each batch, will be determined with using DGBSA algorithm. Now , with the regard to the works done by previous ,we can provide an algorithm that by adding specific parameters to fitness function of the previous algorithms ,develop a optimum fitness function that in the proposed algorithm has been used. According to assessment done on DGBSA algorithm, in compare with the similar algorithms, it has more performance. The effective parameters that used in the proposed algorithm can reduce the total wasting time in compare with previous algorithms. Also this algorithm can improve the previous problems in batch processing with a new technique.

DGBSA : A BATCH JOB SCHEDULINGALGORITHM WITH GA WITH REGARD TO THE THRESHOLD ...

IJCSEA Journal

Grid computing can involve lot of computational tasks which requires trustworthy computational nodes. Load balancing in grid computing is a technique which overall optimizes the whole process of assigning computational tasks to processing nodes. Grid computing is a form of distributed computing but different from conventional distributed computing in a manner that it tends to be heterogeneous, more loosely coupled and dispersed geographically. Optimization of this process must contains the overall maximization of resources utilization with balance load on each processing unit and also by decreasing the overall time or output. Evolutionary algorithms like genetic algorithms have studied so far for the implementation of load balancing across the grid networks. But problem with these genetic algorithm is that they are quite slow in cases where large number of tasks needs to be processed. In this paper we give a novel approach of parallel genetic algorithms for enhancing the overall performance and optimization of managing the whole process of load balancing across the grid nodes.

Use of genetic algorithm for

ijitjournal

Feature selection in high-dimensional datasets is considered to be a complex and time-consuming problem. To enhance the accuracy of classification and reduce the execution time, Parallel Evolutionary Algorithms (PEAs) can be used. In this paper, we make a review for the most recent works which handle the use of PEAs for feature selection in large datasets. We have classified the algorithms in these papers into four main classes (Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Scattered Search (SS), and Ant Colony Optimization (ACO)). The accuracy is adopted as a measure to compare the efficiency of these PEAs. It is noticeable that the Parallel Genetic Algorithms (PGAs) are the most suitable algorithms for feature selection in large datasets; since they achieve the highest accuracy. On the other hand, we found that the Parallel ACO is timeconsuming and less accurate comparing with other PEA.

Parallel Evolutionary Algorithms for Feature Selection in High Dimensional Da...

IJCSIS Research Publications

Parallel processing is capable of executing a large number of tasks on a multiprocessor at the same time period, and it is also one of the emerging concepts. Complex and computational problems can be resolved in an efficient way with the help of parallel processing. The parallel processing system can be divided into two categories depending on the nature of tasks such are homogenous parallel system and the heterogeneous parallel processing system. In the homogeneous environment, the number of processors required for executing different tasks is similar in capacity. In case of heterogeneous environments, tasks are allocated to various processors with different capacity and speed. The main objective of parallel processing is to optimize the execution speed and to shorten the duration of task execution with independent of environment. In this proposed work, an optimized parallel project selection method was implemented to find the optimal resource utilization and project scheduling. The execution speeds of the task increases and the overall average execution time of the task decreases by allocating different tasks to various processors with the task scheduling algorithm.

An Improved Parallel Activity scheduling algorithm for large datasets

IJERA Editor

Cloud computing is the most recent computing paradigm, in the Information Technology where the resources and information are provided on-demand and accessed over the Internet. An essential factor in the cloud computing system is Task Scheduling that relates to the efficiency of the entire cloud computing environment. Mostly in a cloud environment, the issue of scheduling is to apportion the tasks of the requesting users to the available resources. This paper aims to offer a genetic based scheduling algorithm that reduces the waiting time of the overall system. However the tasks enter the cloud environment and the users have to wait until the resources are available that leads to more queue length and increased waiting time. This paper introduces a Task Scheduling algorithm based on genetic algorithm using a queuing model to minimize the waiting time and queue length of the system.

A novel scheduling algorithm for cloud computing environment

Souvik Pal

In computer science, 'evolutionary computation' is an algorithmic tool based on evolution. It implements random variation, reproduction and selection by altering and moving data within a computer. It helps in building, applying and studying algorithms based on the Darwinian principles of natural selection. In this paper, studies about different evolutionary computation techniques used in some applications specifically image processing, cloud computing and grid computing is carried out briefly. This work is an effort to help researchers from different fields to have knowledge on the techniques of evolutionary computation applicable in the above mentioned areas.

Survey on evolutionary computation tech techniques and its application in dif...

ijitjournal

A study on cloud computing ppt n_24-12-2017

Manish K Patel

An Efficient Approach for Clustering High Dimensional Data

IJSTA

Due to the advances in human civilization, problems in science and engineering are becoming more complicated than ever before. To solve these complicated problems, grid computing becomes a popular tool. a grid environment collects, integrates, and uses heterogeneous or homogeneous resources scattered around the globe by a high-speed network. Scheduling problems are at the heart of any Grid-like computational system. a good scheduling algorithm can assign jobs to resources efficiently and can balance the system load. in this paper we survey three algorithms for grid scheduling and compare benefit and disadvantages of their based on makespan.

A Survey of Job Scheduling Algorithms Whit Hierarchical Structure to Load Ba...

Editor IJCATR

The integration of remote and diverse resources and the increasing computational needs of Grand Challenges problems combined with the faster growth of the internet and communication technologies leads to the development of global computational grids. Grid computing is a prevailing technology, which unites underutilized resources in order to support sharing of resources and services distributed across numerous administrative region. An efficient and effective scheduling system is essentially required in order to achieve the promising capacity of grids. The main goal of scheduling is to maximize the resource utilization and minimize processing time and cost of the jobs. In this research, the objective is to prioritize the jobs based on execution cost and then allocate the resources with minimum cost by merging it with conventional job grouping strategy to provide the solution for better and more efficient job scheduling which is beneficial to both user and resource broker. The proposed scheduling approach in grid computing employs a dynamic cost-based job scheduling algorithm for making an efficient mapping of a job to available resources in the grid. It also improves communication to computation ratio (CCR) and utilization of available resources by grouping the user jobs before resource allocation.

Effective and Efficient Job Scheduling in Grid Computing

Aditya Kokadwar

Huge volume of data from domain specific applications such as medical, financial, library, telephone, shopping records and individual are regularly generated. Sharing of these data is proved to be beneficial for data mining application. On one hand such data is an important asset to business decision making by analyzing it. On the other hand data privacy concerns may prevent data owners from sharing information for data analysis. In order to share data while preserving privacy, data owner must come up with a solution which achieves the dual goal of privacy preservation as well as an accuracy of data mining task – clustering and classification. An efficient and effective approach has been proposed that aims to protect privacy of sensitive information and obtaining data clustering with minimum information loss

TUPLE VALUE BASED MULTIPLICATIVE DATA PERTURBATION APPROACH TO PRESERVE PRIVA...

IJDKP

Abstract: With development of the information technology, the scale of data is increasing quickly. The massive data poses a great challenge for data processing and classification. In order to classify the data, there were several algorithm proposed to efficiently cluster the data. One among that is the random forest algorithm, which is used for the feature subset selection. The feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. It is achieved by classifying the given data. The efficiency is calculated based on the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. The existing system deals with fast clustering based feature selection algorithm, which is proven to be powerful, but when the size of the dataset increases rapidly, the current algorithm is found to be less efficient as the clustering of datasets takes quiet more number of time. Hence the new method of implementation is proposed in this project to efficiently cluster the data and persist on the back-end database accordingly to reduce the time. It is achieved by scalable random forest algorithm. The Scalable random forest is implemented using Map Reduce Programming (An implementation of Big Data) to efficiently cluster the data. In works on two phases, the first step deals with the gathering the datasets and persisting on the datastore and the second step deals with the clustering and classification of data. This process is completely implemented using Google App Engine’s hadoop platform, which is a widely used open-source implementation of Google's distributed file system using MapReduce framework for scalable distributed computing or cloud computing. MapReduce programming model provides an efficient framework for processing large datasets in an extremely parallel mining. And it comes to being the most popular parallel model for data processing in cloud computing platform. However, designing the traditional machine learning algorithms with MapReduce programming framework is very necessary in dealing with massive datasets.Keywords: Data mining, Hadoop, Map Reduce, Clustering Tree. Title: Big Data on Implementation of Many to Many Clustering Author: Ravi. R, Michael. G ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Paper Publications

Big Data on Implementation of Many to Many Clustering

paperpublications3

Many computational solutions can be expressed as workflows. A Cluster of processors is a shared resource among several users and hence the need for a scheduler which deals with multi-user jobs presented as workflows. The scheduler must find the number of processors to be allotted for each workflow and schedule tasks on allotted processors. In this work, a new method to find optimal and maximum number of processors that can be allotted for a workflow is proposed. Regression analysis is used to find the best possible way to share available processors, among suitable number of submitted workflows. An instance of a scheduler is created for each workflow, which schedules tasks on the allotted processors. Towards this end, a new framework to receive online submission of workflows, to allot processors to each workflow and schedule tasks, is proposed and experimented using a discrete-event based simulator. This space-sharing of processors among multiple workflows shows better performance than the other methods found in literature. Because of space-sharing, an instance of a scheduler must be used for each workflow within the allotted processors. Since the number of processors for each workflow is known only during runtime, a static schedule can not be used. Hence a hybrid scheduler which tries to combine the advantages of static and dynamic scheduler is proposed. Thus the proposed framework is a promising solution to multiple workflows scheduling on cluster.

Sharing of cluster resources among multiple Workflow Applications

ijcsit

IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology

An enhanced adaptive scoring job scheduling algorithm with replication strate...

eSAT Publishing House

Grid computing is an accumulation of heterogeneous, dynamic resources from multiple administrative areas which are geographically distributed that can be utilized to reach a mutual end. Development of resource provisioning-based scheduling in large-scale distributed environments like grid computing brings in new requirement challenges that are not being believed in traditional distributed computing environments. Computational grid is applying the resources of many systems in a network to a single problem at the same time. Grid scheduling is the method by which work specified by some means is assigned to the resources that complete the work in the environment which cannot fulfill the user requirements considerably. The satisfaction of users while providing the resources might increase the beneficiary level of resource suppliers. Resource scheduling has to satisfy the multiple constraints specified by the user. The option of resource with the satisfaction of multiple constraints is the most tedious process. This trouble is solved by bringing out the particle swarm optimization based heuristic scheduling algorithm which attempts to select the most suitable resource from the set of available resources. The primary parameters that are taken in this work for selecting the most suitable resource are the makespan and cost. The experimental result shows that the proposed method yields optimal scheduling with the atonement of all user requirements.

OPTIMIZED RESOURCE PROVISIONING METHOD FOR COMPUTATIONAL GRID

ijgca

Optimized Resource Provisioning Method for Computational Grid

ijgca

Dynamic assignment of geospatial-temporal macro tasks to agents under human s...

Reza Nourjou, Ph.D.

International Journal of Computational Engineering Research(IJCER)

ijceronline

Abstract Nowadays cloud computing is emerging Technology. It is used to access anytime and anywhere through the internet. Hadoop is an open-source Cloud computing environment that implements the Googletm MapReduce framework. Hadoop is a framework for distributed processing of large datasets across large clusters of computers. This paper proposes the workload of jobs in clusters mode using Hadoop. MapReduce is a programming model in hadoop used for maintaining the workload of the jobs. Depend on the job analysis statistics the future workload of the cluster is predicted for potential performance optimization by using genetic algorithm. Key Words: Cloud computing, Hadoop Framework, MapReduce Analysis, Workload

Optimization of workload prediction based on map reduce frame work in a cloud...

eSAT Journals

Optimization of workload prediction based on map reduce frame work in a cloud...

eSAT Publishing House

Similar to Comparison of Statistical Calculations for Software Model Analysis (20)

DGBSA : A BATCH JOB SCHEDULINGALGORITHM WITH GA WITH REGARD TO THE THRESHOLD ...

Use of genetic algorithm for

Parallel Evolutionary Algorithms for Feature Selection in High Dimensional Da...

An Improved Parallel Activity scheduling algorithm for large datasets

A novel scheduling algorithm for cloud computing environment

Survey on evolutionary computation tech techniques and its application in dif...

A study on cloud computing ppt n_24-12-2017

An Efficient Approach for Clustering High Dimensional Data

A Survey of Job Scheduling Algorithms Whit Hierarchical Structure to Load Ba...

Effective and Efficient Job Scheduling in Grid Computing

TUPLE VALUE BASED MULTIPLICATIVE DATA PERTURBATION APPROACH TO PRESERVE PRIVA...

Big Data on Implementation of Many to Many Clustering

Sharing of cluster resources among multiple Workflow Applications

An enhanced adaptive scoring job scheduling algorithm with replication strate...

OPTIMIZED RESOURCE PROVISIONING METHOD FOR COMPUTATIONAL GRID

Optimized Resource Provisioning Method for Computational Grid

Dynamic assignment of geospatial-temporal macro tasks to agents under human s...

International Journal of Computational Engineering Research(IJCER)

Optimization of workload prediction based on map reduce frame work in a cloud...

SPSS: An Effective Tool to Compute Learning Outcomes in Acadamics

ijcoa

Detection of software bugs and its occurrences, repudiation and its root cause is a very difficult process in large multi threaded applications. It is a must for a software developer or software organization to identify bugs in their applications and to remove or overcome them. The application should be protected from malfunctioning. Many of the compilers and Integrated Development Environments are effectively identifying errors and bugs in applications while running or compiling, but they fail in detecting actual cause for the bugs in the running applications. The developer has to reframe or recreate the package with the new one without bugs. It is time consuming and effort is wasted in Software Development Life Cycle. There is a possibility to use graph mining techniques in detecting software bugs. But there are many problems in using graph mining techniques. Managing large graph data, processing nodes with links and processing subgraphs are the problems to be faced in graph mining approach. This paper presents a novel algorithm named BugLoc which is capable of detecting bugs from the multi threaded software application. The BugLoc uses object template to store graph data which reduces graph management complexities. It also uses substring analysis method in detecting frequent subgraphs. The BugLoc then analyses frequent subgraphs to detect exact location of the software bugs. The experimental results show that the algorithm is very efficient, accurate and scalable for large graph dataset.

BugLoc: Bug Localization in Multi Threaded Application via Graph Mining Approach

ijcoa

The detection of moving object is an important in many applications such as a vehicle identification in a traffic monitoring system,human detection in a crime branch.In this paper we identify a vehicle in a video sequence.This paper briefly explain the detection of moving vehicle in a video.We introduce a new algorithm BGS for idntifying vehicle in a video sequence. First, we differentiate the foreground from background in frames by learning the background. Then, the image is divided into many small nonoverlapped frames. The candidates of the vehicle part can be found from the frames if there is some change in gray level between the current image and the background. The extracted background subtraction method is used in subsequent analysis to detect a vehicle and classify moving vehicle.

Motion Object Detection Using BGS Technique

ijcoa

Analysis of Women Harassment in Villages Using CETD Matrix Modal

ijcoa

Solving Assignment Problem Using L-R Fuzzy Numbers

ijcoa

Fuzzy Chroamtic Number of Line Graph using α-Cuts

ijcoa

A Study on the Exposures of Rag- Pickers Using Induced Neutrosophic Cognitive...

ijcoa

Dual Trapezoidal Fuzzy Number and its Applications

ijcoa

This paper presents an implementation of one dimensional Burgers equation using implicit method with Intel Xeon Phi Coprocessor. In particular, we used MAGMA MIC library which is an open source high performance library for solving a systems of non-linear equations. Further for high performance computation we consider offload mode as the primary mode of operation for Intel Xeon phi coprocessor. The result obtained from implicit scheme is then compared with the exact values and it’s seen that the results obtained are approximate and reliable. The result table showed that the proposed scheme achieved higher performance on Intel MIC platform.

Developing and Porting multi-grid solver for CFD application on Intel-MIC pla...

ijcoa

Adin and Roichman [1] introduced the concept of permutation graphs and Peter Keevash, Po-Shen Loh and Benny Sudakov [2] identified some permutation graphs with maximum number of edges. Ryuhei Uehara, Gabriel Valiente, discussed on Linear structure of Bipartite Permutation Graphs and the Longest Path Problem [3]. If i, j belongs to a permutation on p symbols {1, 2, …, p} and i is less than j then there is an edge between i and j in the permutation graph if i appears after j in the sequence of permutation. So the line of i crosses the line of j in the permutation. Hence there is a one to one correspondence between crossing of lines in the permutation and the edges of the corresponding permutation graph. In this paper we found the conditions for a permutation to realize a double star and comprehend the algorithm to determine the satuation index of the permutation. AMS Subject Classification (2010): 05C35, 05C69, 20B30.

Saturation Index of π(D(r,s))

ijcoa

The multi-factorial chronicle, severe disease among human is diabetes. As a result of abnormal level of glucose in body leads to heart attack, kidney disease, renal failure, Hyperglycemia and also cancer in organs like liver and pancreas. Many studies have been proved that several types of heart diseases are possible in diabetic patients having a high blood sugar. Many approaches were proposed to diagnose both Diabetes and heart diseases. Most of the diabetes people can also have heart diseases called as Diabetic Cardiomyopathy. The earliest manifestation of diabetic cardiomyopathy is needed certain processes. The objective of the study is to examine the association of heart disease and diabetes. The relationship between diabetes and cardiovascular diseases are examined by taking into account of age, sex and associated diabetic and cardiovascular risk factors. The data are collected from patients with diabetes. From these data, features are selected by ant colony optimization and those selected features are given to hybrid PSO-LIBSVM to classify abnormal and normal data. This performance is evaluated using performance metrics and proved this classifiers efficiency for detection of Diabetic Cardiomyopathy.

Classification and Prediction of Heart Disease from Diabetes Patients using H...

ijcoa

Cryptography is important in communicating secured information that is vulnerable to distortion. The main goal of this paper is encrypting the small arbitrary length data without any changes in the length and data type. We propose a flexible arbitrary length small domain block cipher (FPESD). FPESD is based on AES Algorithm. The resulting cipher text is the same as input plaintext. Here, we use Galois finite field GF (28) and format preserving key to implement FPE. For decryption format preserving key is used along with cipher text and secret key.

Format Preserving Encryption for Small Domain

ijcoa

Intuitionistic Double Layered Fuzzy Graph and its Cartesian Product Vertex De...

ijcoa

Knowledge of climate data of region is essential for business, society, agriculture, pollution and energy applications. Climate is not fixed, the fluctuation in the climate can be seen from year to year.The data mining application help meteorological scientists to predictaccurate weather forecast and decisions and also provide more performance and reliability than any other methods. The data mining techniques applied on weather data are efficient when compare to the mathematical models used. Various techniques of data mining are applied on climate data to support weather forecasting, climate scientists, agriculture, vegetation, water resources and tourism. The aim of this paper is to provide a review report on various data mining techniques applied on weather data set in support of weather prediction and climate analysis.

Clustering and Classification in Support of Climatology to mine Weather Data ...

ijcoa

Test Suite Reduction is an optimization technique to identify the minimally sized subset of test cases with enforced constraints involved. The main purpose of test suite reduction is to deduce increased number of test cases that in turn increase the time and cost involved in execution. Fault Detection is the method of identifying the faults that affect the outcome of the system either logically or syntactically. This paper focuses on the reduction of the test suite that has high fault identification rates and also incurs low cost of execution of test cases. The proposed approach includes a new parameter Fault Detection Effectiveness to identify fault rates of test suite; an algorithm for test suite reduction based on priority of requirements; a low cost framework to identify the execution of test cases with minimum budget. Thus, the proposed work defines a test suite that has high fault detection effectiveness providing maximum coverage to requirements at minimum cost of execution.

Test Suite Reduction Based on Fault Detection with Cost Optimization

ijcoa

As the e-commerce is gaining popularity various customer surveys of objects are currently accessible on the Internet. These surveys are frequently disordered, prompting challenges in knowledge discovery and object assessment. This article proposes an object feature positioning skeleton, which consequently recognizes the critical features of an object from online customer surveys. The critical object features are recognized focused around two perceptions: 1) they are normally commented extensively by customers and 2) customer suppositions on the critical feature significantly impact their general assessments on the object. Specifically, given the customer surveys of an item, we first extract the object feature by a shallow reliance parser and focus customer suppositions on these features through an opinion characterizer. We then create a probabilistic object feature positioning calculation to identify the criticalness of perspectives by at the same time considering feature recurrence and the impact of customer opinion given to every feature over their general opinion. The experimental results on 3 popular products demonstrate the effectiveness of our approach.

Artifact Facet Ranking and It’s Applications

ijcoa

Cloud Computing makes data really mobile and a client can simply access a chosen cloud with any internet accessible device. The espousal and dispersion of Cloud computing are threatened by unresolved security issues that affect both the cloud provider and the cloud user. The integrity of data stored in the cloud is one of the challenges to be addressed before the novel storage model is applied widely. This paper analyses the efficiency issues and security dodge of an existing scheme and proposes an amended data integrity scheme using improved RSA and number theory based concept for cloud archive. This scheme of protecting the integrity of guest virtual machines can be agreed upon by both the cloud and the customer and can be incorporated in the service level agreement (SLA).Based onhypothetical analysis, we demonstrate that the proposedscheme has a provably safe and highly adroit dataintegrity inspection measure.

Effectual Data Integrity Checking Technique Based on Number Theory

ijcoa

What cause to the neurons of the human brain cells when they are damaged. They become inactive. So damage to subthalamiuc nucleus (STN) neurons of the human brain causing larger involuntary movements and thereby attacking the Parkinson’s disease (PD). Deep brain stimulation (DBS) of bilateral sub thalamic nuclei (STN) is an efficient method of rehabilitation technique in subjects with advanced idiopathic Parkinson’s (or Parkinson) disease. Accurate targeting of STN neurons and placement of microelectrodes/ (neurosensors) are paramount importance for optimal results after STN-DBS method.In this paper, microminiaturized electrode recordings (MER) of STN neurons were detected in a mean of 3.5 ±1.1 channels on right hemisphere and 3.6 ±1.04 on left hemisphere.Final channel selected were most commonly central seen in 42.3% followed by anterior in 33.7%. When a high current is delivered to STN or GPi neurons of basal ganglia (a component of human brain), causing their inhibition and improved indication of symptoms. It is now known that there is a significant change in the firing pattern and a reorganization of the entire basal ganglia circuit with DBS. The MER of STN neurons has identified a specific high frequency irregular larger amplitude firing patterns seen only in disease states and hence used to detect the neurons of ST nucleus during functional surgery. Microelectrode recording is so useful to confirm the right path but has to be taken in consideration with effects on macro stimulation.

Micro-Neuro-Sensor Recording of STN Neurons of the Human Brain

ijcoa

The focus of this paper is to get a bird's eye view of the various factors that could be analyzed to present schools and governments timely indicators of school dropouts. With the help of EDM, one could have access to enormous amounts of data. The crux of the matter would be to identify the data in line with plans and ideas that would eventually lead to the formulation of policies that enhance the teaching and learning process.

EDM: Finding Answers to Reduce Dropout Rates in Schools

ijcoa

Agile software development has been gaining popularity and replacing the traditional methods of developing software. However, estimating the size and effort in Agile software development still remains a challenge. Measurement practices in agile methods are more important than traditional methods, because lack of appropriate an effective measurement practices will increase the risk of project. This paper discuss about traditional and agile effort estimation model, and analysis done on how the metrics are used in estimation process. The paper also suggeststo use object point and use case point to improve accuracy of effort in agile software development.

Analysis of Effort Estimation Model in Traditional and Agile (USING METRICS ...

ijcoa

More from ijcoa (20)

SPSS: An Effective Tool to Compute Learning Outcomes in Acadamics

BugLoc: Bug Localization in Multi Threaded Application via Graph Mining Approach

Motion Object Detection Using BGS Technique

Analysis of Women Harassment in Villages Using CETD Matrix Modal

Solving Assignment Problem Using L-R Fuzzy Numbers

Fuzzy Chroamtic Number of Line Graph using α-Cuts

A Study on the Exposures of Rag- Pickers Using Induced Neutrosophic Cognitive...

Dual Trapezoidal Fuzzy Number and its Applications

Developing and Porting multi-grid solver for CFD application on Intel-MIC pla...

Saturation Index of π(D(r,s))

Classification and Prediction of Heart Disease from Diabetes Patients using H...

Format Preserving Encryption for Small Domain

Intuitionistic Double Layered Fuzzy Graph and its Cartesian Product Vertex De...

Clustering and Classification in Support of Climatology to mine Weather Data ...

Test Suite Reduction Based on Fault Detection with Cost Optimization

Artifact Facet Ranking and It’s Applications

Effectual Data Integrity Checking Technique Based on Number Theory

Micro-Neuro-Sensor Recording of STN Neurons of the Human Brain

EDM: Finding Answers to Reduce Dropout Rates in Schools

Analysis of Effort Estimation Model in Traditional and Agile (USING METRICS ...

Recently uploaded

Nanoparticles synthesis and characterization

kaibalyasahoo82800

Choose Our GTB Nagar Call Girls Through Our WhatsApp Number: - 8250077686 Easy & Fast Booking Procedure of GTB Nagar Call Girls Call girls are ready and waiting to provide the quality essentialness that will help ease away life's tensions GTB Nagar Call Girls are regular companions of elite gentlemen. They can take them places they could only dream of visiting. These ladies take great care in maintaining themselves to look appealing; visiting salons and spas regularly keeps them looking their best; their portfolios can be found online via an escort agency website. Visit our website: https://www.prishagill.com/ Visit our website: https://www.dighacallgirls.com/ Visit our website: https://www.sheetalarora.com/ Visit our website: https://www.streetgirls69.in/

High Profile 🔝 8250077686 📞 Call Girls Service in GTB Nagar🍑

Damini Dixit

Mustard, as a crop, is susceptible to a variety of pests that can affect its growth and yield. Here’s a rundown of some common pests that target mustard plants: Aphids: These small, sap-sucking insects can cause significant damage by feeding on the leaves and stems. Aphids also excrete a sticky substance known as honeydew, which can lead to the growth of sooty mold on the plants. Flea Beetles: These tiny beetles jump like fleas when disturbed and chew small holes in the leaves. They are particularly damaging in the early growth stages of the plant. Cabbage Loopers: The larvae of a type of moth, these caterpillars are known for their distinctive looping movement. They chew large holes in the leaves and can defoliate plants if present in large numbers. Diamondback Moth Larvae: Another caterpillar pest, these larvae chew small holes in the leaves and can cause extensive damage, especially when infestations are heavy. Whiteflies: These are tiny, winged insects that feed on plant sap and can quickly become a problem in greenhouse or close planting conditions. Like aphids, they also secrete honeydew. Cutworms: These are the larvae of certain types of moths and are known for cutting young plants at the stem base at ground level. They are most destructive during the night. Root Maggots: The larvae of root maggot flies, these pests attack the roots of mustard plants, causing wilting and potentially killing young plants. Harlequin Bugs: These are colorful stink bugs that suck the sap from mustard plant stems and leaves, causing the leaves to become stippled, wilt, and eventually die if the infestation is severe. Mustard Sawfly: The larvae of the mustard sawfly can cause considerable defoliation, as they feed voraciously on the leaves. Clubroot: Caused by a fungus-like organism, clubroot affects the roots, causing them to swell and distort. While technically a disease, it is often associated with pest management because controlling it involves similar preventative strategies. Control Measures: Managing pests in mustard involves a combination of cultural, biological, and chemical methods. Crop rotation, resistant varieties, timely sowing, maintaining plant health, and using natural predators like ladybugs and parasitic wasps can help keep pest populations under control. Chemical pesticides should be used as a last resort due to their potential impact on the environment and non-target species.

Pests of mustard_Identification_Management_Dr.UPR.pdf

PirithiRaju

Botany is the branch of biology that deals with the scientific study of plants, including their structure, growth, reproduction, metabolism, development, and classification. It encompasses a wide range of topics, from the molecular biology of plant cells to the ecological relationships between plants and their environments. Botany is essential for understanding plant diversity, ecology, evolution, and the roles plants play in ecosystems and human societies.

Botany 4th semester series (krishna).pdf

Sumit Kumar yadav

GBSN - Microbiology (Unit 1)

Areesha Ahmad

Justdial Call Girls In Indirapuram, Ghaziabad, 8800357707 Escorts Service Best High Class call girls Service Escorts Service in Home Hotel in Delhi NCR 24 Hours Available Service. We provide Super Class Hot and Sexy Indian Female Escorts Service, A to Z Body and Mind Satisfaction by Top Class Female Models in Delhi Gurgaon Noida NCR in Hotel 24hrs In Call and Out Call Service At Lowest Price. We Have Indian Punjabi Kashmiri Northeast Every Type Sexy Bold Beautiful Young Soft Cute Charming Female Escorts Available. Hygienic Full AC Neat and Clean Rooms Avail. In Hotel 24hrs in Delhi NCR

Justdial Call Girls In Indirapuram, Ghaziabad, 8800357707 Escorts Service

monikaservice1

GBSN - Microbiology (Unit 3)

Areesha Ahmad

Site Acceptance Test .

Poonam Aher Patil

TEST BANK For Radiologic Science for Technologists, 12th Edition by Stewart C...

ssifa0344

Conjugation, transduction and transformation

Areesha Ahmad

Hire 💕 9907093804 Hooghly Call Girls Service Call Girls Agency

Sheetal Arora

A botany file is similar to a chemistry practical file but specifically focuses on experiments and observations related to plants. It typically includes detailed descriptions of plant-related experiments, such as germination studies, growth experiments, tissue culture techniques, plant anatomy investigations, and ecological surveys. The file may contain records of plant specimens collected, their classification, characteristics, and ecological significance. Additionally, it may include diagrams, photographs, drawings, tables, and data analysis related to plant research. Like a chemistry practical file, a botany file serves as a documentation of practical work conducted in the field of botany and is often used for assessment and educational purposes.

Botany 4th semester file By Sumit Kumar yadav.pdf

Sumit Kumar yadav

Pulmonary drug delivery system M.pharm -2nd sem P'ceutics

sakshisoni2385

99992-vip-66834 📞Noida Sector 22 Noida Low price 100% genuine sexy VIP call girls are provided safe and secure service .call 📞,,24 hours 🕰️-- ✅100% gesnuine young RIYA SERVICE COMPANY ✔✔✔ ★ A-Level (5 star ) ★ Strip-tease ★ BBBJ (Bareback Blowjob) Receive advanced sexual techniques in different mode make their life more pleasurable. ★ Spending time in hotel rooms ★ BJ (Blowjob Without a Condom) ★ Completion (Oral to completion) ★ Covered (Covered blowjob Without a Condom) ★ DATING (Dinner At Night) ★ DSL (Dick Sucking Lips) ★ DT (Dining at the Toes English Spanking) ★ Doggie (Sex style from behind) ★ Duo (shot with two escorts; Threesome with the client) ★ S-GFE (Special Girl Friend Experience) ★ HJ (Hand Job) ★ Special Massage ★ O-Level (Oral sex) ★ Tour (International) ★ 69 (69 sex) ★ BJ (Blowjob With Condom) ★ GFE (Girl Friend Experience) ★ CBJ (Covered Blow Job; Oral sex with a condom _ LOW PRICE V I P MODEL FULL SAFE AND SECURE CALL MExxxs CALL ME

9999266834 Call Girls In Noida Sector 22 (Delhi) Call Girl Service

nishacall1

module for grade 9 for distance learning

levieagacer

CELL -Structural and Functional unit of life.pdf

Nistarini College, Purulia (W.B) India

Bacterial Identification and Classifications

Areesha Ahmad

Feature-aligned N-BEATS with Sinkhorn divergence (ICLR '24)

Joonhun Lee

Wepresent Atacama Large Millimeter/submillimeter Array 12-m, 7-m, and Total Power Array observations of the FUOrionis outbursting system, covering spatial scales ranging from 160 to 25,000 au. The high-resolution interferometric data reveal an elongated 12CO(2–1) feature previously observed at lower resolution in 12CO(3–2). Kinematic modeling indicates that this feature can be interpreted as an accretion streamer feeding the binary system. The mass infall rate provided by the streamer is significantly lower than the typical stellar accretion rates (even in quiescent states), suggesting that this streamer alone is not massive enough to sustain the enhanced accretion rates characteristic of the outbursting class prototype. The observed streamer may not be directly linked to the current outburst, but rather a remnant of a previous, more massive streamer that may have contributed enough to the disk mass to render it unstable and trigger the FU Orionis outburst. The new data detect, for the first time, a vast, slow-moving carbon monoxide molecular outflow emerging from this object. To accurately assess the outflow properties (mass, momentum, and kinetic energy), we employ 13CO(2–1) data to correct for optical depth effects. The analysis indicates that the outflow corresponds to swept-up material not associated with the current outburst, similar to the slow molecular outflows observed around other FUor and Class I protostellar objects.

Discovery of an Accretion Streamer and a Slow Wide-angle Outflow around FUOri...

Sérgio Sacani

American Type Culture Collection (ATCC).pptx

abhishekdhamu51

Recently uploaded (20)

Nanoparticles synthesis and characterization

High Profile 🔝 8250077686 📞 Call Girls Service in GTB Nagar🍑

Pests of mustard_Identification_Management_Dr.UPR.pdf

Botany 4th semester series (krishna).pdf

GBSN - Microbiology (Unit 1)

Justdial Call Girls In Indirapuram, Ghaziabad, 8800357707 Escorts Service

GBSN - Microbiology (Unit 3)

Site Acceptance Test .

TEST BANK For Radiologic Science for Technologists, 12th Edition by Stewart C...

Conjugation, transduction and transformation

Hire 💕 9907093804 Hooghly Call Girls Service Call Girls Agency

Botany 4th semester file By Sumit Kumar yadav.pdf

Pulmonary drug delivery system M.pharm -2nd sem P'ceutics

9999266834 Call Girls In Noida Sector 22 (Delhi) Call Girl Service

module for grade 9 for distance learning

CELL -Structural and Functional unit of life.pdf

Bacterial Identification and Classifications

Feature-aligned N-BEATS with Sinkhorn divergence (ICLR '24)

Discovery of an Accretion Streamer and a Slow Wide-angle Outflow around FUOri...

American Type Culture Collection (ATCC).pptx

Comparison of Statistical Calculations for Software Model Analysis

1. International Journal of Computing Algorithm, Vol 2(1), June 2013 ISSN(Print):2278-2397 Website: www.ijcoa.com Comparison of Statistical Calculations for Software Model Analysis N.Sasikala1 , G.Rasitha Banu2 , K.Rangarajan3 1 2 Research Scholar, Mother Theresa Women’s University 3 Hod, MCA Department, Bharath University Abstract Cloud Computing is the utilization of pool of resources for remote users through internet that can be easily accessible, scalable and utilization of resources. To attain maximum utilization of resources the tasks need to be scheduled. The problem in scheduling is allocating the correct resources to the arrived tasks. Dynamic scheduling is that the task arrival is uncertain at run time and allocating resources are tedious as several tasks arrive at the same time. To avoid this scheduling problem, Genetic Algorithm is used. Genetic algorithm is a heuristic method that deals with the natural selection of solution from all possible solutions. Using genetic algorithm the tasks are scheduled according to the computation and memory usage. The tasks are scheduled dynamically. The execution time is reduced by parallel processing. The scheduled data is stored in cloud. By using GA to obtain global optimization.

Comparison of Statistical Calculations for Software Model Analysis

Recommended

Recommended

More Related Content

Viewers also liked

Viewers also liked (9)

Similar to Comparison of Statistical Calculations for Software Model Analysis

Similar to Comparison of Statistical Calculations for Software Model Analysis (20)

More from ijcoa

More from ijcoa (20)

Recently uploaded

Recently uploaded (20)

Comparison of Statistical Calculations for Software Model Analysis