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

Author Correction: Anthropogenic modification of forests means only 40% of remaining forests have high ecosystem integrity

引用

Nature communications 2021年第1期12卷 592页

作者： H S Grantham A Duncan T D Evans K R Jones H L Beyer R Schuster J Walston J C Ray J G Robinson M Callow T Clements H M Costa A DeGemmis P R Elsen J Ervin P Franco E Goldman S Goetz A Hansen E Hofsvang P Jantz S Jupiter A Kang P Langhammer W F Laurance S Lieberman M Linkie Y Malhi S Maxwell M Mendez R Mittermeier N J Murray H Possingham J Radachowsky S Saatchi C Samper J Silverman A Shapiro B Strassburg T Stevens E Stokes R Taylor T Tear R Tizard O Venter P Visconti S Wang J E M Watson Wildlife Conservation Society Global Conservation Program Bronx New York NY USA. hgrantham@***. Wildlife Conservation Society Global Conservation Program Bronx New York NY USA. School of Earth and Environmental Sciences University of Queensland Brisbane Australia. Department of Biology Carleton University Ottawa Canada. Wildlife Conservation Society Canada Toronto Canada. United Nations Development Programme One United Nations Plaza New York NY USA. World Resources Institute Washington DC USA. Global Earth Observation & Dynamics of Ecosystems Lab School of Informatics Computing and Cyber Systems Northern Arizona University Flagstaff AZ USA. Landscape Biodiversity Lab Ecology Department Montana State University Bozeman MT USA. Rainforest Foundation Norway Oslo Norway. Global Wildlife Conservation Austin TX USA. School of Life Sciences Arizona State University Tempe AZ USA. Centre for Tropical Environmental and Sustainability Science College of Science and Engineering James Cook University Cairns QLD Australia. Environmental Change Institute School of Geography and the Environment University of Oxford Oxford UK. College of Science and Engineering James Cook University Townsville Queensland Australia. School of Biological Sciences University of Queensland St. Lucia QLD Australia. The Nature Conservancy Arlington VA USA. Jet Propulsion Laboratory California Institute of Technology Pasadena CA USA. World Wide Fund for Nature Germany Space+Science Berlin Germany. International Institute of Sustainability Rio de Janeiro Brazil. Natural Resource and Environmental Studies Institute University of Northern British Columbia Prince George Canada. International Institute for Applied Systems Analysis Laxenburg Austria.

来源：评论

学校读者我要写书评

暂无评论

Exploring social justice, design, and HCI

Exploring social justice, design, and HCI

引用

34th Annual CHI Conference on Human Factors in computing Systems, CHI EA 2016

作者： Fox, Sarah Asad, Mariam Lo, Katherine Dimond, Jill Dombrowski, Lynn Bardzell, Shaowen Human Centered Design and Engineering University of Washington United States School of Literature Media and Communication Georgia Institute of Technology United States Department of Informatics University of California Irvine United States Sassafras Tech Collective United States School of Informatics and Computing Indiana University Purdue University Indianapolis United States School of Informatics and Computing Indiana University Bloomington United States

ISBN: (纸本)9781450340823

The aim of this one-day workshop is to share existing research, discuss common practices, and to develop new strategies and tools for designing for social justice in HCI. This workshop will bring together a set of HCI scholars, designers, and community members to discuss social justice perspectives on interaction design and technology. We will explore theoretical and methodological approaches in and around HCI that can help us generatively consider issues of power, privilege, and access in their complexity. We will discuss the challenges associated with taking a justice approach in HCI, looking toward existing practices we find both productive and problematic. This workshop will bridge current gaps in research and practice by developing concrete strategies for both designing and evaluating social change oriented work in HCI, where agendas are made clear and researchers are held accountable for the outcomes of their work by members of their field site and the research community. © 2016 Authors.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Factors affecting sentiment prediction of malay news headlines using machine learning approaches 2nd

Factors affecting sentiment prediction of malay news headlin...

引用

2nd International Conference on Soft computing in Data Science, SCDS 2016

作者： Alfred, Rayner Yee, Wong Wei Lim, Yuto Obit, Joe Henry Faculty of Computing and Informatics Universiti Malaysia Sabah Kota Kinabalu Malaysia School of Information Science Japan Advanced Institute of Science and Technology Nomi Japan

ISBN: (纸本)9789811027765

