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

26th Annual Computational Neuroscience Meeting (CNS*2017) of the Organization for Computational Neuroscience Antwerp, Belgium, July 15-20, 2017

引用

BMC NEUROscience 2017年第SUPPL 1期18卷 59-59页

作者： [Anonymous] Indiana University Purdue University Indianapolis Indianapolis IN 46032 USA Stark Neurosciences Research Institute Indiana University School of Medicine Indianapolis IN 46032 USA Department of Mathematics East Carolina University Greenville NC 27858 USA Jülich Supercomputing Centre Forschungszentrum Jülich 52425 Jülich Germany Future Systems Swiss National Supercomputing Centre 8092 Zurich Switzerland User Engagement and Support Swiss National Supercomputing Centre 6900 Lugano Switzerland Institut de Neurosciences des Systèmes Aix Marseille Univ 13005 Marseille France Simulation Lab Neuroscience Forschungszentrum Jülich Jülich Germany Department of Experimental Psychology Ghent University 9000 Ghent Belgium Donders Center for Cognitive Neuroimaging Radboud University 6525HR Nijmegen The Netherlands Department of Electrical Computer and Energy Engineering University of Colorado Boulder CO 80309 USA Department of Neurosurgery Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Neurology Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Otolaryngology Johns Hopkins School of Medicine Baltimore MD 21287 USA INSERM U968 Paris France Sorbonne Universités UPMC University Paris 06 UMR_S 968 Institut de la Vision Paris France CNRS UMR_7210 Paris France Department of Computer Architecture and Technology University of Granada (CITIC) Granada Spain Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Institut de la Vision Paris France Department of Adaptive Machine Systems Osaka University Osaka Japan Department of Computer Science University of Cergy-Pontoise Cergy-Pontoise France Department of Physics and Astronomy College of Charleston Charleston SC 29424 USA School of Physics Faculty of Science University of Sydney Sydney NSW 2006 Australia Center of Excellence for Integrative Brain Function Australian Research Council Sydney Australia Max Planck Institute for Human Cognitive and Brain Sciences Saxony Lei

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

CEUR Workshop Proceedings 2016年 1780卷 1-4页

作者： Lahoud, Inaya Matta, Nada Zablith, Fouad Ventura, Sebastian Department of Computer Engineering Galatasaray University Istanbul Turkey TechCICO Team University of Technology of Troyes Troyes France Olayan School of Business American University of Beirut Beirut Lebanon Department of Computing Science and Numerical Analysis University of Cordoba Cordoba Spain

来源：评论

学校读者我要写书评

暂无评论

Consolidation of concentrated suspensions – numerical simulations using a two-phase fluid model

引用

computing and Visualization in science 2014年第1期3卷 39-45页

作者： Gustavsson, Katarina Oppelstrup, Jesper Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm Sweden SE

We investigate numerically a mathematical model of a consolidation process of a dense, flocculated suspension. The suspension is treated as a two-constituent mixture of a fluid and solid particles by an Eulerian two-phase fluid model. We characterize the suspension by constitutive relations concerning the stresses, interaction forces and inter-particle forces. A numerical solver for a two dimensional test case is developed using finite difference methods both in time and space. In the numerical experiments, the suspension is confined to a closed box and consolidates due to a constant gravity field directed toward the bottom. To study the effect of shear, 2D simulations are performed where the bottom wall of the box is moving with a constant speed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Solving the Klein-Gordon equation using Fourier spectral methods: A benchmark test for computer performance 23

Solving the Klein-Gordon equation using Fourier spectral met...

引用

23rd High Performance computing Symposium, HPC 2015, Part of the 2015 Spring Simulation Multi-Conference, SpringSim 2015

