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

5th International Conference on Intelligent Computing, Communication, Networking and Services, ICCNS 2024

作者： Harvey, Lucas Srivastava, Gautam Brandon University Dept. of Math and Computer Science Canada

ISBN: (纸本)9798350354690

In this paper, we analyze two versions of a texture synthesis algorithm, study the cases in which they fail to produce a successful result and present modifications that could be made to lessen their rates of failure. This algorithm, Model Synthesis, and its variation Wave Function Collapse are designed to take in a small sample input image, or set of image constraints, and produce a larger pseudorandom output image in which every region of the output image is locally similar to an element of the input image. Both versions of the algorithm accomplish this task by considering their output image as a grid of cells with each cell initially in a superposition of all possibilities for itself and resolving cells one by one until all cells have been resolved from their superposition to a fixed value. One of the key differences between the two versions of the algorithm is the order in which cells are selected to be resolved, one simply selects in a scanline order, while the other resolves first those cells that have the minimum entropy, and thus which we can be most certain of their eventual state. For many inputs, the minimum entropy model reaches a state in which its output is not consistent with the input and thus fails, while the scanline model does not. This paper looks at the cases in which this occurs and concludes that this is often caused by the minimum entropy model creating regions of elevated constraints in its solution. Finally, it presents a possible alteration to the algorithm which allows a minimum entropy model to avoid this manner of failure among a subset of test cases. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Optimal Local Parameters For Hermite Type Cubic Splines 17

Optimal Local Parameters For Hermite Type Cubic Splines

引用

17th International Conference on Engineering of Modern Electric Systems, EMES 2023

作者： Bica, Alexandru Mihai Laslo, Eugen Crainic, Cristian G. University of Oradea Dept. of Math. and Computer Science Oradea Romania University of Oradea Dept. of Forestry and Forest Eng. Oradea Romania

ISBN: (纸本)9798350310634

The local derivatives of Hermite type cubic splines are optimally determined on each subinterval of a given mesh through a set of five classical interpolation procedures in order to minimize a certain objective function. We construct an iterative method that selects on each subinterval, the adequate algorithm for providing the local derivatives which minimize the objective function such that the values of the local derivatives computed at the previous subinterval are preserved in order to keep the smoothness of the spline. The admissible set of classical interpolation procedures consists of the natural cubic spline, the Catmull-Rom cubic spline, the Akima's cubic spline, and the cubic splines with minimal derivative oscillation and those with minimal deviation by the data polygon. A numerical experiment is presented in order to illustrate the performances of the algorithm. © 2023 IEEE.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

On Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs

引用

Journal of Combinatorial math.matics and Combinatorial Computing 2024年 121卷 41-52页

作者： Gao, Zhen-Bin Guo, Ricky Kwong, Harris Lee, Sin-Min Qiu, Wei College of General Education Guangdong University of Science and Technology Dongguan523000 China Dept. of Computer Science Univ. of Calif. at Los Angeles Los AngelesCA90095 United States Dept. of Math. Sci. SUNY Fredonia FredoniaNY14063 United States 1786 Plan Tree Drive UplandCA91784 United States College of Math. Sci.Harbin Engineering Univ. Harbin150001 China

A simple graph G with p vertices is said to be vertex-Euclidean if there exists a bijection f : V(G) → {1, 2, . . ., p} such that f(v1) + f(v2) > f(v3) for each C3-subgraph with vertex set {v1, v2, v3}, where f(v1) 2) 3). More generally, the vertex-Euclidean deficiency of a graph G is the smallest integer k such that G ∪ Nk is vertex-Euclidean. To illustrate the idea behind this new graph labeling problem, we study the vertex-Euclidean deficiency of two new families of graphs called the complete fan graphs and the complete wheel graphs. We also explore some related problems, and pose several research topics for further study. © 2024 the Author(s)

关键词： Wheels

来源：评论

学校读者我要写书评

暂无评论

Exploring Mixed-Grid Environments for Drone-Based Last-Mile Logistics Optimization 20

Exploring Mixed-Grid Environments for Drone-Based Last-Mile ...

引用

20th IEEE International Conference on Mobile Ad Hoc and Smart Systems, MASS 2023

作者： Sorbelli, Francesco Betti Coro, Federico Pinotti, Cristina M. Shende, Anil University of Perugia Dept. of Computer Science and Mathematics Italy University of Padua Dept. of Mathematics Italy Roanoke College Dept. of Math. CS & Physics United States

ISBN: (纸本)9798350324334

