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

Computer Sciences Commons™

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

University of Nebraska - Lincoln

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1651 - 1680 of 1739

Full-Text Articles in Computer Sciences

Separating Touching Objects In Remote Sensing Imagery: The Restricted Growing Concept And Implementations, Leen-Kiat Soh, Costas Tsatsoulis Feb 2000

Separating Touching Objects In Remote Sensing Imagery: The Restricted Growing Concept And Implementations, Leen-Kiat Soh, Costas Tsatsoulis

School of Computing: Faculty Publications

This paper defines the restricted growing concept (RGC) for object separation and provides an algorithmic analysis of its implementations. Our concept decomposes the problem of object separation into two stages. First, separation is achieved by shrinking the objects to their cores while keeping track of their originals as masks. Then the core is grown within the masks obeying the guidelines of a restricted growing algorithm. In this paper, we apply RGC to the remote sensing domain, particularly the synthetic aperture radar (SAR) sea ice images.

Go to article

Cataloging Expert Systems: Optimism And Frustrated Reality, William Olmstadt Feb 2000

Cataloging Expert Systems: Optimism And Frustrated Reality, William Olmstadt

E-JASL: Electronic Journal of Academic and Special Librarianship (1999-2009, Volumes 1-10)

There is little question that computers have profoundly changed how information professionals work. The process of cataloging and classifying library materials was one of the first activities transformed by information technology. The introduction of the MARC format in the 1960s and the creation of national bibliographic utilities in the 1970s had a lasting impact on cataloging. In the 1980s, the affordability of microcomputers made the computer accessible for cataloging, even to small libraries. This trend toward automating library processes with computers parallels a broader societal interest in the use of computers to organize and store information. Following World War II, …

Go to article

Prioritizing Test Cases For Regression Testing, Sebastian Elbaum, Alexey G. Malishevsky, Gregg Rothermel Jan 2000

Prioritizing Test Cases For Regression Testing, Sebastian Elbaum, Alexey G. Malishevsky, Gregg Rothermel

School of Computing: Technical Reports

Test case prioritization techniques schedule test cases in an order that increases their effectiveness in meeting some performance goal. One performance goal, rate of fault detection, is a measure of how quickly faults are detected within the testing process; an improved rate of fault detection can pro- vide faster feedback on the system under test, and let soft- ware engineers begin locating and correcting faults earlier than might otherwise be possible. In previous work, we re- ported the results of studies that showed that prioritization techniques can significantly improve rate of fault detection. Those studies, however, raised several additional questions: …

Go to article

Disec: A Distributed Framework For Scalable Secure Many-To-Many Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal Jan 2000

Disec: A Distributed Framework For Scalable Secure Many-To-Many Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal

School of Computing: Conference and Workshop Papers

Secure one-to-many multicasting has been a popular research area in the recent past. Secure many-to-many multicasting is becoming popular with applications such as private conferencing and distributed interactive simulation. Most of the existing secure multicasting protocols use a centralized group manager to enforce access control and for key distribution. In the presence of multiple senders it is desirable to delegate group management responsibility to all the senders. We propose a distributed group key management scheme to support secure many-to-many communication. We divide key distribution overhead evenly among the senders. Our protocol is scalable and places equal trust in all the …

Go to article

Lsmac And Lsnait: Two Approaches For Cluster-Based Scalable Web Servers, Xuehong Gana, Trevor Schroeder, Steve Goddard, Byrav Ramamurthy Jan 2000

Lsmac And Lsnait: Two Approaches For Cluster-Based Scalable Web Servers, Xuehong Gana, Trevor Schroeder, Steve Goddard, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Server responsiveness and scalability are more important than ever in today’s client/server dominated network environments. Recently, researchers have begun to consider cluster-based computers using commodity hardware as an alternative to expensive specialized hardware for building scalable Web servers. In this paper, we present performance results comparing two cluster-based Web servers based on different server infrastructures: MAC-based dispatching (LSMAC) and IP-based dispatching (LSNAT). Both cluster-based server systems were implemented as application-space programs running on commodity hardware. We point out the advantages and disadvantages of both systems. We also identify when servers should be clustered and when clustering will not improve performance.

