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

International Conference on Advanced Communications and Machine Intelligence, MICA 2023

作者： Ganguly, Tanudeep Sharma, Sushmita Deb, Suman Ezugwu, Absalom El-Shamir Saha, Apu Kumar Department of Computer Science and Engineering National Institute of Technology Agartala Tripura Agartala India Department of Computer Science and Engineering Indian Institute of Information Technology Agartala Tripura Agartala India Unit for Data Science and Computing North-West University Potchefstroom2520 South Africa

ISBN: (纸本)9789819762217

This research elaborates a melody synthesis model utilizing a Modified Long Short-Term Memory (mLSTM) neural network, trained on Kern dataset, preprocessed into Musical Instrument Digital Interface (MIDI) files. After receiving a seed melody as input 01, the model predicts the note that will come next by looking at the notes that have come before it. The model can learn the structures and patterns seen in classical music by using MIDI files as the training dataset. Categorical cross-entropy loss function is used to train the model over several epochs with early halting. To regulate how random the predictions are, the model makes use of a temperature parameter. The assessment demonstrates that the produced tunes have a variety of traits and are aesthetically pleasing to human ears. To justify the performance of the proposed method some criteria were considered and expert evaluation was done. The evaluation shows that the model has generated the melodies that are pleasing to the ear and have a similar structure to the training dataset. The model has several uses, including prediction and music composition. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Matching Knowledge Graphs in Entity Embedding Spaces: An Experimental Study [Extended Abstract] 40

Matching Knowledge Graphs in Entity Embedding Spaces: An Exp...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zeng, Weixin Zhao, Xiang Tan, Zhen Tang, Jiuyang Cheng, Xueqi National University of Defense Technology Laboratory for Big Data and Decision China National University of Defense Technology Science and Technology on Information Systems Engineering Laboratory China Institute of Computing Technology CAS China

ISBN: (纸本)9798350317152

Entity alignment (EA) identifies equivalent entities that locate in different knowledge graphs (KGs), and has attracted growing research interests over the last few years with the advancement of KG embedding techniques. Although a pile of embedding-based EA frameworks have been developed, they mainly focus on improving the performance of entity representation learning, while largely overlook the subsequent stage that matches KGs in entity embedding spaces. Nevertheless, accurately matching entities based on learned entity representations is crucial to the overall alignment performance, as it coordinates individual alignment decisions and determines the global matching result. Hence, it is essential to understand how well existing solutions for matching KGs in entity embedding spaces perform on present benchmarks, as well as their strengths and weaknesses. To this end, in this article we provide a comprehensive survey and evaluation of matching algorithms for KGs in entity embedding spaces in terms of effectiveness and efficiency on both classic settings and new scenarios that better mirror real-life challenges. Based on in-depth analysis, we provide useful insights into the design trade-offs and good paradigms of existing works, and suggest promising directions for future development. © 2024 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

CeTrivium:A Stream Cipher Based on Cellular Automata for Securing Real-Time Multimedia Transmission

引用

Computer Systems science & Engineering 2023年第12期47卷 2895-2920页

作者： Osama S.Younes Abdulmohsen Alharbi Ali Yasseen Faisal Alshareef Faisal Albalawi Umar A.Albalawi Faculty of Computer and Information Technology University of TabukTabuk71491Saudi Arabia Faculty of Computers and Information Menoufia UniversityMenoufia13829Egypt School of Computing&Data Science Wentworth Institute of TechnologyBoston02115USA

Due to their significant correlation and redundancy,conventional block cipher cryptosystems are not efficient in encryptingmultimedia *** based onCellularAutomata(CA)can provide amore effective *** CA have recently gained recognition as a robust cryptographic primitive,being used as pseudorandom number generators in hash functions,block ciphers and stream *** have the ability to perform parallel transformations,resulting in high throughput ***,they exhibit a natural tendency to resist fault *** stream cipher schemes based on CA have been proposed in the ***,their encryption/decryption throughput is relatively low,which makes them unsuitable formultimedia *** and Grain are efficient stream ciphers that were selected as finalists in the eSTREAM project,but they have proven to be vulnerable to differential fault *** work introduces a novel and scalable stream cipher named CeTrivium,whose design is based on *** is a 5-neighborhood CA-based streamcipher inspired by the designs of Trivium and *** is constructed using three building blocks:the Trivium(Tr)block,the Nonlinear-CA(NCA)block,and the Nonlinear Mixing(NM)*** NCA block is a 64-bit nonlinear hybrid 5-neighborhood CA,while the Tr block has the same structure as the Trivium stream *** NM block is a nonlinear,balanced,and reversible Boolean function that mixes the outputs of the Tr and NCA blocks to produce a *** of CeTrivium has indicated that it can resist various attacks,including correlation,algebraic,fault,cube,Meier and Staffelbach,and side channel ***,the scheme is evaluated using histogramand spectrogramanalysis,aswell as several differentmeasurements,including the correlation coefficient,number of samples change rate,signal-to-noise ratio,entropy,and peak signal-to-noise *** performance of CeTrivium is evaluated and compared with other state-of-

