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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,154 篇 期刊文献
1,749 篇 会议
19 篇 学位论文
1 册 图书

馆藏范围

3,923 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,597 篇 工学
- 2,085 篇 计算机科学与技术...
- 1,473 篇 软件工程
- 711 篇 电气工程
- 603 篇 控制科学与工程
- 327 篇 机械工程
- 313 篇 信息与通信工程
- 149 篇 动力工程及工程热...
- 141 篇 石油与天然气工程
- 123 篇 土木工程
- 120 篇 电子科学与技术（可...
- 88 篇 材料科学与工程（可...
- 85 篇 仪器科学与技术
- 71 篇 交通运输工程
- 70 篇 环境科学与工程（可...
- 68 篇 力学（可授工学、理...
- 63 篇 建筑学
- 59 篇 化学工程与技术
- 52 篇 水利工程
- 52 篇 航空宇航科学与技...
- 44 篇 生物医学工程（可授...
1,872 篇 理学
- 1,472 篇 数学
- 228 篇 系统科学
- 195 篇 统计学（可授理学、...
- 181 篇 物理学
- 62 篇 化学
- 58 篇 生物学
384 篇 管理学
- 332 篇 管理科学与工程(可...
- 72 篇 工商管理
- 49 篇 图书情报与档案管...
89 篇 医学
54 篇 经济学
- 51 篇 应用经济学
26 篇 农学
21 篇 法学
16 篇 教育学
9 篇 文学
3 篇 军事学
2 篇 艺术学

主题

3,923 篇 optimization alg...
271 篇 optimization
177 篇 algorithms
94 篇 machine learning
91 篇 design
64 篇 particle swarm o...
56 篇 optimal control
52 篇 genetic algorith...
51 篇 convergence
46 篇 objective functi...
44 篇 genetic algorith...
40 篇 simulation
38 篇 optimal design
37 篇 converge
37 篇 artificial intel...
32 篇 predictive contr...
32 篇 heuristic algori...
31 篇 optimisation
30 篇 deep learning
30 篇 evolutionary alg...

机构

12 篇 duy tan univ ins...
10 篇 national key lab...
8 篇 amman arab univ ...
7 篇 stanford univers...
7 篇 univ technol syd...
6 篇 georgia inst tec...
6 篇 department of co...
6 篇 google research ...
6 篇 school of artifi...
6 篇 semnan univ dept...
5 篇 politecn milan d...
5 篇 tu wien austria
5 篇 ain shams univ f...
5 篇 google deepmind ...
5 篇 school of data s...
5 篇 school of comput...
5 篇 university of mi...
5 篇 ton duc thang un...
4 篇 college of compu...
4 篇 semnan univ fac ...

作者

12 篇 abualigah laith
11 篇 ehteram mohammad
9 篇 gandomi amir h.
9 篇 hasanipanah mahd...
9 篇 notarstefano giu...
9 篇 ishibuchi hisao
8 篇 zhan zhi-hui
8 篇 zhang jun
7 篇 neumann frank
7 篇 rashid tarik a.
7 篇 ahmed ali najah
7 篇 hasanien hany m.
7 篇 quirynen rien
7 篇 pan jeng-shyang
7 篇 zhang lijun
6 篇 sundaram shreyas
6 篇 neumann aneta
6 篇 wang lei
6 篇 zhang lei
6 篇 yang shengxiang

语言

3,438 篇 英文
430 篇 其他
52 篇 中文
5 篇 土耳其文
4 篇 法文
4 篇 斯洛文尼亚文
3 篇 德文
1 篇 西班牙文
1 篇 塞尔维亚文

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

共 3923 条记录，以下是3841-3850 订阅

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

详细简洁

排序：

Design of Constellation Sets for Multistage Systems

Design of Constellation Sets for Multistage Systems

引用

IEEE Global Communications Conference

作者： Guido Montorsi Politecnico di Torino Dipartimento di Elettronica e Telecomunicazioni

ISBN: (纸本)9781509013296

We consider the problem of designing constellation sets for multistage systems for high spectral efficiencies. In particular we will focus on two-stage systems where the cascaded decoding stages are associated to three types of receivers with different complexities and performances. The optimal receiver (S) processes the symbol LLR and delivers the maximum possible throughput, the simpler BICM receiver (B) processes in parallel bit LLR derived from the observation, and finally the simplest hard receiver (H) takes an ML hard decision on the observation and processes the sequence of estimated bits with algebraic-like decoders. Optimal constellation sets achieving the maximum possible mutual information depend on the target receiver structure and thus requires separate optimization. Using a variation of the optimization algorithm based on simulated annealing previously introduced we provide optimal constellation sets with 16 to 256 point for four variants of the two-stage receiver offering different trade-offs between complexity and performance. We will show that BH receivers, where the first stage uses a BICM approach and the second stage the even simpler hard decision receiver can provide performances within 0.2 bits from the theoretical Shannon limit in a proper range of Signal to Noise Ratio (SNR) if optimal constellation sets are used.

关键词： Receivers CONSTELLATIONS constellation design optimization algorithms SETTING Shannon limit hard-decision decoding signal to noise ratios MULTISTAGE correlators

来源：评论

学校读者我要写书评

暂无评论

Design Automation of Valve Gate Locations and Open Timing for Injection Molding of an Automotive Instrument Panel

Design Automation of Valve Gate Locations and Open Timing fo...

引用

IEEE International Conference on Automation Science and Engineering

作者： C.-H. Park B.-G. Pyo D.-H. Choi PIDOTECH Inc. VMTech Co. Ltd. Department of Mechanical Engineering Hanyang University

ISBN: (纸本)9781467304290

Valve gate locations and open timing for injection molding of an automotive instrument panel is to be determined to minimize the cavity pressure. To achieve design automation for obtaining the solution of this design problem, we first integrated MAPS-3D, a commercial injection molding analysis tool, to PIAnO, a commercial process integration and design optimization (PIDO) tool, using the file parsing technique. Then, we automated an iterative analysis and design procedure using a batch run capability provided by PIAnO. To obtain the optimal design solution, we employed a metamodel-based design optimization method combining an experimental design, a metamodel and an optimization algorithm available in PIAnO. Using the proposed design automation approach, the cavity pressure was found to decrease by 34.2% compared to the initial one, which clearly shows the validity of the proposed approach.

关键词： Computer-Aided Design Injection molding Instrument panels Optimal design VALVE GATE design problems PIANO CAVITY PRESSURE automotive engineering cavity design process optimization algorithms gates

来源：评论

学校读者我要写书评

暂无评论

A core-set approach for distributed quadratic programming in big-data classification

A core-set approach for distributed quadratic programming in...

引用

IEEE Annual Conference on Decision and Control

作者： Giuseppe Notarstefano Department of Engineering Universita del Salento via Monteroni 73100 Lecce Italy

ISBN: (纸本)9781479978878

A new challenge for learning algorithms in cyberphysical network systems is the distributed solution of big-data classification problems, i.e., problems in which both the number of training samples and their dimension is high. Motivated by several problem set-ups in Machine Learning, in this paper we consider a special class of quadratic optimization problems involving a "large" number of input data, whose dimension is "big". To solve these quadratic optimization problems over peer-to-peer networks, we propose an asynchronous, distributed algorithm that scales with both the number and the dimension of the input data (training samples in the classification problem). The proposed distributed optimization algorithm relies on the notion of "core-set" which is used in geometric optimization to approximate the value function associated to a given set of points with a smaller subset of points. By computing local core-sets on a smaller version of the global problem and exchanging them with neighbors, the nodes reach consensus on a set of active constraints representing an approximate solution for the global quadratic program.

关键词： dimensions Set of points incoming data data classification active constraint quadratic programming distributed algorithms Quadratic Peer-to-peer network Distribute learning algorithms optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Sparse Planar Array using Modified Bayesian optimization Algorithm

Synthesis of Sparse Planar Array using Modified Bayesian Opt...

引用

Electromagnetic Metrology Symposium

作者： B. V. Ha R. E. Zich M. Mussetta P. Pirinoli Dipartimento di Energia Politecnico di Milano Dipartimento di Elettronica Politecnico di Torino

ISBN: (纸本)9781467357067

Controlling the position of elements in sparse planar array would be the hardest work in the synthesis procedure since the array has to satisfy multiple design constraints e.g. number of elements, elements spacing and arrays aperture. In this paper, a simple method is implemented to effectively control 2-D sparse array. The approach implements two sets of data to separately manage the x- and y-coordinate of each element in the array. The array is then synthesized as an optimization problem using the recently improved version of Bayesian optimization Algorithm. As a proof of concept, the results of a 108 element sparse planar array are here presented and discussed.

关键词： Planar antennas Elements y-coordinate optimization algorithms arrays synthesis design constraints Dataset Bayesian inference

来源：评论

学校读者我要写书评

暂无评论

Coding Sensor Outputs for Injection Attacks Detection

Coding Sensor Outputs for Injection Attacks Detection

引用

IEEE Annual Conference on Decision and Control

作者： Fei Miao Quanyan Zhu Miroslav Pajic George J. Pappas Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia PA USA 19014 Department of Electrical and Computer Engineering New York University Brooklyn NY USA 11201

ISBN: (纸本)9781467360890

This paper considers a method of coding the sensor outputs in order to detect stealthy false data injection attacks. An intelligent attacker can design a sequence of data injection to sensors that pass the state estimator and statistical fault detector, based on knowledge of the system parameters. To stay undetected, the injected data should increase the state estimation errors while keep the estimation residues in a small range. We employ a coding matrix to the original sensor outputs to increase the estimation residues, such that the alarm will be triggered by the detector even under intelligent data injection attacks. This is a low cost method compared with encryption over sensor communication networks. We prove the conditions the coding matrix should satisfy under the assumption that the attacker does not know the coding matrix yet. An iterative optimization algorithm is developed to compute a feasible coding matrix, and, we show that in general, multiple feasible coding matrices exist.

关键词： State estimation Injections Sensors system parameter cryptography Alarm Output optimization algorithms Satisfaction

来源：评论

学校读者我要写书评

暂无评论

ROBUST COMMON CAROTID ARTERY LUMEN DETECTION IN B-MODE ULTRASOUND IMAGES USING LOCAL PHASE SYMMETRY

ROBUST COMMON CAROTID ARTERY LUMEN DETECTION IN B-MODE ULTRA...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Jose Rouco Aurelio Campilho INEB - Instituto de Engenharia Biomedica Porto Portugal Faculdade de Engenharia Universidade do Porto Rua Roberto Frias 4200-465 Porto Portugal

ISBN: (纸本)9781479903573

This paper presents a new method for automatic common carotid artery detection in B-mode ultrasonography. The proposed method is based on the location of phase symmetry patterns at apropriate scale of analysis. The local phase information is derived from the monogenic signal and isotropic lognormal band-pass filters, and the resulting common carotid artery is located using a dynamic programming optimization algorithm. The experiments show that the proposed method is more robust to noise than previous approaches, although additional research is required for robust common carotid artery detection on the more complicated cases.

关键词： Ultrasonography Common Carotid Arteries Carotid Arteries Ultrasonic Waves images optimization algorithms Symmetry phase symmetry

来源：评论

学校读者我要写书评

暂无评论

An Hybrid Senor Localization Algorithm for Wireless Sensor Networks

An Hybrid Senor Localization Algorithm for Wireless Sensor N...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Lichuan Liu Geetha Mavidi Department of Electrical Engineering Northern Illinois University

ISBN: (纸本)9781479906505

Localization, the determination of geographical location of sensors is a fundamental problem in wireless sensor networks. In this paper we consider a static wireless network in which the reference nodes are static-non moving. We propose a positioning method known as hybrid optimizing algorithm (HOA) which combines steepest decent method and Taylor series expansion method. The steepest decent method converges quickly at initial iterations and has less computational complexity. The performance of Taylor series method depends on initial estimation. We conduct simulation experiments to evaluate the performance of these methods. Results show that HOA achieves better performance on position accuracy as it takes the advantages of both the methods.

关键词： general nodes (unknown location) hybrid optimizing method Localization reference nodes (known location) steepest decent method wireless sensor networks Wireless sensor networks reference node Matrilin-3 Wireless networks Taylor series steepest descent method accuracy of position steeping Geographical Locations optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

High-Throughput Beamforming Receiver for Millimeter Wave Mobile Communication

High-Throughput Beamforming Receiver for Millimeter Wave Mob...

引用

IEEE Global Communications Conference

作者： Bei Yin Shadi Abu-Surra Gary Xu Thomas Henige Eran Pisek Zhouyue Pi Joseph R. Cavallaro ECE Department Rice University Houston TX USA Dallas Technology Laboratory Samsung Electronics Dallas TX USA

ISBN: (纸本)9781479913510

In this paper, we present a novel FPGA-based high-throughput beamforming MIMO receiver for millimeter wave mobile communication. With vast spectrum and small antenna element size, millimeter wave communication becomes very attractive and promising to support next generation mobile communication (5G). However, the high data rate requirement challenges both algorithm and architecture. In order to support the high data rate and to reduce the overhead of selecting the best beam pair, we propose a novel beamforming synchronization scheme more suitable for mobile communication. By further optimizing the algorithm and the architecture, we present a complete mobile receiver based on FPGA, which includes RF frontend, ADC, beamforming control, synchronization, channel estimator, soft MAP detector, and channel decoder. The design operates at 28 GHz carrier frequency with 500 MHz bandwidth. The throughput can reach 1.52 Gbps. We also performed the indoor and outdoor over-the-air transmission field tests. This work provides a platform for future millimeter wave mobile communication research.

关键词： millimeter wave mobile communication beamforming FPGA Beamforming millimeter wave Field programmable gate arrays mobile communication Channel Decoder Building construction ARCHITECTURE Throughput optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

(Nearly) Optimal algorithms for Private Online Learning in Full-information and Bandit Settings 13

(Nearly) Optimal Algorithms for Private Online Learning in F...

引用

Annual Conference on Neural Information Processing Systems

作者： Adam Smith Abhradeep Thakurta Pennsylvania State University Stanford University and Microsoft Research Silicon Valley Campus

ISBN: (纸本)9781632660244

We give differentially private algorithms for a large class of online learning algorithms, in both the full information and bandit settings. Our algorithms aim to minimize a convex loss function which is a sum of smaller convex loss terms, one for each data point. To design our algorithms, we modify the popular mirror descent approach, or rather a variant called follow the approximate leader. The technique leads to the first nonprivate algorithms for private online learning in the bandit setting. In the full information setting, our algorithms improve over the regret bounds of previous work (due to Dwork, Naor, Pitassi and Rothblum (2010) and Jain, Kothari and Thakurta (2012)). In many cases, our algorithms (in both settings) match the dependence on the input length, T, of the optimal nonprivate regret bounds up to logarithmic factors in T. Our algorithms require logarithmic space and update time.

关键词： e-learning algorithms Regret refresh time optimization algorithms LOSS FUNCTION solidification

来源：评论

学校读者我要写书评

暂无评论

Sparse waveform design for all-spectrum channelization

Sparse waveform design for all-spectrum channelization

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： George Sklivanitis Panos P. Markopoulos Stella N. Batalama Dimitris A. Pados Dept. of Electrical Engineering State University of New York at Buffalo 14260 United States of America Dept. of Electrical and Microelectronic Engineering Rochester Institute of Technology NY 14623 United States of America

ISBN: (纸本)9781509041183

We introduce maximum-SINR sparse-binary waveforms that modulate data information symbols from any finite alphabet and span the whole continuum of the available/device-accessible spectrum. We offer an optimal algorithm that designs the proposed waveforms by maximizing the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum-SINR linear receiver. In addition, we offer a suboptimal algorithm for the same problem with significantly reduced computational complexity. The post-filtering SINR improvements attained by the proposed waveforms in a single-input single-output (SISO) communication system with colored interference are presented analytically. Simulation studies compare the proposed waveforms with their conventional non-sparse counterparts and demonstrate their superior SINR performance.

关键词： All-spectrum binary code sequences maximum SINR sparsity waveform design waveforms SINR Traffic channelization optimization algorithms LINEAR RECEIVERS

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共393页 << < 381 382 383 384 385 386 387 388 389 390 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：