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

On the relationship between energy complexity and other boolean function measures

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Sun, Xiaoming Sun, Yuan Wu, Kewen Xia, Zhiyu CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Electronics Engineering and Computer Science Peking University China

In this work we investigate energy complexity, a Boolean function measure related to circuit complexity. Given a circuit C over the standard basis {∨2, ∧2, ¬}, the energy complexity of C, denoted by EC(C), is the maximum number of its activated inner gates over all inputs. The energy complexity of a Boolean function f, denoted by EC(f), is the minimum of EC(C) over all circuits C computing f. Recently, K. Dinesh et al. [3] gave EC(f) an upper bound in terms of the decision tree complexity, EC(f) = O(D(f)3). They also showed that EC(f) ≤ 3n−1, where n is the input size. For the lower bound, they show that EC(f) ≥ 13 psens(f), where psens(f) is the positive sensitivity. They asked whether EC(f) can be lower bounded by a polynomial of D(f). We improve both the upper and lower bounds in this paper. For upper bounds, We show that EC(f) ≤ min{ 12 D(f)2 + O(D(f)), n + 2 D(f) − 2}. For the lower bound, we answer Dinesh et al.'s question by proving that EC(f) = Ω(pD(f)). For non-degenerated functions, we also give another lower bound EC(f) = Ω(log n) where n is the input size. These two lower bounds are incomparable to each other. Besides, we examine the energy complexity of OR functions and ADDRESS functions, which implies the tightness of our two lower bounds respectively. In addition, the former one answers another open question in [3] asking for non-trivial lower bound for energy complexity of OR functions. Copyright © 2018, The Authors. All rights reserved.

关键词： Decision trees

Changing life expectancy in European countries 1990–2021: a subanalysis of causes and risk factors from the Global Burden of Disease Study 2021

学校读者我要写书评

暂无评论

The Lancet Public Health 2025年第3期10卷 e172-e188页

