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

17th Conference of the International Federation of Classification Societies, IFCS 2022

作者： Boutalbi, Rafika Labiod, Lazhar Nadif, Mohamed Institute for Parallel and Distributed Systems Analytic Computing University of Stuttgart Stuttgart Germany Centre Borelli UMR 9010 Université Paris Cité Paris France

ISBN: (数字)9783031090349

ISBN: (纸本)9783031090332

When dealing with high dimensional sparse data, such as in recommender systems,co-clusteringturnsouttobemorebeneficialthanone-sidedclustering,even if one is interested in clustering along one dimension only. Thereby, co-clusterwise is a natural extension of clusterwise. Unfortunately, all of the existing approaches do not consider covariates on both dimensions of a data matrix. In this paper, we propose a Latent Block Regression Model (LBRM) overcoming this limit. For inference, we propose an algorithm performing simultaneously co-clustering and regression where a linear regression model characterizes each block. Placing the estimate of the model parameters under the maximum likelihood approach, we derive a Variational Expectation–Maximization (VEM) algorithm for estimating the model’s parameters. The finality of the proposed VEM-LBRM is illustrated through simulated datasets. © 2023, The Author(s).

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Foundational Competencies and Responsibilities of a Research Software Engineer

arXiv

引用

arXiv 2023年

作者： Goth, Florian Alves, Renato Braun, Matthias Castro, Leyla Jael Chourdakis, Gerasimos Christ, Simon Cohen, Jeremy Druskat, Stephan Erxleben, Fredo Grad, Jean-Noël Hagdorn, Magnus Hodges, Toby Juckeland, Guido Kempf, Dominic Lamprecht, Anna-Lena Linxweiler, Jan Löffler, Frank Martone, Michele Schwarzmeier, Moritz Seibold, Heidi Thiele, Jan Philipp Waldow, Harald von Wittke, Samantha Institute for Theoretical Physics and Astrophysics University of Würzburg Germany European Molecular Biology Laboratory Heidelberg Germany Cluster of Excellence IntCDC University of Stuttgart Germany ZB MED Information Centre for Life Sciences Cologne Germany School of Computation Information and Technology Technical University of Munich Garching Germany Institute for Parallel and Distributed Systems University of Stuttgart Stuttgart Germany Leibniz University Hannover Department of Cell Biology and Biophysics Computational Biology Germany Imperial College London London United Kingdom Institute for Software Technology Berlin Germany Humboldt-Universität zu Berlin Department of Computer Science Berlin Germany Helmholtz-Zentrum Dresden-Rossendorf Germany Institute for Computational Physics University of Stuttgart Germany Geschäftsbereich IT Charité Universitätsmedizin Berlin Germany The Carpentries United States Heidelberg University Scientific Software Center Germany Institute of Computer Science University of Potsdam Germany Technische Universität Braunschweig Germany Michael Stifel Center Jena Friedrich Schiller University Jena Germany Leibniz Supercomputing Centre Garching Germany Mathematical Modeling and Analysis TU Darmstadt Germany IGDORE Munich Germany Weierstrass Institute Berlin Germany Leibniz University Hannover Institute of Applied Mathematics Scientific Computing Hannover Germany Johann Heinrich von Thünen Institute Centre for Information Management Germany

The term Research Software Engineer, or RSE, emerged a little over 10 years ago as a way to represent individuals working in the research community but focusing on software development. The term has been widely adopted and there are a number of high-level definitions of what an RSE is. However, the roles of RSEs vary depending on the institutional context they work in. At one end of the spectrum, RSE roles may look similar to a traditional research role. At the other extreme, they resemble that of a software engineer in industry. Most RSE roles inhabit the space between these two extremes. Therefore, providing a straightforward, comprehensive definition of what an RSE does and what experience, skills and competencies are required to become one is challenging. In this community paper we define the broad notion of what an RSE is, explore the different types of work they undertake, and define a list of foundational competencies as well as values that outline the general profile of an RSE. Further research and training can build upon this foundation of skills and focus on various aspects in greater detail. We expect that graduates and practitioners will have a larger and more diverse set of skills than outlined here. On this basis, we elaborate on the progression of these skills along different dimensions. We look at specific types of RSE roles, propose recommendations for organisations, and give examples of future specialisations. An appendix details how existing curricula fit into this framework. © 2023, CC BY.

