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

Emerging Smart Computing and Informatics (ESCI), Conference on

作者： K. Ananthajothi Pravin R. Kshirsagar Tan Kuan Tak Kailash Kumar Department of Computer Science and Engineering Rajalakshmi Engineering College Chennai India Department of Electronics & Telecommunication Engineering J D College of Engineering & Management Nagpur India Electrical Power Engineering Programme Singapore Institute of Technology Singapore College of Computing and Informatics Saudi Electronic University Riyadh Kingdom of Saudi Arabia

ISBN: (数字)9798331515683

ISBN: (纸本)9798331515690

Plant diseases directly affect farm output by lowering grain, fruit, and vegetable quality, threatening global food security. Thus, farmers inspect plant leaves with their eyes. Plant leaf monitoring is unreliable and error-prone. A multitude of deep learning algorithms have been developed to detect plant leaf diseases; however, most rely on low-resolution photos utilizing convolutional neural nets (CNNs). This research seeks to create an improved nine-layer the CNN network model for the accurate classification of leaf-related illnesses. A contrast enhancement approach is used to pre-process plant leaf pictures. Following binary thresholding, the pre-processed pictures are separated into leaf images and abnormality segmented using the "Enhanced U-Net (EU-Net)" approach. A Multilevel Feature Fusion Network Convolutional Neural Network (MFFN-CNN) is employed to categorize illnesses of leaves based on segmented images. The "Hybrid Leader Cat Swarm Optimization(HLCSO)" method improves U-Net parameter optimization. The effectiveness of the leaf diagnostic model is demonstrated experimentally employing a variety of factors through the use of numerous baseline approaches.

关键词： Deep learning Plant diseases Image segmentation Computational modeling Neural networks Convolutional neural networks Particle swarm optimization Informatics Optimization Monitoring

来源：评论

学校读者我要写书评

暂无评论

Intent-Based Service Graph Selection for Cost-Effective Cloud Deployment

Intent-Based Service Graph Selection for Cost-Effective Clou...

引用

International Conference on Intelligence in Next Generation Networks (ICIN)

作者： Sasan Sabour Amin Ebrahimzadeh Mbarka Soualhia Fetahi Wuhib Roch. H. Glitho Telecommunication Service Engineering Research Lab Concordia University Montréal QC Canada Ericsson Research Montréal QC Canada Computer Science Programme University of Western Cape Capetown South Africa

ISBN: (数字)9798331542399

ISBN: (纸本)9798331542405

Cloud computing offers a diverse range of virtualized services for users. However, selecting and composing these services to generate optimal service graphs that meet user requirements is complex because it requires an expert with extensive knowledge of the cloud applications and their service composition, to manually generate service graphs. This, however, cannot often guarantee that all the requirements are met. A potentially promising approach to address this complexity is to develop a system that enables cloud users to specify their intent and then to automatically select a service graph that meets all their requirements. In this paper, we address the problem of service graph selection while considering both functional and non-functional requirements derived from user intent. Our objective is to minimize the total deployment cost of the service graph in a data center network and to determine its placement within the distributed data center network. We formulate the problem as an Integer Linear Programming (ILP), taking into account the bandwidth and latency requirements of user intent. To solve this, we propose our Service Graph Selection (SGS) solution, which aims to achieve a near-optimal solution in a computationally efficient manner. Our results demonstrate that the proposed solution achieves a deployment cost that is only 4–6% larger than the lower bound of the optimal deployment cost.

关键词： Cloud computing Data centers Technological innovation Lower bound Costs Bandwidth Integer linear programming Computational efficiency Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Grasping by Spiraling: Reproducing Elephant Movements with Rigid-Soft Robot Synergy

arXiv

引用

arXiv 2025年

作者： Huang, Huishi Wang, Haozhe Fang, Chongyu Yan, Mingge Xu, Ruochen Zhang, Yiyuan Wang, Zhanchi Ying, Fengkang Liu, Jun Laschi, Cecilia Ang, Marcelo H. Advanced Robotics Centre National University of Singapore 117608 Singapore Integrative Sciences and Engineering Programme National University of Singapore Graduate School 119077 Singapore School of Computer Science and Technology University of Science and Technology of China Anhui Hefei230027 China 138632 Singapore

