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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,291 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

17,627 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,762 篇 电气工程
- 2,981 篇 信息与通信工程
- 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,959 篇 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,761 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 82959 条记录，以下是661-670 订阅

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

详细简洁

排序：

Online Resource Allocation for Arbitrary User Mobility in Distributed Edge Clouds 37

Online Resource Allocation for Arbitrary User Mobility in Di...

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Wang, Lin Jiao, Lei Li, Jun Muehlhaeuser, Max Tech Univ Darmstadt Darmstadt Germany Univ Oregon Eugene OR 97403 USA

ISBN: (纸本)9781538617915

As clouds move to the network edge to facilitate mobile applications, edge cloud providers are facing new challenges on resource allocation. As users may move and resource prices may vary arbitrarily, resources in edge clouds must be allocated and adapted continuously in order to accommodate such dynamics. In this paper, we first formulate this problem with a comprehensive model that captures the key challenges, then introduce a gap-preserving transformation of the problem, and propose a novel online algorithm that optimally solves a series of subproblems with a carefully designed logarithmic objective, finally producing feasible solutions for edge cloud resource allocation over time. We further prove via rigorous analysis that our online algorithm can provide a parameterized competitive ratio, without requiring any a priori knowledge on either the resource price or the user mobility. Through extensive experiments with both real-world and synthetic data, we further confirm the effectiveness of the proposed algorithm. We show that the proposed algorithm achieves near-optimal results with an empirical competitive ratio of about 1.1, reduces the total cost by up to 4x compared to static approaches, and outperfiffms the online greedy one-shot optimizations by up to 70%.

关键词： Cloud computing Resource management Delays algorithm design and analysis Dynamic scheduling Optimization Servers

来源：评论

学校读者我要写书评

暂无评论

Investigating Grammar-based design of Multi-objective Particle Swarm Optimization algorithm 6

Investigating Grammar-based Design of Multi-objective Partic...

引用

6th Brazilian Conference on Intelligent Systems (BRACIS)

作者： Remes de Lima, Ricardo Henrique Ramirez Pozo, Aurora Trinidad Univ Fed Parana Comp Sci Dept Curitiba Parana Brazil

ISBN: (纸本)9781538624074

The importance of automatic algorithms design has been pointed out by researchers. In general, automatically designed algorithms can outperform tailored made ones. This is the case of the Particle Swarm Optimization algorithm (PSO) that has many components that can be chosen such as the velocity equation, etc. Motivated by the success reported by the automatic design of the PSO, this study investigates Multi-objective PSO (MOPSO), an extension of PSO that deals with multi-objective problems. Furthermore, this study presents a framework based on the use of a context-free grammar to guide the design of the MOPSO. The grammar allows the use of different components and parameters from various MOPSOs. Further, the framework offers two design methods: Grammatical Evolution (GE) and Iterated Race (IRACE). Likewise, a set of experiments is made to evaluate the framework using a set of Multi-objective problems, quality indicators and statistical tests. The set of experiments includes the evaluation of: two versions of the grammar, GE against IRACE and a comparison with the Speed-constrained PSO (SMPSO), a well-known multi-objective algorithm.

关键词： algorithm design and analysis Grammar Particle swarm optimization Training Genetics Production Reactive power

来源：评论

学校读者我要写书评

暂无评论

HYBRID METAHEURISTIC EXPERIMENTS OF REAL-TIME ADAPTIVE OPTIMIZATION OF PARAMETRIC SHADING design THROUGH REMOTE DATA TRANSFER

HYBRID METAHEURISTIC EXPERIMENTS OF REAL-TIME ADAPTIVE OPTIM...

引用

Winter Simulation Conference (WSC)

作者： Yi, Hwang Florida Int Univ Dept Architecture Coll Commun Architecture Arts 11200 SW 8th St Miami FL 33199 USA

ISBN: (纸本)9781538634288

