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

arXiv 2020年

作者： Zhang, Haoyu Jin, Yaochu Cheng, Ran Hao, Kuangrong Engineering Research Center of Digitized Textile and Apparel Technology Ministry of Education College of Information Science and Technology Donghua University Shanghai201620 China Department of Computer Science University of Surrey Guildford SurreyGU2 7XH United Kingdom Shenzhen Key Laboratory of Computational Intelligence University Key Laboratory of Evolving Intelligent Systems of Guangdong Province Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

The performance of a deep neural network is heavily dependent on its architecture and various neural architecture search strategies have been developed for automated network architecture design. Recently, evolutionary neural architecture search (ENAS) has received increasing attention due to the attractive global optimization capability of evolutionary algorithms. However, ENAS suffers from extremely high computation costs because a large number of performance evaluations is usually required in evolutionary optimization and training deep neural networks is itself computationally very intensive. To address this issue, this paper proposes a new evolutionary framework for fast ENAS based on directed acyclic graph, in which parents are randomly sampled and trained on each mini-batch of training data. In addition, a node inheritance strategy is adopted to generate offspring individuals and their fitness is directly evaluated without training. To enhance the feature processing capability of the evolved neural networks, we also encode a channel attention mechanism in the search space. We evaluate the proposed algorithm on the widely used datasets, in comparison with 26 state-of-the-art peer algorithms. Our experimental results show the proposed algorithm is not only computationally much more efficiently, but also highly competitive in learning performance. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Profi-load: An FPGA-based solution for generating network load in profinet communication

arXiv

引用

arXiv 2019年

作者： Khaliq, Ahmad Saha, Sangeet Bhatt, Bina Gu, Dongbing McDonald-Maier, Klaus Embedded and Intelligent Systems Laboratory Computer Science and Electronic Engineering Department University of Essex Colchester United Kingdom

Industrial automation has received a considerable attention in the last few years with the rise of Internet of Things (IoT). Specifically, industrial communication network technology such as Profinet has proved to be a major game changer for such automation. However, industrial automation devices often have to exhibit robustness to dynamically changing network conditions and thus, demand a rigorous testing environment to avoid any safety-critical failures. Hence, in this paper, we have proposed an FPGA-based novel framework called "Profi-Load" to generate Profinet traffic with specific intensities for a specified duration of time. The proposed Profi-Load intends to facilitate the performance testing of the industrial automated devices under various network conditions. By using the advantage of inherent hardware parallelism and re-configurable features of FPGA, Profi-Load is able to generate Profinet traffic efficiently. Moreover, it can be reconfigured on the fly as per the specific requirements. We have developed our proposed Profi-Load framework by employing the Xilinx-based "NetJury" device which belongs to Zynq-7000 FPGA family. A series of experiments have been conducted to evaluate the effectiveness of Profi-Load and it has been observed that Profi-Load is able to generate precise load at a constant rate for stringent timing requirements. Furthermore, a suitable Human Machine Interface (HMI) has also been developed for quick access to our framework. The HMI at the client side can directly communicate with the NetJury device and parameters such as, required load amount, number of packet(s) to be sent or desired time duration can be selected using the HMI. Copyright © 2019, The Authors. All rights reserved.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

GardnerNet: An Interpretable Deep Learning Model for Quantitative Human Blastocyst Evaluation - A Retrospective Model Development and Validation Study

SSRN

引用

SSRN 2024年

