• 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,309
Next 10 →

LEUCOCYTE ASCORBIC ACID AN UNRELIABLE ESTIMATE OF

by Anita J. Thomas, Roger S. Briggs, S Xy
"... Leucocyte ascorbic acid levels failed to identify six of seven elderly patients shown to be deficient on an oral vitamin C saturation test. Compared to those with a normal saturation test, patients judged deficient had lower levels for triceps skinfold thickness, mean arm muscle circumference and Qu ..."
Abstract - Add to MetaCart
Leucocyte ascorbic acid levels failed to identify six of seven elderly patients shown to be deficient on an oral vitamin C saturation test. Compared to those with a normal saturation test, patients judged deficient had lower levels for triceps skinfold thickness, mean arm muscle circumference and Quetelet's index; there was a significant association with the habit of eating alone, and with a dietary intake of less than 30 mg of ascorbic acid daily (the recommended daily allowance in the U.K.). No significant difference was found in the values for haemoglobin, serum albumin or potassium concentrations between the two groups, and no association shown between a deficient saturation test and smoking, season, sublingual varicosities or an abnormal bleeding time.

Allocating online advertisement space with unreliable estimates

by Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi - In Proceedings of the 8th ACM Conference on Electronic Commerce (EC , 2007
"... We study the problem of optimally allocating online advertisement space to budget-constrained advertisers. This problem was defined and studied from the perspective of worst-case online competitive analysis by Mehta et al. Our objective is to find an algorithm that takes advantage of the given estim ..."
Abstract - Cited by 56 (8 self) - Add to MetaCart
estimates of the frequencies of keywords to compute a near optimal solution when the estimates are accurate, while at the same time maintaining a good worst-case competitive ratio in case the estimates are totally incorrect. This is motivated by real-world situations where search engines have stochastic

Splitting Sequential Monte Carlo for Efficient Unreliability Estimation of Highly Reliable Networks

by Radislav Vaisman, Dirk P. Kroese, Ilya B. Gertsbakh
"... Assessing the reliability of complex technological systems such as communi-cation networks, transportation grids, and bridge networks is a difficult task. From a mathematical point of view, the problem of estimating network reli-ability belongs to the #P complexity class. As a consequence, no analyt ..."
Abstract - Add to MetaCart
Assessing the reliability of complex technological systems such as communi-cation networks, transportation grids, and bridge networks is a difficult task. From a mathematical point of view, the problem of estimating network reli-ability belongs to the #P complexity class. As a consequence

Word Association Norms, Mutual Information, and Lexicography

by Kenneth Ward Church, Patrick Hanks , 1990
"... This paper will propose an objective measure based on the information theoretic notion of mutual information, for estimating word association norms from computer readable corpora. (The standard method of obtaining word association norms, testing a few thousand subjects on a few hundred words, is b ..."
Abstract - Cited by 1144 (11 self) - Add to MetaCart
, is both costly and unreliable.) The proposed measure, the association ratio, estimates word association norms directly from computer readable corpora, making it possible to estimate norms for tens of thousands of words

Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm

by Yongyue Zhang, Michael Brady, Stephen Smith - IEEE TRANSACTIONS ON MEDICAL. IMAGING , 2001
"... The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogram-based model, the FM has an intrinsic limi ..."
Abstract - Cited by 639 (15 self) - Add to MetaCart
-based methods produce unreliable results. In this paper, we propose a novel hidden Markov random field (HMRF) model, which is a stochastic process generated by a MRF whose state sequence cannot be observed directly but which can be indirectly estimated through observations. Mathematically, it can be shown

The Unreliability of Output Gap Estimates in Real Time

by Athanasios Orphanides, Simon van Norden , 2001
"... ..."
Abstract - Cited by 116 (3 self) - Add to MetaCart
Abstract not found

Kalman filtering with intermittent observations

by Bruno Sinopoli, Luca Schenato, Massimo Franceschetti, Kameshwar Poolla, Michael I. Jordan, Shankar S. Sastry - IEEE TRANSACTIONS ON AUTOMATIC CONTROL , 2004
"... Motivated by navigation and tracking applications within sensor networks, we consider the problem of performing Kalman filtering with intermittent observations. When data travel along unreliable communication channels in a large, wireless, multihop sensor network, the effect of communication delays ..."
Abstract - Cited by 295 (41 self) - Add to MetaCart
Motivated by navigation and tracking applications within sensor networks, we consider the problem of performing Kalman filtering with intermittent observations. When data travel along unreliable communication channels in a large, wireless, multihop sensor network, the effect of communication

A line in the sand: a wireless sensor network for target detection, classification, and tracking

by A. Arora , P. Dutta , S. Bapat , V. Kulathumani , H. Zhang , V. Naik, V. Mittal , H. Cao , M. Demirbas , M. Gouda , Y. Choi , T. Herman , et al. - COMPUTER NETWORKS , 2004
"... Intrusion detection is a surveillance problem of practical import that is well suited to wireless sensor networks. In this paper, we study the application of sensor networks to the intrusion detection problem and the related problems of classifying and tracking targets. Our approach is based on a de ..."
Abstract - Cited by 272 (41 self) - Add to MetaCart
, and middleware services. We introduce the influence field, which can be estimated from a network of binary sensors, as the basis for a novel classifier. A contribution of our work is that we do not assume a reliable network; on the contrary, we quantitatively analyze the effects of network unreliability

Fundamental challenges in mobile computing

by M. Satyanarayanan - In ACM Symposium on Principles of Distributed Computing , 1996
"... This paper is an answer to the question: "What is unique and conceptually different about mobile computing? " The paper begins by describing a set of constraints intrinsic to mobile computing, and examining the impact of these constraints on the design of distributed systems. Next, it summ ..."
Abstract - Cited by 267 (18 self) - Add to MetaCart
, it summarizes the key results of the Coda and Odyssey systems. Finally, it describes the research opportunities in five important topics relevant to mobile computing: caching metrics, semantic callbacks and validators, resource revocation, analysis of adaptation, and global estimation from local observations. 1

A scheme for robust distributed sensor fusion based on average consensus

by Lin Xiao, Stephen Boyd , Sanjay Lall - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING IN SENSOR NETWORKS (IPSN , 2005
"... We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihoo ..."
Abstract - Cited by 257 (3 self) - Add to MetaCart
compute a local weighted least-squares estimate, which converges to the global maximum-likelihood solution. This scheme is robust to unreliable communication links. We show that it works in a network with dynamically changing topology, provided that the infinitely occurring communication graphs
Next 10 →
Results 1 - 10 of 1,309
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