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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

494 篇 工学
- 368 篇 计算机科学与技术...
- 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...
56 篇 particle swarm o...
53 篇 optimization met...
44 篇 design optimizat...
34 篇 computational mo...
33 篇 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

语言

1,000 篇 英文
10 篇 其他
9 篇 中文
2 篇 俄文

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

共 1022 条记录，以下是461-470 订阅

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

详细简洁

排序：

Proceedings of IA3 2013 - 3rd workshop on Irregular applications: Architectures and algorithms, Held in Conjunction with SC 2013: The international Conference for High Performance Computing, Networking, Storage and Analysis

Proceedings of IA3 2013 - 3rd Workshop on Irregular Applicat...

引用

3rd workshop on Irregular applications: Architectures and algorithms, IA3 2013 - Held in Conjunction with the international Conference for High Performance Computing, Networking, Storage and Analysis, SC 2013

ISBN: (纸本)9781450325035

The proceedings contain 12 papers. The topics discussed include: a novel finite element method assembler for co-processors and accelerators;the energy case for graph processing on hybrid CPU and GPU systems;a synthetic task model for HPC-grade optical network performance evaluation;maximizing the performance of irregular applications on multithreaded, NUMA;analysis of computing and energy performance of multicore, NUMA, and manycore platforms for an irregular application;in-memory data compression for sparse matrices;on the GPU performance of cell-centered finite volume method over unstructured tetrahedral meshes;nonzero pattern analysis and memory access optimization in GPU-based sparse LU factorization for circuit simulation;register level sort algorithm on multi-core SIMD processors;parallel sparse FFT;an AMR computation and communication dependency and analysis methodology;and parallel implementations of ensemble data assimilation for atmospheric prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

applications of Ground Penetrating Radar in Civil Engineering - COST Action TU1208

Applications of Ground Penetrating Radar in Civil Engineerin...

引用

7th international workshop on Advanced Ground-Penetrating Radar (IWAGPR)

作者： Pajewski, Lara Benedetto, Andrea Derobert, Xavier Giannopoulos, Antonis Loizos, Andreas Manacorda, Guido Marciniak, Marian Plati, Christina Schettini, Giuseppe Trinks, Immo Roma Tre Univ Dept Engn Via Vito Volterra 62 I-00146 Rome Italy LUNAM Univ IFSTTAR F-44344 Bouguenais 4 France Univ Edinburgh Inst Infrastruct & Environm Sch Engn Edinburgh EH8 3JL Midlothian Scotland NTUA Dept Transportat Planning & Engn Athens 15773 Greece IDS Ingn Sistemi SpA Georadar Div I-56121 Pisa Italy Inst Natl Telecommun Warsaw 04894 Poland Ludwig Boltzmann Inst Archaeol Prospect & Virtu A-1190 Vienna Austria

ISBN: (纸本)9781479909407;9781479909377

This paper focuses on the use of Ground Penetrating Radar (GPR) in civil engineering. Open issues in this field are identified and desirable advances in GPR technology, application procedures, data processing algorithms and analysis tools, are addressed. European associations, institutes and consortia interested in this topic are mentioned, together with the main relevant international events. The new COST (European COoperation in Science and Technology) Action TU1208 "Civil Engineering applications of Ground Penetrating Radar" is presented, started in April 2013: this interdisciplinary project offers important research opportunities and will strengthen European excellence in all the fields concerning the success of GPR technique, with a main focus on its applications in civil engineering. Four Working Groups (WGs) carry out the research activities: WG1 focuses on the design of innovative GPR equipment, on the building of prototypes, as well as on the testing and optimization of new systems;WG2 focuses on the GPR surveying of pavement, bridges, tunnels and buildings, as well as on the sensing of underground utilities and voids;WG3 deals with the development of electromagnetic forward and inverse scattering methods and of advanced data processing algorithms;WG4 explores the use of GPR in fields different from civil engineering and the integration of GPR with other nondestructive testing techniques. The COST Action TU1208 is still open to the participation of new parties: in this paper, information is provided for scientists and scientific institutions willing to join the Action and participate to its activities.

关键词： Ground Penetrating Radar Non-Destructive Testing Electromagnetic Scattering Civil Engineering

来源：评论

学校读者我要写书评

暂无评论

Proceedings of 2nd international workshop on Big Data, Streams and Heterogeneous Source Mining: algorithms, Systems, Programming Models and applications, BigMine 2013 - Held in Conjunction with SIGKDD 2013 Conference

Proceedings of 2nd International Workshop on Big Data, Strea...

引用

2nd Int. workshop on Big Data, Streams and Heterogeneous Source Mining: algorithms, Systems, Programming Models and applications, BigMine 2013 - Held in Conj. with SIGKDD 2013 Conf.

ISBN: (纸本)9781450323246

