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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4651-4660 订阅

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

详细简洁

排序：

Adaptive charging network for electric vehicles

Adaptive charging network for electric vehicles

引用

IEEE Global Conference on Signal and Information Processing (GlobalSIP)

作者： George Lee Ted Lee Zhi Low Steven H. Low Christine Ortega PowerFlex Systems Division of Engineering & Applied Science Caltech Math Department Cornell

ISBN: (纸本)9781509045464

We describe a snapshot of an adaptive charging network (ACN) for electric vehicles at Caltech. We overview the system design, from the power distribution system to advanced charger design to control and communication system and the software system that integrates the overall network. We present a simple mathematical formulation of the charging problem. We have collected three months' of baseline charging data from the Caltech ACN. We demonstrate, by simulating a charging algorithm on the baseline data, the large potential benefit of ACN in saving infrastructure costs.

关键词： algorithm design and analysis Adaptive systems Electric vehicles Software algorithms Power distribution Prediction algorithms Charging stations

来源：评论

学校读者我要写书评

暂无评论

All-pairs shortest distances maintenance in relational DBMSs

All-pairs shortest distances maintenance in relational DBMSs

引用

International Conference on Advances in Social Network analysis and Mining, ASONAM

作者： Sergio Greco Cristian Molinaro Chiara Pulice Ximena Quintana University of Calabria Rende CS Italy

ISBN: (纸本)9781509028474

Computing shortest distances is a central task in many graph applications. Although many algorithms to solve this problem have been proposed, they are designed to work in the main memory and/or with static graphs, which limits their applicability to many current applications where graphs are subject to frequent updates. In this paper, we propose novel efficient incremental algorithms for maintaining all-pairs shortest distances in dynamic graphs. We experimentally evaluate our approach on real-world datasets, showing that it outperforms current algorithms designed for the same problem.

关键词： Maintenance engineering Heuristic algorithms algorithm design and analysis Indexes Social network services Terminology Data structures

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Clustering based method for the spatiotemporal analysis of criminal patterns

A Fuzzy Clustering based method for the spatiotemporal analy...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Diego Mayorga Miguel A. Melgarejo Nelson Obregon Universidad Distrital FJC Bogota DC Colombia Universidad Distrital FJC Pontifical Xaverian University Bogota DC Colombia Pontifical Xaverian University National University of Colombia Bogota DC Colombia

ISBN: (纸本)9781509006274

This paper presents a method for analyzing patterns of criminal activity that occur in space and time. The method uses the fuzzy C-means algorithm to cluster criminal events in space. In addition, a cluster reorganization algorithm is included to preserve the order of fuzzy partitions from one time step analysis to another. Order preservation is possible since crime forms relatively stable patterns due to the fixed shape of urban spaces and routine activities of people. The method provides a novel way to analyze criminal directionality, since it generates time series from clustering. A sample database of robberies in San Francisco, USA, is used to test the algorithm. Results show that criminal patterns might be tracked in a simple way.

关键词： Clustering algorithms Time series analysis Spatiotemporal phenomena Partitioning algorithms algorithm design and analysis Urban areas Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Peak-error-constrained sparse FIR filter design using iterative L1 optimization

Peak-error-constrained sparse FIR filter design using iterat...

引用

European Signal Processing Conference (EUSIPCO)

作者： Aimin Jiang Hon Keung Kwan Yanping Zhu Xiaofeng Liu Ning Xu Xiao Yao College of Internet of Things Engineering Hohai University Changzhou China Department of Electrical and Computer Engineering University of Windsor Windsor Canada School of Information Science and Engineering Changzhou University Changzhou China

In this paper, a novel algorithm is presented for the design of sparse linear-phase FIR filters. Compared to traditional l 1 -optimization-based methods, the proposed algorithm minimizes l 1 norm of a portion (instead of all) of nonzero coefficients. In this way, some nonzero coefficients at crucial positions are not affected by l 1 norm utilized in the objective function. The proposed algorithm employs an iterative procedure and the index set of these crucial coefficients is updated in each iteration. Simulation results demonstrate that the proposed algorithm can achieve better design results than both greedy methods and traditional l 1 -optimization-based methods.

