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

An Efficient data Collection using Whale Optimization Algorithm (WOA) in Wireless Sensor Network

学校读者我要写书评

暂无评论

An Efficient Data Collection using Whale Optimization Algori...

Communications and Information Technologies (GCCIT), Global Conference on

作者： Udhayakumar Pasupathi A. Gopi Saminathan A. Manikandan M. Subhashini C. Gowrishankar T. S. Poornappriya Department of Computer Science Srimad Andavan Arts and Science College (Autonomous) (Affiliated to Bharathidasan University Tiruchirappalli) Tamilnadu India NPR College of Engineering and Technology Dindigul ECE SRM Institute of Science and Technology Chennai Department of Computer Science Srimad Andavan Arts and Science College (Autonomous) Trichy-5 Department of Electrical and Electronics Engineering Kongunadu College of Engineering and Technology Tiruchirappalli Module Lead Data and Analytics Aspire Systems Pvt Ltd Karnataka

ISBN: (数字)9798350388916

ISBN: (纸本)9798350388923

Wireless sensor networks (WSNs) are an innovative technology that can be used in critical situations such as battlefields as well as commercial applications including buildings, traffic monitoring, smart homes, habitat monitoring, and more. A wireless sensor network (WSN) comprises small nodes capable of wireless sensing, processing, and communication. One of the most pressing concerns plaguing WSNs today is security. This paper suggests and investigates an energy-efficient cluster head (CH) selection approach using the Whale Optimization Algorithm (WOA) (called WOA-Clustering (WOA-C)) and the Geographic and Energy Aware Routing Algorithm (GEAR). As a result, the suggested method simplifies the decision-making process of energy-aware CHs by utilizing the fitness function that assesses node residual energy and the total energy of neighbouring nodes. Compared to the GWO-C, GABEEC, and PSOMSB protocols, the proposed WOA-GEAR protocol consumes 28%, 22%, and 7.5% less power. The suggested algorithm's network lifetime, power efficiency, buffer occupancy, throughput, and end-to-end latency were evaluated.

关键词： Wireless communication Wireless sensor networks Gears Query processing Clustering algorithms Energy efficiency Whale optimization algorithms Routing protocols Security Monitoring

Efficient and Scalable Parametric High-Order Portfolios Design via the Skew-t Distribution

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Xiwen Zhou, Rui Ying, Jiaxi Palomar, Daniel P. The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong The Shenzhen Research Institute of Big Data Shenzhen China The Department of Mathematics Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong The Department of Electronic and Computer Engineering Department of Industrial Engineering and Decision Analytics Hong Kong University of Science and Technology Kowloon Hong Kong

Since Markowitz’s mean-variance framework, optimizing a portfolio that strikes a trade-off between maximizing profit and minimizing risk has been ubiquitous in the financial industry. Initially, profit and risk were measured by the first two moments of the portfolio’s return, a.k.a. the mean and variance, which are sufficient to characterize a Gaussian distribution. However, it is broadly believed that the first two moments are not enough to capture the characteristics of the returns’ behavior, which have been recognized to be asymmetric and heavy-tailed. Although portfolio designs involving the third and fourth moments, i.e., skewness and kurtosis, have been demonstrated to outperform the conventional mean-variance framework, they present non-trivial challenges. Specifically, in the classical framework, the memory and computational cost of computing the skewness and kurtosis grow sharply with the number of assets. To alleviate the difficulty in high-dimensional problems, we consider an alternative expression for high-order moments based on parametric representations via a generalized hyperbolic skew-t distribution. Then, we reformulate the high-order portfolio optimization problem as a fixed-point problem and propose a robust fixed-point acceleration algorithm that solves the problem in an efficient and scalable manner. Empirical experiments also attest to the efficiency of our proposed high-order portfolio optimization framework, which presents low complexity and significantly outperforms the state-of-the-art methods by 2 ∼ 4 orders of magnitude. Copyright © 2022, The Authors. All rights reserved.

关键词： Profitability

Author Correction: Large-scale benchmarking of circRNA detection tools reveals large differences in sensitivity but not in precision

学校读者我要写书评

暂无评论

Nature methods 2025年第2期22卷 448页

