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

2023 IEEE International Symposium on Medical Measurements and Applications, MeMeA 2023

作者： Shahbakhti, Mohammad Beiramvand, Matin Krycinska, Roza Nasiri, Erfan Chen, Wei Sole-Casals, Jordi Wierzchon, Michal Broniec-Wojcik, Anna Augustyniak, Piotr Marozas, Vaidotas Biomedical Engineering Institute Kaunas University of Technology Kaunas Lithuania Tampere University Faculty of Information Technology and Communication Tempere Finland Jagiellonian University Medical College Doctoral School in Medical and Health Sciences Krakow Poland Jagiellonian University Collegium Medicum Department of Interdisciplinary Intensive Care Krakow Poland Allameh Tabataba'i University Faculty of Statistics Mathematics and Computer Tehran Iran Fudan University Center for Intelligent Medical Electronics School of Information Science and Technology Shanghai China University of Vic-Central University of Catalonia Data and Signal Processing Research Group Vic Spain Institute of Psychology Jagiellonian University Krakow Poland Agh University of Science and Technology Department of Biocybernetics and Biomedical Engineering Krakow Poland

ISBN: (纸本)9781665493840

Objective: Monitoring the depth of anesthesia (DoA) plays an important role for administering the drug injection during a surgery, i.e., preventing undesired awareness and inordinate anesthetic depth. Although the bispectral index (BIS) monitor is the golden standard system for the DoA monitoring, it is still not affordable for the developing countries. Alternatively, a low-cost electroencephalogram (EEG) headband can be used. The objective of this paper is to present a new algorithm for estimating the BIS values using a single frontal EEG channel. Method: In the first step, the EEG signal is filtered for the elimination of artifacts and is split into its sub-bands. In the second step, several linear and nonlinear features are extracted from each sub-band and fed to a random forest regression model in order to estimate the BIS. The performance of the proposed algorithm is assessed using EEG data recorded from twenty-four subjects during the general anesthesia and is validated in terms of correlation coefficient (CC) and absolute error (AE) between the reference and estimated BIS values. Results: The proposed algorithm achieved the mean CC of 0.83 and AE of 6.5 for intra subject variability and mean CC of 0.87 and AE of 5.5 for inter subject variability. Significance: Given the similar results for both intra and inter subject variability, the proposed algorithm has the potential to be used in the real-world scenario. © 2023 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A hybrid method to select morphometric features using tensor completion and F-score rank for gifted children identification

引用

science China(Technological sciences) 2021年第9期64卷 1863-1871页

作者： ZHANG Jin FENG Fan HAN TianYi DUAN Feng SUN Zhe CAIAFA Cesar F. SOLÉ-CASALS Jordi College of Computer Science Nankai UniversityTianjin 300350China Department of Artificial Intelligence Nankai UniversityTianjin 300350China Computational Engineering Applications Unit Head Office for Information Systems and CybersecurityRIKEN351-0198 SaitamaJapan Instituto Argentino de Radioastronomía-CCT La Plata CONICET/CIC-PBA/UNLP1894 V.ElisaArgentina Department of Psychiatry University of CambridgeCambridge CB20SZUnited Kingdom Data and Signal Processing Group University of Vic-Central University of Catalonia08500 VicCataloniaSpain

Gifted children are able to learn in a more advanced way than others, probably due to neurophysiological differences in the communication efficiency in neural pathways. Topological features contribute to understanding the correlation between the brain structure and intelligence. Despite decades of neuroscience research using MRI, methods based on brain region connectivity patterns are limited by MRI artifacts, which therefore leads to revisiting MRI morphometric features, with the aim of using them to directly identify gifted children instead of using brain connectivity. However, the small, high-dimensional morphometric feature dataset with outliers makes the task of finding good classification models challenging. To this end, a hybrid method is proposed that combines tensor completion and feature selection methods to handle outliers and then select the discriminative features. The proposed method can achieve a classification accuracy of 93.1%, higher than other existing algorithms, which is thus suitable for the small MRI datasets with outliers in supervised classification scenarios.

关键词： gifted children identification morphometric features tensor completion feature selection

