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

arXiv 2024年

作者： Huang, Keke Wang, Yu Guang Li, Ming Liò, Pietro School of Computing National University of Singapore Singapore Institute of Natural Sciences School of Mathematical Sciences Zhangjiang Institute for Advanced Study Shanghai Jiao Tong University Shanghai China Shanghai AI Laboratory Shanghai China School of Mathematics and Statistics University of New South Wales Sydney Australia Zhejiang Institute of Optoelectronics Jinhua China Zhejiang Key Laboratory of Intelligent Education Technology and Application Zhejiang Normal University Jinhua China Department of Computer Science and Technology Cambridge University Cambridge United Kingdom

Spectral Graph Neural Networks (GNNs), alternatively known as graph filters, have gained increasing prevalence for heterophily graphs. Optimal graph filters rely on Laplacian eigendecomposition for Fourier transform. In an attempt to avert prohibitive computations, numerous polynomial filters have been proposed. However, polynomials in the majority of these filters are predefined and remain fixed across different graphs, failing to accommodate the varying degrees of heterophily. Addressing this gap, we demystify the intrinsic correlation between the spectral property of desired polynomial bases and the heterophily degrees via thorough theoretical analyses. Subsequently, we develop a novel adaptive heterophily basis wherein the basis vectors mutually form angles reflecting the heterophily degree of the graph. We integrate this heterophily basis with the homophily basis to construct a universal polynomial basis UniBasis, which devises a polynomial filter-based graph neural network – UniFilter. It optimizes the convolution and propagation in GNN, thus effectively limiting over-smoothing and alleviating over-squashing. Our extensive experiments, conducted on datasets with a diverse range of heterophily, support the superiority of UniBasis in the universality but also its proficiency in graph explanation. © 2024, CC BY-NC-SA.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Decentralized and Lightweight Cross-Chain Transaction Scheme Based on Proxy Re-signature

Decentralized and Lightweight Cross-Chain Transaction Scheme...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Huiying Zou Jia Duan Xi Liu Wei Ren Tao Li Xianghan Zheng Kim-Kwang Raymond Choo School of Computer Science China University of Geosciences Wuhan China The Third Surveying and Mapping Institute of Hunan Province Hunan Engineering Research Center of Geographic Information Security and Application Hunan China Key Laboratory of Data Protection and Intelligent Management Sichuan University Ministry of Education China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China College of Computer and Big Data Fuzhou University School of Information and Intelligent Engineering Sanya College China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio USA

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

With the widespread application of digital assets and the rapid development of blockchain technology, achieving secure and efficient transactions between different blockchain networks has become an urgent challenge. Existing cross-chain methods impose limitations, e.g., hash lock technology exhibits low scalability, side-chain technology is overly complex, and notary schemes pose centralization risks. In order to address these issues, we propose a cross-chain transaction solution based on proxy re-signature technology. To tackle the centralization concerns, we employ proxy re-signature technology to decentralize the authority of notaries among transaction participants, minimizing the potential for centralization at a low cost. We further present an extended scheme that can guarantee more requirements such as higher transaction amount and shorter transaction time. Furthermore, we analyze and compare the signature technologies used in the proposed solution and provide a systematic proof of our approach’s security.

关键词： Privacy Systematics Costs Scalability Blockchains Security

来源：评论

学校读者我要写书评

暂无评论

Enhancement of Channel Capacity in 5G Ultra Dense Network-UDN

Enhancement of Channel Capacity in 5G Ultra Dense Network-UD...

引用

International Conference on Edge Computing and applications (ICECAA)

作者： Ritesh Rastogi T. Shanthi Pramod Kumar Naik M. Sahaya Sheela A.K Mishra Nandhini T J Department of IT and CS M.Tech(Int) Noida Institute of Engineering and Technology Delhi India Department of ECE Paavai Engineering College Chennai India Departmeny of Computer Science Engineering Dayananda Sagar University Bangalore India Department of ECE Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology Chennai India Math Unit Foundation Program Dhofar University Salalah Oman Saveetha School of Engineering Saveetha Institute of Medical and Technical Science - (SIMATS) Chennai India