作者： Steel, Nicholas Bauer-Staeb, Clarissa Maria Mercedes Ford, John A. Abbafati, Cristiana Abdalla, Mohammed Altigani Abdelkader, Atef Abdi, Parsa Zuñiga, Roberto Ariel Abeldaño Abiodun, Olugbenga Olusola Abolhassani, Hassan Abu-Gharbieh, Eman Abukhadijah, Hana J. Abu-Zaid, Ahmed Addo, Isaac Yeboah Addolorato, Giovanni Adekanmbi, Victor Adetunji, Juliana Bunmi Adeyeoluwa, Temitayo Esther Agardh, Emilie E. Agyemang-Duah, Williams Ahmad, Danish Ahmed, Ayman Ahmed, Syed Anees Akinosoglou, Karolina Akkaif, Mohammed Ahmed Al Awaidy, Salah Al Hasan, Syed Mahfuz Al Zaabi, Omar Ali Mohammed Aldridge, Robert W. Algammal, Abdelazeem M. Al-Gheethi, Adel Ali Saeed Ali, Abid Ali, Mohammed Usman Ali, Syed Shujait Ali, Waad Alicandro, Gianfranco Alif, Sheikh Mohammad Al-Jumaily, Adel Allebeck, Peter Alrawashdeh, Ahmad Al-Rifai, Rami H. Alsabri, Mohammed A. Alshahrani, Najim Z. Aluh, Deborah Oyine Al-Wardat, Mohammad Al-Zyoud, Walid A. Amiri, Sohrab Anderlini, Deanna Andrei, Catalina Liliana Anil, Abhishek Anvari, Saeid Anyasodor, Anayochukwu Edward Appiah, Seth Christopher Yaw Aquilano, Michele Arabloo, Jalal Arafat, Mosab Areda, Demelash Aremu, Abdulfatai Armani, Keivan Armocida, Benedetta Ärnlöv, Johan Asaduzzaman, Muhammad Astell-Burt, Thomas Aujayeb, Avinash Ausloos, Marcel Azadnajafabad, Sina Aziz, Shahkaar Azzam, Ahmed Y. Babu, Giridhara Rathnaiah Badache, Andreea Corina Badiye, Ashish D. Bahramian, Saeed Baig, Atif Amin Baker, Jennifer L. Bansal, Hansi Bärnighausen, Till Winfried Barone, Mark Thomaz Ugliara Barrow, Amadou Barteit, Sandra Bashir, Shahid Bashiru, Hameed Akande Basso, João Diogo Bastan, Mohammad-Mahdi Basu, Sanjay Batra, Kavita Bauckneht, Matteo Baune, Bernhard T. Beghi, Massimiliano Beiranvand, Maryam Béjot, Yannick Bell, Michelle L. Bello, Olorunjuwon Omolaja Belo, Luis Beloukas, Apostolos Beneke, Alice A. Bettencourt, Paulo J.G. Bhagavathula, Akshaya Srikanth Bhala, Neeraj Bhaskar, Sonu Bisulli, Francesca Bjørge, Tone Bodunrin, Aadam Olalekan Carvajal, Alejandro Botero Bouaoud, Souad Brayne, Carol Brenner, H Department of Primary Care and Public Health University of East Anglia Norwich United Kingdom Office for Health Improvement and Disparities Department of Health and Social Care London United Kingdom Department of Legal and Economic Studies La Sapienza University Rome Italy Rome Italy Hull York Medical School University of Hull Hull United Kingdom Department of Mathematics and Sciences Ajman University Ajman United Arab Emirates Department of Medicine Memorial University St. John's NL Canada Postgraduate Department University of Sierra Sur Miahuatlan de Porfirio Diaz Mexico Yhteiskuntadatatieteen keskus (Centre for Social Data Science) Helsinki Finland Department of Internal Medicine Federal Medical Centre Abuja Nigeria Research Center for Immunodeficiencies Tehran University of Medical Sciences Tehran Iran Department of Medical Biochemistry and Biophysics Karolinska Institutet (Karolinska Institute) Stockholm Sweden Department of Clinical Sciences University of Sharjah Sharjah United Arab Emirates Department of Biopharmaceutics and Clinical Pharmacy University of Jordan Amman Jordan Medical Research Center Hamad Medical Corporation Doha Qatar Department of Biochemistry and Molecular Medicine Alfaisal University Riyadh Saudi Arabia College of Graduate Health Sciences University of Tennessee Memphis TN United States School of Medicine Sydney NSW Australia Centre for Social Research in Health University of New South Wales Sydney NSW Australia Internal Medicine and Alcohol Related Disease Unit Fondazione Policlinico Universitario A. Gemelli IRCCS Rome Italy Department of Medical and Surgical Sciences Università Cattolica di Roma (Catholic University of Rome) Rome Italy Department of Obstetrics and Gynecology University of Texas Medical Branch Galveston TX United States Department of Biochemistry Osun State University Osogbo Nigeria Department of Pharmacology and Therapeutics University of Medical Sciences Ondo Ondo Nigeria Department of Veteri

Background: Decades of steady improvements in life expectancy in Europe slowed down from around 2011, well before the COVID-19 pandemic, for reasons which remain disputed. We aimed to assess how changes in risk factors and cause-specific death rates in different European countries related to changes in life expectancy in those countries before and during the COVID-19 pandemic. Methods: We used data and methods from the Global Burden of Diseases, Injuries, and Risk Factors Study 2021 to compare changes in life expectancy at birth, causes of death, and population exposure to risk factors in 16 European Economic Area countries (Austria, Belgium, Denmark, Finland, France, Germany, Greece, Iceland, Ireland, Italy, Luxembourg, the Netherlands, Norway, Portugal, Spain, and Sweden) and the four UK nations (England, Northern Ireland, Scotland, and Wales) for three time periods: 1990–2011, 2011–19, and 2019–21. Changes in life expectancy and causes of death were estimated with an established life expectancy cause-specific decomposition method, and compared with summary exposure values of risk factors for the major causes of death influencing life expectancy. Findings: All countries showed mean annual improvements in life expectancy in both 1990–2011 (overall mean 0·23 years [95% uncertainty interval [UI] 0·23 to 0·24]) and 2011–19 (overall mean 0·15 years [0·13 to 0·16]). The rate of improvement was lower in 2011–19 than in 1990–2011 in all countries except for Norway, where the mean annual increase in life expectancy rose from 0·21 years (95% UI 0·20 to 0·22) in 1990–2011 to 0·23 years (0·21 to 0·26) in 2011–19 (difference of 0·03 years). In other countries, the difference in mean annual improvement between these periods ranged from –0·01 years in Iceland (0·19 years [95% UI 0·16 to 0·21] vs 0·18 years [0·09 to 0·26]), to –0·18 years in England (0·25 years [0·24 to 0·25] vs 0·07 years [0·06 to 0·08]). In 2019–21, there was an overall decrease in mean annual life expectancy a

