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

19th European Symposium on Artificial Neural Networks, ESANN 2011

作者： Geweniger, T. Kästner, M. Villmann, T. Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen Netherlands University of Applied Sciences Mittweida - Computational Intelligence Group Dep. of Mathematics Natural and Computer Sciences Mittweida Germany

ISBN: (纸本)9782874190445

We propose the utilization of divergences as dissimilarity measure in the Fuzzy c-Means algorithm for the clustering of functional data. Further we adapt the relevance parameter to improve the data representation and therefore obtain more accurate clusterings in terms of separation and compactness. We show for two example applications that this method leads to improved performance. © European Symposium on Artificial Neural Networks. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Workshop on Modeling the Perception of Intentions 34

Workshop on Modeling the Perception of Intentions

引用

34th Annual Meeting of the Cognitive science Society: Building Bridges Across Cognitive sciences Around the World, CogSci 2012

作者： Pautler, David Tversky, Barbara Ullman, Shimon Baldwin, Dare Pollick, Frank E. Tenenbaum, Josh Gao, Tao Pantelis, Peter Programme in Computational Social Cognition Institute of High Performance Computing 1 Fusionopolis Way 16-16 Connexis Singapore138632 Singapore Department of Psychology Stanford University Building 420 StanfordCA94305-2130 United States Department of Computer Science And Applied Mathematics Ziskind Building Weizmann Institute of Science Room 208 Rehovot76100 Israel Department of Psychology Straub Hall 1227 University of Oregon EugeneOR97403 United States Dept of Psychology Room 702 58 Hillhead Street GlasgowG12 8QB United Kingdom Building 46-4015 77 Massachusetts Avenue CambridgeMA02139 United States Building 46-4053 CambridgeMA02139 United States Psychology Building Busch Campus 152 Frelinghuysen Road PiscatawayNJ08854-8020 United States

ISBN: (纸本)9780976831884

Attributing intentions to others based on observations of their behavior is a core cognitive ability. It is also a necessary precursor to social judgments such as judgments about responsibility and morality. The seminal work of Heider and Simmel (1944) highlighted the spontaneity, richness, and range of intention attributions that can be elicited by a stimulus as impoverished as moving geometric figures. Subsequent research has revealed a wide range of visuospatial cues that suggest specific intentions as well as observer attributes that influence judgments. How are such cues and observer attributes integrated into an inferred specific intention? A handful of processing models have used frameworks such as schema-matching or probabilistic inference to integrate such cues. This workshop will address two questions: 1) How have different fundamental paradigms fared in the quest for a model of human intention perception? and 2) What questions about this topic are most in need of answers? © CogSci *** rights reserved.

关键词： action understanding computational modeling event perception intention recognition probabilistic inference social cognition theory of mind

来源：评论

学校读者我要写书评

暂无评论

Updating preconditioner for iterative method in time domain simulation of power systems

引用

science China(Technological sciences) 2011年第4期54卷 1024-1034页

作者： WANG Ke XUE Wei LIN HaiXiang XU ShiMing ZHENG WeiMin Laboratory of Parallel Software and Computational Science Institute of SoftwareChinese Academy of SciencesBeijing 000China Department of Computer Science and Technology Tsinghua UniversityBeijing 000China Tsinghua National Laboratory for Information Science and Technology(TNList) Beijing 100084China Delft Institute of Applied Mathematics Delft University of TechnologyDelft 2628 CDThe Netherlands

The numerical solution of the differential-algebraic equations(DAEs) involved in time domain simulation(TDS) of power systems requires the solution of a sequence of large scale and sparse linear *** use of iterative methods such as the Krylov subspace method is imperative for the solution of these large and sparse linear *** motivation of the present work is to develop a new algorithm to efficiently precondition the whole sequence of linear systems involved in *** an improvement of dishonest preconditioner(DP) strategy,updating preconditioner strategy(UP) is introduced to the field of TDS for the first *** idea of updating preconditioner strategy is based on the fact that the matrices in sequence of the linearized systems are continuous and there is only a slight difference between two consecutive *** order to make the linear system sequence in TDS suitable for UP strategy,a matrix transformation is applied to form a new linear sequence with a good shape for preconditioner *** algorithm proposed in this paper has been tested with 4 cases from real-life power systems in *** show that the proposed UP algorithm efficiently preconditions the sequence of linear systems and reduces 9%-61% the iteration count of the GMRES when compared with the DP method in all test *** experiments also show the effectiveness of UP when combined with simple preconditioner reconstruction strategies.

关键词： differential-algebraic equations GMRES updating preconditioner power system simulation

来源：评论

学校读者我要写书评

暂无评论

Automated extraction of nested sulcus features from human brain MRI data