来源：评论

学校读者我要写书评

暂无评论

A Radiation Performance Improvement Method of Extremely Low Frequency Acoustics Promoted Antenna

A Radiation Performance Improvement Method of Extremely Low ...

引用

IEEE International Workshop on Electromagnetics, Applications and Student Innovation (iWEM)

作者： Junwei Qi Chenwei Zhang Yingsong Li Zhixiang Huang Tian Hong Loh Kwok L. Chung College of Information and Communications Engineering Harbin Engineering University Harbin China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China Electromagnetic and Eletrochemical Technologies Department National Physical Laboratory Middlesex UK School of Computer Science and Engineering Huizhou University P. R. China

In this paper, Q-value theory of conventional antennas is used to analyze reasons of low radiation performance of acoustics promoted antennas, where we modify the radiating structure of existing acoustics promoting antenna using the simulations to get the required improvement on radiation performance. The simulation experiments are carried out in the finite element simulation software Comsol Multiphysics to analyze the radiating performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Effects of spatially dense adrenergic stimulation to rotor behaviour in simulated atrial sheets

引用

computers in Biology and Medicine 2024年 182卷 109195-109195页

作者： Magtibay, Karl Massé, Stéphane Nanthakumar, Kumaraswamy Umapathy, Karthikeyan Biomedical Signal and Image Processing Laboratory Department of Electrical Computer and Biomedical Engineering Faculty of Engineering and Architectural Science Toronto Metropolitan University 350 Victoria St TorontoONM5B 2K3 Canada Toby Hull Cardiac Fibrillation Management Toronto General Hospital University Health Network 200 Elizabeth Street TorontoONM5G 2C4 Canada

Sympathetic hyperactivity via spatially dense adrenergic stimulation may create pro-arrhythmic substrates even without structural remodelling. However, the effect of sympathetic hyperactivity on arrhythmic activity, such as rotors, is unknown. Using simulations, we examined the effects of gradually increasing the spatial density of adrenergic stimulation (AS) in atrial sheets on rotors. We compared their characteristics against rotors hosted in atrial sheets with increasing spatial density of minimally conductive (MC) elements to simulate structural remodelling due to injury or disease. We generated rotors using an S1-S2 stimulation protocol. Then, we created phase maps to identify phase singularities and map their trajectory over time. We measured each rotor's duration (s), angular speed (rad/s), and spatiotemporal organization. We demonstrated that atrial sheets with increased AS spatial densities could maintain rotors longer than with MC elements (2.6 ± 0.1 s vs. 1.5 ± 0.2 s, p © 2024 The Authors

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

Hfrs-Han: Health-Aware Food Recommendation System Based on the Heterogeneous Attention Network

SSRN

引用

SSRN 2023年

作者： Forouzandeh, Saman Rostami, Mehrdad Berahmand, Kamal Sheikhpour, Razieh School of Mathematics and Statistics University of New South Wales SydneyNSW Australia Centre for Machine Vision and Signal Processing Faculty of Information Technology University of Oulu Oulu Finland Department of Science and Engineering Queensland University of Technology Brisbane Australia Department of Computer Engineering Faculty of Engineering Ardakan University P.O. Box 184 Ardakan Iran

In recent years, the input of recommender systems into the fields of food and health has gained many fans, and in this regard, RSs have contributed a lot to this industry. Nevertheless, there are still many challenges related to their use in food and health, and some solutions are discussed in this research. In this way, heterogeneous information networks (HIN) have different entities, and the connections between nodes are based on the definition of a meta-path. It is essential for a HIN to learn the meta-path to find the paths that have more meaningful semantic information. Accordingly, graph neural networks (GNNs) have outstanding performance in learning graph embedding as an effective graph representation technique. One of the main challenges is finding neighborhood links between entities in HIN;the connections between nodes have different values, and many meaningful relationships are hidden and must be discovered from other relations. Thus, considering that there are multiple entities in HIN and various connections, this study focuses on learning the importance of the paths between nodes and recommending foods to users. In this research, a health-aware food recommendation system based on the heterogeneous attention network (HFRS-HAN) is presented, which can recommend some foods to users that are both popular and healthy. We use the attention method in the two levels to discover important nodes and edges in a heterogeneous graph. The proposed model can provide node embedding by aggregating feature-based neighbors from the meta-path in a hierarchical manner. This study has been done on the Allrecipes dataset, and the data has been collected through crawling. Ultimately, comparing this research’s results with the previous methods indicates the high efficiency of our proposed method. © 2023, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Acoustic echo suppression using speech uncertainty in modulation domain

