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

Multivariate Spearman's p for Aggregating Ranks Using Copulas

Journal of Machine Learning Research 2016年 17卷 1-30页

作者： Bedo, Justin Ong, Cheng Soon Walter and Eliza Hall Institute 1G Royal Parade ParkvilleVIC3052 Australia Department of Computing and Information Systems University of Melbourne VIC3010 Australia Data61 CSIRO 7 London Circuit CanberraACT2601 Australia Research School of Computer Science Australian National University Department of Electrical and Electronic Engineering VIC3010 Australia

We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known. We impute missing ranks and generalise Spearman's to extreme ranks. Our main contribution is the derivation of a non-parametric estimator for rank aggregation based on multivariate extensions of Spearman's p, which measures correlation between a set of ranked lists. Multivariate Spearman's p is defined using copulas, and we show that the geometric mean of normalised ranks maximises multivariate correlation. Motivated by this, we propose a weighted geometric mean approach for learning to rank which has a closed form least squares solution. When only the best (top-k) or worst (bottom-k) elements of a ranked list are known, we impute the missing ranks by the average value, allowing us to apply Spearman's κ. We discuss an optimistic and pessimistic imputation of missing values, which respectively maximise and minimise correlation, and show its effect on aggregating university rankings. Finally, we demonstrate good performance on the rank aggregation benchmarks MQ2007 and MQ2008. © 2016 Justin Bed}o and Cheng Soon Ong.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Dense matter with eXTP

arXiv

引用

arXiv 2018年

作者： Watts, Anna L. Yu, Wenfei Poutanen, Juri Zhang, Shu Bhattacharyya, Sudip Bogdanov, Slavko Ji, Long Patruno, Alessandro Riley, Thomas E. Bakala, Pavel Baykal, Altan Bernardini, Federico Bombaci, Ignazio Brown, Edward Cavecchi, Yuri Chakrabarty, Deepto Chenevez, Jérôme Degenaar, Nathalie Santo, Melania Del Salvo, Tiziana Di Doroshenko, Victor Falanga, Maurizio Ferdman, Robert D. Feroci, Marco Gambino, Angelo F. Ge, MingYu Greif, Svenja K. Guillot, Sebastien Gungor, Can Hartmann, Dieter H. Hebeler, Kai Heger, Alexander Homan, Jeroen Iaria, Rosario in’t Zand, Jean Kargaltsev, Oleg Kurkela, Aleksi Lai, Xiaoyu Li, Ang Li, XiangDong Li, Zhaosheng Linares, Manuel Lu, FangJun Mahmoodifar, Simin Méndez, Mariano Miller, M. Coleman Morsink, Sharon Nättilä, Joonas Possenti, Andrea Prescod-Weinstein, Chanda Qu, JinLu Riggio, Alessandro Salmi, Tuomo Sanna, Andrea Santangelo, Andrea Schatz, Hendrik Schwenk, Achim Song, LiMing Šrámková, Eva Stappers, Benjamin Stiele, Holger Strohmayer, Tod Tews, Ingo Tolos, Laura Török, Gabriel Tsang, David Urbanec, Martin Vacchi, Andrea Xu, RenXin Xu, Ypeng Zane, Silvia Zhang, Guobao Zhang, ShuangNan Zhang, Wenda Zheng, ShiJie Zhou, Xia Anton Pannekoek Institute for Astronomy University of Amsterdam Science Park 904 Amsterdam1098 XH Netherlands Shanghai Astronomical Observatory Shanghai200030 China Tuorla Observatory Department of Physics and Astronomy University of Turku Väisäläntie 20 PiikkiöFIN-21500 Finland Nordita KTH Royal Institute of Technology Stockholm University Roslagstullsbacken 23 StockholmSE-10691 Sweden Institute of High Energy Physics CAS Beijing100049 China Tata Institute of Fundamental Research Mumbai400005 India Columbia Astrophysics Laboratory Columbia University 550 West 120th Street New YorkNY10027 United States Institut für Astronomie und Astrophysik Tübingen Universität Tübingen Sand 1 TübingenD-72076 Germany Leiden Observatory Leiden University PO Box 9513 Leiden2300 RA Netherlands Research Center for Computational Physics and Data Processing Silesian University in Opava Bezrucovo nam. 13 OpavaCZ-74601 Czech Republic Physics Department Middle East Technical University Ankara06531 Turkey INAF Osservatorio Astronomico di Roma Via Frascati 33 Monteporzio CatoneI-00078 Italy New York University Abu Dhabi PO Box 129188 Abu Dhabi United Arab Emirates Dipartimento di Fisica Enrico Fermi University of Pisa PisaI-56127 Italy INFN Italian National Institute for Nuclear Physics Pisa Section Pisa56127 Italy Department of Physics and Astronomy Michigan State University East LansingMI48824 United States Department of Astrophysical Sciences Princeton University Peyton Hall PrincetonNJ08544 United States Mathematical Sciences and STAG Research Centre University of Southampton SouthamptonSO17 1BJ United Kingdom MIT Kavli Institute for Astrophysics and Space Research CambridgeMA02139 United States DTU Space Technical University of Denmark Elektrovej 327-328 Kgs Lyngby2800 Denmark INAF/IASF Palermo via Ugo La Malfa 153 PalermoI-90146 Italy Universita degli Studi di Palermo Dipartimento di Fisica e Chimica via Archira 36 Palermo90123 Italy