作者： Liu, Hang Chen, Longbin Shan, Guanqiao Sun, Chen Liao, Hongqing Lu, Changfu Zhang, Shuoping Dong, Shaonan Xu, Xinxin Yan, Qiuyun Gong, Fei Zhang, Zhuoran Dai, Changsheng Chen, Wenyuan Song, Haocong Chen, Lei Sun, Haixiang Wang, Shanshan Lin, Ge Sun, Yu Gu, Yifan Department of Mechanical and Industrial Engineering University of Toronto 5 King’s College Road TorontoONM5S 3G8 Canada Institute of Reproductive and Stem Cell Engineering School of Basic Medical Science Central South University 172 Tongzipo Road Hunan Province Changsha China Hengyang Nanhua-Xinghui Reproductive Health Hospital 30 Jiefang Road Hunan Province Hengyang China The second Affiliated Hospital Hengyang Medical School University of South China 30 Jiefang Road Hunan Province Hengyang City China Reproductive & Genetic Hospital of CITIC-Xiangya 567 Tongzipo Road Hunan Province Changsha China NHC Key Laboratory of Human Stem Cell and Reproductive Engineering School of Basic Medical Science Central South University 172 Tongzipo Road Hunan Province Changsha China Clinical Research Center for Reproduction and Genetics in Hunan Province Reproductive & Genetic Hospital of CITIC-Xiangya 567 Tongzipo Road Hunan Province Changsha China School of Science and Engineering The Chinese University of Hong Kong-Shenzhen 2001 Longxiang Boulevard Longgang District Shenzhen China Institute of Robotics and Intelligent Systems Dalian University of Technolgy 2 Linggong Road Liaoning Province Dalian China Department of Computer Science University of Toronto 40 St George Street TorontoONM5S 2E4 Canada Center for Reproductive Medicine and Obstetrics and Gynecology Nanjing Drum Tower Hospital Nanjing University Medical School 321 Zhongshan Road Jiangsu Province Nanjing China National Engineering and Research Center of Human Stem Cell 8 Luyun Road Jiangsu Province Changsha China Department of Electrical and Computer Engineering 10 King’s College Road TorontoONM5S 3G8 Canada Institute of Biomedical Engineering University of Toronto 164 College Street TorontoONM5S 3G9 Canada

Background: Selecting the blastocyst with the highest potential for live birth from a cohort is crucial for the success of in vitro fertilization (IVF). While the Gardner and Schoolcraft morphological grading system, commonly known as the Gardner grading system, is widely used by embryologists worldwide, blastocysts having similar or the same inner cell mass (ICM) and trophectoderm (TE) grades cause challenges for embryologists in decision-making. Furthermore, human assessment is subjective and inconsistent in predicting which blastocysts have higher potential to result in live birth. This study aims to develop an interpretable, quantitative method aligned with the Gardner grading system, providing continuous scores that correlate with live birth outcomes, thereby assisting embryologists in improving blastocyst selection. Methods: In this retrospective study, we developed GardnerNet, an interpretable deep learning model that outputs expansion degree grade and continuous scores quantifying a blastocyst's ICM morphology and TE morphology, based on the Gardner grading system. The continuous ICM and TE scores were calculated by weighting each base grade's predicted probability and summing the predicted probabilities. To represent each blastocyst's overall potential for live birth, we combined the ICM and TE scores using their odds ratios (ORs) for live birth. We further assessed the correlation between the ICM score, TE score, and the OR-combined score (adjusted for expansion degree) with live birth rates by applying GardnerNet to blastocysts with known live birth outcomes. To test its generalizability, we also applied GardnerNet to an external IVF institution, accounting for variations in imaging conditions, live birth rates, and embryologists' experience levels. Findings: GardnerNet was developed using data from 2760 blastocysts with majority-voted grades for expansion degree, ICM, and TE. The model achieved mean area under the receiver operating characteristic curve

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Generating adjacency-constrained subgoals in hierarchical reinforcement learning

arXiv

引用

arXiv 2020年

作者： Zhang, Tianren Guo, Shangqi Tan, Tian Hu, Xiaolin Chen, Feng Department of Automation Tsinghua University China Department of Civil and Environmental Engineering Stanford University United States Department of Computer Science and Technology Tsinghua University China Beijing National Research Center for Information Science and Technology China State Key Laboratory of Intelligent Technology and Systems Beijing Innovation Center for Future Chip China LSBDPA Beijing Key Laboratory China