关键词： Computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

Exahd: An exa-scalable two-level sparse grid approach for higher-dimensional problems in plasma physics and beyond

Exahd: An exa-scalable two-level sparse grid approach for hi...

引用

International Workshop on parallel Processing, Euro-Par 2014

作者： Pflüger, Dirk Heene, Mario Bungartz, Hans-Joachim Kowitz, Christoph Hinojosa, Alfredo Parra Griebel, Michael Zaspel, Peter Jenko, Frank Dannert, Tilman Institute for Parallel and Distributed Systems University of Stuttgart Germany Chair of Scientific Computing Technische Universität München Germany Institute for Numerical Simulation University of Bonn Germany Max Planck Institute for Plasma Physics Germany Computing Centre of the Max Planck Society and the MPI for Plasma Physics Germany

ISBN: (纸本)9783319143125

High-dimensional problems pose a challenge for tomorrow’s supercomputing. Problems that require the joint discretization of more dimensions than space and time are among the most compute-hungry ones and thus standard candidates for exascale computing and even beyond. This project tackles such problems by a hierarchical extrapolation approach, the sparse grid combination technique. The method not only enables their treatment in the first place. The hierarchical approach also provides novel ways to deal with central problems in high-performance computing such as scalability and resilience: Global communication can be avoided and reduced to a small subset, and faults can be compensated for without the need for recomputations or checkpoint-restart. As an exemplary prototype for high-dimensional problems, turbulence simulations in plasma physics are studied. ©Springer International Publishing Switzerland 2014.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Spatial indexing in agent-based crowd simulation 6

Spatial indexing in agent-based crowd simulation

引用

6th International Conference on Simulation Tools and Techniques, SIMUTools 2013

作者： Othman, Nasri Bin Luo, Linbo Cai, Wentong Lees, Michael Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9781936968763

Crowd modeling and simulation has become a critical tool for understanding crowds and predicting their behaviours. This is accomplished by modelling the characteristics and behaviours of large groups of people, as well as their interactions. Agent-based crowd simulation may involve thousands of complex agents interacting in sophisticated ways, in close spatial proximity, with each other. A key challenge to the development of agent-based crowd simulation is the inherent complexity that is required to model all its necessary elements. A necessary feature of such a simulation is spatial indexing. This refers to the use of data structures to organize collections of simulation entities (e.g., agents and obstacles) in a manner which allows for efficient spatial querying. This is especially pertinent for large-scale crowd simulation with agents that sense their surrounding environment periodically, as the cost of spatial querying becomes computationally expensive if done naively. In this paper, we will describe our experience in improving the existing grid-based spatial indexing approach in our agent-based crowd simulation. Also, we will explore the integration of the adaptive spatial indices (e.g., R-tree and quad-tree) into our system. The performances of various spatial indexing techniques are examined in terms of efficiency and scalability. Copyright © 2013 ICST.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Interactive scenario generation for mission-based virtual training

Interactive scenario generation for mission-based virtual tr...

引用

作者： Luo, Linbo Yin, Haiyan Cai, Wentong Lees, Michael Zhou, Suiping Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore Singapore School of Computing Teesside University Middlesbrough United Kingdom

