• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,102
Next 10 →

HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

by Ossama Younis, Sonia Fahmy - IEEE TRANS. MOBILE COMPUTING , 2004
"... Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed ..."
Abstract - Cited by 590 (1 self) - Add to MetaCart
according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in Oð1Þ iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate

Arbitrary placement of secondary nodes, and error control, IN THE MESHLESS LOCAL PETROV- GALERKIN (MLPG) METHOD

by H.-g. Kim, S. N. Atluri - COMPUTER MODELING IN ENGINEERING & SCIENCES , 2000
"... The truly meshless local Petrov-Galerkin (MLPG) method holds a great promise in solving boundary value problems, using a local symmetric weak form as a natu-ral approach. In the present paper, in the context of MLPG and the meshless interpolation of a moving least squares (MLS) type, a method which ..."
Abstract - Cited by 13 (3 self) - Add to MetaCart
which uses primary and secondary nodes in the domain and on the global boundary is introduced, in order to improve the accuracy of solution. The secondary nodes can be placed at any location where one needs to obtain a better res-olution. The sub-domains for the shape functions in the MLS approximation

Symbiotic Cognitive Relaying with mobile Secondary nodes in Cognitive Radio Networks

by Prakash Chaki, Gouri Nawathe, Aaqib Patel, S. N. Merchant, U. B. Desai
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Locality-Aware Request Distribution in Cluster-based Network Servers

by Vivek Pai, Mohit Aron, Gaurav Banga, Michael Svendsen, Peter Druschel, Willy Zwaenepoel, Erich Nahum , 1998
"... We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information about the load on the back-end nodes, to choose ..."
Abstract - Cited by 327 (21 self) - Add to MetaCart
, to choose which back-end will handle this request. Content-based request distribution can improve locality in the back-ends' main memory caches, increase secondary storage scalability by partitioning the server's database, and provide the ability to employ back-end nodes that are specialized

Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach

by Ossama Younis, Sonia Fahmy , 2004
"... Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in adhoc sens ..."
Abstract - Cited by 307 (12 self) - Add to MetaCart
sensor networks. Based on this approach, we present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED does

Local similarity in RNA secondary structures

by Matthias Höchsmann , 2003
"... We present a systematic treatment of alignment distance and local similarity algorithms on trees and forests. We build upon the tree alignment algorithm for ordered trees given by Jiang et. al (1995) and extend it to calculate local forest alignments, which is essential for finding local similar reg ..."
Abstract - Cited by 110 (4 self) - Add to MetaCart
regions in RNA secondary structures. The time complexity of our algorithm is O(|F1 | ·|F2 | ·deg(F1) · deg(F2) · (deg(F1) +deg(F2)) where |Fi | is the number of nodes in forest Fi and deg(Fi) is the degree of Fi. We provide carefully engineered dynamic programming implementations using dense, two

Spectrum Leasing to Cooperating Secondary ad hoc Networks

by O. Simeone, I. Stanojev, S. Savazzi, Y. Bar-ness, U. Spagnolini, R. Pickholtz - IEEE JSAC , 2008
"... Abstract—The concept of cognitive radio (or secondary spectrum access) is currently under investigation as a promising paradigm to achieve efficient use of the frequency resource by allowing the coexistence of licensed (primary) and unlicensed (secondary) users in the same bandwidth. According to th ..."
Abstract - Cited by 78 (5 self) - Add to MetaCart
to the property-rights model of cognitive radio, the primary terminals own a given bandwidth and may decide to lease it for a fraction of time to secondary nodes in exchange for appropriate remuneration. In this paper, we propose and analyze an implementation of this framework, whereby a primary link has

Efficient Locking for Concurrent Operations on B-Trees

by Philip L. Lehman, S. Bing Yao - ACM Transactions on Database Systems , 1981
"... The B-tree and its variants have been found to be highly useful (both theoretically and in practice) for storing large amounts ofinformation, especially on secondary storage devices. We examine the problem of overcoming the inherent difficulty of concurrent operations on such structures, using a pra ..."
Abstract - Cited by 177 (1 self) - Add to MetaCart
The B-tree and its variants have been found to be highly useful (both theoretically and in practice) for storing large amounts ofinformation, especially on secondary storage devices. We examine the problem of overcoming the inherent difficulty of concurrent operations on such structures, using a

Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach

by Christoph Koch , 2003
"... We propose a new, highly scalable and efficient technique for evaluating node-selecting queries on XML trees which is based on recent advances in the theory of tree automata. Our query ..."
Abstract - Cited by 56 (6 self) - Add to MetaCart
We propose a new, highly scalable and efficient technique for evaluating node-selecting queries on XML trees which is based on recent advances in the theory of tree automata. Our query

Mice lacking expression of secondary lymphoid organ chemokine have defects in lymphocyte homing and dendritic cell localization

by D. Gunn, Shigeru Kyuwa, Carmen Tam, Terutaka Kakiuchi, Akio Matsuzawa, Lewis T. Williams, Hideki Nakano , 1999
"... Secondary lymphoid organ chemokine (SLC) is expressed in high endothelial venules and in T cell zones of spleen and lymph nodes (LNs) and strongly attracts naive T cells. In mice homozygous for the paucity of lymph node T cell (plt) mutation, naive T cells fail to home to LNs or the lymphoid regions ..."
Abstract - Cited by 106 (6 self) - Add to MetaCart
Secondary lymphoid organ chemokine (SLC) is expressed in high endothelial venules and in T cell zones of spleen and lymph nodes (LNs) and strongly attracts naive T cells. In mice homozygous for the paucity of lymph node T cell (plt) mutation, naive T cells fail to home to LNs or the lymphoid
Next 10 →
Results 1 - 10 of 1,102
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University