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

arXiv 2024年

作者： Berenbrink, Petra Coja-Oghlan, Amin Cooper, Colin Gotte, Thorsten Hintze, Lukas Zakharov, Pavel University Of Hamburg Faculty Of Mathematics Informatics And Natural Sciences Department Of Informatics Vogt-Kolln-Str. 30 Hamburg22527 Germany Tu Dortmund Faculty Of Computer Science Faculty Of Mathematics 12 Otto-Hahn-St Dortmund44227 Germany Department Of Informatics King's College University Of London LondonWC2B 4BG United Kingdom

In an influential article Papadimitriou [FOCS 1991] proved that a local search algorithm called WalkSAT finds a satisfying assignment of a satisfiable 2-CNF with n variables in O(n2) expected time. Variants of the WalkSAT algorithm have become a mainstay of practical SAT solving (e.g., [Hoos and Stutzle 2000]). In the present article we analyse the expected running time of WalkSAT on random 2-SAT instances. Answering a question raised by Alekhnovich and Ben-Sasson [SICOMP2007],we showthat WalkSAT runs in linear expected time for all clause/variable densities up to the random2-SAT satisfiability *** Codes 68Q87, 60C05 Copyright © 2024, The Authors. All rights reserved.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

科学研究的第五范式——以智能驱动的材料设计为例

引用

Engineering 2023年第5期24卷 126-137,I0003,I0004页

作者： Can Leng Zhuo Tang Yi-Ge Zhou Zean Tian Wei-Qing Huang Jie Liu Keqin Li Kenli Li Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense TechnologyChangsha 410073China Laboratory of Software Engineering for Complex Systems National University of Defense TechnologyChangsha 410073China National Supercomputing Center in Changsha Changsha 410082China College of Computer Science and Electronic Engineering Hunan UniversityChangsha 410082China Institute of Chemical Biology and Nanomedicine State Key Laboratory of Chemo/Biosensing and ChemometricsCollege of Chemistry and Chemical EngineeringHunan UniversityChangsha 410082China Department of Applied Physics School of Physics and ElectronicsHunan UniversityChangsha 410082China Department of Computer Science State University of New YorkNew PaltzNY 12561USA

科学正在进入一个新时代——第五范式——它被认为是知识整合到不同领域的主要特征,是基于无所不在的机器学习系统的计算社区中智能驱动的工作。在此,我们通过在天河一号超级计算机系统上构建的催化材料专门设计的典型平台案例,生动地... 详细信息

科学正在进入一个新时代——第五范式——它被认为是知识整合到不同领域的主要特征,是基于无所不在的机器学习系统的计算社区中智能驱动的工作。在此,我们通过在天河一号超级计算机系统上构建的催化材料专门设计的典型平台案例,生动地阐明了第五范式的本质,旨在促进第五范式在其他领域的培养。第五范式平台主要包括模型自动构建(原始数据提取)、指纹自动构建(神经网络特征选择)以及跨学科知识串联的重复迭代(“火山图”)。与分解一起进行的是对迭代中实现的体系结构的性能评估。通过讨论,第五范式的智能驱动平台可以极大地简化和改进研究中极其繁琐和具有挑战性的工作,并通过补偿机器学习中缺少样本和替代一些由于计算资源不足而导致的数值计算来实现数值计算与机器学习之间的相互反馈,从而加速探索过程。在数据驱动的学科中,跨学科专家的协同作用和对动态数据需求的急剧增长仍然是一个挑战。我们相信,对第五范式平台的一瞥可以为其在其他领域的应用铺平道路。

关键词：机器学习自动构建天河一号数据驱动神经网络动态数据知识整合科学研究

来源：评论

学校读者我要写书评

暂无评论

MV-MOS: Multi-View Feature Fusion for 3D Moving Object Segmentation

MV-MOS: Multi-View Feature Fusion for 3D Moving Object Segme...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Jintao Cheng Xingming Chen Jinxin Liang Xiaoyu Tang Xieyuanli Chen Dachuan Li Department of Computer Science and Engineering Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China School of Electronic and Information Engineering South China Normal University Foshan China College of Intelligence Science and Technology National University of Defense Technology Changsha China

ISBN: (数字)9798331509644

ISBN: (纸本)9798331509651

