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

International Conference on Future computer science and Education

作者： Feng, Wangsen Zhang, Bei Wang, Lusheng Key Laboratory of Network and Software Security Assurance of Ministry of Education Computing Center Beijing University Beijing 100871 China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9780769544229

Alignment of RNA structures is very important in biological research. Similar to pair-wise sequence alignment, there is often disagreement about how to weight matches, mismatches, indels and gaps when comparing two RNA structures. Here, we develop a visual tool for computing parametric alignment of two RNA structures. With this tool, users can see explicitly and completely the effect of parameter choices on the optimal alignments of RNA structures. The software is available for academic use (http://***/~lwang/ software/ParaRNA/). © 2011 IEEE.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Understanding off-chip memory contention of parallel programs in multicore systems

Understanding off-chip memory contention of parallel program...

引用

40th International Conference on Parallel Processing, ICPP 2011

作者： Tudor, Bogdan Marius Teo, Yong Meng See, Simon Department of Computer Science National University of Singapore 13 Computing Drive Singapore 117417 Singapore NVIDIA Nordic European Center 3 International Business Park #01-20A Singapore 609927 Singapore

ISBN: (纸本)9780769545103

Memory contention is an important performance issue in current multicore architectures. In this paper, we focus on understanding how off-chip memory contention affects the performance of parallel applications. Using measurements conducted on state-of-the-art multicore systems, we observed that off-chip memory traffic is not always bursty, as it was previously reported in literature. Burstiness depends on the problem size. Small problem sizes lead to bursty memory traffic, and generate small off-chip contention. In contrast, when large program sizes cause memory contention, the memory traffic is non-bursty. Based on these observations, we propose an analytical model that relates the growth of memory contention to the number of active cores and to the problem size, for both uniform (UMA) and non-uniform memory access (NUMA) systems. Our model differs from measurements on average by less than 14%. Contention for off-chip memory grows exponentially with the number of active cores, but adding additional memory controllers reduces the memory contention. For programs such as the pentadiagonal solver SP from NPB benchmark, with a large matrix of 1623 elements (input size C), our analysis shows that memory contention increases the total number of processor cycles to execute the program by more than ten times on a machine with 24 cores. © 2011 IEEE.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Towards multi-semantic image annotation with graph regularized exclusive group Lasso 11

Towards multi-semantic image annotation with graph regulariz...

引用

19th ACM International Conference on Multimedia ACM Multimedia 2011, MM'11

作者： Chen, Xiangyu Yuan, Xiao-Tong Yan, Shuicheng Tang, Jinhui Rui, Yong Chua, Tat-Seng NUS Graduate School for Integrative Sciences and Engineering Singapore Department of Electrical and Computer Engineering Singapore School of Computing NUS Singapore Microsoft Advanced Technology Center China Nanjing University of Science and Technology China

ISBN: (纸本)9781450306164

To bridge the semantic gap between low level feature and human perception, most of the existing algorithms aim mainly at annotating images with concepts coming from only one semantic space, e.g. cognitive or affective. The naive combination of the outputs from these spaces will implicitly force the conditional independence and ignore the correlations among the spaces. In this paper, to exploit the comprehensive semantic of images, we propose a general framework for harmoniously integrating the above multiple semantics, and investigating the problem of learning to annotate images with training images labeled in two or more correlated semantic spaces, such as fascinating nighttime, or exciting cat. This kind of semantic annotation is more oriented to real world search scenario. Our proposed approach outperforms the baseline algorithms by making the following contributions. 1) Unlike previous methods that annotate images within only one semantic space, our proposed multi-semantic annotation associates each image with labels from multiple semantic spaces. 2) We develop a multi-task linear discriminative model to learn a linear mapping from features to labels. The tasks are correlated by imposing the exclusive group lasso regularization for competitive feature selection, and the graph Laplacian regularization to deal with insufficient training sample issue. 3) A Nesterov-type smoothing approximation algorithm is presented for efficient optimization of our model. Extensive experiments on NUS-WIDEEmotive dataset (56k images) with 8×81 emotive cognitive concepts and Object&Scene datasets from NUS-WIDE well validate the effectiveness of the proposed approach. © 2011 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Reaction systems with duration

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6610卷 191-202页

作者： Brijder, Robert Ehrenfeucht, Andrzej Rozenberg, Grzegorz Leiden Institute of Advanced Computer Science Leiden Center for Natural Computing Leiden University Netherlands Department of Computer Science University of Colorado at Boulder United States

ISBN: (纸本)9783642199998

