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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Work-in-Progress: Fixed Priority Scheduling of Real-time Flows with Arbitrary Deadlines on SMART NoCs 13

Work-in-Progress: Fixed Priority Scheduling of Real-time Flo...

引用

International Conference on Embedded Software (EMSOFT)

作者： Liu, Weichen Chen, Peng Yang, Lei Li, Mengquan Guan, Nan Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore Chongqing Univ Coll Comp Sci Chongqing Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

ISBN: (纸本)9781450351867

Although SMART NoC, as an emerging dynamically reconfigurable NoC architecture, is able to improve the communication efficiency significantly when scheduling real-time flows, it introduces uncertainty due to the nondeterministic latency. In this regard, we first study the schedulability of a set of arbitrary-deadline flows with given priorities. Based on schedulability analysis, an efficient priority assignment algorithm is proposed to minimize deadline misses. To our best knowledge, this is the first work of arbitrary-deadline flow scheduling on SMART NoC, which involves sophisticated computation of the worst case traversal time.

关键词： Real-time systems Delays Interference Scheduling Processor scheduling algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Effect of Size and Order of Variables in Rules for Multi-Objective Repair-Based Innovization Procedure

Effect of Size and Order of Variables in Rules for Multi-Obj...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Gaur, Abhinav Deb, Kalyanmoy Michigan State Univ Elect & Comp Engn Lansing MI 48823 USA

ISBN: (纸本)9781509046010

Innovization is a task of learning common principles that exist among some or all of the Pareto-optimal solutions of a multi-objective optimization problem. Except a few earlier studies, most innovization related studies were performed on the final non-dominated solutions found by an EMO algorithm. Recently, authors showed that these principles can be learned during an optimization run and simultaneously utilized in the same optimization run to repair variables to achieve a faster convergence to the Pareto-optimal set. Different principles learned during an optimization run can not only have different number of variables but, may also have variables that are common among a number of principles. Moreover, a preference order for repairing variables may play an important role for proper convergence. Thus, when multiple principles exist, it is important to use a strategy that is most beneficial for repairing evolving population of solutions. This paper makes a first attempt to assess and understand the effect of different strategies to make innovization-based repair of variables most useful. Based on results on test problems, the paper also makes useful suggestions, which require immediate further experimentation on more complex and real-world problems.

关键词： Maintenance engineering Optimization Sociology Statistics Convergence algorithm design and analysis Mathematical model

来源：评论

学校读者我要写书评

暂无评论

ADMM-based Infinity Norm Detection for Large MU-MIMO: algorithm and VLSI Architecture 50

ADMM-based Infinity Norm Detection for Large MU-MIMO: Algori...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Shahabuddin, Shahriar Juntti, Markku Studer, Christoph Ctr Wireless Commun Oulu Finland Cornell Univ Ithaca NY USA

ISBN: (纸本)9781467368537

We propose a novel data detection algorithm and a corresponding VLSI design for large multi-user (MU) multiple-input multiple-output (MIMO) wireless receiver. Our algorithm, referred to as ADMIN, performs alternating direction method of multipliers (ADMM)-based infinity norm constrained equalization. ADMIN is an iterative algorithm that outperforms linear detectors if the number of users is small compared to that of the antennas in base station (BS). ADMIN computes the linear minimum mean-square error (MMSE) solution in the first iteration. It is sufficient when the ratio between the numbers of BS antennas and users is rather large. We develop a time-shared and iterative VLSI architecture for LDL-decomposition based soft-output ADMIN. Our architecture achieves 685.71 Mb/s for linear MMSE and 212.38 Mb/s for ADMIN for a 16-user system that employs 64-QAM in a 28 nm CMOS technology.

关键词： Antennas Computer architecture Very large scale integration Detectors Phase shift keying algorithm design and analysis Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Multi-vehicle Task Assignment in a Time-invariant Drift Field with Obstacles 56

Heterogeneous Multi-vehicle Task Assignment in a Time-invari...

引用

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

作者： Bai, Xiaoshan Yan, Weisheng Cao, Ming Xue, Dong Northwestern Polytech Univ Sch Marine Sci & Technol 127 West Youyi Rd Xian 710072 Shaanxi Peoples R China Univ Groningen Fac Sci & Engn NL-9747 AG Groningen Netherlands Tech Univ Munich Dept Elect & Comp Engn Arcisstr 21 D-80209 Munich Germany

ISBN: (纸本)9781509028733