Effectively summarizing dense 3D point cloud data and extracting motion information of moving objects (moving object segmentation, MOS) is crucial to autonomous driving and robotics applications. How to effectively utilize motion and semantic features and avoid information loss during 3D-to-2D projection is still a key challenge. In this paper, we propose a novel multi-view MOS model (MV-MOS) by fusing motion-semantic features from different 2D representations of point clouds. To effectively exploit complementary information, the motion branches of the proposed model combines motion features from both bird's eye view (BEV) and range view (RV) representations. In addition, a semantic branch is introduced to provide supplementary semantic features of moving objects. Finally, a Mamba module is utilized to fuse the semantic features with motion features and provide effective guidance for the motion branches. We validated the effectiveness of the proposed multi-branch fusion MOS framework via comprehensive experiments, and our proposed model outperforms existing state-of-the-art models on the SemanticKITTI benchmark. The implementation codes are available at https://***/Chengjt1999/MV-MOS.

关键词： Point cloud compression Solid modeling Three-dimensional displays Computational modeling Biological system modeling Semantics Neural networks Object segmentation Robots Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Time and Quantity Based Hybrid Consolidation Algorithms for Reduced Cost Products Delivery

引用

computers, Materials & Continua 2021年第10期69卷 409-432页

作者： Muhammad Ali Memon Asadullah Shaikh Adel Sulaiman Abdullah Alghamdi Mesfer Alrizq Bernard Archimède Department of Information Technology University of SindhJamshoroSindh76090Pakistan College of Computer Science and Information Systems Najran UniversityNajran61441Saudi Arabia University of Toulouse INP-ENIT47 Avenue d’AzereixBP1629F-65016Tarbes CedexFrance

In today’s competitive business environment,the cost of a product is one of the most important considerations for its *** are heavily involved in research strategies to minimize the cost of elements that can impact on the final price of the *** is one such *** products arrive from diverse locations to consumers in today’s digital era of online ***,the logistics sector faces several dilemmas from order attributes to environmental changes in this *** has specially been noted during the ongoing Covid-19 pandemic where the demands on online businesses have increased several ***,the methodology to optimise delivery cost and its impact on environmental focus by reducing CO_(2) emissions has gained *** resultant strategy of Shipment Consolidation that has evolved is an approach that combines one or more transport orders in the same vehicle for *** Consolidation has been categorized in three order scheduling approaches:Time based consolidation,Quantity based consolidation,and a Hybrid(Time-Quantity)based *** this paper,a new Hybrid Consolidation approach is *** the Hybrid approach,it has been shown that order delivery can be facilitated by taking into account not only the order pick up time,but also the total order *** results have shown that if a time window is available in respect of the order delivery time,then the order can be delayed from pickup to consolidate it with other orders for cost *** hybrid approach is based on four consolidation principles,two of which work on fixed departure and two,on demand *** of these rules have been implemented and tested here with an application case *** analysis of the results is illustrated with different planning evaluation *** Result analyses indicate that consolidation of orders is increased with each implemented rule hence motivating us towards t

关键词： Consolidation transportation supply chain cost minimization

来源：评论

学校读者我要写书评

暂无评论

BER Improvement of Cooperative Spectrum Sharing of NOMA in 5G Network

BER Improvement of Cooperative Spectrum Sharing of NOMA in 5...

引用

sciences and Techniques of Automatic Control and computer Engineering MI-STA, IEEE International Maghreb Meeting of the Conference on

作者： Mohamed Hassan Rashid A. Saeed Rania A. Mokhtar Khalid Hamid Elmustafa Sayed Ali Nidhal Odeh Manwinder Singh Othman O. Khalifa Shayla Islam Department of Wireless Communication Lovely Professional University Phagwara Punjab India Department of Computer Engineering College of Computers and Information Technology Taif University Taif Saudi Arabia Department of Communication Systems Engineering University of Science & Technology Omdurman Sudan Department of Electronics Engineering Sudan University of Science and Technologu (SUST) Khartoum Sudan School of Electrical Computer and Telecommunications Engineering University of Wollongong Australia Department of Electrical and Computer Engineering International Islamic University Malaysia Gombak Malaysia Libyan Center for Engineering Resarch and Information Technology Bani Waleed Libya Department of Computer Science Institute of Computer Science and Digital Innovation UCSI University Malaysia Kuala Lumpur Malaysia

