Physical Sciences and Mathematics Commons^™

Scaling A Dataflow Testing Methodology To The Multiparadigmworld Of Commercial Spreadsheets, Marc Fisher Ii, Gregg Rothermel, Tyler Creelan, Margaret Burnett

CSE Conference and Workshop Papers

Spreadsheets are widely used but often contain faults. Thus, in prior work we presented a data-flow testing methodology for use with spreadsheets, which studies have shown can be used cost-effectively by end-user programmers. To date, however, the methodology has been investigated across a limited set of spreadsheet language features. Commercial spreadsheet environments are multiparadigm languages, utilizing features not accommodated by our prior approaches. In addition, most spreadsheets contain large numbers of replicated formulas that severely limit the efficiency of data-flow testing approaches. We show how to handle these two issues with a new data-flow adequacy criterion and automated detection of …

Helping End-User Programmers “Engineer” Dependable Software, Gregg Rothermel

CSE Conference and Workshop Papers

Not long ago, most software was written by professional programmers, who could be presumed to have an interest in software engineering methodologies and in tools and techniques for improving software dependability. Today, however, a great deal of software is written not by professionals but by end-users, who create applications such as multimedia simulations, dynamic web pages, and spreadsheets. Applications such as these are often used to guide important decisions or aid in important tasks, and it is important that they be sufficiently dependable, but evidence shows that they frequently are not. For example, studies have shown that a large percentage …

The Performance Of Elliptic Curve Based Group Diffie-Hellman Protocols For Secure Group Communication Over Ad Hoc Networks, Yong Wang, Byrav Ramamurthy, Xukai Zou

CSE Conference and Workshop Papers

The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in …

Integrated Intermediate Waveband And Wavelength Switching For Optical Wdm Mesh Networks, Mengke Li, Byrav Ramamurthy

CSE Conference and Workshop Papers

As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the operational costs and to reduce the complexities and sizes of network components, e.g., optical cross-connects (OXCs). This paper considers the routing, wavelength assignment and waveband assignment (RWWBA) problem in a WDM network supporting mixed waveband and wavelength switching. First, the techniques supporting waveband switching are studied, where a node architecture enabling mixed waveband and wavelength switching is proposed. Second, to solve the RWWBA problem with reduced switching costs and improved network throughput, the cost savings and call blocking …

A Maximum-Likelihood Approach To Symbolic Indirect Correlation, Ashutosh Joshi, George Nagy, Daniel Lopresti, Sharad C. Seth

CSE Conference and Workshop Papers

Symbolic Indirect Correlation (SIC) is a nonparametric method that offers significant advantages for recognition of ordered unsegmented signals. A previously introduced formulation of SIC based on subgraph-isomorphism requires very large reference sets in the presence of noise. In this paper, we seek to address this issue by formulating SIC classification as a maximum likelihood problem. We present experimental evidence that demonstrates that this new approach is more robust for the problem of online handwriting recognition using noisy input.

A Cross-Layer Protocol For Wireless Sensor Networks, Ian F. Akyildiz, Mehmet C. Vuran, Ӧzgür B. Akan

CSE Conference and Workshop Papers

Severe energy constraints of battery-powered sensor nodes necessitate energy-efficient communication protocols in order to fulfill application objectives of wireless sensor networks (WSN). However, the vast majority of the existing solutions are based on classical layered protocols approach. It is much more resource-efficient to have a unified scheme which melts common protocol layer functionalities into a cross-layer module for resource-constrained sensor nodes. To the best of our knowledge, to date, there is no unified cross-layer communication protocol for efficient and reliable event communication which considers transport, routing, medium access functionalities with physical layer (wireless channel) effects for WSNs.
In this paper, …

An Interactive Constraint-Based Approach To Minesweeper, Ken Bayer, Josh Snyder, Berthe Y. Choueiry

CSE Conference and Workshop Papers

We present a Java applet that uses Constraint Processing (CP) to assist a human in playing the popular game Minesweeper. Our goal is to illustrate the power of CP techniques to model and solve combinatorial problems in a context accessible to the general public.

Minesweeper is a video game that has been included with Microsoft Windows since 1989. In this game, the player is presented with a grid of squares. Each of these squares may conceal a mine. When the player clicks on a square, it is revealed. If the square is a mine, the game is over. If the …

Spatio-Temporal Characteristics Of Point And Field Sources In Wireless Sensor Networks, Mehmet C. Vuran, Ӧzgür B. Akan

CSE Conference and Workshop Papers

Wireless Sensor Networks (WSN) are comprised of densely deployed sensor nodes collaboratively observing and communicating extracted information about a physical phenomenon. Dense deployment of sensor nodes makes the sensor observations highly correlated in the space domain. In addition, consecutive samples obtained by a sensor node are also temporally correlated for the applications involving the observation of the variation of a physical phenomenon. Based on the physical characteristics and dispersion pattern over the area, the phenomenon to be observed can be modeled as point source or field source. Clearly, understanding the spatio-temporal correlation characteristics of the point and field sources brings …

