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

2009 IEEE International Conference on Communications Technology and Applications, IEEE ICCTA2009

作者： Xiong, Yongping Niu, Jianwei Jian, Ma. Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Graduate University of the Chinese Academy of Sciences Beijing 100039 China School of Computer Science and Engineering Beihang University Beijing 100191 China Nokia Research Center Beijing 100176 China

ISBN: (纸本)9781424448203

Sensors are now attached to a lot of mobile objects such as animals and vehicles to collect data. This forms intermittently connected mobile sensor network due to weak communication power and nodal mobility, in which conventional routing protocols in wireless sensor network don't work. In this paper, we propose a data harvesting scheme for intermittently connected mobile sensor network. This approach takes fully advantage of storage resource and mobility pattern knowledge to improve the delivery ratio while minimizing the transmission overhead. We evaluate the performance of the approach through the OMNet++ simulator with the realistic mobility traces. The simulation results show that the proposed scheme achieves high delivery ratio while controlling the transmission overhead. Furthermore, the robust approach can be adaptive to the dynamic topology of network. ©2009 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

A publish-subscribe algorithm for environment awareness in MANETs

A publish-subscribe algorithm for environment awareness in M...

引用

IET International Communication Conference on Wireless Mobile and computing (CCWMC 2009)

作者： Niu, Jianwei Liu, Chang Xiong, Yongping Ma, Jian School of Computer Science and Engineering Beihang University Beijing 100191 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Nokia Research Center Beijing 100176 China Graduate University Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9781849191388

The mobile ad hoc networks are characterized by frequent disconnections and partitioning. In this paper, we focus on data dissemination service. We propose a publish/subscribe protocol for MANETs, which is called SAPS algorithm. This Self-Adaptive Publish/Subscribe (SAPS for short) Algorithm makes use of the information about the users' context and social behaviours, to decide how to obtain useful data. Furthermore, the subscribe nodes do not subscribe information periodically, instead, they adjust their subscribe cycle dynamically according to their context and social behaviours. We compare it with Regular Broadcast algorithm and Uniform algorithm in a series of simulation scenarios, the results of which show that our solution is able to improve data availability, use the energy of nodes efficiently, and reduce the network load.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Predicting helix-helix interactions from residue contacts in membrane proteins

引用

Bioinformatics 2009年第8期25卷 996-1003页

作者： Lo, Allan Chiu, Yi-Yuan Rødland, Einar Andreas Lyu, Ping-Chiang Sung, Ting-Yi Hsu, Wen-Lian Bioinformatics Program Taiwan International Graduate Program Academia Sinica Taipei Taiwan Institute of Bioinformatics and Structural Biology Department of Life Sciences National Tsing Hua University Hsinchu Taiwan Bioinformatics Laboratory Institute of Information Science Academia Sinica Taipei Taiwan Centre for Cancer Biomedicine University of Oslo NO-0027 Oslo Norway SAMBA Norwegian Computing Center Blindern NO-0314 Oslo P.O. Box 114 Norway

Motivation: Helix-helix interactions play a critical role in the structure assembly, stability and function of membrane proteins. On the molecular level, the interactions are mediated by one or more residue contacts. Although previous studies focused on helix-packing patterns and sequence motifs, few of them developed methods specifically for contact prediction. Results: We present a new hierarchical framework for contact prediction, with an application in membrane proteins. The hierarchical scheme consists of two levels: in the first level, contact residues are predicted from the sequence and their pairing relationships are further predicted in the second level. Statistical analyses on contact propensities are combined with other sequence and structural information for training the support vector machine classifiers. Evaluated on 52 protein chains using leave-one-out cross validation (LOOCV) and an independent test set of 14 protein chains, the two-level approach consistently improves the conventional direct approach in prediction accuracy, with 80% reduction of input for prediction. Furthermore, the predicted contacts are then used to infer interactions between pairs of helices. When at least three predicted contacts are required for an inferred interaction, the accuracy, sensitivity and specificity are 56%, 40% and 89%, respectively. Our results demonstrate that a hierarchical framework can be applied to eliminate false positives (FP) while reducing computational complexity in predicting contacts. Together with the estimated contact propensities, this method can be used to gain insights into helix-packing in membrane proteins. © 2009 The Author(s).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Matching CT and ultrasound data of the liver by landmark constrained image registration

Matching CT and ultrasound data of the liver by landmark con...

引用

Medical Imaging 2009: Visualization, Image-Guided Procedures, and Modeling

作者： Olesch, Janine Papenberg, Nils Lange, Thomas Conrad, Matthias Fischer, Bernd Institute of Mathematics University of Lübeck Germany Graduate School for Computing in Medicine and Life Sciences University of Lübeck Germany Charitë Universitätsmedizin Berlin Department of Surgery and Surgical Oncology Berlin Germany Department of Mathematics and Computer Science Emory University Atlanta GA United States

