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

Enhanced MADM Strategy with Heptapartitioned Neutrosophic Distance Metrics

Neutrosophic Sets and Systems 2025年 78卷 74-96页

作者： Eassa, Mohamed Myvizhi, M. Elkholy, Mohamed Abdelhafeez, Ahmed Elbehiery, Hussam Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Applied Science Research Center Applied Science Private University Amman Jordan Department of Mathematics KPR Institute of Engineering and Technology Tamilnadu Coimbatore India Faculty of Computer Science& Engineering Alamein International University Egypt

In this work, a novel methodological approach to multi-attribute decision-making problems is developed and the notion of Heptapartitioned Neutrosophic Set Distance Measures (HNSDM) is introduced. By averaging the Penta-Partitioned Neutrosophic Distance Measures under particular conditional criteria, the suggested technique ranks the options. Additionally, we explore the fundamental characteristics of HNSDM and provide several illustrative theorems. The Heptapartitioned Neutrosophic Set Distance Measures are formulated based on the Hepta Neutrosophic Set. Lastly, a practical numerical example is provided to illustrate the efficacy of the suggested methodology. © 2025, University of New Mexico. All rights reserved.

关键词： Heptapartitioned Neutrosophic set Heptapartitioned Neutrosophic set and MADM strategy Heptapartitioned set Neutrosophic sine distance measure

来源：评论

学校读者我要写书评

暂无评论

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