The proceedings contain 14 papers. The topics discussed include: soft-CsGDT: soft cost-sensitive Gaussian decision tree for cost-sensitive classification of data streams;searching time series with Hadoop in an electric power company;long-memory time series ensembles for concept shift detection;estimating building simulation parameters via Bayesian structure learning;solving combinatorial optimization problems using relaxed linear programming: a high performance computing perspective;CAPRI: a tool for mining complex line patterns in large log data;direct out-of-memory distributed parallel frequent pattern mining;TV predictor: personalized program recommendations to be displayed on SmartTVs;data-driven study of urban infrastructure to enable city-wide ubiquitous computing;pushing constraints into data streams;forecasting building occupancy using sensor network data;maintaining connected components for infinite graph streams;and an architecture for detecting events in real-time using massive heterogeneous data sources.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Maximizing the performance of irregular applications on multithreaded, NUMA systems

Maximizing the performance of irregular applications on mult...

引用

作者： Cong, Guojing Wen, Huifang IBM TJ Watson Research Center 1101 Kitchawan Road Route 134 Yorktown Heights NY 10598 United States

ISBN: (纸本)9781450325035

In modern shared-memory systems, the communication latency and available resources for a group of logical processors are determined by their relative position in the hierarchy of chips, cores, and hardware threads. Thus the performance of multithreaded applications varies with the mapping of software threads to logical processors. In our study we observe huge variation in application performance under different mappings. Moreover, applications with irregular access patterns perform poorly under the default mapping. We maximize application performance by balancing communication overhead and available resources. Remote access overhead in irregular applications dominates execution time and can not be reduced by mapping alone on NUMA systems when the logical processors span multiple chips. In addition to new data replication and distribution optimizations, we improve geographical locality by matching access pattern to the data layout. We further propose a locality-centric optimization for simultaneously reducing remote accesses and improving cache performance. Our approach achieves better performance than prior NUMA-specific techniques. © 2013 ACM.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Approximation and Online algorithms - 10th international workshop, WAOA 2012, Revised Selected Papers

Approximation and Online Algorithms - 10th International Wor...

引用

10th international workshop on Approximation and Online algorithms, WAOA 2012

ISBN: (纸本)9783642380150

The proceedings contain 22 papers. The topics discussed include: independent set with advice: the impact of graph knowledge;online multi-commodity flow with high demands;on the complexity of the regenerator location problem - treewidth and other parameters;online exploration of polygons with holes;on minimum-and maximum-weight minimum spanning trees with neighborhoods;asymptotically optimal online page migration on three points;R-LINE: a better randomized 2-server algorithm on the line;competitive-ratio approximation schemes for makespan scheduling problems;online primal-dual for non-linear optimization with applications to speed scaling;approximating the throughput by coolest first scheduling;a unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games;improved approximation guarantees for lower-bounded facility location;and a 4-approximation for the height of drawing 2-connected outer-planar graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Investigation of optimization-Based Reconstruction for Intra-Operative Neurological Imaging

Investigation of Optimization-Based Reconstruction for Intra...

引用

60th IEEE Nuclear Science Symposium (NSS) / Medical Imaging Conference (MIC) / 20th international workshop on Room-Temperature Semiconductor X-ray and Gamma-ray Detectors

作者： Han, Xiao Oishi, Satoru Satow, Tetsu Yokoyama, Hiromichi Yamada, Masanobu Silver, Michael D. Chang, Yu-Bing Sidky, Emil Y. Pan, Xiaochuan Univ Chicago Dept Radiol Chicago IL 60637 USA

ISBN: (纸本)9781479905348

Intra-operative C-arm cone-beam CT (CBCT) provides significant technical and workflow benefits for neurological interventions. Current C-arm CBCT employs FDK-type algorithms for image reconstruction, which require densely sampled projection data. This imaging practice incurs a large amount of radiation dose and prolonged scanning time. Yet, the reconstruction is susceptible to artifacts caused by both geometry and physical factors such as noise. In this work, we investigated and evaluated the adaptation of optimization-based reconstruction to C-arm-CBCT-based neurological imaging from full-and half-view patient data. The adaptation mainly entailed accurate incorporation of C-arm geometry and appropriate selection of algorithm parameters. The results show that optimization-based algorithms can yield images of effectively suppressed noise and shading artifacts, from half of the amount of data acquired in current clinical applications.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Personal tour planning incorporating standard tour routes and tourist satisfaction

Personal tour planning incorporating standard tour routes an...

引用

2013 IEEE 6th international workshop on Computational Intelligence and applications, IWCIA 2013

作者： Hasuike, Takashi Tsubaki, Hiroe Katagiri, Hideki Tsuda, Hiroshi Graduate School of Information Science and Technology Osaka University 2-1 Yamadaoka Suita Osaka 565-0871 Japan Department of Data Science Institute of Statistical Science 10-3 Midorimachi Tachikawa Tokyo 190-8562 Japan Graduate School of Engineering Hiroshima University 1-4-1 Kagamiyama Higashi-Hiroshima Hiroshima 739-8527 Japan Faculty of Science and Engineering Doshisha University 1-3 Tatara Miyakodani Kyotanabe Kyoto 610-0321 Japan

