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

Editorial: Introduction to Web information Systems engineering

Knowledge and information Systems 2002年第2期4卷 129-131页

作者： Li, Qing Zhang, Yanchun 1Department of Computer Engineering and Information Technology City University of Hong Kong Kowloon Hong Kong 2Department of Mathematics and Computing University of Southern Queensland ToowoombaQLD Australia

来源：评论

学校读者我要写书评

暂无评论

A UNIFIED FRAMEWORK FOR PRIMAL-DUAL METHODS IN MINIMUM COST NETWORK FLOW PROBLEMS

引用

MATHEMATICAL PROGRAMMING 1985年第2期32卷 125-145页

作者： BERTSEKAS, DP 1.Department of Electrical Engineering and Computer Science Laboratory for Information and Decision Systems Massachusetts Institute of Technology 02139 Cambridge MA USA

We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. The algorithms are of the primal-dual type. They maintain primal feasibility with respect to capacity constraints, while trying to satisfy the conservation of flow equation at each node by means of a wide variety of procedures based on flow augmentation, price adjustment, and ascent of a dual functional. The manner in which these procedures are combined is flexible thereby allowing the construction of algorithms that can be tailored to the problem at hand for maximum effectiveness. Particular attention is given to methods that incorporate features from classical relaxation procedures. Experimental codes based on these methods outperform by a substantial margin the fastest available primal-dual and primal simplex codes on standard benchmark problems.

关键词： Primal-Dual Out-of-Kilter Relaxation Network Flow

来源：评论

学校读者我要写书评

暂无评论

Multiframe weak target track-before-detect based on pseudo-spectrum in mixed coordinates

引用

Chinese Journal of Aeronautics 2022年第5期35卷 97-113页

作者： Liangliang WANG Gongjian ZHOU Thiagalingam KIRUBARAJAN School of Electronics and Information Engineering Harbin Institute of TechnologyHarbin 150001China Key Laboratory of Marine Environmental Monitoring and Information Processing Ministry of Industry and Information TechnologyHarbin 150001China Department of Electrical and Computer Engineering McMaster UniversityONHamilton L8S 4K1Canada

Traditional multiframe Track-Before-Detect(TBD)may incur adverse integration loss resulting from model mismatch in sensor *** suboptimal integration strategy may cause target envelope *** address these issues,a pseudo-spectrum-based multiframe TBD in mixed coordinates is proposed *** data search for energy integration is conducted based on an accurate model in the x-y plane while target energy is integrated based on pseudo-spectrum in sensor *** algorithm performance is improved since the model mismatch is eliminated,and the pseudo-spectrum based integration facilitates well maintained target *** detailed multiframe integration procedure and theoretical target integrated envelope are ***,to cope with the unknown target velocity,a velocity filter bank based on pseudo-spectrum in mixed coordinates is *** effect of velocity mismatch on algorithm performance is analyzed and an efficient method for filter bank design is ***,a parameter estimation method using characteristics of integrated envelope is presented for improved target polar position and Cartesian velocity ***,numerical results are provided to demonstrate the effectiveness of the proposed method.

关键词： Mixed coordinates Multiframe detection Pseudo-spectrum Track-before-detect Weak target detection

来源：评论

学校读者我要写书评

暂无评论

Time-space Viewpoint Planning for Guard Robot with Chance Constraint

引用

International Journal of Automation and computing 2019年第4期16卷 475-490页

作者： Igi Ardiyanto Jun Miura Department of Electrical Engineering and Information Technology Universitas Gadjah Mada No. 2 Jl. Grafika Yogyakarta 55281 Indonesia Department of Computer Science and Engineering Toyohashi University of Technology 1-1 Hibarigaoka Tenpaku-cho Toyohashi Aichi 441-8580 Japan

This paper presents a novel movement planning algorithm for a guard robot in an indoor environment, imitating the job of human security. A movement planner is employed by the guard robot to continuously observe a certain person. This problem can be distinguished from the person following problem which continuously follows the object. Instead, the movement planner aims to reduce the movement and the energy while keeping the target person under its visibility. The proposed algorithm exploits the topological features of the environment to obtain a set of viewpoint candidates, and it is then optimized by a cost-based set covering problem. Both the robot and the target person are modeled using geodesic motion model which considers the environment shape. Subsequently, a particle model-based planner is employed, considering the chance constraints over the robot visibility, to choose an optimal action for the robot. Simulation results using 3D simulator and experiments on a real environment are provided to show the feasibility and effectiveness of our algorithm.

关键词： Guard robot viewpoint planning state-time space uncertainty topology chance-constraint

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems

引用

IEEE Transactions on Communications 2025年