A 5G ultra dense network architecture makes use of a high density of micro cell base stations to provide increased coverage, capacity, and performance for 5G communication systems. This is accomplished by the utilization of a very densely packed network. A 5G ultradense network is another name for this particular category of network. Ultradense networks are built to overcome the limitations of ordinary cellular networks. This is accomplished by increasing the number of base stations that are located inside a given area. This is performed by reducing the coverage area provided by each base station, which ultimately leads to an increase in the capacity of the entire network. The maximum data rate or capacity that may be obtained through a certain wireless channel is referred to as the “channel capacity” in a 5G ultradense network, when the phrase “channel capacity” is used. One possibility is that this represents the maximum quantity of data that can be transmitted across the channel. These criteria, which represent the capabilities of the channel, can be used to evaluate the performance of channels and equipment on 5G networks. This article presents for further research a model for improving the channel capacity of the 5G ultradense network. The model can be found at the end of the article. This change will result in an increase in both the usefulness of the channel and the amount of bandwidth that it consumes; both of these aspects will improve. The fact that it uses a very small quantity of energy and power in compared to other methods is the major trait that sets it apart from other methods. This technology is superior to others in terms of both the amount of data it can communicate and the amount of electricity it consumes in the process.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Behavioral Time Management Analysis: Clustering Productivity Patterns using K-Means

Behavioral Time Management Analysis: Clustering Productivity...

引用

Communication, Computing and Signal Processing (IICCCS), IEEE International Conference on

作者： D David Winster Praveenraj Mohammed I. Habelalmateen Akrati Shrivastava Amarpreet Kaur A.S. Valarmathy Chintamani Prasad Patnaik School of Business and Management CHRIST University Bangalore India Department Of Computers Techniques Engineering College Of Technical Engineering The Islamic University Najaf Iraq Department Of Computers Techniques Engineering College Of Technical Engineering The Islamic University Of Al Diwaniyah Al Diwaniyah Iraq Department of Computer Science & Engineering IES Institute of Technology and Management IES University Bhopal M.P. India Department of Computer Application Chandigarh Engineering College Chandigarh Group of Colleges Mohali Punjab India Prince Shri Venkateshwara Padmavathy Engineering College Chennai India Department of MBA Aditya Institute of Technology and Management Tekkali Andhra Pradesh India

ISBN: (数字)9798350390759

ISBN: (纸本)9798350390766

This paper focuses on investigating the efficiency profile through the three-time management behaviors using the K-Means clustering method. In the case of the study, the data gathered from digital time management tools for 100 participants for one month was preprocessed to distil features surrounding productivity, including daily working hours, focus time, break duration and frequency, and task completion ratios. The four groups that were agreed upon through K-Means clustering differed in terms of time management behaviours and productivity. Insert table 6 IT cluster 1 worked long hours with high productivity owing to the fact that they are IT professionals but had a tendency of multitasking. Employment Cluster 2 (marketing and sales professionals) achieved both personal and work-related self-care but identified the need for more concentrated time per task. As for the differences in the breaks, it can be noted that cluster 3 (management and administration personnel) had significantly higher task completion times and focus times, but their break intervals needed to be optimized. Hypothesis 2 stated that there will be many hours of leisure for Cluster 4 (students and interns) imply that their work hours should be adjusted to several small tasks a day, and their rates of task completion should be increased. From the study, it is possible to stress that time management should be considered as an individual activity that requires specific approaches to the given subject area and to the learner in particular. Specifically, demographic profiling identified the roles that age and occupational status may play in averting or exacerbating productivity deficiencies: insights that could be actionable in specific scenarios. The implications of this research offer practical insights into individual and organizational time management, as the usability aspects of machine learning techniques were considered and their applicability established, which further extends the scope of time

关键词： Productivity Time-frequency analysis Employment Machine learning Multitasking Market research Telecommunication computing Personnel Usability Stress

来源：评论

学校读者我要写书评

暂无评论

Modern extreme value statistics for Utopian extremes

arXiv

引用

arXiv 2023年

作者： Richards, Jordan Alotaibi, Noura Cisneros, Daniela Gong, Yan Guerrero, Matheus B. Redondo, Paolo Shao, Xuanjie School of Mathematics University of Edinburgh United Kingdom Statistics Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal Saudi Arabia Harvard School of Public Health BostonMA United States Department of Mathematics California State University FullertonCA United States