Goal-conditioned hierarchical reinforcement learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is often large. Searching in a large goal space poses difficulties for both high-level subgoal generation and low-level policy learning. In this paper, we show that this problem can be effectively alleviated by restricting the high-level action space from the whole goal space to a k-step adjacent region of the current state using an adjacency constraint. We theoretically prove that the proposed adjacency constraint preserves the optimal hierarchical policy in deterministic MDPs, and show that this constraint can be practically implemented by training an adjacency network that can discriminate between adjacent and non-adjacent subgoals. Experimental results on discrete and continuous control tasks show that incorporating the adjacency constraint improves the performance of state-of-the-art HRL approaches in both deterministic and stochastic environments.1 Copyright © 2020, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

A Model to Measure the Spread Power of Rumors

arXiv

引用

arXiv 2020年

作者： Jahanbakhsh-Nagadeh, Zoleikha Feizi-Derakhshi, Mohammad-Reza Ramezani, Majid Akan, Taymaz Asgari-Chenaghlu, Meysam Nikzad–Khasmakhi, Narjes Feizi-Derakhshi, Ali-Reza Ranjbar-Khadivi, Mehrdad Zafarani-Moattar, Elnaz Balafar, Mohammad-Ali Computerized Intelligence Systems Laboratory Department of Computer Engineering University of Tabriz Tabriz Iran Department of Computer Engineering Naghadeh Branch Islamic Azad University Naghadeh Iran Department of Computer Science and Research Branch Islamic Azad University Tehran Iran Department of Software Engineering Istanbul Topkapi University Istanbul Turkey Clinical Informatics Louisiana State University Health Sciences Center Shreveport Shreveport United States Department of Computer Engineering Shabestar Branch Islamic Azad University Shabestar Iran Department of Computer Engineering Tabriz Branch Islamic Azad University Tabriz Iran Department of Computer Engineering University of Tabriz Iran

With technologies that have democratized the production and reproduction of information, a significant portion of daily interacted posts in social media has been infected by rumors. Despite the extensive research on rumor detection and verification, so far, the problem of calculating the spread power of rumors has not been considered. To address this research gap, the present study seeks a model to calculate the Spread Power of Rumor (SPR) as the function of content-based features in two categories: False Rumor (FR) and True Rumor (TR). For this purpose, the theory of Allport and Postman will be adopted, which it claims that importance and ambiguity are the key variables in rumor-mongering and the power of rumor. Totally 42 content features in two categories"importance" (28 features) and"ambiguity" (14 features) are introduced to compute SPR. The proposed model is evaluated on two datasets, Twitter and Telegram. The results showed that (i) the spread power of False Rumor documents is rarely more than True Rumors. (ii) there is a significant difference between the SPR means of two groups False Rumor and True Rumor. (iii) SPR as a criterion can have a positive impact on distinguishing False Rumors and True Rumors. © 2020, CC BY.

关键词： Cell proliferation

来源：评论

学校读者我要写书评

暂无评论

A survey on neural network interpretability

arXiv

引用

arXiv 2020年

作者： Zhang, Yu Tiňo, Peter Leonardis, Aleš Tang, Ke The Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China The Research Institute of Trust-Worthy Autonomous Systems Southern University of Science and Technology Shenzhen518055 China The School of Computer Science University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom

Along with the great success of deep neural networks, there is also growing concern about their black-box nature. The interpretability issue affects people's trust on deep learning systems. It is also related to many ethical problems, e.g., algorithmic discrimination. Moreover, interpretability is a desired property for deep networks to become powerful tools in other research fields, e.g., drug discovery and genomics. In this survey, we conduct a comprehensive review of the neural network interpretability research. We first clarify the definition of interpretability as it has been used in many different contexts. Then we elaborate on the importance of interpretability and propose a novel taxonomy organized along three dimensions: type of engagement (passive vs. active interpretation approaches), the type of explanation, and the focus (from local to global interpretability). This taxonomy provides a meaningful 3D view of distribution of papers from the relevant literature as two of the dimensions are not simply categorical but allow ordinal subcategories. Finally, we summarize the existing interpretability evaluation methods and suggest possible research directions inspired by our new taxonomy. Copyright © 2020, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Constructions of maximally recoverable local reconstruction codes via function fields 46