作者： Xu, Peng Luo, Chenghong Huang, Chong Chen, Gaojie He, Yuanzhi Li, Yong Wong, Kai-Kit Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Chongqing Key Laboratory of Mobile Communications Technology Chongqing400065 China 5GIC & 6GIC University of Surrey GuildfordGU2 7XH United Kingdom Guangdong Shenzhen518107 China University of Surrey 5GIC & 6GIC United Kingdom PLA Institute of Systems Engineering Academy of Military Science Beijing100141 China Chongqing University College of Computer Science Chongqing400044 China University College London Department of Electronic and Electrical Engineering LondonWC1E 7JE United Kingdom

This paper presents a general framework for probabilistic relay selection (RS) in asymmetric buffer-aided cooperative relaying systems, which caters to scenarios with both perfect and imperfect channel state information (CSI) during the RS process. The framework extends and generalizes many existing buffer-aided RS schemes. In particular, we introduce an auxiliary stochastic process which assigns varying selection probabilities to different links, considering the dynamic wireless channel and buffer states. Subsequently, we leverage the obtained outage probability and average packet delay (APD) to formulate outage optimization problems while adhering to APD. To address the intricate high-dimensional optimization problems, we employ a deep learning (DL) approach, which involves designing probability mass functions for the auxiliary stochastic process and developing an effective loss function to update the neural network. Simulation results unequivocally demonstrate the superior performance of the proposed DL-based probabilistic RS scheme compared to benchmark schemes, particularly in scenarios involving imperfect CSI. © 1972-2012 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Reducing Formal Context Extraction: A Newly Proposed Framework from Big Corpora

arXiv

引用

arXiv 2025年

作者： Hassan, Bryar A. Qader, Shko M. Hassan, Alla A. Lu, Joan Ahmed, Aram M. Majidpour, Jafar Rashid, Tarik A. Computer Science and Engineering Department School of Science and Engineering University of Kurdistan Hewler Erbil Iraq Department of Computer Science College of Science Charmo University Chamchamal KRI Sulaimani46023 Iraq Information Technology Department Kalar Technical Institute Garmian Polytechnic University Sulaimani Iraq Department of Database Technology Computer Science Institute Sulaimani Polytechnic University Sulaimani Iraq Department of Computer Science School of Computing and Engineering University of Huddersfield Queensgate HuddersfieldHD1 3DH United Kingdom Department of Computer Science University of Raparin Rania Iraq

Automating the extraction of concept hierarchies from free text is advantageous because manual generation is frequently labor- and resource-intensive. Free result, the whole procedure for concept hierarchy learning from free text entails several phases, including sentence-level text processing, sentence splitting, and tokenization. Lemmatization is after formal context analysis (FCA) to derive the pairings. Nevertheless, there could be a few uninteresting and incorrect pairings in the formal context. It may take a while to generate formal context;thus, size reduction formal context is necessary to weed out irrelevant and incorrect pairings to extract the concept lattice and hierarchies more quickly. This study aims to propose a framework for reducing formal context in extracting concept hierarchies from free text to reduce the ambiguity of the formal context. We achieve this by reducing the size of the formal context using a hybrid of a WordNet-based method and a frequency-based technique. Using 385 samples from the Wikipedia corpus and the suggested framework, tests are carried out to examine the reduced size of formal context, leading to concept lattice and concept hierarchy. With the help of concept lattice-invariants, the generated formal context lattice is compared to the normal one. In contrast to basic ones, the homomorphic between the resultant lattices retains up to 98% of the quality of the generating concept hierarchies, and the reduced concept lattice receives the structural connection of the standard one. Additionally, the new framework is compared to five baseline techniques to calculate the running time on random datasets with various densities. The findings demonstrate that, in various fill ratios, hybrid approaches of the proposed method outperform other indicated competing strategies in concept lattice performance. © 2025, CC BY.

关键词： Text mining

来源：评论

学校读者我要写书评

暂无评论

Resource-efficient generalized quantum subspace expansion

引用

Physical Review Applied 2025年第5期23卷 054021-054021页

作者： Bo Yang Nobuyuki Yoshioka Hiroyuki Harada Shigeo Hakkaku Yuuki Tokunaga Hideaki Hakoshima Kaoru Yamamoto Suguru Endo LIP6 Sorbonne Université 4 Place Jussieu 75005 Paris France Graduate School of Information Science and Technology The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-8656 Japan International Center for Elementary Particle Physics The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan Theoretical Quantum Physics Laboratory RIKEN Cluster for Pioneering Research Wako-shi Saitama 351-0198 Japan JST PRESTO 4-1-8 Honcho Kawaguchi Saitama 332-0012 Japan Department of Applied Physics and Physico-Informatics Keio University Hiyoshi 3-14-1 Kohoku Yokohama 223-8522 Japan NTT Computer and Data Science Laboratories NTT Corporation 3-9-11 Midori-cho Musashino-shi Tokyo 180-8585 Japan Graduate School of Engineering Science Osaka University 1-3 Machikaneyama Toyonaka Osaka 560-8531 Japan Center for Quantum Information and Quantum Biology Osaka University 1-2 Machikaneyama Toyonaka Osaka 560-0043 Japan

