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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Customized Real-Time Data Management for Automotive Systems: A Case Study 43

Customized Real-Time Data Management for Automotive Systems:...

引用

43rd Annual Conference of the IEEE-Industrial-Electronics-Society (IECON)

作者： Cai, Simin Gallina, Barbara Nystrom, Dag Seceleanu, Cristina Malardalen Univ Sch Innovat Design & Engn Vasteras Sweden

ISBN: (纸本)9781538611272

Real-time DataBase Management Systems (RTDBMS) have been considered as a promising means to manage data for data-centric automotive systems. During the design of an RTDBMS, one must carefully trade off data consistency and timeliness, in order to achieve an acceptable level of both properties. Previously, we have proposed a design process called DAGGERS to facilitate a systematic customization of transaction models and decision on the run-time mechanisms. In this paper, we evaluate the applicability of DAGGERS via an industrially relevant case study that aims to design the transaction management for an onboard diagnostic system, which should guarantee both timeliness and data consistency under concurrent access. To achieve this, we apply the pattern-based approach of DAGGERS to formalize the transactions, and derive the appropriate isolation level and concurrency control algorithm guided by model checking. We show by simulation that the implementation of our designed system satisfies the desired timeliness and derived isolation, and demonstrate that DAGGERS helps to customize desired real-time transaction management prior to implementation.

关键词： Sensors Automata Concurrency control algorithm design and analysis Monitoring Microcontrollers Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Topology-Aware RRT* for Parallel Optimal Sampling in Topologies

Topology-Aware RRT* for Parallel Optimal Sampling in Topolog...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Yi, Daqing Goodrich, Michael A. Howard, Thomas M. Seppi, Kevin D. Brigham Young Univ Dept Comp Sci Provo UT 84604 USA Univ Rochester Elect & Comp Engn Dept Rochester NY 14604 USA

ISBN: (纸本)9781538616451

In interactive human-robot path-planning, a capability for expressing the path topology provides a natural mechanism for describing task requirements. We propose a topology-aware RRT* algorithm that can explore in parallel any given set of topologies. The topological information used by the algorithm can either be assigned by the human prior to the planning or be selected from the human in posterior path selection. Theoretical analyses and experimental results are given to show that the optimal path of any topology can be found, including a winding topological constraint wherein the robot must circle one or more objects of interest.

关键词： Topology Robots Planning algorithm design and analysis Windings Shape

来源：评论

学校读者我要写书评

暂无评论

Property Directed Reachability with Word-Level Abstraction 17

Property Directed Reachability with Word-Level Abstraction

引用

17th International Conference on Formal Methods in Computer-Aided design (FMCAD)

作者： Ho, Yen-Sheng Mishchenko, Alan Brayton, Robert Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9780983567875

SAT-based Property Directed Reachability (PDR) has become the key algorithmic development for unbounded model checking of gate-level sequential circuits, but it can be inefficient when applied to word-level problems with heavy arithmetic logic. To address this issue, word-level abstraction is often performed by replacing a whole set of signals with unconstrained new primary inputs. This paper introduces PDR-WLA, a word-level abstraction-refinement algorithm integrated into a modified PDR implementation. The algorithm uses efficient refinement and re-uses reachability information across iterations of refinement. PDR-WLA was implemented in ABC and evaluated on a large set of industrial Verilog designs. Experimental results show significant speedups on hard problems compared to the original PDR and to a naive word-level abstraction-refinement method.

关键词： Logic gates algorithm design and analysis Hardware design languages Model checking Sequential circuits Adders Integrated circuit modeling Model checking sequential circuits algorithm design and analysis integrated circuit modelling adders level of abstraction Logic gates Hardware design languages Accessibility PDR gene

来源：评论

学校读者我要写书评

暂无评论

Effective Information Spreading In Social Networks 18

Effective Information Spreading In Social Networks

引用

IEEE 18th International Conference on Information Reuse and Integration (IRI)

作者： Cassavia, Nunziato Masciari, Elio Sacca, Domenico CNR ICAR Milan Italy Univ Calabria DIMES Calabria Italy ICT SUD Ctr Competenze Calabria Italy

ISBN: (纸本)9781538615621

Due to the emerging Big Data paradigm, traditional data management techniques result inadequate in many real life scenarios. In particular, the availability of huge amounts of data pertaining to social interactions among users calls for advanced analysis strategies. Furthermore, heterogeneity and high speed of this data require suitable data storage and management tools to be designed from scratch. In this paper, we describe a framework tailored for analysing user searches when they are connected to a social network in order to quickly identify users able to spread their influence across the network. It is worth noting that, gathering information about user preferences is crucial in several scenarios like viral marketing, tourism promotion and food education.