Most sentiment analysis researches are done with the help of supervised machine learning techniques. Analyzing sentiment for these English text reviews is a non-trivial task in order to gauge public perception and acceptance of a particular issue being addressed. Nevertheless, there are not many studies conducted on analyzing sentiment of Malay news headlines due to lack of resources and tools. The Malay news headlines normally consist of a few words and are often written with creativity to attract the readers’ attention. This paper proposes a standard framework that investigates factors affecting sentiment prediction of Malay news headlines using machine learning approaches. It is important to investigate factors (e.g., types of classifiers, proximity measurements and number of Nearest Neighbors, k) that influence the prediction performance of the sentiment analysis as it helps to study and understand the parameters that can be tuned to optimize the prediction performance. Based on the results obtained, Support Vector Machine and Naïve Bayes classifiers were capable to obtain higher accuracy compared to the k-Nearest Neighbors (k-NN) classifier. In term of proximity measurement and number of Nearest Neighbors, k, the k-NN classifier achieved higher prediction performance when the Cosine similarity is applied with a small value of k (e.g., 3 and 5), compared to the Euclidean distance because it measures can be affected by the high dimensionality of the data. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A multi-objectives genetic algorithm clustering ensembles based approach to summarize relational data 2nd

A multi-objectives genetic algorithm clustering ensembles ba...

引用

2nd International Conference on Soft computing in Data Science, SCDS 2016

作者： Alfred, Rayner Chiye, Gabriel Jong Lim, Yuto On, Chin Kim Obit, Joe Henry Faculty of Computing and Informatics Universiti Malaysia Sabah Kota Kinabalu Malaysia School of Information Science Japan Advanced Institute of Science and Technology Nomi Japan

ISBN: (纸本)9789811027765

In learning relational data, the Dynamic Aggregation of Relational Attributes algorithm is capable to transform a multi-relational database into a vector space representation, in which a traditional clustering algorithm can then be applied directly to summarize relational data. However, the performance of the algorithm is highly dependent on the quality of clusters produced. A small change in the initialization of the clustering algorithm parameters may cause adverse effects to the clusters quality produced. In optimizing the quality of clusters, a Genetic Algorithm is used to find the best combination of initializations in order to produce the optimal clusters. The proposed method involves the task of finding the best initialization with respect to the number of clusters, proximity distance measurements, fitness functions, and classifiers used for the evaluation. Based on the results obtained, clustering coupled with Euclidean distance is found to perform better in the classification stage compared to using clustering coupled with Cosine similarity. Based on the findings, the cluster entropy is the best fitness function, followed by multi-objectives fitness function used in the genetic algorithm. This is most probably because of the involvement of external measurement that takes the class label into consideration in optimizing the structure of the cluster results. In short, this paper shows the influence of varying the initialization values on the predictive performance. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Entanglement-based quantum clock synchronization

引用

AIP Conference Proceedings 2020年第1期2241卷

作者： Ebubechukwu O. Ilo-Okeke Louis Tessler Jonathan P. Dowling Tim Byrnes 1)State Key Laboratory of Precision Spectroscopy School of Physical and Material Sciences East China Normal University Shanghai 200062 China 2)New York University Shanghai 1555 Century Ave Pudong Shanghai 200122 China 3)Department of Physics School of Physical Sciences Federal University of Technology P. M. B. 1526 Owerri 460001 Nigeria 4)RIKEN Cluster for Pioneering Research 2-1 Hirosawa Wako-Shi Saitama 351-0106 Japan 5)NYU-ECNU Institute of Physics at NYU Shanghai 3663 Zhongshan Road North Shanghai 200062 China 8)Hearne Institute for Theoretical Physics Department of Physics & Astronomy Louisiana State University Baton Rouge Louisiana 70803-4001 USA 9)CAS-Alibaba Quantum Computing Laboratory University of Science and Technology of China Shanghai 201315 China 6)National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-ku Tokyo 101-8430 Japan 7)Department of Physics New York University New York NY 10003 USA

Synchronizing clocks using quantum entanglement works on the principle that two clocks Alice and Bob share between them a singlet state which is a stationary state that is immune to evolution under bare atomic Hamiltonian. A major obstacle to its realization is the hidden assumption of a common phase reference between the clocks. Without hidden assumption, a clock state of Alice or Bob is not a uniquely defined quantum state because the phase of the state is arbitrary. This results in an unknown relative phase in a two-particle entangled state defined by the clocks. We show that using entanglement purification, an entanglement-based clock synchronization is achieved despite earlier results showing the contrary. This closes the loophole for entanglement based quantum clock synchronization protocols, which is a non-local approach to synchronize two clocks independent of the properties of the intervening medium.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards realizing the importance of placing fog computing facilities at the central office of a PON

