scholarly journals Performance Analysis of Heap Sort and Insertion Sort Algorithm

2021 ◽  
Vol 9 (5) ◽  
pp. 580-586
Keyword(s):  
Performance Analysis ◽  
New Technology ◽  
Large Data ◽  
Sorting Algorithm ◽  
Small Data ◽  
Huge Amount ◽  
Worst Case ◽  
Running Time ◽  
Java Programming ◽  
Sorting Technique

In the era of new technology, we have huge amount of data to deal with arranging the huge amount of data has remained a big challenge. This research paper includes two types of sorting algorithm, Heap Sort and Insertion Sort and also their performance analysis on thebasis of running time along with their complexity. This paper includes the algorithms and theirimplementation in Java programming language. For theresults of this research study,the comparison ofthese two sorting algorithms with different type of the data at running time such as Large, Average, and Small. In Large,data pass100 integers in the array. For Average data pass 50integers in the array and for Small data pass10 integers in the array. It checks that,which sorting technique is efficient according to the input data. Then identifiesthe efficiency of these algorithms according to this data three cases used that is Best, Average and Worst Case. The result of this analysis is showing with the help of graphs to show that how much time both algorithms take while given the desired output

scholarly journals Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm

2020 ◽  
Vol 2 (1) ◽  
pp. 46
Author(s):  
Atika Dwi Hanun Amalia ◽  
Herry Suprajitno ◽  
Asri Bekti Pratiwi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Large Data ◽  
Bat Algorithm ◽  
Small Data ◽  
Routing Problem ◽  
Java Programming ◽  
Implementation Program ◽  
Distribution Process ◽  
Vehicle Capacity

The purpose of this research is to solve the Close-Open Mixed Vehicle Routing Problem (COMVRP) using Bat Algorithm. COMVRP which is a combination of Close Vehicle Routing Problem or commonly known as Vehicle Routing Problem (VRP) with Open Vehicle Routing Problem (OVRP) is a problem to determine vehicles route in order to minimize total distance to serve customers without exceed vehicle capacity. COMVRP occurs when the company already has private vehicles but its capacity could not fulfill all customer demands so the company must rent several vehicles from other companies to complete the distribution process. In this case, the private vehicle returns to the depot after serving the last customer while the rental vehicle does not need to return. Bat algorithm is an algorithm inspired by the process of finding prey from small bats using echolocation. The implementation program to solve was created using Java programming with NetBeans IDE 8.2 software which was implemented using 3 cases, small data with 18 customers, medium data with 75 customers and large data with 100 customers. Based on the implementation results, it can be concluded that the more iterations, the smaller total costs are obtained, while for the pulse rate and the amount of bat tends not to affect the total cost obtained.

An Enhanced Bidirectional Insertion Sort Over Classical Insertion Sort

2020 ◽  
pp. 2150024
Author(s):  
A. Kalaivani ◽  
K. Swetha
Keyword(s):  
Comparative Analysis ◽  
Computing Time ◽  
Sorting Algorithm ◽  
Alphabetical Order ◽  
Worst Case ◽  
Average Case ◽  
Sorting Technique ◽  
Specific Order ◽  
Numerical Order ◽  
Sort Algorithm

Sorting is a technique which is used to arrange the data in specific order. A sorting technique is applied to rearrange the elements in numerical order as ascending order or descending order or for words in alphabetical order. In this paper, we propose an efficient sorting algorithm known as Enhanced Bidirectional Insertion Sorting algorithm which is developed from insertion sort concept. A comparative analysis is done for the proposed Enhanced Bidirectional Insertion Sort algorithm with the selection sort and insertion sort algorithms. When compared to insertion sort algorithm the proposed algorithm outperforms with less number of comparisons in worst case and average case computing time. The proposed algorithm works efficiently for duplicated elements which is the advanced improvement and the results are proved.

scholarly journals Design and Analysis of Optimized Stooge Sort Algorithm

2019 ◽  
Vol 8 (12) ◽  
pp. 1669-1673
Keyword(s):  
Time Complexity ◽  
Large Time ◽  
Sorting Algorithm ◽  
Data Element ◽  
Running Time ◽  
Sorting Algorithms ◽  
Sorting Technique ◽  
Sort Algorithm ◽  
The Given ◽  
Data Sorting