Science China(Information Sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Bounds on the Size of Permutation codes under Kendall τ-metric

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4156-4166页

作者： Parvaresh, Farzad Sobhani, Reza Abdollahi, Alireza Bagherian, Javad Jafari, Fatemeh Khatami, Maryam University of Isfahan Faculty of Engineering Department of Electrical Engineering Isfahan Iran School of Mathematics Tehran19395-5746 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Applied Mathematics and Computer Science Isfahan81746-73441 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Pure Mathematics Isfahan81746-73441 Iran

In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation method has been proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P(n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, ..., n} with the minimum distance at least (Formula presented) under the Kendall τ-metric. By presenting an algorithm and two theorems, we improve the known lower and upper bounds for P(n, d). In particular, we show that P(n, d) = 4 for all n ≥ 6 and (Formula presented). Additionally, we prove that for any prime number n and integer (Formula presented). This result greatly improves the upper bound of P(n, 3) for all primes n ≥ 37. © 1963-2012 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Nonlinearity in Large-Cycle Cellular Automata

引用

Complex Systems 2025年第1期34卷 129-160页

作者： Mukherjee, Sukanya Adak, Sumit Department of Computer Science and Engineering Institute of Engineering and Management Kolkata University of Engineering and Management West Bengal Kolkata700091 India Department of Applied Mathematics and Computer Science DTU Compute Technical University of Denmark Kgs. Lyngby2800 Denmark

The class of maximal-length cellular automata (CAs) has gained significant attention over the last few years due to the fact that it can generate cycles with the longest possible lengths. For every l of the form l = 2n-1 where n ∈ , a cycle of length l can be generated by a cellular automaton (CA) of size ⌊log2 l⌋ + 1;this maximal-length CA is in fact the optimal (minimum-sized) CA to generate a cycle of length l. However, maximal-length CAs are, in general, linear and have some drawbacks. Moreover, it is nontrivial to address this problem for any l ∈ , that is, removing the constraint that l is of the form 2n-1. In this paper we therefore employ nonlinearity in the rules and aim to generate the near-optimal CA for any given cycle length l, meaning that the generated CAs will be of size n = (⌊log2 l⌋ + 1) + d, where the displacement d is as small as possible. We use a generic operator to concatenate a collection of component CAs of sizes n1, n2, …, nk by employing an evolutionary strategy. Here, n = n1 + n2 + ⋯ + nk and l ≥ lcm(1, 2, …, k ), where i (1 ≤ i ≤ k) is the maximum cycle length of a CA of size ni . An influencing factor in the design of component CAs is to achieve the near-optimal CA for a given cycle length. Here we consider nonlinear reversible large-cycle CAs as component CAs. We also measure the effectiveness of nonlinearity in large-cycle generation. © 2025, Complex Systems Publications, Inc. All rights reserved.

关键词： CAs cellular automata evolution large-cycle CA neighborhood dependent nonlinearity reversible CAs

来源：评论

学校读者我要写书评

暂无评论

Online Menu-Based Scheduling of Electric Vehicle Charging

引用

IEEE Transactions on Smart Grid 2025年第3期16卷 2478-2491页

作者： Mathioudaki, Angeliki Tsaousoglou, Georgios Varvarigos, Emmanouel Fotakis, Dimitris National Technical University of Athens School of Electrical and Computer Engineering Zografou15772 Greece Technical University of Denmark Department of Applied Mathematics and Computer Science Section for Dynamical Systems Kongens Lyngby2800 Denmark Archimedes Research Unit Athena Research Center Marousi15125 Greece

This paper addresses the problem of efficiently scheduling of EV charging requests in a single Charging Station (CS), also taking into consideration the inability of EV users to express their preferences in closed-form utility functions. We consider a paradigm where a menu of possible charging intervals, each associated with an urgency price, is generated online. By letting the EV users pick their most preferable menu option, the proposed algorithm commits on each EV’s charging completion time upon its arrival, achieves a near optimal total weighted charging completion time, and prevents the users from strategically misreporting their preferences, while offering a practical and implementable solution to the problem of EVs - charging station interaction. Our experimental evaluation demonstrates that our algorithmic approach performs nearly optimal in a variety of practically relevant scenarios. © 2010-2012 IEEE.

关键词： Charging stations

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of carbon dioxide and hydrogen plume migration in aquifers inspired by the FluidFlower benchmark study

引用

International Journal of Hydrogen Energy 2025年 135卷 56-68页

作者： Misaghi Bonabi, Amin van Rooijen, Willemijn Al Kobaisi, Mohammed Vuik, Cornelis Hajibeygi, Hadi Department of Applied Mathematics Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft Netherlands Department of Geoscience and Engineering Faculty of Civil Engineering and Geosciences Delft University of Technology Delft Netherlands

Large-scale geological storages of hydrogen (H2) and carbon dioxide (CO2) in saline aquifers present feasible options for a sustainable energy future. We compared the plume migration of CO2 and H2 in aquifers using the FluidFlower benchmark, incorporating the state-of-the-art thermophysical and petrophysical properties. The H2 plume, with its higher buoyancy and mobility compared to CO2, remains predominantly in the gas phase due to its lower solubility, increasing the chances of escaping through fractures or migration to distant regions. This additionally leads to a higher pressurized reservoir, which, along with higher buoyancy, increases the chance of caprock penetration. Dissolution trapping of CO2 into brine increases over time due to its fingering, while H2 does not show fingering. Our findings show that while geological carbon storage (GCS) benefits significantly from all structural, dissolution, and residual trapping, underground hydrogen storage (UHS) relies mainly on structural trapping, making the integrity of sealing elements of the system a key factor in its performance. © 2025 The Authors

关键词： Two phase flow

来源：评论

学校读者我要写书评

暂无评论

HoloStream: a GPU-powered high-speed user interface for holographic microscopy imaging

引用

Optics Express 2025年第7期33卷 15648-15660页

作者： Morales, Johan Obando-Vásquez, Sofia Doblas, Ana Trujillo, Carlos Applied Optics Group School of Applied Science and Engineering EAFIT University Medellin Colombia Optical Imaging Research Lab Electrical and Computer Engineering Department University of Massachusetts Dartmouth DartmouthMA United States

This paper presents HoloStream, a GPU-powered high-speed user interface designed for holographic microscopy imaging. The platform reconstructs quantitative phase images rapidly for off-axis digital holographic microscopy (DHM) systems operating in the telecentric regime. By optimizing critical computational procedures, the HoloStream app reconstructs phase maps of 1280 × 960 pixels up to 11 frames per second (FPS) in live visualization and 90 fps for pre-recorded holographic videos. This real-time phase compensation is performed by upgrading the semi-heuristic phase compensation (SHPC) algorithm through GPU acceleration via PyCUDA. The interface also offers a user-friendly experience with flexible control over acquisition modes, visualization formats, and 3D tracking functionalities. Experimental validation demonstrates the platform’s capability to achieve fast and accurate phase imaging for live microscopy applications. The HoloStream app advances DHM technology by combining high-speed processing with ease of use, making it suitable for a wide range of DHM imaging applications. © 2025 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement.

关键词： computer graphics equipment

来源：评论

学校读者我要写书评

暂无评论

Application of computer Vision Technology in User Interface Design 3rd

Application of Computer Vision Technology in User Interface ...

引用

3rd World Conference on Intelligent and 3D Technologies, WCI3DT 2024

作者： Su, Jianna Department of Mathematics and Computer Engineering Ordos Institute of Applied Technology Inner Mongolia Erdos017010 China

ISBN: (纸本)9789819791231

This article explores the application of computer vision technology in user interface design, particularly through gesture recognition to enhance human–computer interaction. Gestures offer natural and versatile advantages in the process of human–computer interaction. Vision-based gesture recognition technology has broad application potential in virtual environments, sign language recognition, machine control, and other fields. In the task of gesture recognition in user interface design, the recognition results are affected by some irrelevant factors, such as dynamic backgrounds and close-fitting clothing. The attention mechanism is a good way to address the above problems, as it applies weights to key areas to extract essential features, thereby improving the model's performance. Several commonly used attention mechanisms, such as spatial attention, channel attention, and mixed attention mechanisms, can only apply attention to a single-frame image, focusing on specific regions. However, gestures consist of sequences of multiple-frame images, and the recognition results are collectively influenced by multiple-frame gesture images. The aforementioned attention mechanisms cannot meet the requirements effectively. To address this issue, a joint intra-frame and inter-frame attention module has been investigated. The model is able to prevent the impact of irrelevant elements during the gesture identification process because of this module's ability to apply attention concurrently across many consecutive frames and inside a single frame. In order to further user interface design, this study employs convolutional neural networks to include gesture recognition. These results shed light on how computer vision technology may revolutionize UI design and enhance user experiences. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A QoS-based technique for load balancing in green cloud computing using an artificial bee colony algorithm

引用

Journal of Experimental and Theoretical Artificial Intelligence 2025年第2期37卷 307-342页

作者： Tabagchi Milan, Sara Jafari Navimipour, Nima Lohi Bavil, Hamed Yalcin, Senay Department of Computer Engineering Tabriz Branch Islamic Azad University Tabriz Iran Department of Computer Engineering Faculty of Engineering and Natural Sciences Kadir Has University Istanbul Turkey Future Technology Research Center National Yunlin University of Science and Technology Douliou Taiwan Department of Computer Engineering University of Applied Sciences & Technology Tabriz Iran Department of Computer Engineering Nisantasi University Istanbul Turkey

Nowadays, high energy amount is being wasted by computing servers and personal electronic devices, which produce a high amount of carbon dioxide. Thus, it is required to decrease energy usage and pollution. Many applications are utilised by green computing to save energy. Scheduling of tasks acts as an important process to reach the mentioned goals. It is worth stating that the vital characteristic of task scheduling in green clouds is the load balancing of tasks on virtual machines. Efficient load balancing moves tasks from overloaded to underloaded virtual machines to maintain the Quality of Service (QoS). This issue is an NP-complete problem, so this research suggests a new technique based on the behavioural structure of artificial bee behaviour. This method aims to improve QoS while lowering energy usage in green computing. In addition, the honey bees are considered the removed tasks from overloaded virtual machines and a candidate for migrating selected tasks with the lowest priority. The CloudSim testing findings demonstrate that the technique is successful in QoS, makespan, and energy usage compared to other ways. © 2023 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Optical Solitons for the Dispersive Concatenation Model with Differential Group Delay

引用

Nonlinear Optics Quantum Optics 2025年第1-2期61卷 71-97页

作者： Arnous, Ahmed H. Biswas, Anjan Yildirim, Yakup Alshomrani, Ali Saleh Department of Physics and Engineering Mathematics Higher Institute of Engineering El–Shorouk Academy Cairo Egypt Department of Mathematics and Physics Grambling State University GramblingLA71245–2715 United States Department of Mathematics King Abdulaziz University Jeddah21589 Saudi Arabia Department of Applied Sciences Cross–Border Faculty of Humanities Economics and Engineering Dunarea de Jos University of Galati 111 Domneasca Street Galati800201 Romania Department of Mathematics and Applied Mathematics Sefako Makgatho Health Sciences University Medunsa 0204 South Africa Department of Computer Engineering Biruni University Istanbul34010 Turkey Mathematics Research Center Near East University Nicosia99138 Cyprus Faculty of Arts and Sciences University of Kyrenia Kyrenia99320 Cyprus

This paper retrieves optical soliton solutions to the dispersive concatenation model with differential group delay that is with Kerr law of nonlinearity. The enhanced direct algebraic method has made this recovery possible. A full spectrum of optical solitons are presented. The intermediary functions that framed the pathway to the soliton solutions are Weierstrass’ elliptic functions and Jacobi’s elliptic functions. The parameter constraints that guarantees the existence of such solitons are also presented. ©2025 Old City Publishing, Inc.

关键词： Group delay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：