A reaction system is essentially a finite set of reactions, where each reaction consists of a finite set of reactants (needed for the reaction to take place), a finite set of inhibitors (each of which inhibits the reaction from taking place), and a finite set of products produced when the reaction takes place. A crucial feature of a reaction system is that (unless introduced from outside the system) an element (entity) from a current state will belong also to the successor state only if it is in the product set of a reaction that took place in the current state. In other words, an entity vanishes unless it is sustained by a reaction - a sort of "immediate decay" property. In this paper we relax this property, by providing each entity x with its duration d(x), which guarantees that x will last through at least d(x) consecutive states. Such reaction systems with duration are investigated in this paper. Among others we demonstrate that duration/decay is a result of an interaction with a "structured environment", and we also investigate fundamental properties of state sequences of reaction systems with duration. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

The computing alliance of hispanic-serving institutions: Supporting hispanics at critical transition points

引用

ACM Transactions on computing Education 2011年第3期11卷 1–21页

作者： Gates, Ann Quiroz Hug, Sarah Thiry, Heather Aló, Richard Beheshti, Mohsen Fernandez, John Rodriguez, Nestor Adjouadi, Malek Office of Research and Sponsored Projects University of Texas at El Paso El Paso TX United States ATLAS Assessment and Research Center University of Colorado at Boulder Boulder CO United States Center for Computational Science University of Houston Downtown Houston TX 77002 United States Computer Science Department California State University Dominguez Hills Carson CA United States School of Engineering and Computing Sciences Texas A and M University-Corpus Christi TX United States Electrical and Computer Engineering Department University of Puerto Rico at Mayaguez Mayaguez Puerto Rico Electrical and Computer Engineering Florida International University United States

Hispanics have the highest growth rates among all groups in the U.S., yet they remain considerably underrepresented in computing careers and in the numbers who obtain advanced degrees. Hispanics constituted about 7% of undergraduate computer science and computer engineering graduates and 1% of doctoral graduates in 2007-2008. The small number of Hispanic faculty, combined with the lack of Hispanic role models and mentors, perpetuates a troublesome cycle of underrepresentation in STEM fields. In 2004, seven Hispanic-Serving Institutions (HSIs) formed the computing Alliance of Hispanic-Serving Institutions (CAHSI) to consolidate their strengths, resources, and concerns with the aim of increasing the number of Hispanics who pursue and complete baccalaureate and advanced degrees in computing areas. To address barriers that hinder students from advancing, CAHSI defined a number of initiatives, based on programs that produced promising results at one or more institutions. These included the following: a CS-0 course that focuses on adoption of a three-unit pre-CS course that uses graphics and animation to engage and prepare students who have no prior experience in computing;a peer mentoring strategy that provides an active, collaborative learning experience for students while creating leadership roles for undergraduates;an undergraduate and graduate student research model that emphasizes the deliberate and intentional development of technical, team, and professional skills and knowledge required for research and cooperative work;and a mentoring framework for engaging undergraduates in experiences and activities that prepare them for graduate studies and onto the professoriate. CAHSI plays a critical role in evaluating, documenting, and disseminating effective practices that achieve its mission. This paper provides an overview of CAHSI initiatives and describes how each addresses causes of underrepresentation of Hispanics in computing. In addition, it describes the evaluati

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Support for the evolution of C++ generic functions

Support for the evolution of C++ generic functions

引用

Lecture Notes in computer science

作者： Pirkelbauer, Peter Dechev, Damian Stroustrup, Bjarne Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA 94550-9698 United States University of Central Florida Department of Electrical Engineering and Computer Science Orlando FL 32816-2362 United States Texas AandM University Department of Computer Science and Engineering College Station TX 77843-3112 United States

ISBN: (纸本)9783642194399

The choice of requirements for an argument of a generic type or algorithm is a central design issue in generic programming. In the context of C++, a specification of requirements for a template argument or a set of template arguments is called a concept. In this paper, we present a novel tool, TACE (template analysis and concept extraction), designed to help programmers understand the requirements that their code de facto imposes on arguments and help simplify and generalize those through comparisons with libraries of well-defined and precisely-specified concepts. TACE automatically extracts requirements from the body of function templates. These requirements are expressed using the notation and semantics developed by the ISO C++ standards committee. TACE converts implied requirements into concept definitions and compares them against concepts from a repository. Components of a well-defined library exhibit commonalities that allow us to detect problems by comparing requirements from many components: Design and implementation problems manifest themselves as minor variations in requirements. TACE points to source code that cannot be constrained by concepts and to code where small modifications would allow the use of less constraining concepts. For people who use a version of C++ with concept support, TACE can serve as a core engine for automated source code rejuvenation. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Retraction notice to ‘‘Specification and Verification of Dynamic Evolution of Software Architectures” [SYSARC 56 (10) (2010) 523–533]