—The logarithmic spiral is observed as a common pattern in several living beings across kingdoms and species. Some examples include fern shoots, prehensile tails, and soft limbs like octopus arms and elephant trunks. In the latter cases, spiraling is also used for grasping. Motivated by how this strategy simplifies behavior into kinematic primitives and combines them to develop smart grasping movements, this work focuses on the elephant trunk, which is more deeply investigated in the literature. We present a soft arm combined with a rigid robotic system to replicate elephant grasping capabilities based on the combination of a soft trunk with a solid body. In our system, the rigid arm ensures positioning and orientation, mimicking the role of the elephant’s head, while the soft manipulator reproduces trunk motion primitives of bending and twisting under proper actuation patterns. This synergy replicates 9 distinct elephant grasping strategies reported in the literature, accommodating objects of varying shapes and sizes. The synergistic interaction between the rigid and soft components of the system minimizes the control complexity while maintaining a high degree of adaptability. Copyright © 2025, The Authors. All rights reserved.

关键词： Robotic arms

来源：评论

学校读者我要写书评

暂无评论

Deterministic and Dynamic Joint Placement and Scheduling of VNF-FGs for Remote Robotic Surgery

引用

IEEE Transactions on Network and Service Management 2025年第2期22卷 1841-1858页

作者： Hentati, Amina Ebrahimzadeh, Amin Glitho, Roch H. Belqasmi, Fatna Mizouni, Rabeb The Computer Science Programme University of Western Cape Capetown7535 South Africa The College of Innovative Technology Zayed University Abu Dhabi United Arab Emirates The Department of ECE Khalifa University Abu Dhabi127788 United Arab Emirates The Telecommunication Service Engineering Research Lab Concordia University MontréalQCH3G 1M8 Canada CIISE Concordia University MontréalQC Canada University of Western Cape Bellville South Africa Zayed University Dubai United Arab Emirates Khalifa University Abu Dhabi United Arab Emirates

During a Remote Robotic Surgery (RRS) session, multimodal data traffic with different requirements is initiated. In order to achieve a cost-effective deployment of such a system, it is crucial to tailor resource allocation policies based on the different quality of service (QoS) requirements of each data traffic. In this paper, we focus on resource allocation in a 5G-enabled tactile Internet RRS system using network function virtualization (NFV). In particular, we investigate the joint placement and scheduling of Virtualized Network Functions (VNFs) in a RRS system under both deterministic and dynamic settings. An integer linear program (ILP) is used to formulate the problem. Due to its high computational complexity, we first propose an efficient greedy algorithm to solve the ILP under deterministic settings. Simulation results show that our proposed algorithm achieves near-optimal performance and outperforms the benchmark solutions in terms of cost and admission rate. It can reduce cost by up to 37% and improve admission rate by up to 34% while satisfying both latency and reliability constraints. Furthermore, our results show that modeling the multimodal data traffic by multiple VNF Forwarding Graphs (VNF-FGs) with different QoS requirements achieves a significant gain in terms of cost and acceptance rate compared to modeling it by a single VNF-FG with the most stringent requirements. We then considered a dynamic environment where latency variations and traffic arrivals may occur over time. Using the principles of optimal stopping theory, we propose an adaptive dynamic scheduler that is capable of triggering recalculations of the existing optimal solution based on the observed cumulative number of traffic arrivals and latency violations without the need for predictions. Our proposed optimal scheduler minimizes the migration cost compared to other schedulers. © 2004-2012 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A Novel Contour Tracing Algorithm for Object Shape Reconstruction Using Parametric Curves

引用

computers, Materials & Continua 2023年第4期75卷 331-350页

作者： Nihat Arslan Kali Gurkahraman Defence Technology Programme Sivas University of Science and TechnologySivas58070Turkey Department of Computer Engineering Sivas Cumhuriyet UniversitySivas58140Turkey

Parametric curves such as Bézier and B-splines, originally developedfor the design of automobile bodies, are now also used in image processing andcomputer vision. For example, reconstructing an object shape in an image,including different translations, scales, and orientations, can be performedusing these parametric curves. For this, Bézier and B-spline curves can be generatedusing a point set that belongs to the outer boundary of the object. Theresulting object shape can be used in computer vision fields, such as searchingand segmentation methods and training machine learning algorithms. Theprerequisite for reconstructing the shape with parametric curves is to obtainsequentially the points in the point set. In this study, a novel algorithm hasbeen developed that sequentially obtains the pixel locations constituting theouter boundary of the object. The proposed algorithm, unlike the methods inthe literature, is implemented using a filter containing weights and an outercircle surrounding the object. In a binary format image, the starting point ofthe tracing is determined using the outer circle, and the next tracing movementand the pixel to be labeled as the boundary point is found by the filter ***, control points that define the curve shape are selected by reducing thenumber of sequential points. Thus, the Bézier and B-spline curve equationsdescribing the shape are obtained using these points. In addition, differenttranslations, scales, and rotations of the object shape are easily provided bychanging the positions of the control points. It has also been shown that themissing part of the object can be completed thanks to the parametric curves.