Go to article

Virtual Topology Reconfiguration Of Wavelength-Routed Optical Wdm Networks, Byrav Ramamurthy, Ashok Ramakrishnan Jan 2000

Virtual Topology Reconfiguration Of Wavelength-Routed Optical Wdm Networks, Byrav Ramamurthy, Ashok Ramakrishnan

School of Computing: Conference and Workshop Papers

The bandwidth requirements of the Internet are increasing every day and there are newer and more bandwidth-thirsty applications emerging on the horizon. Wavelength division multiplexing (WDM) is the next step towards leveraging the capabilities of the optical fiber, especially for wide-area backbone networks. The ability to switch a signal at intermediate nodes in a WDM network based on their wavelengths is known as wavelength-routing. One of the greatest advantages of using wavelength-routing WDM is the ability to create a virtual topology different from the physical topology of the underlying network. This virtual topology can be reconfigured when necessary, to improve …

Go to article

Optical Communication Networks For The Next-Generation Internet, Arun K. Somani, Byrav Ramamurthy Jan 2000

Optical Communication Networks For The Next-Generation Internet, Arun K. Somani, Byrav Ramamurthy

School of Computing: Faculty Publications

Computer and telecommunication networks are changing the world dramatically and will continue to do so in the foreseeable future. The Internet, primarily based on packet switches, provides very flexible data services such as e-mail and access to the World Wide Web. The Internet is a variable-delay, variable- bandwidth network that provides no guarantee on quality of service (QoS) in its initial phase. New services are being added to the pure data delivery framework of yesterday. Such high demands on capacity could lead to a “bandwidth crunch” at the core wide-area network, resulting in degradation of service quality. Fortunately, technological innovations …

Go to article

Exploiting Don't Cares To Enhance Functional Tests, Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr Jan 2000

Exploiting Don't Cares To Enhance Functional Tests, Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr

School of Computing: Conference and Workshop Papers

In simulation based design verification, deterministic or pseudo-random tests are used to check functional correctness of a design. In this paper we present a technique generating tests by specifying the don’t care inputs in the functional specifications so as to improve their coverage of both design errors and manufacturing faults. The don’t cares are chosen to maximize sensitization of signals in the circuit. The tests generated in this way require only a fraction of pseudo-exhaustive test patterns to achieve a high multiplicity of fault coverage.

Go to article

Experiments To Assess The Cost-Benefits Of Test-Suite Reduction, Gregg Rothermel, Mary Jean Harrold, Jeffery Von Ronne, Christie Hang, Jeffery Ostrin Dec 1999

Experiments To Assess The Cost-Benefits Of Test-Suite Reduction, Gregg Rothermel, Mary Jean Harrold, Jeffery Von Ronne, Christie Hang, Jeffery Ostrin

School of Computing: Technical Reports

Test-suite reduction techniques attempt to reduce the cost of saving and reusing test cases during software maintenance by eliminating redundant test cases from test suites. A potential drawback of these techniques is that in reducing a test suite they might reduce the ability of that test suite to reveal faults in the software. Previous studies suggested that test-suite reduction techniques can reduce test suite size without significantly reducing the fault-detection capabilities of test suites. To further investigate this issue we performed experiments in which we examined the costs and benefits of reducing test suites of various sizes for several programs …

Go to article

Impact Of Transmission Impairments On The Teletraffic Performance Of Wavelength-Routed Optical Networks, Byrav Ramamurthy, Debasish Datta, Helena Feng, Jonathan P. Heritage, Biswanath Mukherjee Oct 1999

Impact Of Transmission Impairments On The Teletraffic Performance Of Wavelength-Routed Optical Networks, Byrav Ramamurthy, Debasish Datta, Helena Feng, Jonathan P. Heritage, Biswanath Mukherjee

School of Computing: Faculty Publications

