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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78,668 篇 会议
4,290 篇 期刊文献

馆藏范围

82,958 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,626 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,761 篇 电气工程
- 2,980 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,477 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,416 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 83 篇 核科学与技术
- 69 篇 光学工程
1,906 篇 理学
- 955 篇 系统科学
- 515 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,750 篇 管理学
- 1,686 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
247 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,958 篇 algorithm design...
5,906 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,549 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,980 篇 convergence
3,964 篇 performance anal...
3,643 篇 data mining
3,580 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,987 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
71 篇 school of comput...
51 篇 department of el...
49 篇 state key labora...
49 篇 school of electr...
46 篇 tsinghua univers...
45 篇 institute for in...
45 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
35 篇 department of co...
35 篇 department of co...
33 篇 department of el...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
37 篇 li li
33 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

81,760 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm Design And Analysis"

共 82958 条记录，以下是671-680 订阅

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

详细简洁

排序：

Improving Valiant Routing for Slim Fly Networks 46

Improving Valiant Routing for Slim Fly Networks

引用

46th International Conference on Parallel Processing Workshops (ICPPW)

作者： Han, Deyu Wang, Zhaofeng Bunde, David P. Carnegie Mellon Univ Pittsburgh PA 15213 USA Knox Coll Galesburg IL 61401 USA

ISBN: (纸本)9781538610442

Valiant routing, the use of a random intermediate node to distribute network traffic, has been proposed for a number of recent HPC network topologies. It is also commonly used as a bulding block for adaptive routing algorithms, which use shortest path routes when possible, but revert to Valiant routing when necessary to avoid hot spots. We show that the version of Valiant routing proposed for the Slim fly topology can cause messages to follow loops, using an edge in both directions before returning to edges of the original shortest path. Removing these loops in the UGAL-L adaptive routing algorithm is shown to provide slight improvements in average latency and also allow the network to carry up to 12% more traffic before saturation.

关键词： Routing Optical switches Topology Network topology Parallel processing algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Trajectory planning and fuzzy control for perpendicular parking 13

Trajectory planning and fuzzy control for perpendicular park...

引用

IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI)

作者： Das, Soumyo Yarlagadda, Yamini Vora, Prashantkumar B. Nair, Sabarish R. P. KPIT Technol Ltd Bangalore Karnataka India

ISBN: (纸本)9781509060641

This paper discusses about the trajectory planning and controlled maneuvering of the vehicle in parking assist mode. The objective of the proposed algorithm is to use low-cost hardware like ultrasonic sensor in order to provide automated parking assist to the vehicle. The concept of grid occupancy is formulated in free space detection algorithm to compute lateral-longitudinal grid cell vacancy. The vehicle will enable automated parking assist mode for controlled maneuvering on completion of free space detection followed by path planning. The reference planned path is an optimized trajectory with single maneuver for the vehicle to traverse in a free parking space. The localized trajectory and control algorithm of the perpendicular parking have been designed with reference to perception sensor input. The controller facilitates the intelligent navigation of vehicle based on measured obstacle free clearance distance and reference point. The steering control algorithm based on fuzzy logic is designed to provide an optimized maneuvering of the host vehicle in perpendicular parking space. In order to ease parking effort, an innovative approach of combined feedback and feed-forward based fuzzy controller has been illustrated. The controller performance has been evaluated in simulation environment keeping vehicle dynamics model in loop. The test scenario has been modeled in Carmaker to substantiate the optimization of route selection and a smooth transition of vehicle in parking assist mode during maneuvering into an empty parking space.

关键词： Trajectory Aerospace electronics Gears Space vehicles Planning algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Heuristic algorithm for Solving Resource Constrained Project Scheduling Problems

A Heuristic Algorithm for Solving Resource Constrained Proje...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Chand, Shelvin Singh, Hemant Kumar Ray, Tapabrata Univ New South Wales Sch Engn & Informat Technol Canberra ACT Australia

ISBN: (纸本)9781509046010

Resource constrained project scheduling problem (RCPSP) is one of the classical problems in the area of discrete optimization. In this paper we propose an algorithm for solving RCPSP which relies on an adaptive insertion mutation operator that targets different regions of the search space. Neighbourhoods are exploited via forward-backward iterative local search. Furthermore, the algorithm makes use of an archive to ensure better utilization of the schedule budget. The performance of the approach is analysed across various problem complexities associated with J30, J60 and J120 full instance sets of PSPLib with budgets of 1,000, 5,000 and 50,000 schedules. The study provides insights on the performance of the algorithm i.e. why the performance is good for particular instances and not as good for others.

关键词： Schedules Sociology Statistics algorithm design and analysis Maintenance engineering Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

