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

A ranking framework for the selection of IoT cloud platforms using hybrid multi-attribute decision-making method

International Journal of Intelligent Computing and Cybernetics 2024年第4期17卷 824-843页

作者： Supriya Raheja Rakesh Garg Ritvik Garg Department of Computer Science and Engineering Amity University Uttar PradeshNoidaIndia Department of Computer Science and Engineering Gurugram UniversityGurugramIndia Department of Computer and Communication Engineering Manipal University JaipurJaipurIndia

Purpose-The Internet of Things(IoT)cloud platforms provide end-to-end solutions that integrate various capabilities such as application development,device and connectivity management,data storage,data analysis and data *** high use of these platforms results in their huge availability provided by different ***,choosing the optimal IoT cloud platform to develop IoT applications successfully has become *** key purpose of the present study is to implement a hybrid multi-attribute decision-making approach(MADM)to evaluate and select IoT cloud ***/methodology/approach-The optimal selection of the IoT cloud platforms seems to be dependent on multiple ***,the optimal selection of IoT cloud platforms problem is modeled as a MADM problem,and a hybrid approach named neutrosophic fuzzy set-Euclidean taxicab distance-based approach(NFS-ETDBA)is implemented to solve the ***-ETDBA works on the calculation of assessment score for each alternative,*** cloud platforms,by combining two different measures:Euclidean and taxicab ***-A case study to illustrate the working of the proposed NFS-ETDBA for optimal selection of IoT cloud platforms is *** results obtained on the basis of calculated assessment scores depict that“Azure IoT suite”is the most preferable IoT cloud platform,whereas“Salesman IoT cloud”is the least ***/value-The proposed NFS-ETDBA methodology for the IoT cloud platform selection is implemented for the first time in this *** is highly capable of handling the large number of alternatives and the selection attributes involved in any decision-making ***,the use of fuzzy set theory(FST)makes it very easy to handle the impreciseness that may occur during the data collection through a questionnaire from a group of experts.

关键词： Internet of things(IoT) Multi-attribute decision-making Neutrosophic fuzzy set Euclidean and taxicab distance

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parametric rate-distortion model for video transcoding

引用

Multimedia Tools and Applications 2025年 1-35页

作者： Jamali, Maedeh Karimi, Nader Samavi, Shadrokh Shirani, Shahram Department of Electrical and Computer Engineering McMaster University HamiltonL8S 4L8 Canada Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan84156-83111 Iran Computer Science Department Seattle University Seattle98122 United States

Over the past two decades, the rise in video streaming has been driven by internet accessibility and the demand for high-quality video. To meet this demand across varying network speeds and devices, transcoding is essential. This paper introduces a parametric rate-distortion (R-D) transcoding model that predicts transcoding distortion at different bitrates without the need for re-encoding. Experimental results validate the model’s effectiveness in predicting rate-distortion behavior for diverse video content. Using our model, visual quality (measured by PSNR and VMAF) of transcoded video can be improved through trans-sizing. Moreover, our model can identify visually lossless bitrate ranges. This allows service providers to adjust target bitrates with minimal quality loss. Experimental results validate the model’s effectiveness in predicting rate-distortion behavior for diverse video content. By using the VMAF measure, our model achieves a quality improvement of up to 2.55 and bitrate savings of up to 79.10%. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

Hungarian-based Heuristic for Permutation-invariant Multi-robot Path Planning

引用

Journal of Institute of Control, Robotics and Systems 2025年第4期31卷 286-294页

作者： Lee, Jeongmin Na, Hyeon-Suk School of Computer Science and Engineering Soongsil University Korea Republic of

The Hungarian algorithm is a well-known cubic-time algorithm for finding minimum-cost matchings in weighted bipartite graphs. While utilizing it for multi-agent path planning yields the minimum-total-length set of paths for n agents, these paths may intersect. We propose a quadratic-time heuristic that computes a close-to-minimum-total-length set of agent paths and enables highly efficient collision-free modification of these paths. We employ several techniques to optimize both time efficiency and total path length, including grouping nearby points and exploiting the geometric properties of these groups. First, we utilize k-d trees to group nearby starting/destination points. We then use the Hungarian algorithm to match the centroids of these groups, followed by a second-round Hungarian matching of the individual points within each paired group. This hierarchical approach effectively reduces the time complexity from cubic to quadratic. Second, we accelerate the collision-free refinement of the computed paths by identifying disjoint group pairs through a simple geometric test and excluding them from collision-checking. Based on experimental results, our heuristic algorithm is highly effective in terms of both time efficiency and total path length;it achieves 1.001-optimal solutions for 4K agents in 0.4 s and for 250K agents in 875 s, whereas the Hungarian spends 192 s on computing only the minimum-total-length paths (before collision-checking) for 4K agents. We compare our method against four algorithms: Hungarian and greedy matchings, both with brute-force collision-checking and modification, and two previous algorithms developed by ourselves. © ICROS 2025.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Based Trojan Detection in Network Traffic: A CNN-BiLSTM Approach 100