Constructions of maximally recoverable local reconstruction ...

引用

46th International Colloquium on Automata, Languages, and Programming, ICALP 2019

作者： Guruswami, Venkatesan Jin, Lingfei Xing, Chaoping Computer Science Department Carnegie Mellon University PittsburghPA United States Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China Shanghai Institute of Intelligent Electronics and Systems Shanghai China Shanghai Bolckchain Engineering Research Center Fudan University Shanghai200433 China School of Physical and Mathematical Sciences Nanyang Technological University Singapore

ISBN: (纸本)9783959771092

Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. They have emerged as the codes of choice for large scale distributed storage systems due to the very efficient repair of failed storage nodes in the typical scenario of a single or few nodes failing, while also offering fault tolerance against worst-case scenarios with more erasures. A maximally recoverable (MR) LRC offers the best possible blend of such local and global fault tolerance, guaranteeing recovery from all erasure patterns which are information-theoretically correctable given the presence of local recovery groups. In an (n, r, h, a)-LRC, the n codeword symbols are partitioned into r disjoint groups each of which include a local parity checks capable of locally correcting a erasures. The codeword symbols further obey h heavy (global) parity checks. Such a code is maximally recoverable if it can correct all patterns of a erasures per local group plus up to h additional erasures anywhere in the codeword. This property amounts to linear independence of all such subsets of columns of the parity check matrix. MR LRCs have received much attention recently, with many explicit constructions covering different regimes of parameters. Unfortunately, all known constructions require a large field size that is exponential in h or a, and it is of interest to obtain MR LRCs of minimal possible field size. In this work, we develop an approach based on function fields to construct MR LRCs. Our method recovers, and in most parameter regimes improves, the field size of previous approaches. For instance, for the case of small r Ε log n and large h > Ω(n1−Ε), we improve the field size from roughly nh to nΕh. For the case of a = 1 (one local parity check), we improve the field size quadratically from rh(h+1) to rhb(h+1)/2c for some range of r. The improvements are modest, but more importantly are obtained in a unified manner via a pr

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Hysteresis Control of the Pseudo Boost PFC Converter

Hysteresis Control of the Pseudo Boost PFC Converter

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Aleksandra Lekić-Vervoort Milovan Majstorović Leposava Ristić Dušan Stipanović Intelligent Electrical Power Grids (IEPG) Electrical Sustainable Energy (ESE) Faculty of Electrical Engineering Mathematics and Computer Science TU Delft Delft Netherlands The Department of Power Converters and Drive Systems University of Belgrade Belgrade Serbia Coordinated Science Laboratory University of Illinois Urbana IL USA

ISBN: (数字)9781728156354

ISBN: (纸本)9781728156361

In this paper, a control design for the the Pseudo Boost PFC converter with the application in the charger for electric vehicles, is formulated and verified. The rectifier ends up being energy efficient because due to containing smaller number of switches. The converter is controlled using a method involving the minimum Lyapunov function derivative and a hysteresis. This control provides an averaged value of the converter sine input current, and thus, decreasing the THD value. Theoretical results are complemented with the corresponding simulations and experimental waveforms.

关键词： Hysteresis Switches Lyapunov methods Inductors Mathematical model Electric vehicles

来源：评论

学校读者我要写书评

暂无评论

Deep learning methods for automatic evaluation of delayed enhancement-MRI. The results of the EMIDEC challenge

arXiv

引用

arXiv 2021年