作者： Marieke Vromman Jasper Anckaert Stefania Bortoluzzi Alessia Buratin Chia-Ying Chen Qinjie Chu Trees-Juen Chuang Roozbeh Dehghannasiri Christoph Dieterich Xin Dong Paul Flicek Enrico Gaffo Wanjun Gu Chunjiang He Steve Hoffmann Osagie Izuogu Michael S Jackson Tobias Jakobi Eric C Lai Justine Nuytens Julia Salzman Mauro Santibanez-Koref Peter Stadler Olivier Thas Eveline Vanden Eynde Kimberly Verniers Guoxia Wen Jakub Westholm Li Yang Chu-Yu Ye Nurten Yigit Guo-Hua Yuan Jinyang Zhang Fangqing Zhao Jo Vandesompele Pieter-Jan Volders OncoRNALab Cancer Research Institute Ghent (CRIG) Department of Biomolecular Medicine Ghent University Ghent Belgium. Department of Molecular Medicine University of Padova Padova Italy. Genomics Research Center Academia Sinica Taipei City Taiwan. Institute of Crop Science and Institute of Bioinformatics Zhejiang University Zhejiang China. Department of Biomedical Data Science and of Biochemistry Stanford University Stanford CA USA. Klaus Tschira Institute for Integrative Computational Cardiology Department of Internal Medicine III University Hospital Heidelberg German Center for Cardiovascular Research (DZHK) Heidelberg Germany. School of Basic Medical Science Department of Medical Genetics Wuhan University Wuhan China. EMBL-EBI Hinxton UK. Collaborative Innovation Center of Jiangsu Province of Cancer Prevention and Treatment of Chinese Medicine School of Artificial Intelligence and Information Technology Nanjing University of Chinese Medicine Nanjing China. Computational Biology Group Leibniz Institute on Aging - Fritz Lipmann Institute (FLI) Jena Germany. Biosciences Institute Faculty of Medical Sciences Newcastle University Newcastle UK. Translational Cardiovascular Research Center University of Arizona - College of Medicine Phoenix Phoenix AZ USA. Sloan Kettering Institute New York NY USA. Bioinformatics Group Department of Computer Science and Interdisciplinary Center for Bioinformatics Universität Leipzig Leipzig Germany. Data Science Institute I-Biostat Hasselt University Hasselt Belgium. State Key Laboratory of Bioelectronics School of Biological Sciences and Medical Engineering Southeast University Nanjing China. Department of Biochemistry and Biophysics National Bioinformatics Infrastructure Sweden Science for Life Laboratory Stockholm University Stockholm Sweden. Center for Molecular Medicine Children's Hospital Fudan University and Shanghai Key Laboratory of Medical Epigenetics International Laboratory of Medical Epigenetics and Metab

T-Cell Receptor Optimization with Reinforcement Learning and Mutation Polices for Precision Immunotherapy 27th

学校读者我要写书评

暂无评论

T-Cell Receptor Optimization with Reinforcement Learning an...

27th International Conference on Research in Computational Molecular Biology, RECOMB 2023

作者： Chen, Ziqi Min, Martin Renqiang Guo, Hongyu Cheng, Chao Clancy, Trevor Ning, Xia Computer Science and Engineering The Ohio State University ColumbusOH43210 United States Machine Learning Department NEC Labs PrincetonNJ08540 United States Digital Technologies Research Centre National Research Council Canada Ontario Canada Department of Medicine Baylor College of Medicine HoustonTX77030 United States NEC Oncolmmunity AS Oslo Cancer Cluster Innovation Park Ullernchausséen 64 Oslo0379 Norway Biomedical Informatics The Ohio State University ColumbusOH43210 United States Translational Data Analytics Institute The Ohio State University ColumbusOH43210 United States

ISBN: (纸本)9783031291180