Non-orthogonal multiple access is one of the best methods for addressing the needs of 5G wireless services (NOMA). The proliferation of mobile devices in recent years has increased the importance of cooperative spectrum sharing and utilization in wireless communication due to increases in the bit error rate (BER) brought on by collisions and interference. In this study, MIMO and Massive MIMO (M-MIMO) in the downlink (DL) NOMA power domain (PD) in conjunction with the Cooperative Cognitive Radio Network are proposed as two new ways for improving and evaluating BER in the 5G network (CCRN). Customers of NOMA compete for available channels on the CCRN in this first strategy. The second approach creates a dedicated channel for NOMA users. Three scenarios with varying distances, power location coefficients, and transmission power are used to evaluate the proposed methods in the MATLAB software program. It is assumed that four users will share a 90 MHz BW using QPSK modulation in all three scenarios. When evaluating the performance of the suggested system under the presumption of frequency-selective Rayleigh fading, concurrent interference cancellation (SIC) and unstable channel conditions are also considered.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Coordinating the SDN and TDMA Planes in Software-Defined Tactical MANETs with Adaptive Coding and Modulation

Coordinating the SDN and TDMA Planes in Software-Defined Tac...

引用

International Conference on Military Communications and Information systems (ICMCIS)

作者： Yiannis Papageorgiou Johannes F. Loevenich Merkouris Karaliopoulos Paulo H. L. Rettore Roberto Rigolin F. Lopes Iordanis Koutsopoulos Department of Informatics Athens University of Economics and Business Athens Greece Department of Mathematics/Computer Science University of Osnabrück Bonn Germany Secure Communications & Information (SIX) Thales Deutschland Ditzingen Germany Department of Communication Systems Fraunhofer FKIE Bonn Germany

In this paper, we investigate a tactical mobile ad hoc network (MANET) enhanced with software defined networking (SDN) functionality. Radio transmissions of network links are orchestrated using time division multiple access (TDMA) and are subject to adaptive modulation and coding (AMC) to ad-dress the dynamic variations in the quality of MANET links. A significant challenge within these networks is meeting the quality of service (QoS) demands of end-user data traffic while maintaining the SDN control plane's responsiveness to MANET topology alterations. To address this challenge, we propose a novel approach that concurrently determines the optimal placement of the SDN controller and the transmission scheduling of links in the MANET. The management of residual resources has a direct impact on both performance metrics. Building upon previous research, we present a more comprehensive model of the quality variations of tactical MANET links, elucidating how these variations dictate transmission modes over each link through software-defined radio (SDR) technology and influence the slot allocation process. We contrast our joint optimization algorithm with alternative techniques that manage these two network control mechanisms independently. Numerical evaluations suggest that our proposed algorithm achieves superior performance in comparison with the techniques considered.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling Non-Cooperative Dialogue: Theoretical and Empirical Insights

arXiv

引用

arXiv 2022年

作者： Sicilia, Anthony Maidment, Tristan Healy, Pat Alikhani, Malihe Intelligent Systems Program University of Pittsburgh Pittsburgh United States Department of Informatics and Networked Systems University of Pittsburgh Pittsburgh United States Department of Computer Science and Intelligent Systems Program University of Pittsburgh Pittsburgh United States

Investigating cooperativity of interlocutors is central in studying pragmatics of dialogue. Models of conversation that only assume cooperative agents fail to explain the dynamics of strategic conversations. Thus, we investigate the ability of agents to identify non-cooperative interlocutors while completing a concurrent visual-dialogue task. Within this novel setting, we study the optimality of communication strategies for achieving this multi-task objective. We use the tools of learning theory to develop a theoretical model for identifying non-cooperative interlocutors and apply this theory to analyze different communication strategies. We also introduce a corpus of non-cooperative conversations about images in the GuessWhat?! dataset proposed by De Vries et al. (2017). We use reinforcement learning to implement multiple communication strategies in this context and find empirical results validate our theory. © 2022, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Event-Centric Question Answering via Contrastive Learning and Invertible Event Transformation

arXiv

引用

arXiv 2022年

作者： Lu, Junru Tan, Xingwei Pergola, Gabriele Gui, Lin He, Yulan Department of Computer Science University of Warwick United Kingdom Department of Informatics King's College London United Kingdom The Alan Turing Institute United Kingdom