Towards realizing the importance of placing fog computing fa...

引用

International Conference on Advanced Communication technology (ICACT)

作者： S. H. Shah Newaz Wida Susanty binti Haji Suhaili Gyu Myoung Lee Mohammad Rakib Uddin Alaelddin Fuad Yousif Mohammed Jun Kyun Choi School of Computing and Informatics Universiti Teknologi Brunei (UTB) Gadong Brunei Darussalam School of Computing and Mathematical Sciences Liverpool John Moores University Liverpool United Kingdom Korea Advanced Institute of Science and Technology (KAIST) Daejeon South Korea Dept. of Electrical and Electronic Engineering Universiti Teknologi Brunei (UTB) Gadong Brunei Darussalam Korea Advanced Institute of Science and Technology Daejeon Daejeon KR

ISBN: (纸本)9781509048922

This paper highlights the importance of accommodating Fog computation facilities in a Passive Optical Network (PON). Fog computation is referred to as a decentralized computing infrastructure at the network access segment so as to facilitate computation capability closer to end users. PON is seen to be one of the key players in expansion of communication networks. It has paved the way in realizing high speed broadband Internet access to the end users. This paper presents an architectures, namely Fog Co-located Optical Line Terminal (FC-OLT). The FC-OLT architecture is the first effort towards presenting an integrated architecture of Fog computation facilities and PON. This architecture is presented considering Time Division Multiplexing (TDM)-PON (TDM-PON) topology. Along with explaining importance of this architecture in improving Quality of service (QoS) and Quality of Experience (QoE) parameters, we point out several important research issues in order to provide direction for future research. Initial performance measurement of FC-OLT presented in this paper reveals that FC-OLT architecture can contribute a great deal of in improving traffic performance.

关键词： Servers Computer architecture Passive optical networks Quality of service Optical network units Cloud computing Edge computing

来源：评论

学校读者我要写书评

暂无评论

An interview based study of pioneering experiences in teaching and learning complex systems in higher education

arXiv

引用

arXiv 2018年

作者： Lizier, Joseph T. Harré, Michael S. Mitchell, Melanie DeDeo, Simon Finn, Conor Lindgren, Kristian Lizier, Amanda L. Sayama, Hiroki Centre for Complex Systems Complex Systems Research Group Faculty of Engineering and IT University of Sydney NSW Australia Department of Computer Science Portland State University PortlandOR United States Santa Fe Institute Santa FeNM United States School of Informatics and Computing Indiana University BloomingtonIN United States Department of Social and Decision Sciences Carnegie Mellon University PittsburghPA United States CSIRO Data 61 MarsfieldNSW Australia Department of Space Earth and Environment Chalmers University of Technology Göteborg Sweden School of Education University of Technology Sydney NSW Australia Center for Collective Dynamics of Complex Systems Department of Systems Science and Industrial Engineering Binghamton University State University of New York NY United States

Due to the interdisciplinary nature of complex systems as a field, students studying complex systems at University level have diverse disciplinary backgrounds. This brings challenges (e.g. wide range of computer programming skills) but also opportunities (e.g. facilitating interdisciplinary interactions and projects) for the classroom. However, there is little published regarding how these challenges and opportunities are handled in teaching and learning Complex Systems as an explicit subject in higher education, and how this differs in comparison to other subject areas. We seek to explore these particular challenges and opportunities via an interview-based study of pioneering teachers and learners (conducted amongst the authors) regarding their experiences. We compare and contrast those experiences, and analyse them with respect to the educational literature. Our discussions explored: approaches to curriculum design, how theories/models/frameworks of teaching and learning informed decisions and experience, how diversity in student backgrounds was addressed, and assessment task design. We found a striking level of commonality in the issues expressed as well as the strategies to handle them, for example a significant focus on problem-based learning, and the use of major student-led creative projects for both achieving and assessing learning outcomes. Copyright © 2018, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Complexity-theoretic limitations on blind delegated quantum computation

arXiv

引用

arXiv 2017年

作者： Aaronson, Scott Cojocaru, Alexandru Gheorghiu, Alexandru Kashefi, Elham Department of Computer Science University of Texas at Austin United States School of Informatics University of Edinburgh Department of Computing and Mathematical Sciences California Institute of Technology CNRS LIP6 Université Pierre et Marie Curie Paris France

