检索结果-内蒙古大学图书馆

Workshop on imaging science development for cancer prevention and preemption

Cancer Biomarkers 2007年第1期3卷 1-33页

作者： Kelloff, Gary J. Sullivan, Daniel C. Baker, Houston Clarke, Lawrence P. Nordstrom, Robert Tatum, James L. Dorfman, Gary S. Jacobs, Paula Berg, Christine D. Pomper, Martin G. Birrer, Michael J. Tempero, Margaret Higley, Howard R. Petty, Brenda Gumbs Sigman, Caroline C. Maley, Carlo Sharma, Prateek Wax, Adam Ginsberg, Gregory G. Dannenberg, Andrew J. Hawk, Ernest T. Messing, Edward M. Grossman, H. Barton Harisinghani, Mukesh Bigio, Irving J. Griebel, Donna Henson, Donald E. Fabian, Carol J. Ferrara, Katherine Fantini, Sergio Schnall, Mitchell D. Zujewski, Jo Anne Hayes, Wendy Klein, Eric A. DeMarzo, Angelo Ocak, Iclal Ketterling, Jeffrey A. Tempany, Clare Shtern, Faina Parnes, Howard L. Gomez, Jorge Srivastava, Sudhir Szabo, Eva Lam, Stephen Seibel, Eric J. Massion, Pierre McLennan, Geoffrey Cleary, Kevin Suh, Robert Burt, Randall W. Pfeiffer, Ruth M. Hoffman, John M. Roy, Hemant K. Wang, Thomas Limburg, Paul J. El-Deiry, Wafik S. Papadimitrakopoulou, Vali Hittelman, Walter N. MacAulay, Calum Veltri, Robert W. Solomonzz, Diane Jeronimo, Jose Richards-Kortum, Rebecca Johnson, Karen A. Viner, Jaye L. Stratton, Steven P. Rajadhyaksha, Milind Dhawan, Atam NIH/NCI/DCTD Cancer Imaging Program Bethesda MD United States NIH/NCI/DCTD Cancer Imaging Program NCI-Frederick Frederick MD United States NIH/NCI/DCP Early Detection Research Group Bethesda MD United States The Johns Hopkins University School of Medicine Departments of Radiology Pharmacology and Oncology Division of Neuroradiology Baltimore MD United States NIH/NCI/CCR Cell and Cancer Biology Branch Bethesda MD United States University of California San Francisco Department of Medicine Division of Medical Oncology San Francisco CA United States CCS Associates Inc. Mountain View CA United States Wistar Institute Molecular and Cellular Oncogenesis Program Philadelphia PA United States University of Kansas School of Medicine VA Hospital Kansas City MO United States Duke University Department of Biomedical Engineering Medical Physics Program Durham NC United States University of Pennsylvania School of Medicine Department of Gastroenterology Philadelphia PA United States New York Presbyterian Hospital Weill Medical College of Cornell University New York NY United States NIH/NCI/OD Office of Centers for Training and Resources Bethesda MD United States University of Rochester Medical Center Department of Urology Rochester NY United States University of Texas MD Anderson Cancer Center Department of Urology Houston TX United States Massachusetts General Hospital Abdominal Imaging/Interventional Radiology Boston MA United States Boston University Biomedical Engineering Electrical and Computer Engineering and Physics Boston MA United States NIH/NCI/DCP Gastrointestinal and Other Cancers Research Group Bethesda MD United States The George Washington University Cancer Institute Office of Cancer Prevention and Control Washington DC United States University of Kansas Cancer Center Clinical Oncology Kansas City KS United States University of California Davis Department of Biomedical Engineering Davis CA United States Tufts University De

The concept of intraepithelial neoplasm (IEN) as a near-obligate precursor of cancers has generated opportunities to examine drug or device intervention strategies that may reverse or retard the sometimes lengthy process of carcinogenesis. Chemopreventive agents with high therapeutic indices, well-monitored for efficacy and safety, are greatly needed, as is development of less invasive or minimally disruptive visualization and assessment methods to safely screen nominally healthy but at-risk patients, often for extended periods of time and at repeated intervals. Imaging devices, alone or in combination with anticancer drugs, may also provide novel interventions to treat or prevent precancer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An optimal overlay topology for routing peer-to-peer searches