The author seeks a practical approach to complement deterministic design optimization in environmental performance-based building design. This study investigates algorithms and scripted processes to test and monitor the dynamic optimal control of building components. To this end, an integration of wireless data transfer equipment (nRF24L01) and a customized metaheuristic hybrid optimization algorithm (Tabubased adaptive pattern search simulated annealing, T-APSSA) through a parametric visual programming language (VPL) interface (Rhino grasshopper (R)) is presented with experimental design of a responsive kinetic shading device. To demonstrate the performance of the algorithmic hybridization and early design integration, T-APSSA is compared to simulated annealing and pattern (direct) search, and two different approaches to daylight-optimized design solutions are tested: a deterministic optimization based on historical weather data and a site-specific adaptive optimization according to real-time monitoring of incident solar radiance. The suggestion of a seamless environmental building design workflow through remote data communication contributes to strengthening intelligent architectural design decisions.

关键词： Buildings algorithm design and analysis Simulated annealing Computer architecture Architecture Data communication

来源：评论

学校读者我要写书评

暂无评论

Serial Concatenation of Reed Muller and LDPC Codes with Low Error Floor 55

Serial Concatenation of Reed Muller and LDPC Codes with Low ...

引用

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

作者： Xiao, Xin Nasseri, Mona Vasic, Bane Lin, Shu Univ Arizona Dept Elect & Comp Engn Tucson AZ 85721 USA Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

ISBN: (纸本)9781538632666

In this paper, we propose a concatenated coding scheme involving an outer Reed-Muller (RM) code and an inner Finite Field low-density parity check (LDPC) code of medium length and high rate. It lowers the error floor of inner Finite Field LDPC code. This concatenation scheme offers flexibility in design and it is easy to implement. In addition, the decoding works in a serial turbo manner and has no harmful trapping sets of size smaller than the minimum distance of the outer code. The simulation results indicate that the proposed serial concatenation can eliminate the dominant trapping sets of the inner Finite Field LDPC code.

关键词： Decoding Generators Iterative decoding Finite element analysis Galois fields algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A comparative analysis of two methods for model predictive control of fractional-order systems 22

A comparative analysis of two methods for model predictive c...

引用

22nd International Conference on Methods and Models in Automation and Robotics (MMAR)

作者： Stanislawski, Rafal Rydel, Marek Latawiec, Krzysztof J. Lukaniszyn, Marian Galek, Marcin Opole Univ Technol Dept Elect Control & Comp Engn Ul Proszkowska 76 PL-45758 Opole Poland

ISBN: (纸本)9781538624029

The paper presents a comparative analysis of extended horizon model predictive control deployed for two various state prediction algorithms designed for discrete-time fractional-order state space systems. The first one is a finite fractional difference state predictor derived on the basis of a finite-length approximation of the fractional-order state space system. The second one is a BTA-based integer-order state space approximation of the fractional-order system. Simulation results show that second approach is more promising.

关键词： Prediction algorithms Predictive control Predictive models Aerospace electronics algorithm design and analysis Time complexity Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Noise-Blind Image Deblurring 30

Noise-Blind Image Deblurring

引用

30th IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Jin, Meiguang Roth, Stefan Favaro, Paolo Univ Bern Bern Switzerland Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781538604571

We present a novel approach to noise-blind deblurring, the problem of deblurring an image with known blur, but unknown noise level. We introduce an efficient and robust solution based on a Bayesian framework using a smooth generalization of the 0-1 loss. A novel bound allows the calculation of very high-dimensional integrals in closed form. It avoids the degeneracy of Maximum a-Posteriori (MAP) estimates and leads to an effective noise-adaptive scheme. Moreover, we drastically accelerate our algorithm by using Majorization Minimization (MM) without introducing any approximation or boundary artifacts. We further speed up convergence by turning our algorithm into a neural network termed GradNet, which is highly parallelizable and can be efficiently trained. We demonstrate that our noise-blind formulation can be integrated with different priors and significantly improves existing deblurring algorithms in the noise-blind and in the known-noise case. Furthermore, GradNet leads to state-of-the-art performance across different noise levels, while retaining high computational efficiency.

关键词： Noise level Image restoration Kernel Bayes methods Estimation Robustness algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

On the Local Structure of Stable Clustering Instances 58

On the Local Structure of Stable Clustering Instances

引用

58th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Cohen-Addad, Vincent Schwiegelshohn, Chris Univ Copenhagen Copenhagen Denmark Sapienza Univ Rome Rome Italy

ISBN: (纸本)9781538634646

