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

5th International Conference on Cybernetics and Intelligent Systems, ICORIS 2023

作者： Anditta, Mietha Amartya, Natashya Warnars, Laurens Spits Warnars, Harco Leslie Hendric Spits Ramadhan, Arief Siswanto, Teddy Mantoro, Teddy Noordin, Nurulhuda Bina Nusantara University School of Computer Science Computer Science Departement Jakarta11530 Indonesia Bina Nusantara University School of Information Systems Information Systems Departement Jakarta11530 Indonesia Bina Nusantara University Binus Graduate Program - Computer Science Computer Science Departement Jakarta11530 Indonesia Telkom University Pjj Informatika Bandung40257 Indonesia Trisakti University Information Systems Department Jakarta11440 Indonesia Sampoerna University Faculty of Engineering and Technology Jakarta12760 Indonesia Universiti Teknologi Mara School of Computing Sciences College of Computing Informatics and Mathematics Selangor Malaysia

ISBN: (纸本)9798350369489

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset. © 2023 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

An Efficient Three-Factor Authenticated Key Agreement Technique Using FCM Under HC-IoT Architectures

引用

Computers, Materials & Continua 2022年第7期72卷 1373-1389页

作者： Chandrashekhar Meshram Agbotiname Lucky Imoize Sajjad Shaukat Jamal Parkash Tambare Adel R.Alharbi Iqtadar Hussain Department of Post Graduate Studies and Research in Mathematics Jayawanti Haksar Government Post-Graduation CollegeCollege of Chhindwara UniversityBetul460001M.P.India Department of Electrical and Electronics Engineering Faculty of EngineeringUniversity of LagosAkokaLagos100213Nigeria Department of Electrical Engineering and Information Technology Institute of Digital CommunicationRuhr University44801BochumGermany Department of Mathematics College of ScienceKing Khalid UniversityAbhaSaudi Arabia Water Resources&Applied Mathematics Research Lab Nagpur440027India College of Computing and Information Technology University of TabukTabuk71491Saudi Arabia Mathematics Program Department of MathematicsStatistics and PhysicsCollege of Arts and SciencesQatar University2713DohaQatar

The Human-Centered Internet of Things(HC-IoT)is fast becoming a hotbed of security and privacy *** users can establish a common session key through a trusted server over an open communication channel using a three-party authenticated key *** of the early authenticated key agreement systems relied on pairing,hashing,or modular exponentiation processes that are computationally intensive and *** order to address this problem,this paper offers a new three-party authenticated key agreement technique based on fractional chaotic *** new scheme uses fractional chaotic maps and supports the dynamic sensing of HC-IoT devices in the network architecture without a password *** projected security scheme utilized a hash function,which works well for the resource-limited HC-IoT *** results show that our new technique is resistant to password guessing attacks since it does not use a ***,our approach provides users with comprehensive privacy protection,ensuring that a user forgery attack causes no ***,our new technique offers better security features than the techniques currently available in the literature.

关键词： Three-party authenticated key agreement anonymity fractional chaotic maps Chebyshev polynomial password table human-centered internet of things(HC-IoT)

来源：评论

学校读者我要写书评

暂无评论

Natural features, wettability, and optical diffraction patterns on an elastomeric replica of a superhydrophobic leaf derived via soft lithography

Natural features, wettability, and optical diffraction patte...

引用

Optical Manipulation and Structured Materials Conference 2023

作者： Budlayan, Marco Laurence M. Palangyos, Dina C. Patricio, Jonathan N. Arco, Susan D. Guerrero, Raphael A. Department of Physics Ateneo de Manila University Loyola Heights Quezon City1108 Philippines Mathematics and Natural Sciences Department College of Computing Pangasinan State University Pangasinan Urdaneta Philippines Materials Science and Engineering Program College of Science University of the Philippines Diliman Diliman Quezon City1101 Philippines Synthetic Organic Chemistry Laboratory Institute of Chemistry College of Science University of the Philippines Diliman Diliman Quezon City1101 Philippines

ISBN: (纸本)9781510663398

