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

Data Science, Agents & Artificial Intelligence (ICDSAAI), Inter.a.ional Conference on

作者： M rajapriya V. rohini S. Arul Krishnan K. Prakash G. Gayathri D Sugerthana Helena Seles Department of Management Studies Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Avadi Chennai Department of Management Studies S.A. Engineering College Chennai Tamilnadu India Faculty of Management SRM Institute of Science and Technology Ramapuram Chennai Department of Computer Science Alpha Arts & Science College Porur Chennai Department of Commerce and Business Administration Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Avadi Chennai

The allocation of resources is a crucial under.a.ing in various fields, and selecting an optimization appr.a.h plays a central role in attaining the intended results. The present work aims to conduct a comparative analysis of the perfor.a.ce of Genetic Algorithms (GA) and Linear Programming (LP) in the specific domain of optimizing team composition by means of resource allocation. Several tests and analyses were done to assess the merits and limitations of these two methodologies. The results of our study indicate that the utilization of resources by GA is significantly higher, r.a.hing roughly 92.5%. This finding suggests that GA holds promise as a suitable option when the maximization of resource usage is of utmost impor.a.ce. Nevertheless, it can be observed that LP regularly exhibits superior perfor.a.ce compared to GA in terms of team composition score. LP achieves an average score of roughly 84.9, which suggests that the solutions generated by LP are more closely matched with the desired team composition. Additionally, analyzing resource allocation among individual team members reveals that GA tends to allocate resources more equitably. In contrast, LP displays a modest inclination towards favoring specific team members. The Genetic Algorithm (GA) exhibits speedier convergence times, with an average convergence time of roughly 321 seconds, in contrast to the average convergence time of 423 seconds observed in Linear Programming (LP). Nevertheless, it is impor.a.t to acknowledge that the computing resources required for GA are marginally higher, around 95.2%, compared to LP which demands approximately 91.8% of resources.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CapSight: A Social Aid System for the Visually Impaired Using Facial recognition and Haptic Feedback

CapSight: A Social Aid System for the Visually Impaired Usin...

引用

IEEE Global Conference on Consumer Electronics (GCCE)

作者： Chun-Nan Chi Jia-Lien Hsu Chi-Huang Hung Shih-Yung Huang Cheng-Hsuan Chen Chia-Hsun Hsu Graduate Institute of Applied Science and Engineering Fu Jen Catholic University New Taipei City Taiwan R.O.C. Department of Computer Science and Information Engineering Fu Jen Catholic University New Taipei City Taiwan R.O.C. Department of Electrical Engineering National Central University Fu Jen Catholic University Taoyuan City Taiwan R.O.C. Dept. of Information Technology Graduate Institute of Applied Science and Engineering Fu Jen Catholic University Lee-Ming Institute of Technology New Taipei City Taiwan R.O.C. Dept. of International High School Kang Chiao International School New Taipei City Taiwan R.O.C.

ISBN: (数字)9798350355079

ISBN: (纸本)9798350355086

This study introduces "CapSight," a system for enhancing social interaction in visually impaired individuals. It includes a single-board computer, camera, vibration motors, and Bluetooth bone conduction headphones on a baseball cap. The camera identifies people using facial recognition and announces names through the headphones, with vibration motors indicating face positions. Users can add new friends by taking a photo and recording their name. This system helps visually impaired individuals recognize and locate social partners, boosting confidence and independence.

关键词： Vibrations Headphones Electric potential Face recognition Speech recognition Motors Cameras recording Haptic inter.a.es Sports

来源：评论

学校读者我要写书评

暂无评论

Wide-range Angle-sensitive Plasmonic Color Printing on Lossy-resonator Substrates

arXiv

引用

arXiv 2023年

作者： Chowdhury, Sarah N. Simon, Jeffrey Nowak, Michal P. Pagadala, Karthik Nyga, Piotr Fruhling, Colton Bravo, Esteban Garcia Maćkowski, Sebastian Shalaev, Vladimir M. Kildishev, Alexander V. Boltasseva, Alexandra Elmore Family School of Electrical & Computer Engineering Birck Nanotechnology Center Purdue University 1205 W State St West LafayetteIN47906 United States Institute of Optoelectronics Military University of Technology 2 Kaliskiego St Warsaw00-908 Poland Institute of Physics Faculty of Physics Astronomy and Informatics Nicolaus Copernicus University Toruń87-100 Poland Department of Computer Graphics Technology Purdue University 401 N. Grant St Knoy Hall West LafayetteIN47907 United States