For a virtual training system, how to effectively and quickly generate training scenarios has become a challenging issue. A scenario generation system is needed to produce scenarios that can meet different objectives and at the same time be customized for individuals. In this paper, we introduce a scenario generation framework for mission-based virtual training, which aims to generate scenarios from both trainer and trainee's perspective. The framework allows a trainer to direct the scenario generation process, so that the generated scenarios reflect the trainer's preferences over different mission objectives. It also considers how the scenarios could adapt to different trainees' skill levels. The representation of scenario beat is proposed, and the scenario generation process adopts a combinatorial optimization approach generating the sequence of scenario beats. The efficacy of the proposed framework is demonstrated through an empirical study of human players in a simple food distribution mission game. The results show that a trainee can achieve better performance improvement when playing the customized scenarios tailored to the trainee's skill level as compared with the uncustomized scenarios. Copyright © 2013 John Wiley & Sons, Ltd.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

TRANSDUCTIVE NONNEGATIVE MATRIX FACTORIZATION FOR SEMI-SUPERVISED HIGH-PERFORMANCE SPEECH SEPARATION

TRANSDUCTIVE NONNEGATIVE MATRIX FACTORIZATION FOR SEMI-SUPER...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Naiyang Guan Long Lan Dacheng Tao Zhigang Luo Xuejun Yang Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Changsha Hunan 410073 China Centre for Quantum Computation and Intelligent Systems FEIT University of Technology Sydney Sydney NSW 2007 Australia State Key Laboratory of High Performance Computing National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9781479928941

Regarding the non-negativity property of the magnitude spectrogram of speech signals, nonnegative matrix factorization (NMF) has obtained promising performance for speech separation by independently learning a dictionary on the speech signals of each known speaker. However, traditional NM-F fails to represent the mixture signals accurately because the dictionaries for speakers are learned in the absence of mixture signals. In this paper, we propose a new transductive NMF algorithm (TNMF) to jointly learn a dictionary on both speech signals of each speaker and the mixture signals to be separated. Since TNMF learns a more descriptive dictionary by encoding the mixture signals than that learned by NMF, it significantly boosts the separation performance. Experiments results on a popular TIMIT dataset show that the proposed TNMF-based methods outperform traditional NMF-based methods for separating the monophonic mixtures of speech signals of known speakers.

关键词： Speech Dictionaries as Topic Loudspeakers NMF protocol signals mixtures factorization HIGH-PERFORMANCE

来源：评论

学校读者我要写书评

暂无评论

Solution of a low Prandtl number natural convection benchmark by a local meshless method

Solution of a low Prandtl number natural convection benchmar...

引用

作者： Kosec, Gregor Šarler, Božidar Laboratory for Parallel and Distributed Computing Jožef Stefan Institute Ljubljana Slovenia Laboratory for Multiphase Processes University of Nova Gorica Nova Gorica Slovenia Laboratory for Advanced Materials Systems Centre of Excellence for Biosensorics Automation and Process Control Solkan Slovenia

Purpose - The purpose of this paper is to present the solution of a highly nonlinear fluid dynamics in a low Prandtl number regime, typical for metal-like materials, as defined in the call for contributions to a numerical benchmark problem for 2D columnar solidification of binary alloys. The solution of such a numerical situation represents the first step towards understanding the instabilities in a more complex case of macrosegregation. Design/methodology/ approach - The involved temperature, velocity and pressure fields are represented through the local approximation functions which are used to evaluate the partial differential operators. The temporal discretization is performed through explicit time stepping. Findings - The performance of the method is assessed on the natural convection in a closed rectangular cavity filled with a low Prandtl fluid. Two cases are considered, one with steady state and another with oscillatory solution. It is shown that the proposed solution procedure, despite its simplicity, provides stable and convergent results with excellent computational performance. The results show good agreement with the results of the classical finite volume method and spectral finite element method. Originality/value - The solution procedure is formulated completely through local computational operations. Besides local numerical method, the pressure velocity is performed locally also, retaining the correct temporal transient. © Emerald Group Publishing Limited.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Assessment of two pressure-velocity coupling strategies for local meshless numerical method

引用

9th International Conference on Advances in Fluid Mechanics - Advances in Fluid Mechanics IX, AFM 2012

