Mathematics and Computer Science

 

Recent Submissions

  • LIPS: Learning based indoor positioning system using mobile phone-based sensors 

    Mascharka, David; Manley, Eric (2016-01)
    In this paper we investigate the problem of localizing a mobile device based on readings from its sensors utilizing machine learning methodologies. We consider a real world environment, collect a dense set of 3110 datapoints, ...

  • Video-Based Instruction For Introductory Computer Programming 

    Manley, Eric D.; Urness, Timothy (CCSC, 2014-05)
    Video replacement of in-­person lecture is finding its way into more and more computer science education settings such as inverted classrooms, massive open online courses, online/distance learning, and programming camps. ...

  • Multicast Network Coded Flow In Grid Graphs 

    Manley, Eric D.; Gormley, John (MICS, 2014-04)
    Network coding, a relatively new paradigm for transmitting information through communication networks, allowing intermediate nodes in the network to combine data received on separate incoming channels before transmitting ...

  • Low Complexity All-Optical Network Coder Architecture 

    Manley, Eric D. (ICNC, 2014-02)
    Network coding, a networking paradigm in which different pieces of data are coded together at various points along a transmission, has been proposed for providing a number of benefits to networks including increased ...

  • Generating Interest In Computer Science Through Middle-School Android Summer Camps 

    Manley, Eric D.; Urness, Timothy (CCSC, 2013-05)
    We conducted a week-long summer camp to promote interest in computer science among middle-school students. The camp primarily used self-paced video tutorials to teach programming concepts using the App Inventor for Android ...

  • On The Integral Coding Advantage In Unit Combination Networks 

    Manley, Eric D.; Holcomb, David; Grout, Jason; Hoyer, Alex (2012-09)
    Network coding is a networking paradigm which allows network nodes to combine different pieces of data at various steps in the transmission rather than simply copying and forwarding the data. Network coding has various ...

  • Classifying Networks For Network Coding 

    Manley, Eric D.; Janssen, William (MICS, 2011-04)
    Network coding is a relatively recent development in the realm of maximizing information transfer in communications and computer networks. Traditional networks operate by simply storing and forwarding data along. Network ...

  • Building A Thriving CS Program In A Small Liberal Arts College 

    Manley, Eric D.; Urness, Timothy (CCSC, 2011)
    In this paper we describe several techniques that have helped increase enrollment in the computer science program from 23 computer science majors in 2008 to 42 computer science majors in 2010 – an increase of 82.6%. We ...

  • Design Of An All-Optical WDM Lightpath Concentrator 

    Manley, Eric D.; Saha, Shivashis; Deogun, Jitender S. (PDCS, 2010-11)
    A design of a nonblocking, all-optical lightpath concentrator using wavelength exchanging optical crossbars and WDM crossbar switches is presented. The proposed concentrator is highly scalable, cost-efficient, and can ...

  • Selection Of Switching Sites In All-Optical Network Topology Design 

    Manley, Eric D.; Saha, Shivashis; Deogun, Jitender S. (PDCS, 2010-11)
    In this paper, we consider the problem of topology design for both unprotected and one-link protected all-optical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The ...

  • All-Optical Network Coding 

    Manley, Eric D.; Deogun, Jitender S.; Xu, Lisong; Alexander, Dennis R. (2010-04)
    In this paper, we investigate the application of network coding to all-optical networks from both the algorithmic and infrastructural perspectives. We study the effectiveness of using network coding for optical-layer ...

  • "Hierarchical routing in sensor networks using κ-dominating sets " 

    Rieck, Michael Q.; Dhar, Subhankar (Springer-Verlag, 2005)
    For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a ...

  • "Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets" 

    Rieck, Michael Q.; Pai, Sukesh; Dhar, Subhankar (Elsevier Science, Inc., 2005-04-22)
    This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), ...

  • "On the Taketa bound for normally monomial p-groups of maximal class" 

    Keller, Thomas Michael; Ragan, Dustin; Tims, Geoffrey T. (Elsevier Science, 2004-07-15)
    A longstanding problem in the representation theory of finite solvable groups, sometimes called the Taketa problem, is to find strong bounds for the derived length dl(G) in terms of the number |cd(G)| of irreducible character ...

  • "Inertia of the stein transformation with respect to some nonderogatory matrices" 

    DeAlba, Luz M. (Elsevier Science, 1996-07)
    Let A be an n-by-n nonderogatory matrix all of whose eigenvalues lie on the unit circle, and let and be nonnegative integers with + = n. Let ′ and ′ be positive integers and ′ a nonnegative integer with ′ + ′ + ...

  • "Distributed routing schemes for ad hoc networks using d-SPR sets" 

    Dhar, Subhankar; Rieck, Michael Q.; Pai, Sukesh; Kim, Eun Jik (Elsevier Science, 2004-10)
    In this paper, we propose several new distributed algorithms for producing sets of nodes that can be used to form backbones of an ad hoc wireless network. Our focus is on producing small sets that are d-hop connected and ...