algorithm Optimization Framework for Advanced Driver Assistance Systems

Algorithm Optimization Framework for Advanced Driver Assista...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Janjatovic, Joakim Ostojic, Radivoje Velikic, Gordana Maruna, Tomislav Fac Tech Sci Novi Sad Serbia RT RK LLC Novi Sad Serbia

ISBN: (纸本)9781509055449

With the rapid technology development of systems that assist drivers, the lack of uniform support for efficient algorithm development has emerged. We propose a universal Software Development Kit (SDK) concept with common optimization routines that can be applied to typical Advanced Driver Assistance Systems (ADAS) algorithms. The evaluation confirmed that the SDK decreased execution time for ADAS algorithms and works seamlessly across different embedded architectures.

关键词： Optimization algorithm design and analysis Hardware Software algorithms Libraries Advanced driver assistance systems Vehicles

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Enduing and Identifying the Information of Topological Entities in 3D Graphics 2

An Algorithm for Enduing and Identifying the Information of ...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Qiujiao Wang School of Mathematics Southwest Jiaotong University

Feature-based modeling is very popular in generating the shape and history of a product in a three-dimensional(3 D) CAD system. In the previous studies, features are the basic unit of the models. It o

ISBN: (纸本)9781467389808

关键词： Solid modeling Feature extraction Manifolds Three-dimensional displays Flanges algorithm design and analysis Databases

来源：评论

学校读者我要写书评

暂无评论

Density based Clustering over Location Based Services 33

Density based Clustering over Location Based Services

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Rahman, Md Farhadur Liu, Weimo Bin Suhaim, Saad Thirumuruganathan, Saravanan Zhang, Nan Das, Gautam Univ Texas Arlington Arlington TX 76019 USA HBKU QCRI Doha Qatar George Washington Univ Washington DC 20052 USA

ISBN: (纸本)9781509065431

Location Based Services (LBS) have become extremely popular over the past decade, being used on a daily basis by millions of users. Instances of real-world LBS range from mapping services (e.g., Google Maps) to lifestyle recommendations (e.g., Yelp) to real-estate search (e.g., Redfin). In general, an LBS provides a public (often web-based) search interface over its backend database (of tuples with 2D geolocations), taking as input a 2D query point and returning k tuples in the database that are closest to the query point, where k is usually a small constant such as 20 or 50. Such a public interface is often called a k-Nearest-Neighbor, i.e., kNN, interface. In this paper, we consider a novel problem of enabling density based clustering over the backend database of an LBS using nothing but limited access to the kNN interface provided by the LBS. Specifically, a key limit enforced by most real-world LBS is a maximum number of kNN queries allowed from a user over a given time period. Since such a limit is often orders of magnitude smaller than the number of tuples in the LBS database, our goal here is to mine from the LBS a cluster assignment function f(center dot), such that for any tuple t in the database (which may or may not have been accessed), f(center dot) can produce the cluster assignment of t with high accuracy. We conduct a comprehensive set of experiments over benchmark datasets and popular real-world LBS such as Yahoo! Flickr, Zillow, Redfin and Google Maps and demonstrate the effectiveness of our proposed techniques.

关键词： Clustering algorithms Two dimensional displays Google algorithm design and analysis Spatial databases Data mining

来源：评论

学校读者我要写书评

暂无评论

TOWARDS SOLVING MASSIVE REGRESSION PROBLEMS: LEAST SQUARES MULTISPLITTING

TOWARDS SOLVING MASSIVE REGRESSION PROBLEMS: LEAST SQUARES M...

引用

IEEE International Instrumentation and Measurement Technology Conference (I2MTC)

作者： Inghelbrecht, Gilles Barbe, Kurt Vrije Univ Brussel Dept Math DWIS Res Grp Digital Math DIMA Pl Laan 2 B-1050 Brussels Belgium

ISBN: (纸本)9781509035960

Indirect measurements of physical parameters of interest often require a mathematical model in which these parameters are estimated accordingly to the gathered measurements. Within the Least Squares estimation, the parameters are estimated through a regression problem. The presence of dynamics, multiple sensors and high sampling rates lead to high dimensional regression matrices. This paper deals with solving such massive regression problems efficiently. We revisit Renaut's Least Squares Multisplitting (LSMS) technique aimed at solving the ordinary least squares problem in parallel. The LSMS decomposes the design matrix column-wise into several (possibly overlapping) blocks. The global least squares solution is subsequently replaced by an equivalent set of local least squares problems which are to be solved in parallel. At every iteration step the local solutions are recombined using an appropriate weighting scheme. This allows for a scalable and highly parallel implementation aimed at distributed systems. We study how to decompose the global estimation problem in smaller subproblems and quantify the effects of various possible partitions. The method is illustrated with dedicated numerical simulations and a toy application in the area of sensor fusion.