An optimal overlay topology for routing peer-to-peer searche...

引用

ACM/IFIP/USENIX 6th International Middleware Conference, Middleware 2005

作者： Cooper, Brian F. Center for Experimental Research in Computer Systems College of Computing Georgia Institute of Technology United States

ISBN: (纸本)3540303235

Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to distributed collaboration. Often it is assumed that unstructured networks will form a power-law topology;however, a power-law structure is not the best topology for an unstructured network. In this paper, we introduce the square-root topology, and show that this topology significantly improves routing performance compared to power-law networks. In the square-root topology, the degree of a peer is proportional to the square root of the popularity of the content at the peer. Our analysis shows that this topology is optimal for random walk searches. We also present simulation results to demonstrate that the square-root topology is better, by up to a factor of two, than a power-law topology for other types of search techniques besides random walks. We then describe a decentralized algorithm for forming a square-root topology, and evaluate its effectiveness in constructing efficient networks using both simulations and experiments with our implemented prototype. Our results show that the squareroot topology can provide a significant performance improvement over power-law topologies and other topology types. © IFIP International Federation for Information Processing 2005

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Quickly routing searches without having to move content

Quickly routing searches without having to move content

引用

4th International Workshop on Peer-to-Peer systems, IPTPS 2005

作者： Cooper, Brian F. Center for Experimental Research in Computer Systems College of Computing Georgia Institute of Technology United States

ISBN: (纸本)3540290680

A great deal of work has been done to improve peer-to-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer architecture might be appropriate, but in which content movement ia not feasible. We argue that even in such applications, progress can be made in developing techniques that ensure efficient searches. We present several such techniques. First, we show that organizing tho network into a square-root topology, whore peer degrees are proportional to the square root of the popularity of their content, provides much better performance than power-law networks. Second, we present routing optimizations based on the amount of content stored at peers, and tracking the "best" peers, that can further improve performance. These and other techniques can make searches efficient, even when content movement or replication is not feasible. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

Towards automated deployment of built-to-order systems

引用

16th IFIP/IEEE International Workshop on Distributed systems: Operations and Management, DSOM 2005

作者： Sahai, Akhil Pu, Calton Jung, Gueyoung Wu, Qinyi Yan, Wenchang Swint, Galen S. HP Laboratories Palo-AltoCA United States Center for Experimental Research in Computer Systems College of Computing Georgia Institute of Technology 801 Atlantic Drive AtlantaGA30332 United States

ISBN: (纸本)3540293884

End-to-end automated application design and deployment poses a significant technical challenge. With increasing scale and complexity of IT systems and the manual handling of existing scripts and configuration files for application deployment that makes them increasingly error-prone and brittle, this problem has become more acute. Even though design tools have been used to automate system design, it is usually difficult to translate these designs to deployed systems in an automated manner due to both syntactic obstacles and the synchronization of multiple activities involved in such a deployment. We describe a generic process of automated deployment from design documents and evaluate this process for 1, 2, and 3-tier distributed applications. © IFIP International Federation for Information Processing 2005.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Addressing data compatibility on programmable network platforms 05

Addressing data compatibility on programmable network platfo...

引用

ACM/IEEE Symposium Architecture for Networking and Communications systems, ANCS

作者： Ada Gavrilovska Karsten Schwan Center for Experimental Research Computer Systems (CERCS)College of Computing Georgia Institute of Technology Atlanta GA USA

ISBN: (纸本)9781595930828

