Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 21 of 21

Full-Text Articles in Entire DC Network

Ops Bus Scheduling: A Heuristic Approach To A Three-Tier Multi-Depot Vehicle Routing Problem With Inter-Depot Routes, Jordan Sahs, Brad Tuttle Mar 2023

Ops Bus Scheduling: A Heuristic Approach To A Three-Tier Multi-Depot Vehicle Routing Problem With Inter-Depot Routes, Jordan Sahs, Brad Tuttle

Mathematics Theses, Dissertations, Research and Student Creative Activity

Omaha Public Schools (OPS) currently uses a Two-Tier Bus Transportation System and is investigating whether switching to a Three-Tier Bus Transportation System would be cost effective by reducing the number of buses and bus drivers OPS uses. This project aims to develop an algorithm that would allow OPS to test whether a Three-Tier system is more cost effective. The “Bus Scheduling Project” is composed of two different software components: a geographical analyzer and a heuristic bus route generator.


Accuracy Of The Teacherinsight Online Perceiver Tool In Determining The Effectiveness Of High Rated And Low Rated Math And Science New Hire Teachers Following One Year And Three Years Of Single School District Employment, Nicole A. Regan Dec 2011

Accuracy Of The Teacherinsight Online Perceiver Tool In Determining The Effectiveness Of High Rated And Low Rated Math And Science New Hire Teachers Following One Year And Three Years Of Single School District Employment, Nicole A. Regan

Student Work

The purpose of this study is to explore the accuracy of the TeacherInsight online perceiver tool (Gallup University, 2007) in determining the effectiveness of high rated (n =14) and low rated ( n =36) math and science new hire teachers summative appraisal ratings, completed graduate coursework, and retention status following one year and three years of single school district employment.


The Effects Of Positive School Engagement On Math And Reading Achievement In Midwestern Suburban Middle School Students, Heather C. Phipps Oct 2010

The Effects Of Positive School Engagement On Math And Reading Achievement In Midwestern Suburban Middle School Students, Heather C. Phipps

Student Work

Ensuring high academic achievement in schools with increasingly diverse students is a challenge. Assessing student engagement can be a powerful tool in predicting potential success and identifying students who may need additional support. Positive youth development theory supports focusing on a young person’s strengths, and an asset-based approach to education can raise student achievement. During the 2007-2008 school year, seventh grade students were assessed for school engagement using the Developmental Assets Profile. Students were identified as either not engaged or engaged in school. For two years, achievement in reading and math as well as grade point average was collected and …


Dynamics Of Random Boolean Networks Governed By A Generalization Of Rule 22 Of Elementary Cellular Automata., Gary L. Beck Dec 2006

Dynamics Of Random Boolean Networks Governed By A Generalization Of Rule 22 Of Elementary Cellular Automata., Gary L. Beck

Student Work

This study considers a simple Boolean network with N nodes, each node's state at time t being determined by a certain number of k parent nodes. The network is analyzed when the connectivity k is fixed or variable. This is an extension of a model studied by Andrecut [4) who considered the dynamics of two stochastic coupled maps. Making use of the Boolean rule that is a generalization of Rule 22 of elementary cellular automata, a generalization of the formula for providing the probability of finding a node in state 1 at a time t is determined and used to …


Nonlinear Multiregressions Based On Choquet Integral For Data With Both Numerical And Categorical Attributes., Jin Hui Aug 2005

Nonlinear Multiregressions Based On Choquet Integral For Data With Both Numerical And Categorical Attributes., Jin Hui

Student Work

Based on generalized Choquet integrals with respect to signed fuzzy measures, a model of nonlinear multiregression that can catch the interaction among predictive attributes toward the objective attribute can be established. In this model, some predictive attributes are numerical while the others are categorical. A numericalization technique is adopted to project each state of a categorical attribute that has more than two states to a multi-dimensional space optimally through a genetic algorithm, in which some regression coefficients are determined from data. To reduce the complexity of the genetic algorithm, the other regression coefficients such as the values of the signed …


Elementary Cellular Automata, Fractal Dimensions And Mutual Information., Naomi Kochi Aug 2005

Elementary Cellular Automata, Fractal Dimensions And Mutual Information., Naomi Kochi

Student Work

We explore a quantitative description of Wolfram's classification of elementary cellular automata based on fractal dimensions. We find the· fractal dimension to be a global measure in classifying elementary cellular automata independent of initial conditions. On the other hand, the results of our analysis of rules in Class 3 numerically confirm the existence of a wide range of dynamics among rules in Class 3. The main reason for this is due to the fact that the rules with the Sierpinski structure in Class 3 have the capacity to behave like rules in Class 2 depending on their initial conditions. Furthermore, …


Solving Nonlinear Optimization Problems That Have A Nondifferentiable Objective Function By Using A Pseudo Gradient Search., Marie Louise Spilde May 2005