关键词：

MemNetAR: Memory network with Adversative Relation for Target-Level Sentiment Classification

学校读者我要写书评

暂无评论

MemNetAR: Memory Network with Adversative Relation for Targe...

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Yiwei Gao Jianwei Niu Xuefeng Liu Kaili Mao Shui Yu State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing (BDBC) Beihang University Hangzhou Innovation Research Institute Beihang University School of Computer Science and Cyber Engineering Guangzhou University Guangdong China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

Target-level sentiment classification aims to identify the sentiment of multiple targets in a sentence. Although existing approaches based on neural network have achieved good performance in this task, we find that many approaches tend to give the same predictions for instances that have multiple targets, and this tendency can make a low accuracy for those instances that have different classes for different targets. Based on this observation, we propose MemNetAR, a memory network which can explicitly leverage the adversative relation among multiple targets in a sentence. Specifically, we add an adversative loss to the cross-entropy loss when there are adversative words between targets. The experimental results on public laptop and restaurant datasets prove that our model can improve 0.84% and 0.8% on total test dataset, and improve 2.97% and 2.68% on the dataset consisting of those instances with multiple targets but different classes by leveraging this new adversative information.

关键词： Task analysis Feature extraction Sentiment analysis Portable computers Machine learning Training Predictive models

Structured decomposition for reversible Boolean functions

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Jiang, Jiaqing Sun, Xiaoming Sun, Yuan Wu, Kewen Xia, Zhiyu CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Electronics Engineering and Computer Science Peking University Beijing China

Reversible Boolean function is a one-to-one function which maps n-bit input to n-bit output. Reversible logic synthesis has been widely studied due to its relationship with low-energy computation as well as quantum computation. In this work, we give a structured decomposition for even reversible Boolean functions (RBF). Specifically, for n ≥ 6, any even n-bit RBF can be decomposed to 7 blocks of (n − 1)-bit RBF, where 7 is a constant independent of n;and the positions of those blocks have large degree of freedom. Moreover, if the (n − 1)-bit RBFs are required to be even as well, we show for n ≥ 10, n-bit RBF can be decomposed to 10 even (n − 1)-bit RBFs. For simplicity, we say our decomposition has block depth 7 and even block depth 10. Our result improves Selinger’s work in block depth model, by reducing the constant from 9 to 7;and from 13 to 10 when the blocks are limited to be even. We emphasize that our setting is a bit different from Selinger’s. In Selinger’s constructive proof, each block is one of two specific positions and thus the decomposition has an alternating structure. We relax this restriction and allow each block to act on arbitrary (n − 1) bits. This relaxation keeps the block structure and provides more candidates when choosing positions of blocks. Copyright © 2018, The Authors. All rights reserved.

关键词： Logic gates

Locally smoothed neural networks 9

学校读者我要写书评

暂无评论

Locally smoothed neural networks

9th Asian Conference on Machine Learning, ACML 2017

作者： Pang, Liang Lan, Yanyan Xu, Jun Guo, Jiafeng Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Convolutional Neural networks (CNN) and the locally connected layer are limited in capturing the importance and relations of different local receptive fields, which are often crucial for tasks such as face verification, visual question answering, and word sequence prediction. To tackle the issue, we propose a novel locally smoothed neural network (LSNN) in this paper. The main idea is to represent the weight matrix of the locally connected layer as the product of the kernel and the smoother, where the kernel is shared over different local receptive fields, and the smoother is for determining the importance and relations of different local receptive fields. Specifically, a multi-variate Gaussian function is utilized to generate the smoother, for modeling the location relations among different local receptive fields. Furthermore, the content information can also be leveraged by setting the mean and precision of the Gaussian function according to the content. Experiments on some variant of MNIST clearly show our advantages over CNN and locally connected layer. © 2017 L. Pang†∗, Y. Lan†, J. Xu†, J. Guo† & X. Cheng†.