In recent years, drone-based delivery systems have gained significant attention for last-mile logistics in various domains. This study focuses on optimizing drone deliveries in mixed-grid environments, which combine urban and rural areas. The objective is to minimize the sum of distances between the delivery locations and the drone's depot. By selecting the optimal depot placement, we aim to improve factors such as expected delivery time, energy consumption, and environmental impacts. To address this optimization problem, we conducted a comprehensive comparison of several state-of-the-art algorithms specifically designed for computing the drone placement in mixed-grid environments. Our evaluation utilized synthetic and quasi-real data and two distinct scenarios were considered: the full-grid scenario, and the partial-grid scenario. Through empirical analyses, we demonstrate the effectiveness of the proposed algorithms and provide valuable insights into their trade-offs in terms of performance and time complexity. © 2023 IEEE.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

Advantages of brain parcellation in Multiple Sclerosis Lesion Segmentation

Advantages of brain parcellation in Multiple Sclerosis Lesio...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Pishvai, Dario Samuele Rondinella, Alessia Guarnera, Francesco Battiato, Sebastiano University of Catania Dept. of Math and Computer Science Catania Italy

ISBN: (纸本)9798350386226

Segmentation of multiple sclerosis lesions plays an important role in understanding disease status. In this work, we focus on the effectiveness of brain parcellation in enhancing the performance of segmentation for multiple sclerosis lesions in Magnetic Resonance Imaging. Brain parcellation does not improve the segmentation performance, but make the results more robust in terms of overall variability (e.g. standard deviation), by dividing the brain into physically significant sub-regions that the model can concentrate on. Our approach combines parcellation with the existing diffusion-based model to increase sensitivity, particularly in regions with small anomalies. We conducted a thorough evaluation of a reference dataset on the field using all available modalities. Our results show how the parcellation of the brain when integrated into a diffusion-based pipeline, makes the segmentation of MS more stable, lowering deviations from the average, and improving some of the results w.r.t. state-of-the-art. This method achieves good segmentation capabilities even with small datasets, providing promising indications for further research. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Enhancing MQTT Fault Tolerance and Resilience Against Broker Failures and DoS Attacks with Decentralized Blockchain Architecture 4

Enhancing MQTT Fault Tolerance and Resilience Against Broker...

引用

4th Intelligent Cybersecurity Conference, ICSC 2024

作者： Toe, Elisee Jaafar, Fehmi University of Quebec at Chicoutimi Dept. of Math and Computer Science Quebec Canada

ISBN: (纸本)9798350354775

The MQTT (Message Queuing Telemetry Transport) protocol has become the standard for IoT (Internet of Things) communication due to its lightweight nature and efficiency. However, its centralized architecture, with a single broker managing message flow, introduces vulnerabilities to failures and Denial of Service (DoS) attacks. This paper proposes a novel decentralized architecture for MQTT systems that leverages blockchain technology and smartcontracts to enhance resilience against broker failures and DoS attacks. Our approach utilizes a three-layer architecture comprising clients, cluster brokers, and a blockchain-based system to securely manage broker transitions and ensure continuous service. Key contributions of this work include a decentralized failover mechanism, secure recording and access control via blockchain, and a robust algorithm for improving system resilience. The use of blockchain and smartcontracts provides a tamper-proof and transparent method for managing broker transitions and access control, enhancing the security and trustworthiness of the system. These findings suggest that integrating blockchain technology with MQTT can mitigate some of the inherent vulnerabilities of traditional centralized architectures, paving the way for more resilient IoT communications. © 2024 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Neutrosophic Encoding and Decoding Algorithm for ASCII Code System

引用

Neutrosophic Sets and Systems 2024年 63卷 105-129页

作者： Salama, A.A. Tarek, Zahraa Darwish, Eman Yousif Elseuofi, Sherif Shams, Mahmoud Y. Dept. of Math and Computer Sci. Faculty of Science Port Said Univ. Egypt Dept. of Computer Science Faculty of Computers and information Mansoura University Egypt Dept. of Information System Higher Institute for Computers & Specific Studies Damietta Ras El-Bar Egypt Dept. of Machine Learning Faculty of Artificial Intelligence Kafrelsheikh University Egypt

Context and Background: This paper addresses the challenge of encoding and decoding numerical data by introducing innovative algorithms utilizing Neutrosophic ASCII codes and ASCII Neutrosophic codes. These codes serve to represent uncertain or imprecise character values through the incorporation of neutrosophic numbers, encompassing degrees of truth, falsity, and indeterminacy. Motivation: The study stems from the necessity to effectively represent uncertain or imprecise character values in numerical data. This is crucial in diverse applications where handling uncertain or ambiguous data is a prevalent concern. Hypothesis: We hypothesize that employing Neutrosophic ASCII codes and ASCII Neutrosophic codes in encoding and decoding numerical data can provide a robust solution for representing uncertain or imprecise character values. Methods: The encoding algorithm in this study transforms each character in the ASCII string into its corresponding ASCII code, utilizing either 7 or 8 bits based on the code type. This algorithm calculates the degree of truth, falsity, and indeterminacy for each bit, considering the uncertainty or ambiguity associated with the character. The resulting neutrosophic numbers are appended to create the Neutrosophic ASCII code or ASCII Neutrosophic code. The decoding algorithm partitions the code into groups of neutrosophic numbers, calculates the associated degrees of truth, falsity, and indeterminacy for each ASCII bit, and converts the neutrosophic numbers back to ASCII codes, reconstructing the original ASCII character string. Results: Our study yields a novel and effective approach for encoding and decoding numerical data, demonstrating the potential of Neutrosophic ASCII codes and ASCII Neutrosophic codes in representing uncertain or imprecise character values. Conclusions: The proposed algorithms offer a promising solution for handling uncertain or ambiguous data in numerical encoding and decoding. The specific and quantitative results

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