Data sorting hasmany advantages and applications in software and web development. Search engines use sorting techniques to sorttheresult before itispresented totheuser.Thewordsinadictionary are insorted ordersothatthewords canbe found easily.There aremanysorting algorithms that areused in many domains to perform some operation and obtain the desired output. But there are some sorting algorithms that take large time in sorting the data. This huge time can be vulnerable to the operation. Every sorting algorithm has the different sorting technique to sort the given data, Stooge sort is asorting algorithm which sorts the data recursively. Stooge sort takes comparatively more time as compared tomany othersorting algorithms.Stooge sortworks recursively to sort the data element but the Optimized Stooge sort does not use recursive process. In this paper, we propose Optimized Stooge sort to reduce the time complexity of the Stooge sort. The running time of Optimized Stooge sort is very much reduced as compared to theStooge sort algorithm. The existing researchfocuses onreducing therunning time of Stooge sort. Our results show that the Optimized Stooge sort is faster than the Stooge sort algorithm.

Theoretical Parameter Study of Aerodynamic Vectoring Particle Sorting

2007 ◽  
Vol 129 (7) ◽  
pp. 902-907 ◽  
Author(s):  
Dane N. Jackson ◽  
Barton L. Smith
Keyword(s):  
Density Ratio ◽  
Large Data ◽  
Flow Speed ◽  
Spherical Particles ◽  
Parameter Study ◽  
Particle Sizes ◽  
Case Scenario ◽  
Velocity Magnitude ◽  
Particle Sorting ◽  
Sorting Technique

A new particle sorting technique called aerodynamic vectoring particle sorting (AVPS) has recently been shown to be effective at sorting particles without particles contacting surfaces. The technique relies on turning a free jet sharply without extended control surfaces. The flow turning results in a balance of particle inertia and several forces (pressure, drag, added mass, and body forces) that depend on particle size and density. The present paper describes a theoretical study of particle sorting in a turning flow. The purpose of this study is to extend AVPS to parameter spaces other than those that are currently under investigation. Spherical particles are introduced into a turning flow in which the velocity magnitude increases like r. The trajectory of each particle is calculated using the particle equation of motion with drag laws that are appropriate for various Knudsen number regimes. Large data sets can be collected rapidly for various particle sizes, densities, turning radii, flow speeds, and fluid properties. Ranges of particle sizes that can be sorted are determined by finding an upper bound (where particles move in a straight line) and a lower bound (where particles follow flow streamlines). It is found that the size range of particles that can be sorted is larger for smaller turning radii, and that the range moves toward smaller particles as the flow speed and the particle-to-fluid density ratio are increased. Since this flow is laminar and 2-D, and particle loading effects are ignored, the results represent a “best case” scenario.

scholarly journals Space-Time Cube and Mixed Reality – New Approaches to Support Understanding Historical Landscape Changes

2019 ◽  
Vol 2 ◽  
pp. 1-7
Author(s):  
Mathias Jahnke ◽  
Edyta P. Bogucka ◽  
Maria Turchenko
Keyword(s):  
Cultural Landscape ◽  
Mixed Reality ◽  
New Technology ◽  
Space Time ◽  
Field Of View ◽  
Landscape Changes ◽  
Huge Amount ◽  
Visual Variables ◽  
Spatio Temporal ◽  
Microsoft Hololens

<p><strong>Abstract.</strong> Mixed reality is a rather new technology but came to its nowadays success through the availability of devices like Microsoft HoloLens which easily support the users and developers to use such devices. Therefore, visualization specialists like cartographers paid attention due to interaction possibilities such devices provide. In particular, to utilize the huge amount of opportunities such device gave. The applicability within the cartographic domain needs to be further investigated.</p><p>The main goal of this contribution is to evaluate the applicability of a mixed reality device in the domain of spatio-temporal representations on the example of the space-time cube to show cultural landscape changes. The hologram of the space-time cube provides the changes of the Royal Castle in Warsaw and their surrounding elements. The hologram therefore incorporated the different buildings of the castle, space-time prisms and space-time links to connect building elements over the years. The visual variables colour hue, colour value and transparency are mainly used to feature distinguishable space-time prisms and to show the space-time links. Different colour schemes are developed which features the characteristics of a mixed reality device. The possibilities of input actions are ranging from gaze/head movement, to gesture and voice.</p><p>The usability evaluation of the mixed reality hologram showed the overall comfort of interactions, perception of the visual components of the space-time cube and determines advantageous features and limitations of the technology. Most of the found limitations are connected to current devices, like e.g. resolution or field of view. An important aspect which came out is, that the experience the user has which such devices/technology plays an important role in successfully use and knowledge discovery from such applications.</p>