Blind delegation protocols allow a client to delegate a computation to a server so that the server learns nothing about the input to the computation apart from its size. For the specific case of quantum computation we know, from work over the past decade, that blind delegation protocols can achieve information-theoretic security (provided the client and the server exchange some amount of quantum information). In this paper we prove, provided certain complexity-theoretic conjectures are true, that the power of information-theoretically secure blind delegation protocols for quantum computation (ITS-BQC protocols) is in a number of ways constrained. In the first part of our paper we provide some indication that ITS-BQC protocols for delegating polynomial-time quantum computations in which the client and the server interact only classically are unlikely to exist. We first show that having such a protocol in which the client and the server exchange O(nd) bits of communication, implies that BQP ⊂ MA/O(nd). We conjecture that this containment is unlikely by proving that there exists an oracle relative to which BQP 6⊂ MA/O(nd). We then show that if an ITS-BQC protocol exists in which the client and the server interact only classically and which allows the client to delegate quantum sampling problems to the server (such as BosonSampling) then there exist non-uniform circuits of size 2n−Ω(n/log(n)), making polynomially-sized queries to an NPNP oracle, for computing the permanent of an n × n matrix. The second part of our paper concerns ITS-BQC protocols in which the client and the server engage in one round of quantum communication and then exchange polynomially many classical messages. First, we provide a complexity-theoretic upper bound on the types of functions that could be delegated in such a protocol by showing that they must be contained in QCMA/qpoly∩ coQCMA/qpoly. Then, we show that having such a protocol for delegating NP-hard functions implies coNPNPNP ⊆ NPNPPromis

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Speeding-up node influence computation for huge social networks

引用

International Journal of Data Science and Analytics 2016年第1期1卷 3-16页

作者： Kimura, Masahiro Saito, Kazumi Ohara, Kouzou Motoda, Hiroshi Department of Electronics and Informatics Ryukoku University Otsu520-2194 Japan School of Administration and Informatics University of Shizuoka Shizuoka422-8526 Japan Department of Integrated Information Technology Aoyama Gakuin University Kanagawa229-8558 Japan Institute of Scientific and Industrial Research Osaka University Osaka567-0047 Japan School of Computing and Information Systems University of Tasmania HobartTAS7005 Australia

We address the problem of efficiently estimating the influence degree for all the nodes simultaneously in the network under the SIR setting. The proposed approach is a further improvement over the existing work of the bond percolation process which was demonstrated to be very effective, i.e., three orders of magnitude faster than direct Monte Carlo simulation, in approximately solving the influence maximization problem. We introduce two pruning techniques which improve computational efficiency by an order of magnitude. This approach is generic and can be instantiated to any specific diffusion model. It does not require any approximations or assumptions to the model that were needed in the existing approaches. We demonstrate its effectiveness by extensive experiments on two large real social networks. Main finding includes that different network structures have different epidemic thresholds and the node influence can identify influential nodes that the existing centrality measures cannot. We analyze how the performance changes when the network structure is systematically changed using synthetically generated networks and identify important factors that affect the performance. © 2015, Springer International Publishing Switzerland.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Disciplines and measures of information resilience

Disciplines and measures of information resilience

引用

International Conference on Transparent Optical Networks

作者： Jacek Rak Magnus Jonsson David Hutchison James P.G. Sterbenz Faculty of Electronics Telecommunications and Informatics Gdansk University of Technology Poland Halmstad University Centre for Research on Embedded Systems (CERES) Sweden Lancaster University School of Computing and Communications UK The University of Kansas EECS and Information and Telecommunication Technology Center USA The Hong Kong Polytechnic University Kowloon Hong Kong

Communication networks have become a fundamental part of many critical infrastructures, playing an important role in information delivery in various failure scenarios triggered e.g., by forces of nature (including earthquakes, tornados, fires, etc.), technology-related disasters (for instance due to power blackout), or malicious human activities. A number of recovery schemes have been defined in the context of network resilience (with the primary focus on communication possibility in failure scenarios including access to a particular host, or information exchange between a certain pair of end nodes). However, because end-users are becoming more and more interested in information itself (regardless of its physical location in the network), it is appropriate to complement the well-defined framework of network resilience with one that addresses information resilience, and to introduce definitions of relevant disciplines and measures, as proposed in this paper.

关键词： Resilience Communication networks Information exchange Quality of service Telecommunications Face

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：