Capturing the extremal behaviour of data often requires bespoke marginal and dependence models which are grounded in rigorous asymptotic theory, and hence provide reliable extrapolation into the upper tails of the data-generating distribution. We present a toolbox of four methodological frameworks, motivated by modern extreme value theory, that can be used to accurately estimate extreme exceedance probabilities or the corresponding level in either a univariate or multivariate setting. Our frameworks were used to facilitate the winning contribution of Team Yalla to the EVA (2023) Conference Data Challenge, which was organised for the 13th International Conference on Extreme Value Analysis. This competition comprised seven teams competing across four separate sub-challenges, with each requiring the modelling of data simulated from known, yet highly complex, statistical distributions, and extrapolation far beyond the range of the available samples in order to predict probabilities of extreme events. Data were constructed to be representative of real environmental data, sampled from the fantasy country of "Utopia". © 2023, CC BY.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

How universal polynomial bases enhance spectral graph neural networks: heterophily, over-smoothing, and over-squashing 24

How universal polynomial bases enhance spectral graph neural...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Keke Huang Yu Guang Wang Ming Li Pietro Liò School of Computing National University of Singapore Singapore Institute of Natural Sciences School of Mathematical Sciences Zhangjiang Institute for Advanced Study Shanghai Jiao Tong University Shanghai China and Shanghai AI Laboratory Shanghai China and School of Mathematics and Statistics University of New South Wales Sydney Australia Zhejiang Institute of Optoelectronics Jinhua China and Zhejiang Key Laboratory of Intelligent Education Technology and Application Zhejiang Normal University Jinhua China Department of Computer Science and Technology Cambridge University Cambridge UK

Spectral Graph Neural Networks (GNNs), alternatively known as graph filters, have gained increasing prevalence for heterophily graphs. Optimal graph filters rely on Laplacian eigendecomposition for Fourier transform. In an attempt to avert prohibitive computations, numerous polynomial filters have been proposed. However, polynomials in the majority of these filters are predefined and remain fixed across different graphs, failing to accommodate the varying degrees of heterophily. Addressing this gap, we demystify the intrinsic correlation between the spectral property of desired polynomial bases and the heterophily degrees via thorough theoretical analyses. Subsequently, we develop a novel adaptive heterophily basis wherein the basis vectors mutually form angles reflecting the heterophily degree of the graph. We integrate this heterophily basis with the homophily basis to construct a universal polynomial basis UniBasis, which devises a polynomial filter-based graph neural network - UniFilter. It optimizes the convolution and propagation in GNN, thus effectively limiting over-smoothing and alleviating over-squashing. Our extensive experiments, conducted on datasets with a diverse range of heterophily, support the superiority of UniBasis in the universality but also its proficiency in graph explanation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generative AI-enabled Vehicular Networks: Fundamentals, Framework, and Case Study

arXiv

引用

arXiv 2023年

作者： Zhang, Ruichen Xiong, Ke Du, Hongyang Niyato, Dusit Kang, Jiawen Shen, Xuemin Poor, H. Vincent The Engineering Research Center of Network Management Technology High Speed Railway of Ministry of Education School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China The Collaborative Innovation Center of Railway Traffic Safety Beijing Jiaotong University Beijing100044 China The National Engineering Research Center of Advanced Network Technologies Beijing Jiaotong University Beijing100044 China The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Department of Electrical and Computer Engineering University of Waterloo Canada The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

Recognizing the tremendous improvements that the integration of generative AI can bring to intelligent transportation systems, this article explores the integration of generative AI technologies in vehicular networks, focusing on their potential applications and challenges. Generative AI, with its capabilities of generating realistic data and facilitating advanced decision-making processes, enhances various applications when combined with vehicular networks, such as navigation optimization, traffic prediction, data generation, and evaluation. Despite these promising applications, the integration of generative AI with vehicular networks faces several challenges, such as real-time data processing and decision-making, adapting to dynamic and unpredictable environments, as well as privacy and security concerns. To address these challenges, we propose a multi-modality semantic-aware framework to enhance the service quality of generative AI. By leveraging multi-modal and semantic communication technologies, the framework enables the use of text and image data for creating multi-modal content, providing more reliable guidance to receiving vehicles and ultimately improving system usability and efficiency. To further improve the reliability and efficiency of information transmission and reconstruction within the framework, taking generative AI-enabled vehicle-to-vehicle (V2V) as a case study, a deep reinforcement learning (DRL)-based approach is proposed for resource allocation. Finally, we discuss potential research directions and anticipated advancements in the field of generative AI-enabled vehicular networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Development of Educational Game for Indonesian History Lesson Focusing on Indonesia Pre-Literacy Relics 'Prehistoria' for Grade X High school Student