关键词： Convolution

Supervised discriminative sparse PCA for com-characteristic gene selection and tumor classification on multiview biological data

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Feng, Chun-Mei Xu, Yong Liu, Jin-Xing Gao, Ying-Lian Zheng, Chun-Hou Bio-Computing Research Center Harbin Institute of Technology Shenzhen518055 China Key Laboratory of Network Oriented Intelligent Computation Shenzhen518055 China School of Information Science and Engineering Qufu Normal University Rizhao276826 China Library of Qufu Normal University Qufu Normal University Rizhao276826 China School of Computer Science and Technology Anhui University Hefei230000 China

Principal component analysis (PCA) has been used to study the pathogenesis of diseases. To enhance the interpretability of classical PCA, various improved PCA methods have been proposed to date. Among these, a typical method is the so-called sparse PCA, which focuses on seeking sparse loadings. However, the performance of these methods is still far from satisfactory due to their limitation of using unsupervised learning methods;moreover, the class ambiguity within the sample is high. To overcome this problem, this paper developed a new PCA method, which is named the supervised discriminative sparse PCA (SDSPCA). The main innovation of this method is the incorporation of discriminative information and sparsity into the PCA model. Specifically, in contrast to the traditional sparse PCA, which imposes sparsity on the loadings, here, sparse components are obtained to represent the data. Furthermore, via the linear transformation, the sparse components approximate the given label information. On the one hand, sparse components improve interpretability over the traditional PCA, while on the other hand, they are have discriminative abilities suitable for classification purposes. A simple algorithm is developed, and its convergence proof is provided. SDSPCA has been applied to the common-characteristic gene selection and tumor classification on multiview biological data. The sparsity and classification performance of SDSPCA are empirically verified via abundant, reasonable, and effective experiments, and the obtained results demonstrate that SDSPCA outperforms other state-of-the-art methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Principal component analysis

Modeling Diverse Relevance Patterns in Ad-hoc Retrieval

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Fan, Yixing Guo, Jiafeng Lan, Yanyan Xu, Jun Zhai, Chengxiang Cheng, Xueqi University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Department of Computer Science University of Illinois at Urbana-Champaign IL United States

Assessing relevance between a query and a document is challenging in ad-hoc retrieval due to its diverse patterns, i.e., a document could be relevant to a query as a whole or partially as long as it provides sufficient information for users’ need. Such diverse relevance patterns require an ideal retrieval model to be able to assess relevance in the right granularity adaptively. Unfortunately, most existing retrieval models compute relevance at a single granularity, either document-wide or passage-level, or use fixed combination strategy, restricting their ability in capturing diverse relevance patterns. In this work, we propose a data-driven method to allow relevance signals at different granularities to compete with each other for final relevance assessment. Specifically, we propose a HIerarchical Neural maTching model (HiNT) which consists of two stacked components, namely local matching layer and global decision layer. The local matching layer focuses on producing a set of local relevance signals by modeling the semantic matching between a query and each passage of a document. The global decision layer accumulates local signals into different granularities and allows them to compete with each other to decide the final relevance score. Experimental results demonstrate that our HiNT model outperforms existing state-of-the-art retrieval models significantly on benchmark ad-hoc retrieval datasets. Copyright © 2018, The Authors. All rights reserved.

关键词： Semantics

A fine-grained perspective on the robustness of global cargo ship transportation networks

学校读者我要写书评

暂无评论

Journal of Geographical sciences 2018年第7期28卷 881-899页

作者：彭澎程诗奋陈金海廖梦迪吴琳刘希亮陆锋 State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research CAS University of Chinese Academy of Sciences Navigation Aids Technology Research Center of Jimei University National & Local Joint Engineering Research Center for Marine Navigation Aids Services College of Geomatics Shandong University of Science and Technology Institute of Computing Technology CAS Fujian Collaborative Innovation Center for Big Data Applications in Governments Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application

