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

Prognosis for patients with cognitive motor dissociation identified by brain-computer interface (vol 143, pg 1177, 2020)

学校读者我要写书评

暂无评论

BRAIN 2020年第8期143卷 1177-1189页

作者： Pan, Jiahui Xie, Qiuyou Qin, Pengmin Chen, Yan He, Yanbin Huang, Haiyun Wang, Fei Ni, Xiaoxiao Cichocki, Andrzej Yu, Ronghao Li, Yuanqing Center for Brain-Computer Interfaces and Brain Information Processing South China University of Technology Guangzhou China School of Software South China Normal University Guangzhou China Department of Rehabilitation Medicine Zhujiang Hospital Southern Medical University Guangzhou China Centre for Hyperbaric Oxygen and Neurorehabilitation Guangzhou General Hospital of Guangzhou Military Command Guangzhou China Centre for Studies of Psychological Applications Guangdong Key Laboratory of Mental Health and Cognitive Science School of Psychology South China Normal University Guangzhou China Centre for Hyperbaric Oxygen and Neurorehabilitation Guangzhou General Hospital of Guangzhou Military Command Guangzhou China Centre for Hyperbaric Oxygen and Neurorehabilitation Guangzhou General Hospital of Guangzhou Military Command Guangzhou China Department of Traumatic Brain Injury Rehabilitation and Severe Rehabilitation Guangdong Work Injury Rehabilitation Hospital Guangzhou China Center for Brain-Computer Interfaces and Brain Information Processing South China University of Technology Guangzhou China Center for Brain-Computer Interfaces and Brain Information Processing South China University of Technology Guangzhou China School of Software South China Normal University Guangzhou China Centre for Hyperbaric Oxygen and Neurorehabilitation Guangzhou General Hospital of Guangzhou Military Command Guangzhou China Skolkovo Institute of Science and Technology (Skoltech) Moscow 143026 Russia Nicolaus Copernicus University (UMK) Torun 87-100 Poland Centre for Hyperbaric Oxygen and Neurorehabilitation Guangzhou General Hospital of Guangzhou Military Command Guangzhou China Center for Brain-Computer Interfaces and Brain Information Processing South China University of Technology Guangzhou China Correspondence to: Yuanqing Li PhD Center for Brain-Computer Interfaces and Brain Information Processing South China University of Technology Guangzhou 510640 China E-mail: auyqli@scut.edu.c

Cognitive motor dissociation describes a subset of patients with disorders of consciousness who show neuroimaging evidence of consciousness but no detectable command-following behaviours. Although essential for family counselling, decision-making, and the design of rehabilitation programmes, the prognosis for patients with cognitive motor dissociation remains under-investigated. The current study included 78 patients with disorders of consciousness who showed no detectable command-following behaviours. These patients included 45 patients with unresponsive wakefulness syndrome and 33 patients in a minimally conscious state, as diagnosed using the Coma Recovery Scale-Revised. Each patient underwent an EEG-based brain-computer interface experiment, in which he or she was instructed to perform an item-selection task (i.e. select a photograph or a number from two candidates). Patients who achieved statistically significant brain-computer interface accuracies were identified as cognitive motor dissociation. Two evaluations using the Coma Recovery Scale-Revised, one before the experiment and the other 3 months later, were carried out to measure the patients’ behavioural improvements. Among the 78 patients with disorders of consciousness, our results showed that within the unresponsive wakefulness syndrome patient group, 15 of 18 patients with cognitive motor dissociation (83.33%) regained consciousness, while only five of the other 27 unresponsive wakefulness syndrome patients without significant brain-computer interface accuracies (18.52%) regained consciousness. Furthermore, within the minimally conscious state patient group, 14 of 16 patients with cognitive motor dissociation (87.5%) showed improvements in their Coma Recovery Scale-Revised scores, whereas only four of the other 17 minimally conscious state patients without significant brain-computer interface accuracies (23.53%) had improved Coma Recovery Scale-Revised scores. Our results suggest that patients with cogn

关键词： cognitive motor dissociation brain-computer interface disorders of consciousness prognosis unresponsive wakefulness syndrome

On the Robustness of Median Sampling in Noisy Evolutionary Optimization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Bian, Chao Qian, Chao Yu, Yang Tang, Ke State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Shenzhen Key Laboratory of Computational Intelligence Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

