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

Proceedings of the 41st International Conference on Machine Learning

作者： Duy Le Shaochen (Henry) Zhong Zirui Liu Shuai Xu Vipin Chaudhary Kaixiong Zhou Zhaozhuo Xu Department of Computer and Data Sciences Case Western Reserve University Department of Computer Science Rice University Department of Electrical and Computer Engineering North Carolina State University Department of Computer Science Stevens Institute of Technology

Knowledge Graphs (KGs) are potent frameworks for knowledge representation and reasoning. Nevertheless, KGs are inherently incomplete, leaving numerous uncharted relationships and facts awaiting discovery. Deep learning methodologies have proven effective in enhancing KG completion by framing it as a link prediction task, where the goal is to discern the validity of a triple comprising a head, relation, and tail. The significance of structural information in assessing the validity of a triple within a KG is well-established. However, quantifying this structural information poses a challenge. We need to pinpoint the metric that encapsulates the structural information of a triple and smoothly incorporate this metric into the link prediction learning process. In this study, we recognize the critical importance of the intersection among the k-hop neighborhoods of the head, relation, and tail when determining the validity of a triple. To address this, we introduce a novel randomized algorithm designed to efficiently generate intersection features for candidate triples. Our experimental results demonstrate that a straightforward fully-connected network leveraging these intersection features can surpass the performance of established KG embedding models and even outperform graph neural network baselines. Additionally, we highlight the substantial training time efficiency gains achieved by our network trained on intersection features.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A third-party platoon coordination service: Pricing under government subsidies

A third-party platoon coordination service: Pricing under go...

引用

作者： Bai, Ting Johansson, Alexander Li, Shaoyuan Johansson, Karl Henrik Mårtensson, Jonas School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden KTH Royal Institute of Technology Stockholm Sweden Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Digital Futures Stockholm Sweden

This paper models a platooning system consisting of trucks and a third-party service provider (TPSP), which performs platoon coordination, distributes the platooning profit in platoons, and charges trucks in exchange for the services. Government subsidies used to incentivize platooning are also considered. We propose a pricing rule for the TPSP, which keeps part of the platooning profit including the subsidy each time a platoon is formed. In addition, a platoon coordination solution based on the distributed model predictive control (MPC) is proposed, in which the pricing rule under government subsidies is integrated. We perform a realistic simulation over the Swedish road network to evaluate the impact of the pricing rule and subsidies on the achieved profits and fuel savings. Our results show that subsidies are an effective mean to boost fuel savings from platooning. Moreover, the simulation study indicates that high pricing corresponds to a low platooning rate of the system, as trucks' incentives for platooning decrease. © 2023 The Authors. Asian Journal of Control published by John Wiley & Sons Australia, Ltd on behalf of Chinese Automatic Control Society.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

A New Partial Task Offloading Method in a Cooperation Mode under Multi-Constraints for Multi-UE

引用

computers, Materials & Continua 2023年第9期76卷 2879-2900页

作者： Shengyao Sun Ying Du Jiajun Chen Xuan Zhang Jiwei Zhang Yiyi Xu School of Information Science and Technology Zhengzhou Normal UniversityZhengzhou450044China Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng475004China School of Geography and Tourism Zhengzhou Normal UniversityZhengzhou450044China Science and Engineering College South China University of TechnologyGuangzhou510641China Department of Electrical and Electronic Engineering Luohe Vocational Technology CollegeLuohe462002China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing100876China Cardiff School of Engineering Cardiff UniversityCardiffCF103XQ 15UK

In Multi-access Edge Computing(MEC),to deal with multiple user equipment(UE)’s task offloading problem of parallel relationships under the multi-constraints,this paper proposes a cooperation partial task offloading method(named CPMM),aiming to reduce UE’s energy and computation consumption,while meeting the task completion delay as much as *** first studies the task offloading of single-UE and then considers the task offloading ofmulti-UE based on single-UE task *** the critical path algorithmto divide the modules into key and non-key *** to some constraints of UE-self when offloading tasks,it gives priority to non-key modules for offloading and uses the evaluation decision method to select some appropriate key modules for *** on fully considering the competition between multiple UEs for communication resources and MEC service resources,CPMM uses the weighted queuing method to alleviate the competition for communication resources and uses the branch decision algorithm to determine the location of module offloading by BS according to the MEC servers’*** achieves its goal by selecting reasonable modules to offload and using the cooperation ofUE,MEC,andCloudCenter to determine the execution location of *** experiments demonstrate that CPMM obtains superior performances in task computation consumption reducing around 6%on average,task completion delay reducing around 5%on average,and better task execution success rate than other similar methods.