作者： Kosec, G. Vertnik, R. Šarler, B. Jožef Stefan Institute Laboratory for Parallel and Distributed Computing Slovenia University of Nova Gorica Laboratory for Multiphase Processes Slovenia Štore steel d.o.o. Research Slovenia Centre of Excellence for Biosensors Automation and Process Control Laboratory for Advanced Materials Systems Slovenia

ISBN: (纸本)9781845646004

The performance of two pressure-velocity coupling strategies, associated with the primitive variable solution of incompressible Newtonian fluid with the meshless Local Radial Basis Function Collocation Method (LRBFCM), is compared with respect to computational efficiency, stability, accuracy and spatial convergence. The LRBFCM is structured with multiquadrics on five noded support domains. The explicit time stepping is used. The Backward- Facing Step problem (BFS) has been selected as a benchmark problem, previously tackled by several numerical methods. The semi-local fractional step method (FSM) and completely local pressure-velocity couplings (LPVC) are compared. The numerical results are validated against previously published data. The results are represented and compared in terms of a convergence plot of the reattachment position. We show that both approaches provide reasonable results;however, LVPC is less computationally complex and less stable in comparison to FSM. © 2012 WIT Press.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Assessment of two pressure-velocity coupling strategies for local meshless numerical method

Assessment of two pressure-velocity coupling strategies for ...

引用

作者： Kosec, G. Vertnik, R. Šarler, B. Jožef Stefan Institute Laboratory for Parallel and Distributed Computing Slovenia University of Nova Gorica Laboratory for Multiphase Processes Slovenia Štore Steel D.o.o. Research Slovenia Centre of Excellence for Biosensors Automation and Process Control Laboratory for Advanced Materials Systems Slovenia

The performance of two pressure-velocity coupling strategies, associated with the primitive variable solution of incompressible Newtonian fluid with the meshless Local Radial Basis Function Collocation Method (LRBFCM), is compared with respect to computational efficiency, stability, accuracy and spatial convergence. The LRBFCM is structured with multiquadrics on five noded support domains. The explicit time stepping is used. The Backward-Facing Step problem (BFS) has been selected as a benchmark problem, previously tackled by several numerical methods. The semi-local fractional step method (FSM) and completely local pressure-velocity couplings (LPVC) are compared. The numerical results are validated against previously published data. The results are represented and compared in terms of a convergence plot of the reattachment position. We show that both approaches provide reasonable results;however, LVPC is less computationally complex and less stable in comparison to FSM. © 2012 WIT Press.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Diversity-driven self-adaptation in evolutionary algorithms

Diversity-driven self-adaptation in evolutionary algorithms

引用

International Conference on Advances in Intelligent Control and Computer Engineering

作者： Zeng, Fanchao Decraene, James Low, Malcolm Yoke Hean Zhou, Suiping Cai, Wentong Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore 639798 Singapore

ISBN: (纸本)9789400702851

Pareto-based multi-objective optimization problems (MOPs) are currently best solved using evolutionary algorithms. Nevertheless, the performance of these nature-inspired stochastic search algorithms still depends on the suitability of their parameter settings with respect to specific optimization problems. The tuning of the parameters is a crucial task which concerns resolving the contrary goals of convergence and diversity. To address this issue, we propose a diversity-driven self-adaptive mechanism (SAM) for the simulated binary crossover. This novel technique exploits and optimizes the balance between exploration and exploitation during the evolutionary process. This "explore first and exploit later" approach is addressed through the automated and dynamic adjustment of the distribution index of the simulated binary crossover (SBX) operator. We conducted a series of experiments where SAM is applied to the Non-dominated Sorting Genetic Algorithm to solve the Sphere, Rastrigin, and ZDT optimization problems. Our experimental results have shown that our proposed self adaptation mechanism can produce promising results for both single and multi-objective problem sets. © 2011 Springer Science+Business Media B.V.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：