Surface features of natural materials such as cuticles, shells, and leaves continue to be used as models for creating sophisticated infrastructure, landscape, and microdevice designs. Optical microscopy is the easiest and most accessible tool for examining such surface features and micropatterns. This method, however, fails to probe opaque surfaces like thick skin and leaves since it needs enough light to penetrate the sample. In this work, we demonstrate the feasibility of probing the natural structures of a superhydrophobic leaf using simple optical microscopy by replicating the leaf surface on an elastomer via soft lithography. Optical images of the replica revealed intricate details of features present on the leaf, including the stoma, cuticle boundary, and trichome. Contact angle measurements were also conducted to investigate the wettability of the real leaves and their replicas. Finally, we utilized the fabricated replicas as optical gratings that were observed to generate various diffraction patterns with fluctuating intensities. Our work offers a new perspective on alternative optical microscopy strategies and optical beam tuning using biomimetic, low-cost materials. © 2023 SPIE.

关键词： Contact angle

来源：评论

学校读者我要写书评

暂无评论

Drawing Lines for Measurement-Based Probabilistic Timing Analysis

Drawing Lines for Measurement-Based Probabilistic Timing Ana...

引用

Real-Time Systems Symposium (RTSS)

作者： Tadeu Nogueira C. Andrade George Lima Verônica Maria Cadena Lima Graduate Program in Computer Science Federal University of Bahia Salvador Bahia Brazil Institute of Computing Federal University of Bahia Salvador Bahia Brazil Institute of Mathematics and Statistics Federal University of Bahia Salvador Bahia Brazil

ISBN: (数字)9798331540265

ISBN: (纸本)9798331540272

We describe DBL-MBPTA, a new approach for measurement-based probabilistic timing analysis (MBPTA). Unlike the usual MBPTA, which treats the time a program executes as a random variable, we consider both the number n of instructions executed in each measurement and the time $T(n)$ they took to execute. By taking tuples $(n, T(n))$, for various values of n, DBL-MBPTA allows for multiple execution path analysis. We show that $(n, T(n))$ can be bounded from below and above by two reference lines. The modeled random variable is the relative distance ($n, T(n)$) from these lines, which explains the term distance between lines (DBL) given to the approach. According to DBL-MBPTA, samples can be analyzed and improved, for which we employ deep neural networks. Once sample coverage is deemed representative, probabilistic bounds on execution time are estimated via the modeled relative distance. We evaluate our approach using both synthetic data and data collected through measurements on a multi-core platform. The results obtained demonstrate the effectiveness of DBL-MBPTA.

关键词： Lower bound Codes Processor scheduling Bandwidth Artificial neural networks Probabilistic logic Real-time systems Timing Random variables Synthetic data

来源：评论

学校读者我要写书评

暂无评论

Fine-Tuned MobileNetV2 and VGG16 Algorithm for Fish Image Classification 4

Fine-Tuned MobileNetV2 and VGG16 Algorithm for Fish Image Cl...

引用

4th International Conference on Informatics, Multimedia, Cyber and Information System, ICIMCIS 2022

作者： Fitrianah, Devi Suryaningrum, Kristien Margi Sagala, Noviyanti Tri Maretta Ayumi, Vina Lim, Siew Mooi School of Computer Science Bina Nusantara University Computer Science Department Jakarta Indonesia School of Computer Science Bina Nusantara University Mathematics Statistics Department Jakarta Indonesia Universitas Mercu Buana Informatics Engineering Program Faculty of Computer Science Jakarta Indonesia Tunku Abdul Rahman University College Faculty of Computing and Information Technology Computer Science Department Kuala Lumpur Malaysia

ISBN: (纸本)9781665473279

Study on the identification and classification of fish is challenging and valuable because of its role in advancing the marine and agricultural fields. This research has benefits interms of monitoring fish populations and ecosystems in a particular area. Furthermore, this research helps monitor fish that are considered threatened or endangered so that it makes iteasier to map prohibited areas for fishing. This research aims to know performance of MobileNetV2 and VGG16 with parameter tuning process by identifying the value of batch size, epoch, learning rate, and optimizer for fish image dataset. The proposed research phase consists of five main stages, including experimental setup, dataset construction, dataset preprocessing, dataset training and modelling and evaluation. As the result, VGG16 obtained the highest accuracy value. For VGG16 without fine-tuning, the testing accuracy is 98.07%. For VGG16 with fine-tuning, the testing accuracy is 96.56%. © 2022 IEEE.