Automated extraction of nested sulcus features from human br...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： Forrest Sheng Bao Joachim Giard Jason Tourville Arno Klein F. S. Bao is with Depts. of Computer Science and Electrical Engineering Texas Tech University Lubbock Texas J. Giard is with Institute of Information and Communication Technologies Electronics and Applied Mathematics Université Catholique de Louvain Louvain Belgium J. Tourville is with Dept. of Speech Language and Hearing Sciences and Center for Computational Neuroscience and Neural Technology Boston University Boston Massachusetts A. Klein is with New York Psychiatric Institute Columbia University New York New York

ISBN: (纸本)9781424441198

Extracting objects related to a fold in the cerebral cortex ("sulcus features") from human brain magnetic resonance imaging data has applications in morphometry, landmark-based registration, and anatomical labeling. In prior work, sulcus features such as surfaces, fundi and pits have been extracted separately. Here we define and extract nested sulcus features in a hierarchical manner from a cortical surface mesh having curvature or depth values. Our experimental results show that the nested features are comparable to features extracted separately using other methods, and that they are consistent across subjects and with manual label boundaries. Our open source feature extraction software will be made freely available as part of the Mindboggle project ().

关键词： Automated extraction MRI data sulcus features

来源：评论

学校读者我要写书评

暂无评论

Solving constrained optimization problems by an improved particle swarm optimization

Solving constrained optimization problems by an improved par...

引用

2011 2nd International Conference on Innovations in Bio-inspired Computing and Applications, IBICA 2011

作者： Sun, Chaoli Zeng, Jianchao Chu, Shuchuan Roddick, John F. Pan, Jengshyang Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology Taiyuan Shanxi China School of Computer Science Engineering and Mathematics Flinders University Australia Department of Electronic Engineering National Kaohsiung University of Applied Sciences Kaohsiung Taiwan

ISBN: (纸本)9781457712197

Constrained optimization problems compose a large part of real-world applications. More and more attentions have gradually been paid to solve this kind of problems. An improved particle swarm optimization (IPSO) algorithm based on feasibility rules is presented in this paper to solve constrained optimization problems. The average velocity of the swarm and the best history position in the particle's neighborhood are introduced as two turbulence factors, which are considered to influence the fly directions of particles, into the algorithm so as not to converge prematurely. The performance of IPSO algorithm is tested on 13 well-known benchmark functions. The experimental results show that the proposed IPSO algorithm is simple, effective and highly competitive. © 2011 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Affine-invariant geodesic geometry of deformable 3D shapes

Affine-invariant geodesic geometry of deformable 3D shapes

引用

作者： Raviv, Dan Bronstein, Alexander M. Bronstein, Michael M. Kimmel, Ron Sochen, Nir Department of Computer Science Technion Israel Department of Electrical Engineering Tel Aviv University Israel Institute of Computational Science Faculty of Informatics Università della Svizzera Italiana Lugano Switzerland Department of Applied Mathematics Tel Aviv University Israel

Natural objects can be subject to various transformations yet still preserve properties that we refer to as invariants. Here, we use definitions of affine-invariant arclength for surfaces in R3 in order to extend the set of existing non-rigid shape analysis tools. We show that by re-defining the surface metric as its equi-affine version, the surface with its modified metric tensor can be treated as a canonical Euclidean object on which most classical Euclidean processing and analysis tools can be applied. The new definition of a metric is used to extend the fast marching method technique for computing geodesic distances on surfaces, where now, the distances are defined with respect to an affine-invariant arclength. Applications of the proposed framework demonstrate its invariance, efficiency, and accuracy in shape analysis. © 2011 Elsevier Ltd. All rights reserved.

关键词： Geodesy

来源：评论

学校读者我要写书评

暂无评论

Parallel simulations of dynamic earthquake rupture along geometrically complex faults on CMP systems

Parallel simulations of dynamic earthquake rupture along geo...

引用

作者： Wu, Xingfu Duan, Benchun Taylor, Valerie Department of Computer Science and Engineering Institute of Applied Mathematics and Computational Science Texas AandM University College Station TX 77843 United States Department of Geology and Geophysics Texas AandM University College Station TX 77843 United States Department of Computer Science and Engineering Texas AandM University College Station TX 77843 United States