We demonstrate a sustainable, lithography-free process for generating non fading plasmonic colors with a prototype device that produces a wide range of vivid colors in red, green, and blue (rGB) ([0-1], [0-1], [0-1]) color space from violet (0.7, 0.72, 1) to blue (0.31, 0.80, 1) and from green (0.84, 1, 0.58) to orange (1, 0.58, 0.46). The proposed color-printing device architecture integrates a semi-transparent random metal film (rMF) with a metal back mirror to cr.a.e a lossy asymmetric Fabry-Pérot resonator. This device geometry allows for.a.vanced control of the observed color through the five-degree multiplexing (rGB color space, angle, and polarization sensitivity). An extended color palette is then obtained through photomodification process and localized heating of the rMF layer under various femtosecond laser illumination conditions at the wavelengths of 400 nm and 800 nm. Colorful design samples with total ar.a. up to 10 mm2 and 100 μm resolution are printed on 300-nm-thick films to demonstrate macroscopic high-resolution color generation. The proposed printing appr.a.h can be extended to other.a.plications including laser marking, anti-counterfeiting and chromo-encryption. © 2023, CC BY.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

LIMOT: A Tightly-Coupled System for LiDAr-Inertial Odometry and Multi-Object Tracking

arXiv

引用

arXiv 2023年

作者： Zhu, Zhongyang Zhao, Junqiao Huang, Kai Tian, Xuebo Lin, Jiaye Ye, Chen Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The MOE Key Lab of Embedded System and Service Computing Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China The School of Surveying and Geo-Informatics Tongji University Shanghai China

Simultaneous localization and mapping (SLAM) is critical to the implementation of autonomous driving. Most LiDAr-inertial SLAM algorithms assume a static environment, leading to unreliable localization in dynamic environments. Moreover, the accurate tracking of moving objects is of gr.a. significance for the control and planning of autonomous vehicles. This study proposes LIMOT, a tightly-coupled multi-object tracking and LiDAr-inertial odometry system that is capable of accurately estimating the poses of both ego-vehicle and objects. We propose a trajectory-based dynamic feature filtering method, which filters out features belonging to moving objects by leveraging tracking results before scan-matching. Factor graph-based optimization is then conducted to optimize the bias of the IMU and the poses of both the ego-vehicle and surrounding objects in a sliding window. Experiments conducted on the KITTI tracking dataset and self-collected dataset show that our method achieves better pose and tracking accuracy than our previous work DL-SLOT and other baseline methods. Our open-source implementation is available at https://***/tiev-tongji/LIMOT. Copyright © 2023, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Network security analysis for signal strength based packet filitering 3

Network security analysis for signal strength based packet f...

引用

3rd Inter.a.ional Conference on Intelligent Sustainable Systems, ICISS 2020

作者： Sundaram, B. Barani rajkumar, P. Ananthi, M. Sravan Kumar, D. Vijaykumar, Janga Karthika, P. Bule Hora University College of Informatics Department of Computer Science Bule hora Ethiopia KGiSL Institute of Technology Dept of Computer Science and Engineering Coimbatore Tamilnadu India Institute of Technology Dept of IT KGiSL Coimbatore Tamilnadu India Balaji Institute of Technology Science Dept of CSE Warangal India Bule Hora University College of Informatics Dept. of Information Technology Bule Hora144 Ethiopia Kalasalingam Academy of Research and Education Department of Computer Applications TamilNadu India

ISBN: (纸本)9781728170893

