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

Correction: Materials laboratories of the future for alloys, amorphous, and composite materials (MRS Bulletin, (2025), 50, 2, (190-207), 10.1557/s43577-024-00846-y)

引用

MRS Bulletin 2025年 1-2页

作者： Banerjee, Sarbajit Meng, Y. Shirley Minor, Andrew M. Zhang, Minghao Zaluzec, Nestor J. Chan, Maria K.Y. Seidler, Gerald McComb, David W. Agar, Joshua Mukherjee, Partha P. Melot, Brent Chapman, Karena Guiton, Beth S. Klie, Robert F. McCue, Ian D. Voyles, Paul M. Robertson, Ian Li, Ling Chi, Miaofang Destino, Joel F. Devaraj, Arun Marquis, Emmanuelle A. Segre, Carlo U. Liu, Huinan H. Yang, Judith C. Momeni, Kasra Misra, Amit Abdolrahim, Niaz Medvedeva, Julia E. Cai, Wenjun Sehirlioglu, Alp Dizbay-Onat, Melike Mehta, Apurva Graham-Brady, Lori Maruyama, Benji Rajan, Krishna Warner, Jamie H. Taheri, Mitra L. Kalinin, Sergei V. Reeja-Jayan, B. Schwarz, Udo D. Simon, Sindee L. Brown, Craig M. Department of Chemistry and Department of Materials Science & Engineering Texas A & M University College Station United States Pritzker School of Molecular Engineering The University of Chicago Chicago United States Department of Materials Science & Engineering University of California Berkeley Berkeley United States National Center for Electron Microscopy Molecular Foundry Lawrence Berkeley National Laboratory Berkeley United States Center for Nanoscale Materials Argonne National Laboratory Lemont United States Department of Physics University of Washington Seattle United States Department of Materials Science & Engineering The Ohio State University Columbus United States Department of Mechanical Engineering and Mechanics Drexel University Philadelphia United States School of Mechanical Engineering Purdue University West Lafayette United States Department of Chemistry University of Southern California Los Angeles United States Department of Chemistry Stony Brook University The State University of New York Stony Brook United States Department of Chemistry University of Kentucky Lexington United States Department of Physics University of Illinois at Chicago Chicago United States Department of Materials Science & Engineering Northwestern University Evanston Bangladesh Department of Materials Science & Engineering University of Wisconsin–Madison Madison United States Department of Materials Science and Engineering University of Pennsylvania Philadelphia United States Department of Mechanical Engineering and Materials Science Duke University Durham United States Department of Chemistry Creighton University Omaha United States Physical and Computational Sciences Directorate Pacific Northwest National Laboratory Richland United States Department of Materials Science & Engineering University of Michigan–Ann Arbor Ann Arbor United States Department of Physics Illinois Institute of Technology Chicago United States Department of Bioengineering and the Mater

This article was updated to correct Minghao Zhang’s affiliation from "Pritzker School of Molecular engineering, The University of Chicago, Chicago, USA" to "Pritzker School of Molecular engineering, The University of Chicago, Chicago, USA;Argonne National Laboratory, Lemont, USA." Argonne National Laboratory was left off the original publication. © The Author(s) 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design and Performance Evaluation of Sequence Partition Algorithms

引用

Journal of computer Science & Technology 2008年第5期23卷 711-718页

作者：杨兵陈菁吕恩月郑斯清 Cisco Systems 2200 East President George Bush Highway Telecom. Engineering Program University of Texas at Dallas Department of Mathematics and Computer Science Salisbury University Department of Computer Science University of Texas at Dallas