关键词： Fish

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Clustering and Distribution Matching with Bandit Feedback

arXiv

引用

arXiv 2024年

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y.F. Scarlett, Jonathan Descartes Program CNRS@CREATE 138602 Singapore Department of Information Systems and Analytics School of Computing National University of Singapore 119077 Singapore Department of Mathematics Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore Department of Computer Science Department of Mathematics Institute of Data Science National University of Singapore 119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank–Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ *** Codes 68T05 Copyright © 2024, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

ProtSCAPE: Mapping the landscape of protein conformations in molecular dynamics

arXiv

引用

arXiv 2024年

作者： Viswanath, Siddharth Bhaskar, Dhananjay Johnson, David R. Rocha, João Felipe Castro, Egbert Grady, Jackson D. Grigas, Alex T. Perlmutter, Michael A. O’Hern, Corey S. Krishnaswamy, Smita Department of Computer Science Yale University United States Department of Genetics Yale University United States Program in Computing Boise State University United States Computational Biology and Bioinformatics Program Yale University United States Department of Mathematics Boise State University United States

Understanding the dynamic nature of protein structures is essential for comprehending their biological functions. While significant progress has been made in predicting static folded structures, modeling protein motions on microsecond to millisecond scales remains challenging. To address these challenges, we introduce a novel deep learning architecture, Protein Transformer with Scattering, Attention, and Positional Embedding (ProtSCAPE), which leverages the geometric scattering transform alongside transformer-based attention mechanisms to capture protein dynamics from molecular dynamics (MD) simulations. ProtSCAPE utilizes the multi-scale nature of the geometric scattering transform to extract features from protein structures conceptualized as graphs and integrates these features with dual attention structures that focus on residues and amino acid signals, generating latent representations of protein trajectories. Furthermore, ProtSCAPE incorporates a regression head to enforce temporally coherent latent representations. Importantly, we demonstrate that ProtSCAPE generalizes effectively from short to long trajectories and from wild-type to mutant proteins, surpassing traditional approaches by delivering more precise and interpretable upsampling of dynamics. © 2024, CC BY.

关键词： Molecular docking

来源：评论

学校读者我要写书评

暂无评论

Prediction of Bankruptcy among Middle 40 Per Cent (M40) in Malaysia using Support Vector Machine

Prediction of Bankruptcy among Middle 40 Per Cent (M40) in M...

引用

Student Conference on Research and Development (SCOReD)

作者： Nurbaity Sabri Aqilah Nadiah Md Sahiq Hazwa Hanim Mohamed Hamzah Hartayuni Sain Nur Nabilah Abu Mangshor Anis Amilah Shari College of Computing Informatics and Mathematics Universiti Teknologi MARA Cawangan Melaka Kampus Jasin Melaka Malaysia Faculty of Business and Management Universiti Teknologi MARA Cawangan Melaka Kampus Bandaraya Melaka Malaysia Statistics Study Program Mathematics and Natural Science Faculty Tadulako University Palu Indonesia

ISBN: (数字)9798331510077

ISBN: (纸本)9798331510084

The Middle 40 Per Cent (M40) demographic comprises a substantial proportion of Malaysia’s consumer base, comprising the median 40% of income earners. This group is a big part of the country’s customer base. The rising cost of living, flat wage growth, and rising family debt make this group especially vulnerable to financial instability. Given these economic pressures, predicting the possibility of bankruptcy in this population is becoming increasingly crucial to allow for early intervention and preventive actions. Support Vector Machines (SVM) are recognized for their efficacy in classification tasks, particularly with small or imbalanced datasets. SVM prediction will be utilized using 14694 samples of the Debt Management program (DMP) dataset from 2016 to 2020. Twenty-three (23) features will be implemented on the dataset and Synthetic Minority Oversampling Technique (SMOTE) to improve the imbalanced datasets. The experiment demonstrates that the SVM classifier obtained 91.1% accuracy when implementing PUK kernels. It suggests that SVM is a plausible alternative model for predicting personal bankruptcy in the M40 group. To anticipate personal bankruptcy for M40, additional prediction models will be evaluated in the future.