作者： Aseeri, S. Batrašev, O. Icardi, M. Leu, B. Liu, A. Li, N. Muite, B.K. Müller, E. Palen, B. Quell, M. Servat, H. Sheth, P. Speck, R. Van Moer, M. Vienne, J. KAUST Supcrcomputing Laboratory 4700 King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Arvutitcaduse Instituut Tartu Ülikool Liivi 2 Tartu50409 Estonia Stochastic Numerics Group 4700 King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Electrical and Computer Engineering University of Michigan Ann ArborMI48109-2122 United States Numerical Algorithms Group Wilkinson House Jordan Hill Road Oxford0X2 8DR United Kingdom Numerical Mathematics Group 4700 King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Department of Mathematical Sciences University of Bath BathBA2 7 AY United Kingdom CAEN Advanced Computing University of Michigan Ann ArborMI48109-2094 United States Lnstitut für Analysis und Scientific Computing Technische Universität Wien Wiedner Haupstrasse 8-10 Wien1040 Austria Compulcr Sciences Department BSC UPC c/Jordi Girona Barcelona Calalunya08034 Spain Biomedical Engineering University of Michigan Ann ArborMI48109-2122 United States Jülich Supercomputing Centre Forschungszentrum Jülich GmbH Germany Germany National Center for Supercomputing Applications University of Illinois at Urbiina-Chanipaign UrbanaIL61801 United States Texas Advanced Computing Center University of Texas at Austin AustinTX78758-4497 United States

ISBN: (纸本)9781510810600

The cubic Klein-Gordon equation is a simple but non-trivial partial differential equation whose numerical solution has the main building blocks required for the solution of many other partial differential equations. In this study, the library 2DE-COMP&FFT is used in a Fourier spectral scheme to solve the Klein-Gordon equation and strong scaling of the code is examined on thirteen different machines for a problem size of 5123. The results are useful in assessing likely performance of other parallel fast Fourier transform based programs for solving partial differential equations. The problem is chosen to be large enough to solve on a workstation, yet also of interest to solve quickly on a supercomputer, in particular for parametric studies. Unlike the Linpack benchmark, a high ranking will not be obtained by simply building a bigger computer. © 2015 Aseeri et al.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

A finite element based level-set method for multiphase flow applications

引用

computing and Visualization in science 2014年第1期3卷 93-101页

作者： Anna-Karin Tornberg Björn Engquist Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm Sweden (e-mail: annak@nada.kth.se/engquist@nada.kth.se) SE

A numerical method for simulating incompressible two-dimensional multiphase flow is presented. The method is based on a level-set formulation discretized by a finite-element technique. The treatment of the specific features of this problem, such as surface tension forces acting at the interfaces separating two immiscible fluids, as well as the density and viscosity jumps that in general occur across such interfaces, have been integrated into the finite-element framework. Using a method based on the weak formulation of the Navier-Stokes equations has its advantages. In this formulation, the singular surface tension forces are included through line integrals along the interfaces, which are easily approximated quantities. In addition, differentiation of the discontinuous viscosity is avoided. The discontinuous density and viscosity are included in the finite element integrals. A strategy for the evaluation of integrals with discontinuous integrands has been developed based on a rigorous analysis of the errors associated with the evaluation of such integrals. numerical tests have been performed. For the case of a rising buoyant bubble the results are in good agreement with results from a front-tracking method. The run presented here is a run including topology changes, where initially separated areas of one fluid merge in different stages due to buoyancy effects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Occlusion model from human interaction analysis for tracking multiple people

Occlusion model from human interaction analysis for tracking...

引用

IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013

作者： Reta, Carolina Altamirano, Leopoldo Gonzalez, Jesus A. Medina-Carnicer, Rafael Department of Computer Science National Institute for Astrophysics Optics and Electronics Puebla Mexico Department of Computing and Numerical Analysis University of Cordoba Cordoba Spain

In this work we investigate the problem of tracking multiple interacting people under uncontrolled stationary environments for intelligent surveillance applications. This domain is very challenging since the clothing appearance changes of the people over time make difficult the temporal association of their identities. The problem is emphasized when individuals move close to each other, are occluded, or abruptly change their trajectories. We propose a tracking graph that models spatial and temporal relationships among people in order to predict and resolve partial and total occlusions. When a total occlusion event occurs, the model generates three possible hypotheses about the location of the occluded person according to a human interaction analysis. This model is able to detect false positives and false negatives in the detection measurements and it can also estimate the location of missing or occluded people. Our approach was evaluated on benchmark sequences and results show how it outperforms state-of-the-art algorithms even in the presence of long periods of occlusion.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

On Diffuse Interface Modeling and Simulation of Surfactants in Two-Phase Fluid Flow

引用

Communications in Computational Physics 2013年第9期14卷 879-915页