关键词： MEC partial task offloading parallel dependencies completion delay

来源：评论

学校读者我要写书评

暂无评论

Towards Seamless Connectivity: Implementing 6G Communication Technologies in Next-Generation Networks 3

Towards Seamless Connectivity: Implementing 6G Communication...

引用

3rd International Conference for Advancement in Technology, ICONAT 2024

作者： Kalaiselvi, K. Sankar, R. Supriya, S. Kaushik, G. Swamy, Hemanth Devika, M. Saveetha College of Liberal Arts and Sciences SIMATS Department of Data Analytics Tamilnadu Chennai India Chennai Institute of Technology Department of Electrical and Electronics Engineering Tamil Nadu Chennai India Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Department of Computer Science and Engineering Tamil Nadu Chennai India MLR Institute of Technology Department of Electronics and Communication Engineering Hyderabad India Motorola Solutions United States Dhanalakshmi College of Engineering Department of AI& DS Tamil Nadu Chennai India

ISBN: (纸本)9798350354171

Advanced wireless networks are essential given the increase in demand for smart services enabled by the Internet of Everything (IoE). Despite the fact that 5G networks could enable Internet of Everything (IoE)-based services, they can't meet all of the requirements needed to create intelligent applications. In order to overcome the shortcomings of the current infrastructure, there is an increasing demand to investigate the potential of 6G wireless communication technologies. Complex network optimization problems can be resolved by integrating artificial intelligence into sixth generation networks. An increasing user base and support for large-scale data-driven applications are essential given the fast evolving 6G landscape. In addition to highlighting network needs, critical supporting technologies, and a comparison of 5G and 6G networks, this study looks at recent advancements and trends in 6G technology. The report also explores new approaches to 6G connectivity, such as edge computing, backscatter communications, AI-driven IoT networks, and holographic beamforming, all of which are meant to support intelligent communities. In order to achieve the goal of 6Gbased IoT networks, it concludes by outlining potential research avenues. © 2024 IEEE.

关键词： Internet of Everything

来源：评论

学校读者我要写书评

暂无评论

Transductive - Long Short-Term Memory Network for the Fake News Detection 3

Transductive - Long Short-Term Memory Network for the Fake N...

引用

3rd IEEE International Conference on Distributed Computing and electrical Circuits and Electronics, ICDCECE 2024

作者： Pillai, Sanjaikanth E Vadakkethil Somanathan Avacharmal, Rajiv Reddy, R. Archana Pareek, Piyush Kumar Zanke, Pankaj School Of Electrical Engineering And Computer Science University Of North Dakota Grand Forks United States Center For Data Science And Artificial Intelligence New York Life Insurance Company Farmington HillsMI United States School Of Computer Science And Engineering Sr University Telangana Warangal India Nitte Meenakshi Institute Of Technology Department Of Aiml And Ipr Cell Bengaluru India Sapiens International Corporation United States

ISBN: (纸本)9798350318609

Recently, fake news and rumors are distributing majorly and rapidly in all over world. That circumstance causes the production and propagation of incorrect news articles. As well as mis data and fake news are maximized through user without correct verification. In this manuscript, proposed a Transductive - Long Short-Term Memory (T-LSTM) method for detecting fake news. The Buzzfeed and ISOT datasets are used in this manuscript for fake news detection and it is pre-processed by tokenization, removal of stop word and stemming. Then, the reduction of feature is performed by using Probability Principal Component Analysis (PPCA) and it is classified by using T-LSTM method. The proposed T-LSTM method attained accuracy 96.51 %, precision 94.64 %, recall 92.33 % and f1-score 93.57% on Buzzfeed dataset. The proposed T-LSTM method attained accuracy 98.43%, precision 97.76%, recall 97.02% and f1-score 97.35% on ISOT dataset. The proposed T-LSTM method performed well than other existing methods like LSTM -Levy Flight (LSTM-LF) and OptNet. © 2024 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Modular Extremely Large-Scale Array Communication:Near-Field Modelling and Performance Analysis