Large-scale applications require the efficient exchange of data across their distributed components, including data from heterogeneous sources and to widely varying clients. Inherent to such data exchanges are (1) discrepancies among the data representations used by sources, clients, or intermediate application components (e.g., due to natural mismatches or due to dynamic component evolution), and (2) requirements to route, combine, or otherwise manipulate data as it is being transferred. As a result, there is an ever growing need for data conversion services, handled by stubs in application servers, by middleware or messaging services, by the operating system, or by the network. This paper's goal is to demonstrate and evaluate the ability of modern network processors to efficiently address data compatibility issues, when data is 'in transit' between application-level services. Toward this end, we present the design and implementation of a network-level execution environment that permits systems to dynamically deploy and configure application- level data conversion services 'into' the network infrastructure. experimental results obtained with a prototype implementation on Intel's IXP2400 network processors include measurements of XML-like data format conversions implemented with efficient binary data formats.

关键词： computer networks Distributed computing Network servers Delay Data conversion Middleware Data mining Engines Educational institutions Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Challenges of molecular nanotechnology for space exploration

Challenges of molecular nanotechnology for space exploration

引用

AIAA Space 2005 Conference and Exposition

作者： McKendree, Thomas L. Freitas Jr., Robert A. Globus, Al Creon Levit, M. David Sherrill, C. Li, Mo Merkle, Ralph C. Raytheon Fullerton CA 92646-3310 Institute of Molecular Manufacturing Palo Alto CA 94301 Computer Sciences Corporation Moffett Field CA 94035 NASA Ames Research Center Moffett Field CA 94035-1000 Georgia Institute of Technology Atlanta GA 30332 Network Centric Systems FU/676/X343 92843-3310 555 Bryant Street Evolvable Systems Group MS 269-3 Advanced Supercomputing Division MS T27-A 770 State Street 30332-0400 771 Ferst Drive N.W 30332-0245 College of Computing 801 Atlantic Dr. 30332-0280

ISBN: (纸本)1563477386

Molecular nanotechnology is the future capability to design and build systems to atomic precisions. This paper motivates the desire of molecular nanotechnology for space exploration with a review of potential benefits, and reviews relevant progress to date for molecular nanotechnology. It provides a framework of challenges that need to be resolved before molecular nanotechnology can be applied to space systems, with discussion on addressing those challenges. The primary focus is in the area of developing tools for automated design of molecular components, using molecular connector components as an example, and in developing tools for generating reaction pathways to fabricate molecular components that can integrate with tools for developing molecular components. The secondary focus is issues for the molecular fabrication system, including integration with the design of end product space systems.

关键词： Nanotechnology

来源：评论

学校读者我要写书评

暂无评论

Challenges of molecular nanotechnology for space exploration

Challenges of molecular nanotechnology for space exploration

引用

Space 2005

作者： McKendree, Thomas L. Freitas Jr., Robert A. Globus, Al Levit, M. Creon Sherrill, C. David Li, Mo Merkle, Ralph C. Raytheon Network Centric Systems Fullerton CA 92646-3310 United States Institute of Molecular Manufacturing 555 Bryant Street Palo Alto CA 94301 United States Computer Sciences Corporation Evolvable Systems Group Moffett Field MS 269-3 CA 94035 United States NASA Ames Research Center Advanced Supercomputing Division Moffett Field MS T27-A CA 94035-1000 United States Georgia Institute of Technology Chemistry and Biochemistry 770 State Street Atlanta GA 30332-0400 United States Georgia Institute of Technology Materials Science and Engineering 771 Ferst Drive NW Atlanta GA 30332-0245 United States Georgia Institute of Technology College of Computing 801 Atlantic Dr Atlanta GA 30332-0280 United States

ISBN: (纸本)1563477386

关键词： Space research

来源：评论

学校读者我要写书评

暂无评论

Journal of Information Science and Engineering: Editorial notice

引用

Journal of Information Science and Engineering 2005年第5期21卷 i-ii页