Signal Strength based position check is all the more encouraging when contrasted with other Sybil assault discovery methods since it is lightweight and doesn't need centralization. Hubs can locally decide their.a.eas through got signal quality varieties and illuminate neighbors about ar.a.refreshes likewise. In position confir.a.ion, network hubs check the situation of every hub and further guarantee that each actual ar.a.is limited by just a single character.a. a specific time. This paper will overview the Sybil assault recognition methods with their connected problem. At last will introduce in thoughts regarding the Sybil assault discovery through one-time restriction (just the passage into or.a.ization) with fundamentally decr.a.es correspondence in the clouds dissimilar to different plans where per parcel ar.a.following or intermittent spr.a. of ar.a.data is utilized to distinguish Sybil assaults. © 2020 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Morphosyntactic Probing of Multilingual BErT Models

arXiv

引用

arXiv 2023年

作者： Acs, Judit Hamerlik, Endre Schwartz, roy Smith, Noah A. Kor.a., Andras Budapest Hungary Budapest University of Technology and Economics Budapest Hungary Department of Applied Informatics Comenius University in Bratislava Faculty of Mathematics Physics and Informatics Bratislava Slovakia Hebrew University of Jerusalem Jerusalem Israel Paul G. Allen School of Computer Science and Engineering University of Washington SeattleWA United States Allen Institute for Artificial Intelligence SeattleWA United States