关键词： Big Data Navigation Social network services algorithm design and analysis Databases Internet Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Fixed-Parameter Tractable algorithms for Optimal Layout Decomposition and Beyond 17

Fixed-Parameter Tractable Algorithms for Optimal Layout Deco...

引用

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

作者： Kuang, Jian Young, Evangeline F. Y. Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China Cadence Design Syst Inc San Jose CA 95134 USA

ISBN: (纸本)9781450349277

This paper studies the application of fixed-parameter tractable (FPT) algorithms to solve computer-aided design (CAD) problems. Specifically, we focus on layout decomposition problems for three lithography technologies: double patterning lithography (DPL), DPL with E-beam lithography (DPL+EBL), and DPL+DSA+EBL. Layout decomposition for the first two technologies are long-standing open problems without efficient optimal solutions, and the third technology is very promising in the future. The proposed approaches use ideas drastically different from all the previous works and can get optimal solutions in a short time. We show the great potential of applying FPT algorithms to solve more NP-hard problems efficiently in CAD.

关键词： Layout Lithography NP-hard problem algorithm design and analysis Approximation algorithms Throughput Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Node Localization Based on Distributed Constrained Optimization using Jacobi's Method 56

Node Localization Based on Distributed Constrained Optimizat...

引用

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

作者： Ferraz, Henrique Alanwar, Amr Srivastava, Mani Hespanha, Joao P. Univ Calif Santa Barbara Control Dynam Syst & Computat CCDC Santa Barbara CA 93106 USA Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90024 USA

ISBN: (纸本)9781509028733

We consider the spatial localization of nodes in a network, based on measurements of their relative position with respect to their neighbors. These measurements include the nodes' relative positions in a global coordinate system, their distances, or their pseudo ranges. We show that the maximum likelihood estimator associated with these localization problems can be viewed as a constrained optimization problem with a specific structure and provide a distributed algorithm to solve it. Under appropriate assumptions, it is shown that the maximum likelihood estimates are locally asymptotically stable equilibrium points of the proposed algorithm. As a case study, we consider a range-based localization problem and present simulation results to evaluate the algorithm.

关键词： Optimization Position measurement Maximum likelihood estimation Nickel Noise measurement algorithm design and analysis Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Differential Evolution algorithm with Learning Selection Strategy for SAR Image Change Detection

Differential Evolution Algorithm with Learning Selection Str...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Chen, Feng Shi, Jiao Ma, Yunhong Lei, Yu Gong, Maoguo Northwestern Polytech Univ Sch Elect & Informat 127 West Youyi Rd Xian 710072 Shaanxi Peoples R China Xidian Univ Minist Educ China Key Lab Intelligent Percept & Image Understanding 2 South Taibai Rd Xian 710071 Shaanxi Peoples R China

ISBN: (纸本)9781509046010

Image change detection is to recognize the changes between two images that are taken over the same scene but at different times, which has been applied broadly in many fields. Fuzzy clustering is a frequently-used technique for unsupervised change detection. However, traditional fuzzy clustering algorithms are easy to be trapped into a local optimum due to the limits of their optimization processes. To tackle the problem, a novel differential evolution algorithm with an automatically learning selection strategy is proposed in this paper. Different from the selection rules of classical differential evolution algorithm, this method firstly pre-classifies all original individuals and trial individuals according to the scope of the individual fitness at each generation, which will preliminarily determine whether they are selected for the next generation. Secondly, in order to increase the diversity of the population, we choose a few individuals from the non-selected population with a low probability into selected ones. Finally, the samples including partial individuals from the selected and non-selected lists are used to train the neural networks that will learn the selection strategy. This method will learn different selection strategies in every generation, which will significantly accelerate the convergence speed. The proposed change detection method, combining fuzzy clustering with newly designed differential evolution algorithm, show excellent performance. Experiments conducted on Synthetic Aperture Radar images have demonstrated the superiority of the proposed method.

关键词： algorithm design and analysis Change detection algorithms Sociology Statistics Clustering algorithms Neural networks Next generation networking

来源：评论

学校读者我要写书评

暂无评论

Systematic analysis and Simulation of Classical Page Replacement algorithms: A Proposed Novel WSClock-Derivative 2

Systematic Analysis and Simulation of Classical Page Replace...

引用

