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

arXiv 2018年

作者： Bacon, David J. Battye, Richard A. Bull, Philip Camera, Stefano Ferreira, Pedro G. Harrison, Ian Parkinson, David Pourtsidou, Alkistis Santos, Mário G. Wolz, Laura Abdalla, Filipe Akrami, Yashar Alonso, David Andrianomena, Sambatra Ballardini, Mario Bernal, José Luis Bertacca, Daniele Bengaly, Carlos A.P. Bonaldi, Anna Bonvin, Camille Brown, Michael L. Chapman, Emma Chen, Song Chen, Xuelei Cunnington, Steven Davis, Tamara M. Dickinson, Clive Fonseca, José Grainge, Keith Harper, Stuart Jarvis, Matt J. Maartens, Roy Maddox, Natasha Padmanabhan, Hamsa Pritchard, Jonathan R. Raccanelli, Alvise Rivi, Marzia Roychowdhury, Sambit Sahlén, Martin Schwarz, Dominik J. Siewert, Thilo M. Viel, Matteo Villaescusa-Navarro, Francisco Xu, Yidong Yamauchi, Daisuke Zuntz, Joe Institute of Cosmology & Gravitation University of Portsmouth Dennis Sciama Building PortsmouthPO1 3FX United Kingdom Jodrell Bank Centre for Astrophysics School of Physics and Astronomy University of Manchester ManchesterM13 9PL United Kingdom School of Physics & Astronomy Queen Mary University of London 327 Mile End Road LondonE1 4NS United Kingdom Dipartimento di Fisica Universitá degli Studi di Torino Via P. Giuria 1 Torino10125 Italy INFN – Istituto Nazionale di Fisica Nucleare Sezione di Torino Via P. Giuria 1 Torino10125 Italy INAF – Osservatorio Astrofisico di Torino Strada Osservatorio 20 Pino Torinese10025 Italy Department of Physics University of Oxford Denys Wilkinson Building Keble Road OxfordOX1 3RH United Kingdom Korea Astronomy and Space Science Institute Yuseong-gu Daedeokdae-ro 776 Daejeon34055 Korea Republic of Department of Physics & Astronomy University of the Western Cape Cape Town7535 South Africa SKA South Africa The Park Cape Town7405 South Africa Instituto de Astrofisica e Ciencias do Espaco Universidade de Lisboa OAL Tapada da Ajuda LisboaPT1349-018 Portugal Astrophysics Group School of Physics University of Melbourne ParkvilleVIC3010 Australia Department of Physics and Astronomy University College London Gower Street LondonWC1E 6BT United Kingdom Department of Physics and Electronics Rhodes University PO Box 94 Grahamstown6140 South Africa Lorentz Institute for Theoretical Physics Leiden University P.O. Box 9506 Leiden2300 RA Netherlands Département de Physique École Normale Supérieure PSL Research University CNRS 24 rue Lhomond Paris75005 France Department of Mathematics & Applied Mathematics University of Cape Town Cape Town7701 South Africa INAF - Istituto di Radioastronomia via Gobetti 101 Bologna40129 Italy Martí Franquès 1 BarcelonaE08028 Spain Dept. de Física Quàntica i Astrofísica Universitat de Barcelona Martí i Franquès 1 BarcelonaE08028 Spain Argelander-Institut für Astronomi

We present a detailed overview of the cosmological surveys that will be carried out with Phase 1 of the Square Kilometre Array (SKA1), and the science that they will enable. We highlight three main surveys: a medium-deep continuum weak lensing and low-redshift spectroscopic HI galaxy survey over 5,000 deg2;a wide and deep continuum galaxy and HI intensity mapping survey over 20,000 deg2 from z = 0.35 − 3;and a deep, high-redshift HI intensity mapping survey over 100 deg2 from z = 3 − 6. Taken together, these surveys will achieve an array of important scientific goals: measuring the equation of state of dark energy out to z ∼ 3 with percent-level precision measurements of the cosmic expansion rate;constraining possible deviations from General Relativity on cosmological scales by measuring the growth rate of structure through multiple independent methods;mapping the structure of the Universe on the largest accessible scales, thus constraining fundamental properties such as isotropy, homogeneity, and non-Gaussianity;and measuring the HI density and bias out to z = 6. These surveys will also provide highly complementary clustering and weak lensing measurements that have independent systematic uncertainties to those of optical surveys like LSST and Euclid, leading to a multitude of synergies that can improve constraints significantly beyond what optical or radio surveys can achieve on their own. This document, the 2018 Red Book, provides reference technical specifications, cosmological parameter forecasts, and an overview of relevant systematic effects for the three key surveys, and will be regularly updated by the Cosmology science Working Group in the run up to start of operations and the Key science Programme of SKA1. Copyright © 2018, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

