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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

14,505 篇 会议
2,099 篇 期刊文献
4 篇 学位论文
1 篇 资讯

馆藏范围

16,609 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,865 篇 工学
- 1,992 篇 电气工程
- 1,031 篇 计算机科学与技术...
- 616 篇 信息与通信工程
- 555 篇 控制科学与工程
- 400 篇 电子科学与技术（可...
- 339 篇 机械工程
- 315 篇 仪器科学与技术
- 273 篇 软件工程
- 103 篇 核科学与技术
- 98 篇 生物医学工程（可授...
- 81 篇 交通运输工程
- 53 篇 测绘科学与技术
- 37 篇 航空宇航科学与技...
- 32 篇 网络空间安全
- 28 篇 光学工程
- 24 篇 材料科学与工程（可...
- 21 篇 力学（可授工学、理...
- 14 篇 土木工程
806 篇 理学
- 317 篇 物理学
- 253 篇 数学
- 172 篇 系统科学
- 40 篇 地球物理学
- 20 篇 化学
- 17 篇 生物学
280 篇 管理学
- 276 篇 管理科学与工程(可...
220 篇 医学
- 177 篇 临床医学
- 74 篇 特种医学
- 21 篇 基础医学(可授医学...
136 篇 文学
- 136 篇 新闻传播学
29 篇 艺术学
- 28 篇 设计学（可授艺术学...
14 篇 军事学
12 篇 农学
8 篇 经济学
4 篇 教育学
2 篇 法学

主题

16,609 篇 iterative algori...
2,271 篇 iterative method...
2,026 篇 algorithm design...
1,663 篇 convergence
1,443 篇 iterative decodi...
1,099 篇 image reconstruc...
1,043 篇 computer science
1,040 篇 signal processin...
1,003 篇 clustering algor...
943 篇 equations
763 篇 robustness
752 篇 testing
638 篇 partitioning alg...
564 篇 computational mo...
551 篇 costs
530 篇 maximum likeliho...
486 篇 hardware
483 篇 parity check cod...
483 篇 control systems
474 篇 frequency

机构

45 篇 institute for in...
43 篇 school of electr...
35 篇 department of el...
30 篇 department of el...
30 篇 department of el...
28 篇 department of el...
27 篇 department of el...
27 篇 school of electr...
27 篇 department of el...
26 篇 school of electr...
25 篇 department of el...
24 篇 department of el...
22 篇 department of el...
22 篇 microsoft resear...
22 篇 department of el...
21 篇 school of electr...
21 篇 ibm thomas j. wa...
21 篇 department of el...
20 篇 department of el...
19 篇 department of el...

作者

23 篇 e. rogers
22 篇 j.a. fessler
22 篇 a.k. katsaggelos
21 篇 xianlong hong
18 篇 c.-c.j. kuo
18 篇 d.h. owens
17 篇 li zhang
15 篇 j. white
14 篇 a.e. yagle
14 篇 jing wang
14 篇 yonghuai liu
13 篇 shidong zhou
13 篇 a. anastasopoulo...
13 篇 chong-yung chi
13 篇 w.c. chew
12 篇 dacheng yang
12 篇 an-yeu wu
12 篇 m. fossorier
12 篇 m.a. king
12 篇 eric rogers

语言

16,190 篇 英文
348 篇 其他
66 篇 中文
2 篇 法文
1 篇 西班牙文
1 篇 土耳其文

检索条件"主题词=Iterative algorithms"

共 16609 条记录，以下是531-540 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A Formal Based Verification Methodology for DFD Mux-Tree Hierarchies

A Formal Based Verification Methodology for DFD Mux-Tree Hie...

引用

IEEE International Test Conference on India (ITC India)

作者： Maneesh Pandey Madhav Lekkala Nikhitha Chintagumpala Bhagyalakshmi C Surya Ramasamy Client Computing Group-AI (CCGAI) Intel Technologies Private Limited Bangalore India Data center-AI (DCAI) Intel Technologies Private Limited Bangalore India

ISBN: (数字)9798350352597

ISBN: (纸本)9798350352603

The increasing complexity of System-on-Chip (SoC) products has amplified the potential for design bugs, necessitating robust post-silicon validation to ensure system reliability. Design-for-Debug (DFD) infrastructure plays a pivotal role in providing observability to internal nodes during post-silicon debugging. However, the traditional verification of DFD's hierarchical multiplexer (mux) trees, which are essential for signal routing, is full of challenges. The legacy verification process is time-consuming, resource-intensive, and prone to human error, particularly in the manual assignment of unique identifiers (IDs) to muxes. This paper presents an innovative methodology that leverages Formal Verification and automated ID assignment to streamline the verification of SoC-level muxtrees. It replaces the laborious simulation-based approach with a more efficient formal verification process, reducing the verification time from 10 days to a single day. Additionally, the automated ID assignment algorithm ensures accuracy and consistency in the mux configuration, eliminating the risk of human error and the need for iterative manual efforts. The implementation of the proposed flow, and the significant improvements in verification efficiency demonstrated through experimental results by providing a scaled down version of the mux-tree in the case study.

关键词： Multiplexing Manuals Debugging Routing iterative algorithms System-on-chip Reliability

来源：评论

学校读者我要写书评

暂无评论

A Fast Converging Boundary Element Method for the Scattering by Perfectly Conducting Non-orientable Objects

A Fast Converging Boundary Element Method for the Scattering...

引用

URSI Atlantic Radio Science Conference (URSI AT-RASC)

作者： Kristof Cools Carolina Urzúa-Torres Ghent University Ghent BE TU Delft CD NL

ISBN: (数字)9789463968102

ISBN: (纸本)9798350360257

The electric field integral equation can describe scattering by closed and open surfaces, surfaces containing junctions, and even non-orientable surfaces. The boundary element discretisation of this equation results in linear systems whose condition number grows as the square of the inverse mesh size. This eventually leads to systems that in practice cannot be solved, not even when using powerful iterative solvers such as GMRES and efficient matrix compression algorithms such as the fast multipole algorithm or an H-matrix based low rank representation. As a remedy, Calderón preconditioners are used to significantly reduce the number of iterations required to reach an acceptable solution. This type of preconditioners are available for open and closed surfaces, and recently also for surfaces containing junctions. In this contribution, a Calderón type preconditioner will be constructed for the electric field integral equation applied to non-orientable surfaces such as the Moebius strip. It is based on a redundant representation for the induced current, and a block-diagonal preconditioning strategy. Numerical experiments corroborate the correctness and efficiency of this approach.

关键词： Linear systems Strips Integral equations Scattering iterative algorithms Boundary-element methods Junctions

来源：评论

学校读者我要写书评

暂无评论

Research on Pulse High-Power Measurement Based on Digital Enhanced Algorithm

Research on Pulse High-Power Measurement Based on Digital En...

引用

IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)

作者： Bo Peng Xin Hu QiXuan Gao Wanquan Qi Electromagnetic Enviroment Effects Calibration Laboratory Beijing Institute of Radio Metrology and Measurement Beijing China School of Electronic Engineering Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9798350351019

ISBN: (纸本)9798350351026

Digital enhanced algorithm is based on digital predistortion technology to solve the memory effect and nonlinear distortion of high-power pulse sources. The letter introduces an optimization algorithm for enhancing the stability of high-power pulse power signals, which solves the problem of poor numerical stability of pulse power caused by strong noise and can achieve stable iterative convergence of pulse power measurement values. A verification was showed by experiments.

关键词： Antenna measurements Power measurement Pulse measurements Nonlinear distortion Noise Predistortion iterative algorithms Numerical stability Thermal stability Optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive High-frequency Enhancement Network with Equilibrated Mechanism for MR Imaging

Adaptive High-frequency Enhancement Network with Equilibrate...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Ye Liu Kaicong Sun Chong Li Qingneng Li Zhuoxu Cui Jing Cheng Dong Liang School of Biomedical Engineering ShanghaiTech University Shanghai China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Key Laboratory of Biomedical Imaging Science and System Chinese Academy of Sciences China

ISBN: (数字)9798350371499

ISBN: (纸本)9798350371505

Unrolling is a promising deep learning (DL)-based technique in accelerating Magnetic Resonance (MR) imaging. It incorporates deep learning networks into the iterative optimization algorithm, enabling the flexible and adaptive learning of undefined parameters or functions. However, unrolling methods employ a limited number of iterations owing to memory constraints and exhibit detail loss, which hinders their overall performance and practical applications. In this work, we propose a novel network that adaptively improves the high-frequency feature representation and integrates a deep equilibrium model for fixed-point iteration to enhance the robustness of the reconstruction. Experimental results demonstrate superior performance of the proposed method in detail preservation, generalization across various test datasets, and robustness against noise interference and number of iterations.

关键词： Deep learning Adaptive systems Noise Memory management Imaging Magnetic resonance Robustness iterative algorithms Image reconstruction Optimization

来源：评论

学校读者我要写书评

暂无评论

An Optimal Efficiency Online Planning for LEO/GEO Inter-Layer Link Establishment with Antenna Pointing Constraints

An Optimal Efficiency Online Planning for LEO/GEO Inter-Laye...

引用

Chinese Automation Congress (CAC)

作者： Yao Cai Shuyu Lin Miao Li Hao Zhang Jun Wu Shanghai Aerospace Control Technology Institute Shanghai China

ISBN: (数字)9798350368604

ISBN: (纸本)9798350368611

Addressing the online planning problem of LEO/GEO Inter-Layer Link (ILL) establishment with complex antenna pointing constraints, an iterative algorithm for constrained boundary equations is proposed, based on the antenna pointing constraints, attitude and orbit of satellites. Considering the longest connection time strategy, an optimal efficiency online planning algorithm for ILL establishment is proposed, which improves the search efficiency of access timetable, avoiding the duplicated links problem. The effectiveness of both the constrained boundary solution algorithm and the optimal efficiency online planning algorithm is verified by simulation.

关键词： Satellite antennas Satellites Automation Accuracy Computational modeling Search problems Mathematical models Orbits iterative algorithms Planning

来源：评论

学校读者我要写书评

暂无评论

A (Weakly) Polynomial Algorithm for AIVF Coding

A (Weakly) Polynomial Algorithm for AIVF Coding

引用

IEEE International Symposium on Information Theory

作者： Mordecai J. Golin Reza Hosseini Dolatabadi Arian Zamani University of Massachusetts Amherst Department of Computer Engineering Sharif University of Technology Tehran Iran

ISBN: (数字)9798350382846

ISBN: (纸本)9798350382853

It is possible to improve upon Tunstall coding using a collection of multiple parse trees. The best such results so far are Iwata and Yamamoto's maximum cost AIVF codes. The most efficient algorithm for designing such codes is an iterative one that could run in exponential time. In this paper, we show that this problem fits into the framework of a newly developed technique that uses linear programming with the Ellipsoid method to solve the minimum cost Markov chain problem. This permits constructing maximum cost AIVF codes in (weakly) polynomial time.

关键词： Costs Codes Linear programming Polynomials Encoding iterative algorithms Ellipsoids

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Bellman-Ford and Dijkstra algorithms in Software Defined Networking

Comparative Analysis of Bellman-Ford and Dijkstra Algorithms...

引用

Data Intelligence and Cognitive Informatics (ICDICI), International Conference on

作者： Prabhav Ravi Tammanashastri Shinu M Rajagopal Sahen Shivadutt Bananjee Dept. of Computer Science Engineering Amrita School of Computing Bengaluru Amrita Vishwa Vidyapeetam India

ISBN: (数字)9798350389609

ISBN: (纸本)9798350389616

One of the key functions of the internet is packet routing of data. A routing protocol outlines the channel of communication between routers that is utilized to connect networks. Numerous routing protocols, including OSPF and RIP are used on the internet. Each protocol has a unique packet routing function. Bellman-Ford and Dijkstra are SDN routing algorithms; the former accommodates negative weights, suiting more complex network topologies, while the latter works efficiently for non-negative weights, ensuring faster convergence. RIP’s reliance on the Bellman-Ford algorithm leads to slower convergence and potential routing cycles in bigger networks. OSPF, while stronger with Dijkstra’s algorithm, can introduce high communication overhead due to maintaining complete network topology data. Bellman-Ford employs a dynamic programming approach, handling diverse network conditions, whereas Dijkstra’s greedy strategy excels in finding the shortest path in positively weighted networks. respectively.

关键词： Accuracy Heuristic algorithms Scalability Software algorithms Routing Routing protocols iterative algorithms Topology Software defined networking Convergence

来源：评论

学校读者我要写书评

暂无评论

Material Characterization Using the Clamped Circular Waveguide Method

Material Characterization Using the Clamped Circular Wavegui...

引用

IEEE Instrumentation and Measurement Technology Conference

作者： Trent Moritz Matthew Dvorsky Joseph Spewock Mohammad Tayeb Al Qaseer Electrical and Computer Engineering Iowa State University Ames USA

ISBN: (数字)9798350380903

ISBN: (纸本)9798350380910

This paper examines the clamped waveguide technique with circular waveguides for material characterization and nondestructive testing and evaluation. The clamped waveguide technique provides an alternative, non-destructive method to the filled waveguide technique, which is a destructive technique due to the sample shaping requirement. This technique is evaluated and proven effective by measuring and characterizing several materials with well-known electromagnetic material properties. Measurements are performed at 32–40 GHz, and the electro-magnetic material properties are calculated through an iterative curve fitting algorithm. Results show that this method effectively calculates the complex relative permittivity. However, this method struggles to accurately calculate the loss-factor of the relative complex permittivity for very low-loss materials.

关键词： Circular waveguides Accuracy Permittivity measurement Nondestructive testing Rendering (computer graphics) iterative algorithms Permittivity

来源：评论

学校读者我要写书评

暂无评论

Motion Planning at Intersections with Safe Differential Games based on Control Barrier Function

Motion Planning at Intersections with Safe Differential Game...

引用

IEEE Symposium on Intelligent Vehicle

作者： Peng Yi Wenyuan Wang Qingwen Liu Yiguang Hong Shanghai Research Institute for Intelligent Autonomous Systems Tongji University National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Department of Control Science and Engineering Tongji University

ISBN: (数字)9798350348811

ISBN: (纸本)9798350348828

Motion planning at intersections is a challenging problem in autonomous driving due to the complicated interactions. The existing pipeline of "planning after predicting" is too conservative, can reduce traffic efficiency. Using game theory to model the non-cooperative coupling relationships between multiple vehicles can resolve the above problems, but such methods cannot guarantee safety without collision. This paper presents motion planning for autonomous driving with safe differential games based on Control Barrier Function (CBF), and also provides a safety-critical generalized Nash equilibrium seeking algorithm. We handle the hard CBF constraints through augmented Lagrangian multiplier method. Motivated by iterative Linear-Quadratic Game (iLQG) algorithm, we use the Taylor expansion method to approximate the model into an Linear-Quadratic (LQ) structure, and then incrementally solve this problem with an iterative feedback LQ game algorithm. Through Carla simulation and hardware testing, our results indicate that the algorithm can find a balance between safety and efficiency while maintaining real-time implementation performance.

关键词： Differential games Games Approximation algorithms Real-time systems iterative algorithms Hardware Planning

来源：评论

学校读者我要写书评

暂无评论

Length-Variable Prototype Filter Design for the PAPR-Reduced FBMC System

Length-Variable Prototype Filter Design for the PAPR-Reduced...

引用

International Conference on Computer and Communications (ICCC)

作者： Jiangang Wen Wenshu Feng Anding Wang Jingyu Hua Dongming Wang School of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou China National Mobile Communication Research Laboratory Southeast University Nanjing China

ISBN: (数字)9798331507077

ISBN: (纸本)9798331507084

To flexibly design prototype filters for the PAPR-reduced FBMC system, i.e., the pruned DFT spread FBMC system, this paper proposes a weighted cost function considering perfect reconstruction and out-of-band energy. For minimization, the original fourth-order function is transformed into a second-order function, which is then optimized by an iterative least-square (ILS) algorithm. In this proposed method, the filter length is variable and no more limited as in OQAM-FBMC. Simulation results demonstrate the effectiveness of the method. Performance tradeoffs can be aroused by changing the weighting factor and the filter length. Consequently, the proposed method can be used to design filters with comparable performances to its competitors. It is also possible to design longer filters with better BER or shorter filters that perform better in PAPR, system latency and complexity. In our designs with filter length no more than the subcarrier number plus three, the system BER and PAPR are improved. Meanwhile, the system complexity and latency caused by the prototype filter are reduced. To a certain extent, due to the variable filter length and weighting factor, the proposed method gives the flexibility to design filters for different performance needs.

关键词： Filters Costs Simulation Discrete Fourier transforms Prototypes Peak to average power ratio Minimization Cost function iterative algorithms Complexity theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 50 51 52 53 54 55 56 57 58 59 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：