645 Result(s)
within
Computer Science
**g-** Ge
Article
-
Article
The human-computer dialogue management of FCAD system
This paper describes the dialogue management of FCAD’s user interface through introducing FCAD’s data-driven user interface model which eases the creation, modification, analyzing, and testing of it.
-
Article
A non-blocking locking method and performance evaluation on network of workstations
A network of workstation (NOW) can act as a single and scalable powerful computer by building a parallel and distributed computing platform on top of it. WAKASHI is such a platform system that supports persist...
-
Article
Performance evaluation of a parallel cascade semijoin algorithm for computing path expressions in object database systems
With the emerging of new applications, especially in Web, such as E-Commerce, Digital Library and DNA Bank, object database systems show their stronger functions than other kinds of database systems due to the...
-
Article
The Existence of Four HMOLS with Equal Sized Holes
In this paper, we present several new constructions for k holey mutually orthogonal Latin squares (HMOLS) of type g n . We concentrate mainly on k=4; here, for all but two value...
-
Article
On Group-Divisible Designs with Block Size Four and Group-Type g u m 1
We investigate the spectrum for {4}-GDDs of type g u m 1. Wedetermine, for each even g, all values of m for which a {4}-GDD of typeg u m 1 exists, for every ‘fourth’ value of u. We similarlydetermine, for each od...
-
Article
Managing very large document collections using semantics
In this paper, a system is presented where documents are no longer identified by their file names. Instead, a document is represented by its semantics in terms ofdescriptor andcontent vector. Thedescriptor of a d...
-
Article
RPE query processing and optimization techniques for XML databases
Anextent join to compute path expressions containing parent-children and ancestor-descendent operations and two path expression optimization rules,path-shortening andpath-complementing, are presented in this pape...
-
Article
Group Divisible Designs with Block Size Four and Group Type g u m1 with Minimum m
In this paper, we continue to investigate the spectrum for {4}-GDDs of type g u m1 with m as small as possible. We determine, for each admissible pair (g,u), the minimum values ...
-
Article
Observer and observer-based H ∞ control of generalized Hamiltonian systemscontrol of generalized Hamiltonian systems
This paper deals with observer design for generalized Hamiltonian systems and its applications. First, by using the systems’ structural properties, a new observer design method called Augment Plus Feedback is ...
-
Article
Some new optimal quaternary constant weight codes
Constant weight codes (CWCs) are an important class of codes in coding theory. Generalized Steiner systems GS (2, k, v, g) were first introduced by Etzion and used to construct optimal nonlinear CWCs over an alph...
-
Article
Resolvable Maximum Packings with Quadruples
Let V be a finite set of v elements. A packing of the pairs of V by k-subsets is a family F of k-subsets of V, called blocks, such that each pair in V occurs in at most one member of F. For fixed v and k, the pac...
-
Article
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems
A sequence of exact algorithms to solve the Vertex Cover and Maximum Independent Set problems have been proposed in the literature. All these algorithms appeal to a very conservative analysis that considers th...
-
Article
An Improved Algorithm for Finding the Closest Pair of Points
As early as in 1975, Shamos and Hoey first gave an O(n lg n)-time divide-and-conquer algorithm (SH algorithm in short) for the problem of finding the closest pair of points. In one process of combination, the Euc...
-
Article
GOB designs for authentication codes with arbitration
Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of researchers in terms of affine α-resolvable + BIBDs and α-resolvable designs with som...
-
Article
A Parallel Implementation of the Katsevich Algorithm for 3-D CT Image Reconstruction
Yu and Wang [1, 2] implemented the first theoretically exact spiral cone-beam reconstruction algorithm developed by Katsevich [3, 4]. This algorithm requires a high computational cost when the data amount beco...
-
Article
Parallel Error Detection for Leading Zero Anticipation
The algorithm and its implementation of the leading zero anticipation (LZA) are very vital for the performance of a high-speed floating-point adder in today’s state of art microprocessor design. Unfortunately,...
-
Article
Combinatorial characterizations of one-coincidence frequency-hop** sequences
Combinatorial characterizations of one-coincidence frequency-hop** (FH) sequences are provided in terms of perfect Mendelsohn packings. As a consequence, results on perfect Mendelsohn packings can be immedia...
-
Article
Design for WDM rings based on differentiated path availability
A mechanism of reusing protection wavelengths in Wavelength Division Multiplexing (WDM) ring networks based on Differentiated Path Availability (DPA) is presented. A heuristic algorithm—Difficult Reuse First (...
-
Article
Remote sensing image fusion based on Bayesian linear estimation
A new remote sensing image fusion method based on statistical parameter estimation is proposed in this paper. More specially, Bayesian linear estimation (BLE) is applied to observation models between remote se...
-
Article
A novel backup multiplexing scheme for surviving double-link failures in mesh optical networks without wavelength conversion capability
We consider the problem of recovery from any double-link failure by exploiting shared path protection in wavelength-division multiplexing (WDM) mesh networks. We for the first time discover the phenomenon of shar...
