Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Physical Sciences and Mathematics
Load-Sensitive Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, Raghupathy Sivakumar
Load-Sensitive Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, Raghupathy Sivakumar
Computer Science Faculty Research & Creative Works
Transmission power control in ad-hoc networks has hitherto been used only for achieving connectivity of networks. It has been implicitly assumed that the optimal throughput performance in ad-hoc networks can be achieved when using the minimum transmission power required to keep the network connected. However, in this paper we argue that such an assumption remains valid only under high node densities, which is not the characteristic of typical ad-hoc networks. Using both throughput and throughput per unit energy as the optimization criteria, we demonstrate that the optimal transmission power depends on several network characteristics such as the number of stations, …
Performance Evaluation Of Linear Hash Structure Model In A Nested Transaction Environment, Malik Ayed Tubaishat, Sanjay Kumar Madria, Bharat Bhargava
Performance Evaluation Of Linear Hash Structure Model In A Nested Transaction Environment, Malik Ayed Tubaishat, Sanjay Kumar Madria, Bharat Bhargava
Computer Science Faculty Research & Creative Works
We design and implement a linear hash algorithm in nested transaction environment to handle large amount of data with increased concurrency. Nested transactions allow parallel execution of transactions, and handle transaction aborts, thus provides more concurrency and efficient recovery. We use object-oriented methodology in the implementation which helped in designing the programming components independently. In our model, buckets are modeled as objects and linear hash operations are modeled as methods. The papers contribution is novel in the sense that the system, to our knowledge, is the first to implement linear hashing in a nested transactions environment. We have built a …
Anatomy Of The Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria, Ee Peng Lim
Anatomy Of The Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria, Ee Peng Lim
Computer Science Faculty Research & Creative Works
To populate a data warehouse specifically designed for Web data, i.e. web warehouse, it is imperative to harness relevant documents from the Web. In this paper, we describe a query mechanism called coupling query to glean relevant Web data in the context of our web warehousing system called Warehouse of Web Data (WHOWEDA). Coupling query may be used for querying both HTML and XML documents. Some of the important features of our query mechanism are ability to query metadata, content, internal and external (hyperlink) structure of Web documents based on partial knowledge, ability to express constraints on tag attributes and …
Quantitative Analysis Of Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, R. Sivakumar
Quantitative Analysis Of Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, R. Sivakumar
Computer Science Faculty Research & Creative Works
In this paper, we address the issue of transmission power control in wireless ad-hoc networks. In general, it is assumed that the minimum transmission power required to keep the network connected achieves the optimal throughput performance in an ad-hoc network. In contrast, we show that using the minimal transmission range might not always result in optimal throughput performance. Using both throughput and throughput per unit energy as the optimization criteria, we demonstrate that the optimal transmission power is generically a function of the number of stations, the network size, and the traffic load. In particular, we observe that the optimal …
Controlling Web Query Execution In A Web Warehouse, Sanjay Kumar Madria, Sourav S. Bhowmick
Controlling Web Query Execution In A Web Warehouse, Sanjay Kumar Madria, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
Most of the contemporary Web query systems have limited capabilities in controlling Web query execution. Such query facility is important as it gives us an opportunity to optimize the evaluation of a Web query. We address this issue in the context of our Web warehousing system called WHOWEDA (Warehouse Of Web Data). Specifically, we investigate different types of constraints (related to query execution) which may be imposed on a Web query such as number of query results, time of execution, restrict the evaluation of a query to specified set of Web sites, etc. An important feature of our approach is …
A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani
A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani
Computer Science Faculty Research & Creative Works
No abstract provided.
Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz
Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz
Computer Science Faculty Research & Creative Works
Adaptive information filtering is concerned with filtering information streams in dynamic (changing) environments. The changes may occur both on the transmission side — the nature of the streams can change — and on the reception side — the interests of the user (or group of users) can change. While information filtering and information retrieval have a lot in common, this dissertation’s primary concern is with the differences. The temporal nature of information filtering necessitates more flexible document representation methods than does information retrieval where all the occurring terms are known in advance. Also, information filtering typically maintains user interest profiles …
Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya
Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya
Computer Science Faculty Research & Creative Works
Content-based searches and retrievals in multimedia and image databases use high-dimensional indexing structures for organizing the features of the objects. Most of those index structures are tree-structured whose nodes have a limit on the number of entries describing the subtrees rooted at those nodes. When index trees are built by repeated insertion of entries, nodes need to be split and the tree balanced accordingly. Node-splitting algorithms eventually determine the final structure of the tree which will have a profound effect on the search performance. This paper presents a comparative study of several node splitting algorithms for a typical high-dimensional indexing …