关键词： Finite impulse response filters algorithm design and analysis Signal processing algorithms Optimization Approximation error Indexes Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Contact layer decomposition to enable DSA with multi-patterning technique for standard cell based layout

Contact layer decomposition to enable DSA with multi-pattern...

引用

Asia and South Pacific design Automation Conference

作者： Zigang Xiao Chun-Xun Lin Martin D.F. Wong Hongbo Zhang Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Synopsys Inc Mountain View CA US

ISBN: (纸本)9781467395700

Multiple patterning lithography has been widely adopted for today's circuit manufacturing. However, increasing the number of masks will make the manufacturing process more expensive. More importantly, towards 7 nm technology node, the accumulated overlay in multiple patterning will cause unacceptable edge placement error (EPE). Recently, directed self-assembly (DSA) has been shown to be an effective lithography technology that can pattern contact/via/cuts with high throughput and low cost. DSA is currently aiming at 7 nm technology, where the guiding template generation needs either double patterning EUV or multiple patterning DUV process. By incorporating DSA into the multiple patterning process, it is possible to reduce the number of masks and achieve a cost effective solution. In this paper, we study the decomposition problem for contact layer in row-based standard cell layout with DSA-MP complementary lithography. We explore several heuristic-based approaches, and propose an algorithm that decomposes a standard cell row optimally in polynomial-time. Our experiments show that our algorithm guarantees to find a minimum cost solution if one exists, while the heuristic cannot or only finds a sub-optimal solution. Our results show that the DSA-MP complementary approach is very promising for the future advanced nodes.

关键词： Standards Layout Color Lithography Self-assembly Heuristic algorithms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A new cost-effective approach for battlefield surveillance in wireless sensor networks

A new cost-effective approach for battlefield surveillance i...

引用

International Conference on Networking Systems and Security (NSysS)

作者： Fariha Tasmin Jaigirdar Mohammad Mahfuzul Islam Dept. of Computer Science and Engineering Daffodil International University Dhaka Bangladesh

Assuring security (in the form of attacking mode as well as in safeguard mode) and at the same time keeping strong eye on the opposition's status (position, quantity, availability) is the key responsibility of a commander in the battlefield. Battlefield surveillance is one of the strong applications of Wireless Sensor Networks (WSNs). A commander is not only liable to his above responsibilities, but also to manage his duties in an efficient way. For this reason, ensuring maximum destruction with minimum resources is a major concern of a commander in the battlefield. This paper focuses on the maximum destruction problem in military affairs. In the work of Jaigirdar and Islam (2012), the authors proposed two novel algorithms (Maximum degree analysis and Maximum clique analysis) that ensure the efficiency and cost-effectiveness of the above problem. A comparative study explaining the number of resources required for commencing required level of destruction made to the opponents has been provided in the paper. In this paper the authors have come forward with another algorithm for the same problem. With the simulation studies and comparative analysis of the same example set the authors in this paper demonstrate the effectiveness (in both the quality and quantity) of the new method to be best among the three.

关键词： Wireless sensor networks Jamming Monitoring algorithm design and analysis Artificial neural networks Poles and towers Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance measures for niching algorithms

Performance measures for niching algorithms

引用

Congress on Evolutionary Computation

作者： Jonathan Mwaura Andries P. Engelbrecht Filipe V. Nepocumeno Department of Computer Science University of Pretoria Pretoria South Africa

Numerous niching algorithms have been developed to find multiple optima for multimodal optimisation problems. analysis of niching algorithms presents a problem due to the multiple objectives of niching algorithms, that is, to find as many optima as possible, to find accurate solutions, and to find a diverse set of solutions. Performance analysis becomes more difficult when no knowledge of the fitness landscape is available. This is due to the assumption of most performance measures that information about the optima is available. This paper provides a critical review of existing performance measures for niching algorithms. In addition, the paper introduces a new approach, the mid-point technique, to determine a unique set of solutions for performance measurement. The performance measures are used to evaluate the performance of seven particle swarm optimisation niching algorithms. The obtained results are then used to compute the predictive capability of non-knowledge assuming performance measures to that of knowledge assuming measures. The analysis shows that the considered performance measures do show a convergent behaviour.