引用

China Communications 2023年第4期20卷 132-152页

作者： Xinrui Li Haiquan Lu Yong Zeng Shi Jin Rui Zhang National Mobile Communications Research Laboratory Frontiers Science Center for Mobile Information Communication and SecuritySoutheast UniversityNanjing 210096China Purple Mountain Laboratories Nanjing 211111China The Chinese University of Hong Kong Shenzhen Research Institute of Big DataShenzhen 518172China Department of Electrical and Computer Engineering National University of SingaporeSingapore 117583Singapore

This paper investigates the wireless communication with a novel architecture of antenna arrays,termed modular extremely large-scale array(XLarray),where array elements of an extremely large number/size are regularly mounted on a shared platform with both horizontally and vertically interlaced *** module consists of a moderate/flexible number of array elements with the inter-element distance typically in the order of the signal wavelength,while different modules are separated by the relatively large inter-module distance for convenience of practical *** accurately modelling the signal amplitudes and phases,as well as projected apertures across all modular elements,we analyse the near-field signal-to-noise ratio(SNR)performance for modular XL-array *** on the non-uniform spherical wave(NUSW)modelling,the closed-form SNR expression is derived in terms of key system parameters,such as the overall modular array size,distances of adjacent modules along all dimensions,and the user's three-dimensional(3D)*** addition,with the number of modules in different dimensions increasing infinitely,the asymptotic SNR scaling laws are ***,we show that our proposed near-field modelling and performance analysis include the results for existing array architectures/modelling as special cases,e.g.,the collocated XL-array architecture,the uniform plane wave(UPW)based far-field modelling,and the modular extremely large-scale uniform linear array(XL-ULA)of *** simulation results are presented to validate our findings.

关键词： modular extremely large-scale array practical deployment projected apertures non-uniform spherical wave near-field modelling

来源：评论

学校读者我要写书评

暂无评论

A global geometric analysis of maximal coding rate reduction 24

A global geometric analysis of maximal coding rate reduction

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Peng Wang Huikang Liu Druv Pai Yaodong Yu Zhihui Zhu Qing Qu Yi Ma Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor Antai College of Economics and Management Shanghai Jiao Tong University Shanghai Department of Electrical Engineering and Computer Science University of California Berkeley Department of Computer Science and Engineering The Ohio State University Columbus Department of Electrical Engineering and Computer Science University of California Berkeley and Institute of Data Science University of Hong Kong

The maximal coding rate reduction (MCR2) objective for learning structured and compact deep representations is drawing increasing attention, especially after its recent usage in the derivation of fully explainable and highly effective deep network architectures. However, it lacks a complete theoretical justification: only the properties of its global optima are known, and its global landscape has not been studied. In this work, we give a complete characterization of the properties of all its local and global optima, as well as other types of critical points. Specifically, we show that each (local or global) maximizer of the MCR2 problem corresponds to a low-dimensional, discriminative, and diverse representation, and furthermore, each critical point of the objective is either a local maximizer or a strict saddle point. Such a favorable landscape makes MCR2 a natural choice of objective for learning diverse and discriminative representations via first-order optimization methods. To validate our theoretical findings, we conduct extensive experiments on both synthetic and real data sets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Performance Analysis of Daffier-Hellman Key Exchange Algorithm for Secure Transmission of data in Cryptography Networks 3

The Performance Analysis of Daffier-Hellman Key Exchange Alg...

引用

3rd International Conference on Smart Generation Computing, Communication and Networking, SMART GENCON 2023

作者： Ahmad, Arsalan Sakhare, Nitin N. Mondal, Dipannita Vigenesh, M. Indira, G. Futane, Pravin R. Mangalayatan University Department of Management Aligarh India Vishwakarma Institute of Information Technology Department of Computer Engineering Pune India Dr. D.Y. Patil College of Engineering and Innovation Artificial Intelligence and Data Science Department Talegaon India Karpagam Academy of Higher Education Department of Computer Science Engineering Coimbatore India Prince Shri Venkateshwara Padmavathy Engineering College Department of Electrical and Electronics Engineering Chennai India Vishwakarma Institute of Information Technology Department of Information Technology Pune India

ISBN: (纸本)9798350319125