Evolutionary algorithms (EAs) are a sort of nature-inspired metaheuristics, which have wide applications in various practical optimization problems. In these problems, objective evaluations are usually inaccurate, because noise is almost inevitable in real world, and it is a crucial issue to weaken the negative effect caused by noise. Sampling is a popular strategy, which evaluates the objective a couple of times, and employs the mean of these evaluation results as an estimate of the objective value. In this work, we introduce a novel sampling method, median sampling, into EAs, and illustrate its properties and usefulness theoretically by solving OneMax, the problem of maximizing the number of 1s in a bit string. Instead of the mean, median sampling employs the median of the evaluation results as an estimate. Through rigorous theoretical analysis on OneMax under the commonly used onebit noise, we show that median sampling reduces the expected runtime exponentially. Next, through two special noise models, we show that when the 2-quantile of the noisy fitness increases with the true fitness, median sampling can be better than mean sampling;otherwise, it may fail and mean sampling can be better. The results may guide us to employ median sampling properly in practical applications. Copyright © 2019, The Authors. All rights reserved.

关键词： Computational complexity

Running Time Analysis of the (1+1)-EA for Robust Linear Optimization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Bian, Chao Qian, Chao Tang, Ke Yu, Yang State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Shenzhen Key Laboratory of Computational Intelligence Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

Evolutionary algorithms (EAs) have found many successful real-world applications, where the optimization problems are often subject to a wide range of uncertainties. To understand the practical behaviors of EAs theoretically, there are a series of efforts devoted to analyzing the running time of EAs for optimization under uncertainties. Existing studies mainly focus on noisy and dynamic optimization, while another common type of uncertain optimization, i.e., robust optimization, has been rarely touched. In this paper, we analyze the expected running time of the (1+1)-EA solving robust linear optimization problems (i.e., linear problems under robust scenarios) with a cardinality constraint k. Two common robust scenarios, i.e., deletion-robust and worst-case, are considered. Particularly, we derive tight ranges of the robust parameter d or budget k allowing the (1+1)-EA to find an optimal solution in polynomial running time, which disclose the potential of EAs for robust optimization. Copyright © 2019, The Authors. All rights reserved.

关键词： Budget control

Hyperspectral Image Classification-Traditional to Deep Models: A Survey for Future Prospects

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ahmad, Muhammad Shabbir, Sidrah Roy, Swalpa Kumar Hong, Danfeng Wu, Xin Yao, Jing Khan, Adil Mehmood Mazzara, Manuel Distefano, Salvatore Chanussot, Jocelyn Department of Computer Science National University of Computer and Emerging Sciences Islamabad Chiniot-Faisalabad Campus Chiniot35400 Pakistan Dipartimento di Matematica e Informatica-MIFT University of Messina Messina98121 Italy Pakistan The Department of Computer Science and Engineering Jalpaiguri Government Engineering College West Bengal 735102 India The Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China The School of Information and Electronics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory of Fractional Signals and Systems Beijing100081 China The Institute of Data Science and Artificial Intelligence Innopolis University Innopolis 420500 Russia Institute of Software Development and Engineering Innopolis University Innopolis420500 Russia The Univ. Grenoble Alpes CNRS Grenoble INP GIPSA-Lab Grenoble38000 France

Hyperspectral Imaging (HSI) has been extensively utilized in many real-life applications because it benefits from the detailed spectral information contained in each pixel. Notably, the complex characteristics i.e., the nonlinear relation among the captured spectral information and the corresponding object of HSI data make accurate classification challenging for traditional methods. In the last few years, Deep Learning (DL) has been substantiated as a powerful feature extractor that effectively addresses the nonlinear problems that appeared in a number of computer vision tasks. This prompts the deployment of DL for HSI classification (HSIC) which revealed good performance. This survey enlists a systematic overview of DL for HSIC and compared state-of-the-art strategies of the said topic. Primarily, we will encapsulate the main challenges of traditional machine learning for HSIC and then we will acquaint the superiority of DL to address these problems. This survey breakdown the state-of-the-art DL frameworks into spectral-features, spatial-features, and together spatial-spectral features to systematically analyze the achievements (future research directions as well) of these frameworks for HSIC. Moreover, we will consider the fact that DL requires a large number of labeled training examples whereas acquiring such a number for HSIC is challenging in terms of time and cost. Therefore, this survey discusses some strategies to improve the generalization performance of DL strategies which can provide some future guidelines. © 2021, CC BY.

关键词： Surveys

Using CNN to Predict the Resolution Status of Bug Reports

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2021年第1期1828卷

作者： Muhammad Ali Arshad Huang Zhiqiu Department of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 211106 China Key Laboratory of Safety-Critical Software NUAA Ministry of Industry and Information Technology Nanjing 211106 China

Bug tracking systems (BTS) are a resource for receiving bug reports that help to improve software applications. They usually contain reports reported by the end-users or developers. Bug Reports contain some suggestions, complaints, etc. The problem is that every submitted bug report is not accepted to implement. Mostly bug reports are rejected because they are incomplete, duplicate, expired, etc. while only a few are accepted to implement. But the developers have to check every bug report manually that needs many resources (i.e. labour, money, time). In this study, we proposed a convolutional neural network (CNN) based approach to automatically classify bug reports as accepted and rejected. Results show that the proposed approach achieves the highest performance as compared to closely related works.