T cells monitor the health status of cells by identifying foreign peptides displayed on their surface. T-cell receptors (TCRs), which are protein complexes found on the surface of T cells, are able to bind to these peptides. This process is known as TCR recognition and constitutes a key step for immune response. Optimizing TCR sequences for TCR recognition represents a fundamental step towards the development of personalized treatments to trigger immune responses killing cancerous or virus-infected cells. In this paper, we formulated the search for these optimized TCRs as a reinforcement learning (Formula Presented) problem, and presented a framework (Formula Presented) with a mutation policy using proximal policy optimization. (Formula Presented) mutates TCRs into effective ones that can recognize given peptides. (Formula Presented) leverages a reward function that combines the likelihoods of mutated sequences being valid TCRs measured by a new scoring function based on deep autoencoders, with the probabilities of mutated sequences recognizing peptides from a peptide-TCR interaction predictor. We compared (Formula Presented) with multiple baseline methods and demonstrated that (Formula Presented) significantly outperforms all the baseline methods to generate positive binding and valid TCRs. These results demonstrate the potential of(Formula Presented) for both precision immunotherapy and peptide-recognizing TCR motif discovery. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Reinforcement learning

Optimization Study of Renal CT Image Classification Using Convolution Neural Networks

学校读者我要写书评

暂无评论

Optimization Study of Renal CT Image Classification Using Co...

International Conference on Computing and Networking Technology (ICCNT)

作者： Afnaan. K K. V Nagaraja Tripty Singh Bhanu Prakash KN Department of Computer Science and Engineering Amrita School of Computing Bengaluru Amrita Vishwa Vidyapeetham India Department of Mathematics Amrita School of Engineering Bengaluru Amrita Vishwa Vidyapeetham India Principal Investigator Research Scientist Clinical Data Analytics and Radiomics Bioinformatic Institute (BII) A*STAR Singapore

computer tomography (CT), also known as computed tomography, is a medical imaging method that generates detailed and precise horizontal or axial images of targeted regions of the body for diagnostic purposes. In this particular study, the focus was on performing image classification of CT scan images of the Kidney. This organ plays an essential role in detoxification, fluid balance, and maintaining electrolyte levels in the human body. The dataset used for the study contained 12,446 images into four labeled classes - Cyst, Tumor, Stone, and Normal. Convolution Neural Network (CNN) model is built for binary (Normal and Tumor) and multi-image Classification to classify the Renal CT images into four classes. CNN uses ReLU as an activation function for classifying these images. The Model is evaluated and compared based on Accuracy and Loss performance metrics by compiling the CNN model with different deep learning TensorFlow Keras optimizers for Version 2.11.0 for Binary Image Classification at 10,20, and 50 epochs. The CNN model is assembled with Adam Optimizer and Follows the Regularized Leader (FTRL) Optimizer. The Testing and training Accuracy and Losses achieved are evaluated with a learning rate of 0.001 and 0.0001. Adam Optimizer outperforms to be the best Optimizer for Binary and Multi-Image Classification.

关键词：

Modeling Path Importance for Effective Alzheimer’s Disease Drug Repurposing

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xiang, Shunian Lawrence, Patrick J. Peng, Bo Chiang, ChienWei Kim, Dokyoon Shen, Li Ning, Xia Biomedical Informatics Department The Ohio State University ColumbusOH43210 United States Computer Science and Engineering Department The Ohio State University ColumbusOH43210 United States Department of Biostatistics Epidemiology and Informatics University of Pennsylvania PhiladelphiaPA19104 United States Translational Data Analytics Institute The Ohio State University ColumbusOH43210 United States

Recently, drug repurposing has emerged as an effective and resource-efficient paradigm for AD drug discovery. Among various methods for drug repurposing, network-based methods have shown promising results as they are capable of leveraging complex networks that integrate multiple interaction types, such as protein-protein interactions, to more effectively identify candidate drugs. However, existing approaches typically assume paths of the same length in the network have equal importance in identifying the therapeutic effect of drugs. Other domains have found that same length paths do not necessarily have the same importance. Thus, relying on this assumption may be deleterious to drug repurposing attempts. In this work, we propose MPI (Modeling Path Importance), a novel network-based method for AD drug repurposing. MPI is unique in that it prioritizes important paths via learned node embeddings, which can effectively capture a network’s rich structural information. Thus, leveraging learned embeddings allows MPI to effectively differentiate the importance among paths. We evaluate MPI against a commonly used baseline method that identifies anti-AD drug candidates primarily based on the shortest paths between drugs and AD in the network. We observe that among the top-50 ranked drugs, MPI prioritizes 20.0% more drugs with anti-AD evidence compared to the baseline. Finally, Cox proportional-hazard models produced from insurance claims data aid us in identifying the use of etodolac, nicotine, and BBB-crossing ACE-INHs as having a reduced risk of AD, suggesting such drugs may be viable candidates for repurposing and should be explored further in future studies. © 2023, CC BY.