关键词： Linear programming Atmospheric measurements Particle measurements algorithm design and analysis Optimization Prediction algorithms Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

Autonomous identification of local agents in multi-agent robotic swarms

Autonomous identification of local agents in multi-agent rob...

引用

IEEE International Conference on Electro-Information Technology

作者： Aaron Roggow Georges El-Howayek Sami Khorbotly Electrical and Computer Engineering Department Valparaiso University Valparaiso IN

ISBN: (纸本)9781467399869

With the emergence of swarm intelligence and evolutionary algorithms, system designers are creating robotic swarms of continuously increasing sizes. As the size of a swarm increases, it is imperative to have a uniform program collectively downloaded on all the agents in it. These uniform programs impede the designer's ability to designate distinct identities for various agents in the swarm. In this work we propose an algorithm that, when implemented in a robotic swarm, allows the locally interacting agents to autonomously designate unique identifications to each other at run time. The results show that when used on a small swarm of autonomous robots, running the algorithm led to a steady state where every agent in a local neighborhood was assigned a unique identification value.

关键词： Robot kinematics Image color analysis Multi-agent systems Light emitting diodes Steady-state algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

On MinMax-Memory Claims for Scientific Workflows in the In-memory Cloud Computing

On MinMax-Memory Claims for Scientific Workflows in the In-m...

引用

International Conference on Distributed Computing Systems

作者： Yang Wang Chengzhong Xu Shuibing He Xian-He Sun Shenzhen Institute of Advanced Technology Chinese Academy of Science China Department of Electrical and Computer Engineering Wayne State University USA School of Computer Wuhan University China Department of Computer Science Illinois Institute of Technology USA

We propose a new concept of minmax memory claim (MMC) to achieve cost-effective workflow computations in in-memory cloud computing environments. The minmax-memory claim is defined as the minimum amount of memory required to finish the workflow without compromising its maximum concurrency. With MMC, the workflow tenants can achieve the best performance via the maximum concurrency while minimizing the cost to use the memory resources. In this paper, we present the algorithms to find the MMC for workflow computation and evaluate its value by applying it to deadlock avoidance algorithms.

关键词： algorithm design and analysis Memory management Cloud computing System recovery Lattices Conferences Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Singularity analysis of a Novel 4-DOF Surgical Robot

Singularity Analysis of a Novel 4-DOF Surgical Robot

引用

International Conference on Information Science and Control Engineering (ICISCE)

作者： Alaa Khalifa Mohamed Fanni Abdelfatah M. Mohamed Mechatronics and Robotics Engineering Dep. School of Innovative Design Engineering New Borg EI-Arab city Alexandria Egypt On leave: Production Engineering and Mechanical Design Dep. Mansoura University Egypt On leave: Electrical Engineering Dep. Assuit University Egypt

ISBN: (纸本)9781509025367

This paper presents the singularity analysis of a novel endoscopic surgical parallel manipulator. The 4-DOF, 2- PUU_2-PUS, surgical robot design has larger bending angles and workspace volume. All previous manipulators have a zero pitch and infinity pitch reciprocal screws, so it is easy to find out the singular configurations inside the workspace. On the other hand, the novel 4-DOF surgical robot (2-PUU_2-PUS) has h-pitch reciprocal screws. The known geometrical approach for reciprocal-screws could not provide all singular configurations of the novel manipulator. Geometrical/Analytical approach for reciprocal-screws based singularity analysis of 2-PUU_2-PUS is proposed. The proposed algorithm can find all singular configurations of any limited DOF parallel manipulator with h-pitch reciprocal screws. The results show the feasibility of the proposed algorithm to find all singular configurations of the 4-DOF parallel manipulator. The discovered singularity configurations shrieked greatly the singularity free workspace to one fourth the original workspace. In order to be able to work through the entire workspace, we suggest changing the topology structure of the manipulator.

关键词： Fasteners Manipulators Actuators Wires Surgery Medical robotics algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 462 463 464 465 466 467 468 469 470 471 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：