关键词：

A Lexicographic Bi-objective Scheduling Problem From Steel Production Systems

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2020年第5期53卷 158-163页

作者： Ziyan Zhao MengChu Zhou Shixin Liu Xiwang Guo Haoyue Liu State Key Laboratory of Synthetical Automation for Process Industries College of Information Science and Engineering Northeastern University Shenyang 110819 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 USA College of Computer and Communication Engineering Liaoning Shihua University Fushun 113001 China

Wire rod and bar rolling is an essential process in a steel production system (SPS). This work considers a lexicographic bi-objective scheduling problem originated from it. As a medium process in SPS, both the impacts of its upstream process, i.e., release time constraints, and the requirements of its downstream process, i.e., due time constraints, on SPS performance, must be considered. The concerned problem aims to minimize the number of tardy tasks as a main objective and total setup time as a secondary one. It is solved via a two-stage method. The first-stage problem is handled with an off-the-shelf optimization software, and the second one with iterated greedy algorithms (IGAs). We compare the performance of IGAs under different strategies and select the best one to solve it. By comparing the experimental results an exact single-objective method’s, this paper shows that the proposed method can solve the problem fast with excellent results in terms of the number of tardy tasks and setup time, i.e., the secondary objective, on average. Its usage can result in significant performance improvement in steel production over the existing practice.

关键词： Batch process batch scheduling iterated greedy algorithm lexicographic bi-objective optimization steel production systems

Portable Acceleration of CMS Computing Workflows with Coprocessors as a Service

学校读者我要写书评

暂无评论

Computing and software for Big science 2024年第1期8卷 1-36页

作者： Hayrapetyan, A. Tumasyan, A. Adam, W. Andrejkovic, J.W. Bergauer, T. Chatterjee, S. Damanakis, K. Dragicevic, M. Hussain, P.S. Jeitler, M. Krammer, N. Li, A. Liko, D. Mikulec, I. Schieck, J. Schöfbeck, R. Schwarz, D. Sonawane, M. Templ, S. Waltenberger, W. Wulz, C.-E. Darwish, M.R. Janssen, T. Mechelen, P. Van Bols, E.S. D’Hondt, J. Dansana, S. De Moor, A. Delcourt, M. Faham, H. El Lowette, S. Makarenko, I. Müller, D. Sahasransu, A.R. Tavernier, S. Tytgat, M. Onsem, G. P. Van Putte, S. Van Vannerom, D. Clerbaux, B. Das, A.K. De Lentdecker, G. Favart, L. Gianneios, P. Hohov, D. Jaramillo, J. Khalilzadeh, A. Khan, F.A. Lee, K. Mahdavikhorrami, M. Malara, A. Paredes, S. Thomas, L. Bemden, M. Vanden Velde, C. Vander Vanlaer, P. De Coen, M. Dobur, D. Hong, Y. Knolle, J. Lambrecht, L. Mestdach, G. Amarilo, K. Mota Rendón, C. Samalan, A. Skovpen, K. Bossche, N. Van Den Linden, J. van der Wezenbeek, L. Benecke, A. Bethani, A. Bruno, G. Caputo, C. Delaere, C. Donertas, I.S. Giammanco, A. Jaffel, K. Jain, Sh. Lemaitre, V. Lidrych, J. Mastrapasqua, P. Mondal, K. Tran, T.T. Wertz, S. Alves, G.A. Coelho, E. Hensel, C. De Oliveira, T. Menezes Moraes, A. Teles, P. Rebello Soeiro, M. Júnior, W. L. Aldá Pereira, M. Alves Gallo Filho, M. Barroso Ferreira Malbouisson, H. Brandao Carvalho, W. Chinellato, J. Da Costa, E.M. Da Silveira, G.G. De Jesus Damiao, D. De Souza, S. Fonseca De Souza, R. Gomes Martins, J. Herrera, C. Mora Mundim, L. Nogima, H. Pinheiro, J.P. Santoro, A. Sznajder, A. Thiel, M. Pereira, A. Vilela Bernardes, C.A. Calligaris, L. Tomei, T. R. Fernandez Perez Gregores, E.M. Mercadante, P.G. Novaes, S.F. Orzari, B. Padula, Sandra S. Aleksandrov, A. Antchev, G. Hadjiiska, R. Iaydjiev, P. Misheva, M. Shopova, M. Sultanov, G. Dimitrov, A. Litov, L. Pavlov, B. Petkov, P. Petrov, A. Shumka, E. Keshri, S. Thakur, S. Cheng, T. Javaid, T. Yuan, L. Hu, Z. Liu, J. Yi, K. Chen, G.M. Chen, H.S. Chen, M. Iemmi, F. Jiang, C.H. Kapoor, A. Liao, H. Liu, Z.-A. Sharma, R. Song, J.N. Tao, J. Wang, C. Wang, J. Wang, Z. Zhang, H. Agapitos Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium Ghent University Ghent Belgium Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual Paulista Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria Instituto De Alta Investigación Universidad de Tarapacá Casilla 7 D Arica Chile Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Sun Yat-sen University Guangzhou China University of Science and Technology of China Hefei China Nanjing Normal University Nanjing China Institute of Modern Physics and Key Laboratory of Nuclear Physics and Ion-beam Application (MOE) - Fudan University Shanghai China Zhejiang University Hangzhou Zhejiang China Universidad de Los Andes Bogota Colombia Universidad de Antioquia Medellin Colombia University of Split Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture Split Croatia Faculty of Science University of Split Split Croatia Institute Rudjer Boskovic Zagreb Croatia University of Cyprus Nicosia Cyprus Charles University Prague Czech Republic Escuela Politecnica Nacional Quito Ecuador Universidad San Francisco de Quito Quito Ecuador Academy of Scientific Research and Technology of the Arab Republic of Egypt Egyptian Network of High Energy Physics Cairo Egypt Center for High Energy Physics (CHEP-FU) Fayoum University El-Fayoum Egypt National Institute of Chemical Physics and Biophysic

