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

2nd Young Scientist's International Workshop on Trends in Information Processing, YSIP2 2017

作者： Schaerf, Marco Dept. of Computer Control and Management Engineering Antonio Ruberti Sapienza University of Rome Italy Institute of Information Technologies and Telecommunications North Caucasus Federal University Stavropol Russia

来源：评论

学校读者我要写书评

暂无评论

Deep autoencoder for off-line design-space dimensionality reduction in shape optimization

Deep autoencoder for off-line design-space dimensionality re...

引用

AIAA/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, 2018

作者： D’Agostino, Danny Serani, Andrea Diez, Matteo Campana, Emilio F. Dept. of Computer Control and Management Engineering ‘A. Ruberti’ Sapienza University of Rome CNR-INSEAN Via Ariosto 25 Rome00185 Italy CNR-INSEAN National Research Council-Marine Technology Research Institute Via di Vallerano 139 Rome00128 Italy CNR-DIITET National Research Council-Dept. of Engineering ICT and Technologies for Energy and Transportation Piazzale Aldo Moro 7 Rome00185 Italy University of Iowa United States

ISBN: (数字)9781624105326

ISBN: (纸本)9781624105326

In shape optimization, design improvements significantly depend on the dimension and variability of the design space. High dimensional and variability spaces are more difficult to explore, but also usually allow for more significant improvements. The assessment and breakdown of design-space dimensionality and variability are therefore key elements to shape optimization. A linear method based on the principal component analysis has been developed in earlier research to build a reduced-dimensionality design-space, resolving the 95% of the original geometric variance. The paper presents an extension of the method to more efficient nonlinear approaches. Specifically, the use of a deep autoencoder is presented and discussed. The method is demonstrated for the design-space dimensionality reduction and hydrodynamic optimization of the hull form of a USS Arleigh Burke-class destroyer. A comparison with the linear method is finally shown and discussed. © 2018, (publisher Name). All Rights reserved.

关键词： Shape optimization

来源：评论

学校读者我要写书评

暂无评论

Computing the Shapley Value in Allocation problems: Approximations and bounds, with an application to the Italian VQR research assessment program

arXiv

引用

arXiv 2017年

作者： Lupia, Francesco Mendicelli, Angelo Ribichini, Andrea Scarcello, Francesco Schaerf, Marco Dept. of Computer Science Modeling Electronics and Systems Engineering University of Calabria Rende87036 Italy Dept. of Physics Sapienza University Rome00185 Italy Dept. of Computer Control and Management Engineering Antonio Ruberti Sapienza University Rome00185 Italy

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to perform a fair allocation taking into account the actual contribution of all agents to the social welfare. Coalitional games provide a formal mathematical framework to model such problems, in particular the Shapley value is a solution concept widely used for assigning worths to agents in a fair way. Unfortunately, computing this value is a #P-hard problem, so that applying this good theoretical notion is often quite difficult in real-world problems. We describe useful properties that allow us to greatly simplify the instances of allocation problems, without affecting the Shapley value of any player. Moreover, we propose algorithms for computing lower bounds and upper bounds of the Shapley value, which in some cases provide the exact result and that can be combined with approximation algorithms. The proposed techniques have been implemented and tested on a real-world application of allocation problems, namely, the Italian research assessment program, known as VQR. For the large university considered in the experiments, the problem involves thousands of agents and goods (here, researchers and their research products). The algorithms described in the paper are able to compute the Shapley value for most of those agents, and to get a good approximation of the Shapley value for all of them. Copyright © 2017, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Asynchronous parallel algorithms for nonconvex big-data optimization part II: Complexity and numerical results

arXiv

引用

arXiv 2017年

作者： Cannelli, Loris Facchinei, Francisco Kungurtsev, Vyacheslav Scutari, Gesualdo School of Industrial Engineering Purdue University United States Department of Computer Control and Management Engineering Antonio Ruberti University of Rome La Sapienza Roma Italy Dept. of Computer Science Faculty of Electrical Engineering Czech Technical University in Prague Czech Republic

We present complexity and numerical results for a new asynchronous parallel algorithmic method for the minimization of the sum of a smooth nonconvex function and a convex nonsmooth regularizer, subject to both convex and nonconvex constraints. The proposed method hinges on successive convex approximation techniques and a novel probabilistic model that captures key elements of modern computational architectures and asynchronous implementations in a more faithful way than state-of-the-art models. In the companion paper [3] we provided a detailed description on the probabilistic model and gave convergence results for a diminishing stepsize version of our method. Here, we provide theoretical complexity results for a fixed stepsize version of the method and report extensive numerical comparisons on both convex and nonconvex problems demonstrating the efficiency of our approach. Copyright © 2017, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Computing the Shapley value in allocation problems: Approximations and bounds, with an application to the Italian VQR research assessment program 23

Computing the Shapley value in allocation problems: Approxim...

引用