Solving Nonlinear Optimization Problems That Have A Nondifferentiable Objective Function By Using A Pseudo Gradient Search., Marie Louise Spilde

Student Work

The gradient search fails in an optimization problem where the objective function is not differentiable--such as nonlinear multiregressions based on generalized Choquet integrals. In cases such as this, we may replace the gradient search with a pseudo gradient search to determine the optimal search direction. The pseudo gradient can be obtained algorithmically from a data set containing the objective attribute and relevant arguments of the objective function. The algorithm for the pseudo gradient search is based on a neural network model which uses statistical techniques such as root mean square error to determine the optimal search direction and the optimal …


Noise Reduction In Time Series Data From Dynamical Systems., Richard Lyman Warr Apr 2005

Noise Reduction In Time Series Data From Dynamical Systems., Richard Lyman Warr

Student Work

Introduction: The objective of this thesis is to determine if the amount of noise in the observed time series data has affected the outcome of the chaotic descriptors. To thoroughly analyzed this problem I will first introduce how the data was obtained, next how to find the chaotic descriptors, and then discuss and apply noise reduction techniques.


Study On Dynamical Process In Boolean Network., Masahiko Kimura May 2004

Study On Dynamical Process In Boolean Network., Masahiko Kimura

Student Work

This thesis began with a question about how the human brain works and then two type of Boolean Networks , 1-D Cellular Automata and Associate Memory Model are chosen to explore this question. In the first part of this thesis the computability of 1-D Cellular Automata is studied by inventing a simple model, 3 colored balls model and several logical gates are implemented in its space. Although this model is so simple, by implementing three important logical gates, "NOT", "AND" and "OR", 3 colored balls model is proved to be computational universal. Since a common property " annihilation" is seen …


Reduction Of Boolean Networks To Scalar Form., Christopher Farrow May 2002

Reduction Of Boolean Networks To Scalar Form., Christopher Farrow

Student Work

This thesis explores methods for finding cycles in synchronous Boolean networks. There is a brief survey the functional iteration method for finding cycles in a synchronous Boolean network. This method can, in theory, completely describe a Boolean network, but is inefficient and unfeasible in practice, especially for large networks. A more direct computational approach, referred to as the computational iterative method, is introduced and the results of this method as applied to three node synchronous Boolean networks are presented. This analysis reveals interesting behavior about these simple networks that in some cases can be generalized to networks of any size. …


Approximating Eigenvalues For Double Well Potentials., Chad Fulk Jun 2001

Approximating Eigenvalues For Double Well Potentials., Chad Fulk

Student Work

One dimensional double well potentials usually refer to those potentials which have two equivalent or non-equivalent minima. They have been used to model diverse systems ranging from the electronic structure of diatomic molecules to electron-lattice coupling in high temperature superconductors [1][2]. However, one difficulty to the utility of these models is that exact analytical solutions for almost all double well potentials have not been found, in spite of the fact that this type of potential is constantly utilized as an illustra­tive example in the literature. Despite intensive research into this problem, only a few types of double wells have been …


On The Relationships Between Linear Extensions And Multiprocessor Scheduling., Jodi Wineman Jul 1999

On The Relationships Between Linear Extensions And Multiprocessor Scheduling., Jodi Wineman

Student Work

Scheduling is a classical field with many challenging problems and interesting results. A scheduling problem emerges wherever there is a choice as to the order in which a number of tasks can be performed and/or the assignment of the tasks to the available resources for processing . In this thesis, we focus on a version of the scheduling problem that deals with scheduling precedence constrained tasks onto the multi processors of a given distributed system with the goal of minimizing the schedule time. This scheduling problem has been proven to be NP-hard even when several restrictions are applied. This implies …


Chaotic Behaviour In Three Dimensional Quadratic Systems., Fu Zhang Aug 1996

Chaotic Behaviour In Three Dimensional Quadratic Systems., Fu Zhang

Student Work

This thesis presents a part of the proof of that there is no chaos in three dimensional autonomous quadratic systems of four terms with one nonlinear term and without constant terms. The first step of the proof is identifying equivalent systems from all possible systems by the 3rd order permutation group and as a result 138 inequivalent patterns are found(refer to appendix A). And then for the solvable systems we show how to solve them. Some of the nonsolvable systems turn out to be 2nd order autonomous systems and they are resolved by analyzing the monotonicity of the solutions and/or …


Codes Which Are Ideals In Abelian Group Algebras., Patrick R. Coulton Jul 1978

Codes Which Are Ideals In Abelian Group Algebras., Patrick R. Coulton

Student Work

Take G to be any multiplicative group. Let [G] = and choose q to be a prime such that n and q are relatively prime. Let K denote the field of order q (i.e. GF(q)-K). We form the group algebra KG defined to be the set of all formal sums {mathematical formula} with multiplication and addition defined by {series of formulas}. A straightforward application of these definitions yields that KG is an associative algebra with multiplicative identity. In fact, the identity in the group G acts as the multiplicative identity in KG. Definition 1.1.1. A ring is said to satisfy …


