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

National Conference on Communications (NCC)

作者： Santosh K Chaudhari Subhash Nottath Mani Subramanian Hema A Murthy Computer Science and Engineering Indian Institute of Technology Madras Chennai India College of Computing Georgia Institute of Technology Atlanta GA USA

During peak hours, the focus of an Internet service provider (ISP) is on meeting user demand and maintaining the quality of service of a network. However this leads to under-utilization of network devices/components in different parts of the network. Since the power consumption of network devices are constant and independent of their actual workloads, the under-utilized network devices/components continue to consume the same power as that of a component working at full workload. We propose an energy aware network management system (NMS) framework based on the centralized decision management system (CDMS) reported in [1]. The system uses Bayesian belief network (BBN) to predict the utilization in different ports of network routers. The information already available in the NMS is sufficient for the proposed framework. For implementing the proposed scheme, an extended interface management information base (MIB) is proposed, which includes an operational state. Simulations are performed on two standard networks - IndiaNet and ARPANet, and the results show that with the proposed approach the CDMS is able to save approximately 10-16% of power at the cost of 1-5% end-to-end delay overhead. The cost of re-routing and Simple Network Management Protocol (SNMP) messages is minimal and acceptable considering the total power saved by CDMS.

关键词： Delay Internet Energy management Quality of service Monitoring Next generation networking Green products

来源：评论

学校读者我要写书评

暂无评论

Bypassing UGC from some Optimal Geometric Inapproximability Results 12

Bypassing UGC from some Optimal Geometric Inapproximability ...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Venkatesan Guruswami Prasad Raghavendra Rishi Saket Yi Wu Computer Science Department Carnegie Mellon University College of Computing Georgia Institute of Technology Center for Computational Intractability Princeton University IBM Almaden Research Center

ISBN: (纸本)9781611972108

The Unique Games conjecture (UGC) has emerged in recent years as the starting point for several optimal inapproximability results. While for none of these results a reverse reduction to Unique Games is known, the assumption of bijective projections in the Label Cover instance nevertheless seems critical in these proofs. In this work we bypass the need for UGC assumption in inapproximability results for two geometric problems, obtaining a tight NP-hardness result in each case.

关键词： User generated content bypasses Proof Game theory

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Yuehua Wang Zhong Zhou Ling Liu Liang Cheng Wei Wu State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University China Georgia Institute of Technology College of Computing Georgia Institute of Technology USA Department of Computer Science and Engineering Lehigh University USA

Group communication is essential for multi-user applications. However, due to unpredictable node departures and non-deterministic network partitions, providing reliable and scalable group communication services is challenging when the applications are utilized by the users with heterogeneous capacities on a large scale. To address this challenge, we propose a novel replication scheme to achieve high reliability and low-cost scalability in group communication with following three features. First, it introduces a new concept of replication based on topological similarity, which empowers each node with an ability of measuring similarity between the nodes in topology. By eliminating the topological similarity between the replicas, it intelligently mitigates service interruptions caused by node failures and network partitions. Second, instead of specifying the number of replicas, it provides a technique for nodes to dynamically adapt the replication placement schemes by exploiting functionality importance of the nodes in the group- communication session. It eliminates the bottleneck problem and improves the network resource utilization. Third, the scheme is self-converging and it can stabilize within a few adaptations even facing a high churn rate. Extensive simulations show that it yields significant improvements in reduction of replication overhead and service interruption when comparing to existing approaches.

关键词： Random access memory Topology Maintenance engineering Reliability theory Computer network reliability

来源：评论

学校读者我要写书评

暂无评论

Graph-based cooperative navigation using three-view constraints: Method validation

Graph-based cooperative navigation using three-view constrai...

引用

IEEE Symposium on Position Location and Navigation (PLANS)

作者： Vadim Indelman Pini Gurfil Ehud Rivlin Hector Rotstein Georgia Institute of Technology College of Computing Georgia Institute of Technology Atlanta GA USA Paculty of AeroSpace Engineering Technion-Israel Institute of Technology Haifa Israel Department of Computer Science Technion-Israel Institute of Technology Haifa Israel RAPAEL Advanced Defense Systems Limited Israel