In a wavelength-routed optical network, a transmitted signal remains in the optical domain over the entire route (lightpath) assigned to it between its source and destination nodes. The optical signal may have to traverse a number of crossconnect switches (XCS’s), fiber segments, and optical amplifiers, e.g., erbium-doped fiber amplifiers (EDFA’s). Thus, while propagating through the network, the signal may degrade in quality as it encounters crosstalk at the XCS’s and also picks up amplified spontaneous emission (ASE) noise at the EDFA’s. Since these impairments continue to degrade the signal quality as it progresses toward its destination, the received bit error …

Go to article

The Rate-Based Execution Model, Kevin Jeffay, Steve Goddard Apr 1999

The Rate-Based Execution Model, Kevin Jeffay, Steve Goddard

School of Computing: Technical Reports

We present a new task model for the real-time execution of event-driven tasks in which no a priori characterization of the actual arrival rates of events is known; only the expected arrival rates of events is known. We call this new task model rate-based execution (RBE), and it is a generalization of the common sporadic task model. The RBE model is motivated naturally by distributed multimedia and digital signal processing applications.
We identify necessary and sufficient conditions for determining the feasibility of an RBE task set, and an optimal scheduling algorithm (based on preemptive earliest-deadline-first (EDF) scheduling) for scheduling the …

Go to article

Texture Analysis Of Sar Sea Ice Imagery Using Gray Level Co-Occurrence Matrices, Leen-Kiat Soh, Costas Tsatsoulis Mar 1999

Texture Analysis Of Sar Sea Ice Imagery Using Gray Level Co-Occurrence Matrices, Leen-Kiat Soh, Costas Tsatsoulis

School of Computing: Faculty Publications

This paper presents a preliminary study for mapping sea ice patterns (texture) with 100-m ERS-1 synthetic aperture radar (SAR) imagery. We used gray-level co-occurrence matrices (GLCM) to quantitatively evaluate textural parameters and representations and to determine which parameter values and representations are best for mapping sea ice texture. We conducted experiments on the quantization levels of the image and the displacement and orientation values of the GLCM by examining the effects textural descriptors such as entropy have in the representation of different sea ice textures. We showed that a complete gray-level representation of the image is not necessary for texture …

Go to article

Segmentation Of Satellite Imagery Of Natural Scenes Using Data Mining, Leen-Kiat Soh, Costas Tsatsoulis Mar 1999

Segmentation Of Satellite Imagery Of Natural Scenes Using Data Mining, Leen-Kiat Soh, Costas Tsatsoulis

School of Computing: Faculty Publications

In this paper, we describe a segmentation technique that integrates traditional image processing algorithms with techniques adapted from knowledge discovery in databases (KDD) and data mining to analyze and segment unstructured satellite images of natural scenes. We have divided our segmentation task into three major steps. First, an initial segmentation is achieved using dynamic local thresholding, producing a set of regions. Then, spectral, spatial, and textural features for each region are generated from the thresholded image. Finally, given these features as attributes, an unsupervised machine learning methodology called conceptual clustering is used to cluster the regions found in the image …

Go to article

Cooperative Text And Line Art Extraction From A Topographic Map, Luyang Li, George Nagy, Ashok Samal, Sharad C. Seth, Yihong Xu Jan 1999

Cooperative Text And Line Art Extraction From A Topographic Map, Luyang Li, George Nagy, Ashok Samal, Sharad C. Seth, Yihong Xu

School of Computing: Conference and Workshop Papers

The black layer is digitized from a USGS topographic map digitized at 1000 dpi. The connected components of this layer are analyzed and separated into line art, text, and icons in two passes. The paired street casings are converted to polylines by vectorization and associated with street labels from the character recognition phase. The accuracy of character recognition is shown to improve by taking account of the frequently occurring overlap of line art with street labels. The experiments show that complete vectorization of the black line-layer bitmap is the major remaining problem.

Go to article

A Unifying Framework Supporting The Analysis And Development Of Safe Regression Test Selection Techniques, John Bible, Gregg Rothermel Jan 1999

A Unifying Framework Supporting The Analysis And Development Of Safe Regression Test Selection Techniques, John Bible, Gregg Rothermel

School of Computing: Technical Reports