Investigation Of Sufficient Conditions For A Non-Regular Problem In The Calculus Of Variations., Sam Waldman Mar 1973

Investigation Of Sufficient Conditions For A Non-Regular Problem In The Calculus Of Variations., Sam Waldman

Student Work

In his paper, Ewing has established sufficient conditions for a non-regular problem in the calculus of variations. In chapter 2, we shall discuss his method. In chapter 3, we will provide an example in which the main result of [1] will apply. In this chapter, we shall state for your convenience some definitions, theorems and conditions from [2]. We will suppose that there is a region of R of xyz 1/Space in which the integrand function f(x,y,z) has continuous partial derivatives up to and including those of the fourth order. The general problem of the calculus of variations is finding …


A Topology On The Fundamental Group., Daniel William Atkinson Aug 1972

A Topology On The Fundamental Group., Daniel William Atkinson

Student Work

For an arbitrary topological space algebraic topology prescribes a construction for a fundamental group. There is a natural way of imposing a topology on this set. We will examine this construction and the topological space which results. We use the following notation and definitions: 1. I f X and Y are topological spaces and ACX, BCY and if f:X+Y is a map, we write f: (X,A)➔(Y,B) if f(A)cB. 2. (Y,B)CX,A)={f: (X,A)+(Y,B)I f is continuous}. 3. 1=[0,1], the closed unit interval; i={O,l}, the points O and 1. 4. If X is a topological space and a£X, then R is an equivalence …


The Axiom Of Choice For Countable Sets., Roger L. Mansfield Jul 1972

The Axiom Of Choice For Countable Sets., Roger L. Mansfield

Student Work

In this thesis axioms for set theory will be presented which include the well-known axiom of choice. These axioms, together with their associated primitives, defined terms, and theorems will be referred to as the BGN (for Bernays, Godel, and von Neumann) theory or sets, or just BGN. BGN, without the axiom of' choice and theorems requiring it, will be denoted by BGN 1. It will be shown that if a proposition attributing a property to countable sets can be proved in BGN, then it can be proved in BGN, by showing that the axiom of choice (Zermelo’s form) when stated …


Wc Spaces: Between T[Subscript 1] And T[Subscript 2]., Walter L. Rice Mar 1972

Wc Spaces: Between T[Subscript 1] And T[Subscript 2]., Walter L. Rice

Student Work

In this paper a separation property is introduced which is a con­sequence of the Hausdorff separation axiom r2 , but not conversely. This property is characterized by a convergence property of neighborhood filterbases of points in a topological space which is defined and shown to be intermediate to standard convergence and accumulation of neighbor­hood filterbases.


On Zeros Of Solution Of Self-Adjoint Differential Equations., Marsha J. Hunter Jun 1970

On Zeros Of Solution Of Self-Adjoint Differential Equations., Marsha J. Hunter

Student Work

This study will deal with the zeros of solutions of self-adjoint linear differential equations of second order. In the following we consider some def1n1t1ons and theorems that relate to ordinary differential equations. Definition 1.1. A homogeneous linear differential equation of order n has the form a0y{n ) + a1y(n-l) + ••• +any= 0 where a0 �� 0 and e��ch a1 = a 1(x) is continuous on an interval (a,b), 1 = 1,2, ••• ,n. Definition 1.2. If L(y) 1s a linear operator and L(y) = a0(x)y''(x) + a1(x)y'(x) + a2 (x)y(x}, then 1ts adjoint, L(z}, 1s denoted by [��0(x)z(x)] '' …


Eigenvalues Of The Mean Sigma And Weighted Mean Integral Operators Related To A Gronwall Inequality., Jeffrey R. Kroll Nov 1969

Eigenvalues Of The Mean Sigma And Weighted Mean Integral Operators Related To A Gronwall Inequality., Jeffrey R. Kroll

Student Work

In their paper, Schmaedeke and Sell have established a Gronwall inequality which holds for the Stieiltjes mean sigma and Dushnik iptegrals. In Chapter 2, we shall investigate an eigenvalue problem related to the Gronwall inequality for the Stieltjes mean sigma integral. In Chapter 3, we shall extend the results in [1] to the weighted refinement Stieltjes integral introduced by F. M. Wright and J. D. Baker [2].


Some Results Of Generalized Limits., Suzanne R. Neu Jun 1969

Some Results Of Generalized Limits., Suzanne R. Neu

Student Work

In 1915 E.H. Moore introduced the following extension of the calculus limit. If D is a set of general elements p and G is the set of all finite classes s of Elements p, then a number-valued function f = (f(s)/s) on the domain S converges to a number a if a positive implies there exists se in G such that scc implies |f(s) -a|