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

Physical Sciences and Mathematics Commons

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

Computer Sciences

PDF

University of Nebraska - Lincoln

CSE Conference and Workshop Papers

2002

Articles 1 - 8 of 8

Full-Text Articles in Physical Sciences and Mathematics

Cxquery: A Novel Xml Query Language, Peter Revesz, Yi Chen Jan 2002

Cxquery: A Novel Xml Query Language, Peter Revesz, Yi Chen

CSE Conference and Workshop Papers

XML is becoming the data exchange standard on the Internet. Previously proposed XML query languages, such as XQuery, Quilt, YALT, Lorel, and XML-QL, lack schema definition of the query result; therefore, they are limited for defining views, integrating data, updating, and further querying, all of which are often needed in e-Business applications. We propose a novel XML query language called CXQuery, which defines the schema of the query results explicitly and can easily define views, and integrate, update, and query XML data. In addition, CXQuery can express spatial and spatio-temporal queries using a constraint-based querying approach.


An Analytical Model For Virtual Topology Reconfiguration In Optical Networks And A Case Study, Xi Yang, Byrav Ramamurthy Jan 2002

An Analytical Model For Virtual Topology Reconfiguration In Optical Networks And A Case Study, Xi Yang, Byrav Ramamurthy

CSE Conference and Workshop Papers

An analytical model for Virtual Topology Reconfiguration (VTR) in optical networks is developed. It aims at the optical networks with a circuit-based data plane and an IPlike control plane. By identifying and analyzing the important factors impacting the network performance due to VTR operations on both planes, we can compare the benefits and penalties of different VTR algorithms and policies. The best VTR scenario can be adaptively chosen from a set of such algorithms and policies according to the real-time network situations. For this purpose, a cost model integrating all these factors is created to provide a comparison criterion independent …


Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry Jan 2002

Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry

CSE Conference and Workshop Papers

We discuss the modeling and reformulation of a resource allocation problem, the assignment of graduate teaching assistants (GTAs) to courses. Our research contributes the following:

• Formulation of the GTA assignment problem as a nonbinary CSP.

• Design of a new convention for consistency checking to deal with over-constrained problem.

• Definition of a new network-decomposable nonbinary confinement constraint.

• Evaluation of the reformulation of confinement and equality constraints on 3 real-world data sets.


Centralized Vs. Distributed Connection Management Schemes Under Different Traffic Patterns In Wavelength-Convertible Optical Networks, Lu Shen, Byrav Ramamurthy Jan 2002

Centralized Vs. Distributed Connection Management Schemes Under Different Traffic Patterns In Wavelength-Convertible Optical Networks, Lu Shen, Byrav Ramamurthy

CSE Conference and Workshop Papers

Centralized and Distributed methods are two connection management schemes in wavelength convertible optical networks. In the earlier work, the centralized scheme is said to have lower network blocking probability than the distributed one. Hence, much of the previous work in connection management has focused on the comparison of different algorithms in only distributed scheme or in only centralized scheme. However, we believe that the network blocking probability of these two connection management schemes depends, to a great extent, on the network traffic patterns and reservation times. Our simulation results reveal that the performance improvement (in terms of blocking probability) of …


Dynamic Traffic Grooming Algorithms For Reconfigurable Sonet Over Wdm Networks, Shu Zhang, Byrav Ramamurthy Jan 2002

Dynamic Traffic Grooming Algorithms For Reconfigurable Sonet Over Wdm Networks, Shu Zhang, Byrav Ramamurthy

CSE Conference and Workshop Papers

The emergence of Wavelength Division Multiplexing (WDM) technology provides the capability for increasing the bandwidth of Synchronous Optical Network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add-drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom in the traffic and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently.


A Novel Method To Improve The Test Efficiency Of Vlsi Tests, Hailong Cui, Sharad C. Seth, Shashank K. Mehta Jan 2002

A Novel Method To Improve The Test Efficiency Of Vlsi Tests, Hailong Cui, Sharad C. Seth, Shashank K. Mehta

CSE Conference and Workshop Papers

This paper considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal of minimizing the test cost. Best and worst case bounds are established for the performance of a reordered sequence compared to the original sequence of test application. SEMATECH test data and simulation results are used throughout to illustrate the ideas.


Dynamic Routing In Translucent Wdm Optical Networks, Xi Yang, Byrav Ramamurthy Jan 2002

Dynamic Routing In Translucent Wdm Optical Networks, Xi Yang, Byrav Ramamurthy

CSE Conference and Workshop Papers

Translucent WDM optical networks use sparse placement of regenerators to overcome the impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks with much less cost. Our previous study proved the feasibility of translucent networks using sparse regeneration technique. We addressed the placement of regenerators based on static schemes allowing only fixed number of regenerators at fixed locations. This paper furthers the study by proposing a suite of dynamical routing schemes. Dynamic allocation, advertisement and discovery of regeneration resources are proposed to support sharing transmitters and receivers between regeneration and access functions. …


Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry Jan 2002

Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry

CSE Conference and Workshop Papers

We discuss the modeling and reformulation of a resource allocation problem, the assignment of Graduate Teaching Assistants to courses in the University of Nebraska-Lincoln Computer Science Department. We formulate this problem as a non-binary Constraint Satisfaction Problem (CSP) and provide a new convention for consistency checking to deal with the over-constraindness of the problem and the practical requirement of our application. We introduce a new decomposable non-binary constraint, which we call confinement constraint, and describe its relevance in practical requirements of our application. We introduce an new decomposable non-binary constraint, which we call confinement constraint, and describe its relevance in …