TechRxiv

引用

TechRxiv 2021年

作者： Shifas, Muhammed P.V. Jayakumar, E.P. Sathidevi, P.S. The Speech Signal Processing Laboratory Department of Computer Science University of Crete Greece Department of Electronics and Communication Engineering National Institute of Technology Calicut Kerala Kozhikode India

Quality degradation of near-end speech in mobile communication or hands free devices is mainly due to acoustic echoes and background noises. The received far-end speech gets reflected from the obstacles present in the surroundings creating acoustic echo. All other disturbances from the near-end environment are considered as background noises. A novel acoustic echo suppression scheme using speech uncertainty in modulation domain (MD) is proposed in this paper. State of the art acoustic echo suppression systems are based on either time domain or frequency domain analysis. In recent times, the modulation domain analysis is popularly used in speech processing, as it captures the human perceptual properties. Modulation domain provides the temporal variation of the acoustic magnitude spectra which acts as an information bearing signal. In this paper, a new method is developed and implemented to model the echo path and estimate the echo in modulation domain. Echo cancellation is done effectively by manipulating the modulation spectrum and employing speech uncertainty. In this method, the microphone input is modelled as a binary hypothesis process and the gain function is modified accordingly. The proposed method shows better performance as compared to other competitive methods for acoustic echo suppression with no audible degradation in the near-end speech. © 2021, CC BY.

关键词： Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

Software in the natural world: A computational approach to hierarchical emergence

arXiv

引用

arXiv 2024年

作者： Rosas, Fernando E. Geiger, Bernhard C. Luppi, Andrea I. Seth, Anil K. Polani, Daniel Gastpar, Michael Mediano, Pedro A.M. Department of Informatics University of Sussex United Kingdom Sussex Centre for Consciousness Science and Sussex AI University of Sussex United Kingdom Center for Psychedelic Research and Centre for Complexity Science Department of Brain Science Imperial College London United Kingdom Center for Eudaimonia and Human Flourishing University of Oxford United Kingdom Know-Center GmbH Graz Austria Signal Processing and Speech Communication Laboratory Graz University of Technology Graz Austria Montreal Neurological Institute McGill University Canada Department of Computer Science University of Hertfordshire Hatfield United Kingdom School of Computer and Communication Sciences EPFL Lausanne Switzerland Department of Computing Imperial College London United Kingdom Division of Psychology and Language Sciences University College London United Kingdom

Understanding the functional architecture of complex systems is crucial to illuminate their inner workings and enable effective methods for their prediction and control. Recent advances have introduced tools to characterise emergent macroscopic levels;however, while these approaches are successful in identifying when emergence takes place, they are limited in the extent they can determine how it does. Here we address this important limitation by developing a computational approach to emergence, which characterises macroscopic processes in terms of their computational capabilities. Concretely, we articulate a view on emergence based on how software works, which is rooted on a mathematical formalisation of how macroscopic processes can express self-contained informational, interventional, and computational properties. This framework reveals a hierarchy of nested self-contained processes that determines what computations take place at what level, which in turn delineates the functional architecture of a complex system. This approach is illustrated on paradigmatic models from the statistical physics and computational neuroscience literature, which are shown to exhibit macroscopic processes that are akin to software in human-engineered systems. Overall, this framework enables a deeper understanding of the multi-level structure of complex systems, revealing specific ways in which they can be efficiently simulated, predicted, and controlled. Copyright © 2024, The Authors. All rights reserved.

关键词： Statistical Physics

来源：评论

学校读者我要写书评

暂无评论

