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

14th International Conference on Information, Intelligence, systems and Applications, IISA 2023

作者： Alexakis, Konstantinos Martinez, Jabier Kokkinakos, Panagiotis Filograna, Antonio Glikman, Yury Uriarte, Xabier Askounis, Dimitris School of Electrical and Computer Engineering National Technical University of Athens Decision Support Systems Laboratory Athens Greece Derio Spain Open Public Service Innovation Engineering Ingegneria Informatica S.p.A. Rome Italy Open Service Engineering Group Fraunhofer Fokus Berlin Germany

ISBN: (纸本)9798350318067

Public policy-making has a strong impact on our daily lives and on most of the aspects of our society including its relation with the environment. Sustainability as a global goal cannot be achieved without effective policies supporting it. The current trend in policy-making has two main pillars, policies are a) co-created with citizens and other relevant stakeholders and b) data-based to take informed decisions. Information technologies are needed to support these pillars and facilitate evidence-based policy-making. We present the DECIDO Portal that acts as a catalyst towards putting these general principles into practice gathering the technical components to be used within the whole policy life cycle. Notably, the portal lays its foundations on a well-defined co-creation methodology that can be seamlessly followed from a unique portal and provides best-practices for participatory processes and data-driven analyses. A set of real-world experimental policies in different countries serves as case studies to showcase and discuss the usage of the portal. © 2023 IEEE.

关键词： Public policy

来源：评论

学校读者我要写书评

暂无评论

Safe platooning control of connected and autonomous vehicles on curved multi-lane roads

arXiv

引用

arXiv 2025年

作者： Chen, Xiao Tang, Zhiqi Johansson, Karl H. Mårtensson, Jonas Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden

This paper investigates the safe platoon formation tracking and merging control problem of connected and automated vehicles (CAVs) on curved multi-lane roads. The first novelty is the separation of the control designs into two distinct parts: a lateral control law that ensures a geometrical convergence towards the reference path regardless of the translational velocity, and a longitudinal control design for each vehicle to achieve the desired relative arc length and velocity with respect to its neighboring vehicle. The second novelty is exploiting the constructive barrier feedback as an additive term to the nominal tracking control, ensuring both lateral and longitudinal collision avoidance. This constructive barrier feedback acts as a dissipative term, slowing down the relative velocity toward obstacles without affecting the nominal controller’s performance. Consequently, our proposed control method enables safe platoon formation of vehicles on curved multi-lane roads, with theoretical guarantees for safety invariance and stability analysis. Simulation and experimental results on connected vehicles are provided to further validate the effectiveness of the proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

VEnOM: A Vector Embedding Operator Modelling Framework 25

VEnOM: A Vector Embedding Operator Modelling Framework

引用

Proceedings of the 19th ACM International Conference on Distributed and Event-based systems

作者： Andreas Loizou Nikolaos Andriotis Dimitrios Tsoumakos School of Electrical and Computer Engineering/ Database and Knowledge Systems Lab National Technical University of Athens Athens Greece

来源：评论

学校读者我要写书评

暂无评论

AoI-oriented Adaptive Cooperative Transmission and Scheduling for Wireless Powered IoT Networks

AoI-oriented Adaptive Cooperative Transmission and Schedulin...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Zhang, Luoyu Chen, Yunfeng Liu, Yong Huang, Yu Zheng, Lei Hou, Fen Cai, Lin X. South China Normal University School of Electronics and Information Engineering Foshan China University of Macau State Key Laboratory of IoT for Smart City China Guangzhou University School of Electronics and Communication Engineering Guangzhou China Illinois Institute of Technology Department of Electrical and Computer Engineering Chicago United States

ISBN: (纸本)9798350351255