Safe regression test selection (RTS) techniques let software testers reduce the number of test cases that need to be rerun to revalidate new versions of software, while ensuring that no fault-revealing test case (in the existing test suite) is excluded. Most previous work on safe regression test selection has focused on specific safe RTS algorithms, rather than addressing the theoretical foundations of safe RTS techniques in general. In this paper, we present a unifying framework for safe RTS that supports the analysis and development of safe RTS techniques. We show that every safe RTS technique is founded on a regression …

Go to article

Empirical Computation Of Reject Ratio In Vlsi Testing, Shashank K. Mehta, Sharad C. Seth Jan 1999

Empirical Computation Of Reject Ratio In Vlsi Testing, Shashank K. Mehta, Sharad C. Seth

School of Computing: Conference and Workshop Papers

Among significant components of testing cost are testlength, reject ratio, and lost-yield. In this paper a new approach is proposed to estimate the reject ratio. The empirical model is based on test-data properties that are believed to be invariant for a wide range of manufacturing technologies and types of tests. The analysis is carried out entirely in terms of the device test data, as might be available from wafer probe. Experimental results demonstrate robustness of the model.

Go to article

Comparison Of Scalable Key Distribution Schemes For Secure Group Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal Jan 1999

Comparison Of Scalable Key Distribution Schemes For Secure Group Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal

School of Computing: Conference and Workshop Papers

Scalable secure key distribution is the most important feature of a scalable secure group communication protocol. Most of the existing scalable secure group communication protocols are based on a hierarchical key distribution tree. These schemes can be classified as hierarchical node based schemes and hierarchical key based schemes. In this paper; we compare recently proposed hierarchical key distribution schemes through simulation using real-life multicast group membership traces. Our simulations show that hierarchical node based approaches better distribute encryption cost among the entities of a multicast group. However hierarchical node based schemes “trust” internal nodes of a key distribution tree. We …

Go to article

Transparent Vs. Opaque Vs. Translucent Wavelength-Routed Optical Networks, Byrav Ramamurthy, Helena Feng, Debasish Datta, Jonathan P. Heritage, Biswanath Mukherjee Jan 1999

Transparent Vs. Opaque Vs. Translucent Wavelength-Routed Optical Networks, Byrav Ramamurthy, Helena Feng, Debasish Datta, Jonathan P. Heritage, Biswanath Mukherjee

School of Computing: Conference and Workshop Papers

A wavelength-routed optical network consists of multi-wavelength crossconnect switches (XCSs) which are interconnected by optical fibers. Some (or all) crossconnects, referred to as nodes in this paper, are also attached to access stations where data from several end-users could be multiplexed onto a single wavelength division multiplexed (WDM) channel. An access station provides optical-to-electronic (O/E) conversion and wice wersa to interface the optical network with conventional electronic equipment. The access station, at an intermediate node, may also be used (as in this study) for signal regenerution on a lightpath. A new call is admitted into the network if a lightpath …

Go to article

A Synthesis For Testability Scheme For Finite State Machines Using Clock Control, Kent L. Einspahr, Shashank K. Mehta, Sharad C. Seth Jan 1999

A Synthesis For Testability Scheme For Finite State Machines Using Clock Control, Kent L. Einspahr, Shashank K. Mehta, Sharad C. Seth

School of Computing: Faculty Publications

A new method is proposed for improving the testability of a finite state machine (FSM) during its synthesis. The method exploits clock control to enhance the controllability and observability of machine states. With clock control it is possible to add new state transitions during testing. Therefore, it is easier to navigate between states in the resulting test machine. Unlike prior work, where clock control is added to the circuit as a postdesign step, here, clock control is considered in conjunction with a symbolic scheme for encoding the states of the FSM. The encoding is shown to result in significant reductions …

Go to article

A Dual Encryption Protocol For Scalable Secure Multicasting, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok K. Samal Jan 1999

A Dual Encryption Protocol For Scalable Secure Multicasting, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok K. Samal

School of Computing: Conference and Workshop Papers

