Mathematics and Computer Science
Browse by
Recent Submissions

LIPS: Learning based indoor positioning system using mobile phonebased sensors
(201601)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, ... 
VideoBased Instruction For Introductory Computer Programming
(CCSC, 201405)Video replacement of inperson 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
(MICS, 201404)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 AllOptical Network Coder Architecture
(ICNC, 201402)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 MiddleSchool Android Summer Camps
(CCSC, 201305)We conducted a weeklong summer camp to promote interest in computer science among middleschool students. The camp primarily used selfpaced video tutorials to teach programming concepts using the App Inventor for Android ... 
On The Integral Coding Advantage In Unit Combination Networks
(201209)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
(MICS, 201104)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
(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 AllOptical WDM Lightpath Concentrator
(PDCS, 201011)A design of a nonblocking, alloptical lightpath concentrator using wavelength exchanging optical crossbars and WDM crossbar switches is presented. The proposed concentrator is highly scalable, costefficient, and can ... 
Selection Of Switching Sites In AllOptical Network Topology Design
(PDCS, 201011)In this paper, we consider the problem of topology design for both unprotected and onelink protected alloptical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The ... 
AllOptical Network Coding
(201004)In this paper, we investigate the application of network coding to alloptical networks from both the algorithmic and infrastructural perspectives. We study the effectiveness of using network coding for opticallayer ... 
"Hierarchical routing in sensor networks using κdominating sets "
(SpringerVerlag, 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 kSPR sets. Such a set can serve as a ... 
"Distributed routing algorithms for multihop ad hoc networks using dhop connected ddominating sets"
(Elsevier Science, Inc., 20050422)This paper describes a distributed algorithm (generalized dCDS) for producing a variety of ddominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary dCDS), ... 
"On the Taketa bound for normally monomial pgroups of maximal class"
(Elsevier Science, 20040715)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"
(Elsevier Science, 199607)Let A be an nbyn 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 dSPR sets"
(Elsevier Science, 200410)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 dhop connected and ...