Deep Learning-Based Trojan Detection in Network Traffic: A C...

引用

100th IEEE Vehicular Technology Conference, VTC 2024-Fall

作者： Hoque, Md Mozammal Alam, Khorshed Monir, Md Fahad Tarek Habib, Md University of Houston Department of Electrical and Computer Engineering United States Department of Computer Science & Engineering Bangladesh

ISBN: (纸本)9798331517786

Trojan detection from network traffic data is crucial for safeguarding networks against covert infiltration and potential data breaches. Deep learning (DL) techniques can play a pivotal role in detecting trojans from network traffic data by learning complex patterns and anomalies indicative of malicious behavior, thus enhancing detection accuracy and efficiency. This technique is pivotal in the context of data security, specifically in next-generation network architecture for its ability to effectively detect complex and evolving cyber threats, such as Trojan horse traffic, ensuring robust network protection. The research gap in detecting network Trojans lies in developing techniques capable of efficiently identifying stealthy and polymorphic variants while minimizing false positives. This study focuses on trojan detection from network traffic data, crucial for network security. Deep learning, specifically a combination of Convolutional neural networks (CNNs) and Bidirectional Long Short-Term Memory (BiLSTM) networks, is proposed to enhance accuracy and efficiency by learning complex patterns indicative of malicious behavior. Our proposed approach extracts features using CNNs to capture spatial dependencies and utilizes BiLSTM networks to process sequential dependencies, achieving 99% accuracy in trojan detection on real-world datasets. We validated this performance by comparing with previous approaches to ensure robustness in a common dataset. Making our work available open-source on, can enhance its accessibility and promote future research opportunities in Trojan Network Detection. After this work, we will work on detecting trojan networks from our institute's network data and will release the trojan network dataset, as there is a gap in open-source trojan network datasets. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Learning 101 reloaded: Revisiting the basics for the GenAI era

引用

IEEE Potentials 2024年第6期43卷 6-12页

作者： Qadir, Junaid College of Engineering Qatar University Department of Computer Science and Engineering Doha Qatar

In this paper, we delve into the transformative landscape of education amidst the disruptive advances of generative AI (GenAI), characterized by an unprecedented capacity to generate new information with tools such as ChatGPT. Building upon my previous publication, "Learning 101: the Untaught Basics,"in this magazine, I interrogate what has changed since then and how learners can harness the power of GenAI while avoiding its pitfalls, and learn how to learn effectively using GenAI tools. The dual role of GenAI in education is highlighted with immense potential for personalized learning side by side with the potent challenges it poses such as ethical concerns, intellectual property issues, biases, misinformation, and halluncations. Central to our argument is the development of metacognitive skills and discernment, enabling learners to navigate abundant resources effectively while avoiding overdependence and outsourcing of thinking to technology. This paper proposes strategies for integrating these tools into learning processes, aiming to equip educators and students with the skills to critically assess information and adapt to the evolving educational landscape. Our goal is to provide actionable insights for thriving in this new era, balancing the enhancement of learning and wisdom with technological advancements. © 1988-2012 IEEE.

关键词： Job analysis

来源：评论

学校读者我要写书评

暂无评论

Lightweight Model for Occlusion Removal from Face Images

Annals of Emerging Technologies in Computing

引用

Annals of Emerging Technologies in Computing 2024年第2期8卷 1-14页

作者： John, Sincy Danti, Ajit Department of Computer Science and Engineering Christ University India

In the realm of deep learning, the prevalence of models with large number of parameters poses a significant challenge for low computation device. Critical influence of model size, primarily governed by weight parameters in shaping the computational demands of the occlusion removal process. Recognizing the computational burdens associated with existing occlusion removal algorithms, characterized by their propensity for substantial computational resources and large model sizes, we advocate for a paradigm shift towards solutions conducive to low-computation environments. Existing occlusion riddance techniques typically demand substantial computational resources and storage capacity. To support real-time applications, it's imperative to deploy trained models on resource-constrained devices like handheld devices and internet of things (IoT) devices possess limited memory and computational capabilities. There arises a critical need to compress and accelerate these models for deployment on resource-constrained devices, without compromising significantly on model accuracy. Our study introduces a significant contribution in the form of a compressed model designed specifically for addressing occlusion in face images for low computation devices. We perform dynamic quantization technique by reducing the weights of the Pix2pix generator model. The trained model is then compressed, which significantly reduces its size and execution time. The proposed model, is lightweight, due to storage space requirement reduced drastically with significant improvement in the execution time. The performance of the proposed method has been compared with other state of the art methods in terms of PSNR and SSIM. Hence the proposed lightweight model is more suitable for the real time applications with less computational cost. © 2024 by the author(s).

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Multi-scale persistent spatiotemporal transformer for long-term urban traffic flow prediction

引用

Journal of Electronic science and Technology 2024年第1期22卷 53-69页