引用

Journal of Systems Architecture 2012年第8期58卷 338-338页

作者： Xu Hongzhen Zeng Guosun Department of Computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science and Technology East China Institute of Technology Fuzhou Jiangxi Province 344000 China Application of Nuclear Technology Engineering Center of Ministry of Education Nanchang Jiangxi Province 330013 China Embedded System and Service Computing Key Lab of Ministry of Education Shanghai 201804 China

来源：评论

学校读者我要写书评

暂无评论

Modelling and analysis of network resilience

Modelling and analysis of network resilience

引用

2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011

作者： Sterbenz, James P.G. Çetinkaya, Egemen K. Hameed, Mahmood A. Jabbar, Abdul Rohrer, Justin P. Department of Electrical Engineering and Computer Science Information and Telecommunication Technology Center University of Kansas Lawrence KS 66045 United States Computing Department InfoLab21 Lancaster University Lancaster LA1 4WA United Kingdom

ISBN: (纸本)9781424489534

As the Internet becomes increasingly important to all aspects of society, the consequences of disruption become increasingly severe. Thus it is critical to increase the resilience and survivability of the future network. We define resilience as the ability of the network to provide desired service even when challenged by attacks, large-scale disasters, and other failures. This paper describes a comprehensive methodology to evaluate network resilience using a combination of analytical and simulation techniques with the goal of improving the resilience and survivability of the Future Internet. © 2011 IEEE.

关键词： Attack Challenge Dependability Disaster Future Internet architecture Generation Metrics Modeling Performability Population Resilience Simulation Survivability Topology

来源：评论

学校读者我要写书评

暂无评论

Evaluation of various evolutionary methods for medical image registration

Evaluation of various evolutionary methods for medical image...

引用

IEEE International Workshop on Computational Intelligence In Medical Imaging (CIMI)

作者： Sergio Damas Oscar Cordon Jose Santamaria European Center for Soft Computing Mieres Spain Department of Computer Science University of Jaén Spain

In the last few decades, image registration (IR) has been established as a very active research area in computer vision. Over the years, it has been applied to a broad range of real-world problems ranging from remote sensing to medical imaging, artificial vision, and computer-aided design. IR has been usually tackled by iterative approaches considering numerical optimization methods which are likely to get stuck in local optima. Recently, a large number of IR methods based on the use of metaheuristics and evolutionary computation paradigms has been proposed providing outstanding results. In this contribution, we aim to develop a preliminary experimental study on some of the most recognized feature-based IR methods considering evolutionary algorithms. To do so, the IR framework is first presented and a brief description of some prominent evolutionary-based IR proposals are reviewed. Finally, a selection of some of the most representative methods are benchmarked facing challenging 3D medical image registration problem instances.

关键词： Optimization Feature extraction Biomedical imaging Three dimensional displays Magnetic resonance imaging Proposals Image registration

来源：评论

学校读者我要写书评

暂无评论

Recovery from Link Failures in Networks with Arbitrary Topology via Diversity Coding

Recovery from Link Failures in Networks with Arbitrary Topol...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Serhat Nazim Avci Xiaodan Hu Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer Science University of California Irvine USA

Link failures in wide area networks are common. To recover from such failures, a number of methods such as SONET rings, protection cycles, and source rerouting have been investigated. Two important considerations in such approaches are the recovery time and the needed spare capacity to complete the recovery. Usually, these techniques attempt to achieve a recovery time less than 50 ms. In this paper we introduce an approach that provides link failure recovery in a hitless manner, or without any appreciable delay. This is achieved by means of a method called diversity coding. We present an algorithm for the design of an overlay network to achieve recovery from single link failures in arbitrary networks via diversity coding. This algorithm is designed to minimize spare capacity for recovery. We compare the recovery time and spare capacity performance of this algorithm against conventional techniques in terms of recovery time, spare capacity, and a joint metric called Quality of Recovery (QoR). QoR incorporates both the spare capacity percentages and worst case recovery times. Based on these results, we conclude that the proposed technique provides much shorter recovery times while achieving similar extra capacity, or better QoR performance overall.

关键词： Encoding Peer to peer computing Measurement Network topology SONET Topology Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：