Realizing practical quantum computing requires overcoming a number of computation errors and the limitation of device size, which have intensively been tackled by quantum error mitigation. As a unified approach of noise-agnostic quantum error mitigation, generalized quantum subspace expansion (GSE) has lately been proposed to be remarkably robust regarding stochastic and coherent errors, integrating quantum subspace expansion and virtual state purification. However, the requirement in GSE to perform entangled measurements between copies of the quantum states remains a significant drawback under the current situation of quantum devices with a restricted number of qubits and their connectivity. In this work, we propose “Dual-GSE,” a resource-efficient implementation of GSE to circumvent this overhead by constructing an ansatz of error-mitigated quantum states via dual-state purification without state copies. Remarkably, the proposed method can further simulate larger quantum systems beyond the size of available quantum hardware, achieved by a suitable ansatz construction inspired by the divide-and-conquer strategy that classically reintroduces the effect of entanglement. While classically forging the entanglement comes with additional cost, the total sampling overhead can be notably reduced by reuse of the same Pauli expectation values among divided-and-conquered subsystems. We comprehensively analyze the advantages and overhead of Dual-GSE and perform numerical simulations of the eight-qubit transverse-field Ising model under various setups. Our results demonstrate that Dual-GSE estimates the ground state energy with high accuracy under gate noise with low mitigation overhead and practical sampling cost.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Industrial Automation information Analogy for Smart Grid Security

引用

computers, Materials & Continua 2022年第5期71卷 3985-3999页

作者： Muhammad Asif Ishfaq Ali Shahbaz Ahmad Azeem Irshad Akber Abid Gardezi Fawaz Alassery Habib Hamam Muhammad Shafiq Department of Computer Science National Textile UniversityFaisalabad37610PunjabPakistan Department of Computer Science and Software Engineering International Islamic UniversityIslamabadPakistan Department of Computer Science COMSATS University IslamabadIslamabadPakistan Department of Computer Engineering College of Computers and Information TechnologyTaif UniversityTaifSaudi Arabia Faculty of Engineering Moncton UniversityNBE1A3E9Canada Department of Information and Communication Engineering Yeungnam UniversityGyeongsan38541Korea

Industrial automation or assembly automation is a strictly monitored environment,in which changes occur at a good *** are many types of entities in the focusing environment,and the data generated by these devices is *** addition,because the robustness is achieved by sensing redundant data,the data becomes *** data generating device,whether it is a sensing device or a physical device,streams the data to a higher-level deception device for calculation,so that it can be driven and configured according to the updated *** the emergence of the Industry 4.0 concept that includes a variety of automation technologies,various data is generated through numerous ***,the data generated for industrial automation requires unique information Architecture(IA).IA should be able to satisfy hard real-time constraints to spontaneously change the environment and the instantaneous configuration of all *** understand its applicability,we used an example smart grid *** smart grid system needs an IA to fulfill the communication requirements to report the hard real-time changes in the power immediately following the *** addition,in a smart grid system,it needs to report changes on either side of the system,i.e.,consumers and suppliers configure and reconfigure the system according to the *** this article,we propose an analogy of a physical phenomenon.A point charge is used as a data generating device,the streamline of electric flux is used as a data flow,and the charge distribution on a closed surface is used as a ***,the intensity changes are used in the physical process,e.g.,the smart *** analogy is explained by metaphors,and the structural mapping framework is used for its theoretical *** proposed analogy provides a theoretical basis for the development of such information architectures that can represent data flows,definition changes(deterministic and non-deterministic),events,and i

关键词： Industry 4.0 information architecture industrial automation

来源：评论

学校读者我要写书评

暂无评论

Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes

引用

Applied Mathematics and Computation 2009年第2期207卷 333-339页