One of the hard issues that arises in distributed navigation is keeping an up-to-date and consistent estimation of the dependency between the solutions computed by each one of the involved agents. This issue is critical for the consistent information fusion in distributed cooperative navigation and was recently tackled using a graph-based approach for the on-demand calculation of cross-covariance terms. In particular, the approach was applied to a method for visual aided, distributed cooperative navigation based on three-view geometry constraints, in which a measurement is formulated whenever the same scene is observed by several robots, not necessarily at the same time. The purpose of this paper is twofold. First, the claim that on-demand calculation of cross-covariance terms in three-view-based cooperative navigation is further substantiated, and the difficulties with other existing techniques are emphasized. Second, the efficiency of using the on-demand calculations is validated by comparing the results to those obtained by assuming the three-view multi-robot measurements schedule is known a priori. In this latter method, the required cross-covariance terms are calculated using a fixed-lag centralized smoother. The comparison clearly shows the advantages of using the on-demand scheme.

关键词： Area measurement Robot sensing systems Rotation measurement

来源：评论

学校读者我要写书评

暂无评论

Large-scale situation awareness with camera networks and multimodal sensing

Large-scale situation awareness with camera networks and mul...

引用

作者： Ramachandran, Umakishore Hong, Kirak Iftode, Liviu Jain, Ramesh Kumar, Rajnish Rothermel, Kurt Shin, Junsuk Sivakumar, Raghupathy College of Computing Georgia Institute of Technology Atlanta GA 30332 United States Department of Computer Science Rutgers University Piscataway NJ 08854 United States School of Information and Computer Sciences University of California at Irvine Irvine CA 92697-3425 United States Weyond Princeton NJ 08540 United States University of Stuttgart 70569 Stuttgart Germany School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA 30332 United States

Sensors of various modalities and capabilities, especially cameras, have become ubiquitous in our environment. Their intended use is wide ranging and encompasses surveillance, transportation, entertainment, education, healthcare, emergency response, disaster recovery, and the like. Technological advances and the low cost of such sensors enable deployment of large-scale camera networks in large metropolises such as London and New York. Multimedia algorithms for analyzing and drawing inferences from video and audio have also matured tremendously in recent times. Despite all these advances, large-scale reliable systems for media-rich sensor-based applications, often classified as situation-awareness applications, are yet to become commonplace. Why is that? There are several forces at work here. First, the system abstractions are just not at the right level for quickly prototyping such applications on a large scale. Second, while Moore's law has held true for predicting the growth of processing power, the volume of data that applications are called upon to handle is growing similarly, if not faster. Enormous amount of sensing data is continually generated for real-time analysis in such applications. Further, due to the very nature of the application domain, there are dynamic and demanding resource requirements for such analyses. The lack of right set of abstractions for programing such applications coupled with their data-intensive nature have hitherto made realizing reliable large-scale situation-awareness applications difficult. Incidentally, situation awareness is a very popular but ill-defined research area that has attracted researchers from many different fields. In this paper, we adopt a strong systems perspective and consider the components that are essential in realizing a fully functional situation-awareness system. © 2012 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Erratum: Search for new phenomena in final states with large jet multiplicities and missing transverse momentum at = 8 TeV proton-proton collisions using the ATLAS experiment

引用

Journal of High Energy Physics 2014年第1期2014卷 1-18页