关键词： Contour tracing algorithm bézier curve B-spline curve object shape reconstruction

来源：评论

学校读者我要写书评

暂无评论

GENESHIFT: IMPACT OF DIFFERENT SCENARIO SHIFT ON JAILBREAKING LLM

arXiv

引用

arXiv 2025年

作者： Wu, Tianyi Xue, Zhiwei Liu, Yue Zhang, Jiaheng Hooi, Bryan Ng, See-Kiong Integrative Sciences and Engineering Programme NUS Graduate School National University of Singapore Singapore National University of Singapore Singapore Department of Computer Science School of Computing National University of Singapore Singapore

Jailbreak attacks, which aim to cause LLMs to perform unrestricted behaviors, have become a critical and challenging direction in AI safety. Despite achieving the promising attack success rate using dictionary-based evaluation, existing jailbreak attack methods fail to output detailed contents to satisfy the harmful request, leading to poor performance on GPT-based evaluation. To this end, we propose a black-box jailbreak attack termed GeneShift, by using a genetic algorithm to optimize the scenario shifts. Firstly, we observe that the malicious queries perform optimally under different scenario shifts. Based on it, we develop a genetic algorithm to evolve and select the hybrid of scenario shifts. It guides our method to elicit detailed and actionable harmful responses while keeping the seemingly benign facade, improving stealthiness. Extensive experiments demonstrate the superiority of GeneShift. Notably, GeneShift increases the jailbreak success rate from 0% to 60% when direct prompting alone would fail. We will open-source our code. © 2025, CC BY.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Mobility Oriented Next Generation Open System and Its Middleware

引用

电子学报(英文版) 2005年第4期14卷 579-583页

作者： ZHANG Yunyong LI Tingyuan ZHANG Zhijiang LIU Yunjie WANG Minghui QING Zhiguang LIU Jinde Postdoctoral Programme Technology DepartmentChina Unicom Beijing 100032 China Department of Computer and Communication Engineering Civil Aviation Flight University of ChinaGuanghan 618307 China Computer Science and Engineering College University of Electronic Science ＆ Technology of China Chengdu 610054 China

After persistent practices during the 1990's, using open system and interoperability middleware idea to integrate large scale computer systems has been the agreeable fact. With the development of wireless network and collaboration technology, the challenge of traditional open system and its middleware is met and new standard and technology are needed to embody high intelligent collaboration and mobility in the open system. Somebody tries all the new protocol such as I-TCP (Indirect Transport control protocol) to achieve these goals, but it is not realistic and it cannot integrate legacy systems. Somebody changes traditional middleware such as CORBA (Common object request broker architecture) to support transparency in wireless environment, but it is still traditional Client/Server computing mode and of low efficiency. In this paper, the new mechanism based on mobile agent and wireless CORBA is proposed. MASIF (Mobile agent system interoperability facility) and wireless CORBA specification are adopted to achieve high efficiency and interoperability in nomadic network, and mobile agent's mobility and its ACL (Agent communication language) is used to achieve high collaboration in lined network. ABCBA (Agent based computing basic architecture) and its excellent properties such as intelligence and high efficiency are mainly focused. In the end, some experiments and conclusions are presented.

关键词：中间件移动导向开放系统协同工作能力无限网络

来源：评论

学校读者我要写书评

暂无评论

Towards Model Resistant to Transferable Adversarial Examples via Trigger Activation

arXiv

引用

arXiv 2025年

作者： Yu, Yi Xia, Song Lin, Xun Kong, Chenqi Yang, Wenhan Lu, Shijian Tan, Yap-Peng Kot, Alex C. Lab Interdisciplinary Graduate Programme Nanyang Technological University Singapore PengCheng Laboratory Shenzhen China School of Electrical and Electronic Engineering Nanyang Technological University Singapore School of Computer Science and Engineering Beihang University Beijing China College of Computing and Data Science Nanyang Technological University Singapore

