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

SSRN 2022年

作者： Murakami, Ryo Harada, Yoshitomo Sonobayashi, Yutaka Oji, Hiroshi Makino, Hisao Tanaka, Hiromi Taguchi, Hideyuki Sakamoto, Takanori Morita, Haruka Wakamori, Akihiko Kibe, Naoko Nishida, Shinsuke Nagata, Kenji Shinotsuka, Hiroshi Shouno, Hayaru Yoshikawa, Hideki The University of Electro-Communications Graduate School of Informatics and Engineering Chofu182-8585 Japan National Institute for Materials Science Research and Services Division of Materials Data and Integrated System Ibaraki Tsukuba305-0044 Japan Kyoto University Department of Materials Science and Engineering Kyoto606-8501 Japan Nagoya University Synchrotron radiation Research center Nagoya464-8603 Japan Kochi University of Technology School of Systems Engineering Japan National Institute of Technology Yonago College Department of Electrical and Computer Engineering Japan Nihon Parkerizing Co. Ltd Central Research Laboratories Kanagawa 254-0012 Japan JX Nippon Mining & Metals Corporation Technology Development Center Japan Melco Semiconductor Engineering Corporation Chemical Analysis & Evaluation Engineering Dept. Fukuoka Japan Kobelco Welding TechnoSolutions Co. Technical Solution Dept. Ltd Kanagawa 251-8551 Japan Furukawa Electric Co. Ltd Analysis Technology Center Sustainable Technology Laboratorie Kanagawa 220-0073 Japan

Spectral measurements provide valuable information on the electronic states and crystal structures of materials. In particular, X-ray photoelectron spectroscopy (XPS) can facilitate analysis of the chemical bond state of material surfaces. In the analysis of XPS spectra, the spectrum to be measured is typically compared to a reference spectrum measured on a known single-phase sample. Therefore, establishing a reference spectral database is imperative. In this study, round-robin tests of XPS spectra are performed with the aim of obtaining recommended XPS reference spectra and experimental procedures, including preprocessing. Determining the variations in peak structures between instrument- and sample-derived spectral shapes, and quantitatively discussing them in round-robin tests of XPS spectra are challenging. Therefore, an analysis method that automatically determines the above mentioned variations and extracts the samplederived common spectral structures is developed. This study presents a new approach to the quantitative analysis of round-robin tests of XPS spectra. The required common © 2022, The Authors. All rights reserved.

关键词： X ray photoelectron spectroscopy

来源：评论

学校读者我要写书评

暂无评论

Guaranteed Deterministic Bounds on the Total Variation Distance between Univariate Mixtures

arXiv

引用

arXiv 2018年

作者： Nielsen, Frank Sun, Ke Sony Computer Science Laboratories Inc. Japan Data61 Australia

The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in [0;1]. This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of f-divergences, and it is related to the probability of error in Bayesian hypothesis testing. Since the total variation distance does not admit closed-form expressions for statistical mixtures (like Gaussian mixture models), one often has to rely in practice on costly numerical integrations or on fast Monte Carlo approximations that however do not guarantee deterministic lower and upper bounds. In this work, we consider two methods for bounding the total variation of univariate mixture models: The first method is based on the information monotonicity property of the total variation to design guaranteed nested deterministic lower bounds. The second method relies on computing the geometric lower and upper envelopes of weighted mixture components to derive deterministic bounds based on density ratio. We demonstrate the tightness of our bounds in a series of experiments on Gaussian, Gamma and Rayleigh mixture models. Copyright © 2018, The Authors. All rights reserved.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

q-Neurons: Neuron activations based on stochastic Jackson's derivative operators

arXiv

引用

arXiv 2018年

作者： Nielsen, Frank Sun, Ke Sony Computer Science Laboratories Inc. Japan Data61 Australia

We propose a new generic type of stochastic neurons, called q-neurons, that considers activation functions based on Jackson's q-derivatives, with stochastic parameters q. Our generalization of neural network architectures with q-neurons is shown to be both scalable and very easy to implement. We demonstrate experimentally consistently improved performances over state-of-the-art standard activation functions, both on training and testing loss functions. Copyright © 2018, The Authors. All rights reserved.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Masses of Sunyaev-Zel’dovich Galaxy Clusters Detected by The Atacama Cosmology Telescope: Stacked Lensing Measurements with Subaru HSC Year 3 data

arXiv

引用

arXiv 2024年

