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

13th Pacific-Rim Conference on Multimedia, PCM 2012

作者： Zhao, Tiesong Zhang, Yun Kwong, Sam Wang, Hanli Chen, Qian Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9783642347771

To minimize Rate-Distortion (RD) cost in video coding, RD Optimization (RDO) technique is adopted, which also brings increasingly computational complexity in Motion Estimation (ME), multiple reference selection and mode decision. In this paper, a Gaussian model based adaptive RD cost prediction method is developed to jointly speed up multiple reference selection and inter-mode decision. Besides the ability of achieving good coding efficiency with much reduced computational power, our method is also with two major advantages. First, it can achieve robust performance, including computational complexity reduction and almost intact video quality, with a wide range of video sequences resolutions and even for various scene changes;second, it could be either individually used or combined with the other efficient mode decision algorithms, and in both cases, our method could achieve remarkable performance, which is revealed by exhaustive experimental results. © 2012 Springer-Verlag.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

A Generalized Theory for Formal Assertion Coverage

A Generalized Theory for Formal Assertion Coverage

引用

Asian Test Symposium (ATS)

作者： Sourasis Das Ansuman Banerjee Pallab Dasgupta Department of Computer Science and Engineering IIT Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

Coverage of formal property specifications has important ramifications in design verification. Mutation coverage, a well studied approach towards specification coverage, checks whether the specification fails in the presence of a fault. Existing mutation coverage methods are broadly divided into those which inject the fault into a given implementation and those which inject the fault directly into the specification. This paper presents a theory which unifies these contrasting approaches and extends the mutation coverage approach to partial implementations where some components are given, and for the others, we only have component specifications.

关键词： Topology Cost accounting Standards Protocols Performance evaluation Microelectronics computer bugs

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

Approximation algorithms for deployment of sensors for line ...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Dinesh Dash Arijit Bishnu Arobinda Gupta Subhas C. Nandy Department of Computer Science & Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

The coverage problem in wireless sensor network deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments with minimum number of sensors. A line segment ℓ is said to be 1-covered if it intersects the sensing region of at least one among the sensors distributed in a bounded rectangular region R. We assume that the sensing radius of each sensor is uniform. The problem of finding the minimum number of sensors needed to 1-cover each member in a given set of line segments in R is NP-hard. We propose two constant factor approximation algorithms and a PTAS (Polynomial Time Approximation Scheme) for the problem for 1-covering a set of axis-parallel line segments. We also show that a PTAS exists for 1-covering a set of arbitrarily oriented line segments in R where the length of the line segments are bounded within a constant factor of the sensing radius of each sensor.

关键词： Sensors Approximation methods Strips Approximation algorithms Wireless sensor networks Roads Complexity theory

来源：评论

学校读者我要写书评

暂无评论

New direct-product testers and 2-query PCPs

New direct-product testers and 2-query PCPs

引用

作者： Impagliazzo, Russell Kabanets, Valentine Wigderson, Avi Department of Computer Science and Engineering University of California at San Diego San Diego CA 92093 United States Institute for Advanced Study Princeton University Princeton NJ 08540 United States Department of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada

The "direct-product code" of a function f gives its values on all k-tuples (f(x1),..., f(xk)). This basic construct underlies "hardness amplification" in cryptography, circuit complexity, and probabilistically checkable proofs (PCPs). Goldreich and Safra [SIAM J. Comput., 29(2000), pp. 1132-1154] pioneered its local testing and its PCP application. A recent result by Dinur and Goldenberg [Proceedings of the Forty-Ninth Annual IEEE Symposium on Foundations of computer science, 2008, pp. 613-622] enabled for the first time testing proximity to this important code in the "list-decoding" regime. In particular, they give a 2-query test which works for polynomially small success probability 1/kα and show that no such test works below success probability 1/k. Our main result is a 3-query test which works for exponentially small success probability exp(-k α). Our techniques (based on recent simplified decoding algorithms for the same code [R. Impagliazzo et al., Proceedings of the Fortieth Annual ACM Symposium on Theory of computing, 2008, pp. 579-588]) also allow us to considerably simplify the analysis of the 2-query test of [Proceedings of the Forty-Ninth Annual IEEE Symposium on Foundations of computer science, 2008, pp. 613-622]. We then show how to derandomize their test, achieving a code of polynomial rate, independent of k, and success probability 1/k α. Finally, we show the applicability of the new tests to PCPs. Starting with a 2-query PCP with a projection property over an alphabet Σ and with soundness error 1 - δ, Rao [Proceedings of the Fortieth Annual ACM Symposium on Theory of computing, 2008, pp. 1-10] (building on Raz's (k-fold) parallel repetition theorem [R. Raz, SIAM J. Comput., 27(1998), pp. 763-803] and Holenstein's proof [T. Holenstein, Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of computing, 2007, pp. 411-419] obtains a new 2-query PCP over the alphabet Σk with soundness error exp(-δ2k). Our techniques yield a 2-query PCP with sou

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Algorithms for On-Chip Solution Preparation Using Digital Microfluidic Biochips

Algorithms for On-Chip Solution Preparation Using Digital Mi...

引用

IEEE computer Society Annual Symposium on VLSI

作者： Sudip Roy Partha P. Chakrabarti Bhargab B. Bhattacharya Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit ISI Kolkata India

Digital micro fluidic (DMF) biochips have recently emerged as a very new technology for health-care and biochemical laboratory applications, as they are inexpensive, sensitive, fully-automated, integrated systems. In a DMF biochip, on-chip and automatic solution preparation requires solving of some algorithmic problems. In this paper, we present some results of our proposed algorithms for on-ship solution preparation using DMF biochips.

关键词： Design automation Optimization System-on-a-chip Laboratories Electrodes Reservoirs Mixers

来源：评论

学校读者我要写书评

暂无评论

Joint frequency assignment and optimal association of stations to access points in IEEE 802.11 WLAN 12

Joint frequency assignment and optimal association of statio...

引用

15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2012

作者： Tewari, Babul P. Ghosh, Sasthi C. Department of Computer Science and Engineering NSHM Knowledge Campus Durgapur Group of Institutions Durgapur 713 212 West Bengal India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata-700 108 West Bengal India

ISBN: (纸本)9781450316286

Frequency channels are allocated to the access-points (APs) subject to an acceptable co-channel interference level in an IEEE 802.11 WLAN. Due to limited number of the non- overlapping frequency channels, all APs in a given area may not be activated simultaneously. Therefore which subset of the APs to select for activation is a major concern. Given a set of selected APs, often a station (STA) can potentially associate with more than one AP. The association of an STA to an inappropriate AP will not only lead to degraded service for the concern STA but also may pull down the throughput of the other STAs associated with that AP. Thus finding the optimal association between STAs and APs is another im- portant concern. We argue that treating these two issues in succession may lead to suboptimal solutions, whereas, ignor- ing the co-channel interference may result over estimation of the throughput. In this paper, an integrated model based on integer programming and an efficient greedy algorithm are proposed that address both aspects simultaneously and maximizes the overall throughput while taking care of load balancing across different APs. Computational results show that indeed the integrated approach is superior to both two- step approach and methods that ignore the interference.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Topological Object Types for Morphodynamic Modeling Languages

Topological Object Types for Morphodynamic Modeling Language...

引用

2012 IEEE 4th International Symposium on Plant Growth Modeling,Simulation,Visualization and Applications(PMA 2012)

作者： Eric Mjolsness Alexandre Cunha Department of Computer Science University of California Irvine CaliforniaUSA Center for Advanced Computing Research California Institute of Technology Pasadena CaliforniaUSA

We survey useful ingredients for a new class of mathematical process-modeling languages aimed at spatial and developmental *** modeling languages for computational systems biology do not fully address the problems of spatial modeling that arise in morphodynamics(the local dynamics of form) and its applications to biological *** seek to extend the operator algebra semantics approach from our previous "Dynamical Grammars" modeling language,whose most spatial object type is the labelled graph,to encompass more flexible topological *** clues from current developments in 3D meshing and from topological modeling for biology,illustrated by a plant tissue example,we seek language support for the approximation of lowdimensional CW complexes(which are nontrivial topological spaces,with cardinality of the continuum) and dynamic fields thereon,by finite labelled abstract *** of the proposed types would be computationally demanding,without further *** and control of these approximations can be specified by use of "metricated" ***,such approximations should permit the accurate simulation of spatial diffusion processes.

关键词： biocomputation modeling languages topological object types process calculi morphodynamics

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Pattern formation in reverse smouldering combustion: a homogenisation approach” [Combust. Theor. Model. 17(2) (2013) 185—223]

引用

Combustion Theory & Modelling 2013年第3期17卷 577-577页

作者： Ijioma, Ekeoma Rowland erijioma@meiji.ac.jp Muntean, Adrian Ogawa, Toshiyuki Graduate School of Advanced Mathematical Science Meiji University 1-1-1 Higashimita Tamaku Kawasaki Kanagawa 214-8571 Japan Center of Analysis Scientific Computing and Applications Department of Mathematics and Computer Science Institute for Complex Molecular Systems (ICMS) Eindhoven University of Technology P.O. Box 513 Eindhoven MB 5600 The Netherlands

View full text

关键词： CHARTS, diagrams, etc. JOURNALISTIC errors

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2011 conference workshops

Reports of the AAAI 2011 conference workshops

引用

作者： Agmon, Noa Agrawal, Vikas Aha, David W. Aloimonos, Yiannis Buckley, Donagh Doshi, Prashant Geib, Christopher Grasso, Floriana Green, Nancy Johnston, Benjamin Kaliski, Burt Kiekintveld, Christopher Law, Edith Lieberman, Henry Mengshoel, Ole J. Metzler, Ted Modayil, Joseph Oard, Douglas W. Onder, Nilufer O'Sullivan, Barry Pastra, Katerina Precup, Doina Ramachandran, Sowmya Reed, Chris Sariel-Talay, Sanem Selker, Ted Shastri, Lokendra Singh, Satinder Smith, Stephen F. Srivastava, Siddharth Sukthankar, Gita Uthus, David C. Williams, Mary-Anne Department of Computer Science University of Texas at Austin United States Center for Knowledge Driven Information Systems Infosys Labs India Adaptive Systems Section Naval Research Laboratory Washington DC United States Department of Computer Science University of Maryland College Park United States EMC's Center of Excellence in Ireland Research Europe at EMC Ireland Department of Computer Science University of Georgia United States School of Informatics University of Edinburgh United Kingdom Department of Computer Science University of Liverpool United Kingdom Department of Computer Science University of North Carolina Greensboro United States Faculty of Engineering and Information Technology University of Technology Sydney Australia VeriSign Inc. United States Department of Computer Science University of Texas at El Paso United States Machine Learning Department Carnegie Mellon University United States Massachusetts Institute of Technology Media Laboratory United States Carnegie Mellon University's Silicon Valley Campus United States Darrell W. Hughes Program for Religion and Science Dialogue Oklahoma City University United States Department of Computing Science University of Alberta Canada College of Information Studies Institute for Advanced Computer Studies University of Maryland College Park United States Department of Computer Science Michigan Technological University United States Department of Computer Science University College Cork Ireland Cognitive Systems Research Insitute Athens Greece School of Computer Science McGill University Canada Stottler Henke Inc. United States School of Computing University of Dundee United Kingdom Department of Computer Engineering Istanbul Technical University Turkey Convergence Lab Infosys Technologies Ltd. United States Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor United States Robotics Institute Carnegie Mellon University United States University of Wisconsin

The AAAI-11 workshop program was held Sunday and Monday, August 7-18, 2011, at the Hyatt Regency San Francisco in San Francisco, California USA. The AAAI-11 workshop program included 15 workshops covering a wide range of topics in artificial intelligence. The titles of the workshops were Activity Context Representation: Techniques and Languages;Analyzing Microtext;Applied Adversarial Reasoning and Risk Modeling;Artificial Intelligence and Smarter Living: The Conquest of Complexity;Artifiicial Intelligence for Data Center Management and Cloud computing;Automated Action Planning for Autonomous Mobile Robots;Computational Models of Natural Argument;Generalized Planning;Human Computation;Human-Robot Interaction in Elder Care;Interactive Decision Theory and Game Theory, 2010;Language-Action Tools for Cognitive Artificial Agents: Integrating Vision, Action, and Language;Lifelong Learning from Sensorimotor Experience;Plan, Activity, and Intent Recognition;and Scalable Integration of Analytics and Visualization. This article presents short summaries of those events. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Isosurface extraction from hybrid unstructured grids containing pentahedral elements

Isosurface extraction from hybrid unstructured grids contain...

引用

International Conference on computer Graphics Theory and Applications, GRAPP 2012 and International Conference on Information Visualization Theory and Applications, IVAPP 2012

作者： Narayan, Akshay Sreevalsan-Nair, Jaya Gaither, Kelly Hamann, Bernd International Institute of Information Technology - Bangalore 26/C Electronics City Hosur Road Bangalore 560100 India Texas Advanced Computing Center University of Texas at Austin 10100 Burnet Road Austin TX 78758 United States Institute for Data Analysis and Visualization Department of Computer Science University of California Davis One Shields Avenue Davis CA 95616 United States

ISBN: (纸本)9789898565020

Grid-based computational simulations often use hybrid unstructured grids consisting of various types of elements. Most commonly used elements are tetrahedral, pentahedral (namely, square pyramids and right triangular prisms) and hexahedral elements. Extracting isosurfaces of scalar fields defined on such hybrid unstructured grids is often done using indirect methods, such as, (a) subdividing all non-tetrahedral cells into tetrahedra and computing the triangulated isosurfaces using the marching tetrahedra algorithm, or (b) triangulating intersection points of edges of cells and computing the isosurface using a standard triangulation algorithm. Using the basic ideas underlying the well-established marching cubes and marching tetrahedra algorithms, which are applied to hexahedral and tetrahedral elements, respectively, we generate look-up tables for extracting isosurfaces directly from pentahedral elements. By using appropriate look-up tables, it is possible to process nearly all types of hybrid unstructured grids used in practical applications without the need for indirect methods. We construct look-up tables for square pyramidal and triangular prismatic cells with accurate topological considerations.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：