Tradeoffs between time complexities and solution optimalities are important when selecting algorithms for an NP-hard problem in different applications. Also, the distinction between theoretical upper bound and actual solution optimality for realistic instances of an NP-hard problem is a factor in selecting algorithms in practice. We consider the problem of partitioning a sequence of n distinct numbers into minimum number of monotone （increasing or decreasing） subsequences. This problem is NP-hard and the number of monotone subsequences can reach [√2n＋1/1-1/2]in the worst case. We introduce a new algorithm, the modified version of the Yehuda-Fogel algorithm, that computes a solution of no more than [√2n＋1/1-1/2]monotone subsequences in O（n^1.5） time. Then we perform a comparative experimental study on three algorithms, a known approximation algorithm of approximation ratio 1.71 and time complexity O（n^3）, a known greedy algorithm of time complexity O（n^1.5 log n）, and our new modified Yehuda-Fogel algorithm. Our results show that the solutions computed by the greedy algorithm and the modified Yehuda-Fogel algorithm are close to that computed by the approximation algorithm even though the theoretical worst-case error bounds of these two algorithms are not proved to be within a constant time of the optimal solution. Our study indicates that for practical use the greedy algorithm and the modified Yehuda-Fogel algorithm can be good choices if the running time is a major concern.

关键词： monotone subsequence permutation algorithm NP-complete approximation complexity

来源：评论

学校读者我要写书评

暂无评论

Integrated 6G TN and NTN Localization: Challenges, Opportunities, and Advancements

IEEE Communications Standards Magazine

引用

IEEE Communications Standards Magazine 2025年

作者： Saleh, Sharief Zheng, Pinjun Liu, Xing Chen, Hui Keskin, Musa Furkan Priyanto, Basuki Beale, Martin Ettefagh, Yasaman Seco-Granados, Gonzalo Al-Naffouri, Tareq Y. Wymeersch, Henk Chalmers University of Technology Department of Electrical Engineering Sweden King Abdullah University of Science and Technology (KAUST) Electrical and Computer Engineering Program Division of Computer Electrical and Mathematical Sciences and Engineering (CEMSE) Saudi Arabia Sony Europe BV United Kingdom Universitat Autònoma de Barcelona Department of Telecommunications and Systems Engineering Spain

The rapid evolution of cellular networks has introduced groundbreaking technologies, including large and distributed antenna arrays and reconfigurable intelligent surfaces in terrestrial networks (TNs), as well as aerial and space-based nodes in non-terrestrial networks (NTNs). These advancements enable applications beyond traditional communication, such as high-precision localization and sensing. While integrating TN and NTN enablers will lead to unparalleled opportunities for seamless global localization, such integration attempts are expected to face several challenges. To understand these opportunities and challenges, we first examine the distinctive characteristics of the key 6G enablers, evaluating their roles in localization from both technical and practical perspectives. Next, to identify developments driving TN-NTN localization, we review the latest standardization and industrial innovation progress. Finally, we discuss the opportunities and challenges of TN-NTN integration, illustrating its potential through two numerical case studies. © 2017 IEEE.

关键词： 6G localization low-Earth-orbit (LEO) satellites non-terrestrial network (NTN) reconfigurable intelligent surface (RIS) terrestrial network (TN)

来源：评论

学校读者我要写书评

暂无评论

SOME EFFICIENT ALGORITHMS FOR A CLASS OF ABSTRACT OPTIMIZATION PROBLEMS ARISING IN OPTIMAL CONTROL

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1969年第6期AC14卷 640-+页

作者： BARR, RO GILBERT, EG Department of Electrical Engineering and Systems Science Michigan State University East Lansing MI USA Computer Information and Control Engineering Program University of Michigan Ann Arbor MI USA

Three abstract optimization problems are presented along with doubly iterative algorithms for their numerical solution. These algorithms are generalizations of particular algorithms described by Barr and Gilbert [19], [21] and Fujisawa and Yasuda [22]. The supporting theory is fully developed along with proofs of convergence. Practical aspects of computations are considered and procedures which insure rapid convergence are discussed. Two applications to discrete-time optimal control problems are described.

关键词： Optimal control Iterative algorithms Projection algorithms Dynamic programming Nonlinear equations Gradient methods Functional programming Boundary conditions Military computing Convergence of numerical methods

来源：评论

学校读者我要写书评

暂无评论

Time-Component Complexity of Two Approaches to Multioperand Binary Addition

引用

IEEE Transactions on computers 1979年第12期C-28卷 918-926页

作者： Atkins, Daniel E. Ong, Shau-Chi Program in Computer Information and Control Engineering the Systems Engineering Laboratory of the Department of Electrical and Computer Engineering University of Michigan Ann Arbor MI 48109 United States