scholarly journals IMPLEMENTASI APLIKASI SOFTWARE NATURAL NETWORK MENDETEKSI TINGKATAN SERANGAN DDOS PADA JARINGAN KOMPUTER

2021 ◽  
Vol 14 (2) ◽  
pp. 268-277
Author(s):  
Etza nofarita
Keyword(s):  
Information System ◽  
Network Security ◽  
Computer Network ◽  
Large Data ◽  
Small Data ◽  
Network System ◽  
Security Issues ◽  
Or Groups ◽  
Computer Network Security ◽  
Damage Data

Security issues of a system are factors that need to be considered in the operation of information systems, which are intended to prevent threats to the system and detect and correct any damage to the system. Distributed Denial of Services (DDOS) is a form of attack carried out by someone, individuals or groups to damage data that can be attacked through a server or malware in the form of packages that damage the network system used. Security is a mandatory thing in a network to avoid damage to the data system or loss of data from bad people or heckers. Packages sent in the form of malware that attacks, causing bandwidth hit continuously. Network security is a factor that must be maintained and considered in an information system. Ddos forms are Ping of Death, flooding, Remote controled attack, UDP flood, and Smurf Attack. The goal is to use DDOS to protect or prevent system threats and improve damaged systems. Computer network security is very important in maintaining the security of data in the form of small data or large data used by the user.

scholarly journals Optimal Purely Functional Priority Queues

1996 ◽  
Vol 3 (37) ◽  
Author(s):  
Gerth Stølting Brodal ◽  
Chris Okasaki
Keyword(s):  
Data Structure ◽  
Higher Order ◽  
Priority Queues ◽  
Worst Case ◽  
Minimum Element ◽  
Asymptotically Optimal ◽  
Running Time ◽  
Recursive Structures ◽  
Functional Setting

Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert, and meld in O(1) worst-case time, and deleteMin in O(log n) worst-case time. These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt<br />Brodal's data structure to a purely functional setting. In doing so, we both simplify the data structure and clarify its relationship to the binomial queues of Vuillemin, which support all four operations in O(log n) time. Specifically, we derive our implementation from binomial queues in three steps: first, we reduce the running time of insert to O(1) by eliminating the possibility of cascading links; second, we reduce the running time of findMin to O(1) by adding a global root to hold the minimum element; and finally, we reduce the running time of meld to O(1) by allowing priority queues to contain other<br />priority queues. Each of these steps is expressed using ML-style functors. The last transformation, known as data-structural bootstrapping, is an interesting<br />application of higher-order functors and recursive structures.

scholarly journals Shared Data Science Infrastructure for Genomics Data

2018 ◽  
Author(s):  
Hamid Bagher ◽  
Usha Muppiral ◽  
Andrew J Severin ◽  
Hridesh Rajan
Keyword(s):  
Data Science ◽  
Gene Annotation ◽  
Large Data ◽  
Biological Data ◽  
Genomic Research ◽  
Data Repository ◽  
Small Data ◽  
Data Repositories ◽  
Shared Data ◽  
Genome Assemblies

AbstractBackgroundCreating a computational infrastructure to analyze the wealth of information contained in data repositories that scales well is difficult due to significant barriers in organizing, extracting and analyzing relevant data. Shared Data Science Infrastructures like Boa can be used to more efficiently process and parse data contained in large data repositories. The main features of Boa are inspired from existing languages for data intensive computing and can easily integrate data from biological data repositories.ResultsHere, we present an implementation of Boa for Genomic research (BoaG) on a relatively small data repository: RefSeq’s 97,716 annotation (GFF) and assembly (FASTA) files and metadata. We used BoaG to query the entire RefSeq dataset and gain insight into the RefSeq genome assemblies and gene model annotations and show that assembly quality using the same assembler varies depending on species.ConclusionsIn order to keep pace with our ability to produce biological data, innovative methods are required. The Shared Data Science Infrastructure, BoaG, can provide greater access to researchers to efficiently explore data in ways previously not possible for anyone but the most well funded research groups. We demonstrate the efficiency of BoaG to explore the RefSeq database of genome assemblies and annotations to identify interesting features of gene annotation as a proof of concept for much larger datasets.

Sign in / Sign up

Export Citation Format

Share Document