作者： Lalande, Alain Chen, Zhihao Pommier, Thibaut Decourselle, Thomas Qayyum, Abdul Salomon, Michel Ginhac, Dominique Skandarani, Youssef Boucher, Arnaud Brahim, Khawla de Bruijne, Marleen Camarasa, Robin Correia, Teresa M. Feng, Xue Girum, Kibrom B. Hennemuth, Anja Huellebrand, Markus Hussain, Raabid Ivantsits, Matthias Ma, Jun Meyer, Craig Sharma, Rishabh Shi, Jixi Tsekos, Nikolaos V. Varela, Marta Wang, Xiyue Yang, Sen Zhang, Hannu Zhang, Yichi Zhou, Yuncheng Zhuang, Xiahai Couturier, Raphael Meriaudeau, Fabrice ImViA laboratory University of Burgundy Dijon France MRI department University Hospital of Dijon Dijon France Femto-ST laboratory University of Franche-Comté Belfort France Cardiology department University Hospital of Dijon Dijon France CASIS Company Quetigny France National Engineering School of Sousse University of Sousse Sousse Tunisia LASEE laboratory National Engineering School of Monastir University of Monastir Monastir Tunisia Biomedical Imaging Group Rotterdam Erasmus MC Rotterdam Netherlands Department of Radiology and Nuclear Medicine Erasmus MC Rotterdam Netherlands Department of Computer Science University of Copenhagen Copenhagen Denmark Centre of Marine Sciences University of Algarve Faro Portugal School of Biomedical Engineering and Imaging Sciences King’s College London London United Kingdom Department of Biomedical Engineering University of Virginia Charlottesville United States Charité – Universitätsmedizin Berlin Berlin Germany Fraunhofer MEVIS Bremen Germany German Centre for Cardiovascular Research Berlin Germany Department of Mathematics Nanjing University of Science and Technology Nanjing China Data Analysis and Intelligent Systems Lab Department of Computer Science University of Houston Houston United States Medical Robotics and Imaging Lab Department of Computer Science University of Houston Houston United States National Heart and Lung Institute Imperial College London London United Kingdom College of Computer Science Sichuan University Chengdu China College of Biomedical Engineering Sichuan University Chengdu China School of Biological Science and Medical Engineering Beihang University Beijing China School of Data Science Fudan University Shanghai China

A key factor for assessing the state of the heart after myocardial infarction (MI) is to measure whether the myocardium segment is viable after reperfusion or revascularization therapy. Delayed enhancement-MRI or DE-MRI, which is performed several minutes after injection of the contrast agent, provides high contrast between viable and nonviable myocardium and is therefore a method of choice to evaluate the extent of MI. To automatically assess myocardial status, the results of the EMIDEC challenge that focused on this task are presented in this paper. The challenge’s main objectives were twofold. First, to evaluate if deep learning methods can distinguish between normal and pathological cases. Second, to automatically calculate the extent of myocardial infarction. The publicly available database consists of 150 exams divided into 50 cases with normal MRI after injection of a contrast agent and 100 cases with myocardial infarction (and then with a hyperenhanced area on DE-MRI), whatever their inclusion in the cardiac emergency department. Along with MRI, clinical characteristics are also provided. The obtained results issued from several works show that the automatic classification of an exam is a reachable task (the best method providing an accuracy of 0.92), and the automatic segmentation of the myocardium is possible. However, the segmentation of the diseased area needs to be improved, mainly due to the small size of these areas and the lack of contrast with the surrounding structures. © 2021, CC BY-NC-SA.

关键词： Cardiology

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive non-parametric kernels

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2020年第1期21卷 8590-8628页

作者： Fanghui Liu Xiaolin Huang Chen Gong Jie Yang Li Li Department of Electrical Engineering ESAT-STADIUS KU Leuven Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China and Department of Computing Hong Kong Polytechnic University Hong Kong SAR China Department of Automation BNRist Tsinghua University China

In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.

关键词： support vector machines non-parametric kernel learning gradient-Lipschitz continuous

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：