作者： Shirasaki, Masato Sifón, Cristóbal Miyatake, Hironao Lau, Erwin Zhang, Zhuowen Bahcall, Neta Battaglia, Nicholas Devlin, Mark Dunkley, Jo Farahi, Arya Hilton, Matt Lin, Yen-Ting Nagai, Daisuke Staggs, Suzanne T. Sunayama, Tomomi Spergel, David Wollack, Edward J. National Institutes of Natural Science Mitaka Tokyo181-8588 Japan The Institute of Statistical Mathematics Tachikawa Tokyo190-8562 Japan Instituto de Física Pontificia Universidad Católica de Valparaíso Valparaíso Casilla4059 Chile Nagoya University Nagoya464-8602 Japan Institute for Advanced Research Nagoya University Nagoya464-8601 Japan The University of Tokyo Chiba277-8583 Japan Center for Astrophysics Harvard & Smithsonian 60 Garden St CambridgeMA02138 United States Department of Astronomy and Astrophysics University of Chicago 5640 S. Ellis Ave ChicagoIL60637 United States Fermilab Kirk & Pine Road BataviaIL60510 United States Department of Astrophysical Sciences Princeton University Peyton Hall PrincetonNJ08544 United States Department of Astronomy Cornell University IthacaNY14853 United States Department of Physics and Astronomy University of Pennsylvania 209 South 33rd Street PhiladelphiaPA United States Joseph Henry Laboratories of Physics Princeton University Jadwin Hall PrincetonNJ08544 United States Department of Statistics and Data Science The University of Texas AustinTX78712 United States Wits Centre for Astrophysics School of Physics University of the Witwatersrand Private Bag 3 Johannesburg2050 South Africa Astrophysics Research Centre School of Mathematics Statistics and Computer Science University of KwaZulu-Natal Westville Campus Durban4041 South Africa Institute of Astronomy and Astrophysics Academia Sinica Taipei10617 Taiwan Department of Physics Yale University New HavenCT06520 United States Steward Observatory University of Arizona TucsonAZ85704 United States Simons Foundation 160 Fifth Avenue NY NY10010 United States NASA/Goddard Space Flight Center GreenbeltMD20771 United States

We present a stacked lensing analysis of 96 galaxy clusters selected by the thermal Sunyaev-Zel’dovich (SZ) effect in maps of the cosmic microwave background (CMB). We select foreground galaxy clusters with a 5σ-level SZ threshold in CMB observations from the Atacama Cosmology Telescope, while we define background source galaxies for the lensing analysis with secure photometric redshift cuts in Year 3 data of the Subaru Hyper Suprime Cam survey. We detect the stacked lensing signal in the range of 0.1 −1Mpc] 14 h−1M), our likelihood analysis shows that the average total mass differs from the SZ counterpart by a factor of 1.3 ± 0.2, 1.6 ± 0.2, and 1.6 ±0.3 (68%) in the aforementioned redshift ranges, respectively. Our limits are consistent with previous lensing measurements, and we find that the cluster modeling choices can introduce a 1σ-level difference in our parameter inferences. © 2024, CC BY.

关键词： Cosmology

来源：评论

学校读者我要写书评

暂无评论

Attentive statistics pooling for deep speaker embedding

arXiv

引用

arXiv 2018年

作者： Okabe, Koji Koshinaka, Takafumi Shinoda, Koichi Data Science Research Laboratories NEC Corporation Japan Department of Computer Science Tokyo Institute of Technology Japan

This paper proposes attentive statistics pooling for deep speaker embedding in text-independent speaker verification. In conventional speaker embedding, frame-level features are averaged over all the frames of a single utterance to form an utterance-level feature. Our method utilizes an attention mechanism to give different weights to different frames and generates not only weighted means but also weighted standard deviations. In this way, it can capture long-term variations in speaker characteristics more effectively. An evaluation on the NIST SRE 2012 and the VoxCeleb data sets shows that it reduces equal error rates (EERs) from the conventional method by 7.5% and 8.1%, respectively. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

GUARANTEED DETERMINISTIC BOUNDS ON THE TOTAL VARIATION DISTANCE BETWEEN UNIVARIATE MIXTURES

GUARANTEED DETERMINISTIC BOUNDS ON THE TOTAL VARIATION DISTA...

引用

IEEE Workshop on Machine Learning for Signal Processing

作者： Frank Nielsen Ke Sun Sony Computer Science Laboratories Inc. Japan Data61 CSIRO Australia

The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in [0,1]. Since the total variation distance does not admit closed-form expressions for statistical mixtures, one often has to rely in practice on costly numerical integrations or on fast Monte Carlo approximations that however do not guarantee deterministic bounds. In this work, we consider two methods for bounding the total variation of univariate mixture models: The first is based on the information monotonicity property of the total variation to design guaranteed nested deterministic lower bounds. The second method relies on computing the geometric lower and upper envelopes of weighted mixture components to derive deterministic bounds based on density ratio. We demonstrate the tightness of our bounds through simulating Gaussian, Gamma and Rayleigh mixture models.

关键词： TV Upper bound Mixture models Density measurement Probability Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Co-whitening of i-vectors for short and long duration speaker verification 19

Co-whitening of i-vectors for short and long duration speake...

引用

19th Annual Conference of the International Speech Communication, INTERSPEECH 2018

作者： Xu, Longting Lee, Kong Aik Li, Haizhou Yang, Zhen Department of Electrical and Computer Engineering National University of Singapore Singapore Data Science Research Laboratories NEC Corporation Japan Broadband Wireless Communication and Sensor Network Technology Key Lab Nanjing University of Posts and Telecommunications China