Chip multiprocessors (CMP) are widely used for high performance computing and are being configured in a hierarchical manner to compose a CMP compute node in a CMP system. Such a CMP system provides a natural programming paradigm for hybrid MPI/OpenMP applications. In this paper, we use OpenMP to parallelize a sequential earthquake simulation code for modeling spontaneous earthquake rupture along geometrically complex faults on two CMP systems, IBM POWER5+ system and SUN Opteron server. The experimental results indicate that the OpenMP implementation has the accurate output results and the good scalability on the two CMP *** apply the optimization techniques such as large page and processor binding to the OpenMP implementation to achieve up to 7.05% performance improvement on the CMP systems without any code modification. Further, we illustrate an element-based partitioning scheme for explicit finite element methods. Based on the partitioning scheme and what we learn from the OpenMP implementation, we discuss how efficiently to use hybrid MPI/OpenMP to parallelize the sequential earthquake rupture simulation code in order to not only achieve multiple levels of parallelism of the code but also to reduce the communication overhead of MPI within a CMP node by taking advantage of the shared address space and on-chip high inter-core bandwidth and low inter-core latency. Our initial experimental results indicate that the hybrid MPI/OpenMP implementation obtains the accurate output results and has good scalability on CMP systems.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A novel multi-layer framework for modeling the evolution of spectrum markets and cognitive-radio devices

A novel multi-layer framework for modeling the evolution of ...

引用

IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN

作者： Georgios Fortetsanakis Markos Katsoulakis Maria Papadopouli Institute of Computer Science Foundation for Research and Technology-Hellas Greece Department of Computer Science University of Crete Greece Institute of Applied and Computational Mathematics Foundation for Research and Technology Hellas Greece Department of Applied Mathematics University of Crete Greece

This work presents a novel multi-layer modelling framework for the evolution of spectrum markets of multiple spectrum/network operators that provide wireless access to users. It integrates models of the channel, mobility, user preference, network operators (providers), infrastructure deployment, user distribution, and price-adaptation mechanisms. Providers aim to maximize their own profit, while clients decide based on criteria, such as the financial cost of the access, transmission rate, and required transmission power. This paper gives a brief description of the modelling framework and a novel price-adaptation algorithm for providers. It presents how this framework can be used to instantiate a cellular-based market in a small city. Finally, it analyzes the evolution of this market under different topologies and user profiles, summarizing the main performance results.

关键词： Topology Time frequency analysis Biological system modeling Cognitive radio Shadow mapping computational modeling

来源：评论

学校读者我要写书评

暂无评论

computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis

引用

Procedia computer science 2011年 4卷 1854-1861页

作者： Victor M. Calo Nathaniel O. Collier David Pardo Maciej R. Paszyński Department of Applied Mathematics Computational Science Earth Engineering King Abdullah University of Science and Technology Thuwal 23955-6900 Kingdom of Saudii Arabia Department of Applied Mathematics Statistics and Operational Research Univsersity of the Basque Country and Ikerbasque Bilbao Spain Department of Computer Science AGH University of Science and Technology Al. Mickiewicza 30 30-059 Kraków Poland

The multi-frontal direct solver is the state of the art for the direct solution of linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from p finite elements. Specifically we provide the estimates for systems resulting from C0 polynomial spaces spanned by B-splines. The structured grid and uniform polynomial order used in isogeometric meshes simplifies the analysis.

关键词： Multi-frontal direct solver computational complexity memory usage

来源：评论

学校读者我要写书评

暂无评论

Goal-Oriented Self-Adaptive hp Finite Element Simulation of 3D DC Borehole Resistivity Simulations

引用

Procedia computer science 2011年 4卷 1485-1495页

作者： Victor M. Calo David Pardo Maciej R. Paszyński Department of Applied Mathematics Computational Science Earth Engineering King Abdullah University of Science and Technology Thuwal 23955-6900 Kingdom of Saudii Arabia Department of Applied Mathematics Statistics and Operational Research Univsersity of the Basque Country and Ikerbasque Bilbao Spain Department of Computer Science AGH University of Science and Technology Al. Mickiewicza 30 30-059 Kraków Poland

In this paper we present a goal-oriented self-adaptive hp Finite Element Method ( hp -FEM ) with shared data structures and a parallel multi-frontal direct solver. The algorithm automatically generates (without any user interaction) a sequence of meshes delivering exponential convergence of a prescribed quantity of interest with respect to the number of degrees of freedom. The sequence of meshes is generated from a given initial mesh, by performing h (breaking elements into smaller elements), p (adjusting polynomial orders of approximation) or hp (both) refinements on the finite elements. The new parallel implementation utilizes a computational mesh shared between multiple processors. All computational algorithms, including automatic hp goal-oriented adaptivity and the solver work fully in parallel. We describe the parallel self-adaptive hp- FEM algorithm with shared computational domain, as well as its efficiency measurements. We apply the methodology described to the three-dimensional simulation of the borehole resistivity measurement of direct current through casing in the presence of invasion.

关键词： Hp-FEM Goal-oriented adaptivity Parallel data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：