Computing demands for large scientific experiments, such as the CMS experiment at the CERN LHC, will increase dramatically in the next decades. To complement the future performance increases of software running on central processing units (CPUs), explorations of coprocessor usage in data processing hold great potential and interest. Coprocessors are a class of computer processors that supplement CPUs, often improving the execution of certain functions due to architectural design choices. We explore the approach of Services for Optimized Network Inference on Coprocessors (SONIC) and study the deployment of this as-a-service approach in large-scale data processing. In the studies, we take a data processing workflow of the CMS experiment and run the main workflow on CPUs, while offloading several machine learning (ML) inference tasks onto either remote or local coprocessors, specifically graphics processing units (GPUs). With experiments performed at Google Cloud, the Purdue Tier-2 computing center, and combinations of the two, we demonstrate the acceleration of these ML algorithms individually on coprocessors and the corresponding throughput improvement for the entire workflow. This approach can be easily generalized to different types of coprocessors and deployed on local CPUs without decreasing the throughput performance. We emphasize that the SONIC approach enables high coprocessor usage and enables the portability to run workflows on different types of coprocessors. © The Author(s) 2024.

关键词： CMS Machine learning Offline and computing

Neural Entity Summarization with Joint Encoding and Weak Supervision

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Li, Junyou Cheng, Gong Liu, Qingxia Zhang, Wen Kharlamov, Evgeny Gunaratna, Kalpa Chen, Huajun National Key Laboratory for Novel Software Technology Nanjing University China College of Computer Science and Technology Zhejiang University China Bosch Center for Artificial Intelligence Robert Bosch GmbH Germany Department of Informatics University of Oslo Norway Samsung Research America Mountain ViewCA United States

In a large-scale knowledge graph (KG), an entity is often described by a large number of triple-structured facts. Many applications require abridged versions of entity descriptions, called entity summaries. Existing solutions to entity summarization are mainly unsupervised. In this paper, we present a supervised approach NEST that is based on our novel neural model to jointly encode graph structure and text in KGs and generate high-quality diversified summaries. Since it is costly to obtain manually labeled summaries for training, our supervision is weak as we train with programmatically labeled data which may contain noise but is free of manual work. Evaluation results show that our approach significantly outperforms the state of the art on two public benchmarks. Copyright © 2020, The Authors. All rights reserved.

关键词： Knowledge graph

Adversarial directed graph embedding

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhu, Shijie Li, Jianxin Peng, Hao Wang, Senzhang He, Lifang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Beihang University Beijing100191 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China Department of Computer Science and Engineering Lehigh University BethlehemPA United States

Node representation learning for directed graphs is critically important to facilitate many graph mining tasks. To capture the directed edges between nodes, existing methods mostly learn two embedding vectors for each node, source vector and target vector. However, these methods learn the source and target vectors separately. For the node with very low indegree or outdegree, the corresponding target vector or source vector cannot be effectively learned. In this paper, we propose a novel Directed Graph embedding framework based on Generative Adversarial Network, called DGGAN. The main idea is to use adversarial mechanisms to deploy a discriminator and two generators that jointly learn each node's source and target vectors. For a given node, the two generators are trained to generate its fake target and source neighbor nodes from the same underlying distribution, and the discriminator aims to distinguish whether a neighbor node is real or fake. The two generators are formulated into a unified framework and could mutually reinforce each other to learn more robust source and target vectors. Extensive experiments show that DGGAN consistently and significantly outperforms existing state-of-the-art methods across multiple graph mining tasks on directed graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Directed graphs