An Algorithmic Framework for Constructing Multiple Decision Trees by Evaluating Their Combination Performance Throughout the Construction Process

An Algorithmic Framework for Constructing Multiple Decision ...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Tajima, Keito Ichijo, Naoki Nakahara, Yuta Shimada, Koshi math.shima, Toshiyasu Waseda University Dept. of Pure and Applied Math. Tokyo Japan Waseda University Center of Data Science Tokyo Japan

ISBN: (纸本)9781665410205

Predictions using a combination of decision trees are known to be effective in machine learning. Typical ideas for constructing a combination of decision trees for prediction are bagging and boosting. Bagging independently constructs decision trees without evaluating their combination performance and averages them afterward. Boosting constructs decision trees sequentially, only evaluating a combination performance of a new decision tree and the fixed past decision trees at each step. Therefore, neither method directly constructs nor evaluates a combination of decision trees for the final prediction. When the final prediction is based on a combination of decision trees, it is natural to evaluate the appropriateness of the combination when constructing them. In this paper, we propose a new algorithmic framework that constructs decision trees simultaneously and evaluates their combination performance throughout the construction process. Our framework repeats two procedures. In the first procedure, we construct new candidates of combinations of decision trees to find a proper combination of decision trees. In the second procedure, we evaluate each combination performance of decision trees under some criteria and select a better combination. To confirm the performance of the proposed framework, we experiment with synthetic and benchmark data. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Towards Low-Code Architecture and Development of Embedded Systems

Towards Low-Code Architecture and Development of Embedded Sy...

引用

IEEE International Conference on Software Architecture Workshops (ICSAW)

作者： Felipe Xavier Loek Cleophas Michel R. V. Chaudron Dept. of Math. and Computer Science Eindhoven University of Technology Eindhoven Netherlands

ISBN: (数字)9798331533366

ISBN: (纸本)9798331533373

While the interest in low-code platforms grows, these technologies have mostly focused on administrative business applications, and other domains remain relatively untouched. We think much can be gained from introducing low-code concepts and tools to the embedded systems domain, which still suffers from a relatively complex development cycle. This paper presents a roadmap for creating an approach that allows the generalization of embedded software development through a low-code platform. We highlight five main tasks required to accomplish this endeavor, which will be researched in the near future: 1) studying existing low-code development characteristics; 2) defining a reference architecture for embedded systems; 3) identifying prevailing embedded system design patterns; 4) designing a multi-view approach with a consistent visual language; and 5) integrating formal verification into the platform.

关键词： Visualization Embedded systems Software architecture computer architecture Programming Reliability engineering Software reliability DSL Embedded software Guidelines

来源：评论

学校读者我要写书评

暂无评论

Histopathological Cancer Detection with Topological Signatures

Histopathological Cancer Detection with Topological Signatur...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Yadav, Ankur Ahmed, Faisal Daescu, Ovidiu Gedik, Reyhan Coskunuzer, Baris U. Texas Dept. of Computer Science Dallas United States U. Texas Dept. of Math. Sciences Dallas United States Harvard - Mgh Dept. of Pathology United States

ISBN: (纸本)9798350337488

We present a transformative approach to histopathological cancer detection and grading by introducing a very powerful feature extraction method based on the latest topological data analysis tools. By analyzing the evolution of topological patterns in different color channels, we discovered that every tumor class leaves its own topological footprint in histopathological images, allowing to extract feature vectors that can be used to reliably identify tumor *** topological signatures, even when combined with traditional machine learning methods, provide very fast and highly accurate results in various settings. While most DL models work well for one type of cancer, our model easily adapts to different scenarios, and consistently gives highly competitive results with the state-of-the-art models on benchmark datasets across multiple cancer types including bone, colon, breast, cervical (cytopathology), and prostate cancer. Unlike most DL models, our proposed Topo-ML model does not need any data augmentation or pre-processing steps and works perfectly on small datasets. The model is computationally very efficient, with end-to-end processing taking only a few hours for datasets consisting of thousands of images. © 2023 IEEE.

关键词： Cancer Histopathology Machine Learning Persistent Homology Topological Data Analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：