作者： Lee, Der-Tsai Amato, Nancy M. Chang, Shih-Fu Chen, Homer H. Chen, Tsuhan Hsu, Tsan-Sheng Hwang, Jenq-Neng Kuo, Sy-Yen Kuo, Tei-Wei Li, Chung-Sheng Tokuyama, Takeshi Wing, Jeannette Wu, Tzong-Chen Yen, John Computer Science at Texas A and M University United States Parasol Laboratory United States IEEE Transactions on Parallel and Distributed Systems Computing Research Association's Committee on the Status of Women in Computing Research CRA-W's Distributed Mentor Program United States Department of Electrical Engineering Columbia University United States Lab. United States College of Electrical Engineering and Computer Science National Taiwan University Taiwan IEEE Transactions on Circuits and Systems for Video Technology IEEE Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States ACM ACM SIGACT IEEE Computer Society IICM Austria Research and Development of the Department Multimedia Signal Processing Technical Committee IEEE Signal Processing Society United States IEEE Transactions on Circuits and systems for Video Technology College of Electrical Engineering and Computer Science National Taiwan Ocean University Keelung Taiwan Department of Electrical Engineering National Taiwan University Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan IEEE Technical Committee on Real-Time Systems Computer Science Division IBM T.J. Watson Research Center United States IBM Research Division Graduate School of Information Sciences Tohoku University Japan ACM IPSJ Mathematical Society of Japan Japan Department of Computer Science Computer Science Department Carnegie Mellon University United States National Academies of Science's Computer Science and Telecommunications Board United States Microsoft's Trustworthy Academic Advisory Board Intel Research Pittsburgh's Advisory Board United States Dartmouth's Institute for Security Technology Studies Advisory Committee Canada Sloan Research Fellowships Program Committee United States ACM Taiwan China Information Sciences and Technology Pennsylvania State University United States Laboratory for Intelligent Agents Penn State's School of Info

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

A content model for evaluating peer-to-peer searching techniques

A content model for evaluating peer-to-peer searching techni...

引用

5th International Middleware Conference, Middleware 2004

作者： Cooper, Brian F. Center for Experimental Research in Computer Systems College of Computing Georgia Institute of Technology Georgia

ISBN: (纸本)3540234284

Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in their modeling of queries and documents, they may not reflect how search techniques will perform in real networks, leading to incorrect conclusions about which techniques are best. We describe how to model content so that simulations produce accurate results. We present a content model for peer-to-peer networks, which consists of a tripartite graph with edges connecting queries to the documents they match, and documents to the peers they are stored at. Our model also includes a set of statistics describing how often queries match the same documents, and how often similar documents are stored at the same peer. We can construct our tripartite content model by running queries over live data stored at real Internet nodes, and simulation results show that searching techniques do indeed perform differently in simulations using this "real" content model versus a randomly generated model. We then present an algorithm for using real content gathered from a small set of peers (say, 1,000) to generate a synthetic content model for large simulated networks (say, 10,000 nodes or more). Finally, we use a synthetic model generated from World Wide Web documents and queries to compare the performance of several search algorithms that have been reported in the literature. © IFIP International Federation for Information Processing 2004.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Guiding queries to information sources with infobeacons

Guiding queries to information sources with infobeacons

引用

5th International Middleware Conference, Middleware 2004

作者： Cooper, Brian F. Center for Experimental Research in Computer Systems College of Computing Georgia Institute of Technology Georgia

ISBN: (纸本)3540234284

The Internet provides a wealth of useful information in a vast number of dynamic information sources, but it is difficult to determine which sources are useful for a given query. Most existing techniques either require explicit source cooperation (for example, by exporting data summaries), or build a relatively static source characterization (for example, by assigning a topic to the source). We present a system, called InfoBeacons, that takes a different approach: data and sources are left "as is," and a peer-to-peer network of beacons uses past query results to "guide" queries to sources, who do the actual query processing. This approach has several advantages, including requiring minimal changes to sources, tolerance of dynamism and heterogeneity, and the ability to scale to large numbers of sources. We present the architecture of the system, and discuss the advantages of our design. We then focus on how a beacon can choose good sources for a query despite the loose coupling of beacons to sources. Beacons cache responses to previous queries and adapt the cache to changes at the source. The cache is then used to select good sources for future queries. We discuss results from a detailed experimental study using our beacon prototype which demonstrates that our "loosely coupled" approach is effective;a beacon only has to contact sixty percent or less of the sources contacted by existing, tightly coupled approaches, while providing results of equivalent or better relevance to queries. © IFIP International Federation for Information Processing 2004.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：