This paper examines the overall performance of the Daffier-Hellman key trade algorithm for the relaxed transmission of data in cryptography networks. Two types of Daffier-Hellman key exchanges are considered: the traditional scheme without elliptic curves and the current model utilizing elliptic curves. The parameters and their respective performance of both schemes are compared. In addition, it is located that the elliptic curve-primarily based Daffier-Hellman set of rules offers better overall performance than the conventional one, with better security and a drastically shorter key-status quo time. An in-depth analysis of the velocity and protection of both algorithms is supplied. The consequences of the have look indicate that the elliptic curve model of DaffierHellman is the fine-acting set of rules for secure records switches in cryptography networks. Moreover, the paper additionally discusses the safety problems and challenges arising from implementing the Daffier-Hellman key trade algorithm and indicates some possible solutions. Ultimately, the paper also offers an end on the overall performance of DaffierHellman Key's alternate set of rules regarding pace, safety, and reliability. © 2023 IEEE.

关键词： algorithm consequences performance possible safety

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Approach for MIDI to Guitar Tablature Conversion 19

A Machine Learning Approach for MIDI to Guitar Tablature Con...

引用

19th Sound and Music Computing Conference, SMC 2022

作者： Kaliakatsos-Papakostas, Maximos Bastas, Grigoris Makris, Dimos Herremans, Dorrien Katsouros, Vassilis Maragos, Petros Institute for Language and Speech Processing Athena R.C. Athens Greece School of Electrical and Computer Engineering NTUA Athens Greece Department of Computer Science and Design Pillar SUTD Singapore

ISBN: (纸本)9782958412609

Guitar tablature transcription consists in deducing the string and the fret number on which each note should be played to reproduce the actual musical part. This assignment should lead to playable string-fret combinations throughout the entire track and, in general, preserve parsimonious motion between successive combinations. Throughout the history of guitar playing, specific chord fingerings have been developed across different musical styles that facilitate common idiomatic voicing combinations and motion between them. This paper presents a method for assigning guitar tablature notation to a given MIDI-based musical part (possibly consisting of multiple polyphonic tracks), i.e. no information about guitar-idiomatic expressional characteristics is involved (e.g. bending etc.) The current strategy is based on machine learning and requires a basic assumption about how much fingers can stretch on a fretboard;only standard 6-string guitar tuning is examined. The proposed method also examines the transcription of music pieces that was not meant to be played or could not possibly be played by a guitar (e.g. potentially a symphonic orchestra part), employing a rudimentary method for augmenting musical information and training/testing the system with artificial data. The results present interesting aspects about what the system can achieve when trained on the initial and augmented dataset, showing that the training with augmented data improves the performance even in simple, e.g. monophonic, cases. Results also indicate weaknesses and lead to useful conclusions about possible improvements. Copyright: © 2022 First author et al.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Adversarial Discriminative Domain Adaptation and Transformers for EEG-based Cross-Subject Emotion Recognition

Adversarial Discriminative Domain Adaptation and Transformer...

引用

International IEEE/EMBS Conference on Neural engineering, CNE

作者： Shadi Sartipi Mujdat Cetin Department of Electrical and Computer Engineering University of Rochester Rochester USA Department of Electrical and Computer Engineering Goergen Institute for Data Science University of Rochester Rochester USA

Decoding the human emotional states based on electroencephalography (EEG) in affective brain-computer interfaces (BCI) is a great challenge due to inter-subject variability. Existing methods mostly use large amounts of EEG data of each new subject to calibrate the algorithm, which could be time-consuming and not user-oriented. To address this issue, we propose a combination of using transformers (TF) and adversarial discriminative domain adaptation (ADDA) to perform the emotion recognition task in a cross-subject manner. TF principally relies on the attention mechanism. Our proposed approach performs scaledot product attention on the feature-channel aspect of EEG data to improve the spatial features. Then, the temporal transforming is applied to get the global discriminative representations from the time component. Moreover, ADDA aims to minimize the discrepancy of EEG data from various subjects. We evaluate the proposed ADDA-TF on the publicly available DEAP dataset and demonstrate the improvements it provides on low versus high valence and arousal classification.

关键词： Emotion recognition Neural engineering Transformers Electroencephalography Brain-computer interfaces Decoding Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：