This paper investigates a wireless powered internet of things (IoT) network, where a hybrid access point (HAP) performs both wireless energy transfer (WET) and wireless information transfer (WIT). Specifically, the HAP charges IoT devices via WET and collects their updated information via WIT. To ensure the information freshness, an adaptive cooperative transmission scheme is proposed, where information packets of devices are transmitted either directly or cooperatively with the assistance of another device. To this end, an expected weighted sum of age of information (EWSAoI) minimization problem is formulated to adaptively determine the best device pairs for cooperative transmissions, and schedule the corresponding transmission, i.e., WET, direct WIT, or cooperative WIT. Leveraging the Lyapunov optimization framework, a low-complexity adaptive scheduling scheme is proposed, wherein the device pairing or information transmissions are determined based on the instantaneous AoI and energy status of IoT devices. Furthermore, to reduce signalling overhead, a two-timescale scheduling scheme is proposed, wherein a matching algorithm is incorporated to pair devices for cooperative transmission in a large timescale while the adaptive transmission of energy and information are executed in a small timescale. Simulation results validate that adaptive cooperative scheduling scheme effectively reduces the AoI with low system overhead, and the gain approaches to 43.3%, compared with non-cooperative scheme. © 2024 IEEE.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

Minimizing Maximum Tardiness in a Distributed Flow Shop Manufacturing Problem under No-Waiting and Sequence Dependent Setup Time Constraints 14

Minimizing Maximum Tardiness in a Distributed Flow Shop Manu...

引用

14th International Conference on Intelligent systems: Theories and Applications, SITA 2023

作者： Sayah, Achraf Aqil, Said Lahby, Mohamed Hassan Ii University of Casablanca Higher Normal School Laboratory of Applied Mathematics and Computer Sciences Morocco Hassan Ii University of Casablanca National Higher School of Arts and Crafts Laboratory Artificial Intelligence and Complex Systems Engineering Morocco

ISBN: (纸本)9798350308211

The distributed no-wait flow-shop manufacturing problem with sequence dependent setup time (DNWFSMP-SDST) is a challenging optimization problem that arises in various industries, including manufacturing and logistics. This problem involves scheduling a set of jobs on multiple machines in a distributed environment, where each job has a specific processing time and requires setup time between different machine transitions. The objective is to minimize the maximum tardiness of all jobs, which represents the maximum delay in completing any job beyond its desired due date. This study addresses the DNWFSMP-SDST optimization problem by employing two algorithms: Nawaz-Enscore-Ham (NEH) and Greedy Randomized Adaptive Search Procedure (GRASP). The NEH is a constructive heuristic that constructs an initial solution by iteratively inserting jobs into a partially ordered sequence. In contrast, GRASP combines a greedy randomized construction phase with a local search procedure to iteratively enhance the initial solution. The simulation study compares NEH and GRASP algorithms for solving DNWFSMP-SDST using bench-marking instance. The results show the pros and cons of each algorithm, helping practitioners make better decisions. Where the NEH algorithm outperform for GRASP technique solving the kind of problem. Overall, this research has enabled us to improve our methods for solving scheduling problems in distributed environments. © 2023 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Large Language Models and Multimodal Retrieval for Visual Word Sense Disambiguation

arXiv

引用

arXiv 2023年

作者： Kritharoula, Anastasia Lymperaiou, Maria Stamou, Giorgos Artificial Intelligence and Learning Systems Laboratory School of Electrical and Computer Engineering National Technical University of Athens Greece

Visual Word Sense Disambiguation (VWSD) is a novel challenging task with the goal of retrieving an image among a set of candidates, which better represents the meaning of an ambiguous word within a given context. In this paper, we make a substantial step towards unveiling this interesting task by applying a varying set of approaches. Since VWSD is primarily a text-image retrieval task, we explore the latest transformer-based methods for multimodal retrieval. Additionally, we utilize Large Language Models (LLMs) as knowledge bases to enhance the given phrases and resolve ambiguity related to the target word. We also study VWSD as a unimodal problem by converting to text-to-text and image-to-image retrieval, as well as question-answering (QA), to fully explore the capabilities of relevant models. To tap into the implicit knowledge of LLMs, we experiment with Chain-of-Thought (CoT) prompting to guide explainable answer generation. On top of all, we train a learn to rank (LTR) model in order to combine our different modules, achieving competitive ranking results. Extensive experiments on VWSD demonstrate valuable insights to effectively drive future directions. © 2023, CC BY-NC-ND.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Improvement artificial bee colony meta-heuristic for solving manufacturing flow-shop scheduling problem under blocking constraint 14