In this White Paper we present the potential of the Enhanced X-ray Timing and Polarimetry (eXTP) mission for determining the nature of dense matter;neutron star cores host an extreme density regime which cannot be replicated in a terrestrial laboratory. The tightest statistical constraints on the dense matter equation of state will come from pulse profile modelling of accretion-powered pulsars, burst oscillation sources, and rotation-powered pulsars. Additional constraints will derive from spin measurements, burst spectra, and properties of the accretion flows in the vicinity of the neutron star. Under development by an international Consortium led by the institute of High Energy Physics of the Chinese Academy of science, the eXTP mission is expected to be launched in the mid 2020s. Copyright © 2018, The Authors. All rights reserved.

关键词： Pulsars

来源：评论

学校读者我要写书评

暂无评论

The 5th International Conference on Biomedical engineering and Biotechnology (ICBEB 2016) Abstracts

引用

BMC MEDICAL IMAGING 2016年第SUPPL 1期16卷 65-65页

作者： [Anonymous] Department of MRI Shandong Medical Imaging Research Institute Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China Department of Interventional Radiology Shandong Provincial Hospital Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China College of Information Science and Technology Engr. Research Center of Digitized Textile & Fashion Tech. for Ministry of Education Donghua University Shanghai 201620 China Intelligent multimedia information processing Lab College of Software Northeastern University Shenyang Liaoning Province 110004 China Institute of Biomedical and Health Engineering Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Electrical Engineering The City College of New York CUNY New York USA Jiangsu Key Laboratory of 3D Printing Equipment and Manufacturing Nanjing China School of Electronic Science and Engineering Nanjing University Nanjing Jiangsu 210046 China College of Engineering Nanyang Technological University Singapore 639798 Singapore School of Electronic Information Shanghai Dianji University Shanghai China School of Natural Sciences and Mathematics Shepherd University Shepherdstown WV 25443 USA Davis College of Agriculture Natural Resources and Design West Virginia University Morgantown WV 26505 USA State Key Laboratory of Millimeter Waves Southeast University Nanjing 210096 China Center of Medical Physics and Technology Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei China College of Agricultural and Life Sciences University of Florida Gainesville FL 32611 USA Courant Institute of Mathematical Sciences New York University New York NY 10012 USA Translational Imaging Division & MRI Unit Columbia University and New York State Psychiatric Institute New York NY 10032 USA Guangxi Key Laboratory of Manufacturing System & Adv

来源：评论

学校读者我要写书评

暂无评论

Learning transferable features with deep adaptation networks 32

Learning transferable features with deep adaptation networks

引用