A New Cryptographic Scheme For Securing Dynamic Conferences In Data Networks, Sarang Deshpande, Ajay Todimala, Ravi K Balachandran, Byrav Ramamurthy, Xukai Zou, N. V. Vinodchandran

CSE Conference and Workshop Papers

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the …

Router And Firewall Redundancy With Openbsd And Carp, Garhan Attebury, Byrav Ramamurthy

CSE Conference and Workshop Papers

As more reliance is placed on computing and networking systems, the need for redundancy increases. The Common Address Redundancy Protocol (CARP) protocol and OpenBSD’s pfsync utility provide a means by which to implement redundant routers and firewalls. This paper details how CARP and pfsync work together to provide this redundancy and explores the performance one can expect from the open source solutions. Two experiments were run: one showing the relationship between firewall state creation and state synchronization traffic and the other showing how TCP sessions are transparently maintained in the event of a router failure. Discussion of these simulations along …

Autonomous Clustering-Based Heterogeneous Waveband Switching In Wdm Networks, Mengke Li, Byrav Ramamurthy

CSE Conference and Workshop Papers

Employing waveband switching (WBS) in WDM networks can reduce the network operational cost and the call blocking probability. However, upgrading the existing optical switching architecture requires time and money. It is expected that a heterogeneous waveband switching (HeteroWBS) architecture would be desirable, where some nodes can support WBS functions and some cannot. We study the performance of HeteroWBS networks in terms of call blocking probability and cost savings under dynamic traffic requests. We propose an autonomous clustering-based HeteroWBS (AS-HeteroWBS) architecture to clusters the network into multiple autonomous systems (ASs). An AS may contain some specific nodes that provide WBS functions …

A Generic Autonomous Clustering-Based Heterogeneous Waveband Switching Architecture In Wdm Networks, Mengke Li, Byrav Ramamurthy

CSE Conference and Workshop Papers

Heterogeneous waveband switching (HeteroWBS) in WDM networks reduces the network operational costs. We propose an autonomous clustering-based HeteroWBS architecture to support the design of efficient HeteroWBS algorithms under dynamic traffic requests in such a network.

Dynamic Lightpath Scheduling In Next-Generation Wdm Optical Networks, Lu Shen, Ajay Todimala, Byrav Ramamurthy, Xi Yang

CSE Conference and Workshop Papers

Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In this study, we propose an approach to support dynamic lightpath scheduling in such networks. To minimize blocking probability in a network that accommodates dynamic scheduled lightpath demands (DSLDs), resource allocation should be optimized in a dynamic manner. However, for the network users who desire deterministic services, resources must be reserved in advance and guaranteed for future use. These two objectives may be mutually incompatible. Therefore, we propose a two-phase dynamic lightpath scheduling …

Approximation Algorithms For Survivable Multicommodity Flow Problems With Applications To Network Design, Ajay Todimala, Byrav Ramamurthy

CSE Conference and Workshop Papers

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature.

In the design of high-speed networks, such as …

An Efficient Scheduling Scheme For On-Demand Lightpath Reservations In Reconfigurable Wdm Optical Networks, Xi Yang, Lu Shen, Ajay Todimala, Byrav Ramamurthy, Tom Lehman

CSE Conference and Workshop Papers

We propose an efficient scheduling scheme that optimizes advance-reserved lightpath services in reconfigurable WDM networks. A re-optimization approach is devised to reallocate network resources for dynamic service demands while keeping determined schedule unchanged.

Active Learning To Maximize Area Under The Roc Curve, Matt Culver, Deng Kun, Stephen Scott

CSE Conference and Workshop Papers

In active learning, a machine learning algorithmis given an unlabeled set of examples U, and is allowed to request labels for a relatively small subset of U to use for training. The goal is then to judiciously choose which examples in U to have labeled in order to optimize some performance criterion, e.g. classification accuracy. We study how active learning affects AUC. We examine two existing algorithms from the literature and present our own active learning algorithms designed to maximize the AUC of the hypothesis. One of our algorithms was consistently the top performer, and Closest Sampling from the literature …

Cross-Layer Analysis Of Error Control In Wireless Sensor Networks, Mehmet C. Vuran, Ian F. Akyildiz

CSE Conference and Workshop Papers

Severe energy constraints and hence the low power communication requirements amplify the significance of the energy efficient and preferably cross-layer error control mechanisms in Wireless Sensor Networks (WSN). In this paper, a crosslayer methodology for the analysis of error control schemes in WSNs is presented such that the effects of multi-hop routing and the broadcast nature of the wireless channel are investigated. More specifically, the cross-layer effects of routing, medium access and physical layers are considered. This analysis enables a comprehensive comparison of forward error correction (FEC) and automatic repeat request (ARQ) in WSNs.
FEC schemes improve the error resiliency …

A Constraint-Based Approach To Solving Minesweeper, Ken Bayer, Josh Snyder, Berthe Y. Choueiry

CSE Conference and Workshop Papers

·Motivate the students for the study of Constraint Processing (CP). Minesweeper is perfect to this end because it allows us to illustrate the use of CP algorithms in a familiar context and show how they operate.

·Understand and demystify humans’ fascination with puzzles.

·Discourage graduate students from losing too much time playing the game by making a program that plays the game for them.