Adversarial examples, characterized by imperceptible perturbations, pose significant threats to deep neural networks by misleading their predictions. A critical aspect of these examples is their transferability, allowing them to deceive unseen models in black-box scenarios. Despite the widespread exploration of defense methods, including those on transferability, they show limitations: inefficient deployment, ineffective defense, and degraded performance on clean images. In this work, we introduce a novel training paradigm aimed at enhancing robustness against transferable adversarial examples (TAEs) in a more efficient and effective way. We propose a model that exhibits random guessing behavior when presented with clean data x as input, and generates accurate predictions when with triggered data x + τ. Importantly, the trigger τ remains constant for all data instances. We refer to these models as models with trigger activation. We are surprised to find that these models exhibit certain robustness against TAEs. Through the consideration of first-order gradients, we provide a theoretical analysis of this robustness. Moreover, through the joint optimization of the learnable trigger and the model, we achieve improved robustness to transferable attacks. Extensive experiments conducted across diverse datasets, evaluating a variety of attacking methods, underscore the effectiveness and superiority of our approach. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Analysis of air pollution (PM10) and respiratory morbidity rate using K-maximum sub-array (2-D) algorithm

Proceedings of the ACM Symposium on Applied Computing

引用

Proceedings of the ACM Symposium on Applied Computing 2007年 153-157页

作者： Fukuda, Kyoko Takaoka, Tadao Environmental Science Programme University of Canterbury Private Bag 4800 Christchurch New Zealand Computer Science and Software Engineering University of Canterbury Private Bag 4800 Christchurch New Zealand

ISBN: (纸本)1595934804;9781595934802

Air pollution is known to cause adverse effects on human health. While pidemiological studies generally involve statistical/geographical approaches, the use of computer algorithms is yet uncommon. In this study, the K-Maximum Sub-array (K-MSA) algorithm is introduced for the first time in health and environmental science to analyse the association between particulate air pollution with diameter less than 10 μm (PM10), from four years of daily measurements (1998-2002), and acute respiratory hospital admission counts over a wide range of age groups (0 to 98 years) in Christchurch, New Zealand. The morbidity rate was taken from residents within a 2 km diameter of the air pollution monitoring site, located in a residential area. The K-MSA algorithm identifies K maximum threshold values, e.g., what age groups associate most with specific ranges of [PM10] levels, by maximizing the sum of the elements of a selected sub-array of a two-dimensional array. The K-MSA successfully detects that the associations with different [PM10] levels vary between different age groups, and that responses even differ between sexes, and different time period (winter, summer or all seasons). The K-MSA will be an encouraging methodology to investigate how various air pollution levels are related to health or climate in the future to increase knowledge for future air pollution policy making. Copyright 2007 ACM.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Traffic Congestion Prevention Using Ant Colony Optimization 8

Traffic Congestion Prevention Using Ant Colony Optimization

引用

8th International engineering Conference on Renewable Energy and Sustainability, ieCRES 2023

作者： Abusamra, Aiman Ashour, Abeer Ghazal, Mai Aldahdooh, Jehad Abuarja, Raghad Islamic University of Gaza Computer Engineering Dept. Gaza Palestine University of Helsinki Doctoral Programme in Computer Science Helsinki Finland Islamic University of Gaza Computer Engineering Gaza Palestine

ISBN: (纸本)9798350300758

Managing traffic congestion is crucial for improving mobility, reducing fuel consumption, and mitigating environmental impacts in urban areas. To address this challenge, we present a novel framework named TCP-ACO for detecting traffic congestion that classifies congestion into three distinct types: expected, unexpected, and real-time. The framework utilizes data from various sources, including databases, Ant colony optimization (ACO) systems, and computer vision techniques, to precisely detect and handle traffic congestion. Expected congestion is identified by analyzing historical traffic data and scheduled events, while unexpected congestion is detected by leveraging real-time data from ACO systems. Real-time congestion is detected by employing computer vision techniques, such as analyzing video footage from cameras or drones. The proposed framework has the potential, by recognizing and managing various types of congestion, to improve traffic flow, shorten travel times, and decrease environmental impacts. Additionally, it also offers a precise and effective solution for traffic congestion detection, which is a crucial aspect of smart city traffic management systems. Our analysis shows that the ACO algorithm adapted in TCP-ACO is more effective in finding the shortest path between two cities (result obtained: 4.014) compared to the result obtained from the shortest path technique compounded with computer vision (which yields a score of 6.224 when the path is free). This indicates the effectiveness of the proposed framework in addressing the challenges of traffic congestion, offering a promising solution for smart city traffic management systems to improve mobility and reduce environmental impacts in urban areas. © 2023 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：