On Critical Densities and Velocities for Pedestrians Entering a Crowd

引用

Transportation Research Procedia 2014年 2卷 394-399页

作者： Rainald Löhner Eberhard Haug CFD Center Dept. of Computational and Data Science M.S. 6A2 College of Science George Mason University Fairfax VA 22030-4444 USA ESI Group Aix en Provence France

The problem of pedestrians trying to enter and/or advance against an incoming crowd is studied. The analysis shows that starting with a very limited set of assumptions (elliptical cross-section of pedestrians; constant ratio of forward to lateral separation) one is able to derive from purely kinematic considerations critical densities beyond which it is impossible for pedestrians to enter and/or advance into an incoming crowd. The results obtained indicate that for the common pedestrian size of a = 0.5 m , b = 0.3 m , the limit densities range from ρ = O(5.0 – 6.06) [ p / m 2 ], in good agreement with empirical observations.

关键词： dense crowds emergency response

来源：评论

学校读者我要写书评

暂无评论

An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem

An efficient method for checking overlaps and construction a...

引用

IEEE International Conference on Industrial engineering and engineering Management

作者： S. Fukatsu Y. Hu H. Hashimoto S. Imahori M. Yagiura Nagoya Daigaku Nagoya Aichi JP Dept. Computer Science and Mathematical Informatics Nagoya University Nagoya Japan Dept. Computational Science and Engineering Nagoya University Nagoya Japan

ISBN: (纸本)9781479964116

The two-dimensional strip packing problem arises in wide variety of industrial applications. In this paper, we focus on the bitmap shape packing problem where a set of arbitrary shaped objects represented in bitmap format should be packed into a larger rectangular container without overlap. The complex geometry of bitmap shapes and large amount of data to be processed make it difficult to check overlaps. For this reason, most of the algorithms in the literature only deal with small-scale instances. We propose an efficient method for checking overlaps and design efficient implementations of two construction algorithms, which are based on the bottom-left strategy. The computational results for a series of well-known benchmark instances show that the proposed algorithms obtain good solutions in remarkably short time and are effective for large-scale instances.

关键词： Shape Bismuth Algorithm design and analysis Complexity theory Containers Heuristic algorithms Layout

来源：评论

学校读者我要写书评

暂无评论

Overview of SIGHAN 2014 Bake-off for Chinese Spelling Check

Overview of SIGHAN 2014 Bake-off for Chinese Spelling Check

引用

3rd CIPS-SIGHAN Joint Conference on Chinese Language Processing, CLP 2014

作者： Yu, Liang-Chih Lee, Lung-Hao Tseng, Yuen-Hsien Chen, Hsin-Hsi Dept. of Information Management Yuen-Ze University China Innovation Center for Big Data and Digital Convergence Yuen-Ze University China Information Technology Center National Taiwan Normal University Taiwan Dept. of Computer Science and Information Engineering National Taiwan University Taiwan

This paper introduces a Chinese Spelling Check campaign organized for the SIGHAN 2014 bake-off, including task description, data preparation, performance metrics, and evaluation results based on essays written by Chinese as a foreign language learners. The hope is that such evaluations can produce more advanced Chinese spelling check techniques. © 2014 CLP 2014 - 3rd CIPS-SIGHAN Joint Conference on Chinese Language Processing. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Big data Processing for Prediction of Traffic Time Based on Vertical data Arrangement

Big Data Processing for Prediction of Traffic Time Based on ...

引用

IEEE International Conference on Cloud Computing Technology and science (CloudCom)

作者： Seungwoo Jeon Bonghee Hong Byungsoo Kim Dept. of Electrical and Computer Engineering Pusan National University Busan South Korea Dept. of Data Science Inje University Busan South Korea

ISBN: (纸本)9781479940929

