Matching Items (22)

136617-Thumbnail Image.png

Impromp2: An Event Searching Application

Description

We created an Android application, Impromp2, which allows users to search for and save events of interest to them in the Phoenix area. The backend, built on the Parse platform,

We created an Android application, Impromp2, which allows users to search for and save events of interest to them in the Phoenix area. The backend, built on the Parse platform, gathers events daily using Web services and stores them in a database. Impromp2 was designed to improve upon similarly-purposed apps available for Android devices in several key ways, especially in user interface design and data interaction capability. This is a full-stack software project that explores databases and their performance considerations, Web services, user interface design, and the challenges of app development for a mobile platform.

Contributors

Created

Date Created
  • 2015-05

136804-Thumbnail Image.png

Investigation of User Interface Theory

Description

The quality of user interface designs largely depends on the aptitude of the designer. The ability to generate mental abstract models and characterize a target user audience helps greatly when

The quality of user interface designs largely depends on the aptitude of the designer. The ability to generate mental abstract models and characterize a target user audience helps greatly when conceiving a design. The dry cleaning point-of-sale industry lacks quality user interface designs. These impaired interfaces were compared with textbook design techniques to discover how applicable published interface design concepts are in practice. Four variations of a software package were deployed to end users. Each variation contained different design techniques. Surveyed users responded positively to interface design practices that were consistent and easy to learn. This followed textbook expectations. Users however responded poorly to customization options, an important feature according to textbook material. The study made conservative changes to the four interface variations provided to end-users. A more liberal approach may have yielded additional results.

Contributors

Agent

Created

Date Created
  • 2014-05

Event Searching Web site

Description

Fiddlevent is an event searching website written in Ruby on Rails. Fiddlevent enables any person to go online and find local events that interest him. Fiddlevent also enables merchants to

Fiddlevent is an event searching website written in Ruby on Rails. Fiddlevent enables any person to go online and find local events that interest him. Fiddlevent also enables merchants to post their events online. Fiddlevent explores all challenges of website development, such as project management, database design, user interface design, deployment and the software development lifecycle. Fiddlevent aims to utilize best practices for website and software development.

Contributors

Agent

Created

Date Created
  • 2013-05

137462-Thumbnail Image.png

Analysis of Software Testing to Identify Optimal Techniques for Web Applications

Description

Web-application development constantly changes \u2014 new programming languages, testing tools and programming methodologies are often proposed. The focus of this project is on the tool Selenium and the fairly new

Web-application development constantly changes \u2014 new programming languages, testing tools and programming methodologies are often proposed. The focus of this project is on the tool Selenium and the fairly new technique known as High Volume Automated Testing (HVAT). Both of these techniques were used to test the Just-in-Time Teaching and Learning Classroom Management System software. Selenium was used with a black-box testing technique and HVAT was employed in a white-box testing technique. Two of the major functionalities of this software were examined, which include the login and the professor functionality. The results of the black-box testing technique showed parts of the login component contain bugs, but the professor component is clean. HVAT white-box testing revealed error free implementation on the code level. We present an analysis on a new technique for HVAT testing with Selenium.

Contributors

Agent

Created

Date Created
  • 2013-05

135806-Thumbnail Image.png

How to Design, Build, and Run a Website: The Card Trick Quilters Website

Description

It is important for organizations and businesses to have some kind of online presence, as there are enormous benefits, including utilizing the power of web languages to provide services for

It is important for organizations and businesses to have some kind of online presence, as there are enormous benefits, including utilizing the power of web languages to provide services for people. However, creating a website is difficult, and often expensive. While successful businesses can use their profits to develop a costly website, organizations are not so lucky and can't afford to pay large amounts of money for theirs. Thus, the goal of this project was to provide a complete website to the Card Trick Quilters organization found in Show Low, Arizona. The website serves as both a learning experience, to see exactly what it takes to construct a website from the ground up, and a service project that will provide the Card Trick Quilters with a website that performs various services for its members, with functionality that is completely unique to the Arizona quilting community at large. The creation of the website required learning several different skills in regards to web design, such as databases, scripting languages, and even elements of graphic design. The uniqueness of the website comes from the creation of an online submission form for the annual quilt show hosted by the quilters, and an email reminder system where members of the community can submit their addresses and receive emails when there is an upcoming meeting. While there will no doubt be changes and improvements to the website in the future, the website is currently live and ready for the community to use.

Contributors

Created

Date Created
  • 2016-05

135380-Thumbnail Image.png

Exploring Computational Thinking in 9-12 Education: Developing a Computer Science Curriculum for Bioscience High School

Description