ISBN: (纸本)9781467357265

This paper proposes a personal tour planning problem incorporating general tour routes and tourists satisfactions for sightseeing places based on some purposes of tourism. In order to construct a tour route, time-dependent satisfactions, traveling and activity duration times for sightseeing should be considered, but it is difficult to represent the time-dependent model using general static network models. Therefore, Time-Expanded Network (TEN) is introduced, which contains a copy to the set of nodes in the underlying static network for each discrete time step, and it turns the problem of determining an optimal flow over time into a classical static network flow problem. The proposed model is formulated as a bi-objective 0-1 integer programming problem maximizing the total satisfaction value and minimizing the difference from the best plan of standard tour routes. It also equivalently transformed into several existing tour planning problems using some natural assumptions and the concept of Pareto optimal solution, which can be applied existing useful combinatorial optimization and soft computing algorithms. © 2013 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Nature Inspired Cooperative Strategies for optimization (NICSO 2013): Learning, optimization and Interdisciplinary applications

引用

2013年

作者： Germán Terrazas Fernando E B Otero Antonio David Masegosa

ISBN: (纸本)9783319016917

Biological and other natural processes have always been a source of inspiration for computer science and information technology. Many emerging problem solving techniques integrate advanced evolution and cooperation strategies, encompassing a range of spatio-temporal scales for visionary conceptualization of evolutionary computation. This book is a collection of research works presented in the VI international workshop on Nature Inspired Cooperative Strategies for optimization (NICSO) held in Canterbury, UK. Previous editions of NICSO were held in Granada, Spain (2006 & 2010), Acireale, Italy (2007), Tenerife, Spain (2008), and Cluj-Napoca, Romania (2011). NICSO 2013 and this book provides a place where state-of-the-art research, latest ideas and emerging areas of nature inspired cooperative strategies for problem solving are vigorously discussed and exchanged among the scientific community. The breadth and variety of articles in this book report on nature inspired methods and applications such as Swarm Intelligence, Hyper-heuristics, Evolutionary algorithms, Cellular Automata, Artificial Bee Colony, Dynamic optimization, Support Vector Machines, Multi-Agent Systems, Ant Clustering, Evolutionary Design Optimisation, Game Theory and other several Cooperation Models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A hybridized particle swarm optimization with expanding neighborhood topology for the feature selection problem

A hybridized particle swarm optimization with expanding neig...

引用

8th international workshop on Hybrid Metaheuristics, HM 2013

作者： Marinakis, Yannis Marinaki, Magdalene Decision Support Systems Laboratory Department of Production Engineering and Management Technical University of Crete Chania Greece Industrial Systems Control Laboratory Department of Production Engineering and Management Technical University of Crete Chania Greece

ISBN: (纸本)9783642385155

This paper introduces a new algorithmic nature inspired approach that uses a hybridized Particle Swarm optimization algorithm with a new neighborhood topology for successfully solving the Feature Selection Problem (FSP). The Feature Selection Problem is an interesting and important topic which is relevant for a variety of database applications. The proposed algorithm for the solution of the FSP, the Particle Swarm optimization with Expanding Neighborhood Topology (PSOENT), combines a Particle Swarm optimization (PSO) algorithm and the Variable Neighborhood Search (VNS) strategy. As, in general, the structure of the social network affects strongly a PSO algorithm, the proposed method by using an expanding neighborhood topology manages to increase the performance of the algorithm. As the algorithm starts from a small size neighborhood and by increasing (expanding) the size of the neighborhood, it ends to a neighborhood that includes all the swarm, it manages to take advantage of the exploration capabilities of a global neighborhood structure and of the exploitation abilities of a local neighborhood structure. In order to test the effectiveness and the efficiency of the proposed method we use data sets of different sizes and compare the proposed method with a number of other PSO algorithms and other algorithms from the literature. © 2013 Springer-Verlag.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms for the maximum clique problem on massive sparse graphs

Fast algorithms for the maximum clique problem on massive sp...

引用

10th international workshop on algorithms and Models for the Web Graph, WAW 2013

作者： Pattabiraman, Bharath Patwary, Md. Mostofa Ali Gebremedhin, Assefaw H. Liao, Wei-Keng Choudhary, Alok Northwestern University Evanston IL United States Purdue University West Lafayette IN United States

ISBN: (纸本)9783319035352

The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide Web. There exist several algorithms for the problem with acceptable runtimes for certain classes of graphs, but many of them are infeasible for massive graphs. We present a new exact algorithm that employs novel pruning techniques and is able to quickly find maximum cliques in large sparse graphs. Extensive experiments on different kinds of synthetic and real-world graphs show that our new algorithm can be orders of magnitude faster than existing algorithms. We also present a heuristic that runs orders of magnitude faster than the exact algorithm while providing optimal or near-optimal solutions. © 2013 Springer international Publishing.

关键词： optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共103页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：