作者： G. Aad T. Abajyan B. Abbott J. Abdallah S. Abdel Khalek O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams T. N. Addy J. Adelman S. Adomeit T. Adye S. Aefsky T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen A. Ahmad M. Ahsan G. Aielli T. P. A. Åkesson G. Akimoto A. V. Akimov M. A. Alam J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti L. Alio J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport S. E. Allwood-Spiers J. Almond A. Aloisio R. Alon A. Alonso F. Alonso A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako Y. Amaral Coutinho C. Amelung V. V. Ammosov S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders K. J. Anderson A. Andreazza V. Andrei X. S. Anduaga S. Angelidakis P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi A. Antonaki M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai A. T. H. Arce S. Arfaoui J.-F. Arguin S. Argyropoulos E. Arik M. Arik A. J. Armbruster O. Arnaez V. Arnal O. Arslan A. Artamonov G. Artoni D. Arutinov S. Asai N. Asbah S. Ask B. Åsman L. Asquith K. Assamagan R. Astalos A. Astbury M. Atkinson N. B. Atlay B. Auerbach E. Auge K. Augsten M. Aurousseau G. Avolio D. Axen G. Azuelos Y. Azuma M. A. Baak C. Bacci A. M. Bach H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker S. Baker P. Balek F. Balli E. Banas Sw. Banerjee D. Banfi A. Bangert V. Bansal H. S. Bansil L. Barak S. P. Baranov T. Barber E. L. Barberio D. Barberis M. Barbero D. Y. Bardin T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton V. Bartsch A. B Fakultät für Mathematik und Physik Albert-Ludwigs-Universität Freiburg Germany Physikalisches Institut University of Bonn Bonn Germany Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States of America Institut de Física d’Altes Energies and Departament de Física de la Universitat Autònoma de Barcelona Barcelona Spain LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics Oklahoma State University Stillwater United States of America Department of Physics and Astronomy Michigan State University East Lansing United States of America Department of Physics University of Toronto Toronto Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel DSM/IRFU (Institut de Recherches sur les Lois Fondamentales de l’Univers) CEA Saclay (Commissariat à l’Energie Atomique et aux Energies Alternatives) Gif-sur-Yvette France Department of Physics Stockholm University Stockholm Sweden INFN Gruppo Collegato di Udine Udine Italy Department of Physics King’s College London London United Kingdom AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton United States of America Department of Physics Hampton University Hampton United States of America Department of Physics Yale University New Haven United States of America Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Department of Physics Brandeis University Waltham United States of America Vinca Institute of Nuclear Sciences University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP Lisboa Portug

来源：评论

学校读者我要写书评

暂无评论

Stochastic multisymplectic integrator for stochastic KdV equation

引用

AIP Conference Proceedings 2012年第1期1479卷 1757-1760页

作者： Shanshan Jiang Lijin Wang Jialin Hong College of Science Beijing University of Chemical Technology Beijing 100029 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and System Science Chinese Academy of Sciences P.O. Box 2719 Beijing 100190 China

In this paper we investigate the stochastic multisymplectic methods to solve the stochastic partial differential equation. The stochastic KdV equations are considered. Besides conserving the multi-symplectic structure of original equation, the stochastic multi-symplectic methods are also investigated for the conservation of various conservation laws. We deduce the transit laws of the specific formal conservation laws. Numerical experiments are illustrated to verify the good behaviors of stochastic multisymplectic methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detecting Approximate Periodic Patterns 1st

Detecting Approximate Periodic Patterns

引用

1st Mediterranean Conference on Algorithms, MedAlg 2012

作者： Amir, Amihood Apostolico, Alberto Eisenberg, Estrella Landau, Gad M. Levy, Avivit Lewenstein, Noa Department of Computer Science Bar-Ilan University Ramat-Gan52900 Israel Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States College of Computing Georgia Institute of Technology 801 Atlantic Drive AtlantaGA30318 United States Dipartimento di Ingegneria dell’ Informazione Università diPadova Via Gradenigo 6/A Padova35131 Italy Department of Computer Science University of Haifa Mount Carmel Haifa31905 Israel Department of Computer Science and Engineering Polytechnic Institute of New York University 6 Metrotech Center BrooklynNY11201 United States Department of Software Engineering Shenkar College 12 Anna Frank Ramat-Gan Israel CRI Haifa University Mount Carmel Haifa31905 Israel Netanya College Netanya Israel

ISBN: (纸本)9783642348617