Component and time complexity measures in terms of number of gates and gate delays, respectively, are derived for two multioperand adder structures: a tree of carry-save adders and a tree of carry-lookahead adders. The parameters of the complexity measures are operand length, number of operands, and maximum fanin to the gates. The analysis involves a constructive derivation of the complexity of carry-lookahead networks including optimization by removal of redundant paths. An alternate measure of component complexity, number of packages with a given number of pinouts, rather than number of gates, is also presented. The general conclusion of the paper is that, under the assumptions made, for a large set of design parameters, the carry-save adder structure requires both less time and fewer components than the functionally equivalent carry-lookahead adder structure. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： binary addition carry-lookahead adder carry-save adder Index Terms-Adder tree multioperand addition time-component complexity

来源：评论

学校读者我要写书评

暂无评论

Physician Scheduling using Constraint Satisfaction programming 11

Physician Scheduling using Constraint Satisfaction Programmi...

引用

11th International Japan-Africa Conference on Electronics, Communications, and Computations, JAC-ECC 2023

作者： Bakr, Hend A. Salama, Ahmed M. Fares, Ahmed Zaky, Ahmed B. Cairo University Biomedical Engineering Program Faculty of Engineering Giza Egypt Benha University Computer Systems Engineering Program Faculty of Engineering at Shoubra Banha Egypt Computer science and information technology Programs Alexandria Egypt Benha University On leave from Computer Systems Engineering Program Faculty of Engineering at Shoubra Egypt

ISBN: (纸本)9798350369328

Physician scheduling is a critical task that impacts the quality of patient care, staff satisfaction, and operational efficiency in healthcare institutions. The traditional approach to physician scheduling is manual and time-consuming, which can result in errors, staff burnout, and suboptimal schedules. To address these challenges, researchers have turned to optimization techniques like CSP, which has shown promise in solving physician scheduling problems. This paper reviews the existing literature on CSP for physician scheduling and highlights the benefits and limitations of this approach. CSP's benefits include generating schedules quickly and efficiently, incorporating complex constraints and preferences, and handling changes and disruptions in real time. However, CSP also has some limitations, such as the need for a formalized model and the fact that it may not always generate the most intuitive schedules. Overall, the findings suggest that CSP is a promising approach to physician scheduling that can produce high-quality schedules while minimizing staff burnout and improving operational efficiency. © 2023 IEEE.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Using HMM in strategic games 9

Using HMM in strategic games

引用

9th International Workshop on Developments in Computational Models, DCM 2013

作者： Benevides, Mario Lima, Isaque Nader, Rafael Rougemont, Pedro Systems and Computer Engineering Program and Computer Science Department Federal University of Rio de Janeiro Brazil

In this paper we describe an approach to resolve strategic games in which players can assume different types along the game. Our goal is to infer which type the opponent is adopting at each moment so that we can increase the player's odds. To achieve that we use Markov games combined with hidden Markov model. We discuss a hypothetical example of a tennis game whose solution can be applied to any game with similar characteristics. © M. Benevides, I. Lima, R. Nader & P. Rougemont This work is licensed under the Creative Commons Attribution License.

关键词： Tennis

来源：评论

学校读者我要写书评

暂无评论

Emergent dimer-model topological order and quasi-particle excitations in liquid crystals: combinatorial vortex lattices

arXiv

引用

arXiv 2025年

作者： Meng, Cuiling Wu, Jin-Sheng Kos, Žiga Dunkel, Jörn Nisoli, Cristiano Smalyukh, Ivan I. Department of Physics and Chemical Physics Program University of Colorado BoulderCO80309 United States Hiroshima University Hiroshima Higashihiroshima Japan Department of Mathematics Massachusetts Institute of Technology CambridgeMA02139 United States Faculty of Mathematics and Physics University of Ljubljana Ljubljana Slovenia Department of Condensed Matter Physics Jožef Stefan Institute Ljubljana Slovenia Theoretical Division Physics of Condensed Matter and Complex Systems Center For Nonlinear Studies Los Alamos National Laboratory Los AlamosNM87545 United States Department of Electrical Computer and Energy Engineering Materials Science and Engineering Program University of Colorado BoulderCO80309 United States Renewable and Sustainable Energy Institute National Renewable Energy Laboratory University of Colorado BoulderCO80309 United States