作者： Chan, Hung-Chang Chang, Jou-Ming Wang, Yue-Li Horng, Shi-Jinn Department of Computer Science and Information Engineering Yuanpei University Hsinchu Taiwan Department of Information Management National Taipei College of Business No. 321 Sec. 1 Ji-Nan Rd. Taipei 10051 Taiwan Department of Information Management National Taiwan University of Science and Technology Taipei Taiwan Department of Electronic Engineering National United University Miao-Li Taiwan Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taipei Taiwan

Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2002) 71-84] proposed the class of augmented cubes as a variation of hypercubes and showed that augmented cubes possess several embedding properties that the hypercubes and other variations do not possess. Recently, Hsu et al. [H.-C. Hsu, P.-L. Lai, C.-H. Tsai, Geodesic-pancyclicity and balanced pancyclicity of augmented cubes, information Processing Letters 101 (2007) 227-232] showed that the n-dimensional augmented cube AQn, n ≥ 2, is weakly geodesic-pancyclic, i.e., for each pair of vertices u, v ∈ AQn and for each integer satisfying max {2 d (u, v), 3} ≤ ≤ 2n where d(u, v) denotes the distance between u and v in AQn, there is a cycle of length that contains a u-v geodesic. In this paper, we obtain a stronger result by proving that AQn, n ≥ 2, is indeed geodesic-pancyclic, i.e., for each pair of vertices u, v ∈ AQn and for each integer satisfying max {2 d (u, v), 3} ≤ ≤ 2n, every u-v geodesic lies on a cycle of length . To achieve the result, we first show that AQn - f, n ≥ 3, remains panconnected (and thus is also edge-pancyclic) if f ∈ AQn is any faulty vertex. The result of fault-tolerant panconnectivity is the best possible in the sense that the number of faulty vertices in AQn, n ≥ 3, cannot be increased. © 2008 Elsevier Inc. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Machine learning for modelling unstructured grid data in computational physics: a review

arXiv

引用

arXiv 2025年

作者： Cheng, Sibo Bocquet, Marc Ding, Weiping Finn, Tobias Sebastian Fu, Rui Fu, Jinlong Guo, Yike Johnson, Eleda Li, Siyi Liu, Che Moro, Eric Newton Pan, Jie Piggott, Matthew Quilodran, Cesar Sharma, Prakhar Wang, Kun Xiao, Dunhui Xue, Xiao Zeng, Yong Zhang, Mingrui Zhou, Hao Zhu, Kewei Arcucci, Rossella CEREA ENPC EDF R&D Institut Polytechnique de Paris Île-de-France France School of Artificial Intelligence and Computer Science Nantong University Jiangsu Nantong226019 China School of Mathematical Sciences Key Laboratory of Intelligent Computing and Applications Tongji University Shanghai200092 China School of Engineering and Materials Science Faculty of Science and Engineering Queen Mary University of London LondonE1 4NS United Kingdom Zienkiewicz Centre for Modelling Data and AI Faculty of Science and Engineering Swansea University SwanseaSA1 8EN United Kingdom Department of Computer Science and Engineering Hong Kong university of science and technology Hong Kong Department of Earth Science & Engineering Imperial College London LondonSW7 2AZ United Kingdom Tianjin Key Laboratory of Imaging and Sensing Microelectronics Technology School of Microelectronics Tianjin University Tianjin300072 China Centre for Health Informatics Cumming School of Medicine University of Calgary CalgaryABT2N 1N4 Canada Department of Community Health Sciences Cumming School of Medicine University of Calgary CalgaryABT2N 1N4 Canada Undaunted Grantham Institute for Climate Change and the Environment Imperial College London LondonSW7 2AZ United Kingdom Culham Campus AbingdonOX14 3DB United Kingdom Centre for Computational Science Department of Chemistry University College London LondonWC1E 6BT United Kingdom Concordia Institute for Information Systems Engineering Concordia University MontrealQCH3G 1M8 Canada School of Mechanical Medical and Process Engineering Faculty of Engineering Queensland University of Technology BrisbaneQLD Australia Department of Chemical Engineering University College London LondonWC1E 6BT United Kingdom

Unstructured grid data are essential for modelling complex geometries and dynamics in computational physics. Yet, their inherent irregularity presents significant challenges for conventional machine learning (ML) techniques. This paper provides a comprehensive review of advanced ML methodologies designed to handle unstructured grid data in high-dimensional dynamical systems. Key approaches discussed include graph neural networks, transformer models with spatial attention mechanisms, interpolation-integrated ML methods, and meshless techniques such as physics-informed neural networks. These methodologies have proven effective across diverse fields, including fluid dynamics and environmental simulations. This review is intended as a guidebook for computational scientists seeking to apply ML approaches to unstructured grid data in their domains, as well as for ML researchers looking to address challenges in computational physics. It places special focus on how ML methods can overcome the inherent limitations of traditional numerical techniques and, conversely, how insights from computational physics can inform ML development. To support benchmarking, this review also provides a summary of open-access datasets of unstructured grid data in computational physics. Finally, emerging directions such as generative models with unstructured data, reinforcement learning for mesh generation, and hybrid physics-data-driven paradigms are discussed to inspire future advancements in this evolving field. © 2025, CC BY-NC-SA.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：