Browsing Computer Science Masters Papers by Subject "Computer algorithms."

Now showing items 1-20 of 22

    • Algorithms for Coverage Improvement in a Sensor Network 

      Maddi, Sunil Reddy (North Dakota State University, 2011)
      Sensors are devices which have the ability to receive and respond to a signal. These sensors, when used as a group, form a sensor network. Sensors in a sensor network can communicate and transmit data. In the early stages ...

    • Automated Detection of Acute Leukemia Using K-Means Clustering Algorithm 

      Arya, Minakshi (North Dakota State University, 2019)
      Detection of ALL can be done through the analysis of white blood cells (WBCs) called leukocytes. Usually, the analysis of blood cells is performed manually by skilled operators, have numerous drawbacks, such as slow analysis, ...

    • Classification Algorithms Applied to a Brain Computer Interface System Based On P300 

      Gaur, Himanshu (North Dakota State University, 2017)
      A BCI or Brain Computer Interface is defined as a method of communication that converts neural activities generated by brain of living being (without the use of peripheral muscles and nerves) into computer commands or other ...

    • Design and Evaluation of Two Hybrid Genome Assembly Approaches Using Illumina, Roche 454, and PacBio Datasets 

      Sun, Liren (North Dakota State University, 2016)
      The assembly of next-generation sequencing reads is one of the most challenging and important tasks in bioinformatics. There are many different types of assembly algorithms and programs that have been developed to assemble ...

    • Deterministic Greedy Algorithms for Optimal Sensor Placement 

      Chintamaneni, Venkata Santosh (North Dakota State University, 2012)
      A sensor is a device which can be sensitive to any physical stimulus, such as light, heat, or a particular motion, and responds with a respective impulse. A graph is an abstract representation for a set of objects of any ...

    • Disease Similarity Using Biological Module Dysregulation Profile 

      Zaman, Eshita (North Dakota State University, 2016)
      Diseases can be grouped according to phenotypic and genotypic similarities. Gene expression and micro-RNA data paved the way to look inside the genetic coding and classify diseases accurately. Modern system biology seeks ...

    • The Grid Scan Heuristic for Extending Lifetime in Wireless Sensor Networks 

      Pachva, Srikar (North Dakota State University, 2011)
      Wireless Sensor Networks, consisting of sensing devices which sense the environment and communicate information among each other, is an emergent field in wireless networking with many potential applications. Efficiency of ...

    • A Map Reduce Approach of K-Means++ Algorithm with Initial Equidistant Centers 

      Bhattacharyya, Krittika (North Dakota State University, 2015)
      Data clustering has been received considerable attention in many applications, such as data mining, document retrieval, image segmentation and pattern classification. The enlarging volumes of information emerging by the ...

    • Mining Association Rules in Cloud 

      Roy, Pallavi (North Dakota State University, 2012)
      The association rule mining was implemented in Hadoop. An association rule mining helps in finding relation between the items or item sets in the given data. The performance of the algorithm was evaluated by testing it in ...

    • Mining Communities from Multi-Layered Graphs 

      Chao, Meng (North Dakota State University, 2013)
      Identifying communities from networks has been a subject of great interest in Biological and Social network analysis. Finding communities can help with tasks such as identifying and fighting disease. Using graphs to represent ...

    • Mining Frequent Coherent Patterns from Weighted Graphs 

      Ahmed, Syed Kutub Uddin (North Dakota State University, 2014)
      Current research on network analysis; such as community detection, pattern mining and many other graph mining application mostly focus on large social or biological networks. Such experiments may find interesting patterns ...

    • A Network Optimization Solver for Routing in Wireless Sensor Networks 

      Samaraweera, Shaminda Asela (North Dakota State University, 2010)
      Many wireless sensor network applications require energy efficient communication between nodes in the network. Sensor networks are of limited resources. Due to this limitation, the routing between the nodes is one of the ...

    • Optimization Modeling for Wireless Sensor Scheduling 

      Chekuri, Srujan Kumar Raju (North Dakota State University, 2013)
      Wireless sensor networks, consisting of sensing devices which sense the environment and communicate information among each other, is an emergent field in wireless networking with many potential applications. The efficiency ...

    • Parallel Particle Swarm Optimization 

      Manne, Priyanka (North Dakota State University, 2016)
      PSO is a population based evolutionary algorithm and is motivated from the simulation of social behavior, which differs from the natural selection scheme of genetic algorithms. It is an optimization technique based on swarm ...

    • Performance Comparison of Apache Spark MLlib 

      Sharma, Pallavi (North Dakota State University, 2018)
      This study makes an attempt to understand the performance of Apache Spark and the MLlib platform. To this end, the cluster computing system of Apache Spark is set up and five supervised machine learning algorithms (Naïve-Bayes, ...

    • Real Parameter Optimization Using Differential Evolution 

      Dawar, Deepak (North Dakota State University, 2013)
      Over recent years, Evolutionary Algorithms (EA) have emerged as a practical approach to solve hard optimization problems presented in real life. The inherent advantage of EA over other types of numerical optimization methods ...

    • REND: Reliable and Energy-Efficient Node-Disjoint Paths in Wireless Sensor Networks 

      Yanteru, Siva (North Dakota State University, 2010)
      In wireless sensor networks, finding most reliable and most efficient paths between source node and destination node is considered NP hard problem. We can increase reliability by ability to find node-disjoint alternate ...

    • Sentiment Analysis of Global Warming Using Twitter Data 

      Mucha, Nithisha (North Dakota State University, 2018)
      Global warming or climate change is one of the most discussed topics of the decade. Some people think global warming is a severe threat to the planet whereas some people think, it is a hoax. The goal of this paper is to ...

    • Sentiment Analysis on Twitter Data Using Different Algorithms 

      Nazma, Monzuma (North Dakota State University, 2018)
      Sentiment analysis is the process of determining opinion expressed in a text, or an estimation of emotion related to the certain topic if it is negative, positive or neutral. The massive growth of social media, Twitter has ...

    • Shortest Path in a Wireless Sensor Network with Multiple Sensor Failures 

      Poreddy, Sandeep Reddy (North Dakota State University, 2011)
      This paper shows how a shortest path can be obtained in a wireless sensor network, between a source sensor and a destination sensor, in a hop-by-hop fashion, considering multiple sensor failures along the path of data ...