Development of Educational Game for Indonesian History Lesso...

引用

2020 International Conference on computer Engineering, Network, and Intelligent Multimedia, CENIM 2020

作者： Nugroho, Supeno Mardi Susiki Rahman, Muhammad Daffa Abiyyu Hariadi, Mochamad Arief, Muhammad Faculty of Intelligent Electrical and Informatics Technology Sepuluh Nopember Institute of Technology Computer Engineering Department Surabaya Indonesia Tokyo University of Technology Media Science Program Graduate School of Bionics Computer and Media Sciences Tokyo Japan

ISBN: (纸本)9781728182834

The development of game technology has opened up new possibilities in learning methods through educational games. However, in Indonesia, the application of this concept is lacking. One lesson that can benefit from educational games is Indonesian History in class X, with a focus on history in the pre-literacy period. This study aims to create a puzzle-Adventure type of digital game that can help educate students about the pre-literacy period, developed with Unity, and uses WebGL as a target device while referring to Indonesia's revised 2013 national curriculum. The result of this research is the creation of a digital game that can be played on average of 254.36 seconds, with potential for educational use. A survey result shows that many of the ancient objects and some of the ages are well-recognized. However, the survey also shows many of the gameplay aspects, such as UI, gameplay features, and adventure elements, need improvements. © 2020 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Genotype-Phenotype Maps Reveal Mutational Robustness of RNA Folding, Spin Glasses, and Quantum Circuits

arXiv

引用

arXiv 2023年

作者： Sappington, Anna Mohanty, Vaibhav Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States Program for Health Sciences and Technology Harvard Medical School BostonMA02115 United States Massachusetts Institute of Technology CambridgeMA02139 United States Harvard/MIT MD-PhD Program Harvard Medical School BostonMA02115 United States Department of Chemistry and Chemical Biology Harvard University CambridgeMA02138 United States

Recent studies of genotype-phenotype (GP) maps have reported universally enhanced phenotypic robustness to genotype mutations, a feature essential to evolution. Virtually all of these studies make a simplifying assumption that each genotype—represented as a sequence—maps deterministically to a single phenotype, such as a discrete structure. Here, we introduce probabilistic genotype-phenotype (PrGP) maps, where each genotype maps to a vector of phenotype probabilities, as a more realistic and universal language for investigating robustness in a variety of physical, biological, and computational systems. We study three model systems to show that PrGP maps offer a generalized framework which can handle uncertainty emerging from various physical sources: (1) thermal fluctuation in RNA folding, (2) external field disorder in spin glass ground state finding, and (3) superposition and entanglement in quantum circuits, which are realized experimentally on IBM quantum computers. In all three cases, we observe a novel biphasic robustness scaling which is enhanced relative to random expectation for more frequent phenotypes and approaches random expectation for less frequent phenotypes. We derive an analytical theory for the behavior of PrGP robustness, and we demonstrate that the theory is highly predictive of empirical robustness. © 2023, CC BY.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Cryptocurrency and Data Privacy in Human Resource Management

Cryptocurrency and Data Privacy in Human Resource Management

引用

Advance Computing and Innovative Technologies in Engineering (ICACITE), International Conference on

作者： Indhumathi Chandrasekeran A Dharmaraj Ashima Juyal M. Shravan Rajesh Deb Barman Melanie Lourens Department of Commerce With Computer Application PSG College of Arts & Science Coimbatore Tamil Nadu India Department of Management Karpagam Academy of Higher Education Coimbatore Tamil Nadu India Uttaranchal Institute of Technology Uttaranchal University School of Business SR University Warangal Telangana India Department of Commerce Bodoland University Kokrajhar BTR Assam India Faculty of Management Sciences Durban University of Technology South Africa

Cryptocurrency and data privacy are two important considerations in human resource management. Cryptocurrency, such as Bitcoin, can be used to pay employees, provide incentives, and manage payroll, but it also poses risks such as price volatility and regulatory issues. Data privacy, on the other hand, is the protection of personal information from unauthorized access and use. The use of blockchain technology, which is the underlying technology behind many cryptocurrencies, can enhance data privacy in human resource management by providing a secure and tamper-proof record of all transactions. However, it’s important to comply with all applicable laws and regulations related to the use of cryptocurrency and data privacy in human resource management.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：