In this paper we propose a dual encryption protocol for scalable secure multicasting. Multicasting is a scalable solution for group communication. It howevel; poses several unique security problems. We use hierarchical subgrouping to achieve scalability. Third party hosts or members of the multicast group are designated as subgroup managers. They are responsible for secret key distribution and group membership management at the subgroup level. Unlike existing secure multicast protocols, our protocol need not trust the subgroup managers with the distribution of data encryption keys. The dual encryption protocol proposed in this paper distributes encrypted data encryption keys via subgroup managers. …

Go to article

Routing And Wavelength Assignment (Rwa) With Power Considerations In All- Optical Wavelength-Routed Networks, Maher Ali, Byrav Ramamurthy, Jitender S. Deogun Jan 1999

Routing And Wavelength Assignment (Rwa) With Power Considerations In All- Optical Wavelength-Routed Networks, Maher Ali, Byrav Ramamurthy, Jitender S. Deogun

School of Computing: Conference and Workshop Papers

Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing …

Go to article

Routing Algorithms For All-Optical Networks With Power Considerations: The Unicast Case, Maher Ali, Byrav Ramamurthy, Jitender S. Deogun Jan 1999

Routing Algorithms For All-Optical Networks With Power Considerations: The Unicast Case, Maher Ali, Byrav Ramamurthy, Jitender S. Deogun

School of Computing: Conference and Workshop Papers

In this paper, we investigate the problem of routing connections in all-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation …

Go to article

Transition From Research To Operations: Arktos - A Knowledge-Based Sea Ice Classification System, Cheryl Bertoia, Denise Gineris, Kim Partington, Leen-Kiat Soh, Costas Tsatsoulis Jan 1999

Transition From Research To Operations: Arktos - A Knowledge-Based Sea Ice Classification System, Cheryl Bertoia, Denise Gineris, Kim Partington, Leen-Kiat Soh, Costas Tsatsoulis

School of Computing: Conference and Workshop Papers

ARKTOS is a fully automated intelligent system that classifies sea ice and that is now being used by the U.S. National Ice Center (NIC) for daily operations related to the NIC’s task of mapping the ice covered oceans. In this paper we describe the process of taking a research project and transitioning it to an operational environment. We discuss the theoretical methodologies implemented in ARKTOS, and how ARKTOS was developed, tested, and finally moved to operations.

Go to article

Optimizing Amplifier Placements In A Multiwavelength Optical Lan/Man: The Unequally Powered Wavelengths Case, Byrav Ramamurthy, Jason Iness, Biswanath Mukherjee Dec 1998

Optimizing Amplifier Placements In A Multiwavelength Optical Lan/Man: The Unequally Powered Wavelengths Case, Byrav Ramamurthy, Jason Iness, Biswanath Mukherjee

School of Computing: Faculty Publications

Optical networks based on passive-star couplers and employing WDM have been proposed for deployment in local and metropolitan areas. These networks suffer from splitting, coupling, and attenuation losses. Since there is an upper bound on transmitter power and a lower bound on receiver sensitivity, optical amplifiers are usually required to compensate for the power losses mentioned above. Due to the high cost of amplifiers, it is desirable to minimize their total number in the network. However, an optical amplifier has constraints on the maximum gain and the maximum output power it can supply; thus, optical amplifier placement becomes a challenging …

Go to article

Optimizing Amplifier Placements In A Multiwavelength Optical Lan/Man: The Equally Powered-Wavelengths Case, Byrav Ramamurthy, Jason Iness, Biswanath Mukherjee Sep 1998

Optimizing Amplifier Placements In A Multiwavelength Optical Lan/Man: The Equally Powered-Wavelengths Case, Byrav Ramamurthy, Jason Iness, Biswanath Mukherjee

School of Computing: Faculty Publications

Wavelength division multiplexing (WDM) provides the ability to utilize the enormous bandwidth offered by optical networks, using today’s electronics. WDM-based optical networks employing passive-star couplers have been proposed for deployment in local and metropolitan areas. Optical amplification is often required in such networks to compensate for the signal attenuation along the fiber links and the splitting and coupling losses in the network. However, an optical amplifier has constraints on the maximum gain and the maximum output power it can supply; thus optical amplifier placement becomes a challenging problem. A simplifying assumption for analytical tractability requires that all wavelengths, present at …