We study the classic k-median and k-means clustering objectives in the beyond-worst-case scenario. We consider three well-studied notions of structured data that aim at characterizing real-world inputs: Distribution Stability (introduced by Awasthi, Blum, and Sheffet, FOCS 2010) Spectral Separability (introduced by Kumar and Kannan, FOCS 2010) Perturbation Resilience (introduced by Bilu and Linial, ICS 2010) We prove structural results showing that inputs satisfying at least one of the conditions are inherently "local". Namely, for any such input, any local optimum is close both in term of structure and in term of objective value to the global optima. As a corollary we obtain that the widely-used Local Search algorithm has strong performance guarantees for both the tasks of recovering the underlying optimal clustering and obtaining a clustering of small cost. This is a significant step toward understanding the success of local search heuristics in clustering applications.

关键词： Clustering algorithms Approximation algorithms algorithm design and analysis Stability analysis Extraterrestrial measurements Resilience

来源：评论

学校读者我要写书评

暂无评论

A Square Lattice Probability Model for Optimising the Graph Partitioning Problem

A Square Lattice Probability Model for Optimising the Graph ...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Ceberio, Josu Mendiburu, Alexander Lozano, Jose A. Univ Basque Country UPV EHU Sch Engn Bilbao Bilbao 48013 Spain Univ Basque Country UPV EHU Fac Comp Sci Donostia San Sebastian 20018 Spain BCAM Bilbao 48009 Spain

ISBN: (纸本)9781509046010

Estimation of Distribution algorithms have proved to be very competitive for solving combinatorial and continuous optimisation problems. However, there are problems for which they have not been extensively developed: we refer to constrained optimisation problems. Existing proposals approach these problems by (i) modifying the sampling strategy of the probabilistic model to allow feasible solutions or (ii) adopting general approaches used in the context of heuristic optimisation such as penalisation. Nonetheless, from a theoretical point of view, little progress have been given in the context of EDAs when developing algorithms designed specifically to solve constrained problems. In this paper, we propose developing EDAs by introducing probability models defined exclusively on the space of feasible solutions. In this sense, we give a first approach by taking the Graph Partitioning Problem (GPP) as a case of study, and present a probabilistic model defined exclusively on the feasible region of solutions: a square lattice probability model. The experiments conducted on a benchmark of 22 artificial instances confirm the effectiveness of the proposal in terms of quality of solutions and execution time.

关键词： Lattices Optimization Probabilistic logic Estimation algorithm design and analysis Context modeling Context

来源：评论

学校读者我要写书评

暂无评论

A geometric framework for statistical analysis of trajectories with distinct temporal spans 16

A geometric framework for statistical analysis of trajectori...

引用

16th IEEE International Conference on Computer Vision (ICCV)

作者： Chakraborty, Rudrasis Singh, Vikas Adluru, Nagesh Vemuri, Baba C. Univ Florida Dept CISE Gainesville FL 32611 USA Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9781538610329

Analyzing data representing multifarious trajectories is central to the many fields in Science and Engineering;for example, trajectories representing a tennis serve, a gymnast's parallel bar routine, progression/remission of disease and so on. We present a novel geometric algorithm for performing statistical analysis of trajectories with distinct number of samples representing longitudinal (or temporal) data. A key feature of our proposal is that unlike existing schemes, our model is deployable in regimes where each participant provides a different number of acquisitions (trajectories have different number of sample points or temporal span). To achieve this, we develop a novel method involving the parallel transport of the tangent vectors along each given trajectory to the starting point of the respective trajectories and then use the span of the matrix whose columns consist of these vectors, to construct a linear subspace in R-m. We then map these linear subspaces (possibly of distinct dimensions) of R-m on to a single high dimensional hypersphere. This enables computing group statistics over trajectories by instead performing statistics on the hypersphere (equipped with a simpler geometry). Given a point on the hypersphere representing a trajectory, we also provide a "reverse mapping" algorithm to uniquely (under certain assumptions) reconstruct the subspace that corresponds to this point. Finally, by using existing algorithms for recursive Frechet mean and exact principal geodesic analysis on the hypersphere, we present several experiments on synthetic and real (vision and medical) data sets showing how group testing on such diversely sampled longitudinal data is possible by analyzing the reconstructed data in the subspace spanned by the first few principal components.

关键词： Trajectory Manifolds algorithm design and analysis Geometry Statistical analysis Biomedical imaging Shape

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：