This paper studies the multi-vehicle task assignment problem where several dispersed vehicles need to visit a set of target locations in a time-invariant drift field with obstacles while trying to minimize the total travel time. The vehicles have different capabilities, and each kind of vehicles needs to visit a certain type of target locations;each target location might have the demand to be visited more than once by different kinds of vehicles. To find approximate solutions for such a challenging problem, we first design a path planning algorithm to minimize the time for a single vehicle to travel between two given locations through the drift field while avoiding obstacles. The path planning algorithm provides the travel cost matrix for the target assignment, and generates routes once the target locations are assigned to the vehicles. Then, we propose an auction-based distributed task assignment algorithm to assign the target locations to the vehicles using only local communication. Finally, numerical simulations show that the algorithm can lead to solutions close to the optimal.

关键词： Path planning algorithm design and analysis Approximation algorithms Partitioning algorithms Oceanography Roads

来源：评论

学校读者我要写书评

暂无评论

Data Sampling through Collaborative Filtering for algorithm Selection

Data Sampling through Collaborative Filtering for Algorithm ...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Misir, Mustafa Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781509046010

algorithm selection has been studied to specify the best possible algorithm (s) for a given problem instance. One of the major drawbacks of the algorithm selection methods is their need for the performance data. The performance data involves the performance of a set of algorithms on a group of problem instances. Depending on the problem domain, algorithms and the experimental settings, generating such data can be computationally expensive. ALORS [1] as a collaborative filtering based algorithm selection strategy addresses this issue by performing matrix completion. Matrix completion allows to generate algorithm selection models when the performance data is incomplete. Although ALORS is able to deal with varying data incompleteness levels, it ignores the quality and cost of the performance data. The present study offers a collaborative filtering based sampling strategy to designate which algorithm (s) to run on which instance (s). The goal is to provide either computationally cheap or highly informative incomplete performance data for algorithm selection.

关键词： algorithm design and analysis Filtering Collaboration Prediction algorithms Classification algorithms Machine learning algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

PWSF: Planar-West-South-First Routing algorithm for 3D Network-on-Chip

PWSF: Planar-West-South-First Routing Algorithm for 3D Netwo...

引用

IEEE Region 10 Conference (TENCON)

作者： Dai, Jindun Li, Renjie Jiang, Xin Watanabe, Takahiro Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai Peoples R China Waseda Univ Grad Sch Informat Prod & Syst Tokyo Japan

ISBN: (纸本)9781509011346

As an efficient multi-core system structure, three-dimensional Network-on-Chips (3D NoC) opened a new filed of System-on-Chip (SoC) research. In this paper, we present an efficient routing algorithm for 3D NoC applications. This method is based on west-south-first routing algorithm and intra-layer routing has higher priority. We introduce the concept of possible deadlocked configurations and further loosen the sufficient condition of deadlock freeness in adaptive routing. By using channel dependency graph, the proposed method is proven to be free from deadlock. Furthermore, the proposed method can balance channel loads and reduce uneven adaptiveness effectively. Simulation experiments verify the theoretical analyses on adaptiveness and demonstrate routing effectiveness.

关键词： Routing System recovery Two dimensional displays Three-dimensional displays algorithm design and analysis Multiprocessor interconnection IEEE Regions

来源：评论

学校读者我要写书评

暂无评论

Automated Age-related Macular Degeneration Screening System using Fundus Images 39

Automated Age-related Macular Degeneration Screening System ...

引用

39th Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society (EMBC)

作者： Kunumpol, P. Umpaipant, W. Kanchanaranya, N. Charoenpong, T. Vongkittirux, S. Kupakanjana, T. Tantibundhit, C. Thammasat Univ Fac Engn Bangkok Thailand Thammasat Univ Fac Engn Bangkok Thailand Srinakharinwirot Univ Fac Engn Bangkok Thailand

ISBN: (纸本)9781509028092

This work proposed an automated screening system for Age-related Macular Degeneration (AMD), and distinguishing between wet or dry types of AMD using fundus images to assist ophthalmologists in eye disease screening and management. The algorithm employs contrast-limited adaptive histogram equalization (CLAHE) in image enhancement. Subsequently, discrete wavelet transform (DWT) and locality sensitivity discrimination analysis (LSDA) were used to extract features for a neural network model to classify the results. The results showed that the proposed algorithm was able to distinguish between normal eyes, dry AMD, or wet AMD with 98.63% sensitivity, 99.15% specificity, and 98.94% accuracy, suggesting promising potential as a medical support system for faster eye disease screening at lower costs.