Given ɛ ∈ [0, 1), the ɛ-Relative Error Periodic Pattern Problem (REPP) is the following: INPUT: An n-long sequence S of numbers si ∈ N in increasing order. OUTPUT: The longest ɛ-relative error periodic pattern, i.e., the longest subsequence si1,si2,…,sik of S, for which there exists a number p such that the absolute difference between any two consecutive numbers in the subsequence is at least p and at most p(1 + ɛ). The best known algorithm for this problem has O(n3 ) time complexity. This bound is too high for large inputs in practice. In this paper we give a new algorithm for finding the longest ɛ-relative error periodic pattern (the REPP problem). Our method is based on a transformation of the input sequence into a different representation: the ɛ-active maximal intervals list L, defined in this paper. We show that the transformation of S to the list L can be done efficiently (quadratic in n and linear in the size of L) and prove that our algorithm is linear in the size of L. This enables us to prove that our algorithm works in sub-cubic time on inputs for which the best known algorithm works in O(n3 ) time. Moreover, though it may happen that our algorithm would still be cubic, it is never worse than the known O(n3 )-algorithm and in many situations its complexity is O(n2 )time. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Genomics on the petascale: How HPC is transforming biological research

引用

Scientific computing 2011年第2期28卷 21-23页

作者： Borodovsky, Mark Bader, David A. Wallace H. Coulter Department of Biomedical Engineering School of Computational Science and Engineering United States Center of Bioinformatics and Computational Genomics Georgia Institute of Technology United States School of Computational Science and Engineering and Executive United States High Performance Computing Georgia Institute of Technology United States

Genomics has become a research area where high performance computing (HPC) applications are in the highest demand. Two new gene-prediction algorithms developed in the lab of Mark Borodovsky at georgia Tech are ***-ES and GeneMark-ES+. Borodovsky and his fellow georgia Tech researchers are hoping to address the problems posed by 20 GB genome of Norway spruce by developing new algorithms that will delineate large swaths of surely noncoding regions, prior to pinpointing exact locations of protein-coding genes. Research funded by the American Recovery and Reinvestment Act of 2009 aims to develop computational tools that will utilize next-generation petascale computers to understand genomic evolution. The researchers are developing a new high performance software package called Comparing Orders of Genes using Novel Algorithms and high-performance Computers (COGNAC) and will test the performance of their new algorithms by analyzing a collection of fruit fly (Drosophilia) genomes.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Geometric Effects in Mechanical Bistable Morphing Structures

引用

Physical Review Letters 2012年第11期109卷 114302-114302页

作者： Zi Chen Qiaohang Guo Carmel Majidi Wenzhe Chen David J. Srolovitz Mikko P. Haataja Department of Mechanical and Aerospace Engineering Princeton University Princeton New Jersey 08544 USA Princeton Institute for the Science and Technology of Materials (PRISM) Princeton University Princeton New Jersey 08544 USA Department of Biomedical Engineering Washington University St. Louis Missouri 63130 USA College of Materials Science and Engineering Fuzhou University Fuzhou Fujian 350108 China Department of Mathematics and Physics Fujian University of Technology Fuzhou Fujian 350108 China Department of Mechanical Engineering Carnegie Mellon University Pittsburgh Pennsylvania 15213 USA Department of Materials Science and Engineering Fujian University of Technology Fuzhou Fujian 350108 China Institute for High Performance Computing 1 Fusionopolis Way Singapore 138632 Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA School of Mathematics Institute for Advanced Study Princeton New Jersey 08540 USA

Bistable structures associated with nonlinear deformation behavior, exemplified by the Venus flytrap and slap bracelet, can switch between different functional shapes upon actuation. Despite numerous efforts in modeling such large deformation behavior of shells, the roles of mechanical and nonlinear geometric effects on bistability remain elusive. We demonstrate, through both theoretical analysis and tabletop experiments, that two dimensionless parameters control bistability. Our work classifies the conditions for bistability, and extends the large deformation theory of plates and shells.

关键词： NONLINEAR theories DEFORMATIONS (Mechanics) PARAMETER estimation OPTICAL bistability STRUCTURAL shells PLATES (engineering) CRYSTAL structure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：