Go to article

Wavelength Conversion In Wdm Networking, Byrav Ramamurthy, Biswanath Mukherjee Sep 1998

Wavelength Conversion In Wdm Networking, Byrav Ramamurthy, Biswanath Mukherjee

School of Computing: Faculty Publications

Wavelength conversion has been proposed for use in wavelength-division multiplexed networks to improve efficiency. This study highlights systems challenges and performance issues which need to be addressed in order to incorporate wavelength conversion effectively. A review/survey of the enabling technologies, design methods, and analytical models used in wavelength-convertible networks is provided.

Go to article

Empirical Studies Of A Safe Regression Test Selection Technique, Gregg Rothermel, Mary Jean Harrold Jun 1998

Empirical Studies Of A Safe Regression Test Selection Technique, Gregg Rothermel, Mary Jean Harrold

School of Computing: Faculty Publications

Regression testing is an expensive testing procedure utilized to validate modified software. Regression test selection techniques attempt to reduce the cost of regression testing by selecting a subset of a program’s existing test suite. Safe regression test selection techniques select subsets that, under certain well-defined conditions, exclude no tests (from the original test suite) that if executed would reveal faults in the modified software. Many regression test selection techniques, including several safe techniques, have been proposed, but few have been subjected to empirical validation. This paper reports empirical studies on a particular safe regression test selection technique, in which the …

Go to article

Ber-Based Call Admission In Wavelength-Routed Optical Networks, Debasish Datta, Byrav Ramamurthy, Helena Feng, Jonathan P. Heritage, Biswanath Mukherjee Jan 1998

Ber-Based Call Admission In Wavelength-Routed Optical Networks, Debasish Datta, Byrav Ramamurthy, Helena Feng, Jonathan P. Heritage, Biswanath Mukherjee

School of Computing: Conference and Workshop Papers

Consider a wavelength-routed optical network in which nodes, i.e., multiwave length cross-connect switches (XCSs), are connected by fiber to form an arbitrary physical topology. A new call is admitted into the network if an all-optical lightpath can be established between the call’s source and destination nodes. Wavelength converters are assumed absent in this work.

Go to article

Optical Components For Wdm Lightwave Networks, Michael S. Borella, Jason P. Jue, Dhritiman Banerjee, Byrav Ramamurthy, Biswanath Mukherjee Aug 1997

Optical Components For Wdm Lightwave Networks, Michael S. Borella, Jason P. Jue, Dhritiman Banerjee, Byrav Ramamurthy, Biswanath Mukherjee

School of Computing: Faculty Publications

Recently, there has been growing interest in developing optical fiber networks to support the increasing bandwidth demands of multimedia applications, such as video conferencing and World Wide Web browsing. One technique for accessing the huge bandwidth available in an optical fiber is wavelength-division multiplexing (WDM). Under WDM, the optical fiber bandwidth is divided into a number of nonoverlapping wavelength bands, each of which may be accessed at peak electronic rates by an end user. By utilizing WDM in optical networks, we can achieve link capacities on the order of 50 THz. The success of WDM networks depends heavily on the …

Go to article

Mlpq: A Linear Constraint Database System With Aggregate Operators, Yiming Li Apr 1997

Mlpq: A Linear Constraint Database System With Aggregate Operators, Yiming Li

School of Computing: Dissertations, Theses, and Student Research

In this project report, I will discuss a Multiple Linear Programming Query (MLPQ) system and the theoretical background of this system.The MPLQ system is developed to solve some realistic problems involving both linear programming (UP) techniques and linear constraint databases (LCDBs) theory. The MLPQ system is aimed at providing a mechanism of bridging these two important areas. system basically consists of three parts which are a linear constraint database, an LP solver, and an interface between the LCDB and the LP solver. The LCDB of the MLPQ system contains multiple linear programming problems. The LP solver used in the MPLQ …

Go to article

First Prev Next Last