Human reading comprehension often requires reasoning of event semantic relations in narratives, represented by Event-centric Question-Answering (QA). To address event-centric QA, we propose a novel QA model with contrastive learning and invertible event transformation, call TranCLR. Our proposed model utilizes an invertible transformation matrix to project semantic vectors of events into a common event embedding space, trained with contrastive learning, and thus naturally inject event semantic knowledge into mainstream QA pipelines. The transformation matrix is fine-tuned with the annotated event relation types between events that occurred in questions and those in answers, using event-aware question vectors. Experimental results on the Event Semantic Relation Reasoning (ESTER) dataset show significant improvements in both generative and extractive settings compared to the existing strong baselines, achieving over 8.4% gain in the token-level F1 score and 3.0% gain in Exact Match (EM) score under the multi-answer setting. Qualitative analysis reveals the high quality of the generated answers by TranCLR, demonstrating the feasibility of injecting event knowledge into QA model learning. Our code and models can be found at https://***/LuJunru/TranCLR. Copyright © 2022, The Authors. All rights reserved.

关键词： Linear transformations

来源：评论

学校读者我要写书评

暂无评论

Generative AI for Secure and Privacy-Preserving Mobile Crowdsensing

arXiv

引用

arXiv 2024年

作者： Yang, Yaoqi Zhang, Bangning Guo, Daoxing Du, Hongyang Xiong, Zehui Niyato, Dusit Han, Zhu College of Communications Engineering Army Engineering University of PLA Nanjing210000 China School of Computer Science and Engineering NTU Singapore Singapore Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore Singapore Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States

Recently, generative AI has attracted much attention from both academic and industrial fields, which has shown its potential, especially in the data generation and synthesis aspects. Simultaneously, secure and privacy-preserving mobile crowdsensing (SPPMCS) has been widely applied in data collection/ acquirement due to an advantage on low deployment cost, flexible implementation, and high adaptability. Since generative AI can generate new synthetic data to replace the original data to be analyzed and processed, it can lower data attacks and privacy leakage risks for the original data. Therefore, integrating generative AI into SPPMCS is feasible and significant. Moreover, this paper investigates an integration of generative AI in SPPMCS, where we present potential research focuses, solutions, and case studies. Specifically, we firstly review the preliminaries for generative AI and SPPMCS, where their integration potential is presented. Then, we discuss research issues and solutions for generative AI-enabled SPPMCS, including security defense of malicious data injection, illegal authorization, malicious spectrum manipulation at the physical layer, and privacy protection on sensing data content, sensing terminals' identification and location. Next, we propose a framework for sensing data content protection with generative AI, and simulations results have clearly demonstrated the effectiveness of the proposed framework. Finally, we present major research directions for generative AI-enabled SPPMCS. © 2024, CC BY.

关键词： Privacy-preserving techniques

来源：评论

学校读者我要写书评

暂无评论

Task-Aware Waypoint Sampling for Robotic Planning 31

Task-Aware Waypoint Sampling for Robotic Planning

引用

31st International Conference on Automated Planning and Scheduling, ICAPS 2021

作者： Keren, Sarah Canal, Gerard Cashmore, Michael Harvard University School of Engineering and Applied Sciences Cambridge United States The Hebrew University of Jerusalem School of Computer Science and Engineering Israel Department of Informatics King’s College London United Kingdom University of Strathclyde Computer and Information Sciences Glasgow United Kingdom

ISBN: (纸本)9781713832317

To achieve a complex task, a robot often needs to navigate in a physical space in order to complete activities in different locations. For example, it may need to inspect several structures, making multiple observations of each structure from different perspectives. Typically, the positions from which these activities can be performed are represented as waypoints – discrete positions that are sampled from the continuous physical space and used to find a task plan. Existing approaches to waypoint selection either iteratively consider the entire space or use domain knowledge to consider each activity separately. This can lead to task planning problems that are more complex than is necessary or to plans of compromised quality. Moreover, all previous approaches only consider geometric constraints that can be imposed on the waypoint selection process. We present Task-Aware Waypoint Sampling (TAWS), which offers two key novelties. First, it is an anytime approach that combines the benefits of random sampling with the use of domain knowledge in waypoint selection by performing a onetime computation of the connectivity graph from which waypoints are sampled. In addition, TAWS is the first approach that accounts for performance preferences, which are preferences a system operator may have about the generated task plan. These can account, for example, for areas near doorways where it is preferable that the robot does not stop to perform activities. We demonstrate the performance benefits of our approach on simulated automated manufacturing tasks. Copyright © 2021, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：