关键词： Convergence Estimation Mathematical model algorithm design and analysis Matrix decomposition Complexity theory Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Streaming Bayesian inference: theoretical limits and mini-batch approximate message-passing 55

Streaming Bayesian inference: theoretical limits and mini-ba...

引用

55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Manoel, Andre Krzakala, Florent Tramel, Eric W. Zdeborova, Lenka Univ Paris Saclay CEA Neurospin Paris France UPMC PSL CNRS LPS ENS Paris France Sorbonne Univ Paris France OWKIN France Paris France Univ Paris Saclay CEA CNRS IPhT Paris France

ISBN: (纸本)9781538632666

In statistical learning for real-world large-scale data problems, one must often resort to "streaming" algorithms which operate sequentially on small batches of data. In this work, we present an analysis of the information-theoretic limits of mini-batch inference in the context of generalized linear models and low-rank matrix factorization. In a controlled Bayes-optimal setting, we characterize the optimal performance and phase transitions as a function of mini-batch size. We base part of our results on a detailed analysis of a mini-batch version of the approximate message-passing algorithm (Mini-AMP), which we introduce. Additionally, we show that this theoretical optimality carries over into real-data problems by illustrating that Mini-AMP is competitive with standard streaming algorithms for clustering.

关键词： Computational modeling Inference algorithms algorithm design and analysis Analytical models Approximation algorithms Sparse matrices Mutual information

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Framework for Synthesizing Stencil algorithms on FPGAs using OpenCL Model 17

A Comprehensive Framework for Synthesizing Stencil Algorithm...

引用

54th ACM/EDAC/IEEE design Automation Conference (DAC)

作者： Wang, Shuo Liang, Yun Peking Univ Sch EECS Ctr Energy Efficient Comp & Applicat CECA Beijing Peoples R China

ISBN: (纸本)9781450349277

Iterative stencil algorithms find applications in a wide range of domains. FPGAs have long been adopted for computation acceleration due to its advantages of dedicated hardware design. Hence, FPGAs are a compelling alternative for executing iterative stencil algorithms. However, efficient implementation of iterative stencil algorithms on FPGAs is very challenging due to the data dependencies between iterations and elements in the stencil algorithms, programming hurdle of FPGAs, and large design space. In this paper, we present a comprehensive framework that synthesizes iterative stencil algorithms on FPGAs efficiently. We leverage the OpenCL-to-FPGA toolchain to generate accelerator automatically and perform design space exploration at the high level. We propose to bridge the neighboring tiles through pipe and enable data sharing among them to improve computation efficiency. Then, we extend the equal tile size design to a heterogeneous design with different tile size to balance the computation among different tiles. We also develop analytical performance models to explore the complex design space. Experiments using a wide range of stencil applications demonstrate that on average our heterogeneous implementations achieve 1.65X performance speedup but with less hardware resource compared to the state-of-the-art.

关键词： Kernel Field programmable gate arrays algorithm design and analysis Analytical models Data models Iterative algorithms Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A Reactive Collision Avoidance algorithm for Vehicles with Underactuated Dynamics 56

A Reactive Collision Avoidance Algorithm for Vehicles with U...

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Wiig, Martin S. Pettersen, Kristin Y. Krogstad, Thomas R. Norwegian Univ Sci & Technol Dept Engn Cybernet Ctr Autonomous Marine Operat & Syst NTNU AMOS N-7491 Trondheim Norway Norwegian Def Res Estab FFI POB 25 N-2027 Kjeller Norway

ISBN: (纸本)9781509028733

This paper presents a reactive collision avoidance algorithm, which avoids both static and moving obstacles by keeping a constant avoidance angle between the vehicle velocity vector and the obstacle. In particular, we consider marine vehicles with underactuated sway dynamics, which cannot be directly controlled. This gives an underactuated component in the vehicle velocity, which the proposed algorithm is designed to compensate for. The algorithm furthermore compensates for the obstacle velocity. Conditions are derived under which the sway movement is bounded and collision avoidance is mathematically proved. The theoretical results are supported by simulations. The proposed algorithm makes only limited sensing requirements on the vehicle, is intuitive and suitable for a wide range of vehicles. This includes vehicles with heavy forward acceleration constraints, which is demonstrated by applying the algorithm to a vehicle with constant surge speed.

关键词： Heuristic algorithms Vehicle dynamics algorithm design and analysis Acceleration Marine vehicles Collision avoidance Surges

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 64 65 66 67 68 69 70 71 72 73 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：