The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current research mainly focuses on the coarse-grained, holistic cargo ship transportation network while ignoring the structural diversity of different sub-networks. In this paper, we evaluate the robustness of the global cargo ship transportation network based on the most recent Automatic Identification System（AIS） data available. First, we subdivide three typical cargo ship transportation networks（i.e., oil tanker, container ship and bulk carrier） from the original cargo ship transportation network. Then, we design statistical indices based on complex network theory and employ four attack strategies, including random attack and three intentional attacks（i.e., degree-based attack, betweenness-based attack and flux-based attack） to evaluate the robustness of the three typical cargo ship transportation networks. Finally, we compare the integrity of the remaining ports of the network when a small proportion of ports lose their function. The results show that 1） compared with the holistic cargo ship transportation network, the fine-grain-based cargo ship transportation networks can fully reflect the pattern and process of global cargo transportation; 2） different cargo ship networks behave heterogeneously in terms of their robustness, with the container network being the weakest and the bulk carrier network being the strongest; and 3） small-scale intentional attacks may have significant influence on the integrity of the container network but a minor impact on the bulk carrier and oil tanker transportation networks. These conclusions can help improve the decision support capabilities in maritime transportation planning and emergency response and facilitate the establishment of a more reliable maritime transportation ***： The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current resear

关键词： complex network fine-grained cargo ship transportation network robustness automatic identification system

Identification of Cognitive Dysfunction in Patients with T2DM Using Whole Brain Functional Connectivity

学校读者我要写书评

暂无评论

Genomics, Proteomics & Bioinformatics 2019年第4期17卷 441-452页

作者： Zhenyu Liu Jiangang Liu Huijuan Yuan Taiyuan Liu Xingwei Cui Zhenchao Tang Yang Du Meiyun Wang Yusong Lin Jie Tian CAS Key Laboratory of Molecular Imaging Institute of AutomationChinese Academy of SciencesBeijing 100190China School of Computer and Information Technology Beijing Jiaotong UniversityBeijing 100044China Department of Endocrinology and Metabolism Henan Provincial People’s Hospital&the People’s Hospital of Zhengzhou UniversityZhengzhou 450003China Department of Radiology Henan Provincial People’s Hospital&the People’s Hospital of Zhengzhou UniversityZhengzhou 450003China Cooperative Innovation Center for Internet Healthcare&School of Software Zhengzhou UniversityZhengzhou 450003China School of Mechanical Electrical&Information EngineeringShandong University(Weihai)Weihai 264209China University of Chinese Academy of Sciences Beijing 100080China Beijing Advanced Innovation Center for Big Data-Based Precision Medicine School of MedicineBeihang UniversityBeijing 100191China Engineering Research Center of Molecular and Neuro Imaging of Ministry of Education School of Life Science and TechnologyXidian UniversityXi’an 710126China

Majority of type 2 diabetes mellitus(T2DM)patients are highly susceptible to several forms of cognitive impairments,particularly ***,the underlying neural mechanism of these cognitive impairments remains *** aimed to investigate the correlation between whole brain resting state functional connections(RSFCs)and the cognitive status in 95 patients with *** constructed an elastic net model to estimate the Montreal Cognitive Assessment(MoCA)scores,which served as an index of the cognitive status of the patients,and to select the RSFCs for further ***,we utilized a machine learning technique to evaluate the discriminative ability of the connectivity pattern associated with the selected *** estimated and chronological MoCA scores were significantly correlated with R=0.81 and the mean absolute error(MAE)=***,cognitive impairments of patients with T2DM can be identified using the RSFC pattern with classification accuracy of 90.54%and the area under the receiver operating characteristic(ROC)curve(AUC)of *** connectivity pattern not only included the connections between regions within the default mode network(DMN),but also the functional connectivity between the task-positive networks and the DMN,as well as those within the task-positive *** results suggest that an RSFC pattern could be regarded as a potential biomarker to identify the cognitive status of patients with T2DM.

关键词： Type 2 diabetes mellitus Resting state functional connectivity Elastic net Support vector machines MoCA