An i-vector is a fixed-length and low-rank representation of a speech utterance. It has been used extensively in text-independent speaker verification. Ideally, speech utterances from the same speaker would map to an unique i-vector. However, this is not the case due to some intrinsic and extrinsic factors like physical condition of the speaker, channel difference, noise and notably the duration of speech utterances. In particular, we found that i-vectors extracted from short utterances exhibit larger variance than that of long utterances. To address the problem, we propose a co-whitening approach, taking into account the duration, while maximizing the correlation between the i-vectors of short and long duration. The proposed co-whitening method was derived based on canonical correlation analysis (CCA). Experimental results on NIST SRE 2010 show that co-whitening method is effective in compensating the duration mismatch, leading to a reduction of up to 13.07% in equal error rate (EER). © 2018 International Speech Communication Association. All rights reserved.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Quantum circuits for exact unitary t-designs and applications to higher-order randomized benchmarking

arXiv

引用

arXiv 2021年

作者： Nakata, Yoshifumi Zhao, Da Okuda, Takayuki Bannai, Eiichi Suzuki, Yasunari Tamiya, Shiro Heya, Kentaro Yan, Zhiguang Zuo, Kun Tamate, Shuhei Tabuchi, Yutaka Nakamura, Yasunobu Photon Science Center Graduate School of Engineering University of Tokyo Bunkyo-ku Tokyo113–8656 Japan JST PRESTO 4–1–8 Honcho Kawaguchi Saitama332–0012 Japan School of Mathematical Sciences Shanghai Jiao Tong University Shanghai400240 China Department of Mathematics Hiroshima University 1-3-1 Kagamiyama Higashihiroshima739-8562 Japan Fukuoka819-0385 Japan Mathematics Division National Center for Theoretical Sciences National Taiwan University Taipei10617 Taiwan NTT Computer and Data Science Laboratories NTT Corporation Musashino180-8585 Japan Department of Applied Physics Graduate School of Engineering University of Tokyo 7-3-1 Hongo Bynkyo-ku Tokyo113-8656 Japan University of Tokyo Meguro-ku Tokyo153-8904 Japan Wako Saitama351-0198 Japan

A unitary t-design is a powerful tool in quantum information science and fundamental physics. Despite its usefulness, only approximate implementations were known for general t. In this paper, we provide for the first time quantum circuits that generate exact unitary t-designs for any t on an arbitrary number of qubits. Our construction is inductive and is of practical use in small systems. We then introduce a t-th order generalization of randomized benchmarking (t-RB) as an application of exact 2t-designs. We particularly study the 2-RB in detail and show that it reveals self-adjointness of quantum noise, a new metric related to the feasibility of quantum error correction (QEC). We numerically demonstrate that the 2-RB in one- and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit by the 2-RB. It is shown from the experiment that interactions with adjacent qubits induce the noise that may result in an obstacle toward a realization of QEC. © 2021, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

The Bregman chord divergence

arXiv

引用

arXiv 2018年

作者： Nielsen, Frank Nock, Richard Sony Computer Science Laboratories Inc Japan Data 61 Australian National & Sydney Universities Australia

Distances are fundamental primitives whose choice significantly impacts the performances of algorithms in machine learning and signal processing. However selecting the most appropriate distance for a given task is an endeavor. Instead of testing one by one the entries of an ever-expanding dictionary of ad hoc distances, one rather prefers to consider parametric classes of distances that are exhaustively characterized by axioms derived from first principles. Bregman divergences are such a class. However fine-tuning a Bregman divergence is delicate since it requires to smoothly adjust a functional generator. In this work, we propose an extension of Bregman divergences called the Bregman chord divergences. This new class of distances does not require gradient calculations, uses two scalar parameters that can be easily tailored in applications, and generalizes asymptotically Bregman divergences. Copyright © 2018, The Authors. All rights reserved.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

A scalable weakly-synchronous algorithm for solving partial differential equations

arXiv

引用

arXiv 2019年

作者： Aditya, Konduri Gysi, Tobias Kwasniewski, Grzegorz Hoefler, Torsten Donzis, Diego A. Chen, Jacqueline H. Combustion Research Facility Sandia National Laboratories LivermoreCA94550 United States Department of Computer Science ETH Zurich Zuirch8092 Switzerland Department of Aerospace Engineering Texas A&M University College StationTX77843 United States Department of Computational and Data Sciences Indian Institute of Science Bangalore India

Synchronization overheads pose a major challenge as applications advance towards extreme scales. In current large-scale algorithms, synchronization as well as data communication delay the parallel computations at each time step in a time-dependent partial differential equation (PDE) solver. This creates a new scaling wall when moving towards exascale. We present a weakly-synchronous algorithm based on novel asynchrony-tolerant (AT) finite-difference schemes that relax synchronization at a mathematical level. We utilize remote memory access programming schemes that have been shown to provide significant speedup on modern supercomputers, to efficiently implement communications suitable for AT schemes, and compare to two-sided communications that are state-of-practice. We present results from simulations of Burgers' equation as a model of multi-scale strongly non-linear dynamical systems. Our algorithm demonstrate excellent scalability of the new AT schemes for large-scale computing, with a speedup of up to 3.3x in communication time and 2.19x in total runtime. We expect that such schemes can form the basis for exascale PDE algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：