Information Reconciliation for Continuous-Variable Quantum Key Distribution Beyond the Devetak-Winter Bound Using Short Blocklength Error Correction Codes

arXiv

引用

arXiv 2024年

作者： Gümüş, Kadir dos Reis Frazão, João Albores-Mejia, Aaron Škorić, Boris Liga, Gabriele Can Gültekin, Yunus Bradley, Thomas Alvarado, Alex Okonkwo, Chigo High Capacity Optical Transmission Laboratory Electro-Optical Communications Group Eindhoven University of Technology Eindhoven5600 MB Netherlands CubiQ Technologies De Groene Loper 5 Eindhoven Netherlands Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven5600 MB Netherlands Information and Communication Theory Lab Signal Processing Group Eindhoven University of Technology 5600MB Netherlands

In this paper we introduce a reconciliation protocol with a two-step error correction scheme using a short blocklength low rate code and a long blocklength high rate code. We show that by using this two-step decoding method it is possible to achieve secret key rates beyond the Devetak-Winter bound. We simulate the protocol using short blocklength low-density parity check code, and show that we can obtain reconciliation efficiencies up to 1.5. Using these high reconciliation efficiencies, it is possible double the achievable distances of CV-QKD systems. © 2024, CC BY.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Remarks on the Design of First Digital computers in Japan - Contributions of Yasuo Komamiya 17th

Remarks on the Design of First Digital Computers in Japan - ...

引用

17th International Conference on computer Aided Systems Theory, EUROCAST 2019

作者： Stanković, Radomir S. Sasao, Tsutomu Astola, Jaakko T. Yamada, Akihiko Mathematical Institute of SASA Belgrade Serbia Department of Computer Science Meiji University KawasakiKanagawa214-8571 Japan Department of Signal Processing Tampere University of Technology Tampere Finland Computer Systems and Media Laboratory Tokyo Japan

ISBN: (纸本)9783030450922

This paper presents some less known details about the work of Yasuo Komamiya in development of the first relay computers using the theory of computing networks that is based on the former work of Oohashi Kan-ichi and Mochiori Goto at the Electrotechnical Laboratory (ETL) of Agency of Industrial science and Technology, Tokyo, Japan. The work at ETL in the same direction was performed under guidance of Mochinori Goto. © 2020, Springer Nature Switzerland AG.

关键词： Digital computers

来源：评论

学校读者我要写书评

暂无评论

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs

arXiv

引用

arXiv 2021年

作者： Krishnan, Prasad Mathew, Rogers Kalyanasundaram, Subrahmanyam The Signal Processing & Communications Research Center International Institute of Information Technology Hyderabad India The Department of Computer Science and Engineering Indian Institute of Technology Hyderabad India

In the pliable index coding (PICOD) problem, a server is to serve multiple clients, each of which possesses a unique subset of the complete message set as side information and requests a new message which it does not have. The goal of the server is to do this using as few transmissions as possible. This work presents a hypergraph coloring approach to the scalar PICOD problem. A conflict-free coloring of a hypergraph is known from literature as an assignment of colors to its vertices so that each hyperedge of the graph contains one uniquely colored vertex. For a given PICOD problem represented by a hypergraph consisting of messages as vertices and request-sets as hyperedges, we present achievable PICOD schemes using conflict-free colorings of the PICOD hypergraph. Various graph theoretic parameters arising out of such colorings (and some new coloring variants) then give a number of upper bounds on the optimal PICOD length, which we study in this work. Suppose the PICOD hypergraph has m vertices and n hyperedges, where every hyperedge overlaps with at most Γ other hyperedges. We show easy to implement randomized algorithms for the following: • For the single request case, we give a PICOD of length O(log2 Γ). This result improves over known achievability results [1], [2] for some parameter ranges. • For the t-request case, we give an MDS code of length max(O(log Γ log m), O(t log m)). Further if the hyperedges (request sets) are sufficiently large, we give a PICOD of the same length as above, which is not based on MDS construction. In general, this gives an improvement over the results of [2]. Our codes are of near-optimal length (up to a multiplicative factor of log t). Copyright © 2021, The Authors. All rights reserved.

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：