关键词： Stream ciphers cellular automata securing real-time streaming cryptography CeTrivium

来源：评论

学校读者我要写书评

暂无评论

Cloud Intrusion Detection System Based on Honeynet, Honeywell, Honeypot, and Honeytoken Strategies

Cloud Intrusion Detection System Based on Honeynet, Honeywel...

引用

International Conference on data science and Network Engineering, ICDSNE 2023

作者： Yasotha, B. Arthy, M. Shoba, L.K. Loganathan, Muralidaran Department of Data Science and Business Systems SRM Institute of Science and Technology Kattankulathur Tamil Nadu India Department of Computing Technologies SRM Institute of Science and Technology Kattankulathur Tamil Nadu India Computer Science and Information Systems Engineering St. Joseph University Dares Salaam Tanzania United Republic of

ISBN: (纸本)9789819967544

The security aspect of cloud computing is much more challenging for researchers. Preventing the attack requires knowledge about the type of attack, its origin, and how vulnerabilities and tools are used for the attack. The cloud security methodology protects customer data, information, and applications from attackers. Due to digitalization, the volume of data is increased. The protection of data is very challenging for cloud service providers. This work proposes a new cloud intrusion detection system security infrastructure based on Honeynet, Honeywell, Honeypot, and Honeytoken Strategies. The proposed strategy effectively identifies intrusion detection, attack behavior, and attack scenario. The testing of data was carried out in OpenStack environments. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Clause-level Relationship-aware Math Word Problems Solver

引用

Machine Intelligence Research 2022年第5期19卷 425-438页

作者： Chang-Yang Wu Xin Lin Zhen-Ya Huang Yu Yin Jia-Yu Liu Qi Liu Gang Zhou Anhui Province Key Laboratory of Big Data Analysis and Application School of Data ScienceUniversity of Science and Technology of ChinaHefei 230026China Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei 230088China Laboratory of Mathematical Engineering and Advanced Computing Information Engineering UniversityZhengzhou 450001China

Automatically solving math word problems,which involves comprehension,cognition,and reasoning,is a crucial issue in artificial intelligence *** math word problem solvers mainly work on word-level relationship extraction and the generation of expression solutions while lacking consideration of the clause-level *** this end,inspired by the theory of two levels of process in comprehension,we propose a novel clause-level relationship-aware math solver(CLRSolver)to mimic the process of human comprehension from lower level to higher ***,in the lower-level processes,we split problems into clauses according to their natural division and learn their *** the higher-level processes,following human′s multi-view understanding of clause-level relationships,we first apply a CNN-based module to learn the dependency relationships between clauses from word relevance in a local ***,we propose two novel relationship-aware mechanisms to learn dependency relationships from the clause semantics in a global ***,we enhance the representation of clauses based on the learned clause-level dependency *** expression generation,we develop a tree-based decoder to generate the mathematical *** conduct extensive experiments on two datasets,where the results demonstrate the superiority of our framework.

关键词： Artificial intelligence(AI) artificial neural network(ANN) computational mathematics machine intelligence machine learning

来源：评论

学校读者我要写书评

暂无评论

Non-Intrusive Load Monitoring for Feeder-Level EV Charging Detection: Sliding Window-Based Approaches to Offline and Online Detection 7

Non-Intrusive Load Monitoring for Feeder-Level EV Charging D...

引用

7th IEEE Conference on Energy Internet and Energy System Integration, EI2 2023

作者： Martin, Cameron Ke, Fucai Wang, Hao Monash University Faculty of Information Technology Department of Human Centred Computing Australia Monash University Faculty of Information Technology Department of Data Science and Ai Australia Monash Energy Institute Monash University Australia

ISBN: (纸本)9798350345094

Understanding electric vehicle (EV) charging on the distribution network is key to effective EV charging management and aiding decarbonization across the energy and transport sectors. Advanced metering infrastructure has allowed distribution system operators and utility companies to collect high-resolution load data from their networks. These advancements enable the non-intrusive load monitoring (NILM) technique to detect EV charging using load measurement data. While existing studies primarily focused on NILM for EV charging detection in individual households, there is a research gap on EV charging detection at the feeder level, presenting unique challenges due to the combined load measurement from multiple households. In this paper, we develop a novel and effective approach for EV detection at the feeder level, involving sliding-window feature extraction and classical machine learning techniques, specifically models like XGBoost and Random Forest. Our developed method offers a lightweight and efficient solution, capable of quick training. Moreover, our developed method is versatile, supporting both offline and online EV charging detection. Our experimental results demonstrate high-accuracy EV charging detection at the feeder level, achieving an F-Score of 98.88% in offline detection and 93.01% in online detection. © 2023 IEEE.

关键词： Electric power distribution

