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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

911 篇 会议
69 篇 期刊文献
41 册 图书

馆藏范围

1,020 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

493 篇 工学
- 367 篇 计算机科学与技术...
- 160 篇 软件工程
- 132 篇 电气工程
- 69 篇 信息与通信工程
- 69 篇 控制科学与工程
- 27 篇 电子科学与技术（可...
- 19 篇 机械工程
- 13 篇 动力工程及工程热...
- 12 篇 仪器科学与技术
- 10 篇 生物工程
- 9 篇 光学工程
- 9 篇 材料科学与工程（可...
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 力学（可授工学、理...
- 7 篇 冶金工程
- 7 篇 化学工程与技术
- 5 篇 建筑学
228 篇 理学
- 190 篇 数学
- 27 篇 系统科学
- 24 篇 物理学
- 19 篇 统计学（可授理学、...
- 12 篇 生物学
- 7 篇 化学
78 篇 管理学
- 66 篇 管理科学与工程(可...
- 19 篇 工商管理
- 11 篇 图书情报与档案管...
15 篇 医学
- 12 篇 临床医学
11 篇 法学
- 11 篇 社会学
8 篇 经济学
- 8 篇 应用经济学
3 篇 农学
1 篇 教育学

主题

194 篇 optimization
152 篇 genetic algorith...
72 篇 algorithm design...
55 篇 particle swarm o...
53 篇 optimization met...
44 篇 design optimizat...
34 篇 computational mo...
32 篇 convergence
27 篇 heuristic algori...
26 篇 ant colony optim...
25 篇 computer science
25 篇 signal processin...
25 篇 evolutionary com...
24 篇 approximation al...
24 篇 neural networks
23 篇 conferences
22 篇 application soft...
21 篇 clustering algor...
21 篇 mathematical mod...
20 篇 image segmentati...

机构

10 篇 hubei univ techn...
8 篇 hubei university...
7 篇 computer systems...
6 篇 school of comput...
4 篇 wuhan fiberhome ...
4 篇 graduate school ...
4 篇 jožef stefan int...
3 篇 fujian prov univ...
3 篇 democritus unive...
3 篇 lviv polytechnic...
3 篇 mälardalen unive...
3 篇 state key labora...
2 篇 lawrence berkele...
2 篇 rutgers state un...
2 篇 všb-tu ostrava 1...
2 篇 wroclaw universi...
2 篇 feecs vå b - tec...
2 篇 ind technol res ...
2 篇 feecs department...
2 篇 computer science...

作者

12 篇 ye zhiwei
11 篇 zhiwei ye
6 篇 klaus jansen
4 篇 zelinka ivan
4 篇 ajith abraham
4 篇 václav snášel
4 篇 korošec peter
3 篇 hui wang
3 篇 wang hui
3 篇 keiichi tamura
3 篇 zhan sikai
3 篇 josé d. p. rolim
3 篇 hajime kitakami
3 篇 chunzhi wang
3 篇 huamin wang
3 篇 takashi hasuike
3 篇 šilc jurij
3 篇 jin can
3 篇 senkerik roman
3 篇 sun shuang

语言

999 篇 英文
11 篇 其他
9 篇 中文
2 篇 俄文

检索条件"任意字段=International Workshop on Multilevel Optimization - Algorithms and Applications"

共 1021 条记录，以下是921-930 订阅

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

详细简洁

排序：

Performance of UWB position estimation based on time-of-arrival measurements

Performance of UWB position estimation based on time-of-arri...

引用

IEEE Conference on Ultra Wideband Systems and Technologies

作者： Kegen Yu I. Oppermann Centre for Wireless Communications University of Oulu Finland

The paper reports on the development of a low-cost device for low data rate communications with tracking and positioning capabilities. We investigate the performance of two different position estimation methods based on the estimate of the time-of-arrival (TOA) of the UWB signal at a set of receivers/sensors. The performance evaluation is performed in terms of the root mean-squared (RMS) error of the position coordinates estimation and the failure rate. We first study the direct-calculation method which gives exact solutions of a set of simultaneous equations. We then study one of the classical nonlinear optimization techniques, the Davidon-Fletcher-Powell (DFP) quasi-Newton algorithm. Both the direct-calculation method and the nonlinear optimization algorithms do not require any knowledge of the TOA estimation error variance or distribution. This advantage would be attractive for practical applications.

关键词： Position measurement Taylor series Wireless communication Equations optimization methods Time of arrival estimation Sensor systems Synchronization Clocks Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Solving constrained optimization via a modified genetic particle swarm optimization 08

Solving constrained optimization via a modified genetic part...

引用

Proceedings of the 1st international conference on Forensic applications and techniques in telecommunications, information, and multimedia and workshop

作者： Liu Zhiming Wang Cheng Li Jian Huazhong University of Science & Technology Hubei University of Education Wuhan Hubei China

ISBN: (纸本)9789639799196

The genetic particle swarm optimization (GPSO) was derived from the original particle swarm optimization (PSO), which is incorporated with the genetic reproduction mechanisms, namely crossover and mutation. Based on which a modified genetic particle swarm optimization (MGPSO) was introduced to solve constrained optimization problems. In which the differential evolution (DE) was incorporated into GPSO to enhance search performance. At each generation GPSO and DE generated a position for each particle, respectively, and the better one was accepted to be a new position for the particle. To compare and ranking the particles, the lexicographic order ranking was introduced. Moreover, DE was incorporated to the original PSO with the same method, which was used to be compared with MGSPO. MGPSO were experimented with well-known benchmark functions. By comparison with original PSO algorithms and the evolution strategy, the simulation results have shown its robust and consistent effectiveness.

关键词： genetic algorithm constrained optimization particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Improving Performance of Structured-Memory, Data-Intensive applications on Multi-core Platforms via a Space-Filling Curve Memory Layout

Improving Performance of Structured-Memory, Data-Intensive A...

引用

IEEE international Symposium on Parallel and Distributed Processing workshops and Phd Forum (IPDPSW)

作者： E. Wes Bethel David Camp David Donofrio Mark Howison Lawrence Berkeley National Laboratory Berkeley CA USA Lawrence Berkeley National Laboratory and Brown University Providence RI USA

ISBN: (纸本)9781467376853

Many data-intensive algorithms -- particularly in visualization, image processing, and data analysis -- operate on structured data, that is, data organized in multidimensional arrays. While many of these algorithms are quite numerically intensive, by and large, their performance is limited by the cost of memory accesses. As we move towards the exascale regime of computing, one central research challenge is finding ways to minimize data movement through the memory hierarchy, particularly within a node in a shared-memory parallel setting. We study the effects that an alternative in-memory data layout format has in terms of runtime performance gains resulting from reducing the amount of data moved through the memory hierarchy. We focus the study on shared-memory parallel implementations of two algorithms common in visualization and analysis: a stencil-based convolution kernel, which uses a structured memory access pattern, and ray casting volume rendering, which uses a semi-structured memory access pattern. The question we study is to better understand to what degree an alternative memory layout, when used by these key algorithms, will result in improved runtime performance and memory system utilization. Our approach uses a layout based on a Z-order (Morton-order) space-filling curve data organization, and we measure and report runtime and various metrics and counters associated with memory system utilization. Our results show nearly uniform improved runtime performance and improved utilization of the memory hierarchy across varying levels of concurrency the applications we tested. This approach is complementary to other memory optimization strategies like cache blocking, but may also be more general and widely applicable to a diverse set of applications.

关键词： Layout Runtime Arrays Three-dimensional displays Algorithm design and analysis Indexes Data visualization

来源：评论

学校读者我要写书评

暂无评论

Simulating game playing to solve Max-SAT

Simulating game playing to solve Max-SAT

引用

international workshop on Advanced Computational Intelligence (IWACI)

作者： Chenchen Ding Jinlong Li USTC-Birmingham Joint Research Institution in Intelligent Computation and Its Applications(UBRI) University of Science and Technology of China Hefei China

The Max-SAT can naturally model many practical optimization problems. In this paper, we propose an incomplete Max-SAT algorithm bgmaxsat, which utilizes boolean game to model and solve Max-SAT problems. Then we improve bgmaxsat by adding a new agents grouping criterion to solve massive instances, called bgmaxsat_m. In order to obtain quality solution quickly, we design two mechanisms to accelerate the game playing. Finally, we evaluate our algorithms against with the state-of-the-art SLS-based algorithms CCLS and Swcca-ms on 87 selected Max-SAT instances. The experimental results show that bgmaxsat finds optimal solutions on 65(65) general instances with competitive CPU time, and bgmaxsat_m finds better solutions on 19(22) massive instances with less CPU time.

关键词： Games Computational modeling Approximation algorithms Machine learning algorithms Search problems Acceleration Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Hardware task scheduling optimizations for reconfigurable computing

Hardware task scheduling optimizations for reconfigurable co...

引用

international workshop on High-Performance Reconfigurable Computing Technology and applications, HPRCTA

作者： Miaoqing Huang Harald Simmler Proshanta Saha Tarek El-Ghazawi NSF Center for High-Performance Reconfigurable Computing (CHREC) Department of Electrical and Computer Engineering George Washington University USA

Reconfigurable computers (RC) can provide significant performance improvement for domain applications. However, wide acceptance of todaypsilas RCs among domain scientist is hindered by the complexity of design tools and the required hardware design experience. Recent developments in hardware/software co-design methodologies for these systems provide the ease of use, but they are not comparable in performance to manual co-design. This paper aims at improving the overall performance of hardware tasks assigned to FPGA. Particularly the analysis of inter-task communication as well as data dependencies among tasks are used to reduce the number of configurations and to minimize the communication overhead and task processing time. This work leverages algorithms developed in the RC and reconfigurable hardware (RH) domains to address efficient use of hardware resources to propose two algorithms, weight-based scheduling (WBS) and highest priority first-next fit (HPF-NF). However, traditional resource based scheduling alone is not sufficient to reduce the performance bottleneck, therefore a comprehensive algorithm is necessary. The reduced data movement scheduling (RDMS) algorithm is proposed to address dependency analysis and inter-task communication optimizations. Simulation shows that compared to WBS and HPF-NF, RDMS is able to reduce the amount of FPGA configurations to schedule random generated graphs with heavy weight nodes by 30% and 11% respectively. Additionally, the proof-of-concept implementation of a complex 13-node example task graph on the SGI RC100 reconfigurable computer shows that RDMS is not only able to trim down the amount of necessary configurations from 6 to 4 but also to reduce communication overhead by 48% and the hardware processing time by 33%.

关键词： Processor scheduling Field programmable gate arrays Scheduling algorithm High performance computing Application software Software performance Hardware design languages optimization methods Algorithm design and analysis Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Heuristic Estimation of Temperature-Dependant Model Parameters of Li-Po Batteries for UAV applications

Heuristic Estimation of Temperature-Dependant Model Paramete...

引用

IEEE Metrology for Aerospace

作者： Aleksander Suti Gianpietro Di Rito Giuseppe Mattei Dept. of Civil and Industrial Engineering University of Pisa Pisa Italy Propulsion Team Sky Eye Systems Cascina Italy

This work deals with the system identification of Thevenin models of Li-Po batteries for UAV applications. Starting from the results of an experimental hybrid pulse-power characterization of a battery pack carried out at different temperatures (0°C, 15°C, 49°C) and within the operative range of state-of-charge (>10%), the model parameters are identified via three heuristic optimization algorithms, based on particle-swarm, teaching-learning and differential evolution techniques. Differently from conventional approaches typically applied by commercial CAE tools (e.g. Matlab), the proposed techniques are directly applied to the whole time history of the measurements. The results highlight that the particle-swarm method exhibits the fastest convergence, but it requires to initially define the algorithm weighing coefficients. This is not needed for teaching-learning based optimization, but computational effort strongly increases to achieve satisfactory accuracy. The differential evolution technique provides intermediate performances, especially if the total computation time is also considered. The case study is referred to the 1850 mAh/6 cells/22.2 V Li-Po battery pack employed in the lightweight fixed-wing UAV Rapier X-25, developed by Sky Eye Systems (Italy).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Identify important spectrum bands for classification using importances of wrapper selection applied to hyperspectral data

Identify important spectrum bands for classification using i...

引用

international workshop on Computational Intelligence for Multimedia Understanding (IWCIM)

作者： Arnaud Le Bris Nesrine Chehata Xavier Briottet Nicolas Paparoditis IGN/SR MATIS Saint Mandé France EA 4592 G&E University of Bordeaux Pessac Cedex France IRD/UMR LISAH EI Menzah 4 Tunis Tunisia institution French Aerospace Lab France

Intermediate results of two state-of-the-art wrapper feature selection approaches (GA and SFFS) applied to hyperspectral data sets were used to derive information about band importance for specific land cover classification problems. Several feature selection performance scores (classification accuracies, Bhattacharyya separability) were tested. The impact of the number of selected bands on classification accuracy was obtained thanks to SFFS, while a band importance measure was derived from intermediate sets of bands tested by GA. Such results are a first step toward the identification of the most suitable spectral bands to design superspectral camera systems dedicated to specific applications (e.g. classification of urban land cover and material maps).

关键词： Support vector machines Accuracy Genetic algorithms Hyperspectral imaging optimization Radio frequency Kernel

来源：评论

学校读者我要写书评

暂无评论

A QoS-aware multicast overlay spanning tree protocol for multimedia applications in MANETs

A QoS-aware multicast overlay spanning tree protocol for mul...

引用

international Telecommunication Networking workshop on QoS in Multiservice IP Networks, IT-NEWS

作者： Hakim Badis LABINFO-IGM UMR CNRS 8049 Université Paris-Est France

Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g. bounded delay). Traditional multicast routing algorithms used for solving the Sterner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. Moreover, with QoS metrics consideration, the problem of computing optimal constrained multicast tree is known as NP-complete. In this paper, we propose a new QoS-aware Multicast Overlay Spanning Tree (QMOST) protocol to support multiple-metric routing criteria in mobile ad hoc networks. It computes low cost trees with multiple-metric bounded paths in polynomial time using an efficient source- based optimization heuristic. Unlike common multicast protocols where data packets are transmitted in a broadcast mode, in QMOST data packets are encapsulated in unicast packets before being forwarded to the overlay tunnels. Multicasting is achieved when each node forwards multicast packets to its successors in the overlay tree. QMOST must be used in conjunction with a unicast QoS link state protocol (QOLSR) and can be integrated in a QoS model. This later offers the needed service guarantee using distributed admission control to check if the multicast QoS flows are admissible, resource reservation mechanism and congestion control. Simulation results show that our QMOST protocol achieves better performance than the QOLSR protocol.