We introduce an extensive dataset for multilingual probing of morphological infor.a.ion in language models (247 tasks across 42 languages from 10 families), each consisting of a sentence with a target word and a morphological tag as the desired label, derived from the Univer.a. Dependencies treebanks. We find that pre-trained Transformer models (mBErT and XLM-roBEr.a. learn features that attain strong perfor.a.ce across these tasks. We then apply two methods to locate, for each probing task, where the disambiguating infor.a.ion resides in the input. The first is a new pertur.a.ion method that "masks" various parts of context;the second is the classical method of Shapley values. The most intriguing finding that emerges is a strong tendency for the preceding context to hold more infor.a.ion relevant to the prediction than the following context. © 2023, CC BY.

关键词： Pertur.a.ion techniques

来源：评论

学校读者我要写书评

暂无评论

Learning Sequence Descriptor based on Spatio-Temporal Attention for Visual Place recognition

arXiv

引用

arXiv 2023年

作者： Zhao, Junqiao Zhang, Fenglin Cai, Yingfeng Tian, Gengxuan Mu, Wenjie Ye, Chen Feng, Tiantian Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The MOE Key Lab of Embedded System and Service Computing Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China School of Surveying and Geo-Informatics Tongji University Shanghai China

Visual Place recognition (VPr) aims to retrieve frames from a geotagged database that are located at the same place as the query frame. To improve the robustness of VPr in perceptually aliasing scenarios, sequence-based VPr methods are proposed. These methods are either based on matching between frame sequences or extracting sequence descriptors for direct retrieval. However, the former is usually based on the assumption of constant velocity, which is difficult to hold in practice, and is computationally expensive and subject to sequence length. Although the latter overcomes these problems, existing sequence descriptors are constructed by aggregating features of multiple frames only, without interaction on temporal infor.a.ion, and thus cannot obtain descriptors with spatio-temporal discrimination. In this paper, we propose a sequence descriptor that effectively incorporates spatio-temporal infor.a.ion. Specifically, spatial attention within the same frame is utilized to learn spatial feature patterns, while attention in corresponding local regions of different frames is utilized to learn the persistence or change of features over time. We use a sliding window to control the temporal range of attention and use relative positional encoding to construct sequential relationships between different features. This allows our descriptors to capture the intrinsic dynamics in a sequence of frames. Comprehensive experiments on challenging benchmark datasets show that the proposed appr.a.h outperforms recent state-of-the-art methods. The code is available at https://***/tiev-tongji/Spatio-Temporal-SeqVPr. Copyright © 2023, The Authors. All rights reserved.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Prototype Design and Experimental Test for.a.Hydraulic-Driven Soft robotic Arm

引用

Procedia computer Science 2024年 250卷 88-94页

作者： Yu Lei Pengkun Du Minghao Xie Zheng Chen Jason Gu Ocean College Zhejiang University Zhoushan 310058 China Hainan Institute Zhejiang University Sanya 572025 China Leicester International Institute Dalian University of Technology Panjin 124221 China State Key Laboratory of Fluid Power and Mechatronic Systems Zhejiang University Hangzhou 310027 China Department of Electrical and Computer Engineering Dalhousie University Halifax NS B3H 4R2 Canada

Soft robotics has gained considerable attention in recent years for its structural flexibility and inherent safety in environmental interactions. To address the pitfalls of pneumatic actuation systems, namely sluggish response and inefficiencies, this paper introduces the design and fabrication of a Hydraulic-Driven Soft robotic Arm (HDSrA). The study establishes a comprehensive platform that integrates actuation, sensing, and control software to provide an experimental prototype for validating control algorithms. A novel fabrication technique utilizing water-soluble PVA for single-step mold cr.a.ion enhances the structural reliability of soft actuators. Through closed-loop control experiments, the HDSrA demonstrates rapid and precise tracking of 1Hz signals, encompassing sine, square, and ramp waves, thus confirming the platform's reliability. This foundational work lays a robust foundation for future research and the verification of control algorithms in HDSrAs.

关键词： Soft robotics Hydraulic Actuation System Design Sensor Deployment Experimental Testing

来源：评论

学校读者我要写书评

暂无评论

Flexible rate-Splitting Multiple Access for Near-Field Integrated Sensing and Communications

arXiv

引用

arXiv 2024年

作者： Zhou, Jiasi Zhou, Cong Zeng, Cheng Tellambura, Chintha School of Medical Information and Engineering Xuzhou Medical University Xuzhou221004 China School of Electronic and Information Engineering Harbin Institute of Technology Harbin150001 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada

This letter presents a flexible rate-splitting multiple access (rSMA) framework for near-field (NF) integrated sensing and communications (ISAC). The spatial beams configured to meet the communication rate requirements of NF users are simultaneously leveraged to sense an additional NF target. A key innovation lies in its flexibility to select a subset of users for decoding the common str.a., enhancing interference management and system perfor.a.ce. The system is designed by minimizing the Cramér-rao bound (CrB) for joint distance and angle estimation through optimized power.a.location, common rate allocation, and user selection. This leads to a discrete, non-convex optimization problem. remar.a.ly, we demonstrate that the preconfigured beams are sufficient for target sensing, eliminating the need for.a.ditional probing signals. To solve the optimization problem, an iterative algorithm is proposed combining the quadratic transform and simulated annealing. Simulation results indicate that the proposed scheme significantly outperforms conventional rSMA and space division multiple access (SDMA), reducing distance and angle estimation errors by approximately 100% and 20%, respectively. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Data Synchronization for Vehicular Digital Twin Network

Data Synchronization for Vehicular Digital Twin Network

引用

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

作者： Xiaoqing Yang Jinkai Zheng Tom H. Luan rui Li Zhou Su Mianxiong Dong School of Cyber Engineering Xidian University Shaanxi China School of Computer Science and Technology Xidian University Xian Shaanxi China School of Cyber Science and Engineering Xi'an Jiaotong University Xian Shaanxi China Department of Sciences and Informatics Muroran Institute of Technology Muroran City Japan

ISBN: (纸本)9781665435413

This paper considers the downlink data synchronization from the digital twin (DT) to the vehicle, in which a vehicle drives through consecutive r.a.side units (rSUs) along its trip, and the DT on the cloud transmits the data to the vehicle through the relay of rSUs. To this goal, the DT first chops the data into blocks and cache them in the rSUs along the driving path of the vehicle. The vehicle can then retrieve the blocks when driving into the rSU's coverage to recover the data. Since rSUs have different cache capacities and communication costs, the DT needs to determine how to optimally distribute the data blocks at rSUs so that vehicles can finish downloading all the data before the deadline yet with the minimal cost. To determine the optimal delivery strategy of DT, we model the problem as an optimization framework subject to the time-varying wireless channel of rSUs, their service load and the communication cost. We then resort to the Lyapunov optimization to derive a distributed solution. Using extensive simulation results, we demonstrate that our scheme can effectively reduce the cost of data synchronization and improve the network load perfor.a.ce.

关键词： Wireless communication Costs Simulation Stability analysis Digital twins Synchronization Data communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：