32nd International Conference on Machine Learning, ICML 2015

作者： Long, Mingsheng Cao, Yue Wang, Jianmin Jordan, Michael I. School of Software TNList Lab for Info. Sci. and Tech. Institute for Data Science Tsinghua University China Department of Electrical Engineering and Computer Science University of California BerkeleyCA United States

ISBN: (纸本)9781510810587

Recent studies reveal that a deep neural network can learn transferable features which generalize well to novel tasks for domain adaptation. However, as deep features eventually transition from general to specific along the network, the feature transferability drops significantly in higher layers with increasing domain discrepancy. Hence, it is important to formally reduce the dataset bias and enhance the transferability in task-specific layers. In this paper, we propose a new Deep Adaptation Network (DAN) architecture, which generalizes deep convolutional neural network to the domain adaptation scenario. In DAN, hidden representations of all task-specific layers are embedded in a reproducing kernel Hilbert space where the mean embeddings of different domain distributions can be explicitly matched. The domain discrepancy is further reduced using an optimal multi-kernel selection method for mean embedding matching. DAN can learn transferable features with statistical guarantees, and can scale linearly by unbiased estimate of kernel embedding. Extensive empirical evidence shows that the proposed architecture yields state-of-the-art image classification error rates on standard domain adaptation benchmarks.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Sustainable computational science: The Rescience initiative

arXiv

引用

arXiv 2017年

作者： Rougier, Nicolas P. Hinsen, Konrad Alexandre, Frédéric Arildsen, Thomas Barba, Lorena Benureau, Fabien C.Y. Titus Brown, C. de Buyl, Pierre Caglayan, Ozan Davison, Andrew P. Delsuc, Marc André Detorakis, Georgios Diem, Alexandra K. Drix, Damien Enel, Pierre Girard, Benoît Guest, Olivia Hall, Matt G. Henriques, Rafael Neto Hinaut, Xavier Jaron, Kamil S. Khamassi, Mehdi Klein, Almar Manninen, Tiina Marchesi, Pietro McGlinn, Dan Metzner, Christoph Petchey, Owen L. Plesser, Hans Ekkehard Poisot, Timothée Ram, Karthik Ram, Yoav Roesch, Etienne Rossant, Cyrille Rostami, Vahid Shifman, Aaron Stimberg, Marcel Stachelek, Joseph Stollmeier, Frank Vaggi, Federico Viejo, Guillaume Vitay, Julien Vostinar, Anya Yurchak, Roman Zito, Tiziano INRIA Bordeaux Sud-Ouest Talence France Institut des Maladies Neurodégénératives Université de Bordeaux CNRS UMR 5293 Bordeaux France LaBRI Université de Bordeaux Bordeaux INP CNRS UMR 5800 Talence France Centre de Biophysique Moléculaire CNRS UPR4301 Orléans France Synchrotron SOLEIL Division Expériences Gif sur Yvette France Department of Electronic Systems Technical Faculty of IT and Design Aalborg University Denmark Department of Mechanical and Aerospace Engineering George Washington University WashingtonDC United States Department of Population Health and Reproduction University of California Davis DavisCA United States Instituut voor Theoretische Fysica KU Leuven Belgium Le Mans France Unité de Neurosciences Information et Complexité CNRS FRE 3693 Gif sur Yvette France Institut de Génétique et de Biologie Moléculaire et Cellulaire INSERM U964 CNRS UMR 7104 Université de Strasbourg Illkirch France Department of Cognitive Sciences University of California Irvine United States Computational Engineering and Design Faculty of Engineering and the Environment University of Southampton United Kingdom Department of Computer Science Humboldt-Universität zu Berlin Friedman Brain Institute Icahn School of Medicine Mount SinaiNY United States Institut des Systèmes Intelligent et de Robotique Sorbonne Universités UPMC Univ Paris 06 CNRS Paris France Experimental Psychology University College London United Kingdom UCL Great Ormond St Institute of Child Health University College London London United Kingdom MRC Cognition and Brain Sciences Unit Cambridge United Kingdom Department of Ecology and Evolution University of Lausanne Lausanne Switzerland Independent scholar Enschede Netherlands BioMediTech Institute and Faculty of Biomedical Sciences and Engineering Tampere University of Technology Tampere Finland Swammerdam Institute for Life Sciences Center for Neuroscience Faculty of Science University of Amsterdam Amsterdam Netherlands Depart