ISBN: (纸本)9780819475121

In navigated liver surgery the key challenge is the registration of pre-operative planing and intra-operative navigation data. Due to the patients individual anatomy the planning is based on segmented, pre-operative CT scans whereas ultrasound captures the actual intra-operative situation. In this paper we derive a novel method based on variational image registration methods and additional given anatomic landmarks. For the first time we embed the landmark information as inequality hard constraints and thereby allowing for inaccurately placed landmarks. The yielding optimization problem allows to ensure the accuracy of the landmark fit by simultaneous intensity based image registration. Following the discretize-then-optimize approach the overall problem is solved by a generalized Gauss-Newton-method. The upcoming linear system is attacked by the MinRes solver. We demonstrate the applicability of the new approach for clinical data which lead to convincing results. © 2009 SPIE.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

Applying quorum role in network management

Applying quorum role in network management

引用

IFIP/IEEE International Symposium on Integrated Network Management

作者： Edemilson da Silva Altair Olivo Santin Edgard Jamhour Carlos Maziero Emir Toktar Graduate Program in Computer Science Pontifical Catholic University of Paraná Curitiba Parana Brazil LIP6 Computing Laboratory University of Paris VI Paris France

ISBN: (纸本)9781424434862

This work presents a proposal for extending the role-based access control (RBAC) model to support activities that demand runtime mutability in their authorization attributes. Such activities cannot be subdivided in a set of subtasks executed sequentially neither can be accomplished by a single role. The approach presented allows the creation of quorum roles, which can only be activated in a session with the endorsement of a quorum of other roles. A prototype illustrates the application of our proposal in a network management scenario. In the illustrative scenario, a previously defined set of roles, by endorsement, activates a quorum role to perform a management task without the participation of the network administrator role.

关键词： Authorization Access control Proposals NIST computer network management computer science computer networks Runtime Prototypes Centralized control

来源：评论

学校读者我要写书评

暂无评论

Feature Weighting Information-Theoretic Co-Clustering for Document Clustering

Feature Weighting Information-Theoretic Co-Clustering for Do...

引用

International Symposium on computer science and its Applications, CSA

作者： Yunming Ye Xutao Li Biao Wu Yan Li Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Department of Computing Hong Kong Polytechnic University Hong Kong China

ISBN: (纸本)9781424449453;9781424449460