关键词： Support vector machines Machine learning algorithms Neural networks Predictive models Prediction algorithms Data models Vectors Bankruptcy Research and development Random forests

来源：评论

学校读者我要写书评

暂无评论

Parallel Approximations for High-Dimensional Multivariate Normal Probability Computation in Confidence Region Detection Applications

Parallel Approximations for High-Dimensional Multivariate No...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiran Zhang Sameh Abdulah Jian Cao Hatem Ltaief Ying Sun Marc G. Genton David E. Keyes Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Statistics Program King Abdullah University of Science and Technology Extreme Computing Research Center King Abdullah University of Science and Technology Thuwal Saudi Arabia Department of Mathematics The University of Houston Houston Texas USA

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

Addressing the statistical challenge of computing the multivariate normal (MVN) probability in high dimensions holds significant potential for enhancing various applications. For example, the critical task of detecting confidence regions where a process probability surpasses a specific threshold is essential in diverse applications, such as pinpointing tumor locations in magnetic resonance imaging (MRI) scan images, determining hydraulic parameters in groundwater flow issues, and forecasting regional wind power to optimize wind turbine placement, among numerous others. One common way to compute high-dimensional MVN probabilities is the Separation-of-Variables (SOV) algorithm. This algorithm is known for its high computational complexity of O(n 3 ) and space complexity of O(n 2 ), mainly due to a Cholesky factorization operation for an n×n covariance matrix, where n represents the dimensionality of the MVN problem. This work proposes a high-performance computing framework that allows scaling the SOV algorithm and, subsequently, the confidence region detection algorithm. The framework leverages parallel linear algebra algorithms with a task-based programming model to achieve performance scalability in computing process probabilities, especially on large-scale systems. In addition, we enhance our implementation by incorporating Tile Low-Rank (TLR) approximation techniques to reduce algorithmic complexity without compromising the necessary accuracy. To evaluate the performance and accuracy of our framework, we conduct assessments using simulated data and a wind speed dataset. Our proposed implementation effectively handles high-dimensional multivariate normal (MVN) probability computations on shared and distributed-memory systems using finite precision arithmetics and TLR approximation computation. Performance results show a significant speedup of up to 20X in solving the MVN problem using TLR approximation compared to the reference dense solution without sacrificin

关键词： Accuracy Tensors Wind speed Magnetic resonance imaging Linear algebra Wind power generation Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Multilevel Monte Carlo Methods for the Grad-Shafranov Free Boundary Problem

SSRN

引用

SSRN 2023年

作者： Elman, Howard C. Liang, Jiaxing Sánchez-Vizuet, Tonatiuh Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park United States Applied Mathematics & Statistics and Scientific Computing Program University of Maryland College Park United States Department of Mathematics The University of Arizona United States

The equilibrium configuration of a plasma in an axially symmetric reactor is described mathematically by a free boundary problem associated with the celebrated Grad-Shafranov equation. The presence of uncertainty in the model parameters introduces the need to quantify the variability in the predictions. This is often done by computing a large number of model solutions on a computational grid for an ensemble of parameter values and then obtaining estimates for the statistical properties of solutions. In this study, we explore the savings that can be obtained using multilevel Monte Carlo methods, which reduce costsby performing the bulk of the computations on a sequence of spatial grids that are coarser than the one that would typically be used for a simple Monte Carlo simulation. We examine this approach using both a set of uniformly refined grids and a set of adaptively refined grids guided by a discrete error estimator. Numerical experiments show that multilevel methods dramatically reduce the cost of simulation, with cost reductionstypically on the order of 60 or more and possibly as large as 200. Adaptive gridding results in more accurate computation of geometric quantities such as x-points associated with the model. © 2023, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：