computer science offers a large set of tools for prototyping, writing, running, testing, validating, sharing and reproducing results, however computational science lags behind. In the best case, authors may provide their source code as a compressed archive and they may feel confident their research is reproducible. But this is not exactly true. Jonathan Buckheit and David Donoho proposed more than two decades ago that an article about computational results is advertising, not scholarship. The actual scholarship is the full software environment, code, and data that produced the result. This implies new workflows, in particular in peer-reviews. Existing journals have been slow to adapt: source codes are rarely requested, hardly ever actually executed to check that they produce the results advertised in the article. Rescience is a peer-reviewed journal that targets computational research and encourages the explicit replication of already published research, promoting new and open-source implementations in order to ensure that the original research can be replicated from its description. To achieve this goal, the whole publishing chain is radically different from other traditional scientific journals. Rescience resides on GitHub where each new implementation of a computational study is made available together with comments, explanations, and software tests. Copyright © 2017, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Recognition of voiced speech from the bispectrum 8

Recognition of voiced speech from the bispectrum

引用

8th European Signal processing Conference, EUSIPCO 1996

作者： Delopoulos, Anastasios Rangoussi, Maria Andersen, Janne Division of Computer Science Department of Electrical Engineering National Technical University of Athens AthensGR-15780 Greece Digital Signal Processing Group Institute for Electronic Systems Aalborg University AalborgDK-9220 Denmark

Recognition of voiced speech phonemes is addressed in this paper using features extracted from the bispectrum of the speech signal. Voiced speech is modeled as a superposition of coupled harmonics, located at frequencies that are multiples of the pitch and modulated by the vocal tract. For this type of signal, nonzero bispectral values are shown to be guaranteed by the estimation pro-cedure employed. The vocal tract frequency response is reconstructed from the bispectrum on a set of frequency points that are multiples of the pitch. An AR model is next fitted on this transfer function. The AR coefficients are used as the feature vector for the subsequent classification step. Any finite dimension vector classifier can be employed at this point. Experiments using the LVQ neural classifier give satisfactory classification scores on real speech data, extracted from the DARPA/TIMIT speech corpus. © 2015 European Signal processing Conference, EUSIPCO. All rights reserved.

关键词： Frequency response

来源：评论

学校读者我要写书评

暂无评论

Completion time-a ware flow scheduling in heterogenous networks 1

引用

15th International Conference on Algorithms and Architectures for Parallel processing, ICA3PP 2015

作者： He, Shiming Xie, Kun Zhang, Dafang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook NY United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In China, the expressway isn’t free. When a vehicle exits, the exit toll station needs to calculate the toll according to the vehicle trajectory obtained by sending a trajectory query task to the trajectory center remotely. For the accurate of toll and keep the exit smoothly, transmitting the trajectory result reliably and in time is a key issue. There are three heterogenous networks in expressway, Fibernet, Telecommunications Network and 3G. We concurrently exploit three heterogenous networks by allocating the trajectory result into three sub-flows where each sub-flow is transmitted in one kind of networks. But existing multipath transfer solution(FMTCP) doesn’t consider the difference of completed time among all sub-flows and can’t make sure the completed time in time. Therefore, we formulate the sub-flows schedule as a integer programming problem, which is proved to be NP-hard problem, and propose a Completion time-aware Flow Scheduling scheme (CaFS) which calculates the size of sub-flows. For the reliably, it exploits generation-based network coding. For the transmission in time, CaFS allocates the size of sub-flow into suitable generation and scheduling the generations. The simulation results demonstrate that, comparing with the FMTCP, CaFS improves 31. 9% in completion time and 30% in task finished rate. © Springer International Publishing Switzerland 2015.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Dynamically Encoded Actions based on Spacetime Saliency