To predict future traffic conditions in each road with unique spatiotemporal pattern, it is necessary to analyze the conditions based on historical traffic data and select time series forecasting methods which can be predicting next pattern for each road according to the analyzed results. Our goal is to create a new statistical model and a new system for predictive graphs of traffic times based on big data processing tools. First, we suggest a vertical data arrangement, gathering past traffic times in the same time slot for long-term prediction. Second, we analyze each traffic pattern to select time-series variables because a time-series forecasting method for a location and a time will be selected according to the variables that are available. Third, we suggest a spatiotemporal prediction map, which is a two-dimensional map with time and location. Each element in the map represents a time-series forecasting method and an R-squared value as indicator of prediction accuracy. Finally, we introduce a new system including RHive as a middle point between R and Hadoop clusters for generating predicted data efficiently from big historical data.

关键词： Roads Forecasting Spatiotemporal phenomena Market research Accuracy Analytical models Predictive models

来源：评论

学校读者我要写书评

暂无评论

An Automated Approach for Fibrin Network Segmentation and Structure Identification in 3D Confocal Microscopy Images

An Automated Approach for Fibrin Network Segmentation and St...

引用

Annual IEEE Symposium on Computer-Based Medical Systems

作者： Jianxu Chen Oleg V. Kim Rustem I. Litvinov John W. Weisel Mark S. Alber Danny Z. Chen Dept. of Computer Science and Engineering Univ. of Notre Dame Dept. of Applied and Computational Mathematics and Statistics Univ. of Notre Dame Dept. of Cell and Developmental Biology Univ. of Pennsylvania School of Medicine

Fibrin networks, formed during blood clotting, have a large and complicated structure and play a crucial role in regulating blood clot growth. Identifying and analyzing the 3D topological structure of fibrin networks using fluorescence confocal microscopy images is challenging due to their complex anatomy, and known automated methods do not seem to work well. In this paper, we present a two-stage approach for identifying the topological structure of fibrin networks in 3D confocal microscopy images. The first stage segments fibrin networks using a new Indicator-Guided Adaptive Thresholding (IGAT) algorithm. The second stage extracts, prunes, and analyzes the skeleton of fibrin networks in order to identify their topological structure. A new approach based on orientation analysis is applied to refine the extracted topological structure. Evaluation on 3D confocal microscopy images demonstrates that our approach is not sensitive to parameter selection and outperforms the known method, reducing the false positive rate for detecting branch points by 24% and reducing the false negative rate for detecting fiber segments by 15%.

关键词： Image segmentation Three-dimensional displays Microscopy Skeleton Algorithm design and analysis Biomedical imaging Blood

来源：评论

学校读者我要写书评

暂无评论

Parallelizing computation of elastodynamic response on arbitrary domains using GPU

Parallelizing computation of elastodynamic response on arbit...

引用

IEEE Southeastcon

作者： Mizan Rahman Abu Asaduzzaman School of Computational Science & Engineering Georgia Institute of Technology Atlanta Georgia USA Dept. of Elec. Eng. and Computer Science Wichita State University Wichita Kansas USA

The cellular automata (CA) approach for modeling wave propagation in elastic media presented by Georgia Tech researchers is very promising. The software package (JCA for Java cellular automata) they developed to simulate the wave propagation, takes a mesh file, runs a simulation, and outputs results. However, the processing time for large mesh file is extremely high. CUDA assisted parallel processing of finite element method (FEM) shows potential to analyze wave propagation in computational solid mechanics. In this work, we propose GPU assisted CA approach for computing elastodynamic response on different fields. The elastodynamic CA method is discontinuous like FEM and thus accurately captures propagating wave fronts. The CA technique lends itself to parallelization because there is no need to store a large sparse matrix. Experiments show that for 26K mesh size and 10000 iterations, GPU assisted solution gains speed up more than 573x over the JCA implementation.

关键词： Finite element analysis Automata Graphics processing units Equations Mathematical model Lightning computational modeling

来源：评论

学校读者我要写书评

暂无评论

Predicting Evoked Emotions in Video

Predicting Evoked Emotions in Video

引用

IEEE International Symposium on Multimedia

