Abstract Computer simulation is widely-used in investigating the performance of existing and prop... more Abstract Computer simulation is widely-used in investigating the performance of existing and proposed systems in many areas of science, engineering, operations research, and management science, especially in applications characterized by complicated geometries and interaction probabilities, and for dealing with system design in the presence of uncertainty. This is particularly true in the case of computer systems and computer networks.
Congestion is a fundamental problem in computer networks. Congestion may occur at router buffers ... more Congestion is a fundamental problem in computer networks. Congestion may occur at router buffers of networks when the number of incoming packets cannot be absorbed by the available network resources such as buffer spaces. A poor network performance can be offered due to congestion, eg high dropping and queueing delay for packets, low throughput and unmaintained average queue length which may not prevent the router buffers from building up, then dropping packets.
ABSTRACT Rapid access to information is essential for a wide variety of retrieval systems and app... more ABSTRACT Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but was considered an exotic [15] and not appropriate when sequential or range searches are also required. To change that, we extend order preserving perfect hash [11] functions to handle sequential access to lexicographically ordered records.
Page 1. | | I. I. E Edward I. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud U biquitous in a... more Page 1. | | I. I. E Edward I. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud U biquitous in areas includ-ing artificial intelligence, data structures, database management, file process-ing, and information re-trieval is the need to access items based on the value of a key. ...
Title page for ETD etd-10202005-102821. Type of Document, Dissertation. Author, Daoud, Amjad M. U... more Title page for ETD etd-10202005-102821. Type of Document, Dissertation. Author, Daoud, Amjad M. URN, etd-10202005-102821. Title, Efficient data structures for information retrieval. Degree, Ph. D. Department, Computer Science and Applications. Advisory Committee, Advisor Name, Title. No Advisors Found. Keywords, Data structures (Computer science); Information storage and retrieval systems. Date of Defense, 1993-00-00. Availability, restricted. Abstract. Files, Filename, Size, Approximate Download Time (Hours:Minutes:Seconds). ...
Proceedings of the ACM first workshop on …, Jan 1, 2007
Abstract We describe the design and implementation of the SMARTER prototype system for collecting... more Abstract We describe the design and implementation of the SMARTER prototype system for collecting, structuring and searching information derived from full text ebooks available on the World Wide Web [4]. Standard methods of parsing and extended Boolean schemes for weighting are used to build an index of individual pages. Ranked pages are retrieved from the system by means of a correlated and combined p-norm and vector query mechanisms. Furthermore, we present a complete evaluation of the relative effectiveness of the ...
ABSTRACT Morphological analysis of Arabic words allows decreasing the storage requirements of the... more ABSTRACT Morphological analysis of Arabic words allows decreasing the storage requirements of the Arabic dictionaries, more efficient encoding of diacritical Arabic text, faster spelling and efficient Optical character recognition. All these factors allow efficient storage and archival of multilingual digital libraries that include Arabic texts.
Proceedings of the ACM first workshop on …, Jan 1, 2007
Abstract We describe a new practical algorithm for finding perfect hash functions with no specifi... more Abstract We describe a new practical algorithm for finding perfect hash functions with no specification space at all, suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time. The perfect hash functions produced are optimal in terms of time (perfect) and require at most computation of h 1 (k) and h 2 (k); two simple auxiliary pseudorandom functions.
We describe the design and implementation of the NETBOOK prototype system for collecting, structu... more We describe the design and implementation of the NETBOOK prototype system for collecting, structuring and efficiently creating semantic vectors for concepts, noun phrases, and documents from a corpus of free full text ebooks available on the World Wide Web. Automatic generation of concept maps from correlated index terms and extracted noun phrases are used to build a powerful conceptual index of individual pages. To ensure scalabilty of our system, dimension reduction is performed using Random Projection [13]. ...
Abstract Computer simulation is widely-used in investigating the performance of existing and prop... more Abstract Computer simulation is widely-used in investigating the performance of existing and proposed systems in many areas of science, engineering, operations research, and management science, especially in applications characterized by complicated geometries and interaction probabilities, and for dealing with system design in the presence of uncertainty. This is particularly true in the case of computer systems and computer networks.
Congestion is a fundamental problem in computer networks. Congestion may occur at router buffers ... more Congestion is a fundamental problem in computer networks. Congestion may occur at router buffers of networks when the number of incoming packets cannot be absorbed by the available network resources such as buffer spaces. A poor network performance can be offered due to congestion, eg high dropping and queueing delay for packets, low throughput and unmaintained average queue length which may not prevent the router buffers from building up, then dropping packets.
ABSTRACT Rapid access to information is essential for a wide variety of retrieval systems and app... more ABSTRACT Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but was considered an exotic [15] and not appropriate when sequential or range searches are also required. To change that, we extend order preserving perfect hash [11] functions to handle sequential access to lexicographically ordered records.
Page 1. | | I. I. E Edward I. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud U biquitous in a... more Page 1. | | I. I. E Edward I. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud U biquitous in areas includ-ing artificial intelligence, data structures, database management, file process-ing, and information re-trieval is the need to access items based on the value of a key. ...
Title page for ETD etd-10202005-102821. Type of Document, Dissertation. Author, Daoud, Amjad M. U... more Title page for ETD etd-10202005-102821. Type of Document, Dissertation. Author, Daoud, Amjad M. URN, etd-10202005-102821. Title, Efficient data structures for information retrieval. Degree, Ph. D. Department, Computer Science and Applications. Advisory Committee, Advisor Name, Title. No Advisors Found. Keywords, Data structures (Computer science); Information storage and retrieval systems. Date of Defense, 1993-00-00. Availability, restricted. Abstract. Files, Filename, Size, Approximate Download Time (Hours:Minutes:Seconds). ...
Proceedings of the ACM first workshop on …, Jan 1, 2007
Abstract We describe the design and implementation of the SMARTER prototype system for collecting... more Abstract We describe the design and implementation of the SMARTER prototype system for collecting, structuring and searching information derived from full text ebooks available on the World Wide Web [4]. Standard methods of parsing and extended Boolean schemes for weighting are used to build an index of individual pages. Ranked pages are retrieved from the system by means of a correlated and combined p-norm and vector query mechanisms. Furthermore, we present a complete evaluation of the relative effectiveness of the ...
ABSTRACT Morphological analysis of Arabic words allows decreasing the storage requirements of the... more ABSTRACT Morphological analysis of Arabic words allows decreasing the storage requirements of the Arabic dictionaries, more efficient encoding of diacritical Arabic text, faster spelling and efficient Optical character recognition. All these factors allow efficient storage and archival of multilingual digital libraries that include Arabic texts.
Proceedings of the ACM first workshop on …, Jan 1, 2007
Abstract We describe a new practical algorithm for finding perfect hash functions with no specifi... more Abstract We describe a new practical algorithm for finding perfect hash functions with no specification space at all, suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time. The perfect hash functions produced are optimal in terms of time (perfect) and require at most computation of h 1 (k) and h 2 (k); two simple auxiliary pseudorandom functions.
We describe the design and implementation of the NETBOOK prototype system for collecting, structu... more We describe the design and implementation of the NETBOOK prototype system for collecting, structuring and efficiently creating semantic vectors for concepts, noun phrases, and documents from a corpus of free full text ebooks available on the World Wide Web. Automatic generation of concept maps from correlated index terms and extracted noun phrases are used to build a powerful conceptual index of individual pages. To ensure scalabilty of our system, dimension reduction is performed using Random Projection [13]. ...
Uploads