Dynamically Encoded Actions based on Spacetime Saliency

引用

IEEE Conference on computer Vision and Pattern Recognition

作者： Christoph Feichtenhofer Axel Pinz Richard P. Wildes Institute of Electrical Measurement and Measurement Signal Processing TU Graz Department of Electrical Engineering and Computer Science York University

ISBN: (纸本)9781467369657

Human actions typically occur over a well localized extent in both space and time. Similarly, as typically captured in video, human actions have small spatiotemporal support in image space. This paper capitalizes on these observations by weighting feature pooling for action recognition over those areas within a video where actions are most likely to occur. To enable this operation, we define a novel measure of spacetime saliency. The measure relies on two observations regarding foreground motion of human actors: They typically exhibit motion that contrasts with that of their surrounding region and they are spatially compact. By using the resulting definition of saliency during feature pooling we show that action recognition performance achieves state-of-the-art levels on three widely considered action recognition datasets. Our saliency weighted pooling can be applied to essentially any locally defined features and encodings thereof. Additionally, we demonstrate that inclusion of locally aggregated spatiotemporal energy features, which efficiently result as a by-product of the saliency computation, further boosts performance over reliance on standard action recognition features alone.

关键词： Motion measurement Energy measurement Spatiotemporal phenomena Encoding Weight measurement Support vector machines Three-dimensional displays

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving for network coding in smart grid 15th

Privacy preserving for network coding in smart grid

引用

15th International Conference on Algorithms and Architectures for Parallel processing, ICA3PP 2015

作者： He, Shiming Zeng, Weini Xie, Kun Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China The 716th Research Institute China Shipbuilding Industry Corporation Lianyungang222061 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook New York United States

ISBN: (纸本)9783319271361

In smart grid, privacy implications to individuals and their family is an important issue, due to the fine-grained usage data collection. Wireless communications are considered by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, Network Coding introduces new challenge for privacy preserving due to the encoding of packet in forwarder nodes. We propose a distributed privacy preserving scheme for network coding in smart grid, which considers the converged flows character of smart grid and exploits a homomorphic encryption function to decrease the complex in forwarder node. The message content of packet is encrypted and the tag of packet is encrypted by homomorphic encryption function. Then the forwarder node linear random codes the encrypted message contents and directly processes the tags cryptotext based on the homomorphism feature. It offers message content confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme. © Springer International Publishing Switzerland 2015.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Exploiting game theoretic analysis for link recommendation in social networks 15

Exploiting game theoretic analysis for link recommendation i...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhao, Tong Zhao, H. Vicky King, Irwin Shenzhen Key Laboratory of Rich Media Big Data Analytics and Applications Shenzhen Research Institute Chinese University of Hong Kong Shenzhen China Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong Electrical and Computer Engineering Department University of Alberta EdmontonAB Canada

ISBN: (纸本)9781450337946

The popularity of Online Social Networks (OSNs) has attracted great research interests in different fields. In Economics, researchers use game theory to analyze the mechanism of network formation, which is called Network Formation Game. While in computer science, much effort has been done in building machine learning models to predict future or missing links. However, there are few works considering how to combine game theoretic analysis and machine learning models. Therefore, in this paper, we study the problem of Exploiting Game Theoretic Analysis for Link Recommendation in Social Networks. Our goal is to improve link recommendation accuracy via leveraging the power of Network Formation Games into machine learning models. We present two different approaches to solve this problem. First, we propose a three-phase method that straightforwardly combines game theoretic analysis with machine learning models. Second, we develop a unified model, BPRLGT, that incorporates Network Formation Game into a Bayesian ranking framework for link recommendation. Specifically, BPRLGT takes advantage of network topology and we design a game theoretic sampling approach to improve its training process. The experiments are conducted on four real world datasets and the results on all datasets demonstrate that both our proposed three-phase method and the unified ranking model outperform the baseline methods. © 2015 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：