作者： Joseph G. Ellis W. Sabrina Lin Ching-Yung Lin Shih-Fu Chang Dept. of Electrical Engineering Columbia University New York Network Science and Big Data Analytics IBM Research Yorktown Heights New York

Understanding how human emotion is evoked from visual content is a task that we as people do every day, but machines have not yet mastered. In this work we address the problem of predicting the intended evoked emotion at given points within movie trailers. Movie Trailers are carefully curated to elicit distinct and specific emotional responses from viewers, and are therefore well-suited for emotion prediction. However, current emotion recognition systems struggle to bridge the "affective gap", which refers to the difficulty in modeling high-level human emotions with low-level audio and visual features. To address this problem, we propose a mid-level concept feature, which is based on detectable movie shot concepts which we believe to be tied closely to emotions. Examples of these concepts are "Fight", "Rock Music", and "Kiss". We also create 2 datasets, the first with shot-level concept annotations for learning our concept detectors, and a separate, second dataset with emotion annotations taken throughout the trailers using the two dimensional arousal and valence model for emotion annotation. We report the performance of our concept detectors, and show that by using the output of these detectors as a mid-level representation for the movie shots we are able to more accurately predict the evoked emotion throughout a trailer than by using low-level features.

关键词： Motion pictures Feature extraction Detectors Visualization Pipelines Image color analysis Histograms

来源：评论

学校读者我要写书评

暂无评论

Utility maximization for chunk-based OFDMA systems with multiple ber requirements

Utility maximization for chunk-based OFDMA systems with mult...

引用

IEEE International Workshop Technical Committee on Communications Quality and Reliability, CQR

作者： Tianzhou He Xin Wang Wei Ni Dept. of Comp. & Elec. Engr. & Comp. Sci Florida Atlantic University USA Dept. of Communication Science and Engineering Fudan University China CSIRO Computational Informatics (CCI) Sydney Australia

ISBN: (纸本)9781467372527

In wireless orthogonal frequency division multipleaccess (OFDMA) standards, subcarriers are grouped into chunks and a chunk of subcarriers is made as the minimum unit for subcarrier allocation. We investigate the chunk-based resource allocation for OFDMA downlink, where data streams contain packets with diverse bit-error-rate (BER) requirements. Supposing that adaptive transmissions are based on a number of discrete modulation and coding modes, we propose the optimal resource allocation scheme that maximizes a utility function of average user rates. With proper formulation, the relevant optimization problem is cast as an mixed-integer program, and it is shown that the optimal strategy for this problem can be obtained through Lagrange dual-based gradient iterations with fast convergence and low computational complexity per iteration. Furthermore, a novel on-line algorithm is developed to approach the optimal strategy without knowledge of intended wireless channels a priori. Numerical results show that the proposed optimal chunk allocation schemes with different α-fair utility functions can nicely trade off total network throughput for fairness among users.

关键词： Resource management Fading Bit error rate Wireless communication Throughput Downlink Modulation

来源：评论

学校读者我要写书评

暂无评论

CAST: Contraction Algorithm for Symmetric Tensors

CAST: Contraction Algorithm for Symmetric Tensors

引用

International Conference on Parallel Processing (ICPP)

作者： Samyam Rajbhandari Akshay Nikam Pai-Wei Lai Kevin Stock Sriram Krishnamoorthy P. Sadayappan Dept. of Computer Science and Engineering The Ohio State University Columbus OH USA Computational Sciences and Mathematics Division Pacific Northwest National Laboratory Richland WA USA

Tensor contractions represent the most compute- intensive core kernels in ab initio computational quantum chemistry and nuclear physics. Symmetries in these tensor contractions make them difficult to load balance and scale to large distributed systems. In this paper, we develop an efficient and scalable algorithm to contract symmetric tensors. We introduce a novel approach that avoids data redistribution during contraction of symmetric tensors while also bypassing redundant storage and maintaining load balance. We present experimental results on two parallel supercomputers for several symmetric contractions that appear in the coupled cluster singles and doubles (CCSD) quantum chemistry method. We also present a novel approach to tensor redistribution that can take advantage of parallel hyperplanes when the initial distribution has replicated dimensions, and use collective broadcast when the final distribution has replicated dimensions, making the algorithm very efficient.

关键词： Tensile stress Chemistry Indexes Symmetric matrices Quantum computing Contracts Software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：