2nd International Conference for Convergence in Technology (I2CT)

作者： Moudgil, Kartik Ringshia, Anushka Parekh, Harshal Bharatkumar Maheshwari, Ria Chaudhari, Sheetal Sardar Patel Inst Technol Bombay Maharashtra India

ISBN: (纸本)9781509043071

Modern operating systems are complex system software, with a variety of interfaces that make developing software for them simple and more importantly, ensure they execute efficiently and fulfill high performance requirements. One of the fundamental techniques used here is Virtual Memory Management (VMM) that summarily allocates virtual memory segments to the executing processes. Due to practical and economic constraints, the system memory available in limited, and even with the use of slower secondary memory, there are frequent instances of the memory and cache pages needing replacement. Thus, algorithms for deciding the fate of the pages are needed. This paper proposes a page replacement algorithm to perform this task, as well as summarizes, evaluates and objectively represents the classical as well as modern page replacement algorithms, with a qualitative analysis of their performance under specific scenarios.

关键词： Segmentation Paging FIFO LRU Optimal NRU CLOCK WSClock Memory management Heuristic algorithms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Un-Apriori: a Novel Association Rule Mining algorithm for Unstructured EMRs 19

Un-Apriori: a Novel Association Rule Mining Algorithm for Un...

引用

19th Annual IEEE International Conference on e-Health Networking, Applications and Services (Healthcom)

作者： Song, Bo Feng, Yunxia Li, Xu Sun, Zhen Yang, Yanli Qingdao Univ Sci & Technol Coll Informat Sci & Technol Qingdao Peoples R China Qingdao Univ Sci & Technol Coll Electromech Engn Qingdao Peoples R China

ISBN: (纸本)9781509067046

With the rapid development of hospital information technologies, more and more hospitals build electronic medical record (EMR) systems, which provides a comprehensive source for medical data mining and analysis. Most current EMR systems adopt a mixed structure. On the other hand, most data mining algorithms are designed for highly structured data. In this paper, we study the problem of interesting association rule mining on unstructured EMR data. We first analyze characteristics of unstructured EMR data by analyzing real in-patient department EMR of chronic occupational disease from a major hospital in Qingdao, and then put forward a novel association rule mining algorithm, called Un-Apriori, based on Apriori. Un-Apriori adopts a two-step preprocessing procedure for the original EMR data to resolve problems induced by the unstructured EMR data and satisfy specific requirement of Apriori algorithm. Taking asbestosis, a typical chronic occupational disease, as example we evaluate performance of the proposed Un-Apriori algorithm. Two types of experiments are implemented on the Hadoop platform, results and corresponding analysis are also provided. Experiments show that it is feasible and effective to apply data mining algorithms to discover latent association relationships or patterns hidden in unstructured EMRs so long as the reprocessing method is appropriate. Achievements obtained in this paper also provide valuable assistance decision supports for personalized therapeutic regimens and daily health managements of asbestosis patients.

关键词： Data mining Diseases Hospitals History algorithm design and analysis Medical diagnostic imaging

来源：评论

学校读者我要写书评

暂无评论

The Virtual Deadline based Optimization algorithm for Priority Assignment in Fixed-Priority Scheduling 38

The Virtual Deadline based Optimization Algorithm for Priori...

引用

38th IEEE Real-Time Systems Symposium (RTSS)

作者： Zhao, Yecheng Zeng, Haibo Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24061 USA

ISBN: (纸本)9781538614143

This paper considers the problem of design optimization for real-time systems scheduled with fixed priority, where task priority assignment is part of the decision variables, and the timing constraints and/or objective function linearly depend on the exact value of task response times (such as end-to-end deadline constraints). The complexity of response time analysis techniques makes it difficult to leverage existing optimization frameworks and scale to large designs. Instead, we propose an efficient optimization framework that is three magnitudes (1, 000x) faster than Integer Linear Programming (ILP) while providing solutions with the same quality. The framework centers around three novel ideas: (1) An efficient algorithm that finds a schedulable task priority assignment for minimizing the average worst-case response time;(2) The concept of Maximal Unschedulable Deadline Assignment (MUDA) that abstracts the schedulability conditions, i.e., a set of maximal virtual deadline assignments such that the system is unschedulable;and (3) A new optimization procedure that leverages the concept of MUDA and the efficient algorithm to compute it.

关键词： Task analysis algorithm design and analysis Optimization Real-time systems Scheduling Time factors Linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 85 86 87 88 89 90 91 92 93 94 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：