Liquid crystals have proven to provide a versatile experimental and theoretical platform for studying topological objects such as vortices, skyrmions, and hopfions. In parallel, in hard condensed matter physics, the concept of topological phases and topological order has been introduced in the context of spin liquids to investigate emergent phenomena like quantum Hall effects and high-temperature superconductivity. Here, we bridge these two seemingly disparate perspectives on topology in physics. Combining experiments and simulations, we show how topological defects in liquid crystals can be used as versatile building blocks to create complex, highly degenerate topological phases, which we refer to as ‘Combinatorial Vortex Lattices’ (CVLs). CVLs exhibit extensive residual entropy and support locally stable quasi-particle excitations in the form of charge-conserving topological monopoles, which can act as mobile information carriers and be linked via Dirac strings. CLVs can be rewritten and reconfigured on demand, endowed with various symmetries, and modified through laser-induced topological surgery — an essential capability for information storage and retrieval. We demonstrate experimentally the realization, stability, and precise optical manipulation of CVLs, thus opening new avenues for understanding and technologically exploiting higher-hierarchy topology in liquid crystals and other ordered media. Copyright © 2025, The Authors. All rights reserved.

关键词： Laser surgery

来源：评论

学校读者我要写书评

暂无评论

ADISSA - ARCHITECTURAL DESIGN OF INFORMATION-systems BASED ON STRUCTURED ANALYSIS

引用

INFORMATION systems 1988年第2期13卷 193-210页

作者： SHOVAL, P Computer and Information Systems Program Department of Industrial Engineering and Management Ben-Gurion University of the Negev P.O. Box 653 Beer Sheva 84105 Israel

ADISSA is a methodology for Architectural Design of Information systems and Software, based on Structured Analysis. The architectural design includes: 1. (a) design of a tree-structured menu system, which interfaces between the users and the system—viewed as the “external architecture” of the system; and 2. (b) design of the transactions of the system, composed of various functions which are activated in response to user needs and various events in the universe of discourse—viewed as the “internal architecture” of the system. The menu tree and the transactions are tied up with the other major components of the system architecture: the inputs and outputs, and the database. ADISSA methodology is fully compatible and consistent with Structured Analysis, and therefore the stages of system analysis and design are integrated into one complete process.

关键词： Architectural design data flow diagram development methods software engineering structured analysis and design transactions user interface

来源：评论

学校读者我要写书评

暂无评论

Using modal logics to express and check global graph properties

Using modal logics to express and check global graph propert...

引用

作者： Benevides, Mario R.F. Schechter, L. Menasché Computer Science Department Systems and Computer Engineering Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Systems and Computer Engineering Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

Graphs are among the most frequently used structures in computer Science. Some of the properties that must be checked in many applications are connectivity, acyclicity and the Eulerian and Hamiltonian properties. In this work, we analyze how we can express these four properties with modal logics. This involves two issues: whether each of the modal languages under consideration has enough expressive power to describe these properties and how complex (computationally) it is to use these logics to actually test whether a given graph has some desired property. First, we show that these properties are not definable in a basic modal logic or in any bisimulation-invariant extension of it, like the modal μ-calculus. We then show that it is possible to express some of the above properties in a basic hybrid logic. Unfortunately, the Hamiltonian and Eulerian properties still cannot be efficiently checked. In a second attempt, we propose an extension of CTL* with nominals and show that the Hamiltonian property can be more efficiently checked in this logic than in the previous one. In a third attempt, we extend the basic hybrid logic with the ↓ operator and show that we can check the Hamiltonian property with optimal (NP) complexity in this logic. Finally, we tackle the Eulerian property in two different ways. First, we develop a generic method to express edge-related properties in hybrid logics and use it to express the Eulerian property. Second, we express a necessary and sufficient condition for the Eulerian property to hold using a graded modal logic. © The Author 2009. Published by Oxford University Press. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：