来源：评论

学校读者我要写书评

暂无评论

Exploring the Impact of IoT data Diversity on Machine Learning Model 5

Exploring the Impact of IoT Data Diversity on Machine Learni...

引用

5th International Conference on Sustainable Communication Networks and Application, ICSCNA 2024

作者： Bisen, Dhananjay Venu, Nookala Dubey, Aditya Garg, Priyanka Salendra, Suresh Devi, T. Lakshmi Madhav Institute of Technology & Science Center for Internet of Things M.P Gwalior474 005 India ABV Indian Institute of Information Technology and Management Data Science and Quantum Computing M.P Gwalior474 015 India Balaji Institute of Technology & Science Dept. of Compter Science and Engineering Telangana Warangal506 331 India Siddhartha Institute of Engineering and Technology Dept.of CSE-Data Science Hyderabad501506 India

ISBN: (纸本)9798331530013

The past few years have witnessed a remarkable change by the rapid expansion of the Internet of Things (IoT). The increasing spread of networked devices in various areas of the Internet of Things has resulted in a huge amount of machine data. This data contains rich information that can be harnessed across domains such as healthcare, agriculture, smart cities, and manufacturing. To effectively analyze and capitalize this information, the integration of machine learning (ML) methods is essential. Thus, well-known machine learning techniques including Logistic Regression, Decision Tree, KNN, SVM, Random Forest, and Naive Bayes are used in paper. The performance of the algorithms is analyzed using three diverse IoT datasets and compared to one another using pre-defined measures such as accuracy, precision, recall, F1-score and execution time. Furthermore, test findings shown that the random forest algorithm consistently outperformed other algorithms for a variety of datasets with up to 98% accuracy. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

RNTrajRec: Road Network Enhanced Trajectory Recovery with Spatial-Temporal Transformer 39

RNTrajRec: Road Network Enhanced Trajectory Recovery with Sp...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Chen, Yuqi Zhang, Hanyuan Sun, Weiwei Zheng, Baihua Fudan University School of Computer Science Shanghai Key Laboratory of Data Science China Shanghai Institute of Intelligent Electronics & Systems China Singapore Management University School of Computing and Information Systems Singapore

ISBN: (纸本)9798350322279

GPS trajectories are the essential foundations for many trajectory-based applications. Most applications require a large number of high sample rate trajectories to achieve a good performance. However, many real-life trajectories are collected with low sample rate due to energy concern or other constraints. We study the task of trajectory recovery in this paper as a means to increase the sample rate of low sample trajectories. Most existing works on trajectory recovery follow a sequence-to-sequence diagram, with an encoder to encode a trajectory and a decoder to recover real GPS points in the trajectory. However, these works ignore the topology of road network and only use grid information or raw GPS points as input. Therefore, the encoder model is not able to capture rich spatial information of the GPS points along the trajectory, making the prediction less accurate and less spatial consistent. In this paper, we propose a road network enhanced transformer-based framework, namely RNTrajRec, for trajectory recovery. RNTrajRec first uses a graph model, namely GridGNN, to learn the embedding features of each road segment. It next develops a spatial-temporal transformer model, namely GPSFormer, to learn rich spatial and temporal features along with a Sub-Graph Generation module to capture the spatial features for each GPS point in the trajectory. It finally forwards the outputs of encoder model to a multi-task decoder model to recover the missing GPS points. Extensive experiments based on three large-scale real-life trajectory datasets confirm the effectiveness of our approach. © 2023 IEEE.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Boosting Meaningful Dependency Mining with Clustering and Covariance Analysis 40

Boosting Meaningful Dependency Mining with Clustering and Co...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Wang, Xi Jin, Ruochun Huang, Wanrong Tang, Yuhua Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China College of Computer Science and Technology Department of Intelligent Data Science National University of Defense Technology Changsha China

ISBN: (纸本)9798350317152

Functional dependencies (FDs) form a valuable ingredient for various data management tasks. However, existing methods can hardly discover practical and interpretable FDs, especially in large noisy real-life datasets. This paper studies the problem of discovering meaningful functional dependencies (FDms) that utilize support and error parameters to capture interesting dependencies in such datasets and proposes an efficient discovery algorithm called FDM?. In order to scale with large datasets, FDM ? employs an efficient sampling method with accuracy guarantees to capture the differences between tuple pairs and to quantify the connection between support/error of dependencies on samples and those on the entire dataset. Moreover, it adopts a clustering-based correlated attributes extraction to divide the exponentially large search space into multiple small sub-spaces and proposes an easy-first traversal strategy with covariance-based guidance that quickly detects candidate dependencies and validates them. Additionally, we prove a covariance lower bound as an additional pruning criterion to reduce the search space. Extensive experiments on real-life and synthetic datasets demonstrate that FDM ? is 14 times faster than existing discovery algorithms on average, up to 31 times, and scales to larger datasets with the least memory cost. © 2024 IEEE.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：