关键词： Embeddings

Geometric processing for image-based 3D object modeling

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Qin, Rongjun Huang, Xu Department of Civil Environmental and Geodetic Engineering The Ohio State University 2036 Neil Avenue ColumbusOH United States Department of Electrical and Computer Engineering The Ohio State University 2036 Neil Avenue ColumbusOH United States Translational Data Analytics Institute The Ohio State University 2036 Neil Avenue ColumbusOH United States

Image-based 3D object modeling refers to the process of converting raw optical images to 3D digital representations of the objects. Very often, such models are desired to be dimensionally true, semantically labeled with photorealistic appearance (reality-based modeling). Laser scanning was deemed as the standard (and direct) way to obtaining highly accurate 3D measurements of objects, while one would have to abide the high acquisition cost and its unavailability on some of the platforms. Nowadays the image-based methods backboned by the recently developed advanced dense image matching algorithms and geo-referencing paradigms, are becoming the dominant approaches, due to its high flexibility, availability and low cost. The largely automated geometric processing of images in a 3D object reconstruction workflow, from ordered/unordered raw imagery to textured meshes, is becoming a critical part of the reality-based 3D modeling. This article summarizes the overall geometric processing workflow, with focuses on introducing the state-of-the-art methods of three major components of geometric processing: 1) geo-referencing;2) Image dense matching 3) texture mapping. Finally, we will draw conclusions and share our outlooks of the topics discussed in this article. Copyright © 2021, The Authors. All rights reserved.

关键词： Geometrical optics

Neural collapse with unconstrained features

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Mixon, Dustin G. Parshall, Hans Pi, Jianzong Department of Mathematics Ohio State University ColumbusOH United States Translational Data Analytics Institute Ohio State University ColumbusOH United States Department of Mathematics Western Washington University BellinghamWA United States Department of Electrical and Computer Engineering Ohio State University ColumbusOH United States

Neural collapse is an emergent phenomenon in deep learning that was recently discovered by Papyan, Han and Donoho. We propose a simple unconstrained features model in which neural collapse also emerges empirically. By studying this model, we provide some explanation for the emergence of neural collapse in terms of the landscape of empirical risk. © 2020, CC-BY.

关键词： Deep learning

Quantum Machine Learning for Software Supply Chain Attacks: How Far Can We Go?

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Masum, Mohammad Nazim, Mohammad Jobair Hossain Faruk, Md. Shahriar, Hossain Valero, Maria Abdullah Hafiz Khan, Md. Uddin, Gias Barzanjeh, Shabir Saglamyurek, Erhan Rahman, Akond Ahamed, Sheikh Iqbal Analytics and Data Science Institute Kennesaw State University Kennesaw United States Department of Computer Science Kennesaw State University MariettaGA United States Department of Software Engineering Kennesaw State University MariettaGA United States Department of Information Technology Kennesaw State University Marietta United States Electrical and Software Engineering Institute for Quantum Science and Technology University of Calgary Canada Department of Computer Science Tennessee Tech University Tennessee United States Department of Computer Science Marquette University Wisconsin United States

Quantum Computing (QC) has gained immense popularity as a potential solution to deal with the ever-increasing size of data and associated challenges leveraging the concept of quantum random access memory (QRAM). QC promises- quadratic or exponential increases in computational time with quantum parallelism and thus offer a huge leap forward in the computation of Machine Learning algorithms. This paper analyzes speed up performance of QC when applied to machine learning algorithms, known as Quantum Machine Learning (QML). We applied QML methods such as Quantum Support Vector Machine (QSVM), and Quantum Neural Network (QNN) to detect Software Supply Chain (SSC) attacks. Due to the access limitations of real quantum computers, the QML methods were implemented on open-source quantum simulators such as IBM Qiskit and TensorFlow Quantum. We evaluated the performance of QML in terms of processing speed and accuracy and finally, compared with its classical counterparts. Interestingly, the experimental results differ to the speed up promises of QC by demonstrating higher computational time and lower accuracy in comparison to the classical approaches for SSC attacks. © 2022, CC BY.

关键词： Supply chains