Improvement artificial bee colony meta-heuristic for solving...

引用

14th International Conference on Intelligent systems: Theories and Applications, SITA 2023

作者： Nejjarou, Omar Aqil, Said Lahby, Mohamed Hassan Ii University of Casablanca Laboratory of Applied Mathematics and Computer Sciences Higher Normal School Morocco Hassan Ii University of Casablanca Laboratory Artificial Intelligence and Complex Systems Engineering National Higher School of Arts and Crafts Morocco

ISBN: (纸本)9798350308211

Manufacturing flow-shop scheduling problem is a highly attractive optimization challenge in operations research. When there is limited space in a workshop or capacity queue of machine is null, a new problem called manufacturing blocking flow-shop scheduling problem (MBFSP) is investigated. This optimization problem is solved by considering that the job must be blocked during scheduling when the next machine is not available. The address this challenge effectively, we present two novel algorithms: the Iterative Local Search (ILS) with neighborhood solutions, and the Artificial Bee Colony (ABC) algorithm inspired by nature's meta-heuristics. These cutting-edge approaches are designed to address the problem from distinct and innovative perspectives, with a primary focus on optimizing the overall quality of the solution. By embracing these advanced techniques, we can effectively expand the scope of potential outcomes, opening up new avenues for achieving superior results. The target is to decrease the total weighted flow time (TWFT) , which represents the duration of completing all tasks. We provide a mathematical statement of the MBFSP optimization case and propose two solution meta-heuristics. In order to comprehensively assess the effectiveness of the proposed algorithms, we conducted a rigorous comparative study. This study involved an extensive set of instances, carefully curated to encompass a wide range of scenarios with varying numbers of jobs and machines. By testing the algorithms across diverse instances, we aimed to obtain a holistic understanding of their performance. Simulation results show that the ABC algorithm overcame the ILS algorithm, with a hit ratio 88% over the set of test instances and a minimum mean relative deviation in percent of 0.0154%. © 2023 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Fatigue crack propagation across grain boundary of Al-Cu-Mg bicrystal based on crystal plasticity XFEM and cohesive zone model

引用

Journal of Materials Science & Technology 2022年第31期126卷 275-287页

作者： Qi Zhao Magd Abdel Wahab Yong Ling Zhiyi Liu School of Materials Science and Engineering Hubei University of Automotive TechnologyShiyan 442002China Faculty of Mechanical-Electrical and Computer Engineering School of Engineering and TechnologyVan Lang UniversityHo Chi Minh CityVietnam Soete Laboratory Faculty of Engineering and ArchitectureGhent UniversityTechnologiepark Zwijnaarde 903B-9052 ZwijnaardeBelgium School of Materials Science and Engineering Central South UniversityChangsha 410083China

In this paper,a methodology integrating crystal plasticity(CP),the eXtended finite element method(XFEM)and the cohesive zone model(CZM)is developed for an Al-Cu-Mg alloy to predict fatigue crack propagation(FCP)across grain boundary(GB)of Al-Cu-Mg alloy during stageІІ.One GB model is incor-porated into FCP constitutive law to describe grain interaction at GB.A bicrystal containing GB is built up to simulate FCP behavior through L participated *** features including GB characteristic,cumulative plastic strain(CPS)distribution and crystal slipping evidence can be *** numer-ical results are compared with published experimental data to check the accuracy of *** work demonstrates that the combination of CP containing GB constitutive laws,XFEM and CZM is a promising methodology in predicting twist angle-controlled crack deflection through GBs.

关键词： Grain boundary Twist angle Crystal plasticity Extended finite element method Fatigue crack propagation Cumulative plastic strain

来源：评论