This paper presents a feature weighting schema to improve the performance of Information-Theoretic Co-clustering (ITCQ. The new algorithm, named as Feature Weighting Information-Theoretic Co-clustering (FWITCC), weights each feature with the mutual information shared by the features and the documents. The weighting schema makes informative features more important and noisy features less important, so that it can improve the qualities of resulted clusters. Experimental results on both synthetic data sets and 20 News group data sets have demonstrated that our new approach has better clustering performance than (ITCC).

关键词： Clustering algorithms Mutual information computer science Paper technology Internet Information retrieval Search engines Ontologies Information theory Frequency

来源：评论

学校读者我要写书评

暂无评论

Large online social footprints - An emerging threat

Large online social footprints - An emerging threat

引用

2009 IEEE International Conference on Privacy, Security, Risk, and Trust, PASSAT 2009

作者： Irani, Danesh Webb, Steve Li, Kang Pu, Calton Georgia Institute of Technology College of Computing 225 North Ave NW Atlanta GA 30332 United States Purewire Inc. 14 Piedmont Center NE - Suite 850 Atlanta GA 30305 United States Department of Computer Science University of Georgia 415 Graduate Studies Research Center Athens GA 30602 United States

ISBN: (纸本)9780769538235

We study large online social footprints by collecting data on 13, 990 active users. After parsing data from 10 of the 15 most popular social networking sites, we find that a user with one social network reveals an average of 4.3 personal information fields. For users with over 8 social networks, this average increases to 8.25 fields. We also investigate the ease by which an attacker can reconstruct a person's social network profile. Over 40% of an individual's social footprint can be reconstructed by using a single pseudonym (assuming the attacker guesses the most popular pseudonym), and an attacker can reconstruct 10% to 35% of an individual's social footprint by using the person's name. We also perform an initial investigation of matching profiles using public information in a person's profile. © 2009 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Abstracts from the 2011 Joint Annual Meeting of the Society for Northwestern Vertebrate Biology and Washington Chapter of the Wildlife Society, Held at the Wesley Inn, Gig Harbor, Washington, March 23–25, 2011

引用

Northwestern Naturalist 2011年第2期92卷 136-166页

作者： Michael J. Adams Christopher A. Pearl Jessica Y. Adkins Daniel D. Roby Ladd Bayliss Peter J. Loschl Donald E. Lyons Yasuko Suzuki Hannah E. Anderson Sarah T. Hamman Keith B. Aubry Catherine M. Raley John J. Rohrer Eric C. Lofroth Scott H. Fitkin Michael L. Best Hartwell H. Welsh Jamie B. Bettaso Don T. Ashton Hartwell H. Welsh Scott McBain Lindsay M. Biga Andrew R. Blaustein Susan F. Brady R. Steven Wagner Daniel J. Selski James E. Johnson R. Bruce Bury Wynn W. Cudmore Hartwell H. Welsh Nathan D. Chelgren Tara Chestnut Chaucney W. Anderson Julie Kirshtein Megan T. Cook Tiffany S. Garcia Stephen Corn Erin Muths Amanda Kissel Rick Scherer Eric Delvin Jonathan D. Bakker Peter W. Dunwiddie Diana L. Dishman Deborah A. Duffield Harriet R. Huber Dyanna M. Lambourn Karen M. Dvornich Greg Falxa Gary M. Fellers Patrick M. Kleeman David Miller Brandon Fessler Jason T. Irwin Daniel D. Beck R. Steven Wagner Marc P. Hayes John A. Frew Christian E. Grue Chris R. Friesen Robert T. Mason Stevan J. Arnold Suzanne Estes Tiffany S. Garcia Katie M. Dugger Josh Johnson Mike Rochelle A. J. Kroll Stephanie S. Gervasi Caren S. Goldberg Dan Davis Erica Bree Rosenblum Bill Bosworth Lisette P. Waits Purnima Govindarajulu Gregory A. Green Steve Negri Jennifer R. Griffiths Daniel E. Schindler Christian E. Grue Karen M. Dvornich Adam G. Hansen David A. Beauchamp Casey M. Baldwin Marc P. Hayes Gretchen Padgett-Flohr Blake R. Hossack Winsor H. Lowe Paul Stephen Corn Aaron N. Johnston Kris Kendell Dave Prescott Scott Stevens Peter M. Kiffney Carol Volk Kerensa A. King Christian E. Grue James M. Grassley Andrew J. Kroll Matt Hane Josh Johnston Mike Rochelle Stuart Farber Niels Leuthold Michael J. Adams John P. Hayes Bo Li Michael T. Brett Kent B. Livezey Ilon E. Logan Teresa J. Lorenz Kimberly A. Sullivan Amanda V. Bakian Deanna Lynch Nancy Thomas Krysten Schuler Steven Jeffries Joshua Malt Kelly R. McAllister Joanne P. Schuett-Hames Aimee P. McIntyre Jay E. Jones Eric M. Lund Frithiof T. Waterstrat Jack N. Giovanini Stephen D. Duke Marc P. Hayes US Forest Service Pacific Northwest Research Station Olympia WA 98512 kaubry@fs.fed.us US Forest Service Okanogan-Wenatchee National Forest Methow Valley Ranger District Winthrop WA 98862 British Columbia Ministry of Environment Victoria BC V8W9M1 Washington Department of Fish and Wildlife Winthrop WA 98862 Humboldt State University 1 Harpst St. Arcata CA 95521 addsmike14@*** US Forest Service Pacific Southwest Research Station 1700 Bayside Dr. Arcata CA 95521 hwelsh@fs.fed.us US Fish and Wildlife Service Arcata Field Office 1655 Heindon Road Arcata CA 95521 jamie_bettaso@fws.gov Redwood Sciences Laboratory US Forest Service1700 Bayview Drive Arcata CA 99521 dashton@fs.fed.us hwelsh@fs.fed.us McBain &amp Trush 980 7th Street Arcata CA 95521 scott@*** Oregon State University Environmental Sciences Graduate Program Corvallis OR 97331 lindsay.biga@science.oregonstate.edu Oregon State University Department of Zoology Corvallis OR 97331 US Geological Survey Forest and Rangeland Ecosystem Science Center 3200 SW Jefferson Way Corvallis OR 97331 buryb@usgs.gov Life Science Department Chemeketa Community College Salem OR 97309 wynn.cudmore@chemeketa.edu US Forest Service Redwood Sciences Laboratory 1700 Bayview Drive Arcata CA 95521 hwelsh@fs.fed.us USGS Oregon Water Science Center 2130 SW 5th Avenue Portland OR 97207 chestnut@usgs.gov USGS Headquarters 12201 Sunrise Valley Drive Reston VA 20192 US Geological Survey Northern Rocky Mountain Science Center Aldo Leopold Wilderness Research Institute 790 E. Beckwith Avenue Missoula MT 59801 scorn@usgs.gov US Geological Survey Fort Collins Science Center 2150 Centre Avenue Building C Fort Collins CO 80526 Department of Biological Sciences Simon Fraser University Burnaby BC V5A 1S6 Colorado State University Department of Fishery and Wildlife Biology Fort Collins CO 80523 The Nature Conservancy 120 Union Ave SE Olympia WA 98501 edelvin@tnc.org School of Forest Resources University of Washington Seattle WA

来源：评论

学校读者我要写书评

暂无评论

Design of interleaved multithreading for Network Processors on Chip

Design of interleaved multithreading for Network Processors ...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Henrique C. Freitas Felipe L. Madruga Marco A. Z. Alves Philippe O. A. Navaux Graduate Program in Computer Science Informatics Institute Universidade Federal do Rio Grande do Sul Porto Alegre Rio Grande do Sul Brazil

ISBN: (纸本)9781424438273

Thread level parallelism and multi-core processors are current alternatives to increase performance of general-purpose applications. In the same way, networks-on-ohip (NoCs) are the main alternatives for supporting packet throughput for the next generations of many-core processors. NPoC (network processor on chip) is a proposal to increase the performance of programmable NoC routers and multi-cluster NoC architectures using interleaved multithreading (IMT) technique. Therefore, the main goal of this paper is to present the design impact of interleaved multithreading for network processors on chip focusing on area and performance feasibility. Results show that NPoC-based router has an acceptable and similar area relative to a conventional NoC, and higher performance up to 7.1% than the same NPoC version without IMT.

关键词： Multithreading Network-on-a-chip Throughput Pipelines Parallel processing Yarn Switches Hardware Costs Wire

来源：评论

学校读者我要写书评

暂无评论

AAAI 2008 workshop reports

AAAI 2008 workshop reports

引用

作者： Anand, Sarabjot Singh Bunescu, Razvan Carvcdho, Vitor Chomicki, Jan Conitzer, Vincent Cox, Michael T. Dignum, Virginia Dodds, Zachary Dredze, Mark Furcy, David Gabrilovich, Evgeniy Göker, Mehmet H. Guesgen, Hans Hirsh, Haym Jannach, Dietmar Junker, Ulrich Ketter, Wolfgang Kobsa, Alfred Koenig, Sven Lau, Tessa Lewis, Lundy Matson, Eric Metzler, Ted Mihalcea, Rada Mobasher, Bamshad Pineau, Joelle Poupart, Pascal Raja, Anita Ruml, Wheeler Sadeh, Norman Shani, Guy Shapiro, Daniel Smith, Trey Taylor, Matthew E. Wagstaff, Kiri Walsh, William Zhou, Rong Department of Computer Science University of Warwick United Kingdom School of Electrical Engineering and Computer Science Ohio University United States Microsoft Live Labs United States computer science and engineering University at Buffalo United States Computer science and economics Duke University United States Intelligent Computing group of BBN Technologies Utrecht University Netherlands Department of Computer science Harvey Mudd College United States University of Pennsylvania United States University of Wisconsin United States Yahoo Research PricewaterhouseCoopers Center for Advanced Research United States Department of Computer science School of Engineering and Advanced Technology Massey University New Zealand Departent of Computer science Rutgers University United States Department of Computer Science Dortmund University of Technology. Germany ILOG Rotterdam School of Management Erasmus University Netherlands Donald Bren School of Information and Computer Sciences University of California Irvine United States Depatrment of Computer science University of Southern California United States IBM Almaden Research Center United States Department of Computer Information Technology Southern New Hampshire University United States Computer and Information Technology Program College of Technology Purdue University United States Hughes Program for Religion and Science Dialogue Oklahoma City University United States Department of Computer Science and Engineering University of North Texas United States School of Computing DePaul University United States Department of Computer Science McGill University Canada School of Computer Science University of Waterloo Canada Department of Software and Information Systems University of North Carolina Charlotte United States University of New Hampshire United States Microsoft Research Institute for the Study of Learning and Expertise Applied Reactivity Inc. United States NASA Ames Research Center Carnegie Mellon University West

AAAI was pleased to present the AAAI-08 Workshop program, held Sunday and Monday, July 13-14, in Chicago, Illinois, USA. The program included the following 15 workshops: Advancements in POMDP Solvers;AI Education Workshop Colloquium;Coordination, Organizations, Institutions, and Norms in Agent Systems, Enhanced Messaging;Human Implications of Human-Robot Interaction;Intelligent Techniques for Web Personalization and Recommender Systems;Metareasoning: Thinking about Thinking;Multidisciplinary Workshop on Advances in Preference Handling;Search in Artificial Intelligence and Robotics;Spatial and Temporal Reasoning;Trading Agent Design and Analysis;Transfer Learning for Complex Tasks;What Went Wrong and Why: Lessons from AI Research and Applications;and Wikipedia and Artificial Intelligence: An Evolving Synergy. Copyright © 2009, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：