Digital Commons Network^™

Spatiotemporal Databases: Models For Attracting Students To Research, Ágnes Bércesné Novák, Peter Revesz, Zsolt Tuza

CSE Conference and Workshop Papers

In higher education professors often make much effort to introduce their students to research. Unfortunately, the present standard database systems curriculum is composed of well-settled subjects that do not lead to research. The challenge is to bring the research frontier closer to students at beginner level. In this paper we describe how it can be done in the area of spatiotemporal databases. We propose a new database systems curriculum and illustrate its benefits by mentioning several highly succsesful student projects in some recent experimental introductory database systems courses that followed the new curriculum.

Priority-Based Lambda Scheduler, Kalpana Ganesan, Byrav Ramamurthy

CSE Conference and Workshop Papers

Optical networks provide a new dimension to meet the demands of exponentially growing traffic. Optical packet switching requires a good switch architecture, which eliminates the O/E/O conversion as much as possible. Wavelength Division Multiplexing (WDM) provides a breakthrough to exploit the huge bandwidth of the optical fiber. Different applications have different requirements, which necessitate employing differentiated services. This paper presents the idea of a priority-based λ-scheduler, where the packets are differentiated into different classes and services are provided accordingly. For example, class 0 can correspond to non real time applications like email and ftp, while class 1 can correspond to …

Indirect Symbolic Correlation Approach To Unsegmented Text Recognition, George Nagy, Sharad C. Seth, Y. Lin, Shashank K. Mehta

CSE Conference and Workshop Papers

The new non-parametric approach to unsegmented text recognition builds two bipartite graphs that result from the feature-level and lexical comparisons of the same word against a reference string which need not include the query word. The lexical graph preserves the relative order of edges in the feature graph corresponding to correctly recognized features. This observation leads to a subgraph-matching formulation of the recognition problem. An initial implementation proves the robustness of the approach for up-to 20% noise introduced in the feature-level graph.

Double-Tree Scan: A Novel Low-Power Scan-Path Architecture, Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zhang

CSE Conference and Workshop Papers

In a scan-based system with a large number of flip-flops, a major component of power is consumed during scan-shift and clocking operation in test mode. In this paper, a novel scan-path architecture called double-tree scan (DTS) is proposed that drastically reduces the scan-shift and clock activity during testing. The inherent combinatorial properties of double-tree structure are employed to design the scan architecture, clock gating logic, and a simple shift controller. The design is independent of the structure of the circuit-under-test (CUT) or its test set. It provides a significant reduction both in instantaneous and average power needed for clocking and …

Low-Energy Bist Design For Scan-Based Logic Circuits, Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zhang

CSE Conference and Workshop Papers

In a random testing environment, a significant amount of energy is wasted in the LFSR and in the CUT by useless patterns that do not contribute to fault dropping. Another major source of energy drainage is the loss due to random switching activity in the CUT and in the scan path between applications of two successive vectors. In this work, a new built-in self-test (BIST) scheme for scan-based circuits is proposed for reducing such energy consumption. A mapping logic is designed which modifies the state transitions of the LFSR such that only the useful vectors are generated according to a …

Agent Based Intrusion Detection And Response System For Wireless Lans, Mohan K Chirumamilla, Byrav Ramamurthy

CSE Conference and Workshop Papers

Wireless LAN technology, despite the numerous advantages it has over competing technologies, has not seen widespread deployment. A primary reason for markets not adopting this technology is its failure to provide adequate security. Data that is sent over wireless links can be compromised with utmost ease. In this project, we propose a distributed agent based intrusion detection and response system for wireless LANs that can detect unauthorized wireless elements like access points, wireless clients that are in promiscuous mode etc. The system reacts to intrusions by either notifying the concerned personnel, in case of rogue access points and promiscuous nodes, …

Inter-Domain Dynamic Routing In Multi-Layer Optical Transport Networks, Xi Yang, Byrav Ramamurthy

CSE Conference and Workshop Papers

Next-generation optical transport networks will automatically and dynamically provision end-to-end connections. In this paper, we study the problem of inter-domain dynamic routing under a multi-layer multi-domain network model, which allows the end-to-end connections to be set up not only across multiple routing domains but also through two transport layers: the optical layer and the digital layer. In this model, a connection can traverse the domain boundary either through optical bypass or through optical-electrical-optical (O/E/O) processing. We propose an inter-domain dynamic routing scheme with modest time complexity to address the problem from an algorithmic perspective.

A Novel Fiber Delay Line Buffering Architecture For Optical Packet Switching, Lin Li, Stephen Scott, Jitender S. Deogun

CSE Conference and Workshop Papers

Due to the lack of optical random access memory, optical fiber delay line (FDL) is currently the only way to implement optical buffering. Feed-forward and feedback are two kinds of FDL structures in optical buffering. Both have advantages and disadvantages. In this paper, we propose a more effective hybrid FDL architecture that combines the merits of both schemes. The core of this switch is the arrayed waveguide grating (AWG) and the tunable wavelength converter (TWC). It requires smaller optical device sizes and fewer wavelengths and has less noise than feedback architecture. At the same time, it can facilitate preemptive priority …

Patterns And Trends Of Soil Climate Regimes And Drought Events In The Northern Great Plains, William J. Waltman, Stephen M. Goddard, S. E. Reichenbach, Mark Svoboda, Michael Hayes, J. S. Peake

CSE Conference and Workshop Papers

Drought is the dominant process of crop loss nationally and within Nebraska. Nearly twothirds of the 18.6 million harvested acres are covered by crop insurance (USDA/RMA, 2003; USDA/NASS, 2003). For the most part, Nebraska’s crop losses range from $50 to 75 million in non-drought years, but the losses approach nearly $200 million in drought years, such as 2000. The past growing season (2002) crop losses are projected to greatly exceed $375 million in Nebraska and more than $4 billion nationally (USDA/RMA, 2003). The analysis and understanding of drought processes in the Great Plains is an important component to developing drought …

A New Efficient Algorithm For Solving The Simple Temporal Problem, Lin Xu, Berthe Y. Choueiry

CSE Conference and Workshop Papers

Motivation for Simple Temporal Problem (STP)

STP - TCSP - DTP

Consistency properties & algorithms

General CSPs

STP

Contributions

Use (improved) PPC for STP

Refine it into ΔSTP

Evaluation on random instances, 3 generators

Summary & new results

A New Efficient Algorithm For Solving The Simple Temporal Problem, Lin Xu, Berthe Y. Choueiry

CSE Conference and Workshop Papers

In this paper we propose a new efficient algorithm, the Δ STP-solver, for computing the minimal network of the Simple Temporal Problem (STP). This algorithm achieves high performance by exploiting a topological property of the constraint graph (i.e., triangulation) and a semantic property of the constraints (i.e., convexity) in light of the results reported by Bliek and Sam-Haroud [1], which were presented for general CSPs and have not yet been applied to temporal networks. Importantly, we design the constraint propagation in Δ STP-solver to operate on triangles instead of operating on edges and implicitly guarantee the decomposition of …