作者： Jia-Jun Zhong Yong Ma Xin-Zheng Niu Philippe Fournier-Viger Bing Wang Zu-kuan Wei School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu611731China College of Computer Science&Software Engineering Shenzhen UniversityShenzhen518060China School of Computer Science Southwest Petroleum UniversityChengdu610500China

Long-term urban traffic flow prediction is an important task in the field of intelligent transportation,as it can help optimize traffic management and improve travel *** improve prediction accuracy,a crucial issue is how to model spatiotemporal dependency in urban traffic *** recent years,many studies have adopted spatiotemporal neural networks to extract key information from traffic ***,most models ignore the semantic spatial similarity between long-distance areas when mining spatial *** also ignore the impact of predicted time steps on the next unpredicted time step for making long-term ***,these models lack a comprehensive data embedding process to represent complex spatiotemporal *** paper proposes a multi-scale persistent spatiotemporal transformer(MSPSTT)model to perform accurate long-term traffic flow prediction in *** adopts an encoder-decoder structure and incorporates temporal,periodic,and spatial features to fully embed urban traffic data to address these *** model consists of a spatiotemporal encoder and a spatiotemporal decoder,which rely on temporal,geospatial,and semantic space multi-head attention modules to dynamically extract temporal,geospatial,and semantic *** spatiotemporal decoder combines the context information provided by the encoder,integrates the predicted time step information,and is iteratively updated to learn the correlation between different time steps in the broader time range to improve the model’s accuracy for long-term *** on four public transportation datasets demonstrate that MSPSTT outperforms the existing models by up to 9.5%on three common metrics.

关键词： Graph neural network Multi-head attention mechanism Spatio-temporal dependency Traffic flow prediction

来源：评论

学校读者我要写书评

暂无评论

Tsunami tide prediction in shallow water using recurrent neural networks: model implementation in the Indonesia Tsunami Early Warning System

引用

Journal of Reliable Intelligent Environments 2024年第2期10卷 177-195页

作者： Dharmawan, Willy Diana, Mery Tuntari, Beti Astawa, I. Made Rahardjo, Sasono Nambo, Hidetaka Centre of Electronics BRIN Puspiptek Serpong South Tangerang15314 Indonesia Electrical Engineering and Computer Science Kanazawa University Kakuma Kanazawa Ishikawa9201192 Japan Computer Science and Electrical Engineering Kumamoto University Kumamoto Kurokami City8600862 Japan

Near-field tides prediction for tsunami detection in the coastal area is a significant problem of the cable-based tsunami meter system in north Sipora, Indonesia. The problem is caused by its shallow water condition and the unavailability of an applicable model or research for tsunami detection in this area. The problem foundation of shallow water area is its ambient noise level-dependent property that requires preprocessing to improve its feature representation. Moreover, because this shallow water is close to the land area, we must consider a model that can accommodate low prediction time for a Tsunami Early Warning System. Therefore, we propose a recurrent neural network (RNN) model because of its reliable performance for time series forecasting. Our report evaluates variants of the RNN model (the vanilla RNN, LSTM and GRU models) in tides prediction and z-score analysis for tsunami identification. The GRU model overwhelms the other two variants in error scores and time processed (training and prediction). It can achieve median error score distribution of 7.8×10-5 on the L1000-P250 configuration with time prediction under 0.1 s. This lower-time prediction is necessary to ensure the early warning system is going well. Moreover, the GRU model can identify all synthetic tsunami tide spikes (compared with the ground truth result) from magnitude 7.2–8.2 by applying a z-score on the GRU’s prediction. © The Author(s) 2023.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Characteristic Aware Index Structure Optimized for Real-world Datasets

引用

ACM Transactions on Storage 2025年第2期21卷 1-32页

作者： Yang, Jin Yoon, Heejin Yun, Gyeongchan Noh, Sam H. Choi, Young-Ri Computer Science and Engineering Unist Ulsan Korea Republic of Department of Computer Science Virginia Tech Blacksburg United States

Many datasets in real life are complex and dynamic, that is, their key densities are varied over the whole key space and their key distributions change over time. It is challenging for an index structure to efficiently support all key operations for data management, in particular, search, insert, and scan, for such dynamic datasets. In this article, we present DyTIS (Dynamic dataset Targeted Index Structure), an index that targets dynamic datasets. DyTIS, although based on the structure of Extendible hashing, leverages the CDF of the key distribution of a dataset, and learns and adjusts its structure as the dataset grows. The key novelty behind DyTIS is to group keys by the natural key order and maintain keys in sorted order in each bucket to support scan operations within a hash index. We also define what we refer to as a dynamic dataset and propose a means to quantify its dynamic characteristics. Our experimental results show that DyTIS provides higher performance than the state-of-the-art learned index for the dynamic datasets considered. We also analyze the effects of the dynamic characteristics of datasets, including sequential datasets, as well as the effect of multiple threads on the performance of the indexes. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Dynamic datasets index structure key distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：