关键词： Multicast protocols Quality of service Unicast Videoconference Delay Multicast algorithms Routing protocols Mobile ad hoc networks Cost function Polynomials

来源：评论

学校读者我要写书评

暂无评论

Tuning neural networks with stochastic optimization

Tuning neural networks with stochastic optimization

引用

IEEE international workshop on Intelligent Robots and Systems (IROS)

作者： A. Dubrawski Institute of Fundamental Technological Research Warsaw Poland

This paper describes a method for automated tuning of hyper-parameters of supervised learning systems. It emerges from stochastic aproximation, uses memory-based learning principles, follows certain ideas of experimental design and employs a particular approach to resampling called stochastic validation. Potential usefulness of the proposed approach is illustrated with the fuzzy-ARTMAP neural network application to learning a qualitative positioning of an indoor mobile robot equipped with ultrasonic range sensors. Automatically selected setpoints allow the system to reach a similar or better performance in comparison to that achieved by human experts in all studied cases. The presented method may serve as a design tool in practical applications of supervised learning algorithms.

关键词： Neural networks Stochastic processes Robot sensing systems Supervised learning Mobile robots Vehicles Design for experiments Humans Algorithm design and analysis Sensor phenomena and characterization

来源：评论

学校读者我要写书评

暂无评论

Data access optimization on grid systems

Data access optimization on grid systems

引用

IEEE international workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： L. Csaba Lorincz T. Kozsik A. Ulbert Z. Horvath Department of Programming Languages and Compilers Eötövos Loránd University Budapest Hungary

The execution of data intensive grid applications still raises several questions regarding job scheduling, data migration and replication. The optimization techniques applied by these services significantly determine how fast a job can be executed and how early the user can get the execution results. In this paper we present strategies for scheduling the execution of data intensive applications. We deem that by taking into account the way applications access their data, the grid middleware can achieve lower response times and earlier execution results. Therefore, we (1) monitor the execution of jobs and gather the necessary resource access information, (2) analyze the compiled information and generate a description of the behavior of the job, and (3) use the generated behavior description to implement optimized scheduling algorithms. This technique can be extremely useful in the case of parameter-sweep applications.

关键词： Middleware Monitoring Processor scheduling Resource management Computer languages Program processors Electronic mail Delay Information analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共103页 << < 89 90 91 92 93 94 95 96 97 98 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：