学校读者我要写书评

暂无评论

Multi-Blockchain Based Data Trading Markets With Novel Pricing Mechanisms

引用

IEEE/CAA Journal of Automatica Sinica 2023年第12期10卷 2222-2232页

作者： Juanjuan Li Junqing Li Xiao Wang Rui Qin Yong Yuan Fei-Yue Wang IEEE the State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China the College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao 266590China the School of Artificial Intelligence Anhui UniversityHefei 266114 the Qingdao Academy of Intelligent Industries Qingdao 230031China the School of Mathematics Renmin University of ChinaBeijing 100872China the State Key Laboratory for Management and Control of Complex Systems Chinese Academy of SciencesBeijing 100190 the Faculty of Innovation Engineering Macao University of Science and TechnologyMacao 999078China

In the era of big data,there is an urgent need to establish data trading markets for effectively releasing the tremendous value of the drastically explosive *** security and data pricing,however,are still widely regarded as major challenges in this respect,which motivate this research on the novel multi-blockchain based framework for data trading markets and their associated pricing *** this context,data recording and trading are conducted separately within two separate blockchains:the data blockchain(DChain) and the value blockchain(VChain).This enables the establishment of two-layer data trading markets to manage initial data trading in the primary market and subsequent data resales in the secondary ***,pricing mechanisms are then proposed to protect these markets against strategic trading behaviors and balance the payoffs of both suppliers and ***,in regular data trading on VChain-S2D,two auction models are employed according to the demand scale,for dealing with users’ strategic *** incentive-compatible Vickrey-Clarke-Groves(VCG)model is deployed to the low-demand trading scenario,while the nearly incentive-compatible monopolistic price(MP) model is utilized for the high-demand trading *** temporary data trading on VChain-D2S,a reverse auction mechanism namely two-stage obscure selection(TSOS) is designed to regulate both suppliers’ quoting and users’ valuation ***,experiments are carried out to demonstrate the strength of this research in enhancing data security and trading efficiency.

关键词： Auction data trading markets multi-blockchain pricing mechanisms

来源：评论

学校读者我要写书评

暂无评论

BTDFS: B+ Tree-Based Distributed File Storing Mechanism for Improving Small File Storage 24

BTDFS: B+ Tree-Based Distributed File Storing Mechanism for ...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Zhang, Jingyu Tian, Jiachen Luo, Lailong School of Computer and Communication Engineering Changsha University of Science and Technology Changsha China School of Systems Engineering National University of Defense Technology Science and Technology on Information Systems Engineering Laboratory Changsha China

ISBN: (纸本)9798350319934

Hadoop is currently the most popular big data processing architecture, which provides a processing framework for managing and analyzing massive data. Hadoop Distributed File System (HDFS) is the core component for storing data in the Hadoop systems. It performs well when storing and managing large-sized files. However, it shows extremely bad performance when dealing with a large number of small files, which is reflected in the consumption of a large amount of memory space of the NameNode node and the low efficiency of accessing small files. Archive file is proposed to solve this problem. It combines small files into larger merged files for storage, and uses index files to record the relevant information of small files in the merged files. However, archive files (e.g., Hadoop Archive, MapFile) all require additional processing and multiple I/O operations to obtain index information before actually accessing the file content, which reduces the efficiency of file access. This paper proposes a novel distributed file storing mechanism called B+ Tree-Based Distributed File Storing mechanism (BTDFS), which combines a large number of small files into a merged file, records the index information of the small files in the merged file, and organizes the index information into a B+ tree for storage. Using BTDFS, while reducing the metadata consumption of the NameNode node, improves the access performance of a single small file with additional abilities, which provides convenience for analyzing a large number of small files. Finally, this paper designs corresponding experiments for the proposed BTDFS, and tests and analyzes the memory usage in N ameN ode and the access performance of small files. The experimental results show that the proposed BTDFS can effectively reduce the memory usage of the NameNode, and the efficiency of accessing small files is improved compared with state-of-the-art methods. © 2022 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：