关键词： Feature extraction Discrete wavelet transforms Classification algorithms Sensitivity algorithm design and analysis Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Formal modeling and performance evaluation of a run-time rank remapping technique in Broadcast, Allgather and Allreduce MPI collective operations 17

Formal modeling and performance evaluation of a run-time ran...

引用

17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)

作者： Alvarez-Llorente, Jesus M. Diaz-Martin, Juan C. Rico-Gallego, Juan A. Univ Extremadura Fac Ciencias Documentac & Comunicac Badajoz 06001 Spain Univ Extremadura Escuela Politecn Caceres 10003 Spain

ISBN: (纸本)9781509066117

MPI collective operations are implemented using a variety of algorithms which define different communication patterns between the ranks involved in the operation. The performance of these algorithms in multi-core clusters highly depends on the mapping of the ranks to the system processors due to the uneven capabilities of shared memory and network channels. The hierarchical design of these algorithms contributes to use optimally the communication channels. Nevertheless, common hierarchical algorithms have shown themselves, for some collectives as allgather, inefficient and even impracticable. This paper analyzed the reasons for that and works out an alternate approach through performance modeling. Such approach, departing from the a priori knowledge of a regular mapping as round-robin or sequential, and keeping the original algorithm unmodified, switches at run time the rank to process mapping into another regular mapping that reduces network traffic. The methodology is evaluated with three collectives and their underlying algorithms, showing speedups of up to 5x in the Binomial Tree or 3x in Ring algorithms compared to unfavorable mappings.

关键词： Clustering algorithms algorithm design and analysis Communication channels Program processors Optimization Electronic mail Analytical models

来源：评论

学校读者我要写书评

暂无评论

Characterization of Vertex-centric Breadth First Search for Lattice Graphs 24

Characterization of Vertex-centric Breadth First Search for ...

引用

IEEE 24th International Conference on High Performance Computing Workshops (HiPCW)

作者： Dindokar, Ravikant Simmhan, Yogesh Indian Inst Sci Dept Computat & Data Sci Bangalore 560012 Karnataka India

ISBN: (纸本)9781538614396

Google's Pregel vertex-centric programming model has led to a class of component-centric abstractions that are widely used for designing and executing distributed graph algorithms in a Bulk Synchronous Parallel (BSP) manner on commodity clusters. There has, however, been little effort to formally understand the behavior of such programming models to allow analytical comparison of graph algorithms with narrow bounds. Graphs and graph algorithms have asymmetry that make them challenging to model effectively. Lattice (or grid) graphs, commonly used in scientific computing, offer a simpler structure to tackle this novel problem. Here, we propose analytical models with tight bounds on the coordination, computation and communication costs for performing a vertex-centric Breadth First Search (BFS) on uniform lattice graphs. We validate these further with empirical results. Our results hold for lattice graphs of arbitrary dimension and uniform odd-valued length, but can be extended to non-uniform lengths as well. These results offer a formal understanding of the behavior of vertex-centric BFS for a lattice structure, and lays the foundation for further analysis and exploration of component-centric algorithms.

关键词： Lattices algorithm design and analysis Computational modeling Programming Analytical models Two dimensional displays Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Online Job Dispatching and Scheduling in Edge-Clouds

Online Job Dispatching and Scheduling in Edge-Clouds

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Tan, Haisheng Han, Zhenhua Li, Xiang-Yang Lau, Francis C. M. USTC Hefei Anhui Peoples R China HKU Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781509053360

In edge-cloud computing, a set of edge servers are deployed near the mobile devices such that these devices can offload jobs to the servers with low latency. One fundamental and critical problem in edge-cloud systems is how to dispatch and schedule the jobs so that the job response time (defined as the interval between the release of a job and the arrival of the computation result at its device) is minimized. In this paper, we propose a general model for this problem, where the jobs are generated in arbitrary order and times at the mobile devices and offloaded to servers with both upload and download delays. Our goal is to minimize the total weighted response time over all the jobs. The weight is set based on how latency sensitive the job is. We derive the first online job dispatching and scheduling algorithm in edge-clouds, called OnDisc, which is scalable in the speed augmentation model;that is, OnDisc is (1 + epsilon)-speed O(1/epsilon)-competitive for any constant epsilon is an element of (0, 1). Moreover, OnDisc can be easily implemented in distributed systems. Extensive simulations on a real-world data-trace from Google show that OnDisc can reduce the total weighted response time dramatically compared with heuristic algorithms.

关键词： Servers Cloud computing Mobile handsets algorithm design and analysis Dispatching Time factors Mobile communication

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：