作者： Stefan Engblom Minh Do-Quang Gustav Amberg Anna-Karin Tornberg Division of Scientific Computing Department of Information TechnologyUppsala UniversitySE-75105 UppsalaSweden Linne Flow Centre Department of MechanicsSchool of Engineering ScienceRoyal Institute of TechnologyS-10044 StockholmSweden Linne Flow Centre Department of Numerical AnalysisSchool of Computer Science and CommunicationRoyal Institute of TechnologyS-10044 StockholmSweden

An existing phase-fieldmodel of two immiscible fluids with a single soluble surfactant present is discussed in *** analyze the well-posedness of the model and provide strong evidence that it is mathematically ill-posed for a large set of physically relevant *** a consequence,critical modifications to the model are suggested that substantially increase the domain of *** designed numerical simulations offer informative demonstrations as to the sharpness of our theoretical results and the qualities of the physical model.A fully coupled hydrodynamic test-case demonstrates the potential to capture also non-trivial effects on the overall flow.

关键词： Phase-field model Cahn-Hilliard equation surface active agent Ginzburg-Landau free energy well-posedness

来源：评论

学校读者我要写书评

暂无评论

Probabilistic computation underlying sequence learning in a spiking attractor memory network

引用

BMC Neuroscience 2013年第1期14卷 1-2页

作者： Philip Tully Henrik Lindén Anders Lansner Matthias H Hennig Department of Computational Biology Royal Institute of Technology (KTH) S-10044 Stockholm Sweden Stockholm Brain Institute Karolinska Institutet 171 77 Stockholm Sweden Institute for Adaptive and Neural Computation University of Edinburgh EH8 9AB Edinburgh UK Department of Numerical Analysis and Computing Science Stockholm University S-10044 Stockholm Sweden

来源：评论

学校读者我要写书评

暂无评论

Iterated greedy algorithms for the maximal covering location problem

Iterated greedy algorithms for the maximal covering location...

引用

12th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2012

作者： Rodriguez, Francisco J. Blum, Christian Lozano, Manuel García-Martínez, Carlos Department of Computer Science and Artificial Intelligence University of Granada Granada Spain ALBCOM Research Group Technical University of Catalonia Barcelona Spain Department of Computing and Numerical Analysis University of Córdoba Córdoba Spain

ISBN: (纸本)9783642291234

The problem of allocating a set of facilities in order to maximise the sum of the demands of the covered clients is known as the maximal covering location problem. In this work we tackle this problem by means of iterated greedy algorithms. These algorithms iteratively refine a solution by partial destruction and reconstruction, using a greedy constructive procedure. Iterated greedy algorithms have been applied successfully to solve a considerable number of problems. With the aim of providing additional results and insights along this line of research, this paper proposes two new iterated greedy algorithms that incorporate two innovative components: a population of solutions optimised in parallel by the iterated greedy algorithm, and an improvement procedure that explores a large neighbourhood by means of an exact solver. The benefits of the proposal in comparison to a recently proposed decomposition heuristic and a standalone exact solver are experimentally shown. © 2012 Springer-Verlag.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

An artificial bee colony algorithm for the unrelated parallel machines scheduling problem

An artificial bee colony algorithm for the unrelated paralle...

引用

12th International Conference on Parallel Problem Solving from Nature, PPSN 2012

作者： Rodriguez, Francisco J. García-Martínez, Carlos Blum, Christian Lozano, Manuel Department of Computer Science and Artificial Intelligence University of Granada Granada Spain ALBCOM Research Group Technical University of Catalonia Barcelona Spain Department of Computing and Numerical Analysis University of Córdoba Córdoba Spain

ISBN: (纸本)9783642329630

In this work, we tackle the problem of scheduling a set of jobs on a set of non-identical parallel machines with the goal of minimising the total weighted completion times. Artificial bee colony (ABC) algorithm is a new optimization technique inspired by the intelligent foraging behaviour of honey-bee swarm. These algorithms have shown a better or similar performance to those of other population-based algorithms, with the advantage of employing fewer control parameters. This paper proposes an ABC algorithm that combines the basic scheme with two significant elements: (1) a local search method to enhance the exploitation capability of basic ABC and (2) a neighbourhood operator based on iterated greedy constructive-destructive procedure. The benefits of the proposal in comparison to three different metaheuristic proposed in the literature are experimentally shown. © 2012 Springer-Verlag.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：