Bioscience High School, a small magnet high school located in Downtown Phoenix and a STEAM (Science, Technology, Engineering, Arts, Math) focused school, has been pushing to establish a computer science

Bioscience High School, a small magnet high school located in Downtown Phoenix and a STEAM (Science, Technology, Engineering, Arts, Math) focused school, has been pushing to establish a computer science curriculum for all of their students from freshman to senior year. The school's Mision (Mission and Vision) is to: "..provide a rigorous, collaborative, and relevant academic program emphasizing an innovative, problem-based curriculum that develops literacy in the sciences, mathematics, and the arts, thus cultivating critical thinkers, creative problem-solvers, and compassionate citizens, who are able to thrive in our increasingly complex and technological communities." Computational thinking is an important part in developing a future problem solver Bioscience High School is looking to produce. Bioscience High School is unique in the fact that every student has a computer available for him or her to use. Therefore, it makes complete sense for the school to add computer science to their curriculum because one of the school's goals is to be able to utilize their resources to their full potential. However, the school's attempt at computer science integration falls short due to the lack of expertise amongst the math and science teachers. The lack of training and support has postponed the development of the program and they are desperately in need of someone with expertise in the field to help reboot the program. As a result, I've decided to create a course that is focused on teaching students the concepts of computational thinking and its application through Scratch and Arduino programming.

Contributors

Agent

Created

Date Created
  • 2016-05

135236-Thumbnail Image.png

Tenga: A Case Study on Building Web Applications

Description

Tenga is an e-commerce demo web application for students studying Distributed Software Development and Software Integration and Engineering at Arizona State University (ASU). The application, written in C#, aims to

Tenga is an e-commerce demo web application for students studying Distributed Software Development and Software Integration and Engineering at Arizona State University (ASU). The application, written in C#, aims to empower students to understand how complex systems are build. Complementing the two courses taught at ASU, it seeks to demonstrate how the concepts taught in the two classes can be applied to the real world. In addition to the practical software development process, Tenga also bring in the topics that students are inexperienced with such as recommendation systems and ranking algorithms. Tenga is going to be used in classrooms to help students to learn fundamental issues in Web software development and software integration and to understand tools and skill sets required to built a web application.

Contributors

Created

Date Created
  • 2016-05

135246-Thumbnail Image.png

Automated Testing of Web Services

Description

The areas of cloud computing and web services have grown rapidly in recent years, resulting in software that is more interconnected and and widely used than ever before. As a

The areas of cloud computing and web services have grown rapidly in recent years, resulting in software that is more interconnected and and widely used than ever before. As a result of this proliferation, there needs to be a way to assess the quality of these web services in order to ensure their reliability and accuracy. This project explores different ways in which services can be tested and evaluated through the design of various testing techniques and their implementations in a web application, which can be used by students or developers to test their web services.

Contributors

Created

Date Created
  • 2016-05

135251-Thumbnail Image.png

Approaches to Minimum d-Degree Arrangement

Description

Many systems in the world \u2014 such as cellular networks, the post service, or transportation pathways \u2014 can be modeled as networks or graphs. The practical applications of graph algorithms

Many systems in the world \u2014 such as cellular networks, the post service, or transportation pathways \u2014 can be modeled as networks or graphs. The practical applications of graph algorithms generally seek to achieve some goal while minimizing some cost such as money or distance. While the minimum linear arrangement (MLA) problem has been widely-studied amongst graph ordering and embedding problems, there have been no developments into versions of the problem involving degree higher than 2. An application of our problem can be seen in overlay networks in telecommunications. An overlay network is a virtual network that is built on top of another network. It is a logical network where the links between nodes represent the physical paths connecting the nodes in the underlying infrastructure. The underlying physical network may be incomplete, but as long as it is connected, we can build a complete overlay network on top of it. Since some nodes may be overloaded by traffic, we can reduce the strain on the overlay network by limiting the communication between nodes. Some edges, however, may have more importance than others so we must be careful about our selection of which nodes are allowed to communicate with each other. The balance of reducing the degree of the network while maximizing communication forms the basis of our d-degree minimum arrangement problem. In this thesis we will look at several approaches to solving the generalized d-degree minimum arrangement d-MA problem where we embed a graph onto a subgraph of a given degree. We first look into the requirements and challenges of solving the d-MA problem. We will then present a polynomial-time heuristic and compare its performance with the optimal solution derived from integer linear programming. We will show that a simple (d-1)-ary tree construction provides the optimal structure for uniform graphs with large requests sets. Finally, we will present experimental data gathered from running simulations on a variety of graphs to evaluate the efficiency of our heuristic and tree construction.

Contributors

Created

Date Created
  • 2016-05