23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA 2016

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximized, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to perform a fair allocation taking into account the actual contribution of all agents to the social welfare. Coalitional games provide a formal mathematical framework to model such problems, in particular the Shapley value is a solution concept widely used for assigning worths to agents in a fair way. Unfortunately, computing this value is a #P-hard problem, so that applying this good theoretical notion is often quite difficult in real-world problems. In this paper, we first review the application of the Shapley value to an allocation problem that models the evaluation of the Italian research structures with a procedure known as VQR. For large universities, the problem involves thousands of agents and goods (here, researchers and their research products). We then describe some useful properties that allow us to greatly simplify many such large instances. Moreover, we propose new algorithms for computing lower bounds and upper bounds of the Shapley value, which in some cases provide the exact result and that can be combined with approximation algorithms. The proposed techniques have been tested on large real-world instances of the VQR research evaluation problem.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Interfacing brain and computer in neurorehabilitation

Interfacing brain and computer in neurorehabilitation

引用

International Winter Workshop on Brain-computer Interface (BCI)

作者： Donatella Mattia Laura Astolfi Jlenia Toppi Manuela Petti Floriana Pichiorri Febo Cincotti Neuroelectrical Imaging and BCI Laboratory Fondazione Santa Lucia IRCCS Rome Italy Dept. of Computer Control and Management Engineering Antonio Ruberti Sapienza University of Rome Italy

ISBN: (纸本)9781467378437

Brain-computer Interface (BCI) technology exploiting electroencephalographic (EEG) sensorimotor oscillations is a potential tool to promote neuronal plasticity after stroke and ultimately to improve motor rehabilitation outcomes in post-stroke sub-acute and chronic stage. Nevertheless, the cost/effectiveness of BCI-based rehabilitative interventions remains to be addressed when considering the heterogeneity in the post-stroke functional motor impairment (clinical status) and the central nervous system reorganization (neuroplasticity). In this paper, we will provide preliminary findings on how multimodal neurophysiological methods to asses potential recovery after stroke can be use to foster an effective applicability of BCI technology in neuro-rehabilitation care.

关键词： Training Electroencephalography Brain-computer interfaces computers Electrodes Electric potential Central nervous system

来源：评论

学校读者我要写书评

暂无评论

P300 Latency Jitter occurrence in patients with disorders of consciousness: toward a better design for Brain computer interface applications

P300 Latency Jitter occurrence in patients with disorders of...

引用

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

作者： Francesca Schettini Monica Risetti Pietro Aricò Rita Formisano Fabio Babiloni Donatella Mattia Febo Cincotti the Dept. Computer Control and Management Engineering Antonio Ruberti University of Rome "Sapienza" and with the IRCCS Fondazione Santa Lucia Rome Italy the IRCCS Fondazione Santa Lucia Rome Italy the Dept. Physiology and Pharmacology University "Sapienza" of Rome Italy the Dept. Molecular Medicine University "Sapienza" of Rome Italy and BrainSigns srl. Rome Italy

ISBN: (纸本)9781424492695

In this study the P300 latency jitter has been explored in an EEG data set collected from a group of patients with disorders of consciousness (DOC;n=13) that was administered with an auditory Oddball paradigm under passive and active conditions. A method based on wavelet transform was applied to estimate single trial P300 waveforms. Preliminary results showed that 5 Vegetative State (VS) and 8 Minimally Conscious Staten (MCS) patients exhibited significantly higher values of P300 latency jitter as compared to those obtained from a control group of 12 healthy subjects. In addition, the magnitude of the P300 latency jitter negatively correlated with patients' clinical status. The existence of such phenomenon might substantially limit an effective use of Brain computer Interface systems for communication.

关键词： EEG SSVEPs PARAFAC

来源：评论

学校读者我要写书评

暂无评论

Visual analysis based on dominator trees with application to personalized eLearning

Visual analysis based on dominator trees with application to...

引用

13th International Conference on Advances in Web-Based Learning, ICWL 2014

作者： Laura, Luigi Nanni, Umberto Temperini, Marco Dept. of Computer Control and Management Engineering Antonio Ruberti Sapienza University of Rome Via Ariosto 25 00185 Roma Italy Sapienza Università di Roma Italy

ISBN: (纸本)9783319096346

The visualization of large graphs in interactive applications, specifically on small devices, can make harder to understand and analyze the displayed information. We show as simple topological properties of the graph can provide an efficient automatic computation of properties which improves the "readability" of a large graph by a proper selection of the displayed information. We show an approach to the visualization of a learning activity based on connectivity and related concepts as effective tools for visual analysis by learners, and by administrator of a repository. © 2014 Springer International Publishing.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

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) 2012年 7488 LNCS卷 V-VI页

作者： Catarci, Tiziana Forner, Pamela Hiemstra, Djoerd Peñas, Anselmo Santucci, Giuseppe Sapienza University of Rome Dept. of Computer Control and Management Engeneering Antonio Ruberti Via Ariosto 25 00185 Rome Italy Via alla Cascata 56/c 38123 Povo TN Italy University of Twente Dept. of Computer Science Database Group PO Box 217 7500 AE Enschede Netherlands UNED Natural Language Processing and Information Retrieval Research Group E.T.S.I. Informática de la UNED c/ Juan del Rosal 16 28040 Madrid Spain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：